1 /* C++-specific tree lowering bits; see also c-gimplify.c and tree-gimple.c.
3 Copyright (C) 2002, 2003, 2004 Free Software Foundation, Inc.
4 Contributed by Jason Merrill <jason@redhat.com>
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 2, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING. If not, write to the Free
20 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
25 #include "coretypes.h"
31 #include "tree-gimple.h"
34 /* Genericize a TRY_BLOCK. */
37 genericize_try_block (tree
*stmt_p
)
39 tree body
= TRY_STMTS (*stmt_p
);
40 tree cleanup
= TRY_HANDLERS (*stmt_p
);
42 gimplify_stmt (&body
);
44 if (CLEANUP_P (*stmt_p
))
45 /* A cleanup is an expression, so it doesn't need to be genericized. */;
47 gimplify_stmt (&cleanup
);
49 *stmt_p
= build (TRY_CATCH_EXPR
, void_type_node
, body
, cleanup
);
52 /* Genericize a HANDLER by converting to a CATCH_EXPR. */
55 genericize_catch_block (tree
*stmt_p
)
57 tree type
= HANDLER_TYPE (*stmt_p
);
58 tree body
= HANDLER_BODY (*stmt_p
);
60 gimplify_stmt (&body
);
62 /* FIXME should the caught type go in TREE_TYPE? */
63 *stmt_p
= build (CATCH_EXPR
, void_type_node
, type
, body
);
66 /* Genericize an EH_SPEC_BLOCK by converting it to a
67 TRY_CATCH_EXPR/EH_FILTER_EXPR pair. */
70 genericize_eh_spec_block (tree
*stmt_p
)
72 tree body
= EH_SPEC_STMTS (*stmt_p
);
73 tree allowed
= EH_SPEC_RAISES (*stmt_p
);
74 tree failure
= build_call (call_unexpected_node
,
75 tree_cons (NULL_TREE
, build_exc_ptr (),
77 gimplify_stmt (&body
);
79 *stmt_p
= gimple_build_eh_filter (body
, allowed
, failure
);
82 /* Genericize an IF_STMT by turning it into a COND_EXPR. */
85 gimplify_if_stmt (tree
*stmt_p
)
87 tree stmt
, then_
, else_
;
90 then_
= THEN_CLAUSE (stmt
);
91 else_
= ELSE_CLAUSE (stmt
);
94 then_
= build_empty_stmt ();
96 else_
= build_empty_stmt ();
98 stmt
= build (COND_EXPR
, void_type_node
, IF_COND (stmt
), then_
, else_
);
102 /* Gimplify initialization from an AGGR_INIT_EXPR. */
105 cp_gimplify_init_expr (tree
*expr_p
, tree
*pre_p
, tree
*post_p
)
107 tree from
= TREE_OPERAND (*expr_p
, 1);
108 tree to
= TREE_OPERAND (*expr_p
, 0);
111 /* If we are initializing something from a TARGET_EXPR, strip the
112 TARGET_EXPR and initialize it directly. */
113 /* What about code that pulls out the temp and uses it elsewhere? I
114 think that such code never uses the TARGET_EXPR as an initializer. If
115 I'm wrong, we'll abort because the temp won't have any RTL. In that
116 case, I guess we'll need to replace references somehow. */
117 if (TREE_CODE (from
) == TARGET_EXPR
)
118 from
= TARGET_EXPR_INITIAL (from
);
119 if (TREE_CODE (from
) == CLEANUP_POINT_EXPR
)
120 from
= TREE_OPERAND (from
, 0);
122 /* Look through any COMPOUND_EXPRs. */
123 sub
= expr_last (from
);
125 /* If we are initializing from an AGGR_INIT_EXPR, drop the INIT_EXPR and
126 replace the slot operand with our target.
128 Should we add a target parm to gimplify_expr instead? No, as in this
129 case we want to replace the INIT_EXPR. */
130 if (TREE_CODE (sub
) == AGGR_INIT_EXPR
)
132 gimplify_expr (&to
, pre_p
, post_p
, is_gimple_lvalue
, fb_lvalue
);
133 TREE_OPERAND (sub
, 2) = to
;
136 /* The initialization is now a side-effect, so the container can
139 TREE_TYPE (from
) = void_type_node
;
143 /* Gimplify a MUST_NOT_THROW_EXPR. */
146 gimplify_must_not_throw_expr (tree
*expr_p
, tree
*pre_p
)
149 tree temp
= voidify_wrapper_expr (stmt
, NULL
);
150 tree body
= TREE_OPERAND (stmt
, 0);
152 gimplify_stmt (&body
);
154 stmt
= gimple_build_eh_filter (body
, NULL_TREE
,
155 build_call (terminate_node
, NULL_TREE
));
159 append_to_statement_list (stmt
, pre_p
);
166 /* Do C++-specific gimplification. Args are as for gimplify_expr. */
169 cp_gimplify_expr (tree
*expr_p
, tree
*pre_p
, tree
*post_p
)
171 int saved_stmts_are_full_exprs_p
= 0;
172 enum tree_code code
= TREE_CODE (*expr_p
);
173 enum gimplify_status ret
;
175 if (STATEMENT_CODE_P (code
))
177 saved_stmts_are_full_exprs_p
= stmts_are_full_exprs_p ();
178 current_stmt_tree ()->stmts_are_full_exprs_p
179 = STMT_IS_FULL_EXPR_P (*expr_p
);
185 *expr_p
= cplus_expand_constant (*expr_p
);
190 simplify_aggr_init_expr (expr_p
);
195 /* FIXME communicate throw type to backend, probably by moving
196 THROW_EXPR into ../tree.def. */
197 *expr_p
= TREE_OPERAND (*expr_p
, 0);
201 case MUST_NOT_THROW_EXPR
:
202 gimplify_must_not_throw_expr (expr_p
, pre_p
);
208 cp_gimplify_init_expr (expr_p
, pre_p
, post_p
);
212 case EMPTY_CLASS_EXPR
:
214 /* Yes, an INTEGER_CST with RECORD_TYPE. */
215 tree i
= build_int_2 (0, 0);
216 TREE_TYPE (i
) = TREE_TYPE (*expr_p
);
223 *expr_p
= BASELINK_FUNCTIONS (*expr_p
);
228 genericize_try_block (expr_p
);
233 genericize_catch_block (expr_p
);
238 genericize_eh_spec_block (expr_p
);
243 /* Just ignore for now. Eventually we will want to pass this on to
245 *expr_p
= build_empty_stmt ();
250 gimplify_if_stmt (expr_p
);
255 ret
= c_gimplify_expr (expr_p
, pre_p
, post_p
);
259 /* Restore saved state. */
260 if (STATEMENT_CODE_P (code
))
261 current_stmt_tree ()->stmts_are_full_exprs_p
262 = saved_stmts_are_full_exprs_p
;
268 is_invisiref_parm (tree t
)
270 return (TREE_CODE (t
) == PARM_DECL
271 && DECL_BY_REFERENCE (t
));
274 /* Perform any pre-gimplification lowering of C++ front end trees to
278 cp_genericize_r (tree
*stmt_p
, int *walk_subtrees
, void *data
)
281 htab_t htab
= (htab_t
) data
;
284 if (is_invisiref_parm (stmt
))
286 *stmt_p
= build_fold_indirect_ref (stmt
);
291 /* Other than invisiref parms, don't walk the same tree twice. */
292 slot
= htab_find_slot (htab
, stmt
, INSERT
);
299 if (TREE_CODE (stmt
) == ADDR_EXPR
300 && is_invisiref_parm (TREE_OPERAND (stmt
, 0)))
302 *stmt_p
= convert (TREE_TYPE (stmt
), TREE_OPERAND (stmt
, 0));
305 else if (DECL_P (stmt
) || TYPE_P (stmt
))
308 /* Due to the way voidify_wrapper_expr is written, we don't get a chance
309 to lower this construct before scanning it, so we need to lower these
310 before doing anything else. */
311 else if (TREE_CODE (stmt
) == CLEANUP_STMT
)
312 *stmt_p
= build (CLEANUP_EH_ONLY (stmt
) ? TRY_CATCH_EXPR
: TRY_FINALLY_EXPR
,
313 void_type_node
, CLEANUP_BODY (stmt
), CLEANUP_EXPR (stmt
));
320 cp_genericize (tree fndecl
)
325 /* Fix up the types of parms passed by invisible reference. */
326 for (t
= DECL_ARGUMENTS (fndecl
); t
; t
= TREE_CHAIN (t
))
328 if (DECL_BY_REFERENCE (t
))
330 if (TREE_ADDRESSABLE (TREE_TYPE (t
)))
332 if (DECL_ARG_TYPE (t
) == TREE_TYPE (t
))
334 DECL_BY_REFERENCE (t
) = 1;
335 TREE_TYPE (t
) = DECL_ARG_TYPE (t
);
340 /* If we're a clone, the body is already GIMPLE. */
341 if (DECL_CLONED_FUNCTION_P (fndecl
))
344 /* We do want to see every occurrence of the parms, so we can't just use
345 walk_tree's hash functionality. */
346 htab
= htab_create (37, htab_hash_pointer
, htab_eq_pointer
, NULL
);
347 walk_tree (&DECL_SAVED_TREE (fndecl
), cp_genericize_r
, htab
, NULL
);
350 /* Do everything else. */
351 c_genericize (fndecl
);