1 /* Java(TM) language-specific gimplification routines.
2 Copyright (C) 2003, 2004 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2, or (at your option)
11 GCC is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING. If not, write to
18 the Free Software Foundation, 59 Temple Place - Suite 330,
19 Boston, MA 02111-1307, USA.
21 Java and all Java-based marks are trademarks or registered trademarks
22 of Sun Microsystems, Inc. in the United States and other countries.
23 The Free Software Foundation is independent of Sun Microsystems, Inc. */
27 #include "coretypes.h"
30 #include "java-tree.h"
31 #include "tree-dump.h"
32 #include "tree-gimple.h"
35 static tree java_gimplify_labeled_block_expr (tree);
36 static tree java_gimplify_exit_block_expr (tree);
37 static tree java_gimplify_case_expr (tree);
38 static tree java_gimplify_default_expr (tree);
39 static tree java_gimplify_block (tree);
40 static tree java_gimplify_new_array_init (tree);
41 static tree java_gimplify_try_expr (tree);
42 static tree java_gimplify_modify_expr (tree);
44 static void dump_java_tree (enum tree_dump_index, tree);
46 /* Convert a Java tree to GENERIC. */
49 java_genericize (tree fndecl)
51 dump_java_tree (TDI_original, fndecl);
53 /* Genericize with the gimplifier. */
54 gimplify_function_tree (fndecl);
56 dump_function (TDI_generic, fndecl);
59 /* Gimplify a Java tree. */
62 java_gimplify_expr (tree *expr_p, tree *pre_p ATTRIBUTE_UNUSED,
63 tree *post_p ATTRIBUTE_UNUSED)
65 enum tree_code code = TREE_CODE (*expr_p);
70 *expr_p = java_gimplify_block (*expr_p);
73 case EXPR_WITH_FILE_LOCATION:
74 #ifdef USE_MAPPED_LOCATION
75 input_location = EXPR_LOCATION (*expr_p);
77 input_location.file = EXPR_WFL_FILENAME (*expr_p);
78 input_location.line = EXPR_WFL_LINENO (*expr_p);
80 *expr_p = EXPR_WFL_NODE (*expr_p);
81 SET_EXPR_LOCATION (*expr_p, input_location);
84 case LABELED_BLOCK_EXPR:
85 *expr_p = java_gimplify_labeled_block_expr (*expr_p);
89 *expr_p = java_gimplify_exit_block_expr (*expr_p);
93 *expr_p = java_gimplify_case_expr (*expr_p);
97 *expr_p = java_gimplify_default_expr (*expr_p);
101 *expr_p = java_gimplify_new_array_init (*expr_p);
105 *expr_p = java_gimplify_try_expr (*expr_p);
108 case JAVA_CATCH_EXPR:
109 *expr_p = TREE_OPERAND (*expr_p, 0);
112 case JAVA_EXC_OBJ_EXPR:
113 *expr_p = build_exception_object_ref (TREE_TYPE (*expr_p));
117 *expr_p = java_replace_reference (*expr_p, /* want_lvalue */ false);
121 *expr_p = java_gimplify_modify_expr (*expr_p);
125 /* Note that we can see <save_expr NULL> if the save_expr was
126 already handled by gimplify_save_expr. */
127 if (TREE_OPERAND (*expr_p, 0) != NULL_TREE
128 && TREE_CODE (TREE_OPERAND (*expr_p, 0)) == VAR_DECL)
129 TREE_OPERAND (*expr_p, 0)
130 = java_replace_reference (TREE_OPERAND (*expr_p, 0),
131 /* want_lvalue */ false);
134 /* These should already be lowered before we get here. */
139 case UNARY_PLUS_EXPR:
141 case NEW_ANONYMOUS_ARRAY_EXPR:
144 case SYNCHRONIZED_EXPR:
145 case CONDITIONAL_EXPR:
146 case INSTANCEOF_EXPR:
151 /* Java insists on strict left-to-right evaluation of expressions.
152 A problem may arise if a variable used in the LHS of a binary
153 operation is altered by an assignment to that value in the RHS
154 before we've performed the operation. So, we always copy every
155 LHS to a temporary variable.
157 FIXME: Are there any other cases where we should do this?
158 Parameter lists, maybe? Or perhaps that's unnecessary because
159 the front end already generates SAVE_EXPRs. */
161 if (TREE_CODE_CLASS (code) == tcc_binary
162 || TREE_CODE_CLASS (code) == tcc_comparison)
164 enum gimplify_status stat
165 = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
166 is_gimple_formal_tmp_var, fb_rvalue);
167 if (stat == GS_ERROR)
177 /* Gimplify a LABELED_BLOCK_EXPR into a LABEL_EXPR following
178 a (possibly empty) body. */
181 java_gimplify_labeled_block_expr (tree expr)
183 tree body = LABELED_BLOCK_BODY (expr);
184 tree label = LABELED_BLOCK_LABEL (expr);
187 DECL_CONTEXT (label) = current_function_decl;
188 t = build (LABEL_EXPR, void_type_node, label);
189 if (body != NULL_TREE)
190 t = build (COMPOUND_EXPR, void_type_node, body, t);
194 /* Gimplify a EXIT_BLOCK_EXPR into a GOTO_EXPR. */
197 java_gimplify_exit_block_expr (tree expr)
199 tree labeled_block = EXIT_BLOCK_LABELED_BLOCK (expr);
202 /* First operand must be a LABELED_BLOCK_EXPR, which should
203 already be lowered (or partially lowered) when we get here. */
204 gcc_assert (TREE_CODE (labeled_block) == LABELED_BLOCK_EXPR);
206 label = LABELED_BLOCK_LABEL (labeled_block);
207 return build1 (GOTO_EXPR, void_type_node, label);
210 /* This is specific to the bytecode compiler. If a variable has
211 LOCAL_SLOT_P set, replace an assignment to it with an assignment to
212 the corresponding variable that holds all its aliases. */
215 java_gimplify_modify_expr (tree modify_expr)
217 tree lhs = TREE_OPERAND (modify_expr, 0);
218 tree rhs = TREE_OPERAND (modify_expr, 1);
219 tree lhs_type = TREE_TYPE (lhs);
221 if (TREE_CODE (lhs) == VAR_DECL
222 && DECL_LANG_SPECIFIC (lhs)
223 && LOCAL_SLOT_P (lhs)
224 && TREE_CODE (lhs_type) == POINTER_TYPE)
226 tree new_lhs = java_replace_reference (lhs, /* want_lvalue */ true);
227 tree new_rhs = build1 (NOP_EXPR, TREE_TYPE (new_lhs), rhs);
228 modify_expr = build2 (MODIFY_EXPR, TREE_TYPE (new_lhs),
230 modify_expr = build1 (NOP_EXPR, lhs_type, modify_expr);
238 java_gimplify_case_expr (tree expr)
240 tree label = create_artificial_label ();
241 return build3 (CASE_LABEL_EXPR, void_type_node,
242 TREE_OPERAND (expr, 0), NULL_TREE, label);
246 java_gimplify_default_expr (tree expr ATTRIBUTE_UNUSED)
248 tree label = create_artificial_label ();
249 return build3 (CASE_LABEL_EXPR, void_type_node, NULL_TREE, NULL_TREE, label);
252 /* Gimplify BLOCK into a BIND_EXPR. */
255 java_gimplify_block (tree java_block)
257 tree decls = BLOCK_VARS (java_block);
258 tree body = BLOCK_EXPR_BODY (java_block);
259 tree outer = gimple_current_bind_expr ();
262 /* Don't bother with empty blocks. */
264 return build_empty_stmt ();
266 if (IS_EMPTY_STMT (body))
269 /* Make a proper block. Java blocks are unsuitable for BIND_EXPR
270 because they use BLOCK_SUBBLOCKS for another purpose. */
271 block = make_node (BLOCK);
272 BLOCK_VARS (block) = decls;
274 /* The TREE_USED flag on a block determines whether the debug ouput
275 routines generate info for the variables in that block. */
276 TREE_USED (block) = 1;
278 if (outer != NULL_TREE)
280 outer = BIND_EXPR_BLOCK (outer);
281 BLOCK_SUBBLOCKS (outer) = chainon (BLOCK_SUBBLOCKS (outer), block);
284 return build3 (BIND_EXPR, TREE_TYPE (java_block), decls, body, block);
287 /* Gimplify a NEW_ARRAY_INIT node into array/element assignments. */
290 java_gimplify_new_array_init (tree exp)
292 tree array_type = TREE_TYPE (TREE_TYPE (exp));
293 tree data_field = lookup_field (&array_type, get_identifier ("data"));
294 tree element_type = TYPE_ARRAY_ELEMENT (array_type);
295 HOST_WIDE_INT ilength = java_array_type_length (array_type);
296 tree length = build_int_cst (NULL_TREE, ilength);
297 tree init = TREE_OPERAND (exp, 0);
298 tree values = CONSTRUCTOR_ELTS (init);
300 tree array_ptr_type = build_pointer_type (array_type);
301 tree tmp = create_tmp_var (array_ptr_type, "array");
302 tree body = build2 (MODIFY_EXPR, array_ptr_type, tmp,
303 build_new_array (element_type, length));
307 /* FIXME: try to allocate array statically? */
308 while (values != NULL_TREE)
310 /* FIXME: Should use build_java_arrayaccess here, but avoid
312 tree lhs = build3 (COMPONENT_REF, TREE_TYPE (data_field),
313 build_java_indirect_ref (array_type, tmp, 0),
314 data_field, NULL_TREE);
315 tree assignment = build2 (MODIFY_EXPR, element_type,
316 build4 (ARRAY_REF, element_type, lhs,
317 build_int_cst (NULL_TREE, index++),
318 NULL_TREE, NULL_TREE),
319 TREE_VALUE (values));
320 body = build2 (COMPOUND_EXPR, element_type, body, assignment);
321 values = TREE_CHAIN (values);
324 return build2 (COMPOUND_EXPR, array_ptr_type, body, tmp);
328 java_gimplify_try_expr (tree try_expr)
330 tree body = TREE_OPERAND (try_expr, 0);
331 tree handler = TREE_OPERAND (try_expr, 1);
332 tree catch = NULL_TREE;
334 /* Build a CATCH_EXPR for each handler. */
337 tree java_catch = TREE_OPERAND (handler, 0);
338 tree catch_type = TREE_TYPE (TREE_TYPE (BLOCK_EXPR_DECLS (java_catch)));
339 tree expr = build2 (CATCH_EXPR, void_type_node,
340 prepare_eh_table_type (catch_type),
343 catch = build2 (COMPOUND_EXPR, void_type_node, catch, expr);
346 handler = TREE_CHAIN (handler);
348 return build2 (TRY_CATCH_EXPR, void_type_node, body, catch);
351 /* Dump a tree of some kind. This is a convenience wrapper for the
352 dump_* functions in tree-dump.c. */
354 dump_java_tree (enum tree_dump_index phase, tree t)
359 stream = dump_begin (phase, &flags);
363 dump_node (t, flags, stream);
364 dump_end (phase, stream);