1 /* Source code parsing and tree node generation for the GNU compiler
2 for the Java(TM) language.
3 Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004
4 Free Software Foundation, Inc.
5 Contributed by Alexandre Petit-Bianco (apbianco@cygnus.com)
7 This file is part of GCC.
9 GCC is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 2, or (at your option)
14 GCC is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
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
21 the Free Software Foundation, 59 Temple Place - Suite 330,
22 Boston, MA 02111-1307, USA.
24 Java and all Java-based marks are trademarks or registered trademarks
25 of Sun Microsystems, Inc. in the United States and other countries.
26 The Free Software Foundation is independent of Sun Microsystems, Inc. */
28 /* This file parses java source code and issues a tree node image
29 suitable for code generation (byte code and targeted CPU assembly
32 The grammar conforms to the Java grammar described in "The Java(TM)
33 Language Specification. J. Gosling, B. Joy, G. Steele. Addison Wesley
34 1996, ISBN 0-201-63451-1"
36 The following modifications were brought to the original grammar:
38 method_body: added the rule '| block SC_TK'
39 static_initializer: added the rule 'static block SC_TK'.
41 Note: All the extra rules described above should go away when the
42 empty_statement rule will work.
44 statement_nsi: 'nsi' should be read no_short_if.
46 Some rules have been modified to support JDK1.1 inner classes
47 definitions and other extensions. */
52 #include "coretypes.h"
61 #include "java-tree.h"
73 #include "tree-inline.h"
77 /* Local function prototypes */
78 static char *java_accstring_lookup (int);
79 static const char *accessibility_string (int);
80 static void classitf_redefinition_error (const char *,tree, tree, tree);
81 static void variable_redefinition_error (tree, tree, tree, int);
82 static tree create_class (int, tree, tree, tree);
83 static tree create_interface (int, tree, tree);
84 static void end_class_declaration (int);
85 static tree find_field (tree, tree);
86 static tree lookup_field_wrapper (tree, tree);
87 static int duplicate_declaration_error_p (tree, tree, tree);
88 static void register_fields (int, tree, tree);
89 static tree parser_qualified_classname (tree);
90 static int parser_check_super (tree, tree, tree);
91 static int parser_check_super_interface (tree, tree, tree);
92 static void check_modifiers_consistency (int);
93 static tree lookup_cl (tree);
94 static tree lookup_java_method2 (tree, tree, int);
95 static tree method_header (int, tree, tree, tree);
96 static void fix_method_argument_names (tree ,tree);
97 static tree method_declarator (tree, tree);
98 static void parse_warning_context (tree cl, const char *msg, ...)
100 static void issue_warning_error_from_context (tree, const char *msg, va_list)
101 ATTRIBUTE_PRINTF (2, 0);
102 static void parse_ctor_invocation_error (void);
103 static tree parse_jdk1_1_error (const char *);
104 static void complete_class_report_errors (jdep *);
105 static int process_imports (void);
106 static void read_import_dir (tree);
107 static int find_in_imports_on_demand (tree, tree);
108 static void find_in_imports (tree, tree);
109 static void check_inner_class_access (tree, tree, tree);
110 static int check_pkg_class_access (tree, tree, bool, tree);
111 static void register_package (tree);
112 static tree resolve_package (tree, tree *, tree *);
113 static tree resolve_class (tree, tree, tree, tree);
114 static void declare_local_variables (int, tree, tree);
115 static void dump_java_tree (enum tree_dump_index, tree);
116 static void source_start_java_method (tree);
117 static void source_end_java_method (void);
118 static tree find_name_in_single_imports (tree);
119 static void check_abstract_method_header (tree);
120 static tree lookup_java_interface_method2 (tree, tree);
121 static tree resolve_expression_name (tree, tree *);
122 static tree maybe_create_class_interface_decl (tree, tree, tree, tree);
123 static int check_class_interface_creation (int, int, tree, tree, tree, tree);
124 static tree patch_method_invocation (tree, tree, tree, int, int *, tree *);
125 static tree resolve_and_layout (tree, tree);
126 static tree qualify_and_find (tree, tree, tree);
127 static tree resolve_no_layout (tree, tree);
128 static int invocation_mode (tree, int);
129 static tree find_applicable_accessible_methods_list (int, tree, tree, tree);
130 static void search_applicable_methods_list (int, tree, tree, tree, tree *, tree *);
131 static tree find_most_specific_methods_list (tree);
132 static int argument_types_convertible (tree, tree);
133 static tree patch_invoke (tree, tree, tree);
134 static int maybe_use_access_method (int, tree *, tree *);
135 static tree lookup_method_invoke (int, tree, tree, tree, tree);
136 static tree register_incomplete_type (int, tree, tree, tree);
137 static tree check_inner_circular_reference (tree, tree);
138 static tree check_circular_reference (tree);
139 static tree obtain_incomplete_type (tree);
140 static tree java_complete_lhs (tree);
141 static tree java_complete_tree (tree);
142 static tree maybe_generate_pre_expand_clinit (tree);
143 static int analyze_clinit_body (tree, tree);
144 static int maybe_yank_clinit (tree);
145 static void start_complete_expand_method (tree);
146 static void java_complete_expand_method (tree);
147 static void java_expand_method_bodies (tree);
148 static int unresolved_type_p (tree, tree *);
149 static void create_jdep_list (struct parser_ctxt *);
150 static tree build_expr_block (tree, tree);
151 static tree enter_block (void);
152 static tree exit_block (void);
153 static tree lookup_name_in_blocks (tree);
154 static void maybe_absorb_scoping_blocks (void);
155 static tree build_method_invocation (tree, tree);
156 static tree build_new_invocation (tree, tree);
157 static tree build_assignment (int, int, tree, tree);
158 static tree build_binop (enum tree_code, int, tree, tree);
159 static tree patch_assignment (tree, tree);
160 static tree patch_binop (tree, tree, tree);
161 static tree build_unaryop (int, int, tree);
162 static tree build_incdec (int, int, tree, int);
163 static tree patch_unaryop (tree, tree);
164 static tree build_cast (int, tree, tree);
165 static tree build_null_of_type (tree);
166 static tree patch_cast (tree, tree);
167 static int valid_ref_assignconv_cast_p (tree, tree, int);
168 static int valid_builtin_assignconv_identity_widening_p (tree, tree);
169 static int valid_cast_to_p (tree, tree);
170 static int valid_method_invocation_conversion_p (tree, tree);
171 static tree try_builtin_assignconv (tree, tree, tree);
172 static tree try_reference_assignconv (tree, tree);
173 static tree build_unresolved_array_type (tree);
174 static int build_type_name_from_array_name (tree, tree *);
175 static tree build_array_from_name (tree, tree, tree, tree *);
176 static tree build_array_ref (int, tree, tree);
177 static tree patch_array_ref (tree);
178 static tree make_qualified_name (tree, tree, int);
179 static tree merge_qualified_name (tree, tree);
180 static tree make_qualified_primary (tree, tree, int);
181 static int resolve_qualified_expression_name (tree, tree *, tree *, tree *);
182 static void qualify_ambiguous_name (tree);
183 static tree resolve_field_access (tree, tree *, tree *);
184 static tree build_newarray_node (tree, tree, int);
185 static tree patch_newarray (tree);
186 static tree resolve_type_during_patch (tree);
187 static tree build_this (int);
188 static tree build_wfl_wrap (tree, int);
189 static tree build_return (int, tree);
190 static tree patch_return (tree);
191 static tree maybe_access_field (tree, tree, tree);
192 static int complete_function_arguments (tree);
193 static int check_for_static_method_reference (tree, tree, tree, tree, tree);
194 static int not_accessible_p (tree, tree, tree, int);
195 static void check_deprecation (tree, tree);
196 static int class_in_current_package (tree);
197 static tree build_if_else_statement (int, tree, tree, tree);
198 static tree patch_if_else_statement (tree);
199 static tree add_stmt_to_block (tree, tree, tree);
200 static tree patch_exit_expr (tree);
201 static tree build_labeled_block (int, tree);
202 static tree finish_labeled_statement (tree, tree);
203 static tree build_bc_statement (int, int, tree);
204 static tree patch_bc_statement (tree);
205 static tree patch_loop_statement (tree);
206 static tree build_new_loop (tree);
207 static tree build_loop_body (int, tree, int);
208 static tree finish_loop_body (int, tree, tree, int);
209 static tree build_debugable_stmt (int, tree);
210 static tree finish_for_loop (int, tree, tree, tree);
211 static tree patch_switch_statement (tree);
212 static tree string_constant_concatenation (tree, tree);
213 static tree build_string_concatenation (tree, tree);
214 static tree patch_string_cst (tree);
215 static tree patch_string (tree);
216 static tree encapsulate_with_try_catch (int, tree, tree, tree);
217 static tree build_assertion (int, tree, tree);
218 static tree build_try_statement (int, tree, tree);
219 static tree build_try_finally_statement (int, tree, tree);
220 static tree patch_try_statement (tree);
221 static tree patch_synchronized_statement (tree, tree);
222 static tree patch_throw_statement (tree, tree);
223 static void check_thrown_exceptions (int, tree, tree);
224 static int check_thrown_exceptions_do (tree);
225 static void purge_unchecked_exceptions (tree);
226 static bool ctors_unchecked_throws_clause_p (tree);
227 static void check_concrete_throws_clauses (tree, tree, tree, tree);
228 static void check_throws_clauses (tree, tree, tree);
229 static void finish_method_declaration (tree);
230 static tree build_super_invocation (tree);
231 static int verify_constructor_circularity (tree, tree);
232 static char *constructor_circularity_msg (tree, tree);
233 static tree build_this_super_qualified_invocation (int, tree, tree, int, int);
234 static const char *get_printable_method_name (tree);
235 static tree patch_conditional_expr (tree, tree, tree);
236 static tree generate_finit (tree);
237 static tree generate_instinit (tree);
238 static tree build_instinit_invocation (tree);
239 static void fix_constructors (tree);
240 static tree build_alias_initializer_parameter_list (int, tree, tree, int *);
241 static tree craft_constructor (tree, tree);
242 static int verify_constructor_super (tree);
243 static tree create_artificial_method (tree, int, tree, tree, tree);
244 static void start_artificial_method_body (tree);
245 static void end_artificial_method_body (tree);
246 static int check_method_redefinition (tree, tree);
247 static int check_method_types_complete (tree);
248 static bool hack_is_accessible_p (tree, tree);
249 static void java_check_regular_methods (tree);
250 static void check_interface_throws_clauses (tree, tree);
251 static void java_check_abstract_methods (tree);
252 static void unreachable_stmt_error (tree);
253 static int not_accessible_field_error (tree, tree);
254 static tree find_expr_with_wfl (tree);
255 static void missing_return_error (tree);
256 static tree build_new_array_init (int, tree);
257 static tree patch_new_array_init (tree, tree);
258 static tree maybe_build_array_element_wfl (tree);
259 static int array_constructor_check_entry (tree, tree);
260 static const char *purify_type_name (const char *);
261 static tree fold_constant_for_init (tree, tree);
262 static tree strip_out_static_field_access_decl (tree);
263 static jdeplist *reverse_jdep_list (struct parser_ctxt *);
264 static void static_ref_err (tree, tree, tree);
265 static void parser_add_interface (tree, tree, tree);
266 static void add_superinterfaces (tree, tree);
267 static tree jdep_resolve_class (jdep *);
268 static int note_possible_classname (const char *, int);
269 static void java_complete_expand_classes (void);
270 static void java_complete_expand_class (tree);
271 static void java_complete_expand_methods (tree);
272 static tree cut_identifier_in_qualified (tree);
273 static tree java_stabilize_reference (tree);
274 static tree do_unary_numeric_promotion (tree);
275 static char * operator_string (tree);
276 static tree do_merge_string_cste (tree, const char *, int, int);
277 static tree merge_string_cste (tree, tree, int);
278 static tree java_refold (tree);
279 static int java_decl_equiv (tree, tree);
280 static int binop_compound_p (enum tree_code);
281 static tree search_loop (tree);
282 static int labeled_block_contains_loop_p (tree, tree);
283 static int check_abstract_method_definitions (int, tree, tree);
284 static void java_check_abstract_method_definitions (tree);
285 static void java_debug_context_do (int);
286 static void java_parser_context_push_initialized_field (void);
287 static void java_parser_context_pop_initialized_field (void);
288 static tree reorder_static_initialized (tree);
289 static void java_parser_context_suspend (void);
290 static void java_parser_context_resume (void);
291 static int pop_current_osb (struct parser_ctxt *);
293 /* JDK 1.1 work. FIXME */
295 static tree maybe_make_nested_class_name (tree);
296 static int make_nested_class_name (tree);
297 static void link_nested_class_to_enclosing (void);
298 static tree resolve_inner_class (htab_t, tree, tree *, tree *, tree);
299 static tree find_as_inner_class (tree, tree, tree);
300 static tree find_as_inner_class_do (tree, tree);
301 static int check_inner_class_redefinition (tree, tree);
303 static tree build_thisn_assign (void);
304 static tree build_current_thisn (tree);
305 static tree build_access_to_thisn (tree, tree, int);
306 static tree maybe_build_thisn_access_method (tree);
308 static tree build_outer_field_access (tree, tree);
309 static tree build_outer_field_access_methods (tree);
310 static tree build_outer_field_access_expr (int, tree, tree,
312 static tree build_outer_method_access_method (tree);
313 static tree build_new_access_id (void);
314 static tree build_outer_field_access_method (tree, tree, tree,
317 static int outer_field_access_p (tree, tree);
318 static int outer_field_expanded_access_p (tree, tree *,
320 static tree outer_field_access_fix (tree, tree, tree);
321 static tree build_incomplete_class_ref (int, tree);
322 static tree patch_incomplete_class_ref (tree);
323 static tree create_anonymous_class (tree);
324 static void patch_anonymous_class (tree, tree, tree);
325 static void add_inner_class_fields (tree, tree);
327 static tree build_dot_class_method (tree);
328 static tree build_dot_class_method_invocation (tree, tree);
329 static void create_new_parser_context (int);
330 static tree maybe_build_class_init_for_field (tree, tree);
332 static int attach_init_test_initialization_flags (void **, void *);
333 static int emit_test_initialization (void **, void *);
335 static char *string_convert_int_cst (tree);
337 /* Number of error found so far. */
338 int java_error_count;
339 /* Number of warning found so far. */
340 int java_warning_count;
341 /* Tell when not to fold, when doing xrefs */
343 /* Cyclic inheritance report, as it can be set by layout_class */
344 const char *cyclic_inheritance_report;
346 /* The current parser context */
347 struct parser_ctxt *ctxp;
349 /* List of things that were analyzed for which code will be generated */
350 struct parser_ctxt *ctxp_for_generation = NULL;
352 /* binop_lookup maps token to tree_code. It is used where binary
353 operations are involved and required by the parser. RDIV_EXPR
354 covers both integral/floating point division. The code is changed
355 once the type of both operator is worked out. */
357 static const enum tree_code binop_lookup[19] =
359 PLUS_EXPR, MINUS_EXPR, MULT_EXPR, RDIV_EXPR, TRUNC_MOD_EXPR,
360 LSHIFT_EXPR, RSHIFT_EXPR, URSHIFT_EXPR,
361 BIT_AND_EXPR, BIT_XOR_EXPR, BIT_IOR_EXPR,
362 TRUTH_ANDIF_EXPR, TRUTH_ORIF_EXPR,
363 EQ_EXPR, NE_EXPR, GT_EXPR, GE_EXPR, LT_EXPR, LE_EXPR,
365 #define BINOP_LOOKUP(VALUE) \
366 binop_lookup [((VALUE) - PLUS_TK) % ARRAY_SIZE (binop_lookup)]
368 /* This is the end index for binary operators that can also be used
369 in compound assignments. */
370 #define BINOP_COMPOUND_CANDIDATES 11
372 /* The "$L" identifier we use to create labels. */
373 static GTY(()) tree label_id;
375 /* The "StringBuffer" identifier used for the String `+' operator. */
376 static GTY(()) tree wfl_string_buffer;
378 /* The "append" identifier used for String `+' operator. */
379 static GTY(()) tree wfl_append;
381 /* The "toString" identifier used for String `+' operator. */
382 static GTY(()) tree wfl_to_string;
384 /* The "java.lang" import qualified name. */
385 static GTY(()) tree java_lang_id;
387 /* The generated `inst$' identifier used for generated enclosing
388 instance/field access functions. */
389 static GTY(()) tree inst_id;
391 /* Context and flag for static blocks */
392 static GTY(()) tree current_static_block;
394 /* The generated `write_parm_value$' identifier. */
395 static GTY(()) tree wpv_id;
397 /* The list of all packages we've seen so far */
398 static GTY(()) tree package_list;
400 /* Hold THIS for the scope of the current method decl. */
401 static GTY(()) tree current_this;
403 /* Hold a list of catch clauses list. The first element of this list is
404 the list of the catch clauses of the currently analyzed try block. */
405 static GTY(()) tree currently_caught_type_list;
407 /* This holds a linked list of all the case labels for the current
408 switch statement. It is only used when checking to see if there
409 are duplicate labels. FIXME: probably this should just be attached
410 to the switch itself; then it could be referenced via
411 `ctxp->current_loop'. */
412 static GTY(()) tree case_label_list;
414 /* Anonymous class counter. Will be reset to 1 every time a non
415 anonymous class gets created. */
416 static int anonymous_class_counter = 1;
418 static GTY(()) tree src_parse_roots[1];
420 /* All classes seen from source code */
421 #define gclass_list src_parse_roots[0]
423 /* Check modifiers. If one doesn't fit, retrieve it in its declaration
424 line and point it out. */
425 /* Should point out the one that don't fit. ASCII/unicode, going
428 #define check_modifiers(__message, __value, __mask) do { \
429 if ((__value) & ~(__mask)) \
431 size_t i, remainder = (__value) & ~(__mask); \
432 for (i = 0; i < ARRAY_SIZE (ctxp->modifier_ctx); i++) \
433 if ((1 << i) & remainder) \
434 parse_error_context (ctxp->modifier_ctx [i], (__message), \
435 java_accstring_lookup (1 << i)); \
457 /* Things defined here have to match the order of what's in the
458 binop_lookup table. */
460 %token PLUS_TK MINUS_TK MULT_TK DIV_TK REM_TK
461 %token LS_TK SRS_TK ZRS_TK
462 %token AND_TK XOR_TK OR_TK
463 %token BOOL_AND_TK BOOL_OR_TK
464 %token EQ_TK NEQ_TK GT_TK GTE_TK LT_TK LTE_TK
466 /* This maps to the same binop_lookup entry than the token above */
468 %token PLUS_ASSIGN_TK MINUS_ASSIGN_TK MULT_ASSIGN_TK DIV_ASSIGN_TK
470 %token LS_ASSIGN_TK SRS_ASSIGN_TK ZRS_ASSIGN_TK
471 %token AND_ASSIGN_TK XOR_ASSIGN_TK OR_ASSIGN_TK
474 /* Modifier TOKEN have to be kept in this order. Don't scramble it */
476 %token PUBLIC_TK PRIVATE_TK PROTECTED_TK
477 %token STATIC_TK FINAL_TK SYNCHRONIZED_TK
478 %token VOLATILE_TK TRANSIENT_TK NATIVE_TK
479 %token PAD_TK ABSTRACT_TK STRICT_TK
482 /* Keep those two in order, too */
483 %token DECR_TK INCR_TK
485 /* From now one, things can be in any order */
487 %token DEFAULT_TK IF_TK THROW_TK
488 %token BOOLEAN_TK DO_TK IMPLEMENTS_TK
489 %token THROWS_TK BREAK_TK IMPORT_TK
490 %token ELSE_TK INSTANCEOF_TK RETURN_TK
491 %token VOID_TK CATCH_TK INTERFACE_TK
492 %token CASE_TK EXTENDS_TK FINALLY_TK
493 %token SUPER_TK WHILE_TK CLASS_TK
494 %token SWITCH_TK CONST_TK TRY_TK
495 %token FOR_TK NEW_TK CONTINUE_TK
496 %token GOTO_TK PACKAGE_TK THIS_TK
499 %token BYTE_TK SHORT_TK INT_TK LONG_TK
500 %token CHAR_TK INTEGRAL_TK
502 %token FLOAT_TK DOUBLE_TK FP_TK
506 %token REL_QM_TK REL_CL_TK NOT_TK NEG_TK
508 %token ASSIGN_ANY_TK ASSIGN_TK
509 %token OP_TK CP_TK OCB_TK CCB_TK OSB_TK CSB_TK SC_TK C_TK DOT_TK
511 %token STRING_LIT_TK CHAR_LIT_TK INT_LIT_TK FP_LIT_TK
512 %token TRUE_TK FALSE_TK BOOL_LIT_TK NULL_TK
514 %type <value> modifiers MODIFIER_TK final synchronized
516 %type <node> super ID_TK identifier
517 %type <node> name simple_name qualified_name
518 %type <node> type_declaration compilation_unit
519 field_declaration method_declaration extends_interfaces
520 interfaces interface_type_list
521 import_declarations package_declaration
522 type_declarations interface_body
523 interface_member_declaration constant_declaration
524 interface_member_declarations interface_type
525 abstract_method_declaration
526 %type <node> class_body_declaration class_member_declaration
527 static_initializer constructor_declaration block
528 %type <node> class_body_declarations constructor_header
529 %type <node> class_or_interface_type class_type class_type_list
530 constructor_declarator explicit_constructor_invocation
531 %type <node> dim_expr dim_exprs this_or_super throws
533 %type <node> variable_declarator_id variable_declarator
534 variable_declarators variable_initializer
535 variable_initializers constructor_body
538 %type <node> class_body block_end constructor_block_end
539 %type <node> statement statement_without_trailing_substatement
540 labeled_statement if_then_statement label_decl
541 if_then_else_statement while_statement for_statement
542 statement_nsi labeled_statement_nsi do_statement
543 if_then_else_statement_nsi while_statement_nsi
544 for_statement_nsi statement_expression_list for_init
545 for_update statement_expression expression_statement
546 primary_no_new_array expression primary
547 array_creation_expression array_type
548 class_instance_creation_expression field_access
549 method_invocation array_access something_dot_new
550 argument_list postfix_expression while_expression
551 post_increment_expression post_decrement_expression
552 unary_expression_not_plus_minus unary_expression
553 pre_increment_expression pre_decrement_expression
555 multiplicative_expression additive_expression
556 shift_expression relational_expression
557 equality_expression and_expression
558 exclusive_or_expression inclusive_or_expression
559 conditional_and_expression conditional_or_expression
560 conditional_expression assignment_expression
561 left_hand_side assignment for_header for_begin
562 constant_expression do_statement_begin empty_statement
563 switch_statement synchronized_statement throw_statement
564 try_statement assert_statement
565 switch_expression switch_block
566 catches catch_clause catch_clause_parameter finally
567 anonymous_class_creation trap_overflow_corner_case
568 %type <node> return_statement break_statement continue_statement
570 %type <operator> ASSIGN_TK MULT_ASSIGN_TK DIV_ASSIGN_TK
571 %type <operator> REM_ASSIGN_TK PLUS_ASSIGN_TK MINUS_ASSIGN_TK
572 %type <operator> LS_ASSIGN_TK SRS_ASSIGN_TK ZRS_ASSIGN_TK
573 %type <operator> AND_ASSIGN_TK XOR_ASSIGN_TK OR_ASSIGN_TK
574 %type <operator> ASSIGN_ANY_TK assignment_operator
575 %token <operator> EQ_TK GTE_TK ZRS_TK SRS_TK GT_TK LTE_TK LS_TK
576 %token <operator> BOOL_AND_TK AND_TK BOOL_OR_TK OR_TK INCR_TK PLUS_TK
577 %token <operator> DECR_TK MINUS_TK MULT_TK DIV_TK XOR_TK REM_TK NEQ_TK
578 %token <operator> NEG_TK REL_QM_TK REL_CL_TK NOT_TK LT_TK OCB_TK CCB_TK
579 %token <operator> OP_TK OSB_TK DOT_TK THROW_TK INSTANCEOF_TK
580 %type <operator> THIS_TK SUPER_TK RETURN_TK BREAK_TK CONTINUE_TK
581 %type <operator> CASE_TK DEFAULT_TK TRY_TK CATCH_TK SYNCHRONIZED_TK
582 %type <operator> NEW_TK ASSERT_TK
584 %type <node> method_body
586 %type <node> literal INT_LIT_TK FP_LIT_TK BOOL_LIT_TK CHAR_LIT_TK
587 STRING_LIT_TK NULL_TK VOID_TK
589 %type <node> IF_TK WHILE_TK FOR_TK
591 %type <node> formal_parameter_list formal_parameter
592 method_declarator method_header
594 %type <node> primitive_type reference_type type
595 BOOLEAN_TK INTEGRAL_TK FP_TK
597 /* Added or modified JDK 1.1 rule types */
598 %type <node> type_literals
601 /* 19.2 Production from 2.3: The Syntactic Grammar */
602 goal: compilation_unit
606 /* 19.3 Productions from 3: Lexical structure */
616 /* 19.4 Productions from 4: Types, Values and Variables */
629 class_or_interface_type
633 class_or_interface_type:
638 class_or_interface_type /* Default rule */
642 class_or_interface_type
648 int osb = pop_current_osb (ctxp);
649 tree t = build_java_array_type (($1), -1);
651 t = build_unresolved_array_type (t);
656 int osb = pop_current_osb (ctxp);
659 t = build_unresolved_array_type (t);
664 /* 19.5 Productions from 6: Names */
666 simple_name /* Default rule */
667 | qualified_name /* Default rule */
671 identifier /* Default rule */
675 name DOT_TK identifier
676 { $$ = make_qualified_name ($1, $3, $2.location); }
683 /* 19.6: Production from 7: Packages */
686 | package_declaration
687 | import_declarations
689 | package_declaration import_declarations
690 | package_declaration type_declarations
691 | import_declarations type_declarations
692 | package_declaration import_declarations type_declarations
700 | import_declarations import_declaration
708 | type_declarations type_declaration
712 PACKAGE_TK name SC_TK
714 ctxp->package = EXPR_WFL_NODE ($2);
715 register_package (ctxp->package);
718 {yyerror ("Missing name"); RECOVER;}
719 | PACKAGE_TK name error
720 {yyerror ("';' expected"); RECOVER;}
724 single_type_import_declaration
725 | type_import_on_demand_declaration
728 single_type_import_declaration:
731 tree name = EXPR_WFL_NODE ($2), last_name;
732 int i = IDENTIFIER_LENGTH (name)-1;
733 const char *last = &IDENTIFIER_POINTER (name)[i];
734 while (last != IDENTIFIER_POINTER (name))
740 last_name = get_identifier (++last);
741 if (IS_A_SINGLE_IMPORT_CLASSFILE_NAME_P (last_name))
743 tree err = find_name_in_single_imports (last_name);
744 if (err && err != name)
746 ($2, "Ambiguous class: `%s' and `%s'",
747 IDENTIFIER_POINTER (name),
748 IDENTIFIER_POINTER (err));
750 REGISTER_IMPORT ($2, last_name);
753 REGISTER_IMPORT ($2, last_name);
756 {yyerror ("Missing name"); RECOVER;}
757 | IMPORT_TK name error
758 {yyerror ("';' expected"); RECOVER;}
761 type_import_on_demand_declaration:
762 IMPORT_TK name DOT_TK MULT_TK SC_TK
764 tree name = EXPR_WFL_NODE ($2);
766 /* Search for duplicates. */
767 for (it = ctxp->import_demand_list; it; it = TREE_CHAIN (it))
768 if (EXPR_WFL_NODE (TREE_PURPOSE (it)) == name)
770 /* Don't import the same thing more than once, just ignore
771 duplicates (7.5.2) */
774 read_import_dir ($2);
775 ctxp->import_demand_list =
776 chainon (ctxp->import_demand_list,
777 build_tree_list ($2, NULL_TREE));
780 | IMPORT_TK name DOT_TK error
781 {yyerror ("'*' expected"); RECOVER;}
782 | IMPORT_TK name DOT_TK MULT_TK error
783 {yyerror ("';' expected"); RECOVER;}
788 { end_class_declaration (0); }
789 | interface_declaration
790 { end_class_declaration (0); }
795 yyerror ("Class or interface declaration expected");
799 /* 19.7 Shortened from the original:
800 modifiers: modifier | modifiers modifier
801 modifier: any of public... */
807 | modifiers MODIFIER_TK
812 (ctxp->modifier_ctx [$2], "Modifier `%s' declared twice",
813 java_accstring_lookup (acc));
821 /* 19.8.1 Production from $8.1: Class Declaration */
823 modifiers CLASS_TK identifier super interfaces
824 { create_class ($1, $3, $4, $5); }
827 | CLASS_TK identifier super interfaces
828 { create_class (0, $2, $3, $4); }
831 | modifiers CLASS_TK error
832 { yyerror ("Missing class name"); RECOVER; }
834 { yyerror ("Missing class name"); RECOVER; }
835 | CLASS_TK identifier error
837 if (!ctxp->class_err) yyerror ("'{' expected");
840 | modifiers CLASS_TK identifier error
841 { if (!ctxp->class_err) yyerror ("'{' expected"); RECOVER; }
846 | EXTENDS_TK class_type
848 | EXTENDS_TK class_type error
849 {yyerror ("'{' expected"); ctxp->class_err=1;}
851 {yyerror ("Missing super class name"); ctxp->class_err=1;}
856 | IMPLEMENTS_TK interface_type_list
858 | IMPLEMENTS_TK error
861 yyerror ("Missing interface name");
868 ctxp->interface_number = 1;
869 $$ = build_tree_list ($1, NULL_TREE);
871 | interface_type_list C_TK interface_type
873 ctxp->interface_number++;
874 $$ = chainon ($1, build_tree_list ($3, NULL_TREE));
876 | interface_type_list C_TK error
877 {yyerror ("Missing interface name"); RECOVER;}
883 /* Store the location of the `}' when doing xrefs */
885 DECL_END_SOURCE_LINE (GET_CPC ()) =
886 EXPR_WFL_ADD_COL ($2.location, 1);
889 | OCB_TK class_body_declarations CCB_TK
891 /* Store the location of the `}' when doing xrefs */
893 DECL_END_SOURCE_LINE (GET_CPC ()) =
894 EXPR_WFL_ADD_COL ($3.location, 1);
899 class_body_declarations:
900 class_body_declaration
901 | class_body_declarations class_body_declaration
904 class_body_declaration:
905 class_member_declaration
907 | constructor_declaration
908 | block /* Added, JDK1.1, instance initializer */
910 if (!IS_EMPTY_STMT ($1))
912 TREE_CHAIN ($1) = CPC_INSTANCE_INITIALIZER_STMT (ctxp);
913 SET_CPC_INSTANCE_INITIALIZER_STMT (ctxp, $1);
918 class_member_declaration:
921 | class_declaration /* Added, JDK1.1 inner classes */
922 { end_class_declaration (1); }
923 | interface_declaration /* Added, JDK1.1 inner interfaces */
924 { end_class_declaration (1); }
928 /* 19.8.2 Productions from 8.3: Field Declarations */
930 type variable_declarators SC_TK
931 { register_fields (0, $1, $2); }
932 | modifiers type variable_declarators SC_TK
935 ("Illegal modifier `%s' for field declaration",
936 $1, FIELD_MODIFIERS);
937 check_modifiers_consistency ($1);
938 register_fields ($1, $2, $3);
942 variable_declarators:
943 /* Should we use build_decl_list () instead ? FIXME */
944 variable_declarator /* Default rule */
945 | variable_declarators C_TK variable_declarator
946 { $$ = chainon ($1, $3); }
947 | variable_declarators C_TK error
948 {yyerror ("Missing term"); RECOVER;}
952 variable_declarator_id
953 { $$ = build_tree_list ($1, NULL_TREE); }
954 | variable_declarator_id ASSIGN_TK variable_initializer
956 if (java_error_count)
959 ($1, build_assignment ($2.token, $2.location, $1, $3));
961 | variable_declarator_id ASSIGN_TK error
963 yyerror ("Missing variable initializer");
964 $$ = build_tree_list ($1, NULL_TREE);
967 | variable_declarator_id ASSIGN_TK variable_initializer error
969 yyerror ("';' expected");
970 $$ = build_tree_list ($1, NULL_TREE);
975 variable_declarator_id:
977 | variable_declarator_id OSB_TK CSB_TK
978 { $$ = build_unresolved_array_type ($1); }
980 {yyerror ("Invalid declaration"); DRECOVER(vdi);}
981 | variable_declarator_id OSB_TK error
983 yyerror ("']' expected");
986 | variable_declarator_id CSB_TK error
987 {yyerror ("Unbalanced ']'"); DRECOVER(vdi);}
990 variable_initializer:
995 /* 19.8.3 Productions from 8.4: Method Declarations */
999 current_function_decl = $1;
1000 if (current_function_decl
1001 && TREE_CODE (current_function_decl) == FUNCTION_DECL)
1002 source_start_java_method (current_function_decl);
1004 current_function_decl = NULL_TREE;
1007 { finish_method_declaration ($3); }
1008 | method_header error
1009 {YYNOT_TWICE yyerror ("'{' expected"); RECOVER;}
1013 type method_declarator throws
1014 { $$ = method_header (0, $1, $2, $3); }
1015 | VOID_TK method_declarator throws
1016 { $$ = method_header (0, void_type_node, $2, $3); }
1017 | modifiers type method_declarator throws
1018 { $$ = method_header ($1, $2, $3, $4); }
1019 | modifiers VOID_TK method_declarator throws
1020 { $$ = method_header ($1, void_type_node, $3, $4); }
1023 yyerror ("Invalid method declaration, method name required");
1026 | modifiers type error
1028 yyerror ("Identifier expected");
1033 yyerror ("Identifier expected");
1036 | modifiers VOID_TK error
1038 yyerror ("Identifier expected");
1043 yyerror ("Invalid method declaration, return type required");
1049 identifier OP_TK CP_TK
1051 ctxp->formal_parameter_number = 0;
1052 $$ = method_declarator ($1, NULL_TREE);
1054 | identifier OP_TK formal_parameter_list CP_TK
1055 { $$ = method_declarator ($1, $3); }
1056 | method_declarator OSB_TK CSB_TK
1058 EXPR_WFL_LINECOL (wfl_operator) = $2.location;
1060 build_unresolved_array_type (TREE_PURPOSE ($1));
1061 parse_warning_context
1063 "Discouraged form of returned type specification");
1065 | identifier OP_TK error
1066 {yyerror ("')' expected"); DRECOVER(method_declarator);}
1067 | method_declarator OSB_TK error
1068 {yyerror ("']' expected"); RECOVER;}
1071 formal_parameter_list:
1074 ctxp->formal_parameter_number = 1;
1076 | formal_parameter_list C_TK formal_parameter
1078 ctxp->formal_parameter_number += 1;
1079 $$ = chainon ($1, $3);
1081 | formal_parameter_list C_TK error
1082 { yyerror ("Missing formal parameter term"); RECOVER; }
1086 type variable_declarator_id
1088 $$ = build_tree_list ($2, $1);
1090 | final type variable_declarator_id /* Added, JDK1.1 final parms */
1092 $$ = build_tree_list ($3, $2);
1093 ARG_FINAL_P ($$) = 1;
1097 yyerror ("Missing identifier"); RECOVER;
1102 yyerror ("Missing identifier"); RECOVER;
1110 check_modifiers ("Illegal modifier `%s'. Only `final' was expected here",
1112 if ($1 != ACC_FINAL)
1113 MODIFIER_WFL (FINAL_TK) = build_wfl_node (NULL_TREE);
1119 | THROWS_TK class_type_list
1122 {yyerror ("Missing class type term"); RECOVER;}
1127 { $$ = build_tree_list ($1, $1); }
1128 | class_type_list C_TK class_type
1129 { $$ = tree_cons ($3, $3, $1); }
1130 | class_type_list C_TK error
1131 {yyerror ("Missing class type term"); RECOVER;}
1136 | SC_TK { $$ = NULL_TREE; }
1139 /* 19.8.4 Productions from 8.5: Static Initializers */
1143 TREE_CHAIN ($2) = CPC_STATIC_INITIALIZER_STMT (ctxp);
1144 SET_CPC_STATIC_INITIALIZER_STMT (ctxp, $2);
1145 current_static_block = NULL_TREE;
1149 static: /* Test lval.sub_token here */
1152 check_modifiers ("Illegal modifier `%s' for static initializer", $1, ACC_STATIC);
1153 /* Can't have a static initializer in an innerclass */
1154 if ($1 | ACC_STATIC &&
1155 GET_CPC_LIST () && !TOPLEVEL_CLASS_DECL_P (GET_CPC ()))
1157 (MODIFIER_WFL (STATIC_TK),
1158 "Can't define static initializer in class `%s'. Static initializer can only be defined in top-level classes",
1159 IDENTIFIER_POINTER (DECL_NAME (GET_CPC ())));
1160 SOURCE_FRONTEND_DEBUG (("Modifiers: %d", $1));
1164 /* 19.8.5 Productions from 8.6: Constructor Declarations */
1165 constructor_declaration:
1168 current_function_decl = $1;
1169 source_start_java_method (current_function_decl);
1172 { finish_method_declaration ($3); }
1176 constructor_declarator throws
1177 { $$ = method_header (0, NULL_TREE, $1, $2); }
1178 | modifiers constructor_declarator throws
1179 { $$ = method_header ($1, NULL_TREE, $2, $3); }
1182 constructor_declarator:
1183 simple_name OP_TK CP_TK
1185 ctxp->formal_parameter_number = 0;
1186 $$ = method_declarator ($1, NULL_TREE);
1188 | simple_name OP_TK formal_parameter_list CP_TK
1189 { $$ = method_declarator ($1, $3); }
1193 /* Unlike regular method, we always need a complete (empty)
1194 body so we can safely perform all the required code
1195 addition (super invocation and field initialization) */
1196 block_begin constructor_block_end
1198 BLOCK_EXPR_BODY ($2) = build_java_empty_stmt ();
1201 | block_begin explicit_constructor_invocation constructor_block_end
1203 | block_begin block_statements constructor_block_end
1205 | block_begin explicit_constructor_invocation block_statements constructor_block_end
1209 constructor_block_end:
1213 /* Error recovery for that rule moved down expression_statement: rule. */
1214 explicit_constructor_invocation:
1215 this_or_super OP_TK CP_TK SC_TK
1217 $$ = build_method_invocation ($1, NULL_TREE);
1218 $$ = build_debugable_stmt (EXPR_WFL_LINECOL ($1), $$);
1219 $$ = java_method_add_stmt (current_function_decl, $$);
1221 | this_or_super OP_TK argument_list CP_TK SC_TK
1223 $$ = build_method_invocation ($1, $3);
1224 $$ = build_debugable_stmt (EXPR_WFL_LINECOL ($1), $$);
1225 $$ = java_method_add_stmt (current_function_decl, $$);
1227 /* Added, JDK1.1 inner classes. Modified because the rule
1228 'primary' couldn't work. */
1229 | name DOT_TK SUPER_TK OP_TK argument_list CP_TK SC_TK
1230 {$$ = parse_jdk1_1_error ("explicit constructor invocation"); }
1231 | name DOT_TK SUPER_TK OP_TK CP_TK SC_TK
1232 {$$ = parse_jdk1_1_error ("explicit constructor invocation"); }
1235 this_or_super: /* Added, simplifies error diagnostics */
1238 tree wfl = build_wfl_node (this_identifier_node);
1239 EXPR_WFL_LINECOL (wfl) = $1.location;
1244 tree wfl = build_wfl_node (super_identifier_node);
1245 EXPR_WFL_LINECOL (wfl) = $1.location;
1250 /* 19.9 Productions from 9: Interfaces */
1251 /* 19.9.1 Productions from 9.1: Interfaces Declarations */
1252 interface_declaration:
1253 INTERFACE_TK identifier
1254 { create_interface (0, $2, NULL_TREE); }
1257 | modifiers INTERFACE_TK identifier
1258 { create_interface ($1, $3, NULL_TREE); }
1261 | INTERFACE_TK identifier extends_interfaces
1262 { create_interface (0, $2, $3); }
1265 | modifiers INTERFACE_TK identifier extends_interfaces
1266 { create_interface ($1, $3, $4); }
1269 | INTERFACE_TK identifier error
1270 { yyerror ("'{' expected"); RECOVER; }
1271 | modifiers INTERFACE_TK identifier error
1272 { yyerror ("'{' expected"); RECOVER; }
1276 EXTENDS_TK interface_type
1278 ctxp->interface_number = 1;
1279 $$ = build_tree_list ($2, NULL_TREE);
1281 | extends_interfaces C_TK interface_type
1283 ctxp->interface_number++;
1284 $$ = chainon ($1, build_tree_list ($3, NULL_TREE));
1287 {yyerror ("Invalid interface type"); RECOVER;}
1288 | extends_interfaces C_TK error
1289 {yyerror ("Missing term"); RECOVER;}
1295 | OCB_TK interface_member_declarations CCB_TK
1299 interface_member_declarations:
1300 interface_member_declaration
1301 | interface_member_declarations interface_member_declaration
1304 interface_member_declaration:
1305 constant_declaration
1306 | abstract_method_declaration
1307 | class_declaration /* Added, JDK1.1 inner classes */
1308 { end_class_declaration (1); }
1309 | interface_declaration /* Added, JDK1.1 inner interfaces */
1310 { end_class_declaration (1); }
1313 constant_declaration:
1317 abstract_method_declaration:
1320 check_abstract_method_header ($1);
1321 current_function_decl = NULL_TREE; /* FIXME ? */
1323 | method_header error
1324 {yyerror ("';' expected"); RECOVER;}
1327 /* 19.10 Productions from 10: Arrays */
1330 { $$ = build_new_array_init ($1.location, NULL_TREE); }
1331 | OCB_TK C_TK CCB_TK
1332 { $$ = build_new_array_init ($1.location, NULL_TREE); }
1333 | OCB_TK variable_initializers CCB_TK
1334 { $$ = build_new_array_init ($1.location, $2); }
1335 | OCB_TK variable_initializers C_TK CCB_TK
1336 { $$ = build_new_array_init ($1.location, $2); }
1339 variable_initializers:
1340 variable_initializer
1342 $$ = tree_cons (maybe_build_array_element_wfl ($1),
1345 | variable_initializers C_TK variable_initializer
1347 $$ = tree_cons (maybe_build_array_element_wfl ($3), $3, $1);
1349 | variable_initializers C_TK error
1350 {yyerror ("Missing term"); RECOVER;}
1353 /* 19.11 Production from 14: Blocks and Statements */
1355 block_begin block_end
1357 | block_begin block_statements block_end
1369 maybe_absorb_scoping_blocks ();
1370 /* Store the location of the `}' when doing xrefs */
1371 if (current_function_decl && flag_emit_xref)
1372 DECL_END_SOURCE_LINE (current_function_decl) =
1373 EXPR_WFL_ADD_COL ($1.location, 1);
1375 if (!BLOCK_SUBBLOCKS ($$))
1376 BLOCK_SUBBLOCKS ($$) = build_java_empty_stmt ();
1382 | block_statements block_statement
1386 local_variable_declaration_statement
1388 { java_method_add_stmt (current_function_decl, $1); }
1389 | class_declaration /* Added, JDK1.1 local classes */
1391 LOCAL_CLASS_P (TREE_TYPE (GET_CPC ())) = 1;
1392 end_class_declaration (1);
1396 local_variable_declaration_statement:
1397 local_variable_declaration SC_TK /* Can't catch missing ';' here */
1400 local_variable_declaration:
1401 type variable_declarators
1402 { declare_local_variables (0, $1, $2); }
1403 | final type variable_declarators /* Added, JDK1.1 final locals */
1404 { declare_local_variables ($1, $2, $3); }
1408 statement_without_trailing_substatement
1411 | if_then_else_statement
1414 { $$ = exit_block (); }
1418 statement_without_trailing_substatement
1419 | labeled_statement_nsi
1420 | if_then_else_statement_nsi
1421 | while_statement_nsi
1423 { $$ = exit_block (); }
1426 statement_without_trailing_substatement:
1429 | expression_statement
1433 | continue_statement
1435 | synchronized_statement
1444 if (flag_extraneous_semicolon
1445 && ! current_static_block
1446 && (! current_function_decl ||
1447 /* Verify we're not in a inner class declaration */
1448 (GET_CPC () != TYPE_NAME
1449 (DECL_CONTEXT (current_function_decl)))))
1452 EXPR_WFL_SET_LINECOL (wfl_operator, input_line, -1);
1453 parse_warning_context (wfl_operator, "An empty declaration is a deprecated feature that should not be used");
1455 $$ = build_java_empty_stmt ();
1460 identifier REL_CL_TK
1462 $$ = build_labeled_block (EXPR_WFL_LINECOL ($1),
1463 EXPR_WFL_NODE ($1));
1465 push_labeled_block ($$);
1466 PUSH_LABELED_BLOCK ($$);
1471 label_decl statement
1472 { $$ = finish_labeled_statement ($1, $2); }
1474 {yyerror ("':' expected"); RECOVER;}
1477 labeled_statement_nsi:
1478 label_decl statement_nsi
1479 { $$ = finish_labeled_statement ($1, $2); }
1482 /* We concentrate here a bunch of error handling rules that we couldn't write
1483 earlier, because expression_statement catches a missing ';'. */
1484 expression_statement:
1485 statement_expression SC_TK
1487 /* We have a statement. Generate a WFL around it so
1489 $$ = build_expr_wfl ($1, input_filename, input_line, 0);
1490 /* We know we have a statement, so set the debug
1491 info to be eventually generate here. */
1492 $$ = JAVA_MAYBE_GENERATE_DEBUG_INFO ($$);
1496 YYNOT_TWICE yyerror ("Invalid expression statement");
1497 DRECOVER (expr_stmt);
1501 YYNOT_TWICE yyerror ("Invalid expression statement");
1502 DRECOVER (expr_stmt);
1506 YYNOT_TWICE yyerror ("Invalid expression statement");
1507 DRECOVER (expr_stmt);
1509 | this_or_super OP_TK error
1510 {yyerror ("')' expected"); RECOVER;}
1511 | this_or_super OP_TK CP_TK error
1513 parse_ctor_invocation_error ();
1516 | this_or_super OP_TK argument_list error
1517 {yyerror ("')' expected"); RECOVER;}
1518 | this_or_super OP_TK argument_list CP_TK error
1520 parse_ctor_invocation_error ();
1523 | name DOT_TK SUPER_TK error
1524 {yyerror ("'(' expected"); RECOVER;}
1525 | name DOT_TK SUPER_TK OP_TK error
1526 {yyerror ("')' expected"); RECOVER;}
1527 | name DOT_TK SUPER_TK OP_TK argument_list error
1528 {yyerror ("')' expected"); RECOVER;}
1529 | name DOT_TK SUPER_TK OP_TK argument_list CP_TK error
1530 {yyerror ("';' expected"); RECOVER;}
1531 | name DOT_TK SUPER_TK OP_TK CP_TK error
1532 {yyerror ("';' expected"); RECOVER;}
1535 statement_expression:
1537 | pre_increment_expression
1538 | pre_decrement_expression
1539 | post_increment_expression
1540 | post_decrement_expression
1542 | class_instance_creation_expression
1546 IF_TK OP_TK expression CP_TK statement
1548 $$ = build_if_else_statement ($2.location, $3,
1552 {yyerror ("'(' expected"); RECOVER;}
1554 {yyerror ("Missing term"); RECOVER;}
1555 | IF_TK OP_TK expression error
1556 {yyerror ("')' expected"); RECOVER;}
1559 if_then_else_statement:
1560 IF_TK OP_TK expression CP_TK statement_nsi ELSE_TK statement
1561 { $$ = build_if_else_statement ($2.location, $3, $5, $7); }
1564 if_then_else_statement_nsi:
1565 IF_TK OP_TK expression CP_TK statement_nsi ELSE_TK statement_nsi
1566 { $$ = build_if_else_statement ($2.location, $3, $5, $7); }
1576 /* Make into "proper list" of COMPOUND_EXPRs.
1577 I.e. make the last statement also have its own
1579 maybe_absorb_scoping_blocks ();
1580 TREE_OPERAND ($1, 1) = exit_block ();
1581 $$ = build_debugable_stmt (EXPR_WFL_LINECOL ($1), $1);
1586 SWITCH_TK OP_TK expression CP_TK
1588 $$ = build (SWITCH_EXPR, NULL_TREE, $3, NULL_TREE, NULL_TREE);
1589 EXPR_WFL_LINECOL ($$) = $2.location;
1592 {yyerror ("'(' expected"); RECOVER;}
1593 | SWITCH_TK OP_TK error
1594 {yyerror ("Missing term or ')'"); DRECOVER(switch_statement);}
1595 | SWITCH_TK OP_TK expression CP_TK error
1596 {yyerror ("'{' expected"); RECOVER;}
1599 /* Default assignment is there to avoid type node on switch_block
1605 | OCB_TK switch_labels CCB_TK
1607 | OCB_TK switch_block_statement_groups CCB_TK
1609 | OCB_TK switch_block_statement_groups switch_labels CCB_TK
1613 switch_block_statement_groups:
1614 switch_block_statement_group
1615 | switch_block_statement_groups switch_block_statement_group
1618 switch_block_statement_group:
1619 switch_labels block_statements
1624 | switch_labels switch_label
1628 CASE_TK constant_expression REL_CL_TK
1630 tree lab = build1 (CASE_EXPR, NULL_TREE, $2);
1631 EXPR_WFL_LINECOL (lab) = $1.location;
1632 java_method_add_stmt (current_function_decl, lab);
1634 | DEFAULT_TK REL_CL_TK
1636 tree lab = make_node (DEFAULT_EXPR);
1637 EXPR_WFL_LINECOL (lab) = $1.location;
1638 java_method_add_stmt (current_function_decl, lab);
1641 {yyerror ("Missing or invalid constant expression"); RECOVER;}
1642 | CASE_TK constant_expression error
1643 {yyerror ("':' expected"); RECOVER;}
1645 {yyerror ("':' expected"); RECOVER;}
1649 WHILE_TK OP_TK expression CP_TK
1651 tree body = build_loop_body ($2.location, $3, 0);
1652 $$ = build_new_loop (body);
1657 while_expression statement
1658 { $$ = finish_loop_body (0, NULL_TREE, $2, 0); }
1660 {YYERROR_NOW; yyerror ("'(' expected"); RECOVER;}
1661 | WHILE_TK OP_TK error
1662 {yyerror ("Missing term and ')' expected"); RECOVER;}
1663 | WHILE_TK OP_TK expression error
1664 {yyerror ("')' expected"); RECOVER;}
1667 while_statement_nsi:
1668 while_expression statement_nsi
1669 { $$ = finish_loop_body (0, NULL_TREE, $2, 0); }
1675 tree body = build_loop_body (0, NULL_TREE, 1);
1676 $$ = build_new_loop (body);
1678 /* Need error handing here. FIXME */
1682 do_statement_begin statement WHILE_TK OP_TK expression CP_TK SC_TK
1683 { $$ = finish_loop_body ($4.location, $5, $2, 1); }
1687 for_begin SC_TK expression SC_TK for_update CP_TK statement
1689 if (TREE_CODE_CLASS (TREE_CODE ($3)) == 'c')
1690 $3 = build_wfl_node ($3);
1691 $$ = finish_for_loop (EXPR_WFL_LINECOL ($3), $3, $5, $7);
1693 | for_begin SC_TK SC_TK for_update CP_TK statement
1695 $$ = finish_for_loop (0, NULL_TREE, $4, $6);
1696 /* We have not condition, so we get rid of the EXIT_EXPR */
1697 LOOP_EXPR_BODY_CONDITION_EXPR (LOOP_EXPR_BODY ($$), 0) =
1698 build_java_empty_stmt ();
1700 | for_begin SC_TK error
1701 {yyerror ("Invalid control expression"); RECOVER;}
1702 | for_begin SC_TK expression SC_TK error
1703 {yyerror ("Invalid update expression"); RECOVER;}
1704 | for_begin SC_TK SC_TK error
1705 {yyerror ("Invalid update expression"); RECOVER;}
1709 for_begin SC_TK expression SC_TK for_update CP_TK statement_nsi
1710 { $$ = finish_for_loop (EXPR_WFL_LINECOL ($3), $3, $5, $7);}
1711 | for_begin SC_TK SC_TK for_update CP_TK statement_nsi
1713 $$ = finish_for_loop (0, NULL_TREE, $4, $6);
1714 /* We have not condition, so we get rid of the EXIT_EXPR */
1715 LOOP_EXPR_BODY_CONDITION_EXPR (LOOP_EXPR_BODY ($$), 0) =
1716 build_java_empty_stmt ();
1723 /* This scope defined for local variable that may be
1724 defined within the scope of the for loop */
1728 {yyerror ("'(' expected"); DRECOVER(for_1);}
1729 | FOR_TK OP_TK error
1730 {yyerror ("Invalid init statement"); RECOVER;}
1736 /* We now declare the loop body. The loop is
1737 declared as a for loop. */
1738 tree body = build_loop_body (0, NULL_TREE, 0);
1739 $$ = build_new_loop (body);
1740 FOR_LOOP_P ($$) = 1;
1741 /* The loop is added to the current block the for
1742 statement is defined within */
1743 java_method_add_stmt (current_function_decl, $$);
1746 for_init: /* Can be empty */
1747 { $$ = build_java_empty_stmt (); }
1748 | statement_expression_list
1750 /* Init statement recorded within the previously
1751 defined block scope */
1752 $$ = java_method_add_stmt (current_function_decl, $1);
1754 | local_variable_declaration
1756 /* Local variable are recorded within the previously
1757 defined block scope */
1760 | statement_expression_list error
1761 {yyerror ("';' expected"); DRECOVER(for_init_1);}
1764 for_update: /* Can be empty */
1765 {$$ = build_java_empty_stmt ();}
1766 | statement_expression_list
1767 { $$ = build_debugable_stmt (BUILD_LOCATION (), $1); }
1770 statement_expression_list:
1771 statement_expression
1772 { $$ = add_stmt_to_compound (NULL_TREE, NULL_TREE, $1); }
1773 | statement_expression_list C_TK statement_expression
1774 { $$ = add_stmt_to_compound ($1, NULL_TREE, $3); }
1775 | statement_expression_list C_TK error
1776 {yyerror ("Missing term"); RECOVER;}
1781 { $$ = build_bc_statement ($1.location, 1, NULL_TREE); }
1782 | BREAK_TK identifier SC_TK
1783 { $$ = build_bc_statement ($1.location, 1, $2); }
1785 {yyerror ("Missing term"); RECOVER;}
1786 | BREAK_TK identifier error
1787 {yyerror ("';' expected"); RECOVER;}
1792 { $$ = build_bc_statement ($1.location, 0, NULL_TREE); }
1793 | CONTINUE_TK identifier SC_TK
1794 { $$ = build_bc_statement ($1.location, 0, $2); }
1796 {yyerror ("Missing term"); RECOVER;}
1797 | CONTINUE_TK identifier error
1798 {yyerror ("';' expected"); RECOVER;}
1803 { $$ = build_return ($1.location, NULL_TREE); }
1804 | RETURN_TK expression SC_TK
1805 { $$ = build_return ($1.location, $2); }
1807 {yyerror ("Missing term"); RECOVER;}
1808 | RETURN_TK expression error
1809 {yyerror ("';' expected"); RECOVER;}
1813 THROW_TK expression SC_TK
1815 $$ = build1 (THROW_EXPR, NULL_TREE, $2);
1816 EXPR_WFL_LINECOL ($$) = $1.location;
1819 {yyerror ("Missing term"); RECOVER;}
1820 | THROW_TK expression error
1821 {yyerror ("';' expected"); RECOVER;}
1825 ASSERT_TK expression REL_CL_TK expression SC_TK
1827 $$ = build_assertion ($1.location, $2, $4);
1829 | ASSERT_TK expression SC_TK
1831 $$ = build_assertion ($1.location, $2, NULL_TREE);
1834 {yyerror ("Missing term"); RECOVER;}
1835 | ASSERT_TK expression error
1836 {yyerror ("';' expected"); RECOVER;}
1839 synchronized_statement:
1840 synchronized OP_TK expression CP_TK block
1842 $$ = build (SYNCHRONIZED_EXPR, NULL_TREE, $3, $5);
1843 EXPR_WFL_LINECOL ($$) =
1844 EXPR_WFL_LINECOL (MODIFIER_WFL (SYNCHRONIZED_TK));
1846 | synchronized OP_TK expression CP_TK error
1847 {yyerror ("'{' expected"); RECOVER;}
1848 | synchronized error
1849 {yyerror ("'(' expected"); RECOVER;}
1850 | synchronized OP_TK error CP_TK
1851 {yyerror ("Missing term"); RECOVER;}
1852 | synchronized OP_TK error
1853 {yyerror ("Missing term"); RECOVER;}
1860 "Illegal modifier `%s'. Only `synchronized' was expected here",
1861 $1, ACC_SYNCHRONIZED);
1862 if ($1 != ACC_SYNCHRONIZED)
1863 MODIFIER_WFL (SYNCHRONIZED_TK) =
1864 build_wfl_node (NULL_TREE);
1869 TRY_TK block catches
1870 { $$ = build_try_statement ($1.location, $2, $3); }
1871 | TRY_TK block finally
1872 { $$ = build_try_finally_statement ($1.location, $2, $3); }
1873 | TRY_TK block catches finally
1874 { $$ = build_try_finally_statement
1875 ($1.location, build_try_statement ($1.location,
1879 {yyerror ("'{' expected"); DRECOVER (try_statement);}
1884 | catches catch_clause
1886 TREE_CHAIN ($2) = $1;
1892 catch_clause_parameter block
1894 java_method_add_stmt (current_function_decl, $2);
1900 catch_clause_parameter:
1901 CATCH_TK OP_TK formal_parameter CP_TK
1903 /* We add a block to define a scope for
1904 formal_parameter (CCBP). The formal parameter is
1905 declared initialized by the appropriate function
1911 ccpb = enter_block ();
1912 init = build_assignment
1913 (ASSIGN_TK, $2.location, TREE_PURPOSE ($3),
1914 build (JAVA_EXC_OBJ_EXPR, ptr_type_node));
1915 declare_local_variables (0, TREE_VALUE ($3),
1917 (TREE_PURPOSE ($3), init));
1918 $$ = build1 (JAVA_CATCH_EXPR, NULL_TREE, ccpb);
1919 EXPR_WFL_LINECOL ($$) = $1.location;
1923 $$ = error_mark_node;
1927 {yyerror ("'(' expected"); RECOVER; $$ = NULL_TREE;}
1928 | CATCH_TK OP_TK error
1930 yyerror ("Missing term or ')' expected");
1931 RECOVER; $$ = NULL_TREE;
1933 | CATCH_TK OP_TK error CP_TK /* That's for () */
1934 {yyerror ("Missing term"); RECOVER; $$ = NULL_TREE;}
1941 {yyerror ("'{' expected"); RECOVER; }
1944 /* 19.12 Production from 15: Expressions */
1946 primary_no_new_array
1947 | array_creation_expression
1950 primary_no_new_array:
1953 { $$ = build_this ($1.location); }
1954 | OP_TK expression CP_TK
1956 | class_instance_creation_expression
1961 /* Added, JDK1.1 inner classes. Documentation is wrong
1962 refering to a 'ClassName' (class_name) rule that doesn't
1963 exist. Used name: instead. */
1964 | name DOT_TK THIS_TK
1966 tree wfl = build_wfl_node (this_identifier_node);
1967 $$ = make_qualified_primary ($1, wfl, EXPR_WFL_LINECOL ($1));
1969 | OP_TK expression error
1970 {yyerror ("')' expected"); RECOVER;}
1972 {yyerror ("'class' or 'this' expected" ); RECOVER;}
1973 | primitive_type DOT_TK error
1974 {yyerror ("'class' expected" ); RECOVER;}
1975 | VOID_TK DOT_TK error
1976 {yyerror ("'class' expected" ); RECOVER;}
1980 name DOT_TK CLASS_TK
1981 { $$ = build_incomplete_class_ref ($2.location, $1); }
1982 | array_type DOT_TK CLASS_TK
1983 { $$ = build_incomplete_class_ref ($2.location, $1); }
1984 | primitive_type DOT_TK CLASS_TK
1985 { $$ = build_incomplete_class_ref ($2.location, $1); }
1986 | VOID_TK DOT_TK CLASS_TK
1988 $$ = build_incomplete_class_ref ($2.location,
1993 class_instance_creation_expression:
1994 NEW_TK class_type OP_TK argument_list CP_TK
1995 { $$ = build_new_invocation ($2, $4); }
1996 | NEW_TK class_type OP_TK CP_TK
1997 { $$ = build_new_invocation ($2, NULL_TREE); }
1998 | anonymous_class_creation
1999 /* Added, JDK1.1 inner classes, modified to use name or
2000 primary instead of primary solely which couldn't work in
2002 | something_dot_new identifier OP_TK CP_TK
2004 tree ctor = build_new_invocation ($2, NULL_TREE);
2005 $$ = make_qualified_primary ($1, ctor,
2006 EXPR_WFL_LINECOL ($1));
2008 | something_dot_new identifier OP_TK CP_TK class_body
2009 | something_dot_new identifier OP_TK argument_list CP_TK
2011 tree ctor = build_new_invocation ($2, $4);
2012 $$ = make_qualified_primary ($1, ctor,
2013 EXPR_WFL_LINECOL ($1));
2015 | something_dot_new identifier OP_TK argument_list CP_TK class_body
2016 | NEW_TK error SC_TK
2017 {yyerror ("'(' expected"); DRECOVER(new_1);}
2018 | NEW_TK class_type error
2019 {yyerror ("'(' expected"); RECOVER;}
2020 | NEW_TK class_type OP_TK error
2021 {yyerror ("')' or term expected"); RECOVER;}
2022 | NEW_TK class_type OP_TK argument_list error
2023 {yyerror ("')' expected"); RECOVER;}
2024 | something_dot_new error
2025 {YYERROR_NOW; yyerror ("Identifier expected"); RECOVER;}
2026 | something_dot_new identifier error
2027 {yyerror ("'(' expected"); RECOVER;}
2030 /* Created after JDK1.1 rules originally added to
2031 class_instance_creation_expression, but modified to use
2032 'class_type' instead of 'TypeName' (type_name) which is mentioned
2033 in the documentation but doesn't exist. */
2035 anonymous_class_creation:
2036 NEW_TK class_type OP_TK argument_list CP_TK
2037 { create_anonymous_class ($2); }
2040 tree id = build_wfl_node (DECL_NAME (GET_CPC ()));
2041 EXPR_WFL_LINECOL (id) = EXPR_WFL_LINECOL ($2);
2043 end_class_declaration (1);
2045 /* Now we can craft the new expression */
2046 $$ = build_new_invocation (id, $4);
2048 /* Note that we can't possibly be here if
2049 `class_type' is an interface (in which case the
2050 anonymous class extends Object and implements
2051 `class_type', hence its constructor can't have
2054 /* Otherwise, the innerclass must feature a
2055 constructor matching `argument_list'. Anonymous
2056 classes are a bit special: it's impossible to
2057 define constructor for them, hence constructors
2058 must be generated following the hints provided by
2059 the `new' expression. Whether a super constructor
2060 of that nature exists or not is to be verified
2061 later on in verify_constructor_super.
2063 It's during the expansion of a `new' statement
2064 refering to an anonymous class that a ctor will
2065 be generated for the anonymous class, with the
2069 | NEW_TK class_type OP_TK CP_TK
2070 { create_anonymous_class ($2); }
2073 tree id = build_wfl_node (DECL_NAME (GET_CPC ()));
2074 EXPR_WFL_LINECOL (id) = EXPR_WFL_LINECOL ($2);
2076 end_class_declaration (1);
2078 /* Now we can craft the new expression. The
2079 statement doesn't need to be remember so that a
2080 constructor can be generated, since its signature
2081 is already known. */
2082 $$ = build_new_invocation (id, NULL_TREE);
2086 something_dot_new: /* Added, not part of the specs. */
2089 | primary DOT_TK NEW_TK
2096 $$ = tree_cons (NULL_TREE, $1, NULL_TREE);
2097 ctxp->formal_parameter_number = 1;
2099 | argument_list C_TK expression
2101 ctxp->formal_parameter_number += 1;
2102 $$ = tree_cons (NULL_TREE, $3, $1);
2104 | argument_list C_TK error
2105 {yyerror ("Missing term"); RECOVER;}
2108 array_creation_expression:
2109 NEW_TK primitive_type dim_exprs
2110 { $$ = build_newarray_node ($2, $3, 0); }
2111 | NEW_TK class_or_interface_type dim_exprs
2112 { $$ = build_newarray_node ($2, $3, 0); }
2113 | NEW_TK primitive_type dim_exprs dims
2114 { $$ = build_newarray_node ($2, $3, pop_current_osb (ctxp));}
2115 | NEW_TK class_or_interface_type dim_exprs dims
2116 { $$ = build_newarray_node ($2, $3, pop_current_osb (ctxp));}
2117 /* Added, JDK1.1 anonymous array. Initial documentation rule
2119 | NEW_TK class_or_interface_type dims array_initializer
2122 int osb = pop_current_osb (ctxp);
2124 obstack_grow (&temporary_obstack, "[]", 2);
2125 obstack_1grow (&temporary_obstack, '\0');
2126 sig = obstack_finish (&temporary_obstack);
2127 $$ = build (NEW_ANONYMOUS_ARRAY_EXPR, NULL_TREE,
2128 $2, get_identifier (sig), $4);
2130 | NEW_TK primitive_type dims array_initializer
2132 int osb = pop_current_osb (ctxp);
2135 type = build_java_array_type (type, -1);
2136 $$ = build (NEW_ANONYMOUS_ARRAY_EXPR, NULL_TREE,
2137 build_pointer_type (type), NULL_TREE, $4);
2139 | NEW_TK error CSB_TK
2140 {yyerror ("'[' expected"); DRECOVER ("]");}
2141 | NEW_TK error OSB_TK
2142 {yyerror ("']' expected"); RECOVER;}
2147 { $$ = build_tree_list (NULL_TREE, $1); }
2148 | dim_exprs dim_expr
2149 { $$ = tree_cons (NULL_TREE, $2, $$); }
2153 OSB_TK expression CSB_TK
2155 if (JNUMERIC_TYPE_P (TREE_TYPE ($2)))
2157 $2 = build_wfl_node ($2);
2158 TREE_TYPE ($2) = NULL_TREE;
2160 EXPR_WFL_LINECOL ($2) = $1.location;
2163 | OSB_TK expression error
2164 {yyerror ("']' expected"); RECOVER;}
2167 yyerror ("Missing term");
2168 yyerror ("']' expected");
2177 /* If not initialized, allocate memory for the osb
2179 if (!ctxp->osb_limit)
2181 allocate = ctxp->osb_limit = 32;
2182 ctxp->osb_depth = -1;
2184 /* If capacity overflown, reallocate a bigger chunk */
2185 else if (ctxp->osb_depth+1 == ctxp->osb_limit)
2186 allocate = ctxp->osb_limit << 1;
2190 allocate *= sizeof (int);
2191 if (ctxp->osb_number)
2192 ctxp->osb_number = xrealloc (ctxp->osb_number,
2195 ctxp->osb_number = xmalloc (allocate);
2198 CURRENT_OSB (ctxp) = 1;
2200 | dims OSB_TK CSB_TK
2201 { CURRENT_OSB (ctxp)++; }
2203 { yyerror ("']' expected"); RECOVER;}
2207 primary DOT_TK identifier
2208 { $$ = make_qualified_primary ($1, $3, $2.location); }
2209 /* FIXME - REWRITE TO:
2210 { $$ = build_binop (COMPONENT_REF, $2.location, $1, $3); } */
2211 | SUPER_TK DOT_TK identifier
2213 tree super_wfl = build_wfl_node (super_identifier_node);
2214 EXPR_WFL_LINECOL (super_wfl) = $1.location;
2215 $$ = make_qualified_name (super_wfl, $3, $2.location);
2218 {yyerror ("Field expected"); DRECOVER (super_field_acces);}
2223 { $$ = build_method_invocation ($1, NULL_TREE); }
2224 | name OP_TK argument_list CP_TK
2225 { $$ = build_method_invocation ($1, $3); }
2226 | primary DOT_TK identifier OP_TK CP_TK
2228 if (TREE_CODE ($1) == THIS_EXPR)
2229 $$ = build_this_super_qualified_invocation
2230 (1, $3, NULL_TREE, 0, $2.location);
2233 tree invok = build_method_invocation ($3, NULL_TREE);
2234 $$ = make_qualified_primary ($1, invok, $2.location);
2237 | primary DOT_TK identifier OP_TK argument_list CP_TK
2239 if (TREE_CODE ($1) == THIS_EXPR)
2240 $$ = build_this_super_qualified_invocation
2241 (1, $3, $5, 0, $2.location);
2244 tree invok = build_method_invocation ($3, $5);
2245 $$ = make_qualified_primary ($1, invok, $2.location);
2248 | SUPER_TK DOT_TK identifier OP_TK CP_TK
2250 $$ = build_this_super_qualified_invocation
2251 (0, $3, NULL_TREE, $1.location, $2.location);
2253 | SUPER_TK DOT_TK identifier OP_TK argument_list CP_TK
2255 $$ = build_this_super_qualified_invocation
2256 (0, $3, $5, $1.location, $2.location);
2258 /* Screws up thing. I let it here until I'm convinced it can
2260 | primary DOT_TK error
2261 {yyerror ("'(' expected"); DRECOVER(bad);} */
2262 | SUPER_TK DOT_TK error CP_TK
2263 { yyerror ("'(' expected"); DRECOVER (method_invocation); }
2264 | SUPER_TK DOT_TK error DOT_TK
2265 { yyerror ("'(' expected"); DRECOVER (method_invocation); }
2269 name OSB_TK expression CSB_TK
2270 { $$ = build_array_ref ($2.location, $1, $3); }
2271 | primary_no_new_array OSB_TK expression CSB_TK
2272 { $$ = build_array_ref ($2.location, $1, $3); }
2275 yyerror ("Missing term and ']' expected");
2276 DRECOVER(array_access);
2278 | name OSB_TK expression error
2280 yyerror ("']' expected");
2281 DRECOVER(array_access);
2283 | primary_no_new_array OSB_TK error
2285 yyerror ("Missing term and ']' expected");
2286 DRECOVER(array_access);
2288 | primary_no_new_array OSB_TK expression error
2290 yyerror ("']' expected");
2291 DRECOVER(array_access);
2298 | post_increment_expression
2299 | post_decrement_expression
2302 post_increment_expression:
2303 postfix_expression INCR_TK
2304 { $$ = build_incdec ($2.token, $2.location, $1, 1); }
2307 post_decrement_expression:
2308 postfix_expression DECR_TK
2309 { $$ = build_incdec ($2.token, $2.location, $1, 1); }
2312 trap_overflow_corner_case:
2313 pre_increment_expression
2314 | pre_decrement_expression
2315 | PLUS_TK unary_expression
2316 {$$ = build_unaryop ($1.token, $1.location, $2); }
2317 | unary_expression_not_plus_minus
2319 {yyerror ("Missing term"); RECOVER}
2323 trap_overflow_corner_case
2325 error_if_numeric_overflow ($1);
2328 | MINUS_TK trap_overflow_corner_case
2329 {$$ = build_unaryop ($1.token, $1.location, $2); }
2331 {yyerror ("Missing term"); RECOVER}
2334 pre_increment_expression:
2335 INCR_TK unary_expression
2336 {$$ = build_incdec ($1.token, $1.location, $2, 0); }
2338 {yyerror ("Missing term"); RECOVER}
2341 pre_decrement_expression:
2342 DECR_TK unary_expression
2343 {$$ = build_incdec ($1.token, $1.location, $2, 0); }
2345 {yyerror ("Missing term"); RECOVER}
2348 unary_expression_not_plus_minus:
2350 | NOT_TK unary_expression
2351 {$$ = build_unaryop ($1.token, $1.location, $2); }
2352 | NEG_TK unary_expression
2353 {$$ = build_unaryop ($1.token, $1.location, $2); }
2356 {yyerror ("Missing term"); RECOVER}
2358 {yyerror ("Missing term"); RECOVER}
2361 cast_expression: /* Error handling here is potentially weak */
2362 OP_TK primitive_type dims CP_TK unary_expression
2365 int osb = pop_current_osb (ctxp);
2367 type = build_java_array_type (type, -1);
2368 $$ = build_cast ($1.location, type, $5);
2370 | OP_TK primitive_type CP_TK unary_expression
2371 { $$ = build_cast ($1.location, $2, $4); }
2372 | OP_TK expression CP_TK unary_expression_not_plus_minus
2373 { $$ = build_cast ($1.location, $2, $4); }
2374 | OP_TK name dims CP_TK unary_expression_not_plus_minus
2377 int osb = pop_current_osb (ctxp);
2378 obstack_grow (&temporary_obstack,
2379 IDENTIFIER_POINTER (EXPR_WFL_NODE ($2)),
2380 IDENTIFIER_LENGTH (EXPR_WFL_NODE ($2)));
2382 obstack_grow (&temporary_obstack, "[]", 2);
2383 obstack_1grow (&temporary_obstack, '\0');
2384 ptr = obstack_finish (&temporary_obstack);
2385 EXPR_WFL_NODE ($2) = get_identifier (ptr);
2386 $$ = build_cast ($1.location, $2, $5);
2388 | OP_TK primitive_type OSB_TK error
2389 {yyerror ("']' expected, invalid type expression");}
2392 YYNOT_TWICE yyerror ("Invalid type expression"); RECOVER;
2395 | OP_TK primitive_type dims CP_TK error
2396 {yyerror ("Missing term"); RECOVER;}
2397 | OP_TK primitive_type CP_TK error
2398 {yyerror ("Missing term"); RECOVER;}
2399 | OP_TK name dims CP_TK error
2400 {yyerror ("Missing term"); RECOVER;}
2403 multiplicative_expression:
2405 | multiplicative_expression MULT_TK unary_expression
2407 $$ = build_binop (BINOP_LOOKUP ($2.token),
2408 $2.location, $1, $3);
2410 | multiplicative_expression DIV_TK unary_expression
2412 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2415 | multiplicative_expression REM_TK unary_expression
2417 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2420 | multiplicative_expression MULT_TK error
2421 {yyerror ("Missing term"); RECOVER;}
2422 | multiplicative_expression DIV_TK error
2423 {yyerror ("Missing term"); RECOVER;}
2424 | multiplicative_expression REM_TK error
2425 {yyerror ("Missing term"); RECOVER;}
2428 additive_expression:
2429 multiplicative_expression
2430 | additive_expression PLUS_TK multiplicative_expression
2432 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2435 | additive_expression MINUS_TK multiplicative_expression
2437 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2440 | additive_expression PLUS_TK error
2441 {yyerror ("Missing term"); RECOVER;}
2442 | additive_expression MINUS_TK error
2443 {yyerror ("Missing term"); RECOVER;}
2448 | shift_expression LS_TK additive_expression
2450 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2453 | shift_expression SRS_TK additive_expression
2455 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2458 | shift_expression ZRS_TK additive_expression
2460 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2463 | shift_expression LS_TK error
2464 {yyerror ("Missing term"); RECOVER;}
2465 | shift_expression SRS_TK error
2466 {yyerror ("Missing term"); RECOVER;}
2467 | shift_expression ZRS_TK error
2468 {yyerror ("Missing term"); RECOVER;}
2471 relational_expression:
2473 | relational_expression LT_TK shift_expression
2475 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2478 | relational_expression GT_TK shift_expression
2480 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2483 | relational_expression LTE_TK shift_expression
2485 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2488 | relational_expression GTE_TK shift_expression
2490 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2493 | relational_expression INSTANCEOF_TK reference_type
2494 { $$ = build_binop (INSTANCEOF_EXPR, $2.location, $1, $3); }
2495 | relational_expression LT_TK error
2496 {yyerror ("Missing term"); RECOVER;}
2497 | relational_expression GT_TK error
2498 {yyerror ("Missing term"); RECOVER;}
2499 | relational_expression LTE_TK error
2500 {yyerror ("Missing term"); RECOVER;}
2501 | relational_expression GTE_TK error
2502 {yyerror ("Missing term"); RECOVER;}
2503 | relational_expression INSTANCEOF_TK error
2504 {yyerror ("Invalid reference type"); RECOVER;}
2507 equality_expression:
2508 relational_expression
2509 | equality_expression EQ_TK relational_expression
2511 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2514 | equality_expression NEQ_TK relational_expression
2516 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2519 | equality_expression EQ_TK error
2520 {yyerror ("Missing term"); RECOVER;}
2521 | equality_expression NEQ_TK error
2522 {yyerror ("Missing term"); RECOVER;}
2527 | and_expression AND_TK equality_expression
2529 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2532 | and_expression AND_TK error
2533 {yyerror ("Missing term"); RECOVER;}
2536 exclusive_or_expression:
2538 | exclusive_or_expression XOR_TK and_expression
2540 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2543 | exclusive_or_expression XOR_TK error
2544 {yyerror ("Missing term"); RECOVER;}
2547 inclusive_or_expression:
2548 exclusive_or_expression
2549 | inclusive_or_expression OR_TK exclusive_or_expression
2551 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2554 | inclusive_or_expression OR_TK error
2555 {yyerror ("Missing term"); RECOVER;}
2558 conditional_and_expression:
2559 inclusive_or_expression
2560 | conditional_and_expression BOOL_AND_TK inclusive_or_expression
2562 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2565 | conditional_and_expression BOOL_AND_TK error
2566 {yyerror ("Missing term"); RECOVER;}
2569 conditional_or_expression:
2570 conditional_and_expression
2571 | conditional_or_expression BOOL_OR_TK conditional_and_expression
2573 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2576 | conditional_or_expression BOOL_OR_TK error
2577 {yyerror ("Missing term"); RECOVER;}
2580 conditional_expression: /* Error handling here is weak */
2581 conditional_or_expression
2582 | conditional_or_expression REL_QM_TK expression REL_CL_TK conditional_expression
2584 $$ = build (CONDITIONAL_EXPR, NULL_TREE, $1, $3, $5);
2585 EXPR_WFL_LINECOL ($$) = $2.location;
2587 | conditional_or_expression REL_QM_TK REL_CL_TK error
2590 yyerror ("Missing term");
2593 | conditional_or_expression REL_QM_TK error
2594 {yyerror ("Missing term"); DRECOVER (2);}
2595 | conditional_or_expression REL_QM_TK expression REL_CL_TK error
2596 {yyerror ("Missing term"); DRECOVER (3);}
2599 assignment_expression:
2600 conditional_expression
2605 left_hand_side assignment_operator assignment_expression
2606 { $$ = build_assignment ($2.token, $2.location, $1, $3); }
2607 | left_hand_side assignment_operator error
2609 YYNOT_TWICE yyerror ("Missing term");
2620 assignment_operator:
2626 assignment_expression
2629 constant_expression:
2635 /* Helper function to retrieve an OSB count. Should be used when the
2636 `dims:' rule is being used. */
2639 pop_current_osb (struct parser_ctxt *ctxp)
2643 if (ctxp->osb_depth < 0)
2646 to_return = CURRENT_OSB (ctxp);
2654 /* This section of the code deal with save/restoring parser contexts.
2655 Add mode documentation here. FIXME */
2657 /* Helper function. Create a new parser context. With
2658 COPY_FROM_PREVIOUS set to a nonzero value, content of the previous
2659 context is copied, otherwise, the new context is zeroed. The newly
2660 created context becomes the current one. */
2663 create_new_parser_context (int copy_from_previous)
2665 struct parser_ctxt *new;
2667 new = ggc_alloc (sizeof (struct parser_ctxt));
2668 if (copy_from_previous)
2670 memcpy (new, ctxp, sizeof (struct parser_ctxt));
2671 /* This flag, indicating the context saves global values,
2672 should only be set by java_parser_context_save_global. */
2673 new->saved_data_ctx = 0;
2676 memset (new, 0, sizeof (struct parser_ctxt));
2682 /* Create a new parser context and make it the current one. */
2685 java_push_parser_context (void)
2687 create_new_parser_context (0);
2691 java_pop_parser_context (int generate)
2694 struct parser_ctxt *toFree, *next;
2703 input_line = ctxp->lineno;
2704 current_class = ctxp->class_type;
2707 /* If the old and new lexers differ, then free the old one. */
2708 if (ctxp->lexer && next && ctxp->lexer != next->lexer)
2709 java_destroy_lexer (ctxp->lexer);
2711 /* Set the single import class file flag to 0 for the current list
2712 of imported things */
2713 for (current = ctxp->import_list; current; current = TREE_CHAIN (current))
2714 IS_A_SINGLE_IMPORT_CLASSFILE_NAME_P (TREE_VALUE (current)) = 0;
2716 /* And restore those of the previous context */
2717 if ((ctxp = next)) /* Assignment is really meant here */
2718 for (current = ctxp->import_list; current; current = TREE_CHAIN (current))
2719 IS_A_SINGLE_IMPORT_CLASSFILE_NAME_P (TREE_VALUE (current)) = 1;
2721 /* If we pushed a context to parse a class intended to be generated,
2722 we keep it so we can remember the class. What we could actually
2723 do is to just update a list of class names. */
2726 toFree->next = ctxp_for_generation;
2727 ctxp_for_generation = toFree;
2731 /* Create a parser context for the use of saving some global
2735 java_parser_context_save_global (void)
2739 java_push_parser_context ();
2740 ctxp->saved_data_ctx = 1;
2743 /* If this context already stores data, create a new one suitable
2744 for data storage. */
2745 else if (ctxp->saved_data)
2747 create_new_parser_context (1);
2748 ctxp->saved_data_ctx = 1;
2751 ctxp->lineno = input_line;
2752 ctxp->class_type = current_class;
2753 ctxp->filename = input_filename;
2754 ctxp->function_decl = current_function_decl;
2755 ctxp->saved_data = 1;
2758 /* Restore some global variables from the previous context. Make the
2759 previous context the current one. */
2762 java_parser_context_restore_global (void)
2764 input_line = ctxp->lineno;
2765 current_class = ctxp->class_type;
2766 input_filename = ctxp->filename;
2768 EXPR_WFL_FILENAME_NODE (wfl_operator) = get_identifier (input_filename);
2769 current_function_decl = ctxp->function_decl;
2770 ctxp->saved_data = 0;
2771 if (ctxp->saved_data_ctx)
2772 java_pop_parser_context (0);
2775 /* Suspend vital data for the current class/function being parsed so
2776 that an other class can be parsed. Used to let local/anonymous
2777 classes be parsed. */
2780 java_parser_context_suspend (void)
2782 /* This makes debugging through java_debug_context easier */
2783 static const char *const name = "<inner buffer context>";
2785 /* Duplicate the previous context, use it to save the globals we're
2787 create_new_parser_context (1);
2788 ctxp->function_decl = current_function_decl;
2789 ctxp->class_type = current_class;
2791 /* Then create a new context which inherits all data from the
2792 previous one. This will be the new current context */
2793 create_new_parser_context (1);
2795 /* Help debugging */
2796 ctxp->next->filename = name;
2799 /* Resume vital data for the current class/function being parsed so
2800 that an other class can be parsed. Used to let local/anonymous
2801 classes be parsed. The trick is the data storing file position
2802 informations must be restored to their current value, so parsing
2803 can resume as if no context was ever saved. */
2806 java_parser_context_resume (void)
2808 struct parser_ctxt *old = ctxp; /* This one is to be discarded */
2809 struct parser_ctxt *saver = old->next; /* This one contain saved info */
2810 struct parser_ctxt *restored = saver->next; /* This one is the old current */
2812 /* We need to inherit the list of classes to complete/generate */
2813 restored->classd_list = old->classd_list;
2814 restored->class_list = old->class_list;
2816 /* Restore the current class and function from the saver */
2817 current_class = saver->class_type;
2818 current_function_decl = saver->function_decl;
2820 /* Retrieve the restored context */
2823 /* Re-installed the data for the parsing to carry on */
2824 memcpy (&ctxp->marker_begining, &old->marker_begining,
2825 (size_t)(&ctxp->marker_end - &ctxp->marker_begining));
2828 /* Add a new anchor node to which all statement(s) initializing static
2829 and non static initialized upon declaration field(s) will be
2833 java_parser_context_push_initialized_field (void)
2837 node = build_tree_list (NULL_TREE, NULL_TREE);
2838 TREE_CHAIN (node) = CPC_STATIC_INITIALIZER_LIST (ctxp);
2839 CPC_STATIC_INITIALIZER_LIST (ctxp) = node;
2841 node = build_tree_list (NULL_TREE, NULL_TREE);
2842 TREE_CHAIN (node) = CPC_INITIALIZER_LIST (ctxp);
2843 CPC_INITIALIZER_LIST (ctxp) = node;
2845 node = build_tree_list (NULL_TREE, NULL_TREE);
2846 TREE_CHAIN (node) = CPC_INSTANCE_INITIALIZER_LIST (ctxp);
2847 CPC_INSTANCE_INITIALIZER_LIST (ctxp) = node;
2850 /* Pop the lists of initialized field. If this lists aren't empty,
2851 remember them so we can use it to create and populate the finit$
2852 or <clinit> functions. */
2855 java_parser_context_pop_initialized_field (void)
2858 tree class_type = TREE_TYPE (GET_CPC ());
2860 if (CPC_INITIALIZER_LIST (ctxp))
2862 stmts = CPC_INITIALIZER_STMT (ctxp);
2863 CPC_INITIALIZER_LIST (ctxp) = TREE_CHAIN (CPC_INITIALIZER_LIST (ctxp));
2864 if (stmts && !java_error_count)
2865 TYPE_FINIT_STMT_LIST (class_type) = reorder_static_initialized (stmts);
2868 if (CPC_STATIC_INITIALIZER_LIST (ctxp))
2870 stmts = CPC_STATIC_INITIALIZER_STMT (ctxp);
2871 CPC_STATIC_INITIALIZER_LIST (ctxp) =
2872 TREE_CHAIN (CPC_STATIC_INITIALIZER_LIST (ctxp));
2873 /* Keep initialization in order to enforce 8.5 */
2874 if (stmts && !java_error_count)
2875 TYPE_CLINIT_STMT_LIST (class_type) = nreverse (stmts);
2878 /* JDK 1.1 instance initializers */
2879 if (CPC_INSTANCE_INITIALIZER_LIST (ctxp))
2881 stmts = CPC_INSTANCE_INITIALIZER_STMT (ctxp);
2882 CPC_INSTANCE_INITIALIZER_LIST (ctxp) =
2883 TREE_CHAIN (CPC_INSTANCE_INITIALIZER_LIST (ctxp));
2884 if (stmts && !java_error_count)
2885 TYPE_II_STMT_LIST (class_type) = nreverse (stmts);
2890 reorder_static_initialized (tree list)
2892 /* We have to keep things in order. The alias initializer have to
2893 come first, then the initialized regular field, in reverse to
2894 keep them in lexical order. */
2895 tree marker, previous = NULL_TREE;
2896 for (marker = list; marker; previous = marker, marker = TREE_CHAIN (marker))
2897 if (TREE_CODE (marker) == TREE_LIST
2898 && !TREE_VALUE (marker) && !TREE_PURPOSE (marker))
2901 /* No static initialized, the list is fine as is */
2903 list = TREE_CHAIN (marker);
2905 /* No marker? reverse the whole list */
2907 list = nreverse (list);
2909 /* Otherwise, reverse what's after the marker and the new reordered
2910 sublist will replace the marker. */
2913 TREE_CHAIN (previous) = NULL_TREE;
2914 list = nreverse (list);
2915 list = chainon (TREE_CHAIN (marker), list);
2920 /* Helper functions to dump the parser context stack. */
2922 #define TAB_CONTEXT(C) \
2923 {int i; for (i = 0; i < (C); i++) fputc (' ', stderr);}
2926 java_debug_context_do (int tab)
2928 struct parser_ctxt *copy = ctxp;
2932 fprintf (stderr, "ctxt: 0x%0lX\n", (unsigned long)copy);
2934 fprintf (stderr, "filename: %s\n", copy->filename);
2936 fprintf (stderr, "lineno: %d\n", copy->lineno);
2938 fprintf (stderr, "package: %s\n",
2940 IDENTIFIER_POINTER (copy->package) : "<none>"));
2942 fprintf (stderr, "context for saving: %d\n", copy->saved_data_ctx);
2944 fprintf (stderr, "saved data: %d\n", copy->saved_data);
2950 /* Dump the stacked up parser contexts. Intended to be called from a
2954 java_debug_context (void)
2956 java_debug_context_do (0);
2961 /* Flag for the error report routine to issue the error the first time
2962 it's called (overriding the default behavior which is to drop the
2963 first invocation and honor the second one, taking advantage of a
2965 static int force_error = 0;
2967 /* Reporting an constructor invocation error. */
2969 parse_ctor_invocation_error (void)
2971 if (DECL_CONSTRUCTOR_P (current_function_decl))
2972 yyerror ("Constructor invocation must be first thing in a constructor");
2974 yyerror ("Only constructors can invoke constructors");
2977 /* Reporting JDK1.1 features not implemented. */
2980 parse_jdk1_1_error (const char *msg)
2982 sorry (": `%s' JDK1.1(TM) feature", msg);
2984 return build_java_empty_stmt ();
2987 static int do_warning = 0;
2990 yyerror (const char *msg)
2993 static int prev_lineno;
2994 static const char *prev_msg;
2997 char *remainder, *code_from_source;
2999 if (!force_error && prev_lineno == input_line)
3002 /* Save current error location but report latter, when the context is
3004 if (ctxp->java_error_flag == 0)
3006 ctxp->java_error_flag = 1;
3008 /* Do something to use the previous line if we're reaching the
3009 end of the file... */
3010 #ifdef VERBOSE_SKELETON
3011 printf ("* Error detected (%s)\n", (msg ? msg : "(null)"));
3016 /* Ignore duplicate message on the same line. BTW, this is dubious. FIXME */
3017 if (!force_error && msg == prev_msg && prev_lineno == elc.line)
3020 ctxp->java_error_flag = 0;
3022 java_warning_count++;
3026 if (elc.col == 0 && msg && msg[1] == ';')
3028 elc.col = ctxp->p_line->char_col-1;
3029 elc.line = ctxp->p_line->lineno;
3032 save_lineno = input_line;
3033 prev_lineno = input_line = elc.line;
3036 code_from_source = java_get_line_col (ctxp->filename, elc.line, elc.col);
3037 obstack_grow0 (&temporary_obstack,
3038 code_from_source, strlen (code_from_source));
3039 remainder = obstack_finish (&temporary_obstack);
3041 warning ("%s.\n%s", msg, remainder);
3043 error ("%s.\n%s", msg, remainder);
3045 /* This allow us to cheaply avoid an extra 'Invalid expression
3046 statement' error report when errors have been already reported on
3047 the same line. This occurs when we report an error but don't have
3048 a synchronization point other than ';', which
3049 expression_statement is the only one to take care of. */
3050 ctxp->prevent_ese = input_line = save_lineno;
3054 issue_warning_error_from_context (tree cl, const char *msg, va_list ap)
3056 const char *saved, *saved_input_filename;
3058 vsprintf (buffer, msg, ap);
3061 ctxp->elc.line = EXPR_WFL_LINENO (cl);
3062 ctxp->elc.col = (EXPR_WFL_COLNO (cl) == 0xfff ? -1 :
3063 (EXPR_WFL_COLNO (cl) == 0xffe ? -2 : EXPR_WFL_COLNO (cl)));
3065 /* We have a CL, that's a good reason for using it if it contains data */
3066 saved = ctxp->filename;
3067 if (TREE_CODE (cl) == EXPR_WITH_FILE_LOCATION && EXPR_WFL_FILENAME_NODE (cl))
3068 ctxp->filename = EXPR_WFL_FILENAME (cl);
3069 saved_input_filename = input_filename;
3070 input_filename = ctxp->filename;
3072 java_error (buffer);
3073 ctxp->filename = saved;
3074 input_filename = saved_input_filename;
3078 /* Issue an error message at a current source line CL */
3081 parse_error_context (tree cl, const char *msg, ...)
3085 issue_warning_error_from_context (cl, msg, ap);
3089 /* Issue a warning at a current source line CL */
3092 parse_warning_context (tree cl, const char *msg, ...)
3097 force_error = do_warning = 1;
3098 issue_warning_error_from_context (cl, msg, ap);
3099 do_warning = force_error = 0;
3104 find_expr_with_wfl (tree node)
3111 switch (TREE_CODE (node))
3114 node = BLOCK_EXPR_BODY (node);
3118 to_return = find_expr_with_wfl (TREE_OPERAND (node, 0));
3121 node = TREE_OPERAND (node, 1);
3125 node = TREE_OPERAND (node, 0);
3128 case LABELED_BLOCK_EXPR:
3129 node = TREE_OPERAND (node, 1);
3133 code = TREE_CODE_CLASS (TREE_CODE (node));
3134 if (((code == '1') || (code == '2') || (code == 'e'))
3135 && EXPR_WFL_LINECOL (node))
3143 /* Issue a missing return statement error. Uses METHOD to figure the
3144 last line of the method the error occurs in. */
3147 missing_return_error (tree method)
3149 EXPR_WFL_SET_LINECOL (wfl_operator, DECL_FUNCTION_LAST_LINE (method), -2);
3150 parse_error_context (wfl_operator, "Missing return statement");
3153 /* Issue an unreachable statement error. From NODE, find the next
3154 statement to report appropriately. */
3156 unreachable_stmt_error (tree node)
3158 /* Browse node to find the next expression node that has a WFL. Use
3159 the location to report the error */
3160 if (TREE_CODE (node) == COMPOUND_EXPR)
3161 node = find_expr_with_wfl (TREE_OPERAND (node, 1));
3163 node = find_expr_with_wfl (node);
3167 EXPR_WFL_SET_LINECOL (wfl_operator, EXPR_WFL_LINENO (node), -2);
3168 parse_error_context (wfl_operator, "Unreachable statement");
3175 not_accessible_field_error (tree wfl, tree decl)
3178 (wfl, "Can't access %s field `%s.%s' from `%s'",
3179 accessibility_string (get_access_flags_from_decl (decl)),
3180 GET_TYPE_NAME (DECL_CONTEXT (decl)),
3181 IDENTIFIER_POINTER (DECL_NAME (decl)),
3182 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (current_class))));
3187 java_report_errors (void)
3189 if (java_error_count)
3190 fprintf (stderr, "%d error%s",
3191 java_error_count, (java_error_count == 1 ? "" : "s"));
3192 if (java_warning_count)
3193 fprintf (stderr, "%s%d warning%s", (java_error_count ? ", " : ""),
3194 java_warning_count, (java_warning_count == 1 ? "" : "s"));
3195 if (java_error_count || java_warning_count)
3196 putc ('\n', stderr);
3197 return java_error_count;
3201 java_accstring_lookup (int flags)
3203 static char buffer [80];
3204 #define COPY_RETURN(S) {strcpy (buffer, S); return buffer;}
3206 /* Access modifier looked-up first for easier report on forbidden
3208 if (flags & ACC_PUBLIC) COPY_RETURN ("public");
3209 if (flags & ACC_PRIVATE) COPY_RETURN ("private");
3210 if (flags & ACC_PROTECTED) COPY_RETURN ("protected");
3211 if (flags & ACC_STATIC) COPY_RETURN ("static");
3212 if (flags & ACC_FINAL) COPY_RETURN ("final");
3213 if (flags & ACC_SYNCHRONIZED) COPY_RETURN ("synchronized");
3214 if (flags & ACC_VOLATILE) COPY_RETURN ("volatile");
3215 if (flags & ACC_TRANSIENT) COPY_RETURN ("transient");
3216 if (flags & ACC_NATIVE) COPY_RETURN ("native");
3217 if (flags & ACC_INTERFACE) COPY_RETURN ("interface");
3218 if (flags & ACC_ABSTRACT) COPY_RETURN ("abstract");
3225 /* Returns a string denoting the accessibility of a class or a member as
3226 indicated by FLAGS. We need a separate function from
3227 java_accstring_lookup, as the latter can return spurious "static", etc.
3228 if package-private access is defined (in which case none of the
3229 relevant access control bits in FLAGS is set). */
3232 accessibility_string (int flags)
3234 if (flags & ACC_PRIVATE) return "private";
3235 if (flags & ACC_PROTECTED) return "protected";
3236 if (flags & ACC_PUBLIC) return "public";
3238 return "package-private";
3241 /* Issuing error messages upon redefinition of classes, interfaces or
3245 classitf_redefinition_error (const char *context, tree id, tree decl, tree cl)
3247 parse_error_context (cl, "%s `%s' already defined in %s:%d",
3248 context, IDENTIFIER_POINTER (id),
3249 DECL_SOURCE_FILE (decl), DECL_SOURCE_LINE (decl));
3250 /* Here we should point out where its redefined. It's a unicode. FIXME */
3254 variable_redefinition_error (tree context, tree name, tree type, int line)
3256 const char *type_name;
3258 /* Figure a proper name for type. We might haven't resolved it */
3259 if (TREE_CODE (type) == POINTER_TYPE && !TREE_TYPE (type))
3260 type_name = IDENTIFIER_POINTER (TYPE_NAME (type));
3262 type_name = lang_printable_name (type, 0);
3264 parse_error_context (context,
3265 "Variable `%s' is already defined in this method and was declared `%s %s' at line %d",
3266 IDENTIFIER_POINTER (name),
3267 type_name, IDENTIFIER_POINTER (name), line);
3270 /* If ANAME is terminated with `[]', it indicates an array. This
3271 function returns the number of `[]' found and if this number is
3272 greater than zero, it extracts the array type name and places it in
3273 the node pointed to by TRIMMED unless TRIMMED is null. */
3276 build_type_name_from_array_name (tree aname, tree *trimmed)
3278 const char *name = IDENTIFIER_POINTER (aname);
3279 int len = IDENTIFIER_LENGTH (aname);
3282 STRING_STRIP_BRACKETS (name, len, array_dims);
3284 if (array_dims && trimmed)
3285 *trimmed = get_identifier_with_length (name, len);
3291 build_array_from_name (tree type, tree type_wfl, tree name, tree *ret_name)
3295 /* Eventually get more dims */
3296 more_dims = build_type_name_from_array_name (name, &name);
3298 /* If we have, then craft a new type for this variable */
3303 /* If we have a pointer, use its type */
3304 if (TREE_CODE (type) == POINTER_TYPE)
3305 type = TREE_TYPE (type);
3307 /* Building the first dimension of a primitive type uses this
3309 if (JPRIMITIVE_TYPE_P (type))
3311 type = build_java_array_type (type, -1);
3314 /* Otherwise, if we have a WFL for this type, use it (the type
3315 is already an array on an unresolved type, and we just keep
3316 on adding dimensions) */
3320 more_dims += build_type_name_from_array_name (TYPE_NAME (save),
3324 /* Add all the dimensions */
3326 type = build_unresolved_array_type (type);
3328 /* The type may have been incomplete in the first place */
3330 type = obtain_incomplete_type (type);
3338 /* Build something that the type identifier resolver will identify as
3339 being an array to an unresolved type. TYPE_WFL is a WFL on a
3343 build_unresolved_array_type (tree type_or_wfl)
3348 /* TYPE_OR_WFL might be an array on a resolved type. In this case,
3349 just create a array type */
3350 if (TREE_CODE (type_or_wfl) == RECORD_TYPE)
3351 return build_java_array_type (type_or_wfl, -1);
3353 obstack_grow (&temporary_obstack,
3354 IDENTIFIER_POINTER (EXPR_WFL_NODE (type_or_wfl)),
3355 IDENTIFIER_LENGTH (EXPR_WFL_NODE (type_or_wfl)));
3356 obstack_grow0 (&temporary_obstack, "[]", 2);
3357 ptr = obstack_finish (&temporary_obstack);
3358 wfl = build_expr_wfl (get_identifier (ptr),
3359 EXPR_WFL_FILENAME (type_or_wfl),
3360 EXPR_WFL_LINENO (type_or_wfl),
3361 EXPR_WFL_COLNO (type_or_wfl));
3362 /* Re-install the existing qualifications so that the type can be
3363 resolved properly. */
3364 EXPR_WFL_QUALIFICATION (wfl) = EXPR_WFL_QUALIFICATION (type_or_wfl);
3369 parser_add_interface (tree class_decl, tree interface_decl, tree wfl)
3371 if (maybe_add_interface (TREE_TYPE (class_decl), TREE_TYPE (interface_decl)))
3372 parse_error_context (wfl, "Interface `%s' repeated",
3373 IDENTIFIER_POINTER (DECL_NAME (interface_decl)));
3376 /* Bulk of common class/interface checks. Return 1 if an error was
3377 encountered. TAG is 0 for a class, 1 for an interface. */
3380 check_class_interface_creation (int is_interface, int flags, tree raw_name,
3381 tree qualified_name, tree decl, tree cl)
3384 int sca = 0; /* Static class allowed */
3385 int icaf = 0; /* Inner class allowed flags */
3386 int uaaf = CLASS_MODIFIERS; /* Usually allowed access flags */
3389 fprintf (stderr, " %s%s %s",
3390 (CPC_INNER_P () ? "inner" : ""),
3391 (is_interface ? "interface" : "class"),
3392 IDENTIFIER_POINTER (qualified_name));
3394 /* Scope of an interface/class type name:
3395 - Can't be imported by a single type import
3396 - Can't already exists in the package */
3397 if (IS_A_SINGLE_IMPORT_CLASSFILE_NAME_P (raw_name)
3398 && (node = find_name_in_single_imports (raw_name))
3402 (cl, "%s name `%s' clashes with imported type `%s'",
3403 (is_interface ? "Interface" : "Class"),
3404 IDENTIFIER_POINTER (raw_name), IDENTIFIER_POINTER (node));
3407 if (decl && CLASS_COMPLETE_P (decl))
3409 classitf_redefinition_error ((is_interface ? "Interface" : "Class"),
3410 qualified_name, decl, cl);
3414 if (check_inner_class_redefinition (raw_name, cl))
3417 /* If public, file name should match class/interface name, except
3418 when dealing with an inner class */
3419 if (!CPC_INNER_P () && (flags & ACC_PUBLIC ))
3423 for (f = &input_filename [strlen (input_filename)];
3424 f != input_filename && ! IS_DIR_SEPARATOR (f[0]);
3427 if (IS_DIR_SEPARATOR (f[0]))
3429 if (strncmp (IDENTIFIER_POINTER (raw_name),
3430 f , IDENTIFIER_LENGTH (raw_name)) ||
3431 f [IDENTIFIER_LENGTH (raw_name)] != '.')
3433 (cl, "Public %s `%s' must be defined in a file called `%s.java'",
3434 (is_interface ? "interface" : "class"),
3435 IDENTIFIER_POINTER (qualified_name),
3436 IDENTIFIER_POINTER (raw_name));
3439 /* Static classes can be declared only in top level classes. Note:
3440 once static, a inner class is a top level class. */
3441 if (flags & ACC_STATIC)
3443 /* Catch the specific error of declaring an class inner class
3444 with no toplevel enclosing class. Prevent check_modifiers from
3445 complaining a second time */
3446 if (CPC_INNER_P () && !TOPLEVEL_CLASS_DECL_P (GET_CPC()))
3448 parse_error_context (cl, "Inner class `%s' can't be static. Static classes can only occur in interfaces and top-level classes",
3449 IDENTIFIER_POINTER (qualified_name));
3452 /* Else, in the context of a top-level class declaration, let
3453 `check_modifiers' do its job, otherwise, give it a go */
3455 sca = (GET_CPC_LIST () ? ACC_STATIC : 0);
3458 /* Inner classes can be declared private or protected
3459 within their enclosing classes. */
3462 /* A class which is local to a block can't be public, private,
3463 protected or static. But it is created final, so allow this
3465 if (current_function_decl)
3466 icaf = sca = uaaf = ACC_FINAL;
3469 check_modifiers_consistency (flags);
3470 icaf = ACC_PROTECTED;
3471 if (! CLASS_INTERFACE (GET_CPC ()))
3472 icaf |= ACC_PRIVATE;
3479 uaaf = INTERFACE_INNER_MODIFIERS;
3481 uaaf = INTERFACE_MODIFIERS;
3483 check_modifiers ("Illegal modifier `%s' for interface declaration",
3487 check_modifiers ((current_function_decl ?
3488 "Illegal modifier `%s' for local class declaration" :
3489 "Illegal modifier `%s' for class declaration"),
3490 flags, uaaf|sca|icaf);
3494 /* Construct a nested class name. If the final component starts with
3495 a digit, return true. Otherwise return false. */
3497 make_nested_class_name (tree cpc_list)
3504 make_nested_class_name (TREE_CHAIN (cpc_list));
3506 /* Pick the qualified name when dealing with the first upmost
3508 name = (TREE_CHAIN (cpc_list)
3509 ? TREE_PURPOSE (cpc_list) : DECL_NAME (TREE_VALUE (cpc_list)));
3510 obstack_grow (&temporary_obstack,
3511 IDENTIFIER_POINTER (name), IDENTIFIER_LENGTH (name));
3512 obstack_1grow (&temporary_obstack, '$');
3514 return ISDIGIT (IDENTIFIER_POINTER (name)[0]);
3517 /* Can't redefine a class already defined in an earlier scope. */
3520 check_inner_class_redefinition (tree raw_name, tree cl)
3524 for (scope_list = GET_CPC_LIST (); scope_list;
3525 scope_list = GET_NEXT_ENCLOSING_CPC (scope_list))
3526 if (raw_name == GET_CPC_UN_NODE (scope_list))
3529 (cl, "The class name `%s' is already defined in this scope. An inner class may not have the same simple name as any of its enclosing classes",
3530 IDENTIFIER_POINTER (raw_name));
3536 /* Tries to find a decl for CLASS_TYPE within ENCLOSING. If we fail,
3537 we remember ENCLOSING and SUPER. */
3540 resolve_inner_class (htab_t circularity_hash, tree cl, tree *enclosing,
3541 tree *super, tree class_type)
3543 tree local_enclosing = *enclosing;
3544 tree local_super = NULL_TREE;
3546 while (local_enclosing)
3548 tree intermediate, decl;
3550 *htab_find_slot (circularity_hash, local_enclosing, INSERT) =
3553 if ((decl = find_as_inner_class (local_enclosing, class_type, cl)))
3556 intermediate = local_enclosing;
3557 /* Explore enclosing contexts. */
3558 while (INNER_CLASS_DECL_P (intermediate))
3560 intermediate = DECL_CONTEXT (intermediate);
3561 if ((decl = find_as_inner_class (intermediate, class_type, cl)))
3565 /* Now go to the upper classes, bail out if necessary. We will
3566 analyze the returned SUPER and act accordingly (see
3567 do_resolve_class). */
3568 if (JPRIMITIVE_TYPE_P (TREE_TYPE (local_enclosing))
3569 || TREE_TYPE (local_enclosing) == void_type_node)
3571 parse_error_context (cl, "Qualifier must be a reference");
3572 local_enclosing = NULL_TREE;
3575 local_super = CLASSTYPE_SUPER (TREE_TYPE (local_enclosing));
3576 if (!local_super || local_super == object_type_node)
3579 if (TREE_CODE (local_super) == POINTER_TYPE)
3580 local_super = do_resolve_class (NULL, local_super, NULL, NULL);
3582 local_super = TYPE_NAME (local_super);
3584 /* We may not have checked for circular inheritance yet, so do so
3585 here to prevent an infinite loop. */
3586 if (htab_find (circularity_hash, local_super) != NULL)
3589 cl = lookup_cl (local_enclosing);
3592 (cl, "Cyclic inheritance involving %s",
3593 IDENTIFIER_POINTER (DECL_NAME (local_enclosing)));
3594 local_enclosing = NULL_TREE;
3597 local_enclosing = local_super;
3600 /* We failed. Return LOCAL_SUPER and LOCAL_ENCLOSING. */
3601 *super = local_super;
3602 *enclosing = local_enclosing;
3607 /* Within ENCLOSING, find a decl for NAME and return it. NAME can be
3611 find_as_inner_class (tree enclosing, tree name, tree cl)
3613 tree qual, to_return;
3617 name = TYPE_NAME (name);
3619 /* First search: within the scope of `enclosing', search for name */
3620 if (QUALIFIED_P (name) && cl && EXPR_WFL_NODE (cl) == name)
3621 qual = EXPR_WFL_QUALIFICATION (cl);
3623 qual = build_tree_list (cl, NULL_TREE);
3625 qual = build_tree_list (build_expr_wfl (name, NULL, 0, 0), NULL_TREE);
3627 if ((to_return = find_as_inner_class_do (qual, enclosing)))
3630 /* We're dealing with a qualified name. Try to resolve thing until
3631 we get something that is an enclosing class. */
3632 if (QUALIFIED_P (name) && cl && EXPR_WFL_NODE (cl) == name)
3634 tree acc = NULL_TREE, decl = NULL_TREE, ptr;
3636 for (qual = EXPR_WFL_QUALIFICATION (cl); qual && !decl;
3637 qual = TREE_CHAIN (qual))
3639 acc = merge_qualified_name (acc,
3640 EXPR_WFL_NODE (TREE_PURPOSE (qual)));
3641 BUILD_PTR_FROM_NAME (ptr, acc);
3642 decl = do_resolve_class (NULL_TREE, ptr, NULL_TREE, cl);
3645 /* A NULL qual and a decl means that the search ended
3646 successfully?!? We have to do something then. FIXME */
3651 qual = EXPR_WFL_QUALIFICATION (cl);
3653 /* Otherwise, create a qual for the other part of the resolution. */
3655 qual = build_tree_list (build_expr_wfl (name, NULL, 0, 0), NULL_TREE);
3657 return find_as_inner_class_do (qual, enclosing);
3660 /* We go inside the list of sub classes and try to find a way
3664 find_as_inner_class_do (tree qual, tree enclosing)
3669 for (; qual && enclosing; qual = TREE_CHAIN (qual))
3671 tree name_to_match = EXPR_WFL_NODE (TREE_PURPOSE (qual));
3672 tree next_enclosing = NULL_TREE;
3675 for (inner_list = DECL_INNER_CLASS_LIST (enclosing);
3676 inner_list; inner_list = TREE_CHAIN (inner_list))
3678 if (TREE_VALUE (inner_list) == name_to_match)
3680 next_enclosing = TREE_PURPOSE (inner_list);
3684 enclosing = next_enclosing;
3687 return (!qual && enclosing ? enclosing : NULL_TREE);
3691 link_nested_class_to_enclosing (void)
3693 if (GET_ENCLOSING_CPC ())
3695 tree enclosing = GET_ENCLOSING_CPC_CONTEXT ();
3696 DECL_INNER_CLASS_LIST (enclosing) =
3697 tree_cons (GET_CPC (), GET_CPC_UN (),
3698 DECL_INNER_CLASS_LIST (enclosing));
3703 maybe_make_nested_class_name (tree name)
3705 tree id = NULL_TREE;
3709 /* If we're in a function, we must append a number to create the
3710 nested class name. However, we don't do this if the class we
3711 are constructing is anonymous, because in that case we'll
3712 already have a number as the class name. */
3713 if (! make_nested_class_name (GET_CPC_LIST ())
3714 && current_function_decl != NULL_TREE
3715 && ! ISDIGIT (IDENTIFIER_POINTER (name)[0]))
3718 sprintf (buf, "%d", anonymous_class_counter);
3719 ++anonymous_class_counter;
3720 obstack_grow (&temporary_obstack, buf, strlen (buf));
3721 obstack_1grow (&temporary_obstack, '$');
3723 obstack_grow0 (&temporary_obstack,
3724 IDENTIFIER_POINTER (name),
3725 IDENTIFIER_LENGTH (name));
3726 id = get_identifier (obstack_finish (&temporary_obstack));
3728 QUALIFIED_P (id) = 1;
3733 /* If DECL is NULL, create and push a new DECL, record the current
3734 line CL and do other maintenance things. */
3737 maybe_create_class_interface_decl (tree decl, tree raw_name,
3738 tree qualified_name, tree cl)
3741 decl = push_class (make_class (), qualified_name);
3743 /* Take care of the file and line business */
3744 DECL_SOURCE_FILE (decl) = EXPR_WFL_FILENAME (cl);
3745 /* If we're emitting xrefs, store the line/col number information */
3747 DECL_SOURCE_LINE (decl) = EXPR_WFL_LINECOL (cl);
3749 DECL_SOURCE_LINE (decl) = EXPR_WFL_LINENO (cl);
3750 CLASS_FROM_SOURCE_P (TREE_TYPE (decl)) = 1;
3751 CLASS_PARSED_P (TREE_TYPE (decl)) = 1;
3752 CLASS_FROM_CURRENTLY_COMPILED_P (TREE_TYPE (decl)) =
3753 IS_A_COMMAND_LINE_FILENAME_P (EXPR_WFL_FILENAME_NODE (cl));
3755 PUSH_CPC (decl, raw_name);
3756 DECL_CONTEXT (decl) = GET_ENCLOSING_CPC_CONTEXT ();
3758 /* Link the declaration to the already seen ones */
3759 TREE_CHAIN (decl) = ctxp->class_list;
3760 ctxp->class_list = decl;
3762 /* Create a new nodes in the global lists */
3763 gclass_list = tree_cons (NULL_TREE, decl, gclass_list);
3764 all_class_list = tree_cons (NULL_TREE, decl, all_class_list);
3766 /* Install a new dependency list element */
3767 create_jdep_list (ctxp);
3769 SOURCE_FRONTEND_DEBUG (("Defining class/interface %s",
3770 IDENTIFIER_POINTER (qualified_name)));
3775 add_superinterfaces (tree decl, tree interface_list)
3778 /* Superinterface(s): if present and defined, parser_check_super_interface ()
3779 takes care of ensuring that:
3780 - This is an accessible interface type,
3781 - Circularity detection.
3782 parser_add_interface is then called. If present but not defined,
3783 the check operation is delayed until the super interface gets
3785 for (node = interface_list; node; node = TREE_CHAIN (node))
3787 tree current = TREE_PURPOSE (node);
3788 tree idecl = IDENTIFIER_CLASS_VALUE (EXPR_WFL_NODE (current));
3789 if (idecl && CLASS_LOADED_P (TREE_TYPE (idecl)))
3791 if (!parser_check_super_interface (idecl, decl, current))
3792 parser_add_interface (decl, idecl, current);
3795 register_incomplete_type (JDEP_INTERFACE,
3796 current, decl, NULL_TREE);
3800 /* Create an interface in pass1 and return its decl. Return the
3801 interface's decl in pass 2. */
3804 create_interface (int flags, tree id, tree super)
3806 tree raw_name = EXPR_WFL_NODE (id);
3807 tree q_name = parser_qualified_classname (raw_name);
3808 tree decl = IDENTIFIER_CLASS_VALUE (q_name);
3810 /* Certain syntax errors are making SUPER be like ID. Avoid this
3812 if (ctxp->class_err && id == super)
3815 EXPR_WFL_NODE (id) = q_name; /* Keep source location, even if refined. */
3817 /* Basic checks: scope, redefinition, modifiers */
3818 if (check_class_interface_creation (1, flags, raw_name, q_name, decl, id))
3824 /* Suspend the current parsing context if we're parsing an inner
3828 java_parser_context_suspend ();
3829 /* Interface members are public. */
3830 if (CLASS_INTERFACE (GET_CPC ()))
3831 flags |= ACC_PUBLIC;
3834 /* Push a new context for (static) initialized upon declaration fields */
3835 java_parser_context_push_initialized_field ();
3837 /* Interface modifiers check
3838 - public/abstract allowed (already done at that point)
3839 - abstract is obsolete (comes first, it's a warning, or should be)
3840 - Can't use twice the same (checked in the modifier rule) */
3841 if ((flags & ACC_ABSTRACT) && flag_redundant)
3842 parse_warning_context
3843 (MODIFIER_WFL (ABSTRACT_TK),
3844 "Redundant use of `abstract' modifier. Interface `%s' is implicitly abstract", IDENTIFIER_POINTER (raw_name));
3846 /* Create a new decl if DECL is NULL, otherwise fix it */
3847 decl = maybe_create_class_interface_decl (decl, raw_name, q_name, id);
3849 /* Interfaces are always abstract. */
3850 flags |= ACC_ABSTRACT;
3852 /* Inner interfaces are always static. */
3853 if (INNER_CLASS_DECL_P (decl))
3854 flags |= ACC_STATIC;
3856 /* Set super info and mark the class a complete */
3857 set_super_info (ACC_INTERFACE | flags, TREE_TYPE (decl),
3858 object_type_node, ctxp->interface_number);
3859 ctxp->interface_number = 0;
3860 CLASS_COMPLETE_P (decl) = 1;
3861 add_superinterfaces (decl, super);
3863 /* Eventually sets the @deprecated tag flag */
3864 CHECK_DEPRECATED (decl);
3869 /* Patch anonymous class CLASS, by either extending or implementing
3873 patch_anonymous_class (tree type_decl, tree class_decl, tree wfl)
3875 tree class = TREE_TYPE (class_decl);
3876 tree type = TREE_TYPE (type_decl);
3877 tree binfo = TYPE_BINFO (class);
3879 /* If it's an interface, implement it */
3880 if (CLASS_INTERFACE (type_decl))
3885 if (parser_check_super_interface (type_decl, class_decl, wfl))
3888 s_binfo = TREE_VEC_ELT (BINFO_BASE_BINFOS (TYPE_BINFO (class)), 0);
3889 length = TREE_VEC_LENGTH (BINFO_BASE_BINFOS (TYPE_BINFO (class)))+1;
3890 BINFO_BASE_BINFOS (TYPE_BINFO (class)) = make_tree_vec (length);
3891 TREE_VEC_ELT (BINFO_BASE_BINFOS (TYPE_BINFO (class)), 0) = s_binfo;
3892 /* And add the interface */
3893 parser_add_interface (class_decl, type_decl, wfl);
3895 /* Otherwise, it's a type we want to extend */
3898 if (parser_check_super (type_decl, class_decl, wfl))
3900 BINFO_TYPE (TREE_VEC_ELT (BINFO_BASE_BINFOS (binfo), 0)) = type;
3904 /* Create an anonymous class which extends/implements TYPE_NAME, and return
3908 create_anonymous_class (tree type_name)
3911 tree super = NULL_TREE, itf = NULL_TREE;
3912 tree id, type_decl, class;
3914 /* The unqualified name of the anonymous class. It's just a number. */
3915 sprintf (buffer, "%d", anonymous_class_counter++);
3916 id = build_wfl_node (get_identifier (buffer));
3917 EXPR_WFL_LINECOL (id) = EXPR_WFL_LINECOL (type_name);
3919 /* We know about the type to extend/implement. We go ahead */
3920 if ((type_decl = IDENTIFIER_CLASS_VALUE (EXPR_WFL_NODE (type_name))))
3922 /* Create a class which either implements on extends the designated
3923 class. The class bears an inaccessible name. */
3924 if (CLASS_INTERFACE (type_decl))
3926 /* It's OK to modify it here. It's been already used and
3927 shouldn't be reused */
3928 ctxp->interface_number = 1;
3929 /* Interfaces should presented as a list of WFLs */
3930 itf = build_tree_list (type_name, NULL_TREE);
3936 class = create_class (ACC_FINAL, id, super, itf);
3938 /* We didn't know anything about the stuff. We register a dependence. */
3940 register_incomplete_type (JDEP_ANONYMOUS, type_name, class, NULL_TREE);
3942 ANONYMOUS_CLASS_P (TREE_TYPE (class)) = 1;
3946 /* Create a class in pass1 and return its decl. Return class
3947 interface's decl in pass 2. */
3950 create_class (int flags, tree id, tree super, tree interfaces)
3952 tree raw_name = EXPR_WFL_NODE (id);
3953 tree class_id, decl;
3954 tree super_decl_type;
3956 /* Certain syntax errors are making SUPER be like ID. Avoid this
3958 if (ctxp->class_err && id == super)
3961 class_id = parser_qualified_classname (raw_name);
3962 decl = IDENTIFIER_CLASS_VALUE (class_id);
3963 EXPR_WFL_NODE (id) = class_id;
3965 /* Basic check: scope, redefinition, modifiers */
3966 if (check_class_interface_creation (0, flags, raw_name, class_id, decl, id))
3972 /* Suspend the current parsing context if we're parsing an inner
3973 class or an anonymous class. */
3976 java_parser_context_suspend ();
3977 /* Interface members are public. */
3978 if (CLASS_INTERFACE (GET_CPC ()))
3979 flags |= ACC_PUBLIC;
3982 /* Push a new context for (static) initialized upon declaration fields */
3983 java_parser_context_push_initialized_field ();
3985 /* Class modifier check:
3986 - Allowed modifier (already done at that point)
3987 - abstract AND final forbidden
3988 - Public classes defined in the correct file */
3989 if ((flags & ACC_ABSTRACT) && (flags & ACC_FINAL))
3991 (id, "Class `%s' can't be declared both abstract and final",
3992 IDENTIFIER_POINTER (raw_name));
3994 /* Create a new decl if DECL is NULL, otherwise fix it */
3995 decl = maybe_create_class_interface_decl (decl, raw_name, class_id, id);
3997 /* If SUPER exists, use it, otherwise use Object */
4000 /* java.lang.Object can't extend anything. */
4001 if (TREE_TYPE (IDENTIFIER_CLASS_VALUE (class_id)) == object_type_node)
4003 parse_error_context (id, "`java.lang.Object' can't extend anything");
4008 register_incomplete_type (JDEP_SUPER, super, decl, NULL_TREE);
4010 else if (TREE_TYPE (decl) != object_type_node)
4011 super_decl_type = object_type_node;
4012 /* We're defining java.lang.Object */
4014 super_decl_type = NULL_TREE;
4016 /* A class nested in an interface is implicitly static. */
4017 if (INNER_CLASS_DECL_P (decl)
4018 && CLASS_INTERFACE (TYPE_NAME (TREE_TYPE (DECL_CONTEXT (decl)))))
4020 flags |= ACC_STATIC;
4023 /* Set super info and mark the class as complete. */
4024 set_super_info (flags, TREE_TYPE (decl), super_decl_type,
4025 ctxp->interface_number);
4026 ctxp->interface_number = 0;
4027 CLASS_COMPLETE_P (decl) = 1;
4028 add_superinterfaces (decl, interfaces);
4030 /* TYPE_VFIELD' is a compiler-generated field used to point to
4031 virtual function tables. In gcj, every class has a common base
4032 virtual function table in java.lang.object. */
4033 TYPE_VFIELD (TREE_TYPE (decl)) = TYPE_VFIELD (object_type_node);
4035 /* Add the private this$<n> field, Replicate final locals still in
4036 scope as private final fields mangled like val$<local_name>.
4037 This does not occur for top level (static) inner classes. */
4038 if (PURE_INNER_CLASS_DECL_P (decl))
4039 add_inner_class_fields (decl, current_function_decl);
4041 /* If doing xref, store the location at which the inherited class
4042 (if any) was seen. */
4043 if (flag_emit_xref && super)
4044 DECL_INHERITED_SOURCE_LINE (decl) = EXPR_WFL_LINECOL (super);
4046 /* Eventually sets the @deprecated tag flag */
4047 CHECK_DEPRECATED (decl);
4049 /* Reset the anonymous class counter when declaring non inner classes */
4050 if (!INNER_CLASS_DECL_P (decl))
4051 anonymous_class_counter = 1;
4056 /* End a class declaration: register the statements used to create
4057 finit$ and <clinit>, pop the current class and resume the prior
4058 parser context if necessary. */
4061 end_class_declaration (int resume)
4063 /* If an error occurred, context weren't pushed and won't need to be
4064 popped by a resume. */
4065 int no_error_occurred = ctxp->next && GET_CPC () != error_mark_node;
4067 if (GET_CPC () != error_mark_node)
4068 dump_java_tree (TDI_class, GET_CPC ());
4070 java_parser_context_pop_initialized_field ();
4072 if (resume && no_error_occurred)
4073 java_parser_context_resume ();
4075 /* We're ending a class declaration, this is a good time to reset
4076 the interface cout. Note that might have been already done in
4077 create_interface, but if at that time an inner class was being
4078 dealt with, the interface count was reset in a context created
4079 for the sake of handling inner classes declaration. */
4080 ctxp->interface_number = 0;
4084 add_inner_class_fields (tree class_decl, tree fct_decl)
4086 tree block, marker, f;
4088 f = add_field (TREE_TYPE (class_decl),
4089 build_current_thisn (TREE_TYPE (class_decl)),
4090 build_pointer_type (TREE_TYPE (DECL_CONTEXT (class_decl))),
4092 FIELD_THISN (f) = 1;
4097 for (block = GET_CURRENT_BLOCK (fct_decl);
4098 block && TREE_CODE (block) == BLOCK; block = BLOCK_SUPERCONTEXT (block))
4101 for (decl = BLOCK_EXPR_DECLS (block); decl; decl = TREE_CHAIN (decl))
4104 tree wfl, init, list;
4106 /* Avoid non final arguments. */
4107 if (!LOCAL_FINAL_P (decl))
4110 MANGLE_OUTER_LOCAL_VARIABLE_NAME (name, DECL_NAME (decl));
4111 MANGLE_ALIAS_INITIALIZER_PARAMETER_NAME_ID (pname, DECL_NAME (decl));
4112 wfl = build_wfl_node (name);
4113 init = build_wfl_node (pname);
4114 /* Build an initialization for the field: it will be
4115 initialized by a parameter added to finit$, bearing a
4116 mangled name of the field itself (param$<n>.) The
4117 parameter is provided to finit$ by the constructor
4118 invoking it (hence the constructor will also feature a
4119 hidden parameter, set to the value of the outer context
4120 local at the time the inner class is created.)
4122 Note: we take into account all possible locals that can
4123 be accessed by the inner class. It's actually not trivial
4124 to minimize these aliases down to the ones really
4125 used. One way to do that would be to expand all regular
4126 methods first, then finit$ to get a picture of what's
4127 used. It works with the exception that we would have to
4128 go back on all constructor invoked in regular methods to
4129 have their invocation reworked (to include the right amount
4130 of alias initializer parameters.)
4132 The only real way around, I think, is a first pass to
4133 identify locals really used in the inner class. We leave
4134 the flag FIELD_LOCAL_ALIAS_USED around for that future
4137 On the other hand, it only affect local inner classes,
4138 whose constructors (and finit$ call) will be featuring
4139 unnecessary arguments. It's easy for a developer to keep
4140 this number of parameter down by using the `final'
4141 keyword only when necessary. For the time being, we can
4142 issue a warning on unnecessary finals. FIXME */
4143 init = build_assignment (ASSIGN_TK, EXPR_WFL_LINECOL (wfl),
4146 /* Register the field. The TREE_LIST holding the part
4147 initialized/initializer will be marked ARG_FINAL_P so
4148 that the created field can be marked
4149 FIELD_LOCAL_ALIAS. */
4150 list = build_tree_list (wfl, init);
4151 ARG_FINAL_P (list) = 1;
4152 register_fields (ACC_PRIVATE | ACC_FINAL, TREE_TYPE (decl), list);
4156 if (!CPC_INITIALIZER_STMT (ctxp))
4159 /* If we ever registered an alias field, insert and marker to
4160 remember where the list ends. The second part of the list (the one
4161 featuring initialized fields) so it can be later reversed to
4162 enforce 8.5. The marker will be removed during that operation. */
4163 marker = build_tree_list (NULL_TREE, NULL_TREE);
4164 TREE_CHAIN (marker) = CPC_INITIALIZER_STMT (ctxp);
4165 SET_CPC_INITIALIZER_STMT (ctxp, marker);
4168 /* Can't use lookup_field () since we don't want to load the class and
4169 can't set the CLASS_LOADED_P flag */
4172 find_field (tree class, tree name)
4175 for (decl = TYPE_FIELDS (class); decl; decl = TREE_CHAIN (decl))
4177 if (DECL_NAME (decl) == name)
4183 /* Wrap around lookup_field that doesn't potentially upset the value
4187 lookup_field_wrapper (tree class, tree name)
4190 tree decl = NULL_TREE;
4191 java_parser_context_save_global ();
4193 /* Last chance: if we're within the context of an inner class, we
4194 might be trying to access a local variable defined in an outer
4195 context. We try to look for it now. */
4196 if (INNER_CLASS_TYPE_P (class) && TREE_CODE (name) == IDENTIFIER_NODE)
4199 MANGLE_OUTER_LOCAL_VARIABLE_NAME (new_name, name);
4200 decl = lookup_field (&type, new_name);
4201 if (decl && decl != error_mark_node)
4202 FIELD_LOCAL_ALIAS_USED (decl) = 1;
4204 if (!decl || decl == error_mark_node)
4207 decl = lookup_field (&type, name);
4210 /* If the field still hasn't been found, try the next enclosing context. */
4211 if (!decl && INNER_CLASS_TYPE_P (class))
4213 tree outer_type = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (class)));
4214 decl = lookup_field_wrapper (outer_type, name);
4217 java_parser_context_restore_global ();
4218 return decl == error_mark_node ? NULL : decl;
4221 /* Find duplicate field within the same class declarations and report
4222 the error. Returns 1 if a duplicated field was found, 0
4226 duplicate_declaration_error_p (tree new_field_name, tree new_type, tree cl)
4228 /* This might be modified to work with method decl as well */
4229 tree decl = find_field (TREE_TYPE (GET_CPC ()), new_field_name);
4232 char *t1 = xstrdup (purify_type_name
4233 ((TREE_CODE (new_type) == POINTER_TYPE
4234 && TREE_TYPE (new_type) == NULL_TREE) ?
4235 IDENTIFIER_POINTER (TYPE_NAME (new_type)) :
4236 lang_printable_name (new_type, 1)));
4237 /* The type may not have been completed by the time we report
4239 char *t2 = xstrdup (purify_type_name
4240 ((TREE_CODE (TREE_TYPE (decl)) == POINTER_TYPE
4241 && TREE_TYPE (TREE_TYPE (decl)) == NULL_TREE) ?
4242 IDENTIFIER_POINTER (TYPE_NAME (TREE_TYPE (decl))) :
4243 lang_printable_name (TREE_TYPE (decl), 1)));
4245 (cl , "Duplicate variable declaration: `%s %s' was `%s %s' (%s:%d)",
4246 t1, IDENTIFIER_POINTER (new_field_name),
4247 t2, IDENTIFIER_POINTER (DECL_NAME (decl)),
4248 DECL_SOURCE_FILE (decl), DECL_SOURCE_LINE (decl));
4256 /* Field registration routine. If TYPE doesn't exist, field
4257 declarations are linked to the undefined TYPE dependency list, to
4258 be later resolved in java_complete_class () */
4261 register_fields (int flags, tree type, tree variable_list)
4263 tree current, saved_type;
4264 tree class_type = NULL_TREE;
4265 int saved_lineno = input_line;
4267 tree wfl = NULL_TREE;
4270 class_type = TREE_TYPE (GET_CPC ());
4272 if (!class_type || class_type == error_mark_node)
4275 /* If we're adding fields to interfaces, those fields are public,
4277 if (CLASS_INTERFACE (TYPE_NAME (class_type)))
4279 OBSOLETE_MODIFIER_WARNING (MODIFIER_WFL (PUBLIC_TK),
4280 flags, ACC_PUBLIC, "interface field(s)");
4281 OBSOLETE_MODIFIER_WARNING (MODIFIER_WFL (STATIC_TK),
4282 flags, ACC_STATIC, "interface field(s)");
4283 OBSOLETE_MODIFIER_WARNING (MODIFIER_WFL (FINAL_TK),
4284 flags, ACC_FINAL, "interface field(s)");
4285 check_modifiers ("Illegal interface member modifier `%s'", flags,
4286 INTERFACE_FIELD_MODIFIERS);
4287 flags |= (ACC_PUBLIC | ACC_STATIC | ACC_FINAL);
4290 /* Obtain a suitable type for resolution, if necessary */
4291 SET_TYPE_FOR_RESOLUTION (type, wfl, must_chain);
4293 /* If TYPE is fully resolved and we don't have a reference, make one */
4294 PROMOTE_RECORD_IF_COMPLETE (type, must_chain);
4296 for (current = variable_list, saved_type = type; current;
4297 current = TREE_CHAIN (current), type = saved_type)
4301 tree cl = TREE_PURPOSE (current);
4302 tree init = TREE_VALUE (current);
4303 tree current_name = EXPR_WFL_NODE (cl);
4305 /* Can't declare non-final static fields in inner classes */
4306 if ((flags & ACC_STATIC) && !TOPLEVEL_CLASS_TYPE_P (class_type)
4307 && !(flags & ACC_FINAL))
4309 (cl, "Field `%s' can't be static in inner class `%s' unless it is final",
4310 IDENTIFIER_POINTER (EXPR_WFL_NODE (cl)),
4311 lang_printable_name (class_type, 0));
4313 /* Process NAME, as it may specify extra dimension(s) for it */
4314 type = build_array_from_name (type, wfl, current_name, ¤t_name);
4316 /* Type adjustment. We may have just readjusted TYPE because
4317 the variable specified more dimensions. Make sure we have
4318 a reference if we can and don't have one already. Also
4319 change the name if we have an init. */
4320 if (type != saved_type)
4322 PROMOTE_RECORD_IF_COMPLETE (type, must_chain);
4324 EXPR_WFL_NODE (TREE_OPERAND (init, 0)) = current_name;
4327 real_type = GET_REAL_TYPE (type);
4328 /* Check for redeclarations */
4329 if (duplicate_declaration_error_p (current_name, real_type, cl))
4332 /* Set input_line to the line the field was found and create a
4333 declaration for it. Eventually sets the @deprecated tag flag. */
4335 input_line = EXPR_WFL_LINECOL (cl);
4337 input_line = EXPR_WFL_LINENO (cl);
4338 field_decl = add_field (class_type, current_name, real_type, flags);
4339 CHECK_DEPRECATED_NO_RESET (field_decl);
4341 /* If the field denotes a final instance variable, then we
4342 allocate a LANG_DECL_SPECIFIC part to keep track of its
4343 initialization. We also mark whether the field was
4344 initialized upon its declaration. We don't do that if the
4345 created field is an alias to a final local. */
4346 if (!ARG_FINAL_P (current) && (flags & ACC_FINAL))
4348 MAYBE_CREATE_VAR_LANG_DECL_SPECIFIC (field_decl);
4349 DECL_FIELD_FINAL_WFL (field_decl) = cl;
4352 /* If the couple initializer/initialized is marked ARG_FINAL_P,
4353 we mark the created field FIELD_LOCAL_ALIAS, so that we can
4354 hide parameters to this inner class finit$ and
4355 constructors. It also means that the field isn't final per
4357 if (ARG_FINAL_P (current))
4359 FIELD_LOCAL_ALIAS (field_decl) = 1;
4360 FIELD_FINAL (field_decl) = 0;
4363 /* Check if we must chain. */
4365 register_incomplete_type (JDEP_FIELD, wfl, field_decl, type);
4367 /* If we have an initialization value tied to the field */
4370 /* The field is declared static */
4371 if (flags & ACC_STATIC)
4373 /* We include the field and its initialization part into
4374 a list used to generate <clinit>. After <clinit> is
4375 walked, field initializations will be processed and
4376 fields initialized with known constants will be taken
4377 out of <clinit> and have their DECL_INITIAL set
4379 TREE_CHAIN (init) = CPC_STATIC_INITIALIZER_STMT (ctxp);
4380 SET_CPC_STATIC_INITIALIZER_STMT (ctxp, init);
4381 if (TREE_OPERAND (init, 1)
4382 && TREE_CODE (TREE_OPERAND (init, 1)) == NEW_ARRAY_INIT)
4383 TREE_STATIC (TREE_OPERAND (init, 1)) = 1;
4385 /* A non-static field declared with an immediate initialization is
4386 to be initialized in <init>, if any. This field is remembered
4387 to be processed at the time of the generation of <init>. */
4390 TREE_CHAIN (init) = CPC_INITIALIZER_STMT (ctxp);
4391 SET_CPC_INITIALIZER_STMT (ctxp, init);
4393 MODIFY_EXPR_FROM_INITIALIZATION_P (init) = 1;
4394 DECL_INITIAL (field_decl) = TREE_OPERAND (init, 1);
4399 input_line = saved_lineno;
4402 /* Generate finit$, using the list of initialized fields to populate
4403 its body. finit$'s parameter(s) list is adjusted to include the
4404 one(s) used to initialized the field(s) caching outer context
4408 generate_finit (tree class_type)
4411 tree list = TYPE_FINIT_STMT_LIST (class_type);
4412 tree mdecl, current, parms;
4414 parms = build_alias_initializer_parameter_list (AIPL_FUNCTION_CREATION,
4415 class_type, NULL_TREE,
4417 CRAFTED_PARAM_LIST_FIXUP (parms);
4418 mdecl = create_artificial_method (class_type, ACC_PRIVATE, void_type_node,
4419 finit_identifier_node, parms);
4420 fix_method_argument_names (parms, mdecl);
4421 layout_class_method (class_type, CLASSTYPE_SUPER (class_type),
4423 DECL_FUNCTION_NAP (mdecl) = count;
4424 start_artificial_method_body (mdecl);
4426 for (current = list; current; current = TREE_CHAIN (current))
4427 java_method_add_stmt (mdecl,
4428 build_debugable_stmt (EXPR_WFL_LINECOL (current),
4430 end_artificial_method_body (mdecl);
4434 /* Generate a function to run the instance initialization code. The
4435 private method is called `instinit$'. Unless we're dealing with an
4436 anonymous class, we determine whether all ctors of CLASS_TYPE
4437 declare a checked exception in their `throws' clause in order to
4438 see whether it's necessary to encapsulate the instance initializer
4439 statements in a try/catch/rethrow sequence. */
4442 generate_instinit (tree class_type)
4445 tree compound = NULL_TREE;
4446 tree parms = tree_cons (this_identifier_node,
4447 build_pointer_type (class_type), end_params_node);
4448 tree mdecl = create_artificial_method (class_type, ACC_PRIVATE,
4450 instinit_identifier_node, parms);
4452 layout_class_method (class_type, CLASSTYPE_SUPER (class_type),
4455 /* Gather all the statements in a compound */
4456 for (current = TYPE_II_STMT_LIST (class_type);
4457 current; current = TREE_CHAIN (current))
4458 compound = add_stmt_to_compound (compound, NULL_TREE, current);
4460 /* We need to encapsulate COMPOUND by a try/catch statement to
4461 rethrow exceptions that might occur in the instance initializer.
4462 We do that only if all ctors of CLASS_TYPE are set to catch a
4463 checked exception. This doesn't apply to anonymous classes (since
4464 they don't have declared ctors.) */
4465 if (!ANONYMOUS_CLASS_P (class_type) &&
4466 ctors_unchecked_throws_clause_p (class_type))
4468 compound = encapsulate_with_try_catch (0, exception_type_node, compound,
4469 build1 (THROW_EXPR, NULL_TREE,
4470 build_wfl_node (wpv_id)));
4471 DECL_FUNCTION_THROWS (mdecl) = build_tree_list (NULL_TREE,
4472 exception_type_node);
4475 start_artificial_method_body (mdecl);
4476 java_method_add_stmt (mdecl, compound);
4477 end_artificial_method_body (mdecl);
4484 build_instinit_invocation (tree class_type)
4486 tree to_return = NULL_TREE;
4488 if (TYPE_II_STMT_LIST (class_type))
4490 tree parm = build_tree_list (NULL_TREE,
4491 build_wfl_node (this_identifier_node));
4493 build_method_invocation (build_wfl_node (instinit_identifier_node),
4499 /* Shared across method_declarator and method_header to remember the
4500 patch stage that was reached during the declaration of the method.
4501 A method DECL is built differently is there is no patch
4502 (JDEP_NO_PATCH) or a patch (JDEP_METHOD or JDEP_METHOD_RETURN)
4503 pending on the currently defined method. */
4505 static int patch_stage;
4507 /* Check the method declaration and add the method to its current
4508 class. If the argument list is known to contain incomplete types,
4509 the method is partially added and the registration will be resume
4510 once the method arguments resolved. If TYPE is NULL, we're dealing
4511 with a constructor. */
4514 method_header (int flags, tree type, tree mdecl, tree throws)
4516 tree type_wfl = NULL_TREE;
4517 tree meth_name = NULL_TREE;
4518 tree current, orig_arg, this_class = NULL;
4521 int constructor_ok = 0, must_chain;
4524 if (mdecl == error_mark_node)
4525 return error_mark_node;
4526 meth = TREE_VALUE (mdecl);
4527 id = TREE_PURPOSE (mdecl);
4529 check_modifiers_consistency (flags);
4532 this_class = TREE_TYPE (GET_CPC ());
4534 if (!this_class || this_class == error_mark_node)
4537 /* There are some forbidden modifiers for an abstract method and its
4538 class must be abstract as well. */
4539 if (type && (flags & ACC_ABSTRACT))
4541 ABSTRACT_CHECK (flags, ACC_PRIVATE, id, "Private");
4542 ABSTRACT_CHECK (flags, ACC_STATIC, id, "Static");
4543 ABSTRACT_CHECK (flags, ACC_FINAL, id, "Final");
4544 ABSTRACT_CHECK (flags, ACC_NATIVE, id, "Native");
4545 ABSTRACT_CHECK (flags, ACC_SYNCHRONIZED, id, "Synchronized");
4546 ABSTRACT_CHECK (flags, ACC_STRICT, id, "Strictfp");
4547 if (!CLASS_ABSTRACT (TYPE_NAME (this_class))
4548 && !CLASS_INTERFACE (TYPE_NAME (this_class)))
4550 (id, "Class `%s' must be declared abstract to define abstract method `%s'",
4551 IDENTIFIER_POINTER (DECL_NAME (GET_CPC ())),
4552 IDENTIFIER_POINTER (EXPR_WFL_NODE (id)));
4555 /* A native method can't be strictfp. */
4556 if ((flags & ACC_NATIVE) && (flags & ACC_STRICT))
4557 parse_error_context (id, "native method `%s' can't be strictfp",
4558 IDENTIFIER_POINTER (EXPR_WFL_NODE (id)));
4559 /* No such thing as a transient or volatile method. */
4560 if ((flags & ACC_TRANSIENT))
4561 parse_error_context (id, "method `%s' can't be transient",
4562 IDENTIFIER_POINTER (EXPR_WFL_NODE (id)));
4563 if ((flags & ACC_VOLATILE))
4564 parse_error_context (id, "method `%s' can't be volatile",
4565 IDENTIFIER_POINTER (EXPR_WFL_NODE (id)));
4567 /* Things to be checked when declaring a constructor */
4570 int ec = java_error_count;
4571 /* 8.6: Constructor declarations: we might be trying to define a
4572 method without specifying a return type. */
4573 if (EXPR_WFL_NODE (id) != GET_CPC_UN ())
4575 (id, "Invalid method declaration, return type required");
4576 /* 8.6.3: Constructor modifiers */
4579 JCONSTRUCTOR_CHECK (flags, ACC_ABSTRACT, id, "abstract");
4580 JCONSTRUCTOR_CHECK (flags, ACC_STATIC, id, "static");
4581 JCONSTRUCTOR_CHECK (flags, ACC_FINAL, id, "final");
4582 JCONSTRUCTOR_CHECK (flags, ACC_NATIVE, id, "native");
4583 JCONSTRUCTOR_CHECK (flags, ACC_SYNCHRONIZED, id, "synchronized");
4584 JCONSTRUCTOR_CHECK (flags, ACC_STRICT, id, "strictfp");
4586 /* If we found error here, we don't consider it's OK to tread
4587 the method definition as a constructor, for the rest of this
4589 if (ec == java_error_count)
4593 /* Method declared within the scope of an interface are implicitly
4594 abstract and public. Conflicts with other erroneously provided
4595 modifiers are checked right after. */
4597 if (CLASS_INTERFACE (TYPE_NAME (this_class)))
4599 /* If FLAGS isn't set because of a modifier, turn the
4600 corresponding modifier WFL to NULL so we issue a warning on
4601 the obsolete use of the modifier */
4602 if (!(flags & ACC_PUBLIC))
4603 MODIFIER_WFL (PUBLIC_TK) = NULL;
4604 if (!(flags & ACC_ABSTRACT))
4605 MODIFIER_WFL (ABSTRACT_TK) = NULL;
4606 flags |= ACC_PUBLIC;
4607 flags |= ACC_ABSTRACT;
4610 /* Inner class can't declare static methods */
4611 if ((flags & ACC_STATIC) && !TOPLEVEL_CLASS_TYPE_P (this_class))
4614 (id, "Method `%s' can't be static in inner class `%s'. Only members of interfaces and top-level classes can be static",
4615 IDENTIFIER_POINTER (EXPR_WFL_NODE (id)),
4616 lang_printable_name (this_class, 0));
4619 /* Modifiers context reset moved up, so abstract method declaration
4620 modifiers can be later checked. */
4622 /* Set constructor returned type to void and method name to <init>,
4623 unless we found an error identifier the constructor (in which
4624 case we retain the original name) */
4627 type = void_type_node;
4629 meth_name = init_identifier_node;
4632 meth_name = EXPR_WFL_NODE (id);
4634 /* Do the returned type resolution and registration if necessary */
4635 SET_TYPE_FOR_RESOLUTION (type, type_wfl, must_chain);
4638 type = build_array_from_name (type, type_wfl, meth_name, &meth_name);
4639 EXPR_WFL_NODE (id) = meth_name;
4640 PROMOTE_RECORD_IF_COMPLETE (type, must_chain);
4644 patch_stage = JDEP_METHOD_RETURN;
4645 register_incomplete_type (patch_stage, type_wfl, id, type);
4646 TREE_TYPE (meth) = GET_REAL_TYPE (type);
4649 TREE_TYPE (meth) = type;
4651 saved_lineno = input_line;
4652 /* When defining an abstract or interface method, the curly
4653 bracket at level 1 doesn't exist because there is no function
4655 input_line = (ctxp->first_ccb_indent1 ? ctxp->first_ccb_indent1 :
4656 EXPR_WFL_LINENO (id));
4658 /* Remember the original argument list */
4659 orig_arg = TYPE_ARG_TYPES (meth);
4661 if (patch_stage) /* includes ret type and/or all args */
4664 meth = add_method_1 (this_class, flags, meth_name, meth);
4665 /* Patch for the return type */
4666 if (patch_stage == JDEP_METHOD_RETURN)
4668 jdep = CLASSD_LAST (ctxp->classd_list);
4669 JDEP_GET_PATCH (jdep) = &TREE_TYPE (TREE_TYPE (meth));
4671 /* This is the stop JDEP. METH allows the function's signature
4673 register_incomplete_type (JDEP_METHOD_END, NULL_TREE, meth, NULL_TREE);
4676 meth = add_method (this_class, flags, meth_name,
4677 build_java_signature (meth));
4679 /* Remember final parameters */
4680 MARK_FINAL_PARMS (meth, orig_arg);
4682 /* Fix the method argument list so we have the argument name
4684 fix_method_argument_names (orig_arg, meth);
4686 /* Register the parameter number and re-install the current line
4688 DECL_MAX_LOCALS (meth) = ctxp->formal_parameter_number+1;
4689 input_line = saved_lineno;
4691 /* Register exception specified by the `throws' keyword for
4692 resolution and set the method decl appropriate field to the list.
4693 Note: the grammar ensures that what we get here are class
4697 throws = nreverse (throws);
4698 for (current = throws; current; current = TREE_CHAIN (current))
4700 register_incomplete_type (JDEP_EXCEPTION, TREE_VALUE (current),
4701 NULL_TREE, NULL_TREE);
4702 JDEP_GET_PATCH (CLASSD_LAST (ctxp->classd_list)) =
4703 &TREE_VALUE (current);
4705 DECL_FUNCTION_THROWS (meth) = throws;
4708 if (TREE_TYPE (GET_CPC ()) != object_type_node)
4709 DECL_FUNCTION_WFL (meth) = id;
4711 /* Set the flag if we correctly processed a constructor */
4714 DECL_CONSTRUCTOR_P (meth) = 1;
4715 /* Compute and store the number of artificial parameters declared
4716 for this constructor */
4717 for (count = 0, current = TYPE_FIELDS (this_class); current;
4718 current = TREE_CHAIN (current))
4719 if (FIELD_LOCAL_ALIAS (current))
4721 DECL_FUNCTION_NAP (meth) = count;
4724 /* Eventually set the @deprecated tag flag */
4725 CHECK_DEPRECATED (meth);
4727 /* If doing xref, store column and line number information instead
4728 of the line number only. */
4730 DECL_SOURCE_LINE (meth) = EXPR_WFL_LINECOL (id);
4736 fix_method_argument_names (tree orig_arg, tree meth)
4738 tree arg = TYPE_ARG_TYPES (TREE_TYPE (meth));
4739 if (TREE_CODE (TREE_TYPE (meth)) == METHOD_TYPE)
4741 TREE_PURPOSE (arg) = this_identifier_node;
4742 arg = TREE_CHAIN (arg);
4744 while (orig_arg != end_params_node)
4746 TREE_PURPOSE (arg) = TREE_PURPOSE (orig_arg);
4747 orig_arg = TREE_CHAIN (orig_arg);
4748 arg = TREE_CHAIN (arg);
4752 /* Complete the method declaration with METHOD_BODY. */
4755 finish_method_declaration (tree method_body)
4759 if (!current_function_decl)
4762 flags = get_access_flags_from_decl (current_function_decl);
4764 /* 8.4.5 Method Body */
4765 if ((flags & ACC_ABSTRACT || flags & ACC_NATIVE) && method_body)
4767 tree name = DECL_NAME (current_function_decl);
4768 parse_error_context (DECL_FUNCTION_WFL (current_function_decl),
4769 "%s method `%s' can't have a body defined",
4770 (METHOD_NATIVE (current_function_decl) ?
4771 "Native" : "Abstract"),
4772 IDENTIFIER_POINTER (name));
4773 method_body = NULL_TREE;
4775 else if (!(flags & ACC_ABSTRACT) && !(flags & ACC_NATIVE) && !method_body)
4777 tree name = DECL_NAME (current_function_decl);
4779 (DECL_FUNCTION_WFL (current_function_decl),
4780 "Non native and non abstract method `%s' must have a body defined",
4781 IDENTIFIER_POINTER (name));
4782 method_body = NULL_TREE;
4785 if (flag_emit_class_files && method_body
4786 && TREE_CODE (method_body) == NOP_EXPR
4787 && TREE_TYPE (current_function_decl)
4788 && TREE_TYPE (TREE_TYPE (current_function_decl)) == void_type_node)
4789 method_body = build1 (RETURN_EXPR, void_type_node, NULL);
4791 BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (current_function_decl)) = method_body;
4792 maybe_absorb_scoping_blocks ();
4793 /* Exit function's body */
4795 /* Merge last line of the function with first line, directly in the
4796 function decl. It will be used to emit correct debug info. */
4797 if (!flag_emit_xref)
4798 DECL_FUNCTION_LAST_LINE (current_function_decl) = ctxp->last_ccb_indent1;
4800 /* Since function's argument's list are shared, reset the
4801 ARG_FINAL_P parameter that might have been set on some of this
4802 function parameters. */
4803 UNMARK_FINAL_PARMS (current_function_decl);
4805 /* So we don't have an irrelevant function declaration context for
4806 the next static block we'll see. */
4807 current_function_decl = NULL_TREE;
4810 /* Build a an error message for constructor circularity errors. */
4813 constructor_circularity_msg (tree from, tree to)
4815 static char string [4096];
4816 char *t = xstrdup (lang_printable_name (from, 0));
4817 sprintf (string, "`%s' invokes `%s'", t, lang_printable_name (to, 0));
4822 /* Verify a circular call to METH. Return 1 if an error is found, 0
4825 static GTY(()) tree vcc_list;
4827 verify_constructor_circularity (tree meth, tree current)
4831 for (c = DECL_CONSTRUCTOR_CALLS (current); c; c = TREE_CHAIN (c))
4833 if (TREE_VALUE (c) == meth)
4839 vcc_list = nreverse (vcc_list);
4840 for (liste = vcc_list; liste; liste = TREE_CHAIN (liste))
4843 (TREE_PURPOSE (TREE_PURPOSE (liste)), "%s",
4844 constructor_circularity_msg
4845 (TREE_VALUE (liste), TREE_VALUE (TREE_PURPOSE (liste))));
4849 t = xstrdup (lang_printable_name (meth, 0));
4850 parse_error_context (TREE_PURPOSE (c),
4851 "%s: recursive invocation of constructor `%s'",
4852 constructor_circularity_msg (current, meth), t);
4854 vcc_list = NULL_TREE;
4858 for (c = DECL_CONSTRUCTOR_CALLS (current); c; c = TREE_CHAIN (c))
4860 vcc_list = tree_cons (c, current, vcc_list);
4861 if (verify_constructor_circularity (meth, TREE_VALUE (c)))
4863 vcc_list = TREE_CHAIN (vcc_list);
4868 /* Check modifiers that can be declared but exclusively */
4871 check_modifiers_consistency (int flags)
4874 tree cl = NULL_TREE;
4876 THIS_MODIFIER_ONLY (flags, ACC_PUBLIC, PUBLIC_TK, acc_count, cl);
4877 THIS_MODIFIER_ONLY (flags, ACC_PRIVATE, PRIVATE_TK, acc_count, cl);
4878 THIS_MODIFIER_ONLY (flags, ACC_PROTECTED, PROTECTED_TK, acc_count, cl);
4881 (cl, "Inconsistent member declaration. At most one of `public', `private', or `protected' may be specified");
4885 THIS_MODIFIER_ONLY (flags, ACC_FINAL, FINAL_TK, acc_count, cl);
4886 THIS_MODIFIER_ONLY (flags, ACC_VOLATILE, VOLATILE_TK, acc_count, cl);
4888 parse_error_context (cl,
4889 "Inconsistent member declaration. At most one of `final' or `volatile' may be specified");
4892 /* Check the methode header METH for abstract specifics features */
4895 check_abstract_method_header (tree meth)
4897 int flags = get_access_flags_from_decl (meth);
4899 OBSOLETE_MODIFIER_WARNING2 (MODIFIER_WFL (ABSTRACT_TK), flags,
4900 ACC_ABSTRACT, "abstract method",
4901 IDENTIFIER_POINTER (DECL_NAME (meth)));
4902 OBSOLETE_MODIFIER_WARNING2 (MODIFIER_WFL (PUBLIC_TK), flags,
4903 ACC_PUBLIC, "abstract method",
4904 IDENTIFIER_POINTER (DECL_NAME (meth)));
4906 check_modifiers ("Illegal modifier `%s' for interface method",
4907 flags, INTERFACE_METHOD_MODIFIERS);
4910 /* Create a FUNCTION_TYPE node and start augmenting it with the
4911 declared function arguments. Arguments type that can't be resolved
4912 are left as they are, but the returned node is marked as containing
4913 incomplete types. */
4916 method_declarator (tree id, tree list)
4918 tree arg_types = NULL_TREE, current, node;
4919 tree meth = make_node (FUNCTION_TYPE);
4922 patch_stage = JDEP_NO_PATCH;
4924 if (GET_CPC () == error_mark_node)
4925 return error_mark_node;
4927 /* If we're dealing with an inner class constructor, we hide the
4928 this$<n> decl in the name field of its parameter declaration. We
4929 also might have to hide the outer context local alias
4930 initializers. Not done when the class is a toplevel class. */
4931 if (PURE_INNER_CLASS_DECL_P (GET_CPC ())
4932 && EXPR_WFL_NODE (id) == GET_CPC_UN ())
4934 tree aliases_list, type, thisn;
4935 /* First the aliases, linked to the regular parameters */
4937 build_alias_initializer_parameter_list (AIPL_FUNCTION_DECLARATION,
4938 TREE_TYPE (GET_CPC ()),
4940 list = chainon (nreverse (aliases_list), list);
4943 type = TREE_TYPE (DECL_CONTEXT (GET_CPC ()));
4944 thisn = build_current_thisn (TREE_TYPE (GET_CPC ()));
4945 list = tree_cons (build_wfl_node (thisn), build_pointer_type (type),
4949 for (current = list; current; current = TREE_CHAIN (current))
4952 tree wfl_name = TREE_PURPOSE (current);
4953 tree type = TREE_VALUE (current);
4954 tree name = EXPR_WFL_NODE (wfl_name);
4955 tree already, arg_node;
4956 tree type_wfl = NULL_TREE;
4959 /* Obtain a suitable type for resolution, if necessary */
4960 SET_TYPE_FOR_RESOLUTION (type, type_wfl, must_chain);
4962 /* Process NAME, as it may specify extra dimension(s) for it */
4963 type = build_array_from_name (type, type_wfl, name, &name);
4964 EXPR_WFL_NODE (wfl_name) = name;
4966 real_type = GET_REAL_TYPE (type);
4967 if (TREE_CODE (real_type) == RECORD_TYPE)
4969 real_type = promote_type (real_type);
4970 if (TREE_CODE (type) == TREE_LIST)
4971 TREE_PURPOSE (type) = real_type;
4974 /* Check redefinition */
4975 for (already = arg_types; already; already = TREE_CHAIN (already))
4976 if (TREE_PURPOSE (already) == name)
4979 (wfl_name, "Variable `%s' is used more than once in the argument list of method `%s'",
4980 IDENTIFIER_POINTER (name),
4981 IDENTIFIER_POINTER (EXPR_WFL_NODE (id)));
4985 /* If we've an incomplete argument type, we know there is a location
4986 to patch when the type get resolved, later. */
4990 patch_stage = JDEP_METHOD;
4991 type = register_incomplete_type (patch_stage,
4992 type_wfl, wfl_name, type);
4993 jdep = CLASSD_LAST (ctxp->classd_list);
4994 JDEP_MISC (jdep) = id;
4997 /* The argument node: a name and a (possibly) incomplete type. */
4998 arg_node = build_tree_list (name, real_type);
4999 /* Remember arguments declared final. */
5000 ARG_FINAL_P (arg_node) = ARG_FINAL_P (current);
5003 JDEP_GET_PATCH (jdep) = &TREE_VALUE (arg_node);
5004 TREE_CHAIN (arg_node) = arg_types;
5005 arg_types = arg_node;
5007 TYPE_ARG_TYPES (meth) = chainon (nreverse (arg_types), end_params_node);
5008 node = build_tree_list (id, meth);
5013 unresolved_type_p (tree wfl, tree *returned)
5015 if (TREE_CODE (wfl) == EXPR_WITH_FILE_LOCATION)
5019 tree decl = IDENTIFIER_CLASS_VALUE (EXPR_WFL_NODE (wfl));
5020 if (decl && current_class && (decl == TYPE_NAME (current_class)))
5021 *returned = TREE_TYPE (decl);
5022 else if (GET_CPC_UN () == EXPR_WFL_NODE (wfl))
5023 *returned = TREE_TYPE (GET_CPC ());
5025 *returned = NULL_TREE;
5034 /* From NAME, build a qualified identifier node using the
5035 qualification from the current package definition. */
5038 parser_qualified_classname (tree name)
5040 tree nested_class_name;
5042 if ((nested_class_name = maybe_make_nested_class_name (name)))
5043 return nested_class_name;
5046 return merge_qualified_name (ctxp->package, name);
5051 /* Called once the type a interface extends is resolved. Returns 0 if
5052 everything is OK. */
5055 parser_check_super_interface (tree super_decl, tree this_decl, tree this_wfl)
5057 tree super_type = TREE_TYPE (super_decl);
5059 /* Has to be an interface */
5060 if (!CLASS_INTERFACE (super_decl))
5063 (this_wfl, "%s `%s' can't implement/extend %s `%s'",
5064 (CLASS_INTERFACE (TYPE_NAME (TREE_TYPE (this_decl))) ?
5065 "Interface" : "Class"),
5066 IDENTIFIER_POINTER (DECL_NAME (this_decl)),
5067 (TYPE_ARRAY_P (super_type) ? "array" : "class"),
5068 IDENTIFIER_POINTER (DECL_NAME (super_decl)));
5072 /* Check top-level interface access. Inner classes are subject to member
5073 access rules (6.6.1). */
5074 if (! INNER_CLASS_P (super_type)
5075 && check_pkg_class_access (DECL_NAME (super_decl),
5076 NULL_TREE, true, this_decl))
5079 SOURCE_FRONTEND_DEBUG (("Completing interface %s with %s",
5080 IDENTIFIER_POINTER (DECL_NAME (this_decl)),
5081 IDENTIFIER_POINTER (DECL_NAME (super_decl))));
5085 /* Makes sure that SUPER_DECL is suitable to extend THIS_DECL. Returns
5086 0 if everything is OK. */
5089 parser_check_super (tree super_decl, tree this_decl, tree wfl)
5091 tree super_type = TREE_TYPE (super_decl);
5093 /* SUPER should be a CLASS (neither an array nor an interface) */
5094 if (TYPE_ARRAY_P (super_type) || CLASS_INTERFACE (TYPE_NAME (super_type)))
5097 (wfl, "Class `%s' can't subclass %s `%s'",
5098 IDENTIFIER_POINTER (DECL_NAME (this_decl)),
5099 (CLASS_INTERFACE (TYPE_NAME (super_type)) ? "interface" : "array"),
5100 IDENTIFIER_POINTER (DECL_NAME (super_decl)));
5104 if (CLASS_FINAL (TYPE_NAME (super_type)))
5106 parse_error_context (wfl, "Can't subclass final classes: %s",
5107 IDENTIFIER_POINTER (DECL_NAME (super_decl)));
5111 /* Check top-level class scope. Inner classes are subject to member access
5113 if (! INNER_CLASS_P (super_type)
5114 && (check_pkg_class_access (DECL_NAME (super_decl), wfl, true, NULL_TREE)))
5117 SOURCE_FRONTEND_DEBUG (("Completing class %s with %s",
5118 IDENTIFIER_POINTER (DECL_NAME (this_decl)),
5119 IDENTIFIER_POINTER (DECL_NAME (super_decl))));
5123 /* Create a new dependency list and link it (in a LIFO manner) to the
5124 CTXP list of type dependency list. */
5127 create_jdep_list (struct parser_ctxt *ctxp)
5129 jdeplist *new = xmalloc (sizeof (jdeplist));
5130 new->first = new->last = NULL;
5131 new->next = ctxp->classd_list;
5132 ctxp->classd_list = new;
5136 reverse_jdep_list (struct parser_ctxt *ctxp)
5138 jdeplist *prev = NULL, *current, *next;
5139 for (current = ctxp->classd_list; current; current = next)
5141 next = current->next;
5142 current->next = prev;
5148 /* Create a fake pointer based on the ID stored in
5149 TYPE_NAME. TYPE_NAME can be a WFL or a incomplete type asking to be
5150 registered again. */
5153 obtain_incomplete_type (tree type_name)
5155 tree ptr = NULL_TREE, name;
5157 if (TREE_CODE (type_name) == EXPR_WITH_FILE_LOCATION)
5158 name = EXPR_WFL_NODE (type_name);
5159 else if (INCOMPLETE_TYPE_P (type_name))
5160 name = TYPE_NAME (type_name);
5164 /* Workaround from build_pointer_type for incomplete types. */
5165 BUILD_PTR_FROM_NAME (ptr, name);
5166 TYPE_MODE (ptr) = ptr_mode;
5172 /* Register a incomplete type whose name is WFL. Reuse PTR if PTR is
5173 non NULL instead of computing a new fake type based on WFL. The new
5174 dependency is inserted in the current type dependency list, in FIFO
5178 register_incomplete_type (int kind, tree wfl, tree decl, tree ptr)
5180 jdep *new = xmalloc (sizeof (jdep));
5182 if (!ptr && kind != JDEP_METHOD_END) /* JDEP_METHOD_END is a mere marker */
5183 ptr = obtain_incomplete_type (wfl);
5185 JDEP_KIND (new) = kind;
5186 JDEP_DECL (new) = decl;
5187 JDEP_TO_RESOLVE (new) = ptr;
5188 JDEP_WFL (new) = wfl;
5189 JDEP_CHAIN (new) = NULL;
5190 JDEP_MISC (new) = NULL_TREE;
5191 /* For some dependencies, set the enclosing class of the current
5192 class to be the enclosing context */
5193 if ((kind == JDEP_INTERFACE || kind == JDEP_ANONYMOUS || kind == JDEP_SUPER)
5194 && GET_ENCLOSING_CPC ())
5195 JDEP_ENCLOSING (new) = TREE_VALUE (GET_ENCLOSING_CPC ());
5197 JDEP_ENCLOSING (new) = GET_CPC ();
5198 JDEP_GET_PATCH (new) = (tree *)NULL;
5200 JDEP_INSERT (ctxp->classd_list, new);
5205 /* This checks for circular references with innerclasses. We start
5206 from SOURCE and should never reach TARGET. Extended/implemented
5207 types in SOURCE have their enclosing context checked not to reach
5208 TARGET. When the last enclosing context of SOURCE is reached, its
5209 extended/implemented types are also checked not to reach TARGET.
5210 In case of error, WFL of the offending type is returned; NULL_TREE
5214 check_inner_circular_reference (tree source, tree target)
5216 tree basetype_vec = BINFO_BASE_BINFOS (TYPE_BINFO (source));
5223 for (i = 0; i < TREE_VEC_LENGTH (basetype_vec); i++)
5227 /* We can end up with a NULL_TREE or an incomplete type here if
5228 we encountered previous type resolution errors. It's safe to
5229 simply ignore these cases. */
5230 if (TREE_VEC_ELT (basetype_vec, i) == NULL_TREE)
5232 su = BINFO_TYPE (TREE_VEC_ELT (basetype_vec, i));
5233 if (INCOMPLETE_TYPE_P (su))
5236 if (inherits_from_p (su, target))
5237 return lookup_cl (TYPE_NAME (su));
5239 for (ctx = DECL_CONTEXT (TYPE_NAME (su)); ctx; ctx = DECL_CONTEXT (ctx))
5241 /* An enclosing context shouldn't be TARGET */
5242 if (ctx == TYPE_NAME (target))
5243 return lookup_cl (TYPE_NAME (su));
5245 /* When we reach the enclosing last context, start a check
5246 on it, with the same target */
5247 if (! DECL_CONTEXT (ctx) &&
5248 (cl = check_inner_circular_reference (TREE_TYPE (ctx), target)))
5255 /* Explore TYPE's `extends' clause member(s) and return the WFL of the
5256 offending type if a circularity is detected. NULL_TREE is returned
5257 otherwise. TYPE can be an interface or a class. */
5260 check_circular_reference (tree type)
5262 tree basetype_vec = BINFO_BASE_BINFOS (TYPE_BINFO (type));
5268 if (! CLASS_INTERFACE (TYPE_NAME (type)))
5270 if (inherits_from_p (CLASSTYPE_SUPER (type), type))
5271 return lookup_cl (TYPE_NAME (type));
5275 for (i = 0; i < TREE_VEC_LENGTH (basetype_vec); i++)
5277 tree vec_elt = TREE_VEC_ELT (basetype_vec, i);
5278 if (vec_elt && BINFO_TYPE (vec_elt) != object_type_node
5279 && interface_of_p (type, BINFO_TYPE (vec_elt)))
5280 return lookup_cl (TYPE_NAME (BINFO_TYPE (vec_elt)));
5286 java_check_circular_reference (void)
5289 for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
5291 tree type = TREE_TYPE (current);
5294 cl = check_circular_reference (type);
5296 cl = check_inner_circular_reference (type, type);
5298 parse_error_context (cl, "Cyclic class inheritance%s",
5299 (cyclic_inheritance_report ?
5300 cyclic_inheritance_report : ""));
5304 /* Augment the parameter list PARM with parameters crafted to
5305 initialize outer context locals aliases. Through ARTIFICIAL, a
5306 count is kept of the number of crafted parameters. MODE governs
5307 what eventually gets created: something suitable for a function
5308 creation or a function invocation, either the constructor or
5312 build_alias_initializer_parameter_list (int mode, tree class_type, tree parm,
5316 tree additional_parms = NULL_TREE;
5318 for (field = TYPE_FIELDS (class_type); field; field = TREE_CHAIN (field))
5319 if (FIELD_LOCAL_ALIAS (field))
5321 const char *buffer = IDENTIFIER_POINTER (DECL_NAME (field));
5322 tree purpose = NULL_TREE, value = NULL_TREE, name = NULL_TREE;
5327 case AIPL_FUNCTION_DECLARATION:
5328 MANGLE_ALIAS_INITIALIZER_PARAMETER_NAME_STR (mangled_id,
5330 purpose = build_wfl_node (mangled_id);
5331 if (TREE_CODE (TREE_TYPE (field)) == POINTER_TYPE)
5332 value = build_wfl_node (TYPE_NAME (TREE_TYPE (field)));
5334 value = TREE_TYPE (field);
5337 case AIPL_FUNCTION_CREATION:
5338 MANGLE_ALIAS_INITIALIZER_PARAMETER_NAME_STR (purpose,
5340 value = TREE_TYPE (field);
5343 case AIPL_FUNCTION_FINIT_INVOCATION:
5344 MANGLE_ALIAS_INITIALIZER_PARAMETER_NAME_STR (mangled_id,
5346 /* Now, this is wrong. purpose should always be the NAME
5347 of something and value its matching value (decl, type,
5348 etc...) FIXME -- but there is a lot to fix. */
5350 /* When invoked for this kind of operation, we already
5351 know whether a field is used or not. */
5352 purpose = TREE_TYPE (field);
5353 value = build_wfl_node (mangled_id);
5356 case AIPL_FUNCTION_CTOR_INVOCATION:
5357 /* There are two case: the constructor invocation happens
5358 outside the local inner, in which case, locales from the outer
5359 context are directly used.
5361 Otherwise, we fold to using the alias directly. */
5362 if (class_type == current_class)
5366 name = get_identifier (&buffer[4]);
5367 value = IDENTIFIER_LOCAL_VALUE (name);
5371 additional_parms = tree_cons (purpose, value, additional_parms);
5375 if (additional_parms)
5377 if (ANONYMOUS_CLASS_P (class_type)
5378 && mode == AIPL_FUNCTION_CTOR_INVOCATION)
5379 additional_parms = nreverse (additional_parms);
5380 parm = chainon (additional_parms, parm);
5386 /* Craft a constructor for CLASS_DECL -- what we should do when none
5387 where found. ARGS is non NULL when a special signature must be
5388 enforced. This is the case for anonymous classes. */
5391 craft_constructor (tree class_decl, tree args)
5393 tree class_type = TREE_TYPE (class_decl);
5394 tree parm = NULL_TREE;
5395 /* Inherit access flags for the constructor from its enclosing class. */
5396 int valid_ctor_flags = ACC_PUBLIC | ACC_PROTECTED | ACC_PRIVATE;
5397 int flags = (get_access_flags_from_decl (class_decl) & valid_ctor_flags);
5398 int i = 0, artificial = 0;
5399 tree decl, ctor_name;
5402 /* The constructor name is <init> unless we're dealing with an
5403 anonymous class, in which case the name will be fixed after having
5405 if (ANONYMOUS_CLASS_P (class_type))
5406 ctor_name = DECL_NAME (class_decl);
5408 ctor_name = init_identifier_node;
5410 /* If we're dealing with an inner class constructor, we hide the
5411 this$<n> decl in the name field of its parameter declaration. */
5412 if (PURE_INNER_CLASS_TYPE_P (class_type))
5414 tree type = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (class_type)));
5415 parm = tree_cons (build_current_thisn (class_type),
5416 build_pointer_type (type), parm);
5418 /* Some more arguments to be hidden here. The values of the local
5419 variables of the outer context that the inner class needs to see. */
5420 parm = build_alias_initializer_parameter_list (AIPL_FUNCTION_CREATION,
5425 /* Then if there are any args to be enforced, enforce them now */
5426 for (; args && args != end_params_node; args = TREE_CHAIN (args))
5428 sprintf (buffer, "parm%d", i++);
5429 parm = tree_cons (get_identifier (buffer), TREE_VALUE (args), parm);
5432 CRAFTED_PARAM_LIST_FIXUP (parm);
5433 decl = create_artificial_method (class_type, flags, void_type_node,
5435 fix_method_argument_names (parm, decl);
5436 /* Now, mark the artificial parameters. */
5437 DECL_FUNCTION_NAP (decl) = artificial;
5438 DECL_FUNCTION_SYNTHETIC_CTOR (decl) = DECL_CONSTRUCTOR_P (decl) = 1;
5439 DECL_INLINE (decl) = 1;
5444 /* Fix the constructors. This will be called right after circular
5445 references have been checked. It is necessary to fix constructors
5446 early even if no code generation will take place for that class:
5447 some generated constructor might be required by the class whose
5448 compilation triggered this one to be simply loaded. */
5451 java_fix_constructors (void)
5455 for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
5457 tree class_type = TREE_TYPE (current);
5461 if (CLASS_INTERFACE (TYPE_NAME (class_type)))
5464 output_class = current_class = class_type;
5465 for (decl = TYPE_METHODS (class_type); decl; decl = TREE_CHAIN (decl))
5467 if (DECL_CONSTRUCTOR_P (decl))
5469 fix_constructors (decl);
5474 /* Anonymous class constructor can't be generated that early. */
5475 if (!saw_ctor && !ANONYMOUS_CLASS_P (class_type))
5476 craft_constructor (current, NULL_TREE);
5480 /* safe_layout_class just makes sure that we can load a class without
5481 disrupting the current_class, input_file, input_line, etc, information
5482 about the class processed currently. */
5485 safe_layout_class (tree class)
5487 tree save_current_class = current_class;
5488 location_t save_location = input_location;
5490 layout_class (class);
5492 current_class = save_current_class;
5493 input_location = save_location;
5497 jdep_resolve_class (jdep *dep)
5501 if (JDEP_RESOLVED_P (dep))
5502 decl = JDEP_RESOLVED_DECL (dep);
5505 decl = resolve_class (JDEP_ENCLOSING (dep), JDEP_TO_RESOLVE (dep),
5506 JDEP_DECL (dep), JDEP_WFL (dep));
5507 JDEP_RESOLVED (dep, decl);
5508 /* If there is no WFL, that's ok. We generate this warning
5510 if (decl && JDEP_WFL (dep) != NULL_TREE)
5511 check_deprecation (JDEP_WFL (dep), decl);
5515 complete_class_report_errors (dep);
5516 else if (INNER_CLASS_DECL_P (decl))
5518 tree inner = TREE_TYPE (decl);
5519 if (! CLASS_LOADED_P (inner))
5521 safe_layout_class (inner);
5522 if (TYPE_SIZE (inner) == error_mark_node)
5523 TYPE_SIZE (inner) = NULL_TREE;
5525 check_inner_class_access (decl, JDEP_ENCLOSING (dep), JDEP_WFL (dep));
5530 /* Complete unsatisfied class declaration and their dependencies */
5533 java_complete_class (void)
5540 /* Process imports */
5543 /* Reverse things so we have the right order */
5544 ctxp->class_list = nreverse (ctxp->class_list);
5545 ctxp->classd_list = reverse_jdep_list (ctxp);
5547 for (cclassd = ctxp->classd_list, cclass = ctxp->class_list;
5549 cclass = TREE_CHAIN (cclass), cclassd = CLASSD_CHAIN (cclassd))
5553 /* We keep the compilation unit imports in the class so that
5554 they can be used later to resolve type dependencies that
5555 aren't necessary to solve now. */
5556 TYPE_IMPORT_LIST (TREE_TYPE (cclass)) = ctxp->import_list;
5557 TYPE_IMPORT_DEMAND_LIST (TREE_TYPE (cclass)) = ctxp->import_demand_list;
5559 for (dep = CLASSD_FIRST (cclassd); dep; dep = JDEP_CHAIN (dep))
5562 if (!(decl = jdep_resolve_class (dep)))
5565 /* Now it's time to patch */
5566 switch (JDEP_KIND (dep))
5569 /* Simply patch super */
5570 if (parser_check_super (decl, JDEP_DECL (dep), JDEP_WFL (dep)))
5572 BINFO_TYPE (TREE_VEC_ELT (BINFO_BASE_BINFOS (TYPE_BINFO
5573 (TREE_TYPE (JDEP_DECL (dep)))), 0)) = TREE_TYPE (decl);
5578 /* We do part of the job done in add_field */
5579 tree field_decl = JDEP_DECL (dep);
5580 tree field_type = TREE_TYPE (decl);
5581 if (TREE_CODE (field_type) == RECORD_TYPE)
5582 field_type = promote_type (field_type);
5583 TREE_TYPE (field_decl) = field_type;
5584 DECL_ALIGN (field_decl) = 0;
5585 DECL_USER_ALIGN (field_decl) = 0;
5586 layout_decl (field_decl, 0);
5587 SOURCE_FRONTEND_DEBUG
5588 (("Completed field/var decl `%s' with `%s'",
5589 IDENTIFIER_POINTER (DECL_NAME (field_decl)),
5590 IDENTIFIER_POINTER (DECL_NAME (decl))));
5593 case JDEP_METHOD: /* We start patching a method */
5594 case JDEP_METHOD_RETURN:
5600 type = TREE_TYPE(decl);
5601 if (TREE_CODE (type) == RECORD_TYPE)
5602 type = promote_type (type);
5603 JDEP_APPLY_PATCH (dep, type);
5604 SOURCE_FRONTEND_DEBUG
5605 (((JDEP_KIND (dep) == JDEP_METHOD_RETURN ?
5606 "Completing fct `%s' with ret type `%s'":
5607 "Completing arg `%s' with type `%s'"),
5608 IDENTIFIER_POINTER (EXPR_WFL_NODE
5609 (JDEP_DECL_WFL (dep))),
5610 IDENTIFIER_POINTER (DECL_NAME (decl))));
5614 dep = JDEP_CHAIN (dep);
5615 if (JDEP_KIND (dep) == JDEP_METHOD_END)
5618 decl = jdep_resolve_class (dep);
5622 tree mdecl = JDEP_DECL (dep), signature;
5623 /* Recompute and reset the signature, check first that
5624 all types are now defined. If they're not,
5625 don't build the signature. */
5626 if (check_method_types_complete (mdecl))
5628 signature = build_java_signature (TREE_TYPE (mdecl));
5629 set_java_signature (TREE_TYPE (mdecl), signature);
5636 case JDEP_INTERFACE:
5637 if (parser_check_super_interface (decl, JDEP_DECL (dep),
5640 parser_add_interface (JDEP_DECL (dep), decl, JDEP_WFL (dep));
5645 type = TREE_TYPE(decl);
5646 if (TREE_CODE (type) == RECORD_TYPE)
5647 type = promote_type (type);
5648 JDEP_APPLY_PATCH (dep, type);
5652 JDEP_APPLY_PATCH (dep, TREE_TYPE (decl));
5653 SOURCE_FRONTEND_DEBUG
5654 (("Completing a random type dependency on a '%s' node",
5655 tree_code_name [TREE_CODE (JDEP_DECL (dep))]));
5658 case JDEP_EXCEPTION:
5659 JDEP_APPLY_PATCH (dep, TREE_TYPE (decl));
5660 SOURCE_FRONTEND_DEBUG
5661 (("Completing `%s' `throws' argument node",
5662 IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_WFL (dep)))));
5665 case JDEP_ANONYMOUS:
5666 patch_anonymous_class (decl, JDEP_DECL (dep), JDEP_WFL (dep));
5677 /* Resolve class CLASS_TYPE. Handle the case of trying to resolve an
5681 resolve_class (tree enclosing, tree class_type, tree decl, tree cl)
5683 tree tname = TYPE_NAME (class_type);
5684 tree resolved_type = TREE_TYPE (class_type);
5686 tree resolved_type_decl;
5688 if (resolved_type != NULL_TREE)
5690 tree resolved_type_decl = TYPE_NAME (resolved_type);
5691 if (resolved_type_decl == NULL_TREE
5692 || TREE_CODE (resolved_type_decl) == IDENTIFIER_NODE)
5694 resolved_type_decl = build_decl (TYPE_DECL,
5695 TYPE_NAME (class_type),
5698 return resolved_type_decl;
5701 /* 1- Check to see if we have an array. If true, find what we really
5703 if ((array_dims = build_type_name_from_array_name (tname,
5704 &TYPE_NAME (class_type))))
5705 WFL_STRIP_BRACKET (cl, cl);
5707 /* 2- Resolve the bare type */
5708 if (!(resolved_type_decl = do_resolve_class (enclosing, class_type,
5711 resolved_type = TREE_TYPE (resolved_type_decl);
5713 /* 3- If we have an array, reconstruct the array down to its nesting */
5716 for (; array_dims; array_dims--)
5717 resolved_type = build_java_array_type (resolved_type, -1);
5718 resolved_type_decl = TYPE_NAME (resolved_type);
5720 TREE_TYPE (class_type) = resolved_type;
5721 return resolved_type_decl;
5724 /* Effectively perform the resolution of class CLASS_TYPE. DECL or CL
5725 are used to report error messages; CL must either be NULL_TREE or a
5726 WFL wrapping a class. Do not try to replace TYPE_NAME (class_type)
5727 by a variable, since it is changed by find_in_imports{_on_demand}
5728 and (but it doesn't really matter) qualify_and_find. */
5731 do_resolve_class (tree enclosing, tree class_type, tree decl, tree cl)
5733 tree new_class_decl = NULL_TREE, super = NULL_TREE;
5734 tree saved_enclosing_type = enclosing ? TREE_TYPE (enclosing) : NULL_TREE;
5736 htab_t circularity_hash;
5738 if (QUALIFIED_P (TYPE_NAME (class_type)))
5740 /* If the type name is of the form `Q . Id', then Q is either a
5741 package name or a class name. First we try to find Q as a
5742 class and then treat Id as a member type. If we can't find Q
5743 as a class then we fall through. */
5744 tree q, left, left_type, right;
5745 if (split_qualified_name (&left, &right, TYPE_NAME (class_type)) == 0)
5747 BUILD_PTR_FROM_NAME (left_type, left);
5748 q = do_resolve_class (enclosing, left_type, decl, cl);
5752 saved_enclosing_type = TREE_TYPE (q);
5753 BUILD_PTR_FROM_NAME (class_type, right);
5760 /* This hash table is used to register the classes we're going
5761 through when searching the current class as an inner class, in
5762 order to detect circular references. Remember to free it before
5763 returning the section 0- of this function. */
5764 circularity_hash = htab_create (20, htab_hash_pointer, htab_eq_pointer,
5767 /* 0- Search in the current class as an inner class.
5768 Maybe some code here should be added to load the class or
5769 something, at least if the class isn't an inner class and ended
5770 being loaded from class file. FIXME. */
5773 new_class_decl = resolve_inner_class (circularity_hash, cl, &enclosing,
5774 &super, class_type);
5778 /* If we haven't found anything because SUPER reached Object and
5779 ENCLOSING happens to be an innerclass, try the enclosing context. */
5780 if ((!super || super == object_type_node) &&
5781 enclosing && INNER_CLASS_DECL_P (enclosing))
5782 enclosing = DECL_CONTEXT (enclosing);
5784 enclosing = NULL_TREE;
5787 htab_delete (circularity_hash);
5790 return new_class_decl;
5793 /* 1- Check for the type in single imports. This will change
5794 TYPE_NAME() if something relevant is found */
5795 find_in_imports (saved_enclosing_type, class_type);
5797 /* 2- And check for the type in the current compilation unit */
5798 if ((new_class_decl = IDENTIFIER_CLASS_VALUE (TYPE_NAME (class_type))))
5800 if (!CLASS_LOADED_P (TREE_TYPE (new_class_decl)))
5801 load_class (TYPE_NAME (class_type), 0);
5802 return IDENTIFIER_CLASS_VALUE (TYPE_NAME (class_type));
5805 /* 3- Search according to the current package definition */
5806 if (!QUALIFIED_P (TYPE_NAME (class_type)))
5808 if ((new_class_decl = qualify_and_find (class_type, ctxp->package,
5809 TYPE_NAME (class_type))))
5810 return new_class_decl;
5813 /* 4- Check the import on demands. Don't allow bar.baz to be
5814 imported from foo.* */
5815 if (!QUALIFIED_P (TYPE_NAME (class_type)))
5816 if (find_in_imports_on_demand (saved_enclosing_type, class_type))
5819 /* If found in find_in_imports_on_demand, the type has already been
5821 if ((new_class_decl = IDENTIFIER_CLASS_VALUE (TYPE_NAME (class_type))))
5822 return new_class_decl;
5824 /* 5- Try with a name qualified with the package name we've seen so far */
5825 if (!QUALIFIED_P (TYPE_NAME (class_type)))
5829 /* If there is a current package (ctxp->package), it's the first
5830 element of package_list and we can skip it. */
5831 for (package = (ctxp->package ?
5832 TREE_CHAIN (package_list) : package_list);
5833 package; package = TREE_CHAIN (package))
5834 if ((new_class_decl = qualify_and_find (class_type,
5835 TREE_PURPOSE (package),
5836 TYPE_NAME (class_type))))
5837 return new_class_decl;
5840 /* 5- Check another compilation unit that bears the name of type */
5841 load_class (TYPE_NAME (class_type), 0);
5844 cl = lookup_cl (decl);
5846 /* If we don't have a value for CL, then we're being called recursively.
5847 We can't check package access just yet, but it will be taken care of
5851 if (check_pkg_class_access (TYPE_NAME (class_type), cl, true, NULL_TREE))
5855 /* 6- Last call for a resolution */
5856 decl_result = IDENTIFIER_CLASS_VALUE (TYPE_NAME (class_type));
5858 /* The final lookup might have registered a.b.c into a.b$c If we
5859 failed at the first lookup, progressively change the name if
5860 applicable and use the matching DECL instead. */
5861 if (!decl_result && QUALIFIED_P (TYPE_NAME (class_type)))
5864 tree name = TYPE_NAME (class_type);
5865 char *namebuffer = alloca (IDENTIFIER_LENGTH (name) + 1);
5867 strcpy (namebuffer, IDENTIFIER_POINTER (name));
5871 /* Reach the last '.', and if applicable, replace it by a `$' and
5872 see if this exists as a type. */
5873 if ((separator = strrchr (namebuffer, '.')))
5876 name = get_identifier (namebuffer);
5877 decl_result = IDENTIFIER_CLASS_VALUE (name);
5879 } while (!decl_result && separator);
5885 qualify_and_find (tree class_type, tree package, tree name)
5887 tree new_qualified = merge_qualified_name (package, name);
5888 tree new_class_decl;
5890 if (!IDENTIFIER_CLASS_VALUE (new_qualified))
5891 load_class (new_qualified, 0);
5892 if ((new_class_decl = IDENTIFIER_CLASS_VALUE (new_qualified)))
5894 if (!CLASS_LOADED_P (TREE_TYPE (new_class_decl)))
5895 load_class (TREE_TYPE (new_class_decl), 0);
5896 TYPE_NAME (class_type) = new_qualified;
5897 return IDENTIFIER_CLASS_VALUE (new_qualified);
5902 /* Resolve NAME and lay it out (if not done and if not the current
5903 parsed class). Return a decl node. This function is meant to be
5904 called when type resolution is necessary during the walk pass. */
5907 resolve_and_layout (tree something, tree cl)
5909 tree decl, decl_type;
5911 /* Don't do that on the current class */
5912 if (something == current_class)
5913 return TYPE_NAME (current_class);
5915 /* Don't do anything for void and other primitive types */
5916 if (JPRIMITIVE_TYPE_P (something) || something == void_type_node)
5919 /* Pointer types can be reall pointer types or fake pointers. When
5920 finding a real pointer, recheck for primitive types */
5921 if (TREE_CODE (something) == POINTER_TYPE)
5923 if (TREE_TYPE (something))
5925 something = TREE_TYPE (something);
5926 if (JPRIMITIVE_TYPE_P (something) || something == void_type_node)
5930 something = TYPE_NAME (something);
5933 /* Don't do anything for arrays of primitive types */
5934 if (TREE_CODE (something) == RECORD_TYPE && TYPE_ARRAY_P (something)
5935 && JPRIMITIVE_TYPE_P (TYPE_ARRAY_ELEMENT (something)))
5938 /* Something might be a WFL */
5939 if (TREE_CODE (something) == EXPR_WITH_FILE_LOCATION)
5940 something = EXPR_WFL_NODE (something);
5942 /* Otherwise, if something is not and IDENTIFIER_NODE, it can be a a
5943 TYPE_DECL or a real TYPE */
5944 else if (TREE_CODE (something) != IDENTIFIER_NODE)
5945 something = (TREE_CODE (TYPE_NAME (something)) == TYPE_DECL ?
5946 DECL_NAME (TYPE_NAME (something)) : TYPE_NAME (something));
5948 if (!(decl = resolve_no_layout (something, cl)))
5951 /* Resolve and layout if necessary */
5952 decl_type = TREE_TYPE (decl);
5953 layout_class_methods (decl_type);
5955 if (CLASS_FROM_SOURCE_P (decl_type))
5956 java_check_methods (decl);
5957 /* Layout the type if necessary */
5958 if (decl_type != current_class && !CLASS_LOADED_P (decl_type))
5959 safe_layout_class (decl_type);
5964 /* Resolve a class, returns its decl but doesn't perform any
5965 layout. The current parsing context is saved and restored */
5968 resolve_no_layout (tree name, tree cl)
5971 BUILD_PTR_FROM_NAME (ptr, name);
5972 java_parser_context_save_global ();
5973 decl = resolve_class (TYPE_NAME (current_class), ptr, NULL_TREE, cl);
5974 java_parser_context_restore_global ();
5979 /* Called when reporting errors. Skip the '[]'s in a complex array
5980 type description that failed to be resolved. purify_type_name can't
5981 use an identifier tree. */
5984 purify_type_name (const char *name)
5986 int len = strlen (name);
5989 STRING_STRIP_BRACKETS (name, len, bracket_found);
5992 char *stripped_name = xmemdup (name, len, len+1);
5993 stripped_name [len] = '\0';
5994 return stripped_name;
5999 /* The type CURRENT refers to can't be found. We print error messages. */
6002 complete_class_report_errors (jdep *dep)
6006 if (!JDEP_WFL (dep))
6009 name = IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_WFL (dep)));
6010 switch (JDEP_KIND (dep))
6014 (JDEP_WFL (dep), "Superclass `%s' of class `%s' not found",
6015 purify_type_name (name),
6016 IDENTIFIER_POINTER (DECL_NAME (JDEP_DECL (dep))));
6020 (JDEP_WFL (dep), "Type `%s' not found in declaration of field `%s'",
6021 purify_type_name (name),
6022 IDENTIFIER_POINTER (DECL_NAME (JDEP_DECL (dep))));
6024 case JDEP_METHOD: /* Covers arguments */
6026 (JDEP_WFL (dep), "Type `%s' not found in the declaration of the argument `%s' of method `%s'",
6027 purify_type_name (name),
6028 IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_DECL_WFL (dep))),
6029 IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_MISC (dep))));
6031 case JDEP_METHOD_RETURN: /* Covers return type */
6033 (JDEP_WFL (dep), "Type `%s' not found in the declaration of the return type of method `%s'",
6034 purify_type_name (name),
6035 IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_DECL_WFL (dep))));
6037 case JDEP_INTERFACE:
6039 (JDEP_WFL (dep), "Superinterface `%s' of %s `%s' not found",
6040 IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_WFL (dep))),
6041 (CLASS_OR_INTERFACE (JDEP_DECL (dep), "class", "interface")),
6042 IDENTIFIER_POINTER (DECL_NAME (JDEP_DECL (dep))));
6046 (JDEP_WFL (dep), "Type `%s' not found in the declaration of the local variable `%s'",
6047 purify_type_name (IDENTIFIER_POINTER
6048 (EXPR_WFL_NODE (JDEP_WFL (dep)))),
6049 IDENTIFIER_POINTER (DECL_NAME (JDEP_DECL (dep))));
6051 case JDEP_EXCEPTION: /* As specified by `throws' */
6053 (JDEP_WFL (dep), "Class `%s' not found in `throws'",
6054 IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_WFL (dep))));
6057 /* Fix for -Wall. Just break doing nothing. The error will be
6063 /* Return a static string containing the DECL prototype string. If
6064 DECL is a constructor, use the class name instead of the form
6068 get_printable_method_name (tree decl)
6070 const char *to_return;
6071 tree name = NULL_TREE;
6073 if (DECL_CONSTRUCTOR_P (decl))
6075 name = DECL_NAME (decl);
6076 DECL_NAME (decl) = DECL_NAME (TYPE_NAME (DECL_CONTEXT (decl)));
6079 to_return = lang_printable_name (decl, 0);
6080 if (DECL_CONSTRUCTOR_P (decl))
6081 DECL_NAME (decl) = name;
6086 /* Track method being redefined inside the same class. As a side
6087 effect, set DECL_NAME to an IDENTIFIER (prior entering this
6088 function it's a FWL, so we can track errors more accurately.) */
6091 check_method_redefinition (tree class, tree method)
6095 /* There's no need to verify <clinit> and finit$ and instinit$ */
6096 if (DECL_CLINIT_P (method)
6097 || DECL_FINIT_P (method) || DECL_INSTINIT_P (method))
6100 sig = TYPE_ARGUMENT_SIGNATURE (TREE_TYPE (method));
6101 for (redef = TYPE_METHODS (class); redef; redef = TREE_CHAIN (redef))
6103 if (redef == method)
6105 if (DECL_NAME (redef) == DECL_NAME (method)
6106 && sig == TYPE_ARGUMENT_SIGNATURE (TREE_TYPE (redef))
6107 && !DECL_ARTIFICIAL (method))
6110 (DECL_FUNCTION_WFL (method), "Duplicate %s declaration `%s'",
6111 (DECL_CONSTRUCTOR_P (redef) ? "constructor" : "method"),
6112 get_printable_method_name (redef));
6119 /* Return 1 if check went ok, 0 otherwise. */
6121 check_abstract_method_definitions (int do_interface, tree class_decl,
6124 tree class = TREE_TYPE (class_decl);
6125 tree method, end_type;
6128 end_type = (do_interface ? object_type_node : type);
6129 for (method = TYPE_METHODS (type); method; method = TREE_CHAIN (method))
6131 tree other_super, other_method, method_sig, method_name;
6133 int end_type_reached = 0;
6135 if (!METHOD_ABSTRACT (method) || METHOD_FINAL (method))
6138 /* Now verify that somewhere in between TYPE and CLASS,
6139 abstract method METHOD gets a non abstract definition
6140 that is inherited by CLASS. */
6142 method_sig = build_java_signature (TREE_TYPE (method));
6143 method_name = DECL_NAME (method);
6144 if (TREE_CODE (method_name) == EXPR_WITH_FILE_LOCATION)
6145 method_name = EXPR_WFL_NODE (method_name);
6147 other_super = class;
6149 if (other_super == end_type)
6150 end_type_reached = 1;
6153 for (other_method = TYPE_METHODS (other_super); other_method;
6154 other_method = TREE_CHAIN (other_method))
6156 tree s = build_java_signature (TREE_TYPE (other_method));
6157 tree other_name = DECL_NAME (other_method);
6159 if (TREE_CODE (other_name) == EXPR_WITH_FILE_LOCATION)
6160 other_name = EXPR_WFL_NODE (other_name);
6161 if (!DECL_CLINIT_P (other_method)
6162 && !DECL_CONSTRUCTOR_P (other_method)
6163 && method_name == other_name
6165 && !METHOD_ABSTRACT (other_method))
6171 other_super = CLASSTYPE_SUPER (other_super);
6172 } while (!end_type_reached);
6174 /* Report that abstract METHOD didn't find an implementation
6175 that CLASS can use. */
6178 char *t = xstrdup (lang_printable_name
6179 (TREE_TYPE (TREE_TYPE (method)), 0));
6180 tree ccn = DECL_NAME (TYPE_NAME (DECL_CONTEXT (method)));
6183 (lookup_cl (class_decl),
6184 "Class `%s' doesn't define the abstract method `%s %s' from %s `%s'. This method must be defined or %s `%s' must be declared abstract",
6185 IDENTIFIER_POINTER (DECL_NAME (class_decl)),
6186 t, lang_printable_name (method, 0),
6187 (CLASS_INTERFACE (TYPE_NAME (DECL_CONTEXT (method))) ?
6188 "interface" : "class"),
6189 IDENTIFIER_POINTER (ccn),
6190 (CLASS_INTERFACE (class_decl) ? "interface" : "class"),
6191 IDENTIFIER_POINTER (DECL_NAME (class_decl)));
6197 if (ok && do_interface)
6199 /* Check for implemented interfaces. */
6201 tree vector = BINFO_BASE_BINFOS (TYPE_BINFO (type));
6202 for (i = 1; ok && vector && i < TREE_VEC_LENGTH (vector); i++)
6204 tree super = BINFO_TYPE (TREE_VEC_ELT (vector, i));
6205 ok = check_abstract_method_definitions (1, class_decl, super);
6212 /* Check that CLASS_DECL somehow implements all inherited abstract
6216 java_check_abstract_method_definitions (tree class_decl)
6218 tree class = TREE_TYPE (class_decl);
6222 if (CLASS_ABSTRACT (class_decl))
6225 /* Check for inherited types */
6228 super = CLASSTYPE_SUPER (super);
6229 check_abstract_method_definitions (0, class_decl, super);
6230 } while (super != object_type_node);
6232 /* Check for implemented interfaces. */
6233 vector = BINFO_BASE_BINFOS (TYPE_BINFO (class));
6234 for (i = 1; i < TREE_VEC_LENGTH (vector); i++)
6236 super = BINFO_TYPE (TREE_VEC_ELT (vector, i));
6237 check_abstract_method_definitions (1, class_decl, super);
6241 /* Check all the types method DECL uses and return 1 if all of them
6242 are now complete, 0 otherwise. This is used to check whether its
6243 safe to build a method signature or not. */
6246 check_method_types_complete (tree decl)
6248 tree type = TREE_TYPE (decl);
6251 if (!INCOMPLETE_TYPE_P (TREE_TYPE (type)))
6254 args = TYPE_ARG_TYPES (type);
6255 if (TREE_CODE (type) == METHOD_TYPE)
6256 args = TREE_CHAIN (args);
6257 for (; args != end_params_node; args = TREE_CHAIN (args))
6258 if (INCOMPLETE_TYPE_P (TREE_VALUE (args)))
6264 /* Visible interface to check methods contained in CLASS_DECL */
6267 java_check_methods (tree class_decl)
6269 if (CLASS_METHOD_CHECKED_P (TREE_TYPE (class_decl)))
6272 if (CLASS_INTERFACE (class_decl))
6273 java_check_abstract_methods (class_decl);
6275 java_check_regular_methods (class_decl);
6277 CLASS_METHOD_CHECKED_P (TREE_TYPE (class_decl)) = 1;
6280 /* Like not_accessible_p, but doesn't refer to the current class at
6283 hack_is_accessible_p (tree member, tree from_where)
6285 int flags = get_access_flags_from_decl (member);
6287 if (from_where == DECL_CONTEXT (member)
6288 || (flags & ACC_PUBLIC))
6291 if ((flags & ACC_PROTECTED))
6293 if (inherits_from_p (from_where, DECL_CONTEXT (member)))
6297 if ((flags & ACC_PRIVATE))
6300 /* Package private, or protected. */
6301 return in_same_package (TYPE_NAME (from_where),
6302 TYPE_NAME (DECL_CONTEXT (member)));
6305 /* Check all the methods of CLASS_DECL. Methods are first completed
6306 then checked according to regular method existence rules. If no
6307 constructor for CLASS_DECL were encountered, then build its
6310 java_check_regular_methods (tree class_decl)
6312 int saw_constructor = ANONYMOUS_CLASS_P (TREE_TYPE (class_decl));
6314 tree class = TREE_TYPE (class_decl);
6315 tree found = NULL_TREE;
6318 /* It is not necessary to check methods defined in java.lang.Object */
6319 if (class == object_type_node)
6322 if (!TYPE_NVIRTUALS (class))
6323 TYPE_METHODS (class) = nreverse (TYPE_METHODS (class));
6325 /* Should take interfaces into account. FIXME */
6326 for (method = TYPE_METHODS (class); method; method = TREE_CHAIN (method))
6329 tree method_wfl = DECL_FUNCTION_WFL (method);
6332 /* Check for redefinitions */
6333 if (check_method_redefinition (class, method))
6336 /* We verify things thrown by the method. They must inherit from
6337 java.lang.Throwable. */
6338 for (mthrows = DECL_FUNCTION_THROWS (method);
6339 mthrows; mthrows = TREE_CHAIN (mthrows))
6341 if (!inherits_from_p (TREE_VALUE (mthrows), throwable_type_node))
6343 (TREE_PURPOSE (mthrows), "Class `%s' in `throws' clause must be a subclass of class `java.lang.Throwable'",
6345 (DECL_NAME (TYPE_NAME (TREE_VALUE (mthrows)))));
6348 /* If we see one constructor a mark so we don't generate the
6349 default one. Also skip other verifications: constructors
6350 can't be inherited hence hidden or overridden. */
6351 if (DECL_CONSTRUCTOR_P (method))
6353 saw_constructor = 1;
6357 sig = build_java_argument_signature (TREE_TYPE (method));
6358 found = lookup_argument_method_generic (class, DECL_NAME (method), sig,
6359 SEARCH_SUPER | SEARCH_INTERFACE);
6361 /* Inner class can't declare static methods */
6362 if (METHOD_STATIC (method) && !TOPLEVEL_CLASS_DECL_P (class_decl))
6364 char *t = xstrdup (lang_printable_name (class, 0));
6366 (method_wfl, "Method `%s' can't be static in inner class `%s'. Only members of interfaces and top-level classes can be static",
6367 lang_printable_name (method, 0), t);
6371 /* Nothing overrides or it's a private method. */
6374 if (METHOD_PRIVATE (found))
6380 /* If `found' is declared in an interface, make sure the
6381 modifier matches. */
6382 if (CLASS_INTERFACE (TYPE_NAME (DECL_CONTEXT (found)))
6383 && clinit_identifier_node != DECL_NAME (found)
6384 && !METHOD_PUBLIC (method))
6386 tree found_decl = TYPE_NAME (DECL_CONTEXT (found));
6387 parse_error_context (method_wfl, "Class `%s' must override `%s' with a public method in order to implement interface `%s'",
6388 IDENTIFIER_POINTER (DECL_NAME (class_decl)),
6389 lang_printable_name (method, 0),
6390 IDENTIFIER_POINTER (DECL_NAME (found_decl)));
6393 /* Can't override a method with the same name and different return
6395 if (TREE_TYPE (TREE_TYPE (found)) != TREE_TYPE (TREE_TYPE (method)))
6398 (lang_printable_name (TREE_TYPE (TREE_TYPE (found)), 0));
6401 "Method `%s' was defined with return type `%s' in class `%s'",
6402 lang_printable_name (found, 0), t,
6404 (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found)))));
6408 aflags = get_access_flags_from_decl (found);
6410 /* Can't override final. Can't override static. */
6411 if (METHOD_FINAL (found) || METHOD_STATIC (found))
6413 /* Static *can* override static */
6414 if (METHOD_STATIC (found) && METHOD_STATIC (method))
6418 "%s methods can't be overridden. Method `%s' is %s in class `%s'",
6419 (METHOD_FINAL (found) ? "Final" : "Static"),
6420 lang_printable_name (found, 0),
6421 (METHOD_FINAL (found) ? "final" : "static"),
6423 (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found)))));
6427 /* Static method can't override instance method. */
6428 if (METHOD_STATIC (method))
6432 "Instance methods can't be overridden by a static method. Method `%s' is an instance method in class `%s'",
6433 lang_printable_name (found, 0),
6435 (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found)))));
6439 /* - Overriding/hiding public must be public
6440 - Overriding/hiding protected must be protected or public
6441 - If the overridden or hidden method has default (package)
6442 access, then the overriding or hiding method must not be
6443 private; otherwise, a compile-time error occurs. If
6444 `found' belongs to an interface, things have been already
6446 if (!CLASS_INTERFACE (TYPE_NAME (DECL_CONTEXT (found)))
6447 && ((METHOD_PUBLIC (found) && !METHOD_PUBLIC (method))
6448 || (METHOD_PROTECTED (found)
6449 && !(METHOD_PUBLIC (method) || METHOD_PROTECTED (method)))
6450 || (!(aflags & (ACC_PUBLIC | ACC_PRIVATE | ACC_STATIC))
6451 && METHOD_PRIVATE (method))))
6455 "Methods can't be overridden to be more private. Method `%s' is not %s in class `%s'", lang_printable_name (method, 0),
6456 (METHOD_PUBLIC (method) ? "public" :
6457 (METHOD_PRIVATE (method) ? "private" : "protected")),
6458 IDENTIFIER_POINTER (DECL_NAME
6459 (TYPE_NAME (DECL_CONTEXT (found)))));
6463 /* Check this method against all the other implementations it
6464 overrides. Here we only check the class hierarchy; the rest
6465 of the checking is done later. If this method is just a
6466 Miranda method, we can skip the check. */
6467 if (! METHOD_INVISIBLE (method))
6468 check_concrete_throws_clauses (class, method, DECL_NAME (method), sig);
6471 /* The above throws clause check only looked at superclasses. Now
6472 we must also make sure that all methods declared in interfaces
6473 have compatible throws clauses. FIXME: there are more efficient
6474 ways to organize this checking; we should implement one. */
6475 check_interface_throws_clauses (class, class);
6477 if (!TYPE_NVIRTUALS (class))
6478 TYPE_METHODS (class) = nreverse (TYPE_METHODS (class));
6480 /* Search for inherited abstract method not yet implemented in this
6482 java_check_abstract_method_definitions (class_decl);
6484 if (!saw_constructor)
6488 /* Check to make sure that all the methods in all the interfaces
6489 implemented by CLASS_DECL are compatible with the concrete
6490 implementations available in CHECK_CLASS_DECL. */
6492 check_interface_throws_clauses (tree check_class_decl, tree class_decl)
6494 for (; class_decl != NULL_TREE; class_decl = CLASSTYPE_SUPER (class_decl))
6500 if (! CLASS_LOADED_P (class_decl))
6502 if (CLASS_FROM_SOURCE_P (class_decl))
6503 safe_layout_class (class_decl);
6505 load_class (class_decl, 1);
6508 bases = BINFO_BASE_BINFOS (TYPE_BINFO (class_decl));
6509 iface_len = TREE_VEC_LENGTH (bases) - 1;
6510 for (i = iface_len; i > 0; --i)
6512 tree interface = BINFO_TYPE (TREE_VEC_ELT (bases, i));
6515 for (iface_method = TYPE_METHODS (interface);
6516 iface_method != NULL_TREE;
6517 iface_method = TREE_CHAIN (iface_method))
6521 /* First look for a concrete method implemented or
6522 inherited by this class. No need to search
6523 interfaces here, since we're already looking through
6525 sig = build_java_argument_signature (TREE_TYPE (iface_method));
6527 = lookup_argument_method_generic (check_class_decl,
6528 DECL_NAME (iface_method),
6529 sig, SEARCH_VISIBLE);
6530 /* If we don't find an implementation, that is ok. Any
6531 potential errors from that are diagnosed elsewhere.
6532 Also, multiple inheritance with conflicting throws
6533 clauses is fine in the absence of a concrete
6535 if (method != NULL_TREE && !METHOD_ABSTRACT (method)
6536 && !METHOD_INVISIBLE (iface_method))
6538 tree method_wfl = DECL_FUNCTION_WFL (method);
6539 check_throws_clauses (method, method_wfl, iface_method);
6543 /* Now check superinterfaces. */
6544 check_interface_throws_clauses (check_class_decl, interface);
6549 /* Check throws clauses of a method against the clauses of all the
6550 methods it overrides. We do this by searching up the class
6551 hierarchy, examining all matching accessible methods. */
6553 check_concrete_throws_clauses (tree class, tree self_method,
6554 tree name, tree signature)
6556 tree method = lookup_argument_method_generic (class, name, signature,
6557 SEARCH_SUPER | SEARCH_VISIBLE);
6558 while (method != NULL_TREE)
6560 if (! METHOD_INVISIBLE (method) && hack_is_accessible_p (method, class))
6561 check_throws_clauses (self_method, DECL_FUNCTION_WFL (self_method),
6564 method = lookup_argument_method_generic (DECL_CONTEXT (method),
6566 SEARCH_SUPER | SEARCH_VISIBLE);
6570 /* Generate an error if the `throws' clause of METHOD (if any) is
6571 incompatible with the `throws' clause of FOUND (if any). */
6573 check_throws_clauses (tree method, tree method_wfl, tree found)
6577 /* Can't check these things with class loaded from bytecode. FIXME */
6578 if (!CLASS_FROM_SOURCE_P (DECL_CONTEXT (found)))
6581 for (mthrows = DECL_FUNCTION_THROWS (method);
6582 mthrows; mthrows = TREE_CHAIN (mthrows))
6586 /* We don't verify unchecked expressions */
6587 if (IS_UNCHECKED_EXCEPTION_P (TREE_VALUE (mthrows)))
6589 /* Checked expression must be compatible */
6590 for (fthrows = DECL_FUNCTION_THROWS (found);
6591 fthrows; fthrows = TREE_CHAIN (fthrows))
6593 if (inherits_from_p (TREE_VALUE (mthrows), TREE_VALUE (fthrows)))
6599 (method_wfl, "Invalid checked exception class `%s' in `throws' clause. The exception must be a subclass of an exception thrown by `%s' from class `%s'",
6600 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (TREE_VALUE (mthrows)))),
6601 lang_printable_name (found, 0),
6603 (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found)))));
6608 /* Check abstract method of interface INTERFACE */
6610 java_check_abstract_methods (tree interface_decl)
6613 tree method, basetype_vec, found;
6614 tree interface = TREE_TYPE (interface_decl);
6616 for (method = TYPE_METHODS (interface); method; method = TREE_CHAIN (method))
6618 /* 2- Check for double definition inside the defining interface */
6619 if (check_method_redefinition (interface, method))
6622 /* 3- Overriding is OK as far as we preserve the return type. */
6623 found = lookup_java_interface_method2 (interface, method);
6627 t = xstrdup (lang_printable_name (TREE_TYPE (TREE_TYPE (found)), 0));
6629 (DECL_FUNCTION_WFL (found),
6630 "Method `%s' was defined with return type `%s' in class `%s'",
6631 lang_printable_name (found, 0), t,
6633 (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found)))));
6639 /* 4- Inherited methods can't differ by their returned types */
6640 if (!(basetype_vec = BINFO_BASE_BINFOS (TYPE_BINFO (interface))))
6642 n = TREE_VEC_LENGTH (basetype_vec);
6643 for (i = 0; i < n; i++)
6645 tree sub_interface_method, sub_interface;
6646 tree vec_elt = TREE_VEC_ELT (basetype_vec, i);
6649 sub_interface = BINFO_TYPE (vec_elt);
6650 for (sub_interface_method = TYPE_METHODS (sub_interface);
6651 sub_interface_method;
6652 sub_interface_method = TREE_CHAIN (sub_interface_method))
6654 found = lookup_java_interface_method2 (interface,
6655 sub_interface_method);
6656 if (found && (found != sub_interface_method))
6659 (lookup_cl (sub_interface_method),
6660 "Interface `%s' inherits method `%s' from interface `%s'. This method is redefined with a different return type in interface `%s'",
6661 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (interface))),
6662 lang_printable_name (found, 0),
6664 (DECL_NAME (TYPE_NAME
6665 (DECL_CONTEXT (sub_interface_method)))),
6667 (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found)))));
6673 /* Lookup methods in interfaces using their name and partial
6674 signature. Return a matching method only if their types differ. */
6677 lookup_java_interface_method2 (tree class, tree method_decl)
6680 tree basetype_vec = BINFO_BASE_BINFOS (TYPE_BINFO (class));
6686 n = TREE_VEC_LENGTH (basetype_vec);
6687 for (i = 0; i < n; i++)
6689 tree vec_elt = TREE_VEC_ELT (basetype_vec, i), to_return;
6690 if ((BINFO_TYPE (vec_elt) != object_type_node)
6692 lookup_java_method2 (BINFO_TYPE (vec_elt), method_decl, 1)))
6695 for (i = 0; i < n; i++)
6697 to_return = lookup_java_interface_method2
6698 (BINFO_TYPE (TREE_VEC_ELT (basetype_vec, i)), method_decl);
6706 /* Lookup method using their name and partial signature. Return a
6707 matching method only if their types differ. */
6710 lookup_java_method2 (tree clas, tree method_decl, int do_interface)
6712 tree method, method_signature, method_name, method_type, name;
6714 method_signature = build_java_argument_signature (TREE_TYPE (method_decl));
6715 name = DECL_NAME (method_decl);
6716 method_name = (TREE_CODE (name) == EXPR_WITH_FILE_LOCATION ?
6717 EXPR_WFL_NODE (name) : name);
6718 method_type = TREE_TYPE (TREE_TYPE (method_decl));
6720 while (clas != NULL_TREE)
6722 for (method = TYPE_METHODS (clas);
6723 method != NULL_TREE; method = TREE_CHAIN (method))
6725 tree method_sig = build_java_argument_signature (TREE_TYPE (method));
6726 tree name = DECL_NAME (method);
6727 if ((TREE_CODE (name) == EXPR_WITH_FILE_LOCATION ?
6728 EXPR_WFL_NODE (name) : name) == method_name
6729 && method_sig == method_signature
6730 && TREE_TYPE (TREE_TYPE (method)) != method_type)
6733 clas = (do_interface ? NULL_TREE : CLASSTYPE_SUPER (clas));
6738 /* Return the line that matches DECL line number, and try its best to
6739 position the column number. Used during error reports. */
6741 static GTY(()) tree cl_v;
6743 lookup_cl (tree decl)
6750 if (cl_v == NULL_TREE)
6752 cl_v = build_expr_wfl (NULL_TREE, NULL, 0, 0);
6755 EXPR_WFL_FILENAME_NODE (cl_v) = get_identifier (DECL_SOURCE_FILE (decl));
6756 EXPR_WFL_SET_LINECOL (cl_v, DECL_SOURCE_LINE (decl), -1);
6758 line = java_get_line_col (EXPR_WFL_FILENAME (cl_v),
6759 EXPR_WFL_LINENO (cl_v), EXPR_WFL_COLNO (cl_v));
6761 found = strstr ((const char *)line,
6762 (const char *)IDENTIFIER_POINTER (DECL_NAME (decl)));
6764 EXPR_WFL_SET_LINECOL (cl_v, EXPR_WFL_LINENO (cl_v), found - line);
6769 /* Look for a simple name in the single-type import list */
6772 find_name_in_single_imports (tree name)
6776 for (node = ctxp->import_list; node; node = TREE_CHAIN (node))
6777 if (TREE_VALUE (node) == name)
6778 return (EXPR_WFL_NODE (TREE_PURPOSE (node)));
6783 /* Process all single-type import. */
6786 process_imports (void)
6791 for (import = ctxp->import_list; import; import = TREE_CHAIN (import))
6793 tree to_be_found = EXPR_WFL_NODE (TREE_PURPOSE (import));
6794 char *original_name;
6796 original_name = xmemdup (IDENTIFIER_POINTER (to_be_found),
6797 IDENTIFIER_LENGTH (to_be_found),
6798 IDENTIFIER_LENGTH (to_be_found) + 1);
6800 /* Don't load twice something already defined. */
6801 if (IDENTIFIER_CLASS_VALUE (to_be_found))
6808 QUALIFIED_P (to_be_found) = 1;
6809 load_class (to_be_found, 0);
6811 check_pkg_class_access (to_be_found, TREE_PURPOSE (import), true, NULL_TREE);
6813 /* We found it, we can bail out */
6814 if (IDENTIFIER_CLASS_VALUE (to_be_found))
6816 check_deprecation (TREE_PURPOSE (import),
6817 IDENTIFIER_CLASS_VALUE (to_be_found));
6821 /* We haven't found it. Maybe we're trying to access an
6822 inner class. The only way for us to know is to try again
6823 after having dropped a qualifier. If we can't break it further,
6824 we have an error. */
6825 if (split_qualified_name (&left, NULL, to_be_found))
6830 if (!IDENTIFIER_CLASS_VALUE (to_be_found))
6832 parse_error_context (TREE_PURPOSE (import),
6833 "Class or interface `%s' not found in import",
6838 free (original_name);
6845 /* Possibly find and mark a class imported by a single-type import
6849 find_in_imports (tree enclosing_type, tree class_type)
6851 tree import = (enclosing_type ? TYPE_IMPORT_LIST (enclosing_type) :
6855 if (TREE_VALUE (import) == TYPE_NAME (class_type))
6857 TYPE_NAME (class_type) = EXPR_WFL_NODE (TREE_PURPOSE (import));
6858 QUALIFIED_P (TYPE_NAME (class_type)) = 1;
6861 import = TREE_CHAIN (import);
6866 note_possible_classname (const char *name, int len)
6869 if (len > 5 && strncmp (&name [len-5], ".java", 5) == 0)
6871 else if (len > 6 && strncmp (&name [len-6], ".class", 6) == 0)
6875 node = ident_subst (name, len, "", '/', '.', "");
6876 IS_A_CLASSFILE_NAME (node) = 1; /* Or soon to be */
6877 QUALIFIED_P (node) = strchr (name, '/') ? 1 : 0;
6881 /* Read a import directory, gathering potential match for further type
6882 references. Indifferently reads a filesystem or a ZIP archive
6886 read_import_dir (tree wfl)
6888 tree package_id = EXPR_WFL_NODE (wfl);
6889 const char *package_name = IDENTIFIER_POINTER (package_id);
6890 int package_length = IDENTIFIER_LENGTH (package_id);
6892 JCF *saved_jcf = current_jcf;
6897 struct buffer filename[1];
6899 if (IS_AN_IMPORT_ON_DEMAND_P (package_id))
6901 IS_AN_IMPORT_ON_DEMAND_P (package_id) = 1;
6903 BUFFER_INIT (filename);
6904 buffer_grow (filename, package_length + 100);
6906 for (entry = jcf_path_start (); entry != NULL; entry = jcf_path_next (entry))
6908 const char *entry_name = jcf_path_name (entry);
6909 int entry_length = strlen (entry_name);
6910 if (jcf_path_is_zipfile (entry))
6913 buffer_grow (filename, entry_length);
6914 memcpy (filename->data, entry_name, entry_length - 1);
6915 filename->data[entry_length-1] = '\0';
6916 zipf = opendir_in_zip (filename->data, jcf_path_is_system (entry));
6918 error ("malformed .zip archive in CLASSPATH: %s", entry_name);
6921 ZipDirectory *zipd = (ZipDirectory *) zipf->central_directory;
6922 BUFFER_RESET (filename);
6923 for (k = 0; k < package_length; k++)
6925 char ch = package_name[k];
6926 *filename->ptr++ = ch == '.' ? '/' : ch;
6928 *filename->ptr++ = '/';
6930 for (k = 0; k < zipf->count; k++, zipd = ZIPDIR_NEXT (zipd))
6932 const char *current_entry = ZIPDIR_FILENAME (zipd);
6933 int current_entry_len = zipd->filename_length;
6935 if (current_entry_len >= BUFFER_LENGTH (filename)
6936 && strncmp (filename->data, current_entry,
6937 BUFFER_LENGTH (filename)) != 0)
6939 found |= note_possible_classname (current_entry,
6946 BUFFER_RESET (filename);
6947 buffer_grow (filename, entry_length + package_length + 4);
6948 strcpy (filename->data, entry_name);
6949 filename->ptr = filename->data + entry_length;
6950 for (k = 0; k < package_length; k++)
6952 char ch = package_name[k];
6953 *filename->ptr++ = ch == '.' ? '/' : ch;
6955 *filename->ptr = '\0';
6957 dirp = opendir (filename->data);
6960 *filename->ptr++ = '/';
6965 struct dirent *direntp = readdir (dirp);
6968 d_name = direntp->d_name;
6969 len = strlen (direntp->d_name);
6970 buffer_grow (filename, len+1);
6971 strcpy (filename->ptr, d_name);
6972 found |= note_possible_classname (filename->data + entry_length,
6973 package_length+len+1);
6980 free (filename->data);
6982 /* Here we should have a unified way of retrieving an entry, to be
6986 static int first = 1;
6989 error ("Can't find default package `%s'. Check the CLASSPATH environment variable and the access to the archives", package_name);
6994 parse_error_context (wfl, "Package `%s' not found in import",
6996 current_jcf = saved_jcf;
6999 current_jcf = saved_jcf;
7002 /* Possibly find a type in the import on demands specified
7003 types. Returns 1 if an error occurred, 0 otherwise. Run through the
7004 entire list, to detected potential double definitions. */
7007 find_in_imports_on_demand (tree enclosing_type, tree class_type)
7009 tree class_type_name = TYPE_NAME (class_type);
7010 tree import = (enclosing_type ? TYPE_IMPORT_DEMAND_LIST (enclosing_type) :
7011 ctxp->import_demand_list);
7012 tree cl = NULL_TREE;
7013 int seen_once = -1; /* -1 when not set, 1 if seen once, >1 otherwise. */
7014 int to_return = -1; /* -1 when not set, 0 or 1 otherwise */
7017 for (; import; import = TREE_CHAIN (import))
7019 int saved_lineno = input_line;
7021 const char *id_name;
7022 tree decl, type_name_copy;
7024 obstack_grow (&temporary_obstack,
7025 IDENTIFIER_POINTER (EXPR_WFL_NODE (TREE_PURPOSE (import))),
7026 IDENTIFIER_LENGTH (EXPR_WFL_NODE (TREE_PURPOSE (import))));
7027 obstack_1grow (&temporary_obstack, '.');
7028 obstack_grow0 (&temporary_obstack,
7029 IDENTIFIER_POINTER (class_type_name),
7030 IDENTIFIER_LENGTH (class_type_name));
7031 id_name = obstack_finish (&temporary_obstack);
7033 if (! (node = maybe_get_identifier (id_name)))
7036 /* Setup input_line so that it refers to the line of the import (in
7037 case we parse a class file and encounter errors */
7038 input_line = EXPR_WFL_LINENO (TREE_PURPOSE (import));
7040 type_name_copy = TYPE_NAME (class_type);
7041 TYPE_NAME (class_type) = node;
7042 QUALIFIED_P (node) = 1;
7043 decl = IDENTIFIER_CLASS_VALUE (node);
7045 /* If there is no DECL set for the class or if the class isn't
7046 loaded and not seen in source yet, then load */
7047 if (!decl || ! CLASS_LOADED_P (TREE_TYPE (decl)))
7049 load_class (node, 0);
7050 decl = IDENTIFIER_CLASS_VALUE (node);
7052 if (decl && ! INNER_CLASS_P (TREE_TYPE (decl)))
7053 access_check = check_pkg_class_access (node, TREE_PURPOSE (import),
7056 /* 6.6.1: Inner classes are subject to member access rules. */
7059 input_line = saved_lineno;
7061 /* If the loaded class is not accessible or couldn't be loaded,
7062 we restore the original TYPE_NAME and process the next
7064 if (access_check || !decl)
7066 TYPE_NAME (class_type) = type_name_copy;
7070 /* If the loaded class is accessible, we keep a tab on it to
7071 detect and report multiple inclusions. */
7072 if (IS_A_CLASSFILE_NAME (node))
7076 cl = TREE_PURPOSE (import);
7079 else if (seen_once >= 0)
7081 tree location = (cl ? cl : TREE_PURPOSE (import));
7082 tree package = (cl ? EXPR_WFL_NODE (cl) :
7083 EXPR_WFL_NODE (TREE_PURPOSE (import)));
7087 "Type `%s' also potentially defined in package `%s'",
7088 IDENTIFIER_POINTER (TYPE_NAME (class_type)),
7089 IDENTIFIER_POINTER (package));
7092 to_return = access_check;
7098 return (seen_once < 0 ? 0 : seen_once); /* It's ok not to have found */
7101 /* Add package NAME to the list of packages encountered so far. To
7102 speed up class lookup in do_resolve_class, we make sure a
7103 particular package is added only once. */
7106 register_package (tree name)
7112 pht = htab_create (50, htab_hash_pointer, htab_eq_pointer, NULL);
7114 e = htab_find_slot (pht, name, INSERT);
7117 package_list = chainon (package_list, build_tree_list (name, NULL));
7123 resolve_package (tree pkg, tree *next, tree *type_name)
7126 tree decl = NULL_TREE;
7127 *type_name = NULL_TREE;
7129 /* The trick is to determine when the package name stops and were
7130 the name of something contained in the package starts. Then we
7131 return a fully qualified name of what we want to get. */
7133 *next = EXPR_WFL_QUALIFICATION (pkg);
7135 /* Try to progressively construct a type name */
7136 if (TREE_CODE (pkg) == EXPR_WITH_FILE_LOCATION)
7137 for (current = EXPR_WFL_QUALIFICATION (pkg);
7138 current; current = TREE_CHAIN (current))
7140 /* If we don't have what we're expecting, exit now. TYPE_NAME
7141 will be null and the error caught later. */
7142 if (TREE_CODE (QUAL_WFL (current)) != EXPR_WITH_FILE_LOCATION)
7145 merge_qualified_name (*type_name, EXPR_WFL_NODE (QUAL_WFL (current)));
7146 if ((decl = resolve_no_layout (*type_name, NULL_TREE)))
7148 /* resolve_package should be used in a loop, hence we
7149 point at this one to naturally process the next one at
7150 the next iteration. */
7159 /* Check accessibility of inner classes according to member access rules.
7160 DECL is the inner class, ENCLOSING_DECL is the class from which the
7161 access is being attempted. */
7164 check_inner_class_access (tree decl, tree enclosing_decl, tree cl)
7167 tree enclosing_decl_type;
7169 /* We don't issue an error message when CL is null. CL can be null
7170 as a result of processing a JDEP crafted by source_start_java_method
7171 for the purpose of patching its parm decl. But the error would
7172 have been already trapped when fixing the method's signature.
7173 DECL can also be NULL in case of earlier errors. */
7177 enclosing_decl_type = TREE_TYPE (enclosing_decl);
7179 if (CLASS_PRIVATE (decl))
7181 /* Access is permitted only within the body of the top-level
7182 class in which DECL is declared. */
7183 tree top_level = decl;
7184 while (DECL_CONTEXT (top_level))
7185 top_level = DECL_CONTEXT (top_level);
7186 while (DECL_CONTEXT (enclosing_decl))
7187 enclosing_decl = DECL_CONTEXT (enclosing_decl);
7188 if (top_level == enclosing_decl)
7192 else if (CLASS_PROTECTED (decl))
7195 /* Access is permitted from within the same package... */
7196 if (in_same_package (decl, enclosing_decl))
7199 /* ... or from within the body of a subtype of the context in which
7200 DECL is declared. */
7201 decl_context = DECL_CONTEXT (decl);
7202 while (enclosing_decl)
7204 if (CLASS_INTERFACE (decl))
7206 if (interface_of_p (TREE_TYPE (decl_context),
7207 enclosing_decl_type))
7212 /* Eww. The order of the arguments is different!! */
7213 if (inherits_from_p (enclosing_decl_type,
7214 TREE_TYPE (decl_context)))
7217 enclosing_decl = DECL_CONTEXT (enclosing_decl);
7219 access = "protected";
7221 else if (! CLASS_PUBLIC (decl))
7223 /* Access is permitted only from within the same package as DECL. */
7224 if (in_same_package (decl, enclosing_decl))
7226 access = "non-public";
7229 /* Class is public. */
7232 parse_error_context (cl, "Nested %s %s is %s; cannot be accessed from here",
7233 (CLASS_INTERFACE (decl) ? "interface" : "class"),
7234 lang_printable_name (decl, 0), access);
7237 /* Accessibility check for top-level classes. If CLASS_NAME is in a
7238 foreign package, it must be PUBLIC. Return 0 if no access
7239 violations were found, 1 otherwise. If VERBOSE is true and an error
7240 was found, it is reported and accounted for. If CL is NULL then
7241 look it up with THIS_DECL. */
7244 check_pkg_class_access (tree class_name, tree cl, bool verbose, tree this_decl)
7248 if (!IDENTIFIER_CLASS_VALUE (class_name))
7251 if (!(type = TREE_TYPE (IDENTIFIER_CLASS_VALUE (class_name))))
7254 if (!CLASS_PUBLIC (TYPE_NAME (type)))
7256 /* Access to a private class within the same package is
7259 split_qualified_name (&l, &r, class_name);
7260 if (!QUALIFIED_P (class_name) && !ctxp->package)
7261 /* Both in the empty package. */
7263 if (l == ctxp->package)
7264 /* Both in the same package. */
7269 (cl == NULL ? lookup_cl (this_decl): cl,
7270 "Can't access %s `%s'. Only public classes and interfaces in other packages can be accessed",
7271 (CLASS_INTERFACE (TYPE_NAME (type)) ? "interface" : "class"),
7272 IDENTIFIER_POINTER (class_name));
7278 /* Local variable declaration. */
7281 declare_local_variables (int modifier, tree type, tree vlist)
7283 tree decl, current, saved_type;
7284 tree type_wfl = NULL_TREE;
7288 /* Push a new block if statements were seen between the last time we
7289 pushed a block and now. Keep a count of blocks to close */
7290 if (BLOCK_EXPR_BODY (GET_CURRENT_BLOCK (current_function_decl)))
7292 tree b = enter_block ();
7293 BLOCK_IS_IMPLICIT (b) = 1;
7299 for (i = 0; i < ARRAY_SIZE (ctxp->modifier_ctx); i++)
7300 if (1 << i & modifier)
7302 if (modifier == ACC_FINAL)
7307 (ctxp->modifier_ctx [i],
7308 "Only `final' is allowed as a local variables modifier");
7313 /* Obtain an incomplete type if TYPE is not complete. TYPE_WFL will
7314 hold the TYPE value if a new incomplete has to be created (as
7315 opposed to being found already existing and reused). */
7316 SET_TYPE_FOR_RESOLUTION (type, type_wfl, must_chain);
7318 /* If TYPE is fully resolved and we don't have a reference, make one */
7319 PROMOTE_RECORD_IF_COMPLETE (type, must_chain);
7321 /* Go through all the declared variables */
7322 for (current = vlist, saved_type = type; current;
7323 current = TREE_CHAIN (current), type = saved_type)
7325 tree other, real_type;
7326 tree wfl = TREE_PURPOSE (current);
7327 tree name = EXPR_WFL_NODE (wfl);
7328 tree init = TREE_VALUE (current);
7330 /* Process NAME, as it may specify extra dimension(s) for it */
7331 type = build_array_from_name (type, type_wfl, name, &name);
7333 /* Variable redefinition check */
7334 if ((other = lookup_name_in_blocks (name)))
7336 variable_redefinition_error (wfl, name, TREE_TYPE (other),
7337 DECL_SOURCE_LINE (other));
7341 /* Type adjustment. We may have just readjusted TYPE because
7342 the variable specified more dimensions. Make sure we have
7343 a reference if we can and don't have one already. */
7344 PROMOTE_RECORD_IF_COMPLETE (type, must_chain);
7346 real_type = GET_REAL_TYPE (type);
7347 /* Never layout this decl. This will be done when its scope
7349 decl = build_decl (VAR_DECL, name, real_type);
7350 MAYBE_CREATE_VAR_LANG_DECL_SPECIFIC (decl);
7351 DECL_FINAL (decl) = final_p;
7352 BLOCK_CHAIN_DECL (decl);
7354 /* If doing xreferencing, replace the line number with the WFL
7357 DECL_SOURCE_LINE (decl) = EXPR_WFL_LINECOL (wfl);
7359 /* Don't try to use an INIT statement when an error was found */
7360 if (init && java_error_count)
7363 /* Remember it if this is an initialized-upon-declaration final
7365 if (init && final_p)
7367 DECL_LOCAL_FINAL_IUD (decl) = 1;
7370 /* Add the initialization function to the current function's code */
7373 /* Name might have been readjusted */
7374 EXPR_WFL_NODE (TREE_OPERAND (init, 0)) = name;
7375 MODIFY_EXPR_FROM_INITIALIZATION_P (init) = 1;
7376 java_method_add_stmt (current_function_decl,
7377 build_debugable_stmt (EXPR_WFL_LINECOL (init),
7381 /* Setup dependency the type of the decl */
7385 register_incomplete_type (JDEP_VARIABLE, type_wfl, decl, type);
7386 dep = CLASSD_LAST (ctxp->classd_list);
7387 JDEP_GET_PATCH (dep) = &TREE_TYPE (decl);
7390 SOURCE_FRONTEND_DEBUG (("Defined locals"));
7393 /* Called during parsing. Build decls from argument list. */
7396 source_start_java_method (tree fndecl)
7405 current_function_decl = fndecl;
7407 /* New scope for the function */
7409 for (tem = TYPE_ARG_TYPES (TREE_TYPE (fndecl)), i = 0;
7410 tem != end_params_node; tem = TREE_CHAIN (tem), i++)
7412 tree type = TREE_VALUE (tem);
7413 tree name = TREE_PURPOSE (tem);
7415 /* If type is incomplete. Create an incomplete decl and ask for
7416 the decl to be patched later */
7417 if (INCOMPLETE_TYPE_P (type))
7420 tree real_type = GET_REAL_TYPE (type);
7421 parm_decl = build_decl (PARM_DECL, name, real_type);
7422 type = obtain_incomplete_type (type);
7423 register_incomplete_type (JDEP_PARM, NULL_TREE, NULL_TREE, type);
7424 jdep = CLASSD_LAST (ctxp->classd_list);
7425 JDEP_MISC (jdep) = name;
7426 JDEP_GET_PATCH (jdep) = &TREE_TYPE (parm_decl);
7429 parm_decl = build_decl (PARM_DECL, name, type);
7431 /* Remember if a local variable was declared final (via its
7432 TREE_LIST of type/name.) Set DECL_FINAL accordingly. */
7433 if (ARG_FINAL_P (tem))
7435 MAYBE_CREATE_VAR_LANG_DECL_SPECIFIC (parm_decl);
7436 DECL_FINAL (parm_decl) = 1;
7439 BLOCK_CHAIN_DECL (parm_decl);
7441 tem = BLOCK_EXPR_DECLS (DECL_FUNCTION_BODY (current_function_decl));
7442 BLOCK_EXPR_DECLS (DECL_FUNCTION_BODY (current_function_decl)) =
7444 DECL_ARG_SLOT_COUNT (current_function_decl) = i;
7445 DECL_MAX_LOCALS (current_function_decl) = i;
7448 /* Called during parsing. Creates an artificial method declaration. */
7451 create_artificial_method (tree class, int flags, tree type,
7452 tree name, tree args)
7456 java_parser_context_save_global ();
7458 mdecl = make_node (FUNCTION_TYPE);
7459 TREE_TYPE (mdecl) = type;
7460 TYPE_ARG_TYPES (mdecl) = args;
7461 mdecl = add_method (class, flags, name, build_java_signature (mdecl));
7462 java_parser_context_restore_global ();
7463 DECL_ARTIFICIAL (mdecl) = 1;
7467 /* Starts the body if an artificial method. */
7470 start_artificial_method_body (tree mdecl)
7472 DECL_SOURCE_LINE (mdecl) = 1;
7473 DECL_FUNCTION_LAST_LINE (mdecl) = 1;
7474 source_start_java_method (mdecl);
7479 end_artificial_method_body (tree mdecl)
7481 /* exit_block modifies DECL_FUNCTION_BODY (current_function_decl).
7482 It has to be evaluated first. (if mdecl is current_function_decl,
7483 we have an undefined behavior if no temporary variable is used.) */
7484 tree b = exit_block ();
7485 BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (mdecl)) = b;
7489 /* Dump a tree of some kind. This is a convenience wrapper for the
7490 dump_* functions in tree-dump.c. */
7492 dump_java_tree (enum tree_dump_index phase, tree t)
7497 stream = dump_begin (phase, &flags);
7501 dump_node (t, flags, stream);
7502 dump_end (phase, stream);
7506 /* Terminate a function and expand its body. */
7509 source_end_java_method (void)
7511 tree fndecl = current_function_decl;
7516 java_parser_context_save_global ();
7517 input_line = ctxp->last_ccb_indent1;
7519 /* Turn function bodies with only a NOP expr null, so they don't get
7520 generated at all and we won't get warnings when using the -W
7522 if (IS_EMPTY_STMT (BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (fndecl))))
7523 BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (fndecl)) = NULL_TREE;
7525 if (BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (fndecl))
7526 && ! flag_emit_class_files
7527 && ! flag_emit_xref)
7528 finish_method (fndecl);
7530 current_function_decl = NULL_TREE;
7531 java_parser_context_restore_global ();
7532 current_function_decl = NULL_TREE;
7535 /* Record EXPR in the current function block. Complements compound
7536 expression second operand if necessary. */
7539 java_method_add_stmt (tree fndecl, tree expr)
7541 if (!GET_CURRENT_BLOCK (fndecl))
7543 return add_stmt_to_block (GET_CURRENT_BLOCK (fndecl), NULL_TREE, expr);
7547 add_stmt_to_block (tree b, tree type, tree stmt)
7549 tree body = BLOCK_EXPR_BODY (b), c;
7551 if (java_error_count)
7554 if ((c = add_stmt_to_compound (body, type, stmt)) == body)
7557 BLOCK_EXPR_BODY (b) = c;
7558 TREE_SIDE_EFFECTS (c) = 1;
7562 /* Lays out the methods for the classes seen so far. */
7565 java_layout_seen_class_methods (void)
7567 tree previous_list = all_class_list;
7568 tree end = NULL_TREE;
7573 for (current = previous_list;
7574 current != end; current = TREE_CHAIN (current))
7576 tree cls = TREE_TYPE (TREE_VALUE (current));
7578 if (! CLASS_LOADED_P (cls))
7579 load_class (cls, 0);
7581 layout_class_methods (cls);
7584 /* Note that new classes might have been added while laying out
7585 methods, changing the value of all_class_list. */
7587 if (previous_list != all_class_list)
7589 end = previous_list;
7590 previous_list = all_class_list;
7597 static GTY(()) tree stop_reordering;
7599 java_reorder_fields (void)
7603 for (current = gclass_list; current; current = TREE_CHAIN (current))
7605 output_class = current_class = TREE_TYPE (TREE_VALUE (current));
7607 if (current_class == stop_reordering)
7610 /* Reverse the fields, but leave the dummy field in front.
7611 Fields are already ordered for Object and Class */
7612 if (TYPE_FIELDS (current_class) && current_class != object_type_node
7613 && current_class != class_type_node)
7615 /* If the dummy field is there, reverse the right fields and
7616 just layout the type for proper fields offset */
7617 if (!DECL_NAME (TYPE_FIELDS (current_class)))
7619 tree fields = TYPE_FIELDS (current_class);
7620 TREE_CHAIN (fields) = nreverse (TREE_CHAIN (fields));
7621 TYPE_SIZE (current_class) = NULL_TREE;
7623 /* We don't have a dummy field, we need to layout the class,
7624 after having reversed the fields */
7627 TYPE_FIELDS (current_class) =
7628 nreverse (TYPE_FIELDS (current_class));
7629 TYPE_SIZE (current_class) = NULL_TREE;
7633 /* There are cases were gclass_list will be empty. */
7635 stop_reordering = TREE_TYPE (TREE_VALUE (gclass_list));
7638 /* Layout the methods of all classes loaded in one way or another.
7639 Check methods of source parsed classes. Then reorder the
7640 fields and layout the classes or the type of all source parsed
7644 java_layout_classes (void)
7647 int save_error_count = java_error_count;
7649 /* Layout the methods of all classes seen so far */
7650 java_layout_seen_class_methods ();
7651 java_parse_abort_on_error ();
7652 all_class_list = NULL_TREE;
7654 /* Then check the methods of all parsed classes */
7655 for (current = gclass_list; current; current = TREE_CHAIN (current))
7656 if (CLASS_FROM_SOURCE_P (TREE_TYPE (TREE_VALUE (current))))
7657 java_check_methods (TREE_VALUE (current));
7658 java_parse_abort_on_error ();
7660 for (current = gclass_list; current; current = TREE_CHAIN (current))
7662 output_class = current_class = TREE_TYPE (TREE_VALUE (current));
7663 layout_class (current_class);
7665 /* Error reported by the caller */
7666 if (java_error_count)
7670 /* We might have reloaded classes durign the process of laying out
7671 classes for code generation. We must layout the methods of those
7672 late additions, as constructor checks might use them */
7673 java_layout_seen_class_methods ();
7674 java_parse_abort_on_error ();
7677 /* Expand methods in the current set of classes remembered for
7681 java_complete_expand_classes (void)
7685 do_not_fold = flag_emit_xref;
7687 for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
7688 if (!INNER_CLASS_DECL_P (current))
7689 java_complete_expand_class (current);
7692 /* Expand the methods found in OUTER, starting first by OUTER's inner
7696 java_complete_expand_class (tree outer)
7700 /* We need to go after all inner classes and start expanding them,
7701 starting with most nested ones. We have to do that because nested
7702 classes might add functions to outer classes */
7704 for (inner_list = DECL_INNER_CLASS_LIST (outer);
7705 inner_list; inner_list = TREE_CHAIN (inner_list))
7706 java_complete_expand_class (TREE_PURPOSE (inner_list));
7708 java_complete_expand_methods (outer);
7711 /* Expand methods registered in CLASS_DECL. The general idea is that
7712 we expand regular methods first. This allows us get an estimate on
7713 how outer context local alias fields are really used so we can add
7714 to the constructor just enough code to initialize them properly (it
7715 also lets us generate finit$ correctly.) Then we expand the
7716 constructors and then <clinit>. */
7719 java_complete_expand_methods (tree class_decl)
7721 tree clinit, decl, first_decl;
7723 output_class = current_class = TREE_TYPE (class_decl);
7725 /* Pre-expand <clinit> to figure whether we really need it or
7726 not. If we do need it, we pre-expand the static fields so they're
7727 ready to be used somewhere else. <clinit> will be fully expanded
7728 after we processed the constructors. */
7729 first_decl = TYPE_METHODS (current_class);
7730 clinit = maybe_generate_pre_expand_clinit (current_class);
7732 /* Then generate finit$ (if we need to) because constructors will
7734 if (TYPE_FINIT_STMT_LIST (current_class))
7735 java_complete_expand_method (generate_finit (current_class));
7737 /* Then generate instinit$ (if we need to) because constructors will
7739 if (TYPE_II_STMT_LIST (current_class))
7740 java_complete_expand_method (generate_instinit (current_class));
7742 /* Now do the constructors */
7743 for (decl = first_decl ; !java_error_count && decl; decl = TREE_CHAIN (decl))
7745 if (!DECL_CONSTRUCTOR_P (decl))
7747 java_complete_expand_method (decl);
7750 /* First, do the ordinary methods. */
7751 for (decl = first_decl; decl; decl = TREE_CHAIN (decl))
7753 /* Ctors aren't part of this batch. */
7754 if (DECL_CONSTRUCTOR_P (decl) || DECL_CLINIT_P (decl))
7757 /* Skip abstract or native methods -- but do handle native
7758 methods when generating JNI stubs. */
7759 if (METHOD_ABSTRACT (decl) || (! flag_jni && METHOD_NATIVE (decl)))
7761 DECL_FUNCTION_BODY (decl) = NULL_TREE;
7765 if (METHOD_NATIVE (decl))
7768 current_function_decl = decl;
7769 body = build_jni_stub (decl);
7770 BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (decl)) = body;
7773 java_complete_expand_method (decl);
7776 /* If there is indeed a <clinit>, fully expand it now */
7779 /* Prevent the use of `this' inside <clinit> */
7780 ctxp->explicit_constructor_p = 1;
7781 java_complete_expand_method (clinit);
7782 ctxp->explicit_constructor_p = 0;
7785 /* We might have generated a class$ that we now want to expand */
7786 if (TYPE_DOT_CLASS (current_class))
7787 java_complete_expand_method (TYPE_DOT_CLASS (current_class));
7789 /* Now verify constructor circularity (stop after the first one we
7791 if (!CLASS_INTERFACE (class_decl))
7792 for (decl = TYPE_METHODS (current_class); decl; decl = TREE_CHAIN (decl))
7793 if (DECL_CONSTRUCTOR_P (decl)
7794 && verify_constructor_circularity (decl, decl))
7798 /* Attempt to create <clinit>. Pre-expand static fields so they can be
7799 safely used in some other methods/constructors. */
7802 maybe_generate_pre_expand_clinit (tree class_type)
7804 tree current, mdecl;
7806 if (!TYPE_CLINIT_STMT_LIST (class_type))
7809 /* Go through all static fields and pre expand them */
7810 for (current = TYPE_FIELDS (class_type); current;
7811 current = TREE_CHAIN (current))
7812 if (FIELD_STATIC (current))
7813 build_field_ref (NULL_TREE, class_type, DECL_NAME (current));
7815 /* Then build the <clinit> method */
7816 mdecl = create_artificial_method (class_type, ACC_STATIC, void_type_node,
7817 clinit_identifier_node, end_params_node);
7818 layout_class_method (class_type, CLASSTYPE_SUPER (class_type),
7820 start_artificial_method_body (mdecl);
7822 /* We process the list of assignment we produced as the result of
7823 the declaration of initialized static field and add them as
7824 statement to the <clinit> method. */
7825 for (current = TYPE_CLINIT_STMT_LIST (class_type); current;
7826 current = TREE_CHAIN (current))
7828 tree stmt = current;
7829 /* We build the assignment expression that will initialize the
7830 field to its value. There are strict rules on static
7831 initializers (8.5). FIXME */
7832 if (TREE_CODE (stmt) != BLOCK && !IS_EMPTY_STMT (stmt))
7833 stmt = build_debugable_stmt (EXPR_WFL_LINECOL (stmt), stmt);
7834 java_method_add_stmt (mdecl, stmt);
7837 end_artificial_method_body (mdecl);
7839 /* Now we want to place <clinit> as the last method (because we need
7840 it at least for interface so that it doesn't interfere with the
7841 dispatch table based lookup. */
7842 if (TREE_CHAIN (TYPE_METHODS (class_type)))
7844 current = TREE_CHAIN (TYPE_METHODS (class_type));
7845 TYPE_METHODS (class_type) = current;
7847 while (TREE_CHAIN (current))
7848 current = TREE_CHAIN (current);
7850 TREE_CHAIN (current) = mdecl;
7851 TREE_CHAIN (mdecl) = NULL_TREE;
7857 /* Analyzes a method body and look for something that isn't a
7858 MODIFY_EXPR with a constant value. */
7861 analyze_clinit_body (tree this_class, tree bbody)
7864 switch (TREE_CODE (bbody))
7867 bbody = BLOCK_EXPR_BODY (bbody);
7870 case EXPR_WITH_FILE_LOCATION:
7871 bbody = EXPR_WFL_NODE (bbody);
7875 if (analyze_clinit_body (this_class, TREE_OPERAND (bbody, 0)))
7877 bbody = TREE_OPERAND (bbody, 1);
7881 /* If we're generating to class file and we're dealing with an
7882 array initialization, we return 1 to keep <clinit> */
7883 if (TREE_CODE (TREE_OPERAND (bbody, 1)) == NEW_ARRAY_INIT
7884 && flag_emit_class_files)
7887 /* There are a few cases where we're required to keep
7889 - If this is an assignment whose operand is not constant,
7890 - If this is an assignment to a non-initialized field,
7891 - If this field is not a member of the current class.
7893 return (! TREE_CONSTANT (TREE_OPERAND (bbody, 1))
7894 || ! DECL_INITIAL (TREE_OPERAND (bbody, 0))
7895 || DECL_CONTEXT (TREE_OPERAND (bbody, 0)) != this_class);
7904 /* See whether we could get rid of <clinit>. Criteria are: all static
7905 final fields have constant initial values and the body of <clinit>
7906 is empty. Return 1 if <clinit> was discarded, 0 otherwise. */
7909 maybe_yank_clinit (tree mdecl)
7914 if (!DECL_CLINIT_P (mdecl))
7917 /* If the body isn't empty, then we keep <clinit>. Note that if
7918 we're emitting classfiles, this isn't enough not to rule it
7920 fbody = DECL_FUNCTION_BODY (mdecl);
7921 bbody = BLOCK_EXPR_BODY (fbody);
7922 if (bbody && bbody != error_mark_node)
7923 bbody = BLOCK_EXPR_BODY (bbody);
7926 if (bbody && ! flag_emit_class_files && !IS_EMPTY_STMT (bbody))
7929 type = DECL_CONTEXT (mdecl);
7930 current = TYPE_FIELDS (type);
7932 for (current = (current ? TREE_CHAIN (current) : current);
7933 current; current = TREE_CHAIN (current))
7937 /* We're not interested in non-static fields. */
7938 if (!FIELD_STATIC (current))
7941 /* Nor in fields without initializers. */
7942 f_init = DECL_INITIAL (current);
7943 if (f_init == NULL_TREE)
7946 /* Anything that isn't String or a basic type is ruled out -- or
7947 if we know how to deal with it (when doing things natively) we
7948 should generated an empty <clinit> so that SUID are computed
7950 if (! JSTRING_TYPE_P (TREE_TYPE (current))
7951 && ! JNUMERIC_TYPE_P (TREE_TYPE (current)))
7954 if (! FIELD_FINAL (current) || ! TREE_CONSTANT (f_init))
7958 /* Now we analyze the method body and look for something that
7959 isn't a MODIFY_EXPR */
7960 if (!IS_EMPTY_STMT (bbody) && analyze_clinit_body (type, bbody))
7963 /* Get rid of <clinit> in the class' list of methods */
7964 if (TYPE_METHODS (type) == mdecl)
7965 TYPE_METHODS (type) = TREE_CHAIN (mdecl);
7967 for (current = TYPE_METHODS (type); current;
7968 current = TREE_CHAIN (current))
7969 if (TREE_CHAIN (current) == mdecl)
7971 TREE_CHAIN (current) = TREE_CHAIN (mdecl);
7978 /* Install the argument from MDECL. Suitable to completion and
7979 expansion of mdecl's body. */
7982 start_complete_expand_method (tree mdecl)
7986 pushlevel (1); /* Prepare for a parameter push */
7987 tem = BLOCK_EXPR_DECLS (DECL_FUNCTION_BODY (current_function_decl));
7988 DECL_ARGUMENTS (mdecl) = tem;
7990 for (; tem; tem = TREE_CHAIN (tem))
7992 /* TREE_CHAIN (tem) will change after pushdecl. */
7993 tree next = TREE_CHAIN (tem);
7994 tree type = TREE_TYPE (tem);
7995 if (targetm.calls.promote_prototypes (type)
7996 && TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node)
7997 && INTEGRAL_TYPE_P (type))
7998 type = integer_type_node;
7999 DECL_ARG_TYPE (tem) = type;
8000 layout_decl (tem, 0);
8002 /* Re-install the next so that the list is kept and the loop
8004 TREE_CHAIN (tem) = next;
8006 pushdecl_force_head (DECL_ARGUMENTS (mdecl));
8007 input_line = DECL_SOURCE_LINE (mdecl);
8008 build_result_decl (mdecl);
8012 /* Complete and expand a method. */
8015 java_complete_expand_method (tree mdecl)
8017 tree fbody, block_body, exception_copy;
8019 current_function_decl = mdecl;
8020 /* Fix constructors before expanding them */
8021 if (DECL_CONSTRUCTOR_P (mdecl))
8022 fix_constructors (mdecl);
8024 /* Expand functions that have a body */
8025 if (!DECL_FUNCTION_BODY (mdecl))
8028 fbody = DECL_FUNCTION_BODY (mdecl);
8029 block_body = BLOCK_EXPR_BODY (fbody);
8030 exception_copy = NULL_TREE;
8032 current_function_decl = mdecl;
8035 fprintf (stderr, " [%s.",
8036 lang_printable_name (DECL_CONTEXT (mdecl), 0));
8037 announce_function (mdecl);
8039 fprintf (stderr, "]");
8041 /* Prepare the function for tree completion */
8042 start_complete_expand_method (mdecl);
8044 /* Install the current this */
8045 current_this = (!METHOD_STATIC (mdecl) ?
8046 BLOCK_EXPR_DECLS (DECL_FUNCTION_BODY (mdecl)) : NULL_TREE);
8048 /* Purge the `throws' list of unchecked exceptions (we save a copy
8049 of the list and re-install it later.) */
8050 exception_copy = copy_list (DECL_FUNCTION_THROWS (mdecl));
8051 purge_unchecked_exceptions (mdecl);
8053 /* Install exceptions thrown with `throws' */
8054 PUSH_EXCEPTIONS (DECL_FUNCTION_THROWS (mdecl));
8056 if (block_body != NULL_TREE)
8058 block_body = java_complete_tree (block_body);
8060 /* Before we check initialization, attached all class initialization
8061 variable to the block_body */
8062 htab_traverse (DECL_FUNCTION_INIT_TEST_TABLE (mdecl),
8063 attach_init_test_initialization_flags, block_body);
8065 if (! flag_emit_xref && ! METHOD_NATIVE (mdecl))
8067 check_for_initialization (block_body, mdecl);
8069 /* Go through all the flags marking the initialization of
8070 static variables and see whether they're definitively
8071 assigned, in which case the type is remembered as
8072 definitively initialized in MDECL. */
8073 if (STATIC_CLASS_INIT_OPT_P ())
8075 /* Always register the context as properly initialized in
8076 MDECL. This used with caution helps removing extra
8077 initialization of self. */
8078 if (METHOD_STATIC (mdecl))
8081 (DECL_FUNCTION_INITIALIZED_CLASS_TABLE (mdecl),
8082 DECL_CONTEXT (mdecl), INSERT)) = DECL_CONTEXT (mdecl);
8086 ctxp->explicit_constructor_p = 0;
8089 BLOCK_EXPR_BODY (fbody) = block_body;
8091 /* If we saw a return but couldn't evaluate it properly, we'll have
8092 an error_mark_node here. */
8093 if (block_body != error_mark_node
8094 && (block_body == NULL_TREE || CAN_COMPLETE_NORMALLY (block_body))
8095 && TREE_CODE (TREE_TYPE (TREE_TYPE (mdecl))) != VOID_TYPE
8097 missing_return_error (current_function_decl);
8099 /* See if we can get rid of <clinit> if MDECL happens to be <clinit> */
8100 maybe_yank_clinit (mdecl);
8102 /* Pop the current level, with special measures if we found errors. */
8103 if (java_error_count)
8104 pushdecl_force_head (DECL_ARGUMENTS (mdecl));
8107 /* Pop the exceptions and sanity check */
8109 if (currently_caught_type_list)
8112 /* Restore the copy of the list of exceptions if emitting xrefs. */
8113 DECL_FUNCTION_THROWS (mdecl) = exception_copy;
8116 /* For with each class for which there's code to generate. */
8119 java_expand_method_bodies (tree class)
8122 for (decl = TYPE_METHODS (class); decl; decl = TREE_CHAIN (decl))
8126 if (! DECL_FUNCTION_BODY (decl))
8129 current_function_decl = decl;
8131 block = BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (decl));
8133 /* Save the function body for gimplify and inlining. */
8134 DECL_SAVED_TREE (decl) = block;
8136 /* It's time to assign the variable flagging static class
8137 initialization based on which classes invoked static methods
8138 are definitely initializing. This should be flagged. */
8139 if (STATIC_CLASS_INIT_OPT_P ())
8141 tree list = DECL_FUNCTION_STATIC_METHOD_INVOCATION_COMPOUND (decl);
8142 for (; list != NULL_TREE; list = TREE_CHAIN (list))
8144 /* Executed for each statement calling a static function.
8145 LIST is a TREE_LIST whose PURPOSE is the called function
8146 and VALUE is a compound whose second operand can be patched
8147 with static class initialization flag assignments. */
8149 tree called_method = TREE_PURPOSE (list);
8150 tree compound = TREE_VALUE (list);
8151 tree assignment_compound_list
8152 = build_tree_list (called_method, NULL);
8154 /* For each class definitely initialized in
8155 CALLED_METHOD, fill ASSIGNMENT_COMPOUND with
8156 assignment to the class initialization flag. */
8157 htab_traverse (DECL_FUNCTION_INITIALIZED_CLASS_TABLE (called_method),
8158 emit_test_initialization,
8159 assignment_compound_list);
8161 if (TREE_VALUE (assignment_compound_list))
8162 TREE_OPERAND (compound, 1)
8163 = TREE_VALUE (assignment_compound_list);
8167 /* Expand the function body. */
8168 source_end_java_method ();
8174 /* This section of the code deals with accessing enclosing context
8175 fields either directly by using the relevant access to this$<n> or
8176 by invoking an access method crafted for that purpose. */
8178 /* Build the necessary access from an inner class to an outer
8179 class. This routine could be optimized to cache previous result
8180 (decl, current_class and returned access). When an access method
8181 needs to be generated, it always takes the form of a read. It might
8182 be later turned into a write by calling outer_field_access_fix. */
8185 build_outer_field_access (tree id, tree decl)
8187 tree access = NULL_TREE;
8188 tree ctx = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (current_class)));
8189 tree decl_ctx = DECL_CONTEXT (decl);
8191 /* If the immediate enclosing context of the current class is the
8192 field decl's class or inherits from it; build the access as
8193 `this$<n>.<field>'. Note that we will break the `private' barrier
8194 if we're not emitting bytecodes. */
8195 if ((ctx == decl_ctx || inherits_from_p (ctx, decl_ctx))
8196 && (!FIELD_PRIVATE (decl) || !flag_emit_class_files ))
8198 tree thisn = build_current_thisn (current_class);
8199 access = make_qualified_primary (build_wfl_node (thisn),
8200 id, EXPR_WFL_LINECOL (id));
8202 /* Otherwise, generate access methods to outer this and access the
8203 field (either using an access method or by direct access.) */
8206 int lc = EXPR_WFL_LINECOL (id);
8208 /* Now we chain the required number of calls to the access$0 to
8209 get a hold to the enclosing instance we need, and then we
8210 build the field access. */
8211 access = build_access_to_thisn (current_class, decl_ctx, lc);
8213 /* If the field is private and we're generating bytecode, then
8214 we generate an access method */
8215 if (FIELD_PRIVATE (decl) && flag_emit_class_files )
8217 tree name = build_outer_field_access_methods (decl);
8218 access = build_outer_field_access_expr (lc, decl_ctx,
8219 name, access, NULL_TREE);
8221 /* Otherwise we use `access$(this$<j>). ... access$(this$<i>).<field>'.
8222 Once again we break the `private' access rule from a foreign
8225 access = make_qualified_primary (access, id, lc);
8227 return resolve_expression_name (access, NULL);
8230 /* Return a nonzero value if NODE describes an outer field inner
8234 outer_field_access_p (tree type, tree decl)
8236 if (!INNER_CLASS_TYPE_P (type)
8237 || TREE_CODE (decl) != FIELD_DECL
8238 || DECL_CONTEXT (decl) == type)
8241 /* If the inner class extends the declaration context of the field
8242 we're trying to access, then this isn't an outer field access */
8243 if (inherits_from_p (type, DECL_CONTEXT (decl)))
8246 for (type = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (type))); ;
8247 type = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (type))))
8249 if (type == DECL_CONTEXT (decl))
8252 if (!DECL_CONTEXT (TYPE_NAME (type)))
8254 /* Before we give up, see whether the field is inherited from
8255 the enclosing context we're considering. */
8256 if (inherits_from_p (type, DECL_CONTEXT (decl)))
8265 /* Return a nonzero value if NODE represents an outer field inner
8266 access that was been already expanded. As a side effect, it returns
8267 the name of the field being accessed and the argument passed to the
8268 access function, suitable for a regeneration of the access method
8269 call if necessary. */
8272 outer_field_expanded_access_p (tree node, tree *name, tree *arg_type,
8277 if (TREE_CODE (node) != CALL_EXPR)
8280 /* Well, gcj generates slightly different tree nodes when compiling
8281 to native or bytecodes. It's the case for function calls. */
8283 if (flag_emit_class_files
8284 && TREE_CODE (node) == CALL_EXPR
8285 && OUTER_FIELD_ACCESS_IDENTIFIER_P (DECL_NAME (TREE_OPERAND (node, 0))))
8287 else if (!flag_emit_class_files)
8289 node = TREE_OPERAND (node, 0);
8291 if (node && TREE_OPERAND (node, 0)
8292 && TREE_CODE (TREE_OPERAND (node, 0)) == ADDR_EXPR)
8294 node = TREE_OPERAND (node, 0);
8295 if (TREE_OPERAND (node, 0)
8296 && TREE_CODE (TREE_OPERAND (node, 0)) == FUNCTION_DECL
8297 && (OUTER_FIELD_ACCESS_IDENTIFIER_P
8298 (DECL_NAME (TREE_OPERAND (node, 0)))))
8303 if (identified && name && arg_type && arg)
8305 tree argument = TREE_OPERAND (node, 1);
8306 *name = DECL_NAME (TREE_OPERAND (node, 0));
8307 *arg_type = TREE_TYPE (TREE_TYPE (TREE_VALUE (argument)));
8308 *arg = TREE_VALUE (argument);
8313 /* Detect in NODE an outer field read access from an inner class and
8314 transform it into a write with RHS as an argument. This function is
8315 called from the java_complete_lhs when an assignment to a LHS can
8319 outer_field_access_fix (tree wfl, tree node, tree rhs)
8321 tree name, arg_type, arg;
8323 if (outer_field_expanded_access_p (node, &name, &arg_type, &arg))
8325 node = build_outer_field_access_expr (EXPR_WFL_LINECOL (wfl),
8326 arg_type, name, arg, rhs);
8327 return java_complete_tree (node);
8332 /* Construct the expression that calls an access method:
8333 <type>.access$<n>(<arg1> [, <arg2>]);
8335 ARG2 can be NULL and will be omitted in that case. It will denote a
8339 build_outer_field_access_expr (int lc, tree type, tree access_method_name,
8340 tree arg1, tree arg2)
8342 tree args, cn, access;
8344 args = arg1 ? arg1 :
8345 build_wfl_node (build_current_thisn (current_class));
8346 args = build_tree_list (NULL_TREE, args);
8349 args = tree_cons (NULL_TREE, arg2, args);
8351 access = build_method_invocation (build_wfl_node (access_method_name), args);
8352 cn = build_wfl_node (DECL_NAME (TYPE_NAME (type)));
8353 return make_qualified_primary (cn, access, lc);
8357 build_new_access_id (void)
8359 static int access_n_counter = 1;
8362 sprintf (buffer, "access$%d", access_n_counter++);
8363 return get_identifier (buffer);
8366 /* Create the static access functions for the outer field DECL. We define a
8368 TREE_TYPE (<field>) access$<n> (DECL_CONTEXT (<field>) inst$) {
8372 TREE_TYPE (<field>) access$<n> (DECL_CONTEXT (<field>) inst$,
8373 TREE_TYPE (<field>) value$) {
8374 return inst$.field = value$;
8376 We should have a usage flags on the DECL so we can lazily turn the ones
8377 we're using for code generation. FIXME.
8381 build_outer_field_access_methods (tree decl)
8383 tree id, args, stmt, mdecl;
8385 if (FIELD_INNER_ACCESS_P (decl))
8386 return FIELD_INNER_ACCESS (decl);
8388 MAYBE_CREATE_VAR_LANG_DECL_SPECIFIC (decl);
8390 /* Create the identifier and a function named after it. */
8391 id = build_new_access_id ();
8393 /* The identifier is marked as bearing the name of a generated write
8394 access function for outer field accessed from inner classes. */
8395 OUTER_FIELD_ACCESS_IDENTIFIER_P (id) = 1;
8397 /* Create the read access */
8398 args = build_tree_list (inst_id, build_pointer_type (DECL_CONTEXT (decl)));
8399 TREE_CHAIN (args) = end_params_node;
8400 stmt = make_qualified_primary (build_wfl_node (inst_id),
8401 build_wfl_node (DECL_NAME (decl)), 0);
8402 stmt = build_return (0, stmt);
8403 mdecl = build_outer_field_access_method (DECL_CONTEXT (decl),
8404 TREE_TYPE (decl), id, args, stmt);
8405 DECL_FUNCTION_ACCESS_DECL (mdecl) = decl;
8407 /* Create the write access method. No write access for final variable */
8408 if (!FIELD_FINAL (decl))
8410 args = build_tree_list (inst_id,
8411 build_pointer_type (DECL_CONTEXT (decl)));
8412 TREE_CHAIN (args) = build_tree_list (wpv_id, TREE_TYPE (decl));
8413 TREE_CHAIN (TREE_CHAIN (args)) = end_params_node;
8414 stmt = make_qualified_primary (build_wfl_node (inst_id),
8415 build_wfl_node (DECL_NAME (decl)), 0);
8416 stmt = build_return (0, build_assignment (ASSIGN_TK, 0, stmt,
8417 build_wfl_node (wpv_id)));
8418 mdecl = build_outer_field_access_method (DECL_CONTEXT (decl),
8419 TREE_TYPE (decl), id,
8422 DECL_FUNCTION_ACCESS_DECL (mdecl) = decl;
8424 /* Return the access name */
8425 return FIELD_INNER_ACCESS (decl) = id;
8428 /* Build an field access method NAME. */
8431 build_outer_field_access_method (tree class, tree type, tree name,
8432 tree args, tree body)
8434 tree saved_current_function_decl, mdecl;
8436 /* Create the method */
8437 mdecl = create_artificial_method (class, ACC_STATIC, type, name, args);
8438 fix_method_argument_names (args, mdecl);
8439 layout_class_method (class, NULL_TREE, mdecl, NULL_TREE);
8441 /* Attach the method body. */
8442 saved_current_function_decl = current_function_decl;
8443 start_artificial_method_body (mdecl);
8444 java_method_add_stmt (mdecl, body);
8445 end_artificial_method_body (mdecl);
8446 current_function_decl = saved_current_function_decl;
8452 /* This section deals with building access function necessary for
8453 certain kinds of method invocation from inner classes. */
8456 build_outer_method_access_method (tree decl)
8458 tree saved_current_function_decl, mdecl;
8459 tree args = NULL_TREE, call_args = NULL_TREE;
8460 tree carg, id, body, class;
8462 int parm_id_count = 0;
8464 /* Test this abort with an access to a private field */
8465 if (!strcmp (IDENTIFIER_POINTER (DECL_NAME (decl)), "access$"))
8468 /* Check the cache first */
8469 if (DECL_FUNCTION_INNER_ACCESS (decl))
8470 return DECL_FUNCTION_INNER_ACCESS (decl);
8472 class = DECL_CONTEXT (decl);
8474 /* Obtain an access identifier and mark it */
8475 id = build_new_access_id ();
8476 OUTER_FIELD_ACCESS_IDENTIFIER_P (id) = 1;
8478 carg = TYPE_ARG_TYPES (TREE_TYPE (decl));
8479 /* Create the arguments, as much as the original */
8480 for (; carg && carg != end_params_node;
8481 carg = TREE_CHAIN (carg))
8483 sprintf (buffer, "write_parm_value$%d", parm_id_count++);
8484 args = chainon (args, build_tree_list (get_identifier (buffer),
8485 TREE_VALUE (carg)));
8487 args = chainon (args, end_params_node);
8489 /* Create the method */
8490 mdecl = create_artificial_method (class, ACC_STATIC,
8491 TREE_TYPE (TREE_TYPE (decl)), id, args);
8492 layout_class_method (class, NULL_TREE, mdecl, NULL_TREE);
8493 /* There is a potential bug here. We should be able to use
8494 fix_method_argument_names, but then arg names get mixed up and
8495 eventually a constructor will have its this$0 altered and the
8496 outer context won't be assignment properly. The testcase is
8498 TYPE_ARG_TYPES (TREE_TYPE (mdecl)) = args;
8500 /* Attach the method body. */
8501 saved_current_function_decl = current_function_decl;
8502 start_artificial_method_body (mdecl);
8504 /* The actual method invocation uses the same args. When invoking a
8505 static methods that way, we don't want to skip the first
8508 if (!METHOD_STATIC (decl))
8509 carg = TREE_CHAIN (carg);
8510 for (; carg && carg != end_params_node; carg = TREE_CHAIN (carg))
8511 call_args = tree_cons (NULL_TREE, build_wfl_node (TREE_PURPOSE (carg)),
8514 body = build_method_invocation (build_wfl_node (DECL_NAME (decl)),
8516 if (!METHOD_STATIC (decl))
8517 body = make_qualified_primary (build_wfl_node (TREE_PURPOSE (args)),
8519 if (TREE_TYPE (TREE_TYPE (decl)) != void_type_node)
8520 body = build_return (0, body);
8521 java_method_add_stmt (mdecl,body);
8522 end_artificial_method_body (mdecl);
8523 current_function_decl = saved_current_function_decl;
8525 /* Back tag the access function so it know what it accesses */
8526 DECL_FUNCTION_ACCESS_DECL (decl) = mdecl;
8528 /* Tag the current method so it knows it has an access generated */
8529 return DECL_FUNCTION_INNER_ACCESS (decl) = mdecl;
8533 /* This section of the code deals with building expressions to access
8534 the enclosing instance of an inner class. The enclosing instance is
8535 kept in a generated field called this$<n>, with <n> being the
8536 inner class nesting level (starting from 0.) */
8538 /* Build an access to a given this$<n>, always chaining access call to
8539 others. Access methods to this$<n> are build on the fly if
8540 necessary. This CAN'T be used to solely access this$<n-1> from
8541 this$<n> (which alway yield to special cases and optimization, see
8542 for example build_outer_field_access). */
8545 build_access_to_thisn (tree from, tree to, int lc)
8547 tree access = NULL_TREE;
8549 while (from != to && PURE_INNER_CLASS_TYPE_P (from))
8553 access = build_current_thisn (from);
8554 access = build_wfl_node (access);
8558 tree access0_wfl, cn;
8560 maybe_build_thisn_access_method (from);
8561 access0_wfl = build_wfl_node (access0_identifier_node);
8562 cn = build_wfl_node (DECL_NAME (TYPE_NAME (from)));
8563 EXPR_WFL_LINECOL (access0_wfl) = lc;
8564 access = build_tree_list (NULL_TREE, access);
8565 access = build_method_invocation (access0_wfl, access);
8566 access = make_qualified_primary (cn, access, lc);
8569 /* If FROM isn't an inner class, that's fine, we've done enough.
8570 What we're looking for can be accessed from there. */
8571 from = DECL_CONTEXT (TYPE_NAME (from));
8574 from = TREE_TYPE (from);
8579 /* Build an access function to the this$<n> local to TYPE. NULL_TREE
8580 is returned if nothing needs to be generated. Otherwise, the method
8581 generated and a method decl is returned.
8583 NOTE: These generated methods should be declared in a class file
8584 attribute so that they can't be referred to directly. */
8587 maybe_build_thisn_access_method (tree type)
8589 tree mdecl, args, stmt, rtype;
8590 tree saved_current_function_decl;
8592 /* If TYPE is a top-level class, no access method is required.
8593 If there already is such an access method, bail out. */
8594 if (CLASS_ACCESS0_GENERATED_P (type) || !PURE_INNER_CLASS_TYPE_P (type))
8597 /* We generate the method. The method looks like:
8598 static <outer_of_type> access$0 (<type> inst$) { return inst$.this$<n>; }
8600 args = build_tree_list (inst_id, build_pointer_type (type));
8601 TREE_CHAIN (args) = end_params_node;
8602 rtype = build_pointer_type (TREE_TYPE (DECL_CONTEXT (TYPE_NAME (type))));
8603 mdecl = create_artificial_method (type, ACC_STATIC, rtype,
8604 access0_identifier_node, args);
8605 fix_method_argument_names (args, mdecl);
8606 layout_class_method (type, NULL_TREE, mdecl, NULL_TREE);
8607 stmt = build_current_thisn (type);
8608 stmt = make_qualified_primary (build_wfl_node (inst_id),
8609 build_wfl_node (stmt), 0);
8610 stmt = build_return (0, stmt);
8612 saved_current_function_decl = current_function_decl;
8613 start_artificial_method_body (mdecl);
8614 java_method_add_stmt (mdecl, stmt);
8615 end_artificial_method_body (mdecl);
8616 current_function_decl = saved_current_function_decl;
8618 CLASS_ACCESS0_GENERATED_P (type) = 1;
8623 /* Craft an correctly numbered `this$<n>'string. this$0 is used for
8624 the first level of innerclassing. this$1 for the next one, etc...
8625 This function can be invoked with TYPE to NULL, available and then
8626 has to count the parser context. */
8628 static GTY(()) tree saved_thisn;
8629 static GTY(()) tree saved_type;
8632 build_current_thisn (tree type)
8634 static int saved_i = -1;
8635 static int saved_type_i = 0;
8642 if (type == saved_type)
8646 for (i = -1, decl = DECL_CONTEXT (TYPE_NAME (type));
8647 decl; decl = DECL_CONTEXT (decl), i++)
8655 i = list_length (GET_CPC_LIST ())-2;
8660 sprintf (buffer, "this$%d", i);
8662 saved_thisn = get_identifier (buffer);
8666 /* Return the assignment to the hidden enclosing context `this$<n>'
8667 by the second incoming parameter to the innerclass constructor. The
8668 form used is `this.this$<n> = this$<n>;'. */
8671 build_thisn_assign (void)
8673 if (current_class && PURE_INNER_CLASS_TYPE_P (current_class))
8675 tree thisn = build_current_thisn (current_class);
8676 tree lhs = make_qualified_primary (build_wfl_node (this_identifier_node),
8677 build_wfl_node (thisn), 0);
8678 tree rhs = build_wfl_node (thisn);
8679 EXPR_WFL_SET_LINECOL (lhs, input_line, 0);
8680 return build_assignment (ASSIGN_TK, EXPR_WFL_LINECOL (lhs), lhs, rhs);
8686 /* Building the synthetic `class$' used to implement the `.class' 1.1
8687 extension for non primitive types. This method looks like:
8689 static Class class$(String type) throws NoClassDefFoundError
8691 try {return (java.lang.Class.forName (String));}
8692 catch (ClassNotFoundException e) {
8693 throw new NoClassDefFoundError(e.getMessage());}
8696 static GTY(()) tree get_message_wfl;
8697 static GTY(()) tree type_parm_wfl;
8700 build_dot_class_method (tree class)
8702 #define BWF(S) build_wfl_node (get_identifier ((S)))
8703 #define MQN(X,Y) make_qualified_name ((X), (Y), 0)
8704 tree args, tmp, saved_current_function_decl, mdecl, qual_name;
8705 tree stmt, throw_stmt;
8707 if (!get_message_wfl)
8709 get_message_wfl = build_wfl_node (get_identifier ("getMessage"));
8710 type_parm_wfl = build_wfl_node (get_identifier ("type$"));
8713 /* Build the arguments */
8714 args = build_tree_list (get_identifier ("type$"),
8715 build_pointer_type (string_type_node));
8716 TREE_CHAIN (args) = end_params_node;
8718 /* Build the qualified name java.lang.Class.forName */
8719 tmp = MQN (MQN (MQN (BWF ("java"),
8720 BWF ("lang")), BWF ("Class")), BWF ("forName"));
8722 /* Create the "class$" function */
8723 mdecl = create_artificial_method (class, ACC_STATIC,
8724 build_pointer_type (class_type_node),
8725 classdollar_identifier_node, args);
8726 qual_name = MQN (MQN (BWF ("java"), BWF ("lang")),
8727 BWF ("NoClassDefFoundError"));
8728 DECL_FUNCTION_THROWS (mdecl) = build_tree_list (NULL_TREE, qual_name);
8729 register_incomplete_type (JDEP_EXCEPTION, qual_name, NULL_TREE, NULL_TREE);
8730 JDEP_GET_PATCH (CLASSD_LAST (ctxp->classd_list)) =
8731 &TREE_VALUE (DECL_FUNCTION_THROWS (mdecl));
8733 /* We start by building the try block. We need to build:
8734 return (java.lang.Class.forName (type)); */
8735 stmt = build_method_invocation (tmp,
8736 build_tree_list (NULL_TREE, type_parm_wfl));
8737 stmt = build_return (0, stmt);
8739 /* Now onto the catch block. We start by building the expression
8740 throwing a new exception: throw new NoClassDefFoundError (_.getMessage) */
8741 throw_stmt = make_qualified_name (build_wfl_node (wpv_id),
8742 get_message_wfl, 0);
8743 throw_stmt = build_method_invocation (throw_stmt, NULL_TREE);
8745 /* Build new NoClassDefFoundError (_.getMessage) */
8746 throw_stmt = build_new_invocation
8747 (build_wfl_node (get_identifier ("NoClassDefFoundError")),
8748 build_tree_list (build_pointer_type (string_type_node), throw_stmt));
8750 /* Build the throw, (it's too early to use BUILD_THROW) */
8751 throw_stmt = build1 (THROW_EXPR, NULL_TREE, throw_stmt);
8753 /* Encapsulate STMT in a try block. The catch clause executes THROW_STMT */
8754 qual_name = MQN (MQN (BWF ("java"), BWF ("lang")),
8755 BWF ("ClassNotFoundException"));
8756 stmt = encapsulate_with_try_catch (0, qual_name, stmt, throw_stmt);
8758 fix_method_argument_names (args, mdecl);
8759 layout_class_method (class, NULL_TREE, mdecl, NULL_TREE);
8760 saved_current_function_decl = current_function_decl;
8761 start_artificial_method_body (mdecl);
8762 java_method_add_stmt (mdecl, stmt);
8763 end_artificial_method_body (mdecl);
8764 current_function_decl = saved_current_function_decl;
8765 TYPE_DOT_CLASS (class) = mdecl;
8771 build_dot_class_method_invocation (tree this_class, tree type)
8773 tree dot_class_method = TYPE_DOT_CLASS (this_class);
8776 if (TYPE_ARRAY_P (type))
8777 sig_id = build_java_signature (type);
8779 sig_id = DECL_NAME (TYPE_NAME (type));
8781 /* Ensure that the proper name separator is used */
8782 sig_id = unmangle_classname (IDENTIFIER_POINTER (sig_id),
8783 IDENTIFIER_LENGTH (sig_id));
8785 s = build_string (IDENTIFIER_LENGTH (sig_id),
8786 IDENTIFIER_POINTER (sig_id));
8787 t = build_method_invocation (build_wfl_node (DECL_NAME (dot_class_method)),
8788 build_tree_list (NULL_TREE, s));
8789 if (DECL_CONTEXT (dot_class_method) != this_class)
8791 tree class_name = DECL_NAME (TYPE_NAME (DECL_CONTEXT (dot_class_method)));
8792 t = make_qualified_primary (build_wfl_node (class_name), t, 0);
8797 /* This section of the code deals with constructor. */
8799 /* Craft a body for default constructor. Patch existing constructor
8800 bodies with call to super() and field initialization statements if
8804 fix_constructors (tree mdecl)
8806 tree iii; /* Instance Initializer Invocation */
8807 tree body = DECL_FUNCTION_BODY (mdecl);
8808 tree thisn_assign, compound = NULL_TREE;
8809 tree class_type = DECL_CONTEXT (mdecl);
8811 if (DECL_FIXED_CONSTRUCTOR_P (mdecl))
8813 DECL_FIXED_CONSTRUCTOR_P (mdecl) = 1;
8817 /* It is an error for the compiler to generate a default
8818 constructor if the superclass doesn't have a constructor that
8819 takes no argument, or the same args for an anonymous class */
8820 if (verify_constructor_super (mdecl))
8822 tree sclass_decl = TYPE_NAME (CLASSTYPE_SUPER (class_type));
8823 tree save = DECL_NAME (mdecl);
8824 const char *n = IDENTIFIER_POINTER (DECL_NAME (sclass_decl));
8825 DECL_NAME (mdecl) = DECL_NAME (sclass_decl);
8827 (lookup_cl (TYPE_NAME (class_type)),
8828 "No constructor matching `%s' found in class `%s'",
8829 lang_printable_name (mdecl, 0), n);
8830 DECL_NAME (mdecl) = save;
8833 /* The constructor body must be crafted by hand. It's the
8834 constructor we defined when we realize we didn't have the
8835 CLASSNAME() constructor */
8836 start_artificial_method_body (mdecl);
8838 /* Insert an assignment to the this$<n> hidden field, if
8840 if ((thisn_assign = build_thisn_assign ()))
8841 java_method_add_stmt (mdecl, thisn_assign);
8843 /* We don't generate a super constructor invocation if we're
8844 compiling java.lang.Object. build_super_invocation takes care
8846 java_method_add_stmt (mdecl, build_super_invocation (mdecl));
8849 if ((iii = build_instinit_invocation (class_type)))
8850 java_method_add_stmt (mdecl, iii);
8852 end_artificial_method_body (mdecl);
8854 /* Search for an explicit constructor invocation */
8858 int invokes_this = 0;
8859 tree found_call = NULL_TREE;
8860 tree main_block = BLOCK_EXPR_BODY (body);
8863 switch (TREE_CODE (body))
8866 found = CALL_EXPLICIT_CONSTRUCTOR_P (body);
8867 if (CALL_THIS_CONSTRUCTOR_P (body))
8872 case EXPR_WITH_FILE_LOCATION:
8874 body = TREE_OPERAND (body, 0);
8878 body = BLOCK_EXPR_BODY (body);
8885 /* Generate the assignment to this$<n>, if necessary */
8886 if ((thisn_assign = build_thisn_assign ()))
8887 compound = add_stmt_to_compound (compound, NULL_TREE, thisn_assign);
8889 /* The constructor is missing an invocation of super() */
8891 compound = add_stmt_to_compound (compound, NULL_TREE,
8892 build_super_invocation (mdecl));
8893 /* Explicit super() invocation should take place before the
8894 instance initializer blocks. */
8897 compound = add_stmt_to_compound (compound, NULL_TREE,
8898 TREE_OPERAND (found_call, 0));
8899 TREE_OPERAND (found_call, 0) = build_java_empty_stmt ();
8902 DECL_INIT_CALLS_THIS (mdecl) = invokes_this;
8904 /* Insert the instance initializer block right after. */
8905 if (!invokes_this && (iii = build_instinit_invocation (class_type)))
8906 compound = add_stmt_to_compound (compound, NULL_TREE, iii);
8908 /* Fix the constructor main block if we're adding extra stmts */
8911 compound = add_stmt_to_compound (compound, NULL_TREE,
8912 BLOCK_EXPR_BODY (main_block));
8913 BLOCK_EXPR_BODY (main_block) = compound;
8918 /* Browse constructors in the super class, searching for a constructor
8919 that doesn't take any argument. Return 0 if one is found, 1
8920 otherwise. If the current class is an anonymous inner class, look
8921 for something that has the same signature. */
8924 verify_constructor_super (tree mdecl)
8926 tree class = CLASSTYPE_SUPER (current_class);
8927 int super_inner = PURE_INNER_CLASS_TYPE_P (class);
8933 if (ANONYMOUS_CLASS_P (current_class))
8935 tree mdecl_arg_type;
8936 SKIP_THIS_AND_ARTIFICIAL_PARMS (mdecl_arg_type, mdecl);
8937 for (sdecl = TYPE_METHODS (class); sdecl; sdecl = TREE_CHAIN (sdecl))
8938 if (DECL_CONSTRUCTOR_P (sdecl))
8941 tree arg_type = TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (sdecl)));
8943 arg_type = TREE_CHAIN (arg_type);
8944 for (m_arg_type = mdecl_arg_type;
8945 (arg_type != end_params_node
8946 && m_arg_type != end_params_node);
8947 arg_type = TREE_CHAIN (arg_type),
8948 m_arg_type = TREE_CHAIN (m_arg_type))
8949 if (!valid_method_invocation_conversion_p
8950 (TREE_VALUE (arg_type),
8951 TREE_VALUE (m_arg_type)))
8954 if (arg_type == end_params_node && m_arg_type == end_params_node)
8960 for (sdecl = TYPE_METHODS (class); sdecl; sdecl = TREE_CHAIN (sdecl))
8962 tree arg = TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (sdecl)));
8964 arg = TREE_CHAIN (arg);
8965 if (DECL_CONSTRUCTOR_P (sdecl) && arg == end_params_node)
8972 /* Generate code for all context remembered for code generation. */
8974 static GTY(()) tree reversed_class_list;
8976 java_expand_classes (void)
8978 int save_error_count = 0;
8979 static struct parser_ctxt *cur_ctxp = NULL;
8981 java_parse_abort_on_error ();
8982 if (!(ctxp = ctxp_for_generation))
8984 java_layout_classes ();
8985 java_parse_abort_on_error ();
8987 for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
8990 for (current = cur_ctxp->class_list;
8992 current = TREE_CHAIN (current))
8993 gen_indirect_dispatch_tables (TREE_TYPE (current));
8996 for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
8999 input_filename = ctxp->filename;
9000 lang_init_source (2); /* Error msgs have method prototypes */
9001 java_complete_expand_classes (); /* Complete and expand classes */
9002 java_parse_abort_on_error ();
9004 input_filename = main_input_filename;
9006 /* Find anonymous classes and expand their constructor. This extra pass is
9007 necessary because the constructor itself is only generated when the
9008 method in which it is defined is expanded. */
9009 for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
9013 for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
9015 output_class = current_class = TREE_TYPE (current);
9016 if (ANONYMOUS_CLASS_P (current_class))
9019 for (d = TYPE_METHODS (current_class); d; d = TREE_CHAIN (d))
9021 if (DECL_CONSTRUCTOR_P (d))
9023 java_complete_expand_method (d);
9024 break; /* There is only one constructor. */
9031 /* Expanding the constructors of anonymous classes generates access
9032 methods. Scan all the methods looking for null DECL_RESULTs --
9033 this will be the case if a method hasn't been expanded. */
9034 for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
9038 for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
9041 output_class = current_class = TREE_TYPE (current);
9042 for (d = TYPE_METHODS (current_class); d; d = TREE_CHAIN (d))
9044 if (DECL_RESULT (d) == NULL_TREE)
9045 java_complete_expand_method (d);
9050 /* ??? Instead of all this we could iterate around the list of
9051 classes until there were no more un-expanded methods. It would
9052 take a little longer -- one pass over the whole list of methods
9053 -- but it would be simpler. Like this: */
9056 int something_changed;
9060 something_changed = 0;
9061 for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
9065 for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
9068 output_class = current_class = TREE_TYPE (current);
9069 for (d = TYPE_METHODS (current_class); d; d = TREE_CHAIN (d))
9071 if (DECL_RESULT (d) == NULL_TREE)
9073 something_changed = 1;
9074 java_complete_expand_method (d);
9080 while (something_changed);
9084 /* If we've found error at that stage, don't try to generate
9085 anything, unless we're emitting xrefs or checking the syntax only
9086 (but not using -fsyntax-only for the purpose of generating
9088 if (java_error_count && !flag_emit_xref
9089 && (!flag_syntax_only && !flag_emit_class_files))
9092 /* Now things are stable, go for generation of the class data. */
9094 /* We pessimistically marked all methods and fields external until
9095 we knew what set of classes we were planning to compile. Now mark
9096 those that will be generated locally as not external. */
9097 for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
9101 for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
9102 java_mark_class_local (TREE_TYPE (current));
9105 /* Compile the classes. */
9106 for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
9109 reversed_class_list = NULL;
9113 /* We write out the classes in reverse order. This ensures that
9114 inner classes are written before their containing classes,
9115 which is important for parallel builds. Otherwise, the
9116 class file for the outer class may be found, but the class
9117 file for the inner class may not be present. In that
9118 situation, the compiler cannot fall back to the original
9119 source, having already read the outer class, so we must
9120 prevent that situation. */
9121 for (current = ctxp->class_list;
9123 current = TREE_CHAIN (current))
9125 = tree_cons (NULL_TREE, current, reversed_class_list);
9127 for (current = reversed_class_list;
9129 current = TREE_CHAIN (current))
9131 output_class = current_class = TREE_TYPE (TREE_VALUE (current));
9132 if (flag_emit_class_files)
9133 write_classfile (current_class);
9135 expand_xref (current_class);
9136 else if (! flag_syntax_only)
9137 java_expand_method_bodies (current_class);
9143 java_finish_classes (void)
9145 static struct parser_ctxt *cur_ctxp = NULL;
9146 for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
9150 for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
9152 output_class = current_class = TREE_TYPE (current);
9158 /* Wrap non WFL PRIMARY around a WFL and set EXPR_WFL_QUALIFICATION to
9159 a tree list node containing RIGHT. Fore coming RIGHTs will be
9160 chained to this hook. LOCATION contains the location of the
9161 separating `.' operator. */
9164 make_qualified_primary (tree primary, tree right, int location)
9168 if (TREE_CODE (primary) != EXPR_WITH_FILE_LOCATION)
9169 wfl = build_wfl_wrap (primary, location);
9173 /* If wfl wasn't qualified, we build a first anchor */
9174 if (!EXPR_WFL_QUALIFICATION (wfl))
9175 EXPR_WFL_QUALIFICATION (wfl) = build_tree_list (wfl, NULL_TREE);
9178 /* And chain them */
9179 EXPR_WFL_LINECOL (right) = location;
9180 chainon (EXPR_WFL_QUALIFICATION (wfl), build_tree_list (right, NULL_TREE));
9181 PRIMARY_P (wfl) = 1;
9185 /* Simple merge of two name separated by a `.' */
9188 merge_qualified_name (tree left, tree right)
9191 if (!left && !right)
9200 obstack_grow (&temporary_obstack, IDENTIFIER_POINTER (left),
9201 IDENTIFIER_LENGTH (left));
9202 obstack_1grow (&temporary_obstack, '.');
9203 obstack_grow0 (&temporary_obstack, IDENTIFIER_POINTER (right),
9204 IDENTIFIER_LENGTH (right));
9205 node = get_identifier (obstack_base (&temporary_obstack));
9206 obstack_free (&temporary_obstack, obstack_base (&temporary_obstack));
9207 QUALIFIED_P (node) = 1;
9211 /* Merge the two parts of a qualified name into LEFT. Set the
9212 location information of the resulting node to LOCATION, usually
9213 inherited from the location information of the `.' operator. */
9216 make_qualified_name (tree left, tree right, int location)
9218 #ifdef USE_COMPONENT_REF
9219 tree node = build (COMPONENT_REF, NULL_TREE, left, right, NULL_TREE);
9220 EXPR_WFL_LINECOL (node) = location;
9223 tree left_id = EXPR_WFL_NODE (left);
9224 tree right_id = EXPR_WFL_NODE (right);
9227 merge = merge_qualified_name (left_id, right_id);
9229 /* Left wasn't qualified and is now qualified */
9230 if (!QUALIFIED_P (left_id))
9232 tree wfl = build_expr_wfl (left_id, ctxp->filename, 0, 0);
9233 EXPR_WFL_LINECOL (wfl) = EXPR_WFL_LINECOL (left);
9234 EXPR_WFL_QUALIFICATION (left) = build_tree_list (wfl, NULL_TREE);
9237 wfl = build_expr_wfl (right_id, ctxp->filename, 0, 0);
9238 EXPR_WFL_LINECOL (wfl) = location;
9239 chainon (EXPR_WFL_QUALIFICATION (left), build_tree_list (wfl, NULL_TREE));
9241 EXPR_WFL_NODE (left) = merge;
9246 /* Extract the last identifier component of the qualified in WFL. The
9247 last identifier is removed from the linked list */
9250 cut_identifier_in_qualified (tree wfl)
9253 tree previous = NULL_TREE;
9254 for (q = EXPR_WFL_QUALIFICATION (wfl); ; previous = q, q = TREE_CHAIN (q))
9255 if (!TREE_CHAIN (q))
9258 /* Operating on a non qualified qualified WFL. */
9261 TREE_CHAIN (previous) = NULL_TREE;
9262 return TREE_PURPOSE (q);
9266 /* Resolve the expression name NAME. Return its decl. */
9269 resolve_expression_name (tree id, tree *orig)
9271 tree name = EXPR_WFL_NODE (id);
9274 /* 6.5.5.1: Simple expression names */
9275 if (!PRIMARY_P (id) && !QUALIFIED_P (name))
9277 /* 15.13.1: NAME can appear within the scope of a local variable
9279 if ((decl = IDENTIFIER_LOCAL_VALUE (name)))
9282 /* 15.13.1: NAME can appear within a class declaration */
9285 decl = lookup_field_wrapper (current_class, name);
9288 tree access = NULL_TREE;
9289 int fs = FIELD_STATIC (decl);
9291 /* If we're accessing an outer scope local alias, make
9292 sure we change the name of the field we're going to
9294 if (FIELD_LOCAL_ALIAS_USED (decl))
9295 name = DECL_NAME (decl);
9297 check_deprecation (id, decl);
9299 /* Instance variable (8.3.1.1) can't appear within
9300 static method, static initializer or initializer for
9301 a static variable. */
9302 if (!fs && METHOD_STATIC (current_function_decl))
9304 static_ref_err (id, name, current_class);
9305 return error_mark_node;
9307 /* Instance variables can't appear as an argument of
9308 an explicit constructor invocation */
9309 if (!fs && ctxp->explicit_constructor_p
9310 && !enclosing_context_p (DECL_CONTEXT (decl), current_class))
9313 (id, "Can't reference `%s' before the superclass constructor has been called", IDENTIFIER_POINTER (name));
9314 return error_mark_node;
9317 /* If we're processing an inner class and we're trying
9318 to access a field belonging to an outer class, build
9319 the access to the field */
9320 if (!fs && outer_field_access_p (current_class, decl))
9322 if (CLASS_STATIC (TYPE_NAME (current_class)))
9324 static_ref_err (id, DECL_NAME (decl), current_class);
9325 return error_mark_node;
9327 access = build_outer_field_access (id, decl);
9333 /* Otherwise build what it takes to access the field */
9334 access = build_field_ref ((fs ? NULL_TREE : current_this),
9335 DECL_CONTEXT (decl), name);
9337 access = maybe_build_class_init_for_field (decl, access);
9338 /* We may be asked to save the real field access node */
9341 /* Last check: can we access the field? */
9342 if (not_accessible_p (current_class, decl, NULL_TREE, 0))
9344 not_accessible_field_error (id, decl);
9345 return error_mark_node;
9347 /* And we return what we got */
9350 /* Fall down to error report on undefined variable */
9353 /* 6.5.5.2 Qualified Expression Names */
9358 qualify_ambiguous_name (id);
9359 /* 15.10.1 Field Access Using a Primary and/or Expression Name */
9360 /* 15.10.2: Accessing Superclass Members using super */
9361 return resolve_field_access (id, orig, NULL);
9364 /* We've got an error here */
9365 if (INNER_CLASS_TYPE_P (current_class))
9366 parse_error_context (id,
9367 "Local variable `%s' can't be accessed from within the inner class `%s' unless it is declared final",
9368 IDENTIFIER_POINTER (name),
9369 IDENTIFIER_POINTER (DECL_NAME
9370 (TYPE_NAME (current_class))));
9372 parse_error_context (id, "Undefined variable `%s'",
9373 IDENTIFIER_POINTER (name));
9375 return error_mark_node;
9379 static_ref_err (tree wfl, tree field_id, tree class_type)
9383 "Can't make a static reference to nonstatic variable `%s' in class `%s'",
9384 IDENTIFIER_POINTER (field_id),
9385 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (class_type))));
9388 /* 15.10.1 Field Access Using a Primary and/or Expression Name.
9389 We return something suitable to generate the field access. We also
9390 return the field decl in FIELD_DECL and its type in FIELD_TYPE. If
9391 recipient's address can be null. */
9394 resolve_field_access (tree qual_wfl, tree *field_decl, tree *field_type)
9398 tree decl = NULL_TREE, where_found, type_found;
9400 if (resolve_qualified_expression_name (qual_wfl, &decl,
9401 &where_found, &type_found))
9402 return error_mark_node;
9404 /* Resolve the LENGTH field of an array here */
9405 if (DECL_P (decl) && DECL_NAME (decl) == length_identifier_node
9406 && type_found && TYPE_ARRAY_P (type_found)
9407 && ! flag_emit_class_files && ! flag_emit_xref)
9409 tree length = build_java_array_length_access (where_found);
9412 /* In case we're dealing with a static array, we need to
9413 initialize its class before the array length can be fetched.
9414 It's also a good time to create a DECL_RTL for the field if
9415 none already exists, otherwise if the field was declared in a
9416 class found in an external file and hasn't been (and won't
9417 be) accessed for its value, none will be created. */
9418 if (TREE_CODE (where_found) == VAR_DECL && FIELD_STATIC (where_found))
9420 build_static_field_ref (where_found);
9421 field_ref = build_class_init (DECL_CONTEXT (where_found), field_ref);
9424 /* We might have been trying to resolve field.method(). In which
9425 case, the resolution is over and decl is the answer */
9426 else if (JDECL_P (decl) && IDENTIFIER_LOCAL_VALUE (DECL_NAME (decl)) == decl)
9428 else if (JDECL_P (decl))
9431 type_found = DECL_CONTEXT (decl);
9432 is_static = FIELD_STATIC (decl);
9433 field_ref = build_field_ref ((is_static && !flag_emit_xref?
9434 NULL_TREE : where_found),
9435 type_found, DECL_NAME (decl));
9436 if (field_ref == error_mark_node)
9437 return error_mark_node;
9439 field_ref = maybe_build_class_init_for_field (decl, field_ref);
9441 /* If we're looking at a static field, we may need to generate a
9442 class initialization for it. This can happen when the access
9443 looks like `field.ref', where `field' is a static field in an
9444 interface we implement. */
9445 if (!flag_emit_class_files
9447 && TREE_CODE (where_found) == VAR_DECL
9448 && FIELD_STATIC (where_found))
9450 build_static_field_ref (where_found);
9451 field_ref = build_class_init (DECL_CONTEXT (where_found), field_ref);
9460 *field_type = (QUAL_DECL_TYPE (decl) ?
9461 QUAL_DECL_TYPE (decl) : TREE_TYPE (decl));
9465 /* If NODE is an access to f static field, strip out the class
9466 initialization part and return the field decl, otherwise, return
9470 strip_out_static_field_access_decl (tree node)
9472 if (TREE_CODE (node) == COMPOUND_EXPR)
9474 tree op1 = TREE_OPERAND (node, 1);
9475 if (TREE_CODE (op1) == COMPOUND_EXPR)
9477 tree call = TREE_OPERAND (op1, 0);
9478 if (TREE_CODE (call) == CALL_EXPR
9479 && TREE_CODE (TREE_OPERAND (call, 0)) == ADDR_EXPR
9480 && TREE_OPERAND (TREE_OPERAND (call, 0), 0)
9481 == soft_initclass_node)
9482 return TREE_OPERAND (op1, 1);
9484 else if (JDECL_P (op1))
9490 /* 6.5.5.2: Qualified Expression Names */
9493 resolve_qualified_expression_name (tree wfl, tree *found_decl,
9494 tree *where_found, tree *type_found)
9496 int from_type = 0; /* Field search initiated from a type */
9497 int from_super = 0, from_cast = 0, from_qualified_this = 0;
9498 int previous_call_static = 0;
9500 tree decl = NULL_TREE, type = NULL_TREE, q;
9501 /* For certain for of inner class instantiation */
9502 tree saved_current, saved_this;
9503 #define RESTORE_THIS_AND_CURRENT_CLASS \
9504 { current_class = saved_current; current_this = saved_this;}
9506 *type_found = *where_found = NULL_TREE;
9508 for (q = EXPR_WFL_QUALIFICATION (wfl); q; q = TREE_CHAIN (q))
9510 tree qual_wfl = QUAL_WFL (q);
9511 tree ret_decl; /* for EH checking */
9512 int location; /* for EH checking */
9514 /* 15.10.1 Field Access Using a Primary */
9515 switch (TREE_CODE (qual_wfl))
9518 case NEW_CLASS_EXPR:
9519 /* If the access to the function call is a non static field,
9520 build the code to access it. */
9521 if (JDECL_P (decl) && !FIELD_STATIC (decl))
9523 decl = maybe_access_field (decl, *where_found,
9524 DECL_CONTEXT (decl));
9525 if (decl == error_mark_node)
9529 /* And code for the function call */
9530 if (complete_function_arguments (qual_wfl))
9533 /* We might have to setup a new current class and a new this
9534 for the search of an inner class, relative to the type of
9535 a expression resolved as `decl'. The current values are
9536 saved and restored shortly after */
9537 saved_current = current_class;
9538 saved_this = current_this;
9540 && (TREE_CODE (qual_wfl) == NEW_CLASS_EXPR
9541 || from_qualified_this))
9543 /* If we still have `from_qualified_this', we have the form
9544 <T>.this.f() and we need to build <T>.this */
9545 if (from_qualified_this)
9547 decl = build_access_to_thisn (current_class, type, 0);
9548 decl = java_complete_tree (decl);
9549 type = TREE_TYPE (TREE_TYPE (decl));
9551 current_class = type;
9552 current_this = decl;
9553 from_qualified_this = 0;
9556 if (from_super && TREE_CODE (qual_wfl) == CALL_EXPR)
9557 CALL_USING_SUPER (qual_wfl) = 1;
9558 location = (TREE_CODE (qual_wfl) == CALL_EXPR ?
9559 EXPR_WFL_LINECOL (TREE_OPERAND (qual_wfl, 0)) : 0);
9560 *where_found = patch_method_invocation (qual_wfl, decl, type,
9562 &is_static, &ret_decl);
9564 if (*where_found == error_mark_node)
9566 RESTORE_THIS_AND_CURRENT_CLASS;
9569 *type_found = type = QUAL_DECL_TYPE (*where_found);
9571 *where_found = force_evaluation_order (*where_found);
9573 /* If we're creating an inner class instance, check for that
9574 an enclosing instance is in scope */
9575 if (TREE_CODE (qual_wfl) == NEW_CLASS_EXPR
9576 && INNER_ENCLOSING_SCOPE_CHECK (type))
9579 (qual_wfl, "No enclosing instance for inner class `%s' is in scope%s",
9580 lang_printable_name (type, 0),
9581 (!current_this ? "" :
9582 "; an explicit one must be provided when creating this inner class"));
9583 RESTORE_THIS_AND_CURRENT_CLASS;
9587 /* In case we had to change then to resolve a inner class
9588 instantiation using a primary qualified by a `new' */
9589 RESTORE_THIS_AND_CURRENT_CLASS;
9593 tree arguments = NULL_TREE;
9594 if (TREE_CODE (qual_wfl) == CALL_EXPR
9595 && TREE_OPERAND (qual_wfl, 1) != NULL_TREE)
9596 arguments = TREE_VALUE (TREE_OPERAND (qual_wfl, 1));
9597 check_thrown_exceptions (location, ret_decl, arguments);
9600 /* If the previous call was static and this one is too,
9601 build a compound expression to hold the two (because in
9602 that case, previous function calls aren't transported as
9603 forcoming function's argument. */
9604 if (previous_call_static && is_static)
9606 decl = build (COMPOUND_EXPR, TREE_TYPE (*where_found),
9607 decl, *where_found);
9608 TREE_SIDE_EFFECTS (decl) = 1;
9612 previous_call_static = is_static;
9613 decl = *where_found;
9618 case NEW_ARRAY_EXPR:
9619 case NEW_ANONYMOUS_ARRAY_EXPR:
9620 *where_found = decl = java_complete_tree (qual_wfl);
9621 if (decl == error_mark_node)
9623 *type_found = type = QUAL_DECL_TYPE (decl);
9627 *where_found = decl = java_complete_tree (qual_wfl);
9628 if (decl == error_mark_node)
9630 *type_found = type = QUAL_DECL_TYPE (decl);
9634 case CONDITIONAL_EXPR:
9637 *where_found = decl = java_complete_tree (qual_wfl);
9638 if (decl == error_mark_node)
9640 *type_found = type = QUAL_DECL_TYPE (decl);
9644 /* If the access to the function call is a non static field,
9645 build the code to access it. */
9646 if (JDECL_P (decl) && !FIELD_STATIC (decl))
9648 decl = maybe_access_field (decl, *where_found, type);
9649 if (decl == error_mark_node)
9652 /* And code for the array reference expression */
9653 decl = java_complete_tree (qual_wfl);
9654 if (decl == error_mark_node)
9656 type = QUAL_DECL_TYPE (decl);
9660 if ((decl = java_complete_tree (qual_wfl)) == error_mark_node)
9662 if ((type = patch_string (decl)))
9664 *where_found = QUAL_RESOLUTION (q) = decl;
9665 *type_found = type = TREE_TYPE (decl);
9669 if ((decl = java_complete_tree (qual_wfl)) == error_mark_node)
9671 *where_found = QUAL_RESOLUTION (q) = decl;
9672 *type_found = type = TREE_TYPE (decl);
9676 /* Fix for -Wall Just go to the next statement. Don't
9681 /* If we fall here, we weren't processing a (static) function call. */
9682 previous_call_static = 0;
9684 /* It can be the keyword THIS */
9685 if (TREE_CODE (qual_wfl) == EXPR_WITH_FILE_LOCATION
9686 && EXPR_WFL_NODE (qual_wfl) == this_identifier_node)
9691 (wfl, "Keyword `this' used outside allowed context");
9694 if (ctxp->explicit_constructor_p
9695 && type == current_class)
9697 parse_error_context (wfl, "Can't reference `this' before the superclass constructor has been called");
9700 /* We have to generate code for intermediate access */
9701 if (!from_type || TREE_TYPE (TREE_TYPE (current_this)) == type)
9703 *where_found = decl = current_this;
9704 *type_found = type = QUAL_DECL_TYPE (decl);
9706 /* We're trying to access the this from somewhere else. Make sure
9707 it's allowed before doing so. */
9710 if (!enclosing_context_p (type, current_class))
9712 char *p = xstrdup (lang_printable_name (type, 0));
9713 parse_error_context (qual_wfl, "Can't use variable `%s.this': type `%s' isn't an outer type of type `%s'",
9715 lang_printable_name (current_class, 0));
9719 from_qualified_this = 1;
9720 /* If there's nothing else after that, we need to
9721 produce something now, otherwise, the section of the
9722 code that needs to produce <T>.this will generate
9723 what is necessary. */
9724 if (!TREE_CHAIN (q))
9726 decl = build_access_to_thisn (current_class, type, 0);
9727 *where_found = decl = java_complete_tree (decl);
9728 *type_found = type = TREE_TYPE (decl);
9736 /* 15.10.2 Accessing Superclass Members using SUPER */
9737 if (TREE_CODE (qual_wfl) == EXPR_WITH_FILE_LOCATION
9738 && EXPR_WFL_NODE (qual_wfl) == super_identifier_node)
9741 /* Check on the restricted use of SUPER */
9742 if (METHOD_STATIC (current_function_decl)
9743 || current_class == object_type_node)
9746 (wfl, "Keyword `super' used outside allowed context");
9749 /* Otherwise, treat SUPER as (SUPER_CLASS)THIS */
9750 node = build_cast (EXPR_WFL_LINECOL (qual_wfl),
9751 CLASSTYPE_SUPER (current_class),
9752 build_this (EXPR_WFL_LINECOL (qual_wfl)));
9753 *where_found = decl = java_complete_tree (node);
9754 if (decl == error_mark_node)
9756 *type_found = type = QUAL_DECL_TYPE (decl);
9757 from_super = from_type = 1;
9761 /* 15.13.1: Can't search for field name in packages, so we
9762 assume a variable/class name was meant. */
9763 if (RESOLVE_PACKAGE_NAME_P (qual_wfl))
9766 if ((decl = resolve_package (wfl, &q, &name)))
9769 *where_found = decl;
9771 check_pkg_class_access (DECL_NAME (decl), qual_wfl, true, NULL);
9773 /* We want to be absolutely sure that the class is laid
9774 out. We're going to search something inside it. */
9775 *type_found = type = TREE_TYPE (decl);
9776 layout_class (type);
9779 /* Fix them all the way down, if any are left. */
9782 list = TREE_CHAIN (q);
9785 RESOLVE_PACKAGE_NAME_P (QUAL_WFL (list)) = 0;
9786 list = TREE_CHAIN (list);
9792 if (from_super || from_cast)
9794 ((from_cast ? qual_wfl : wfl),
9795 "No variable `%s' defined in class `%s'",
9796 IDENTIFIER_POINTER (EXPR_WFL_NODE (qual_wfl)),
9797 lang_printable_name (type, 0));
9800 (qual_wfl, "Undefined variable or class name: `%s'",
9801 IDENTIFIER_POINTER (name));
9806 /* We have a type name. It's been already resolved when the
9807 expression was qualified. */
9808 else if (RESOLVE_TYPE_NAME_P (qual_wfl) && QUAL_RESOLUTION (q))
9810 decl = QUAL_RESOLUTION (q);
9812 /* Sneak preview. If next we see a `new', we're facing a
9813 qualification which resulted in a type being selected
9814 instead of a field. Report the error. */
9816 && TREE_CODE (TREE_PURPOSE (TREE_CHAIN (q))) == NEW_CLASS_EXPR)
9818 parse_error_context (qual_wfl, "Undefined variable `%s'",
9819 IDENTIFIER_POINTER (EXPR_WFL_NODE (wfl)));
9823 check_pkg_class_access (DECL_NAME (decl), qual_wfl, true, NULL);
9825 check_deprecation (qual_wfl, decl);
9827 type = TREE_TYPE (decl);
9830 /* We resolve an expression name */
9833 tree field_decl = NULL_TREE;
9835 /* If there exists an early resolution, use it. That occurs
9836 only once and we know that there are more things to
9837 come. Don't do that when processing something after SUPER
9838 (we need more thing to be put in place below */
9839 if (!from_super && QUAL_RESOLUTION (q))
9841 decl = QUAL_RESOLUTION (q);
9844 if (TREE_CODE (decl) == FIELD_DECL && !FIELD_STATIC (decl))
9847 *where_found = current_this;
9850 static_ref_err (qual_wfl, DECL_NAME (decl),
9854 if (outer_field_access_p (current_class, decl))
9855 decl = build_outer_field_access (qual_wfl, decl);
9859 *where_found = TREE_TYPE (decl);
9860 if (TREE_CODE (*where_found) == POINTER_TYPE)
9861 *where_found = TREE_TYPE (*where_found);
9866 /* Report and error if we're using a numerical literal as a
9867 qualifier. It can only be an INTEGER_CST. */
9868 else if (TREE_CODE (qual_wfl) == INTEGER_CST)
9871 (wfl, "Can't use type `%s' as a qualifier",
9872 lang_printable_name (TREE_TYPE (qual_wfl), 0));
9876 /* We have to search for a field, knowing the type of its
9877 container. The flag FROM_TYPE indicates that we resolved
9878 the last member of the expression as a type name, which
9879 means that for the resolution of this field, we'll look
9880 for other errors than if it was resolved as a member of
9885 tree field_decl_type; /* For layout */
9887 if (!from_type && !JREFERENCE_TYPE_P (type))
9890 (qual_wfl, "Attempt to reference field `%s' in `%s %s'",
9891 IDENTIFIER_POINTER (EXPR_WFL_NODE (qual_wfl)),
9892 lang_printable_name (type, 0),
9893 IDENTIFIER_POINTER (DECL_NAME (decl)));
9897 field_decl = lookup_field_wrapper (type,
9898 EXPR_WFL_NODE (qual_wfl));
9900 /* Maybe what we're trying to access to is an inner
9901 class, only if decl is a TYPE_DECL. */
9902 if (!field_decl && TREE_CODE (decl) == TYPE_DECL)
9904 tree ptr, inner_decl;
9906 BUILD_PTR_FROM_NAME (ptr, EXPR_WFL_NODE (qual_wfl));
9907 inner_decl = resolve_class (decl, ptr, NULL_TREE, qual_wfl);
9910 check_inner_class_access (inner_decl, decl, qual_wfl);
9911 type = TREE_TYPE (inner_decl);
9918 if (field_decl == NULL_TREE)
9921 (qual_wfl, "No variable `%s' defined in type `%s'",
9922 IDENTIFIER_POINTER (EXPR_WFL_NODE (qual_wfl)),
9923 GET_TYPE_NAME (type));
9926 if (field_decl == error_mark_node)
9929 /* Layout the type of field_decl, since we may need
9930 it. Don't do primitive types or loaded classes. The
9931 situation of non primitive arrays may not handled
9932 properly here. FIXME */
9933 if (TREE_CODE (TREE_TYPE (field_decl)) == POINTER_TYPE)
9934 field_decl_type = TREE_TYPE (TREE_TYPE (field_decl));
9936 field_decl_type = TREE_TYPE (field_decl);
9937 if (!JPRIMITIVE_TYPE_P (field_decl_type)
9938 && !CLASS_LOADED_P (field_decl_type)
9939 && !TYPE_ARRAY_P (field_decl_type))
9940 resolve_and_layout (field_decl_type, NULL_TREE);
9942 /* Check on accessibility here */
9943 if (not_accessible_p (current_class, field_decl,
9944 *type_found, from_super))
9945 return not_accessible_field_error (qual_wfl,field_decl);
9946 check_deprecation (qual_wfl, field_decl);
9948 /* There are things to check when fields are accessed
9949 from type. There are no restrictions on a static
9950 declaration of the field when it is accessed from an
9952 is_static = FIELD_STATIC (field_decl);
9953 if (!from_super && from_type
9954 && !TYPE_INTERFACE_P (type)
9956 && (current_function_decl
9957 && METHOD_STATIC (current_function_decl)))
9959 static_ref_err (qual_wfl, EXPR_WFL_NODE (qual_wfl), type);
9962 from_cast = from_super = 0;
9964 /* It's an access from a type but it isn't static, we
9965 make it relative to `this'. */
9966 if (!is_static && from_type)
9967 decl = current_this;
9969 /* If we need to generate something to get a proper
9970 handle on what this field is accessed from, do it
9974 decl = maybe_access_field (decl, *where_found, *type_found);
9975 if (decl == error_mark_node)
9979 /* We want to keep the location were found it, and the type
9981 *where_found = decl;
9984 /* Generate the correct expression for field access from
9986 if (from_qualified_this)
9988 field_decl = build_outer_field_access (qual_wfl, field_decl);
9989 from_qualified_this = 0;
9992 /* This is the decl found and eventually the next one to
9997 type = QUAL_DECL_TYPE (decl);
9999 /* Sneak preview. If decl is qualified by a `new', report
10000 the error here to be accurate on the peculiar construct */
10002 && TREE_CODE (TREE_PURPOSE (TREE_CHAIN (q))) == NEW_CLASS_EXPR
10003 && !JREFERENCE_TYPE_P (type))
10005 parse_error_context (qual_wfl, "Attempt to reference field `new' in a `%s'",
10006 lang_printable_name (type, 0));
10010 /* `q' might have changed due to a after package resolution
10011 re-qualification */
10015 *found_decl = decl;
10019 /* 6.6 Qualified name and access control. Returns 1 if MEMBER (a decl)
10020 can't be accessed from REFERENCE (a record type). If MEMBER
10021 features a protected access, we then use WHERE which, if non null,
10022 holds the type of MEMBER's access that is checked against
10023 6.6.2.1. This function should be used when decl is a field or a
10027 not_accessible_p (tree reference, tree member, tree where, int from_super)
10029 int access_flag = get_access_flags_from_decl (member);
10030 bool is_static = false;
10032 if (TREE_CODE (member) == FIELD_DECL ||
10033 TREE_CODE (member) == VAR_DECL)
10034 is_static = FIELD_STATIC (member);
10036 is_static = METHOD_STATIC (member);
10038 /* Access always granted for members declared public */
10039 if (access_flag & ACC_PUBLIC)
10042 /* Check access on protected members */
10043 if (access_flag & ACC_PROTECTED)
10045 /* Access granted if it occurs from within the package
10046 containing the class in which the protected member is
10048 if (class_in_current_package (DECL_CONTEXT (member)))
10051 /* If accessed with the form `super.member', then access is granted */
10055 /* If WHERE is active, access was made through a qualifier. For
10056 non-static members, access is granted if the type of the qualifier
10057 is or is a sublass of the type the access is made from (6.6.2.1.) */
10058 if (where && !is_static)
10062 if (inherits_from_p (where, reference))
10064 if (PURE_INNER_CLASS_TYPE_P (reference))
10065 reference = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (reference)));
10072 /* Otherwise, access is granted if occurring from within the class
10073 where member is declared, or a subclass of it. */
10076 if (inherits_from_p (reference, DECL_CONTEXT (member)))
10078 if (PURE_INNER_CLASS_TYPE_P (reference))
10079 reference = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (reference)));
10086 /* Check access on private members. Access is granted only if it
10087 occurs from within the class in which it is declared -- that does
10088 it for innerclasses too. */
10089 if (access_flag & ACC_PRIVATE)
10091 if (reference == DECL_CONTEXT (member) ||
10092 common_enclosing_context_p (DECL_CONTEXT (member), reference))
10097 /* Default access is permitted only when occurring from within the
10098 package in which the context (MEMBER) is declared. */
10099 return !class_in_current_package (DECL_CONTEXT (member));
10102 /* Test deprecated decl access. */
10104 check_deprecation (tree wfl, tree decl)
10109 if (! flag_deprecated)
10112 /* We want to look at the element type of arrays here, so we strip
10113 all surrounding array types. */
10114 if (TYPE_ARRAY_P (TREE_TYPE (decl)))
10116 elt = TREE_TYPE (decl);
10117 while (TYPE_ARRAY_P (elt))
10118 elt = TYPE_ARRAY_ELEMENT (elt);
10119 /* We'll end up with a pointer type, so we use TREE_TYPE to go
10121 decl = TYPE_NAME (TREE_TYPE (elt));
10123 file = DECL_SOURCE_FILE (decl);
10125 /* Complain if the field is deprecated and the file it was defined
10126 in isn't compiled at the same time the file which contains its
10128 if (DECL_DEPRECATED (decl)
10129 && !IS_A_COMMAND_LINE_FILENAME_P (get_identifier (file)))
10132 switch (TREE_CODE (decl))
10134 case FUNCTION_DECL:
10142 parse_warning_context (wfl, "The class `%s' has been deprecated",
10143 IDENTIFIER_POINTER (DECL_NAME (decl)));
10148 /* Don't issue a message if the context as been deprecated as a
10150 if (! CLASS_DEPRECATED (TYPE_NAME (DECL_CONTEXT (decl))))
10151 parse_warning_context
10152 (wfl, "The %s `%s' in class `%s' has been deprecated",
10153 the, lang_printable_name (decl, 0),
10154 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (DECL_CONTEXT (decl)))));
10158 /* Returns 1 if class was declared in the current package, 0 otherwise */
10160 static GTY(()) tree cicp_cache;
10162 class_in_current_package (tree class)
10164 int qualified_flag;
10167 if (cicp_cache == class)
10170 qualified_flag = QUALIFIED_P (DECL_NAME (TYPE_NAME (class)));
10172 /* If the current package is empty and the name of CLASS is
10173 qualified, class isn't in the current package. If there is a
10174 current package and the name of the CLASS is not qualified, class
10175 isn't in the current package */
10176 if ((!ctxp->package && qualified_flag) || (ctxp->package && !qualified_flag))
10179 /* If there is not package and the name of CLASS isn't qualified,
10180 they belong to the same unnamed package */
10181 if (!ctxp->package && !qualified_flag)
10184 /* Compare the left part of the name of CLASS with the package name */
10185 split_qualified_name (&left, NULL, DECL_NAME (TYPE_NAME (class)));
10186 if (ctxp->package == left)
10188 cicp_cache = class;
10194 /* This function may generate code to access DECL from WHERE. This is
10195 done only if certain conditions meet. */
10198 maybe_access_field (tree decl, tree where, tree type)
10200 if (TREE_CODE (decl) == FIELD_DECL && decl != current_this
10201 && !FIELD_STATIC (decl))
10202 decl = build_field_ref (where ? where : current_this,
10203 (type ? type : DECL_CONTEXT (decl)),
10208 /* Build a method invocation, by patching PATCH. If non NULL
10209 and according to the situation, PRIMARY and WHERE may be
10210 used. IS_STATIC is set to 1 if the invoked function is static. */
10213 patch_method_invocation (tree patch, tree primary, tree where, int from_super,
10214 int *is_static, tree *ret_decl)
10216 tree wfl = TREE_OPERAND (patch, 0);
10217 tree args = TREE_OPERAND (patch, 1);
10218 tree name = EXPR_WFL_NODE (wfl);
10220 int is_static_flag = 0;
10221 int is_super_init = 0;
10222 tree this_arg = NULL_TREE;
10223 int is_array_clone_call = 0;
10225 /* Should be overridden if everything goes well. Otherwise, if
10226 something fails, it should keep this value. It stop the
10227 evaluation of a bogus assignment. See java_complete_tree,
10228 MODIFY_EXPR: for the reasons why we sometimes want to keep on
10229 evaluating an assignment */
10230 TREE_TYPE (patch) = error_mark_node;
10232 /* Since lookup functions are messing with line numbers, save the
10234 java_parser_context_save_global ();
10236 /* 15.11.1: Compile-Time Step 1: Determine Class or Interface to Search */
10238 /* Resolution of qualified name, excluding constructors */
10239 if (QUALIFIED_P (name) && !CALL_CONSTRUCTOR_P (patch))
10241 tree identifier, identifier_wfl, type, resolved;
10242 /* Extract the last IDENTIFIER of the qualified
10243 expression. This is a wfl and we will use it's location
10244 data during error report. */
10245 identifier_wfl = cut_identifier_in_qualified (wfl);
10246 identifier = EXPR_WFL_NODE (identifier_wfl);
10248 /* Given the context, IDENTIFIER is syntactically qualified
10249 as a MethodName. We need to qualify what's before */
10250 qualify_ambiguous_name (wfl);
10251 resolved = resolve_field_access (wfl, NULL, NULL);
10253 if (TREE_CODE (resolved) == VAR_DECL && FIELD_STATIC (resolved)
10254 && FIELD_FINAL (resolved)
10255 && !inherits_from_p (DECL_CONTEXT (resolved), current_class)
10256 && !flag_emit_class_files && !flag_emit_xref)
10257 resolved = build_class_init (DECL_CONTEXT (resolved), resolved);
10259 if (resolved == error_mark_node)
10260 PATCH_METHOD_RETURN_ERROR ();
10262 type = GET_SKIP_TYPE (resolved);
10263 resolve_and_layout (type, NULL_TREE);
10265 if (JPRIMITIVE_TYPE_P (type))
10267 parse_error_context
10269 "Can't invoke a method on primitive type `%s'",
10270 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type))));
10271 PATCH_METHOD_RETURN_ERROR ();
10274 list = lookup_method_invoke (0, identifier_wfl, type, identifier, args);
10275 args = nreverse (args);
10277 /* We're resolving a call from a type */
10278 if (TREE_CODE (resolved) == TYPE_DECL)
10280 if (CLASS_INTERFACE (resolved))
10282 parse_error_context
10284 "Can't make static reference to method `%s' in interface `%s'",
10285 IDENTIFIER_POINTER (identifier),
10286 IDENTIFIER_POINTER (name));
10287 PATCH_METHOD_RETURN_ERROR ();
10289 if (list && !METHOD_STATIC (list))
10291 char *fct_name = xstrdup (lang_printable_name (list, 0));
10292 parse_error_context
10294 "Can't make static reference to method `%s %s' in class `%s'",
10295 lang_printable_name (TREE_TYPE (TREE_TYPE (list)), 0),
10296 fct_name, IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type))));
10298 PATCH_METHOD_RETURN_ERROR ();
10302 this_arg = primary = resolved;
10304 if (TYPE_ARRAY_P (type) && identifier == get_identifier ("clone"))
10305 is_array_clone_call = 1;
10307 /* IDENTIFIER_WFL will be used to report any problem further */
10308 wfl = identifier_wfl;
10310 /* Resolution of simple names, names generated after a primary: or
10314 tree class_to_search = NULL_TREE;
10315 int lc; /* Looking for Constructor */
10317 /* We search constructor in their target class */
10318 if (CALL_CONSTRUCTOR_P (patch))
10320 if (TREE_CODE (patch) == NEW_CLASS_EXPR)
10321 class_to_search = EXPR_WFL_NODE (wfl);
10322 else if (EXPR_WFL_NODE (TREE_OPERAND (patch, 0)) ==
10323 this_identifier_node)
10324 class_to_search = NULL_TREE;
10325 else if (EXPR_WFL_NODE (TREE_OPERAND (patch, 0)) ==
10326 super_identifier_node)
10329 if (CLASSTYPE_SUPER (current_class))
10331 DECL_NAME (TYPE_NAME (CLASSTYPE_SUPER (current_class)));
10334 parse_error_context (wfl, "Can't invoke super constructor on java.lang.Object");
10335 PATCH_METHOD_RETURN_ERROR ();
10339 /* Class to search is NULL if we're searching the current one */
10340 if (class_to_search)
10342 class_to_search = resolve_and_layout (class_to_search, wfl);
10344 if (!class_to_search)
10346 parse_error_context
10347 (wfl, "Class `%s' not found in type declaration",
10348 IDENTIFIER_POINTER (EXPR_WFL_NODE (wfl)));
10349 PATCH_METHOD_RETURN_ERROR ();
10352 /* Can't instantiate an abstract class, but we can
10353 invoke it's constructor. It's use within the `new'
10354 context is denied here. */
10355 if (CLASS_ABSTRACT (class_to_search)
10356 && TREE_CODE (patch) == NEW_CLASS_EXPR)
10358 parse_error_context
10359 (wfl, "Class `%s' is an abstract class. It can't be instantiated",
10360 IDENTIFIER_POINTER (EXPR_WFL_NODE (wfl)));
10361 PATCH_METHOD_RETURN_ERROR ();
10364 class_to_search = TREE_TYPE (class_to_search);
10367 class_to_search = current_class;
10370 /* This is a regular search in the local class, unless an
10371 alternate class is specified. */
10374 if (where != NULL_TREE)
10375 class_to_search = where;
10376 else if (QUALIFIED_P (name))
10377 class_to_search = current_class;
10380 class_to_search = current_class;
10384 if (has_method (class_to_search, name))
10386 if (! INNER_CLASS_TYPE_P (class_to_search))
10388 parse_error_context (wfl,
10389 "No method named `%s' in scope",
10390 IDENTIFIER_POINTER (name));
10391 PATCH_METHOD_RETURN_ERROR ();
10394 = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (class_to_search)));
10400 /* NAME is a simple identifier or comes from a primary. Search
10401 in the class whose declaration contain the method being
10403 resolve_and_layout (class_to_search, NULL_TREE);
10405 list = lookup_method_invoke (lc, wfl, class_to_search, name, args);
10406 /* Don't continue if no method were found, as the next statement
10407 can't be executed then. */
10409 PATCH_METHOD_RETURN_ERROR ();
10411 if (TYPE_ARRAY_P (class_to_search)
10412 && DECL_NAME (list) == get_identifier ("clone"))
10413 is_array_clone_call = 1;
10415 /* Check for static reference if non static methods */
10416 if (check_for_static_method_reference (wfl, patch, list,
10417 class_to_search, primary))
10418 PATCH_METHOD_RETURN_ERROR ();
10420 /* Check for inner classes creation from illegal contexts */
10421 if (lc && (INNER_CLASS_TYPE_P (class_to_search)
10422 && !CLASS_STATIC (TYPE_NAME (class_to_search)))
10423 && INNER_ENCLOSING_SCOPE_CHECK (class_to_search)
10424 && !DECL_INIT_P (current_function_decl))
10426 parse_error_context
10427 (wfl, "No enclosing instance for inner class `%s' is in scope%s",
10428 lang_printable_name (class_to_search, 0),
10429 (!current_this ? "" :
10430 "; an explicit one must be provided when creating this inner class"));
10431 PATCH_METHOD_RETURN_ERROR ();
10434 /* Non static methods are called with the current object extra
10435 argument. If patch a `new TYPE()', the argument is the value
10436 returned by the object allocator. If method is resolved as a
10437 primary, use the primary otherwise use the current THIS. */
10438 args = nreverse (args);
10439 if (TREE_CODE (patch) != NEW_CLASS_EXPR)
10441 this_arg = primary ? primary : current_this;
10443 /* If we're using an access method, things are different.
10444 There are two family of cases:
10446 1) We're not generating bytecodes:
10448 - LIST is non static. It's invocation is transformed from
10449 x(a1,...,an) into this$<n>.x(a1,....an).
10450 - LIST is static. It's invocation is transformed from
10451 x(a1,...,an) into TYPE_OF(this$<n>).x(a1,....an)
10453 2) We're generating bytecodes:
10455 - LIST is non static. It's invocation is transformed from
10456 x(a1,....,an) into access$<n>(this$<n>,a1,...,an).
10457 - LIST is static. It's invocation is transformed from
10458 x(a1,....,an) into TYPE_OF(this$<n>).x(a1,....an).
10460 Of course, this$<n> can be arbitrarily complex, ranging from
10461 this$0 (the immediate outer context) to
10462 access$0(access$0(...(this$0))).
10464 maybe_use_access_method returns a nonzero value if the
10465 this_arg has to be moved into the (then generated) stub
10466 argument list. In the meantime, the selected function
10467 might have be replaced by a generated stub. */
10469 maybe_use_access_method (is_super_init, &list, &this_arg))
10471 args = tree_cons (NULL_TREE, this_arg, args);
10472 this_arg = NULL_TREE; /* So it doesn't get chained twice */
10477 /* Merge point of all resolution schemes. If we have nothing, this
10478 is an error, already signaled */
10480 PATCH_METHOD_RETURN_ERROR ();
10482 /* Check accessibility, position the is_static flag, build and
10484 if (not_accessible_p (DECL_CONTEXT (current_function_decl), list,
10485 (primary ? TREE_TYPE (TREE_TYPE (primary)) :
10486 NULL_TREE), from_super)
10487 /* Calls to clone() on array types are permitted as a special-case. */
10488 && !is_array_clone_call)
10490 const char *const fct_name = IDENTIFIER_POINTER (DECL_NAME (list));
10491 const char *const access =
10492 accessibility_string (get_access_flags_from_decl (list));
10493 const char *const klass =
10494 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (DECL_CONTEXT (list))));
10495 const char *const refklass =
10496 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (current_class)));
10497 const char *const what = (DECL_CONSTRUCTOR_P (list)
10498 ? "constructor" : "method");
10499 parse_error_context (wfl,
10500 "Can't access %s %s `%s.%s' from `%s'",
10501 access, what, klass, fct_name, refklass);
10502 PATCH_METHOD_RETURN_ERROR ();
10505 /* Deprecation check: check whether the method being invoked or the
10506 instance-being-created's type are deprecated. */
10507 if (TREE_CODE (patch) == NEW_CLASS_EXPR)
10508 check_deprecation (wfl, TYPE_NAME (DECL_CONTEXT (list)));
10509 check_deprecation (wfl, list);
10511 /* If invoking a innerclass constructor, there are hidden parameters
10513 if (TREE_CODE (patch) == NEW_CLASS_EXPR
10514 && PURE_INNER_CLASS_TYPE_P (DECL_CONTEXT (list)))
10516 /* And make sure we add the accessed local variables to be saved
10517 in field aliases. */
10518 args = build_alias_initializer_parameter_list
10519 (AIPL_FUNCTION_CTOR_INVOCATION, DECL_CONTEXT (list), args, NULL);
10521 /* Secretly pass the current_this/primary as a second argument */
10522 if (primary || current_this)
10525 tree this_type = (current_this ?
10526 TREE_TYPE (TREE_TYPE (current_this)) : NULL_TREE);
10527 /* Method's (list) enclosing context */
10528 tree mec = DECL_CONTEXT (TYPE_NAME (DECL_CONTEXT (list)));
10529 /* If we have a primary, use it. */
10531 extra_arg = primary;
10532 /* The current `this' is an inner class but isn't a direct
10533 enclosing context for the inner class we're trying to
10534 create. Build an access to the proper enclosing context
10536 else if (current_this && PURE_INNER_CLASS_TYPE_P (this_type)
10537 && this_type != TREE_TYPE (mec))
10540 extra_arg = build_access_to_thisn (current_class,
10541 TREE_TYPE (mec), 0);
10542 extra_arg = java_complete_tree (extra_arg);
10544 /* Otherwise, just use the current `this' as an enclosing
10547 extra_arg = current_this;
10548 args = tree_cons (NULL_TREE, extra_arg, args);
10551 args = tree_cons (NULL_TREE, integer_zero_node, args);
10554 /* This handles the situation where a constructor invocation needs
10555 to have an enclosing context passed as a second parameter (the
10556 constructor is one of an inner class). */
10557 if ((is_super_init ||
10558 (TREE_CODE (patch) == CALL_EXPR && name == this_identifier_node))
10559 && PURE_INNER_CLASS_TYPE_P (DECL_CONTEXT (list)))
10561 tree dest = TYPE_NAME (DECL_CONTEXT (list));
10563 build_access_to_thisn (current_class, DECL_CONTEXT (dest), 0);
10564 extra_arg = java_complete_tree (extra_arg);
10565 args = tree_cons (NULL_TREE, extra_arg, args);
10568 is_static_flag = METHOD_STATIC (list);
10569 if (! is_static_flag && this_arg != NULL_TREE)
10570 args = tree_cons (NULL_TREE, this_arg, args);
10572 /* In the context of an explicit constructor invocation, we can't
10573 invoke any method relying on `this'. Exceptions are: we're
10574 invoking a static function, primary exists and is not the current
10575 this, we're creating a new object. */
10576 if (ctxp->explicit_constructor_p
10578 && (!primary || primary == current_this)
10579 && (TREE_CODE (patch) != NEW_CLASS_EXPR))
10581 parse_error_context (wfl, "Can't reference `this' before the superclass constructor has been called");
10582 PATCH_METHOD_RETURN_ERROR ();
10584 java_parser_context_restore_global ();
10586 *is_static = is_static_flag;
10587 /* Sometimes, we want the decl of the selected method. Such as for
10591 patch = patch_invoke (patch, list, args);
10593 /* Now is a good time to insert the call to finit$ */
10594 if (is_super_init && CLASS_HAS_FINIT_P (current_class))
10596 tree finit_parms, finit_call;
10598 /* Prepare to pass hidden parameters to finit$, if any. */
10599 finit_parms = build_alias_initializer_parameter_list
10600 (AIPL_FUNCTION_FINIT_INVOCATION, current_class, NULL_TREE, NULL);
10603 build_method_invocation (build_wfl_node (finit_identifier_node),
10606 /* Generate the code used to initialize fields declared with an
10607 initialization statement and build a compound statement along
10608 with the super constructor invocation. */
10609 CAN_COMPLETE_NORMALLY (patch) = 1;
10610 patch = build (COMPOUND_EXPR, void_type_node, patch,
10611 java_complete_tree (finit_call));
10616 /* Check that we're not trying to do a static reference to a method in
10617 non static method. Return 1 if it's the case, 0 otherwise. */
10620 check_for_static_method_reference (tree wfl, tree node, tree method,
10621 tree where, tree primary)
10623 if (METHOD_STATIC (current_function_decl)
10624 && !METHOD_STATIC (method) && !primary && !CALL_CONSTRUCTOR_P (node))
10626 char *fct_name = xstrdup (lang_printable_name (method, 0));
10627 parse_error_context
10628 (wfl, "Can't make static reference to method `%s %s' in class `%s'",
10629 lang_printable_name (TREE_TYPE (TREE_TYPE (method)), 0), fct_name,
10630 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (where))));
10637 /* Fix the invocation of *MDECL if necessary in the case of a
10638 invocation from an inner class. *THIS_ARG might be modified
10639 appropriately and an alternative access to *MDECL might be
10643 maybe_use_access_method (int is_super_init, tree *mdecl, tree *this_arg)
10646 tree md = *mdecl, ta = *this_arg;
10648 int non_static_context = !METHOD_STATIC (md);
10651 || DECL_CONTEXT (md) == current_class
10652 || !PURE_INNER_CLASS_TYPE_P (current_class)
10653 || DECL_FINIT_P (md)
10654 || DECL_INSTINIT_P (md))
10657 /* If we're calling a method found in an enclosing class, generate
10658 what it takes to retrieve the right this. Don't do that if we're
10659 invoking a static method. Note that if MD's type is unrelated to
10660 CURRENT_CLASS, then the current this can be used. */
10662 if (non_static_context && DECL_CONTEXT (md) != object_type_node)
10664 ctx = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (current_class)));
10665 if (inherits_from_p (ctx, DECL_CONTEXT (md)))
10667 ta = build_current_thisn (current_class);
10668 ta = build_wfl_node (ta);
10675 maybe_build_thisn_access_method (type);
10676 if (inherits_from_p (type, DECL_CONTEXT (md)))
10678 ta = build_access_to_thisn (ctx, type, 0);
10681 type = (DECL_CONTEXT (TYPE_NAME (type)) ?
10682 TREE_TYPE (DECL_CONTEXT (TYPE_NAME (type))) : NULL_TREE);
10685 ta = java_complete_tree (ta);
10688 /* We might have to use an access method to get to MD. We can
10689 break the method access rule as far as we're not generating
10691 if (METHOD_PRIVATE (md) && flag_emit_class_files)
10693 md = build_outer_method_access_method (md);
10700 /* Returning a nonzero value indicates we were doing a non static
10701 method invocation that is now a static invocation. It will have
10702 callee displace `this' to insert it in the regular argument
10704 return (non_static_context && to_return);
10707 /* Patch an invoke expression METHOD and ARGS, based on its invocation
10711 patch_invoke (tree patch, tree method, tree args)
10714 tree original_call, t, ta;
10715 tree check = NULL_TREE;
10717 /* Last step for args: convert build-in types. If we're dealing with
10718 a new TYPE() type call, the first argument to the constructor
10719 isn't found in the incoming argument list, but delivered by
10721 t = TYPE_ARG_TYPES (TREE_TYPE (method));
10722 if (TREE_CODE (patch) == NEW_CLASS_EXPR)
10723 t = TREE_CHAIN (t);
10724 for (ta = args; t != end_params_node && ta;
10725 t = TREE_CHAIN (t), ta = TREE_CHAIN (ta))
10726 if (JPRIMITIVE_TYPE_P (TREE_TYPE (TREE_VALUE (ta))) &&
10727 TREE_TYPE (TREE_VALUE (ta)) != TREE_VALUE (t))
10728 TREE_VALUE (ta) = convert (TREE_VALUE (t), TREE_VALUE (ta));
10730 /* Resolve unresolved returned type issues */
10731 t = TREE_TYPE (TREE_TYPE (method));
10732 if (TREE_CODE (t) == POINTER_TYPE && !CLASS_LOADED_P (TREE_TYPE (t)))
10733 resolve_and_layout (TREE_TYPE (t), NULL);
10735 if (flag_emit_class_files || flag_emit_xref)
10739 switch (invocation_mode (method, CALL_USING_SUPER (patch)))
10741 case INVOKE_VIRTUAL:
10742 dtable = invoke_build_dtable (0, args);
10743 func = build_invokevirtual (dtable, method);
10746 case INVOKE_NONVIRTUAL:
10747 /* If the object for the method call is null, we throw an
10748 exception. We don't do this if the object is the current
10749 method's `this'. In other cases we just rely on an
10750 optimization pass to eliminate redundant checks. */
10751 if (TREE_VALUE (args) != current_this)
10753 /* We use a save_expr here to make sure we only evaluate
10754 the new `self' expression once. */
10755 tree save_arg = save_expr (TREE_VALUE (args));
10756 TREE_VALUE (args) = save_arg;
10757 check = java_check_reference (save_arg, 1);
10759 /* Fall through. */
10762 case INVOKE_STATIC:
10764 tree signature = build_java_signature (TREE_TYPE (method));
10765 func = build_known_method_ref (method, TREE_TYPE (method),
10766 DECL_CONTEXT (method),
10771 case INVOKE_INTERFACE:
10772 dtable = invoke_build_dtable (1, args);
10773 func = build_invokeinterface (dtable, method);
10780 /* Ensure self_type is initialized, (invokestatic). FIXME */
10781 func = build1 (NOP_EXPR, build_pointer_type (TREE_TYPE (method)), func);
10784 TREE_TYPE (patch) = TREE_TYPE (TREE_TYPE (method));
10785 TREE_OPERAND (patch, 0) = func;
10786 TREE_OPERAND (patch, 1) = args;
10787 patch = check_for_builtin (method, patch);
10788 original_call = patch;
10790 /* We're processing a `new TYPE ()' form. New is called and its
10791 returned value is the first argument to the constructor. We build
10792 a COMPOUND_EXPR and use saved expression so that the overall NEW
10793 expression value is a pointer to a newly created and initialized
10795 if (TREE_CODE (original_call) == NEW_CLASS_EXPR)
10797 tree class = DECL_CONTEXT (method);
10798 tree c1, saved_new, size, new;
10801 if (flag_emit_class_files || flag_emit_xref)
10803 TREE_TYPE (patch) = build_pointer_type (class);
10806 if (!TYPE_SIZE (class))
10807 safe_layout_class (class);
10808 size = size_in_bytes (class);
10810 (class_has_finalize_method (class) ? alloc_object_node
10811 : alloc_no_finalizer_node);
10812 new = build (CALL_EXPR, promote_type (class),
10813 build_address_of (alloc_node),
10814 build_tree_list (NULL_TREE, build_class_ref (class)),
10816 saved_new = save_expr (new);
10817 c1 = build_tree_list (NULL_TREE, saved_new);
10818 TREE_CHAIN (c1) = TREE_OPERAND (original_call, 1);
10819 TREE_OPERAND (original_call, 1) = c1;
10820 TREE_SET_CODE (original_call, CALL_EXPR);
10821 patch = build (COMPOUND_EXPR, TREE_TYPE (new), patch, saved_new);
10824 /* If CHECK is set, then we are building a check to see if the object
10826 if (check != NULL_TREE)
10828 /* We have to call force_evaluation_order now because creating a
10829 COMPOUND_EXPR wraps the arg list in a way that makes it
10830 unrecognizable by force_evaluation_order later. Yuk. */
10831 patch = build (COMPOUND_EXPR, TREE_TYPE (patch), check,
10832 force_evaluation_order (patch));
10833 TREE_SIDE_EFFECTS (patch) = 1;
10836 /* In order to be able to modify PATCH later, we SAVE_EXPR it and
10837 put it as the first expression of a COMPOUND_EXPR. The second
10838 expression being an empty statement to be later patched if
10839 necessary. We remember a TREE_LIST (the PURPOSE is the method,
10840 the VALUE is the compound) in a hashtable and return a
10841 COMPOUND_EXPR built so that the result of the evaluation of the
10842 original PATCH node is returned. */
10843 if (STATIC_CLASS_INIT_OPT_P ()
10844 && current_function_decl && METHOD_STATIC (method))
10847 tree fndecl = current_function_decl;
10848 /* We have to call force_evaluation_order now because creating a
10849 COMPOUND_EXPR wraps the arg list in a way that makes it
10850 unrecognizable by force_evaluation_order later. Yuk. */
10851 tree save = force_evaluation_order (patch);
10852 tree type = TREE_TYPE (patch);
10854 patch = build (COMPOUND_EXPR, type, save, build_java_empty_stmt ());
10855 list = tree_cons (method, patch,
10856 DECL_FUNCTION_STATIC_METHOD_INVOCATION_COMPOUND (fndecl));
10858 DECL_FUNCTION_STATIC_METHOD_INVOCATION_COMPOUND (fndecl) = list;
10860 patch = build (COMPOUND_EXPR, type, patch, save);
10867 invocation_mode (tree method, int super)
10869 int access = get_access_flags_from_decl (method);
10872 return INVOKE_SUPER;
10874 if (access & ACC_STATIC)
10875 return INVOKE_STATIC;
10877 /* We have to look for a constructor before we handle nonvirtual
10878 calls; otherwise the constructor will look nonvirtual. */
10879 if (DECL_CONSTRUCTOR_P (method))
10880 return INVOKE_STATIC;
10882 if (access & ACC_FINAL || access & ACC_PRIVATE)
10883 return INVOKE_NONVIRTUAL;
10885 if (CLASS_FINAL (TYPE_NAME (DECL_CONTEXT (method))))
10886 return INVOKE_NONVIRTUAL;
10888 if (CLASS_INTERFACE (TYPE_NAME (DECL_CONTEXT (method))))
10889 return INVOKE_INTERFACE;
10891 return INVOKE_VIRTUAL;
10894 /* Retrieve a refined list of matching methods. It covers the step
10895 15.11.2 (Compile-Time Step 2) */
10898 lookup_method_invoke (int lc, tree cl, tree class, tree name, tree arg_list)
10900 tree atl = end_params_node; /* Arg Type List */
10901 tree method, signature, list, node;
10902 const char *candidates; /* Used for error report */
10905 /* Fix the arguments */
10906 for (node = arg_list; node; node = TREE_CHAIN (node))
10908 tree current_arg = TREE_TYPE (TREE_VALUE (node));
10909 /* Non primitive type may have to be resolved */
10910 if (!JPRIMITIVE_TYPE_P (current_arg))
10911 resolve_and_layout (current_arg, NULL_TREE);
10913 if (TREE_CODE (current_arg) == RECORD_TYPE)
10914 current_arg = promote_type (current_arg);
10915 atl = tree_cons (NULL_TREE, current_arg, atl);
10918 /* Presto. If we're dealing with an anonymous class and a
10919 constructor call, generate the right constructor now, since we
10920 know the arguments' types. */
10922 if (lc && ANONYMOUS_CLASS_P (class))
10924 tree saved_current_class;
10925 tree mdecl = craft_constructor (TYPE_NAME (class), atl);
10926 saved_current_class = current_class;
10927 current_class = class;
10928 fix_constructors (mdecl);
10929 current_class = saved_current_class;
10932 /* Find all candidates and then refine the list, searching for the
10933 most specific method. */
10934 list = find_applicable_accessible_methods_list (lc, class, name, atl);
10935 list = find_most_specific_methods_list (list);
10936 if (list && !TREE_CHAIN (list))
10937 return TREE_VALUE (list);
10939 /* Issue an error. List candidates if any. Candidates are listed
10940 only if accessible (non accessible methods may end-up here for
10941 the sake of a better error report). */
10946 obstack_grow (&temporary_obstack, ". Candidates are:\n", 18);
10947 for (current = list; current; current = TREE_CHAIN (current))
10949 tree cm = TREE_VALUE (current);
10950 char string [4096];
10951 if (!cm || not_accessible_p (class, cm, NULL_TREE, 0))
10954 (string, " `%s' in `%s'%s",
10955 get_printable_method_name (cm),
10956 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (DECL_CONTEXT (cm)))),
10957 (TREE_CHAIN (current) ? "\n" : ""));
10958 obstack_grow (&temporary_obstack, string, strlen (string));
10960 obstack_1grow (&temporary_obstack, '\0');
10961 candidates = obstack_finish (&temporary_obstack);
10963 /* Issue the error message */
10964 method = make_node (FUNCTION_TYPE);
10965 TYPE_ARG_TYPES (method) = atl;
10966 signature = build_java_argument_signature (method);
10967 dup = xstrdup (lang_printable_name (class, 0));
10968 parse_error_context (cl, "Can't find %s `%s(%s)' in type `%s'%s",
10969 (lc ? "constructor" : "method"),
10970 (lc ? dup : IDENTIFIER_POINTER (name)),
10971 IDENTIFIER_POINTER (signature), dup,
10972 (candidates ? candidates : ""));
10977 /* 15.11.2.1: Find Methods that are Applicable and Accessible. LC is 1
10978 when we're looking for a constructor. */
10981 find_applicable_accessible_methods_list (int lc, tree class, tree name,
10984 static htab_t searched_classes;
10985 static int search_not_done = 0;
10986 tree list = NULL_TREE, all_list = NULL_TREE;
10988 /* Check the hash table to determine if this class has been searched
10990 if (searched_classes)
10992 if (htab_find (searched_classes, class) != NULL)
10997 searched_classes = htab_create (10, htab_hash_pointer,
10998 htab_eq_pointer, NULL);
11002 *htab_find_slot (searched_classes, class, INSERT) = class;
11004 if (!CLASS_LOADED_P (class))
11006 load_class (class, 1);
11007 safe_layout_class (class);
11010 /* Search interfaces */
11011 if (TREE_CODE (TYPE_NAME (class)) == TYPE_DECL
11012 && CLASS_INTERFACE (TYPE_NAME (class)))
11015 tree basetype_vec = BINFO_BASE_BINFOS (TYPE_BINFO (class));
11016 search_applicable_methods_list (lc, TYPE_METHODS (class),
11017 name, arglist, &list, &all_list);
11018 n = TREE_VEC_LENGTH (basetype_vec);
11019 for (i = 1; i < n; i++)
11021 tree t = BINFO_TYPE (TREE_VEC_ELT (basetype_vec, i));
11024 rlist = find_applicable_accessible_methods_list (lc, t, name,
11026 list = chainon (rlist, list);
11029 /* Search classes */
11032 search_applicable_methods_list (lc, TYPE_METHODS (class),
11033 name, arglist, &list, &all_list);
11035 /* When looking finit$, class$ or instinit$, we turn LC to 1 so
11036 that we only search in class. Note that we should have found
11037 something at this point. */
11038 if (ID_FINIT_P (name) || ID_CLASSDOLLAR_P (name) || ID_INSTINIT_P (name))
11045 /* We must search all interfaces of this class */
11048 tree basetype_vec = BINFO_BASE_BINFOS (TYPE_BINFO (class));
11049 int n = TREE_VEC_LENGTH (basetype_vec), i;
11050 for (i = 1; i < n; i++)
11052 tree t = BINFO_TYPE (TREE_VEC_ELT (basetype_vec, i));
11053 if (t != object_type_node)
11056 = find_applicable_accessible_methods_list (lc, t,
11058 list = chainon (rlist, list);
11063 /* Search superclass */
11064 if (!lc && CLASSTYPE_SUPER (class) != NULL_TREE)
11067 class = CLASSTYPE_SUPER (class);
11068 rlist = find_applicable_accessible_methods_list (lc, class,
11070 list = chainon (rlist, list);
11076 /* We're done. Reset the searched classes list and finally search
11077 java.lang.Object if it wasn't searched already. */
11078 if (!search_not_done)
11081 && TYPE_METHODS (object_type_node)
11082 && htab_find (searched_classes, object_type_node) == NULL)
11084 search_applicable_methods_list (lc,
11085 TYPE_METHODS (object_type_node),
11086 name, arglist, &list, &all_list);
11088 htab_delete (searched_classes);
11089 searched_classes = NULL;
11092 /* Either return the list obtained or all selected (but
11093 inaccessible) methods for better error report. */
11094 return (!list ? all_list : list);
11097 /* Effectively search for the appropriate method in method */
11100 search_applicable_methods_list (int lc, tree method, tree name, tree arglist,
11101 tree *list, tree *all_list)
11103 for (; method; method = TREE_CHAIN (method))
11105 /* When dealing with constructor, stop here, otherwise search
11107 if (lc && !DECL_CONSTRUCTOR_P (method))
11109 else if (!lc && (DECL_CONSTRUCTOR_P (method)
11110 || (DECL_NAME (method) != name)))
11113 if (argument_types_convertible (method, arglist))
11115 /* Retain accessible methods only */
11116 if (!not_accessible_p (DECL_CONTEXT (current_function_decl),
11117 method, NULL_TREE, 0))
11118 *list = tree_cons (NULL_TREE, method, *list);
11120 /* Also retain all selected method here */
11121 *all_list = tree_cons (NULL_TREE, method, *list);
11126 /* 15.11.2.2 Choose the Most Specific Method */
11129 find_most_specific_methods_list (tree list)
11132 int abstract, candidates;
11133 tree current, new_list = NULL_TREE;
11134 for (current = list; current; current = TREE_CHAIN (current))
11137 DECL_SPECIFIC_COUNT (TREE_VALUE (current)) = 0;
11139 for (method = list; method; method = TREE_CHAIN (method))
11141 tree method_v, current_v;
11142 /* Don't test a method against itself */
11143 if (method == current)
11146 method_v = TREE_VALUE (method);
11147 current_v = TREE_VALUE (current);
11149 /* Compare arguments and location where methods where declared */
11150 if (argument_types_convertible (method_v, current_v))
11152 if (valid_method_invocation_conversion_p
11153 (DECL_CONTEXT (method_v), DECL_CONTEXT (current_v))
11154 || (INNER_CLASS_TYPE_P (DECL_CONTEXT (current_v))
11155 && enclosing_context_p (DECL_CONTEXT (method_v),
11156 DECL_CONTEXT (current_v))))
11158 int v = (DECL_SPECIFIC_COUNT (current_v) +=
11159 (INNER_CLASS_TYPE_P (DECL_CONTEXT (current_v)) ? 2 : 1));
11160 max = (v > max ? v : max);
11166 /* Review the list and select the maximally specific methods */
11167 for (current = list, abstract = -1, candidates = -1;
11168 current; current = TREE_CHAIN (current))
11169 if (DECL_SPECIFIC_COUNT (TREE_VALUE (current)) == max)
11171 new_list = tree_cons (NULL_TREE, TREE_VALUE (current), new_list);
11172 abstract += (METHOD_ABSTRACT (TREE_VALUE (current)) ? 1 : 0);
11176 /* If we have several and they're all abstract, just pick the
11178 if (candidates > 0 && candidates == abstract)
11180 /* FIXME: merge the throws clauses. There is no convenient way
11181 to do this in gcj right now, since ideally we'd like to
11182 introduce a new METHOD_DECL here, but that is really not
11184 new_list = nreverse (new_list);
11185 TREE_CHAIN (new_list) = NULL_TREE;
11189 /* We have several (we couldn't find a most specific), all but one
11190 are abstract, we pick the only non abstract one. */
11191 if (candidates > 0 && (candidates == abstract+1))
11193 for (current = new_list; current; current = TREE_CHAIN (current))
11194 if (!METHOD_ABSTRACT (TREE_VALUE (current)))
11196 TREE_CHAIN (current) = NULL_TREE;
11197 new_list = current;
11201 /* If we can't find one, lower expectations and try to gather multiple
11202 maximally specific methods */
11203 while (!new_list && max)
11207 if (DECL_SPECIFIC_COUNT (TREE_VALUE (current)) == max)
11208 new_list = tree_cons (NULL_TREE, TREE_VALUE (current), new_list);
11215 /* Make sure that the type of each M2_OR_ARGLIST arguments can be
11216 converted by method invocation conversion (5.3) to the type of the
11217 corresponding parameter of M1. Implementation expects M2_OR_ARGLIST
11218 to change less often than M1. */
11220 static GTY(()) tree m2_arg_value;
11221 static GTY(()) tree m2_arg_cache;
11224 argument_types_convertible (tree m1, tree m2_or_arglist)
11226 tree m1_arg, m2_arg;
11228 SKIP_THIS_AND_ARTIFICIAL_PARMS (m1_arg, m1)
11230 if (m2_arg_value == m2_or_arglist)
11231 m2_arg = m2_arg_cache;
11234 /* M2_OR_ARGLIST can be a function DECL or a raw list of
11236 if (m2_or_arglist && TREE_CODE (m2_or_arglist) == FUNCTION_DECL)
11238 m2_arg = TYPE_ARG_TYPES (TREE_TYPE (m2_or_arglist));
11239 if (!METHOD_STATIC (m2_or_arglist))
11240 m2_arg = TREE_CHAIN (m2_arg);
11243 m2_arg = m2_or_arglist;
11245 m2_arg_value = m2_or_arglist;
11246 m2_arg_cache = m2_arg;
11249 while (m1_arg != end_params_node && m2_arg != end_params_node)
11251 resolve_and_layout (TREE_VALUE (m1_arg), NULL_TREE);
11252 if (!valid_method_invocation_conversion_p (TREE_VALUE (m1_arg),
11253 TREE_VALUE (m2_arg)))
11255 m1_arg = TREE_CHAIN (m1_arg);
11256 m2_arg = TREE_CHAIN (m2_arg);
11258 return m1_arg == end_params_node && m2_arg == end_params_node;
11261 /* Qualification routines */
11263 /* Given a name x.y.z, look up x locally. If it's found, save the
11264 decl. If it's not found, mark the name as RESOLVE_PACKAGE_NAME_P,
11265 so that we later try and load the appropriate classes. */
11267 qualify_ambiguous_name (tree id)
11271 /* We inspect the first item of the qualification list. As a sanity
11272 check, make sure that it is an identfier node. */
11273 tree qual = EXPR_WFL_QUALIFICATION (id);
11274 tree qual_wfl = QUAL_WFL (qual);
11276 if (TREE_CODE (qual_wfl) != EXPR_WITH_FILE_LOCATION)
11279 name = EXPR_WFL_NODE (qual_wfl);
11281 /* If we don't have an identifier, or we have a 'this' or 'super',
11282 then field access processing is all we need : there is nothing
11284 if (!name || TREE_CODE (name) != IDENTIFIER_NODE ||
11285 name == this_identifier_node ||
11286 name == super_identifier_node)
11289 /* If name appears within the scope of a local variable declaration
11290 or parameter declaration, or is a field within an enclosing
11291 class, then it is an expression name. Save the decl and let
11292 resolve_field_access do it's work. */
11293 if ((decl = IDENTIFIER_LOCAL_VALUE (name)) ||
11294 (decl = lookup_field_wrapper (current_class, name)))
11296 QUAL_RESOLUTION (qual) = decl;
11300 /* If name is a known class name (either declared or imported), mark
11301 us as a type name. */
11302 if ((decl = resolve_and_layout (name, NULL_TREE)))
11304 RESOLVE_TYPE_NAME_P (qual_wfl) = 1;
11305 QUAL_RESOLUTION (qual) = decl;
11308 /* Check here that NAME isn't declared by more than one
11309 type-import-on-demand declaration of the compilation unit
11310 containing NAME. FIXME */
11312 /* We couldn't find a declaration for the name. Assume for now that
11313 we have a qualified class name that needs to be loaded from an
11314 external class file. */
11316 RESOLVE_PACKAGE_NAME_P (qual_wfl) = 1;
11318 /* Propagate the qualification across other components of the
11320 for (qual = TREE_CHAIN (qual); qual;
11321 qual_wfl = QUAL_WFL (qual), qual = TREE_CHAIN (qual))
11323 if (RESOLVE_PACKAGE_NAME_P (qual_wfl))
11324 RESOLVE_PACKAGE_NAME_P (QUAL_WFL (qual)) = 1;
11327 /* Store the global qualification for the ambiguous part of ID back
11329 if (RESOLVE_TYPE_NAME_P (qual_wfl))
11330 RESOLVE_TYPE_NAME_P (id) = 1;
11331 else if (RESOLVE_PACKAGE_NAME_P (qual_wfl))
11332 RESOLVE_PACKAGE_NAME_P (id) = 1;
11335 /* Patch tree nodes in a function body. When a BLOCK is found, push
11336 local variable decls if present.
11337 Same as java_complete_lhs, but does resolve static finals to values. */
11340 java_complete_tree (tree node)
11342 node = java_complete_lhs (node);
11343 if (JDECL_P (node) && CLASS_FINAL_VARIABLE_P (node)
11344 && DECL_INITIAL (node) != NULL_TREE
11345 && !flag_emit_xref)
11347 tree value = fold_constant_for_init (node, node);
11348 if (value != NULL_TREE)
11355 java_stabilize_reference (tree node)
11357 if (TREE_CODE (node) == COMPOUND_EXPR)
11359 tree op0 = TREE_OPERAND (node, 0);
11360 tree op1 = TREE_OPERAND (node, 1);
11361 TREE_OPERAND (node, 0) = save_expr (op0);
11362 TREE_OPERAND (node, 1) = java_stabilize_reference (op1);
11365 return stabilize_reference (node);
11368 /* Patch tree nodes in a function body. When a BLOCK is found, push
11369 local variable decls if present.
11370 Same as java_complete_tree, but does not resolve static finals to values. */
11373 java_complete_lhs (tree node)
11375 tree nn, cn, wfl_op1, wfl_op2, wfl_op3;
11378 /* CONVERT_EXPR always has its type set, even though it needs to be
11380 if (TREE_TYPE (node) && TREE_CODE (node) != CONVERT_EXPR)
11383 /* The switch block implements cases processing container nodes
11384 first. Contained nodes are always written back. Leaves come
11385 next and return a value. */
11386 switch (TREE_CODE (node))
11390 /* 1- Block section.
11391 Set the local values on decl names so we can identify them
11392 faster when they're referenced. At that stage, identifiers
11393 are legal so we don't check for declaration errors. */
11394 for (cn = BLOCK_EXPR_DECLS (node); cn; cn = TREE_CHAIN (cn))
11396 DECL_CONTEXT (cn) = current_function_decl;
11397 IDENTIFIER_LOCAL_VALUE (DECL_NAME (cn)) = cn;
11399 if (BLOCK_EXPR_BODY (node) == NULL_TREE)
11400 CAN_COMPLETE_NORMALLY (node) = 1;
11403 tree stmt = BLOCK_EXPR_BODY (node);
11405 int error_seen = 0;
11406 if (TREE_CODE (stmt) == COMPOUND_EXPR)
11408 /* Re-order from (((A; B); C); ...; Z) to
11409 (A; (B; (C ; (...; Z)))).
11410 This makes it easier to scan the statements left-to-right
11411 without using recursion (which might overflow the stack
11412 if the block has many statements. */
11415 tree left = TREE_OPERAND (stmt, 0);
11416 if (TREE_CODE (left) != COMPOUND_EXPR)
11418 TREE_OPERAND (stmt, 0) = TREE_OPERAND (left, 1);
11419 TREE_OPERAND (left, 1) = stmt;
11422 BLOCK_EXPR_BODY (node) = stmt;
11425 /* Now do the actual complete, without deep recursion for
11427 ptr = &BLOCK_EXPR_BODY (node);
11428 while (TREE_CODE (*ptr) == COMPOUND_EXPR
11429 && !IS_EMPTY_STMT (TREE_OPERAND (*ptr, 1)))
11431 tree cur = java_complete_tree (TREE_OPERAND (*ptr, 0));
11432 tree *next = &TREE_OPERAND (*ptr, 1);
11433 TREE_OPERAND (*ptr, 0) = cur;
11434 if (IS_EMPTY_STMT (cur))
11436 /* Optimization; makes it easier to detect empty bodies.
11437 Most useful for <clinit> with all-constant initializer. */
11441 if (TREE_CODE (cur) == ERROR_MARK)
11443 else if (! CAN_COMPLETE_NORMALLY (cur))
11448 if (TREE_CODE (wfl_op2) == BLOCK)
11449 wfl_op2 = BLOCK_EXPR_BODY (wfl_op2);
11450 else if (TREE_CODE (wfl_op2) == COMPOUND_EXPR)
11451 wfl_op2 = TREE_OPERAND (wfl_op2, 0);
11455 if (TREE_CODE (wfl_op2) != CASE_EXPR
11456 && TREE_CODE (wfl_op2) != DEFAULT_EXPR)
11457 unreachable_stmt_error (*ptr);
11459 if (TREE_TYPE (*ptr) == NULL_TREE)
11460 TREE_TYPE (*ptr) = void_type_node;
11463 *ptr = java_complete_tree (*ptr);
11465 if (TREE_CODE (*ptr) == ERROR_MARK || error_seen > 0)
11466 return error_mark_node;
11467 CAN_COMPLETE_NORMALLY (node) = CAN_COMPLETE_NORMALLY (*ptr);
11469 /* Turn local bindings to null */
11470 for (cn = BLOCK_EXPR_DECLS (node); cn; cn = TREE_CHAIN (cn))
11471 IDENTIFIER_LOCAL_VALUE (DECL_NAME (cn)) = NULL_TREE;
11473 TREE_TYPE (node) = void_type_node;
11476 /* 2- They are expressions but ultimately deal with statements */
11479 wfl_op1 = TREE_OPERAND (node, 0);
11480 COMPLETE_CHECK_OP_0 (node);
11481 /* 14.19 A throw statement cannot complete normally. */
11482 CAN_COMPLETE_NORMALLY (node) = 0;
11483 return patch_throw_statement (node, wfl_op1);
11485 case SYNCHRONIZED_EXPR:
11486 wfl_op1 = TREE_OPERAND (node, 0);
11487 return patch_synchronized_statement (node, wfl_op1);
11490 return patch_try_statement (node);
11492 case TRY_FINALLY_EXPR:
11493 COMPLETE_CHECK_OP_0 (node);
11494 COMPLETE_CHECK_OP_1 (node);
11495 if (IS_EMPTY_STMT (TREE_OPERAND (node, 0)))
11496 /* Reduce try/finally nodes with an empty try block. */
11497 return TREE_OPERAND (node, 1);
11498 if (IS_EMPTY_STMT (TREE_OPERAND (node, 1)))
11499 /* Likewise for an empty finally block. */
11500 return TREE_OPERAND (node, 0);
11501 CAN_COMPLETE_NORMALLY (node)
11502 = (CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 0))
11503 && CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 1)));
11504 TREE_TYPE (node) = TREE_TYPE (TREE_OPERAND (node, 0));
11507 case LABELED_BLOCK_EXPR:
11508 PUSH_LABELED_BLOCK (node);
11509 if (LABELED_BLOCK_BODY (node))
11510 COMPLETE_CHECK_OP_1 (node);
11511 TREE_TYPE (node) = void_type_node;
11512 POP_LABELED_BLOCK ();
11514 if (IS_EMPTY_STMT (LABELED_BLOCK_BODY (node)))
11516 LABELED_BLOCK_BODY (node) = NULL_TREE;
11517 CAN_COMPLETE_NORMALLY (node) = 1;
11519 else if (CAN_COMPLETE_NORMALLY (LABELED_BLOCK_BODY (node)))
11520 CAN_COMPLETE_NORMALLY (node) = 1;
11523 case EXIT_BLOCK_EXPR:
11524 /* We don't complete operand 1, because it's the return value of
11525 the EXIT_BLOCK_EXPR which doesn't exist it Java */
11526 return patch_bc_statement (node);
11529 cn = java_complete_tree (TREE_OPERAND (node, 0));
11530 if (cn == error_mark_node)
11533 /* First, the case expression must be constant. Values of final
11534 fields are accepted. */
11536 if ((TREE_CODE (cn) == COMPOUND_EXPR || TREE_CODE (cn) == COMPONENT_REF)
11537 && JDECL_P (TREE_OPERAND (cn, 1))
11538 && FIELD_FINAL (TREE_OPERAND (cn, 1))
11539 && DECL_INITIAL (TREE_OPERAND (cn, 1)))
11541 cn = fold_constant_for_init (DECL_INITIAL (TREE_OPERAND (cn, 1)),
11542 TREE_OPERAND (cn, 1));
11544 /* Accept final locals too. */
11545 else if (TREE_CODE (cn) == VAR_DECL && DECL_FINAL (cn)
11546 && DECL_INITIAL (cn))
11547 cn = fold_constant_for_init (DECL_INITIAL (cn), cn);
11549 if (!TREE_CONSTANT (cn) && !flag_emit_xref)
11551 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
11552 parse_error_context (node, "Constant expression required");
11553 return error_mark_node;
11556 nn = ctxp->current_loop;
11558 /* It must be assignable to the type of the switch expression. */
11559 if (!try_builtin_assignconv (NULL_TREE,
11560 TREE_TYPE (TREE_OPERAND (nn, 0)), cn))
11562 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
11563 parse_error_context
11565 "Incompatible type for case. Can't convert `%s' to `int'",
11566 lang_printable_name (TREE_TYPE (cn), 0));
11567 return error_mark_node;
11570 cn = fold (convert (int_type_node, cn));
11571 TREE_CONSTANT_OVERFLOW (cn) = 0;
11572 CAN_COMPLETE_NORMALLY (cn) = 1;
11574 /* Save the label on a list so that we can later check for
11576 case_label_list = tree_cons (node, cn, case_label_list);
11578 /* Multiple instance of a case label bearing the same value is
11579 checked later. The case expression is all right so far. */
11580 if (TREE_CODE (cn) == VAR_DECL)
11581 cn = DECL_INITIAL (cn);
11582 TREE_OPERAND (node, 0) = cn;
11583 TREE_TYPE (node) = void_type_node;
11584 CAN_COMPLETE_NORMALLY (node) = 1;
11585 TREE_SIDE_EFFECTS (node) = 1;
11589 nn = ctxp->current_loop;
11590 /* Only one default label is allowed per switch statement */
11591 if (SWITCH_HAS_DEFAULT (nn))
11593 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
11594 parse_error_context (wfl_operator,
11595 "Duplicate case label: `default'");
11596 return error_mark_node;
11599 SWITCH_HAS_DEFAULT (nn) = 1;
11600 TREE_TYPE (node) = void_type_node;
11601 TREE_SIDE_EFFECTS (node) = 1;
11602 CAN_COMPLETE_NORMALLY (node) = 1;
11608 /* Check whether the loop was enclosed in a labeled
11609 statement. If not, create one, insert the loop in it and
11611 nn = patch_loop_statement (node);
11613 /* Anyways, walk the body of the loop */
11614 if (TREE_CODE (node) == LOOP_EXPR)
11615 TREE_OPERAND (node, 0) = java_complete_tree (TREE_OPERAND (node, 0));
11616 /* Switch statement: walk the switch expression and the cases */
11618 node = patch_switch_statement (node);
11620 if (node == error_mark_node || TREE_OPERAND (node, 0) == error_mark_node)
11621 nn = error_mark_node;
11624 TREE_TYPE (nn) = TREE_TYPE (node) = void_type_node;
11625 /* If we returned something different, that's because we
11626 inserted a label. Pop the label too. */
11629 if (CAN_COMPLETE_NORMALLY (node))
11630 CAN_COMPLETE_NORMALLY (nn) = 1;
11631 POP_LABELED_BLOCK ();
11638 TREE_OPERAND (node, 0) = java_complete_tree (TREE_OPERAND (node, 0));
11639 return patch_exit_expr (node);
11643 TREE_OPERAND (node, 0) = java_complete_tree (TREE_OPERAND (node, 0));
11644 if (TREE_OPERAND (node, 0) == error_mark_node)
11645 return error_mark_node;
11646 /* then-else branches */
11647 TREE_OPERAND (node, 1) = java_complete_tree (TREE_OPERAND (node, 1));
11648 if (TREE_OPERAND (node, 1) == error_mark_node)
11649 return error_mark_node;
11650 TREE_OPERAND (node, 2) = java_complete_tree (TREE_OPERAND (node, 2));
11651 if (TREE_OPERAND (node, 2) == error_mark_node)
11652 return error_mark_node;
11653 return patch_if_else_statement (node);
11656 case CONDITIONAL_EXPR:
11658 wfl_op1 = TREE_OPERAND (node, 0);
11659 COMPLETE_CHECK_OP_0 (node);
11660 wfl_op2 = TREE_OPERAND (node, 1);
11661 COMPLETE_CHECK_OP_1 (node);
11662 wfl_op3 = TREE_OPERAND (node, 2);
11663 COMPLETE_CHECK_OP_2 (node);
11664 return patch_conditional_expr (node, wfl_op1, wfl_op2);
11666 /* 3- Expression section */
11667 case COMPOUND_EXPR:
11668 wfl_op2 = TREE_OPERAND (node, 1);
11669 TREE_OPERAND (node, 0) = nn =
11670 java_complete_tree (TREE_OPERAND (node, 0));
11671 if (IS_EMPTY_STMT (wfl_op2))
11672 CAN_COMPLETE_NORMALLY (node) = CAN_COMPLETE_NORMALLY (nn);
11675 if (! CAN_COMPLETE_NORMALLY (nn) && TREE_CODE (nn) != ERROR_MARK)
11677 /* An unreachable condition in a do-while statement
11678 is *not* (technically) an unreachable statement. */
11680 if (TREE_CODE (nn) == EXPR_WITH_FILE_LOCATION)
11681 nn = EXPR_WFL_NODE (nn);
11682 /* NN can be NULL_TREE exactly when UPDATE is, in
11683 finish_for_loop. */
11684 if (nn != NULL_TREE && TREE_CODE (nn) != EXIT_EXPR)
11686 SET_WFL_OPERATOR (wfl_operator, node, wfl_op2);
11687 if (SUPPRESS_UNREACHABLE_ERROR (nn))
11689 /* Perhaps this warning should have an
11690 associated flag. The code being compiled is
11691 pedantically correct, but useless. */
11692 parse_warning_context (wfl_operator,
11693 "Unreachable statement");
11696 parse_error_context (wfl_operator,
11697 "Unreachable statement");
11700 TREE_OPERAND (node, 1) = java_complete_tree (TREE_OPERAND (node, 1));
11701 if (TREE_OPERAND (node, 1) == error_mark_node)
11702 return error_mark_node;
11703 /* Even though we might allow the case where the first
11704 operand doesn't return normally, we still should compute
11705 CAN_COMPLETE_NORMALLY correctly. */
11706 CAN_COMPLETE_NORMALLY (node)
11707 = (CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 0))
11708 && CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 1)));
11710 TREE_TYPE (node) = TREE_TYPE (TREE_OPERAND (node, 1));
11714 /* CAN_COMPLETE_NORMALLY (node) = 0; */
11715 return patch_return (node);
11717 case EXPR_WITH_FILE_LOCATION:
11718 if (!EXPR_WFL_NODE (node) /* Or a PRIMARY flag ? */
11719 || TREE_CODE (EXPR_WFL_NODE (node)) == IDENTIFIER_NODE)
11722 node = resolve_expression_name (node, NULL);
11723 if (node == error_mark_node)
11725 /* Keep line number information somewhere were it doesn't
11726 disrupt the completion process. */
11727 if (flag_emit_xref && TREE_CODE (node) != CALL_EXPR)
11729 EXPR_WFL_NODE (wfl) = TREE_OPERAND (node, 1);
11730 TREE_OPERAND (node, 1) = wfl;
11732 CAN_COMPLETE_NORMALLY (node) = 1;
11737 int save_lineno = input_line;
11738 input_line = EXPR_WFL_LINENO (node);
11739 body = java_complete_tree (EXPR_WFL_NODE (node));
11740 input_line = save_lineno;
11741 EXPR_WFL_NODE (node) = body;
11742 TREE_SIDE_EFFECTS (node) = TREE_SIDE_EFFECTS (body);
11743 CAN_COMPLETE_NORMALLY (node) = CAN_COMPLETE_NORMALLY (body);
11744 if (IS_EMPTY_STMT (body) || TREE_CONSTANT (body))
11746 /* Makes it easier to constant fold, detect empty bodies. */
11749 if (body == error_mark_node)
11751 /* Its important for the evaluation of assignment that
11752 this mark on the TREE_TYPE is propagated. */
11753 TREE_TYPE (node) = error_mark_node;
11754 return error_mark_node;
11757 TREE_TYPE (node) = TREE_TYPE (EXPR_WFL_NODE (node));
11762 case NEW_ARRAY_EXPR:
11763 /* Patch all the dimensions */
11765 for (cn = TREE_OPERAND (node, 1); cn; cn = TREE_CHAIN (cn))
11767 int location = EXPR_WFL_LINECOL (TREE_VALUE (cn));
11768 tree dim = convert (int_type_node,
11769 java_complete_tree (TREE_VALUE (cn)));
11770 if (dim == error_mark_node)
11777 TREE_VALUE (cn) = dim;
11778 /* Setup the location of the current dimension, for
11779 later error report. */
11780 TREE_PURPOSE (cn) =
11781 build_expr_wfl (NULL_TREE, input_filename, 0, 0);
11782 EXPR_WFL_LINECOL (TREE_PURPOSE (cn)) = location;
11785 /* They complete the array creation expression, if no errors
11787 CAN_COMPLETE_NORMALLY (node) = 1;
11788 return (flag ? error_mark_node
11789 : force_evaluation_order (patch_newarray (node)));
11791 case NEW_ANONYMOUS_ARRAY_EXPR:
11792 /* Create the array type if necessary. */
11793 if (ANONYMOUS_ARRAY_DIMS_SIG (node))
11795 tree type = ANONYMOUS_ARRAY_BASE_TYPE (node);
11796 if (!(type = resolve_type_during_patch (type)))
11797 return error_mark_node;
11798 type = build_array_from_name (type, NULL_TREE,
11799 ANONYMOUS_ARRAY_DIMS_SIG (node), NULL);
11800 ANONYMOUS_ARRAY_BASE_TYPE (node) = build_pointer_type (type);
11802 node = patch_new_array_init (ANONYMOUS_ARRAY_BASE_TYPE (node),
11803 ANONYMOUS_ARRAY_INITIALIZER (node));
11804 if (node == error_mark_node)
11805 return error_mark_node;
11806 CAN_COMPLETE_NORMALLY (node) = 1;
11809 case NEW_CLASS_EXPR:
11811 /* Complete function's argument(s) first */
11812 if (complete_function_arguments (node))
11813 return error_mark_node;
11816 tree decl, wfl = TREE_OPERAND (node, 0);
11817 int in_this = CALL_THIS_CONSTRUCTOR_P (node);
11818 int from_super = (EXPR_WFL_NODE (TREE_OPERAND (node, 0)) ==
11819 super_identifier_node);
11821 int location = EXPR_WFL_LINECOL (node);
11823 node = patch_method_invocation (node, NULL_TREE, NULL_TREE,
11824 from_super, 0, &decl);
11825 if (node == error_mark_node)
11826 return error_mark_node;
11828 if (TREE_CODE (node) == CALL_EXPR
11829 && TREE_OPERAND (node, 1) != NULL_TREE)
11830 arguments = TREE_VALUE (TREE_OPERAND (node, 1));
11832 arguments = NULL_TREE;
11833 check_thrown_exceptions (location, decl, arguments);
11834 /* If we call this(...), register signature and positions */
11836 DECL_CONSTRUCTOR_CALLS (current_function_decl) =
11837 tree_cons (wfl, decl,
11838 DECL_CONSTRUCTOR_CALLS (current_function_decl));
11839 CAN_COMPLETE_NORMALLY (node) = 1;
11840 return force_evaluation_order (node);
11844 /* Save potential wfls */
11845 wfl_op1 = TREE_OPERAND (node, 0);
11846 TREE_OPERAND (node, 0) = nn = java_complete_lhs (wfl_op1);
11848 if (MODIFY_EXPR_FROM_INITIALIZATION_P (node)
11849 && TREE_CODE (nn) == VAR_DECL && TREE_STATIC (nn)
11850 && DECL_INITIAL (nn) != NULL_TREE)
11854 value = fold_constant_for_init (nn, nn);
11856 /* When we have a primitype type, or a string and we're not
11857 emitting a class file, we actually don't want to generate
11858 anything for the assignment. */
11859 if (value != NULL_TREE &&
11860 (JPRIMITIVE_TYPE_P (TREE_TYPE (value)) ||
11861 (TREE_TYPE (value) == string_ptr_type_node &&
11862 ! flag_emit_class_files)))
11864 /* Prepare node for patch_assignment */
11865 TREE_OPERAND (node, 1) = value;
11866 /* Call patch assignment to verify the assignment */
11867 if (patch_assignment (node, wfl_op1) == error_mark_node)
11868 return error_mark_node;
11869 /* Set DECL_INITIAL properly (a conversion might have
11870 been decided by patch_assignment) and return the
11871 empty statement. */
11874 tree patched = patch_string (TREE_OPERAND (node, 1));
11876 DECL_INITIAL (nn) = patched;
11878 DECL_INITIAL (nn) = TREE_OPERAND (node, 1);
11879 DECL_FIELD_FINAL_IUD (nn) = 1;
11880 return build_java_empty_stmt ();
11883 if (! flag_emit_class_files)
11884 DECL_INITIAL (nn) = NULL_TREE;
11886 wfl_op2 = TREE_OPERAND (node, 1);
11888 if (TREE_OPERAND (node, 0) == error_mark_node)
11889 return error_mark_node;
11891 flag = COMPOUND_ASSIGN_P (wfl_op2);
11894 /* This might break when accessing outer field from inner
11895 class. TESTME, FIXME */
11896 tree lvalue = java_stabilize_reference (TREE_OPERAND (node, 0));
11898 /* Hand stabilize the lhs on both places */
11899 TREE_OPERAND (node, 0) = lvalue;
11900 TREE_OPERAND (TREE_OPERAND (node, 1), 0) =
11901 (flag_emit_class_files ? lvalue : save_expr (lvalue));
11903 /* 15.25.2.a: Left hand is not an array access. FIXME */
11904 /* Now complete the RHS. We write it back later on. */
11905 nn = java_complete_tree (TREE_OPERAND (node, 1));
11907 if ((cn = patch_string (nn)))
11910 /* The last part of the rewrite for E1 op= E2 is to have
11911 E1 = (T)(E1 op E2), with T being the type of E1. */
11912 nn = java_complete_tree (build_cast (EXPR_WFL_LINECOL (wfl_op2),
11913 TREE_TYPE (lvalue), nn));
11915 /* If the assignment is compound and has reference type,
11916 then ensure the LHS has type String and nothing else. */
11917 if (JREFERENCE_TYPE_P (TREE_TYPE (lvalue))
11918 && ! JSTRING_TYPE_P (TREE_TYPE (lvalue)))
11919 parse_error_context (wfl_op2,
11920 "Incompatible type for `+='. Can't convert `%s' to `java.lang.String'",
11921 lang_printable_name (TREE_TYPE (lvalue), 0));
11923 /* 15.25.2.b: Left hand is an array access. FIXME */
11926 /* If we're about to patch a NEW_ARRAY_INIT, we call a special
11927 function to complete this RHS. Note that a NEW_ARRAY_INIT
11928 might have been already fully expanded if created as a result
11929 of processing an anonymous array initializer. We avoid doing
11930 the operation twice by testing whether the node already bears
11932 else if (TREE_CODE (wfl_op2) == NEW_ARRAY_INIT && !TREE_TYPE (wfl_op2))
11933 nn = patch_new_array_init (TREE_TYPE (TREE_OPERAND (node, 0)),
11934 TREE_OPERAND (node, 1));
11935 /* Otherwise we simply complete the RHS */
11937 nn = java_complete_tree (TREE_OPERAND (node, 1));
11939 if (nn == error_mark_node)
11940 return error_mark_node;
11942 /* Write back the RHS as we evaluated it. */
11943 TREE_OPERAND (node, 1) = nn;
11945 /* In case we're handling = with a String as a RHS, we need to
11946 produce a String out of the RHS (it might still be a
11947 STRING_CST or a StringBuffer at this stage */
11948 if ((nn = patch_string (TREE_OPERAND (node, 1))))
11949 TREE_OPERAND (node, 1) = nn;
11951 if ((nn = outer_field_access_fix (wfl_op1, TREE_OPERAND (node, 0),
11952 TREE_OPERAND (node, 1))))
11954 /* We return error_mark_node if outer_field_access_fix
11955 detects we write into a final. */
11956 if (nn == error_mark_node)
11957 return error_mark_node;
11962 node = patch_assignment (node, wfl_op1);
11963 if (node == error_mark_node)
11964 return error_mark_node;
11965 /* Reorganize the tree if necessary. */
11966 if (flag && (!JREFERENCE_TYPE_P (TREE_TYPE (node))
11967 || JSTRING_P (TREE_TYPE (node))))
11968 node = java_refold (node);
11971 /* Seek to set DECL_INITIAL to a proper value, since it might have
11972 undergone a conversion in patch_assignment. We do that only when
11973 it's necessary to have DECL_INITIAL properly set. */
11974 nn = TREE_OPERAND (node, 0);
11975 if (TREE_CODE (nn) == VAR_DECL
11976 && DECL_INITIAL (nn) && CONSTANT_VALUE_P (DECL_INITIAL (nn))
11977 && FIELD_STATIC (nn) && FIELD_FINAL (nn)
11978 && (JPRIMITIVE_TYPE_P (TREE_TYPE (nn))
11979 || TREE_TYPE (nn) == string_ptr_type_node))
11980 DECL_INITIAL (nn) = TREE_OPERAND (node, 1);
11982 CAN_COMPLETE_NORMALLY (node) = 1;
11994 case TRUNC_MOD_EXPR:
11995 case TRUNC_DIV_EXPR:
11997 case TRUTH_ANDIF_EXPR:
11998 case TRUTH_ORIF_EXPR:
12005 /* Operands 0 and 1 are WFL in certain cases only. patch_binop
12006 knows how to handle those cases. */
12007 wfl_op1 = TREE_OPERAND (node, 0);
12008 wfl_op2 = TREE_OPERAND (node, 1);
12010 CAN_COMPLETE_NORMALLY (node) = 1;
12011 /* Don't complete string nodes if dealing with the PLUS operand. */
12012 if (TREE_CODE (node) != PLUS_EXPR || !JSTRING_P (wfl_op1))
12014 nn = java_complete_tree (wfl_op1);
12015 if (nn == error_mark_node)
12016 return error_mark_node;
12018 TREE_OPERAND (node, 0) = nn;
12020 if (TREE_CODE (node) != PLUS_EXPR || !JSTRING_P (wfl_op2))
12022 nn = java_complete_tree (wfl_op2);
12023 if (nn == error_mark_node)
12024 return error_mark_node;
12026 TREE_OPERAND (node, 1) = nn;
12028 return patch_binop (node, wfl_op1, wfl_op2);
12030 case INSTANCEOF_EXPR:
12031 wfl_op1 = TREE_OPERAND (node, 0);
12032 COMPLETE_CHECK_OP_0 (node);
12033 if (flag_emit_xref)
12035 TREE_TYPE (node) = boolean_type_node;
12038 return patch_binop (node, wfl_op1, TREE_OPERAND (node, 1));
12040 case UNARY_PLUS_EXPR:
12042 case TRUTH_NOT_EXPR:
12044 case PREDECREMENT_EXPR:
12045 case PREINCREMENT_EXPR:
12046 case POSTDECREMENT_EXPR:
12047 case POSTINCREMENT_EXPR:
12049 /* There are cases were wfl_op1 is a WFL. patch_unaryop knows
12050 how to handle those cases. */
12051 wfl_op1 = TREE_OPERAND (node, 0);
12052 CAN_COMPLETE_NORMALLY (node) = 1;
12053 TREE_OPERAND (node, 0) = java_complete_tree (wfl_op1);
12054 if (TREE_OPERAND (node, 0) == error_mark_node)
12055 return error_mark_node;
12056 node = patch_unaryop (node, wfl_op1);
12057 CAN_COMPLETE_NORMALLY (node) = 1;
12061 /* There are cases were wfl_op1 is a WFL. patch_array_ref knows
12062 how to handle those cases. */
12063 wfl_op1 = TREE_OPERAND (node, 0);
12064 TREE_OPERAND (node, 0) = java_complete_tree (wfl_op1);
12065 if (TREE_OPERAND (node, 0) == error_mark_node)
12066 return error_mark_node;
12067 if (!flag_emit_class_files && !flag_emit_xref)
12068 TREE_OPERAND (node, 0) = save_expr (TREE_OPERAND (node, 0));
12069 /* The same applies to wfl_op2 */
12070 wfl_op2 = TREE_OPERAND (node, 1);
12071 TREE_OPERAND (node, 1) = java_complete_tree (wfl_op2);
12072 if (TREE_OPERAND (node, 1) == error_mark_node)
12073 return error_mark_node;
12074 if (!flag_emit_class_files && !flag_emit_xref)
12075 TREE_OPERAND (node, 1) = save_expr (TREE_OPERAND (node, 1));
12076 return patch_array_ref (node);
12081 case COMPONENT_REF:
12082 /* The first step in the re-write of qualified name handling. FIXME.
12083 So far, this is only to support PRIMTYPE.class -> PRIMCLASS.TYPE. */
12084 TREE_OPERAND (node, 0) = java_complete_tree (TREE_OPERAND (node, 0));
12085 if (TREE_CODE (TREE_OPERAND (node, 0)) == RECORD_TYPE)
12087 tree name = TREE_OPERAND (node, 1);
12088 tree field = lookup_field_wrapper (TREE_OPERAND (node, 0), name);
12089 if (field == NULL_TREE)
12091 error ("missing static field `%s'", IDENTIFIER_POINTER (name));
12092 return error_mark_node;
12094 if (! FIELD_STATIC (field))
12096 error ("not a static field `%s'", IDENTIFIER_POINTER (name));
12097 return error_mark_node;
12106 /* Can't use THIS in a static environment */
12109 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
12110 parse_error_context (wfl_operator,
12111 "Keyword `this' used outside allowed context");
12112 TREE_TYPE (node) = error_mark_node;
12113 return error_mark_node;
12115 if (ctxp->explicit_constructor_p)
12117 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
12118 parse_error_context
12119 (wfl_operator, "Can't reference `this' or `super' before the superclass constructor has been called");
12120 TREE_TYPE (node) = error_mark_node;
12121 return error_mark_node;
12123 return current_this;
12125 case CLASS_LITERAL:
12126 CAN_COMPLETE_NORMALLY (node) = 1;
12127 node = patch_incomplete_class_ref (node);
12128 if (node == error_mark_node)
12129 return error_mark_node;
12133 CAN_COMPLETE_NORMALLY (node) = 1;
12134 /* Ok: may be we have a STRING_CST or a crafted `StringBuffer'
12135 and it's time to turn it into the appropriate String object */
12136 if ((nn = patch_string (node)))
12139 internal_error ("No case for %s", tree_code_name [TREE_CODE (node)]);
12144 /* Complete function call's argument. Return a nonzero value is an
12145 error was found. */
12148 complete_function_arguments (tree node)
12153 ctxp->explicit_constructor_p += (CALL_EXPLICIT_CONSTRUCTOR_P (node) ? 1 : 0);
12154 for (cn = TREE_OPERAND (node, 1); cn; cn = TREE_CHAIN (cn))
12156 tree wfl = TREE_VALUE (cn), parm, temp;
12157 parm = java_complete_tree (wfl);
12159 if (parm == error_mark_node)
12164 /* If we have a string literal that we haven't transformed yet or a
12165 crafted string buffer, as a result of the use of the String
12166 `+' operator. Build `parm.toString()' and expand it. */
12167 if ((temp = patch_string (parm)))
12170 TREE_VALUE (cn) = parm;
12172 ctxp->explicit_constructor_p -= (CALL_EXPLICIT_CONSTRUCTOR_P (node) ? 1 : 0);
12176 /* Sometimes (for loops and variable initialized during their
12177 declaration), we want to wrap a statement around a WFL and turn it
12181 build_debugable_stmt (int location, tree stmt)
12183 if (TREE_CODE (stmt) != EXPR_WITH_FILE_LOCATION)
12185 stmt = build_expr_wfl (stmt, input_filename, 0, 0);
12186 EXPR_WFL_LINECOL (stmt) = location;
12188 JAVA_MAYBE_GENERATE_DEBUG_INFO (stmt);
12193 build_expr_block (tree body, tree decls)
12195 tree node = make_node (BLOCK);
12196 BLOCK_EXPR_DECLS (node) = decls;
12197 BLOCK_EXPR_BODY (node) = body;
12199 TREE_TYPE (node) = TREE_TYPE (body);
12200 TREE_SIDE_EFFECTS (node) = 1;
12204 /* Create a new function block and link it appropriately to current
12205 function block chain */
12210 tree b = build_expr_block (NULL_TREE, NULL_TREE);
12212 /* Link block B supercontext to the previous block. The current
12213 function DECL is used as supercontext when enter_a_block is called
12214 for the first time for a given function. The current function body
12215 (DECL_FUNCTION_BODY) is set to be block B. */
12217 tree fndecl = current_function_decl;
12220 BLOCK_SUPERCONTEXT (b) = current_static_block;
12221 current_static_block = b;
12224 else if (!DECL_FUNCTION_BODY (fndecl))
12226 BLOCK_SUPERCONTEXT (b) = fndecl;
12227 DECL_FUNCTION_BODY (fndecl) = b;
12231 BLOCK_SUPERCONTEXT (b) = DECL_FUNCTION_BODY (fndecl);
12232 DECL_FUNCTION_BODY (fndecl) = b;
12237 /* Exit a block by changing the current function body
12238 (DECL_FUNCTION_BODY) to the current block super context, only if
12239 the block being exited isn't the method's top level one. */
12245 if (current_function_decl)
12247 b = DECL_FUNCTION_BODY (current_function_decl);
12248 if (BLOCK_SUPERCONTEXT (b) != current_function_decl)
12249 DECL_FUNCTION_BODY (current_function_decl) = BLOCK_SUPERCONTEXT (b);
12253 b = current_static_block;
12255 if (BLOCK_SUPERCONTEXT (b))
12256 current_static_block = BLOCK_SUPERCONTEXT (b);
12261 /* Lookup for NAME in the nested function's blocks, all the way up to
12262 the current toplevel one. It complies with Java's local variable
12266 lookup_name_in_blocks (tree name)
12268 tree b = GET_CURRENT_BLOCK (current_function_decl);
12270 while (b != current_function_decl)
12274 /* Paranoid sanity check. To be removed */
12275 if (TREE_CODE (b) != BLOCK)
12278 for (current = BLOCK_EXPR_DECLS (b); current;
12279 current = TREE_CHAIN (current))
12280 if (DECL_NAME (current) == name)
12282 b = BLOCK_SUPERCONTEXT (b);
12288 maybe_absorb_scoping_blocks (void)
12290 while (BLOCK_IS_IMPLICIT (GET_CURRENT_BLOCK (current_function_decl)))
12292 tree b = exit_block ();
12293 java_method_add_stmt (current_function_decl, b);
12294 SOURCE_FRONTEND_DEBUG (("Absorbing scoping block at line %d", input_line));
12299 /* This section of the source is reserved to build_* functions that
12300 are building incomplete tree nodes and the patch_* functions that
12301 are completing them. */
12303 /* Wrap a non WFL node around a WFL. */
12306 build_wfl_wrap (tree node, int location)
12308 tree wfl, node_to_insert = node;
12310 /* We want to process THIS . xxx symbolically, to keep it consistent
12311 with the way we're processing SUPER. A THIS from a primary as a
12312 different form than a SUPER. Turn THIS into something symbolic */
12313 if (TREE_CODE (node) == THIS_EXPR)
12314 node_to_insert = wfl = build_wfl_node (this_identifier_node);
12316 wfl = build_expr_wfl (NULL_TREE, ctxp->filename, 0, 0);
12318 EXPR_WFL_LINECOL (wfl) = location;
12319 EXPR_WFL_QUALIFICATION (wfl) = build_tree_list (node_to_insert, NULL_TREE);
12323 /* Build a super() constructor invocation. Returns an empty statement if
12324 we're currently dealing with the class java.lang.Object. */
12327 build_super_invocation (tree mdecl)
12329 if (DECL_CONTEXT (mdecl) == object_type_node)
12330 return build_java_empty_stmt ();
12333 tree super_wfl = build_wfl_node (super_identifier_node);
12334 /* This is called after parsing is done, so the parser context
12335 won't be accurate. Set location info from current_class decl. */
12336 tree class_wfl = lookup_cl (TYPE_NAME (current_class));
12337 EXPR_WFL_LINECOL (super_wfl) = EXPR_WFL_LINECOL (class_wfl);
12338 tree a = NULL_TREE, t;
12339 /* If we're dealing with an anonymous class, pass the arguments
12340 of the crafted constructor along. */
12341 if (ANONYMOUS_CLASS_P (DECL_CONTEXT (mdecl)))
12343 SKIP_THIS_AND_ARTIFICIAL_PARMS (t, mdecl);
12344 for (; t != end_params_node; t = TREE_CHAIN (t))
12345 a = tree_cons (NULL_TREE, build_wfl_node (TREE_PURPOSE (t)), a);
12347 return build_method_invocation (super_wfl, a);
12351 /* Build a SUPER/THIS qualified method invocation. */
12354 build_this_super_qualified_invocation (int use_this, tree name, tree args,
12355 int lloc, int rloc)
12359 build_wfl_node (use_this ? this_identifier_node : super_identifier_node);
12360 EXPR_WFL_LINECOL (wfl) = lloc;
12361 invok = build_method_invocation (name, args);
12362 return make_qualified_primary (wfl, invok, rloc);
12365 /* Build an incomplete CALL_EXPR node. */
12368 build_method_invocation (tree name, tree args)
12370 tree call = build (CALL_EXPR, NULL_TREE, name, args, NULL_TREE);
12371 TREE_SIDE_EFFECTS (call) = 1;
12372 EXPR_WFL_LINECOL (call) = EXPR_WFL_LINECOL (name);
12376 /* Build an incomplete new xxx(...) node. */
12379 build_new_invocation (tree name, tree args)
12381 tree call = build (NEW_CLASS_EXPR, NULL_TREE, name, args, NULL_TREE);
12382 TREE_SIDE_EFFECTS (call) = 1;
12383 EXPR_WFL_LINECOL (call) = EXPR_WFL_LINECOL (name);
12387 /* Build an incomplete assignment expression. */
12390 build_assignment (int op, int op_location, tree lhs, tree rhs)
12393 /* Build the corresponding binop if we deal with a Compound
12394 Assignment operator. Mark the binop sub-tree as part of a
12395 Compound Assignment expression */
12396 if (op != ASSIGN_TK)
12398 rhs = build_binop (BINOP_LOOKUP (op), op_location, lhs, rhs);
12399 COMPOUND_ASSIGN_P (rhs) = 1;
12401 assignment = build (MODIFY_EXPR, NULL_TREE, lhs, rhs);
12402 TREE_SIDE_EFFECTS (assignment) = 1;
12403 EXPR_WFL_LINECOL (assignment) = op_location;
12407 /* Print an INTEGER_CST node as decimal in a static buffer, and return
12408 the buffer. This is used only for string conversion. */
12410 string_convert_int_cst (tree node)
12412 /* Long.MIN_VALUE is -9223372036854775808, 20 characters. */
12413 static char buffer[21];
12415 unsigned HOST_WIDE_INT lo = TREE_INT_CST_LOW (node);
12416 unsigned HOST_WIDE_INT hi = TREE_INT_CST_HIGH (node);
12417 char *p = buffer + sizeof (buffer);
12420 unsigned HOST_WIDE_INT hibit = (((unsigned HOST_WIDE_INT) 1)
12421 << (HOST_BITS_PER_WIDE_INT - 1));
12425 /* If negative, note the fact and negate the value. */
12435 /* Divide by 10 until there are no bits left. */
12438 unsigned HOST_WIDE_INT acc = 0;
12439 unsigned HOST_WIDE_INT outhi = 0, outlo = 0;
12442 /* Use long division to compute the result and the remainder. */
12443 for (i = 0; i < 2 * HOST_BITS_PER_WIDE_INT; ++i)
12445 /* Shift a bit into accumulator. */
12450 /* Shift the value. */
12456 /* Shift the correct bit into the result. */
12458 if ((outlo & hibit))
12468 /* '0' == 060 in Java, but might not be here (think EBCDIC). */
12469 *--p = '\060' + acc;
12477 *--p = '\055'; /* '-' == 055 in Java, but might not be here. */
12482 /* Print an INTEGER_CST node in a static buffer, and return the
12483 buffer. This is used only for error handling. */
12485 print_int_node (tree node)
12487 static char buffer [80];
12488 if (TREE_CONSTANT_OVERFLOW (node))
12489 sprintf (buffer, "<overflow>");
12491 if (TREE_INT_CST_HIGH (node) == 0)
12492 sprintf (buffer, HOST_WIDE_INT_PRINT_UNSIGNED,
12493 TREE_INT_CST_LOW (node));
12494 else if (TREE_INT_CST_HIGH (node) == -1
12495 && TREE_INT_CST_LOW (node) != 0)
12496 sprintf (buffer, "-" HOST_WIDE_INT_PRINT_UNSIGNED,
12497 -TREE_INT_CST_LOW (node));
12499 sprintf (buffer, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
12500 TREE_INT_CST_HIGH (node), TREE_INT_CST_LOW (node));
12506 /* Return 1 if an assignment to a FINAL is attempted in a non suitable
12509 /* 15.25 Assignment operators. */
12512 patch_assignment (tree node, tree wfl_op1)
12514 tree rhs = TREE_OPERAND (node, 1);
12515 tree lvalue = TREE_OPERAND (node, 0), llvalue;
12516 tree lhs_type = NULL_TREE, rhs_type, new_rhs = NULL_TREE;
12517 int error_found = 0;
12518 int lvalue_from_array = 0;
12521 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
12523 /* Lhs can be a named variable */
12524 if (JDECL_P (lvalue))
12526 lhs_type = TREE_TYPE (lvalue);
12528 /* Or Lhs can be an array access. */
12529 else if (TREE_CODE (lvalue) == ARRAY_REF)
12531 lhs_type = TREE_TYPE (lvalue);
12532 lvalue_from_array = 1;
12534 /* Or a field access */
12535 else if (TREE_CODE (lvalue) == COMPONENT_REF)
12536 lhs_type = TREE_TYPE (lvalue);
12537 /* Or a function return slot */
12538 else if (TREE_CODE (lvalue) == RESULT_DECL)
12540 /* If the return type is an integral type, then we create the
12541 RESULT_DECL with a promoted type, but we need to do these
12542 checks against the unpromoted type to ensure type safety. So
12543 here we look at the real type, not the type of the decl we
12545 lhs_type = TREE_TYPE (TREE_TYPE (current_function_decl));
12548 /* Otherwise, we might want to try to write into an optimized static
12549 final, this is an of a different nature, reported further on. */
12550 else if (TREE_CODE (wfl_op1) == EXPR_WITH_FILE_LOCATION
12551 && resolve_expression_name (wfl_op1, &llvalue))
12553 lhs_type = TREE_TYPE (lvalue);
12557 parse_error_context (wfl_op1, "Invalid left hand side of assignment");
12561 rhs_type = TREE_TYPE (rhs);
12563 /* 5.1 Try the assignment conversion for builtin type. */
12564 new_rhs = try_builtin_assignconv (wfl_op1, lhs_type, rhs);
12566 /* 5.2 If it failed, try a reference conversion */
12568 new_rhs = try_reference_assignconv (lhs_type, rhs);
12570 /* 15.25.2 If we have a compound assignment, convert RHS into the
12572 else if (COMPOUND_ASSIGN_P (TREE_OPERAND (node, 1)))
12573 new_rhs = convert (lhs_type, rhs);
12575 /* Explicit cast required. This is an error */
12578 char *t1 = xstrdup (lang_printable_name (TREE_TYPE (rhs), 0));
12579 char *t2 = xstrdup (lang_printable_name (lhs_type, 0));
12581 char operation [32]; /* Max size known */
12583 /* If the assignment is part of a declaration, we use the WFL of
12584 the declared variable to point out the error and call it a
12585 declaration problem. If the assignment is a genuine =
12586 operator, we call is a operator `=' problem, otherwise we
12587 call it an assignment problem. In both of these last cases,
12588 we use the WFL of the operator to indicate the error. */
12590 if (MODIFY_EXPR_FROM_INITIALIZATION_P (node))
12593 strcpy (operation, "declaration");
12597 wfl = wfl_operator;
12598 if (COMPOUND_ASSIGN_P (TREE_OPERAND (node, 1)))
12599 strcpy (operation, "assignment");
12600 else if (is_return)
12601 strcpy (operation, "`return'");
12603 strcpy (operation, "`='");
12606 if (!valid_cast_to_p (rhs_type, lhs_type))
12607 parse_error_context
12608 (wfl, "Incompatible type for %s. Can't convert `%s' to `%s'",
12609 operation, t1, t2);
12611 parse_error_context (wfl, "Incompatible type for %s. Explicit cast needed to convert `%s' to `%s'",
12612 operation, t1, t2);
12613 free (t1); free (t2);
12618 return error_mark_node;
12620 /* If we're processing a `return' statement, promote the actual type
12621 to the promoted type. */
12623 new_rhs = convert (TREE_TYPE (lvalue), new_rhs);
12625 /* 10.10: Array Store Exception runtime check */
12626 if (!flag_emit_class_files
12628 && lvalue_from_array
12629 && JREFERENCE_TYPE_P (TYPE_ARRAY_ELEMENT (lhs_type)))
12631 tree array, store_check, base, index_expr;
12633 /* Save RHS so that it doesn't get re-evaluated by the store check. */
12634 new_rhs = save_expr (new_rhs);
12636 /* Get the INDIRECT_REF. */
12637 array = TREE_OPERAND (TREE_OPERAND (lvalue, 0), 0);
12638 /* Get the array pointer expr. */
12639 array = TREE_OPERAND (array, 0);
12640 store_check = build_java_arraystore_check (array, new_rhs);
12642 index_expr = TREE_OPERAND (lvalue, 1);
12644 if (TREE_CODE (index_expr) == COMPOUND_EXPR)
12646 /* A COMPOUND_EXPR here is a bounds check. The bounds check must
12647 happen before the store check, so prepare to insert the store
12648 check within the second operand of the existing COMPOUND_EXPR. */
12654 index_expr = TREE_OPERAND (base, 1);
12655 TREE_OPERAND (base, 1) = build (COMPOUND_EXPR, TREE_TYPE (index_expr),
12656 store_check, index_expr);
12659 /* Final locals can be used as case values in switch
12660 statement. Prepare them for this eventuality. */
12661 if (TREE_CODE (lvalue) == VAR_DECL
12662 && DECL_FINAL (lvalue)
12663 && TREE_CONSTANT (new_rhs)
12664 && IDENTIFIER_LOCAL_VALUE (DECL_NAME (lvalue))
12665 && JINTEGRAL_TYPE_P (TREE_TYPE (lvalue))
12668 TREE_CONSTANT (lvalue) = 1;
12669 TREE_INVARIANT (lvalue) = 1;
12670 DECL_INITIAL (lvalue) = new_rhs;
12673 /* Copy the rhs if it's a reference. */
12674 if (! flag_check_references && ! flag_emit_class_files && optimize > 0)
12676 switch (TREE_CODE (new_rhs))
12680 case COMPONENT_REF:
12681 /* Transform a = foo.bar
12682 into a = ({int tmp; tmp = foo.bar;}).
12683 We need to ensure that if a read from memory fails
12684 because of a NullPointerException, a destination variable
12685 will remain unchanged. An explicit temporary does what
12688 If flag_check_references is set, this is unnecessary
12689 because we'll check each reference before doing any
12690 reads. If optimize is not set the result will never be
12691 written to a stack slot that contains the LHS. */
12693 tree tmp = build_decl (VAR_DECL, get_identifier ("<tmp>"),
12694 TREE_TYPE (new_rhs));
12695 tree block = make_node (BLOCK);
12697 = build (MODIFY_EXPR, TREE_TYPE (new_rhs), tmp, fold (new_rhs));
12698 DECL_CONTEXT (tmp) = current_function_decl;
12699 TREE_TYPE (block) = TREE_TYPE (new_rhs);
12700 BLOCK_VARS (block) = tmp;
12701 BLOCK_EXPR_BODY (block) = assignment;
12702 TREE_SIDE_EFFECTS (block) = 1;
12711 TREE_OPERAND (node, 0) = lvalue;
12712 TREE_OPERAND (node, 1) = new_rhs;
12713 TREE_TYPE (node) = lhs_type;
12717 /* Check that type SOURCE can be cast into type DEST. If the cast
12718 can't occur at all, return NULL; otherwise, return a possibly
12722 try_reference_assignconv (tree lhs_type, tree rhs)
12724 tree new_rhs = NULL_TREE;
12725 tree rhs_type = TREE_TYPE (rhs);
12727 if (!JPRIMITIVE_TYPE_P (rhs_type) && JREFERENCE_TYPE_P (lhs_type))
12729 /* `null' may be assigned to any reference type */
12730 if (rhs == null_pointer_node)
12731 new_rhs = null_pointer_node;
12732 /* Try the reference assignment conversion */
12733 else if (valid_ref_assignconv_cast_p (rhs_type, lhs_type, 0))
12735 /* This is a magic assignment that we process differently */
12736 else if (TREE_CODE (rhs) == JAVA_EXC_OBJ_EXPR)
12742 /* Check that RHS can be converted into LHS_TYPE by the assignment
12743 conversion (5.2), for the cases of RHS being a builtin type. Return
12744 NULL_TREE if the conversion fails or if because RHS isn't of a
12745 builtin type. Return a converted RHS if the conversion is possible. */
12748 try_builtin_assignconv (tree wfl_op1, tree lhs_type, tree rhs)
12750 tree new_rhs = NULL_TREE;
12751 tree rhs_type = TREE_TYPE (rhs);
12753 /* Handle boolean specially. */
12754 if (TREE_CODE (rhs_type) == BOOLEAN_TYPE
12755 || TREE_CODE (lhs_type) == BOOLEAN_TYPE)
12757 if (TREE_CODE (rhs_type) == BOOLEAN_TYPE
12758 && TREE_CODE (lhs_type) == BOOLEAN_TYPE)
12762 /* 5.1.1 Try Identity Conversion,
12763 5.1.2 Try Widening Primitive Conversion */
12764 else if (valid_builtin_assignconv_identity_widening_p (lhs_type, rhs_type))
12765 new_rhs = convert (lhs_type, rhs);
12767 /* Try a narrowing primitive conversion (5.1.3):
12768 - expression is a constant expression of type byte, short, char,
12770 - variable is byte, short or char AND
12771 - The value of the expression is representable in the type of the
12773 else if ((rhs_type == byte_type_node || rhs_type == short_type_node
12774 || rhs_type == char_type_node || rhs_type == int_type_node)
12775 && TREE_CONSTANT (rhs)
12776 && (lhs_type == byte_type_node || lhs_type == char_type_node
12777 || lhs_type == short_type_node))
12779 if (int_fits_type_p (rhs, lhs_type))
12780 new_rhs = convert (lhs_type, rhs);
12781 else if (wfl_op1) /* Might be called with a NULL */
12782 parse_warning_context
12783 (wfl_op1, "Constant expression `%s' too wide for narrowing primitive conversion to `%s'",
12784 print_int_node (rhs), lang_printable_name (lhs_type, 0));
12785 /* Reported a warning that will turn into an error further
12786 down, so we don't return */
12792 /* Return 1 if RHS_TYPE can be converted to LHS_TYPE by identity
12793 conversion (5.1.1) or widening primitive conversion (5.1.2). Return
12794 0 is the conversion test fails. This implements parts the method
12795 invocation conversion (5.3). */
12798 valid_builtin_assignconv_identity_widening_p (tree lhs_type, tree rhs_type)
12800 /* 5.1.1: This is the identity conversion part. */
12801 if (lhs_type == rhs_type)
12804 /* Reject non primitive types and boolean conversions. */
12805 if (!JNUMERIC_TYPE_P (lhs_type) || !JNUMERIC_TYPE_P (rhs_type))
12808 /* 5.1.2: widening primitive conversion. byte, even if it's smaller
12809 than a char can't be converted into a char. Short can't too, but
12810 the < test below takes care of that */
12811 if (lhs_type == char_type_node && rhs_type == byte_type_node)
12814 /* Accept all promoted type here. Note, we can't use <= in the test
12815 below, because we still need to bounce out assignments of short
12816 to char and the likes */
12817 if (lhs_type == int_type_node
12818 && (rhs_type == promoted_byte_type_node
12819 || rhs_type == promoted_short_type_node
12820 || rhs_type == promoted_char_type_node
12821 || rhs_type == promoted_boolean_type_node))
12824 /* From here, an integral is widened if its precision is smaller
12825 than the precision of the LHS or if the LHS is a floating point
12826 type, or the RHS is a float and the RHS a double. */
12827 if ((JINTEGRAL_TYPE_P (rhs_type) && JINTEGRAL_TYPE_P (lhs_type)
12828 && (TYPE_PRECISION (rhs_type) < TYPE_PRECISION (lhs_type)))
12829 || (JINTEGRAL_TYPE_P (rhs_type) && JFLOAT_TYPE_P (lhs_type))
12830 || (rhs_type == float_type_node && lhs_type == double_type_node))
12836 /* Check that something of SOURCE type can be assigned or cast to
12837 something of DEST type at runtime. Return 1 if the operation is
12838 valid, 0 otherwise. If CAST is set to 1, we're treating the case
12839 were SOURCE is cast into DEST, which borrows a lot of the
12840 assignment check. */
12843 valid_ref_assignconv_cast_p (tree source, tree dest, int cast)
12845 /* SOURCE or DEST might be null if not from a declared entity. */
12846 if (!source || !dest)
12848 if (JNULLP_TYPE_P (source))
12850 if (TREE_CODE (source) == POINTER_TYPE)
12851 source = TREE_TYPE (source);
12852 if (TREE_CODE (dest) == POINTER_TYPE)
12853 dest = TREE_TYPE (dest);
12855 /* If source and dest are being compiled from bytecode, they may need to
12857 if (CLASS_P (source) && !CLASS_LOADED_P (source))
12859 load_class (source, 1);
12860 safe_layout_class (source);
12862 if (CLASS_P (dest) && !CLASS_LOADED_P (dest))
12864 load_class (dest, 1);
12865 safe_layout_class (dest);
12868 /* Case where SOURCE is a class type */
12869 if (TYPE_CLASS_P (source))
12871 if (TYPE_CLASS_P (dest))
12872 return (source == dest
12873 || inherits_from_p (source, dest)
12874 || (cast && inherits_from_p (dest, source)));
12875 if (TYPE_INTERFACE_P (dest))
12877 /* If doing a cast and SOURCE is final, the operation is
12878 always correct a compile time (because even if SOURCE
12879 does not implement DEST, a subclass of SOURCE might). */
12880 if (cast && !CLASS_FINAL (TYPE_NAME (source)))
12882 /* Otherwise, SOURCE must implement DEST */
12883 return interface_of_p (dest, source);
12885 /* DEST is an array, cast permitted if SOURCE is of Object type */
12886 return (cast && source == object_type_node ? 1 : 0);
12888 if (TYPE_INTERFACE_P (source))
12890 if (TYPE_CLASS_P (dest))
12892 /* If not casting, DEST must be the Object type */
12894 return dest == object_type_node;
12895 /* We're doing a cast. The cast is always valid is class
12896 DEST is not final, otherwise, DEST must implement SOURCE */
12897 else if (!CLASS_FINAL (TYPE_NAME (dest)))
12900 return interface_of_p (source, dest);
12902 if (TYPE_INTERFACE_P (dest))
12904 /* If doing a cast, then if SOURCE and DEST contain method
12905 with the same signature but different return type, then
12906 this is a (compile time) error */
12909 tree method_source, method_dest;
12913 for (method_source = TYPE_METHODS (source); method_source;
12914 method_source = TREE_CHAIN (method_source))
12917 build_java_argument_signature (TREE_TYPE (method_source));
12918 source_type = TREE_TYPE (TREE_TYPE (method_source));
12919 source_name = DECL_NAME (method_source);
12920 for (method_dest = TYPE_METHODS (dest);
12921 method_dest; method_dest = TREE_CHAIN (method_dest))
12923 build_java_argument_signature (TREE_TYPE (method_dest))
12924 && source_name == DECL_NAME (method_dest)
12925 && source_type != TREE_TYPE (TREE_TYPE (method_dest)))
12931 return source == dest || interface_of_p (dest, source);
12937 && (DECL_NAME (TYPE_NAME (source))
12938 == java_lang_cloneable_identifier_node
12939 || (DECL_NAME (TYPE_NAME (source))
12940 == java_io_serializable_identifier_node)));
12943 if (TYPE_ARRAY_P (source))
12945 if (TYPE_CLASS_P (dest))
12946 return dest == object_type_node;
12947 /* Can't cast an array to an interface unless the interface is
12948 java.lang.Cloneable or java.io.Serializable. */
12949 if (TYPE_INTERFACE_P (dest))
12950 return (DECL_NAME (TYPE_NAME (dest))
12951 == java_lang_cloneable_identifier_node
12952 || (DECL_NAME (TYPE_NAME (dest))
12953 == java_io_serializable_identifier_node));
12956 tree source_element_type = TYPE_ARRAY_ELEMENT (source);
12957 tree dest_element_type = TYPE_ARRAY_ELEMENT (dest);
12959 /* In case of severe errors, they turn out null */
12960 if (!dest_element_type || !source_element_type)
12962 if (source_element_type == dest_element_type)
12964 return valid_ref_assignconv_cast_p (source_element_type,
12965 dest_element_type, cast);
12973 valid_cast_to_p (tree source, tree dest)
12975 if (TREE_CODE (source) == POINTER_TYPE)
12976 source = TREE_TYPE (source);
12977 if (TREE_CODE (dest) == POINTER_TYPE)
12978 dest = TREE_TYPE (dest);
12980 if (TREE_CODE (source) == RECORD_TYPE && TREE_CODE (dest) == RECORD_TYPE)
12981 return valid_ref_assignconv_cast_p (source, dest, 1);
12983 else if (JNUMERIC_TYPE_P (source) && JNUMERIC_TYPE_P (dest))
12986 else if (TREE_CODE (source) == BOOLEAN_TYPE
12987 && TREE_CODE (dest) == BOOLEAN_TYPE)
12994 do_unary_numeric_promotion (tree arg)
12996 tree type = TREE_TYPE (arg);
12997 if ((TREE_CODE (type) == INTEGER_TYPE && TYPE_PRECISION (type) < 32)
12998 || TREE_CODE (type) == CHAR_TYPE)
12999 arg = convert (int_type_node, arg);
13003 /* Return a nonzero value if SOURCE can be converted into DEST using
13004 the method invocation conversion rule (5.3). */
13006 valid_method_invocation_conversion_p (tree dest, tree source)
13008 return ((JPRIMITIVE_TYPE_P (source) && JPRIMITIVE_TYPE_P (dest)
13009 && valid_builtin_assignconv_identity_widening_p (dest, source))
13010 || ((JREFERENCE_TYPE_P (source) || JNULLP_TYPE_P (source))
13011 && (JREFERENCE_TYPE_P (dest) || JNULLP_TYPE_P (dest))
13012 && valid_ref_assignconv_cast_p (source, dest, 0)));
13015 /* Build an incomplete binop expression. */
13018 build_binop (enum tree_code op, int op_location, tree op1, tree op2)
13020 tree binop = build (op, NULL_TREE, op1, op2);
13021 TREE_SIDE_EFFECTS (binop) = 1;
13022 /* Store the location of the operator, for better error report. The
13023 string of the operator will be rebuild based on the OP value. */
13024 EXPR_WFL_LINECOL (binop) = op_location;
13028 /* Build the string of the operator retained by NODE. If NODE is part
13029 of a compound expression, add an '=' at the end of the string. This
13030 function is called when an error needs to be reported on an
13031 operator. The string is returned as a pointer to a static character
13035 operator_string (tree node)
13037 #define BUILD_OPERATOR_STRING(S) \
13039 sprintf (buffer, "%s%s", S, (COMPOUND_ASSIGN_P (node) ? "=" : "")); \
13043 static char buffer [10];
13044 switch (TREE_CODE (node))
13046 case MULT_EXPR: BUILD_OPERATOR_STRING ("*");
13047 case RDIV_EXPR: BUILD_OPERATOR_STRING ("/");
13048 case TRUNC_MOD_EXPR: BUILD_OPERATOR_STRING ("%");
13049 case PLUS_EXPR: BUILD_OPERATOR_STRING ("+");
13050 case MINUS_EXPR: BUILD_OPERATOR_STRING ("-");
13051 case LSHIFT_EXPR: BUILD_OPERATOR_STRING ("<<");
13052 case RSHIFT_EXPR: BUILD_OPERATOR_STRING (">>");
13053 case URSHIFT_EXPR: BUILD_OPERATOR_STRING (">>>");
13054 case BIT_AND_EXPR: BUILD_OPERATOR_STRING ("&");
13055 case BIT_XOR_EXPR: BUILD_OPERATOR_STRING ("^");
13056 case BIT_IOR_EXPR: BUILD_OPERATOR_STRING ("|");
13057 case TRUTH_ANDIF_EXPR: BUILD_OPERATOR_STRING ("&&");
13058 case TRUTH_ORIF_EXPR: BUILD_OPERATOR_STRING ("||");
13059 case EQ_EXPR: BUILD_OPERATOR_STRING ("==");
13060 case NE_EXPR: BUILD_OPERATOR_STRING ("!=");
13061 case GT_EXPR: BUILD_OPERATOR_STRING (">");
13062 case GE_EXPR: BUILD_OPERATOR_STRING (">=");
13063 case LT_EXPR: BUILD_OPERATOR_STRING ("<");
13064 case LE_EXPR: BUILD_OPERATOR_STRING ("<=");
13065 case UNARY_PLUS_EXPR: BUILD_OPERATOR_STRING ("+");
13066 case NEGATE_EXPR: BUILD_OPERATOR_STRING ("-");
13067 case TRUTH_NOT_EXPR: BUILD_OPERATOR_STRING ("!");
13068 case BIT_NOT_EXPR: BUILD_OPERATOR_STRING ("~");
13069 case PREINCREMENT_EXPR: /* Fall through */
13070 case POSTINCREMENT_EXPR: BUILD_OPERATOR_STRING ("++");
13071 case PREDECREMENT_EXPR: /* Fall through */
13072 case POSTDECREMENT_EXPR: BUILD_OPERATOR_STRING ("--");
13074 internal_error ("unregistered operator %s",
13075 tree_code_name [TREE_CODE (node)]);
13078 #undef BUILD_OPERATOR_STRING
13081 /* Return 1 if VAR_ACCESS1 is equivalent to VAR_ACCESS2. */
13084 java_decl_equiv (tree var_acc1, tree var_acc2)
13086 if (JDECL_P (var_acc1))
13087 return (var_acc1 == var_acc2);
13089 return (TREE_CODE (var_acc1) == COMPONENT_REF
13090 && TREE_CODE (var_acc2) == COMPONENT_REF
13091 && TREE_OPERAND (TREE_OPERAND (var_acc1, 0), 0)
13092 == TREE_OPERAND (TREE_OPERAND (var_acc2, 0), 0)
13093 && TREE_OPERAND (var_acc1, 1) == TREE_OPERAND (var_acc2, 1));
13096 /* Return a nonzero value if CODE is one of the operators that can be
13097 used in conjunction with the `=' operator in a compound assignment. */
13100 binop_compound_p (enum tree_code code)
13103 for (i = 0; i < BINOP_COMPOUND_CANDIDATES; i++)
13104 if (binop_lookup [i] == code)
13107 return i < BINOP_COMPOUND_CANDIDATES;
13110 /* Reorganize after a fold to get SAVE_EXPR to generate what we want. */
13113 java_refold (tree t)
13115 tree c, b, ns, decl;
13117 if (TREE_CODE (t) != MODIFY_EXPR)
13120 c = TREE_OPERAND (t, 1);
13121 if (! (c && TREE_CODE (c) == COMPOUND_EXPR
13122 && TREE_CODE (TREE_OPERAND (c, 0)) == MODIFY_EXPR
13123 && binop_compound_p (TREE_CODE (TREE_OPERAND (c, 1)))))
13126 /* Now the left branch of the binary operator. */
13127 b = TREE_OPERAND (TREE_OPERAND (c, 1), 0);
13128 if (! (b && TREE_CODE (b) == NOP_EXPR
13129 && TREE_CODE (TREE_OPERAND (b, 0)) == SAVE_EXPR))
13132 ns = TREE_OPERAND (TREE_OPERAND (b, 0), 0);
13133 if (! (ns && TREE_CODE (ns) == NOP_EXPR
13134 && TREE_CODE (TREE_OPERAND (ns, 0)) == SAVE_EXPR))
13137 decl = TREE_OPERAND (TREE_OPERAND (ns, 0), 0);
13138 if ((JDECL_P (decl) || TREE_CODE (decl) == COMPONENT_REF)
13139 /* It's got to be the an equivalent decl */
13140 && java_decl_equiv (decl, TREE_OPERAND (TREE_OPERAND (c, 0), 0)))
13142 /* Shorten the NOP_EXPR/SAVE_EXPR path. */
13143 TREE_OPERAND (TREE_OPERAND (c, 1), 0) = TREE_OPERAND (ns, 0);
13144 /* Substitute the COMPOUND_EXPR by the BINOP_EXPR */
13145 TREE_OPERAND (t, 1) = TREE_OPERAND (c, 1);
13146 /* Change the right part of the BINOP_EXPR */
13147 TREE_OPERAND (TREE_OPERAND (t, 1), 1) = TREE_OPERAND (c, 0);
13153 /* Binary operators (15.16 up to 15.18). We return error_mark_node on
13154 errors but we modify NODE so that it contains the type computed
13155 according to the expression, when it's fixed. Otherwise, we write
13156 error_mark_node as the type. It allows us to further the analysis
13157 of remaining nodes and detects more errors in certain cases. */
13160 patch_binop (tree node, tree wfl_op1, tree wfl_op2)
13162 tree op1 = TREE_OPERAND (node, 0);
13163 tree op2 = TREE_OPERAND (node, 1);
13164 tree op1_type = TREE_TYPE (op1);
13165 tree op2_type = TREE_TYPE (op2);
13166 tree prom_type = NULL_TREE, cn;
13167 enum tree_code code = TREE_CODE (node);
13169 /* If 1, tell the routine that we have to return error_mark_node
13170 after checking for the initialization of the RHS */
13171 int error_found = 0;
13173 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
13175 /* If either op<n>_type are NULL, this might be early signs of an
13176 error situation, unless it's too early to tell (in case we're
13177 handling a `+', `==', `!=' or `instanceof'.) We want to set op<n>_type
13178 correctly so the error can be later on reported accurately. */
13179 if (! (code == PLUS_EXPR || code == NE_EXPR
13180 || code == EQ_EXPR || code == INSTANCEOF_EXPR))
13185 n = java_complete_tree (op1);
13186 op1_type = TREE_TYPE (n);
13190 n = java_complete_tree (op2);
13191 op2_type = TREE_TYPE (n);
13197 /* 15.16 Multiplicative operators */
13198 case MULT_EXPR: /* 15.16.1 Multiplication Operator * */
13199 case RDIV_EXPR: /* 15.16.2 Division Operator / */
13200 case TRUNC_DIV_EXPR: /* 15.16.2 Integral type Division Operator / */
13201 case TRUNC_MOD_EXPR: /* 15.16.3 Remainder operator % */
13202 if (!JNUMERIC_TYPE_P (op1_type) || !JNUMERIC_TYPE_P (op2_type))
13204 if (!JNUMERIC_TYPE_P (op1_type))
13205 ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op1_type);
13206 if (!JNUMERIC_TYPE_P (op2_type) && (op1_type != op2_type))
13207 ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op2_type);
13208 TREE_TYPE (node) = error_mark_node;
13212 prom_type = binary_numeric_promotion (op1_type, op2_type, &op1, &op2);
13214 /* Detect integral division by zero */
13215 if ((code == RDIV_EXPR || code == TRUNC_MOD_EXPR)
13216 && TREE_CODE (prom_type) == INTEGER_TYPE
13217 && (op2 == integer_zero_node || op2 == long_zero_node ||
13218 (TREE_CODE (op2) == INTEGER_CST &&
13219 ! TREE_INT_CST_LOW (op2) && ! TREE_INT_CST_HIGH (op2))))
13221 parse_warning_context (wfl_operator, "Evaluating this expression will result in an arithmetic exception being thrown");
13222 TREE_CONSTANT (node) = 0;
13223 TREE_INVARIANT (node) = 0;
13226 /* Change the division operator if necessary */
13227 if (code == RDIV_EXPR && TREE_CODE (prom_type) == INTEGER_TYPE)
13228 TREE_SET_CODE (node, TRUNC_DIV_EXPR);
13230 /* Before divisions as is disappear, try to simplify and bail if
13231 applicable, otherwise we won't perform even simple
13232 simplifications like (1-1)/3. We can't do that with floating
13233 point number, folds can't handle them at this stage. */
13234 if (code == RDIV_EXPR && TREE_CONSTANT (op1) && TREE_CONSTANT (op2)
13235 && JINTEGRAL_TYPE_P (op1) && JINTEGRAL_TYPE_P (op2))
13237 TREE_TYPE (node) = prom_type;
13238 node = fold (node);
13239 if (TREE_CODE (node) != code)
13243 if (TREE_CODE (prom_type) == INTEGER_TYPE
13244 && flag_use_divide_subroutine
13245 && ! flag_emit_class_files
13246 && (code == RDIV_EXPR || code == TRUNC_MOD_EXPR))
13247 return build_java_soft_divmod (TREE_CODE (node), prom_type, op1, op2);
13249 /* This one is more complicated. FLOATs are processed by a
13250 function call to soft_fmod. Duplicate the value of the
13251 COMPOUND_ASSIGN_P flag. */
13252 if (code == TRUNC_MOD_EXPR)
13254 tree mod = build_java_binop (TRUNC_MOD_EXPR, prom_type, op1, op2);
13255 COMPOUND_ASSIGN_P (mod) = COMPOUND_ASSIGN_P (node);
13256 TREE_SIDE_EFFECTS (mod)
13257 = TREE_SIDE_EFFECTS (op1) | TREE_SIDE_EFFECTS (op2);
13262 /* 15.17 Additive Operators */
13263 case PLUS_EXPR: /* 15.17.1 String Concatenation Operator + */
13265 /* Operation is valid if either one argument is a string
13266 constant, a String object or a StringBuffer crafted for the
13267 purpose of the a previous usage of the String concatenation
13270 if (TREE_CODE (op1) == STRING_CST
13271 || TREE_CODE (op2) == STRING_CST
13272 || JSTRING_TYPE_P (op1_type)
13273 || JSTRING_TYPE_P (op2_type)
13274 || IS_CRAFTED_STRING_BUFFER_P (op1)
13275 || IS_CRAFTED_STRING_BUFFER_P (op2))
13276 return build_string_concatenation (op1, op2);
13278 case MINUS_EXPR: /* 15.17.2 Additive Operators (+ and -) for
13280 if (!JNUMERIC_TYPE_P (op1_type) || !JNUMERIC_TYPE_P (op2_type))
13282 if (!JNUMERIC_TYPE_P (op1_type))
13283 ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op1_type);
13284 if (!JNUMERIC_TYPE_P (op2_type) && (op1_type != op2_type))
13285 ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op2_type);
13286 TREE_TYPE (node) = error_mark_node;
13290 prom_type = binary_numeric_promotion (op1_type, op2_type, &op1, &op2);
13293 /* 15.18 Shift Operators */
13297 if (!JINTEGRAL_TYPE_P (op1_type) || !JINTEGRAL_TYPE_P (op2_type))
13299 if (!JINTEGRAL_TYPE_P (op1_type))
13300 ERROR_CAST_NEEDED_TO_INTEGRAL (wfl_operator, node, op1_type);
13303 if (JNUMERIC_TYPE_P (op2_type))
13304 parse_error_context (wfl_operator,
13305 "Incompatible type for `%s'. Explicit cast needed to convert shift distance from `%s' to integral",
13306 operator_string (node),
13307 lang_printable_name (op2_type, 0));
13309 parse_error_context (wfl_operator,
13310 "Incompatible type for `%s'. Can't convert shift distance from `%s' to integral",
13311 operator_string (node),
13312 lang_printable_name (op2_type, 0));
13314 TREE_TYPE (node) = error_mark_node;
13319 /* Unary numeric promotion (5.6.1) is performed on each operand
13321 op1 = do_unary_numeric_promotion (op1);
13322 op2 = do_unary_numeric_promotion (op2);
13324 /* If the right hand side is of type `long', first cast it to
13326 if (TREE_TYPE (op2) == long_type_node)
13327 op2 = build1 (CONVERT_EXPR, int_type_node, op2);
13329 /* The type of the shift expression is the type of the promoted
13330 type of the left-hand operand */
13331 prom_type = TREE_TYPE (op1);
13333 /* Shift int only up to 0x1f and long up to 0x3f */
13334 if (prom_type == int_type_node)
13335 op2 = fold (build (BIT_AND_EXPR, int_type_node, op2,
13336 build_int_2 (0x1f, 0)));
13338 op2 = fold (build (BIT_AND_EXPR, int_type_node, op2,
13339 build_int_2 (0x3f, 0)));
13341 /* The >>> operator is a >> operating on unsigned quantities */
13342 if (code == URSHIFT_EXPR && ! flag_emit_class_files)
13345 tree utype = java_unsigned_type (prom_type);
13346 op1 = convert (utype, op1);
13347 TREE_SET_CODE (node, RSHIFT_EXPR);
13348 TREE_OPERAND (node, 0) = op1;
13349 TREE_OPERAND (node, 1) = op2;
13350 TREE_TYPE (node) = utype;
13351 to_return = convert (prom_type, node);
13352 /* Copy the original value of the COMPOUND_ASSIGN_P flag */
13353 COMPOUND_ASSIGN_P (to_return) = COMPOUND_ASSIGN_P (node);
13354 TREE_SIDE_EFFECTS (to_return)
13355 = TREE_SIDE_EFFECTS (op1) | TREE_SIDE_EFFECTS (op2);
13360 /* 15.19.1 Type Comparison Operator instanceof */
13361 case INSTANCEOF_EXPR:
13363 TREE_TYPE (node) = boolean_type_node;
13365 /* OP1_TYPE might be NULL when OP1 is a string constant. */
13366 if ((cn = patch_string (op1)))
13369 op1_type = TREE_TYPE (op1);
13371 if (op1_type == NULL_TREE)
13374 if (!(op2_type = resolve_type_during_patch (op2)))
13375 return error_mark_node;
13377 /* The first operand must be a reference type or the null type */
13378 if (!JREFERENCE_TYPE_P (op1_type) && op1 != null_pointer_node)
13379 error_found = 1; /* Error reported further below */
13381 /* The second operand must be a reference type */
13382 if (!JREFERENCE_TYPE_P (op2_type))
13384 SET_WFL_OPERATOR (wfl_operator, node, wfl_op2);
13385 parse_error_context
13386 (wfl_operator, "Invalid argument `%s' for `instanceof'",
13387 lang_printable_name (op2_type, 0));
13391 if (!error_found && valid_ref_assignconv_cast_p (op1_type, op2_type, 1))
13393 /* If the first operand is null, the result is always false */
13394 if (op1 == null_pointer_node)
13395 return boolean_false_node;
13396 else if (flag_emit_class_files)
13398 TREE_OPERAND (node, 1) = op2_type;
13399 TREE_SIDE_EFFECTS (node) = TREE_SIDE_EFFECTS (op1);
13402 /* Otherwise we have to invoke instance of to figure it out */
13404 return build_instanceof (op1, op2_type);
13406 /* There is no way the expression operand can be an instance of
13407 the type operand. This is a compile time error. */
13410 char *t1 = xstrdup (lang_printable_name (op1_type, 0));
13411 SET_WFL_OPERATOR (wfl_operator, node, wfl_op1);
13412 parse_error_context
13413 (wfl_operator, "Impossible for `%s' to be instance of `%s'",
13414 t1, lang_printable_name (op2_type, 0));
13421 /* 15.21 Bitwise and Logical Operators */
13425 if (JINTEGRAL_TYPE_P (op1_type) && JINTEGRAL_TYPE_P (op2_type))
13426 /* Binary numeric promotion is performed on both operand and the
13427 expression retain that type */
13428 prom_type = binary_numeric_promotion (op1_type, op2_type, &op1, &op2);
13430 else if (TREE_CODE (op1_type) == BOOLEAN_TYPE
13431 && TREE_CODE (op1_type) == BOOLEAN_TYPE)
13432 /* The type of the bitwise operator expression is BOOLEAN */
13433 prom_type = boolean_type_node;
13436 if (!JINTEGRAL_TYPE_P (op1_type))
13437 ERROR_CAST_NEEDED_TO_INTEGRAL (wfl_operator, node, op1_type);
13438 if (!JINTEGRAL_TYPE_P (op2_type) && (op1_type != op2_type))
13439 ERROR_CAST_NEEDED_TO_INTEGRAL (wfl_operator, node, op2_type);
13440 TREE_TYPE (node) = error_mark_node;
13442 /* Insert a break here if adding thing before the switch's
13443 break for this case */
13447 /* 15.22 Conditional-And Operator */
13448 case TRUTH_ANDIF_EXPR:
13449 /* 15.23 Conditional-Or Operator */
13450 case TRUTH_ORIF_EXPR:
13451 /* Operands must be of BOOLEAN type */
13452 if (TREE_CODE (op1_type) != BOOLEAN_TYPE ||
13453 TREE_CODE (op2_type) != BOOLEAN_TYPE)
13455 if (TREE_CODE (op1_type) != BOOLEAN_TYPE)
13456 ERROR_CANT_CONVERT_TO_BOOLEAN (wfl_operator, node, op1_type);
13457 if (TREE_CODE (op2_type) != BOOLEAN_TYPE && (op1_type != op2_type))
13458 ERROR_CANT_CONVERT_TO_BOOLEAN (wfl_operator, node, op2_type);
13459 TREE_TYPE (node) = boolean_type_node;
13463 else if (integer_zerop (op1))
13465 return code == TRUTH_ANDIF_EXPR ? op1 : op2;
13467 else if (integer_onep (op1))
13469 return code == TRUTH_ANDIF_EXPR ? op2 : op1;
13471 /* The type of the conditional operators is BOOLEAN */
13472 prom_type = boolean_type_node;
13475 /* 15.19.1 Numerical Comparison Operators <, <=, >, >= */
13480 /* The type of each of the operands must be a primitive numeric
13482 if (!JNUMERIC_TYPE_P (op1_type) || ! JNUMERIC_TYPE_P (op2_type))
13484 if (!JNUMERIC_TYPE_P (op1_type))
13485 ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op1_type);
13486 if (!JNUMERIC_TYPE_P (op2_type) && (op1_type != op2_type))
13487 ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op2_type);
13488 TREE_TYPE (node) = boolean_type_node;
13492 /* Binary numeric promotion is performed on the operands */
13493 binary_numeric_promotion (op1_type, op2_type, &op1, &op2);
13494 /* The type of the relation expression is always BOOLEAN */
13495 prom_type = boolean_type_node;
13498 /* 15.20 Equality Operator */
13501 /* It's time for us to patch the strings. */
13502 if ((cn = patch_string (op1)))
13505 op1_type = TREE_TYPE (op1);
13507 if ((cn = patch_string (op2)))
13510 op2_type = TREE_TYPE (op2);
13513 /* 15.20.1 Numerical Equality Operators == and != */
13514 /* Binary numeric promotion is performed on the operands */
13515 if (JNUMERIC_TYPE_P (op1_type) && JNUMERIC_TYPE_P (op2_type))
13516 binary_numeric_promotion (op1_type, op2_type, &op1, &op2);
13518 /* 15.20.2 Boolean Equality Operators == and != */
13519 else if (TREE_CODE (op1_type) == BOOLEAN_TYPE &&
13520 TREE_CODE (op2_type) == BOOLEAN_TYPE)
13521 ; /* Nothing to do here */
13523 /* 15.20.3 Reference Equality Operators == and != */
13524 /* Types have to be either references or the null type. If
13525 they're references, it must be possible to convert either
13526 type to the other by casting conversion. */
13527 else if (op1 == null_pointer_node || op2 == null_pointer_node
13528 || (JREFERENCE_TYPE_P (op1_type) && JREFERENCE_TYPE_P (op2_type)
13529 && (valid_ref_assignconv_cast_p (op1_type, op2_type, 1)
13530 || valid_ref_assignconv_cast_p (op2_type,
13532 ; /* Nothing to do here */
13534 /* Else we have an error figure what can't be converted into
13535 what and report the error */
13539 t1 = xstrdup (lang_printable_name (op1_type, 0));
13540 parse_error_context
13542 "Incompatible type for `%s'. Can't convert `%s' to `%s'",
13543 operator_string (node), t1,
13544 lang_printable_name (op2_type, 0));
13546 TREE_TYPE (node) = boolean_type_node;
13550 prom_type = boolean_type_node;
13557 return error_mark_node;
13559 TREE_OPERAND (node, 0) = op1;
13560 TREE_OPERAND (node, 1) = op2;
13561 TREE_TYPE (node) = prom_type;
13562 TREE_SIDE_EFFECTS (node) = TREE_SIDE_EFFECTS (op1) | TREE_SIDE_EFFECTS (op2);
13564 if (flag_emit_xref)
13567 /* fold does not respect side-effect order as required for Java but not C.
13568 * Also, it sometimes create SAVE_EXPRs which are bad when emitting
13571 if (flag_emit_class_files ? (TREE_CONSTANT (op1) && TREE_CONSTANT (op2))
13572 : ! TREE_SIDE_EFFECTS (node))
13573 node = fold (node);
13577 /* Concatenate the STRING_CST CSTE and STRING. When AFTER is a non
13578 zero value, the value of CSTE comes after the valude of STRING */
13581 do_merge_string_cste (tree cste, const char *string, int string_len, int after)
13583 const char *old = TREE_STRING_POINTER (cste);
13584 int old_len = TREE_STRING_LENGTH (cste);
13585 int len = old_len + string_len;
13586 char *new = alloca (len+1);
13590 memcpy (new, string, string_len);
13591 memcpy (&new [string_len], old, old_len);
13595 memcpy (new, old, old_len);
13596 memcpy (&new [old_len], string, string_len);
13599 return build_string (len, new);
13602 /* Tries to merge OP1 (a STRING_CST) and OP2 (if suitable). Return a
13603 new STRING_CST on success, NULL_TREE on failure. */
13606 merge_string_cste (tree op1, tree op2, int after)
13608 /* Handle two string constants right away. */
13609 if (TREE_CODE (op2) == STRING_CST)
13610 return do_merge_string_cste (op1, TREE_STRING_POINTER (op2),
13611 TREE_STRING_LENGTH (op2), after);
13613 /* Reasonable integer constant can be treated right away. */
13614 if (TREE_CODE (op2) == INTEGER_CST && !TREE_CONSTANT_OVERFLOW (op2))
13616 static const char *const boolean_true = "true";
13617 static const char *const boolean_false = "false";
13618 static const char *const null_pointer = "null";
13620 const char *string;
13622 if (op2 == boolean_true_node)
13623 string = boolean_true;
13624 else if (op2 == boolean_false_node)
13625 string = boolean_false;
13626 else if (op2 == null_pointer_node
13627 || (integer_zerop (op2)
13628 && TREE_CODE (TREE_TYPE (op2)) == POINTER_TYPE))
13629 /* FIXME: null is not a compile-time constant, so it is only safe to
13630 merge if the overall expression is non-constant. However, this
13631 code always merges without checking the overall expression. */
13632 string = null_pointer;
13633 else if (TREE_TYPE (op2) == char_type_node)
13635 /* Convert the character into UTF-8. */
13636 unsigned int c = (unsigned int) TREE_INT_CST_LOW (op2);
13637 unsigned char *p = (unsigned char *) ch;
13638 if (0x01 <= c && c <= 0x7f)
13639 *p++ = (unsigned char) c;
13640 else if (c < 0x7ff)
13642 *p++ = (unsigned char) (c >> 6 | 0xc0);
13643 *p++ = (unsigned char) ((c & 0x3f) | 0x80);
13647 *p++ = (unsigned char) (c >> 12 | 0xe0);
13648 *p++ = (unsigned char) (((c >> 6) & 0x3f) | 0x80);
13649 *p++ = (unsigned char) ((c & 0x3f) | 0x80);
13656 string = string_convert_int_cst (op2);
13658 return do_merge_string_cste (op1, string, strlen (string), after);
13663 /* Tries to statically concatenate OP1 and OP2 if possible. Either one
13664 has to be a STRING_CST and the other part must be a STRING_CST or a
13665 INTEGRAL constant. Return a new STRING_CST if the operation
13666 succeed, NULL_TREE otherwise.
13668 If the case we want to optimize for space, we might want to return
13669 NULL_TREE for each invocation of this routine. FIXME */
13672 string_constant_concatenation (tree op1, tree op2)
13674 if (TREE_CODE (op1) == STRING_CST || (TREE_CODE (op2) == STRING_CST))
13679 string = (TREE_CODE (op1) == STRING_CST ? op1 : op2);
13680 rest = (string == op1 ? op2 : op1);
13681 invert = (string == op1 ? 0 : 1 );
13683 /* Walk REST, only if it looks reasonable */
13684 if (TREE_CODE (rest) != STRING_CST
13685 && !IS_CRAFTED_STRING_BUFFER_P (rest)
13686 && !JSTRING_TYPE_P (TREE_TYPE (rest))
13687 && TREE_CODE (rest) == EXPR_WITH_FILE_LOCATION)
13689 rest = java_complete_tree (rest);
13690 if (rest == error_mark_node)
13691 return error_mark_node;
13692 rest = fold (rest);
13694 return merge_string_cste (string, rest, invert);
13699 /* Implement the `+' operator. Does static optimization if possible,
13700 otherwise create (if necessary) and append elements to a
13701 StringBuffer. The StringBuffer will be carried around until it is
13702 used for a function call or an assignment. Then toString() will be
13703 called on it to turn it into a String object. */
13706 build_string_concatenation (tree op1, tree op2)
13709 int side_effects = TREE_SIDE_EFFECTS (op1) | TREE_SIDE_EFFECTS (op2);
13711 if (flag_emit_xref)
13712 return build (PLUS_EXPR, string_type_node, op1, op2);
13714 /* Try to do some static optimization */
13715 if ((result = string_constant_concatenation (op1, op2)))
13718 /* Discard empty strings on either side of the expression */
13719 if (TREE_CODE (op1) == STRING_CST && TREE_STRING_LENGTH (op1) == 0)
13724 else if (TREE_CODE (op2) == STRING_CST && TREE_STRING_LENGTH (op2) == 0)
13727 /* If operands are string constant, turn then into object references */
13728 if (TREE_CODE (op1) == STRING_CST)
13729 op1 = patch_string_cst (op1);
13730 if (op2 && TREE_CODE (op2) == STRING_CST)
13731 op2 = patch_string_cst (op2);
13733 /* If either one of the constant is null and the other non null
13734 operand is a String constant, return it. */
13735 if ((TREE_CODE (op1) == STRING_CST) && !op2)
13738 /* If OP1 isn't already a StringBuffer, create and
13739 initialize a new one */
13740 if (!IS_CRAFTED_STRING_BUFFER_P (op1))
13742 /* Two solutions here:
13743 1) OP1 is a constant string reference, we call new StringBuffer(OP1)
13744 2) OP1 is something else, we call new StringBuffer().append(OP1). */
13745 if (TREE_CONSTANT (op1) && JSTRING_TYPE_P (TREE_TYPE (op1)))
13746 op1 = BUILD_STRING_BUFFER (op1);
13749 tree aNew = BUILD_STRING_BUFFER (NULL_TREE);
13750 op1 = make_qualified_primary (aNew, BUILD_APPEND (op1), 0);
13756 /* OP1 is no longer the last node holding a crafted StringBuffer */
13757 IS_CRAFTED_STRING_BUFFER_P (op1) = 0;
13758 /* Create a node for `{new...,xxx}.append (op2)' */
13760 op1 = make_qualified_primary (op1, BUILD_APPEND (op2), 0);
13763 /* Mark the last node holding a crafted StringBuffer */
13764 IS_CRAFTED_STRING_BUFFER_P (op1) = 1;
13766 TREE_SIDE_EFFECTS (op1) = side_effects;
13770 /* Patch the string node NODE. NODE can be a STRING_CST of a crafted
13771 StringBuffer. If no string were found to be patched, return
13775 patch_string (tree node)
13777 if (node == error_mark_node)
13778 return error_mark_node;
13779 if (TREE_CODE (node) == STRING_CST)
13780 return patch_string_cst (node);
13781 else if (IS_CRAFTED_STRING_BUFFER_P (node))
13783 int saved = ctxp->explicit_constructor_p;
13784 tree invoke = build_method_invocation (wfl_to_string, NULL_TREE);
13786 /* Temporary disable forbid the use of `this'. */
13787 ctxp->explicit_constructor_p = 0;
13788 ret = java_complete_tree (make_qualified_primary (node, invoke, 0));
13789 /* String concatenation arguments must be evaluated in order too. */
13790 ret = force_evaluation_order (ret);
13791 /* Restore it at its previous value */
13792 ctxp->explicit_constructor_p = saved;
13798 /* Build the internal representation of a string constant. */
13801 patch_string_cst (tree node)
13804 if (! flag_emit_class_files)
13806 node = get_identifier (TREE_STRING_POINTER (node));
13807 location = alloc_name_constant (CONSTANT_String, node);
13808 node = build_ref_from_constant_pool (location);
13810 TREE_CONSTANT (node) = 1;
13811 TREE_INVARIANT (node) = 1;
13813 /* ??? Guessing that the class file code can't handle casts. */
13814 if (! flag_emit_class_files)
13815 node = convert (string_ptr_type_node, node);
13817 TREE_TYPE (node) = string_ptr_type_node;
13822 /* Build an incomplete unary operator expression. */
13825 build_unaryop (int op_token, int op_location, tree op1)
13831 case PLUS_TK: op = UNARY_PLUS_EXPR; break;
13832 case MINUS_TK: op = NEGATE_EXPR; break;
13833 case NEG_TK: op = TRUTH_NOT_EXPR; break;
13834 case NOT_TK: op = BIT_NOT_EXPR; break;
13838 unaryop = build1 (op, NULL_TREE, op1);
13839 TREE_SIDE_EFFECTS (unaryop) = 1;
13840 /* Store the location of the operator, for better error report. The
13841 string of the operator will be rebuild based on the OP value. */
13842 EXPR_WFL_LINECOL (unaryop) = op_location;
13846 /* Special case for the ++/-- operators, since they require an extra
13847 argument to build, which is set to NULL and patched
13848 later. IS_POST_P is 1 if the operator, 0 otherwise. */
13851 build_incdec (int op_token, int op_location, tree op1, int is_post_p)
13853 static const enum tree_code lookup [2][2] =
13855 { PREDECREMENT_EXPR, PREINCREMENT_EXPR, },
13856 { POSTDECREMENT_EXPR, POSTINCREMENT_EXPR, },
13858 tree node = build (lookup [is_post_p][(op_token - DECR_TK)],
13859 NULL_TREE, op1, NULL_TREE);
13860 TREE_SIDE_EFFECTS (node) = 1;
13861 /* Store the location of the operator, for better error report. The
13862 string of the operator will be rebuild based on the OP value. */
13863 EXPR_WFL_LINECOL (node) = op_location;
13867 /* Build an incomplete cast operator, based on the use of the
13868 CONVERT_EXPR. Note that TREE_TYPE of the constructed node is
13869 set. java_complete_tree is trained to walk a CONVERT_EXPR even
13870 though its type is already set. */
13873 build_cast (int location, tree type, tree exp)
13875 tree node = build1 (CONVERT_EXPR, type, exp);
13876 EXPR_WFL_LINECOL (node) = location;
13880 /* Build an incomplete class reference operator. */
13882 build_incomplete_class_ref (int location, tree class_name)
13884 tree node = build1 (CLASS_LITERAL, NULL_TREE, class_name);
13885 tree class_decl = GET_CPC ();
13886 tree this_class = TREE_TYPE (class_decl);
13888 /* Generate the synthetic static method `class$'. (Previously we
13889 deferred this, causing different method tables to be emitted
13890 for native code and bytecode.) */
13891 if (!TYPE_DOT_CLASS (this_class)
13892 && !JPRIMITIVE_TYPE_P (class_name)
13893 && !(TREE_CODE (class_name) == VOID_TYPE))
13895 tree cpc_list = GET_CPC_LIST();
13896 tree cpc = cpc_list;
13899 /* For inner classes, add a 'class$' method to their outermost
13900 context, creating it if necessary. */
13902 while (GET_NEXT_ENCLOSING_CPC(cpc))
13903 cpc = GET_NEXT_ENCLOSING_CPC(cpc);
13904 class_decl = TREE_VALUE (cpc);
13906 target_class = TREE_TYPE (class_decl);
13908 if (CLASS_INTERFACE (TYPE_NAME (target_class)))
13910 /* For interfaces, adding a static 'class$' method directly
13911 is illegal. So create an inner class to contain the new
13912 method. Empirically this matches the behavior of javac. */
13914 /* We want the generated inner class inside the outermost class. */
13915 GET_CPC_LIST() = cpc;
13916 t = build_wfl_node (DECL_NAME (TYPE_NAME (object_type_node)));
13917 inner = create_anonymous_class (t);
13918 target_class = TREE_TYPE (inner);
13919 end_class_declaration (1);
13920 GET_CPC_LIST() = cpc_list;
13923 if (TYPE_DOT_CLASS (target_class) == NULL_TREE)
13924 build_dot_class_method (target_class);
13926 if (this_class != target_class)
13927 TYPE_DOT_CLASS (this_class) = TYPE_DOT_CLASS (target_class);
13930 EXPR_WFL_LINECOL (node) = location;
13934 /* Complete an incomplete class reference operator. */
13936 patch_incomplete_class_ref (tree node)
13938 tree type = TREE_OPERAND (node, 0);
13941 if (!(ref_type = resolve_type_during_patch (type)))
13942 return error_mark_node;
13944 /* If we're not emitting class files and we know ref_type is a
13945 compiled class, build a direct reference. */
13946 if ((! flag_emit_class_files && is_compiled_class (ref_type))
13947 || JPRIMITIVE_TYPE_P (ref_type)
13948 || TREE_CODE (ref_type) == VOID_TYPE)
13950 tree dot = build_class_ref (ref_type);
13951 /* A class referenced by `foo.class' is initialized. */
13952 if (!flag_emit_class_files)
13953 dot = build_class_init (ref_type, dot);
13954 return java_complete_tree (dot);
13957 /* If we're emitting class files and we have to deal with non
13958 primitive types, we invoke the synthetic static method `class$'. */
13959 ref_type = build_dot_class_method_invocation (current_class, ref_type);
13960 return java_complete_tree (ref_type);
13963 /* 15.14 Unary operators. We return error_mark_node in case of error,
13964 but preserve the type of NODE if the type is fixed. */
13967 patch_unaryop (tree node, tree wfl_op)
13969 tree op = TREE_OPERAND (node, 0);
13970 tree op_type = TREE_TYPE (op);
13971 tree prom_type = NULL_TREE, value, decl;
13972 int outer_field_flag = 0;
13973 int code = TREE_CODE (node);
13974 int error_found = 0;
13976 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
13980 /* 15.13.2 Postfix Increment Operator ++ */
13981 case POSTINCREMENT_EXPR:
13982 /* 15.13.3 Postfix Increment Operator -- */
13983 case POSTDECREMENT_EXPR:
13984 /* 15.14.1 Prefix Increment Operator ++ */
13985 case PREINCREMENT_EXPR:
13986 /* 15.14.2 Prefix Decrement Operator -- */
13987 case PREDECREMENT_EXPR:
13988 op = decl = strip_out_static_field_access_decl (op);
13989 outer_field_flag = outer_field_expanded_access_p (op, NULL, NULL, NULL);
13990 /* We might be trying to change an outer field accessed using
13992 if (outer_field_flag)
13994 /* Retrieve the decl of the field we're trying to access. We
13995 do that by first retrieving the function we would call to
13996 access the field. It has been already verified that this
13997 field isn't final */
13998 if (flag_emit_class_files)
13999 decl = TREE_OPERAND (op, 0);
14001 decl = TREE_OPERAND (TREE_OPERAND (TREE_OPERAND (op, 0), 0), 0);
14002 decl = DECL_FUNCTION_ACCESS_DECL (decl);
14004 /* We really should have a JAVA_ARRAY_EXPR to avoid this */
14005 else if (!JDECL_P (decl)
14006 && TREE_CODE (decl) != COMPONENT_REF
14007 && !(flag_emit_class_files && TREE_CODE (decl) == ARRAY_REF)
14008 && TREE_CODE (decl) != INDIRECT_REF
14009 && !(TREE_CODE (decl) == COMPOUND_EXPR
14010 && TREE_OPERAND (decl, 1)
14011 && (TREE_CODE (TREE_OPERAND (decl, 1)) == INDIRECT_REF)))
14013 TREE_TYPE (node) = error_mark_node;
14017 /* From now on, we know that op if a variable and that it has a
14018 valid wfl. We use wfl_op to locate errors related to the
14020 if (!JNUMERIC_TYPE_P (op_type))
14022 parse_error_context
14023 (wfl_op, "Invalid argument type `%s' to `%s'",
14024 lang_printable_name (op_type, 0), operator_string (node));
14025 TREE_TYPE (node) = error_mark_node;
14030 /* Before the addition, binary numeric promotion is performed on
14031 both operands, if really necessary */
14032 if (JINTEGRAL_TYPE_P (op_type))
14034 value = build_int_2 (1, 0);
14035 TREE_TYPE (value) = TREE_TYPE (node) = op_type;
14039 value = build_int_2 (1, 0);
14041 binary_numeric_promotion (op_type,
14042 TREE_TYPE (value), &op, &value);
14045 /* We remember we might be accessing an outer field */
14046 if (outer_field_flag)
14048 /* We re-generate an access to the field */
14049 value = build (PLUS_EXPR, TREE_TYPE (op),
14050 build_outer_field_access (wfl_op, decl), value);
14052 /* And we patch the original access$() into a write
14053 with plus_op as a rhs */
14054 return outer_field_access_fix (node, op, value);
14057 /* And write back into the node. */
14058 TREE_OPERAND (node, 0) = op;
14059 TREE_OPERAND (node, 1) = value;
14060 /* Convert the overall back into its original type, if
14061 necessary, and return */
14062 if (JINTEGRAL_TYPE_P (op_type))
14063 return fold (node);
14065 return fold (convert (op_type, node));
14069 /* 15.14.3 Unary Plus Operator + */
14070 case UNARY_PLUS_EXPR:
14071 /* 15.14.4 Unary Minus Operator - */
14073 if (!JNUMERIC_TYPE_P (op_type))
14075 ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op_type);
14076 TREE_TYPE (node) = error_mark_node;
14079 /* Unary numeric promotion is performed on operand */
14082 op = do_unary_numeric_promotion (op);
14083 prom_type = TREE_TYPE (op);
14084 if (code == UNARY_PLUS_EXPR)
14089 /* 15.14.5 Bitwise Complement Operator ~ */
14091 if (!JINTEGRAL_TYPE_P (op_type))
14093 ERROR_CAST_NEEDED_TO_INTEGRAL (wfl_operator, node, op_type);
14094 TREE_TYPE (node) = error_mark_node;
14099 op = do_unary_numeric_promotion (op);
14100 prom_type = TREE_TYPE (op);
14104 /* 15.14.6 Logical Complement Operator ! */
14105 case TRUTH_NOT_EXPR:
14106 if (TREE_CODE (op_type) != BOOLEAN_TYPE)
14108 ERROR_CANT_CONVERT_TO_BOOLEAN (wfl_operator, node, op_type);
14109 /* But the type is known. We will report an error if further
14110 attempt of a assignment is made with this rhs */
14111 TREE_TYPE (node) = boolean_type_node;
14115 prom_type = boolean_type_node;
14118 /* 15.15 Cast Expression */
14120 value = patch_cast (node, wfl_operator);
14121 if (value == error_mark_node)
14123 /* If this cast is part of an assignment, we tell the code
14124 that deals with it not to complain about a mismatch,
14125 because things have been cast, anyways */
14126 TREE_TYPE (node) = error_mark_node;
14131 value = fold (value);
14132 TREE_SIDE_EFFECTS (value) = TREE_SIDE_EFFECTS (op);
14139 return error_mark_node;
14141 /* There are cases where node has been replaced by something else
14142 and we don't end up returning here: UNARY_PLUS_EXPR,
14143 CONVERT_EXPR, {POST,PRE}{INCR,DECR}EMENT_EXPR. */
14144 TREE_OPERAND (node, 0) = fold (op);
14145 TREE_TYPE (node) = prom_type;
14146 TREE_SIDE_EFFECTS (node) = TREE_SIDE_EFFECTS (op);
14147 return fold (node);
14150 /* Generic type resolution that sometimes takes place during node
14151 patching. Returned the resolved type or generate an error
14152 message. Return the resolved type or NULL_TREE. */
14155 resolve_type_during_patch (tree type)
14157 if (unresolved_type_p (type, NULL))
14159 tree type_decl = resolve_and_layout (EXPR_WFL_NODE (type), type);
14162 parse_error_context (type,
14163 "Class `%s' not found in type declaration",
14164 IDENTIFIER_POINTER (EXPR_WFL_NODE (type)));
14168 check_deprecation (type, type_decl);
14170 return TREE_TYPE (type_decl);
14175 /* 5.5 Casting Conversion. error_mark_node is returned if an error is
14176 found. Otherwise NODE or something meant to replace it is returned. */
14179 patch_cast (tree node, tree wfl_op)
14181 tree op = TREE_OPERAND (node, 0);
14182 tree cast_type = TREE_TYPE (node);
14183 tree patched, op_type;
14186 /* Some string patching might be necessary at this stage */
14187 if ((patched = patch_string (op)))
14188 TREE_OPERAND (node, 0) = op = patched;
14189 op_type = TREE_TYPE (op);
14191 /* First resolve OP_TYPE if unresolved */
14192 if (!(cast_type = resolve_type_during_patch (cast_type)))
14193 return error_mark_node;
14195 /* Check on cast that are proven correct at compile time */
14196 if (JNUMERIC_TYPE_P (cast_type) && JNUMERIC_TYPE_P (op_type))
14199 if (cast_type == op_type)
14202 /* A narrowing conversion from a floating-point number to an
14203 integral type requires special handling (5.1.3). */
14204 if (JFLOAT_TYPE_P (op_type) && JINTEGRAL_TYPE_P (cast_type))
14205 if (cast_type != long_type_node)
14206 op = convert (integer_type_node, op);
14208 /* Try widening/narrowing conversion. Potentially, things need
14209 to be worked out in gcc so we implement the extreme cases
14210 correctly. fold_convert() needs to be fixed. */
14211 return convert (cast_type, op);
14214 /* It's also valid to cast a boolean into a boolean */
14215 if (op_type == boolean_type_node && cast_type == boolean_type_node)
14218 /* null can be casted to references */
14219 if (op == null_pointer_node && JREFERENCE_TYPE_P (cast_type))
14220 return build_null_of_type (cast_type);
14222 /* The remaining legal casts involve conversion between reference
14223 types. Check for their compile time correctness. */
14224 if (JREFERENCE_TYPE_P (op_type) && JREFERENCE_TYPE_P (cast_type)
14225 && valid_ref_assignconv_cast_p (op_type, cast_type, 1))
14227 TREE_TYPE (node) = promote_type (cast_type);
14228 /* Now, the case can be determined correct at compile time if
14229 OP_TYPE can be converted into CAST_TYPE by assignment
14230 conversion (5.2) */
14232 if (valid_ref_assignconv_cast_p (op_type, cast_type, 0))
14234 TREE_SET_CODE (node, NOP_EXPR);
14238 if (flag_emit_class_files)
14240 TREE_SET_CODE (node, CONVERT_EXPR);
14244 /* The cast requires a run-time check */
14245 return build (CALL_EXPR, promote_type (cast_type),
14246 build_address_of (soft_checkcast_node),
14247 tree_cons (NULL_TREE, build_class_ref (cast_type),
14248 build_tree_list (NULL_TREE, op)),
14252 /* Any other casts are proven incorrect at compile time */
14253 t1 = xstrdup (lang_printable_name (op_type, 0));
14254 parse_error_context (wfl_op, "Invalid cast from `%s' to `%s'",
14255 t1, lang_printable_name (cast_type, 0));
14257 return error_mark_node;
14260 /* Build a null constant and give it the type TYPE. */
14263 build_null_of_type (tree type)
14265 tree node = build_int_2 (0, 0);
14266 TREE_TYPE (node) = promote_type (type);
14270 /* Build an ARRAY_REF incomplete tree node. Note that operand 1 isn't
14271 a list of indices. */
14273 build_array_ref (int location, tree array, tree index)
14275 tree node = build (ARRAY_REF, NULL_TREE, array, index, NULL_TREE, NULL_TREE);
14276 EXPR_WFL_LINECOL (node) = location;
14280 /* 15.12 Array Access Expression */
14283 patch_array_ref (tree node)
14285 tree array = TREE_OPERAND (node, 0);
14286 tree array_type = TREE_TYPE (array);
14287 tree index = TREE_OPERAND (node, 1);
14288 tree index_type = TREE_TYPE (index);
14289 int error_found = 0;
14291 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
14293 if (TREE_CODE (array_type) == POINTER_TYPE)
14294 array_type = TREE_TYPE (array_type);
14296 /* The array reference must be an array */
14297 if (!TYPE_ARRAY_P (array_type))
14299 parse_error_context
14301 "`[]' can only be applied to arrays. It can't be applied to `%s'",
14302 lang_printable_name (array_type, 0));
14303 TREE_TYPE (node) = error_mark_node;
14307 /* The array index undergoes unary numeric promotion. The promoted
14308 type must be int */
14309 index = do_unary_numeric_promotion (index);
14310 if (TREE_TYPE (index) != int_type_node)
14312 if (valid_cast_to_p (index_type, int_type_node))
14313 parse_error_context (wfl_operator,
14314 "Incompatible type for `[]'. Explicit cast needed to convert `%s' to `int'",
14315 lang_printable_name (index_type, 0));
14317 parse_error_context (wfl_operator,
14318 "Incompatible type for `[]'. Can't convert `%s' to `int'",
14319 lang_printable_name (index_type, 0));
14320 TREE_TYPE (node) = error_mark_node;
14325 return error_mark_node;
14327 array_type = TYPE_ARRAY_ELEMENT (array_type);
14329 if (flag_emit_class_files || flag_emit_xref)
14331 TREE_OPERAND (node, 0) = array;
14332 TREE_OPERAND (node, 1) = index;
14335 node = build_java_arrayaccess (array, array_type, index);
14336 TREE_TYPE (node) = array_type;
14340 /* 15.9 Array Creation Expressions */
14343 build_newarray_node (tree type, tree dims, int extra_dims)
14346 build (NEW_ARRAY_EXPR, NULL_TREE, type, nreverse (dims),
14347 build_int_2 (extra_dims, 0));
14352 patch_newarray (tree node)
14354 tree type = TREE_OPERAND (node, 0);
14355 tree dims = TREE_OPERAND (node, 1);
14356 tree cdim, array_type;
14357 int error_found = 0;
14359 int xdims = TREE_INT_CST_LOW (TREE_OPERAND (node, 2));
14361 /* Dimension types are verified. It's better for the types to be
14362 verified in order. */
14363 for (cdim = dims, ndims = 0; cdim; cdim = TREE_CHAIN (cdim), ndims++ )
14366 tree dim = TREE_VALUE (cdim);
14368 /* Dim might have been saved during its evaluation */
14369 dim = (TREE_CODE (dim) == SAVE_EXPR ? TREE_OPERAND (dim, 0) : dim);
14371 /* The type of each specified dimension must be an integral type. */
14372 if (!JINTEGRAL_TYPE_P (TREE_TYPE (dim)))
14375 /* Each expression undergoes an unary numeric promotion (5.6.1) and the
14376 promoted type must be int. */
14379 dim = do_unary_numeric_promotion (dim);
14380 if (TREE_TYPE (dim) != int_type_node)
14384 /* Report errors on types here */
14387 parse_error_context
14388 (TREE_PURPOSE (cdim),
14389 "Incompatible type for dimension in array creation expression. %s convert `%s' to `int'",
14390 (valid_cast_to_p (TREE_TYPE (dim), int_type_node) ?
14391 "Explicit cast needed to" : "Can't"),
14392 lang_printable_name (TREE_TYPE (dim), 0));
14396 TREE_PURPOSE (cdim) = NULL_TREE;
14399 /* Resolve array base type if unresolved */
14400 if (!(type = resolve_type_during_patch (type)))
14405 /* We don't want further evaluation of this bogus array creation
14407 TREE_TYPE (node) = error_mark_node;
14408 return error_mark_node;
14411 /* Set array_type to the actual (promoted) array type of the result. */
14412 if (TREE_CODE (type) == RECORD_TYPE)
14413 type = build_pointer_type (type);
14414 while (--xdims >= 0)
14416 type = promote_type (build_java_array_type (type, -1));
14418 dims = nreverse (dims);
14420 for (cdim = dims; cdim; cdim = TREE_CHAIN (cdim))
14424 = build_java_array_type (type,
14425 TREE_CODE (cdim) == INTEGER_CST
14426 ? (HOST_WIDE_INT) TREE_INT_CST_LOW (cdim)
14428 array_type = promote_type (array_type);
14430 dims = nreverse (dims);
14432 /* The node is transformed into a function call. Things are done
14433 differently according to the number of dimensions. If the number
14434 of dimension is equal to 1, then the nature of the base type
14435 (primitive or not) matters. */
14437 return build_new_array (type, TREE_VALUE (dims));
14439 /* Can't reuse what's already written in expr.c because it uses the
14440 JVM stack representation. Provide a build_multianewarray. FIXME */
14441 return build (CALL_EXPR, array_type,
14442 build_address_of (soft_multianewarray_node),
14443 tree_cons (NULL_TREE, build_class_ref (TREE_TYPE (array_type)),
14444 tree_cons (NULL_TREE,
14445 build_int_2 (ndims, 0), dims )),
14449 /* 10.6 Array initializer. */
14451 /* Build a wfl for array element that don't have one, so we can
14452 pin-point errors. */
14455 maybe_build_array_element_wfl (tree node)
14457 if (TREE_CODE (node) != EXPR_WITH_FILE_LOCATION)
14458 return build_expr_wfl (NULL_TREE, ctxp->filename,
14459 ctxp->elc.line, ctxp->elc.prev_col);
14464 /* Build a NEW_ARRAY_INIT that features a CONSTRUCTOR node. This makes
14465 identification of initialized arrays easier to detect during walk
14469 build_new_array_init (int location, tree values)
14471 tree constructor = build_constructor (NULL_TREE, values);
14472 tree to_return = build1 (NEW_ARRAY_INIT, NULL_TREE, constructor);
14473 EXPR_WFL_LINECOL (to_return) = location;
14477 /* Expand a NEW_ARRAY_INIT node. Return error_mark_node if an error
14478 occurred. Otherwise return NODE after having set its type
14482 patch_new_array_init (tree type, tree node)
14484 int error_seen = 0;
14485 tree current, element_type;
14486 HOST_WIDE_INT length;
14487 int all_constant = 1;
14488 tree init = TREE_OPERAND (node, 0);
14490 if (TREE_CODE (type) != POINTER_TYPE || ! TYPE_ARRAY_P (TREE_TYPE (type)))
14492 parse_error_context (node,
14493 "Invalid array initializer for non-array type `%s'",
14494 lang_printable_name (type, 1));
14495 return error_mark_node;
14497 type = TREE_TYPE (type);
14498 element_type = TYPE_ARRAY_ELEMENT (type);
14500 CONSTRUCTOR_ELTS (init) = nreverse (CONSTRUCTOR_ELTS (init));
14502 for (length = 0, current = CONSTRUCTOR_ELTS (init);
14503 current; length++, current = TREE_CHAIN (current))
14505 tree elt = TREE_VALUE (current);
14506 if (elt == NULL_TREE || TREE_CODE (elt) != NEW_ARRAY_INIT)
14508 error_seen |= array_constructor_check_entry (element_type, current);
14509 elt = TREE_VALUE (current);
14510 /* When compiling to native code, STRING_CST is converted to
14511 INDIRECT_REF, but still with a TREE_CONSTANT flag. */
14512 if (! TREE_CONSTANT (elt) || TREE_CODE (elt) == INDIRECT_REF)
14517 TREE_VALUE (current) = patch_new_array_init (element_type, elt);
14518 TREE_PURPOSE (current) = NULL_TREE;
14521 if (elt && TREE_CODE (elt) == TREE_LIST
14522 && TREE_VALUE (elt) == error_mark_node)
14527 return error_mark_node;
14529 /* Create a new type. We can't reuse the one we have here by
14530 patching its dimension because it originally is of dimension -1
14531 hence reused by gcc. This would prevent triangular arrays. */
14532 type = build_java_array_type (element_type, length);
14533 TREE_TYPE (init) = TREE_TYPE (TREE_CHAIN (TREE_CHAIN (TYPE_FIELDS (type))));
14534 TREE_TYPE (node) = promote_type (type);
14535 TREE_CONSTANT (init) = all_constant;
14536 TREE_INVARIANT (init) = all_constant;
14537 TREE_CONSTANT (node) = all_constant;
14538 TREE_INVARIANT (node) = all_constant;
14542 /* Verify that one entry of the initializer element list can be
14543 assigned to the array base type. Report 1 if an error occurred, 0
14547 array_constructor_check_entry (tree type, tree entry)
14549 char *array_type_string = NULL; /* For error reports */
14550 tree value, type_value, new_value, wfl_value, patched;
14551 int error_seen = 0;
14553 new_value = NULL_TREE;
14554 wfl_value = TREE_VALUE (entry);
14556 value = java_complete_tree (TREE_VALUE (entry));
14557 /* patch_string return error_mark_node if arg is error_mark_node */
14558 if ((patched = patch_string (value)))
14560 if (value == error_mark_node)
14563 type_value = TREE_TYPE (value);
14565 /* At anytime, try_builtin_assignconv can report a warning on
14566 constant overflow during narrowing. */
14567 SET_WFL_OPERATOR (wfl_operator, TREE_PURPOSE (entry), wfl_value);
14568 new_value = try_builtin_assignconv (wfl_operator, type, value);
14569 if (!new_value && (new_value = try_reference_assignconv (type, value)))
14570 type_value = promote_type (type);
14572 /* Check and report errors */
14575 const char *const msg = (!valid_cast_to_p (type_value, type) ?
14576 "Can't" : "Explicit cast needed to");
14577 if (!array_type_string)
14578 array_type_string = xstrdup (lang_printable_name (type, 1));
14579 parse_error_context
14580 (wfl_operator, "Incompatible type for array. %s convert `%s' to `%s'",
14581 msg, lang_printable_name (type_value, 1), array_type_string);
14586 TREE_VALUE (entry) = new_value;
14588 if (array_type_string)
14589 free (array_type_string);
14591 TREE_PURPOSE (entry) = NULL_TREE;
14596 build_this (int location)
14598 tree node = build_wfl_node (this_identifier_node);
14599 TREE_SET_CODE (node, THIS_EXPR);
14600 EXPR_WFL_LINECOL (node) = location;
14604 /* 14.15 The return statement. It builds a modify expression that
14605 assigns the returned value to the RESULT_DECL that hold the value
14609 build_return (int location, tree op)
14611 tree node = build1 (RETURN_EXPR, NULL_TREE, op);
14612 EXPR_WFL_LINECOL (node) = location;
14613 node = build_debugable_stmt (location, node);
14618 patch_return (tree node)
14620 tree return_exp = TREE_OPERAND (node, 0);
14621 tree meth = current_function_decl;
14622 tree mtype = TREE_TYPE (TREE_TYPE (current_function_decl));
14623 int error_found = 0;
14625 TREE_TYPE (node) = error_mark_node;
14626 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
14628 /* It's invalid to have a return value within a function that is
14629 declared with the keyword void or that is a constructor */
14630 if (return_exp && (mtype == void_type_node || DECL_CONSTRUCTOR_P (meth)))
14633 /* It's invalid to use a return statement in a static block */
14634 if (DECL_CLINIT_P (current_function_decl))
14637 /* It's invalid to have a no return value within a function that
14638 isn't declared with the keyword `void' */
14639 if (!return_exp && (mtype != void_type_node && !DECL_CONSTRUCTOR_P (meth)))
14642 if (DECL_INSTINIT_P (current_function_decl))
14647 if (DECL_INSTINIT_P (current_function_decl))
14648 parse_error_context (wfl_operator,
14649 "`return' inside instance initializer");
14651 else if (DECL_CLINIT_P (current_function_decl))
14652 parse_error_context (wfl_operator,
14653 "`return' inside static initializer");
14655 else if (!DECL_CONSTRUCTOR_P (meth))
14657 char *t = xstrdup (lang_printable_name (mtype, 0));
14658 parse_error_context (wfl_operator,
14659 "`return' with%s value from `%s %s'",
14660 (error_found == 1 ? "" : "out"),
14661 t, lang_printable_name (meth, 0));
14665 parse_error_context (wfl_operator,
14666 "`return' with value from constructor `%s'",
14667 lang_printable_name (meth, 0));
14668 return error_mark_node;
14671 /* If we have a return_exp, build a modify expression and expand
14672 it. Note: at that point, the assignment is declared valid, but we
14673 may want to carry some more hacks */
14676 tree exp = java_complete_tree (return_exp);
14677 tree modify, patched;
14679 if ((patched = patch_string (exp)))
14682 modify = build (MODIFY_EXPR, NULL_TREE, DECL_RESULT (meth), exp);
14683 EXPR_WFL_LINECOL (modify) = EXPR_WFL_LINECOL (node);
14684 modify = java_complete_tree (modify);
14686 if (modify != error_mark_node)
14688 TREE_SIDE_EFFECTS (modify) = 1;
14689 TREE_OPERAND (node, 0) = modify;
14692 return error_mark_node;
14694 TREE_TYPE (node) = void_type_node;
14695 TREE_SIDE_EFFECTS (node) = 1;
14699 /* 14.8 The if Statement */
14702 build_if_else_statement (int location, tree expression, tree if_body,
14707 else_body = build_java_empty_stmt ();
14708 node = build (COND_EXPR, NULL_TREE, expression, if_body, else_body);
14709 EXPR_WFL_LINECOL (node) = location;
14710 node = build_debugable_stmt (location, node);
14715 patch_if_else_statement (tree node)
14717 tree expression = TREE_OPERAND (node, 0);
14718 int can_complete_normally
14719 = (CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 1))
14720 | CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 2)));
14722 TREE_TYPE (node) = error_mark_node;
14723 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
14725 /* The type of expression must be boolean */
14726 if (TREE_TYPE (expression) != boolean_type_node
14727 && TREE_TYPE (expression) != promoted_boolean_type_node)
14729 parse_error_context
14731 "Incompatible type for `if'. Can't convert `%s' to `boolean'",
14732 lang_printable_name (TREE_TYPE (expression), 0));
14733 return error_mark_node;
14736 TREE_TYPE (node) = void_type_node;
14737 TREE_SIDE_EFFECTS (node) = 1;
14738 CAN_COMPLETE_NORMALLY (node) = can_complete_normally;
14742 /* 14.6 Labeled Statements */
14744 /* Action taken when a labeled statement is parsed. a new
14745 LABELED_BLOCK_EXPR is created. No statement is attached to the
14746 label, yet. LABEL can be NULL_TREE for artificially-generated blocks. */
14749 build_labeled_block (int location, tree label)
14752 tree label_decl, node;
14753 if (label == NULL_TREE || label == continue_identifier_node)
14754 label_name = label;
14757 label_name = merge_qualified_name (label_id, label);
14758 /* Issue an error if we try to reuse a label that was previously
14760 if (IDENTIFIER_LOCAL_VALUE (label_name))
14762 EXPR_WFL_LINECOL (wfl_operator) = location;
14763 parse_error_context (wfl_operator,
14764 "Declaration of `%s' shadows a previous label declaration",
14765 IDENTIFIER_POINTER (label));
14766 EXPR_WFL_LINECOL (wfl_operator) =
14767 EXPR_WFL_LINECOL (IDENTIFIER_LOCAL_VALUE (label_name));
14768 parse_error_context (wfl_operator,
14769 "This is the location of the previous declaration of label `%s'",
14770 IDENTIFIER_POINTER (label));
14771 java_error_count--;
14775 label_decl = create_label_decl (label_name);
14776 node = build (LABELED_BLOCK_EXPR, NULL_TREE, label_decl, NULL_TREE);
14777 EXPR_WFL_LINECOL (node) = location;
14778 TREE_SIDE_EFFECTS (node) = 1;
14782 /* A labeled statement LBE is attached a statement. */
14785 finish_labeled_statement (tree lbe, /* Labeled block expr */
14788 /* In anyways, tie the loop to its statement */
14789 LABELED_BLOCK_BODY (lbe) = statement;
14790 pop_labeled_block ();
14791 POP_LABELED_BLOCK ();
14795 /* 14.10, 14.11, 14.12 Loop Statements */
14797 /* Create an empty LOOP_EXPR and make it the last in the nested loop
14801 build_new_loop (tree loop_body)
14803 tree loop = build (LOOP_EXPR, NULL_TREE, loop_body);
14804 TREE_SIDE_EFFECTS (loop) = 1;
14809 /* Create a loop body according to the following structure:
14811 COMPOUND_EXPR (loop main body)
14812 EXIT_EXPR (this order is for while/for loops.
14813 LABELED_BLOCK_EXPR the order is reversed for do loops)
14814 LABEL_DECL (a continue occurring here branches at the
14815 BODY end of this labeled block)
14818 REVERSED, if nonzero, tells that the loop condition expr comes
14819 after the body, like in the do-while loop.
14821 To obtain a loop, the loop body structure described above is
14822 encapsulated within a LOOP_EXPR surrounded by a LABELED_BLOCK_EXPR:
14825 LABEL_DECL (use this label to exit the loop)
14827 <structure described above> */
14830 build_loop_body (int location, tree condition, int reversed)
14832 tree first, second, body;
14834 condition = build (EXIT_EXPR, NULL_TREE, condition); /* Force walk */
14835 EXPR_WFL_LINECOL (condition) = location; /* For accurate error report */
14836 condition = build_debugable_stmt (location, condition);
14837 TREE_SIDE_EFFECTS (condition) = 1;
14839 body = build_labeled_block (0, continue_identifier_node);
14840 first = (reversed ? body : condition);
14841 second = (reversed ? condition : body);
14843 build (COMPOUND_EXPR, NULL_TREE,
14844 build (COMPOUND_EXPR, NULL_TREE, first, second),
14845 build_java_empty_stmt ());
14848 /* Install CONDITION (if any) and loop BODY (using REVERSED to tell
14849 their order) on the current loop. Unlink the current loop from the
14853 finish_loop_body (int location, tree condition, tree body, int reversed)
14855 tree to_return = ctxp->current_loop;
14856 tree loop_body = LOOP_EXPR_BODY (to_return);
14859 tree cnode = LOOP_EXPR_BODY_CONDITION_EXPR (loop_body, reversed);
14860 /* We wrapped the EXIT_EXPR around a WFL so we can debug it.
14861 The real EXIT_EXPR is one operand further. */
14862 EXPR_WFL_LINECOL (cnode) = location;
14863 /* This one is for accurate error reports */
14864 EXPR_WFL_LINECOL (TREE_OPERAND (cnode, 0)) = location;
14865 TREE_OPERAND (TREE_OPERAND (cnode, 0), 0) = condition;
14867 LOOP_EXPR_BODY_BODY_EXPR (loop_body, reversed) = body;
14872 /* Tailored version of finish_loop_body for FOR loops, when FOR
14873 loops feature the condition part */
14876 finish_for_loop (int location, tree condition, tree update, tree body)
14878 /* Put the condition and the loop body in place */
14879 tree loop = finish_loop_body (location, condition, body, 0);
14880 /* LOOP is the current loop which has been now popped of the loop
14881 stack. Mark the update block as reachable and install it. We do
14882 this because the (current interpretation of the) JLS requires
14883 that the update expression be considered reachable even if the
14884 for loop's body doesn't complete normally. */
14885 if (update != NULL_TREE && !IS_EMPTY_STMT (update))
14888 if (TREE_CODE (up2) == EXPR_WITH_FILE_LOCATION)
14889 up2 = EXPR_WFL_NODE (up2);
14890 /* It is possible for the update expression to be an
14891 EXPR_WFL_NODE wrapping nothing. */
14892 if (up2 != NULL_TREE && !IS_EMPTY_STMT (up2))
14894 /* Try to detect constraint violations. These would be
14895 programming errors somewhere. */
14896 if (! IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (up2)))
14897 || TREE_CODE (up2) == LOOP_EXPR)
14899 SUPPRESS_UNREACHABLE_ERROR (up2) = 1;
14902 LOOP_EXPR_BODY_UPDATE_BLOCK (LOOP_EXPR_BODY (loop)) = update;
14906 /* Try to find the loop a block might be related to. This comprises
14907 the case where the LOOP_EXPR is found as the second operand of a
14908 COMPOUND_EXPR, because the loop happens to have an initialization
14909 part, then expressed as the first operand of the COMPOUND_EXPR. If
14910 the search finds something, 1 is returned. Otherwise, 0 is
14911 returned. The search is assumed to start from a
14912 LABELED_BLOCK_EXPR's block. */
14915 search_loop (tree statement)
14917 if (TREE_CODE (statement) == LOOP_EXPR)
14920 if (TREE_CODE (statement) == BLOCK)
14921 statement = BLOCK_SUBBLOCKS (statement);
14925 if (statement && TREE_CODE (statement) == COMPOUND_EXPR)
14926 while (statement && TREE_CODE (statement) == COMPOUND_EXPR)
14927 statement = TREE_OPERAND (statement, 1);
14929 return (TREE_CODE (statement) == LOOP_EXPR
14930 && FOR_LOOP_P (statement) ? statement : NULL_TREE);
14933 /* Return 1 if LOOP can be found in the labeled block BLOCK. 0 is
14934 returned otherwise. */
14937 labeled_block_contains_loop_p (tree block, tree loop)
14942 if (LABELED_BLOCK_BODY (block) == loop)
14945 if (FOR_LOOP_P (loop) && search_loop (LABELED_BLOCK_BODY (block)) == loop)
14951 /* If the loop isn't surrounded by a labeled statement, create one and
14952 insert LOOP as its body. */
14955 patch_loop_statement (tree loop)
14959 TREE_TYPE (loop) = void_type_node;
14960 if (labeled_block_contains_loop_p (ctxp->current_labeled_block, loop))
14963 loop_label = build_labeled_block (0, NULL_TREE);
14964 /* LOOP is an EXPR node, so it should have a valid EXPR_WFL_LINECOL
14965 that LOOP_LABEL could enquire about, for a better accuracy. FIXME */
14966 LABELED_BLOCK_BODY (loop_label) = loop;
14967 PUSH_LABELED_BLOCK (loop_label);
14971 /* 14.13, 14.14: break and continue Statements */
14973 /* Build a break or a continue statement. a null NAME indicates an
14974 unlabeled break/continue statement. */
14977 build_bc_statement (int location, int is_break, tree name)
14979 tree break_continue, label_block_expr = NULL_TREE;
14983 if (!(label_block_expr = IDENTIFIER_LOCAL_VALUE
14984 (merge_qualified_name (label_id, EXPR_WFL_NODE (name)))))
14985 /* Null means that we don't have a target for this named
14986 break/continue. In this case, we make the target to be the
14987 label name, so that the error can be reported accurately in
14988 patch_bc_statement. */
14989 label_block_expr = EXPR_WFL_NODE (name);
14991 /* Unlabeled break/continue will be handled during the
14992 break/continue patch operation */
14994 = build (EXIT_BLOCK_EXPR, NULL_TREE, label_block_expr, NULL_TREE);
14996 IS_BREAK_STMT_P (break_continue) = is_break;
14997 TREE_SIDE_EFFECTS (break_continue) = 1;
14998 EXPR_WFL_LINECOL (break_continue) = location;
14999 break_continue = build_debugable_stmt (location, break_continue);
15000 return break_continue;
15003 /* Verification of a break/continue statement. */
15006 patch_bc_statement (tree node)
15008 tree bc_label = EXIT_BLOCK_LABELED_BLOCK (node), target_stmt;
15009 tree labeled_block = ctxp->current_labeled_block;
15010 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
15012 /* Having an identifier here means that the target is unknown. */
15013 if (bc_label != NULL_TREE && TREE_CODE (bc_label) == IDENTIFIER_NODE)
15015 parse_error_context (wfl_operator, "No label definition found for `%s'",
15016 IDENTIFIER_POINTER (bc_label));
15017 return error_mark_node;
15019 if (! IS_BREAK_STMT_P (node))
15021 /* It's a continue statement. */
15022 for (;; labeled_block = TREE_CHAIN (labeled_block))
15024 if (labeled_block == NULL_TREE)
15026 if (bc_label == NULL_TREE)
15027 parse_error_context (wfl_operator,
15028 "`continue' must be in loop");
15030 parse_error_context
15031 (wfl_operator, "continue label `%s' does not name a loop",
15032 IDENTIFIER_POINTER (bc_label));
15033 return error_mark_node;
15035 if ((DECL_NAME (LABELED_BLOCK_LABEL (labeled_block))
15036 == continue_identifier_node)
15037 && (bc_label == NULL_TREE
15038 || TREE_CHAIN (labeled_block) == bc_label))
15040 bc_label = labeled_block;
15045 else if (!bc_label)
15047 for (;; labeled_block = TREE_CHAIN (labeled_block))
15049 if (labeled_block == NULL_TREE)
15051 parse_error_context (wfl_operator,
15052 "`break' must be in loop or switch");
15053 return error_mark_node;
15055 target_stmt = LABELED_BLOCK_BODY (labeled_block);
15056 if (TREE_CODE (target_stmt) == SWITCH_EXPR
15057 || search_loop (target_stmt))
15059 bc_label = labeled_block;
15065 EXIT_BLOCK_LABELED_BLOCK (node) = bc_label;
15066 CAN_COMPLETE_NORMALLY (bc_label) = 1;
15068 /* Our break/continue don't return values. */
15069 TREE_TYPE (node) = void_type_node;
15070 /* Encapsulate the break within a compound statement so that it's
15071 expanded all the times by expand_expr (and not clobbered
15072 sometimes, like after a if statement) */
15073 node = add_stmt_to_compound (NULL_TREE, void_type_node, node);
15074 TREE_SIDE_EFFECTS (node) = 1;
15078 /* Process the exit expression belonging to a loop. Its type must be
15082 patch_exit_expr (tree node)
15084 tree expression = TREE_OPERAND (node, 0);
15085 TREE_TYPE (node) = error_mark_node;
15086 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
15088 /* The type of expression must be boolean */
15089 if (TREE_TYPE (expression) != boolean_type_node)
15091 parse_error_context
15093 "Incompatible type for loop conditional. Can't convert `%s' to `boolean'",
15094 lang_printable_name (TREE_TYPE (expression), 0));
15095 return error_mark_node;
15097 /* Now we know things are allright, invert the condition, fold and
15099 TREE_OPERAND (node, 0) =
15100 fold (build1 (TRUTH_NOT_EXPR, boolean_type_node, expression));
15102 if (! integer_zerop (TREE_OPERAND (node, 0))
15103 && ctxp->current_loop != NULL_TREE
15104 && TREE_CODE (ctxp->current_loop) == LOOP_EXPR)
15105 CAN_COMPLETE_NORMALLY (ctxp->current_loop) = 1;
15106 if (! integer_onep (TREE_OPERAND (node, 0)))
15107 CAN_COMPLETE_NORMALLY (node) = 1;
15110 TREE_TYPE (node) = void_type_node;
15114 /* 14.9 Switch statement */
15117 patch_switch_statement (tree node)
15119 tree se = TREE_OPERAND (node, 0), se_type;
15122 /* Complete the switch expression */
15123 se = TREE_OPERAND (node, 0) = java_complete_tree (se);
15124 se_type = TREE_TYPE (se);
15125 /* The type of the switch expression must be char, byte, short or
15127 if (! JINTEGRAL_TYPE_P (se_type) || se_type == long_type_node)
15129 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
15130 parse_error_context (wfl_operator,
15131 "Incompatible type for `switch'. Can't convert `%s' to `int'",
15132 lang_printable_name (se_type, 0));
15133 /* This is what java_complete_tree will check */
15134 TREE_OPERAND (node, 0) = error_mark_node;
15135 return error_mark_node;
15138 /* Save and restore the outer case label list. */
15139 save = case_label_list;
15140 case_label_list = NULL_TREE;
15142 TREE_OPERAND (node, 1) = java_complete_tree (TREE_OPERAND (node, 1));
15144 /* See if we've found a duplicate label. We can't leave this until
15145 code generation, because in `--syntax-only' and `-C' modes we
15146 don't do ordinary code generation. */
15147 for (iter = case_label_list; iter != NULL_TREE; iter = TREE_CHAIN (iter))
15149 HOST_WIDE_INT val = TREE_INT_CST_LOW (TREE_VALUE (iter));
15151 for (subiter = TREE_CHAIN (iter);
15152 subiter != NULL_TREE;
15153 subiter = TREE_CHAIN (subiter))
15155 HOST_WIDE_INT subval = TREE_INT_CST_LOW (TREE_VALUE (subiter));
15158 EXPR_WFL_LINECOL (wfl_operator)
15159 = EXPR_WFL_LINECOL (TREE_PURPOSE (iter));
15160 /* The case_label_list is in reverse order, so print the
15161 outer label first. */
15162 parse_error_context (wfl_operator, "duplicate case label: `"
15163 HOST_WIDE_INT_PRINT_DEC "'", subval);
15164 EXPR_WFL_LINECOL (wfl_operator)
15165 = EXPR_WFL_LINECOL (TREE_PURPOSE (subiter));
15166 parse_error_context (wfl_operator, "original label is here");
15173 case_label_list = save;
15175 /* Ready to return */
15176 if (TREE_CODE (TREE_OPERAND (node, 1)) == ERROR_MARK)
15178 TREE_TYPE (node) = error_mark_node;
15179 return error_mark_node;
15181 TREE_TYPE (node) = void_type_node;
15182 TREE_SIDE_EFFECTS (node) = 1;
15183 CAN_COMPLETE_NORMALLY (node)
15184 = CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 1))
15185 || ! SWITCH_HAS_DEFAULT (node);
15191 /* Build an assertion expression for `assert CONDITION : VALUE'; VALUE
15192 might be NULL_TREE. */
15194 build_assertion (int location, tree condition, tree value)
15197 tree klass = GET_CPC ();
15199 if (! enable_assertions (klass))
15201 condition = build (TRUTH_ANDIF_EXPR, NULL_TREE,
15202 boolean_false_node, condition);
15203 if (value == NULL_TREE)
15204 value = build_java_empty_stmt ();
15205 return build_if_else_statement (location, condition,
15209 if (! CLASS_USES_ASSERTIONS (klass))
15211 tree field, classdollar, id, call;
15212 tree class_type = TREE_TYPE (klass);
15214 field = add_field (class_type,
15215 get_identifier ("$assertionsDisabled"),
15217 ACC_PRIVATE | ACC_STATIC | ACC_FINAL);
15218 MAYBE_CREATE_VAR_LANG_DECL_SPECIFIC (field);
15219 FIELD_SYNTHETIC (field) = 1;
15221 classdollar = build_incomplete_class_ref (location, class_type);
15223 /* Call CLASS.desiredAssertionStatus(). */
15224 id = build_wfl_node (get_identifier ("desiredAssertionStatus"));
15225 call = build (CALL_EXPR, NULL_TREE, id, NULL_TREE, NULL_TREE);
15226 call = make_qualified_primary (classdollar, call, location);
15227 TREE_SIDE_EFFECTS (call) = 1;
15229 /* Invert to obtain !CLASS.desiredAssertionStatus(). This may
15230 seem odd, but we do it to generate code identical to that of
15232 call = build1 (TRUTH_NOT_EXPR, NULL_TREE, call);
15233 TREE_SIDE_EFFECTS (call) = 1;
15234 DECL_INITIAL (field) = call;
15236 /* Record the initializer in the initializer statement list. */
15237 call = build (MODIFY_EXPR, NULL_TREE, field, call);
15238 TREE_CHAIN (call) = CPC_STATIC_INITIALIZER_STMT (ctxp);
15239 SET_CPC_STATIC_INITIALIZER_STMT (ctxp, call);
15240 MODIFY_EXPR_FROM_INITIALIZATION_P (call) = 1;
15242 CLASS_USES_ASSERTIONS (klass) = 1;
15245 if (value != NULL_TREE)
15246 value = tree_cons (NULL_TREE, value, NULL_TREE);
15248 node = build_wfl_node (get_identifier ("java"));
15249 node = make_qualified_name (node, build_wfl_node (get_identifier ("lang")),
15251 node = make_qualified_name (node, build_wfl_node (get_identifier ("AssertionError")),
15254 node = build (NEW_CLASS_EXPR, NULL_TREE, node, value, NULL_TREE);
15255 TREE_SIDE_EFFECTS (node) = 1;
15256 /* It is too early to use BUILD_THROW. */
15257 node = build1 (THROW_EXPR, NULL_TREE, node);
15258 TREE_SIDE_EFFECTS (node) = 1;
15260 /* We invert the condition; if we just put NODE as the `else' part
15261 then we generate weird-looking bytecode. */
15262 condition = build1 (TRUTH_NOT_EXPR, NULL_TREE, condition);
15263 /* Check $assertionsDisabled. */
15265 = build (TRUTH_ANDIF_EXPR, NULL_TREE,
15266 build1 (TRUTH_NOT_EXPR, NULL_TREE,
15267 build_wfl_node (get_identifier ("$assertionsDisabled"))),
15269 node = build_if_else_statement (location, condition, node, NULL_TREE);
15273 /* 14.18 The try/catch statements */
15275 /* Encapsulate TRY_STMTS' in a try catch sequence. The catch clause
15276 catches TYPE and executes CATCH_STMTS. */
15279 encapsulate_with_try_catch (int location, tree type_or_name, tree try_stmts,
15282 tree try_block, catch_clause_param, catch_block, catch;
15284 /* First build a try block */
15285 try_block = build_expr_block (try_stmts, NULL_TREE);
15287 /* Build a catch block: we need a catch clause parameter */
15288 if (TREE_CODE (type_or_name) == EXPR_WITH_FILE_LOCATION)
15290 tree catch_type = obtain_incomplete_type (type_or_name);
15292 catch_clause_param = build_decl (VAR_DECL, wpv_id, catch_type);
15293 register_incomplete_type (JDEP_VARIABLE, type_or_name,
15294 catch_clause_param, catch_type);
15295 dep = CLASSD_LAST (ctxp->classd_list);
15296 JDEP_GET_PATCH (dep) = &TREE_TYPE (catch_clause_param);
15299 catch_clause_param = build_decl (VAR_DECL, wpv_id,
15300 build_pointer_type (type_or_name));
15303 catch_block = build_expr_block (NULL_TREE, catch_clause_param);
15305 /* Initialize the variable and store in the block */
15306 catch = build (MODIFY_EXPR, NULL_TREE, catch_clause_param,
15307 build (JAVA_EXC_OBJ_EXPR, ptr_type_node));
15308 add_stmt_to_block (catch_block, NULL_TREE, catch);
15310 /* Add the catch statements */
15311 add_stmt_to_block (catch_block, NULL_TREE, catch_stmts);
15313 /* Now we can build a JAVA_CATCH_EXPR */
15314 catch_block = build1 (JAVA_CATCH_EXPR, NULL_TREE, catch_block);
15316 return build_try_statement (location, try_block, catch_block);
15320 build_try_statement (int location, tree try_block, tree catches)
15322 tree node = build (TRY_EXPR, NULL_TREE, try_block, catches);
15323 EXPR_WFL_LINECOL (node) = location;
15328 build_try_finally_statement (int location, tree try_block, tree finally)
15330 tree node = build (TRY_FINALLY_EXPR, NULL_TREE, try_block, finally);
15331 EXPR_WFL_LINECOL (node) = location;
15336 patch_try_statement (tree node)
15338 int error_found = 0;
15339 tree try = TREE_OPERAND (node, 0);
15340 /* Exception handlers are considered in left to right order */
15341 tree catch = nreverse (TREE_OPERAND (node, 1));
15342 tree current, caught_type_list = NULL_TREE;
15344 /* Check catch clauses, if any. Every time we find an error, we try
15345 to process the next catch clause. We process the catch clause before
15346 the try block so that when processing the try block we can check thrown
15347 exceptions againts the caught type list. */
15348 for (current = catch; current; current = TREE_CHAIN (current))
15350 tree carg_decl, carg_type;
15351 tree sub_current, catch_block, catch_clause;
15354 /* At this point, the structure of the catch clause is
15355 JAVA_CATCH_EXPR (catch node)
15356 BLOCK (with the decl of the parameter)
15358 MODIFY_EXPR (assignment of the catch parameter)
15359 BLOCK (catch clause block)
15361 catch_clause = TREE_OPERAND (current, 0);
15362 carg_decl = BLOCK_EXPR_DECLS (catch_clause);
15363 carg_type = TREE_TYPE (TREE_TYPE (carg_decl));
15365 /* Catch clauses can't have more than one parameter declared,
15366 but it's already enforced by the grammar. Make sure that the
15367 only parameter of the clause statement in of class Throwable
15368 or a subclass of Throwable, but that was done earlier. The
15369 catch clause parameter type has also been resolved. */
15371 /* Just make sure that the catch clause parameter type inherits
15372 from java.lang.Throwable */
15373 if (!inherits_from_p (carg_type, throwable_type_node))
15375 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (current);
15376 parse_error_context (wfl_operator,
15377 "Can't catch class `%s'. Catch clause parameter type must be a subclass of class `java.lang.Throwable'",
15378 lang_printable_name (carg_type, 0));
15383 /* Partial check for unreachable catch statement: The catch
15384 clause is reachable iff is no earlier catch block A in
15385 the try statement such that the type of the catch
15386 clause's parameter is the same as or a subclass of the
15387 type of A's parameter */
15389 for (sub_current = catch;
15390 sub_current != current; sub_current = TREE_CHAIN (sub_current))
15392 tree sub_catch_clause, decl;
15393 sub_catch_clause = TREE_OPERAND (sub_current, 0);
15394 decl = BLOCK_EXPR_DECLS (sub_catch_clause);
15396 if (inherits_from_p (carg_type, TREE_TYPE (TREE_TYPE (decl))))
15398 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (current);
15399 parse_error_context
15401 "`catch' not reached because of the catch clause at line %d",
15402 EXPR_WFL_LINENO (sub_current));
15403 unreachable = error_found = 1;
15407 /* Complete the catch clause block */
15408 catch_block = java_complete_tree (TREE_OPERAND (current, 0));
15409 if (catch_block == error_mark_node)
15414 if (CAN_COMPLETE_NORMALLY (catch_block))
15415 CAN_COMPLETE_NORMALLY (node) = 1;
15416 TREE_OPERAND (current, 0) = catch_block;
15421 /* Things to do here: the exception must be thrown */
15423 /* Link this type to the caught type list */
15424 caught_type_list = tree_cons (NULL_TREE, carg_type, caught_type_list);
15427 PUSH_EXCEPTIONS (caught_type_list);
15428 if ((try = java_complete_tree (try)) == error_mark_node)
15430 if (CAN_COMPLETE_NORMALLY (try))
15431 CAN_COMPLETE_NORMALLY (node) = 1;
15434 /* Verification ends here */
15436 return error_mark_node;
15438 TREE_OPERAND (node, 0) = try;
15439 TREE_OPERAND (node, 1) = catch;
15440 TREE_TYPE (node) = void_type_node;
15444 /* 14.17 The synchronized Statement */
15447 patch_synchronized_statement (tree node, tree wfl_op1)
15449 tree expr = java_complete_tree (TREE_OPERAND (node, 0));
15450 tree block = TREE_OPERAND (node, 1);
15452 tree tmp, enter, exit, expr_decl, assignment;
15454 if (expr == error_mark_node)
15456 block = java_complete_tree (block);
15460 /* We might be trying to synchronize on a STRING_CST */
15461 if ((tmp = patch_string (expr)))
15464 /* The TYPE of expr must be a reference type */
15465 if (!JREFERENCE_TYPE_P (TREE_TYPE (expr)))
15467 SET_WFL_OPERATOR (wfl_operator, node, wfl_op1);
15468 parse_error_context (wfl_operator, "Incompatible type for `synchronized'. Can't convert `%s' to `java.lang.Object'",
15469 lang_printable_name (TREE_TYPE (expr), 0));
15470 return error_mark_node;
15473 if (flag_emit_xref)
15475 TREE_OPERAND (node, 0) = expr;
15476 TREE_OPERAND (node, 1) = java_complete_tree (block);
15477 CAN_COMPLETE_NORMALLY (node) = 1;
15481 /* Generate a try-finally for the synchronized statement, except
15482 that the handler that catches all throw exception calls
15483 _Jv_MonitorExit and then rethrow the exception.
15484 The synchronized statement is then implemented as:
15487 _Jv_MonitorEnter (expression)
15489 _Jv_MonitorExit (expression)
15493 e = _Jv_exception_info ();
15494 _Jv_MonitorExit (expression)
15498 expr_decl = build_decl (VAR_DECL, generate_name (), TREE_TYPE (expr));
15499 BUILD_MONITOR_ENTER (enter, expr_decl);
15500 BUILD_MONITOR_EXIT (exit, expr_decl);
15501 CAN_COMPLETE_NORMALLY (enter) = 1;
15502 CAN_COMPLETE_NORMALLY (exit) = 1;
15503 assignment = build (MODIFY_EXPR, NULL_TREE, expr_decl, expr);
15504 TREE_SIDE_EFFECTS (assignment) = 1;
15505 node = build (COMPOUND_EXPR, NULL_TREE,
15506 build (COMPOUND_EXPR, NULL_TREE, assignment, enter),
15507 build (TRY_FINALLY_EXPR, NULL_TREE, block, exit));
15508 node = build_expr_block (node, expr_decl);
15510 return java_complete_tree (node);
15513 /* 14.16 The throw Statement */
15516 patch_throw_statement (tree node, tree wfl_op1)
15518 tree expr = TREE_OPERAND (node, 0);
15519 tree type = TREE_TYPE (expr);
15520 int unchecked_ok = 0, tryblock_throws_ok = 0;
15522 /* Thrown expression must be assignable to java.lang.Throwable */
15523 if (!try_reference_assignconv (throwable_type_node, expr))
15525 SET_WFL_OPERATOR (wfl_operator, node, wfl_op1);
15526 parse_error_context (wfl_operator,
15527 "Can't throw `%s'; it must be a subclass of class `java.lang.Throwable'",
15528 lang_printable_name (type, 0));
15529 /* If the thrown expression was a reference, we further the
15530 compile-time check. */
15531 if (!JREFERENCE_TYPE_P (type))
15532 return error_mark_node;
15535 /* At least one of the following must be true */
15537 /* The type of the throw expression is a not checked exception,
15538 i.e. is a unchecked expression. */
15539 unchecked_ok = IS_UNCHECKED_EXCEPTION_P (TREE_TYPE (type));
15541 SET_WFL_OPERATOR (wfl_operator, node, wfl_op1);
15542 /* An instance can't throw a checked exception unless that exception
15543 is explicitly declared in the `throws' clause of each
15544 constructor. This doesn't apply to anonymous classes, since they
15545 don't have declared constructors. */
15547 && DECL_INSTINIT_P (current_function_decl)
15548 && !ANONYMOUS_CLASS_P (current_class))
15551 for (current = TYPE_METHODS (current_class); current;
15552 current = TREE_CHAIN (current))
15553 if (DECL_CONSTRUCTOR_P (current)
15554 && !check_thrown_exceptions_do (TREE_TYPE (expr)))
15556 parse_error_context (wfl_operator, "Checked exception `%s' can't be thrown in instance initializer (not all declared constructor are declaring it in their `throws' clause)",
15557 lang_printable_name (TREE_TYPE (expr), 0));
15558 return error_mark_node;
15562 /* Throw is contained in a try statement and at least one catch
15563 clause can receive the thrown expression or the current method is
15564 declared to throw such an exception. Or, the throw statement is
15565 contained in a method or constructor declaration and the type of
15566 the Expression is assignable to at least one type listed in the
15567 throws clause the declaration. */
15569 tryblock_throws_ok = check_thrown_exceptions_do (TREE_TYPE (expr));
15570 if (!(unchecked_ok || tryblock_throws_ok))
15572 /* If there is a surrounding try block that has no matching
15573 clatch clause, report it first. A surrounding try block exits
15574 only if there is something after the list of checked
15575 exception thrown by the current function (if any). */
15576 if (IN_TRY_BLOCK_P ())
15577 parse_error_context (wfl_operator, "Checked exception `%s' can't be caught by any of the catch clause(s) of the surrounding `try' block",
15578 lang_printable_name (type, 0));
15579 /* If we have no surrounding try statement and the method doesn't have
15580 any throws, report it now. FIXME */
15582 /* We report that the exception can't be throw from a try block
15583 in all circumstances but when the `throw' is inside a static
15585 else if (!EXCEPTIONS_P (currently_caught_type_list)
15586 && !tryblock_throws_ok)
15588 if (DECL_CLINIT_P (current_function_decl))
15589 parse_error_context (wfl_operator,
15590 "Checked exception `%s' can't be thrown in initializer",
15591 lang_printable_name (type, 0));
15593 parse_error_context (wfl_operator,
15594 "Checked exception `%s' isn't thrown from a `try' block",
15595 lang_printable_name (type, 0));
15597 /* Otherwise, the current method doesn't have the appropriate
15598 throws declaration */
15600 parse_error_context (wfl_operator, "Checked exception `%s' doesn't match any of current method's `throws' declaration(s)",
15601 lang_printable_name (type, 0));
15602 return error_mark_node;
15605 if (! flag_emit_class_files && ! flag_emit_xref)
15606 BUILD_THROW (node, expr);
15608 /* If doing xrefs, keep the location where the `throw' was seen. */
15609 if (flag_emit_xref)
15610 EXPR_WFL_LINECOL (node) = EXPR_WFL_LINECOL (wfl_op1);
15614 /* Check that exception said to be thrown by method DECL can be
15615 effectively caught from where DECL is invoked. THIS_EXPR is the
15616 expression that computes `this' for the method call. */
15618 check_thrown_exceptions (int location, tree decl, tree this_expr)
15621 int is_array_call = 0;
15623 /* Skip check within generated methods, such as access$<n>. */
15624 if (OUTER_FIELD_ACCESS_IDENTIFIER_P (DECL_NAME (current_function_decl)))
15627 if (this_expr != NULL_TREE
15628 && TREE_CODE (TREE_TYPE (this_expr)) == POINTER_TYPE
15629 && TYPE_ARRAY_P (TREE_TYPE (TREE_TYPE (this_expr))))
15632 /* For all the unchecked exceptions thrown by DECL. */
15633 for (throws = DECL_FUNCTION_THROWS (decl); throws;
15634 throws = TREE_CHAIN (throws))
15635 if (!check_thrown_exceptions_do (TREE_VALUE (throws)))
15637 /* Suppress errors about cloning arrays. */
15638 if (is_array_call && DECL_NAME (decl) == get_identifier ("clone"))
15641 EXPR_WFL_LINECOL (wfl_operator) = location;
15642 if (DECL_FINIT_P (current_function_decl))
15643 parse_error_context
15644 (wfl_operator, "Exception `%s' can't be thrown in initializer",
15645 lang_printable_name (TREE_VALUE (throws), 0));
15648 parse_error_context
15649 (wfl_operator, "Exception `%s' must be caught, or it must be declared in the `throws' clause of `%s'",
15650 lang_printable_name (TREE_VALUE (throws), 0),
15651 (DECL_INIT_P (current_function_decl) ?
15652 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (current_class))) :
15653 IDENTIFIER_POINTER (DECL_NAME (current_function_decl))));
15658 /* Return 1 if checked EXCEPTION is caught at the current nesting level of
15659 try-catch blocks, OR is listed in the `throws' clause of the
15663 check_thrown_exceptions_do (tree exception)
15665 tree list = currently_caught_type_list;
15666 resolve_and_layout (exception, NULL_TREE);
15667 /* First, all the nested try-catch-finally at that stage. The
15668 last element contains `throws' clause exceptions, if any. */
15669 if (IS_UNCHECKED_EXCEPTION_P (exception))
15674 for (caught = TREE_VALUE (list); caught; caught = TREE_CHAIN (caught))
15675 if (valid_ref_assignconv_cast_p (exception, TREE_VALUE (caught), 0))
15677 list = TREE_CHAIN (list);
15683 purge_unchecked_exceptions (tree mdecl)
15685 tree throws = DECL_FUNCTION_THROWS (mdecl);
15686 tree new = NULL_TREE;
15690 tree next = TREE_CHAIN (throws);
15691 if (!IS_UNCHECKED_EXCEPTION_P (TREE_VALUE (throws)))
15693 TREE_CHAIN (throws) = new;
15698 /* List is inverted here, but it doesn't matter */
15699 DECL_FUNCTION_THROWS (mdecl) = new;
15702 /* This function goes over all of CLASS_TYPE ctors and checks whether
15703 each of them features at least one unchecked exception in its
15704 `throws' clause. If it's the case, it returns `true', `false'
15708 ctors_unchecked_throws_clause_p (tree class_type)
15712 for (current = TYPE_METHODS (class_type); current;
15713 current = TREE_CHAIN (current))
15715 bool ctu = false; /* Ctor Throws Unchecked */
15716 if (DECL_CONSTRUCTOR_P (current))
15719 for (throws = DECL_FUNCTION_THROWS (current); throws && !ctu;
15720 throws = TREE_CHAIN (throws))
15721 if (inherits_from_p (TREE_VALUE (throws), exception_type_node))
15724 /* We return false as we found one ctor that is unfit. */
15725 if (!ctu && DECL_CONSTRUCTOR_P (current))
15728 /* All ctors feature at least one unchecked exception in their
15729 `throws' clause. */
15733 /* 15.24 Conditional Operator ?: */
15736 patch_conditional_expr (tree node, tree wfl_cond, tree wfl_op1)
15738 tree cond = TREE_OPERAND (node, 0);
15739 tree op1 = TREE_OPERAND (node, 1);
15740 tree op2 = TREE_OPERAND (node, 2);
15741 tree resulting_type = NULL_TREE;
15742 tree t1, t2, patched;
15743 int error_found = 0;
15745 /* Operands of ?: might be StringBuffers crafted as a result of a
15746 string concatenation. Obtain a descent operand here. */
15747 if ((patched = patch_string (op1)))
15748 TREE_OPERAND (node, 1) = op1 = patched;
15749 if ((patched = patch_string (op2)))
15750 TREE_OPERAND (node, 2) = op2 = patched;
15752 t1 = TREE_TYPE (op1);
15753 t2 = TREE_TYPE (op2);
15755 /* The first expression must be a boolean */
15756 if (TREE_TYPE (cond) != boolean_type_node)
15758 SET_WFL_OPERATOR (wfl_operator, node, wfl_cond);
15759 parse_error_context (wfl_operator,
15760 "Incompatible type for `?:'. Can't convert `%s' to `boolean'",
15761 lang_printable_name (TREE_TYPE (cond), 0));
15765 /* Second and third can be numeric, boolean (i.e. primitive),
15766 references or null. Anything else results in an error */
15767 if (!((JNUMERIC_TYPE_P (t1) && JNUMERIC_TYPE_P (t2))
15768 || ((JREFERENCE_TYPE_P (t1) || op1 == null_pointer_node)
15769 && (JREFERENCE_TYPE_P (t2) || op2 == null_pointer_node))
15770 || (t1 == boolean_type_node && t2 == boolean_type_node)))
15773 /* Determine the type of the conditional expression. Same types are
15774 easy to deal with */
15776 resulting_type = t1;
15778 /* There are different rules for numeric types */
15779 else if (JNUMERIC_TYPE_P (t1))
15781 /* if byte/short found, the resulting type is short */
15782 if ((t1 == byte_type_node && t2 == short_type_node)
15783 || (t1 == short_type_node && t2 == byte_type_node))
15784 resulting_type = short_type_node;
15786 /* If t1 is a constant int and t2 is of type byte, short or char
15787 and t1's value fits in t2, then the resulting type is t2 */
15788 else if ((t1 == int_type_node && TREE_CONSTANT (TREE_OPERAND (node, 1)))
15789 && JBSC_TYPE_P (t2) && int_fits_type_p (TREE_OPERAND (node, 1), t2))
15790 resulting_type = t2;
15792 /* If t2 is a constant int and t1 is of type byte, short or char
15793 and t2's value fits in t1, then the resulting type is t1 */
15794 else if ((t2 == int_type_node && TREE_CONSTANT (TREE_OPERAND (node, 2)))
15795 && JBSC_TYPE_P (t1) && int_fits_type_p (TREE_OPERAND (node, 2), t1))
15796 resulting_type = t1;
15798 /* Otherwise, binary numeric promotion is applied and the
15799 resulting type is the promoted type of operand 1 and 2 */
15801 resulting_type = binary_numeric_promotion (t1, t2,
15802 &TREE_OPERAND (node, 1),
15803 &TREE_OPERAND (node, 2));
15806 /* Cases of a reference and a null type */
15807 else if (JREFERENCE_TYPE_P (t1) && op2 == null_pointer_node)
15808 resulting_type = t1;
15810 else if (JREFERENCE_TYPE_P (t2) && op1 == null_pointer_node)
15811 resulting_type = t2;
15813 /* Last case: different reference types. If a type can be converted
15814 into the other one by assignment conversion, the latter
15815 determines the type of the expression */
15816 else if ((resulting_type = try_reference_assignconv (t1, op2)))
15817 resulting_type = promote_type (t1);
15819 else if ((resulting_type = try_reference_assignconv (t2, op1)))
15820 resulting_type = promote_type (t2);
15822 /* If we don't have any resulting type, we're in trouble */
15823 if (!resulting_type)
15825 char *t = xstrdup (lang_printable_name (t1, 0));
15826 SET_WFL_OPERATOR (wfl_operator, node, wfl_op1);
15827 parse_error_context (wfl_operator,
15828 "Incompatible type for `?:'. Can't convert `%s' to `%s'",
15829 t, lang_printable_name (t2, 0));
15836 TREE_TYPE (node) = error_mark_node;
15837 return error_mark_node;
15840 TREE_TYPE (node) = resulting_type;
15841 TREE_SET_CODE (node, COND_EXPR);
15842 CAN_COMPLETE_NORMALLY (node) = 1;
15846 /* Wrap EXPR with code to initialize DECL's class, if appropriate. */
15849 maybe_build_class_init_for_field (tree decl, tree expr)
15851 tree clas = DECL_CONTEXT (decl);
15852 if (flag_emit_class_files || flag_emit_xref)
15855 if (TREE_CODE (decl) == VAR_DECL && FIELD_STATIC (decl)
15856 && FIELD_FINAL (decl))
15858 tree init = DECL_INITIAL (decl);
15859 if (init != NULL_TREE)
15860 init = fold_constant_for_init (init, decl);
15861 if (init != NULL_TREE && CONSTANT_VALUE_P (init))
15865 return build_class_init (clas, expr);
15868 /* Try to constant fold NODE.
15869 If NODE is not a constant expression, return NULL_EXPR.
15870 CONTEXT is a static final VAR_DECL whose initializer we are folding. */
15873 fold_constant_for_init (tree node, tree context)
15875 tree op0, op1, val;
15876 enum tree_code code = TREE_CODE (node);
15881 if (node == null_pointer_node)
15890 case TRUNC_MOD_EXPR:
15898 case TRUTH_ANDIF_EXPR:
15899 case TRUTH_ORIF_EXPR:
15906 op0 = TREE_OPERAND (node, 0);
15907 op1 = TREE_OPERAND (node, 1);
15908 val = fold_constant_for_init (op0, context);
15909 if (val == NULL_TREE || ! TREE_CONSTANT (val))
15911 TREE_OPERAND (node, 0) = val;
15912 val = fold_constant_for_init (op1, context);
15913 if (val == NULL_TREE || ! TREE_CONSTANT (val))
15915 TREE_OPERAND (node, 1) = val;
15916 return patch_binop (node, op0, op1);
15918 case UNARY_PLUS_EXPR:
15920 case TRUTH_NOT_EXPR:
15923 op0 = TREE_OPERAND (node, 0);
15924 val = fold_constant_for_init (op0, context);
15925 if (val == NULL_TREE || ! TREE_CONSTANT (val))
15927 TREE_OPERAND (node, 0) = val;
15928 val = patch_unaryop (node, op0);
15929 if (! TREE_CONSTANT (val))
15936 val = fold_constant_for_init (TREE_OPERAND (node, 0), context);
15937 if (val == NULL_TREE || ! TREE_CONSTANT (val))
15939 TREE_OPERAND (node, 0) = val;
15940 val = fold_constant_for_init (TREE_OPERAND (node, 1), context);
15941 if (val == NULL_TREE || ! TREE_CONSTANT (val))
15943 TREE_OPERAND (node, 1) = val;
15944 val = fold_constant_for_init (TREE_OPERAND (node, 2), context);
15945 if (val == NULL_TREE || ! TREE_CONSTANT (val))
15947 TREE_OPERAND (node, 2) = val;
15948 return integer_zerop (TREE_OPERAND (node, 0)) ? TREE_OPERAND (node, 1)
15949 : TREE_OPERAND (node, 2);
15953 if (! FIELD_FINAL (node)
15954 || DECL_INITIAL (node) == NULL_TREE)
15956 val = DECL_INITIAL (node);
15957 /* Guard against infinite recursion. */
15958 DECL_INITIAL (node) = NULL_TREE;
15959 val = fold_constant_for_init (val, node);
15960 if (val != NULL_TREE && TREE_CODE (val) != STRING_CST)
15961 val = try_builtin_assignconv (NULL_TREE, TREE_TYPE (node), val);
15962 DECL_INITIAL (node) = val;
15965 case EXPR_WITH_FILE_LOCATION:
15966 /* Compare java_complete_tree and resolve_expression_name. */
15967 if (!EXPR_WFL_NODE (node) /* Or a PRIMARY flag ? */
15968 || TREE_CODE (EXPR_WFL_NODE (node)) == IDENTIFIER_NODE)
15970 tree name = EXPR_WFL_NODE (node);
15972 if (PRIMARY_P (node))
15974 else if (! QUALIFIED_P (name))
15976 decl = lookup_field_wrapper (DECL_CONTEXT (context), name);
15977 if (decl == NULL_TREE
15978 || (! FIELD_STATIC (decl) && ! FIELD_FINAL (decl)))
15980 return fold_constant_for_init (decl, decl);
15984 /* Install the proper context for the field resolution.
15985 The prior context is restored once the name is
15986 properly qualified. */
15987 tree saved_current_class = current_class;
15988 /* Wait until the USE_COMPONENT_REF re-write. FIXME. */
15989 current_class = DECL_CONTEXT (context);
15990 qualify_ambiguous_name (node);
15991 current_class = saved_current_class;
15992 if (resolve_field_access (node, &decl, NULL)
15993 && decl != NULL_TREE)
15994 return fold_constant_for_init (decl, decl);
16000 op0 = TREE_OPERAND (node, 0);
16001 val = fold_constant_for_init (op0, context);
16002 if (val == NULL_TREE || ! TREE_CONSTANT (val))
16004 TREE_OPERAND (node, 0) = val;
16008 #ifdef USE_COMPONENT_REF
16010 case COMPONENT_REF:
16019 #ifdef USE_COMPONENT_REF
16020 /* Context is 'T' for TypeName, 'P' for PackageName,
16021 'M' for MethodName, 'E' for ExpressionName, and 'A' for AmbiguousName. */
16024 resolve_simple_name (tree name, int context)
16029 resolve_qualified_name (tree name, int context)
16035 init_src_parse (void)
16037 /* Sanity check; we've been bit by this before. */
16038 if (ARRAY_SIZE (ctxp->modifier_ctx) != MODIFIER_TK - PUBLIC_TK)
16044 /* This section deals with the functions that are called when tables
16045 recording class initialization information are traversed. */
16047 /* Attach to PTR (a block) the declaration found in ENTRY. */
16050 attach_init_test_initialization_flags (void **entry, void *ptr)
16052 tree block = (tree)ptr;
16053 struct treetreehash_entry *ite = (struct treetreehash_entry *) *entry;
16055 if (block != error_mark_node)
16057 TREE_CHAIN (ite->value) = BLOCK_EXPR_DECLS (block);
16058 BLOCK_EXPR_DECLS (block) = ite->value;
16063 /* This function is called for each class that is known definitely
16064 initialized when a given static method was called. This function
16065 augments a compound expression (INFO) storing all assignment to
16066 initialized static class flags if a flag already existed, otherwise
16067 a new one is created. */
16070 emit_test_initialization (void **entry_p, void *info)
16072 tree l = (tree) info;
16074 tree key = (tree) *entry_p;
16076 htab_t cf_ht = DECL_FUNCTION_INIT_TEST_TABLE (current_function_decl);
16078 /* If we haven't found a flag and we're dealing with self registered
16079 with current_function_decl, then don't do anything. Self is
16080 always added as definitely initialized but this information is
16081 valid only if used outside the current function. */
16082 if (current_function_decl == TREE_PURPOSE (l)
16083 && java_treetreehash_find (cf_ht, key) == NULL)
16086 ite = java_treetreehash_new (cf_ht, key);
16088 /* If we don't have a variable, create one and install it. */
16093 decl = build_decl (VAR_DECL, NULL_TREE, boolean_type_node);
16094 MAYBE_CREATE_VAR_LANG_DECL_SPECIFIC (decl);
16095 LOCAL_CLASS_INITIALIZATION_FLAG (decl) = 1;
16096 DECL_CONTEXT (decl) = current_function_decl;
16097 DECL_INITIAL (decl) = boolean_true_node;
16098 /* Don't emit any symbolic debugging info for this decl. */
16099 DECL_IGNORED_P (decl) = 1;
16101 /* The trick is to find the right context for it. */
16102 block = BLOCK_SUBBLOCKS (GET_CURRENT_BLOCK (current_function_decl));
16103 TREE_CHAIN (decl) = BLOCK_EXPR_DECLS (block);
16104 BLOCK_EXPR_DECLS (block) = decl;
16110 /* Now simply augment the compound that holds all the assignments
16111 pertaining to this method invocation. */
16112 init = build (MODIFY_EXPR, boolean_type_node, decl, boolean_true_node);
16113 TREE_SIDE_EFFECTS (init) = 1;
16114 TREE_VALUE (l) = add_stmt_to_compound (TREE_VALUE (l), void_type_node, init);
16115 TREE_SIDE_EFFECTS (TREE_VALUE (l)) = 1;
16120 #include "gt-java-parse.h"
16121 #include "gtype-java.h"