1 /* Tree lowering pass. This pass converts the GENERIC functions-as-trees
2 tree representation into the GIMPLE form.
3 Copyright (C) 2002, 2003, 2004, 2005, 2006 Free Software Foundation, Inc.
4 Major work done by Sebastian Pop <s.pop@laposte.net>,
5 Diego Novillo <dnovillo@redhat.com> and Jason Merrill <jason@redhat.com>.
7 This file is part of GCC.
9 GCC is free software; you can redistribute it and/or modify it under
10 the terms of the GNU General Public License as published by the Free
11 Software Foundation; either version 2, or (at your option) any later
14 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
15 WARRANTY; without even the implied warranty of MERCHANTABILITY or
16 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
19 You should have received a copy of the GNU General Public License
20 along with GCC; see the file COPYING. If not, write to the Free
21 Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
26 #include "coretypes.h"
31 #include "tree-gimple.h"
32 #include "tree-inline.h"
33 #include "diagnostic.h"
34 #include "langhooks.h"
35 #include "langhooks-def.h"
36 #include "tree-flow.h"
50 #include "pointer-set.h"
53 enum gimplify_omp_var_data
59 GOVD_FIRSTPRIVATE
= 16,
60 GOVD_LASTPRIVATE
= 32,
63 GOVD_DEBUG_PRIVATE
= 256,
64 GOVD_DATA_SHARE_CLASS
= (GOVD_SHARED
| GOVD_PRIVATE
| GOVD_FIRSTPRIVATE
65 | GOVD_LASTPRIVATE
| GOVD_REDUCTION
| GOVD_LOCAL
)
68 struct gimplify_omp_ctx
70 struct gimplify_omp_ctx
*outer_context
;
72 struct pointer_set_t
*privatized_types
;
74 enum omp_clause_default_kind default_kind
;
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 nonzero value, causing
408 walk_tree to return a nonzero 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 (INIT_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
)
1012 struct gimplify_omp_ctx
*ctx
= gimplify_omp_ctxp
;
1014 /* Mark variable as local. */
1015 if (ctx
&& !is_global_var (t
)
1016 && (! DECL_SEEN_IN_BIND_EXPR_P (t
)
1017 || splay_tree_lookup (ctx
->variables
,
1018 (splay_tree_key
) t
) == NULL
))
1019 omp_add_variable (gimplify_omp_ctxp
, t
, GOVD_LOCAL
| GOVD_SEEN
);
1021 DECL_SEEN_IN_BIND_EXPR_P (t
) = 1;
1024 /* Preliminarily mark non-addressed complex variables as eligible
1025 for promotion to gimple registers. We'll transform their uses
1027 if (TREE_CODE (TREE_TYPE (t
)) == COMPLEX_TYPE
1028 && !TREE_THIS_VOLATILE (t
)
1029 && (TREE_CODE (t
) == VAR_DECL
&& !DECL_HARD_REGISTER (t
))
1030 && !needs_to_live_in_memory (t
))
1031 DECL_COMPLEX_GIMPLE_REG_P (t
) = 1;
1034 gimple_push_bind_expr (bind_expr
);
1035 gimplify_ctxp
->save_stack
= false;
1037 gimplify_to_stmt_list (&BIND_EXPR_BODY (bind_expr
));
1039 if (gimplify_ctxp
->save_stack
)
1041 tree stack_save
, stack_restore
;
1043 /* Save stack on entry and restore it on exit. Add a try_finally
1044 block to achieve this. Note that mudflap depends on the
1045 format of the emitted code: see mx_register_decls(). */
1046 build_stack_save_restore (&stack_save
, &stack_restore
);
1048 t
= build2 (TRY_FINALLY_EXPR
, void_type_node
,
1049 BIND_EXPR_BODY (bind_expr
), NULL_TREE
);
1050 append_to_statement_list (stack_restore
, &TREE_OPERAND (t
, 1));
1052 BIND_EXPR_BODY (bind_expr
) = NULL_TREE
;
1053 append_to_statement_list (stack_save
, &BIND_EXPR_BODY (bind_expr
));
1054 append_to_statement_list (t
, &BIND_EXPR_BODY (bind_expr
));
1057 gimplify_ctxp
->save_stack
= old_save_stack
;
1058 gimple_pop_bind_expr ();
1063 append_to_statement_list (bind_expr
, pre_p
);
1070 /* Gimplify a RETURN_EXPR. If the expression to be returned is not a
1071 GIMPLE value, it is assigned to a new temporary and the statement is
1072 re-written to return the temporary.
1074 PRE_P points to the list where side effects that must happen before
1075 STMT should be stored. */
1077 static enum gimplify_status
1078 gimplify_return_expr (tree stmt
, tree
*pre_p
)
1080 tree ret_expr
= TREE_OPERAND (stmt
, 0);
1081 tree result_decl
, result
;
1083 if (!ret_expr
|| TREE_CODE (ret_expr
) == RESULT_DECL
1084 || ret_expr
== error_mark_node
)
1087 if (VOID_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl
))))
1088 result_decl
= NULL_TREE
;
1091 result_decl
= TREE_OPERAND (ret_expr
, 0);
1092 if (TREE_CODE (result_decl
) == INDIRECT_REF
)
1093 /* See through a return by reference. */
1094 result_decl
= TREE_OPERAND (result_decl
, 0);
1096 gcc_assert ((TREE_CODE (ret_expr
) == MODIFY_EXPR
1097 || TREE_CODE (ret_expr
) == INIT_EXPR
)
1098 && TREE_CODE (result_decl
) == RESULT_DECL
);
1101 /* If aggregate_value_p is true, then we can return the bare RESULT_DECL.
1102 Recall that aggregate_value_p is FALSE for any aggregate type that is
1103 returned in registers. If we're returning values in registers, then
1104 we don't want to extend the lifetime of the RESULT_DECL, particularly
1105 across another call. In addition, for those aggregates for which
1106 hard_function_value generates a PARALLEL, we'll die during normal
1107 expansion of structure assignments; there's special code in expand_return
1108 to handle this case that does not exist in expand_expr. */
1110 || aggregate_value_p (result_decl
, TREE_TYPE (current_function_decl
)))
1111 result
= result_decl
;
1112 else if (gimplify_ctxp
->return_temp
)
1113 result
= gimplify_ctxp
->return_temp
;
1116 result
= create_tmp_var (TREE_TYPE (result_decl
), NULL
);
1118 /* ??? With complex control flow (usually involving abnormal edges),
1119 we can wind up warning about an uninitialized value for this. Due
1120 to how this variable is constructed and initialized, this is never
1121 true. Give up and never warn. */
1122 TREE_NO_WARNING (result
) = 1;
1124 gimplify_ctxp
->return_temp
= result
;
1127 /* Smash the lhs of the MODIFY_EXPR to the temporary we plan to use.
1128 Then gimplify the whole thing. */
1129 if (result
!= result_decl
)
1130 TREE_OPERAND (ret_expr
, 0) = result
;
1132 gimplify_and_add (TREE_OPERAND (stmt
, 0), pre_p
);
1134 /* If we didn't use a temporary, then the result is just the result_decl.
1135 Otherwise we need a simple copy. This should already be gimple. */
1136 if (result
== result_decl
)
1139 ret_expr
= build2 (MODIFY_EXPR
, TREE_TYPE (result
), result_decl
, result
);
1140 TREE_OPERAND (stmt
, 0) = ret_expr
;
1145 /* Gimplifies a DECL_EXPR node *STMT_P by making any necessary allocation
1146 and initialization explicit. */
1148 static enum gimplify_status
1149 gimplify_decl_expr (tree
*stmt_p
)
1151 tree stmt
= *stmt_p
;
1152 tree decl
= DECL_EXPR_DECL (stmt
);
1154 *stmt_p
= NULL_TREE
;
1156 if (TREE_TYPE (decl
) == error_mark_node
)
1159 if ((TREE_CODE (decl
) == TYPE_DECL
1160 || TREE_CODE (decl
) == VAR_DECL
)
1161 && !TYPE_SIZES_GIMPLIFIED (TREE_TYPE (decl
)))
1162 gimplify_type_sizes (TREE_TYPE (decl
), stmt_p
);
1164 if (TREE_CODE (decl
) == VAR_DECL
&& !DECL_EXTERNAL (decl
))
1166 tree init
= DECL_INITIAL (decl
);
1168 if (!TREE_CONSTANT (DECL_SIZE (decl
)))
1170 /* This is a variable-sized decl. Simplify its size and mark it
1171 for deferred expansion. Note that mudflap depends on the format
1172 of the emitted code: see mx_register_decls(). */
1173 tree t
, args
, addr
, ptr_type
;
1175 gimplify_one_sizepos (&DECL_SIZE (decl
), stmt_p
);
1176 gimplify_one_sizepos (&DECL_SIZE_UNIT (decl
), stmt_p
);
1178 /* All occurrences of this decl in final gimplified code will be
1179 replaced by indirection. Setting DECL_VALUE_EXPR does two
1180 things: First, it lets the rest of the gimplifier know what
1181 replacement to use. Second, it lets the debug info know
1182 where to find the value. */
1183 ptr_type
= build_pointer_type (TREE_TYPE (decl
));
1184 addr
= create_tmp_var (ptr_type
, get_name (decl
));
1185 DECL_IGNORED_P (addr
) = 0;
1186 t
= build_fold_indirect_ref (addr
);
1187 SET_DECL_VALUE_EXPR (decl
, t
);
1188 DECL_HAS_VALUE_EXPR_P (decl
) = 1;
1190 args
= tree_cons (NULL
, DECL_SIZE_UNIT (decl
), NULL
);
1191 t
= built_in_decls
[BUILT_IN_ALLOCA
];
1192 t
= build_function_call_expr (t
, args
);
1193 t
= fold_convert (ptr_type
, t
);
1194 t
= build2 (MODIFY_EXPR
, void_type_node
, addr
, t
);
1196 gimplify_and_add (t
, stmt_p
);
1198 /* Indicate that we need to restore the stack level when the
1199 enclosing BIND_EXPR is exited. */
1200 gimplify_ctxp
->save_stack
= true;
1203 if (init
&& init
!= error_mark_node
)
1205 if (!TREE_STATIC (decl
))
1207 DECL_INITIAL (decl
) = NULL_TREE
;
1208 init
= build2 (INIT_EXPR
, void_type_node
, decl
, init
);
1209 gimplify_and_add (init
, stmt_p
);
1212 /* We must still examine initializers for static variables
1213 as they may contain a label address. */
1214 walk_tree (&init
, force_labels_r
, NULL
, NULL
);
1217 /* This decl isn't mentioned in the enclosing block, so add it to the
1218 list of temps. FIXME it seems a bit of a kludge to say that
1219 anonymous artificial vars aren't pushed, but everything else is. */
1220 if (DECL_ARTIFICIAL (decl
) && DECL_NAME (decl
) == NULL_TREE
)
1221 gimple_add_tmp_var (decl
);
1227 /* Gimplify a LOOP_EXPR. Normally this just involves gimplifying the body
1228 and replacing the LOOP_EXPR with goto, but if the loop contains an
1229 EXIT_EXPR, we need to append a label for it to jump to. */
1231 static enum gimplify_status
1232 gimplify_loop_expr (tree
*expr_p
, tree
*pre_p
)
1234 tree saved_label
= gimplify_ctxp
->exit_label
;
1235 tree start_label
= build1 (LABEL_EXPR
, void_type_node
, NULL_TREE
);
1236 tree jump_stmt
= build_and_jump (&LABEL_EXPR_LABEL (start_label
));
1238 append_to_statement_list (start_label
, pre_p
);
1240 gimplify_ctxp
->exit_label
= NULL_TREE
;
1242 gimplify_and_add (LOOP_EXPR_BODY (*expr_p
), pre_p
);
1244 if (gimplify_ctxp
->exit_label
)
1246 append_to_statement_list (jump_stmt
, pre_p
);
1247 *expr_p
= build1 (LABEL_EXPR
, void_type_node
, gimplify_ctxp
->exit_label
);
1250 *expr_p
= jump_stmt
;
1252 gimplify_ctxp
->exit_label
= saved_label
;
1257 /* Compare two case labels. Because the front end should already have
1258 made sure that case ranges do not overlap, it is enough to only compare
1259 the CASE_LOW values of each case label. */
1262 compare_case_labels (const void *p1
, const void *p2
)
1264 tree case1
= *(tree
*)p1
;
1265 tree case2
= *(tree
*)p2
;
1267 return tree_int_cst_compare (CASE_LOW (case1
), CASE_LOW (case2
));
1270 /* Sort the case labels in LABEL_VEC in place in ascending order. */
1273 sort_case_labels (tree label_vec
)
1275 size_t len
= TREE_VEC_LENGTH (label_vec
);
1276 tree default_case
= TREE_VEC_ELT (label_vec
, len
- 1);
1278 if (CASE_LOW (default_case
))
1282 /* The last label in the vector should be the default case
1284 for (i
= 0; i
< len
; ++i
)
1286 tree t
= TREE_VEC_ELT (label_vec
, i
);
1290 TREE_VEC_ELT (label_vec
, i
) = TREE_VEC_ELT (label_vec
, len
- 1);
1291 TREE_VEC_ELT (label_vec
, len
- 1) = default_case
;
1297 qsort (&TREE_VEC_ELT (label_vec
, 0), len
- 1, sizeof (tree
),
1298 compare_case_labels
);
1301 /* Gimplify a SWITCH_EXPR, and collect a TREE_VEC of the labels it can
1304 static enum gimplify_status
1305 gimplify_switch_expr (tree
*expr_p
, tree
*pre_p
)
1307 tree switch_expr
= *expr_p
;
1308 enum gimplify_status ret
;
1310 ret
= gimplify_expr (&SWITCH_COND (switch_expr
), pre_p
, NULL
,
1311 is_gimple_val
, fb_rvalue
);
1313 if (SWITCH_BODY (switch_expr
))
1315 VEC(tree
,heap
) *labels
, *saved_labels
;
1316 tree label_vec
, default_case
= NULL_TREE
;
1319 /* If someone can be bothered to fill in the labels, they can
1320 be bothered to null out the body too. */
1321 gcc_assert (!SWITCH_LABELS (switch_expr
));
1323 saved_labels
= gimplify_ctxp
->case_labels
;
1324 gimplify_ctxp
->case_labels
= VEC_alloc (tree
, heap
, 8);
1326 gimplify_to_stmt_list (&SWITCH_BODY (switch_expr
));
1328 labels
= gimplify_ctxp
->case_labels
;
1329 gimplify_ctxp
->case_labels
= saved_labels
;
1332 while (i
< VEC_length (tree
, labels
))
1334 tree elt
= VEC_index (tree
, labels
, i
);
1335 tree low
= CASE_LOW (elt
);
1336 bool remove_element
= FALSE
;
1340 /* Discard empty ranges. */
1341 tree high
= CASE_HIGH (elt
);
1342 if (high
&& INT_CST_LT (high
, low
))
1343 remove_element
= TRUE
;
1347 /* The default case must be the last label in the list. */
1348 gcc_assert (!default_case
);
1350 remove_element
= TRUE
;
1354 VEC_ordered_remove (tree
, labels
, i
);
1360 label_vec
= make_tree_vec (len
+ 1);
1361 SWITCH_LABELS (*expr_p
) = label_vec
;
1362 append_to_statement_list (switch_expr
, pre_p
);
1366 /* If the switch has no default label, add one, so that we jump
1367 around the switch body. */
1368 default_case
= build3 (CASE_LABEL_EXPR
, void_type_node
, NULL_TREE
,
1369 NULL_TREE
, create_artificial_label ());
1370 append_to_statement_list (SWITCH_BODY (switch_expr
), pre_p
);
1371 *expr_p
= build1 (LABEL_EXPR
, void_type_node
,
1372 CASE_LABEL (default_case
));
1375 *expr_p
= SWITCH_BODY (switch_expr
);
1377 for (i
= 0; i
< len
; ++i
)
1378 TREE_VEC_ELT (label_vec
, i
) = VEC_index (tree
, labels
, i
);
1379 TREE_VEC_ELT (label_vec
, len
) = default_case
;
1381 VEC_free (tree
, heap
, labels
);
1383 sort_case_labels (label_vec
);
1385 SWITCH_BODY (switch_expr
) = NULL
;
1388 gcc_assert (SWITCH_LABELS (switch_expr
));
1393 static enum gimplify_status
1394 gimplify_case_label_expr (tree
*expr_p
)
1396 tree expr
= *expr_p
;
1397 struct gimplify_ctx
*ctxp
;
1399 /* Invalid OpenMP programs can play Duff's Device type games with
1400 #pragma omp parallel. At least in the C front end, we don't
1401 detect such invalid branches until after gimplification. */
1402 for (ctxp
= gimplify_ctxp
; ; ctxp
= ctxp
->prev_context
)
1403 if (ctxp
->case_labels
)
1406 VEC_safe_push (tree
, heap
, ctxp
->case_labels
, expr
);
1407 *expr_p
= build1 (LABEL_EXPR
, void_type_node
, CASE_LABEL (expr
));
1411 /* Build a GOTO to the LABEL_DECL pointed to by LABEL_P, building it first
1415 build_and_jump (tree
*label_p
)
1417 if (label_p
== NULL
)
1418 /* If there's nowhere to jump, just fall through. */
1421 if (*label_p
== NULL_TREE
)
1423 tree label
= create_artificial_label ();
1427 return build1 (GOTO_EXPR
, void_type_node
, *label_p
);
1430 /* Gimplify an EXIT_EXPR by converting to a GOTO_EXPR inside a COND_EXPR.
1431 This also involves building a label to jump to and communicating it to
1432 gimplify_loop_expr through gimplify_ctxp->exit_label. */
1434 static enum gimplify_status
1435 gimplify_exit_expr (tree
*expr_p
)
1437 tree cond
= TREE_OPERAND (*expr_p
, 0);
1440 expr
= build_and_jump (&gimplify_ctxp
->exit_label
);
1441 expr
= build3 (COND_EXPR
, void_type_node
, cond
, expr
, NULL_TREE
);
1447 /* A helper function to be called via walk_tree. Mark all labels under *TP
1448 as being forced. To be called for DECL_INITIAL of static variables. */
1451 force_labels_r (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
1455 if (TREE_CODE (*tp
) == LABEL_DECL
)
1456 FORCED_LABEL (*tp
) = 1;
1461 /* *EXPR_P is a COMPONENT_REF being used as an rvalue. If its type is
1462 different from its canonical type, wrap the whole thing inside a
1463 NOP_EXPR and force the type of the COMPONENT_REF to be the canonical
1466 The canonical type of a COMPONENT_REF is the type of the field being
1467 referenced--unless the field is a bit-field which can be read directly
1468 in a smaller mode, in which case the canonical type is the
1469 sign-appropriate type corresponding to that mode. */
1472 canonicalize_component_ref (tree
*expr_p
)
1474 tree expr
= *expr_p
;
1477 gcc_assert (TREE_CODE (expr
) == COMPONENT_REF
);
1479 if (INTEGRAL_TYPE_P (TREE_TYPE (expr
)))
1480 type
= TREE_TYPE (get_unwidened (expr
, NULL_TREE
));
1482 type
= TREE_TYPE (TREE_OPERAND (expr
, 1));
1484 if (TREE_TYPE (expr
) != type
)
1486 tree old_type
= TREE_TYPE (expr
);
1488 /* Set the type of the COMPONENT_REF to the underlying type. */
1489 TREE_TYPE (expr
) = type
;
1491 /* And wrap the whole thing inside a NOP_EXPR. */
1492 expr
= build1 (NOP_EXPR
, old_type
, expr
);
1498 /* If a NOP conversion is changing a pointer to array of foo to a pointer
1499 to foo, embed that change in the ADDR_EXPR by converting
1504 where L is the lower bound. For simplicity, only do this for constant
1508 canonicalize_addr_expr (tree
*expr_p
)
1510 tree expr
= *expr_p
;
1511 tree ctype
= TREE_TYPE (expr
);
1512 tree addr_expr
= TREE_OPERAND (expr
, 0);
1513 tree atype
= TREE_TYPE (addr_expr
);
1514 tree dctype
, datype
, ddatype
, otype
, obj_expr
;
1516 /* Both cast and addr_expr types should be pointers. */
1517 if (!POINTER_TYPE_P (ctype
) || !POINTER_TYPE_P (atype
))
1520 /* The addr_expr type should be a pointer to an array. */
1521 datype
= TREE_TYPE (atype
);
1522 if (TREE_CODE (datype
) != ARRAY_TYPE
)
1525 /* Both cast and addr_expr types should address the same object type. */
1526 dctype
= TREE_TYPE (ctype
);
1527 ddatype
= TREE_TYPE (datype
);
1528 if (!lang_hooks
.types_compatible_p (ddatype
, dctype
))
1531 /* The addr_expr and the object type should match. */
1532 obj_expr
= TREE_OPERAND (addr_expr
, 0);
1533 otype
= TREE_TYPE (obj_expr
);
1534 if (!lang_hooks
.types_compatible_p (otype
, datype
))
1537 /* The lower bound and element sizes must be constant. */
1538 if (!TYPE_SIZE_UNIT (dctype
)
1539 || TREE_CODE (TYPE_SIZE_UNIT (dctype
)) != INTEGER_CST
1540 || !TYPE_DOMAIN (datype
) || !TYPE_MIN_VALUE (TYPE_DOMAIN (datype
))
1541 || TREE_CODE (TYPE_MIN_VALUE (TYPE_DOMAIN (datype
))) != INTEGER_CST
)
1544 /* All checks succeeded. Build a new node to merge the cast. */
1545 *expr_p
= build4 (ARRAY_REF
, dctype
, obj_expr
,
1546 TYPE_MIN_VALUE (TYPE_DOMAIN (datype
)),
1547 TYPE_MIN_VALUE (TYPE_DOMAIN (datype
)),
1548 size_binop (EXACT_DIV_EXPR
, TYPE_SIZE_UNIT (dctype
),
1549 size_int (TYPE_ALIGN_UNIT (dctype
))));
1550 *expr_p
= build1 (ADDR_EXPR
, ctype
, *expr_p
);
1553 /* *EXPR_P is a NOP_EXPR or CONVERT_EXPR. Remove it and/or other conversions
1554 underneath as appropriate. */
1556 static enum gimplify_status
1557 gimplify_conversion (tree
*expr_p
)
1559 gcc_assert (TREE_CODE (*expr_p
) == NOP_EXPR
1560 || TREE_CODE (*expr_p
) == CONVERT_EXPR
);
1562 /* Then strip away all but the outermost conversion. */
1563 STRIP_SIGN_NOPS (TREE_OPERAND (*expr_p
, 0));
1565 /* And remove the outermost conversion if it's useless. */
1566 if (tree_ssa_useless_type_conversion (*expr_p
))
1567 *expr_p
= TREE_OPERAND (*expr_p
, 0);
1569 /* If we still have a conversion at the toplevel,
1570 then canonicalize some constructs. */
1571 if (TREE_CODE (*expr_p
) == NOP_EXPR
|| TREE_CODE (*expr_p
) == CONVERT_EXPR
)
1573 tree sub
= TREE_OPERAND (*expr_p
, 0);
1575 /* If a NOP conversion is changing the type of a COMPONENT_REF
1576 expression, then canonicalize its type now in order to expose more
1577 redundant conversions. */
1578 if (TREE_CODE (sub
) == COMPONENT_REF
)
1579 canonicalize_component_ref (&TREE_OPERAND (*expr_p
, 0));
1581 /* If a NOP conversion is changing a pointer to array of foo
1582 to a pointer to foo, embed that change in the ADDR_EXPR. */
1583 else if (TREE_CODE (sub
) == ADDR_EXPR
)
1584 canonicalize_addr_expr (expr_p
);
1590 /* Gimplify a VAR_DECL or PARM_DECL. Returns GS_OK if we expanded a
1591 DECL_VALUE_EXPR, and it's worth re-examining things. */
1593 static enum gimplify_status
1594 gimplify_var_or_parm_decl (tree
*expr_p
)
1596 tree decl
= *expr_p
;
1598 /* ??? If this is a local variable, and it has not been seen in any
1599 outer BIND_EXPR, then it's probably the result of a duplicate
1600 declaration, for which we've already issued an error. It would
1601 be really nice if the front end wouldn't leak these at all.
1602 Currently the only known culprit is C++ destructors, as seen
1603 in g++.old-deja/g++.jason/binding.C. */
1604 if (TREE_CODE (decl
) == VAR_DECL
1605 && !DECL_SEEN_IN_BIND_EXPR_P (decl
)
1606 && !TREE_STATIC (decl
) && !DECL_EXTERNAL (decl
)
1607 && decl_function_context (decl
) == current_function_decl
)
1609 gcc_assert (errorcount
|| sorrycount
);
1613 /* When within an OpenMP context, notice uses of variables. */
1614 if (gimplify_omp_ctxp
&& omp_notice_variable (gimplify_omp_ctxp
, decl
, true))
1617 /* If the decl is an alias for another expression, substitute it now. */
1618 if (DECL_HAS_VALUE_EXPR_P (decl
))
1620 *expr_p
= unshare_expr (DECL_VALUE_EXPR (decl
));
1628 /* Gimplify the COMPONENT_REF, ARRAY_REF, REALPART_EXPR or IMAGPART_EXPR
1629 node pointed to by EXPR_P.
1632 : min_lval '[' val ']'
1634 | compound_lval '[' val ']'
1635 | compound_lval '.' ID
1637 This is not part of the original SIMPLE definition, which separates
1638 array and member references, but it seems reasonable to handle them
1639 together. Also, this way we don't run into problems with union
1640 aliasing; gcc requires that for accesses through a union to alias, the
1641 union reference must be explicit, which was not always the case when we
1642 were splitting up array and member refs.
1644 PRE_P points to the list where side effects that must happen before
1645 *EXPR_P should be stored.
1647 POST_P points to the list where side effects that must happen after
1648 *EXPR_P should be stored. */
1650 static enum gimplify_status
1651 gimplify_compound_lval (tree
*expr_p
, tree
*pre_p
,
1652 tree
*post_p
, fallback_t fallback
)
1655 VEC(tree
,heap
) *stack
;
1656 enum gimplify_status ret
= GS_OK
, tret
;
1659 /* Create a stack of the subexpressions so later we can walk them in
1660 order from inner to outer. */
1661 stack
= VEC_alloc (tree
, heap
, 10);
1663 /* We can handle anything that get_inner_reference can deal with. */
1664 for (p
= expr_p
; ; p
= &TREE_OPERAND (*p
, 0))
1667 /* Fold INDIRECT_REFs now to turn them into ARRAY_REFs. */
1668 if (TREE_CODE (*p
) == INDIRECT_REF
)
1669 *p
= fold_indirect_ref (*p
);
1671 if (handled_component_p (*p
))
1673 /* Expand DECL_VALUE_EXPR now. In some cases that may expose
1674 additional COMPONENT_REFs. */
1675 else if ((TREE_CODE (*p
) == VAR_DECL
|| TREE_CODE (*p
) == PARM_DECL
)
1676 && gimplify_var_or_parm_decl (p
) == GS_OK
)
1681 VEC_safe_push (tree
, heap
, stack
, *p
);
1684 gcc_assert (VEC_length (tree
, stack
));
1686 /* Now STACK is a stack of pointers to all the refs we've walked through
1687 and P points to the innermost expression.
1689 Java requires that we elaborated nodes in source order. That
1690 means we must gimplify the inner expression followed by each of
1691 the indices, in order. But we can't gimplify the inner
1692 expression until we deal with any variable bounds, sizes, or
1693 positions in order to deal with PLACEHOLDER_EXPRs.
1695 So we do this in three steps. First we deal with the annotations
1696 for any variables in the components, then we gimplify the base,
1697 then we gimplify any indices, from left to right. */
1698 for (i
= VEC_length (tree
, stack
) - 1; i
>= 0; i
--)
1700 tree t
= VEC_index (tree
, stack
, i
);
1702 if (TREE_CODE (t
) == ARRAY_REF
|| TREE_CODE (t
) == ARRAY_RANGE_REF
)
1704 /* Gimplify the low bound and element type size and put them into
1705 the ARRAY_REF. If these values are set, they have already been
1707 if (!TREE_OPERAND (t
, 2))
1709 tree low
= unshare_expr (array_ref_low_bound (t
));
1710 if (!is_gimple_min_invariant (low
))
1712 TREE_OPERAND (t
, 2) = low
;
1713 tret
= gimplify_expr (&TREE_OPERAND (t
, 2), pre_p
, post_p
,
1714 is_gimple_formal_tmp_reg
, fb_rvalue
);
1715 ret
= MIN (ret
, tret
);
1719 if (!TREE_OPERAND (t
, 3))
1721 tree elmt_type
= TREE_TYPE (TREE_TYPE (TREE_OPERAND (t
, 0)));
1722 tree elmt_size
= unshare_expr (array_ref_element_size (t
));
1723 tree factor
= size_int (TYPE_ALIGN_UNIT (elmt_type
));
1725 /* Divide the element size by the alignment of the element
1727 elmt_size
= size_binop (EXACT_DIV_EXPR
, elmt_size
, factor
);
1729 if (!is_gimple_min_invariant (elmt_size
))
1731 TREE_OPERAND (t
, 3) = elmt_size
;
1732 tret
= gimplify_expr (&TREE_OPERAND (t
, 3), pre_p
, post_p
,
1733 is_gimple_formal_tmp_reg
, fb_rvalue
);
1734 ret
= MIN (ret
, tret
);
1738 else if (TREE_CODE (t
) == COMPONENT_REF
)
1740 /* Set the field offset into T and gimplify it. */
1741 if (!TREE_OPERAND (t
, 2))
1743 tree offset
= unshare_expr (component_ref_field_offset (t
));
1744 tree field
= TREE_OPERAND (t
, 1);
1746 = size_int (DECL_OFFSET_ALIGN (field
) / BITS_PER_UNIT
);
1748 /* Divide the offset by its alignment. */
1749 offset
= size_binop (EXACT_DIV_EXPR
, offset
, factor
);
1751 if (!is_gimple_min_invariant (offset
))
1753 TREE_OPERAND (t
, 2) = offset
;
1754 tret
= gimplify_expr (&TREE_OPERAND (t
, 2), pre_p
, post_p
,
1755 is_gimple_formal_tmp_reg
, fb_rvalue
);
1756 ret
= MIN (ret
, tret
);
1762 /* Step 2 is to gimplify the base expression. Make sure lvalue is set
1763 so as to match the min_lval predicate. Failure to do so may result
1764 in the creation of large aggregate temporaries. */
1765 tret
= gimplify_expr (p
, pre_p
, post_p
, is_gimple_min_lval
,
1766 fallback
| fb_lvalue
);
1767 ret
= MIN (ret
, tret
);
1769 /* And finally, the indices and operands to BIT_FIELD_REF. During this
1770 loop we also remove any useless conversions. */
1771 for (; VEC_length (tree
, stack
) > 0; )
1773 tree t
= VEC_pop (tree
, stack
);
1775 if (TREE_CODE (t
) == ARRAY_REF
|| TREE_CODE (t
) == ARRAY_RANGE_REF
)
1777 /* Gimplify the dimension.
1778 Temporary fix for gcc.c-torture/execute/20040313-1.c.
1779 Gimplify non-constant array indices into a temporary
1781 FIXME - The real fix is to gimplify post-modify
1782 expressions into a minimal gimple lvalue. However, that
1783 exposes bugs in alias analysis. The alias analyzer does
1784 not handle &PTR->FIELD very well. Will fix after the
1785 branch is merged into mainline (dnovillo 2004-05-03). */
1786 if (!is_gimple_min_invariant (TREE_OPERAND (t
, 1)))
1788 tret
= gimplify_expr (&TREE_OPERAND (t
, 1), pre_p
, post_p
,
1789 is_gimple_formal_tmp_reg
, fb_rvalue
);
1790 ret
= MIN (ret
, tret
);
1793 else if (TREE_CODE (t
) == BIT_FIELD_REF
)
1795 tret
= gimplify_expr (&TREE_OPERAND (t
, 1), pre_p
, post_p
,
1796 is_gimple_val
, fb_rvalue
);
1797 ret
= MIN (ret
, tret
);
1798 tret
= gimplify_expr (&TREE_OPERAND (t
, 2), pre_p
, post_p
,
1799 is_gimple_val
, fb_rvalue
);
1800 ret
= MIN (ret
, tret
);
1803 STRIP_USELESS_TYPE_CONVERSION (TREE_OPERAND (t
, 0));
1805 /* The innermost expression P may have originally had TREE_SIDE_EFFECTS
1806 set which would have caused all the outer expressions in EXPR_P
1807 leading to P to also have had TREE_SIDE_EFFECTS set. */
1808 recalculate_side_effects (t
);
1811 tret
= gimplify_expr (p
, pre_p
, post_p
, is_gimple_min_lval
, fallback
);
1812 ret
= MIN (ret
, tret
);
1814 /* If the outermost expression is a COMPONENT_REF, canonicalize its type. */
1815 if ((fallback
& fb_rvalue
) && TREE_CODE (*expr_p
) == COMPONENT_REF
)
1817 canonicalize_component_ref (expr_p
);
1818 ret
= MIN (ret
, GS_OK
);
1821 VEC_free (tree
, heap
, stack
);
1826 /* Gimplify the self modifying expression pointed to by EXPR_P
1829 PRE_P points to the list where side effects that must happen before
1830 *EXPR_P should be stored.
1832 POST_P points to the list where side effects that must happen after
1833 *EXPR_P should be stored.
1835 WANT_VALUE is nonzero iff we want to use the value of this expression
1836 in another expression. */
1838 static enum gimplify_status
1839 gimplify_self_mod_expr (tree
*expr_p
, tree
*pre_p
, tree
*post_p
,
1842 enum tree_code code
;
1843 tree lhs
, lvalue
, rhs
, t1
;
1845 enum tree_code arith_code
;
1846 enum gimplify_status ret
;
1848 code
= TREE_CODE (*expr_p
);
1850 gcc_assert (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
1851 || code
== PREINCREMENT_EXPR
|| code
== PREDECREMENT_EXPR
);
1853 /* Prefix or postfix? */
1854 if (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
)
1855 /* Faster to treat as prefix if result is not used. */
1856 postfix
= want_value
;
1860 /* Add or subtract? */
1861 if (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
1862 arith_code
= PLUS_EXPR
;
1864 arith_code
= MINUS_EXPR
;
1866 /* Gimplify the LHS into a GIMPLE lvalue. */
1867 lvalue
= TREE_OPERAND (*expr_p
, 0);
1868 ret
= gimplify_expr (&lvalue
, pre_p
, post_p
, is_gimple_lvalue
, fb_lvalue
);
1869 if (ret
== GS_ERROR
)
1872 /* Extract the operands to the arithmetic operation. */
1874 rhs
= TREE_OPERAND (*expr_p
, 1);
1876 /* For postfix operator, we evaluate the LHS to an rvalue and then use
1877 that as the result value and in the postqueue operation. */
1880 ret
= gimplify_expr (&lhs
, pre_p
, post_p
, is_gimple_val
, fb_rvalue
);
1881 if (ret
== GS_ERROR
)
1885 t1
= build2 (arith_code
, TREE_TYPE (*expr_p
), lhs
, rhs
);
1886 t1
= build2 (MODIFY_EXPR
, TREE_TYPE (lvalue
), lvalue
, t1
);
1890 gimplify_and_add (t1
, post_p
);
1901 /* If *EXPR_P has a variable sized type, wrap it in a WITH_SIZE_EXPR. */
1904 maybe_with_size_expr (tree
*expr_p
)
1906 tree expr
= *expr_p
;
1907 tree type
= TREE_TYPE (expr
);
1910 /* If we've already wrapped this or the type is error_mark_node, we can't do
1912 if (TREE_CODE (expr
) == WITH_SIZE_EXPR
1913 || type
== error_mark_node
)
1916 /* If the size isn't known or is a constant, we have nothing to do. */
1917 size
= TYPE_SIZE_UNIT (type
);
1918 if (!size
|| TREE_CODE (size
) == INTEGER_CST
)
1921 /* Otherwise, make a WITH_SIZE_EXPR. */
1922 size
= unshare_expr (size
);
1923 size
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (size
, expr
);
1924 *expr_p
= build2 (WITH_SIZE_EXPR
, type
, expr
, size
);
1927 /* Subroutine of gimplify_call_expr: Gimplify a single argument. */
1929 static enum gimplify_status
1930 gimplify_arg (tree
*expr_p
, tree
*pre_p
)
1932 bool (*test
) (tree
);
1935 /* In general, we allow lvalues for function arguments to avoid
1936 extra overhead of copying large aggregates out of even larger
1937 aggregates into temporaries only to copy the temporaries to
1938 the argument list. Make optimizers happy by pulling out to
1939 temporaries those types that fit in registers. */
1940 if (is_gimple_reg_type (TREE_TYPE (*expr_p
)))
1941 test
= is_gimple_val
, fb
= fb_rvalue
;
1943 test
= is_gimple_lvalue
, fb
= fb_either
;
1945 /* If this is a variable sized type, we must remember the size. */
1946 maybe_with_size_expr (expr_p
);
1948 /* There is a sequence point before a function call. Side effects in
1949 the argument list must occur before the actual call. So, when
1950 gimplifying arguments, force gimplify_expr to use an internal
1951 post queue which is then appended to the end of PRE_P. */
1952 return gimplify_expr (expr_p
, pre_p
, NULL
, test
, fb
);
1955 /* Gimplify the CALL_EXPR node pointed to by EXPR_P. PRE_P points to the
1956 list where side effects that must happen before *EXPR_P should be stored.
1957 WANT_VALUE is true if the result of the call is desired. */
1959 static enum gimplify_status
1960 gimplify_call_expr (tree
*expr_p
, tree
*pre_p
, bool want_value
)
1964 enum gimplify_status ret
;
1966 gcc_assert (TREE_CODE (*expr_p
) == CALL_EXPR
);
1968 /* For reliable diagnostics during inlining, it is necessary that
1969 every call_expr be annotated with file and line. */
1970 if (! EXPR_HAS_LOCATION (*expr_p
))
1971 SET_EXPR_LOCATION (*expr_p
, input_location
);
1973 /* This may be a call to a builtin function.
1975 Builtin function calls may be transformed into different
1976 (and more efficient) builtin function calls under certain
1977 circumstances. Unfortunately, gimplification can muck things
1978 up enough that the builtin expanders are not aware that certain
1979 transformations are still valid.
1981 So we attempt transformation/gimplification of the call before
1982 we gimplify the CALL_EXPR. At this time we do not manage to
1983 transform all calls in the same manner as the expanders do, but
1984 we do transform most of them. */
1985 decl
= get_callee_fndecl (*expr_p
);
1986 if (decl
&& DECL_BUILT_IN (decl
))
1988 tree arglist
= TREE_OPERAND (*expr_p
, 1);
1989 tree
new = fold_builtin (decl
, arglist
, !want_value
);
1991 if (new && new != *expr_p
)
1993 /* There was a transformation of this call which computes the
1994 same value, but in a more efficient way. Return and try
2000 if (DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
2001 && DECL_FUNCTION_CODE (decl
) == BUILT_IN_VA_START
)
2003 if (!arglist
|| !TREE_CHAIN (arglist
))
2005 error ("too few arguments to function %<va_start%>");
2006 *expr_p
= build_empty_stmt ();
2010 if (fold_builtin_next_arg (TREE_CHAIN (arglist
)))
2012 *expr_p
= build_empty_stmt ();
2015 /* Avoid gimplifying the second argument to va_start, which needs
2016 to be the plain PARM_DECL. */
2017 return gimplify_arg (&TREE_VALUE (TREE_OPERAND (*expr_p
, 1)), pre_p
);
2021 /* There is a sequence point before the call, so any side effects in
2022 the calling expression must occur before the actual call. Force
2023 gimplify_expr to use an internal post queue. */
2024 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, NULL
,
2025 is_gimple_call_addr
, fb_rvalue
);
2027 if (PUSH_ARGS_REVERSED
)
2028 TREE_OPERAND (*expr_p
, 1) = nreverse (TREE_OPERAND (*expr_p
, 1));
2029 for (arglist
= TREE_OPERAND (*expr_p
, 1); arglist
;
2030 arglist
= TREE_CHAIN (arglist
))
2032 enum gimplify_status t
;
2034 t
= gimplify_arg (&TREE_VALUE (arglist
), pre_p
);
2039 if (PUSH_ARGS_REVERSED
)
2040 TREE_OPERAND (*expr_p
, 1) = nreverse (TREE_OPERAND (*expr_p
, 1));
2042 /* Try this again in case gimplification exposed something. */
2043 if (ret
!= GS_ERROR
)
2045 decl
= get_callee_fndecl (*expr_p
);
2046 if (decl
&& DECL_BUILT_IN (decl
))
2048 tree arglist
= TREE_OPERAND (*expr_p
, 1);
2049 tree
new = fold_builtin (decl
, arglist
, !want_value
);
2051 if (new && new != *expr_p
)
2053 /* There was a transformation of this call which computes the
2054 same value, but in a more efficient way. Return and try
2062 /* If the function is "const" or "pure", then clear TREE_SIDE_EFFECTS on its
2063 decl. This allows us to eliminate redundant or useless
2064 calls to "const" functions. */
2065 if (TREE_CODE (*expr_p
) == CALL_EXPR
2066 && (call_expr_flags (*expr_p
) & (ECF_CONST
| ECF_PURE
)))
2067 TREE_SIDE_EFFECTS (*expr_p
) = 0;
2072 /* Handle shortcut semantics in the predicate operand of a COND_EXPR by
2073 rewriting it into multiple COND_EXPRs, and possibly GOTO_EXPRs.
2075 TRUE_LABEL_P and FALSE_LABEL_P point to the labels to jump to if the
2076 condition is true or false, respectively. If null, we should generate
2077 our own to skip over the evaluation of this specific expression.
2079 This function is the tree equivalent of do_jump.
2081 shortcut_cond_r should only be called by shortcut_cond_expr. */
2084 shortcut_cond_r (tree pred
, tree
*true_label_p
, tree
*false_label_p
)
2086 tree local_label
= NULL_TREE
;
2087 tree t
, expr
= NULL
;
2089 /* OK, it's not a simple case; we need to pull apart the COND_EXPR to
2090 retain the shortcut semantics. Just insert the gotos here;
2091 shortcut_cond_expr will append the real blocks later. */
2092 if (TREE_CODE (pred
) == TRUTH_ANDIF_EXPR
)
2094 /* Turn if (a && b) into
2096 if (a); else goto no;
2097 if (b) goto yes; else goto no;
2100 if (false_label_p
== NULL
)
2101 false_label_p
= &local_label
;
2103 t
= shortcut_cond_r (TREE_OPERAND (pred
, 0), NULL
, false_label_p
);
2104 append_to_statement_list (t
, &expr
);
2106 t
= shortcut_cond_r (TREE_OPERAND (pred
, 1), true_label_p
,
2108 append_to_statement_list (t
, &expr
);
2110 else if (TREE_CODE (pred
) == TRUTH_ORIF_EXPR
)
2112 /* Turn if (a || b) into
2115 if (b) goto yes; else goto no;
2118 if (true_label_p
== NULL
)
2119 true_label_p
= &local_label
;
2121 t
= shortcut_cond_r (TREE_OPERAND (pred
, 0), true_label_p
, NULL
);
2122 append_to_statement_list (t
, &expr
);
2124 t
= shortcut_cond_r (TREE_OPERAND (pred
, 1), true_label_p
,
2126 append_to_statement_list (t
, &expr
);
2128 else if (TREE_CODE (pred
) == COND_EXPR
)
2130 /* As long as we're messing with gotos, turn if (a ? b : c) into
2132 if (b) goto yes; else goto no;
2134 if (c) goto yes; else goto no; */
2135 expr
= build3 (COND_EXPR
, void_type_node
, TREE_OPERAND (pred
, 0),
2136 shortcut_cond_r (TREE_OPERAND (pred
, 1), true_label_p
,
2138 shortcut_cond_r (TREE_OPERAND (pred
, 2), true_label_p
,
2143 expr
= build3 (COND_EXPR
, void_type_node
, pred
,
2144 build_and_jump (true_label_p
),
2145 build_and_jump (false_label_p
));
2150 t
= build1 (LABEL_EXPR
, void_type_node
, local_label
);
2151 append_to_statement_list (t
, &expr
);
2158 shortcut_cond_expr (tree expr
)
2160 tree pred
= TREE_OPERAND (expr
, 0);
2161 tree then_
= TREE_OPERAND (expr
, 1);
2162 tree else_
= TREE_OPERAND (expr
, 2);
2163 tree true_label
, false_label
, end_label
, t
;
2165 tree
*false_label_p
;
2166 bool emit_end
, emit_false
, jump_over_else
;
2167 bool then_se
= then_
&& TREE_SIDE_EFFECTS (then_
);
2168 bool else_se
= else_
&& TREE_SIDE_EFFECTS (else_
);
2170 /* First do simple transformations. */
2173 /* If there is no 'else', turn (a && b) into if (a) if (b). */
2174 while (TREE_CODE (pred
) == TRUTH_ANDIF_EXPR
)
2176 TREE_OPERAND (expr
, 0) = TREE_OPERAND (pred
, 1);
2177 then_
= shortcut_cond_expr (expr
);
2178 then_se
= then_
&& TREE_SIDE_EFFECTS (then_
);
2179 pred
= TREE_OPERAND (pred
, 0);
2180 expr
= build3 (COND_EXPR
, void_type_node
, pred
, then_
, NULL_TREE
);
2185 /* If there is no 'then', turn
2188 if (a); else if (b); else d. */
2189 while (TREE_CODE (pred
) == TRUTH_ORIF_EXPR
)
2191 TREE_OPERAND (expr
, 0) = TREE_OPERAND (pred
, 1);
2192 else_
= shortcut_cond_expr (expr
);
2193 else_se
= else_
&& TREE_SIDE_EFFECTS (else_
);
2194 pred
= TREE_OPERAND (pred
, 0);
2195 expr
= build3 (COND_EXPR
, void_type_node
, pred
, NULL_TREE
, else_
);
2199 /* If we're done, great. */
2200 if (TREE_CODE (pred
) != TRUTH_ANDIF_EXPR
2201 && TREE_CODE (pred
) != TRUTH_ORIF_EXPR
)
2204 /* Otherwise we need to mess with gotos. Change
2207 if (a); else goto no;
2210 and recursively gimplify the condition. */
2212 true_label
= false_label
= end_label
= NULL_TREE
;
2214 /* If our arms just jump somewhere, hijack those labels so we don't
2215 generate jumps to jumps. */
2218 && TREE_CODE (then_
) == GOTO_EXPR
2219 && TREE_CODE (GOTO_DESTINATION (then_
)) == LABEL_DECL
)
2221 true_label
= GOTO_DESTINATION (then_
);
2227 && TREE_CODE (else_
) == GOTO_EXPR
2228 && TREE_CODE (GOTO_DESTINATION (else_
)) == LABEL_DECL
)
2230 false_label
= GOTO_DESTINATION (else_
);
2235 /* If we aren't hijacking a label for the 'then' branch, it falls through. */
2237 true_label_p
= &true_label
;
2239 true_label_p
= NULL
;
2241 /* The 'else' branch also needs a label if it contains interesting code. */
2242 if (false_label
|| else_se
)
2243 false_label_p
= &false_label
;
2245 false_label_p
= NULL
;
2247 /* If there was nothing else in our arms, just forward the label(s). */
2248 if (!then_se
&& !else_se
)
2249 return shortcut_cond_r (pred
, true_label_p
, false_label_p
);
2251 /* If our last subexpression already has a terminal label, reuse it. */
2253 expr
= expr_last (else_
);
2255 expr
= expr_last (then_
);
2258 if (expr
&& TREE_CODE (expr
) == LABEL_EXPR
)
2259 end_label
= LABEL_EXPR_LABEL (expr
);
2261 /* If we don't care about jumping to the 'else' branch, jump to the end
2262 if the condition is false. */
2264 false_label_p
= &end_label
;
2266 /* We only want to emit these labels if we aren't hijacking them. */
2267 emit_end
= (end_label
== NULL_TREE
);
2268 emit_false
= (false_label
== NULL_TREE
);
2270 /* We only emit the jump over the else clause if we have to--if the
2271 then clause may fall through. Otherwise we can wind up with a
2272 useless jump and a useless label at the end of gimplified code,
2273 which will cause us to think that this conditional as a whole
2274 falls through even if it doesn't. If we then inline a function
2275 which ends with such a condition, that can cause us to issue an
2276 inappropriate warning about control reaching the end of a
2277 non-void function. */
2278 jump_over_else
= block_may_fallthru (then_
);
2280 pred
= shortcut_cond_r (pred
, true_label_p
, false_label_p
);
2283 append_to_statement_list (pred
, &expr
);
2285 append_to_statement_list (then_
, &expr
);
2290 t
= build_and_jump (&end_label
);
2291 append_to_statement_list (t
, &expr
);
2295 t
= build1 (LABEL_EXPR
, void_type_node
, false_label
);
2296 append_to_statement_list (t
, &expr
);
2298 append_to_statement_list (else_
, &expr
);
2300 if (emit_end
&& end_label
)
2302 t
= build1 (LABEL_EXPR
, void_type_node
, end_label
);
2303 append_to_statement_list (t
, &expr
);
2309 /* EXPR is used in a boolean context; make sure it has BOOLEAN_TYPE. */
2312 gimple_boolify (tree expr
)
2314 tree type
= TREE_TYPE (expr
);
2316 if (TREE_CODE (type
) == BOOLEAN_TYPE
)
2319 switch (TREE_CODE (expr
))
2321 case TRUTH_AND_EXPR
:
2323 case TRUTH_XOR_EXPR
:
2324 case TRUTH_ANDIF_EXPR
:
2325 case TRUTH_ORIF_EXPR
:
2326 /* Also boolify the arguments of truth exprs. */
2327 TREE_OPERAND (expr
, 1) = gimple_boolify (TREE_OPERAND (expr
, 1));
2330 case TRUTH_NOT_EXPR
:
2331 TREE_OPERAND (expr
, 0) = gimple_boolify (TREE_OPERAND (expr
, 0));
2334 case EQ_EXPR
: case NE_EXPR
:
2335 case LE_EXPR
: case GE_EXPR
: case LT_EXPR
: case GT_EXPR
:
2336 /* These expressions always produce boolean results. */
2337 TREE_TYPE (expr
) = boolean_type_node
;
2341 /* Other expressions that get here must have boolean values, but
2342 might need to be converted to the appropriate mode. */
2343 return fold_convert (boolean_type_node
, expr
);
2347 /* Convert the conditional expression pointed to by EXPR_P '(p) ? a : b;'
2356 The second form is used when *EXPR_P is of type void.
2358 TARGET is the tree for T1 above.
2360 PRE_P points to the list where side effects that must happen before
2361 *EXPR_P should be stored. */
2363 static enum gimplify_status
2364 gimplify_cond_expr (tree
*expr_p
, tree
*pre_p
, fallback_t fallback
)
2366 tree expr
= *expr_p
;
2367 tree tmp
, tmp2
, type
;
2368 enum gimplify_status ret
;
2370 type
= TREE_TYPE (expr
);
2372 /* If this COND_EXPR has a value, copy the values into a temporary within
2374 if (! VOID_TYPE_P (type
))
2378 if ((fallback
& fb_lvalue
) == 0)
2380 result
= tmp2
= tmp
= create_tmp_var (TREE_TYPE (expr
), "iftmp");
2385 tree type
= build_pointer_type (TREE_TYPE (expr
));
2387 if (TREE_TYPE (TREE_OPERAND (expr
, 1)) != void_type_node
)
2388 TREE_OPERAND (expr
, 1) =
2389 build_fold_addr_expr (TREE_OPERAND (expr
, 1));
2391 if (TREE_TYPE (TREE_OPERAND (expr
, 2)) != void_type_node
)
2392 TREE_OPERAND (expr
, 2) =
2393 build_fold_addr_expr (TREE_OPERAND (expr
, 2));
2395 tmp2
= tmp
= create_tmp_var (type
, "iftmp");
2397 expr
= build3 (COND_EXPR
, void_type_node
, TREE_OPERAND (expr
, 0),
2398 TREE_OPERAND (expr
, 1), TREE_OPERAND (expr
, 2));
2400 result
= build_fold_indirect_ref (tmp
);
2404 /* Build the then clause, 't1 = a;'. But don't build an assignment
2405 if this branch is void; in C++ it can be, if it's a throw. */
2406 if (TREE_TYPE (TREE_OPERAND (expr
, 1)) != void_type_node
)
2407 TREE_OPERAND (expr
, 1)
2408 = build2 (MODIFY_EXPR
, void_type_node
, tmp
, TREE_OPERAND (expr
, 1));
2410 /* Build the else clause, 't1 = b;'. */
2411 if (TREE_TYPE (TREE_OPERAND (expr
, 2)) != void_type_node
)
2412 TREE_OPERAND (expr
, 2)
2413 = build2 (MODIFY_EXPR
, void_type_node
, tmp2
, TREE_OPERAND (expr
, 2));
2415 TREE_TYPE (expr
) = void_type_node
;
2416 recalculate_side_effects (expr
);
2418 /* Move the COND_EXPR to the prequeue. */
2419 gimplify_and_add (expr
, pre_p
);
2425 /* Make sure the condition has BOOLEAN_TYPE. */
2426 TREE_OPERAND (expr
, 0) = gimple_boolify (TREE_OPERAND (expr
, 0));
2428 /* Break apart && and || conditions. */
2429 if (TREE_CODE (TREE_OPERAND (expr
, 0)) == TRUTH_ANDIF_EXPR
2430 || TREE_CODE (TREE_OPERAND (expr
, 0)) == TRUTH_ORIF_EXPR
)
2432 expr
= shortcut_cond_expr (expr
);
2434 if (expr
!= *expr_p
)
2438 /* We can't rely on gimplify_expr to re-gimplify the expanded
2439 form properly, as cleanups might cause the target labels to be
2440 wrapped in a TRY_FINALLY_EXPR. To prevent that, we need to
2441 set up a conditional context. */
2442 gimple_push_condition ();
2443 gimplify_stmt (expr_p
);
2444 gimple_pop_condition (pre_p
);
2450 /* Now do the normal gimplification. */
2451 ret
= gimplify_expr (&TREE_OPERAND (expr
, 0), pre_p
, NULL
,
2452 is_gimple_condexpr
, fb_rvalue
);
2454 gimple_push_condition ();
2456 gimplify_to_stmt_list (&TREE_OPERAND (expr
, 1));
2457 gimplify_to_stmt_list (&TREE_OPERAND (expr
, 2));
2458 recalculate_side_effects (expr
);
2460 gimple_pop_condition (pre_p
);
2462 if (ret
== GS_ERROR
)
2464 else if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 1)))
2466 else if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 2)))
2467 /* Rewrite "if (a); else b" to "if (!a) b" */
2469 TREE_OPERAND (expr
, 0) = invert_truthvalue (TREE_OPERAND (expr
, 0));
2470 ret
= gimplify_expr (&TREE_OPERAND (expr
, 0), pre_p
, NULL
,
2471 is_gimple_condexpr
, fb_rvalue
);
2473 tmp
= TREE_OPERAND (expr
, 1);
2474 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 2);
2475 TREE_OPERAND (expr
, 2) = tmp
;
2478 /* Both arms are empty; replace the COND_EXPR with its predicate. */
2479 expr
= TREE_OPERAND (expr
, 0);
2485 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
2486 a call to __builtin_memcpy. */
2488 static enum gimplify_status
2489 gimplify_modify_expr_to_memcpy (tree
*expr_p
, tree size
, bool want_value
)
2491 tree args
, t
, to
, to_ptr
, from
;
2493 to
= TREE_OPERAND (*expr_p
, 0);
2494 from
= TREE_OPERAND (*expr_p
, 1);
2496 args
= tree_cons (NULL
, size
, NULL
);
2498 t
= build_fold_addr_expr (from
);
2499 args
= tree_cons (NULL
, t
, args
);
2501 to_ptr
= build_fold_addr_expr (to
);
2502 args
= tree_cons (NULL
, to_ptr
, args
);
2503 t
= implicit_built_in_decls
[BUILT_IN_MEMCPY
];
2504 t
= build_function_call_expr (t
, args
);
2508 t
= build1 (NOP_EXPR
, TREE_TYPE (to_ptr
), t
);
2509 t
= build1 (INDIRECT_REF
, TREE_TYPE (to
), t
);
2516 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
2517 a call to __builtin_memset. In this case we know that the RHS is
2518 a CONSTRUCTOR with an empty element list. */
2520 static enum gimplify_status
2521 gimplify_modify_expr_to_memset (tree
*expr_p
, tree size
, bool want_value
)
2523 tree args
, t
, to
, to_ptr
;
2525 to
= TREE_OPERAND (*expr_p
, 0);
2527 args
= tree_cons (NULL
, size
, NULL
);
2529 args
= tree_cons (NULL
, integer_zero_node
, args
);
2531 to_ptr
= build_fold_addr_expr (to
);
2532 args
= tree_cons (NULL
, to_ptr
, args
);
2533 t
= implicit_built_in_decls
[BUILT_IN_MEMSET
];
2534 t
= build_function_call_expr (t
, args
);
2538 t
= build1 (NOP_EXPR
, TREE_TYPE (to_ptr
), t
);
2539 t
= build1 (INDIRECT_REF
, TREE_TYPE (to
), t
);
2546 /* A subroutine of gimplify_init_ctor_preeval. Called via walk_tree,
2547 determine, cautiously, if a CONSTRUCTOR overlaps the lhs of an
2548 assignment. Returns non-null if we detect a potential overlap. */
2550 struct gimplify_init_ctor_preeval_data
2552 /* The base decl of the lhs object. May be NULL, in which case we
2553 have to assume the lhs is indirect. */
2556 /* The alias set of the lhs object. */
2561 gimplify_init_ctor_preeval_1 (tree
*tp
, int *walk_subtrees
, void *xdata
)
2563 struct gimplify_init_ctor_preeval_data
*data
2564 = (struct gimplify_init_ctor_preeval_data
*) xdata
;
2567 /* If we find the base object, obviously we have overlap. */
2568 if (data
->lhs_base_decl
== t
)
2571 /* If the constructor component is indirect, determine if we have a
2572 potential overlap with the lhs. The only bits of information we
2573 have to go on at this point are addressability and alias sets. */
2574 if (TREE_CODE (t
) == INDIRECT_REF
2575 && (!data
->lhs_base_decl
|| TREE_ADDRESSABLE (data
->lhs_base_decl
))
2576 && alias_sets_conflict_p (data
->lhs_alias_set
, get_alias_set (t
)))
2579 if (IS_TYPE_OR_DECL_P (t
))
2584 /* A subroutine of gimplify_init_constructor. Pre-evaluate *EXPR_P,
2585 force values that overlap with the lhs (as described by *DATA)
2586 into temporaries. */
2589 gimplify_init_ctor_preeval (tree
*expr_p
, tree
*pre_p
, tree
*post_p
,
2590 struct gimplify_init_ctor_preeval_data
*data
)
2592 enum gimplify_status one
;
2594 /* If the value is invariant, then there's nothing to pre-evaluate.
2595 But ensure it doesn't have any side-effects since a SAVE_EXPR is
2596 invariant but has side effects and might contain a reference to
2597 the object we're initializing. */
2598 if (TREE_INVARIANT (*expr_p
) && !TREE_SIDE_EFFECTS (*expr_p
))
2601 /* If the type has non-trivial constructors, we can't pre-evaluate. */
2602 if (TREE_ADDRESSABLE (TREE_TYPE (*expr_p
)))
2605 /* Recurse for nested constructors. */
2606 if (TREE_CODE (*expr_p
) == CONSTRUCTOR
)
2608 unsigned HOST_WIDE_INT ix
;
2609 constructor_elt
*ce
;
2610 VEC(constructor_elt
,gc
) *v
= CONSTRUCTOR_ELTS (*expr_p
);
2612 for (ix
= 0; VEC_iterate (constructor_elt
, v
, ix
, ce
); ix
++)
2613 gimplify_init_ctor_preeval (&ce
->value
, pre_p
, post_p
, data
);
2617 /* We can't preevaluate if the type contains a placeholder. */
2618 if (type_contains_placeholder_p (TREE_TYPE (*expr_p
)))
2621 /* Gimplify the constructor element to something appropriate for the rhs
2622 of a MODIFY_EXPR. Given that we know the lhs is an aggregate, we know
2623 the gimplifier will consider this a store to memory. Doing this
2624 gimplification now means that we won't have to deal with complicated
2625 language-specific trees, nor trees like SAVE_EXPR that can induce
2626 exponential search behavior. */
2627 one
= gimplify_expr (expr_p
, pre_p
, post_p
, is_gimple_mem_rhs
, fb_rvalue
);
2628 if (one
== GS_ERROR
)
2634 /* If we gimplified to a bare decl, we can be sure that it doesn't overlap
2635 with the lhs, since "a = { .x=a }" doesn't make sense. This will
2636 always be true for all scalars, since is_gimple_mem_rhs insists on a
2637 temporary variable for them. */
2638 if (DECL_P (*expr_p
))
2641 /* If this is of variable size, we have no choice but to assume it doesn't
2642 overlap since we can't make a temporary for it. */
2643 if (!TREE_CONSTANT (TYPE_SIZE (TREE_TYPE (*expr_p
))))
2646 /* Otherwise, we must search for overlap ... */
2647 if (!walk_tree (expr_p
, gimplify_init_ctor_preeval_1
, data
, NULL
))
2650 /* ... and if found, force the value into a temporary. */
2651 *expr_p
= get_formal_tmp_var (*expr_p
, pre_p
);
2654 /* A subroutine of gimplify_init_ctor_eval. Create a loop for
2655 a RANGE_EXPR in a CONSTRUCTOR for an array.
2659 object[var] = value;
2666 We increment var _after_ the loop exit check because we might otherwise
2667 fail if upper == TYPE_MAX_VALUE (type for upper).
2669 Note that we never have to deal with SAVE_EXPRs here, because this has
2670 already been taken care of for us, in gimplify_init_ctor_preeval(). */
2672 static void gimplify_init_ctor_eval (tree
, VEC(constructor_elt
,gc
) *,
2676 gimplify_init_ctor_eval_range (tree object
, tree lower
, tree upper
,
2677 tree value
, tree array_elt_type
,
2678 tree
*pre_p
, bool cleared
)
2680 tree loop_entry_label
, loop_exit_label
;
2681 tree var
, var_type
, cref
;
2683 loop_entry_label
= create_artificial_label ();
2684 loop_exit_label
= create_artificial_label ();
2686 /* Create and initialize the index variable. */
2687 var_type
= TREE_TYPE (upper
);
2688 var
= create_tmp_var (var_type
, NULL
);
2689 append_to_statement_list (build2 (MODIFY_EXPR
, var_type
, var
, lower
), pre_p
);
2691 /* Add the loop entry label. */
2692 append_to_statement_list (build1 (LABEL_EXPR
,
2697 /* Build the reference. */
2698 cref
= build4 (ARRAY_REF
, array_elt_type
, unshare_expr (object
),
2699 var
, NULL_TREE
, NULL_TREE
);
2701 /* If we are a constructor, just call gimplify_init_ctor_eval to do
2702 the store. Otherwise just assign value to the reference. */
2704 if (TREE_CODE (value
) == CONSTRUCTOR
)
2705 /* NB we might have to call ourself recursively through
2706 gimplify_init_ctor_eval if the value is a constructor. */
2707 gimplify_init_ctor_eval (cref
, CONSTRUCTOR_ELTS (value
),
2710 append_to_statement_list (build2 (MODIFY_EXPR
, TREE_TYPE (cref
),
2714 /* We exit the loop when the index var is equal to the upper bound. */
2715 gimplify_and_add (build3 (COND_EXPR
, void_type_node
,
2716 build2 (EQ_EXPR
, boolean_type_node
,
2724 /* Otherwise, increment the index var... */
2725 append_to_statement_list (build2 (MODIFY_EXPR
, var_type
, var
,
2726 build2 (PLUS_EXPR
, var_type
, var
,
2727 fold_convert (var_type
,
2728 integer_one_node
))),
2731 /* ...and jump back to the loop entry. */
2732 append_to_statement_list (build1 (GOTO_EXPR
,
2737 /* Add the loop exit label. */
2738 append_to_statement_list (build1 (LABEL_EXPR
,
2744 /* Return true if FDECL is accessing a field that is zero sized. */
2747 zero_sized_field_decl (tree fdecl
)
2749 if (TREE_CODE (fdecl
) == FIELD_DECL
&& DECL_SIZE (fdecl
)
2750 && integer_zerop (DECL_SIZE (fdecl
)))
2755 /* Return true if TYPE is zero sized. */
2758 zero_sized_type (tree type
)
2760 if (AGGREGATE_TYPE_P (type
) && TYPE_SIZE (type
)
2761 && integer_zerop (TYPE_SIZE (type
)))
2766 /* A subroutine of gimplify_init_constructor. Generate individual
2767 MODIFY_EXPRs for a CONSTRUCTOR. OBJECT is the LHS against which the
2768 assignments should happen. ELTS is the CONSTRUCTOR_ELTS of the
2769 CONSTRUCTOR. CLEARED is true if the entire LHS object has been
2773 gimplify_init_ctor_eval (tree object
, VEC(constructor_elt
,gc
) *elts
,
2774 tree
*pre_p
, bool cleared
)
2776 tree array_elt_type
= NULL
;
2777 unsigned HOST_WIDE_INT ix
;
2778 tree purpose
, value
;
2780 if (TREE_CODE (TREE_TYPE (object
)) == ARRAY_TYPE
)
2781 array_elt_type
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (object
)));
2783 FOR_EACH_CONSTRUCTOR_ELT (elts
, ix
, purpose
, value
)
2787 /* NULL values are created above for gimplification errors. */
2791 if (cleared
&& initializer_zerop (value
))
2794 /* ??? Here's to hoping the front end fills in all of the indices,
2795 so we don't have to figure out what's missing ourselves. */
2796 gcc_assert (purpose
);
2798 /* Skip zero-sized fields, unless value has side-effects. This can
2799 happen with calls to functions returning a zero-sized type, which
2800 we shouldn't discard. As a number of downstream passes don't
2801 expect sets of zero-sized fields, we rely on the gimplification of
2802 the MODIFY_EXPR we make below to drop the assignment statement. */
2803 if (! TREE_SIDE_EFFECTS (value
) && zero_sized_field_decl (purpose
))
2806 /* If we have a RANGE_EXPR, we have to build a loop to assign the
2808 if (TREE_CODE (purpose
) == RANGE_EXPR
)
2810 tree lower
= TREE_OPERAND (purpose
, 0);
2811 tree upper
= TREE_OPERAND (purpose
, 1);
2813 /* If the lower bound is equal to upper, just treat it as if
2814 upper was the index. */
2815 if (simple_cst_equal (lower
, upper
))
2819 gimplify_init_ctor_eval_range (object
, lower
, upper
, value
,
2820 array_elt_type
, pre_p
, cleared
);
2827 cref
= build4 (ARRAY_REF
, array_elt_type
, unshare_expr (object
),
2828 purpose
, NULL_TREE
, NULL_TREE
);
2832 gcc_assert (TREE_CODE (purpose
) == FIELD_DECL
);
2833 cref
= build3 (COMPONENT_REF
, TREE_TYPE (purpose
),
2834 unshare_expr (object
), purpose
, NULL_TREE
);
2837 if (TREE_CODE (value
) == CONSTRUCTOR
2838 && TREE_CODE (TREE_TYPE (value
)) != VECTOR_TYPE
)
2839 gimplify_init_ctor_eval (cref
, CONSTRUCTOR_ELTS (value
),
2843 init
= build2 (INIT_EXPR
, TREE_TYPE (cref
), cref
, value
);
2844 gimplify_and_add (init
, pre_p
);
2849 /* A subroutine of gimplify_modify_expr. Break out elements of a
2850 CONSTRUCTOR used as an initializer into separate MODIFY_EXPRs.
2852 Note that we still need to clear any elements that don't have explicit
2853 initializers, so if not all elements are initialized we keep the
2854 original MODIFY_EXPR, we just remove all of the constructor elements. */
2856 static enum gimplify_status
2857 gimplify_init_constructor (tree
*expr_p
, tree
*pre_p
,
2858 tree
*post_p
, bool want_value
)
2861 tree ctor
= TREE_OPERAND (*expr_p
, 1);
2862 tree type
= TREE_TYPE (ctor
);
2863 enum gimplify_status ret
;
2864 VEC(constructor_elt
,gc
) *elts
;
2866 if (TREE_CODE (ctor
) != CONSTRUCTOR
)
2867 return GS_UNHANDLED
;
2869 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
2870 is_gimple_lvalue
, fb_lvalue
);
2871 if (ret
== GS_ERROR
)
2873 object
= TREE_OPERAND (*expr_p
, 0);
2875 elts
= CONSTRUCTOR_ELTS (ctor
);
2878 switch (TREE_CODE (type
))
2882 case QUAL_UNION_TYPE
:
2885 struct gimplify_init_ctor_preeval_data preeval_data
;
2886 HOST_WIDE_INT num_type_elements
, num_ctor_elements
;
2887 HOST_WIDE_INT num_nonzero_elements
, num_nonconstant_elements
;
2890 /* Aggregate types must lower constructors to initialization of
2891 individual elements. The exception is that a CONSTRUCTOR node
2892 with no elements indicates zero-initialization of the whole. */
2893 if (VEC_empty (constructor_elt
, elts
))
2896 categorize_ctor_elements (ctor
, &num_nonzero_elements
,
2897 &num_nonconstant_elements
,
2898 &num_ctor_elements
, &cleared
);
2900 /* If a const aggregate variable is being initialized, then it
2901 should never be a lose to promote the variable to be static. */
2902 if (num_nonconstant_elements
== 0
2903 && num_nonzero_elements
> 1
2904 && TREE_READONLY (object
)
2905 && TREE_CODE (object
) == VAR_DECL
)
2907 DECL_INITIAL (object
) = ctor
;
2908 TREE_STATIC (object
) = 1;
2909 if (!DECL_NAME (object
))
2910 DECL_NAME (object
) = create_tmp_var_name ("C");
2911 walk_tree (&DECL_INITIAL (object
), force_labels_r
, NULL
, NULL
);
2913 /* ??? C++ doesn't automatically append a .<number> to the
2914 assembler name, and even when it does, it looks a FE private
2915 data structures to figure out what that number should be,
2916 which are not set for this variable. I suppose this is
2917 important for local statics for inline functions, which aren't
2918 "local" in the object file sense. So in order to get a unique
2919 TU-local symbol, we must invoke the lhd version now. */
2920 lhd_set_decl_assembler_name (object
);
2922 *expr_p
= NULL_TREE
;
2926 /* If there are "lots" of initialized elements, even discounting
2927 those that are not address constants (and thus *must* be
2928 computed at runtime), then partition the constructor into
2929 constant and non-constant parts. Block copy the constant
2930 parts in, then generate code for the non-constant parts. */
2931 /* TODO. There's code in cp/typeck.c to do this. */
2933 num_type_elements
= count_type_elements (type
, true);
2935 /* If count_type_elements could not determine number of type elements
2936 for a constant-sized object, assume clearing is needed.
2937 Don't do this for variable-sized objects, as store_constructor
2938 will ignore the clearing of variable-sized objects. */
2939 if (num_type_elements
< 0 && int_size_in_bytes (type
) >= 0)
2941 /* If there are "lots" of zeros, then block clear the object first. */
2942 else if (num_type_elements
- num_nonzero_elements
> CLEAR_RATIO
2943 && num_nonzero_elements
< num_type_elements
/4)
2945 /* ??? This bit ought not be needed. For any element not present
2946 in the initializer, we should simply set them to zero. Except
2947 we'd need to *find* the elements that are not present, and that
2948 requires trickery to avoid quadratic compile-time behavior in
2949 large cases or excessive memory use in small cases. */
2950 else if (num_ctor_elements
< num_type_elements
)
2953 /* If there are "lots" of initialized elements, and all of them
2954 are valid address constants, then the entire initializer can
2955 be dropped to memory, and then memcpy'd out. Don't do this
2956 for sparse arrays, though, as it's more efficient to follow
2957 the standard CONSTRUCTOR behavior of memset followed by
2958 individual element initialization. */
2959 if (num_nonconstant_elements
== 0 && !cleared
)
2961 HOST_WIDE_INT size
= int_size_in_bytes (type
);
2964 /* ??? We can still get unbounded array types, at least
2965 from the C++ front end. This seems wrong, but attempt
2966 to work around it for now. */
2969 size
= int_size_in_bytes (TREE_TYPE (object
));
2971 TREE_TYPE (ctor
) = type
= TREE_TYPE (object
);
2974 /* Find the maximum alignment we can assume for the object. */
2975 /* ??? Make use of DECL_OFFSET_ALIGN. */
2976 if (DECL_P (object
))
2977 align
= DECL_ALIGN (object
);
2979 align
= TYPE_ALIGN (type
);
2981 if (size
> 0 && !can_move_by_pieces (size
, align
))
2983 tree
new = create_tmp_var_raw (type
, "C");
2985 gimple_add_tmp_var (new);
2986 TREE_STATIC (new) = 1;
2987 TREE_READONLY (new) = 1;
2988 DECL_INITIAL (new) = ctor
;
2989 if (align
> DECL_ALIGN (new))
2991 DECL_ALIGN (new) = align
;
2992 DECL_USER_ALIGN (new) = 1;
2994 walk_tree (&DECL_INITIAL (new), force_labels_r
, NULL
, NULL
);
2996 TREE_OPERAND (*expr_p
, 1) = new;
2998 /* This is no longer an assignment of a CONSTRUCTOR, but
2999 we still may have processing to do on the LHS. So
3000 pretend we didn't do anything here to let that happen. */
3001 return GS_UNHANDLED
;
3007 /* Zap the CONSTRUCTOR element list, which simplifies this case.
3008 Note that we still have to gimplify, in order to handle the
3009 case of variable sized types. Avoid shared tree structures. */
3010 CONSTRUCTOR_ELTS (ctor
) = NULL
;
3011 object
= unshare_expr (object
);
3012 gimplify_stmt (expr_p
);
3013 append_to_statement_list (*expr_p
, pre_p
);
3016 /* If we have not block cleared the object, or if there are nonzero
3017 elements in the constructor, add assignments to the individual
3018 scalar fields of the object. */
3019 if (!cleared
|| num_nonzero_elements
> 0)
3021 preeval_data
.lhs_base_decl
= get_base_address (object
);
3022 if (!DECL_P (preeval_data
.lhs_base_decl
))
3023 preeval_data
.lhs_base_decl
= NULL
;
3024 preeval_data
.lhs_alias_set
= get_alias_set (object
);
3026 gimplify_init_ctor_preeval (&TREE_OPERAND (*expr_p
, 1),
3027 pre_p
, post_p
, &preeval_data
);
3028 gimplify_init_ctor_eval (object
, elts
, pre_p
, cleared
);
3031 *expr_p
= NULL_TREE
;
3039 /* Extract the real and imaginary parts out of the ctor. */
3040 gcc_assert (VEC_length (constructor_elt
, elts
) == 2);
3041 r
= VEC_index (constructor_elt
, elts
, 0)->value
;
3042 i
= VEC_index (constructor_elt
, elts
, 1)->value
;
3043 if (r
== NULL
|| i
== NULL
)
3045 tree zero
= fold_convert (TREE_TYPE (type
), integer_zero_node
);
3052 /* Complex types have either COMPLEX_CST or COMPLEX_EXPR to
3053 represent creation of a complex value. */
3054 if (TREE_CONSTANT (r
) && TREE_CONSTANT (i
))
3056 ctor
= build_complex (type
, r
, i
);
3057 TREE_OPERAND (*expr_p
, 1) = ctor
;
3061 ctor
= build2 (COMPLEX_EXPR
, type
, r
, i
);
3062 TREE_OPERAND (*expr_p
, 1) = ctor
;
3063 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
, post_p
,
3064 rhs_predicate_for (TREE_OPERAND (*expr_p
, 0)),
3072 unsigned HOST_WIDE_INT ix
;
3073 constructor_elt
*ce
;
3075 /* Go ahead and simplify constant constructors to VECTOR_CST. */
3076 if (TREE_CONSTANT (ctor
))
3078 bool constant_p
= true;
3081 /* Even when ctor is constant, it might contain non-*_CST
3082 elements (e.g. { 1.0/0.0 - 1.0/0.0, 0.0 }) and those don't
3083 belong into VECTOR_CST nodes. */
3084 FOR_EACH_CONSTRUCTOR_VALUE (elts
, ix
, value
)
3085 if (!CONSTANT_CLASS_P (value
))
3093 TREE_OPERAND (*expr_p
, 1) = build_vector_from_ctor (type
, elts
);
3098 /* Vector types use CONSTRUCTOR all the way through gimple
3099 compilation as a general initializer. */
3100 for (ix
= 0; VEC_iterate (constructor_elt
, elts
, ix
, ce
); ix
++)
3102 enum gimplify_status tret
;
3103 tret
= gimplify_expr (&ce
->value
, pre_p
, post_p
,
3104 is_gimple_val
, fb_rvalue
);
3105 if (tret
== GS_ERROR
)
3112 /* So how did we get a CONSTRUCTOR for a scalar type? */
3116 if (ret
== GS_ERROR
)
3118 else if (want_value
)
3120 append_to_statement_list (*expr_p
, pre_p
);
3128 /* Given a pointer value OP0, return a simplified version of an
3129 indirection through OP0, or NULL_TREE if no simplification is
3130 possible. This may only be applied to a rhs of an expression.
3131 Note that the resulting type may be different from the type pointed
3132 to in the sense that it is still compatible from the langhooks
3136 fold_indirect_ref_rhs (tree t
)
3138 tree type
= TREE_TYPE (TREE_TYPE (t
));
3143 subtype
= TREE_TYPE (sub
);
3144 if (!POINTER_TYPE_P (subtype
))
3147 if (TREE_CODE (sub
) == ADDR_EXPR
)
3149 tree op
= TREE_OPERAND (sub
, 0);
3150 tree optype
= TREE_TYPE (op
);
3152 if (lang_hooks
.types_compatible_p (type
, optype
))
3154 /* *(foo *)&fooarray => fooarray[0] */
3155 else if (TREE_CODE (optype
) == ARRAY_TYPE
3156 && lang_hooks
.types_compatible_p (type
, TREE_TYPE (optype
)))
3158 tree type_domain
= TYPE_DOMAIN (optype
);
3159 tree min_val
= size_zero_node
;
3160 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
3161 min_val
= TYPE_MIN_VALUE (type_domain
);
3162 return build4 (ARRAY_REF
, type
, op
, min_val
, NULL_TREE
, NULL_TREE
);
3166 /* *(foo *)fooarrptr => (*fooarrptr)[0] */
3167 if (TREE_CODE (TREE_TYPE (subtype
)) == ARRAY_TYPE
3168 && lang_hooks
.types_compatible_p (type
, TREE_TYPE (TREE_TYPE (subtype
))))
3171 tree min_val
= size_zero_node
;
3173 sub
= fold_indirect_ref_rhs (sub
);
3175 sub
= build1 (INDIRECT_REF
, TREE_TYPE (subtype
), osub
);
3176 type_domain
= TYPE_DOMAIN (TREE_TYPE (sub
));
3177 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
3178 min_val
= TYPE_MIN_VALUE (type_domain
);
3179 return build4 (ARRAY_REF
, type
, sub
, min_val
, NULL_TREE
, NULL_TREE
);
3185 /* Subroutine of gimplify_modify_expr to do simplifications of MODIFY_EXPRs
3186 based on the code of the RHS. We loop for as long as something changes. */
3188 static enum gimplify_status
3189 gimplify_modify_expr_rhs (tree
*expr_p
, tree
*from_p
, tree
*to_p
, tree
*pre_p
,
3190 tree
*post_p
, bool want_value
)
3192 enum gimplify_status ret
= GS_OK
;
3194 while (ret
!= GS_UNHANDLED
)
3195 switch (TREE_CODE (*from_p
))
3199 /* If we have code like
3203 where the type of "x" is a (possibly cv-qualified variant
3204 of "A"), treat the entire expression as identical to "x".
3205 This kind of code arises in C++ when an object is bound
3206 to a const reference, and if "x" is a TARGET_EXPR we want
3207 to take advantage of the optimization below. */
3208 tree t
= fold_indirect_ref_rhs (TREE_OPERAND (*from_p
, 0));
3221 /* If we are initializing something from a TARGET_EXPR, strip the
3222 TARGET_EXPR and initialize it directly, if possible. This can't
3223 be done if the initializer is void, since that implies that the
3224 temporary is set in some non-trivial way.
3226 ??? What about code that pulls out the temp and uses it
3227 elsewhere? I think that such code never uses the TARGET_EXPR as
3228 an initializer. If I'm wrong, we'll die because the temp won't
3229 have any RTL. In that case, I guess we'll need to replace
3230 references somehow. */
3231 tree init
= TARGET_EXPR_INITIAL (*from_p
);
3233 if (!VOID_TYPE_P (TREE_TYPE (init
)))
3244 /* Remove any COMPOUND_EXPR in the RHS so the following cases will be
3246 gimplify_compound_expr (from_p
, pre_p
, true);
3251 /* If we're initializing from a CONSTRUCTOR, break this into
3252 individual MODIFY_EXPRs. */
3253 return gimplify_init_constructor (expr_p
, pre_p
, post_p
, want_value
);
3256 /* If we're assigning to a non-register type, push the assignment
3257 down into the branches. This is mandatory for ADDRESSABLE types,
3258 since we cannot generate temporaries for such, but it saves a
3259 copy in other cases as well. */
3260 if (!is_gimple_reg_type (TREE_TYPE (*from_p
)))
3262 /* This code should mirror the code in gimplify_cond_expr. */
3263 enum tree_code code
= TREE_CODE (*expr_p
);
3264 tree cond
= *from_p
;
3265 tree result
= *to_p
;
3267 ret
= gimplify_expr (&result
, pre_p
, post_p
,
3268 is_gimple_min_lval
, fb_lvalue
);
3269 if (ret
!= GS_ERROR
)
3272 if (TREE_TYPE (TREE_OPERAND (cond
, 1)) != void_type_node
)
3273 TREE_OPERAND (cond
, 1)
3274 = build2 (code
, void_type_node
, result
,
3275 TREE_OPERAND (cond
, 1));
3276 if (TREE_TYPE (TREE_OPERAND (cond
, 2)) != void_type_node
)
3277 TREE_OPERAND (cond
, 2)
3278 = build2 (code
, void_type_node
, unshare_expr (result
),
3279 TREE_OPERAND (cond
, 2));
3281 TREE_TYPE (cond
) = void_type_node
;
3282 recalculate_side_effects (cond
);
3286 gimplify_and_add (cond
, pre_p
);
3287 *expr_p
= unshare_expr (result
);
3298 /* For calls that return in memory, give *to_p as the CALL_EXPR's
3299 return slot so that we don't generate a temporary. */
3300 if (!CALL_EXPR_RETURN_SLOT_OPT (*from_p
)
3301 && aggregate_value_p (*from_p
, *from_p
))
3305 if (!(rhs_predicate_for (*to_p
))(*from_p
))
3306 /* If we need a temporary, *to_p isn't accurate. */
3308 else if (TREE_CODE (*to_p
) == RESULT_DECL
3309 && DECL_NAME (*to_p
) == NULL_TREE
3310 && needs_to_live_in_memory (*to_p
))
3311 /* It's OK to use the return slot directly unless it's an NRV. */
3313 else if (is_gimple_reg_type (TREE_TYPE (*to_p
))
3314 || (DECL_P (*to_p
) && DECL_REGISTER (*to_p
)))
3315 /* Don't force regs into memory. */
3317 else if (TREE_CODE (*to_p
) == VAR_DECL
3318 && DECL_GIMPLE_FORMAL_TEMP_P (*to_p
))
3319 /* Don't use the original target if it's a formal temp; we
3320 don't want to take their addresses. */
3322 else if (TREE_CODE (*expr_p
) == INIT_EXPR
)
3323 /* It's OK to use the target directly if it's being
3326 else if (!is_gimple_non_addressable (*to_p
))
3327 /* Don't use the original target if it's already addressable;
3328 if its address escapes, and the called function uses the
3329 NRV optimization, a conforming program could see *to_p
3330 change before the called function returns; see c++/19317.
3331 When optimizing, the return_slot pass marks more functions
3332 as safe after we have escape info. */
3339 CALL_EXPR_RETURN_SLOT_OPT (*from_p
) = 1;
3340 lang_hooks
.mark_addressable (*to_p
);
3355 /* Promote partial stores to COMPLEX variables to total stores. *EXPR_P is
3356 a MODIFY_EXPR with a lhs of a REAL/IMAGPART_EXPR of a variable with
3357 DECL_COMPLEX_GIMPLE_REG_P set. */
3359 static enum gimplify_status
3360 gimplify_modify_expr_complex_part (tree
*expr_p
, tree
*pre_p
, bool want_value
)
3362 enum tree_code code
, ocode
;
3363 tree lhs
, rhs
, new_rhs
, other
, realpart
, imagpart
;
3365 lhs
= TREE_OPERAND (*expr_p
, 0);
3366 rhs
= TREE_OPERAND (*expr_p
, 1);
3367 code
= TREE_CODE (lhs
);
3368 lhs
= TREE_OPERAND (lhs
, 0);
3370 ocode
= code
== REALPART_EXPR
? IMAGPART_EXPR
: REALPART_EXPR
;
3371 other
= build1 (ocode
, TREE_TYPE (rhs
), lhs
);
3372 other
= get_formal_tmp_var (other
, pre_p
);
3374 realpart
= code
== REALPART_EXPR
? rhs
: other
;
3375 imagpart
= code
== REALPART_EXPR
? other
: rhs
;
3377 if (TREE_CONSTANT (realpart
) && TREE_CONSTANT (imagpart
))
3378 new_rhs
= build_complex (TREE_TYPE (lhs
), realpart
, imagpart
);
3380 new_rhs
= build2 (COMPLEX_EXPR
, TREE_TYPE (lhs
), realpart
, imagpart
);
3382 TREE_OPERAND (*expr_p
, 0) = lhs
;
3383 TREE_OPERAND (*expr_p
, 1) = new_rhs
;
3387 append_to_statement_list (*expr_p
, pre_p
);
3394 /* Gimplify the MODIFY_EXPR node pointed to by EXPR_P.
3400 PRE_P points to the list where side effects that must happen before
3401 *EXPR_P should be stored.
3403 POST_P points to the list where side effects that must happen after
3404 *EXPR_P should be stored.
3406 WANT_VALUE is nonzero iff we want to use the value of this expression
3407 in another expression. */
3409 static enum gimplify_status
3410 gimplify_modify_expr (tree
*expr_p
, tree
*pre_p
, tree
*post_p
, bool want_value
)
3412 tree
*from_p
= &TREE_OPERAND (*expr_p
, 1);
3413 tree
*to_p
= &TREE_OPERAND (*expr_p
, 0);
3414 enum gimplify_status ret
= GS_UNHANDLED
;
3416 gcc_assert (TREE_CODE (*expr_p
) == MODIFY_EXPR
3417 || TREE_CODE (*expr_p
) == INIT_EXPR
);
3419 /* For zero sized types only gimplify the left hand side and right hand side
3420 as statements and throw away the assignment. */
3421 if (zero_sized_type (TREE_TYPE (*from_p
)))
3423 gimplify_stmt (from_p
);
3424 gimplify_stmt (to_p
);
3425 append_to_statement_list (*from_p
, pre_p
);
3426 append_to_statement_list (*to_p
, pre_p
);
3427 *expr_p
= NULL_TREE
;
3431 /* See if any simplifications can be done based on what the RHS is. */
3432 ret
= gimplify_modify_expr_rhs (expr_p
, from_p
, to_p
, pre_p
, post_p
,
3434 if (ret
!= GS_UNHANDLED
)
3437 /* If the value being copied is of variable width, compute the length
3438 of the copy into a WITH_SIZE_EXPR. Note that we need to do this
3439 before gimplifying any of the operands so that we can resolve any
3440 PLACEHOLDER_EXPRs in the size. Also note that the RTL expander uses
3441 the size of the expression to be copied, not of the destination, so
3442 that is what we must here. */
3443 maybe_with_size_expr (from_p
);
3445 ret
= gimplify_expr (to_p
, pre_p
, post_p
, is_gimple_lvalue
, fb_lvalue
);
3446 if (ret
== GS_ERROR
)
3449 ret
= gimplify_expr (from_p
, pre_p
, post_p
,
3450 rhs_predicate_for (*to_p
), fb_rvalue
);
3451 if (ret
== GS_ERROR
)
3454 /* Now see if the above changed *from_p to something we handle specially. */
3455 ret
= gimplify_modify_expr_rhs (expr_p
, from_p
, to_p
, pre_p
, post_p
,
3457 if (ret
!= GS_UNHANDLED
)
3460 /* If we've got a variable sized assignment between two lvalues (i.e. does
3461 not involve a call), then we can make things a bit more straightforward
3462 by converting the assignment to memcpy or memset. */
3463 if (TREE_CODE (*from_p
) == WITH_SIZE_EXPR
)
3465 tree from
= TREE_OPERAND (*from_p
, 0);
3466 tree size
= TREE_OPERAND (*from_p
, 1);
3468 if (TREE_CODE (from
) == CONSTRUCTOR
)
3469 return gimplify_modify_expr_to_memset (expr_p
, size
, want_value
);
3470 if (is_gimple_addressable (from
))
3473 return gimplify_modify_expr_to_memcpy (expr_p
, size
, want_value
);
3477 /* Transform partial stores to non-addressable complex variables into
3478 total stores. This allows us to use real instead of virtual operands
3479 for these variables, which improves optimization. */
3480 if ((TREE_CODE (*to_p
) == REALPART_EXPR
3481 || TREE_CODE (*to_p
) == IMAGPART_EXPR
)
3482 && is_gimple_reg (TREE_OPERAND (*to_p
, 0)))
3483 return gimplify_modify_expr_complex_part (expr_p
, pre_p
, want_value
);
3485 if (gimplify_ctxp
->into_ssa
&& is_gimple_reg (*to_p
))
3487 /* If we've somehow already got an SSA_NAME on the LHS, then
3488 we're probably modified it twice. Not good. */
3489 gcc_assert (TREE_CODE (*to_p
) != SSA_NAME
);
3490 *to_p
= make_ssa_name (*to_p
, *expr_p
);
3495 append_to_statement_list (*expr_p
, pre_p
);
3503 /* Gimplify a comparison between two variable-sized objects. Do this
3504 with a call to BUILT_IN_MEMCMP. */
3506 static enum gimplify_status
3507 gimplify_variable_sized_compare (tree
*expr_p
)
3509 tree op0
= TREE_OPERAND (*expr_p
, 0);
3510 tree op1
= TREE_OPERAND (*expr_p
, 1);
3513 t
= TYPE_SIZE_UNIT (TREE_TYPE (op0
));
3514 t
= unshare_expr (t
);
3515 t
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (t
, op0
);
3516 args
= tree_cons (NULL
, t
, NULL
);
3517 t
= build_fold_addr_expr (op1
);
3518 args
= tree_cons (NULL
, t
, args
);
3519 dest
= build_fold_addr_expr (op0
);
3520 args
= tree_cons (NULL
, dest
, args
);
3521 t
= implicit_built_in_decls
[BUILT_IN_MEMCMP
];
3522 t
= build_function_call_expr (t
, args
);
3524 = build2 (TREE_CODE (*expr_p
), TREE_TYPE (*expr_p
), t
, integer_zero_node
);
3529 /* Gimplify TRUTH_ANDIF_EXPR and TRUTH_ORIF_EXPR expressions. EXPR_P
3530 points to the expression to gimplify.
3532 Expressions of the form 'a && b' are gimplified to:
3534 a && b ? true : false
3536 gimplify_cond_expr will do the rest.
3538 PRE_P points to the list where side effects that must happen before
3539 *EXPR_P should be stored. */
3541 static enum gimplify_status
3542 gimplify_boolean_expr (tree
*expr_p
)
3544 /* Preserve the original type of the expression. */
3545 tree type
= TREE_TYPE (*expr_p
);
3547 *expr_p
= build3 (COND_EXPR
, type
, *expr_p
,
3548 fold_convert (type
, boolean_true_node
),
3549 fold_convert (type
, boolean_false_node
));
3554 /* Gimplifies an expression sequence. This function gimplifies each
3555 expression and re-writes the original expression with the last
3556 expression of the sequence in GIMPLE form.
3558 PRE_P points to the list where the side effects for all the
3559 expressions in the sequence will be emitted.
3561 WANT_VALUE is true when the result of the last COMPOUND_EXPR is used. */
3562 /* ??? Should rearrange to share the pre-queue with all the indirect
3563 invocations of gimplify_expr. Would probably save on creations
3564 of statement_list nodes. */
3566 static enum gimplify_status
3567 gimplify_compound_expr (tree
*expr_p
, tree
*pre_p
, bool want_value
)
3573 tree
*sub_p
= &TREE_OPERAND (t
, 0);
3575 if (TREE_CODE (*sub_p
) == COMPOUND_EXPR
)
3576 gimplify_compound_expr (sub_p
, pre_p
, false);
3578 gimplify_stmt (sub_p
);
3579 append_to_statement_list (*sub_p
, pre_p
);
3581 t
= TREE_OPERAND (t
, 1);
3583 while (TREE_CODE (t
) == COMPOUND_EXPR
);
3590 gimplify_stmt (expr_p
);
3595 /* Gimplifies a statement list. These may be created either by an
3596 enlightened front-end, or by shortcut_cond_expr. */
3598 static enum gimplify_status
3599 gimplify_statement_list (tree
*expr_p
)
3601 tree_stmt_iterator i
= tsi_start (*expr_p
);
3603 while (!tsi_end_p (i
))
3607 gimplify_stmt (tsi_stmt_ptr (i
));
3612 else if (TREE_CODE (t
) == STATEMENT_LIST
)
3614 tsi_link_before (&i
, t
, TSI_SAME_STMT
);
3624 /* Gimplify a SAVE_EXPR node. EXPR_P points to the expression to
3625 gimplify. After gimplification, EXPR_P will point to a new temporary
3626 that holds the original value of the SAVE_EXPR node.
3628 PRE_P points to the list where side effects that must happen before
3629 *EXPR_P should be stored. */
3631 static enum gimplify_status
3632 gimplify_save_expr (tree
*expr_p
, tree
*pre_p
, tree
*post_p
)
3634 enum gimplify_status ret
= GS_ALL_DONE
;
3637 gcc_assert (TREE_CODE (*expr_p
) == SAVE_EXPR
);
3638 val
= TREE_OPERAND (*expr_p
, 0);
3640 /* If the SAVE_EXPR has not been resolved, then evaluate it once. */
3641 if (!SAVE_EXPR_RESOLVED_P (*expr_p
))
3643 /* The operand may be a void-valued expression such as SAVE_EXPRs
3644 generated by the Java frontend for class initialization. It is
3645 being executed only for its side-effects. */
3646 if (TREE_TYPE (val
) == void_type_node
)
3648 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
3649 is_gimple_stmt
, fb_none
);
3650 append_to_statement_list (TREE_OPERAND (*expr_p
, 0), pre_p
);
3654 val
= get_initialized_tmp_var (val
, pre_p
, post_p
);
3656 TREE_OPERAND (*expr_p
, 0) = val
;
3657 SAVE_EXPR_RESOLVED_P (*expr_p
) = 1;
3665 /* Re-write the ADDR_EXPR node pointed to by EXPR_P
3672 PRE_P points to the list where side effects that must happen before
3673 *EXPR_P should be stored.
3675 POST_P points to the list where side effects that must happen after
3676 *EXPR_P should be stored. */
3678 static enum gimplify_status
3679 gimplify_addr_expr (tree
*expr_p
, tree
*pre_p
, tree
*post_p
)
3681 tree expr
= *expr_p
;
3682 tree op0
= TREE_OPERAND (expr
, 0);
3683 enum gimplify_status ret
;
3685 switch (TREE_CODE (op0
))
3688 case MISALIGNED_INDIRECT_REF
:
3690 /* Check if we are dealing with an expression of the form '&*ptr'.
3691 While the front end folds away '&*ptr' into 'ptr', these
3692 expressions may be generated internally by the compiler (e.g.,
3693 builtins like __builtin_va_end). */
3694 /* Caution: the silent array decomposition semantics we allow for
3695 ADDR_EXPR means we can't always discard the pair. */
3696 /* Gimplification of the ADDR_EXPR operand may drop
3697 cv-qualification conversions, so make sure we add them if
3700 tree op00
= TREE_OPERAND (op0
, 0);
3701 tree t_expr
= TREE_TYPE (expr
);
3702 tree t_op00
= TREE_TYPE (op00
);
3704 if (!lang_hooks
.types_compatible_p (t_expr
, t_op00
))
3706 #ifdef ENABLE_CHECKING
3707 tree t_op0
= TREE_TYPE (op0
);
3708 gcc_assert (POINTER_TYPE_P (t_expr
)
3709 && cpt_same_type (TREE_CODE (t_op0
) == ARRAY_TYPE
3710 ? TREE_TYPE (t_op0
) : t_op0
,
3712 && POINTER_TYPE_P (t_op00
)
3713 && cpt_same_type (t_op0
, TREE_TYPE (t_op00
)));
3715 op00
= fold_convert (TREE_TYPE (expr
), op00
);
3722 case VIEW_CONVERT_EXPR
:
3723 /* Take the address of our operand and then convert it to the type of
3726 ??? The interactions of VIEW_CONVERT_EXPR and aliasing is not at
3727 all clear. The impact of this transformation is even less clear. */
3729 /* If the operand is a useless conversion, look through it. Doing so
3730 guarantees that the ADDR_EXPR and its operand will remain of the
3732 if (tree_ssa_useless_type_conversion (TREE_OPERAND (op0
, 0)))
3733 op0
= TREE_OPERAND (op0
, 0);
3735 *expr_p
= fold_convert (TREE_TYPE (expr
),
3736 build_fold_addr_expr (TREE_OPERAND (op0
, 0)));
3741 /* We use fb_either here because the C frontend sometimes takes
3742 the address of a call that returns a struct; see
3743 gcc.dg/c99-array-lval-1.c. The gimplifier will correctly make
3744 the implied temporary explicit. */
3745 ret
= gimplify_expr (&TREE_OPERAND (expr
, 0), pre_p
, post_p
,
3746 is_gimple_addressable
, fb_either
);
3747 if (ret
!= GS_ERROR
)
3749 op0
= TREE_OPERAND (expr
, 0);
3751 /* For various reasons, the gimplification of the expression
3752 may have made a new INDIRECT_REF. */
3753 if (TREE_CODE (op0
) == INDIRECT_REF
)
3754 goto do_indirect_ref
;
3756 /* Make sure TREE_INVARIANT, TREE_CONSTANT, and TREE_SIDE_EFFECTS
3758 recompute_tree_invariant_for_addr_expr (expr
);
3760 /* Mark the RHS addressable. */
3761 lang_hooks
.mark_addressable (TREE_OPERAND (expr
, 0));
3769 /* Gimplify the operands of an ASM_EXPR. Input operands should be a gimple
3770 value; output operands should be a gimple lvalue. */
3772 static enum gimplify_status
3773 gimplify_asm_expr (tree
*expr_p
, tree
*pre_p
, tree
*post_p
)
3775 tree expr
= *expr_p
;
3776 int noutputs
= list_length (ASM_OUTPUTS (expr
));
3777 const char **oconstraints
3778 = (const char **) alloca ((noutputs
) * sizeof (const char *));
3781 const char *constraint
;
3782 bool allows_mem
, allows_reg
, is_inout
;
3783 enum gimplify_status ret
, tret
;
3786 for (i
= 0, link
= ASM_OUTPUTS (expr
); link
; ++i
, link
= TREE_CHAIN (link
))
3788 size_t constraint_len
;
3789 oconstraints
[i
] = constraint
3790 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link
)));
3791 constraint_len
= strlen (constraint
);
3792 if (constraint_len
== 0)
3795 parse_output_constraint (&constraint
, i
, 0, 0,
3796 &allows_mem
, &allows_reg
, &is_inout
);
3798 if (!allows_reg
&& allows_mem
)
3799 lang_hooks
.mark_addressable (TREE_VALUE (link
));
3801 tret
= gimplify_expr (&TREE_VALUE (link
), pre_p
, post_p
,
3802 is_inout
? is_gimple_min_lval
: is_gimple_lvalue
,
3803 fb_lvalue
| fb_mayfail
);
3804 if (tret
== GS_ERROR
)
3806 error ("invalid lvalue in asm output %d", i
);
3812 /* An input/output operand. To give the optimizers more
3813 flexibility, split it into separate input and output
3818 /* Turn the in/out constraint into an output constraint. */
3819 char *p
= xstrdup (constraint
);
3821 TREE_VALUE (TREE_PURPOSE (link
)) = build_string (constraint_len
, p
);
3823 /* And add a matching input constraint. */
3826 sprintf (buf
, "%d", i
);
3828 /* If there are multiple alternatives in the constraint,
3829 handle each of them individually. Those that allow register
3830 will be replaced with operand number, the others will stay
3832 if (strchr (p
, ',') != NULL
)
3834 size_t len
= 0, buflen
= strlen (buf
);
3835 char *beg
, *end
, *str
, *dst
;
3839 end
= strchr (beg
, ',');
3841 end
= strchr (beg
, '\0');
3842 if ((size_t) (end
- beg
) < buflen
)
3845 len
+= end
- beg
+ 1;
3852 str
= (char *) alloca (len
);
3853 for (beg
= p
+ 1, dst
= str
;;)
3856 bool mem_p
, reg_p
, inout_p
;
3858 end
= strchr (beg
, ',');
3863 parse_output_constraint (&tem
, i
, 0, 0,
3864 &mem_p
, ®_p
, &inout_p
);
3869 memcpy (dst
, buf
, buflen
);
3878 memcpy (dst
, beg
, len
);
3887 input
= build_string (dst
- str
, str
);
3890 input
= build_string (strlen (buf
), buf
);
3893 input
= build_string (constraint_len
- 1, constraint
+ 1);
3897 input
= build_tree_list (build_tree_list (NULL_TREE
, input
),
3898 unshare_expr (TREE_VALUE (link
)));
3899 ASM_INPUTS (expr
) = chainon (ASM_INPUTS (expr
), input
);
3903 for (link
= ASM_INPUTS (expr
); link
; ++i
, link
= TREE_CHAIN (link
))
3906 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link
)));
3907 parse_input_constraint (&constraint
, 0, 0, noutputs
, 0,
3908 oconstraints
, &allows_mem
, &allows_reg
);
3910 /* If the operand is a memory input, it should be an lvalue. */
3911 if (!allows_reg
&& allows_mem
)
3913 lang_hooks
.mark_addressable (TREE_VALUE (link
));
3914 tret
= gimplify_expr (&TREE_VALUE (link
), pre_p
, post_p
,
3915 is_gimple_lvalue
, fb_lvalue
| fb_mayfail
);
3916 if (tret
== GS_ERROR
)
3918 error ("memory input %d is not directly addressable", i
);
3924 tret
= gimplify_expr (&TREE_VALUE (link
), pre_p
, post_p
,
3925 is_gimple_asm_val
, fb_rvalue
);
3926 if (tret
== GS_ERROR
)
3934 /* Gimplify a CLEANUP_POINT_EXPR. Currently this works by adding
3935 WITH_CLEANUP_EXPRs to the prequeue as we encounter cleanups while
3936 gimplifying the body, and converting them to TRY_FINALLY_EXPRs when we
3937 return to this function.
3939 FIXME should we complexify the prequeue handling instead? Or use flags
3940 for all the cleanups and let the optimizer tighten them up? The current
3941 code seems pretty fragile; it will break on a cleanup within any
3942 non-conditional nesting. But any such nesting would be broken, anyway;
3943 we can't write a TRY_FINALLY_EXPR that starts inside a nesting construct
3944 and continues out of it. We can do that at the RTL level, though, so
3945 having an optimizer to tighten up try/finally regions would be a Good
3948 static enum gimplify_status
3949 gimplify_cleanup_point_expr (tree
*expr_p
, tree
*pre_p
)
3951 tree_stmt_iterator iter
;
3954 tree temp
= voidify_wrapper_expr (*expr_p
, NULL
);
3956 /* We only care about the number of conditions between the innermost
3957 CLEANUP_POINT_EXPR and the cleanup. So save and reset the count and
3958 any cleanups collected outside the CLEANUP_POINT_EXPR. */
3959 int old_conds
= gimplify_ctxp
->conditions
;
3960 tree old_cleanups
= gimplify_ctxp
->conditional_cleanups
;
3961 gimplify_ctxp
->conditions
= 0;
3962 gimplify_ctxp
->conditional_cleanups
= NULL_TREE
;
3964 body
= TREE_OPERAND (*expr_p
, 0);
3965 gimplify_to_stmt_list (&body
);
3967 gimplify_ctxp
->conditions
= old_conds
;
3968 gimplify_ctxp
->conditional_cleanups
= old_cleanups
;
3970 for (iter
= tsi_start (body
); !tsi_end_p (iter
); )
3972 tree
*wce_p
= tsi_stmt_ptr (iter
);
3975 if (TREE_CODE (wce
) == WITH_CLEANUP_EXPR
)
3977 if (tsi_one_before_end_p (iter
))
3979 tsi_link_before (&iter
, TREE_OPERAND (wce
, 0), TSI_SAME_STMT
);
3986 enum tree_code code
;
3988 if (CLEANUP_EH_ONLY (wce
))
3989 code
= TRY_CATCH_EXPR
;
3991 code
= TRY_FINALLY_EXPR
;
3993 sl
= tsi_split_statement_list_after (&iter
);
3994 tfe
= build2 (code
, void_type_node
, sl
, NULL_TREE
);
3995 append_to_statement_list (TREE_OPERAND (wce
, 0),
3996 &TREE_OPERAND (tfe
, 1));
3998 iter
= tsi_start (sl
);
4008 append_to_statement_list (body
, pre_p
);
4018 /* Insert a cleanup marker for gimplify_cleanup_point_expr. CLEANUP
4019 is the cleanup action required. */
4022 gimple_push_cleanup (tree var
, tree cleanup
, bool eh_only
, tree
*pre_p
)
4026 /* Errors can result in improperly nested cleanups. Which results in
4027 confusion when trying to resolve the WITH_CLEANUP_EXPR. */
4028 if (errorcount
|| sorrycount
)
4031 if (gimple_conditional_context ())
4033 /* If we're in a conditional context, this is more complex. We only
4034 want to run the cleanup if we actually ran the initialization that
4035 necessitates it, but we want to run it after the end of the
4036 conditional context. So we wrap the try/finally around the
4037 condition and use a flag to determine whether or not to actually
4038 run the destructor. Thus
4042 becomes (approximately)
4046 if (test) { A::A(temp); flag = 1; val = f(temp); }
4049 if (flag) A::~A(temp);
4054 tree flag
= create_tmp_var (boolean_type_node
, "cleanup");
4055 tree ffalse
= build2 (MODIFY_EXPR
, void_type_node
, flag
,
4056 boolean_false_node
);
4057 tree ftrue
= build2 (MODIFY_EXPR
, void_type_node
, flag
,
4059 cleanup
= build3 (COND_EXPR
, void_type_node
, flag
, cleanup
, NULL
);
4060 wce
= build1 (WITH_CLEANUP_EXPR
, void_type_node
, cleanup
);
4061 append_to_statement_list (ffalse
, &gimplify_ctxp
->conditional_cleanups
);
4062 append_to_statement_list (wce
, &gimplify_ctxp
->conditional_cleanups
);
4063 append_to_statement_list (ftrue
, pre_p
);
4065 /* Because of this manipulation, and the EH edges that jump
4066 threading cannot redirect, the temporary (VAR) will appear
4067 to be used uninitialized. Don't warn. */
4068 TREE_NO_WARNING (var
) = 1;
4072 wce
= build1 (WITH_CLEANUP_EXPR
, void_type_node
, cleanup
);
4073 CLEANUP_EH_ONLY (wce
) = eh_only
;
4074 append_to_statement_list (wce
, pre_p
);
4077 gimplify_stmt (&TREE_OPERAND (wce
, 0));
4080 /* Gimplify a TARGET_EXPR which doesn't appear on the rhs of an INIT_EXPR. */
4082 static enum gimplify_status
4083 gimplify_target_expr (tree
*expr_p
, tree
*pre_p
, tree
*post_p
)
4085 tree targ
= *expr_p
;
4086 tree temp
= TARGET_EXPR_SLOT (targ
);
4087 tree init
= TARGET_EXPR_INITIAL (targ
);
4088 enum gimplify_status ret
;
4092 /* TARGET_EXPR temps aren't part of the enclosing block, so add it
4093 to the temps list. */
4094 gimple_add_tmp_var (temp
);
4096 /* If TARGET_EXPR_INITIAL is void, then the mere evaluation of the
4097 expression is supposed to initialize the slot. */
4098 if (VOID_TYPE_P (TREE_TYPE (init
)))
4099 ret
= gimplify_expr (&init
, pre_p
, post_p
, is_gimple_stmt
, fb_none
);
4102 /* Special handling for BIND_EXPR can result in fewer temps. */
4104 if (TREE_CODE (init
) == BIND_EXPR
)
4105 gimplify_bind_expr (&init
, temp
, pre_p
);
4108 init
= build2 (INIT_EXPR
, void_type_node
, temp
, init
);
4109 ret
= gimplify_expr (&init
, pre_p
, post_p
, is_gimple_stmt
,
4113 if (ret
== GS_ERROR
)
4115 append_to_statement_list (init
, pre_p
);
4117 /* If needed, push the cleanup for the temp. */
4118 if (TARGET_EXPR_CLEANUP (targ
))
4120 gimplify_stmt (&TARGET_EXPR_CLEANUP (targ
));
4121 gimple_push_cleanup (temp
, TARGET_EXPR_CLEANUP (targ
),
4122 CLEANUP_EH_ONLY (targ
), pre_p
);
4125 /* Only expand this once. */
4126 TREE_OPERAND (targ
, 3) = init
;
4127 TARGET_EXPR_INITIAL (targ
) = NULL_TREE
;
4130 /* We should have expanded this before. */
4131 gcc_assert (DECL_SEEN_IN_BIND_EXPR_P (temp
));
4137 /* Gimplification of expression trees. */
4139 /* Gimplify an expression which appears at statement context; usually, this
4140 means replacing it with a suitably gimple STATEMENT_LIST. */
4143 gimplify_stmt (tree
*stmt_p
)
4145 gimplify_expr (stmt_p
, NULL
, NULL
, is_gimple_stmt
, fb_none
);
4148 /* Similarly, but force the result to be a STATEMENT_LIST. */
4151 gimplify_to_stmt_list (tree
*stmt_p
)
4153 gimplify_stmt (stmt_p
);
4155 *stmt_p
= alloc_stmt_list ();
4156 else if (TREE_CODE (*stmt_p
) != STATEMENT_LIST
)
4159 *stmt_p
= alloc_stmt_list ();
4160 append_to_statement_list (t
, stmt_p
);
4165 /* Add FIRSTPRIVATE entries for DECL in the OpenMP the surrounding parallels
4166 to CTX. If entries already exist, force them to be some flavor of private.
4167 If there is no enclosing parallel, do nothing. */
4170 omp_firstprivatize_variable (struct gimplify_omp_ctx
*ctx
, tree decl
)
4174 if (decl
== NULL
|| !DECL_P (decl
))
4179 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
)decl
);
4182 if (n
->value
& GOVD_SHARED
)
4183 n
->value
= GOVD_FIRSTPRIVATE
| (n
->value
& GOVD_SEEN
);
4187 else if (ctx
->is_parallel
)
4188 omp_add_variable (ctx
, decl
, GOVD_FIRSTPRIVATE
);
4190 ctx
= ctx
->outer_context
;
4195 /* Similarly for each of the type sizes of TYPE. */
4198 omp_firstprivatize_type_sizes (struct gimplify_omp_ctx
*ctx
, tree type
)
4200 if (type
== NULL
|| type
== error_mark_node
)
4202 type
= TYPE_MAIN_VARIANT (type
);
4204 if (pointer_set_insert (ctx
->privatized_types
, type
))
4207 switch (TREE_CODE (type
))
4213 omp_firstprivatize_variable (ctx
, TYPE_MIN_VALUE (type
));
4214 omp_firstprivatize_variable (ctx
, TYPE_MAX_VALUE (type
));
4218 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (type
));
4219 omp_firstprivatize_type_sizes (ctx
, TYPE_DOMAIN (type
));
4224 case QUAL_UNION_TYPE
:
4227 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
4228 if (TREE_CODE (field
) == FIELD_DECL
)
4230 omp_firstprivatize_variable (ctx
, DECL_FIELD_OFFSET (field
));
4231 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (field
));
4237 case REFERENCE_TYPE
:
4238 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (type
));
4245 omp_firstprivatize_variable (ctx
, TYPE_SIZE (type
));
4246 omp_firstprivatize_variable (ctx
, TYPE_SIZE_UNIT (type
));
4247 lang_hooks
.types
.omp_firstprivatize_type_sizes (ctx
, type
);
4250 /* Add an entry for DECL in the OpenMP context CTX with FLAGS. */
4253 omp_add_variable (struct gimplify_omp_ctx
*ctx
, tree decl
, unsigned int flags
)
4256 unsigned int nflags
;
4259 if (decl
== error_mark_node
|| TREE_TYPE (decl
) == error_mark_node
)
4262 /* Never elide decls whose type has TREE_ADDRESSABLE set. This means
4263 there are constructors involved somewhere. */
4264 if (TREE_ADDRESSABLE (TREE_TYPE (decl
))
4265 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
)))
4268 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
)decl
);
4271 /* We shouldn't be re-adding the decl with the same data
4273 gcc_assert ((n
->value
& GOVD_DATA_SHARE_CLASS
& flags
) == 0);
4274 /* The only combination of data sharing classes we should see is
4275 FIRSTPRIVATE and LASTPRIVATE. */
4276 nflags
= n
->value
| flags
;
4277 gcc_assert ((nflags
& GOVD_DATA_SHARE_CLASS
)
4278 == (GOVD_FIRSTPRIVATE
| GOVD_LASTPRIVATE
));
4283 /* When adding a variable-sized variable, we have to handle all sorts
4284 of additional bits of data: the pointer replacement variable, and
4285 the parameters of the type. */
4286 if (DECL_SIZE (decl
) && !TREE_CONSTANT (DECL_SIZE (decl
)))
4288 /* Add the pointer replacement variable as PRIVATE if the variable
4289 replacement is private, else FIRSTPRIVATE since we'll need the
4290 address of the original variable either for SHARED, or for the
4291 copy into or out of the context. */
4292 if (!(flags
& GOVD_LOCAL
))
4294 nflags
= flags
& GOVD_PRIVATE
? GOVD_PRIVATE
: GOVD_FIRSTPRIVATE
;
4295 nflags
|= flags
& GOVD_SEEN
;
4296 t
= DECL_VALUE_EXPR (decl
);
4297 gcc_assert (TREE_CODE (t
) == INDIRECT_REF
);
4298 t
= TREE_OPERAND (t
, 0);
4299 gcc_assert (DECL_P (t
));
4300 omp_add_variable (ctx
, t
, nflags
);
4303 /* Add all of the variable and type parameters (which should have
4304 been gimplified to a formal temporary) as FIRSTPRIVATE. */
4305 omp_firstprivatize_variable (ctx
, DECL_SIZE_UNIT (decl
));
4306 omp_firstprivatize_variable (ctx
, DECL_SIZE (decl
));
4307 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (decl
));
4309 /* The variable-sized variable itself is never SHARED, only some form
4310 of PRIVATE. The sharing would take place via the pointer variable
4311 which we remapped above. */
4312 if (flags
& GOVD_SHARED
)
4313 flags
= GOVD_PRIVATE
| GOVD_DEBUG_PRIVATE
4314 | (flags
& (GOVD_SEEN
| GOVD_EXPLICIT
));
4316 /* We're going to make use of the TYPE_SIZE_UNIT at least in the
4317 alloca statement we generate for the variable, so make sure it
4318 is available. This isn't automatically needed for the SHARED
4319 case, since we won't be allocating local storage then. */
4321 omp_notice_variable (ctx
, TYPE_SIZE_UNIT (TREE_TYPE (decl
)), true);
4323 else if (lang_hooks
.decls
.omp_privatize_by_reference (decl
))
4325 gcc_assert ((flags
& GOVD_LOCAL
) == 0);
4326 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (decl
));
4328 /* Similar to the direct variable sized case above, we'll need the
4329 size of references being privatized. */
4330 if ((flags
& GOVD_SHARED
) == 0)
4332 t
= TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (decl
)));
4333 if (!TREE_CONSTANT (t
))
4334 omp_notice_variable (ctx
, t
, true);
4338 splay_tree_insert (ctx
->variables
, (splay_tree_key
)decl
, flags
);
4341 /* Record the fact that DECL was used within the OpenMP context CTX.
4342 IN_CODE is true when real code uses DECL, and false when we should
4343 merely emit default(none) errors. Return true if DECL is going to
4344 be remapped and thus DECL shouldn't be gimplified into its
4345 DECL_VALUE_EXPR (if any). */
4348 omp_notice_variable (struct gimplify_omp_ctx
*ctx
, tree decl
, bool in_code
)
4351 unsigned flags
= in_code
? GOVD_SEEN
: 0;
4352 bool ret
= false, shared
;
4354 if (decl
== error_mark_node
|| TREE_TYPE (decl
) == error_mark_node
)
4357 /* Threadprivate variables are predetermined. */
4358 if (is_global_var (decl
))
4360 if (DECL_THREAD_LOCAL_P (decl
))
4363 if (DECL_HAS_VALUE_EXPR_P (decl
))
4365 tree value
= get_base_address (DECL_VALUE_EXPR (decl
));
4367 if (value
&& DECL_P (value
) && DECL_THREAD_LOCAL_P (value
))
4372 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
)decl
);
4375 enum omp_clause_default_kind default_kind
, kind
;
4377 if (!ctx
->is_parallel
)
4380 /* ??? Some compiler-generated variables (like SAVE_EXPRs) could be
4381 remapped firstprivate instead of shared. To some extent this is
4382 addressed in omp_firstprivatize_type_sizes, but not effectively. */
4383 default_kind
= ctx
->default_kind
;
4384 kind
= lang_hooks
.decls
.omp_predetermined_sharing (decl
);
4385 if (kind
!= OMP_CLAUSE_DEFAULT_UNSPECIFIED
)
4386 default_kind
= kind
;
4388 switch (default_kind
)
4390 case OMP_CLAUSE_DEFAULT_NONE
:
4391 error ("%qs not specified in enclosing parallel",
4392 IDENTIFIER_POINTER (DECL_NAME (decl
)));
4393 error ("%Henclosing parallel", &ctx
->location
);
4395 case OMP_CLAUSE_DEFAULT_SHARED
:
4396 flags
|= GOVD_SHARED
;
4398 case OMP_CLAUSE_DEFAULT_PRIVATE
:
4399 flags
|= GOVD_PRIVATE
;
4405 omp_add_variable (ctx
, decl
, flags
);
4407 shared
= (flags
& GOVD_SHARED
) != 0;
4408 ret
= lang_hooks
.decls
.omp_disregard_value_expr (decl
, shared
);
4412 shared
= ((flags
| n
->value
) & GOVD_SHARED
) != 0;
4413 ret
= lang_hooks
.decls
.omp_disregard_value_expr (decl
, shared
);
4415 /* If nothing changed, there's nothing left to do. */
4416 if ((n
->value
& flags
) == flags
)
4422 /* If the variable is private in the current context, then we don't
4423 need to propagate anything to an outer context. */
4424 if (flags
& GOVD_PRIVATE
)
4426 if (ctx
->outer_context
4427 && omp_notice_variable (ctx
->outer_context
, decl
, in_code
))
4432 /* Verify that DECL is private within CTX. If there's specific information
4433 to the contrary in the innermost scope, generate an error. */
4436 omp_is_private (struct gimplify_omp_ctx
*ctx
, tree decl
)
4440 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
)decl
);
4443 if (n
->value
& GOVD_SHARED
)
4445 if (ctx
== gimplify_omp_ctxp
)
4446 error ("iteration variable %qs should be private",
4447 IDENTIFIER_POINTER (DECL_NAME (decl
)));
4448 n
->value
= GOVD_PRIVATE
;
4453 if (ctx
->outer_context
)
4454 return omp_is_private (ctx
->outer_context
, decl
);
4455 else if (ctx
->is_parallel
)
4458 return !is_global_var (decl
);
4461 /* Scan the OpenMP clauses in *LIST_P, installing mappings into a new
4462 and previous omp contexts. */
4465 gimplify_scan_omp_clauses (tree
*list_p
, tree
*pre_p
, bool in_parallel
)
4467 struct gimplify_omp_ctx
*ctx
, *outer_ctx
;
4470 ctx
= new_omp_context (in_parallel
);
4471 outer_ctx
= ctx
->outer_context
;
4473 while ((c
= *list_p
) != NULL
)
4475 enum gimplify_status gs
;
4476 bool remove
= false;
4477 bool notice_outer
= true;
4481 switch (OMP_CLAUSE_CODE (c
))
4483 case OMP_CLAUSE_PRIVATE
:
4484 flags
= GOVD_PRIVATE
| GOVD_EXPLICIT
;
4485 notice_outer
= false;
4487 case OMP_CLAUSE_SHARED
:
4488 flags
= GOVD_SHARED
| GOVD_EXPLICIT
;
4490 case OMP_CLAUSE_FIRSTPRIVATE
:
4491 flags
= GOVD_FIRSTPRIVATE
| GOVD_EXPLICIT
;
4493 case OMP_CLAUSE_LASTPRIVATE
:
4494 flags
= GOVD_LASTPRIVATE
| GOVD_SEEN
| GOVD_EXPLICIT
;
4496 case OMP_CLAUSE_REDUCTION
:
4497 flags
= GOVD_REDUCTION
| GOVD_SEEN
| GOVD_EXPLICIT
;
4501 decl
= OMP_CLAUSE_DECL (c
);
4502 if (decl
== error_mark_node
|| TREE_TYPE (decl
) == error_mark_node
)
4507 omp_add_variable (ctx
, decl
, flags
);
4508 if (TREE_CODE (c
) == OMP_CLAUSE_REDUCTION
4509 && OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
))
4511 omp_add_variable (ctx
, OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
),
4513 gimplify_omp_ctxp
= ctx
;
4514 push_gimplify_context ();
4515 gimplify_stmt (&OMP_CLAUSE_REDUCTION_INIT (c
));
4516 pop_gimplify_context (OMP_CLAUSE_REDUCTION_INIT (c
));
4517 push_gimplify_context ();
4518 gimplify_stmt (&OMP_CLAUSE_REDUCTION_MERGE (c
));
4519 pop_gimplify_context (OMP_CLAUSE_REDUCTION_MERGE (c
));
4520 gimplify_omp_ctxp
= outer_ctx
;
4526 case OMP_CLAUSE_COPYIN
:
4527 case OMP_CLAUSE_COPYPRIVATE
:
4528 decl
= OMP_CLAUSE_DECL (c
);
4529 if (decl
== error_mark_node
|| TREE_TYPE (decl
) == error_mark_node
)
4536 omp_notice_variable (outer_ctx
, decl
, true);
4540 OMP_CLAUSE_OPERAND (c
, 0)
4541 = gimple_boolify (OMP_CLAUSE_OPERAND (c
, 0));
4544 case OMP_CLAUSE_SCHEDULE
:
4545 case OMP_CLAUSE_NUM_THREADS
:
4546 gs
= gimplify_expr (&OMP_CLAUSE_OPERAND (c
, 0), pre_p
, NULL
,
4547 is_gimple_val
, fb_rvalue
);
4552 case OMP_CLAUSE_NOWAIT
:
4553 case OMP_CLAUSE_ORDERED
:
4556 case OMP_CLAUSE_DEFAULT
:
4557 ctx
->default_kind
= OMP_CLAUSE_DEFAULT_KIND (c
);
4565 *list_p
= OMP_CLAUSE_CHAIN (c
);
4567 list_p
= &OMP_CLAUSE_CHAIN (c
);
4570 gimplify_omp_ctxp
= ctx
;
4573 /* For all variables that were not actually used within the context,
4574 remove PRIVATE, SHARED, and FIRSTPRIVATE clauses. */
4577 gimplify_adjust_omp_clauses_1 (splay_tree_node n
, void *data
)
4579 tree
*list_p
= (tree
*) data
;
4580 tree decl
= (tree
) n
->key
;
4581 unsigned flags
= n
->value
;
4582 enum omp_clause_code code
;
4586 if (flags
& (GOVD_EXPLICIT
| GOVD_LOCAL
))
4588 if ((flags
& GOVD_SEEN
) == 0)
4590 if (flags
& GOVD_DEBUG_PRIVATE
)
4592 gcc_assert ((flags
& GOVD_DATA_SHARE_CLASS
) == GOVD_PRIVATE
);
4593 private_debug
= true;
4597 = lang_hooks
.decls
.omp_private_debug_clause (decl
,
4598 !!(flags
& GOVD_SHARED
));
4600 code
= OMP_CLAUSE_PRIVATE
;
4601 else if (flags
& GOVD_SHARED
)
4603 if (is_global_var (decl
))
4605 code
= OMP_CLAUSE_SHARED
;
4607 else if (flags
& GOVD_PRIVATE
)
4608 code
= OMP_CLAUSE_PRIVATE
;
4609 else if (flags
& GOVD_FIRSTPRIVATE
)
4610 code
= OMP_CLAUSE_FIRSTPRIVATE
;
4614 clause
= build_omp_clause (code
);
4615 OMP_CLAUSE_DECL (clause
) = decl
;
4616 OMP_CLAUSE_CHAIN (clause
) = *list_p
;
4618 OMP_CLAUSE_PRIVATE_DEBUG (clause
) = 1;
4625 gimplify_adjust_omp_clauses (tree
*list_p
)
4627 struct gimplify_omp_ctx
*ctx
= gimplify_omp_ctxp
;
4630 while ((c
= *list_p
) != NULL
)
4633 bool remove
= false;
4635 switch (OMP_CLAUSE_CODE (c
))
4637 case OMP_CLAUSE_PRIVATE
:
4638 case OMP_CLAUSE_SHARED
:
4639 case OMP_CLAUSE_FIRSTPRIVATE
:
4640 decl
= OMP_CLAUSE_DECL (c
);
4641 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
) decl
);
4642 remove
= !(n
->value
& GOVD_SEEN
);
4645 bool shared
= OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_SHARED
;
4646 if ((n
->value
& GOVD_DEBUG_PRIVATE
)
4647 || lang_hooks
.decls
.omp_private_debug_clause (decl
, shared
))
4649 gcc_assert ((n
->value
& GOVD_DEBUG_PRIVATE
) == 0
4650 || ((n
->value
& GOVD_DATA_SHARE_CLASS
)
4652 OMP_CLAUSE_SET_CODE (c
, OMP_CLAUSE_PRIVATE
);
4653 OMP_CLAUSE_PRIVATE_DEBUG (c
) = 1;
4658 case OMP_CLAUSE_LASTPRIVATE
:
4659 /* Make sure OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE is set to
4660 accurately reflect the presence of a FIRSTPRIVATE clause. */
4661 decl
= OMP_CLAUSE_DECL (c
);
4662 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
) decl
);
4663 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE (c
)
4664 = (n
->value
& GOVD_FIRSTPRIVATE
) != 0;
4667 case OMP_CLAUSE_REDUCTION
:
4668 case OMP_CLAUSE_COPYIN
:
4669 case OMP_CLAUSE_COPYPRIVATE
:
4671 case OMP_CLAUSE_NUM_THREADS
:
4672 case OMP_CLAUSE_SCHEDULE
:
4673 case OMP_CLAUSE_NOWAIT
:
4674 case OMP_CLAUSE_ORDERED
:
4675 case OMP_CLAUSE_DEFAULT
:
4683 *list_p
= OMP_CLAUSE_CHAIN (c
);
4685 list_p
= &OMP_CLAUSE_CHAIN (c
);
4688 /* Add in any implicit data sharing. */
4689 splay_tree_foreach (ctx
->variables
, gimplify_adjust_omp_clauses_1
, list_p
);
4691 gimplify_omp_ctxp
= ctx
->outer_context
;
4692 delete_omp_context (ctx
);
4695 /* Gimplify the contents of an OMP_PARALLEL statement. This involves
4696 gimplification of the body, as well as scanning the body for used
4697 variables. We need to do this scan now, because variable-sized
4698 decls will be decomposed during gimplification. */
4700 static enum gimplify_status
4701 gimplify_omp_parallel (tree
*expr_p
, tree
*pre_p
)
4703 tree expr
= *expr_p
;
4705 gimplify_scan_omp_clauses (&OMP_PARALLEL_CLAUSES (expr
), pre_p
, true);
4707 push_gimplify_context ();
4709 gimplify_stmt (&OMP_PARALLEL_BODY (expr
));
4711 if (TREE_CODE (OMP_PARALLEL_BODY (expr
)) == BIND_EXPR
)
4712 pop_gimplify_context (OMP_PARALLEL_BODY (expr
));
4714 pop_gimplify_context (NULL_TREE
);
4716 gimplify_adjust_omp_clauses (&OMP_PARALLEL_CLAUSES (expr
));
4721 /* Gimplify the gross structure of an OMP_FOR statement. */
4723 static enum gimplify_status
4724 gimplify_omp_for (tree
*expr_p
, tree
*pre_p
)
4726 tree for_stmt
, decl
, t
;
4727 enum gimplify_status ret
= 0;
4731 gimplify_scan_omp_clauses (&OMP_FOR_CLAUSES (for_stmt
), pre_p
, false);
4733 t
= OMP_FOR_INIT (for_stmt
);
4734 gcc_assert (TREE_CODE (t
) == MODIFY_EXPR
);
4735 decl
= TREE_OPERAND (t
, 0);
4736 gcc_assert (DECL_P (decl
));
4737 gcc_assert (INTEGRAL_TYPE_P (TREE_TYPE (decl
)));
4738 gcc_assert (!TYPE_UNSIGNED (TREE_TYPE (decl
)));
4740 /* Make sure the iteration variable is private. */
4741 if (omp_is_private (gimplify_omp_ctxp
, decl
))
4742 omp_notice_variable (gimplify_omp_ctxp
, decl
, true);
4744 omp_add_variable (gimplify_omp_ctxp
, decl
, GOVD_PRIVATE
| GOVD_SEEN
);
4746 ret
|= gimplify_expr (&TREE_OPERAND (t
, 1), &OMP_FOR_PRE_BODY (for_stmt
),
4747 NULL
, is_gimple_val
, fb_rvalue
);
4749 t
= OMP_FOR_COND (for_stmt
);
4750 gcc_assert (COMPARISON_CLASS_P (t
));
4751 gcc_assert (TREE_OPERAND (t
, 0) == decl
);
4753 ret
|= gimplify_expr (&TREE_OPERAND (t
, 1), &OMP_FOR_PRE_BODY (for_stmt
),
4754 NULL
, is_gimple_val
, fb_rvalue
);
4756 t
= OMP_FOR_INCR (for_stmt
);
4757 switch (TREE_CODE (t
))
4759 case PREINCREMENT_EXPR
:
4760 case POSTINCREMENT_EXPR
:
4761 t
= build_int_cst (TREE_TYPE (decl
), 1);
4763 case PREDECREMENT_EXPR
:
4764 case POSTDECREMENT_EXPR
:
4765 t
= build_int_cst (TREE_TYPE (decl
), -1);
4768 t
= build2 (PLUS_EXPR
, TREE_TYPE (decl
), decl
, t
);
4769 t
= build2 (MODIFY_EXPR
, void_type_node
, decl
, t
);
4770 OMP_FOR_INCR (for_stmt
) = t
;
4774 gcc_assert (TREE_OPERAND (t
, 0) == decl
);
4775 t
= TREE_OPERAND (t
, 1);
4776 switch (TREE_CODE (t
))
4779 if (TREE_OPERAND (t
, 1) == decl
)
4781 TREE_OPERAND (t
, 1) = TREE_OPERAND (t
, 0);
4782 TREE_OPERAND (t
, 0) = decl
;
4786 gcc_assert (TREE_OPERAND (t
, 0) == decl
);
4792 ret
|= gimplify_expr (&TREE_OPERAND (t
, 1), &OMP_FOR_PRE_BODY (for_stmt
),
4793 NULL
, is_gimple_val
, fb_rvalue
);
4800 gimplify_to_stmt_list (&OMP_FOR_BODY (for_stmt
));
4801 gimplify_adjust_omp_clauses (&OMP_FOR_CLAUSES (for_stmt
));
4803 return ret
== GS_ALL_DONE
? GS_ALL_DONE
: GS_ERROR
;
4806 /* Gimplify the gross structure of other OpenMP worksharing constructs.
4807 In particular, OMP_SECTIONS and OMP_SINGLE. */
4809 static enum gimplify_status
4810 gimplify_omp_workshare (tree
*expr_p
, tree
*pre_p
)
4812 tree stmt
= *expr_p
;
4814 gimplify_scan_omp_clauses (&OMP_CLAUSES (stmt
), pre_p
, false);
4815 gimplify_to_stmt_list (&OMP_BODY (stmt
));
4816 gimplify_adjust_omp_clauses (&OMP_CLAUSES (stmt
));
4821 /* A subroutine of gimplify_omp_atomic. The front end is supposed to have
4822 stabilized the lhs of the atomic operation as *ADDR. Return true if
4823 EXPR is this stabilized form. */
4826 goa_lhs_expr_p (tree expr
, tree addr
)
4828 /* Also include casts to other type variants. The C front end is fond
4829 of adding these for e.g. volatile variables. This is like
4830 STRIP_TYPE_NOPS but includes the main variant lookup. */
4831 while ((TREE_CODE (expr
) == NOP_EXPR
4832 || TREE_CODE (expr
) == CONVERT_EXPR
4833 || TREE_CODE (expr
) == NON_LVALUE_EXPR
)
4834 && TREE_OPERAND (expr
, 0) != error_mark_node
4835 && (TYPE_MAIN_VARIANT (TREE_TYPE (expr
))
4836 == TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (expr
, 0)))))
4837 expr
= TREE_OPERAND (expr
, 0);
4839 if (TREE_CODE (expr
) == INDIRECT_REF
&& TREE_OPERAND (expr
, 0) == addr
)
4841 if (TREE_CODE (addr
) == ADDR_EXPR
&& expr
== TREE_OPERAND (addr
, 0))
4846 /* A subroutine of gimplify_omp_atomic. Attempt to implement the atomic
4847 operation as a __sync_fetch_and_op builtin. INDEX is log2 of the
4848 size of the data type, and thus usable to find the index of the builtin
4849 decl. Returns GS_UNHANDLED if the expression is not of the proper form. */
4851 static enum gimplify_status
4852 gimplify_omp_atomic_fetch_op (tree
*expr_p
, tree addr
, tree rhs
, int index
)
4854 enum built_in_function base
;
4855 tree decl
, args
, itype
;
4856 enum insn_code
*optab
;
4858 /* Check for one of the supported fetch-op operations. */
4859 switch (TREE_CODE (rhs
))
4862 base
= BUILT_IN_FETCH_AND_ADD_N
;
4863 optab
= sync_add_optab
;
4866 base
= BUILT_IN_FETCH_AND_SUB_N
;
4867 optab
= sync_add_optab
;
4870 base
= BUILT_IN_FETCH_AND_AND_N
;
4871 optab
= sync_and_optab
;
4874 base
= BUILT_IN_FETCH_AND_OR_N
;
4875 optab
= sync_ior_optab
;
4878 base
= BUILT_IN_FETCH_AND_XOR_N
;
4879 optab
= sync_xor_optab
;
4882 return GS_UNHANDLED
;
4885 /* Make sure the expression is of the proper form. */
4886 if (goa_lhs_expr_p (TREE_OPERAND (rhs
, 0), addr
))
4887 rhs
= TREE_OPERAND (rhs
, 1);
4888 else if (commutative_tree_code (TREE_CODE (rhs
))
4889 && goa_lhs_expr_p (TREE_OPERAND (rhs
, 1), addr
))
4890 rhs
= TREE_OPERAND (rhs
, 0);
4892 return GS_UNHANDLED
;
4894 decl
= built_in_decls
[base
+ index
+ 1];
4895 itype
= TREE_TYPE (TREE_TYPE (decl
));
4897 if (optab
[TYPE_MODE (itype
)] == CODE_FOR_nothing
)
4898 return GS_UNHANDLED
;
4900 args
= tree_cons (NULL
, fold_convert (itype
, rhs
), NULL
);
4901 args
= tree_cons (NULL
, addr
, args
);
4902 *expr_p
= build_function_call_expr (decl
, args
);
4906 /* A subroutine of gimplify_omp_atomic_pipeline. Walk *EXPR_P and replace
4907 appearances of *LHS_ADDR with LHS_VAR. If an expression does not involve
4908 the lhs, evaluate it into a temporary. Return 1 if the lhs appeared as
4909 a subexpression, 0 if it did not, or -1 if an error was encountered. */
4912 goa_stabilize_expr (tree
*expr_p
, tree
*pre_p
, tree lhs_addr
, tree lhs_var
)
4914 tree expr
= *expr_p
;
4917 if (goa_lhs_expr_p (expr
, lhs_addr
))
4922 if (is_gimple_val (expr
))
4926 switch (TREE_CODE_CLASS (TREE_CODE (expr
)))
4929 saw_lhs
|= goa_stabilize_expr (&TREE_OPERAND (expr
, 1), pre_p
,
4932 saw_lhs
|= goa_stabilize_expr (&TREE_OPERAND (expr
, 0), pre_p
,
4941 enum gimplify_status gs
;
4942 gs
= gimplify_expr (expr_p
, pre_p
, NULL
, is_gimple_val
, fb_rvalue
);
4943 if (gs
!= GS_ALL_DONE
)
4950 /* A subroutine of gimplify_omp_atomic. Implement the atomic operation as:
4954 newval = rhs; // with oldval replacing *addr in rhs
4955 oldval = __sync_val_compare_and_swap (addr, oldval, newval);
4956 if (oldval != newval)
4959 INDEX is log2 of the size of the data type, and thus usable to find the
4960 index of the builtin decl. */
4962 static enum gimplify_status
4963 gimplify_omp_atomic_pipeline (tree
*expr_p
, tree
*pre_p
, tree addr
,
4964 tree rhs
, int index
)
4966 tree oldval
, oldival
, oldival2
, newval
, newival
, label
;
4967 tree type
, itype
, cmpxchg
, args
, x
, iaddr
;
4969 cmpxchg
= built_in_decls
[BUILT_IN_VAL_COMPARE_AND_SWAP_N
+ index
+ 1];
4970 type
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (addr
)));
4971 itype
= TREE_TYPE (TREE_TYPE (cmpxchg
));
4973 if (sync_compare_and_swap
[TYPE_MODE (itype
)] == CODE_FOR_nothing
)
4974 return GS_UNHANDLED
;
4976 oldval
= create_tmp_var (type
, NULL
);
4977 newval
= create_tmp_var (type
, NULL
);
4979 /* Precompute as much of RHS as possible. In the same walk, replace
4980 occurrences of the lhs value with our temporary. */
4981 if (goa_stabilize_expr (&rhs
, pre_p
, addr
, oldval
) < 0)
4984 x
= build_fold_indirect_ref (addr
);
4985 x
= build2 (MODIFY_EXPR
, void_type_node
, oldval
, x
);
4986 gimplify_and_add (x
, pre_p
);
4988 /* For floating-point values, we'll need to view-convert them to integers
4989 so that we can perform the atomic compare and swap. Simplify the
4990 following code by always setting up the "i"ntegral variables. */
4991 if (INTEGRAL_TYPE_P (type
) || POINTER_TYPE_P (type
))
4999 oldival
= create_tmp_var (itype
, NULL
);
5000 newival
= create_tmp_var (itype
, NULL
);
5002 x
= build1 (VIEW_CONVERT_EXPR
, itype
, oldval
);
5003 x
= build2 (MODIFY_EXPR
, void_type_node
, oldival
, x
);
5004 gimplify_and_add (x
, pre_p
);
5005 iaddr
= fold_convert (build_pointer_type (itype
), addr
);
5008 oldival2
= create_tmp_var (itype
, NULL
);
5010 label
= create_artificial_label ();
5011 x
= build1 (LABEL_EXPR
, void_type_node
, label
);
5012 gimplify_and_add (x
, pre_p
);
5014 x
= build2 (MODIFY_EXPR
, void_type_node
, newval
, rhs
);
5015 gimplify_and_add (x
, pre_p
);
5017 if (newval
!= newival
)
5019 x
= build1 (VIEW_CONVERT_EXPR
, itype
, newval
);
5020 x
= build2 (MODIFY_EXPR
, void_type_node
, newival
, x
);
5021 gimplify_and_add (x
, pre_p
);
5024 x
= build2 (MODIFY_EXPR
, void_type_node
, oldival2
, oldival
);
5025 gimplify_and_add (x
, pre_p
);
5027 args
= tree_cons (NULL
, fold_convert (itype
, newival
), NULL
);
5028 args
= tree_cons (NULL
, fold_convert (itype
, oldival
), args
);
5029 args
= tree_cons (NULL
, iaddr
, args
);
5030 x
= build_function_call_expr (cmpxchg
, args
);
5031 if (oldval
== oldival
)
5032 x
= fold_convert (type
, x
);
5033 x
= build2 (MODIFY_EXPR
, void_type_node
, oldival
, x
);
5034 gimplify_and_add (x
, pre_p
);
5036 /* For floating point, be prepared for the loop backedge. */
5037 if (oldval
!= oldival
)
5039 x
= build1 (VIEW_CONVERT_EXPR
, type
, oldival
);
5040 x
= build2 (MODIFY_EXPR
, void_type_node
, oldval
, x
);
5041 gimplify_and_add (x
, pre_p
);
5044 /* Note that we always perform the comparison as an integer, even for
5045 floating point. This allows the atomic operation to properly
5046 succeed even with NaNs and -0.0. */
5047 x
= build3 (COND_EXPR
, void_type_node
,
5048 build2 (NE_EXPR
, boolean_type_node
, oldival
, oldival2
),
5049 build1 (GOTO_EXPR
, void_type_node
, label
), NULL
);
5050 gimplify_and_add (x
, pre_p
);
5056 /* A subroutine of gimplify_omp_atomic. Implement the atomic operation as:
5058 GOMP_atomic_start ();
5062 The result is not globally atomic, but works so long as all parallel
5063 references are within #pragma omp atomic directives. According to
5064 responses received from omp@openmp.org, appears to be within spec.
5065 Which makes sense, since that's how several other compilers handle
5066 this situation as well. */
5068 static enum gimplify_status
5069 gimplify_omp_atomic_mutex (tree
*expr_p
, tree
*pre_p
, tree addr
, tree rhs
)
5073 t
= built_in_decls
[BUILT_IN_GOMP_ATOMIC_START
];
5074 t
= build_function_call_expr (t
, NULL
);
5075 gimplify_and_add (t
, pre_p
);
5077 t
= build_fold_indirect_ref (addr
);
5078 t
= build2 (MODIFY_EXPR
, void_type_node
, t
, rhs
);
5079 gimplify_and_add (t
, pre_p
);
5081 t
= built_in_decls
[BUILT_IN_GOMP_ATOMIC_END
];
5082 t
= build_function_call_expr (t
, NULL
);
5083 gimplify_and_add (t
, pre_p
);
5089 /* Gimplify an OMP_ATOMIC statement. */
5091 static enum gimplify_status
5092 gimplify_omp_atomic (tree
*expr_p
, tree
*pre_p
)
5094 tree addr
= TREE_OPERAND (*expr_p
, 0);
5095 tree rhs
= TREE_OPERAND (*expr_p
, 1);
5096 tree type
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (addr
)));
5097 HOST_WIDE_INT index
;
5099 /* Make sure the type is one of the supported sizes. */
5100 index
= tree_low_cst (TYPE_SIZE_UNIT (type
), 1);
5101 index
= exact_log2 (index
);
5102 if (index
>= 0 && index
<= 4)
5104 enum gimplify_status gs
;
5107 if (DECL_P (TREE_OPERAND (addr
, 0)))
5108 align
= DECL_ALIGN_UNIT (TREE_OPERAND (addr
, 0));
5109 else if (TREE_CODE (TREE_OPERAND (addr
, 0)) == COMPONENT_REF
5110 && TREE_CODE (TREE_OPERAND (TREE_OPERAND (addr
, 0), 1))
5112 align
= DECL_ALIGN_UNIT (TREE_OPERAND (TREE_OPERAND (addr
, 0), 1));
5114 align
= TYPE_ALIGN_UNIT (type
);
5116 /* __sync builtins require strict data alignment. */
5117 if (exact_log2 (align
) >= index
)
5119 /* When possible, use specialized atomic update functions. */
5120 if (INTEGRAL_TYPE_P (type
) || POINTER_TYPE_P (type
))
5122 gs
= gimplify_omp_atomic_fetch_op (expr_p
, addr
, rhs
, index
);
5123 if (gs
!= GS_UNHANDLED
)
5127 /* If we don't have specialized __sync builtins, try and implement
5128 as a compare and swap loop. */
5129 gs
= gimplify_omp_atomic_pipeline (expr_p
, pre_p
, addr
, rhs
, index
);
5130 if (gs
!= GS_UNHANDLED
)
5135 /* The ultimate fallback is wrapping the operation in a mutex. */
5136 return gimplify_omp_atomic_mutex (expr_p
, pre_p
, addr
, rhs
);
5139 /* Gimplifies the expression tree pointed to by EXPR_P. Return 0 if
5140 gimplification failed.
5142 PRE_P points to the list where side effects that must happen before
5143 EXPR should be stored.
5145 POST_P points to the list where side effects that must happen after
5146 EXPR should be stored, or NULL if there is no suitable list. In
5147 that case, we copy the result to a temporary, emit the
5148 post-effects, and then return the temporary.
5150 GIMPLE_TEST_F points to a function that takes a tree T and
5151 returns nonzero if T is in the GIMPLE form requested by the
5152 caller. The GIMPLE predicates are in tree-gimple.c.
5154 This test is used twice. Before gimplification, the test is
5155 invoked to determine whether *EXPR_P is already gimple enough. If
5156 that fails, *EXPR_P is gimplified according to its code and
5157 GIMPLE_TEST_F is called again. If the test still fails, then a new
5158 temporary variable is created and assigned the value of the
5159 gimplified expression.
5161 FALLBACK tells the function what sort of a temporary we want. If the 1
5162 bit is set, an rvalue is OK. If the 2 bit is set, an lvalue is OK.
5163 If both are set, either is OK, but an lvalue is preferable.
5165 The return value is either GS_ERROR or GS_ALL_DONE, since this function
5166 iterates until solution. */
5168 enum gimplify_status
5169 gimplify_expr (tree
*expr_p
, tree
*pre_p
, tree
*post_p
,
5170 bool (* gimple_test_f
) (tree
), fallback_t fallback
)
5173 tree internal_pre
= NULL_TREE
;
5174 tree internal_post
= NULL_TREE
;
5176 int is_statement
= (pre_p
== NULL
);
5177 location_t saved_location
;
5178 enum gimplify_status ret
;
5180 save_expr
= *expr_p
;
5181 if (save_expr
== NULL_TREE
)
5184 /* We used to check the predicate here and return immediately if it
5185 succeeds. This is wrong; the design is for gimplification to be
5186 idempotent, and for the predicates to only test for valid forms, not
5187 whether they are fully simplified. */
5189 /* Set up our internal queues if needed. */
5191 pre_p
= &internal_pre
;
5193 post_p
= &internal_post
;
5195 saved_location
= input_location
;
5196 if (save_expr
!= error_mark_node
5197 && EXPR_HAS_LOCATION (*expr_p
))
5198 input_location
= EXPR_LOCATION (*expr_p
);
5200 /* Loop over the specific gimplifiers until the toplevel node
5201 remains the same. */
5204 /* Strip away as many useless type conversions as possible
5206 STRIP_USELESS_TYPE_CONVERSION (*expr_p
);
5208 /* Remember the expr. */
5209 save_expr
= *expr_p
;
5211 /* Die, die, die, my darling. */
5212 if (save_expr
== error_mark_node
5213 || (TREE_TYPE (save_expr
)
5214 && TREE_TYPE (save_expr
) == error_mark_node
))
5220 /* Do any language-specific gimplification. */
5221 ret
= lang_hooks
.gimplify_expr (expr_p
, pre_p
, post_p
);
5224 if (*expr_p
== NULL_TREE
)
5226 if (*expr_p
!= save_expr
)
5229 else if (ret
!= GS_UNHANDLED
)
5233 switch (TREE_CODE (*expr_p
))
5235 /* First deal with the special cases. */
5237 case POSTINCREMENT_EXPR
:
5238 case POSTDECREMENT_EXPR
:
5239 case PREINCREMENT_EXPR
:
5240 case PREDECREMENT_EXPR
:
5241 ret
= gimplify_self_mod_expr (expr_p
, pre_p
, post_p
,
5242 fallback
!= fb_none
);
5246 case ARRAY_RANGE_REF
:
5250 case VIEW_CONVERT_EXPR
:
5251 ret
= gimplify_compound_lval (expr_p
, pre_p
, post_p
,
5252 fallback
? fallback
: fb_rvalue
);
5256 ret
= gimplify_cond_expr (expr_p
, pre_p
, fallback
);
5257 /* C99 code may assign to an array in a structure value of a
5258 conditional expression, and this has undefined behavior
5259 only on execution, so create a temporary if an lvalue is
5261 if (fallback
== fb_lvalue
)
5263 *expr_p
= get_initialized_tmp_var (*expr_p
, pre_p
, post_p
);
5264 lang_hooks
.mark_addressable (*expr_p
);
5269 ret
= gimplify_call_expr (expr_p
, pre_p
, fallback
!= fb_none
);
5270 /* C99 code may assign to an array in a structure returned
5271 from a function, and this has undefined behavior only on
5272 execution, so create a temporary if an lvalue is
5274 if (fallback
== fb_lvalue
)
5276 *expr_p
= get_initialized_tmp_var (*expr_p
, pre_p
, post_p
);
5277 lang_hooks
.mark_addressable (*expr_p
);
5285 ret
= gimplify_compound_expr (expr_p
, pre_p
, fallback
!= fb_none
);
5290 ret
= gimplify_modify_expr (expr_p
, pre_p
, post_p
,
5291 fallback
!= fb_none
);
5293 /* The distinction between MODIFY_EXPR and INIT_EXPR is no longer
5295 if (*expr_p
&& TREE_CODE (*expr_p
) == INIT_EXPR
)
5296 TREE_SET_CODE (*expr_p
, MODIFY_EXPR
);
5299 case TRUTH_ANDIF_EXPR
:
5300 case TRUTH_ORIF_EXPR
:
5301 ret
= gimplify_boolean_expr (expr_p
);
5304 case TRUTH_NOT_EXPR
:
5305 TREE_OPERAND (*expr_p
, 0)
5306 = gimple_boolify (TREE_OPERAND (*expr_p
, 0));
5307 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
5308 is_gimple_val
, fb_rvalue
);
5309 recalculate_side_effects (*expr_p
);
5313 ret
= gimplify_addr_expr (expr_p
, pre_p
, post_p
);
5317 ret
= gimplify_va_arg_expr (expr_p
, pre_p
, post_p
);
5322 if (IS_EMPTY_STMT (*expr_p
))
5328 if (VOID_TYPE_P (TREE_TYPE (*expr_p
))
5329 || fallback
== fb_none
)
5331 /* Just strip a conversion to void (or in void context) and
5333 *expr_p
= TREE_OPERAND (*expr_p
, 0);
5337 ret
= gimplify_conversion (expr_p
);
5338 if (ret
== GS_ERROR
)
5340 if (*expr_p
!= save_expr
)
5344 case FIX_TRUNC_EXPR
:
5346 case FIX_FLOOR_EXPR
:
5347 case FIX_ROUND_EXPR
:
5348 /* unary_expr: ... | '(' cast ')' val | ... */
5349 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
5350 is_gimple_val
, fb_rvalue
);
5351 recalculate_side_effects (*expr_p
);
5355 *expr_p
= fold_indirect_ref (*expr_p
);
5356 if (*expr_p
!= save_expr
)
5358 /* else fall through. */
5359 case ALIGN_INDIRECT_REF
:
5360 case MISALIGNED_INDIRECT_REF
:
5361 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
5362 is_gimple_reg
, fb_rvalue
);
5363 recalculate_side_effects (*expr_p
);
5366 /* Constants need not be gimplified. */
5376 /* If we require an lvalue, such as for ADDR_EXPR, retain the
5377 CONST_DECL node. Otherwise the decl is replaceable by its
5379 /* ??? Should be == fb_lvalue, but ADDR_EXPR passes fb_either. */
5380 if (fallback
& fb_lvalue
)
5383 *expr_p
= DECL_INITIAL (*expr_p
);
5387 ret
= gimplify_decl_expr (expr_p
);
5391 /* FIXME make this a decl. */
5396 ret
= gimplify_bind_expr (expr_p
, NULL
, pre_p
);
5400 ret
= gimplify_loop_expr (expr_p
, pre_p
);
5404 ret
= gimplify_switch_expr (expr_p
, pre_p
);
5408 ret
= gimplify_exit_expr (expr_p
);
5412 /* If the target is not LABEL, then it is a computed jump
5413 and the target needs to be gimplified. */
5414 if (TREE_CODE (GOTO_DESTINATION (*expr_p
)) != LABEL_DECL
)
5415 ret
= gimplify_expr (&GOTO_DESTINATION (*expr_p
), pre_p
,
5416 NULL
, is_gimple_val
, fb_rvalue
);
5421 gcc_assert (decl_function_context (LABEL_EXPR_LABEL (*expr_p
))
5422 == current_function_decl
);
5425 case CASE_LABEL_EXPR
:
5426 ret
= gimplify_case_label_expr (expr_p
);
5430 ret
= gimplify_return_expr (*expr_p
, pre_p
);
5434 /* Don't reduce this in place; let gimplify_init_constructor work its
5435 magic. Buf if we're just elaborating this for side effects, just
5436 gimplify any element that has side-effects. */
5437 if (fallback
== fb_none
)
5439 unsigned HOST_WIDE_INT ix
;
5440 constructor_elt
*ce
;
5441 tree temp
= NULL_TREE
;
5443 VEC_iterate (constructor_elt
, CONSTRUCTOR_ELTS (*expr_p
),
5446 if (TREE_SIDE_EFFECTS (ce
->value
))
5447 append_to_statement_list (ce
->value
, &temp
);
5452 /* C99 code may assign to an array in a constructed
5453 structure or union, and this has undefined behavior only
5454 on execution, so create a temporary if an lvalue is
5456 else if (fallback
== fb_lvalue
)
5458 *expr_p
= get_initialized_tmp_var (*expr_p
, pre_p
, post_p
);
5459 lang_hooks
.mark_addressable (*expr_p
);
5465 /* The following are special cases that are not handled by the
5466 original GIMPLE grammar. */
5468 /* SAVE_EXPR nodes are converted into a GIMPLE identifier and
5471 ret
= gimplify_save_expr (expr_p
, pre_p
, post_p
);
5476 enum gimplify_status r0
, r1
, r2
;
5478 r0
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
5479 is_gimple_lvalue
, fb_either
);
5480 r1
= gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
, post_p
,
5481 is_gimple_val
, fb_rvalue
);
5482 r2
= gimplify_expr (&TREE_OPERAND (*expr_p
, 2), pre_p
, post_p
,
5483 is_gimple_val
, fb_rvalue
);
5484 recalculate_side_effects (*expr_p
);
5486 ret
= MIN (r0
, MIN (r1
, r2
));
5490 case NON_LVALUE_EXPR
:
5491 /* This should have been stripped above. */
5495 ret
= gimplify_asm_expr (expr_p
, pre_p
, post_p
);
5498 case TRY_FINALLY_EXPR
:
5499 case TRY_CATCH_EXPR
:
5500 gimplify_to_stmt_list (&TREE_OPERAND (*expr_p
, 0));
5501 gimplify_to_stmt_list (&TREE_OPERAND (*expr_p
, 1));
5505 case CLEANUP_POINT_EXPR
:
5506 ret
= gimplify_cleanup_point_expr (expr_p
, pre_p
);
5510 ret
= gimplify_target_expr (expr_p
, pre_p
, post_p
);
5514 gimplify_to_stmt_list (&CATCH_BODY (*expr_p
));
5518 case EH_FILTER_EXPR
:
5519 gimplify_to_stmt_list (&EH_FILTER_FAILURE (*expr_p
));
5525 enum gimplify_status r0
, r1
;
5526 r0
= gimplify_expr (&OBJ_TYPE_REF_OBJECT (*expr_p
), pre_p
, post_p
,
5527 is_gimple_val
, fb_rvalue
);
5528 r1
= gimplify_expr (&OBJ_TYPE_REF_EXPR (*expr_p
), pre_p
, post_p
,
5529 is_gimple_val
, fb_rvalue
);
5535 /* We get here when taking the address of a label. We mark
5536 the label as "forced"; meaning it can never be removed and
5537 it is a potential target for any computed goto. */
5538 FORCED_LABEL (*expr_p
) = 1;
5542 case STATEMENT_LIST
:
5543 ret
= gimplify_statement_list (expr_p
);
5546 case WITH_SIZE_EXPR
:
5548 gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
,
5549 post_p
== &internal_post
? NULL
: post_p
,
5550 gimple_test_f
, fallback
);
5551 gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
, post_p
,
5552 is_gimple_val
, fb_rvalue
);
5558 ret
= gimplify_var_or_parm_decl (expr_p
);
5562 /* Allow callbacks into the gimplifier during optimization. */
5567 ret
= gimplify_omp_parallel (expr_p
, pre_p
);
5571 ret
= gimplify_omp_for (expr_p
, pre_p
);
5576 ret
= gimplify_omp_workshare (expr_p
, pre_p
);
5583 gimplify_to_stmt_list (&OMP_BODY (*expr_p
));
5587 ret
= gimplify_omp_atomic (expr_p
, pre_p
);
5590 case OMP_RETURN_EXPR
:
5595 switch (TREE_CODE_CLASS (TREE_CODE (*expr_p
)))
5597 case tcc_comparison
:
5598 /* If this is a comparison of objects of aggregate type,
5599 handle it specially (by converting to a call to
5600 memcmp). It would be nice to only have to do this
5601 for variable-sized objects, but then we'd have to
5602 allow the same nest of reference nodes we allow for
5603 MODIFY_EXPR and that's too complex. */
5604 if (!AGGREGATE_TYPE_P (TREE_TYPE (TREE_OPERAND (*expr_p
, 1))))
5606 ret
= gimplify_variable_sized_compare (expr_p
);
5609 /* If *EXPR_P does not need to be special-cased, handle it
5610 according to its class. */
5612 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
,
5613 post_p
, is_gimple_val
, fb_rvalue
);
5619 enum gimplify_status r0
, r1
;
5621 r0
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
,
5622 post_p
, is_gimple_val
, fb_rvalue
);
5623 r1
= gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
,
5624 post_p
, is_gimple_val
, fb_rvalue
);
5630 case tcc_declaration
:
5633 goto dont_recalculate
;
5636 gcc_assert (TREE_CODE (*expr_p
) == TRUTH_AND_EXPR
5637 || TREE_CODE (*expr_p
) == TRUTH_OR_EXPR
5638 || TREE_CODE (*expr_p
) == TRUTH_XOR_EXPR
);
5642 recalculate_side_effects (*expr_p
);
5647 /* If we replaced *expr_p, gimplify again. */
5648 if (ret
== GS_OK
&& (*expr_p
== NULL
|| *expr_p
== save_expr
))
5651 while (ret
== GS_OK
);
5653 /* If we encountered an error_mark somewhere nested inside, either
5654 stub out the statement or propagate the error back out. */
5655 if (ret
== GS_ERROR
)
5662 /* This was only valid as a return value from the langhook, which
5663 we handled. Make sure it doesn't escape from any other context. */
5664 gcc_assert (ret
!= GS_UNHANDLED
);
5666 if (fallback
== fb_none
&& *expr_p
&& !is_gimple_stmt (*expr_p
))
5668 /* We aren't looking for a value, and we don't have a valid
5669 statement. If it doesn't have side-effects, throw it away. */
5670 if (!TREE_SIDE_EFFECTS (*expr_p
))
5672 else if (!TREE_THIS_VOLATILE (*expr_p
))
5674 /* This is probably a _REF that contains something nested that
5675 has side effects. Recurse through the operands to find it. */
5676 enum tree_code code
= TREE_CODE (*expr_p
);
5681 case REALPART_EXPR
: case IMAGPART_EXPR
:
5682 gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
5683 gimple_test_f
, fallback
);
5686 case ARRAY_REF
: case ARRAY_RANGE_REF
:
5687 gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
5688 gimple_test_f
, fallback
);
5689 gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
, post_p
,
5690 gimple_test_f
, fallback
);
5694 /* Anything else with side-effects must be converted to
5695 a valid statement before we get here. */
5701 else if (COMPLETE_TYPE_P (TREE_TYPE (*expr_p
)))
5703 /* Historically, the compiler has treated a bare
5704 reference to a volatile lvalue as forcing a load. */
5705 tree type
= TYPE_MAIN_VARIANT (TREE_TYPE (*expr_p
));
5706 /* Normally, we do want to create a temporary for a
5707 TREE_ADDRESSABLE type because such a type should not be
5708 copied by bitwise-assignment. However, we make an
5709 exception here, as all we are doing here is ensuring that
5710 we read the bytes that make up the type. We use
5711 create_tmp_var_raw because create_tmp_var will abort when
5712 given a TREE_ADDRESSABLE type. */
5713 tree tmp
= create_tmp_var_raw (type
, "vol");
5714 gimple_add_tmp_var (tmp
);
5715 *expr_p
= build2 (MODIFY_EXPR
, type
, tmp
, *expr_p
);
5718 /* We can't do anything useful with a volatile reference to
5719 incomplete type, so just throw it away. */
5723 /* If we are gimplifying at the statement level, we're done. Tack
5724 everything together and replace the original statement with the
5726 if (fallback
== fb_none
|| is_statement
)
5728 if (internal_pre
|| internal_post
)
5730 append_to_statement_list (*expr_p
, &internal_pre
);
5731 append_to_statement_list (internal_post
, &internal_pre
);
5732 annotate_all_with_locus (&internal_pre
, input_location
);
5733 *expr_p
= internal_pre
;
5737 else if (TREE_CODE (*expr_p
) == STATEMENT_LIST
)
5738 annotate_all_with_locus (expr_p
, input_location
);
5740 annotate_one_with_locus (*expr_p
, input_location
);
5744 /* Otherwise we're gimplifying a subexpression, so the resulting value is
5747 /* If it's sufficiently simple already, we're done. Unless we are
5748 handling some post-effects internally; if that's the case, we need to
5749 copy into a temp before adding the post-effects to the tree. */
5750 if (!internal_post
&& (*gimple_test_f
) (*expr_p
))
5753 /* Otherwise, we need to create a new temporary for the gimplified
5756 /* We can't return an lvalue if we have an internal postqueue. The
5757 object the lvalue refers to would (probably) be modified by the
5758 postqueue; we need to copy the value out first, which means an
5760 if ((fallback
& fb_lvalue
) && !internal_post
5761 && is_gimple_addressable (*expr_p
))
5763 /* An lvalue will do. Take the address of the expression, store it
5764 in a temporary, and replace the expression with an INDIRECT_REF of
5766 tmp
= build_fold_addr_expr (*expr_p
);
5767 gimplify_expr (&tmp
, pre_p
, post_p
, is_gimple_reg
, fb_rvalue
);
5768 *expr_p
= build1 (INDIRECT_REF
, TREE_TYPE (TREE_TYPE (tmp
)), tmp
);
5770 else if ((fallback
& fb_rvalue
) && is_gimple_formal_tmp_rhs (*expr_p
))
5772 gcc_assert (!VOID_TYPE_P (TREE_TYPE (*expr_p
)));
5774 /* An rvalue will do. Assign the gimplified expression into a new
5775 temporary TMP and replace the original expression with TMP. */
5777 if (internal_post
|| (fallback
& fb_lvalue
))
5778 /* The postqueue might change the value of the expression between
5779 the initialization and use of the temporary, so we can't use a
5780 formal temp. FIXME do we care? */
5781 *expr_p
= get_initialized_tmp_var (*expr_p
, pre_p
, post_p
);
5783 *expr_p
= get_formal_tmp_var (*expr_p
, pre_p
);
5785 if (TREE_CODE (*expr_p
) != SSA_NAME
)
5786 DECL_GIMPLE_FORMAL_TEMP_P (*expr_p
) = 1;
5790 #ifdef ENABLE_CHECKING
5791 if (!(fallback
& fb_mayfail
))
5793 fprintf (stderr
, "gimplification failed:\n");
5794 print_generic_expr (stderr
, *expr_p
, 0);
5795 debug_tree (*expr_p
);
5796 internal_error ("gimplification failed");
5799 gcc_assert (fallback
& fb_mayfail
);
5800 /* If this is an asm statement, and the user asked for the
5801 impossible, don't die. Fail and let gimplify_asm_expr
5807 /* Make sure the temporary matches our predicate. */
5808 gcc_assert ((*gimple_test_f
) (*expr_p
));
5812 annotate_all_with_locus (&internal_post
, input_location
);
5813 append_to_statement_list (internal_post
, pre_p
);
5817 input_location
= saved_location
;
5821 /* Look through TYPE for variable-sized objects and gimplify each such
5822 size that we find. Add to LIST_P any statements generated. */
5825 gimplify_type_sizes (tree type
, tree
*list_p
)
5829 if (type
== NULL
|| type
== error_mark_node
)
5832 /* We first do the main variant, then copy into any other variants. */
5833 type
= TYPE_MAIN_VARIANT (type
);
5835 /* Avoid infinite recursion. */
5836 if (TYPE_SIZES_GIMPLIFIED (type
))
5839 TYPE_SIZES_GIMPLIFIED (type
) = 1;
5841 switch (TREE_CODE (type
))
5847 gimplify_one_sizepos (&TYPE_MIN_VALUE (type
), list_p
);
5848 gimplify_one_sizepos (&TYPE_MAX_VALUE (type
), list_p
);
5850 for (t
= TYPE_NEXT_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
5852 TYPE_MIN_VALUE (t
) = TYPE_MIN_VALUE (type
);
5853 TYPE_MAX_VALUE (t
) = TYPE_MAX_VALUE (type
);
5858 /* These types may not have declarations, so handle them here. */
5859 gimplify_type_sizes (TREE_TYPE (type
), list_p
);
5860 gimplify_type_sizes (TYPE_DOMAIN (type
), list_p
);
5865 case QUAL_UNION_TYPE
:
5866 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
5867 if (TREE_CODE (field
) == FIELD_DECL
)
5869 gimplify_one_sizepos (&DECL_FIELD_OFFSET (field
), list_p
);
5870 gimplify_type_sizes (TREE_TYPE (field
), list_p
);
5875 case REFERENCE_TYPE
:
5876 gimplify_type_sizes (TREE_TYPE (type
), list_p
);
5883 gimplify_one_sizepos (&TYPE_SIZE (type
), list_p
);
5884 gimplify_one_sizepos (&TYPE_SIZE_UNIT (type
), list_p
);
5886 for (t
= TYPE_NEXT_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
5888 TYPE_SIZE (t
) = TYPE_SIZE (type
);
5889 TYPE_SIZE_UNIT (t
) = TYPE_SIZE_UNIT (type
);
5890 TYPE_SIZES_GIMPLIFIED (t
) = 1;
5894 /* A subroutine of gimplify_type_sizes to make sure that *EXPR_P,
5895 a size or position, has had all of its SAVE_EXPRs evaluated.
5896 We add any required statements to STMT_P. */
5899 gimplify_one_sizepos (tree
*expr_p
, tree
*stmt_p
)
5901 tree type
, expr
= *expr_p
;
5903 /* We don't do anything if the value isn't there, is constant, or contains
5904 A PLACEHOLDER_EXPR. We also don't want to do anything if it's already
5905 a VAR_DECL. If it's a VAR_DECL from another function, the gimplifier
5906 will want to replace it with a new variable, but that will cause problems
5907 if this type is from outside the function. It's OK to have that here. */
5908 if (expr
== NULL_TREE
|| TREE_CONSTANT (expr
)
5909 || TREE_CODE (expr
) == VAR_DECL
5910 || CONTAINS_PLACEHOLDER_P (expr
))
5913 type
= TREE_TYPE (expr
);
5914 *expr_p
= unshare_expr (expr
);
5916 gimplify_expr (expr_p
, stmt_p
, NULL
, is_gimple_val
, fb_rvalue
);
5919 /* Verify that we've an exact type match with the original expression.
5920 In particular, we do not wish to drop a "sizetype" in favour of a
5921 type of similar dimensions. We don't want to pollute the generic
5922 type-stripping code with this knowledge because it doesn't matter
5923 for the bulk of GENERIC/GIMPLE. It only matters that TYPE_SIZE_UNIT
5924 and friends retain their "sizetype-ness". */
5925 if (TREE_TYPE (expr
) != type
5926 && TREE_CODE (type
) == INTEGER_TYPE
5927 && TYPE_IS_SIZETYPE (type
))
5931 *expr_p
= create_tmp_var (type
, NULL
);
5932 tmp
= build1 (NOP_EXPR
, type
, expr
);
5933 tmp
= build2 (MODIFY_EXPR
, type
, *expr_p
, tmp
);
5934 if (EXPR_HAS_LOCATION (expr
))
5935 SET_EXPR_LOCUS (tmp
, EXPR_LOCUS (expr
));
5937 SET_EXPR_LOCATION (tmp
, input_location
);
5939 gimplify_and_add (tmp
, stmt_p
);
5943 #ifdef ENABLE_CHECKING
5944 /* Compare types A and B for a "close enough" match. */
5947 cpt_same_type (tree a
, tree b
)
5949 if (lang_hooks
.types_compatible_p (a
, b
))
5952 /* ??? The C++ FE decomposes METHOD_TYPES to FUNCTION_TYPES and doesn't
5953 link them together. This routine is intended to catch type errors
5954 that will affect the optimizers, and the optimizers don't add new
5955 dereferences of function pointers, so ignore it. */
5956 if ((TREE_CODE (a
) == FUNCTION_TYPE
|| TREE_CODE (a
) == METHOD_TYPE
)
5957 && (TREE_CODE (b
) == FUNCTION_TYPE
|| TREE_CODE (b
) == METHOD_TYPE
))
5960 /* ??? The C FE pushes type qualifiers after the fact into the type of
5961 the element from the type of the array. See build_unary_op's handling
5962 of ADDR_EXPR. This seems wrong -- if we were going to do this, we
5963 should have done it when creating the variable in the first place.
5964 Alternately, why aren't the two array types made variants? */
5965 if (TREE_CODE (a
) == ARRAY_TYPE
&& TREE_CODE (b
) == ARRAY_TYPE
)
5966 return cpt_same_type (TREE_TYPE (a
), TREE_TYPE (b
));
5968 /* And because of those, we have to recurse down through pointers. */
5969 if (POINTER_TYPE_P (a
) && POINTER_TYPE_P (b
))
5970 return cpt_same_type (TREE_TYPE (a
), TREE_TYPE (b
));
5975 /* Check for some cases of the front end missing cast expressions.
5976 The type of a dereference should correspond to the pointer type;
5977 similarly the type of an address should match its object. */
5980 check_pointer_types_r (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
,
5981 void *data ATTRIBUTE_UNUSED
)
5984 tree ptype
, otype
, dtype
;
5986 switch (TREE_CODE (t
))
5990 otype
= TREE_TYPE (t
);
5991 ptype
= TREE_TYPE (TREE_OPERAND (t
, 0));
5992 dtype
= TREE_TYPE (ptype
);
5993 gcc_assert (cpt_same_type (otype
, dtype
));
5997 ptype
= TREE_TYPE (t
);
5998 otype
= TREE_TYPE (TREE_OPERAND (t
, 0));
5999 dtype
= TREE_TYPE (ptype
);
6000 if (!cpt_same_type (otype
, dtype
))
6002 /* &array is allowed to produce a pointer to the element, rather than
6003 a pointer to the array type. We must allow this in order to
6004 properly represent assigning the address of an array in C into
6005 pointer to the element type. */
6006 gcc_assert (TREE_CODE (otype
) == ARRAY_TYPE
6007 && POINTER_TYPE_P (ptype
)
6008 && cpt_same_type (TREE_TYPE (otype
), dtype
));
6022 /* Gimplify the body of statements pointed to by BODY_P. FNDECL is the
6023 function decl containing BODY. */
6026 gimplify_body (tree
*body_p
, tree fndecl
, bool do_parms
)
6028 location_t saved_location
= input_location
;
6029 tree body
, parm_stmts
;
6031 timevar_push (TV_TREE_GIMPLIFY
);
6033 gcc_assert (gimplify_ctxp
== NULL
);
6034 push_gimplify_context ();
6036 /* Unshare most shared trees in the body and in that of any nested functions.
6037 It would seem we don't have to do this for nested functions because
6038 they are supposed to be output and then the outer function gimplified
6039 first, but the g++ front end doesn't always do it that way. */
6040 unshare_body (body_p
, fndecl
);
6041 unvisit_body (body_p
, fndecl
);
6043 /* Make sure input_location isn't set to something wierd. */
6044 input_location
= DECL_SOURCE_LOCATION (fndecl
);
6046 /* Resolve callee-copies. This has to be done before processing
6047 the body so that DECL_VALUE_EXPR gets processed correctly. */
6048 parm_stmts
= do_parms
? gimplify_parameters () : NULL
;
6050 /* Gimplify the function's body. */
6051 gimplify_stmt (body_p
);
6055 body
= alloc_stmt_list ();
6056 else if (TREE_CODE (body
) == STATEMENT_LIST
)
6058 tree t
= expr_only (*body_p
);
6063 /* If there isn't an outer BIND_EXPR, add one. */
6064 if (TREE_CODE (body
) != BIND_EXPR
)
6066 tree b
= build3 (BIND_EXPR
, void_type_node
, NULL_TREE
,
6067 NULL_TREE
, NULL_TREE
);
6068 TREE_SIDE_EFFECTS (b
) = 1;
6069 append_to_statement_list_force (body
, &BIND_EXPR_BODY (b
));
6073 /* If we had callee-copies statements, insert them at the beginning
6077 append_to_statement_list_force (BIND_EXPR_BODY (body
), &parm_stmts
);
6078 BIND_EXPR_BODY (body
) = parm_stmts
;
6081 /* Unshare again, in case gimplification was sloppy. */
6082 unshare_all_trees (body
);
6086 pop_gimplify_context (body
);
6087 gcc_assert (gimplify_ctxp
== NULL
);
6089 #ifdef ENABLE_CHECKING
6090 walk_tree (body_p
, check_pointer_types_r
, NULL
, NULL
);
6093 timevar_pop (TV_TREE_GIMPLIFY
);
6094 input_location
= saved_location
;
6097 /* Entry point to the gimplification pass. FNDECL is the FUNCTION_DECL
6098 node for the function we want to gimplify. */
6101 gimplify_function_tree (tree fndecl
)
6103 tree oldfn
, parm
, ret
;
6105 oldfn
= current_function_decl
;
6106 current_function_decl
= fndecl
;
6107 cfun
= DECL_STRUCT_FUNCTION (fndecl
);
6109 allocate_struct_function (fndecl
);
6111 for (parm
= DECL_ARGUMENTS (fndecl
); parm
; parm
= TREE_CHAIN (parm
))
6113 /* Preliminarily mark non-addressed complex variables as eligible
6114 for promotion to gimple registers. We'll transform their uses
6116 if (TREE_CODE (TREE_TYPE (parm
)) == COMPLEX_TYPE
6117 && !TREE_THIS_VOLATILE (parm
)
6118 && !needs_to_live_in_memory (parm
))
6119 DECL_COMPLEX_GIMPLE_REG_P (parm
) = 1;
6122 ret
= DECL_RESULT (fndecl
);
6123 if (TREE_CODE (TREE_TYPE (ret
)) == COMPLEX_TYPE
6124 && !needs_to_live_in_memory (ret
))
6125 DECL_COMPLEX_GIMPLE_REG_P (ret
) = 1;
6127 gimplify_body (&DECL_SAVED_TREE (fndecl
), fndecl
, true);
6129 /* If we're instrumenting function entry/exit, then prepend the call to
6130 the entry hook and wrap the whole function in a TRY_FINALLY_EXPR to
6131 catch the exit hook. */
6132 /* ??? Add some way to ignore exceptions for this TFE. */
6133 if (flag_instrument_function_entry_exit
6134 && ! DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (fndecl
))
6138 tf
= build2 (TRY_FINALLY_EXPR
, void_type_node
, NULL
, NULL
);
6139 TREE_SIDE_EFFECTS (tf
) = 1;
6140 x
= DECL_SAVED_TREE (fndecl
);
6141 append_to_statement_list (x
, &TREE_OPERAND (tf
, 0));
6142 x
= implicit_built_in_decls
[BUILT_IN_PROFILE_FUNC_EXIT
];
6143 x
= build_function_call_expr (x
, NULL
);
6144 append_to_statement_list (x
, &TREE_OPERAND (tf
, 1));
6146 bind
= build3 (BIND_EXPR
, void_type_node
, NULL
, NULL
, NULL
);
6147 TREE_SIDE_EFFECTS (bind
) = 1;
6148 x
= implicit_built_in_decls
[BUILT_IN_PROFILE_FUNC_ENTER
];
6149 x
= build_function_call_expr (x
, NULL
);
6150 append_to_statement_list (x
, &BIND_EXPR_BODY (bind
));
6151 append_to_statement_list (tf
, &BIND_EXPR_BODY (bind
));
6153 DECL_SAVED_TREE (fndecl
) = bind
;
6156 current_function_decl
= oldfn
;
6157 cfun
= oldfn
? DECL_STRUCT_FUNCTION (oldfn
) : NULL
;
6161 /* Expands EXPR to list of gimple statements STMTS. If SIMPLE is true,
6162 force the result to be either ssa_name or an invariant, otherwise
6163 just force it to be a rhs expression. If VAR is not NULL, make the
6164 base variable of the final destination be VAR if suitable. */
6167 force_gimple_operand (tree expr
, tree
*stmts
, bool simple
, tree var
)
6170 enum gimplify_status ret
;
6171 gimple_predicate gimple_test_f
;
6175 if (is_gimple_val (expr
))
6178 gimple_test_f
= simple
? is_gimple_val
: is_gimple_reg_rhs
;
6180 push_gimplify_context ();
6181 gimplify_ctxp
->into_ssa
= in_ssa_p
;
6184 expr
= build2 (MODIFY_EXPR
, TREE_TYPE (var
), var
, expr
);
6186 ret
= gimplify_expr (&expr
, stmts
, NULL
,
6187 gimple_test_f
, fb_rvalue
);
6188 gcc_assert (ret
!= GS_ERROR
);
6190 if (referenced_vars
)
6192 for (t
= gimplify_ctxp
->temps
; t
; t
= TREE_CHAIN (t
))
6193 add_referenced_tmp_var (t
);
6196 pop_gimplify_context (NULL
);
6201 /* Invokes force_gimple_operand for EXPR with parameters SIMPLE_P and VAR. If
6202 some statements are produced, emits them before BSI. */
6205 force_gimple_operand_bsi (block_stmt_iterator
*bsi
, tree expr
,
6206 bool simple_p
, tree var
)
6210 expr
= force_gimple_operand (expr
, &stmts
, simple_p
, var
);
6212 bsi_insert_before (bsi
, stmts
, BSI_SAME_STMT
);
6217 #include "gt-gimplify.h"