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 array_type
547 array_creation_initialized array_creation_uninitialized
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 $$ = build3 (SWITCH_EXPR, NULL_TREE, $3,
1589 NULL_TREE, NULL_TREE);
1590 EXPR_WFL_LINECOL ($$) = $2.location;
1593 {yyerror ("'(' expected"); RECOVER;}
1594 | SWITCH_TK OP_TK error
1595 {yyerror ("Missing term or ')'"); DRECOVER(switch_statement);}
1596 | SWITCH_TK OP_TK expression CP_TK error
1597 {yyerror ("'{' expected"); RECOVER;}
1600 /* Default assignment is there to avoid type node on switch_block
1606 | OCB_TK switch_labels CCB_TK
1608 | OCB_TK switch_block_statement_groups CCB_TK
1610 | OCB_TK switch_block_statement_groups switch_labels CCB_TK
1614 switch_block_statement_groups:
1615 switch_block_statement_group
1616 | switch_block_statement_groups switch_block_statement_group
1619 switch_block_statement_group:
1620 switch_labels block_statements
1625 | switch_labels switch_label
1629 CASE_TK constant_expression REL_CL_TK
1631 tree lab = build1 (CASE_EXPR, NULL_TREE, $2);
1632 EXPR_WFL_LINECOL (lab) = $1.location;
1633 java_method_add_stmt (current_function_decl, lab);
1635 | DEFAULT_TK REL_CL_TK
1637 tree lab = make_node (DEFAULT_EXPR);
1638 EXPR_WFL_LINECOL (lab) = $1.location;
1639 java_method_add_stmt (current_function_decl, lab);
1642 {yyerror ("Missing or invalid constant expression"); RECOVER;}
1643 | CASE_TK constant_expression error
1644 {yyerror ("':' expected"); RECOVER;}
1646 {yyerror ("':' expected"); RECOVER;}
1650 WHILE_TK OP_TK expression CP_TK
1652 tree body = build_loop_body ($2.location, $3, 0);
1653 $$ = build_new_loop (body);
1658 while_expression statement
1659 { $$ = finish_loop_body (0, NULL_TREE, $2, 0); }
1661 {YYERROR_NOW; yyerror ("'(' expected"); RECOVER;}
1662 | WHILE_TK OP_TK error
1663 {yyerror ("Missing term and ')' expected"); RECOVER;}
1664 | WHILE_TK OP_TK expression error
1665 {yyerror ("')' expected"); RECOVER;}
1668 while_statement_nsi:
1669 while_expression statement_nsi
1670 { $$ = finish_loop_body (0, NULL_TREE, $2, 0); }
1676 tree body = build_loop_body (0, NULL_TREE, 1);
1677 $$ = build_new_loop (body);
1679 /* Need error handing here. FIXME */
1683 do_statement_begin statement WHILE_TK OP_TK expression CP_TK SC_TK
1684 { $$ = finish_loop_body ($4.location, $5, $2, 1); }
1688 for_begin SC_TK expression SC_TK for_update CP_TK statement
1690 if (TREE_CODE_CLASS (TREE_CODE ($3)) == 'c')
1691 $3 = build_wfl_node ($3);
1692 $$ = finish_for_loop (EXPR_WFL_LINECOL ($3), $3, $5, $7);
1694 | for_begin SC_TK SC_TK for_update CP_TK statement
1696 $$ = finish_for_loop (0, NULL_TREE, $4, $6);
1697 /* We have not condition, so we get rid of the EXIT_EXPR */
1698 LOOP_EXPR_BODY_CONDITION_EXPR (LOOP_EXPR_BODY ($$), 0) =
1699 build_java_empty_stmt ();
1701 | for_begin SC_TK error
1702 {yyerror ("Invalid control expression"); RECOVER;}
1703 | for_begin SC_TK expression SC_TK error
1704 {yyerror ("Invalid update expression"); RECOVER;}
1705 | for_begin SC_TK SC_TK error
1706 {yyerror ("Invalid update expression"); RECOVER;}
1710 for_begin SC_TK expression SC_TK for_update CP_TK statement_nsi
1711 { $$ = finish_for_loop (EXPR_WFL_LINECOL ($3), $3, $5, $7);}
1712 | for_begin SC_TK SC_TK for_update CP_TK statement_nsi
1714 $$ = finish_for_loop (0, NULL_TREE, $4, $6);
1715 /* We have not condition, so we get rid of the EXIT_EXPR */
1716 LOOP_EXPR_BODY_CONDITION_EXPR (LOOP_EXPR_BODY ($$), 0) =
1717 build_java_empty_stmt ();
1724 /* This scope defined for local variable that may be
1725 defined within the scope of the for loop */
1729 {yyerror ("'(' expected"); DRECOVER(for_1);}
1730 | FOR_TK OP_TK error
1731 {yyerror ("Invalid init statement"); RECOVER;}
1737 /* We now declare the loop body. The loop is
1738 declared as a for loop. */
1739 tree body = build_loop_body (0, NULL_TREE, 0);
1740 $$ = build_new_loop (body);
1741 FOR_LOOP_P ($$) = 1;
1742 /* The loop is added to the current block the for
1743 statement is defined within */
1744 java_method_add_stmt (current_function_decl, $$);
1747 for_init: /* Can be empty */
1748 { $$ = build_java_empty_stmt (); }
1749 | statement_expression_list
1751 /* Init statement recorded within the previously
1752 defined block scope */
1753 $$ = java_method_add_stmt (current_function_decl, $1);
1755 | local_variable_declaration
1757 /* Local variable are recorded within the previously
1758 defined block scope */
1761 | statement_expression_list error
1762 {yyerror ("';' expected"); DRECOVER(for_init_1);}
1765 for_update: /* Can be empty */
1766 {$$ = build_java_empty_stmt ();}
1767 | statement_expression_list
1768 { $$ = build_debugable_stmt (BUILD_LOCATION (), $1); }
1771 statement_expression_list:
1772 statement_expression
1773 { $$ = add_stmt_to_compound (NULL_TREE, NULL_TREE, $1); }
1774 | statement_expression_list C_TK statement_expression
1775 { $$ = add_stmt_to_compound ($1, NULL_TREE, $3); }
1776 | statement_expression_list C_TK error
1777 {yyerror ("Missing term"); RECOVER;}
1782 { $$ = build_bc_statement ($1.location, 1, NULL_TREE); }
1783 | BREAK_TK identifier SC_TK
1784 { $$ = build_bc_statement ($1.location, 1, $2); }
1786 {yyerror ("Missing term"); RECOVER;}
1787 | BREAK_TK identifier error
1788 {yyerror ("';' expected"); RECOVER;}
1793 { $$ = build_bc_statement ($1.location, 0, NULL_TREE); }
1794 | CONTINUE_TK identifier SC_TK
1795 { $$ = build_bc_statement ($1.location, 0, $2); }
1797 {yyerror ("Missing term"); RECOVER;}
1798 | CONTINUE_TK identifier error
1799 {yyerror ("';' expected"); RECOVER;}
1804 { $$ = build_return ($1.location, NULL_TREE); }
1805 | RETURN_TK expression SC_TK
1806 { $$ = build_return ($1.location, $2); }
1808 {yyerror ("Missing term"); RECOVER;}
1809 | RETURN_TK expression error
1810 {yyerror ("';' expected"); RECOVER;}
1814 THROW_TK expression SC_TK
1816 $$ = build1 (THROW_EXPR, NULL_TREE, $2);
1817 EXPR_WFL_LINECOL ($$) = $1.location;
1820 {yyerror ("Missing term"); RECOVER;}
1821 | THROW_TK expression error
1822 {yyerror ("';' expected"); RECOVER;}
1826 ASSERT_TK expression REL_CL_TK expression SC_TK
1828 $$ = build_assertion ($1.location, $2, $4);
1830 | ASSERT_TK expression SC_TK
1832 $$ = build_assertion ($1.location, $2, NULL_TREE);
1835 {yyerror ("Missing term"); RECOVER;}
1836 | ASSERT_TK expression error
1837 {yyerror ("';' expected"); RECOVER;}
1840 synchronized_statement:
1841 synchronized OP_TK expression CP_TK block
1843 $$ = build2 (SYNCHRONIZED_EXPR, NULL_TREE, $3, $5);
1844 EXPR_WFL_LINECOL ($$) =
1845 EXPR_WFL_LINECOL (MODIFIER_WFL (SYNCHRONIZED_TK));
1847 | synchronized OP_TK expression CP_TK error
1848 {yyerror ("'{' expected"); RECOVER;}
1849 | synchronized error
1850 {yyerror ("'(' expected"); RECOVER;}
1851 | synchronized OP_TK error CP_TK
1852 {yyerror ("Missing term"); RECOVER;}
1853 | synchronized OP_TK error
1854 {yyerror ("Missing term"); RECOVER;}
1861 "Illegal modifier `%s'. Only `synchronized' was expected here",
1862 $1, ACC_SYNCHRONIZED);
1863 if ($1 != ACC_SYNCHRONIZED)
1864 MODIFIER_WFL (SYNCHRONIZED_TK) =
1865 build_wfl_node (NULL_TREE);
1870 TRY_TK block catches
1871 { $$ = build_try_statement ($1.location, $2, $3); }
1872 | TRY_TK block finally
1873 { $$ = build_try_finally_statement ($1.location, $2, $3); }
1874 | TRY_TK block catches finally
1875 { $$ = build_try_finally_statement
1876 ($1.location, build_try_statement ($1.location,
1880 {yyerror ("'{' expected"); DRECOVER (try_statement);}
1885 | catches catch_clause
1887 TREE_CHAIN ($2) = $1;
1893 catch_clause_parameter block
1895 java_method_add_stmt (current_function_decl, $2);
1901 catch_clause_parameter:
1902 CATCH_TK OP_TK formal_parameter CP_TK
1904 /* We add a block to define a scope for
1905 formal_parameter (CCBP). The formal parameter is
1906 declared initialized by the appropriate function
1912 ccpb = enter_block ();
1913 init = build_assignment
1914 (ASSIGN_TK, $2.location, TREE_PURPOSE ($3),
1915 build0 (JAVA_EXC_OBJ_EXPR, ptr_type_node));
1916 declare_local_variables (0, TREE_VALUE ($3),
1918 (TREE_PURPOSE ($3), init));
1919 $$ = build1 (JAVA_CATCH_EXPR, NULL_TREE, ccpb);
1920 EXPR_WFL_LINECOL ($$) = $1.location;
1924 $$ = error_mark_node;
1928 {yyerror ("'(' expected"); RECOVER; $$ = NULL_TREE;}
1929 | CATCH_TK OP_TK error
1931 yyerror ("Missing term or ')' expected");
1932 RECOVER; $$ = NULL_TREE;
1934 | CATCH_TK OP_TK error CP_TK /* That's for () */
1935 {yyerror ("Missing term"); RECOVER; $$ = NULL_TREE;}
1942 {yyerror ("'{' expected"); RECOVER; }
1945 /* 19.12 Production from 15: Expressions */
1947 primary_no_new_array
1948 | array_creation_uninitialized
1949 | array_creation_initialized
1952 primary_no_new_array:
1955 { $$ = build_this ($1.location); }
1956 | OP_TK expression CP_TK
1958 | class_instance_creation_expression
1963 /* Added, JDK1.1 inner classes. Documentation is wrong
1964 refering to a 'ClassName' (class_name) rule that doesn't
1965 exist. Used name: instead. */
1966 | name DOT_TK THIS_TK
1968 tree wfl = build_wfl_node (this_identifier_node);
1969 $$ = make_qualified_primary ($1, wfl, EXPR_WFL_LINECOL ($1));
1971 | OP_TK expression error
1972 {yyerror ("')' expected"); RECOVER;}
1974 {yyerror ("'class' or 'this' expected" ); RECOVER;}
1975 | primitive_type DOT_TK error
1976 {yyerror ("'class' expected" ); RECOVER;}
1977 | VOID_TK DOT_TK error
1978 {yyerror ("'class' expected" ); RECOVER;}
1982 name DOT_TK CLASS_TK
1983 { $$ = build_incomplete_class_ref ($2.location, $1); }
1984 | array_type DOT_TK CLASS_TK
1985 { $$ = build_incomplete_class_ref ($2.location, $1); }
1986 | primitive_type DOT_TK CLASS_TK
1987 { $$ = build_incomplete_class_ref ($2.location, $1); }
1988 | VOID_TK DOT_TK CLASS_TK
1990 $$ = build_incomplete_class_ref ($2.location,
1995 class_instance_creation_expression:
1996 NEW_TK class_type OP_TK argument_list CP_TK
1997 { $$ = build_new_invocation ($2, $4); }
1998 | NEW_TK class_type OP_TK CP_TK
1999 { $$ = build_new_invocation ($2, NULL_TREE); }
2000 | anonymous_class_creation
2001 /* Added, JDK1.1 inner classes, modified to use name or
2002 primary instead of primary solely which couldn't work in
2004 | something_dot_new identifier OP_TK CP_TK
2006 tree ctor = build_new_invocation ($2, NULL_TREE);
2007 $$ = make_qualified_primary ($1, ctor,
2008 EXPR_WFL_LINECOL ($1));
2010 | something_dot_new identifier OP_TK CP_TK class_body
2011 | something_dot_new identifier OP_TK argument_list CP_TK
2013 tree ctor = build_new_invocation ($2, $4);
2014 $$ = make_qualified_primary ($1, ctor,
2015 EXPR_WFL_LINECOL ($1));
2017 | something_dot_new identifier OP_TK argument_list CP_TK class_body
2018 | NEW_TK error SC_TK
2019 {yyerror ("'(' expected"); DRECOVER(new_1);}
2020 | NEW_TK class_type error
2021 {yyerror ("'(' expected"); RECOVER;}
2022 | NEW_TK class_type OP_TK error
2023 {yyerror ("')' or term expected"); RECOVER;}
2024 | NEW_TK class_type OP_TK argument_list error
2025 {yyerror ("')' expected"); RECOVER;}
2026 | something_dot_new error
2027 {YYERROR_NOW; yyerror ("Identifier expected"); RECOVER;}
2028 | something_dot_new identifier error
2029 {yyerror ("'(' expected"); RECOVER;}
2032 /* Created after JDK1.1 rules originally added to
2033 class_instance_creation_expression, but modified to use
2034 'class_type' instead of 'TypeName' (type_name) which is mentioned
2035 in the documentation but doesn't exist. */
2037 anonymous_class_creation:
2038 NEW_TK class_type OP_TK argument_list CP_TK
2039 { create_anonymous_class ($2); }
2042 tree id = build_wfl_node (DECL_NAME (GET_CPC ()));
2043 EXPR_WFL_LINECOL (id) = EXPR_WFL_LINECOL ($2);
2045 end_class_declaration (1);
2047 /* Now we can craft the new expression */
2048 $$ = build_new_invocation (id, $4);
2050 /* Note that we can't possibly be here if
2051 `class_type' is an interface (in which case the
2052 anonymous class extends Object and implements
2053 `class_type', hence its constructor can't have
2056 /* Otherwise, the innerclass must feature a
2057 constructor matching `argument_list'. Anonymous
2058 classes are a bit special: it's impossible to
2059 define constructor for them, hence constructors
2060 must be generated following the hints provided by
2061 the `new' expression. Whether a super constructor
2062 of that nature exists or not is to be verified
2063 later on in verify_constructor_super.
2065 It's during the expansion of a `new' statement
2066 refering to an anonymous class that a ctor will
2067 be generated for the anonymous class, with the
2071 | NEW_TK class_type OP_TK CP_TK
2072 { create_anonymous_class ($2); }
2075 tree id = build_wfl_node (DECL_NAME (GET_CPC ()));
2076 EXPR_WFL_LINECOL (id) = EXPR_WFL_LINECOL ($2);
2078 end_class_declaration (1);
2080 /* Now we can craft the new expression. The
2081 statement doesn't need to be remember so that a
2082 constructor can be generated, since its signature
2083 is already known. */
2084 $$ = build_new_invocation (id, NULL_TREE);
2088 something_dot_new: /* Added, not part of the specs. */
2091 | primary DOT_TK NEW_TK
2098 $$ = tree_cons (NULL_TREE, $1, NULL_TREE);
2099 ctxp->formal_parameter_number = 1;
2101 | argument_list C_TK expression
2103 ctxp->formal_parameter_number += 1;
2104 $$ = tree_cons (NULL_TREE, $3, $1);
2106 | argument_list C_TK error
2107 {yyerror ("Missing term"); RECOVER;}
2110 array_creation_uninitialized:
2111 NEW_TK primitive_type dim_exprs
2112 { $$ = build_newarray_node ($2, $3, 0); }
2113 | NEW_TK class_or_interface_type dim_exprs
2114 { $$ = build_newarray_node ($2, $3, 0); }
2115 | NEW_TK primitive_type dim_exprs dims
2116 { $$ = build_newarray_node ($2, $3, pop_current_osb (ctxp));}
2117 | NEW_TK class_or_interface_type dim_exprs dims
2118 { $$ = build_newarray_node ($2, $3, pop_current_osb (ctxp));}
2119 | NEW_TK error CSB_TK
2120 {yyerror ("'[' expected"); DRECOVER ("]");}
2121 | NEW_TK error OSB_TK
2122 {yyerror ("']' expected"); RECOVER;}
2125 array_creation_initialized:
2126 /* Added, JDK1.1 anonymous array. Initial documentation rule
2128 NEW_TK class_or_interface_type dims array_initializer
2131 int osb = pop_current_osb (ctxp);
2133 obstack_grow (&temporary_obstack, "[]", 2);
2134 obstack_1grow (&temporary_obstack, '\0');
2135 sig = obstack_finish (&temporary_obstack);
2136 $$ = build3 (NEW_ANONYMOUS_ARRAY_EXPR, NULL_TREE,
2137 $2, get_identifier (sig), $4);
2139 | NEW_TK primitive_type dims array_initializer
2141 int osb = pop_current_osb (ctxp);
2144 type = build_java_array_type (type, -1);
2145 $$ = build3 (NEW_ANONYMOUS_ARRAY_EXPR, NULL_TREE,
2146 build_pointer_type (type), NULL_TREE, $4);
2148 | NEW_TK error CSB_TK
2149 {yyerror ("'[' expected"); DRECOVER ("]");}
2150 | NEW_TK error OSB_TK
2151 {yyerror ("']' expected"); RECOVER;}
2156 { $$ = build_tree_list (NULL_TREE, $1); }
2157 | dim_exprs dim_expr
2158 { $$ = tree_cons (NULL_TREE, $2, $$); }
2162 OSB_TK expression CSB_TK
2164 if (JNUMERIC_TYPE_P (TREE_TYPE ($2)))
2166 $2 = build_wfl_node ($2);
2167 TREE_TYPE ($2) = NULL_TREE;
2169 EXPR_WFL_LINECOL ($2) = $1.location;
2172 | OSB_TK expression error
2173 {yyerror ("']' expected"); RECOVER;}
2176 yyerror ("Missing term");
2177 yyerror ("']' expected");
2186 /* If not initialized, allocate memory for the osb
2188 if (!ctxp->osb_limit)
2190 allocate = ctxp->osb_limit = 32;
2191 ctxp->osb_depth = -1;
2193 /* If capacity overflown, reallocate a bigger chunk */
2194 else if (ctxp->osb_depth+1 == ctxp->osb_limit)
2195 allocate = ctxp->osb_limit << 1;
2199 allocate *= sizeof (int);
2200 if (ctxp->osb_number)
2201 ctxp->osb_number = xrealloc (ctxp->osb_number,
2204 ctxp->osb_number = xmalloc (allocate);
2207 CURRENT_OSB (ctxp) = 1;
2209 | dims OSB_TK CSB_TK
2210 { CURRENT_OSB (ctxp)++; }
2212 { yyerror ("']' expected"); RECOVER;}
2216 primary DOT_TK identifier
2217 { $$ = make_qualified_primary ($1, $3, $2.location); }
2218 /* FIXME - REWRITE TO:
2219 { $$ = build_binop (COMPONENT_REF, $2.location, $1, $3); } */
2220 | SUPER_TK DOT_TK identifier
2222 tree super_wfl = build_wfl_node (super_identifier_node);
2223 EXPR_WFL_LINECOL (super_wfl) = $1.location;
2224 $$ = make_qualified_name (super_wfl, $3, $2.location);
2227 {yyerror ("Field expected"); DRECOVER (super_field_acces);}
2232 { $$ = build_method_invocation ($1, NULL_TREE); }
2233 | name OP_TK argument_list CP_TK
2234 { $$ = build_method_invocation ($1, $3); }
2235 | primary DOT_TK identifier OP_TK CP_TK
2237 if (TREE_CODE ($1) == THIS_EXPR)
2238 $$ = build_this_super_qualified_invocation
2239 (1, $3, NULL_TREE, 0, $2.location);
2242 tree invok = build_method_invocation ($3, NULL_TREE);
2243 $$ = make_qualified_primary ($1, invok, $2.location);
2246 | primary DOT_TK identifier OP_TK argument_list CP_TK
2248 if (TREE_CODE ($1) == THIS_EXPR)
2249 $$ = build_this_super_qualified_invocation
2250 (1, $3, $5, 0, $2.location);
2253 tree invok = build_method_invocation ($3, $5);
2254 $$ = make_qualified_primary ($1, invok, $2.location);
2257 | SUPER_TK DOT_TK identifier OP_TK CP_TK
2259 $$ = build_this_super_qualified_invocation
2260 (0, $3, NULL_TREE, $1.location, $2.location);
2262 | SUPER_TK DOT_TK identifier OP_TK argument_list CP_TK
2264 $$ = build_this_super_qualified_invocation
2265 (0, $3, $5, $1.location, $2.location);
2267 /* Screws up thing. I let it here until I'm convinced it can
2269 | primary DOT_TK error
2270 {yyerror ("'(' expected"); DRECOVER(bad);} */
2271 | SUPER_TK DOT_TK error CP_TK
2272 { yyerror ("'(' expected"); DRECOVER (method_invocation); }
2273 | SUPER_TK DOT_TK error DOT_TK
2274 { yyerror ("'(' expected"); DRECOVER (method_invocation); }
2278 name OSB_TK expression CSB_TK
2279 { $$ = build_array_ref ($2.location, $1, $3); }
2280 | primary_no_new_array OSB_TK expression CSB_TK
2281 { $$ = build_array_ref ($2.location, $1, $3); }
2282 | array_creation_initialized OSB_TK expression CSB_TK
2283 { $$ = build_array_ref ($2.location, $1, $3); }
2286 yyerror ("Missing term and ']' expected");
2287 DRECOVER(array_access);
2289 | name OSB_TK expression error
2291 yyerror ("']' expected");
2292 DRECOVER(array_access);
2294 | primary_no_new_array OSB_TK error
2296 yyerror ("Missing term and ']' expected");
2297 DRECOVER(array_access);
2299 | primary_no_new_array OSB_TK expression error
2301 yyerror ("']' expected");
2302 DRECOVER(array_access);
2304 | array_creation_initialized OSB_TK error
2306 yyerror ("Missing term and ']' expected");
2307 DRECOVER(array_access);
2309 | array_creation_initialized OSB_TK expression error
2311 yyerror ("']' expected");
2312 DRECOVER(array_access);
2319 | post_increment_expression
2320 | post_decrement_expression
2323 post_increment_expression:
2324 postfix_expression INCR_TK
2325 { $$ = build_incdec ($2.token, $2.location, $1, 1); }
2328 post_decrement_expression:
2329 postfix_expression DECR_TK
2330 { $$ = build_incdec ($2.token, $2.location, $1, 1); }
2333 trap_overflow_corner_case:
2334 pre_increment_expression
2335 | pre_decrement_expression
2336 | PLUS_TK unary_expression
2337 {$$ = build_unaryop ($1.token, $1.location, $2); }
2338 | unary_expression_not_plus_minus
2340 {yyerror ("Missing term"); RECOVER}
2344 trap_overflow_corner_case
2346 error_if_numeric_overflow ($1);
2349 | MINUS_TK trap_overflow_corner_case
2350 {$$ = build_unaryop ($1.token, $1.location, $2); }
2352 {yyerror ("Missing term"); RECOVER}
2355 pre_increment_expression:
2356 INCR_TK unary_expression
2357 {$$ = build_incdec ($1.token, $1.location, $2, 0); }
2359 {yyerror ("Missing term"); RECOVER}
2362 pre_decrement_expression:
2363 DECR_TK unary_expression
2364 {$$ = build_incdec ($1.token, $1.location, $2, 0); }
2366 {yyerror ("Missing term"); RECOVER}
2369 unary_expression_not_plus_minus:
2371 | NOT_TK unary_expression
2372 {$$ = build_unaryop ($1.token, $1.location, $2); }
2373 | NEG_TK unary_expression
2374 {$$ = build_unaryop ($1.token, $1.location, $2); }
2377 {yyerror ("Missing term"); RECOVER}
2379 {yyerror ("Missing term"); RECOVER}
2382 cast_expression: /* Error handling here is potentially weak */
2383 OP_TK primitive_type dims CP_TK unary_expression
2386 int osb = pop_current_osb (ctxp);
2388 type = build_java_array_type (type, -1);
2389 $$ = build_cast ($1.location, type, $5);
2391 | OP_TK primitive_type CP_TK unary_expression
2392 { $$ = build_cast ($1.location, $2, $4); }
2393 | OP_TK expression CP_TK unary_expression_not_plus_minus
2394 { $$ = build_cast ($1.location, $2, $4); }
2395 | OP_TK name dims CP_TK unary_expression_not_plus_minus
2398 int osb = pop_current_osb (ctxp);
2399 obstack_grow (&temporary_obstack,
2400 IDENTIFIER_POINTER (EXPR_WFL_NODE ($2)),
2401 IDENTIFIER_LENGTH (EXPR_WFL_NODE ($2)));
2403 obstack_grow (&temporary_obstack, "[]", 2);
2404 obstack_1grow (&temporary_obstack, '\0');
2405 ptr = obstack_finish (&temporary_obstack);
2406 EXPR_WFL_NODE ($2) = get_identifier (ptr);
2407 $$ = build_cast ($1.location, $2, $5);
2409 | OP_TK primitive_type OSB_TK error
2410 {yyerror ("']' expected, invalid type expression");}
2413 YYNOT_TWICE yyerror ("Invalid type expression"); RECOVER;
2416 | OP_TK primitive_type dims CP_TK error
2417 {yyerror ("Missing term"); RECOVER;}
2418 | OP_TK primitive_type CP_TK error
2419 {yyerror ("Missing term"); RECOVER;}
2420 | OP_TK name dims CP_TK error
2421 {yyerror ("Missing term"); RECOVER;}
2424 multiplicative_expression:
2426 | multiplicative_expression MULT_TK unary_expression
2428 $$ = build_binop (BINOP_LOOKUP ($2.token),
2429 $2.location, $1, $3);
2431 | multiplicative_expression DIV_TK unary_expression
2433 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2436 | multiplicative_expression REM_TK unary_expression
2438 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2441 | multiplicative_expression MULT_TK error
2442 {yyerror ("Missing term"); RECOVER;}
2443 | multiplicative_expression DIV_TK error
2444 {yyerror ("Missing term"); RECOVER;}
2445 | multiplicative_expression REM_TK error
2446 {yyerror ("Missing term"); RECOVER;}
2449 additive_expression:
2450 multiplicative_expression
2451 | additive_expression PLUS_TK multiplicative_expression
2453 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2456 | additive_expression MINUS_TK multiplicative_expression
2458 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2461 | additive_expression PLUS_TK error
2462 {yyerror ("Missing term"); RECOVER;}
2463 | additive_expression MINUS_TK error
2464 {yyerror ("Missing term"); RECOVER;}
2469 | shift_expression LS_TK additive_expression
2471 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2474 | shift_expression SRS_TK additive_expression
2476 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2479 | shift_expression ZRS_TK additive_expression
2481 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2484 | shift_expression LS_TK error
2485 {yyerror ("Missing term"); RECOVER;}
2486 | shift_expression SRS_TK error
2487 {yyerror ("Missing term"); RECOVER;}
2488 | shift_expression ZRS_TK error
2489 {yyerror ("Missing term"); RECOVER;}
2492 relational_expression:
2494 | relational_expression LT_TK shift_expression
2496 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2499 | relational_expression GT_TK shift_expression
2501 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2504 | relational_expression LTE_TK shift_expression
2506 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2509 | relational_expression GTE_TK shift_expression
2511 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2514 | relational_expression INSTANCEOF_TK reference_type
2515 { $$ = build_binop (INSTANCEOF_EXPR, $2.location, $1, $3); }
2516 | relational_expression LT_TK error
2517 {yyerror ("Missing term"); RECOVER;}
2518 | relational_expression GT_TK error
2519 {yyerror ("Missing term"); RECOVER;}
2520 | relational_expression LTE_TK error
2521 {yyerror ("Missing term"); RECOVER;}
2522 | relational_expression GTE_TK error
2523 {yyerror ("Missing term"); RECOVER;}
2524 | relational_expression INSTANCEOF_TK error
2525 {yyerror ("Invalid reference type"); RECOVER;}
2528 equality_expression:
2529 relational_expression
2530 | equality_expression EQ_TK relational_expression
2532 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2535 | equality_expression NEQ_TK relational_expression
2537 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2540 | equality_expression EQ_TK error
2541 {yyerror ("Missing term"); RECOVER;}
2542 | equality_expression NEQ_TK error
2543 {yyerror ("Missing term"); RECOVER;}
2548 | and_expression AND_TK equality_expression
2550 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2553 | and_expression AND_TK error
2554 {yyerror ("Missing term"); RECOVER;}
2557 exclusive_or_expression:
2559 | exclusive_or_expression XOR_TK and_expression
2561 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2564 | exclusive_or_expression XOR_TK error
2565 {yyerror ("Missing term"); RECOVER;}
2568 inclusive_or_expression:
2569 exclusive_or_expression
2570 | inclusive_or_expression OR_TK exclusive_or_expression
2572 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2575 | inclusive_or_expression OR_TK error
2576 {yyerror ("Missing term"); RECOVER;}
2579 conditional_and_expression:
2580 inclusive_or_expression
2581 | conditional_and_expression BOOL_AND_TK inclusive_or_expression
2583 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2586 | conditional_and_expression BOOL_AND_TK error
2587 {yyerror ("Missing term"); RECOVER;}
2590 conditional_or_expression:
2591 conditional_and_expression
2592 | conditional_or_expression BOOL_OR_TK conditional_and_expression
2594 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2597 | conditional_or_expression BOOL_OR_TK error
2598 {yyerror ("Missing term"); RECOVER;}
2601 conditional_expression: /* Error handling here is weak */
2602 conditional_or_expression
2603 | conditional_or_expression REL_QM_TK expression REL_CL_TK conditional_expression
2605 $$ = build3 (CONDITIONAL_EXPR, NULL_TREE, $1, $3, $5);
2606 EXPR_WFL_LINECOL ($$) = $2.location;
2608 | conditional_or_expression REL_QM_TK REL_CL_TK error
2611 yyerror ("Missing term");
2614 | conditional_or_expression REL_QM_TK error
2615 {yyerror ("Missing term"); DRECOVER (2);}
2616 | conditional_or_expression REL_QM_TK expression REL_CL_TK error
2617 {yyerror ("Missing term"); DRECOVER (3);}
2620 assignment_expression:
2621 conditional_expression
2626 left_hand_side assignment_operator assignment_expression
2627 { $$ = build_assignment ($2.token, $2.location, $1, $3); }
2628 | left_hand_side assignment_operator error
2630 YYNOT_TWICE yyerror ("Missing term");
2641 assignment_operator:
2647 assignment_expression
2650 constant_expression:
2656 /* Helper function to retrieve an OSB count. Should be used when the
2657 `dims:' rule is being used. */
2660 pop_current_osb (struct parser_ctxt *ctxp)
2664 if (ctxp->osb_depth < 0)
2667 to_return = CURRENT_OSB (ctxp);
2675 /* This section of the code deal with save/restoring parser contexts.
2676 Add mode documentation here. FIXME */
2678 /* Helper function. Create a new parser context. With
2679 COPY_FROM_PREVIOUS set to a nonzero value, content of the previous
2680 context is copied, otherwise, the new context is zeroed. The newly
2681 created context becomes the current one. */
2684 create_new_parser_context (int copy_from_previous)
2686 struct parser_ctxt *new;
2688 new = ggc_alloc (sizeof (struct parser_ctxt));
2689 if (copy_from_previous)
2691 memcpy (new, ctxp, sizeof (struct parser_ctxt));
2692 /* This flag, indicating the context saves global values,
2693 should only be set by java_parser_context_save_global. */
2694 new->saved_data_ctx = 0;
2697 memset (new, 0, sizeof (struct parser_ctxt));
2703 /* Create a new parser context and make it the current one. */
2706 java_push_parser_context (void)
2708 create_new_parser_context (0);
2712 java_pop_parser_context (int generate)
2715 struct parser_ctxt *toFree, *next;
2724 input_line = ctxp->lineno;
2725 current_class = ctxp->class_type;
2728 /* If the old and new lexers differ, then free the old one. */
2729 if (ctxp->lexer && next && ctxp->lexer != next->lexer)
2730 java_destroy_lexer (ctxp->lexer);
2732 /* Set the single import class file flag to 0 for the current list
2733 of imported things */
2734 for (current = ctxp->import_list; current; current = TREE_CHAIN (current))
2735 IS_A_SINGLE_IMPORT_CLASSFILE_NAME_P (TREE_VALUE (current)) = 0;
2737 /* And restore those of the previous context */
2738 if ((ctxp = next)) /* Assignment is really meant here */
2739 for (current = ctxp->import_list; current; current = TREE_CHAIN (current))
2740 IS_A_SINGLE_IMPORT_CLASSFILE_NAME_P (TREE_VALUE (current)) = 1;
2742 /* If we pushed a context to parse a class intended to be generated,
2743 we keep it so we can remember the class. What we could actually
2744 do is to just update a list of class names. */
2747 toFree->next = ctxp_for_generation;
2748 ctxp_for_generation = toFree;
2752 /* Create a parser context for the use of saving some global
2756 java_parser_context_save_global (void)
2760 java_push_parser_context ();
2761 ctxp->saved_data_ctx = 1;
2764 /* If this context already stores data, create a new one suitable
2765 for data storage. */
2766 else if (ctxp->saved_data)
2768 create_new_parser_context (1);
2769 ctxp->saved_data_ctx = 1;
2772 ctxp->lineno = input_line;
2773 ctxp->class_type = current_class;
2774 ctxp->filename = input_filename;
2775 ctxp->function_decl = current_function_decl;
2776 ctxp->saved_data = 1;
2779 /* Restore some global variables from the previous context. Make the
2780 previous context the current one. */
2783 java_parser_context_restore_global (void)
2785 input_line = ctxp->lineno;
2786 current_class = ctxp->class_type;
2787 input_filename = ctxp->filename;
2789 EXPR_WFL_FILENAME_NODE (wfl_operator) = get_identifier (input_filename);
2790 current_function_decl = ctxp->function_decl;
2791 ctxp->saved_data = 0;
2792 if (ctxp->saved_data_ctx)
2793 java_pop_parser_context (0);
2796 /* Suspend vital data for the current class/function being parsed so
2797 that an other class can be parsed. Used to let local/anonymous
2798 classes be parsed. */
2801 java_parser_context_suspend (void)
2803 /* This makes debugging through java_debug_context easier */
2804 static const char *const name = "<inner buffer context>";
2806 /* Duplicate the previous context, use it to save the globals we're
2808 create_new_parser_context (1);
2809 ctxp->function_decl = current_function_decl;
2810 ctxp->class_type = current_class;
2812 /* Then create a new context which inherits all data from the
2813 previous one. This will be the new current context */
2814 create_new_parser_context (1);
2816 /* Help debugging */
2817 ctxp->next->filename = name;
2820 /* Resume vital data for the current class/function being parsed so
2821 that an other class can be parsed. Used to let local/anonymous
2822 classes be parsed. The trick is the data storing file position
2823 informations must be restored to their current value, so parsing
2824 can resume as if no context was ever saved. */
2827 java_parser_context_resume (void)
2829 struct parser_ctxt *old = ctxp; /* This one is to be discarded */
2830 struct parser_ctxt *saver = old->next; /* This one contain saved info */
2831 struct parser_ctxt *restored = saver->next; /* This one is the old current */
2833 /* We need to inherit the list of classes to complete/generate */
2834 restored->classd_list = old->classd_list;
2835 restored->class_list = old->class_list;
2837 /* Restore the current class and function from the saver */
2838 current_class = saver->class_type;
2839 current_function_decl = saver->function_decl;
2841 /* Retrieve the restored context */
2844 /* Re-installed the data for the parsing to carry on */
2845 memcpy (&ctxp->marker_begining, &old->marker_begining,
2846 (size_t)(&ctxp->marker_end - &ctxp->marker_begining));
2849 /* Add a new anchor node to which all statement(s) initializing static
2850 and non static initialized upon declaration field(s) will be
2854 java_parser_context_push_initialized_field (void)
2858 node = build_tree_list (NULL_TREE, NULL_TREE);
2859 TREE_CHAIN (node) = CPC_STATIC_INITIALIZER_LIST (ctxp);
2860 CPC_STATIC_INITIALIZER_LIST (ctxp) = node;
2862 node = build_tree_list (NULL_TREE, NULL_TREE);
2863 TREE_CHAIN (node) = CPC_INITIALIZER_LIST (ctxp);
2864 CPC_INITIALIZER_LIST (ctxp) = node;
2866 node = build_tree_list (NULL_TREE, NULL_TREE);
2867 TREE_CHAIN (node) = CPC_INSTANCE_INITIALIZER_LIST (ctxp);
2868 CPC_INSTANCE_INITIALIZER_LIST (ctxp) = node;
2871 /* Pop the lists of initialized field. If this lists aren't empty,
2872 remember them so we can use it to create and populate the finit$
2873 or <clinit> functions. */
2876 java_parser_context_pop_initialized_field (void)
2879 tree class_type = TREE_TYPE (GET_CPC ());
2881 if (CPC_INITIALIZER_LIST (ctxp))
2883 stmts = CPC_INITIALIZER_STMT (ctxp);
2884 CPC_INITIALIZER_LIST (ctxp) = TREE_CHAIN (CPC_INITIALIZER_LIST (ctxp));
2885 if (stmts && !java_error_count)
2886 TYPE_FINIT_STMT_LIST (class_type) = reorder_static_initialized (stmts);
2889 if (CPC_STATIC_INITIALIZER_LIST (ctxp))
2891 stmts = CPC_STATIC_INITIALIZER_STMT (ctxp);
2892 CPC_STATIC_INITIALIZER_LIST (ctxp) =
2893 TREE_CHAIN (CPC_STATIC_INITIALIZER_LIST (ctxp));
2894 /* Keep initialization in order to enforce 8.5 */
2895 if (stmts && !java_error_count)
2896 TYPE_CLINIT_STMT_LIST (class_type) = nreverse (stmts);
2899 /* JDK 1.1 instance initializers */
2900 if (CPC_INSTANCE_INITIALIZER_LIST (ctxp))
2902 stmts = CPC_INSTANCE_INITIALIZER_STMT (ctxp);
2903 CPC_INSTANCE_INITIALIZER_LIST (ctxp) =
2904 TREE_CHAIN (CPC_INSTANCE_INITIALIZER_LIST (ctxp));
2905 if (stmts && !java_error_count)
2906 TYPE_II_STMT_LIST (class_type) = nreverse (stmts);
2911 reorder_static_initialized (tree list)
2913 /* We have to keep things in order. The alias initializer have to
2914 come first, then the initialized regular field, in reverse to
2915 keep them in lexical order. */
2916 tree marker, previous = NULL_TREE;
2917 for (marker = list; marker; previous = marker, marker = TREE_CHAIN (marker))
2918 if (TREE_CODE (marker) == TREE_LIST
2919 && !TREE_VALUE (marker) && !TREE_PURPOSE (marker))
2922 /* No static initialized, the list is fine as is */
2924 list = TREE_CHAIN (marker);
2926 /* No marker? reverse the whole list */
2928 list = nreverse (list);
2930 /* Otherwise, reverse what's after the marker and the new reordered
2931 sublist will replace the marker. */
2934 TREE_CHAIN (previous) = NULL_TREE;
2935 list = nreverse (list);
2936 list = chainon (TREE_CHAIN (marker), list);
2941 /* Helper functions to dump the parser context stack. */
2943 #define TAB_CONTEXT(C) \
2944 {int i; for (i = 0; i < (C); i++) fputc (' ', stderr);}
2947 java_debug_context_do (int tab)
2949 struct parser_ctxt *copy = ctxp;
2953 fprintf (stderr, "ctxt: 0x%0lX\n", (unsigned long)copy);
2955 fprintf (stderr, "filename: %s\n", copy->filename);
2957 fprintf (stderr, "lineno: %d\n", copy->lineno);
2959 fprintf (stderr, "package: %s\n",
2961 IDENTIFIER_POINTER (copy->package) : "<none>"));
2963 fprintf (stderr, "context for saving: %d\n", copy->saved_data_ctx);
2965 fprintf (stderr, "saved data: %d\n", copy->saved_data);
2971 /* Dump the stacked up parser contexts. Intended to be called from a
2975 java_debug_context (void)
2977 java_debug_context_do (0);
2982 /* Flag for the error report routine to issue the error the first time
2983 it's called (overriding the default behavior which is to drop the
2984 first invocation and honor the second one, taking advantage of a
2986 static int force_error = 0;
2988 /* Reporting an constructor invocation error. */
2990 parse_ctor_invocation_error (void)
2992 if (DECL_CONSTRUCTOR_P (current_function_decl))
2993 yyerror ("Constructor invocation must be first thing in a constructor");
2995 yyerror ("Only constructors can invoke constructors");
2998 /* Reporting JDK1.1 features not implemented. */
3001 parse_jdk1_1_error (const char *msg)
3003 sorry (": `%s' JDK1.1(TM) feature", msg);
3005 return build_java_empty_stmt ();
3008 static int do_warning = 0;
3011 yyerror (const char *msg)
3014 static int prev_lineno;
3015 static const char *prev_msg;
3018 char *remainder, *code_from_source;
3020 if (!force_error && prev_lineno == input_line)
3023 /* Save current error location but report latter, when the context is
3025 if (ctxp->java_error_flag == 0)
3027 ctxp->java_error_flag = 1;
3029 /* Do something to use the previous line if we're reaching the
3030 end of the file... */
3031 #ifdef VERBOSE_SKELETON
3032 printf ("* Error detected (%s)\n", (msg ? msg : "(null)"));
3037 /* Ignore duplicate message on the same line. BTW, this is dubious. FIXME */
3038 if (!force_error && msg == prev_msg && prev_lineno == elc.line)
3041 ctxp->java_error_flag = 0;
3043 java_warning_count++;
3047 if (elc.col == 0 && msg && msg[1] == ';')
3049 elc.col = ctxp->p_line->char_col-1;
3050 elc.line = ctxp->p_line->lineno;
3053 save_lineno = input_line;
3054 prev_lineno = input_line = elc.line;
3057 code_from_source = java_get_line_col (ctxp->filename, elc.line, elc.col);
3058 obstack_grow0 (&temporary_obstack,
3059 code_from_source, strlen (code_from_source));
3060 remainder = obstack_finish (&temporary_obstack);
3062 warning ("%s.\n%s", msg, remainder);
3064 error ("%s.\n%s", msg, remainder);
3066 /* This allow us to cheaply avoid an extra 'Invalid expression
3067 statement' error report when errors have been already reported on
3068 the same line. This occurs when we report an error but don't have
3069 a synchronization point other than ';', which
3070 expression_statement is the only one to take care of. */
3071 ctxp->prevent_ese = input_line = save_lineno;
3075 issue_warning_error_from_context (tree cl, const char *msg, va_list ap)
3077 const char *saved, *saved_input_filename;
3079 vsprintf (buffer, msg, ap);
3082 ctxp->elc.line = EXPR_WFL_LINENO (cl);
3083 ctxp->elc.col = (EXPR_WFL_COLNO (cl) == 0xfff ? -1 :
3084 (EXPR_WFL_COLNO (cl) == 0xffe ? -2 : EXPR_WFL_COLNO (cl)));
3086 /* We have a CL, that's a good reason for using it if it contains data */
3087 saved = ctxp->filename;
3088 if (TREE_CODE (cl) == EXPR_WITH_FILE_LOCATION && EXPR_WFL_FILENAME_NODE (cl))
3089 ctxp->filename = EXPR_WFL_FILENAME (cl);
3090 saved_input_filename = input_filename;
3091 input_filename = ctxp->filename;
3093 java_error (buffer);
3094 ctxp->filename = saved;
3095 input_filename = saved_input_filename;
3099 /* Issue an error message at a current source line CL */
3102 parse_error_context (tree cl, const char *msg, ...)
3106 issue_warning_error_from_context (cl, msg, ap);
3110 /* Issue a warning at a current source line CL */
3113 parse_warning_context (tree cl, const char *msg, ...)
3118 force_error = do_warning = 1;
3119 issue_warning_error_from_context (cl, msg, ap);
3120 do_warning = force_error = 0;
3125 find_expr_with_wfl (tree node)
3132 switch (TREE_CODE (node))
3135 node = BLOCK_EXPR_BODY (node);
3139 to_return = find_expr_with_wfl (TREE_OPERAND (node, 0));
3142 node = TREE_OPERAND (node, 1);
3146 node = TREE_OPERAND (node, 0);
3149 case LABELED_BLOCK_EXPR:
3150 node = TREE_OPERAND (node, 1);
3154 code = TREE_CODE_CLASS (TREE_CODE (node));
3155 if (((code == '1') || (code == '2') || (code == 'e'))
3156 && EXPR_WFL_LINECOL (node))
3164 /* Issue a missing return statement error. Uses METHOD to figure the
3165 last line of the method the error occurs in. */
3168 missing_return_error (tree method)
3170 EXPR_WFL_SET_LINECOL (wfl_operator, DECL_FUNCTION_LAST_LINE (method), -2);
3171 parse_error_context (wfl_operator, "Missing return statement");
3174 /* Issue an unreachable statement error. From NODE, find the next
3175 statement to report appropriately. */
3177 unreachable_stmt_error (tree node)
3179 /* Browse node to find the next expression node that has a WFL. Use
3180 the location to report the error */
3181 if (TREE_CODE (node) == COMPOUND_EXPR)
3182 node = find_expr_with_wfl (TREE_OPERAND (node, 1));
3184 node = find_expr_with_wfl (node);
3188 EXPR_WFL_SET_LINECOL (wfl_operator, EXPR_WFL_LINENO (node), -2);
3189 parse_error_context (wfl_operator, "Unreachable statement");
3196 not_accessible_field_error (tree wfl, tree decl)
3199 (wfl, "Can't access %s field `%s.%s' from `%s'",
3200 accessibility_string (get_access_flags_from_decl (decl)),
3201 GET_TYPE_NAME (DECL_CONTEXT (decl)),
3202 IDENTIFIER_POINTER (DECL_NAME (decl)),
3203 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (current_class))));
3208 java_report_errors (void)
3210 if (java_error_count)
3211 fprintf (stderr, "%d error%s",
3212 java_error_count, (java_error_count == 1 ? "" : "s"));
3213 if (java_warning_count)
3214 fprintf (stderr, "%s%d warning%s", (java_error_count ? ", " : ""),
3215 java_warning_count, (java_warning_count == 1 ? "" : "s"));
3216 if (java_error_count || java_warning_count)
3217 putc ('\n', stderr);
3218 return java_error_count;
3222 java_accstring_lookup (int flags)
3224 static char buffer [80];
3225 #define COPY_RETURN(S) {strcpy (buffer, S); return buffer;}
3227 /* Access modifier looked-up first for easier report on forbidden
3229 if (flags & ACC_PUBLIC) COPY_RETURN ("public");
3230 if (flags & ACC_PRIVATE) COPY_RETURN ("private");
3231 if (flags & ACC_PROTECTED) COPY_RETURN ("protected");
3232 if (flags & ACC_STATIC) COPY_RETURN ("static");
3233 if (flags & ACC_FINAL) COPY_RETURN ("final");
3234 if (flags & ACC_SYNCHRONIZED) COPY_RETURN ("synchronized");
3235 if (flags & ACC_VOLATILE) COPY_RETURN ("volatile");
3236 if (flags & ACC_TRANSIENT) COPY_RETURN ("transient");
3237 if (flags & ACC_NATIVE) COPY_RETURN ("native");
3238 if (flags & ACC_INTERFACE) COPY_RETURN ("interface");
3239 if (flags & ACC_ABSTRACT) COPY_RETURN ("abstract");
3246 /* Returns a string denoting the accessibility of a class or a member as
3247 indicated by FLAGS. We need a separate function from
3248 java_accstring_lookup, as the latter can return spurious "static", etc.
3249 if package-private access is defined (in which case none of the
3250 relevant access control bits in FLAGS is set). */
3253 accessibility_string (int flags)
3255 if (flags & ACC_PRIVATE) return "private";
3256 if (flags & ACC_PROTECTED) return "protected";
3257 if (flags & ACC_PUBLIC) return "public";
3259 return "package-private";
3262 /* Issuing error messages upon redefinition of classes, interfaces or
3266 classitf_redefinition_error (const char *context, tree id, tree decl, tree cl)
3268 parse_error_context (cl, "%s `%s' already defined in %s:%d",
3269 context, IDENTIFIER_POINTER (id),
3270 DECL_SOURCE_FILE (decl), DECL_SOURCE_LINE (decl));
3271 /* Here we should point out where its redefined. It's a unicode. FIXME */
3275 variable_redefinition_error (tree context, tree name, tree type, int line)
3277 const char *type_name;
3279 /* Figure a proper name for type. We might haven't resolved it */
3280 if (TREE_CODE (type) == POINTER_TYPE && !TREE_TYPE (type))
3281 type_name = IDENTIFIER_POINTER (TYPE_NAME (type));
3283 type_name = lang_printable_name (type, 0);
3285 parse_error_context (context,
3286 "Variable `%s' is already defined in this method and was declared `%s %s' at line %d",
3287 IDENTIFIER_POINTER (name),
3288 type_name, IDENTIFIER_POINTER (name), line);
3291 /* If ANAME is terminated with `[]', it indicates an array. This
3292 function returns the number of `[]' found and if this number is
3293 greater than zero, it extracts the array type name and places it in
3294 the node pointed to by TRIMMED unless TRIMMED is null. */
3297 build_type_name_from_array_name (tree aname, tree *trimmed)
3299 const char *name = IDENTIFIER_POINTER (aname);
3300 int len = IDENTIFIER_LENGTH (aname);
3303 STRING_STRIP_BRACKETS (name, len, array_dims);
3305 if (array_dims && trimmed)
3306 *trimmed = get_identifier_with_length (name, len);
3312 build_array_from_name (tree type, tree type_wfl, tree name, tree *ret_name)
3316 /* Eventually get more dims */
3317 more_dims = build_type_name_from_array_name (name, &name);
3319 /* If we have, then craft a new type for this variable */
3324 /* If we have a pointer, use its type */
3325 if (TREE_CODE (type) == POINTER_TYPE)
3326 type = TREE_TYPE (type);
3328 /* Building the first dimension of a primitive type uses this
3330 if (JPRIMITIVE_TYPE_P (type))
3332 type = build_java_array_type (type, -1);
3335 /* Otherwise, if we have a WFL for this type, use it (the type
3336 is already an array on an unresolved type, and we just keep
3337 on adding dimensions) */
3341 more_dims += build_type_name_from_array_name (TYPE_NAME (save),
3345 /* Add all the dimensions */
3347 type = build_unresolved_array_type (type);
3349 /* The type may have been incomplete in the first place */
3351 type = obtain_incomplete_type (type);
3359 /* Build something that the type identifier resolver will identify as
3360 being an array to an unresolved type. TYPE_WFL is a WFL on a
3364 build_unresolved_array_type (tree type_or_wfl)
3369 /* TYPE_OR_WFL might be an array on a resolved type. In this case,
3370 just create a array type */
3371 if (TREE_CODE (type_or_wfl) == RECORD_TYPE)
3372 return build_java_array_type (type_or_wfl, -1);
3374 obstack_grow (&temporary_obstack,
3375 IDENTIFIER_POINTER (EXPR_WFL_NODE (type_or_wfl)),
3376 IDENTIFIER_LENGTH (EXPR_WFL_NODE (type_or_wfl)));
3377 obstack_grow0 (&temporary_obstack, "[]", 2);
3378 ptr = obstack_finish (&temporary_obstack);
3379 wfl = build_expr_wfl (get_identifier (ptr),
3380 EXPR_WFL_FILENAME (type_or_wfl),
3381 EXPR_WFL_LINENO (type_or_wfl),
3382 EXPR_WFL_COLNO (type_or_wfl));
3383 /* Re-install the existing qualifications so that the type can be
3384 resolved properly. */
3385 EXPR_WFL_QUALIFICATION (wfl) = EXPR_WFL_QUALIFICATION (type_or_wfl);
3390 parser_add_interface (tree class_decl, tree interface_decl, tree wfl)
3392 if (maybe_add_interface (TREE_TYPE (class_decl), TREE_TYPE (interface_decl)))
3393 parse_error_context (wfl, "Interface `%s' repeated",
3394 IDENTIFIER_POINTER (DECL_NAME (interface_decl)));
3397 /* Bulk of common class/interface checks. Return 1 if an error was
3398 encountered. TAG is 0 for a class, 1 for an interface. */
3401 check_class_interface_creation (int is_interface, int flags, tree raw_name,
3402 tree qualified_name, tree decl, tree cl)
3405 int sca = 0; /* Static class allowed */
3406 int icaf = 0; /* Inner class allowed flags */
3407 int uaaf = CLASS_MODIFIERS; /* Usually allowed access flags */
3410 fprintf (stderr, " %s%s %s",
3411 (CPC_INNER_P () ? "inner" : ""),
3412 (is_interface ? "interface" : "class"),
3413 IDENTIFIER_POINTER (qualified_name));
3415 /* Scope of an interface/class type name:
3416 - Can't be imported by a single type import
3417 - Can't already exists in the package */
3418 if (IS_A_SINGLE_IMPORT_CLASSFILE_NAME_P (raw_name)
3419 && (node = find_name_in_single_imports (raw_name))
3423 (cl, "%s name `%s' clashes with imported type `%s'",
3424 (is_interface ? "Interface" : "Class"),
3425 IDENTIFIER_POINTER (raw_name), IDENTIFIER_POINTER (node));
3428 if (decl && CLASS_COMPLETE_P (decl))
3430 classitf_redefinition_error ((is_interface ? "Interface" : "Class"),
3431 qualified_name, decl, cl);
3435 if (check_inner_class_redefinition (raw_name, cl))
3438 /* If public, file name should match class/interface name, except
3439 when dealing with an inner class */
3440 if (!CPC_INNER_P () && (flags & ACC_PUBLIC ))
3444 for (f = &input_filename [strlen (input_filename)];
3445 f != input_filename && ! IS_DIR_SEPARATOR (f[0]);
3448 if (IS_DIR_SEPARATOR (f[0]))
3450 if (strncmp (IDENTIFIER_POINTER (raw_name),
3451 f , IDENTIFIER_LENGTH (raw_name)) ||
3452 f [IDENTIFIER_LENGTH (raw_name)] != '.')
3454 (cl, "Public %s `%s' must be defined in a file called `%s.java'",
3455 (is_interface ? "interface" : "class"),
3456 IDENTIFIER_POINTER (qualified_name),
3457 IDENTIFIER_POINTER (raw_name));
3460 /* Static classes can be declared only in top level classes. Note:
3461 once static, a inner class is a top level class. */
3462 if (flags & ACC_STATIC)
3464 /* Catch the specific error of declaring an class inner class
3465 with no toplevel enclosing class. Prevent check_modifiers from
3466 complaining a second time */
3467 if (CPC_INNER_P () && !TOPLEVEL_CLASS_DECL_P (GET_CPC()))
3469 parse_error_context (cl, "Inner class `%s' can't be static. Static classes can only occur in interfaces and top-level classes",
3470 IDENTIFIER_POINTER (qualified_name));
3473 /* Else, in the context of a top-level class declaration, let
3474 `check_modifiers' do its job, otherwise, give it a go */
3476 sca = (GET_CPC_LIST () ? ACC_STATIC : 0);
3479 /* Inner classes can be declared private or protected
3480 within their enclosing classes. */
3483 /* A class which is local to a block can't be public, private,
3484 protected or static. But it is created final, so allow this
3486 if (current_function_decl)
3487 icaf = sca = uaaf = ACC_FINAL;
3490 check_modifiers_consistency (flags);
3491 icaf = ACC_PROTECTED;
3492 if (! CLASS_INTERFACE (GET_CPC ()))
3493 icaf |= ACC_PRIVATE;
3500 uaaf = INTERFACE_INNER_MODIFIERS;
3502 uaaf = INTERFACE_MODIFIERS;
3504 check_modifiers ("Illegal modifier `%s' for interface declaration",
3508 check_modifiers ((current_function_decl ?
3509 "Illegal modifier `%s' for local class declaration" :
3510 "Illegal modifier `%s' for class declaration"),
3511 flags, uaaf|sca|icaf);
3515 /* Construct a nested class name. If the final component starts with
3516 a digit, return true. Otherwise return false. */
3518 make_nested_class_name (tree cpc_list)
3525 make_nested_class_name (TREE_CHAIN (cpc_list));
3527 /* Pick the qualified name when dealing with the first upmost
3529 name = (TREE_CHAIN (cpc_list)
3530 ? TREE_PURPOSE (cpc_list) : DECL_NAME (TREE_VALUE (cpc_list)));
3531 obstack_grow (&temporary_obstack,
3532 IDENTIFIER_POINTER (name), IDENTIFIER_LENGTH (name));
3533 obstack_1grow (&temporary_obstack, '$');
3535 return ISDIGIT (IDENTIFIER_POINTER (name)[0]);
3538 /* Can't redefine a class already defined in an earlier scope. */
3541 check_inner_class_redefinition (tree raw_name, tree cl)
3545 for (scope_list = GET_CPC_LIST (); scope_list;
3546 scope_list = GET_NEXT_ENCLOSING_CPC (scope_list))
3547 if (raw_name == GET_CPC_UN_NODE (scope_list))
3550 (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",
3551 IDENTIFIER_POINTER (raw_name));
3557 /* Tries to find a decl for CLASS_TYPE within ENCLOSING. If we fail,
3558 we remember ENCLOSING and SUPER. */
3561 resolve_inner_class (htab_t circularity_hash, tree cl, tree *enclosing,
3562 tree *super, tree class_type)
3564 tree local_enclosing = *enclosing;
3565 tree local_super = NULL_TREE;
3567 while (local_enclosing)
3569 tree intermediate, decl;
3571 *htab_find_slot (circularity_hash, local_enclosing, INSERT) =
3574 if ((decl = find_as_inner_class (local_enclosing, class_type, cl)))
3577 intermediate = local_enclosing;
3578 /* Explore enclosing contexts. */
3579 while (INNER_CLASS_DECL_P (intermediate))
3581 intermediate = DECL_CONTEXT (intermediate);
3582 if ((decl = find_as_inner_class (intermediate, class_type, cl)))
3586 /* Now go to the upper classes, bail out if necessary. We will
3587 analyze the returned SUPER and act accordingly (see
3588 do_resolve_class). */
3589 if (JPRIMITIVE_TYPE_P (TREE_TYPE (local_enclosing))
3590 || TREE_TYPE (local_enclosing) == void_type_node)
3592 parse_error_context (cl, "Qualifier must be a reference");
3593 local_enclosing = NULL_TREE;
3596 local_super = CLASSTYPE_SUPER (TREE_TYPE (local_enclosing));
3597 if (!local_super || local_super == object_type_node)
3600 if (TREE_CODE (local_super) == POINTER_TYPE)
3601 local_super = do_resolve_class (NULL, local_super, NULL, NULL);
3603 local_super = TYPE_NAME (local_super);
3605 /* We may not have checked for circular inheritance yet, so do so
3606 here to prevent an infinite loop. */
3607 if (htab_find (circularity_hash, local_super) != NULL)
3610 cl = lookup_cl (local_enclosing);
3613 (cl, "Cyclic inheritance involving %s",
3614 IDENTIFIER_POINTER (DECL_NAME (local_enclosing)));
3615 local_enclosing = NULL_TREE;
3618 local_enclosing = local_super;
3621 /* We failed. Return LOCAL_SUPER and LOCAL_ENCLOSING. */
3622 *super = local_super;
3623 *enclosing = local_enclosing;
3628 /* Within ENCLOSING, find a decl for NAME and return it. NAME can be
3632 find_as_inner_class (tree enclosing, tree name, tree cl)
3634 tree qual, to_return;
3638 name = TYPE_NAME (name);
3640 /* First search: within the scope of `enclosing', search for name */
3641 if (QUALIFIED_P (name) && cl && EXPR_WFL_NODE (cl) == name)
3642 qual = EXPR_WFL_QUALIFICATION (cl);
3644 qual = build_tree_list (cl, NULL_TREE);
3646 qual = build_tree_list (build_expr_wfl (name, NULL, 0, 0), NULL_TREE);
3648 if ((to_return = find_as_inner_class_do (qual, enclosing)))
3651 /* We're dealing with a qualified name. Try to resolve thing until
3652 we get something that is an enclosing class. */
3653 if (QUALIFIED_P (name) && cl && EXPR_WFL_NODE (cl) == name)
3655 tree acc = NULL_TREE, decl = NULL_TREE, ptr;
3657 for (qual = EXPR_WFL_QUALIFICATION (cl); qual && !decl;
3658 qual = TREE_CHAIN (qual))
3660 acc = merge_qualified_name (acc,
3661 EXPR_WFL_NODE (TREE_PURPOSE (qual)));
3662 BUILD_PTR_FROM_NAME (ptr, acc);
3663 decl = do_resolve_class (NULL_TREE, ptr, NULL_TREE, cl);
3666 /* A NULL qual and a decl means that the search ended
3667 successfully?!? We have to do something then. FIXME */
3672 qual = EXPR_WFL_QUALIFICATION (cl);
3674 /* Otherwise, create a qual for the other part of the resolution. */
3676 qual = build_tree_list (build_expr_wfl (name, NULL, 0, 0), NULL_TREE);
3678 return find_as_inner_class_do (qual, enclosing);
3681 /* We go inside the list of sub classes and try to find a way
3685 find_as_inner_class_do (tree qual, tree enclosing)
3690 for (; qual && enclosing; qual = TREE_CHAIN (qual))
3692 tree name_to_match = EXPR_WFL_NODE (TREE_PURPOSE (qual));
3693 tree next_enclosing = NULL_TREE;
3696 for (inner_list = DECL_INNER_CLASS_LIST (enclosing);
3697 inner_list; inner_list = TREE_CHAIN (inner_list))
3699 if (TREE_VALUE (inner_list) == name_to_match)
3701 next_enclosing = TREE_PURPOSE (inner_list);
3705 enclosing = next_enclosing;
3708 return (!qual && enclosing ? enclosing : NULL_TREE);
3712 link_nested_class_to_enclosing (void)
3714 if (GET_ENCLOSING_CPC ())
3716 tree enclosing = GET_ENCLOSING_CPC_CONTEXT ();
3717 DECL_INNER_CLASS_LIST (enclosing) =
3718 tree_cons (GET_CPC (), GET_CPC_UN (),
3719 DECL_INNER_CLASS_LIST (enclosing));
3724 maybe_make_nested_class_name (tree name)
3726 tree id = NULL_TREE;
3730 /* If we're in a function, we must append a number to create the
3731 nested class name. However, we don't do this if the class we
3732 are constructing is anonymous, because in that case we'll
3733 already have a number as the class name. */
3734 if (! make_nested_class_name (GET_CPC_LIST ())
3735 && current_function_decl != NULL_TREE
3736 && ! ISDIGIT (IDENTIFIER_POINTER (name)[0]))
3739 sprintf (buf, "%d", anonymous_class_counter);
3740 ++anonymous_class_counter;
3741 obstack_grow (&temporary_obstack, buf, strlen (buf));
3742 obstack_1grow (&temporary_obstack, '$');
3744 obstack_grow0 (&temporary_obstack,
3745 IDENTIFIER_POINTER (name),
3746 IDENTIFIER_LENGTH (name));
3747 id = get_identifier (obstack_finish (&temporary_obstack));
3749 QUALIFIED_P (id) = 1;
3754 /* If DECL is NULL, create and push a new DECL, record the current
3755 line CL and do other maintenance things. */
3758 maybe_create_class_interface_decl (tree decl, tree raw_name,
3759 tree qualified_name, tree cl)
3762 decl = push_class (make_class (), qualified_name);
3764 /* Take care of the file and line business */
3765 DECL_SOURCE_FILE (decl) = EXPR_WFL_FILENAME (cl);
3766 /* If we're emitting xrefs, store the line/col number information */
3768 DECL_SOURCE_LINE (decl) = EXPR_WFL_LINECOL (cl);
3770 DECL_SOURCE_LINE (decl) = EXPR_WFL_LINENO (cl);
3771 CLASS_FROM_SOURCE_P (TREE_TYPE (decl)) = 1;
3772 CLASS_PARSED_P (TREE_TYPE (decl)) = 1;
3773 CLASS_FROM_CURRENTLY_COMPILED_P (TREE_TYPE (decl)) =
3774 IS_A_COMMAND_LINE_FILENAME_P (EXPR_WFL_FILENAME_NODE (cl));
3776 PUSH_CPC (decl, raw_name);
3777 DECL_CONTEXT (decl) = GET_ENCLOSING_CPC_CONTEXT ();
3779 /* Link the declaration to the already seen ones */
3780 TREE_CHAIN (decl) = ctxp->class_list;
3781 ctxp->class_list = decl;
3783 /* Create a new nodes in the global lists */
3784 gclass_list = tree_cons (NULL_TREE, decl, gclass_list);
3785 all_class_list = tree_cons (NULL_TREE, decl, all_class_list);
3787 /* Install a new dependency list element */
3788 create_jdep_list (ctxp);
3790 SOURCE_FRONTEND_DEBUG (("Defining class/interface %s",
3791 IDENTIFIER_POINTER (qualified_name)));
3796 add_superinterfaces (tree decl, tree interface_list)
3799 /* Superinterface(s): if present and defined, parser_check_super_interface ()
3800 takes care of ensuring that:
3801 - This is an accessible interface type,
3802 - Circularity detection.
3803 parser_add_interface is then called. If present but not defined,
3804 the check operation is delayed until the super interface gets
3806 for (node = interface_list; node; node = TREE_CHAIN (node))
3808 tree current = TREE_PURPOSE (node);
3809 tree idecl = IDENTIFIER_CLASS_VALUE (EXPR_WFL_NODE (current));
3810 if (idecl && CLASS_LOADED_P (TREE_TYPE (idecl)))
3812 if (!parser_check_super_interface (idecl, decl, current))
3813 parser_add_interface (decl, idecl, current);
3816 register_incomplete_type (JDEP_INTERFACE,
3817 current, decl, NULL_TREE);
3821 /* Create an interface in pass1 and return its decl. Return the
3822 interface's decl in pass 2. */
3825 create_interface (int flags, tree id, tree super)
3827 tree raw_name = EXPR_WFL_NODE (id);
3828 tree q_name = parser_qualified_classname (raw_name);
3829 tree decl = IDENTIFIER_CLASS_VALUE (q_name);
3831 /* Certain syntax errors are making SUPER be like ID. Avoid this
3833 if (ctxp->class_err && id == super)
3836 EXPR_WFL_NODE (id) = q_name; /* Keep source location, even if refined. */
3838 /* Basic checks: scope, redefinition, modifiers */
3839 if (check_class_interface_creation (1, flags, raw_name, q_name, decl, id))
3845 /* Suspend the current parsing context if we're parsing an inner
3849 java_parser_context_suspend ();
3850 /* Interface members are public. */
3851 if (CLASS_INTERFACE (GET_CPC ()))
3852 flags |= ACC_PUBLIC;
3855 /* Push a new context for (static) initialized upon declaration fields */
3856 java_parser_context_push_initialized_field ();
3858 /* Interface modifiers check
3859 - public/abstract allowed (already done at that point)
3860 - abstract is obsolete (comes first, it's a warning, or should be)
3861 - Can't use twice the same (checked in the modifier rule) */
3862 if ((flags & ACC_ABSTRACT) && flag_redundant)
3863 parse_warning_context
3864 (MODIFIER_WFL (ABSTRACT_TK),
3865 "Redundant use of `abstract' modifier. Interface `%s' is implicitly abstract", IDENTIFIER_POINTER (raw_name));
3867 /* Create a new decl if DECL is NULL, otherwise fix it */
3868 decl = maybe_create_class_interface_decl (decl, raw_name, q_name, id);
3870 /* Interfaces are always abstract. */
3871 flags |= ACC_ABSTRACT;
3873 /* Inner interfaces are always static. */
3874 if (INNER_CLASS_DECL_P (decl))
3875 flags |= ACC_STATIC;
3877 /* Set super info and mark the class a complete */
3878 set_super_info (ACC_INTERFACE | flags, TREE_TYPE (decl),
3879 object_type_node, ctxp->interface_number);
3880 ctxp->interface_number = 0;
3881 CLASS_COMPLETE_P (decl) = 1;
3882 add_superinterfaces (decl, super);
3884 /* Eventually sets the @deprecated tag flag */
3885 CHECK_DEPRECATED (decl);
3890 /* Patch anonymous class CLASS, by either extending or implementing
3894 patch_anonymous_class (tree type_decl, tree class_decl, tree wfl)
3896 tree class = TREE_TYPE (class_decl);
3897 tree type = TREE_TYPE (type_decl);
3898 tree binfo = TYPE_BINFO (class);
3900 /* If it's an interface, implement it */
3901 if (CLASS_INTERFACE (type_decl))
3903 if (parser_check_super_interface (type_decl, class_decl, wfl))
3906 if (VEC_space (tree, BINFO_BASE_BINFOS (binfo), 1))
3908 /* Extend the binfo - by reallocating and copying it. */
3913 new_binfo = make_tree_binfo ((BINFO_N_BASE_BINFOS (binfo) + 1) * 2);
3914 for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
3915 BINFO_BASE_APPEND (new_binfo, base_binfo);
3916 CLASS_HAS_SUPER_FLAG (new_binfo) = CLASS_HAS_SUPER_FLAG (binfo);
3917 BINFO_VTABLE (new_binfo) = BINFO_VTABLE (binfo);
3918 TYPE_BINFO (class) = new_binfo;
3921 /* And add the interface */
3922 parser_add_interface (class_decl, type_decl, wfl);
3924 /* Otherwise, it's a type we want to extend */
3927 if (parser_check_super (type_decl, class_decl, wfl))
3929 BINFO_TYPE (BINFO_BASE_BINFO (binfo, 0)) = type;
3933 /* Create an anonymous class which extends/implements TYPE_NAME, and return
3937 create_anonymous_class (tree type_name)
3940 tree super = NULL_TREE, itf = NULL_TREE;
3941 tree id, type_decl, class;
3943 /* The unqualified name of the anonymous class. It's just a number. */
3944 sprintf (buffer, "%d", anonymous_class_counter++);
3945 id = build_wfl_node (get_identifier (buffer));
3946 EXPR_WFL_LINECOL (id) = EXPR_WFL_LINECOL (type_name);
3948 /* We know about the type to extend/implement. We go ahead */
3949 if ((type_decl = IDENTIFIER_CLASS_VALUE (EXPR_WFL_NODE (type_name))))
3951 /* Create a class which either implements on extends the designated
3952 class. The class bears an inaccessible name. */
3953 if (CLASS_INTERFACE (type_decl))
3955 /* It's OK to modify it here. It's been already used and
3956 shouldn't be reused */
3957 ctxp->interface_number = 1;
3958 /* Interfaces should presented as a list of WFLs */
3959 itf = build_tree_list (type_name, NULL_TREE);
3965 class = create_class (ACC_FINAL, id, super, itf);
3967 /* We didn't know anything about the stuff. We register a dependence. */
3969 register_incomplete_type (JDEP_ANONYMOUS, type_name, class, NULL_TREE);
3971 ANONYMOUS_CLASS_P (TREE_TYPE (class)) = 1;
3975 /* Create a class in pass1 and return its decl. Return class
3976 interface's decl in pass 2. */
3979 create_class (int flags, tree id, tree super, tree interfaces)
3981 tree raw_name = EXPR_WFL_NODE (id);
3982 tree class_id, decl;
3983 tree super_decl_type;
3985 /* Certain syntax errors are making SUPER be like ID. Avoid this
3987 if (ctxp->class_err && id == super)
3990 class_id = parser_qualified_classname (raw_name);
3991 decl = IDENTIFIER_CLASS_VALUE (class_id);
3992 EXPR_WFL_NODE (id) = class_id;
3994 /* Basic check: scope, redefinition, modifiers */
3995 if (check_class_interface_creation (0, flags, raw_name, class_id, decl, id))
4001 /* Suspend the current parsing context if we're parsing an inner
4002 class or an anonymous class. */
4005 java_parser_context_suspend ();
4006 /* Interface members are public. */
4007 if (CLASS_INTERFACE (GET_CPC ()))
4008 flags |= ACC_PUBLIC;
4011 /* Push a new context for (static) initialized upon declaration fields */
4012 java_parser_context_push_initialized_field ();
4014 /* Class modifier check:
4015 - Allowed modifier (already done at that point)
4016 - abstract AND final forbidden
4017 - Public classes defined in the correct file */
4018 if ((flags & ACC_ABSTRACT) && (flags & ACC_FINAL))
4020 (id, "Class `%s' can't be declared both abstract and final",
4021 IDENTIFIER_POINTER (raw_name));
4023 /* Create a new decl if DECL is NULL, otherwise fix it */
4024 decl = maybe_create_class_interface_decl (decl, raw_name, class_id, id);
4026 /* If SUPER exists, use it, otherwise use Object */
4029 /* java.lang.Object can't extend anything. */
4030 if (TREE_TYPE (IDENTIFIER_CLASS_VALUE (class_id)) == object_type_node)
4032 parse_error_context (id, "`java.lang.Object' can't extend anything");
4037 register_incomplete_type (JDEP_SUPER, super, decl, NULL_TREE);
4039 else if (TREE_TYPE (decl) != object_type_node)
4040 super_decl_type = object_type_node;
4041 /* We're defining java.lang.Object */
4043 super_decl_type = NULL_TREE;
4045 /* A class nested in an interface is implicitly static. */
4046 if (INNER_CLASS_DECL_P (decl)
4047 && CLASS_INTERFACE (TYPE_NAME (TREE_TYPE (DECL_CONTEXT (decl)))))
4049 flags |= ACC_STATIC;
4052 /* Set super info and mark the class as complete. */
4053 set_super_info (flags, TREE_TYPE (decl), super_decl_type,
4054 ctxp->interface_number);
4055 ctxp->interface_number = 0;
4056 CLASS_COMPLETE_P (decl) = 1;
4057 add_superinterfaces (decl, interfaces);
4059 /* TYPE_VFIELD' is a compiler-generated field used to point to
4060 virtual function tables. In gcj, every class has a common base
4061 virtual function table in java.lang.object. */
4062 TYPE_VFIELD (TREE_TYPE (decl)) = TYPE_VFIELD (object_type_node);
4064 /* Add the private this$<n> field, Replicate final locals still in
4065 scope as private final fields mangled like val$<local_name>.
4066 This does not occur for top level (static) inner classes. */
4067 if (PURE_INNER_CLASS_DECL_P (decl))
4068 add_inner_class_fields (decl, current_function_decl);
4070 /* If doing xref, store the location at which the inherited class
4071 (if any) was seen. */
4072 if (flag_emit_xref && super)
4073 DECL_INHERITED_SOURCE_LINE (decl) = EXPR_WFL_LINECOL (super);
4075 /* Eventually sets the @deprecated tag flag */
4076 CHECK_DEPRECATED (decl);
4078 /* Reset the anonymous class counter when declaring non inner classes */
4079 if (!INNER_CLASS_DECL_P (decl))
4080 anonymous_class_counter = 1;
4085 /* End a class declaration: register the statements used to create
4086 finit$ and <clinit>, pop the current class and resume the prior
4087 parser context if necessary. */
4090 end_class_declaration (int resume)
4092 /* If an error occurred, context weren't pushed and won't need to be
4093 popped by a resume. */
4094 int no_error_occurred = ctxp->next && GET_CPC () != error_mark_node;
4096 if (GET_CPC () != error_mark_node)
4097 dump_java_tree (TDI_class, GET_CPC ());
4099 java_parser_context_pop_initialized_field ();
4101 if (resume && no_error_occurred)
4102 java_parser_context_resume ();
4104 /* We're ending a class declaration, this is a good time to reset
4105 the interface cout. Note that might have been already done in
4106 create_interface, but if at that time an inner class was being
4107 dealt with, the interface count was reset in a context created
4108 for the sake of handling inner classes declaration. */
4109 ctxp->interface_number = 0;
4113 add_inner_class_fields (tree class_decl, tree fct_decl)
4115 tree block, marker, f;
4117 f = add_field (TREE_TYPE (class_decl),
4118 build_current_thisn (TREE_TYPE (class_decl)),
4119 build_pointer_type (TREE_TYPE (DECL_CONTEXT (class_decl))),
4121 FIELD_THISN (f) = 1;
4126 for (block = GET_CURRENT_BLOCK (fct_decl);
4127 block && TREE_CODE (block) == BLOCK; block = BLOCK_SUPERCONTEXT (block))
4130 for (decl = BLOCK_EXPR_DECLS (block); decl; decl = TREE_CHAIN (decl))
4133 tree wfl, init, list;
4135 /* Avoid non final arguments. */
4136 if (!LOCAL_FINAL_P (decl))
4139 MANGLE_OUTER_LOCAL_VARIABLE_NAME (name, DECL_NAME (decl));
4140 MANGLE_ALIAS_INITIALIZER_PARAMETER_NAME_ID (pname, DECL_NAME (decl));
4141 wfl = build_wfl_node (name);
4142 init = build_wfl_node (pname);
4143 /* Build an initialization for the field: it will be
4144 initialized by a parameter added to finit$, bearing a
4145 mangled name of the field itself (param$<n>.) The
4146 parameter is provided to finit$ by the constructor
4147 invoking it (hence the constructor will also feature a
4148 hidden parameter, set to the value of the outer context
4149 local at the time the inner class is created.)
4151 Note: we take into account all possible locals that can
4152 be accessed by the inner class. It's actually not trivial
4153 to minimize these aliases down to the ones really
4154 used. One way to do that would be to expand all regular
4155 methods first, then finit$ to get a picture of what's
4156 used. It works with the exception that we would have to
4157 go back on all constructor invoked in regular methods to
4158 have their invocation reworked (to include the right amount
4159 of alias initializer parameters.)
4161 The only real way around, I think, is a first pass to
4162 identify locals really used in the inner class. We leave
4163 the flag FIELD_LOCAL_ALIAS_USED around for that future
4166 On the other hand, it only affect local inner classes,
4167 whose constructors (and finit$ call) will be featuring
4168 unnecessary arguments. It's easy for a developer to keep
4169 this number of parameter down by using the `final'
4170 keyword only when necessary. For the time being, we can
4171 issue a warning on unnecessary finals. FIXME */
4172 init = build_assignment (ASSIGN_TK, EXPR_WFL_LINECOL (wfl),
4175 /* Register the field. The TREE_LIST holding the part
4176 initialized/initializer will be marked ARG_FINAL_P so
4177 that the created field can be marked
4178 FIELD_LOCAL_ALIAS. */
4179 list = build_tree_list (wfl, init);
4180 ARG_FINAL_P (list) = 1;
4181 register_fields (ACC_PRIVATE | ACC_FINAL, TREE_TYPE (decl), list);
4185 if (!CPC_INITIALIZER_STMT (ctxp))
4188 /* If we ever registered an alias field, insert and marker to
4189 remember where the list ends. The second part of the list (the one
4190 featuring initialized fields) so it can be later reversed to
4191 enforce 8.5. The marker will be removed during that operation. */
4192 marker = build_tree_list (NULL_TREE, NULL_TREE);
4193 TREE_CHAIN (marker) = CPC_INITIALIZER_STMT (ctxp);
4194 SET_CPC_INITIALIZER_STMT (ctxp, marker);
4197 /* Can't use lookup_field () since we don't want to load the class and
4198 can't set the CLASS_LOADED_P flag */
4201 find_field (tree class, tree name)
4204 for (decl = TYPE_FIELDS (class); decl; decl = TREE_CHAIN (decl))
4206 if (DECL_NAME (decl) == name)
4212 /* Wrap around lookup_field that doesn't potentially upset the value
4216 lookup_field_wrapper (tree class, tree name)
4219 tree decl = NULL_TREE;
4220 java_parser_context_save_global ();
4222 /* Last chance: if we're within the context of an inner class, we
4223 might be trying to access a local variable defined in an outer
4224 context. We try to look for it now. */
4225 if (INNER_CLASS_TYPE_P (class) && TREE_CODE (name) == IDENTIFIER_NODE)
4228 MANGLE_OUTER_LOCAL_VARIABLE_NAME (new_name, name);
4229 decl = lookup_field (&type, new_name);
4230 if (decl && decl != error_mark_node)
4231 FIELD_LOCAL_ALIAS_USED (decl) = 1;
4233 if (!decl || decl == error_mark_node)
4236 decl = lookup_field (&type, name);
4239 /* If the field still hasn't been found, try the next enclosing context. */
4240 if (!decl && INNER_CLASS_TYPE_P (class))
4242 tree outer_type = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (class)));
4243 decl = lookup_field_wrapper (outer_type, name);
4246 java_parser_context_restore_global ();
4247 return decl == error_mark_node ? NULL : decl;
4250 /* Find duplicate field within the same class declarations and report
4251 the error. Returns 1 if a duplicated field was found, 0
4255 duplicate_declaration_error_p (tree new_field_name, tree new_type, tree cl)
4257 /* This might be modified to work with method decl as well */
4258 tree decl = find_field (TREE_TYPE (GET_CPC ()), new_field_name);
4261 char *t1 = xstrdup (purify_type_name
4262 ((TREE_CODE (new_type) == POINTER_TYPE
4263 && TREE_TYPE (new_type) == NULL_TREE) ?
4264 IDENTIFIER_POINTER (TYPE_NAME (new_type)) :
4265 lang_printable_name (new_type, 1)));
4266 /* The type may not have been completed by the time we report
4268 char *t2 = xstrdup (purify_type_name
4269 ((TREE_CODE (TREE_TYPE (decl)) == POINTER_TYPE
4270 && TREE_TYPE (TREE_TYPE (decl)) == NULL_TREE) ?
4271 IDENTIFIER_POINTER (TYPE_NAME (TREE_TYPE (decl))) :
4272 lang_printable_name (TREE_TYPE (decl), 1)));
4274 (cl , "Duplicate variable declaration: `%s %s' was `%s %s' (%s:%d)",
4275 t1, IDENTIFIER_POINTER (new_field_name),
4276 t2, IDENTIFIER_POINTER (DECL_NAME (decl)),
4277 DECL_SOURCE_FILE (decl), DECL_SOURCE_LINE (decl));
4285 /* Field registration routine. If TYPE doesn't exist, field
4286 declarations are linked to the undefined TYPE dependency list, to
4287 be later resolved in java_complete_class () */
4290 register_fields (int flags, tree type, tree variable_list)
4292 tree current, saved_type;
4293 tree class_type = NULL_TREE;
4294 int saved_lineno = input_line;
4296 tree wfl = NULL_TREE;
4299 class_type = TREE_TYPE (GET_CPC ());
4301 if (!class_type || class_type == error_mark_node)
4304 /* If we're adding fields to interfaces, those fields are public,
4306 if (CLASS_INTERFACE (TYPE_NAME (class_type)))
4308 OBSOLETE_MODIFIER_WARNING (MODIFIER_WFL (PUBLIC_TK),
4309 flags, ACC_PUBLIC, "interface field(s)");
4310 OBSOLETE_MODIFIER_WARNING (MODIFIER_WFL (STATIC_TK),
4311 flags, ACC_STATIC, "interface field(s)");
4312 OBSOLETE_MODIFIER_WARNING (MODIFIER_WFL (FINAL_TK),
4313 flags, ACC_FINAL, "interface field(s)");
4314 check_modifiers ("Illegal interface member modifier `%s'", flags,
4315 INTERFACE_FIELD_MODIFIERS);
4316 flags |= (ACC_PUBLIC | ACC_STATIC | ACC_FINAL);
4319 /* Obtain a suitable type for resolution, if necessary */
4320 SET_TYPE_FOR_RESOLUTION (type, wfl, must_chain);
4322 /* If TYPE is fully resolved and we don't have a reference, make one */
4323 PROMOTE_RECORD_IF_COMPLETE (type, must_chain);
4325 for (current = variable_list, saved_type = type; current;
4326 current = TREE_CHAIN (current), type = saved_type)
4330 tree cl = TREE_PURPOSE (current);
4331 tree init = TREE_VALUE (current);
4332 tree current_name = EXPR_WFL_NODE (cl);
4334 /* Can't declare non-final static fields in inner classes */
4335 if ((flags & ACC_STATIC) && !TOPLEVEL_CLASS_TYPE_P (class_type)
4336 && !(flags & ACC_FINAL))
4338 (cl, "Field `%s' can't be static in inner class `%s' unless it is final",
4339 IDENTIFIER_POINTER (EXPR_WFL_NODE (cl)),
4340 lang_printable_name (class_type, 0));
4342 /* Process NAME, as it may specify extra dimension(s) for it */
4343 type = build_array_from_name (type, wfl, current_name, ¤t_name);
4345 /* Type adjustment. We may have just readjusted TYPE because
4346 the variable specified more dimensions. Make sure we have
4347 a reference if we can and don't have one already. Also
4348 change the name if we have an init. */
4349 if (type != saved_type)
4351 PROMOTE_RECORD_IF_COMPLETE (type, must_chain);
4353 EXPR_WFL_NODE (TREE_OPERAND (init, 0)) = current_name;
4356 real_type = GET_REAL_TYPE (type);
4357 /* Check for redeclarations */
4358 if (duplicate_declaration_error_p (current_name, real_type, cl))
4361 /* Set input_line to the line the field was found and create a
4362 declaration for it. Eventually sets the @deprecated tag flag. */
4364 input_line = EXPR_WFL_LINECOL (cl);
4366 input_line = EXPR_WFL_LINENO (cl);
4367 field_decl = add_field (class_type, current_name, real_type, flags);
4368 CHECK_DEPRECATED_NO_RESET (field_decl);
4370 /* If the field denotes a final instance variable, then we
4371 allocate a LANG_DECL_SPECIFIC part to keep track of its
4372 initialization. We also mark whether the field was
4373 initialized upon its declaration. We don't do that if the
4374 created field is an alias to a final local. */
4375 if (!ARG_FINAL_P (current) && (flags & ACC_FINAL))
4377 MAYBE_CREATE_VAR_LANG_DECL_SPECIFIC (field_decl);
4378 DECL_FIELD_FINAL_WFL (field_decl) = cl;
4381 /* If the couple initializer/initialized is marked ARG_FINAL_P,
4382 we mark the created field FIELD_LOCAL_ALIAS, so that we can
4383 hide parameters to this inner class finit$ and
4384 constructors. It also means that the field isn't final per
4386 if (ARG_FINAL_P (current))
4388 FIELD_LOCAL_ALIAS (field_decl) = 1;
4389 FIELD_FINAL (field_decl) = 0;
4392 /* Check if we must chain. */
4394 register_incomplete_type (JDEP_FIELD, wfl, field_decl, type);
4396 /* If we have an initialization value tied to the field */
4399 /* The field is declared static */
4400 if (flags & ACC_STATIC)
4402 /* We include the field and its initialization part into
4403 a list used to generate <clinit>. After <clinit> is
4404 walked, field initializations will be processed and
4405 fields initialized with known constants will be taken
4406 out of <clinit> and have their DECL_INITIAL set
4408 TREE_CHAIN (init) = CPC_STATIC_INITIALIZER_STMT (ctxp);
4409 SET_CPC_STATIC_INITIALIZER_STMT (ctxp, init);
4410 if (TREE_OPERAND (init, 1)
4411 && TREE_CODE (TREE_OPERAND (init, 1)) == NEW_ARRAY_INIT)
4412 TREE_STATIC (TREE_OPERAND (init, 1)) = 1;
4414 /* A non-static field declared with an immediate initialization is
4415 to be initialized in <init>, if any. This field is remembered
4416 to be processed at the time of the generation of <init>. */
4419 TREE_CHAIN (init) = CPC_INITIALIZER_STMT (ctxp);
4420 SET_CPC_INITIALIZER_STMT (ctxp, init);
4422 MODIFY_EXPR_FROM_INITIALIZATION_P (init) = 1;
4423 DECL_INITIAL (field_decl) = TREE_OPERAND (init, 1);
4428 input_line = saved_lineno;
4431 /* Generate finit$, using the list of initialized fields to populate
4432 its body. finit$'s parameter(s) list is adjusted to include the
4433 one(s) used to initialized the field(s) caching outer context
4437 generate_finit (tree class_type)
4440 tree list = TYPE_FINIT_STMT_LIST (class_type);
4441 tree mdecl, current, parms;
4443 parms = build_alias_initializer_parameter_list (AIPL_FUNCTION_CREATION,
4444 class_type, NULL_TREE,
4446 CRAFTED_PARAM_LIST_FIXUP (parms);
4447 mdecl = create_artificial_method (class_type, ACC_PRIVATE, void_type_node,
4448 finit_identifier_node, parms);
4449 fix_method_argument_names (parms, mdecl);
4450 layout_class_method (class_type, CLASSTYPE_SUPER (class_type),
4452 DECL_FUNCTION_NAP (mdecl) = count;
4453 start_artificial_method_body (mdecl);
4455 for (current = list; current; current = TREE_CHAIN (current))
4456 java_method_add_stmt (mdecl,
4457 build_debugable_stmt (EXPR_WFL_LINECOL (current),
4459 end_artificial_method_body (mdecl);
4463 /* Generate a function to run the instance initialization code. The
4464 private method is called `instinit$'. Unless we're dealing with an
4465 anonymous class, we determine whether all ctors of CLASS_TYPE
4466 declare a checked exception in their `throws' clause in order to
4467 see whether it's necessary to encapsulate the instance initializer
4468 statements in a try/catch/rethrow sequence. */
4471 generate_instinit (tree class_type)
4474 tree compound = NULL_TREE;
4475 tree parms = tree_cons (this_identifier_node,
4476 build_pointer_type (class_type), end_params_node);
4477 tree mdecl = create_artificial_method (class_type, ACC_PRIVATE,
4479 instinit_identifier_node, parms);
4481 layout_class_method (class_type, CLASSTYPE_SUPER (class_type),
4484 /* Gather all the statements in a compound */
4485 for (current = TYPE_II_STMT_LIST (class_type);
4486 current; current = TREE_CHAIN (current))
4487 compound = add_stmt_to_compound (compound, NULL_TREE, current);
4489 /* We need to encapsulate COMPOUND by a try/catch statement to
4490 rethrow exceptions that might occur in the instance initializer.
4491 We do that only if all ctors of CLASS_TYPE are set to catch a
4492 checked exception. This doesn't apply to anonymous classes (since
4493 they don't have declared ctors.) */
4494 if (!ANONYMOUS_CLASS_P (class_type) &&
4495 ctors_unchecked_throws_clause_p (class_type))
4497 compound = encapsulate_with_try_catch (0, exception_type_node, compound,
4498 build1 (THROW_EXPR, NULL_TREE,
4499 build_wfl_node (wpv_id)));
4500 DECL_FUNCTION_THROWS (mdecl) = build_tree_list (NULL_TREE,
4501 exception_type_node);
4504 start_artificial_method_body (mdecl);
4505 java_method_add_stmt (mdecl, compound);
4506 end_artificial_method_body (mdecl);
4513 build_instinit_invocation (tree class_type)
4515 tree to_return = NULL_TREE;
4517 if (TYPE_II_STMT_LIST (class_type))
4519 tree parm = build_tree_list (NULL_TREE,
4520 build_wfl_node (this_identifier_node));
4522 build_method_invocation (build_wfl_node (instinit_identifier_node),
4528 /* Shared across method_declarator and method_header to remember the
4529 patch stage that was reached during the declaration of the method.
4530 A method DECL is built differently is there is no patch
4531 (JDEP_NO_PATCH) or a patch (JDEP_METHOD or JDEP_METHOD_RETURN)
4532 pending on the currently defined method. */
4534 static int patch_stage;
4536 /* Check the method declaration and add the method to its current
4537 class. If the argument list is known to contain incomplete types,
4538 the method is partially added and the registration will be resume
4539 once the method arguments resolved. If TYPE is NULL, we're dealing
4540 with a constructor. */
4543 method_header (int flags, tree type, tree mdecl, tree throws)
4545 tree type_wfl = NULL_TREE;
4546 tree meth_name = NULL_TREE;
4547 tree current, orig_arg, this_class = NULL;
4550 int constructor_ok = 0, must_chain;
4553 if (mdecl == error_mark_node)
4554 return error_mark_node;
4555 meth = TREE_VALUE (mdecl);
4556 id = TREE_PURPOSE (mdecl);
4558 check_modifiers_consistency (flags);
4561 this_class = TREE_TYPE (GET_CPC ());
4563 if (!this_class || this_class == error_mark_node)
4566 /* There are some forbidden modifiers for an abstract method and its
4567 class must be abstract as well. */
4568 if (type && (flags & ACC_ABSTRACT))
4570 ABSTRACT_CHECK (flags, ACC_PRIVATE, id, "Private");
4571 ABSTRACT_CHECK (flags, ACC_STATIC, id, "Static");
4572 ABSTRACT_CHECK (flags, ACC_FINAL, id, "Final");
4573 ABSTRACT_CHECK (flags, ACC_NATIVE, id, "Native");
4574 ABSTRACT_CHECK (flags, ACC_SYNCHRONIZED, id, "Synchronized");
4575 ABSTRACT_CHECK (flags, ACC_STRICT, id, "Strictfp");
4576 if (!CLASS_ABSTRACT (TYPE_NAME (this_class))
4577 && !CLASS_INTERFACE (TYPE_NAME (this_class)))
4579 (id, "Class `%s' must be declared abstract to define abstract method `%s'",
4580 IDENTIFIER_POINTER (DECL_NAME (GET_CPC ())),
4581 IDENTIFIER_POINTER (EXPR_WFL_NODE (id)));
4584 /* A native method can't be strictfp. */
4585 if ((flags & ACC_NATIVE) && (flags & ACC_STRICT))
4586 parse_error_context (id, "native method `%s' can't be strictfp",
4587 IDENTIFIER_POINTER (EXPR_WFL_NODE (id)));
4588 /* No such thing as a transient or volatile method. */
4589 if ((flags & ACC_TRANSIENT))
4590 parse_error_context (id, "method `%s' can't be transient",
4591 IDENTIFIER_POINTER (EXPR_WFL_NODE (id)));
4592 if ((flags & ACC_VOLATILE))
4593 parse_error_context (id, "method `%s' can't be volatile",
4594 IDENTIFIER_POINTER (EXPR_WFL_NODE (id)));
4596 /* Things to be checked when declaring a constructor */
4599 int ec = java_error_count;
4600 /* 8.6: Constructor declarations: we might be trying to define a
4601 method without specifying a return type. */
4602 if (EXPR_WFL_NODE (id) != GET_CPC_UN ())
4604 (id, "Invalid method declaration, return type required");
4605 /* 8.6.3: Constructor modifiers */
4608 JCONSTRUCTOR_CHECK (flags, ACC_ABSTRACT, id, "abstract");
4609 JCONSTRUCTOR_CHECK (flags, ACC_STATIC, id, "static");
4610 JCONSTRUCTOR_CHECK (flags, ACC_FINAL, id, "final");
4611 JCONSTRUCTOR_CHECK (flags, ACC_NATIVE, id, "native");
4612 JCONSTRUCTOR_CHECK (flags, ACC_SYNCHRONIZED, id, "synchronized");
4613 JCONSTRUCTOR_CHECK (flags, ACC_STRICT, id, "strictfp");
4615 /* If we found error here, we don't consider it's OK to tread
4616 the method definition as a constructor, for the rest of this
4618 if (ec == java_error_count)
4622 /* Method declared within the scope of an interface are implicitly
4623 abstract and public. Conflicts with other erroneously provided
4624 modifiers are checked right after. */
4626 if (CLASS_INTERFACE (TYPE_NAME (this_class)))
4628 /* If FLAGS isn't set because of a modifier, turn the
4629 corresponding modifier WFL to NULL so we issue a warning on
4630 the obsolete use of the modifier */
4631 if (!(flags & ACC_PUBLIC))
4632 MODIFIER_WFL (PUBLIC_TK) = NULL;
4633 if (!(flags & ACC_ABSTRACT))
4634 MODIFIER_WFL (ABSTRACT_TK) = NULL;
4635 flags |= ACC_PUBLIC;
4636 flags |= ACC_ABSTRACT;
4639 /* Inner class can't declare static methods */
4640 if ((flags & ACC_STATIC) && !TOPLEVEL_CLASS_TYPE_P (this_class))
4643 (id, "Method `%s' can't be static in inner class `%s'. Only members of interfaces and top-level classes can be static",
4644 IDENTIFIER_POINTER (EXPR_WFL_NODE (id)),
4645 lang_printable_name (this_class, 0));
4648 /* Modifiers context reset moved up, so abstract method declaration
4649 modifiers can be later checked. */
4651 /* Set constructor returned type to void and method name to <init>,
4652 unless we found an error identifier the constructor (in which
4653 case we retain the original name) */
4656 type = void_type_node;
4658 meth_name = init_identifier_node;
4661 meth_name = EXPR_WFL_NODE (id);
4663 /* Do the returned type resolution and registration if necessary */
4664 SET_TYPE_FOR_RESOLUTION (type, type_wfl, must_chain);
4667 type = build_array_from_name (type, type_wfl, meth_name, &meth_name);
4668 EXPR_WFL_NODE (id) = meth_name;
4669 PROMOTE_RECORD_IF_COMPLETE (type, must_chain);
4673 patch_stage = JDEP_METHOD_RETURN;
4674 register_incomplete_type (patch_stage, type_wfl, id, type);
4675 TREE_TYPE (meth) = GET_REAL_TYPE (type);
4678 TREE_TYPE (meth) = type;
4680 saved_lineno = input_line;
4681 /* When defining an abstract or interface method, the curly
4682 bracket at level 1 doesn't exist because there is no function
4684 input_line = (ctxp->first_ccb_indent1 ? ctxp->first_ccb_indent1 :
4685 EXPR_WFL_LINENO (id));
4687 /* Remember the original argument list */
4688 orig_arg = TYPE_ARG_TYPES (meth);
4690 if (patch_stage) /* includes ret type and/or all args */
4693 meth = add_method_1 (this_class, flags, meth_name, meth);
4694 /* Patch for the return type */
4695 if (patch_stage == JDEP_METHOD_RETURN)
4697 jdep = CLASSD_LAST (ctxp->classd_list);
4698 JDEP_GET_PATCH (jdep) = &TREE_TYPE (TREE_TYPE (meth));
4700 /* This is the stop JDEP. METH allows the function's signature
4702 register_incomplete_type (JDEP_METHOD_END, NULL_TREE, meth, NULL_TREE);
4705 meth = add_method (this_class, flags, meth_name,
4706 build_java_signature (meth));
4708 /* Remember final parameters */
4709 MARK_FINAL_PARMS (meth, orig_arg);
4711 /* Fix the method argument list so we have the argument name
4713 fix_method_argument_names (orig_arg, meth);
4715 /* Register the parameter number and re-install the current line
4717 DECL_MAX_LOCALS (meth) = ctxp->formal_parameter_number+1;
4718 input_line = saved_lineno;
4720 /* Register exception specified by the `throws' keyword for
4721 resolution and set the method decl appropriate field to the list.
4722 Note: the grammar ensures that what we get here are class
4726 throws = nreverse (throws);
4727 for (current = throws; current; current = TREE_CHAIN (current))
4729 register_incomplete_type (JDEP_EXCEPTION, TREE_VALUE (current),
4730 NULL_TREE, NULL_TREE);
4731 JDEP_GET_PATCH (CLASSD_LAST (ctxp->classd_list)) =
4732 &TREE_VALUE (current);
4734 DECL_FUNCTION_THROWS (meth) = throws;
4737 if (TREE_TYPE (GET_CPC ()) != object_type_node)
4738 DECL_FUNCTION_WFL (meth) = id;
4740 /* Set the flag if we correctly processed a constructor */
4743 DECL_CONSTRUCTOR_P (meth) = 1;
4744 /* Compute and store the number of artificial parameters declared
4745 for this constructor */
4746 for (count = 0, current = TYPE_FIELDS (this_class); current;
4747 current = TREE_CHAIN (current))
4748 if (FIELD_LOCAL_ALIAS (current))
4750 DECL_FUNCTION_NAP (meth) = count;
4753 /* Eventually set the @deprecated tag flag */
4754 CHECK_DEPRECATED (meth);
4756 /* If doing xref, store column and line number information instead
4757 of the line number only. */
4759 DECL_SOURCE_LINE (meth) = EXPR_WFL_LINECOL (id);
4765 fix_method_argument_names (tree orig_arg, tree meth)
4767 tree arg = TYPE_ARG_TYPES (TREE_TYPE (meth));
4768 if (TREE_CODE (TREE_TYPE (meth)) == METHOD_TYPE)
4770 TREE_PURPOSE (arg) = this_identifier_node;
4771 arg = TREE_CHAIN (arg);
4773 while (orig_arg != end_params_node)
4775 TREE_PURPOSE (arg) = TREE_PURPOSE (orig_arg);
4776 orig_arg = TREE_CHAIN (orig_arg);
4777 arg = TREE_CHAIN (arg);
4781 /* Complete the method declaration with METHOD_BODY. */
4784 finish_method_declaration (tree method_body)
4788 if (!current_function_decl)
4791 flags = get_access_flags_from_decl (current_function_decl);
4793 /* 8.4.5 Method Body */
4794 if ((flags & ACC_ABSTRACT || flags & ACC_NATIVE) && method_body)
4796 tree name = DECL_NAME (current_function_decl);
4797 parse_error_context (DECL_FUNCTION_WFL (current_function_decl),
4798 "%s method `%s' can't have a body defined",
4799 (METHOD_NATIVE (current_function_decl) ?
4800 "Native" : "Abstract"),
4801 IDENTIFIER_POINTER (name));
4802 method_body = NULL_TREE;
4804 else if (!(flags & ACC_ABSTRACT) && !(flags & ACC_NATIVE) && !method_body)
4806 tree name = DECL_NAME (current_function_decl);
4808 (DECL_FUNCTION_WFL (current_function_decl),
4809 "Non native and non abstract method `%s' must have a body defined",
4810 IDENTIFIER_POINTER (name));
4811 method_body = NULL_TREE;
4814 if (flag_emit_class_files && method_body
4815 && TREE_CODE (method_body) == NOP_EXPR
4816 && TREE_TYPE (current_function_decl)
4817 && TREE_TYPE (TREE_TYPE (current_function_decl)) == void_type_node)
4818 method_body = build1 (RETURN_EXPR, void_type_node, NULL);
4820 BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (current_function_decl)) = method_body;
4821 maybe_absorb_scoping_blocks ();
4822 /* Exit function's body */
4824 /* Merge last line of the function with first line, directly in the
4825 function decl. It will be used to emit correct debug info. */
4826 if (!flag_emit_xref)
4827 DECL_FUNCTION_LAST_LINE (current_function_decl) = ctxp->last_ccb_indent1;
4829 /* Since function's argument's list are shared, reset the
4830 ARG_FINAL_P parameter that might have been set on some of this
4831 function parameters. */
4832 UNMARK_FINAL_PARMS (current_function_decl);
4834 /* So we don't have an irrelevant function declaration context for
4835 the next static block we'll see. */
4836 current_function_decl = NULL_TREE;
4839 /* Build a an error message for constructor circularity errors. */
4842 constructor_circularity_msg (tree from, tree to)
4844 static char string [4096];
4845 char *t = xstrdup (lang_printable_name (from, 0));
4846 sprintf (string, "`%s' invokes `%s'", t, lang_printable_name (to, 0));
4851 /* Verify a circular call to METH. Return 1 if an error is found, 0
4854 static GTY(()) tree vcc_list;
4856 verify_constructor_circularity (tree meth, tree current)
4860 for (c = DECL_CONSTRUCTOR_CALLS (current); c; c = TREE_CHAIN (c))
4862 if (TREE_VALUE (c) == meth)
4868 vcc_list = nreverse (vcc_list);
4869 for (liste = vcc_list; liste; liste = TREE_CHAIN (liste))
4872 (TREE_PURPOSE (TREE_PURPOSE (liste)), "%s",
4873 constructor_circularity_msg
4874 (TREE_VALUE (liste), TREE_VALUE (TREE_PURPOSE (liste))));
4878 t = xstrdup (lang_printable_name (meth, 0));
4879 parse_error_context (TREE_PURPOSE (c),
4880 "%s: recursive invocation of constructor `%s'",
4881 constructor_circularity_msg (current, meth), t);
4883 vcc_list = NULL_TREE;
4887 for (c = DECL_CONSTRUCTOR_CALLS (current); c; c = TREE_CHAIN (c))
4889 vcc_list = tree_cons (c, current, vcc_list);
4890 if (verify_constructor_circularity (meth, TREE_VALUE (c)))
4892 vcc_list = TREE_CHAIN (vcc_list);
4897 /* Check modifiers that can be declared but exclusively */
4900 check_modifiers_consistency (int flags)
4903 tree cl = NULL_TREE;
4905 THIS_MODIFIER_ONLY (flags, ACC_PUBLIC, PUBLIC_TK, acc_count, cl);
4906 THIS_MODIFIER_ONLY (flags, ACC_PRIVATE, PRIVATE_TK, acc_count, cl);
4907 THIS_MODIFIER_ONLY (flags, ACC_PROTECTED, PROTECTED_TK, acc_count, cl);
4910 (cl, "Inconsistent member declaration. At most one of `public', `private', or `protected' may be specified");
4914 THIS_MODIFIER_ONLY (flags, ACC_FINAL, FINAL_TK, acc_count, cl);
4915 THIS_MODIFIER_ONLY (flags, ACC_VOLATILE, VOLATILE_TK, acc_count, cl);
4917 parse_error_context (cl,
4918 "Inconsistent member declaration. At most one of `final' or `volatile' may be specified");
4921 /* Check the methode header METH for abstract specifics features */
4924 check_abstract_method_header (tree meth)
4926 int flags = get_access_flags_from_decl (meth);
4928 OBSOLETE_MODIFIER_WARNING2 (MODIFIER_WFL (ABSTRACT_TK), flags,
4929 ACC_ABSTRACT, "abstract method",
4930 IDENTIFIER_POINTER (DECL_NAME (meth)));
4931 OBSOLETE_MODIFIER_WARNING2 (MODIFIER_WFL (PUBLIC_TK), flags,
4932 ACC_PUBLIC, "abstract method",
4933 IDENTIFIER_POINTER (DECL_NAME (meth)));
4935 check_modifiers ("Illegal modifier `%s' for interface method",
4936 flags, INTERFACE_METHOD_MODIFIERS);
4939 /* Create a FUNCTION_TYPE node and start augmenting it with the
4940 declared function arguments. Arguments type that can't be resolved
4941 are left as they are, but the returned node is marked as containing
4942 incomplete types. */
4945 method_declarator (tree id, tree list)
4947 tree arg_types = NULL_TREE, current, node;
4948 tree meth = make_node (FUNCTION_TYPE);
4951 patch_stage = JDEP_NO_PATCH;
4953 if (GET_CPC () == error_mark_node)
4954 return error_mark_node;
4956 /* If we're dealing with an inner class constructor, we hide the
4957 this$<n> decl in the name field of its parameter declaration. We
4958 also might have to hide the outer context local alias
4959 initializers. Not done when the class is a toplevel class. */
4960 if (PURE_INNER_CLASS_DECL_P (GET_CPC ())
4961 && EXPR_WFL_NODE (id) == GET_CPC_UN ())
4963 tree aliases_list, type, thisn;
4964 /* First the aliases, linked to the regular parameters */
4966 build_alias_initializer_parameter_list (AIPL_FUNCTION_DECLARATION,
4967 TREE_TYPE (GET_CPC ()),
4969 list = chainon (nreverse (aliases_list), list);
4972 type = TREE_TYPE (DECL_CONTEXT (GET_CPC ()));
4973 thisn = build_current_thisn (TREE_TYPE (GET_CPC ()));
4974 list = tree_cons (build_wfl_node (thisn), build_pointer_type (type),
4978 for (current = list; current; current = TREE_CHAIN (current))
4981 tree wfl_name = TREE_PURPOSE (current);
4982 tree type = TREE_VALUE (current);
4983 tree name = EXPR_WFL_NODE (wfl_name);
4984 tree already, arg_node;
4985 tree type_wfl = NULL_TREE;
4988 /* Obtain a suitable type for resolution, if necessary */
4989 SET_TYPE_FOR_RESOLUTION (type, type_wfl, must_chain);
4991 /* Process NAME, as it may specify extra dimension(s) for it */
4992 type = build_array_from_name (type, type_wfl, name, &name);
4993 EXPR_WFL_NODE (wfl_name) = name;
4995 real_type = GET_REAL_TYPE (type);
4996 if (TREE_CODE (real_type) == RECORD_TYPE)
4998 real_type = promote_type (real_type);
4999 if (TREE_CODE (type) == TREE_LIST)
5000 TREE_PURPOSE (type) = real_type;
5003 /* Check redefinition */
5004 for (already = arg_types; already; already = TREE_CHAIN (already))
5005 if (TREE_PURPOSE (already) == name)
5008 (wfl_name, "Variable `%s' is used more than once in the argument list of method `%s'",
5009 IDENTIFIER_POINTER (name),
5010 IDENTIFIER_POINTER (EXPR_WFL_NODE (id)));
5014 /* If we've an incomplete argument type, we know there is a location
5015 to patch when the type get resolved, later. */
5019 patch_stage = JDEP_METHOD;
5020 type = register_incomplete_type (patch_stage,
5021 type_wfl, wfl_name, type);
5022 jdep = CLASSD_LAST (ctxp->classd_list);
5023 JDEP_MISC (jdep) = id;
5026 /* The argument node: a name and a (possibly) incomplete type. */
5027 arg_node = build_tree_list (name, real_type);
5028 /* Remember arguments declared final. */
5029 ARG_FINAL_P (arg_node) = ARG_FINAL_P (current);
5032 JDEP_GET_PATCH (jdep) = &TREE_VALUE (arg_node);
5033 TREE_CHAIN (arg_node) = arg_types;
5034 arg_types = arg_node;
5036 TYPE_ARG_TYPES (meth) = chainon (nreverse (arg_types), end_params_node);
5037 node = build_tree_list (id, meth);
5042 unresolved_type_p (tree wfl, tree *returned)
5044 if (TREE_CODE (wfl) == EXPR_WITH_FILE_LOCATION)
5048 tree decl = IDENTIFIER_CLASS_VALUE (EXPR_WFL_NODE (wfl));
5049 if (decl && current_class && (decl == TYPE_NAME (current_class)))
5050 *returned = TREE_TYPE (decl);
5051 else if (GET_CPC_UN () == EXPR_WFL_NODE (wfl))
5052 *returned = TREE_TYPE (GET_CPC ());
5054 *returned = NULL_TREE;
5063 /* From NAME, build a qualified identifier node using the
5064 qualification from the current package definition. */
5067 parser_qualified_classname (tree name)
5069 tree nested_class_name;
5071 if ((nested_class_name = maybe_make_nested_class_name (name)))
5072 return nested_class_name;
5075 return merge_qualified_name (ctxp->package, name);
5080 /* Called once the type a interface extends is resolved. Returns 0 if
5081 everything is OK. */
5084 parser_check_super_interface (tree super_decl, tree this_decl, tree this_wfl)
5086 tree super_type = TREE_TYPE (super_decl);
5088 /* Has to be an interface */
5089 if (!CLASS_INTERFACE (super_decl))
5092 (this_wfl, "%s `%s' can't implement/extend %s `%s'",
5093 (CLASS_INTERFACE (TYPE_NAME (TREE_TYPE (this_decl))) ?
5094 "Interface" : "Class"),
5095 IDENTIFIER_POINTER (DECL_NAME (this_decl)),
5096 (TYPE_ARRAY_P (super_type) ? "array" : "class"),
5097 IDENTIFIER_POINTER (DECL_NAME (super_decl)));
5101 /* Check top-level interface access. Inner classes are subject to member
5102 access rules (6.6.1). */
5103 if (! INNER_CLASS_P (super_type)
5104 && check_pkg_class_access (DECL_NAME (super_decl),
5105 NULL_TREE, true, this_decl))
5108 SOURCE_FRONTEND_DEBUG (("Completing interface %s with %s",
5109 IDENTIFIER_POINTER (DECL_NAME (this_decl)),
5110 IDENTIFIER_POINTER (DECL_NAME (super_decl))));
5114 /* Makes sure that SUPER_DECL is suitable to extend THIS_DECL. Returns
5115 0 if everything is OK. */
5118 parser_check_super (tree super_decl, tree this_decl, tree wfl)
5120 tree super_type = TREE_TYPE (super_decl);
5122 /* SUPER should be a CLASS (neither an array nor an interface) */
5123 if (TYPE_ARRAY_P (super_type) || CLASS_INTERFACE (TYPE_NAME (super_type)))
5126 (wfl, "Class `%s' can't subclass %s `%s'",
5127 IDENTIFIER_POINTER (DECL_NAME (this_decl)),
5128 (CLASS_INTERFACE (TYPE_NAME (super_type)) ? "interface" : "array"),
5129 IDENTIFIER_POINTER (DECL_NAME (super_decl)));
5133 if (CLASS_FINAL (TYPE_NAME (super_type)))
5135 parse_error_context (wfl, "Can't subclass final classes: %s",
5136 IDENTIFIER_POINTER (DECL_NAME (super_decl)));
5140 /* Check top-level class scope. Inner classes are subject to member access
5142 if (! INNER_CLASS_P (super_type)
5143 && (check_pkg_class_access (DECL_NAME (super_decl), wfl, true, NULL_TREE)))
5146 SOURCE_FRONTEND_DEBUG (("Completing class %s with %s",
5147 IDENTIFIER_POINTER (DECL_NAME (this_decl)),
5148 IDENTIFIER_POINTER (DECL_NAME (super_decl))));
5152 /* Create a new dependency list and link it (in a LIFO manner) to the
5153 CTXP list of type dependency list. */
5156 create_jdep_list (struct parser_ctxt *ctxp)
5158 jdeplist *new = xmalloc (sizeof (jdeplist));
5159 new->first = new->last = NULL;
5160 new->next = ctxp->classd_list;
5161 ctxp->classd_list = new;
5165 reverse_jdep_list (struct parser_ctxt *ctxp)
5167 jdeplist *prev = NULL, *current, *next;
5168 for (current = ctxp->classd_list; current; current = next)
5170 next = current->next;
5171 current->next = prev;
5177 /* Create a fake pointer based on the ID stored in
5178 TYPE_NAME. TYPE_NAME can be a WFL or a incomplete type asking to be
5179 registered again. */
5182 obtain_incomplete_type (tree type_name)
5184 tree ptr = NULL_TREE, name;
5186 if (TREE_CODE (type_name) == EXPR_WITH_FILE_LOCATION)
5187 name = EXPR_WFL_NODE (type_name);
5188 else if (INCOMPLETE_TYPE_P (type_name))
5189 name = TYPE_NAME (type_name);
5193 /* Workaround from build_pointer_type for incomplete types. */
5194 BUILD_PTR_FROM_NAME (ptr, name);
5195 TYPE_MODE (ptr) = ptr_mode;
5201 /* Register a incomplete type whose name is WFL. Reuse PTR if PTR is
5202 non NULL instead of computing a new fake type based on WFL. The new
5203 dependency is inserted in the current type dependency list, in FIFO
5207 register_incomplete_type (int kind, tree wfl, tree decl, tree ptr)
5209 jdep *new = xmalloc (sizeof (jdep));
5211 if (!ptr && kind != JDEP_METHOD_END) /* JDEP_METHOD_END is a mere marker */
5212 ptr = obtain_incomplete_type (wfl);
5214 JDEP_KIND (new) = kind;
5215 JDEP_DECL (new) = decl;
5216 JDEP_TO_RESOLVE (new) = ptr;
5217 JDEP_WFL (new) = wfl;
5218 JDEP_CHAIN (new) = NULL;
5219 JDEP_MISC (new) = NULL_TREE;
5220 /* For some dependencies, set the enclosing class of the current
5221 class to be the enclosing context */
5222 if ((kind == JDEP_INTERFACE || kind == JDEP_ANONYMOUS || kind == JDEP_SUPER)
5223 && GET_ENCLOSING_CPC ())
5224 JDEP_ENCLOSING (new) = TREE_VALUE (GET_ENCLOSING_CPC ());
5226 JDEP_ENCLOSING (new) = GET_CPC ();
5227 JDEP_GET_PATCH (new) = (tree *)NULL;
5229 JDEP_INSERT (ctxp->classd_list, new);
5234 /* This checks for circular references with innerclasses. We start
5235 from SOURCE and should never reach TARGET. Extended/implemented
5236 types in SOURCE have their enclosing context checked not to reach
5237 TARGET. When the last enclosing context of SOURCE is reached, its
5238 extended/implemented types are also checked not to reach TARGET.
5239 In case of error, WFL of the offending type is returned; NULL_TREE
5243 check_inner_circular_reference (tree source, tree target)
5249 for (i = 0; BINFO_BASE_ITERATE (TYPE_BINFO (source), i, base_binfo); i++)
5253 /* We can end up with a NULL_TREE or an incomplete type here if
5254 we encountered previous type resolution errors. It's safe to
5255 simply ignore these cases. */
5256 su = BINFO_TYPE (base_binfo);
5257 if (INCOMPLETE_TYPE_P (su))
5260 if (inherits_from_p (su, target))
5261 return lookup_cl (TYPE_NAME (su));
5263 for (ctx = DECL_CONTEXT (TYPE_NAME (su)); ctx; ctx = DECL_CONTEXT (ctx))
5265 /* An enclosing context shouldn't be TARGET */
5266 if (ctx == TYPE_NAME (target))
5267 return lookup_cl (TYPE_NAME (su));
5269 /* When we reach the enclosing last context, start a check
5270 on it, with the same target */
5271 if (! DECL_CONTEXT (ctx) &&
5272 (cl = check_inner_circular_reference (TREE_TYPE (ctx), target)))
5279 /* Explore TYPE's `extends' clause member(s) and return the WFL of the
5280 offending type if a circularity is detected. NULL_TREE is returned
5281 otherwise. TYPE can be an interface or a class. */
5284 check_circular_reference (tree type)
5289 if (!BINFO_N_BASE_BINFOS (TYPE_BINFO (type)))
5292 if (! CLASS_INTERFACE (TYPE_NAME (type)))
5294 if (inherits_from_p (CLASSTYPE_SUPER (type), type))
5295 return lookup_cl (TYPE_NAME (type));
5299 for (i = 0; BINFO_BASE_ITERATE (TYPE_BINFO (type), i, base_binfo); i++)
5301 if (BINFO_TYPE (base_binfo) != object_type_node
5302 && interface_of_p (type, BINFO_TYPE (base_binfo)))
5303 return lookup_cl (TYPE_NAME (BINFO_TYPE (base_binfo)));
5309 java_check_circular_reference (void)
5312 for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
5314 tree type = TREE_TYPE (current);
5317 cl = check_circular_reference (type);
5319 cl = check_inner_circular_reference (type, type);
5321 parse_error_context (cl, "Cyclic class inheritance%s",
5322 (cyclic_inheritance_report ?
5323 cyclic_inheritance_report : ""));
5327 /* Augment the parameter list PARM with parameters crafted to
5328 initialize outer context locals aliases. Through ARTIFICIAL, a
5329 count is kept of the number of crafted parameters. MODE governs
5330 what eventually gets created: something suitable for a function
5331 creation or a function invocation, either the constructor or
5335 build_alias_initializer_parameter_list (int mode, tree class_type, tree parm,
5339 tree additional_parms = NULL_TREE;
5341 for (field = TYPE_FIELDS (class_type); field; field = TREE_CHAIN (field))
5342 if (FIELD_LOCAL_ALIAS (field))
5344 const char *buffer = IDENTIFIER_POINTER (DECL_NAME (field));
5345 tree purpose = NULL_TREE, value = NULL_TREE, name = NULL_TREE;
5350 case AIPL_FUNCTION_DECLARATION:
5351 MANGLE_ALIAS_INITIALIZER_PARAMETER_NAME_STR (mangled_id,
5353 purpose = build_wfl_node (mangled_id);
5354 if (TREE_CODE (TREE_TYPE (field)) == POINTER_TYPE)
5355 value = build_wfl_node (TYPE_NAME (TREE_TYPE (field)));
5357 value = TREE_TYPE (field);
5360 case AIPL_FUNCTION_CREATION:
5361 MANGLE_ALIAS_INITIALIZER_PARAMETER_NAME_STR (purpose,
5363 value = TREE_TYPE (field);
5366 case AIPL_FUNCTION_FINIT_INVOCATION:
5367 MANGLE_ALIAS_INITIALIZER_PARAMETER_NAME_STR (mangled_id,
5369 /* Now, this is wrong. purpose should always be the NAME
5370 of something and value its matching value (decl, type,
5371 etc...) FIXME -- but there is a lot to fix. */
5373 /* When invoked for this kind of operation, we already
5374 know whether a field is used or not. */
5375 purpose = TREE_TYPE (field);
5376 value = build_wfl_node (mangled_id);
5379 case AIPL_FUNCTION_CTOR_INVOCATION:
5380 /* There are two case: the constructor invocation happens
5381 outside the local inner, in which case, locales from the outer
5382 context are directly used.
5384 Otherwise, we fold to using the alias directly. */
5385 if (class_type == current_class)
5389 name = get_identifier (&buffer[4]);
5390 value = IDENTIFIER_LOCAL_VALUE (name);
5394 additional_parms = tree_cons (purpose, value, additional_parms);
5398 if (additional_parms)
5400 if (ANONYMOUS_CLASS_P (class_type)
5401 && mode == AIPL_FUNCTION_CTOR_INVOCATION)
5402 additional_parms = nreverse (additional_parms);
5403 parm = chainon (additional_parms, parm);
5409 /* Craft a constructor for CLASS_DECL -- what we should do when none
5410 where found. ARGS is non NULL when a special signature must be
5411 enforced. This is the case for anonymous classes. */
5414 craft_constructor (tree class_decl, tree args)
5416 tree class_type = TREE_TYPE (class_decl);
5417 tree parm = NULL_TREE;
5418 /* Inherit access flags for the constructor from its enclosing class. */
5419 int valid_ctor_flags = ACC_PUBLIC | ACC_PROTECTED | ACC_PRIVATE;
5420 int flags = (get_access_flags_from_decl (class_decl) & valid_ctor_flags);
5421 int i = 0, artificial = 0;
5422 tree decl, ctor_name;
5425 /* The constructor name is <init> unless we're dealing with an
5426 anonymous class, in which case the name will be fixed after having
5428 if (ANONYMOUS_CLASS_P (class_type))
5429 ctor_name = DECL_NAME (class_decl);
5431 ctor_name = init_identifier_node;
5433 /* If we're dealing with an inner class constructor, we hide the
5434 this$<n> decl in the name field of its parameter declaration. */
5435 if (PURE_INNER_CLASS_TYPE_P (class_type))
5437 tree type = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (class_type)));
5438 parm = tree_cons (build_current_thisn (class_type),
5439 build_pointer_type (type), parm);
5441 /* Some more arguments to be hidden here. The values of the local
5442 variables of the outer context that the inner class needs to see. */
5443 parm = build_alias_initializer_parameter_list (AIPL_FUNCTION_CREATION,
5448 /* Then if there are any args to be enforced, enforce them now */
5449 for (; args && args != end_params_node; args = TREE_CHAIN (args))
5451 sprintf (buffer, "parm%d", i++);
5452 parm = tree_cons (get_identifier (buffer), TREE_VALUE (args), parm);
5455 CRAFTED_PARAM_LIST_FIXUP (parm);
5456 decl = create_artificial_method (class_type, flags, void_type_node,
5458 fix_method_argument_names (parm, decl);
5459 /* Now, mark the artificial parameters. */
5460 DECL_FUNCTION_NAP (decl) = artificial;
5461 DECL_FUNCTION_SYNTHETIC_CTOR (decl) = DECL_CONSTRUCTOR_P (decl) = 1;
5462 DECL_INLINE (decl) = 1;
5467 /* Fix the constructors. This will be called right after circular
5468 references have been checked. It is necessary to fix constructors
5469 early even if no code generation will take place for that class:
5470 some generated constructor might be required by the class whose
5471 compilation triggered this one to be simply loaded. */
5474 java_fix_constructors (void)
5478 for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
5480 tree class_type = TREE_TYPE (current);
5484 if (CLASS_INTERFACE (TYPE_NAME (class_type)))
5487 output_class = current_class = class_type;
5488 for (decl = TYPE_METHODS (class_type); decl; decl = TREE_CHAIN (decl))
5490 if (DECL_CONSTRUCTOR_P (decl))
5492 fix_constructors (decl);
5497 /* Anonymous class constructor can't be generated that early. */
5498 if (!saw_ctor && !ANONYMOUS_CLASS_P (class_type))
5499 craft_constructor (current, NULL_TREE);
5503 /* safe_layout_class just makes sure that we can load a class without
5504 disrupting the current_class, input_file, input_line, etc, information
5505 about the class processed currently. */
5508 safe_layout_class (tree class)
5510 tree save_current_class = current_class;
5511 location_t save_location = input_location;
5513 layout_class (class);
5515 current_class = save_current_class;
5516 input_location = save_location;
5520 jdep_resolve_class (jdep *dep)
5524 if (JDEP_RESOLVED_P (dep))
5525 decl = JDEP_RESOLVED_DECL (dep);
5528 decl = resolve_class (JDEP_ENCLOSING (dep), JDEP_TO_RESOLVE (dep),
5529 JDEP_DECL (dep), JDEP_WFL (dep));
5530 JDEP_RESOLVED (dep, decl);
5531 /* If there is no WFL, that's ok. We generate this warning
5533 if (decl && JDEP_WFL (dep) != NULL_TREE)
5534 check_deprecation (JDEP_WFL (dep), decl);
5538 complete_class_report_errors (dep);
5539 else if (INNER_CLASS_DECL_P (decl))
5541 tree inner = TREE_TYPE (decl);
5542 if (! CLASS_LOADED_P (inner))
5544 safe_layout_class (inner);
5545 if (TYPE_SIZE (inner) == error_mark_node)
5546 TYPE_SIZE (inner) = NULL_TREE;
5548 check_inner_class_access (decl, JDEP_ENCLOSING (dep), JDEP_WFL (dep));
5553 /* Complete unsatisfied class declaration and their dependencies */
5556 java_complete_class (void)
5563 /* Process imports */
5566 /* Reverse things so we have the right order */
5567 ctxp->class_list = nreverse (ctxp->class_list);
5568 ctxp->classd_list = reverse_jdep_list (ctxp);
5570 for (cclassd = ctxp->classd_list, cclass = ctxp->class_list;
5572 cclass = TREE_CHAIN (cclass), cclassd = CLASSD_CHAIN (cclassd))
5576 /* We keep the compilation unit imports in the class so that
5577 they can be used later to resolve type dependencies that
5578 aren't necessary to solve now. */
5579 TYPE_IMPORT_LIST (TREE_TYPE (cclass)) = ctxp->import_list;
5580 TYPE_IMPORT_DEMAND_LIST (TREE_TYPE (cclass)) = ctxp->import_demand_list;
5582 for (dep = CLASSD_FIRST (cclassd); dep; dep = JDEP_CHAIN (dep))
5585 if (!(decl = jdep_resolve_class (dep)))
5588 /* Now it's time to patch */
5589 switch (JDEP_KIND (dep))
5592 /* Simply patch super */
5593 if (parser_check_super (decl, JDEP_DECL (dep), JDEP_WFL (dep)))
5595 BINFO_TYPE (BINFO_BASE_BINFO
5596 (TYPE_BINFO (TREE_TYPE (JDEP_DECL (dep))), 0))
5602 /* We do part of the job done in add_field */
5603 tree field_decl = JDEP_DECL (dep);
5604 tree field_type = TREE_TYPE (decl);
5605 if (TREE_CODE (field_type) == RECORD_TYPE)
5606 field_type = promote_type (field_type);
5607 TREE_TYPE (field_decl) = field_type;
5608 DECL_ALIGN (field_decl) = 0;
5609 DECL_USER_ALIGN (field_decl) = 0;
5610 layout_decl (field_decl, 0);
5611 SOURCE_FRONTEND_DEBUG
5612 (("Completed field/var decl `%s' with `%s'",
5613 IDENTIFIER_POINTER (DECL_NAME (field_decl)),
5614 IDENTIFIER_POINTER (DECL_NAME (decl))));
5617 case JDEP_METHOD: /* We start patching a method */
5618 case JDEP_METHOD_RETURN:
5624 type = TREE_TYPE(decl);
5625 if (TREE_CODE (type) == RECORD_TYPE)
5626 type = promote_type (type);
5627 JDEP_APPLY_PATCH (dep, type);
5628 SOURCE_FRONTEND_DEBUG
5629 (((JDEP_KIND (dep) == JDEP_METHOD_RETURN ?
5630 "Completing fct `%s' with ret type `%s'":
5631 "Completing arg `%s' with type `%s'"),
5632 IDENTIFIER_POINTER (EXPR_WFL_NODE
5633 (JDEP_DECL_WFL (dep))),
5634 IDENTIFIER_POINTER (DECL_NAME (decl))));
5638 dep = JDEP_CHAIN (dep);
5639 if (JDEP_KIND (dep) == JDEP_METHOD_END)
5642 decl = jdep_resolve_class (dep);
5646 tree mdecl = JDEP_DECL (dep), signature;
5647 /* Recompute and reset the signature, check first that
5648 all types are now defined. If they're not,
5649 don't build the signature. */
5650 if (check_method_types_complete (mdecl))
5652 signature = build_java_signature (TREE_TYPE (mdecl));
5653 set_java_signature (TREE_TYPE (mdecl), signature);
5660 case JDEP_INTERFACE:
5661 if (parser_check_super_interface (decl, JDEP_DECL (dep),
5664 parser_add_interface (JDEP_DECL (dep), decl, JDEP_WFL (dep));
5669 type = TREE_TYPE(decl);
5670 if (TREE_CODE (type) == RECORD_TYPE)
5671 type = promote_type (type);
5672 JDEP_APPLY_PATCH (dep, type);
5676 JDEP_APPLY_PATCH (dep, TREE_TYPE (decl));
5677 SOURCE_FRONTEND_DEBUG
5678 (("Completing a random type dependency on a '%s' node",
5679 tree_code_name [TREE_CODE (JDEP_DECL (dep))]));
5682 case JDEP_EXCEPTION:
5683 JDEP_APPLY_PATCH (dep, TREE_TYPE (decl));
5684 SOURCE_FRONTEND_DEBUG
5685 (("Completing `%s' `throws' argument node",
5686 IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_WFL (dep)))));
5689 case JDEP_ANONYMOUS:
5690 patch_anonymous_class (decl, JDEP_DECL (dep), JDEP_WFL (dep));
5701 /* Resolve class CLASS_TYPE. Handle the case of trying to resolve an
5705 resolve_class (tree enclosing, tree class_type, tree decl, tree cl)
5707 tree tname = TYPE_NAME (class_type);
5708 tree resolved_type = TREE_TYPE (class_type);
5710 tree resolved_type_decl;
5712 if (resolved_type != NULL_TREE)
5714 tree resolved_type_decl = TYPE_NAME (resolved_type);
5715 if (resolved_type_decl == NULL_TREE
5716 || TREE_CODE (resolved_type_decl) == IDENTIFIER_NODE)
5718 resolved_type_decl = build_decl (TYPE_DECL,
5719 TYPE_NAME (class_type),
5722 return resolved_type_decl;
5725 /* 1- Check to see if we have an array. If true, find what we really
5727 if ((array_dims = build_type_name_from_array_name (tname,
5728 &TYPE_NAME (class_type))))
5729 WFL_STRIP_BRACKET (cl, cl);
5731 /* 2- Resolve the bare type */
5732 if (!(resolved_type_decl = do_resolve_class (enclosing, class_type,
5735 resolved_type = TREE_TYPE (resolved_type_decl);
5737 /* 3- If we have an array, reconstruct the array down to its nesting */
5740 for (; array_dims; array_dims--)
5741 resolved_type = build_java_array_type (resolved_type, -1);
5742 resolved_type_decl = TYPE_NAME (resolved_type);
5744 TREE_TYPE (class_type) = resolved_type;
5745 return resolved_type_decl;
5748 /* Effectively perform the resolution of class CLASS_TYPE. DECL or CL
5749 are used to report error messages; CL must either be NULL_TREE or a
5750 WFL wrapping a class. Do not try to replace TYPE_NAME (class_type)
5751 by a variable, since it is changed by find_in_imports{_on_demand}
5752 and (but it doesn't really matter) qualify_and_find. */
5755 do_resolve_class (tree enclosing, tree class_type, tree decl, tree cl)
5757 tree new_class_decl = NULL_TREE, super = NULL_TREE;
5758 tree saved_enclosing_type = enclosing ? TREE_TYPE (enclosing) : NULL_TREE;
5760 htab_t circularity_hash;
5762 if (QUALIFIED_P (TYPE_NAME (class_type)))
5764 /* If the type name is of the form `Q . Id', then Q is either a
5765 package name or a class name. First we try to find Q as a
5766 class and then treat Id as a member type. If we can't find Q
5767 as a class then we fall through. */
5768 tree q, left, left_type, right;
5769 if (split_qualified_name (&left, &right, TYPE_NAME (class_type)) == 0)
5771 BUILD_PTR_FROM_NAME (left_type, left);
5772 q = do_resolve_class (enclosing, left_type, decl, cl);
5776 saved_enclosing_type = TREE_TYPE (q);
5777 BUILD_PTR_FROM_NAME (class_type, right);
5784 /* This hash table is used to register the classes we're going
5785 through when searching the current class as an inner class, in
5786 order to detect circular references. Remember to free it before
5787 returning the section 0- of this function. */
5788 circularity_hash = htab_create (20, htab_hash_pointer, htab_eq_pointer,
5791 /* 0- Search in the current class as an inner class.
5792 Maybe some code here should be added to load the class or
5793 something, at least if the class isn't an inner class and ended
5794 being loaded from class file. FIXME. */
5797 new_class_decl = resolve_inner_class (circularity_hash, cl, &enclosing,
5798 &super, class_type);
5802 /* If we haven't found anything because SUPER reached Object and
5803 ENCLOSING happens to be an innerclass, try the enclosing context. */
5804 if ((!super || super == object_type_node) &&
5805 enclosing && INNER_CLASS_DECL_P (enclosing))
5806 enclosing = DECL_CONTEXT (enclosing);
5808 enclosing = NULL_TREE;
5811 htab_delete (circularity_hash);
5814 return new_class_decl;
5817 /* 1- Check for the type in single imports. This will change
5818 TYPE_NAME() if something relevant is found */
5819 find_in_imports (saved_enclosing_type, class_type);
5821 /* 2- And check for the type in the current compilation unit */
5822 if ((new_class_decl = IDENTIFIER_CLASS_VALUE (TYPE_NAME (class_type))))
5824 if (!CLASS_LOADED_P (TREE_TYPE (new_class_decl)))
5825 load_class (TYPE_NAME (class_type), 0);
5826 return IDENTIFIER_CLASS_VALUE (TYPE_NAME (class_type));
5829 /* 3- Search according to the current package definition */
5830 if (!QUALIFIED_P (TYPE_NAME (class_type)))
5832 if ((new_class_decl = qualify_and_find (class_type, ctxp->package,
5833 TYPE_NAME (class_type))))
5834 return new_class_decl;
5837 /* 4- Check the import on demands. Don't allow bar.baz to be
5838 imported from foo.* */
5839 if (!QUALIFIED_P (TYPE_NAME (class_type)))
5840 if (find_in_imports_on_demand (saved_enclosing_type, class_type))
5843 /* If found in find_in_imports_on_demand, the type has already been
5845 if ((new_class_decl = IDENTIFIER_CLASS_VALUE (TYPE_NAME (class_type))))
5846 return new_class_decl;
5848 /* 5- Try with a name qualified with the package name we've seen so far */
5849 if (!QUALIFIED_P (TYPE_NAME (class_type)))
5853 /* If there is a current package (ctxp->package), it's the first
5854 element of package_list and we can skip it. */
5855 for (package = (ctxp->package ?
5856 TREE_CHAIN (package_list) : package_list);
5857 package; package = TREE_CHAIN (package))
5858 if ((new_class_decl = qualify_and_find (class_type,
5859 TREE_PURPOSE (package),
5860 TYPE_NAME (class_type))))
5861 return new_class_decl;
5864 /* 5- Check another compilation unit that bears the name of type */
5865 load_class (TYPE_NAME (class_type), 0);
5868 cl = lookup_cl (decl);
5870 /* If we don't have a value for CL, then we're being called recursively.
5871 We can't check package access just yet, but it will be taken care of
5875 if (check_pkg_class_access (TYPE_NAME (class_type), cl, true, NULL_TREE))
5879 /* 6- Last call for a resolution */
5880 decl_result = IDENTIFIER_CLASS_VALUE (TYPE_NAME (class_type));
5882 /* The final lookup might have registered a.b.c into a.b$c If we
5883 failed at the first lookup, progressively change the name if
5884 applicable and use the matching DECL instead. */
5885 if (!decl_result && QUALIFIED_P (TYPE_NAME (class_type)))
5888 tree name = TYPE_NAME (class_type);
5889 char *namebuffer = alloca (IDENTIFIER_LENGTH (name) + 1);
5891 strcpy (namebuffer, IDENTIFIER_POINTER (name));
5895 /* Reach the last '.', and if applicable, replace it by a `$' and
5896 see if this exists as a type. */
5897 if ((separator = strrchr (namebuffer, '.')))
5900 name = get_identifier (namebuffer);
5901 decl_result = IDENTIFIER_CLASS_VALUE (name);
5903 } while (!decl_result && separator);
5909 qualify_and_find (tree class_type, tree package, tree name)
5911 tree new_qualified = merge_qualified_name (package, name);
5912 tree new_class_decl;
5914 if (!IDENTIFIER_CLASS_VALUE (new_qualified))
5915 load_class (new_qualified, 0);
5916 if ((new_class_decl = IDENTIFIER_CLASS_VALUE (new_qualified)))
5918 if (!CLASS_LOADED_P (TREE_TYPE (new_class_decl)))
5919 load_class (TREE_TYPE (new_class_decl), 0);
5920 TYPE_NAME (class_type) = new_qualified;
5921 return IDENTIFIER_CLASS_VALUE (new_qualified);
5926 /* Resolve NAME and lay it out (if not done and if not the current
5927 parsed class). Return a decl node. This function is meant to be
5928 called when type resolution is necessary during the walk pass. */
5931 resolve_and_layout (tree something, tree cl)
5933 tree decl, decl_type;
5935 /* Don't do that on the current class */
5936 if (something == current_class)
5937 return TYPE_NAME (current_class);
5939 /* Don't do anything for void and other primitive types */
5940 if (JPRIMITIVE_TYPE_P (something) || something == void_type_node)
5943 /* Pointer types can be reall pointer types or fake pointers. When
5944 finding a real pointer, recheck for primitive types */
5945 if (TREE_CODE (something) == POINTER_TYPE)
5947 if (TREE_TYPE (something))
5949 something = TREE_TYPE (something);
5950 if (JPRIMITIVE_TYPE_P (something) || something == void_type_node)
5954 something = TYPE_NAME (something);
5957 /* Don't do anything for arrays of primitive types */
5958 if (TREE_CODE (something) == RECORD_TYPE && TYPE_ARRAY_P (something)
5959 && JPRIMITIVE_TYPE_P (TYPE_ARRAY_ELEMENT (something)))
5962 /* Something might be a WFL */
5963 if (TREE_CODE (something) == EXPR_WITH_FILE_LOCATION)
5964 something = EXPR_WFL_NODE (something);
5966 /* Otherwise, if something is not and IDENTIFIER_NODE, it can be a a
5967 TYPE_DECL or a real TYPE */
5968 else if (TREE_CODE (something) != IDENTIFIER_NODE)
5969 something = (TREE_CODE (TYPE_NAME (something)) == TYPE_DECL ?
5970 DECL_NAME (TYPE_NAME (something)) : TYPE_NAME (something));
5972 if (!(decl = resolve_no_layout (something, cl)))
5975 /* Resolve and layout if necessary */
5976 decl_type = TREE_TYPE (decl);
5977 layout_class_methods (decl_type);
5979 if (CLASS_FROM_SOURCE_P (decl_type))
5980 java_check_methods (decl);
5981 /* Layout the type if necessary */
5982 if (decl_type != current_class && !CLASS_LOADED_P (decl_type))
5983 safe_layout_class (decl_type);
5988 /* Resolve a class, returns its decl but doesn't perform any
5989 layout. The current parsing context is saved and restored */
5992 resolve_no_layout (tree name, tree cl)
5995 BUILD_PTR_FROM_NAME (ptr, name);
5996 java_parser_context_save_global ();
5997 decl = resolve_class (TYPE_NAME (current_class), ptr, NULL_TREE, cl);
5998 java_parser_context_restore_global ();
6003 /* Called when reporting errors. Skip the '[]'s in a complex array
6004 type description that failed to be resolved. purify_type_name can't
6005 use an identifier tree. */
6008 purify_type_name (const char *name)
6010 int len = strlen (name);
6013 STRING_STRIP_BRACKETS (name, len, bracket_found);
6016 char *stripped_name = xmemdup (name, len, len+1);
6017 stripped_name [len] = '\0';
6018 return stripped_name;
6023 /* The type CURRENT refers to can't be found. We print error messages. */
6026 complete_class_report_errors (jdep *dep)
6030 if (!JDEP_WFL (dep))
6033 name = IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_WFL (dep)));
6034 switch (JDEP_KIND (dep))
6038 (JDEP_WFL (dep), "Superclass `%s' of class `%s' not found",
6039 purify_type_name (name),
6040 IDENTIFIER_POINTER (DECL_NAME (JDEP_DECL (dep))));
6044 (JDEP_WFL (dep), "Type `%s' not found in declaration of field `%s'",
6045 purify_type_name (name),
6046 IDENTIFIER_POINTER (DECL_NAME (JDEP_DECL (dep))));
6048 case JDEP_METHOD: /* Covers arguments */
6050 (JDEP_WFL (dep), "Type `%s' not found in the declaration of the argument `%s' of method `%s'",
6051 purify_type_name (name),
6052 IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_DECL_WFL (dep))),
6053 IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_MISC (dep))));
6055 case JDEP_METHOD_RETURN: /* Covers return type */
6057 (JDEP_WFL (dep), "Type `%s' not found in the declaration of the return type of method `%s'",
6058 purify_type_name (name),
6059 IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_DECL_WFL (dep))));
6061 case JDEP_INTERFACE:
6063 (JDEP_WFL (dep), "Superinterface `%s' of %s `%s' not found",
6064 IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_WFL (dep))),
6065 (CLASS_OR_INTERFACE (JDEP_DECL (dep), "class", "interface")),
6066 IDENTIFIER_POINTER (DECL_NAME (JDEP_DECL (dep))));
6070 (JDEP_WFL (dep), "Type `%s' not found in the declaration of the local variable `%s'",
6071 purify_type_name (IDENTIFIER_POINTER
6072 (EXPR_WFL_NODE (JDEP_WFL (dep)))),
6073 IDENTIFIER_POINTER (DECL_NAME (JDEP_DECL (dep))));
6075 case JDEP_EXCEPTION: /* As specified by `throws' */
6077 (JDEP_WFL (dep), "Class `%s' not found in `throws'",
6078 IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_WFL (dep))));
6081 /* Fix for -Wall. Just break doing nothing. The error will be
6087 /* Return a static string containing the DECL prototype string. If
6088 DECL is a constructor, use the class name instead of the form
6092 get_printable_method_name (tree decl)
6094 const char *to_return;
6095 tree name = NULL_TREE;
6097 if (DECL_CONSTRUCTOR_P (decl))
6099 name = DECL_NAME (decl);
6100 DECL_NAME (decl) = DECL_NAME (TYPE_NAME (DECL_CONTEXT (decl)));
6103 to_return = lang_printable_name (decl, 0);
6104 if (DECL_CONSTRUCTOR_P (decl))
6105 DECL_NAME (decl) = name;
6110 /* Track method being redefined inside the same class. As a side
6111 effect, set DECL_NAME to an IDENTIFIER (prior entering this
6112 function it's a FWL, so we can track errors more accurately.) */
6115 check_method_redefinition (tree class, tree method)
6119 /* There's no need to verify <clinit> and finit$ and instinit$ */
6120 if (DECL_CLINIT_P (method)
6121 || DECL_FINIT_P (method) || DECL_INSTINIT_P (method))
6124 sig = TYPE_ARGUMENT_SIGNATURE (TREE_TYPE (method));
6125 for (redef = TYPE_METHODS (class); redef; redef = TREE_CHAIN (redef))
6127 if (redef == method)
6129 if (DECL_NAME (redef) == DECL_NAME (method)
6130 && sig == TYPE_ARGUMENT_SIGNATURE (TREE_TYPE (redef))
6131 && !DECL_ARTIFICIAL (method))
6134 (DECL_FUNCTION_WFL (method), "Duplicate %s declaration `%s'",
6135 (DECL_CONSTRUCTOR_P (redef) ? "constructor" : "method"),
6136 get_printable_method_name (redef));
6143 /* Return 1 if check went ok, 0 otherwise. */
6145 check_abstract_method_definitions (int do_interface, tree class_decl,
6148 tree class = TREE_TYPE (class_decl);
6149 tree method, end_type;
6152 end_type = (do_interface ? object_type_node : type);
6153 for (method = TYPE_METHODS (type); method; method = TREE_CHAIN (method))
6155 tree other_super, other_method, method_sig, method_name;
6157 int end_type_reached = 0;
6159 if (!METHOD_ABSTRACT (method) || METHOD_FINAL (method))
6162 /* Now verify that somewhere in between TYPE and CLASS,
6163 abstract method METHOD gets a non abstract definition
6164 that is inherited by CLASS. */
6166 method_sig = build_java_signature (TREE_TYPE (method));
6167 method_name = DECL_NAME (method);
6168 if (TREE_CODE (method_name) == EXPR_WITH_FILE_LOCATION)
6169 method_name = EXPR_WFL_NODE (method_name);
6171 other_super = class;
6173 if (other_super == end_type)
6174 end_type_reached = 1;
6177 for (other_method = TYPE_METHODS (other_super); other_method;
6178 other_method = TREE_CHAIN (other_method))
6180 tree s = build_java_signature (TREE_TYPE (other_method));
6181 tree other_name = DECL_NAME (other_method);
6183 if (TREE_CODE (other_name) == EXPR_WITH_FILE_LOCATION)
6184 other_name = EXPR_WFL_NODE (other_name);
6185 if (!DECL_CLINIT_P (other_method)
6186 && !DECL_CONSTRUCTOR_P (other_method)
6187 && method_name == other_name
6189 && !METHOD_ABSTRACT (other_method))
6195 other_super = CLASSTYPE_SUPER (other_super);
6196 } while (!end_type_reached);
6198 /* Report that abstract METHOD didn't find an implementation
6199 that CLASS can use. */
6202 char *t = xstrdup (lang_printable_name
6203 (TREE_TYPE (TREE_TYPE (method)), 0));
6204 tree ccn = DECL_NAME (TYPE_NAME (DECL_CONTEXT (method)));
6207 (lookup_cl (class_decl),
6208 "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",
6209 IDENTIFIER_POINTER (DECL_NAME (class_decl)),
6210 t, lang_printable_name (method, 0),
6211 (CLASS_INTERFACE (TYPE_NAME (DECL_CONTEXT (method))) ?
6212 "interface" : "class"),
6213 IDENTIFIER_POINTER (ccn),
6214 (CLASS_INTERFACE (class_decl) ? "interface" : "class"),
6215 IDENTIFIER_POINTER (DECL_NAME (class_decl)));
6221 if (ok && do_interface)
6223 /* Check for implemented interfaces. */
6228 ok && BINFO_BASE_ITERATE (TYPE_BINFO (type), i, base_binfo);
6230 ok = check_abstract_method_definitions (1, class_decl,
6231 BINFO_TYPE (base_binfo));
6237 /* Check that CLASS_DECL somehow implements all inherited abstract
6241 java_check_abstract_method_definitions (tree class_decl)
6243 tree class = TREE_TYPE (class_decl);
6244 tree super, base_binfo;
6247 if (CLASS_ABSTRACT (class_decl))
6250 /* Check for inherited types */
6253 super = CLASSTYPE_SUPER (super);
6254 check_abstract_method_definitions (0, class_decl, super);
6255 } while (super != object_type_node);
6257 /* Check for implemented interfaces. */
6258 for (i = 1; BINFO_BASE_ITERATE (TYPE_BINFO (class), i, base_binfo); i++)
6259 check_abstract_method_definitions (1, class_decl, BINFO_TYPE (base_binfo));
6262 /* Check all the types method DECL uses and return 1 if all of them
6263 are now complete, 0 otherwise. This is used to check whether its
6264 safe to build a method signature or not. */
6267 check_method_types_complete (tree decl)
6269 tree type = TREE_TYPE (decl);
6272 if (!INCOMPLETE_TYPE_P (TREE_TYPE (type)))
6275 args = TYPE_ARG_TYPES (type);
6276 if (TREE_CODE (type) == METHOD_TYPE)
6277 args = TREE_CHAIN (args);
6278 for (; args != end_params_node; args = TREE_CHAIN (args))
6279 if (INCOMPLETE_TYPE_P (TREE_VALUE (args)))
6285 /* Visible interface to check methods contained in CLASS_DECL */
6288 java_check_methods (tree class_decl)
6290 if (CLASS_METHOD_CHECKED_P (TREE_TYPE (class_decl)))
6293 if (CLASS_INTERFACE (class_decl))
6294 java_check_abstract_methods (class_decl);
6296 java_check_regular_methods (class_decl);
6298 CLASS_METHOD_CHECKED_P (TREE_TYPE (class_decl)) = 1;
6301 /* Like not_accessible_p, but doesn't refer to the current class at
6304 hack_is_accessible_p (tree member, tree from_where)
6306 int flags = get_access_flags_from_decl (member);
6308 if (from_where == DECL_CONTEXT (member)
6309 || (flags & ACC_PUBLIC))
6312 if ((flags & ACC_PROTECTED))
6314 if (inherits_from_p (from_where, DECL_CONTEXT (member)))
6318 if ((flags & ACC_PRIVATE))
6321 /* Package private, or protected. */
6322 return in_same_package (TYPE_NAME (from_where),
6323 TYPE_NAME (DECL_CONTEXT (member)));
6326 /* Check all the methods of CLASS_DECL. Methods are first completed
6327 then checked according to regular method existence rules. If no
6328 constructor for CLASS_DECL were encountered, then build its
6331 java_check_regular_methods (tree class_decl)
6333 int saw_constructor = ANONYMOUS_CLASS_P (TREE_TYPE (class_decl));
6335 tree class = TREE_TYPE (class_decl);
6336 tree found = NULL_TREE;
6339 /* It is not necessary to check methods defined in java.lang.Object */
6340 if (class == object_type_node)
6343 if (!TYPE_NVIRTUALS (class))
6344 TYPE_METHODS (class) = nreverse (TYPE_METHODS (class));
6346 /* Should take interfaces into account. FIXME */
6347 for (method = TYPE_METHODS (class); method; method = TREE_CHAIN (method))
6350 tree method_wfl = DECL_FUNCTION_WFL (method);
6353 /* Check for redefinitions */
6354 if (check_method_redefinition (class, method))
6357 /* We verify things thrown by the method. They must inherit from
6358 java.lang.Throwable. */
6359 for (mthrows = DECL_FUNCTION_THROWS (method);
6360 mthrows; mthrows = TREE_CHAIN (mthrows))
6362 if (!inherits_from_p (TREE_VALUE (mthrows), throwable_type_node))
6364 (TREE_PURPOSE (mthrows), "Class `%s' in `throws' clause must be a subclass of class `java.lang.Throwable'",
6366 (DECL_NAME (TYPE_NAME (TREE_VALUE (mthrows)))));
6369 /* If we see one constructor a mark so we don't generate the
6370 default one. Also skip other verifications: constructors
6371 can't be inherited hence hidden or overridden. */
6372 if (DECL_CONSTRUCTOR_P (method))
6374 saw_constructor = 1;
6378 sig = build_java_argument_signature (TREE_TYPE (method));
6379 found = lookup_argument_method_generic (class, DECL_NAME (method), sig,
6380 SEARCH_SUPER | SEARCH_INTERFACE);
6382 /* Inner class can't declare static methods */
6383 if (METHOD_STATIC (method) && !TOPLEVEL_CLASS_DECL_P (class_decl))
6385 char *t = xstrdup (lang_printable_name (class, 0));
6387 (method_wfl, "Method `%s' can't be static in inner class `%s'. Only members of interfaces and top-level classes can be static",
6388 lang_printable_name (method, 0), t);
6392 /* Nothing overrides or it's a private method. */
6395 if (METHOD_PRIVATE (found))
6401 /* If `found' is declared in an interface, make sure the
6402 modifier matches. */
6403 if (CLASS_INTERFACE (TYPE_NAME (DECL_CONTEXT (found)))
6404 && clinit_identifier_node != DECL_NAME (found)
6405 && !METHOD_PUBLIC (method))
6407 tree found_decl = TYPE_NAME (DECL_CONTEXT (found));
6408 parse_error_context (method_wfl, "Class `%s' must override `%s' with a public method in order to implement interface `%s'",
6409 IDENTIFIER_POINTER (DECL_NAME (class_decl)),
6410 lang_printable_name (method, 0),
6411 IDENTIFIER_POINTER (DECL_NAME (found_decl)));
6414 /* Can't override a method with the same name and different return
6416 if (TREE_TYPE (TREE_TYPE (found)) != TREE_TYPE (TREE_TYPE (method)))
6419 (lang_printable_name (TREE_TYPE (TREE_TYPE (found)), 0));
6422 "Method `%s' was defined with return type `%s' in class `%s'",
6423 lang_printable_name (found, 0), t,
6425 (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found)))));
6429 aflags = get_access_flags_from_decl (found);
6431 /* Can't override final. Can't override static. */
6432 if (METHOD_FINAL (found) || METHOD_STATIC (found))
6434 /* Static *can* override static */
6435 if (METHOD_STATIC (found) && METHOD_STATIC (method))
6439 "%s methods can't be overridden. Method `%s' is %s in class `%s'",
6440 (METHOD_FINAL (found) ? "Final" : "Static"),
6441 lang_printable_name (found, 0),
6442 (METHOD_FINAL (found) ? "final" : "static"),
6444 (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found)))));
6448 /* Static method can't override instance method. */
6449 if (METHOD_STATIC (method))
6453 "Instance methods can't be overridden by a static method. Method `%s' is an instance method in class `%s'",
6454 lang_printable_name (found, 0),
6456 (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found)))));
6460 /* - Overriding/hiding public must be public
6461 - Overriding/hiding protected must be protected or public
6462 - If the overridden or hidden method has default (package)
6463 access, then the overriding or hiding method must not be
6464 private; otherwise, a compile-time error occurs. If
6465 `found' belongs to an interface, things have been already
6467 if (!CLASS_INTERFACE (TYPE_NAME (DECL_CONTEXT (found)))
6468 && ((METHOD_PUBLIC (found) && !METHOD_PUBLIC (method))
6469 || (METHOD_PROTECTED (found)
6470 && !(METHOD_PUBLIC (method) || METHOD_PROTECTED (method)))
6471 || (!(aflags & (ACC_PUBLIC | ACC_PRIVATE | ACC_STATIC))
6472 && METHOD_PRIVATE (method))))
6476 "Methods can't be overridden to be more private. Method `%s' is not %s in class `%s'", lang_printable_name (method, 0),
6477 (METHOD_PUBLIC (method) ? "public" :
6478 (METHOD_PRIVATE (method) ? "private" : "protected")),
6479 IDENTIFIER_POINTER (DECL_NAME
6480 (TYPE_NAME (DECL_CONTEXT (found)))));
6484 /* Check this method against all the other implementations it
6485 overrides. Here we only check the class hierarchy; the rest
6486 of the checking is done later. If this method is just a
6487 Miranda method, we can skip the check. */
6488 if (! METHOD_INVISIBLE (method))
6489 check_concrete_throws_clauses (class, method, DECL_NAME (method), sig);
6492 /* The above throws clause check only looked at superclasses. Now
6493 we must also make sure that all methods declared in interfaces
6494 have compatible throws clauses. FIXME: there are more efficient
6495 ways to organize this checking; we should implement one. */
6496 check_interface_throws_clauses (class, class);
6498 if (!TYPE_NVIRTUALS (class))
6499 TYPE_METHODS (class) = nreverse (TYPE_METHODS (class));
6501 /* Search for inherited abstract method not yet implemented in this
6503 java_check_abstract_method_definitions (class_decl);
6505 if (!saw_constructor)
6509 /* Check to make sure that all the methods in all the interfaces
6510 implemented by CLASS_DECL are compatible with the concrete
6511 implementations available in CHECK_CLASS_DECL. */
6513 check_interface_throws_clauses (tree check_class_decl, tree class_decl)
6515 for (; class_decl != NULL_TREE; class_decl = CLASSTYPE_SUPER (class_decl))
6519 if (! CLASS_LOADED_P (class_decl))
6521 if (CLASS_FROM_SOURCE_P (class_decl))
6522 safe_layout_class (class_decl);
6524 load_class (class_decl, 1);
6527 for (i = BINFO_N_BASE_BINFOS (TYPE_BINFO (class_decl)) - 1; i > 0; --i)
6530 = BINFO_TYPE (BINFO_BASE_BINFO (TYPE_BINFO (class_decl), i));
6533 for (iface_method = TYPE_METHODS (interface);
6534 iface_method != NULL_TREE;
6535 iface_method = TREE_CHAIN (iface_method))
6539 /* First look for a concrete method implemented or
6540 inherited by this class. No need to search
6541 interfaces here, since we're already looking through
6543 sig = build_java_argument_signature (TREE_TYPE (iface_method));
6545 = lookup_argument_method_generic (check_class_decl,
6546 DECL_NAME (iface_method),
6547 sig, SEARCH_VISIBLE);
6548 /* If we don't find an implementation, that is ok. Any
6549 potential errors from that are diagnosed elsewhere.
6550 Also, multiple inheritance with conflicting throws
6551 clauses is fine in the absence of a concrete
6553 if (method != NULL_TREE && !METHOD_ABSTRACT (method)
6554 && !METHOD_INVISIBLE (iface_method))
6556 tree method_wfl = DECL_FUNCTION_WFL (method);
6557 check_throws_clauses (method, method_wfl, iface_method);
6561 /* Now check superinterfaces. */
6562 check_interface_throws_clauses (check_class_decl, interface);
6567 /* Check throws clauses of a method against the clauses of all the
6568 methods it overrides. We do this by searching up the class
6569 hierarchy, examining all matching accessible methods. */
6571 check_concrete_throws_clauses (tree class, tree self_method,
6572 tree name, tree signature)
6574 tree method = lookup_argument_method_generic (class, name, signature,
6575 SEARCH_SUPER | SEARCH_VISIBLE);
6576 while (method != NULL_TREE)
6578 if (! METHOD_INVISIBLE (method) && hack_is_accessible_p (method, class))
6579 check_throws_clauses (self_method, DECL_FUNCTION_WFL (self_method),
6582 method = lookup_argument_method_generic (DECL_CONTEXT (method),
6584 SEARCH_SUPER | SEARCH_VISIBLE);
6588 /* Generate an error if the `throws' clause of METHOD (if any) is
6589 incompatible with the `throws' clause of FOUND (if any). */
6591 check_throws_clauses (tree method, tree method_wfl, tree found)
6595 /* Can't check these things with class loaded from bytecode. FIXME */
6596 if (!CLASS_FROM_SOURCE_P (DECL_CONTEXT (found)))
6599 for (mthrows = DECL_FUNCTION_THROWS (method);
6600 mthrows; mthrows = TREE_CHAIN (mthrows))
6604 /* We don't verify unchecked expressions */
6605 if (IS_UNCHECKED_EXCEPTION_P (TREE_VALUE (mthrows)))
6607 /* Checked expression must be compatible */
6608 for (fthrows = DECL_FUNCTION_THROWS (found);
6609 fthrows; fthrows = TREE_CHAIN (fthrows))
6611 if (inherits_from_p (TREE_VALUE (mthrows), TREE_VALUE (fthrows)))
6617 (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'",
6618 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (TREE_VALUE (mthrows)))),
6619 lang_printable_name (found, 0),
6621 (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found)))));
6626 /* Check abstract method of interface INTERFACE */
6628 java_check_abstract_methods (tree interface_decl)
6632 tree interface = TREE_TYPE (interface_decl);
6635 for (method = TYPE_METHODS (interface); method; method = TREE_CHAIN (method))
6637 /* 2- Check for double definition inside the defining interface */
6638 if (check_method_redefinition (interface, method))
6641 /* 3- Overriding is OK as far as we preserve the return type. */
6642 found = lookup_java_interface_method2 (interface, method);
6646 t = xstrdup (lang_printable_name (TREE_TYPE (TREE_TYPE (found)), 0));
6648 (DECL_FUNCTION_WFL (found),
6649 "Method `%s' was defined with return type `%s' in class `%s'",
6650 lang_printable_name (found, 0), t,
6652 (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found)))));
6658 /* 4- Inherited methods can't differ by their returned types */
6659 for (i = 0; BINFO_BASE_ITERATE (TYPE_BINFO (interface), i, base_binfo); i++)
6661 tree sub_interface_method, sub_interface;
6663 sub_interface = BINFO_TYPE (base_binfo);
6664 for (sub_interface_method = TYPE_METHODS (sub_interface);
6665 sub_interface_method;
6666 sub_interface_method = TREE_CHAIN (sub_interface_method))
6668 found = lookup_java_interface_method2 (interface,
6669 sub_interface_method);
6670 if (found && (found != sub_interface_method))
6673 (lookup_cl (sub_interface_method),
6674 "Interface `%s' inherits method `%s' from interface `%s'. This method is redefined with a different return type in interface `%s'",
6675 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (interface))),
6676 lang_printable_name (found, 0),
6678 (DECL_NAME (TYPE_NAME
6679 (DECL_CONTEXT (sub_interface_method)))),
6681 (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found)))));
6687 /* Lookup methods in interfaces using their name and partial
6688 signature. Return a matching method only if their types differ. */
6691 lookup_java_interface_method2 (tree class, tree method_decl)
6697 for (i = 0; BINFO_BASE_ITERATE (TYPE_BINFO (class), i, base_binfo); i++)
6699 if ((BINFO_TYPE (base_binfo) != object_type_node)
6701 lookup_java_method2 (BINFO_TYPE (base_binfo), method_decl, 1)))
6704 for (i = 0; BINFO_BASE_ITERATE (TYPE_BINFO (class), i, base_binfo); i++)
6706 to_return = lookup_java_interface_method2
6707 (BINFO_TYPE (base_binfo), method_decl);
6715 /* Lookup method using their name and partial signature. Return a
6716 matching method only if their types differ. */
6719 lookup_java_method2 (tree clas, tree method_decl, int do_interface)
6721 tree method, method_signature, method_name, method_type, name;
6723 method_signature = build_java_argument_signature (TREE_TYPE (method_decl));
6724 name = DECL_NAME (method_decl);
6725 method_name = (TREE_CODE (name) == EXPR_WITH_FILE_LOCATION ?
6726 EXPR_WFL_NODE (name) : name);
6727 method_type = TREE_TYPE (TREE_TYPE (method_decl));
6729 while (clas != NULL_TREE)
6731 for (method = TYPE_METHODS (clas);
6732 method != NULL_TREE; method = TREE_CHAIN (method))
6734 tree method_sig = build_java_argument_signature (TREE_TYPE (method));
6735 tree name = DECL_NAME (method);
6736 if ((TREE_CODE (name) == EXPR_WITH_FILE_LOCATION ?
6737 EXPR_WFL_NODE (name) : name) == method_name
6738 && method_sig == method_signature
6739 && TREE_TYPE (TREE_TYPE (method)) != method_type)
6742 clas = (do_interface ? NULL_TREE : CLASSTYPE_SUPER (clas));
6747 /* Return the line that matches DECL line number, and try its best to
6748 position the column number. Used during error reports. */
6750 static GTY(()) tree cl_v;
6752 lookup_cl (tree decl)
6759 if (cl_v == NULL_TREE)
6761 cl_v = build_expr_wfl (NULL_TREE, NULL, 0, 0);
6764 EXPR_WFL_FILENAME_NODE (cl_v) = get_identifier (DECL_SOURCE_FILE (decl));
6765 EXPR_WFL_SET_LINECOL (cl_v, DECL_SOURCE_LINE (decl), -1);
6767 line = java_get_line_col (EXPR_WFL_FILENAME (cl_v),
6768 EXPR_WFL_LINENO (cl_v), EXPR_WFL_COLNO (cl_v));
6770 found = strstr ((const char *)line,
6771 (const char *)IDENTIFIER_POINTER (DECL_NAME (decl)));
6773 EXPR_WFL_SET_LINECOL (cl_v, EXPR_WFL_LINENO (cl_v), found - line);
6778 /* Look for a simple name in the single-type import list */
6781 find_name_in_single_imports (tree name)
6785 for (node = ctxp->import_list; node; node = TREE_CHAIN (node))
6786 if (TREE_VALUE (node) == name)
6787 return (EXPR_WFL_NODE (TREE_PURPOSE (node)));
6792 /* Process all single-type import. */
6795 process_imports (void)
6800 for (import = ctxp->import_list; import; import = TREE_CHAIN (import))
6802 tree to_be_found = EXPR_WFL_NODE (TREE_PURPOSE (import));
6803 char *original_name;
6805 original_name = xmemdup (IDENTIFIER_POINTER (to_be_found),
6806 IDENTIFIER_LENGTH (to_be_found),
6807 IDENTIFIER_LENGTH (to_be_found) + 1);
6809 /* Don't load twice something already defined. */
6810 if (IDENTIFIER_CLASS_VALUE (to_be_found))
6817 QUALIFIED_P (to_be_found) = 1;
6818 load_class (to_be_found, 0);
6820 check_pkg_class_access (to_be_found, TREE_PURPOSE (import), true, NULL_TREE);
6822 /* We found it, we can bail out */
6823 if (IDENTIFIER_CLASS_VALUE (to_be_found))
6825 check_deprecation (TREE_PURPOSE (import),
6826 IDENTIFIER_CLASS_VALUE (to_be_found));
6830 /* We haven't found it. Maybe we're trying to access an
6831 inner class. The only way for us to know is to try again
6832 after having dropped a qualifier. If we can't break it further,
6833 we have an error. */
6834 if (split_qualified_name (&left, NULL, to_be_found))
6839 if (!IDENTIFIER_CLASS_VALUE (to_be_found))
6841 parse_error_context (TREE_PURPOSE (import),
6842 "Class or interface `%s' not found in import",
6847 free (original_name);
6854 /* Possibly find and mark a class imported by a single-type import
6858 find_in_imports (tree enclosing_type, tree class_type)
6860 tree import = (enclosing_type ? TYPE_IMPORT_LIST (enclosing_type) :
6864 if (TREE_VALUE (import) == TYPE_NAME (class_type))
6866 TYPE_NAME (class_type) = EXPR_WFL_NODE (TREE_PURPOSE (import));
6867 QUALIFIED_P (TYPE_NAME (class_type)) = 1;
6870 import = TREE_CHAIN (import);
6875 note_possible_classname (const char *name, int len)
6878 if (len > 5 && strncmp (&name [len-5], ".java", 5) == 0)
6880 else if (len > 6 && strncmp (&name [len-6], ".class", 6) == 0)
6884 node = ident_subst (name, len, "", '/', '.', "");
6885 IS_A_CLASSFILE_NAME (node) = 1; /* Or soon to be */
6886 QUALIFIED_P (node) = strchr (name, '/') ? 1 : 0;
6890 /* Read a import directory, gathering potential match for further type
6891 references. Indifferently reads a filesystem or a ZIP archive
6895 read_import_dir (tree wfl)
6897 tree package_id = EXPR_WFL_NODE (wfl);
6898 const char *package_name = IDENTIFIER_POINTER (package_id);
6899 int package_length = IDENTIFIER_LENGTH (package_id);
6901 JCF *saved_jcf = current_jcf;
6906 struct buffer filename[1];
6908 if (IS_AN_IMPORT_ON_DEMAND_P (package_id))
6910 IS_AN_IMPORT_ON_DEMAND_P (package_id) = 1;
6912 BUFFER_INIT (filename);
6913 buffer_grow (filename, package_length + 100);
6915 for (entry = jcf_path_start (); entry != NULL; entry = jcf_path_next (entry))
6917 const char *entry_name = jcf_path_name (entry);
6918 int entry_length = strlen (entry_name);
6919 if (jcf_path_is_zipfile (entry))
6922 buffer_grow (filename, entry_length);
6923 memcpy (filename->data, entry_name, entry_length - 1);
6924 filename->data[entry_length-1] = '\0';
6925 zipf = opendir_in_zip ((const char *) filename->data, jcf_path_is_system (entry));
6927 error ("malformed .zip archive in CLASSPATH: %s", entry_name);
6930 ZipDirectory *zipd = (ZipDirectory *) zipf->central_directory;
6931 BUFFER_RESET (filename);
6932 for (k = 0; k < package_length; k++)
6934 char ch = package_name[k];
6935 *filename->ptr++ = ch == '.' ? '/' : ch;
6937 *filename->ptr++ = '/';
6939 for (k = 0; k < zipf->count; k++, zipd = ZIPDIR_NEXT (zipd))
6941 const char *current_entry = ZIPDIR_FILENAME (zipd);
6942 int current_entry_len = zipd->filename_length;
6944 if (current_entry_len >= BUFFER_LENGTH (filename)
6945 && strncmp ((const char *) filename->data, current_entry,
6946 BUFFER_LENGTH (filename)) != 0)
6948 found |= note_possible_classname (current_entry,
6955 BUFFER_RESET (filename);
6956 buffer_grow (filename, entry_length + package_length + 4);
6957 strcpy ((char *) filename->data, entry_name);
6958 filename->ptr = filename->data + entry_length;
6959 for (k = 0; k < package_length; k++)
6961 char ch = package_name[k];
6962 *filename->ptr++ = ch == '.' ? '/' : ch;
6964 *filename->ptr = '\0';
6966 dirp = opendir ((const char *) filename->data);
6969 *filename->ptr++ = '/';
6974 struct dirent *direntp = readdir (dirp);
6977 d_name = direntp->d_name;
6978 len = strlen (direntp->d_name);
6979 buffer_grow (filename, len+1);
6980 strcpy ((char *) filename->ptr, d_name);
6981 found |= note_possible_classname ((const char *) filename->data + entry_length,
6982 package_length+len+1);
6989 free (filename->data);
6991 /* Here we should have a unified way of retrieving an entry, to be
6995 static int first = 1;
6998 error ("Can't find default package `%s'. Check the CLASSPATH environment variable and the access to the archives", package_name);
7003 parse_error_context (wfl, "Package `%s' not found in import",
7005 current_jcf = saved_jcf;
7008 current_jcf = saved_jcf;
7011 /* Possibly find a type in the import on demands specified
7012 types. Returns 1 if an error occurred, 0 otherwise. Run through the
7013 entire list, to detected potential double definitions. */
7016 find_in_imports_on_demand (tree enclosing_type, tree class_type)
7018 tree class_type_name = TYPE_NAME (class_type);
7019 tree import = (enclosing_type ? TYPE_IMPORT_DEMAND_LIST (enclosing_type) :
7020 ctxp->import_demand_list);
7021 tree cl = NULL_TREE;
7022 int seen_once = -1; /* -1 when not set, 1 if seen once, >1 otherwise. */
7023 int to_return = -1; /* -1 when not set, 0 or 1 otherwise */
7026 for (; import; import = TREE_CHAIN (import))
7028 int saved_lineno = input_line;
7030 const char *id_name;
7031 tree decl, type_name_copy;
7033 obstack_grow (&temporary_obstack,
7034 IDENTIFIER_POINTER (EXPR_WFL_NODE (TREE_PURPOSE (import))),
7035 IDENTIFIER_LENGTH (EXPR_WFL_NODE (TREE_PURPOSE (import))));
7036 obstack_1grow (&temporary_obstack, '.');
7037 obstack_grow0 (&temporary_obstack,
7038 IDENTIFIER_POINTER (class_type_name),
7039 IDENTIFIER_LENGTH (class_type_name));
7040 id_name = obstack_finish (&temporary_obstack);
7042 if (! (node = maybe_get_identifier (id_name)))
7045 /* Setup input_line so that it refers to the line of the import (in
7046 case we parse a class file and encounter errors */
7047 input_line = EXPR_WFL_LINENO (TREE_PURPOSE (import));
7049 type_name_copy = TYPE_NAME (class_type);
7050 TYPE_NAME (class_type) = node;
7051 QUALIFIED_P (node) = 1;
7052 decl = IDENTIFIER_CLASS_VALUE (node);
7054 /* If there is no DECL set for the class or if the class isn't
7055 loaded and not seen in source yet, then load */
7056 if (!decl || ! CLASS_LOADED_P (TREE_TYPE (decl)))
7058 load_class (node, 0);
7059 decl = IDENTIFIER_CLASS_VALUE (node);
7061 if (decl && ! INNER_CLASS_P (TREE_TYPE (decl)))
7062 access_check = check_pkg_class_access (node, TREE_PURPOSE (import),
7065 /* 6.6.1: Inner classes are subject to member access rules. */
7068 input_line = saved_lineno;
7070 /* If the loaded class is not accessible or couldn't be loaded,
7071 we restore the original TYPE_NAME and process the next
7073 if (access_check || !decl)
7075 TYPE_NAME (class_type) = type_name_copy;
7079 /* If the loaded class is accessible, we keep a tab on it to
7080 detect and report multiple inclusions. */
7081 if (IS_A_CLASSFILE_NAME (node))
7085 cl = TREE_PURPOSE (import);
7088 else if (seen_once >= 0)
7090 tree location = (cl ? cl : TREE_PURPOSE (import));
7091 tree package = (cl ? EXPR_WFL_NODE (cl) :
7092 EXPR_WFL_NODE (TREE_PURPOSE (import)));
7096 "Type `%s' also potentially defined in package `%s'",
7097 IDENTIFIER_POINTER (TYPE_NAME (class_type)),
7098 IDENTIFIER_POINTER (package));
7101 to_return = access_check;
7107 return (seen_once < 0 ? 0 : seen_once); /* It's ok not to have found */
7110 /* Add package NAME to the list of packages encountered so far. To
7111 speed up class lookup in do_resolve_class, we make sure a
7112 particular package is added only once. */
7115 register_package (tree name)
7121 pht = htab_create (50, htab_hash_pointer, htab_eq_pointer, NULL);
7123 e = htab_find_slot (pht, name, INSERT);
7126 package_list = chainon (package_list, build_tree_list (name, NULL));
7132 resolve_package (tree pkg, tree *next, tree *type_name)
7135 tree decl = NULL_TREE;
7136 *type_name = NULL_TREE;
7138 /* The trick is to determine when the package name stops and were
7139 the name of something contained in the package starts. Then we
7140 return a fully qualified name of what we want to get. */
7142 *next = EXPR_WFL_QUALIFICATION (pkg);
7144 /* Try to progressively construct a type name */
7145 if (TREE_CODE (pkg) == EXPR_WITH_FILE_LOCATION)
7146 for (current = EXPR_WFL_QUALIFICATION (pkg);
7147 current; current = TREE_CHAIN (current))
7149 /* If we don't have what we're expecting, exit now. TYPE_NAME
7150 will be null and the error caught later. */
7151 if (TREE_CODE (QUAL_WFL (current)) != EXPR_WITH_FILE_LOCATION)
7154 merge_qualified_name (*type_name, EXPR_WFL_NODE (QUAL_WFL (current)));
7155 if ((decl = resolve_no_layout (*type_name, NULL_TREE)))
7157 /* resolve_package should be used in a loop, hence we
7158 point at this one to naturally process the next one at
7159 the next iteration. */
7168 /* Check accessibility of inner classes according to member access rules.
7169 DECL is the inner class, ENCLOSING_DECL is the class from which the
7170 access is being attempted. */
7173 check_inner_class_access (tree decl, tree enclosing_decl, tree cl)
7176 tree enclosing_decl_type;
7178 /* We don't issue an error message when CL is null. CL can be null
7179 as a result of processing a JDEP crafted by source_start_java_method
7180 for the purpose of patching its parm decl. But the error would
7181 have been already trapped when fixing the method's signature.
7182 DECL can also be NULL in case of earlier errors. */
7186 enclosing_decl_type = TREE_TYPE (enclosing_decl);
7188 if (CLASS_PRIVATE (decl))
7190 /* Access is permitted only within the body of the top-level
7191 class in which DECL is declared. */
7192 tree top_level = decl;
7193 while (DECL_CONTEXT (top_level))
7194 top_level = DECL_CONTEXT (top_level);
7195 while (DECL_CONTEXT (enclosing_decl))
7196 enclosing_decl = DECL_CONTEXT (enclosing_decl);
7197 if (top_level == enclosing_decl)
7201 else if (CLASS_PROTECTED (decl))
7204 /* Access is permitted from within the same package... */
7205 if (in_same_package (decl, enclosing_decl))
7208 /* ... or from within the body of a subtype of the context in which
7209 DECL is declared. */
7210 decl_context = DECL_CONTEXT (decl);
7211 while (enclosing_decl)
7213 if (CLASS_INTERFACE (decl))
7215 if (interface_of_p (TREE_TYPE (decl_context),
7216 enclosing_decl_type))
7221 /* Eww. The order of the arguments is different!! */
7222 if (inherits_from_p (enclosing_decl_type,
7223 TREE_TYPE (decl_context)))
7226 enclosing_decl = DECL_CONTEXT (enclosing_decl);
7228 access = "protected";
7230 else if (! CLASS_PUBLIC (decl))
7232 /* Access is permitted only from within the same package as DECL. */
7233 if (in_same_package (decl, enclosing_decl))
7235 access = "non-public";
7238 /* Class is public. */
7241 parse_error_context (cl, "Nested %s %s is %s; cannot be accessed from here",
7242 (CLASS_INTERFACE (decl) ? "interface" : "class"),
7243 lang_printable_name (decl, 0), access);
7246 /* Accessibility check for top-level classes. If CLASS_NAME is in a
7247 foreign package, it must be PUBLIC. Return 0 if no access
7248 violations were found, 1 otherwise. If VERBOSE is true and an error
7249 was found, it is reported and accounted for. If CL is NULL then
7250 look it up with THIS_DECL. */
7253 check_pkg_class_access (tree class_name, tree cl, bool verbose, tree this_decl)
7257 if (!IDENTIFIER_CLASS_VALUE (class_name))
7260 if (!(type = TREE_TYPE (IDENTIFIER_CLASS_VALUE (class_name))))
7263 if (!CLASS_PUBLIC (TYPE_NAME (type)))
7265 /* Access to a private class within the same package is
7268 split_qualified_name (&l, &r, class_name);
7269 if (!QUALIFIED_P (class_name) && !ctxp->package)
7270 /* Both in the empty package. */
7272 if (l == ctxp->package)
7273 /* Both in the same package. */
7278 (cl == NULL ? lookup_cl (this_decl): cl,
7279 "Can't access %s `%s'. Only public classes and interfaces in other packages can be accessed",
7280 (CLASS_INTERFACE (TYPE_NAME (type)) ? "interface" : "class"),
7281 IDENTIFIER_POINTER (class_name));
7287 /* Local variable declaration. */
7290 declare_local_variables (int modifier, tree type, tree vlist)
7292 tree decl, current, saved_type;
7293 tree type_wfl = NULL_TREE;
7297 /* Push a new block if statements were seen between the last time we
7298 pushed a block and now. Keep a count of blocks to close */
7299 if (BLOCK_EXPR_BODY (GET_CURRENT_BLOCK (current_function_decl)))
7301 tree b = enter_block ();
7302 BLOCK_IS_IMPLICIT (b) = 1;
7308 for (i = 0; i < ARRAY_SIZE (ctxp->modifier_ctx); i++)
7309 if (1 << i & modifier)
7311 if (modifier == ACC_FINAL)
7316 (ctxp->modifier_ctx [i],
7317 "Only `final' is allowed as a local variables modifier");
7322 /* Obtain an incomplete type if TYPE is not complete. TYPE_WFL will
7323 hold the TYPE value if a new incomplete has to be created (as
7324 opposed to being found already existing and reused). */
7325 SET_TYPE_FOR_RESOLUTION (type, type_wfl, must_chain);
7327 /* If TYPE is fully resolved and we don't have a reference, make one */
7328 PROMOTE_RECORD_IF_COMPLETE (type, must_chain);
7330 /* Go through all the declared variables */
7331 for (current = vlist, saved_type = type; current;
7332 current = TREE_CHAIN (current), type = saved_type)
7334 tree other, real_type;
7335 tree wfl = TREE_PURPOSE (current);
7336 tree name = EXPR_WFL_NODE (wfl);
7337 tree init = TREE_VALUE (current);
7339 /* Process NAME, as it may specify extra dimension(s) for it */
7340 type = build_array_from_name (type, type_wfl, name, &name);
7342 /* Variable redefinition check */
7343 if ((other = lookup_name_in_blocks (name)))
7345 variable_redefinition_error (wfl, name, TREE_TYPE (other),
7346 DECL_SOURCE_LINE (other));
7350 /* Type adjustment. We may have just readjusted TYPE because
7351 the variable specified more dimensions. Make sure we have
7352 a reference if we can and don't have one already. */
7353 PROMOTE_RECORD_IF_COMPLETE (type, must_chain);
7355 real_type = GET_REAL_TYPE (type);
7356 /* Never layout this decl. This will be done when its scope
7358 decl = build_decl (VAR_DECL, name, real_type);
7359 MAYBE_CREATE_VAR_LANG_DECL_SPECIFIC (decl);
7360 DECL_FINAL (decl) = final_p;
7361 BLOCK_CHAIN_DECL (decl);
7363 /* If doing xreferencing, replace the line number with the WFL
7366 DECL_SOURCE_LINE (decl) = EXPR_WFL_LINECOL (wfl);
7368 /* Don't try to use an INIT statement when an error was found */
7369 if (init && java_error_count)
7372 /* Remember it if this is an initialized-upon-declaration final
7374 if (init && final_p)
7376 DECL_LOCAL_FINAL_IUD (decl) = 1;
7379 /* Add the initialization function to the current function's code */
7382 /* Name might have been readjusted */
7383 EXPR_WFL_NODE (TREE_OPERAND (init, 0)) = name;
7384 MODIFY_EXPR_FROM_INITIALIZATION_P (init) = 1;
7385 java_method_add_stmt (current_function_decl,
7386 build_debugable_stmt (EXPR_WFL_LINECOL (init),
7390 /* Setup dependency the type of the decl */
7394 register_incomplete_type (JDEP_VARIABLE, type_wfl, decl, type);
7395 dep = CLASSD_LAST (ctxp->classd_list);
7396 JDEP_GET_PATCH (dep) = &TREE_TYPE (decl);
7399 SOURCE_FRONTEND_DEBUG (("Defined locals"));
7402 /* Called during parsing. Build decls from argument list. */
7405 source_start_java_method (tree fndecl)
7414 current_function_decl = fndecl;
7416 /* New scope for the function */
7418 for (tem = TYPE_ARG_TYPES (TREE_TYPE (fndecl)), i = 0;
7419 tem != end_params_node; tem = TREE_CHAIN (tem), i++)
7421 tree type = TREE_VALUE (tem);
7422 tree name = TREE_PURPOSE (tem);
7424 /* If type is incomplete. Create an incomplete decl and ask for
7425 the decl to be patched later */
7426 if (INCOMPLETE_TYPE_P (type))
7429 tree real_type = GET_REAL_TYPE (type);
7430 parm_decl = build_decl (PARM_DECL, name, real_type);
7431 type = obtain_incomplete_type (type);
7432 register_incomplete_type (JDEP_PARM, NULL_TREE, NULL_TREE, type);
7433 jdep = CLASSD_LAST (ctxp->classd_list);
7434 JDEP_MISC (jdep) = name;
7435 JDEP_GET_PATCH (jdep) = &TREE_TYPE (parm_decl);
7438 parm_decl = build_decl (PARM_DECL, name, type);
7440 /* Remember if a local variable was declared final (via its
7441 TREE_LIST of type/name.) Set DECL_FINAL accordingly. */
7442 if (ARG_FINAL_P (tem))
7444 MAYBE_CREATE_VAR_LANG_DECL_SPECIFIC (parm_decl);
7445 DECL_FINAL (parm_decl) = 1;
7448 BLOCK_CHAIN_DECL (parm_decl);
7450 tem = BLOCK_EXPR_DECLS (DECL_FUNCTION_BODY (current_function_decl));
7451 BLOCK_EXPR_DECLS (DECL_FUNCTION_BODY (current_function_decl)) =
7453 DECL_ARG_SLOT_COUNT (current_function_decl) = i;
7454 DECL_MAX_LOCALS (current_function_decl) = i;
7457 /* Called during parsing. Creates an artificial method declaration. */
7460 create_artificial_method (tree class, int flags, tree type,
7461 tree name, tree args)
7465 java_parser_context_save_global ();
7467 mdecl = make_node (FUNCTION_TYPE);
7468 TREE_TYPE (mdecl) = type;
7469 TYPE_ARG_TYPES (mdecl) = args;
7470 mdecl = add_method (class, flags, name, build_java_signature (mdecl));
7471 java_parser_context_restore_global ();
7472 DECL_ARTIFICIAL (mdecl) = 1;
7476 /* Starts the body if an artificial method. */
7479 start_artificial_method_body (tree mdecl)
7481 DECL_SOURCE_LINE (mdecl) = 1;
7482 DECL_FUNCTION_LAST_LINE (mdecl) = 1;
7483 source_start_java_method (mdecl);
7488 end_artificial_method_body (tree mdecl)
7490 /* exit_block modifies DECL_FUNCTION_BODY (current_function_decl).
7491 It has to be evaluated first. (if mdecl is current_function_decl,
7492 we have an undefined behavior if no temporary variable is used.) */
7493 tree b = exit_block ();
7494 BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (mdecl)) = b;
7498 /* Dump a tree of some kind. This is a convenience wrapper for the
7499 dump_* functions in tree-dump.c. */
7501 dump_java_tree (enum tree_dump_index phase, tree t)
7506 stream = dump_begin (phase, &flags);
7510 dump_node (t, flags, stream);
7511 dump_end (phase, stream);
7515 /* Terminate a function and expand its body. */
7518 source_end_java_method (void)
7520 tree fndecl = current_function_decl;
7525 java_parser_context_save_global ();
7526 input_line = ctxp->last_ccb_indent1;
7528 /* Turn function bodies with only a NOP expr null, so they don't get
7529 generated at all and we won't get warnings when using the -W
7531 if (IS_EMPTY_STMT (BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (fndecl))))
7532 BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (fndecl)) = NULL_TREE;
7534 if (BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (fndecl))
7535 && ! flag_emit_class_files
7536 && ! flag_emit_xref)
7537 finish_method (fndecl);
7539 current_function_decl = NULL_TREE;
7540 java_parser_context_restore_global ();
7541 current_function_decl = NULL_TREE;
7544 /* Record EXPR in the current function block. Complements compound
7545 expression second operand if necessary. */
7548 java_method_add_stmt (tree fndecl, tree expr)
7550 if (!GET_CURRENT_BLOCK (fndecl))
7552 return add_stmt_to_block (GET_CURRENT_BLOCK (fndecl), NULL_TREE, expr);
7556 add_stmt_to_block (tree b, tree type, tree stmt)
7558 tree body = BLOCK_EXPR_BODY (b), c;
7560 if (java_error_count)
7563 if ((c = add_stmt_to_compound (body, type, stmt)) == body)
7566 BLOCK_EXPR_BODY (b) = c;
7567 TREE_SIDE_EFFECTS (c) = 1;
7571 /* Lays out the methods for the classes seen so far. */
7574 java_layout_seen_class_methods (void)
7576 tree previous_list = all_class_list;
7577 tree end = NULL_TREE;
7582 for (current = previous_list;
7583 current != end; current = TREE_CHAIN (current))
7585 tree cls = TREE_TYPE (TREE_VALUE (current));
7587 if (! CLASS_LOADED_P (cls))
7588 load_class (cls, 0);
7590 layout_class_methods (cls);
7593 /* Note that new classes might have been added while laying out
7594 methods, changing the value of all_class_list. */
7596 if (previous_list != all_class_list)
7598 end = previous_list;
7599 previous_list = all_class_list;
7606 static GTY(()) tree stop_reordering;
7608 java_reorder_fields (void)
7612 for (current = gclass_list; current; current = TREE_CHAIN (current))
7614 output_class = current_class = TREE_TYPE (TREE_VALUE (current));
7616 if (current_class == stop_reordering)
7619 /* Reverse the fields, but leave the dummy field in front.
7620 Fields are already ordered for Object and Class */
7621 if (TYPE_FIELDS (current_class) && current_class != object_type_node
7622 && current_class != class_type_node)
7624 /* If the dummy field is there, reverse the right fields and
7625 just layout the type for proper fields offset */
7626 if (!DECL_NAME (TYPE_FIELDS (current_class)))
7628 tree fields = TYPE_FIELDS (current_class);
7629 TREE_CHAIN (fields) = nreverse (TREE_CHAIN (fields));
7630 TYPE_SIZE (current_class) = NULL_TREE;
7632 /* We don't have a dummy field, we need to layout the class,
7633 after having reversed the fields */
7636 TYPE_FIELDS (current_class) =
7637 nreverse (TYPE_FIELDS (current_class));
7638 TYPE_SIZE (current_class) = NULL_TREE;
7642 /* There are cases were gclass_list will be empty. */
7644 stop_reordering = TREE_TYPE (TREE_VALUE (gclass_list));
7647 /* Layout the methods of all classes loaded in one way or another.
7648 Check methods of source parsed classes. Then reorder the
7649 fields and layout the classes or the type of all source parsed
7653 java_layout_classes (void)
7656 int save_error_count = java_error_count;
7658 /* Layout the methods of all classes seen so far */
7659 java_layout_seen_class_methods ();
7660 java_parse_abort_on_error ();
7661 all_class_list = NULL_TREE;
7663 /* Then check the methods of all parsed classes */
7664 for (current = gclass_list; current; current = TREE_CHAIN (current))
7665 if (CLASS_FROM_SOURCE_P (TREE_TYPE (TREE_VALUE (current))))
7666 java_check_methods (TREE_VALUE (current));
7667 java_parse_abort_on_error ();
7669 for (current = gclass_list; current; current = TREE_CHAIN (current))
7671 output_class = current_class = TREE_TYPE (TREE_VALUE (current));
7672 layout_class (current_class);
7674 /* Error reported by the caller */
7675 if (java_error_count)
7679 /* We might have reloaded classes durign the process of laying out
7680 classes for code generation. We must layout the methods of those
7681 late additions, as constructor checks might use them */
7682 java_layout_seen_class_methods ();
7683 java_parse_abort_on_error ();
7686 /* Expand methods in the current set of classes remembered for
7690 java_complete_expand_classes (void)
7694 do_not_fold = flag_emit_xref;
7696 for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
7697 if (!INNER_CLASS_DECL_P (current))
7698 java_complete_expand_class (current);
7701 /* Expand the methods found in OUTER, starting first by OUTER's inner
7705 java_complete_expand_class (tree outer)
7709 /* We need to go after all inner classes and start expanding them,
7710 starting with most nested ones. We have to do that because nested
7711 classes might add functions to outer classes */
7713 for (inner_list = DECL_INNER_CLASS_LIST (outer);
7714 inner_list; inner_list = TREE_CHAIN (inner_list))
7715 java_complete_expand_class (TREE_PURPOSE (inner_list));
7717 java_complete_expand_methods (outer);
7720 /* Expand methods registered in CLASS_DECL. The general idea is that
7721 we expand regular methods first. This allows us get an estimate on
7722 how outer context local alias fields are really used so we can add
7723 to the constructor just enough code to initialize them properly (it
7724 also lets us generate finit$ correctly.) Then we expand the
7725 constructors and then <clinit>. */
7728 java_complete_expand_methods (tree class_decl)
7730 tree clinit, decl, first_decl;
7732 output_class = current_class = TREE_TYPE (class_decl);
7734 /* Pre-expand <clinit> to figure whether we really need it or
7735 not. If we do need it, we pre-expand the static fields so they're
7736 ready to be used somewhere else. <clinit> will be fully expanded
7737 after we processed the constructors. */
7738 first_decl = TYPE_METHODS (current_class);
7739 clinit = maybe_generate_pre_expand_clinit (current_class);
7741 /* Then generate finit$ (if we need to) because constructors will
7743 if (TYPE_FINIT_STMT_LIST (current_class))
7744 java_complete_expand_method (generate_finit (current_class));
7746 /* Then generate instinit$ (if we need to) because constructors will
7748 if (TYPE_II_STMT_LIST (current_class))
7749 java_complete_expand_method (generate_instinit (current_class));
7751 /* Now do the constructors */
7752 for (decl = first_decl ; !java_error_count && decl; decl = TREE_CHAIN (decl))
7754 if (!DECL_CONSTRUCTOR_P (decl))
7756 java_complete_expand_method (decl);
7759 /* First, do the ordinary methods. */
7760 for (decl = first_decl; decl; decl = TREE_CHAIN (decl))
7762 /* Ctors aren't part of this batch. */
7763 if (DECL_CONSTRUCTOR_P (decl) || DECL_CLINIT_P (decl))
7766 /* Skip abstract or native methods -- but do handle native
7767 methods when generating JNI stubs. */
7768 if (METHOD_ABSTRACT (decl) || (! flag_jni && METHOD_NATIVE (decl)))
7770 DECL_FUNCTION_BODY (decl) = NULL_TREE;
7774 if (METHOD_NATIVE (decl))
7777 current_function_decl = decl;
7778 body = build_jni_stub (decl);
7779 BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (decl)) = body;
7782 java_complete_expand_method (decl);
7785 /* If there is indeed a <clinit>, fully expand it now */
7788 /* Prevent the use of `this' inside <clinit> */
7789 ctxp->explicit_constructor_p = 1;
7790 java_complete_expand_method (clinit);
7791 ctxp->explicit_constructor_p = 0;
7794 /* We might have generated a class$ that we now want to expand */
7795 if (TYPE_DOT_CLASS (current_class))
7796 java_complete_expand_method (TYPE_DOT_CLASS (current_class));
7798 /* Now verify constructor circularity (stop after the first one we
7800 if (!CLASS_INTERFACE (class_decl))
7801 for (decl = TYPE_METHODS (current_class); decl; decl = TREE_CHAIN (decl))
7802 if (DECL_CONSTRUCTOR_P (decl)
7803 && verify_constructor_circularity (decl, decl))
7807 /* Attempt to create <clinit>. Pre-expand static fields so they can be
7808 safely used in some other methods/constructors. */
7811 maybe_generate_pre_expand_clinit (tree class_type)
7813 tree current, mdecl;
7815 if (!TYPE_CLINIT_STMT_LIST (class_type))
7818 /* Go through all static fields and pre expand them */
7819 for (current = TYPE_FIELDS (class_type); current;
7820 current = TREE_CHAIN (current))
7821 if (FIELD_STATIC (current))
7822 build_field_ref (NULL_TREE, class_type, DECL_NAME (current));
7824 /* Then build the <clinit> method */
7825 mdecl = create_artificial_method (class_type, ACC_STATIC, void_type_node,
7826 clinit_identifier_node, end_params_node);
7827 layout_class_method (class_type, CLASSTYPE_SUPER (class_type),
7829 start_artificial_method_body (mdecl);
7831 /* We process the list of assignment we produced as the result of
7832 the declaration of initialized static field and add them as
7833 statement to the <clinit> method. */
7834 for (current = TYPE_CLINIT_STMT_LIST (class_type); current;
7835 current = TREE_CHAIN (current))
7837 tree stmt = current;
7838 /* We build the assignment expression that will initialize the
7839 field to its value. There are strict rules on static
7840 initializers (8.5). FIXME */
7841 if (TREE_CODE (stmt) != BLOCK && !IS_EMPTY_STMT (stmt))
7842 stmt = build_debugable_stmt (EXPR_WFL_LINECOL (stmt), stmt);
7843 java_method_add_stmt (mdecl, stmt);
7846 end_artificial_method_body (mdecl);
7848 /* Now we want to place <clinit> as the last method (because we need
7849 it at least for interface so that it doesn't interfere with the
7850 dispatch table based lookup. */
7851 if (TREE_CHAIN (TYPE_METHODS (class_type)))
7853 current = TREE_CHAIN (TYPE_METHODS (class_type));
7854 TYPE_METHODS (class_type) = current;
7856 while (TREE_CHAIN (current))
7857 current = TREE_CHAIN (current);
7859 TREE_CHAIN (current) = mdecl;
7860 TREE_CHAIN (mdecl) = NULL_TREE;
7866 /* Analyzes a method body and look for something that isn't a
7867 MODIFY_EXPR with a constant value. */
7870 analyze_clinit_body (tree this_class, tree bbody)
7873 switch (TREE_CODE (bbody))
7876 bbody = BLOCK_EXPR_BODY (bbody);
7879 case EXPR_WITH_FILE_LOCATION:
7880 bbody = EXPR_WFL_NODE (bbody);
7884 if (analyze_clinit_body (this_class, TREE_OPERAND (bbody, 0)))
7886 bbody = TREE_OPERAND (bbody, 1);
7890 /* If we're generating to class file and we're dealing with an
7891 array initialization, we return 1 to keep <clinit> */
7892 if (TREE_CODE (TREE_OPERAND (bbody, 1)) == NEW_ARRAY_INIT
7893 && flag_emit_class_files)
7896 /* There are a few cases where we're required to keep
7898 - If this is an assignment whose operand is not constant,
7899 - If this is an assignment to a non-initialized field,
7900 - If this field is not a member of the current class.
7902 return (! TREE_CONSTANT (TREE_OPERAND (bbody, 1))
7903 || ! DECL_INITIAL (TREE_OPERAND (bbody, 0))
7904 || DECL_CONTEXT (TREE_OPERAND (bbody, 0)) != this_class);
7913 /* See whether we could get rid of <clinit>. Criteria are: all static
7914 final fields have constant initial values and the body of <clinit>
7915 is empty. Return 1 if <clinit> was discarded, 0 otherwise. */
7918 maybe_yank_clinit (tree mdecl)
7923 if (!DECL_CLINIT_P (mdecl))
7926 /* If the body isn't empty, then we keep <clinit>. Note that if
7927 we're emitting classfiles, this isn't enough not to rule it
7929 fbody = DECL_FUNCTION_BODY (mdecl);
7930 bbody = BLOCK_EXPR_BODY (fbody);
7931 if (bbody && bbody != error_mark_node)
7932 bbody = BLOCK_EXPR_BODY (bbody);
7935 if (bbody && ! flag_emit_class_files && !IS_EMPTY_STMT (bbody))
7938 type = DECL_CONTEXT (mdecl);
7939 current = TYPE_FIELDS (type);
7941 for (current = (current ? TREE_CHAIN (current) : current);
7942 current; current = TREE_CHAIN (current))
7946 /* We're not interested in non-static fields. */
7947 if (!FIELD_STATIC (current))
7950 /* Nor in fields without initializers. */
7951 f_init = DECL_INITIAL (current);
7952 if (f_init == NULL_TREE)
7955 /* Anything that isn't String or a basic type is ruled out -- or
7956 if we know how to deal with it (when doing things natively) we
7957 should generated an empty <clinit> so that SUID are computed
7959 if (! JSTRING_TYPE_P (TREE_TYPE (current))
7960 && ! JNUMERIC_TYPE_P (TREE_TYPE (current)))
7963 if (! FIELD_FINAL (current) || ! TREE_CONSTANT (f_init))
7967 /* Now we analyze the method body and look for something that
7968 isn't a MODIFY_EXPR */
7969 if (!IS_EMPTY_STMT (bbody) && analyze_clinit_body (type, bbody))
7972 /* Get rid of <clinit> in the class' list of methods */
7973 if (TYPE_METHODS (type) == mdecl)
7974 TYPE_METHODS (type) = TREE_CHAIN (mdecl);
7976 for (current = TYPE_METHODS (type); current;
7977 current = TREE_CHAIN (current))
7978 if (TREE_CHAIN (current) == mdecl)
7980 TREE_CHAIN (current) = TREE_CHAIN (mdecl);
7987 /* Install the argument from MDECL. Suitable to completion and
7988 expansion of mdecl's body. */
7991 start_complete_expand_method (tree mdecl)
7995 pushlevel (1); /* Prepare for a parameter push */
7996 tem = BLOCK_EXPR_DECLS (DECL_FUNCTION_BODY (current_function_decl));
7997 DECL_ARGUMENTS (mdecl) = tem;
7999 for (; tem; tem = TREE_CHAIN (tem))
8001 /* TREE_CHAIN (tem) will change after pushdecl. */
8002 tree next = TREE_CHAIN (tem);
8003 tree type = TREE_TYPE (tem);
8004 if (targetm.calls.promote_prototypes (type)
8005 && TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node)
8006 && INTEGRAL_TYPE_P (type))
8007 type = integer_type_node;
8008 DECL_ARG_TYPE (tem) = type;
8009 layout_decl (tem, 0);
8011 /* Re-install the next so that the list is kept and the loop
8013 TREE_CHAIN (tem) = next;
8015 pushdecl_force_head (DECL_ARGUMENTS (mdecl));
8016 input_line = DECL_SOURCE_LINE (mdecl);
8017 build_result_decl (mdecl);
8021 /* Complete and expand a method. */
8024 java_complete_expand_method (tree mdecl)
8026 tree fbody, block_body, exception_copy;
8028 current_function_decl = mdecl;
8029 /* Fix constructors before expanding them */
8030 if (DECL_CONSTRUCTOR_P (mdecl))
8031 fix_constructors (mdecl);
8033 /* Expand functions that have a body */
8034 if (!DECL_FUNCTION_BODY (mdecl))
8037 fbody = DECL_FUNCTION_BODY (mdecl);
8038 block_body = BLOCK_EXPR_BODY (fbody);
8039 exception_copy = NULL_TREE;
8041 current_function_decl = mdecl;
8044 fprintf (stderr, " [%s.",
8045 lang_printable_name (DECL_CONTEXT (mdecl), 0));
8046 announce_function (mdecl);
8048 fprintf (stderr, "]");
8050 /* Prepare the function for tree completion */
8051 start_complete_expand_method (mdecl);
8053 /* Install the current this */
8054 current_this = (!METHOD_STATIC (mdecl) ?
8055 BLOCK_EXPR_DECLS (DECL_FUNCTION_BODY (mdecl)) : NULL_TREE);
8057 /* Purge the `throws' list of unchecked exceptions (we save a copy
8058 of the list and re-install it later.) */
8059 exception_copy = copy_list (DECL_FUNCTION_THROWS (mdecl));
8060 purge_unchecked_exceptions (mdecl);
8062 /* Install exceptions thrown with `throws' */
8063 PUSH_EXCEPTIONS (DECL_FUNCTION_THROWS (mdecl));
8065 if (block_body != NULL_TREE)
8067 block_body = java_complete_tree (block_body);
8069 /* Before we check initialization, attached all class initialization
8070 variable to the block_body */
8071 htab_traverse (DECL_FUNCTION_INIT_TEST_TABLE (mdecl),
8072 attach_init_test_initialization_flags, block_body);
8074 if (! flag_emit_xref && ! METHOD_NATIVE (mdecl))
8076 check_for_initialization (block_body, mdecl);
8078 /* Go through all the flags marking the initialization of
8079 static variables and see whether they're definitively
8080 assigned, in which case the type is remembered as
8081 definitively initialized in MDECL. */
8082 if (STATIC_CLASS_INIT_OPT_P ())
8084 /* Always register the context as properly initialized in
8085 MDECL. This used with caution helps removing extra
8086 initialization of self. */
8087 if (METHOD_STATIC (mdecl))
8090 (DECL_FUNCTION_INITIALIZED_CLASS_TABLE (mdecl),
8091 DECL_CONTEXT (mdecl), INSERT)) = DECL_CONTEXT (mdecl);
8095 ctxp->explicit_constructor_p = 0;
8098 BLOCK_EXPR_BODY (fbody) = block_body;
8100 /* If we saw a return but couldn't evaluate it properly, we'll have
8101 an error_mark_node here. */
8102 if (block_body != error_mark_node
8103 && (block_body == NULL_TREE || CAN_COMPLETE_NORMALLY (block_body))
8104 && TREE_CODE (TREE_TYPE (TREE_TYPE (mdecl))) != VOID_TYPE
8106 missing_return_error (current_function_decl);
8108 /* See if we can get rid of <clinit> if MDECL happens to be <clinit> */
8109 maybe_yank_clinit (mdecl);
8111 /* Pop the current level, with special measures if we found errors. */
8112 if (java_error_count)
8113 pushdecl_force_head (DECL_ARGUMENTS (mdecl));
8116 /* Pop the exceptions and sanity check */
8118 if (currently_caught_type_list)
8121 /* Restore the copy of the list of exceptions if emitting xrefs. */
8122 DECL_FUNCTION_THROWS (mdecl) = exception_copy;
8125 /* For with each class for which there's code to generate. */
8128 java_expand_method_bodies (tree class)
8131 for (decl = TYPE_METHODS (class); decl; decl = TREE_CHAIN (decl))
8135 if (! DECL_FUNCTION_BODY (decl))
8138 current_function_decl = decl;
8140 block = BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (decl));
8142 /* Save the function body for gimplify and inlining. */
8143 DECL_SAVED_TREE (decl) = block;
8145 /* It's time to assign the variable flagging static class
8146 initialization based on which classes invoked static methods
8147 are definitely initializing. This should be flagged. */
8148 if (STATIC_CLASS_INIT_OPT_P ())
8150 tree list = DECL_FUNCTION_STATIC_METHOD_INVOCATION_COMPOUND (decl);
8151 for (; list != NULL_TREE; list = TREE_CHAIN (list))
8153 /* Executed for each statement calling a static function.
8154 LIST is a TREE_LIST whose PURPOSE is the called function
8155 and VALUE is a compound whose second operand can be patched
8156 with static class initialization flag assignments. */
8158 tree called_method = TREE_PURPOSE (list);
8159 tree compound = TREE_VALUE (list);
8160 tree assignment_compound_list
8161 = build_tree_list (called_method, NULL);
8163 /* For each class definitely initialized in
8164 CALLED_METHOD, fill ASSIGNMENT_COMPOUND with
8165 assignment to the class initialization flag. */
8166 htab_traverse (DECL_FUNCTION_INITIALIZED_CLASS_TABLE (called_method),
8167 emit_test_initialization,
8168 assignment_compound_list);
8170 if (TREE_VALUE (assignment_compound_list))
8171 TREE_OPERAND (compound, 1)
8172 = TREE_VALUE (assignment_compound_list);
8176 /* Expand the function body. */
8177 source_end_java_method ();
8183 /* This section of the code deals with accessing enclosing context
8184 fields either directly by using the relevant access to this$<n> or
8185 by invoking an access method crafted for that purpose. */
8187 /* Build the necessary access from an inner class to an outer
8188 class. This routine could be optimized to cache previous result
8189 (decl, current_class and returned access). When an access method
8190 needs to be generated, it always takes the form of a read. It might
8191 be later turned into a write by calling outer_field_access_fix. */
8194 build_outer_field_access (tree id, tree decl)
8196 tree access = NULL_TREE;
8197 tree ctx = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (current_class)));
8198 tree decl_ctx = DECL_CONTEXT (decl);
8200 /* If the immediate enclosing context of the current class is the
8201 field decl's class or inherits from it; build the access as
8202 `this$<n>.<field>'. Note that we will break the `private' barrier
8203 if we're not emitting bytecodes. */
8204 if ((ctx == decl_ctx || inherits_from_p (ctx, decl_ctx))
8205 && (!FIELD_PRIVATE (decl) || !flag_emit_class_files ))
8207 tree thisn = build_current_thisn (current_class);
8208 access = make_qualified_primary (build_wfl_node (thisn),
8209 id, EXPR_WFL_LINECOL (id));
8211 /* Otherwise, generate access methods to outer this and access the
8212 field (either using an access method or by direct access.) */
8215 int lc = EXPR_WFL_LINECOL (id);
8217 /* Now we chain the required number of calls to the access$0 to
8218 get a hold to the enclosing instance we need, and then we
8219 build the field access. */
8220 access = build_access_to_thisn (current_class, decl_ctx, lc);
8222 /* If the field is private and we're generating bytecode, then
8223 we generate an access method */
8224 if (FIELD_PRIVATE (decl) && flag_emit_class_files )
8226 tree name = build_outer_field_access_methods (decl);
8227 access = build_outer_field_access_expr (lc, decl_ctx,
8228 name, access, NULL_TREE);
8230 /* Otherwise we use `access$(this$<j>). ... access$(this$<i>).<field>'.
8231 Once again we break the `private' access rule from a foreign
8234 access = make_qualified_primary (access, id, lc);
8236 return resolve_expression_name (access, NULL);
8239 /* Return a nonzero value if NODE describes an outer field inner
8243 outer_field_access_p (tree type, tree decl)
8245 if (!INNER_CLASS_TYPE_P (type)
8246 || TREE_CODE (decl) != FIELD_DECL
8247 || DECL_CONTEXT (decl) == type)
8250 /* If the inner class extends the declaration context of the field
8251 we're trying to access, then this isn't an outer field access */
8252 if (inherits_from_p (type, DECL_CONTEXT (decl)))
8255 for (type = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (type))); ;
8256 type = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (type))))
8258 if (type == DECL_CONTEXT (decl))
8261 if (!DECL_CONTEXT (TYPE_NAME (type)))
8263 /* Before we give up, see whether the field is inherited from
8264 the enclosing context we're considering. */
8265 if (inherits_from_p (type, DECL_CONTEXT (decl)))
8274 /* Return a nonzero value if NODE represents an outer field inner
8275 access that was been already expanded. As a side effect, it returns
8276 the name of the field being accessed and the argument passed to the
8277 access function, suitable for a regeneration of the access method
8278 call if necessary. */
8281 outer_field_expanded_access_p (tree node, tree *name, tree *arg_type,
8286 if (TREE_CODE (node) != CALL_EXPR)
8289 /* Well, gcj generates slightly different tree nodes when compiling
8290 to native or bytecodes. It's the case for function calls. */
8292 if (flag_emit_class_files
8293 && TREE_CODE (node) == CALL_EXPR
8294 && OUTER_FIELD_ACCESS_IDENTIFIER_P (DECL_NAME (TREE_OPERAND (node, 0))))
8296 else if (!flag_emit_class_files)
8298 node = TREE_OPERAND (node, 0);
8300 if (node && TREE_OPERAND (node, 0)
8301 && TREE_CODE (TREE_OPERAND (node, 0)) == ADDR_EXPR)
8303 node = TREE_OPERAND (node, 0);
8304 if (TREE_OPERAND (node, 0)
8305 && TREE_CODE (TREE_OPERAND (node, 0)) == FUNCTION_DECL
8306 && (OUTER_FIELD_ACCESS_IDENTIFIER_P
8307 (DECL_NAME (TREE_OPERAND (node, 0)))))
8312 if (identified && name && arg_type && arg)
8314 tree argument = TREE_OPERAND (node, 1);
8315 *name = DECL_NAME (TREE_OPERAND (node, 0));
8316 *arg_type = TREE_TYPE (TREE_TYPE (TREE_VALUE (argument)));
8317 *arg = TREE_VALUE (argument);
8322 /* Detect in NODE an outer field read access from an inner class and
8323 transform it into a write with RHS as an argument. This function is
8324 called from the java_complete_lhs when an assignment to a LHS can
8328 outer_field_access_fix (tree wfl, tree node, tree rhs)
8330 tree name, arg_type, arg;
8332 if (outer_field_expanded_access_p (node, &name, &arg_type, &arg))
8334 node = build_outer_field_access_expr (EXPR_WFL_LINECOL (wfl),
8335 arg_type, name, arg, rhs);
8336 return java_complete_tree (node);
8341 /* Construct the expression that calls an access method:
8342 <type>.access$<n>(<arg1> [, <arg2>]);
8344 ARG2 can be NULL and will be omitted in that case. It will denote a
8348 build_outer_field_access_expr (int lc, tree type, tree access_method_name,
8349 tree arg1, tree arg2)
8351 tree args, cn, access;
8353 args = arg1 ? arg1 :
8354 build_wfl_node (build_current_thisn (current_class));
8355 args = build_tree_list (NULL_TREE, args);
8358 args = tree_cons (NULL_TREE, arg2, args);
8360 access = build_method_invocation (build_wfl_node (access_method_name), args);
8361 cn = build_wfl_node (DECL_NAME (TYPE_NAME (type)));
8362 return make_qualified_primary (cn, access, lc);
8366 build_new_access_id (void)
8368 static int access_n_counter = 1;
8371 sprintf (buffer, "access$%d", access_n_counter++);
8372 return get_identifier (buffer);
8375 /* Create the static access functions for the outer field DECL. We define a
8377 TREE_TYPE (<field>) access$<n> (DECL_CONTEXT (<field>) inst$) {
8381 TREE_TYPE (<field>) access$<n> (DECL_CONTEXT (<field>) inst$,
8382 TREE_TYPE (<field>) value$) {
8383 return inst$.field = value$;
8385 We should have a usage flags on the DECL so we can lazily turn the ones
8386 we're using for code generation. FIXME.
8390 build_outer_field_access_methods (tree decl)
8392 tree id, args, stmt, mdecl;
8394 if (FIELD_INNER_ACCESS_P (decl))
8395 return FIELD_INNER_ACCESS (decl);
8397 MAYBE_CREATE_VAR_LANG_DECL_SPECIFIC (decl);
8399 /* Create the identifier and a function named after it. */
8400 id = build_new_access_id ();
8402 /* The identifier is marked as bearing the name of a generated write
8403 access function for outer field accessed from inner classes. */
8404 OUTER_FIELD_ACCESS_IDENTIFIER_P (id) = 1;
8406 /* Create the read access */
8407 args = build_tree_list (inst_id, build_pointer_type (DECL_CONTEXT (decl)));
8408 TREE_CHAIN (args) = end_params_node;
8409 stmt = make_qualified_primary (build_wfl_node (inst_id),
8410 build_wfl_node (DECL_NAME (decl)), 0);
8411 stmt = build_return (0, stmt);
8412 mdecl = build_outer_field_access_method (DECL_CONTEXT (decl),
8413 TREE_TYPE (decl), id, args, stmt);
8414 DECL_FUNCTION_ACCESS_DECL (mdecl) = decl;
8416 /* Create the write access method. No write access for final variable */
8417 if (!FIELD_FINAL (decl))
8419 args = build_tree_list (inst_id,
8420 build_pointer_type (DECL_CONTEXT (decl)));
8421 TREE_CHAIN (args) = build_tree_list (wpv_id, TREE_TYPE (decl));
8422 TREE_CHAIN (TREE_CHAIN (args)) = end_params_node;
8423 stmt = make_qualified_primary (build_wfl_node (inst_id),
8424 build_wfl_node (DECL_NAME (decl)), 0);
8425 stmt = build_return (0, build_assignment (ASSIGN_TK, 0, stmt,
8426 build_wfl_node (wpv_id)));
8427 mdecl = build_outer_field_access_method (DECL_CONTEXT (decl),
8428 TREE_TYPE (decl), id,
8431 DECL_FUNCTION_ACCESS_DECL (mdecl) = decl;
8433 /* Return the access name */
8434 return FIELD_INNER_ACCESS (decl) = id;
8437 /* Build an field access method NAME. */
8440 build_outer_field_access_method (tree class, tree type, tree name,
8441 tree args, tree body)
8443 tree saved_current_function_decl, mdecl;
8445 /* Create the method */
8446 mdecl = create_artificial_method (class, ACC_STATIC, type, name, args);
8447 fix_method_argument_names (args, mdecl);
8448 layout_class_method (class, NULL_TREE, mdecl, NULL_TREE);
8450 /* Attach the method body. */
8451 saved_current_function_decl = current_function_decl;
8452 start_artificial_method_body (mdecl);
8453 java_method_add_stmt (mdecl, body);
8454 end_artificial_method_body (mdecl);
8455 current_function_decl = saved_current_function_decl;
8461 /* This section deals with building access function necessary for
8462 certain kinds of method invocation from inner classes. */
8465 build_outer_method_access_method (tree decl)
8467 tree saved_current_function_decl, mdecl;
8468 tree args = NULL_TREE, call_args = NULL_TREE;
8469 tree carg, id, body, class;
8471 int parm_id_count = 0;
8473 /* Test this abort with an access to a private field */
8474 if (!strcmp (IDENTIFIER_POINTER (DECL_NAME (decl)), "access$"))
8477 /* Check the cache first */
8478 if (DECL_FUNCTION_INNER_ACCESS (decl))
8479 return DECL_FUNCTION_INNER_ACCESS (decl);
8481 class = DECL_CONTEXT (decl);
8483 /* Obtain an access identifier and mark it */
8484 id = build_new_access_id ();
8485 OUTER_FIELD_ACCESS_IDENTIFIER_P (id) = 1;
8487 carg = TYPE_ARG_TYPES (TREE_TYPE (decl));
8488 /* Create the arguments, as much as the original */
8489 for (; carg && carg != end_params_node;
8490 carg = TREE_CHAIN (carg))
8492 sprintf (buffer, "write_parm_value$%d", parm_id_count++);
8493 args = chainon (args, build_tree_list (get_identifier (buffer),
8494 TREE_VALUE (carg)));
8496 args = chainon (args, end_params_node);
8498 /* Create the method */
8499 mdecl = create_artificial_method (class, ACC_STATIC,
8500 TREE_TYPE (TREE_TYPE (decl)), id, args);
8501 layout_class_method (class, NULL_TREE, mdecl, NULL_TREE);
8502 /* There is a potential bug here. We should be able to use
8503 fix_method_argument_names, but then arg names get mixed up and
8504 eventually a constructor will have its this$0 altered and the
8505 outer context won't be assignment properly. The testcase is
8507 TYPE_ARG_TYPES (TREE_TYPE (mdecl)) = args;
8509 /* Attach the method body. */
8510 saved_current_function_decl = current_function_decl;
8511 start_artificial_method_body (mdecl);
8513 /* The actual method invocation uses the same args. When invoking a
8514 static methods that way, we don't want to skip the first
8517 if (!METHOD_STATIC (decl))
8518 carg = TREE_CHAIN (carg);
8519 for (; carg && carg != end_params_node; carg = TREE_CHAIN (carg))
8520 call_args = tree_cons (NULL_TREE, build_wfl_node (TREE_PURPOSE (carg)),
8523 body = build_method_invocation (build_wfl_node (DECL_NAME (decl)),
8525 if (!METHOD_STATIC (decl))
8526 body = make_qualified_primary (build_wfl_node (TREE_PURPOSE (args)),
8528 if (TREE_TYPE (TREE_TYPE (decl)) != void_type_node)
8529 body = build_return (0, body);
8530 java_method_add_stmt (mdecl,body);
8531 end_artificial_method_body (mdecl);
8532 current_function_decl = saved_current_function_decl;
8534 /* Back tag the access function so it know what it accesses */
8535 DECL_FUNCTION_ACCESS_DECL (decl) = mdecl;
8537 /* Tag the current method so it knows it has an access generated */
8538 return DECL_FUNCTION_INNER_ACCESS (decl) = mdecl;
8542 /* This section of the code deals with building expressions to access
8543 the enclosing instance of an inner class. The enclosing instance is
8544 kept in a generated field called this$<n>, with <n> being the
8545 inner class nesting level (starting from 0.) */
8547 /* Build an access to a given this$<n>, always chaining access call to
8548 others. Access methods to this$<n> are build on the fly if
8549 necessary. This CAN'T be used to solely access this$<n-1> from
8550 this$<n> (which alway yield to special cases and optimization, see
8551 for example build_outer_field_access). */
8554 build_access_to_thisn (tree from, tree to, int lc)
8556 tree access = NULL_TREE;
8558 while (from != to && PURE_INNER_CLASS_TYPE_P (from))
8562 access = build_current_thisn (from);
8563 access = build_wfl_node (access);
8567 tree access0_wfl, cn;
8569 maybe_build_thisn_access_method (from);
8570 access0_wfl = build_wfl_node (access0_identifier_node);
8571 cn = build_wfl_node (DECL_NAME (TYPE_NAME (from)));
8572 EXPR_WFL_LINECOL (access0_wfl) = lc;
8573 access = build_tree_list (NULL_TREE, access);
8574 access = build_method_invocation (access0_wfl, access);
8575 access = make_qualified_primary (cn, access, lc);
8578 /* If FROM isn't an inner class, that's fine, we've done enough.
8579 What we're looking for can be accessed from there. */
8580 from = DECL_CONTEXT (TYPE_NAME (from));
8583 from = TREE_TYPE (from);
8588 /* Build an access function to the this$<n> local to TYPE. NULL_TREE
8589 is returned if nothing needs to be generated. Otherwise, the method
8590 generated and a method decl is returned.
8592 NOTE: These generated methods should be declared in a class file
8593 attribute so that they can't be referred to directly. */
8596 maybe_build_thisn_access_method (tree type)
8598 tree mdecl, args, stmt, rtype;
8599 tree saved_current_function_decl;
8601 /* If TYPE is a top-level class, no access method is required.
8602 If there already is such an access method, bail out. */
8603 if (CLASS_ACCESS0_GENERATED_P (type) || !PURE_INNER_CLASS_TYPE_P (type))
8606 /* We generate the method. The method looks like:
8607 static <outer_of_type> access$0 (<type> inst$) { return inst$.this$<n>; }
8609 args = build_tree_list (inst_id, build_pointer_type (type));
8610 TREE_CHAIN (args) = end_params_node;
8611 rtype = build_pointer_type (TREE_TYPE (DECL_CONTEXT (TYPE_NAME (type))));
8612 mdecl = create_artificial_method (type, ACC_STATIC, rtype,
8613 access0_identifier_node, args);
8614 fix_method_argument_names (args, mdecl);
8615 layout_class_method (type, NULL_TREE, mdecl, NULL_TREE);
8616 stmt = build_current_thisn (type);
8617 stmt = make_qualified_primary (build_wfl_node (inst_id),
8618 build_wfl_node (stmt), 0);
8619 stmt = build_return (0, stmt);
8621 saved_current_function_decl = current_function_decl;
8622 start_artificial_method_body (mdecl);
8623 java_method_add_stmt (mdecl, stmt);
8624 end_artificial_method_body (mdecl);
8625 current_function_decl = saved_current_function_decl;
8627 CLASS_ACCESS0_GENERATED_P (type) = 1;
8632 /* Craft an correctly numbered `this$<n>'string. this$0 is used for
8633 the first level of innerclassing. this$1 for the next one, etc...
8634 This function can be invoked with TYPE to NULL, available and then
8635 has to count the parser context. */
8637 static GTY(()) tree saved_thisn;
8638 static GTY(()) tree saved_type;
8641 build_current_thisn (tree type)
8643 static int saved_i = -1;
8644 static int saved_type_i = 0;
8651 if (type == saved_type)
8655 for (i = -1, decl = DECL_CONTEXT (TYPE_NAME (type));
8656 decl; decl = DECL_CONTEXT (decl), i++)
8664 i = list_length (GET_CPC_LIST ())-2;
8669 sprintf (buffer, "this$%d", i);
8671 saved_thisn = get_identifier (buffer);
8675 /* Return the assignment to the hidden enclosing context `this$<n>'
8676 by the second incoming parameter to the innerclass constructor. The
8677 form used is `this.this$<n> = this$<n>;'. */
8680 build_thisn_assign (void)
8682 if (current_class && PURE_INNER_CLASS_TYPE_P (current_class))
8684 tree thisn = build_current_thisn (current_class);
8685 tree lhs = make_qualified_primary (build_wfl_node (this_identifier_node),
8686 build_wfl_node (thisn), 0);
8687 tree rhs = build_wfl_node (thisn);
8688 EXPR_WFL_SET_LINECOL (lhs, input_line, 0);
8689 return build_assignment (ASSIGN_TK, EXPR_WFL_LINECOL (lhs), lhs, rhs);
8695 /* Building the synthetic `class$' used to implement the `.class' 1.1
8696 extension for non primitive types. This method looks like:
8698 static Class class$(String type) throws NoClassDefFoundError
8700 try {return (java.lang.Class.forName (String));}
8701 catch (ClassNotFoundException e) {
8702 throw new NoClassDefFoundError(e.getMessage());}
8705 static GTY(()) tree get_message_wfl;
8706 static GTY(()) tree type_parm_wfl;
8709 build_dot_class_method (tree class)
8711 #define BWF(S) build_wfl_node (get_identifier ((S)))
8712 #define MQN(X,Y) make_qualified_name ((X), (Y), 0)
8713 tree args, tmp, saved_current_function_decl, mdecl, qual_name;
8714 tree stmt, throw_stmt;
8716 if (!get_message_wfl)
8718 get_message_wfl = build_wfl_node (get_identifier ("getMessage"));
8719 type_parm_wfl = build_wfl_node (get_identifier ("type$"));
8722 /* Build the arguments */
8723 args = build_tree_list (get_identifier ("type$"),
8724 build_pointer_type (string_type_node));
8725 TREE_CHAIN (args) = end_params_node;
8727 /* Build the qualified name java.lang.Class.forName */
8728 tmp = MQN (MQN (MQN (BWF ("java"),
8729 BWF ("lang")), BWF ("Class")), BWF ("forName"));
8731 /* Create the "class$" function */
8732 mdecl = create_artificial_method (class, ACC_STATIC,
8733 build_pointer_type (class_type_node),
8734 classdollar_identifier_node, args);
8735 qual_name = MQN (MQN (BWF ("java"), BWF ("lang")),
8736 BWF ("NoClassDefFoundError"));
8737 DECL_FUNCTION_THROWS (mdecl) = build_tree_list (NULL_TREE, qual_name);
8738 register_incomplete_type (JDEP_EXCEPTION, qual_name, NULL_TREE, NULL_TREE);
8739 JDEP_GET_PATCH (CLASSD_LAST (ctxp->classd_list)) =
8740 &TREE_VALUE (DECL_FUNCTION_THROWS (mdecl));
8742 /* We start by building the try block. We need to build:
8743 return (java.lang.Class.forName (type)); */
8744 stmt = build_method_invocation (tmp,
8745 build_tree_list (NULL_TREE, type_parm_wfl));
8746 stmt = build_return (0, stmt);
8748 /* Now onto the catch block. We start by building the expression
8749 throwing a new exception: throw new NoClassDefFoundError (_.getMessage) */
8750 throw_stmt = make_qualified_name (build_wfl_node (wpv_id),
8751 get_message_wfl, 0);
8752 throw_stmt = build_method_invocation (throw_stmt, NULL_TREE);
8754 /* Build new NoClassDefFoundError (_.getMessage) */
8755 throw_stmt = build_new_invocation
8756 (build_wfl_node (get_identifier ("NoClassDefFoundError")),
8757 build_tree_list (build_pointer_type (string_type_node), throw_stmt));
8759 /* Build the throw, (it's too early to use BUILD_THROW) */
8760 throw_stmt = build1 (THROW_EXPR, NULL_TREE, throw_stmt);
8762 /* Encapsulate STMT in a try block. The catch clause executes THROW_STMT */
8763 qual_name = MQN (MQN (BWF ("java"), BWF ("lang")),
8764 BWF ("ClassNotFoundException"));
8765 stmt = encapsulate_with_try_catch (0, qual_name, stmt, throw_stmt);
8767 fix_method_argument_names (args, mdecl);
8768 layout_class_method (class, NULL_TREE, mdecl, NULL_TREE);
8769 saved_current_function_decl = current_function_decl;
8770 start_artificial_method_body (mdecl);
8771 java_method_add_stmt (mdecl, stmt);
8772 end_artificial_method_body (mdecl);
8773 current_function_decl = saved_current_function_decl;
8774 TYPE_DOT_CLASS (class) = mdecl;
8780 build_dot_class_method_invocation (tree this_class, tree type)
8782 tree dot_class_method = TYPE_DOT_CLASS (this_class);
8785 if (TYPE_ARRAY_P (type))
8786 sig_id = build_java_signature (type);
8788 sig_id = DECL_NAME (TYPE_NAME (type));
8790 /* Ensure that the proper name separator is used */
8791 sig_id = unmangle_classname (IDENTIFIER_POINTER (sig_id),
8792 IDENTIFIER_LENGTH (sig_id));
8794 s = build_string (IDENTIFIER_LENGTH (sig_id),
8795 IDENTIFIER_POINTER (sig_id));
8796 t = build_method_invocation (build_wfl_node (DECL_NAME (dot_class_method)),
8797 build_tree_list (NULL_TREE, s));
8798 if (DECL_CONTEXT (dot_class_method) != this_class)
8800 tree class_name = DECL_NAME (TYPE_NAME (DECL_CONTEXT (dot_class_method)));
8801 t = make_qualified_primary (build_wfl_node (class_name), t, 0);
8806 /* This section of the code deals with constructor. */
8808 /* Craft a body for default constructor. Patch existing constructor
8809 bodies with call to super() and field initialization statements if
8813 fix_constructors (tree mdecl)
8815 tree iii; /* Instance Initializer Invocation */
8816 tree body = DECL_FUNCTION_BODY (mdecl);
8817 tree thisn_assign, compound = NULL_TREE;
8818 tree class_type = DECL_CONTEXT (mdecl);
8820 if (DECL_FIXED_CONSTRUCTOR_P (mdecl))
8822 DECL_FIXED_CONSTRUCTOR_P (mdecl) = 1;
8826 /* It is an error for the compiler to generate a default
8827 constructor if the superclass doesn't have a constructor that
8828 takes no argument, or the same args for an anonymous class */
8829 if (verify_constructor_super (mdecl))
8831 tree sclass_decl = TYPE_NAME (CLASSTYPE_SUPER (class_type));
8832 tree save = DECL_NAME (mdecl);
8833 const char *n = IDENTIFIER_POINTER (DECL_NAME (sclass_decl));
8834 DECL_NAME (mdecl) = DECL_NAME (sclass_decl);
8836 (lookup_cl (TYPE_NAME (class_type)),
8837 "No constructor matching `%s' found in class `%s'",
8838 lang_printable_name (mdecl, 0), n);
8839 DECL_NAME (mdecl) = save;
8842 /* The constructor body must be crafted by hand. It's the
8843 constructor we defined when we realize we didn't have the
8844 CLASSNAME() constructor */
8845 start_artificial_method_body (mdecl);
8847 /* Insert an assignment to the this$<n> hidden field, if
8849 if ((thisn_assign = build_thisn_assign ()))
8850 java_method_add_stmt (mdecl, thisn_assign);
8852 /* We don't generate a super constructor invocation if we're
8853 compiling java.lang.Object. build_super_invocation takes care
8855 java_method_add_stmt (mdecl, build_super_invocation (mdecl));
8858 if ((iii = build_instinit_invocation (class_type)))
8859 java_method_add_stmt (mdecl, iii);
8861 end_artificial_method_body (mdecl);
8863 /* Search for an explicit constructor invocation */
8867 int invokes_this = 0;
8868 tree found_call = NULL_TREE;
8869 tree main_block = BLOCK_EXPR_BODY (body);
8872 switch (TREE_CODE (body))
8875 found = CALL_EXPLICIT_CONSTRUCTOR_P (body);
8876 if (CALL_THIS_CONSTRUCTOR_P (body))
8881 case EXPR_WITH_FILE_LOCATION:
8883 body = TREE_OPERAND (body, 0);
8887 body = BLOCK_EXPR_BODY (body);
8894 /* Generate the assignment to this$<n>, if necessary */
8895 if ((thisn_assign = build_thisn_assign ()))
8896 compound = add_stmt_to_compound (compound, NULL_TREE, thisn_assign);
8898 /* The constructor is missing an invocation of super() */
8900 compound = add_stmt_to_compound (compound, NULL_TREE,
8901 build_super_invocation (mdecl));
8902 /* Explicit super() invocation should take place before the
8903 instance initializer blocks. */
8906 compound = add_stmt_to_compound (compound, NULL_TREE,
8907 TREE_OPERAND (found_call, 0));
8908 TREE_OPERAND (found_call, 0) = build_java_empty_stmt ();
8911 DECL_INIT_CALLS_THIS (mdecl) = invokes_this;
8913 /* Insert the instance initializer block right after. */
8914 if (!invokes_this && (iii = build_instinit_invocation (class_type)))
8915 compound = add_stmt_to_compound (compound, NULL_TREE, iii);
8917 /* Fix the constructor main block if we're adding extra stmts */
8920 compound = add_stmt_to_compound (compound, NULL_TREE,
8921 BLOCK_EXPR_BODY (main_block));
8922 BLOCK_EXPR_BODY (main_block) = compound;
8927 /* Browse constructors in the super class, searching for a constructor
8928 that doesn't take any argument. Return 0 if one is found, 1
8929 otherwise. If the current class is an anonymous inner class, look
8930 for something that has the same signature. */
8933 verify_constructor_super (tree mdecl)
8935 tree class = CLASSTYPE_SUPER (current_class);
8936 int super_inner = PURE_INNER_CLASS_TYPE_P (class);
8942 if (ANONYMOUS_CLASS_P (current_class))
8944 tree mdecl_arg_type;
8945 SKIP_THIS_AND_ARTIFICIAL_PARMS (mdecl_arg_type, mdecl);
8946 for (sdecl = TYPE_METHODS (class); sdecl; sdecl = TREE_CHAIN (sdecl))
8947 if (DECL_CONSTRUCTOR_P (sdecl))
8950 tree arg_type = TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (sdecl)));
8952 arg_type = TREE_CHAIN (arg_type);
8953 for (m_arg_type = mdecl_arg_type;
8954 (arg_type != end_params_node
8955 && m_arg_type != end_params_node);
8956 arg_type = TREE_CHAIN (arg_type),
8957 m_arg_type = TREE_CHAIN (m_arg_type))
8958 if (!valid_method_invocation_conversion_p
8959 (TREE_VALUE (arg_type),
8960 TREE_VALUE (m_arg_type)))
8963 if (arg_type == end_params_node && m_arg_type == end_params_node)
8969 for (sdecl = TYPE_METHODS (class); sdecl; sdecl = TREE_CHAIN (sdecl))
8971 tree arg = TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (sdecl)));
8973 arg = TREE_CHAIN (arg);
8974 if (DECL_CONSTRUCTOR_P (sdecl) && arg == end_params_node)
8981 /* Generate code for all context remembered for code generation. */
8983 static GTY(()) tree reversed_class_list;
8985 java_expand_classes (void)
8987 int save_error_count = 0;
8988 static struct parser_ctxt *cur_ctxp = NULL;
8990 java_parse_abort_on_error ();
8991 if (!(ctxp = ctxp_for_generation))
8993 java_layout_classes ();
8994 java_parse_abort_on_error ();
8996 for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
8999 for (current = cur_ctxp->class_list;
9001 current = TREE_CHAIN (current))
9002 gen_indirect_dispatch_tables (TREE_TYPE (current));
9005 for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
9008 input_filename = ctxp->filename;
9009 lang_init_source (2); /* Error msgs have method prototypes */
9010 java_complete_expand_classes (); /* Complete and expand classes */
9011 java_parse_abort_on_error ();
9013 input_filename = main_input_filename;
9015 /* Find anonymous classes and expand their constructor. This extra pass is
9016 necessary because the constructor itself is only generated when the
9017 method in which it is defined is expanded. */
9018 for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
9022 for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
9024 output_class = current_class = TREE_TYPE (current);
9025 if (ANONYMOUS_CLASS_P (current_class))
9028 for (d = TYPE_METHODS (current_class); d; d = TREE_CHAIN (d))
9030 if (DECL_CONSTRUCTOR_P (d))
9032 java_complete_expand_method (d);
9033 break; /* There is only one constructor. */
9040 /* Expanding the constructors of anonymous classes generates access
9041 methods. Scan all the methods looking for null DECL_RESULTs --
9042 this will be the case if a method hasn't been expanded. */
9043 for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
9047 for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
9050 output_class = current_class = TREE_TYPE (current);
9051 for (d = TYPE_METHODS (current_class); d; d = TREE_CHAIN (d))
9053 if (DECL_RESULT (d) == NULL_TREE)
9054 java_complete_expand_method (d);
9059 /* ??? Instead of all this we could iterate around the list of
9060 classes until there were no more un-expanded methods. It would
9061 take a little longer -- one pass over the whole list of methods
9062 -- but it would be simpler. Like this: */
9065 int something_changed;
9069 something_changed = 0;
9070 for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
9074 for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
9077 output_class = current_class = TREE_TYPE (current);
9078 for (d = TYPE_METHODS (current_class); d; d = TREE_CHAIN (d))
9080 if (DECL_RESULT (d) == NULL_TREE)
9082 something_changed = 1;
9083 java_complete_expand_method (d);
9089 while (something_changed);
9093 /* If we've found error at that stage, don't try to generate
9094 anything, unless we're emitting xrefs or checking the syntax only
9095 (but not using -fsyntax-only for the purpose of generating
9097 if (java_error_count && !flag_emit_xref
9098 && (!flag_syntax_only && !flag_emit_class_files))
9101 /* Now things are stable, go for generation of the class data. */
9103 /* We pessimistically marked all methods and fields external until
9104 we knew what set of classes we were planning to compile. Now mark
9105 those that will be generated locally as not external. */
9106 for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
9110 for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
9111 java_mark_class_local (TREE_TYPE (current));
9114 /* Compile the classes. */
9115 for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
9118 reversed_class_list = NULL;
9122 /* We write out the classes in reverse order. This ensures that
9123 inner classes are written before their containing classes,
9124 which is important for parallel builds. Otherwise, the
9125 class file for the outer class may be found, but the class
9126 file for the inner class may not be present. In that
9127 situation, the compiler cannot fall back to the original
9128 source, having already read the outer class, so we must
9129 prevent that situation. */
9130 for (current = ctxp->class_list;
9132 current = TREE_CHAIN (current))
9134 = tree_cons (NULL_TREE, current, reversed_class_list);
9136 for (current = reversed_class_list;
9138 current = TREE_CHAIN (current))
9140 output_class = current_class = TREE_TYPE (TREE_VALUE (current));
9141 if (flag_emit_class_files)
9142 write_classfile (current_class);
9144 expand_xref (current_class);
9145 else if (! flag_syntax_only)
9146 java_expand_method_bodies (current_class);
9152 java_finish_classes (void)
9154 static struct parser_ctxt *cur_ctxp = NULL;
9155 for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
9159 for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
9161 output_class = current_class = TREE_TYPE (current);
9167 /* Wrap non WFL PRIMARY around a WFL and set EXPR_WFL_QUALIFICATION to
9168 a tree list node containing RIGHT. Fore coming RIGHTs will be
9169 chained to this hook. LOCATION contains the location of the
9170 separating `.' operator. */
9173 make_qualified_primary (tree primary, tree right, int location)
9177 if (TREE_CODE (primary) != EXPR_WITH_FILE_LOCATION)
9178 wfl = build_wfl_wrap (primary, location);
9182 /* If wfl wasn't qualified, we build a first anchor */
9183 if (!EXPR_WFL_QUALIFICATION (wfl))
9184 EXPR_WFL_QUALIFICATION (wfl) = build_tree_list (wfl, NULL_TREE);
9187 /* And chain them */
9188 EXPR_WFL_LINECOL (right) = location;
9189 chainon (EXPR_WFL_QUALIFICATION (wfl), build_tree_list (right, NULL_TREE));
9190 PRIMARY_P (wfl) = 1;
9194 /* Simple merge of two name separated by a `.' */
9197 merge_qualified_name (tree left, tree right)
9200 if (!left && !right)
9209 obstack_grow (&temporary_obstack, IDENTIFIER_POINTER (left),
9210 IDENTIFIER_LENGTH (left));
9211 obstack_1grow (&temporary_obstack, '.');
9212 obstack_grow0 (&temporary_obstack, IDENTIFIER_POINTER (right),
9213 IDENTIFIER_LENGTH (right));
9214 node = get_identifier (obstack_base (&temporary_obstack));
9215 obstack_free (&temporary_obstack, obstack_base (&temporary_obstack));
9216 QUALIFIED_P (node) = 1;
9220 /* Merge the two parts of a qualified name into LEFT. Set the
9221 location information of the resulting node to LOCATION, usually
9222 inherited from the location information of the `.' operator. */
9225 make_qualified_name (tree left, tree right, int location)
9227 #ifdef USE_COMPONENT_REF
9228 tree node = build3 (COMPONENT_REF, NULL_TREE, left, right, NULL_TREE);
9229 EXPR_WFL_LINECOL (node) = location;
9232 tree left_id = EXPR_WFL_NODE (left);
9233 tree right_id = EXPR_WFL_NODE (right);
9236 merge = merge_qualified_name (left_id, right_id);
9238 /* Left wasn't qualified and is now qualified */
9239 if (!QUALIFIED_P (left_id))
9241 tree wfl = build_expr_wfl (left_id, ctxp->filename, 0, 0);
9242 EXPR_WFL_LINECOL (wfl) = EXPR_WFL_LINECOL (left);
9243 EXPR_WFL_QUALIFICATION (left) = build_tree_list (wfl, NULL_TREE);
9246 wfl = build_expr_wfl (right_id, ctxp->filename, 0, 0);
9247 EXPR_WFL_LINECOL (wfl) = location;
9248 chainon (EXPR_WFL_QUALIFICATION (left), build_tree_list (wfl, NULL_TREE));
9250 EXPR_WFL_NODE (left) = merge;
9255 /* Extract the last identifier component of the qualified in WFL. The
9256 last identifier is removed from the linked list */
9259 cut_identifier_in_qualified (tree wfl)
9262 tree previous = NULL_TREE;
9263 for (q = EXPR_WFL_QUALIFICATION (wfl); ; previous = q, q = TREE_CHAIN (q))
9264 if (!TREE_CHAIN (q))
9267 /* Operating on a non qualified qualified WFL. */
9270 TREE_CHAIN (previous) = NULL_TREE;
9271 return TREE_PURPOSE (q);
9275 /* Resolve the expression name NAME. Return its decl. */
9278 resolve_expression_name (tree id, tree *orig)
9280 tree name = EXPR_WFL_NODE (id);
9283 /* 6.5.5.1: Simple expression names */
9284 if (!PRIMARY_P (id) && !QUALIFIED_P (name))
9286 /* 15.13.1: NAME can appear within the scope of a local variable
9288 if ((decl = IDENTIFIER_LOCAL_VALUE (name)))
9291 /* 15.13.1: NAME can appear within a class declaration */
9294 decl = lookup_field_wrapper (current_class, name);
9297 tree access = NULL_TREE;
9298 int fs = FIELD_STATIC (decl);
9300 /* If we're accessing an outer scope local alias, make
9301 sure we change the name of the field we're going to
9303 if (FIELD_LOCAL_ALIAS_USED (decl))
9304 name = DECL_NAME (decl);
9306 check_deprecation (id, decl);
9308 /* Instance variable (8.3.1.1) can't appear within
9309 static method, static initializer or initializer for
9310 a static variable. */
9311 if (!fs && METHOD_STATIC (current_function_decl))
9313 static_ref_err (id, name, current_class);
9314 return error_mark_node;
9316 /* Instance variables can't appear as an argument of
9317 an explicit constructor invocation */
9318 if (!fs && ctxp->explicit_constructor_p
9319 && !enclosing_context_p (DECL_CONTEXT (decl), current_class))
9322 (id, "Can't reference `%s' before the superclass constructor has been called", IDENTIFIER_POINTER (name));
9323 return error_mark_node;
9326 /* If we're processing an inner class and we're trying
9327 to access a field belonging to an outer class, build
9328 the access to the field */
9329 if (!fs && outer_field_access_p (current_class, decl))
9331 if (CLASS_STATIC (TYPE_NAME (current_class)))
9333 static_ref_err (id, DECL_NAME (decl), current_class);
9334 return error_mark_node;
9336 access = build_outer_field_access (id, decl);
9342 /* Otherwise build what it takes to access the field */
9343 access = build_field_ref ((fs ? NULL_TREE : current_this),
9344 DECL_CONTEXT (decl), name);
9346 access = maybe_build_class_init_for_field (decl, access);
9347 /* We may be asked to save the real field access node */
9350 /* Last check: can we access the field? */
9351 if (not_accessible_p (current_class, decl, NULL_TREE, 0))
9353 not_accessible_field_error (id, decl);
9354 return error_mark_node;
9356 /* And we return what we got */
9359 /* Fall down to error report on undefined variable */
9362 /* 6.5.5.2 Qualified Expression Names */
9367 qualify_ambiguous_name (id);
9368 /* 15.10.1 Field Access Using a Primary and/or Expression Name */
9369 /* 15.10.2: Accessing Superclass Members using super */
9370 return resolve_field_access (id, orig, NULL);
9373 /* We've got an error here */
9374 if (INNER_CLASS_TYPE_P (current_class))
9375 parse_error_context (id,
9376 "Local variable `%s' can't be accessed from within the inner class `%s' unless it is declared final",
9377 IDENTIFIER_POINTER (name),
9378 IDENTIFIER_POINTER (DECL_NAME
9379 (TYPE_NAME (current_class))));
9381 parse_error_context (id, "Undefined variable `%s'",
9382 IDENTIFIER_POINTER (name));
9384 return error_mark_node;
9388 static_ref_err (tree wfl, tree field_id, tree class_type)
9392 "Can't make a static reference to nonstatic variable `%s' in class `%s'",
9393 IDENTIFIER_POINTER (field_id),
9394 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (class_type))));
9397 /* 15.10.1 Field Access Using a Primary and/or Expression Name.
9398 We return something suitable to generate the field access. We also
9399 return the field decl in FIELD_DECL and its type in FIELD_TYPE. If
9400 recipient's address can be null. */
9403 resolve_field_access (tree qual_wfl, tree *field_decl, tree *field_type)
9407 tree decl = NULL_TREE, where_found, type_found;
9409 if (resolve_qualified_expression_name (qual_wfl, &decl,
9410 &where_found, &type_found))
9411 return error_mark_node;
9413 /* Resolve the LENGTH field of an array here */
9414 if (DECL_P (decl) && DECL_NAME (decl) == length_identifier_node
9415 && type_found && TYPE_ARRAY_P (type_found)
9416 && ! flag_emit_class_files && ! flag_emit_xref)
9418 tree length = build_java_array_length_access (where_found);
9421 /* In case we're dealing with a static array, we need to
9422 initialize its class before the array length can be fetched.
9423 It's also a good time to create a DECL_RTL for the field if
9424 none already exists, otherwise if the field was declared in a
9425 class found in an external file and hasn't been (and won't
9426 be) accessed for its value, none will be created. */
9427 if (TREE_CODE (where_found) == VAR_DECL && FIELD_STATIC (where_found))
9429 build_static_field_ref (where_found);
9430 field_ref = build_class_init (DECL_CONTEXT (where_found), field_ref);
9433 /* We might have been trying to resolve field.method(). In which
9434 case, the resolution is over and decl is the answer */
9435 else if (JDECL_P (decl) && IDENTIFIER_LOCAL_VALUE (DECL_NAME (decl)) == decl)
9437 else if (JDECL_P (decl))
9440 type_found = DECL_CONTEXT (decl);
9441 is_static = FIELD_STATIC (decl);
9442 field_ref = build_field_ref ((is_static && !flag_emit_xref?
9443 NULL_TREE : where_found),
9444 type_found, DECL_NAME (decl));
9445 if (field_ref == error_mark_node)
9446 return error_mark_node;
9448 field_ref = maybe_build_class_init_for_field (decl, field_ref);
9450 /* If we're looking at a static field, we may need to generate a
9451 class initialization for it. This can happen when the access
9452 looks like `field.ref', where `field' is a static field in an
9453 interface we implement. */
9454 if (!flag_emit_class_files
9456 && TREE_CODE (where_found) == VAR_DECL
9457 && FIELD_STATIC (where_found))
9459 build_static_field_ref (where_found);
9460 field_ref = build_class_init (DECL_CONTEXT (where_found), field_ref);
9469 *field_type = (QUAL_DECL_TYPE (decl) ?
9470 QUAL_DECL_TYPE (decl) : TREE_TYPE (decl));
9474 /* If NODE is an access to f static field, strip out the class
9475 initialization part and return the field decl, otherwise, return
9479 strip_out_static_field_access_decl (tree node)
9481 if (TREE_CODE (node) == COMPOUND_EXPR)
9483 tree op1 = TREE_OPERAND (node, 1);
9484 if (TREE_CODE (op1) == COMPOUND_EXPR)
9486 tree call = TREE_OPERAND (op1, 0);
9487 if (TREE_CODE (call) == CALL_EXPR
9488 && TREE_CODE (TREE_OPERAND (call, 0)) == ADDR_EXPR
9489 && TREE_OPERAND (TREE_OPERAND (call, 0), 0)
9490 == soft_initclass_node)
9491 return TREE_OPERAND (op1, 1);
9493 else if (JDECL_P (op1))
9499 /* 6.5.5.2: Qualified Expression Names */
9502 resolve_qualified_expression_name (tree wfl, tree *found_decl,
9503 tree *where_found, tree *type_found)
9505 int from_type = 0; /* Field search initiated from a type */
9506 int from_super = 0, from_cast = 0, from_qualified_this = 0;
9507 int previous_call_static = 0;
9509 tree decl = NULL_TREE, type = NULL_TREE, q;
9510 /* For certain for of inner class instantiation */
9511 tree saved_current, saved_this;
9512 #define RESTORE_THIS_AND_CURRENT_CLASS \
9513 { current_class = saved_current; current_this = saved_this;}
9515 *type_found = *where_found = NULL_TREE;
9517 for (q = EXPR_WFL_QUALIFICATION (wfl); q; q = TREE_CHAIN (q))
9519 tree qual_wfl = QUAL_WFL (q);
9520 tree ret_decl; /* for EH checking */
9521 int location; /* for EH checking */
9523 /* 15.10.1 Field Access Using a Primary */
9524 switch (TREE_CODE (qual_wfl))
9527 case NEW_CLASS_EXPR:
9528 /* If the access to the function call is a non static field,
9529 build the code to access it. */
9530 if (JDECL_P (decl) && !FIELD_STATIC (decl))
9532 decl = maybe_access_field (decl, *where_found,
9533 DECL_CONTEXT (decl));
9534 if (decl == error_mark_node)
9538 /* And code for the function call */
9539 if (complete_function_arguments (qual_wfl))
9542 /* We might have to setup a new current class and a new this
9543 for the search of an inner class, relative to the type of
9544 a expression resolved as `decl'. The current values are
9545 saved and restored shortly after */
9546 saved_current = current_class;
9547 saved_this = current_this;
9549 && (TREE_CODE (qual_wfl) == NEW_CLASS_EXPR
9550 || from_qualified_this))
9552 /* If we still have `from_qualified_this', we have the form
9553 <T>.this.f() and we need to build <T>.this */
9554 if (from_qualified_this)
9556 decl = build_access_to_thisn (current_class, type, 0);
9557 decl = java_complete_tree (decl);
9558 type = TREE_TYPE (TREE_TYPE (decl));
9560 current_class = type;
9561 current_this = decl;
9562 from_qualified_this = 0;
9565 if (from_super && TREE_CODE (qual_wfl) == CALL_EXPR)
9566 CALL_USING_SUPER (qual_wfl) = 1;
9567 location = (TREE_CODE (qual_wfl) == CALL_EXPR ?
9568 EXPR_WFL_LINECOL (TREE_OPERAND (qual_wfl, 0)) : 0);
9569 *where_found = patch_method_invocation (qual_wfl, decl, type,
9571 &is_static, &ret_decl);
9573 if (*where_found == error_mark_node)
9575 RESTORE_THIS_AND_CURRENT_CLASS;
9578 *type_found = type = QUAL_DECL_TYPE (*where_found);
9580 *where_found = force_evaluation_order (*where_found);
9582 /* If we're creating an inner class instance, check for that
9583 an enclosing instance is in scope */
9584 if (TREE_CODE (qual_wfl) == NEW_CLASS_EXPR
9585 && INNER_ENCLOSING_SCOPE_CHECK (type))
9588 (qual_wfl, "No enclosing instance for inner class `%s' is in scope%s",
9589 lang_printable_name (type, 0),
9590 (!current_this ? "" :
9591 "; an explicit one must be provided when creating this inner class"));
9592 RESTORE_THIS_AND_CURRENT_CLASS;
9596 /* In case we had to change then to resolve a inner class
9597 instantiation using a primary qualified by a `new' */
9598 RESTORE_THIS_AND_CURRENT_CLASS;
9602 tree arguments = NULL_TREE;
9603 if (TREE_CODE (qual_wfl) == CALL_EXPR
9604 && TREE_OPERAND (qual_wfl, 1) != NULL_TREE)
9605 arguments = TREE_VALUE (TREE_OPERAND (qual_wfl, 1));
9606 check_thrown_exceptions (location, ret_decl, arguments);
9609 /* If the previous call was static and this one is too,
9610 build a compound expression to hold the two (because in
9611 that case, previous function calls aren't transported as
9612 forcoming function's argument. */
9613 if (previous_call_static && is_static)
9615 decl = build2 (COMPOUND_EXPR, TREE_TYPE (*where_found),
9616 decl, *where_found);
9617 TREE_SIDE_EFFECTS (decl) = 1;
9621 previous_call_static = is_static;
9622 decl = *where_found;
9627 case NEW_ARRAY_EXPR:
9628 case NEW_ANONYMOUS_ARRAY_EXPR:
9629 *where_found = decl = java_complete_tree (qual_wfl);
9630 if (decl == error_mark_node)
9632 *type_found = type = QUAL_DECL_TYPE (decl);
9636 *where_found = decl = java_complete_tree (qual_wfl);
9637 if (decl == error_mark_node)
9639 *type_found = type = QUAL_DECL_TYPE (decl);
9643 case CONDITIONAL_EXPR:
9646 *where_found = decl = java_complete_tree (qual_wfl);
9647 if (decl == error_mark_node)
9649 *type_found = type = QUAL_DECL_TYPE (decl);
9653 /* If the access to the function call is a non static field,
9654 build the code to access it. */
9655 if (JDECL_P (decl) && !FIELD_STATIC (decl))
9657 decl = maybe_access_field (decl, *where_found, type);
9658 if (decl == error_mark_node)
9661 /* And code for the array reference expression */
9662 decl = java_complete_tree (qual_wfl);
9663 if (decl == error_mark_node)
9665 type = QUAL_DECL_TYPE (decl);
9669 if ((decl = java_complete_tree (qual_wfl)) == error_mark_node)
9671 if ((type = patch_string (decl)))
9673 *where_found = QUAL_RESOLUTION (q) = decl;
9674 *type_found = type = TREE_TYPE (decl);
9678 if ((decl = java_complete_tree (qual_wfl)) == error_mark_node)
9680 *where_found = QUAL_RESOLUTION (q) = decl;
9681 *type_found = type = TREE_TYPE (decl);
9685 /* Fix for -Wall Just go to the next statement. Don't
9690 /* If we fall here, we weren't processing a (static) function call. */
9691 previous_call_static = 0;
9693 /* It can be the keyword THIS */
9694 if (TREE_CODE (qual_wfl) == EXPR_WITH_FILE_LOCATION
9695 && EXPR_WFL_NODE (qual_wfl) == this_identifier_node)
9700 (wfl, "Keyword `this' used outside allowed context");
9703 if (ctxp->explicit_constructor_p
9704 && type == current_class)
9706 parse_error_context (wfl, "Can't reference `this' before the superclass constructor has been called");
9709 /* We have to generate code for intermediate access */
9710 if (!from_type || TREE_TYPE (TREE_TYPE (current_this)) == type)
9712 *where_found = decl = current_this;
9713 *type_found = type = QUAL_DECL_TYPE (decl);
9715 /* We're trying to access the this from somewhere else. Make sure
9716 it's allowed before doing so. */
9719 if (!enclosing_context_p (type, current_class))
9721 char *p = xstrdup (lang_printable_name (type, 0));
9722 parse_error_context (qual_wfl, "Can't use variable `%s.this': type `%s' isn't an outer type of type `%s'",
9724 lang_printable_name (current_class, 0));
9728 from_qualified_this = 1;
9729 /* If there's nothing else after that, we need to
9730 produce something now, otherwise, the section of the
9731 code that needs to produce <T>.this will generate
9732 what is necessary. */
9733 if (!TREE_CHAIN (q))
9735 decl = build_access_to_thisn (current_class, type, 0);
9736 *where_found = decl = java_complete_tree (decl);
9737 *type_found = type = TREE_TYPE (decl);
9745 /* 15.10.2 Accessing Superclass Members using SUPER */
9746 if (TREE_CODE (qual_wfl) == EXPR_WITH_FILE_LOCATION
9747 && EXPR_WFL_NODE (qual_wfl) == super_identifier_node)
9750 /* Check on the restricted use of SUPER */
9751 if (METHOD_STATIC (current_function_decl)
9752 || current_class == object_type_node)
9755 (wfl, "Keyword `super' used outside allowed context");
9758 /* Otherwise, treat SUPER as (SUPER_CLASS)THIS */
9759 node = build_cast (EXPR_WFL_LINECOL (qual_wfl),
9760 CLASSTYPE_SUPER (current_class),
9761 build_this (EXPR_WFL_LINECOL (qual_wfl)));
9762 *where_found = decl = java_complete_tree (node);
9763 if (decl == error_mark_node)
9765 *type_found = type = QUAL_DECL_TYPE (decl);
9766 from_super = from_type = 1;
9770 /* 15.13.1: Can't search for field name in packages, so we
9771 assume a variable/class name was meant. */
9772 if (RESOLVE_PACKAGE_NAME_P (qual_wfl))
9775 if ((decl = resolve_package (wfl, &q, &name)))
9778 *where_found = decl;
9780 check_pkg_class_access (DECL_NAME (decl), qual_wfl, true, NULL);
9782 /* We want to be absolutely sure that the class is laid
9783 out. We're going to search something inside it. */
9784 *type_found = type = TREE_TYPE (decl);
9785 layout_class (type);
9788 /* Fix them all the way down, if any are left. */
9791 list = TREE_CHAIN (q);
9794 RESOLVE_PACKAGE_NAME_P (QUAL_WFL (list)) = 0;
9795 list = TREE_CHAIN (list);
9801 if (from_super || from_cast)
9803 ((from_cast ? qual_wfl : wfl),
9804 "No variable `%s' defined in class `%s'",
9805 IDENTIFIER_POINTER (EXPR_WFL_NODE (qual_wfl)),
9806 lang_printable_name (type, 0));
9809 (qual_wfl, "Undefined variable or class name: `%s'",
9810 IDENTIFIER_POINTER (name));
9815 /* We have a type name. It's been already resolved when the
9816 expression was qualified. */
9817 else if (RESOLVE_TYPE_NAME_P (qual_wfl) && QUAL_RESOLUTION (q))
9819 decl = QUAL_RESOLUTION (q);
9821 /* Sneak preview. If next we see a `new', we're facing a
9822 qualification which resulted in a type being selected
9823 instead of a field. Report the error. */
9825 && TREE_CODE (TREE_PURPOSE (TREE_CHAIN (q))) == NEW_CLASS_EXPR)
9827 parse_error_context (qual_wfl, "Undefined variable `%s'",
9828 IDENTIFIER_POINTER (EXPR_WFL_NODE (wfl)));
9832 check_pkg_class_access (DECL_NAME (decl), qual_wfl, true, NULL);
9834 check_deprecation (qual_wfl, decl);
9836 type = TREE_TYPE (decl);
9839 /* We resolve an expression name */
9842 tree field_decl = NULL_TREE;
9844 /* If there exists an early resolution, use it. That occurs
9845 only once and we know that there are more things to
9846 come. Don't do that when processing something after SUPER
9847 (we need more thing to be put in place below */
9848 if (!from_super && QUAL_RESOLUTION (q))
9850 decl = QUAL_RESOLUTION (q);
9853 if (TREE_CODE (decl) == FIELD_DECL && !FIELD_STATIC (decl))
9856 *where_found = current_this;
9859 static_ref_err (qual_wfl, DECL_NAME (decl),
9863 if (outer_field_access_p (current_class, decl))
9864 decl = build_outer_field_access (qual_wfl, decl);
9868 *where_found = TREE_TYPE (decl);
9869 if (TREE_CODE (*where_found) == POINTER_TYPE)
9870 *where_found = TREE_TYPE (*where_found);
9875 /* Report and error if we're using a numerical literal as a
9876 qualifier. It can only be an INTEGER_CST. */
9877 else if (TREE_CODE (qual_wfl) == INTEGER_CST)
9880 (wfl, "Can't use type `%s' as a qualifier",
9881 lang_printable_name (TREE_TYPE (qual_wfl), 0));
9885 /* We have to search for a field, knowing the type of its
9886 container. The flag FROM_TYPE indicates that we resolved
9887 the last member of the expression as a type name, which
9888 means that for the resolution of this field, we'll look
9889 for other errors than if it was resolved as a member of
9894 tree field_decl_type; /* For layout */
9896 if (!from_type && !JREFERENCE_TYPE_P (type))
9899 (qual_wfl, "Attempt to reference field `%s' in `%s %s'",
9900 IDENTIFIER_POINTER (EXPR_WFL_NODE (qual_wfl)),
9901 lang_printable_name (type, 0),
9902 IDENTIFIER_POINTER (DECL_NAME (decl)));
9906 field_decl = lookup_field_wrapper (type,
9907 EXPR_WFL_NODE (qual_wfl));
9909 /* Maybe what we're trying to access to is an inner
9910 class, only if decl is a TYPE_DECL. */
9911 if (!field_decl && TREE_CODE (decl) == TYPE_DECL)
9913 tree ptr, inner_decl;
9915 BUILD_PTR_FROM_NAME (ptr, EXPR_WFL_NODE (qual_wfl));
9916 inner_decl = resolve_class (decl, ptr, NULL_TREE, qual_wfl);
9919 check_inner_class_access (inner_decl, decl, qual_wfl);
9920 type = TREE_TYPE (inner_decl);
9927 if (field_decl == NULL_TREE)
9930 (qual_wfl, "No variable `%s' defined in type `%s'",
9931 IDENTIFIER_POINTER (EXPR_WFL_NODE (qual_wfl)),
9932 GET_TYPE_NAME (type));
9935 if (field_decl == error_mark_node)
9938 /* Layout the type of field_decl, since we may need
9939 it. Don't do primitive types or loaded classes. The
9940 situation of non primitive arrays may not handled
9941 properly here. FIXME */
9942 if (TREE_CODE (TREE_TYPE (field_decl)) == POINTER_TYPE)
9943 field_decl_type = TREE_TYPE (TREE_TYPE (field_decl));
9945 field_decl_type = TREE_TYPE (field_decl);
9946 if (!JPRIMITIVE_TYPE_P (field_decl_type)
9947 && !CLASS_LOADED_P (field_decl_type)
9948 && !TYPE_ARRAY_P (field_decl_type))
9949 resolve_and_layout (field_decl_type, NULL_TREE);
9951 /* Check on accessibility here */
9952 if (not_accessible_p (current_class, field_decl,
9953 *type_found, from_super))
9954 return not_accessible_field_error (qual_wfl,field_decl);
9955 check_deprecation (qual_wfl, field_decl);
9957 /* There are things to check when fields are accessed
9958 from type. There are no restrictions on a static
9959 declaration of the field when it is accessed from an
9961 is_static = FIELD_STATIC (field_decl);
9962 if (!from_super && from_type
9963 && !TYPE_INTERFACE_P (type)
9965 && (current_function_decl
9966 && METHOD_STATIC (current_function_decl)))
9968 static_ref_err (qual_wfl, EXPR_WFL_NODE (qual_wfl), type);
9971 from_cast = from_super = 0;
9973 /* It's an access from a type but it isn't static, we
9974 make it relative to `this'. */
9975 if (!is_static && from_type)
9976 decl = current_this;
9978 /* If we need to generate something to get a proper
9979 handle on what this field is accessed from, do it
9983 decl = maybe_access_field (decl, *where_found, *type_found);
9984 if (decl == error_mark_node)
9988 /* We want to keep the location were found it, and the type
9990 *where_found = decl;
9993 /* Generate the correct expression for field access from
9995 if (from_qualified_this)
9997 field_decl = build_outer_field_access (qual_wfl, field_decl);
9998 from_qualified_this = 0;
10001 /* This is the decl found and eventually the next one to
10006 type = QUAL_DECL_TYPE (decl);
10008 /* Sneak preview. If decl is qualified by a `new', report
10009 the error here to be accurate on the peculiar construct */
10011 && TREE_CODE (TREE_PURPOSE (TREE_CHAIN (q))) == NEW_CLASS_EXPR
10012 && !JREFERENCE_TYPE_P (type))
10014 parse_error_context (qual_wfl, "Attempt to reference field `new' in a `%s'",
10015 lang_printable_name (type, 0));
10019 /* `q' might have changed due to a after package resolution
10020 re-qualification */
10024 *found_decl = decl;
10028 /* 6.6 Qualified name and access control. Returns 1 if MEMBER (a decl)
10029 can't be accessed from REFERENCE (a record type). If MEMBER
10030 features a protected access, we then use WHERE which, if non null,
10031 holds the type of MEMBER's access that is checked against
10032 6.6.2.1. This function should be used when decl is a field or a
10036 not_accessible_p (tree reference, tree member, tree where, int from_super)
10038 int access_flag = get_access_flags_from_decl (member);
10039 bool is_static = false;
10041 if (TREE_CODE (member) == FIELD_DECL ||
10042 TREE_CODE (member) == VAR_DECL)
10043 is_static = FIELD_STATIC (member);
10045 is_static = METHOD_STATIC (member);
10047 /* Access always granted for members declared public */
10048 if (access_flag & ACC_PUBLIC)
10051 /* Check access on protected members */
10052 if (access_flag & ACC_PROTECTED)
10054 /* Access granted if it occurs from within the package
10055 containing the class in which the protected member is
10057 if (class_in_current_package (DECL_CONTEXT (member)))
10060 /* If accessed with the form `super.member', then access is granted */
10064 /* If WHERE is active, access was made through a qualifier. For
10065 non-static members, access is granted if the type of the qualifier
10066 is or is a sublass of the type the access is made from (6.6.2.1.) */
10067 if (where && !is_static)
10071 if (inherits_from_p (where, reference))
10073 if (PURE_INNER_CLASS_TYPE_P (reference))
10074 reference = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (reference)));
10081 /* Otherwise, access is granted if occurring from within the class
10082 where member is declared, or a subclass of it. */
10085 if (inherits_from_p (reference, DECL_CONTEXT (member)))
10087 if (PURE_INNER_CLASS_TYPE_P (reference))
10088 reference = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (reference)));
10095 /* Check access on private members. Access is granted only if it
10096 occurs from within the class in which it is declared -- that does
10097 it for innerclasses too. */
10098 if (access_flag & ACC_PRIVATE)
10100 if (reference == DECL_CONTEXT (member) ||
10101 common_enclosing_context_p (DECL_CONTEXT (member), reference))
10106 /* Default access is permitted only when occurring from within the
10107 package in which the context (MEMBER) is declared. */
10108 return !class_in_current_package (DECL_CONTEXT (member));
10111 /* Test deprecated decl access. */
10113 check_deprecation (tree wfl, tree decl)
10118 if (! warn_deprecated)
10121 /* We want to look at the element type of arrays here, so we strip
10122 all surrounding array types. */
10123 if (TYPE_ARRAY_P (TREE_TYPE (decl)))
10125 elt = TREE_TYPE (decl);
10126 while (TYPE_ARRAY_P (elt))
10127 elt = TYPE_ARRAY_ELEMENT (elt);
10128 /* We'll end up with a pointer type, so we use TREE_TYPE to go
10130 decl = TYPE_NAME (TREE_TYPE (elt));
10132 file = DECL_SOURCE_FILE (decl);
10134 /* Complain if the field is deprecated and the file it was defined
10135 in isn't compiled at the same time the file which contains its
10137 if (DECL_DEPRECATED (decl)
10138 && !IS_A_COMMAND_LINE_FILENAME_P (get_identifier (file)))
10141 switch (TREE_CODE (decl))
10143 case FUNCTION_DECL:
10151 parse_warning_context (wfl, "The class `%s' has been deprecated",
10152 IDENTIFIER_POINTER (DECL_NAME (decl)));
10157 /* Don't issue a message if the context as been deprecated as a
10159 if (! CLASS_DEPRECATED (TYPE_NAME (DECL_CONTEXT (decl))))
10160 parse_warning_context
10161 (wfl, "The %s `%s' in class `%s' has been deprecated",
10162 the, lang_printable_name (decl, 0),
10163 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (DECL_CONTEXT (decl)))));
10167 /* Returns 1 if class was declared in the current package, 0 otherwise */
10169 static GTY(()) tree cicp_cache;
10171 class_in_current_package (tree class)
10173 int qualified_flag;
10176 if (cicp_cache == class)
10179 qualified_flag = QUALIFIED_P (DECL_NAME (TYPE_NAME (class)));
10181 /* If the current package is empty and the name of CLASS is
10182 qualified, class isn't in the current package. If there is a
10183 current package and the name of the CLASS is not qualified, class
10184 isn't in the current package */
10185 if ((!ctxp->package && qualified_flag) || (ctxp->package && !qualified_flag))
10188 /* If there is not package and the name of CLASS isn't qualified,
10189 they belong to the same unnamed package */
10190 if (!ctxp->package && !qualified_flag)
10193 /* Compare the left part of the name of CLASS with the package name */
10194 split_qualified_name (&left, NULL, DECL_NAME (TYPE_NAME (class)));
10195 if (ctxp->package == left)
10197 cicp_cache = class;
10203 /* This function may generate code to access DECL from WHERE. This is
10204 done only if certain conditions meet. */
10207 maybe_access_field (tree decl, tree where, tree type)
10209 if (TREE_CODE (decl) == FIELD_DECL && decl != current_this
10210 && !FIELD_STATIC (decl))
10211 decl = build_field_ref (where ? where : current_this,
10212 (type ? type : DECL_CONTEXT (decl)),
10217 /* Build a method invocation, by patching PATCH. If non NULL
10218 and according to the situation, PRIMARY and WHERE may be
10219 used. IS_STATIC is set to 1 if the invoked function is static. */
10222 patch_method_invocation (tree patch, tree primary, tree where, int from_super,
10223 int *is_static, tree *ret_decl)
10225 tree wfl = TREE_OPERAND (patch, 0);
10226 tree args = TREE_OPERAND (patch, 1);
10227 tree name = EXPR_WFL_NODE (wfl);
10229 int is_static_flag = 0;
10230 int is_super_init = 0;
10231 tree this_arg = NULL_TREE;
10232 int is_array_clone_call = 0;
10234 /* Should be overridden if everything goes well. Otherwise, if
10235 something fails, it should keep this value. It stop the
10236 evaluation of a bogus assignment. See java_complete_tree,
10237 MODIFY_EXPR: for the reasons why we sometimes want to keep on
10238 evaluating an assignment */
10239 TREE_TYPE (patch) = error_mark_node;
10241 /* Since lookup functions are messing with line numbers, save the
10243 java_parser_context_save_global ();
10245 /* 15.11.1: Compile-Time Step 1: Determine Class or Interface to Search */
10247 /* Resolution of qualified name, excluding constructors */
10248 if (QUALIFIED_P (name) && !CALL_CONSTRUCTOR_P (patch))
10250 tree identifier, identifier_wfl, type, resolved;
10251 /* Extract the last IDENTIFIER of the qualified
10252 expression. This is a wfl and we will use it's location
10253 data during error report. */
10254 identifier_wfl = cut_identifier_in_qualified (wfl);
10255 identifier = EXPR_WFL_NODE (identifier_wfl);
10257 /* Given the context, IDENTIFIER is syntactically qualified
10258 as a MethodName. We need to qualify what's before */
10259 qualify_ambiguous_name (wfl);
10260 resolved = resolve_field_access (wfl, NULL, NULL);
10262 if (TREE_CODE (resolved) == VAR_DECL && FIELD_STATIC (resolved)
10263 && FIELD_FINAL (resolved)
10264 && !inherits_from_p (DECL_CONTEXT (resolved), current_class)
10265 && !flag_emit_class_files && !flag_emit_xref)
10266 resolved = build_class_init (DECL_CONTEXT (resolved), resolved);
10268 if (resolved == error_mark_node)
10269 PATCH_METHOD_RETURN_ERROR ();
10271 type = GET_SKIP_TYPE (resolved);
10272 resolve_and_layout (type, NULL_TREE);
10274 if (JPRIMITIVE_TYPE_P (type))
10276 parse_error_context
10278 "Can't invoke a method on primitive type `%s'",
10279 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type))));
10280 PATCH_METHOD_RETURN_ERROR ();
10283 list = lookup_method_invoke (0, identifier_wfl, type, identifier, args);
10284 args = nreverse (args);
10286 /* We're resolving a call from a type */
10287 if (TREE_CODE (resolved) == TYPE_DECL)
10289 if (CLASS_INTERFACE (resolved))
10291 parse_error_context
10293 "Can't make static reference to method `%s' in interface `%s'",
10294 IDENTIFIER_POINTER (identifier),
10295 IDENTIFIER_POINTER (name));
10296 PATCH_METHOD_RETURN_ERROR ();
10298 if (list && !METHOD_STATIC (list))
10300 char *fct_name = xstrdup (lang_printable_name (list, 0));
10301 parse_error_context
10303 "Can't make static reference to method `%s %s' in class `%s'",
10304 lang_printable_name (TREE_TYPE (TREE_TYPE (list)), 0),
10305 fct_name, IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type))));
10307 PATCH_METHOD_RETURN_ERROR ();
10311 this_arg = primary = resolved;
10313 if (TYPE_ARRAY_P (type) && identifier == get_identifier ("clone"))
10314 is_array_clone_call = 1;
10316 /* IDENTIFIER_WFL will be used to report any problem further */
10317 wfl = identifier_wfl;
10319 /* Resolution of simple names, names generated after a primary: or
10323 tree class_to_search = NULL_TREE;
10324 int lc; /* Looking for Constructor */
10326 /* We search constructor in their target class */
10327 if (CALL_CONSTRUCTOR_P (patch))
10329 if (TREE_CODE (patch) == NEW_CLASS_EXPR)
10330 class_to_search = EXPR_WFL_NODE (wfl);
10331 else if (EXPR_WFL_NODE (TREE_OPERAND (patch, 0)) ==
10332 this_identifier_node)
10333 class_to_search = NULL_TREE;
10334 else if (EXPR_WFL_NODE (TREE_OPERAND (patch, 0)) ==
10335 super_identifier_node)
10338 if (CLASSTYPE_SUPER (current_class))
10340 DECL_NAME (TYPE_NAME (CLASSTYPE_SUPER (current_class)));
10343 parse_error_context (wfl, "Can't invoke super constructor on java.lang.Object");
10344 PATCH_METHOD_RETURN_ERROR ();
10348 /* Class to search is NULL if we're searching the current one */
10349 if (class_to_search)
10351 class_to_search = resolve_and_layout (class_to_search, wfl);
10353 if (!class_to_search)
10355 parse_error_context
10356 (wfl, "Class `%s' not found in type declaration",
10357 IDENTIFIER_POINTER (EXPR_WFL_NODE (wfl)));
10358 PATCH_METHOD_RETURN_ERROR ();
10361 /* Can't instantiate an abstract class, but we can
10362 invoke it's constructor. It's use within the `new'
10363 context is denied here. */
10364 if (CLASS_ABSTRACT (class_to_search)
10365 && TREE_CODE (patch) == NEW_CLASS_EXPR)
10367 parse_error_context
10368 (wfl, "Class `%s' is an abstract class. It can't be instantiated",
10369 IDENTIFIER_POINTER (EXPR_WFL_NODE (wfl)));
10370 PATCH_METHOD_RETURN_ERROR ();
10373 class_to_search = TREE_TYPE (class_to_search);
10376 class_to_search = current_class;
10379 /* This is a regular search in the local class, unless an
10380 alternate class is specified. */
10383 if (where != NULL_TREE)
10384 class_to_search = where;
10385 else if (QUALIFIED_P (name))
10386 class_to_search = current_class;
10389 class_to_search = current_class;
10393 if (has_method (class_to_search, name))
10395 if (! INNER_CLASS_TYPE_P (class_to_search))
10397 parse_error_context (wfl,
10398 "No method named `%s' in scope",
10399 IDENTIFIER_POINTER (name));
10400 PATCH_METHOD_RETURN_ERROR ();
10403 = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (class_to_search)));
10409 /* NAME is a simple identifier or comes from a primary. Search
10410 in the class whose declaration contain the method being
10412 resolve_and_layout (class_to_search, NULL_TREE);
10414 list = lookup_method_invoke (lc, wfl, class_to_search, name, args);
10415 /* Don't continue if no method were found, as the next statement
10416 can't be executed then. */
10418 PATCH_METHOD_RETURN_ERROR ();
10420 if (TYPE_ARRAY_P (class_to_search)
10421 && DECL_NAME (list) == get_identifier ("clone"))
10422 is_array_clone_call = 1;
10424 /* Check for static reference if non static methods */
10425 if (check_for_static_method_reference (wfl, patch, list,
10426 class_to_search, primary))
10427 PATCH_METHOD_RETURN_ERROR ();
10429 /* Check for inner classes creation from illegal contexts */
10430 if (lc && (INNER_CLASS_TYPE_P (class_to_search)
10431 && !CLASS_STATIC (TYPE_NAME (class_to_search)))
10432 && INNER_ENCLOSING_SCOPE_CHECK (class_to_search)
10433 && !DECL_INIT_P (current_function_decl))
10435 parse_error_context
10436 (wfl, "No enclosing instance for inner class `%s' is in scope%s",
10437 lang_printable_name (class_to_search, 0),
10438 (!current_this ? "" :
10439 "; an explicit one must be provided when creating this inner class"));
10440 PATCH_METHOD_RETURN_ERROR ();
10443 /* Non static methods are called with the current object extra
10444 argument. If patch a `new TYPE()', the argument is the value
10445 returned by the object allocator. If method is resolved as a
10446 primary, use the primary otherwise use the current THIS. */
10447 args = nreverse (args);
10448 if (TREE_CODE (patch) != NEW_CLASS_EXPR)
10450 this_arg = primary ? primary : current_this;
10452 /* If we're using an access method, things are different.
10453 There are two family of cases:
10455 1) We're not generating bytecodes:
10457 - LIST is non static. It's invocation is transformed from
10458 x(a1,...,an) into this$<n>.x(a1,....an).
10459 - LIST is static. It's invocation is transformed from
10460 x(a1,...,an) into TYPE_OF(this$<n>).x(a1,....an)
10462 2) We're generating bytecodes:
10464 - LIST is non static. It's invocation is transformed from
10465 x(a1,....,an) into access$<n>(this$<n>,a1,...,an).
10466 - LIST is static. It's invocation is transformed from
10467 x(a1,....,an) into TYPE_OF(this$<n>).x(a1,....an).
10469 Of course, this$<n> can be arbitrarily complex, ranging from
10470 this$0 (the immediate outer context) to
10471 access$0(access$0(...(this$0))).
10473 maybe_use_access_method returns a nonzero value if the
10474 this_arg has to be moved into the (then generated) stub
10475 argument list. In the meantime, the selected function
10476 might have be replaced by a generated stub. */
10478 maybe_use_access_method (is_super_init, &list, &this_arg))
10480 args = tree_cons (NULL_TREE, this_arg, args);
10481 this_arg = NULL_TREE; /* So it doesn't get chained twice */
10486 /* Merge point of all resolution schemes. If we have nothing, this
10487 is an error, already signaled */
10489 PATCH_METHOD_RETURN_ERROR ();
10491 /* Check accessibility, position the is_static flag, build and
10493 if (not_accessible_p (DECL_CONTEXT (current_function_decl), list,
10494 (primary ? TREE_TYPE (TREE_TYPE (primary)) :
10495 NULL_TREE), from_super)
10496 /* Calls to clone() on array types are permitted as a special-case. */
10497 && !is_array_clone_call)
10499 const char *const fct_name = IDENTIFIER_POINTER (DECL_NAME (list));
10500 const char *const access =
10501 accessibility_string (get_access_flags_from_decl (list));
10502 const char *const klass =
10503 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (DECL_CONTEXT (list))));
10504 const char *const refklass =
10505 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (current_class)));
10506 const char *const what = (DECL_CONSTRUCTOR_P (list)
10507 ? "constructor" : "method");
10508 parse_error_context (wfl,
10509 "Can't access %s %s `%s.%s' from `%s'",
10510 access, what, klass, fct_name, refklass);
10511 PATCH_METHOD_RETURN_ERROR ();
10514 /* Deprecation check: check whether the method being invoked or the
10515 instance-being-created's type are deprecated. */
10516 if (TREE_CODE (patch) == NEW_CLASS_EXPR)
10517 check_deprecation (wfl, TYPE_NAME (DECL_CONTEXT (list)));
10518 check_deprecation (wfl, list);
10520 /* If invoking a innerclass constructor, there are hidden parameters
10522 if (TREE_CODE (patch) == NEW_CLASS_EXPR
10523 && PURE_INNER_CLASS_TYPE_P (DECL_CONTEXT (list)))
10525 /* And make sure we add the accessed local variables to be saved
10526 in field aliases. */
10527 args = build_alias_initializer_parameter_list
10528 (AIPL_FUNCTION_CTOR_INVOCATION, DECL_CONTEXT (list), args, NULL);
10530 /* Secretly pass the current_this/primary as a second argument */
10531 if (primary || current_this)
10534 tree this_type = (current_this ?
10535 TREE_TYPE (TREE_TYPE (current_this)) : NULL_TREE);
10536 /* Method's (list) enclosing context */
10537 tree mec = DECL_CONTEXT (TYPE_NAME (DECL_CONTEXT (list)));
10538 /* If we have a primary, use it. */
10540 extra_arg = primary;
10541 /* The current `this' is an inner class but isn't a direct
10542 enclosing context for the inner class we're trying to
10543 create. Build an access to the proper enclosing context
10545 else if (current_this && PURE_INNER_CLASS_TYPE_P (this_type)
10546 && this_type != TREE_TYPE (mec))
10549 extra_arg = build_access_to_thisn (current_class,
10550 TREE_TYPE (mec), 0);
10551 extra_arg = java_complete_tree (extra_arg);
10553 /* Otherwise, just use the current `this' as an enclosing
10556 extra_arg = current_this;
10557 args = tree_cons (NULL_TREE, extra_arg, args);
10560 args = tree_cons (NULL_TREE, integer_zero_node, args);
10563 /* This handles the situation where a constructor invocation needs
10564 to have an enclosing context passed as a second parameter (the
10565 constructor is one of an inner class). */
10566 if ((is_super_init ||
10567 (TREE_CODE (patch) == CALL_EXPR && name == this_identifier_node))
10568 && PURE_INNER_CLASS_TYPE_P (DECL_CONTEXT (list)))
10570 tree dest = TYPE_NAME (DECL_CONTEXT (list));
10572 build_access_to_thisn (current_class, DECL_CONTEXT (dest), 0);
10573 extra_arg = java_complete_tree (extra_arg);
10574 args = tree_cons (NULL_TREE, extra_arg, args);
10577 is_static_flag = METHOD_STATIC (list);
10578 if (! is_static_flag && this_arg != NULL_TREE)
10579 args = tree_cons (NULL_TREE, this_arg, args);
10581 /* In the context of an explicit constructor invocation, we can't
10582 invoke any method relying on `this'. Exceptions are: we're
10583 invoking a static function, primary exists and is not the current
10584 this, we're creating a new object. */
10585 if (ctxp->explicit_constructor_p
10587 && (!primary || primary == current_this)
10588 && (TREE_CODE (patch) != NEW_CLASS_EXPR))
10590 parse_error_context (wfl, "Can't reference `this' before the superclass constructor has been called");
10591 PATCH_METHOD_RETURN_ERROR ();
10593 java_parser_context_restore_global ();
10595 *is_static = is_static_flag;
10596 /* Sometimes, we want the decl of the selected method. Such as for
10600 patch = patch_invoke (patch, list, args);
10602 /* Now is a good time to insert the call to finit$ */
10603 if (is_super_init && CLASS_HAS_FINIT_P (current_class))
10605 tree finit_parms, finit_call;
10607 /* Prepare to pass hidden parameters to finit$, if any. */
10608 finit_parms = build_alias_initializer_parameter_list
10609 (AIPL_FUNCTION_FINIT_INVOCATION, current_class, NULL_TREE, NULL);
10612 build_method_invocation (build_wfl_node (finit_identifier_node),
10615 /* Generate the code used to initialize fields declared with an
10616 initialization statement and build a compound statement along
10617 with the super constructor invocation. */
10618 CAN_COMPLETE_NORMALLY (patch) = 1;
10619 patch = build2 (COMPOUND_EXPR, void_type_node, patch,
10620 java_complete_tree (finit_call));
10625 /* Check that we're not trying to do a static reference to a method in
10626 non static method. Return 1 if it's the case, 0 otherwise. */
10629 check_for_static_method_reference (tree wfl, tree node, tree method,
10630 tree where, tree primary)
10632 if (METHOD_STATIC (current_function_decl)
10633 && !METHOD_STATIC (method) && !primary && !CALL_CONSTRUCTOR_P (node))
10635 char *fct_name = xstrdup (lang_printable_name (method, 0));
10636 parse_error_context
10637 (wfl, "Can't make static reference to method `%s %s' in class `%s'",
10638 lang_printable_name (TREE_TYPE (TREE_TYPE (method)), 0), fct_name,
10639 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (where))));
10646 /* Fix the invocation of *MDECL if necessary in the case of a
10647 invocation from an inner class. *THIS_ARG might be modified
10648 appropriately and an alternative access to *MDECL might be
10652 maybe_use_access_method (int is_super_init, tree *mdecl, tree *this_arg)
10655 tree md = *mdecl, ta = *this_arg;
10657 int non_static_context = !METHOD_STATIC (md);
10660 || DECL_CONTEXT (md) == current_class
10661 || !PURE_INNER_CLASS_TYPE_P (current_class)
10662 || DECL_FINIT_P (md)
10663 || DECL_INSTINIT_P (md))
10666 /* If we're calling a method found in an enclosing class, generate
10667 what it takes to retrieve the right this. Don't do that if we're
10668 invoking a static method. Note that if MD's type is unrelated to
10669 CURRENT_CLASS, then the current this can be used. */
10671 if (non_static_context && DECL_CONTEXT (md) != object_type_node)
10673 ctx = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (current_class)));
10674 if (inherits_from_p (ctx, DECL_CONTEXT (md)))
10676 ta = build_current_thisn (current_class);
10677 ta = build_wfl_node (ta);
10684 maybe_build_thisn_access_method (type);
10685 if (inherits_from_p (type, DECL_CONTEXT (md)))
10687 ta = build_access_to_thisn (ctx, type, 0);
10690 type = (DECL_CONTEXT (TYPE_NAME (type)) ?
10691 TREE_TYPE (DECL_CONTEXT (TYPE_NAME (type))) : NULL_TREE);
10694 ta = java_complete_tree (ta);
10697 /* We might have to use an access method to get to MD. We can
10698 break the method access rule as far as we're not generating
10700 if (METHOD_PRIVATE (md) && flag_emit_class_files)
10702 md = build_outer_method_access_method (md);
10709 /* Returning a nonzero value indicates we were doing a non static
10710 method invocation that is now a static invocation. It will have
10711 callee displace `this' to insert it in the regular argument
10713 return (non_static_context && to_return);
10716 /* Patch an invoke expression METHOD and ARGS, based on its invocation
10720 patch_invoke (tree patch, tree method, tree args)
10723 tree original_call, t, ta;
10724 tree check = NULL_TREE;
10726 /* Last step for args: convert build-in types. If we're dealing with
10727 a new TYPE() type call, the first argument to the constructor
10728 isn't found in the incoming argument list, but delivered by
10730 t = TYPE_ARG_TYPES (TREE_TYPE (method));
10731 if (TREE_CODE (patch) == NEW_CLASS_EXPR)
10732 t = TREE_CHAIN (t);
10733 for (ta = args; t != end_params_node && ta;
10734 t = TREE_CHAIN (t), ta = TREE_CHAIN (ta))
10735 if (JPRIMITIVE_TYPE_P (TREE_TYPE (TREE_VALUE (ta))) &&
10736 TREE_TYPE (TREE_VALUE (ta)) != TREE_VALUE (t))
10737 TREE_VALUE (ta) = convert (TREE_VALUE (t), TREE_VALUE (ta));
10739 /* Resolve unresolved returned type issues */
10740 t = TREE_TYPE (TREE_TYPE (method));
10741 if (TREE_CODE (t) == POINTER_TYPE && !CLASS_LOADED_P (TREE_TYPE (t)))
10742 resolve_and_layout (TREE_TYPE (t), NULL);
10744 if (flag_emit_class_files || flag_emit_xref)
10748 switch (invocation_mode (method, CALL_USING_SUPER (patch)))
10750 case INVOKE_VIRTUAL:
10751 dtable = invoke_build_dtable (0, args);
10752 func = build_invokevirtual (dtable, method);
10755 case INVOKE_NONVIRTUAL:
10756 /* If the object for the method call is null, we throw an
10757 exception. We don't do this if the object is the current
10758 method's `this'. In other cases we just rely on an
10759 optimization pass to eliminate redundant checks. */
10760 if (TREE_VALUE (args) != current_this)
10762 /* We use a save_expr here to make sure we only evaluate
10763 the new `self' expression once. */
10764 tree save_arg = save_expr (TREE_VALUE (args));
10765 TREE_VALUE (args) = save_arg;
10766 check = java_check_reference (save_arg, 1);
10768 /* Fall through. */
10771 case INVOKE_STATIC:
10773 tree signature = build_java_signature (TREE_TYPE (method));
10774 func = build_known_method_ref (method, TREE_TYPE (method),
10775 DECL_CONTEXT (method),
10780 case INVOKE_INTERFACE:
10781 dtable = invoke_build_dtable (1, args);
10782 func = build_invokeinterface (dtable, method);
10789 /* Ensure self_type is initialized, (invokestatic). FIXME */
10790 func = build1 (NOP_EXPR, build_pointer_type (TREE_TYPE (method)), func);
10793 TREE_TYPE (patch) = TREE_TYPE (TREE_TYPE (method));
10794 TREE_OPERAND (patch, 0) = func;
10795 TREE_OPERAND (patch, 1) = args;
10796 patch = check_for_builtin (method, patch);
10797 original_call = patch;
10799 /* We're processing a `new TYPE ()' form. New is called and its
10800 returned value is the first argument to the constructor. We build
10801 a COMPOUND_EXPR and use saved expression so that the overall NEW
10802 expression value is a pointer to a newly created and initialized
10804 if (TREE_CODE (original_call) == NEW_CLASS_EXPR)
10806 tree class = DECL_CONTEXT (method);
10807 tree c1, saved_new, size, new;
10810 if (flag_emit_class_files || flag_emit_xref)
10812 TREE_TYPE (patch) = build_pointer_type (class);
10815 if (!TYPE_SIZE (class))
10816 safe_layout_class (class);
10817 size = size_in_bytes (class);
10819 (class_has_finalize_method (class) ? alloc_object_node
10820 : alloc_no_finalizer_node);
10821 new = build3 (CALL_EXPR, promote_type (class),
10822 build_address_of (alloc_node),
10823 build_tree_list (NULL_TREE, build_class_ref (class)),
10825 saved_new = save_expr (new);
10826 c1 = build_tree_list (NULL_TREE, saved_new);
10827 TREE_CHAIN (c1) = TREE_OPERAND (original_call, 1);
10828 TREE_OPERAND (original_call, 1) = c1;
10829 TREE_SET_CODE (original_call, CALL_EXPR);
10830 patch = build2 (COMPOUND_EXPR, TREE_TYPE (new), patch, saved_new);
10833 /* If CHECK is set, then we are building a check to see if the object
10835 if (check != NULL_TREE)
10837 /* We have to call force_evaluation_order now because creating a
10838 COMPOUND_EXPR wraps the arg list in a way that makes it
10839 unrecognizable by force_evaluation_order later. Yuk. */
10840 patch = build2 (COMPOUND_EXPR, TREE_TYPE (patch), check,
10841 force_evaluation_order (patch));
10842 TREE_SIDE_EFFECTS (patch) = 1;
10845 /* In order to be able to modify PATCH later, we SAVE_EXPR it and
10846 put it as the first expression of a COMPOUND_EXPR. The second
10847 expression being an empty statement to be later patched if
10848 necessary. We remember a TREE_LIST (the PURPOSE is the method,
10849 the VALUE is the compound) in a hashtable and return a
10850 COMPOUND_EXPR built so that the result of the evaluation of the
10851 original PATCH node is returned. */
10852 if (STATIC_CLASS_INIT_OPT_P ()
10853 && current_function_decl && METHOD_STATIC (method))
10856 tree fndecl = current_function_decl;
10857 /* We have to call force_evaluation_order now because creating a
10858 COMPOUND_EXPR wraps the arg list in a way that makes it
10859 unrecognizable by force_evaluation_order later. Yuk. */
10860 tree save = force_evaluation_order (patch);
10861 tree type = TREE_TYPE (patch);
10863 patch = build2 (COMPOUND_EXPR, type, save, build_java_empty_stmt ());
10864 list = tree_cons (method, patch,
10865 DECL_FUNCTION_STATIC_METHOD_INVOCATION_COMPOUND (fndecl));
10867 DECL_FUNCTION_STATIC_METHOD_INVOCATION_COMPOUND (fndecl) = list;
10869 patch = build2 (COMPOUND_EXPR, type, patch, save);
10876 invocation_mode (tree method, int super)
10878 int access = get_access_flags_from_decl (method);
10881 return INVOKE_SUPER;
10883 if (access & ACC_STATIC)
10884 return INVOKE_STATIC;
10886 /* We have to look for a constructor before we handle nonvirtual
10887 calls; otherwise the constructor will look nonvirtual. */
10888 if (DECL_CONSTRUCTOR_P (method))
10889 return INVOKE_STATIC;
10891 if (access & ACC_FINAL || access & ACC_PRIVATE)
10892 return INVOKE_NONVIRTUAL;
10894 if (CLASS_FINAL (TYPE_NAME (DECL_CONTEXT (method))))
10895 return INVOKE_NONVIRTUAL;
10897 if (CLASS_INTERFACE (TYPE_NAME (DECL_CONTEXT (method))))
10898 return INVOKE_INTERFACE;
10900 return INVOKE_VIRTUAL;
10903 /* Retrieve a refined list of matching methods. It covers the step
10904 15.11.2 (Compile-Time Step 2) */
10907 lookup_method_invoke (int lc, tree cl, tree class, tree name, tree arg_list)
10909 tree atl = end_params_node; /* Arg Type List */
10910 tree method, signature, list, node;
10911 const char *candidates; /* Used for error report */
10914 /* Fix the arguments */
10915 for (node = arg_list; node; node = TREE_CHAIN (node))
10917 tree current_arg = TREE_TYPE (TREE_VALUE (node));
10918 /* Non primitive type may have to be resolved */
10919 if (!JPRIMITIVE_TYPE_P (current_arg))
10920 resolve_and_layout (current_arg, NULL_TREE);
10922 if (TREE_CODE (current_arg) == RECORD_TYPE)
10923 current_arg = promote_type (current_arg);
10924 atl = tree_cons (NULL_TREE, current_arg, atl);
10927 /* Presto. If we're dealing with an anonymous class and a
10928 constructor call, generate the right constructor now, since we
10929 know the arguments' types. */
10931 if (lc && ANONYMOUS_CLASS_P (class))
10933 tree saved_current_class;
10934 tree mdecl = craft_constructor (TYPE_NAME (class), atl);
10935 saved_current_class = current_class;
10936 current_class = class;
10937 fix_constructors (mdecl);
10938 current_class = saved_current_class;
10941 /* Find all candidates and then refine the list, searching for the
10942 most specific method. */
10943 list = find_applicable_accessible_methods_list (lc, class, name, atl);
10944 list = find_most_specific_methods_list (list);
10945 if (list && !TREE_CHAIN (list))
10946 return TREE_VALUE (list);
10948 /* Issue an error. List candidates if any. Candidates are listed
10949 only if accessible (non accessible methods may end-up here for
10950 the sake of a better error report). */
10955 obstack_grow (&temporary_obstack, ". Candidates are:\n", 18);
10956 for (current = list; current; current = TREE_CHAIN (current))
10958 tree cm = TREE_VALUE (current);
10959 char string [4096];
10960 if (!cm || not_accessible_p (class, cm, NULL_TREE, 0))
10963 (string, " `%s' in `%s'%s",
10964 get_printable_method_name (cm),
10965 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (DECL_CONTEXT (cm)))),
10966 (TREE_CHAIN (current) ? "\n" : ""));
10967 obstack_grow (&temporary_obstack, string, strlen (string));
10969 obstack_1grow (&temporary_obstack, '\0');
10970 candidates = obstack_finish (&temporary_obstack);
10972 /* Issue the error message */
10973 method = make_node (FUNCTION_TYPE);
10974 TYPE_ARG_TYPES (method) = atl;
10975 signature = build_java_argument_signature (method);
10976 dup = xstrdup (lang_printable_name (class, 0));
10977 parse_error_context (cl, "Can't find %s `%s(%s)' in type `%s'%s",
10978 (lc ? "constructor" : "method"),
10979 (lc ? dup : IDENTIFIER_POINTER (name)),
10980 IDENTIFIER_POINTER (signature), dup,
10981 (candidates ? candidates : ""));
10986 /* 15.11.2.1: Find Methods that are Applicable and Accessible. LC is 1
10987 when we're looking for a constructor. */
10990 find_applicable_accessible_methods_list (int lc, tree class, tree name,
10993 static htab_t searched_classes;
10994 static int search_not_done = 0;
10995 tree list = NULL_TREE, all_list = NULL_TREE;
10999 /* Check the hash table to determine if this class has been searched
11001 if (searched_classes)
11003 if (htab_find (searched_classes, class) != NULL)
11008 searched_classes = htab_create (10, htab_hash_pointer,
11009 htab_eq_pointer, NULL);
11013 *htab_find_slot (searched_classes, class, INSERT) = class;
11015 if (!CLASS_LOADED_P (class))
11017 load_class (class, 1);
11018 safe_layout_class (class);
11021 /* Search interfaces */
11022 if (TREE_CODE (TYPE_NAME (class)) == TYPE_DECL
11023 && CLASS_INTERFACE (TYPE_NAME (class)))
11025 search_applicable_methods_list (lc, TYPE_METHODS (class),
11026 name, arglist, &list, &all_list);
11027 for (i = 1; BINFO_BASE_ITERATE (TYPE_BINFO (class), i, base_binfo); i++)
11029 tree t = BINFO_TYPE (base_binfo);
11032 rlist = find_applicable_accessible_methods_list (lc, t, name,
11034 list = chainon (rlist, list);
11037 /* Search classes */
11040 search_applicable_methods_list (lc, TYPE_METHODS (class),
11041 name, arglist, &list, &all_list);
11043 /* When looking finit$, class$ or instinit$, we turn LC to 1 so
11044 that we only search in class. Note that we should have found
11045 something at this point. */
11046 if (ID_FINIT_P (name) || ID_CLASSDOLLAR_P (name) || ID_INSTINIT_P (name))
11053 /* We must search all interfaces of this class */
11057 BINFO_BASE_ITERATE (TYPE_BINFO (class), i, base_binfo); i++)
11059 tree t = BINFO_TYPE (base_binfo);
11060 if (t != object_type_node)
11063 = find_applicable_accessible_methods_list (lc, t,
11065 list = chainon (rlist, list);
11070 /* Search superclass */
11071 if (!lc && CLASSTYPE_SUPER (class) != NULL_TREE)
11074 class = CLASSTYPE_SUPER (class);
11075 rlist = find_applicable_accessible_methods_list (lc, class,
11077 list = chainon (rlist, list);
11083 /* We're done. Reset the searched classes list and finally search
11084 java.lang.Object if it wasn't searched already. */
11085 if (!search_not_done)
11088 && TYPE_METHODS (object_type_node)
11089 && htab_find (searched_classes, object_type_node) == NULL)
11091 search_applicable_methods_list (lc,
11092 TYPE_METHODS (object_type_node),
11093 name, arglist, &list, &all_list);
11095 htab_delete (searched_classes);
11096 searched_classes = NULL;
11099 /* Either return the list obtained or all selected (but
11100 inaccessible) methods for better error report. */
11101 return (!list ? all_list : list);
11104 /* Effectively search for the appropriate method in method */
11107 search_applicable_methods_list (int lc, tree method, tree name, tree arglist,
11108 tree *list, tree *all_list)
11110 for (; method; method = TREE_CHAIN (method))
11112 /* When dealing with constructor, stop here, otherwise search
11114 if (lc && !DECL_CONSTRUCTOR_P (method))
11116 else if (!lc && (DECL_CONSTRUCTOR_P (method)
11117 || (DECL_NAME (method) != name)))
11120 if (argument_types_convertible (method, arglist))
11122 /* Retain accessible methods only */
11123 if (!not_accessible_p (DECL_CONTEXT (current_function_decl),
11124 method, NULL_TREE, 0))
11125 *list = tree_cons (NULL_TREE, method, *list);
11127 /* Also retain all selected method here */
11128 *all_list = tree_cons (NULL_TREE, method, *list);
11133 /* 15.11.2.2 Choose the Most Specific Method */
11136 find_most_specific_methods_list (tree list)
11139 int abstract, candidates;
11140 tree current, new_list = NULL_TREE;
11141 for (current = list; current; current = TREE_CHAIN (current))
11144 DECL_SPECIFIC_COUNT (TREE_VALUE (current)) = 0;
11146 for (method = list; method; method = TREE_CHAIN (method))
11148 tree method_v, current_v;
11149 /* Don't test a method against itself */
11150 if (method == current)
11153 method_v = TREE_VALUE (method);
11154 current_v = TREE_VALUE (current);
11156 /* Compare arguments and location where methods where declared */
11157 if (argument_types_convertible (method_v, current_v))
11159 if (valid_method_invocation_conversion_p
11160 (DECL_CONTEXT (method_v), DECL_CONTEXT (current_v))
11161 || (INNER_CLASS_TYPE_P (DECL_CONTEXT (current_v))
11162 && enclosing_context_p (DECL_CONTEXT (method_v),
11163 DECL_CONTEXT (current_v))))
11165 int v = (DECL_SPECIFIC_COUNT (current_v) +=
11166 (INNER_CLASS_TYPE_P (DECL_CONTEXT (current_v)) ? 2 : 1));
11167 max = (v > max ? v : max);
11173 /* Review the list and select the maximally specific methods */
11174 for (current = list, abstract = -1, candidates = -1;
11175 current; current = TREE_CHAIN (current))
11176 if (DECL_SPECIFIC_COUNT (TREE_VALUE (current)) == max)
11178 new_list = tree_cons (NULL_TREE, TREE_VALUE (current), new_list);
11179 abstract += (METHOD_ABSTRACT (TREE_VALUE (current)) ? 1 : 0);
11183 /* If we have several and they're all abstract, just pick the
11185 if (candidates > 0 && candidates == abstract)
11187 /* FIXME: merge the throws clauses. There is no convenient way
11188 to do this in gcj right now, since ideally we'd like to
11189 introduce a new METHOD_DECL here, but that is really not
11191 new_list = nreverse (new_list);
11192 TREE_CHAIN (new_list) = NULL_TREE;
11196 /* We have several (we couldn't find a most specific), all but one
11197 are abstract, we pick the only non abstract one. */
11198 if (candidates > 0 && (candidates == abstract+1))
11200 for (current = new_list; current; current = TREE_CHAIN (current))
11201 if (!METHOD_ABSTRACT (TREE_VALUE (current)))
11203 TREE_CHAIN (current) = NULL_TREE;
11204 new_list = current;
11208 /* If we can't find one, lower expectations and try to gather multiple
11209 maximally specific methods */
11210 while (!new_list && max)
11214 if (DECL_SPECIFIC_COUNT (TREE_VALUE (current)) == max)
11215 new_list = tree_cons (NULL_TREE, TREE_VALUE (current), new_list);
11222 /* Make sure that the type of each M2_OR_ARGLIST arguments can be
11223 converted by method invocation conversion (5.3) to the type of the
11224 corresponding parameter of M1. Implementation expects M2_OR_ARGLIST
11225 to change less often than M1. */
11227 static GTY(()) tree m2_arg_value;
11228 static GTY(()) tree m2_arg_cache;
11231 argument_types_convertible (tree m1, tree m2_or_arglist)
11233 tree m1_arg, m2_arg;
11235 SKIP_THIS_AND_ARTIFICIAL_PARMS (m1_arg, m1)
11237 if (m2_arg_value == m2_or_arglist)
11238 m2_arg = m2_arg_cache;
11241 /* M2_OR_ARGLIST can be a function DECL or a raw list of
11243 if (m2_or_arglist && TREE_CODE (m2_or_arglist) == FUNCTION_DECL)
11245 m2_arg = TYPE_ARG_TYPES (TREE_TYPE (m2_or_arglist));
11246 if (!METHOD_STATIC (m2_or_arglist))
11247 m2_arg = TREE_CHAIN (m2_arg);
11250 m2_arg = m2_or_arglist;
11252 m2_arg_value = m2_or_arglist;
11253 m2_arg_cache = m2_arg;
11256 while (m1_arg != end_params_node && m2_arg != end_params_node)
11258 resolve_and_layout (TREE_VALUE (m1_arg), NULL_TREE);
11259 if (!valid_method_invocation_conversion_p (TREE_VALUE (m1_arg),
11260 TREE_VALUE (m2_arg)))
11262 m1_arg = TREE_CHAIN (m1_arg);
11263 m2_arg = TREE_CHAIN (m2_arg);
11265 return m1_arg == end_params_node && m2_arg == end_params_node;
11268 /* Qualification routines */
11270 /* Given a name x.y.z, look up x locally. If it's found, save the
11271 decl. If it's not found, mark the name as RESOLVE_PACKAGE_NAME_P,
11272 so that we later try and load the appropriate classes. */
11274 qualify_ambiguous_name (tree id)
11278 /* We inspect the first item of the qualification list. As a sanity
11279 check, make sure that it is an identfier node. */
11280 tree qual = EXPR_WFL_QUALIFICATION (id);
11281 tree qual_wfl = QUAL_WFL (qual);
11283 if (TREE_CODE (qual_wfl) != EXPR_WITH_FILE_LOCATION)
11286 name = EXPR_WFL_NODE (qual_wfl);
11288 /* If we don't have an identifier, or we have a 'this' or 'super',
11289 then field access processing is all we need : there is nothing
11291 if (!name || TREE_CODE (name) != IDENTIFIER_NODE ||
11292 name == this_identifier_node ||
11293 name == super_identifier_node)
11296 /* If name appears within the scope of a local variable declaration
11297 or parameter declaration, or is a field within an enclosing
11298 class, then it is an expression name. Save the decl and let
11299 resolve_field_access do it's work. */
11300 if ((decl = IDENTIFIER_LOCAL_VALUE (name)) ||
11301 (decl = lookup_field_wrapper (current_class, name)))
11303 QUAL_RESOLUTION (qual) = decl;
11307 /* If name is a known class name (either declared or imported), mark
11308 us as a type name. */
11309 if ((decl = resolve_and_layout (name, NULL_TREE)))
11311 RESOLVE_TYPE_NAME_P (qual_wfl) = 1;
11312 QUAL_RESOLUTION (qual) = decl;
11315 /* Check here that NAME isn't declared by more than one
11316 type-import-on-demand declaration of the compilation unit
11317 containing NAME. FIXME */
11319 /* We couldn't find a declaration for the name. Assume for now that
11320 we have a qualified class name that needs to be loaded from an
11321 external class file. */
11323 RESOLVE_PACKAGE_NAME_P (qual_wfl) = 1;
11325 /* Propagate the qualification across other components of the
11327 for (qual = TREE_CHAIN (qual); qual;
11328 qual_wfl = QUAL_WFL (qual), qual = TREE_CHAIN (qual))
11330 if (RESOLVE_PACKAGE_NAME_P (qual_wfl))
11331 RESOLVE_PACKAGE_NAME_P (QUAL_WFL (qual)) = 1;
11334 /* Store the global qualification for the ambiguous part of ID back
11336 if (RESOLVE_TYPE_NAME_P (qual_wfl))
11337 RESOLVE_TYPE_NAME_P (id) = 1;
11338 else if (RESOLVE_PACKAGE_NAME_P (qual_wfl))
11339 RESOLVE_PACKAGE_NAME_P (id) = 1;
11342 /* Patch tree nodes in a function body. When a BLOCK is found, push
11343 local variable decls if present.
11344 Same as java_complete_lhs, but does resolve static finals to values. */
11347 java_complete_tree (tree node)
11349 node = java_complete_lhs (node);
11350 if (JDECL_P (node) && CLASS_FINAL_VARIABLE_P (node)
11351 && DECL_INITIAL (node) != NULL_TREE
11352 && !flag_emit_xref)
11354 tree value = fold_constant_for_init (node, node);
11355 if (value != NULL_TREE)
11362 java_stabilize_reference (tree node)
11364 if (TREE_CODE (node) == COMPOUND_EXPR)
11366 tree op0 = TREE_OPERAND (node, 0);
11367 tree op1 = TREE_OPERAND (node, 1);
11368 TREE_OPERAND (node, 0) = save_expr (op0);
11369 TREE_OPERAND (node, 1) = java_stabilize_reference (op1);
11372 return stabilize_reference (node);
11375 /* Patch tree nodes in a function body. When a BLOCK is found, push
11376 local variable decls if present.
11377 Same as java_complete_tree, but does not resolve static finals to values. */
11380 java_complete_lhs (tree node)
11382 tree nn, cn, wfl_op1, wfl_op2, wfl_op3;
11385 /* CONVERT_EXPR always has its type set, even though it needs to be
11387 if (TREE_TYPE (node) && TREE_CODE (node) != CONVERT_EXPR)
11390 /* The switch block implements cases processing container nodes
11391 first. Contained nodes are always written back. Leaves come
11392 next and return a value. */
11393 switch (TREE_CODE (node))
11397 /* 1- Block section.
11398 Set the local values on decl names so we can identify them
11399 faster when they're referenced. At that stage, identifiers
11400 are legal so we don't check for declaration errors. */
11401 for (cn = BLOCK_EXPR_DECLS (node); cn; cn = TREE_CHAIN (cn))
11403 DECL_CONTEXT (cn) = current_function_decl;
11404 IDENTIFIER_LOCAL_VALUE (DECL_NAME (cn)) = cn;
11406 if (BLOCK_EXPR_BODY (node) == NULL_TREE)
11407 CAN_COMPLETE_NORMALLY (node) = 1;
11410 tree stmt = BLOCK_EXPR_BODY (node);
11412 int error_seen = 0;
11413 if (TREE_CODE (stmt) == COMPOUND_EXPR)
11415 /* Re-order from (((A; B); C); ...; Z) to
11416 (A; (B; (C ; (...; Z)))).
11417 This makes it easier to scan the statements left-to-right
11418 without using recursion (which might overflow the stack
11419 if the block has many statements. */
11422 tree left = TREE_OPERAND (stmt, 0);
11423 if (TREE_CODE (left) != COMPOUND_EXPR)
11425 TREE_OPERAND (stmt, 0) = TREE_OPERAND (left, 1);
11426 TREE_OPERAND (left, 1) = stmt;
11429 BLOCK_EXPR_BODY (node) = stmt;
11432 /* Now do the actual complete, without deep recursion for
11434 ptr = &BLOCK_EXPR_BODY (node);
11435 while (TREE_CODE (*ptr) == COMPOUND_EXPR
11436 && !IS_EMPTY_STMT (TREE_OPERAND (*ptr, 1)))
11438 tree cur = java_complete_tree (TREE_OPERAND (*ptr, 0));
11439 tree *next = &TREE_OPERAND (*ptr, 1);
11440 TREE_OPERAND (*ptr, 0) = cur;
11441 if (IS_EMPTY_STMT (cur))
11443 /* Optimization; makes it easier to detect empty bodies.
11444 Most useful for <clinit> with all-constant initializer. */
11448 if (TREE_CODE (cur) == ERROR_MARK)
11450 else if (! CAN_COMPLETE_NORMALLY (cur))
11455 if (TREE_CODE (wfl_op2) == BLOCK)
11456 wfl_op2 = BLOCK_EXPR_BODY (wfl_op2);
11457 else if (TREE_CODE (wfl_op2) == COMPOUND_EXPR)
11458 wfl_op2 = TREE_OPERAND (wfl_op2, 0);
11462 if (TREE_CODE (wfl_op2) != CASE_EXPR
11463 && TREE_CODE (wfl_op2) != DEFAULT_EXPR)
11464 unreachable_stmt_error (*ptr);
11466 if (TREE_TYPE (*ptr) == NULL_TREE)
11467 TREE_TYPE (*ptr) = void_type_node;
11470 *ptr = java_complete_tree (*ptr);
11472 if (TREE_CODE (*ptr) == ERROR_MARK || error_seen > 0)
11473 return error_mark_node;
11474 CAN_COMPLETE_NORMALLY (node) = CAN_COMPLETE_NORMALLY (*ptr);
11476 /* Turn local bindings to null */
11477 for (cn = BLOCK_EXPR_DECLS (node); cn; cn = TREE_CHAIN (cn))
11478 IDENTIFIER_LOCAL_VALUE (DECL_NAME (cn)) = NULL_TREE;
11480 TREE_TYPE (node) = void_type_node;
11483 /* 2- They are expressions but ultimately deal with statements */
11486 wfl_op1 = TREE_OPERAND (node, 0);
11487 COMPLETE_CHECK_OP_0 (node);
11488 /* 14.19 A throw statement cannot complete normally. */
11489 CAN_COMPLETE_NORMALLY (node) = 0;
11490 return patch_throw_statement (node, wfl_op1);
11492 case SYNCHRONIZED_EXPR:
11493 wfl_op1 = TREE_OPERAND (node, 0);
11494 return patch_synchronized_statement (node, wfl_op1);
11497 return patch_try_statement (node);
11499 case TRY_FINALLY_EXPR:
11500 COMPLETE_CHECK_OP_0 (node);
11501 COMPLETE_CHECK_OP_1 (node);
11502 if (IS_EMPTY_STMT (TREE_OPERAND (node, 0)))
11503 /* Reduce try/finally nodes with an empty try block. */
11504 return TREE_OPERAND (node, 1);
11505 if (IS_EMPTY_STMT (TREE_OPERAND (node, 1)))
11506 /* Likewise for an empty finally block. */
11507 return TREE_OPERAND (node, 0);
11508 CAN_COMPLETE_NORMALLY (node)
11509 = (CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 0))
11510 && CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 1)));
11511 TREE_TYPE (node) = TREE_TYPE (TREE_OPERAND (node, 0));
11514 case LABELED_BLOCK_EXPR:
11515 PUSH_LABELED_BLOCK (node);
11516 if (LABELED_BLOCK_BODY (node))
11517 COMPLETE_CHECK_OP_1 (node);
11518 TREE_TYPE (node) = void_type_node;
11519 POP_LABELED_BLOCK ();
11521 if (IS_EMPTY_STMT (LABELED_BLOCK_BODY (node)))
11523 LABELED_BLOCK_BODY (node) = NULL_TREE;
11524 CAN_COMPLETE_NORMALLY (node) = 1;
11526 else if (CAN_COMPLETE_NORMALLY (LABELED_BLOCK_BODY (node)))
11527 CAN_COMPLETE_NORMALLY (node) = 1;
11530 case EXIT_BLOCK_EXPR:
11531 /* We don't complete operand 1, because it's the return value of
11532 the EXIT_BLOCK_EXPR which doesn't exist it Java */
11533 return patch_bc_statement (node);
11536 cn = java_complete_tree (TREE_OPERAND (node, 0));
11537 if (cn == error_mark_node)
11540 /* First, the case expression must be constant. Values of final
11541 fields are accepted. */
11543 if ((TREE_CODE (cn) == COMPOUND_EXPR || TREE_CODE (cn) == COMPONENT_REF)
11544 && JDECL_P (TREE_OPERAND (cn, 1))
11545 && FIELD_FINAL (TREE_OPERAND (cn, 1))
11546 && DECL_INITIAL (TREE_OPERAND (cn, 1)))
11548 cn = fold_constant_for_init (DECL_INITIAL (TREE_OPERAND (cn, 1)),
11549 TREE_OPERAND (cn, 1));
11551 /* Accept final locals too. */
11552 else if (TREE_CODE (cn) == VAR_DECL && DECL_FINAL (cn)
11553 && DECL_INITIAL (cn))
11554 cn = fold_constant_for_init (DECL_INITIAL (cn), cn);
11556 if (!TREE_CONSTANT (cn) && !flag_emit_xref)
11558 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
11559 parse_error_context (node, "Constant expression required");
11560 return error_mark_node;
11563 nn = ctxp->current_loop;
11565 /* It must be assignable to the type of the switch expression. */
11566 if (!try_builtin_assignconv (NULL_TREE,
11567 TREE_TYPE (TREE_OPERAND (nn, 0)), cn))
11569 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
11570 parse_error_context
11572 "Incompatible type for case. Can't convert `%s' to `int'",
11573 lang_printable_name (TREE_TYPE (cn), 0));
11574 return error_mark_node;
11577 cn = fold (convert (int_type_node, cn));
11578 TREE_CONSTANT_OVERFLOW (cn) = 0;
11579 CAN_COMPLETE_NORMALLY (cn) = 1;
11581 /* Save the label on a list so that we can later check for
11583 case_label_list = tree_cons (node, cn, case_label_list);
11585 /* Multiple instance of a case label bearing the same value is
11586 checked later. The case expression is all right so far. */
11587 if (TREE_CODE (cn) == VAR_DECL)
11588 cn = DECL_INITIAL (cn);
11589 TREE_OPERAND (node, 0) = cn;
11590 TREE_TYPE (node) = void_type_node;
11591 CAN_COMPLETE_NORMALLY (node) = 1;
11592 TREE_SIDE_EFFECTS (node) = 1;
11596 nn = ctxp->current_loop;
11597 /* Only one default label is allowed per switch statement */
11598 if (SWITCH_HAS_DEFAULT (nn))
11600 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
11601 parse_error_context (wfl_operator,
11602 "Duplicate case label: `default'");
11603 return error_mark_node;
11606 SWITCH_HAS_DEFAULT (nn) = 1;
11607 TREE_TYPE (node) = void_type_node;
11608 TREE_SIDE_EFFECTS (node) = 1;
11609 CAN_COMPLETE_NORMALLY (node) = 1;
11615 /* Check whether the loop was enclosed in a labeled
11616 statement. If not, create one, insert the loop in it and
11618 nn = patch_loop_statement (node);
11620 /* Anyways, walk the body of the loop */
11621 if (TREE_CODE (node) == LOOP_EXPR)
11622 TREE_OPERAND (node, 0) = java_complete_tree (TREE_OPERAND (node, 0));
11623 /* Switch statement: walk the switch expression and the cases */
11625 node = patch_switch_statement (node);
11627 if (node == error_mark_node || TREE_OPERAND (node, 0) == error_mark_node)
11628 nn = error_mark_node;
11631 TREE_TYPE (nn) = TREE_TYPE (node) = void_type_node;
11632 /* If we returned something different, that's because we
11633 inserted a label. Pop the label too. */
11636 if (CAN_COMPLETE_NORMALLY (node))
11637 CAN_COMPLETE_NORMALLY (nn) = 1;
11638 POP_LABELED_BLOCK ();
11645 TREE_OPERAND (node, 0) = java_complete_tree (TREE_OPERAND (node, 0));
11646 return patch_exit_expr (node);
11650 TREE_OPERAND (node, 0) = java_complete_tree (TREE_OPERAND (node, 0));
11651 if (TREE_OPERAND (node, 0) == error_mark_node)
11652 return error_mark_node;
11653 /* then-else branches */
11654 TREE_OPERAND (node, 1) = java_complete_tree (TREE_OPERAND (node, 1));
11655 if (TREE_OPERAND (node, 1) == error_mark_node)
11656 return error_mark_node;
11657 TREE_OPERAND (node, 2) = java_complete_tree (TREE_OPERAND (node, 2));
11658 if (TREE_OPERAND (node, 2) == error_mark_node)
11659 return error_mark_node;
11660 return patch_if_else_statement (node);
11663 case CONDITIONAL_EXPR:
11665 wfl_op1 = TREE_OPERAND (node, 0);
11666 COMPLETE_CHECK_OP_0 (node);
11667 wfl_op2 = TREE_OPERAND (node, 1);
11668 COMPLETE_CHECK_OP_1 (node);
11669 wfl_op3 = TREE_OPERAND (node, 2);
11670 COMPLETE_CHECK_OP_2 (node);
11671 return patch_conditional_expr (node, wfl_op1, wfl_op2);
11673 /* 3- Expression section */
11674 case COMPOUND_EXPR:
11675 wfl_op2 = TREE_OPERAND (node, 1);
11676 TREE_OPERAND (node, 0) = nn =
11677 java_complete_tree (TREE_OPERAND (node, 0));
11678 if (IS_EMPTY_STMT (wfl_op2))
11679 CAN_COMPLETE_NORMALLY (node) = CAN_COMPLETE_NORMALLY (nn);
11682 if (! CAN_COMPLETE_NORMALLY (nn) && TREE_CODE (nn) != ERROR_MARK)
11684 /* An unreachable condition in a do-while statement
11685 is *not* (technically) an unreachable statement. */
11687 if (TREE_CODE (nn) == EXPR_WITH_FILE_LOCATION)
11688 nn = EXPR_WFL_NODE (nn);
11689 /* NN can be NULL_TREE exactly when UPDATE is, in
11690 finish_for_loop. */
11691 if (nn != NULL_TREE && TREE_CODE (nn) != EXIT_EXPR)
11693 SET_WFL_OPERATOR (wfl_operator, node, wfl_op2);
11694 if (SUPPRESS_UNREACHABLE_ERROR (nn))
11696 /* Perhaps this warning should have an
11697 associated flag. The code being compiled is
11698 pedantically correct, but useless. */
11699 parse_warning_context (wfl_operator,
11700 "Unreachable statement");
11703 parse_error_context (wfl_operator,
11704 "Unreachable statement");
11707 TREE_OPERAND (node, 1) = java_complete_tree (TREE_OPERAND (node, 1));
11708 if (TREE_OPERAND (node, 1) == error_mark_node)
11709 return error_mark_node;
11710 /* Even though we might allow the case where the first
11711 operand doesn't return normally, we still should compute
11712 CAN_COMPLETE_NORMALLY correctly. */
11713 CAN_COMPLETE_NORMALLY (node)
11714 = (CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 0))
11715 && CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 1)));
11717 TREE_TYPE (node) = TREE_TYPE (TREE_OPERAND (node, 1));
11721 /* CAN_COMPLETE_NORMALLY (node) = 0; */
11722 return patch_return (node);
11724 case EXPR_WITH_FILE_LOCATION:
11725 if (!EXPR_WFL_NODE (node) /* Or a PRIMARY flag ? */
11726 || TREE_CODE (EXPR_WFL_NODE (node)) == IDENTIFIER_NODE)
11729 node = resolve_expression_name (node, NULL);
11730 if (node == error_mark_node)
11732 /* Keep line number information somewhere were it doesn't
11733 disrupt the completion process. */
11734 if (flag_emit_xref && TREE_CODE (node) != CALL_EXPR)
11736 EXPR_WFL_NODE (wfl) = TREE_OPERAND (node, 1);
11737 TREE_OPERAND (node, 1) = wfl;
11739 CAN_COMPLETE_NORMALLY (node) = 1;
11744 int save_lineno = input_line;
11745 input_line = EXPR_WFL_LINENO (node);
11746 body = java_complete_tree (EXPR_WFL_NODE (node));
11747 input_line = save_lineno;
11748 EXPR_WFL_NODE (node) = body;
11749 TREE_SIDE_EFFECTS (node) = TREE_SIDE_EFFECTS (body);
11750 CAN_COMPLETE_NORMALLY (node) = CAN_COMPLETE_NORMALLY (body);
11751 if (IS_EMPTY_STMT (body) || TREE_CONSTANT (body))
11753 /* Makes it easier to constant fold, detect empty bodies. */
11756 if (body == error_mark_node)
11758 /* Its important for the evaluation of assignment that
11759 this mark on the TREE_TYPE is propagated. */
11760 TREE_TYPE (node) = error_mark_node;
11761 return error_mark_node;
11764 TREE_TYPE (node) = TREE_TYPE (EXPR_WFL_NODE (node));
11769 case NEW_ARRAY_EXPR:
11770 /* Patch all the dimensions */
11772 for (cn = TREE_OPERAND (node, 1); cn; cn = TREE_CHAIN (cn))
11774 int location = EXPR_WFL_LINECOL (TREE_VALUE (cn));
11775 tree dim = convert (int_type_node,
11776 java_complete_tree (TREE_VALUE (cn)));
11777 if (dim == error_mark_node)
11784 TREE_VALUE (cn) = dim;
11785 /* Setup the location of the current dimension, for
11786 later error report. */
11787 TREE_PURPOSE (cn) =
11788 build_expr_wfl (NULL_TREE, input_filename, 0, 0);
11789 EXPR_WFL_LINECOL (TREE_PURPOSE (cn)) = location;
11792 /* They complete the array creation expression, if no errors
11794 CAN_COMPLETE_NORMALLY (node) = 1;
11795 return (flag ? error_mark_node
11796 : force_evaluation_order (patch_newarray (node)));
11798 case NEW_ANONYMOUS_ARRAY_EXPR:
11799 /* Create the array type if necessary. */
11800 if (ANONYMOUS_ARRAY_DIMS_SIG (node))
11802 tree type = ANONYMOUS_ARRAY_BASE_TYPE (node);
11803 if (!(type = resolve_type_during_patch (type)))
11804 return error_mark_node;
11805 type = build_array_from_name (type, NULL_TREE,
11806 ANONYMOUS_ARRAY_DIMS_SIG (node), NULL);
11807 ANONYMOUS_ARRAY_BASE_TYPE (node) = build_pointer_type (type);
11809 node = patch_new_array_init (ANONYMOUS_ARRAY_BASE_TYPE (node),
11810 ANONYMOUS_ARRAY_INITIALIZER (node));
11811 if (node == error_mark_node)
11812 return error_mark_node;
11813 CAN_COMPLETE_NORMALLY (node) = 1;
11816 case NEW_CLASS_EXPR:
11818 /* Complete function's argument(s) first */
11819 if (complete_function_arguments (node))
11820 return error_mark_node;
11823 tree decl, wfl = TREE_OPERAND (node, 0);
11824 int in_this = CALL_THIS_CONSTRUCTOR_P (node);
11825 int from_super = (EXPR_WFL_NODE (TREE_OPERAND (node, 0)) ==
11826 super_identifier_node);
11828 int location = EXPR_WFL_LINECOL (node);
11830 node = patch_method_invocation (node, NULL_TREE, NULL_TREE,
11831 from_super, 0, &decl);
11832 if (node == error_mark_node)
11833 return error_mark_node;
11835 if (TREE_CODE (node) == CALL_EXPR
11836 && TREE_OPERAND (node, 1) != NULL_TREE)
11837 arguments = TREE_VALUE (TREE_OPERAND (node, 1));
11839 arguments = NULL_TREE;
11840 check_thrown_exceptions (location, decl, arguments);
11841 /* If we call this(...), register signature and positions */
11843 DECL_CONSTRUCTOR_CALLS (current_function_decl) =
11844 tree_cons (wfl, decl,
11845 DECL_CONSTRUCTOR_CALLS (current_function_decl));
11846 CAN_COMPLETE_NORMALLY (node) = 1;
11847 return force_evaluation_order (node);
11851 /* Save potential wfls */
11852 wfl_op1 = TREE_OPERAND (node, 0);
11853 TREE_OPERAND (node, 0) = nn = java_complete_lhs (wfl_op1);
11855 if (MODIFY_EXPR_FROM_INITIALIZATION_P (node)
11856 && TREE_CODE (nn) == VAR_DECL && TREE_STATIC (nn)
11857 && DECL_INITIAL (nn) != NULL_TREE)
11861 value = fold_constant_for_init (nn, nn);
11863 /* When we have a primitype type, or a string and we're not
11864 emitting a class file, we actually don't want to generate
11865 anything for the assignment. */
11866 if (value != NULL_TREE &&
11867 (JPRIMITIVE_TYPE_P (TREE_TYPE (value)) ||
11868 (TREE_TYPE (value) == string_ptr_type_node &&
11869 ! flag_emit_class_files)))
11871 /* Prepare node for patch_assignment */
11872 TREE_OPERAND (node, 1) = value;
11873 /* Call patch assignment to verify the assignment */
11874 if (patch_assignment (node, wfl_op1) == error_mark_node)
11875 return error_mark_node;
11876 /* Set DECL_INITIAL properly (a conversion might have
11877 been decided by patch_assignment) and return the
11878 empty statement. */
11881 tree patched = patch_string (TREE_OPERAND (node, 1));
11883 DECL_INITIAL (nn) = patched;
11885 DECL_INITIAL (nn) = TREE_OPERAND (node, 1);
11886 DECL_FIELD_FINAL_IUD (nn) = 1;
11887 return build_java_empty_stmt ();
11890 if (! flag_emit_class_files)
11891 DECL_INITIAL (nn) = NULL_TREE;
11893 wfl_op2 = TREE_OPERAND (node, 1);
11895 if (TREE_OPERAND (node, 0) == error_mark_node)
11896 return error_mark_node;
11898 flag = COMPOUND_ASSIGN_P (wfl_op2);
11901 /* This might break when accessing outer field from inner
11902 class. TESTME, FIXME */
11903 tree lvalue = java_stabilize_reference (TREE_OPERAND (node, 0));
11905 /* Hand stabilize the lhs on both places */
11906 TREE_OPERAND (node, 0) = lvalue;
11907 TREE_OPERAND (TREE_OPERAND (node, 1), 0) =
11908 (flag_emit_class_files ? lvalue : save_expr (lvalue));
11910 /* 15.25.2.a: Left hand is not an array access. FIXME */
11911 /* Now complete the RHS. We write it back later on. */
11912 nn = java_complete_tree (TREE_OPERAND (node, 1));
11914 if ((cn = patch_string (nn)))
11917 /* The last part of the rewrite for E1 op= E2 is to have
11918 E1 = (T)(E1 op E2), with T being the type of E1. */
11919 nn = java_complete_tree (build_cast (EXPR_WFL_LINECOL (wfl_op2),
11920 TREE_TYPE (lvalue), nn));
11922 /* If the assignment is compound and has reference type,
11923 then ensure the LHS has type String and nothing else. */
11924 if (JREFERENCE_TYPE_P (TREE_TYPE (lvalue))
11925 && ! JSTRING_TYPE_P (TREE_TYPE (lvalue)))
11926 parse_error_context (wfl_op2,
11927 "Incompatible type for `+='. Can't convert `%s' to `java.lang.String'",
11928 lang_printable_name (TREE_TYPE (lvalue), 0));
11930 /* 15.25.2.b: Left hand is an array access. FIXME */
11933 /* If we're about to patch a NEW_ARRAY_INIT, we call a special
11934 function to complete this RHS. Note that a NEW_ARRAY_INIT
11935 might have been already fully expanded if created as a result
11936 of processing an anonymous array initializer. We avoid doing
11937 the operation twice by testing whether the node already bears
11939 else if (TREE_CODE (wfl_op2) == NEW_ARRAY_INIT && !TREE_TYPE (wfl_op2))
11940 nn = patch_new_array_init (TREE_TYPE (TREE_OPERAND (node, 0)),
11941 TREE_OPERAND (node, 1));
11942 /* Otherwise we simply complete the RHS */
11944 nn = java_complete_tree (TREE_OPERAND (node, 1));
11946 if (nn == error_mark_node)
11947 return error_mark_node;
11949 /* Write back the RHS as we evaluated it. */
11950 TREE_OPERAND (node, 1) = nn;
11952 /* In case we're handling = with a String as a RHS, we need to
11953 produce a String out of the RHS (it might still be a
11954 STRING_CST or a StringBuffer at this stage */
11955 if ((nn = patch_string (TREE_OPERAND (node, 1))))
11956 TREE_OPERAND (node, 1) = nn;
11958 if ((nn = outer_field_access_fix (wfl_op1, TREE_OPERAND (node, 0),
11959 TREE_OPERAND (node, 1))))
11961 /* We return error_mark_node if outer_field_access_fix
11962 detects we write into a final. */
11963 if (nn == error_mark_node)
11964 return error_mark_node;
11969 node = patch_assignment (node, wfl_op1);
11970 if (node == error_mark_node)
11971 return error_mark_node;
11972 /* Reorganize the tree if necessary. */
11973 if (flag && (!JREFERENCE_TYPE_P (TREE_TYPE (node))
11974 || JSTRING_P (TREE_TYPE (node))))
11975 node = java_refold (node);
11978 /* Seek to set DECL_INITIAL to a proper value, since it might have
11979 undergone a conversion in patch_assignment. We do that only when
11980 it's necessary to have DECL_INITIAL properly set. */
11981 nn = TREE_OPERAND (node, 0);
11982 if (TREE_CODE (nn) == VAR_DECL
11983 && DECL_INITIAL (nn) && CONSTANT_VALUE_P (DECL_INITIAL (nn))
11984 && FIELD_STATIC (nn) && FIELD_FINAL (nn)
11985 && (JPRIMITIVE_TYPE_P (TREE_TYPE (nn))
11986 || TREE_TYPE (nn) == string_ptr_type_node))
11987 DECL_INITIAL (nn) = TREE_OPERAND (node, 1);
11989 CAN_COMPLETE_NORMALLY (node) = 1;
12001 case TRUNC_MOD_EXPR:
12002 case TRUNC_DIV_EXPR:
12004 case TRUTH_ANDIF_EXPR:
12005 case TRUTH_ORIF_EXPR:
12012 /* Operands 0 and 1 are WFL in certain cases only. patch_binop
12013 knows how to handle those cases. */
12014 wfl_op1 = TREE_OPERAND (node, 0);
12015 wfl_op2 = TREE_OPERAND (node, 1);
12017 CAN_COMPLETE_NORMALLY (node) = 1;
12018 /* Don't complete string nodes if dealing with the PLUS operand. */
12019 if (TREE_CODE (node) != PLUS_EXPR || !JSTRING_P (wfl_op1))
12021 nn = java_complete_tree (wfl_op1);
12022 if (nn == error_mark_node)
12023 return error_mark_node;
12025 TREE_OPERAND (node, 0) = nn;
12027 if (TREE_CODE (node) != PLUS_EXPR || !JSTRING_P (wfl_op2))
12029 nn = java_complete_tree (wfl_op2);
12030 if (nn == error_mark_node)
12031 return error_mark_node;
12033 TREE_OPERAND (node, 1) = nn;
12035 return patch_binop (node, wfl_op1, wfl_op2);
12037 case INSTANCEOF_EXPR:
12038 wfl_op1 = TREE_OPERAND (node, 0);
12039 COMPLETE_CHECK_OP_0 (node);
12040 if (flag_emit_xref)
12042 TREE_TYPE (node) = boolean_type_node;
12045 return patch_binop (node, wfl_op1, TREE_OPERAND (node, 1));
12047 case UNARY_PLUS_EXPR:
12049 case TRUTH_NOT_EXPR:
12051 case PREDECREMENT_EXPR:
12052 case PREINCREMENT_EXPR:
12053 case POSTDECREMENT_EXPR:
12054 case POSTINCREMENT_EXPR:
12056 /* There are cases were wfl_op1 is a WFL. patch_unaryop knows
12057 how to handle those cases. */
12058 wfl_op1 = TREE_OPERAND (node, 0);
12059 CAN_COMPLETE_NORMALLY (node) = 1;
12060 TREE_OPERAND (node, 0) = java_complete_tree (wfl_op1);
12061 if (TREE_OPERAND (node, 0) == error_mark_node)
12062 return error_mark_node;
12063 node = patch_unaryop (node, wfl_op1);
12064 CAN_COMPLETE_NORMALLY (node) = 1;
12068 /* There are cases were wfl_op1 is a WFL. patch_array_ref knows
12069 how to handle those cases. */
12070 wfl_op1 = TREE_OPERAND (node, 0);
12071 TREE_OPERAND (node, 0) = java_complete_tree (wfl_op1);
12072 if (TREE_OPERAND (node, 0) == error_mark_node)
12073 return error_mark_node;
12074 if (!flag_emit_class_files && !flag_emit_xref)
12075 TREE_OPERAND (node, 0) = save_expr (TREE_OPERAND (node, 0));
12076 /* The same applies to wfl_op2 */
12077 wfl_op2 = TREE_OPERAND (node, 1);
12078 TREE_OPERAND (node, 1) = java_complete_tree (wfl_op2);
12079 if (TREE_OPERAND (node, 1) == error_mark_node)
12080 return error_mark_node;
12081 if (!flag_emit_class_files && !flag_emit_xref)
12082 TREE_OPERAND (node, 1) = save_expr (TREE_OPERAND (node, 1));
12083 return patch_array_ref (node);
12088 case COMPONENT_REF:
12089 /* The first step in the re-write of qualified name handling. FIXME.
12090 So far, this is only to support PRIMTYPE.class -> PRIMCLASS.TYPE. */
12091 TREE_OPERAND (node, 0) = java_complete_tree (TREE_OPERAND (node, 0));
12092 if (TREE_CODE (TREE_OPERAND (node, 0)) == RECORD_TYPE)
12094 tree name = TREE_OPERAND (node, 1);
12095 tree field = lookup_field_wrapper (TREE_OPERAND (node, 0), name);
12096 if (field == NULL_TREE)
12098 error ("missing static field `%s'", IDENTIFIER_POINTER (name));
12099 return error_mark_node;
12101 if (! FIELD_STATIC (field))
12103 error ("not a static field `%s'", IDENTIFIER_POINTER (name));
12104 return error_mark_node;
12113 /* Can't use THIS in a static environment */
12116 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
12117 parse_error_context (wfl_operator,
12118 "Keyword `this' used outside allowed context");
12119 TREE_TYPE (node) = error_mark_node;
12120 return error_mark_node;
12122 if (ctxp->explicit_constructor_p)
12124 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
12125 parse_error_context
12126 (wfl_operator, "Can't reference `this' or `super' before the superclass constructor has been called");
12127 TREE_TYPE (node) = error_mark_node;
12128 return error_mark_node;
12130 return current_this;
12132 case CLASS_LITERAL:
12133 CAN_COMPLETE_NORMALLY (node) = 1;
12134 node = patch_incomplete_class_ref (node);
12135 if (node == error_mark_node)
12136 return error_mark_node;
12140 CAN_COMPLETE_NORMALLY (node) = 1;
12141 /* Ok: may be we have a STRING_CST or a crafted `StringBuffer'
12142 and it's time to turn it into the appropriate String object */
12143 if ((nn = patch_string (node)))
12146 internal_error ("No case for %s", tree_code_name [TREE_CODE (node)]);
12151 /* Complete function call's argument. Return a nonzero value is an
12152 error was found. */
12155 complete_function_arguments (tree node)
12160 ctxp->explicit_constructor_p += (CALL_EXPLICIT_CONSTRUCTOR_P (node) ? 1 : 0);
12161 for (cn = TREE_OPERAND (node, 1); cn; cn = TREE_CHAIN (cn))
12163 tree wfl = TREE_VALUE (cn), parm, temp;
12164 parm = java_complete_tree (wfl);
12166 if (parm == error_mark_node)
12171 /* If we have a string literal that we haven't transformed yet or a
12172 crafted string buffer, as a result of the use of the String
12173 `+' operator. Build `parm.toString()' and expand it. */
12174 if ((temp = patch_string (parm)))
12177 TREE_VALUE (cn) = parm;
12179 ctxp->explicit_constructor_p -= (CALL_EXPLICIT_CONSTRUCTOR_P (node) ? 1 : 0);
12183 /* Sometimes (for loops and variable initialized during their
12184 declaration), we want to wrap a statement around a WFL and turn it
12188 build_debugable_stmt (int location, tree stmt)
12190 if (TREE_CODE (stmt) != EXPR_WITH_FILE_LOCATION)
12192 stmt = build_expr_wfl (stmt, input_filename, 0, 0);
12193 EXPR_WFL_LINECOL (stmt) = location;
12195 JAVA_MAYBE_GENERATE_DEBUG_INFO (stmt);
12200 build_expr_block (tree body, tree decls)
12202 tree node = make_node (BLOCK);
12203 BLOCK_EXPR_DECLS (node) = decls;
12204 BLOCK_EXPR_BODY (node) = body;
12206 TREE_TYPE (node) = TREE_TYPE (body);
12207 TREE_SIDE_EFFECTS (node) = 1;
12211 /* Create a new function block and link it appropriately to current
12212 function block chain */
12217 tree b = build_expr_block (NULL_TREE, NULL_TREE);
12219 /* Link block B supercontext to the previous block. The current
12220 function DECL is used as supercontext when enter_a_block is called
12221 for the first time for a given function. The current function body
12222 (DECL_FUNCTION_BODY) is set to be block B. */
12224 tree fndecl = current_function_decl;
12227 BLOCK_SUPERCONTEXT (b) = current_static_block;
12228 current_static_block = b;
12231 else if (!DECL_FUNCTION_BODY (fndecl))
12233 BLOCK_SUPERCONTEXT (b) = fndecl;
12234 DECL_FUNCTION_BODY (fndecl) = b;
12238 BLOCK_SUPERCONTEXT (b) = DECL_FUNCTION_BODY (fndecl);
12239 DECL_FUNCTION_BODY (fndecl) = b;
12244 /* Exit a block by changing the current function body
12245 (DECL_FUNCTION_BODY) to the current block super context, only if
12246 the block being exited isn't the method's top level one. */
12252 if (current_function_decl)
12254 b = DECL_FUNCTION_BODY (current_function_decl);
12255 if (BLOCK_SUPERCONTEXT (b) != current_function_decl)
12256 DECL_FUNCTION_BODY (current_function_decl) = BLOCK_SUPERCONTEXT (b);
12260 b = current_static_block;
12262 if (BLOCK_SUPERCONTEXT (b))
12263 current_static_block = BLOCK_SUPERCONTEXT (b);
12268 /* Lookup for NAME in the nested function's blocks, all the way up to
12269 the current toplevel one. It complies with Java's local variable
12273 lookup_name_in_blocks (tree name)
12275 tree b = GET_CURRENT_BLOCK (current_function_decl);
12277 while (b != current_function_decl)
12281 /* Paranoid sanity check. To be removed */
12282 if (TREE_CODE (b) != BLOCK)
12285 for (current = BLOCK_EXPR_DECLS (b); current;
12286 current = TREE_CHAIN (current))
12287 if (DECL_NAME (current) == name)
12289 b = BLOCK_SUPERCONTEXT (b);
12295 maybe_absorb_scoping_blocks (void)
12297 while (BLOCK_IS_IMPLICIT (GET_CURRENT_BLOCK (current_function_decl)))
12299 tree b = exit_block ();
12300 java_method_add_stmt (current_function_decl, b);
12301 SOURCE_FRONTEND_DEBUG (("Absorbing scoping block at line %d", input_line));
12306 /* This section of the source is reserved to build_* functions that
12307 are building incomplete tree nodes and the patch_* functions that
12308 are completing them. */
12310 /* Wrap a non WFL node around a WFL. */
12313 build_wfl_wrap (tree node, int location)
12315 tree wfl, node_to_insert = node;
12317 /* We want to process THIS . xxx symbolically, to keep it consistent
12318 with the way we're processing SUPER. A THIS from a primary as a
12319 different form than a SUPER. Turn THIS into something symbolic */
12320 if (TREE_CODE (node) == THIS_EXPR)
12321 node_to_insert = wfl = build_wfl_node (this_identifier_node);
12323 wfl = build_expr_wfl (NULL_TREE, ctxp->filename, 0, 0);
12325 EXPR_WFL_LINECOL (wfl) = location;
12326 EXPR_WFL_QUALIFICATION (wfl) = build_tree_list (node_to_insert, NULL_TREE);
12330 /* Build a super() constructor invocation. Returns an empty statement if
12331 we're currently dealing with the class java.lang.Object. */
12334 build_super_invocation (tree mdecl)
12336 if (DECL_CONTEXT (mdecl) == object_type_node)
12337 return build_java_empty_stmt ();
12340 tree super_wfl = build_wfl_node (super_identifier_node);
12341 tree a = NULL_TREE, t;
12343 /* This is called after parsing is done, so the parser context
12344 won't be accurate. Set location info from current_class decl. */
12345 tree class_wfl = lookup_cl (TYPE_NAME (current_class));
12346 EXPR_WFL_LINECOL (super_wfl) = EXPR_WFL_LINECOL (class_wfl);
12348 /* If we're dealing with an anonymous class, pass the arguments
12349 of the crafted constructor along. */
12350 if (ANONYMOUS_CLASS_P (DECL_CONTEXT (mdecl)))
12352 SKIP_THIS_AND_ARTIFICIAL_PARMS (t, mdecl);
12353 for (; t != end_params_node; t = TREE_CHAIN (t))
12354 a = tree_cons (NULL_TREE, build_wfl_node (TREE_PURPOSE (t)), a);
12356 return build_method_invocation (super_wfl, a);
12360 /* Build a SUPER/THIS qualified method invocation. */
12363 build_this_super_qualified_invocation (int use_this, tree name, tree args,
12364 int lloc, int rloc)
12368 build_wfl_node (use_this ? this_identifier_node : super_identifier_node);
12369 EXPR_WFL_LINECOL (wfl) = lloc;
12370 invok = build_method_invocation (name, args);
12371 return make_qualified_primary (wfl, invok, rloc);
12374 /* Build an incomplete CALL_EXPR node. */
12377 build_method_invocation (tree name, tree args)
12379 tree call = build3 (CALL_EXPR, NULL_TREE, name, args, NULL_TREE);
12380 TREE_SIDE_EFFECTS (call) = 1;
12381 EXPR_WFL_LINECOL (call) = EXPR_WFL_LINECOL (name);
12385 /* Build an incomplete new xxx(...) node. */
12388 build_new_invocation (tree name, tree args)
12390 tree call = build3 (NEW_CLASS_EXPR, NULL_TREE, name, args, NULL_TREE);
12391 TREE_SIDE_EFFECTS (call) = 1;
12392 EXPR_WFL_LINECOL (call) = EXPR_WFL_LINECOL (name);
12396 /* Build an incomplete assignment expression. */
12399 build_assignment (int op, int op_location, tree lhs, tree rhs)
12402 /* Build the corresponding binop if we deal with a Compound
12403 Assignment operator. Mark the binop sub-tree as part of a
12404 Compound Assignment expression */
12405 if (op != ASSIGN_TK)
12407 rhs = build_binop (BINOP_LOOKUP (op), op_location, lhs, rhs);
12408 COMPOUND_ASSIGN_P (rhs) = 1;
12410 assignment = build2 (MODIFY_EXPR, NULL_TREE, lhs, rhs);
12411 TREE_SIDE_EFFECTS (assignment) = 1;
12412 EXPR_WFL_LINECOL (assignment) = op_location;
12416 /* Print an INTEGER_CST node as decimal in a static buffer, and return
12417 the buffer. This is used only for string conversion. */
12419 string_convert_int_cst (tree node)
12421 /* Long.MIN_VALUE is -9223372036854775808, 20 characters. */
12422 static char buffer[21];
12424 unsigned HOST_WIDE_INT lo = TREE_INT_CST_LOW (node);
12425 unsigned HOST_WIDE_INT hi = TREE_INT_CST_HIGH (node);
12426 char *p = buffer + sizeof (buffer);
12429 unsigned HOST_WIDE_INT hibit = (((unsigned HOST_WIDE_INT) 1)
12430 << (HOST_BITS_PER_WIDE_INT - 1));
12434 /* If negative, note the fact and negate the value. */
12444 /* Divide by 10 until there are no bits left. */
12447 unsigned HOST_WIDE_INT acc = 0;
12448 unsigned HOST_WIDE_INT outhi = 0, outlo = 0;
12451 /* Use long division to compute the result and the remainder. */
12452 for (i = 0; i < 2 * HOST_BITS_PER_WIDE_INT; ++i)
12454 /* Shift a bit into accumulator. */
12459 /* Shift the value. */
12465 /* Shift the correct bit into the result. */
12467 if ((outlo & hibit))
12477 /* '0' == 060 in Java, but might not be here (think EBCDIC). */
12478 *--p = '\060' + acc;
12486 *--p = '\055'; /* '-' == 055 in Java, but might not be here. */
12491 /* Print an INTEGER_CST node in a static buffer, and return the
12492 buffer. This is used only for error handling. */
12494 print_int_node (tree node)
12496 static char buffer [80];
12497 if (TREE_CONSTANT_OVERFLOW (node))
12498 sprintf (buffer, "<overflow>");
12500 if (TREE_INT_CST_HIGH (node) == 0)
12501 sprintf (buffer, HOST_WIDE_INT_PRINT_UNSIGNED,
12502 TREE_INT_CST_LOW (node));
12503 else if (TREE_INT_CST_HIGH (node) == -1
12504 && TREE_INT_CST_LOW (node) != 0)
12505 sprintf (buffer, "-" HOST_WIDE_INT_PRINT_UNSIGNED,
12506 -TREE_INT_CST_LOW (node));
12508 sprintf (buffer, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
12509 TREE_INT_CST_HIGH (node), TREE_INT_CST_LOW (node));
12515 /* Return 1 if an assignment to a FINAL is attempted in a non suitable
12518 /* 15.25 Assignment operators. */
12521 patch_assignment (tree node, tree wfl_op1)
12523 tree rhs = TREE_OPERAND (node, 1);
12524 tree lvalue = TREE_OPERAND (node, 0), llvalue;
12525 tree lhs_type = NULL_TREE, rhs_type, new_rhs = NULL_TREE;
12526 int error_found = 0;
12527 int lvalue_from_array = 0;
12530 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
12532 /* Lhs can be a named variable */
12533 if (JDECL_P (lvalue))
12535 lhs_type = TREE_TYPE (lvalue);
12537 /* Or Lhs can be an array access. */
12538 else if (TREE_CODE (lvalue) == ARRAY_REF)
12540 lhs_type = TREE_TYPE (lvalue);
12541 lvalue_from_array = 1;
12543 /* Or a field access */
12544 else if (TREE_CODE (lvalue) == COMPONENT_REF)
12545 lhs_type = TREE_TYPE (lvalue);
12546 /* Or a function return slot */
12547 else if (TREE_CODE (lvalue) == RESULT_DECL)
12549 /* If the return type is an integral type, then we create the
12550 RESULT_DECL with a promoted type, but we need to do these
12551 checks against the unpromoted type to ensure type safety. So
12552 here we look at the real type, not the type of the decl we
12554 lhs_type = TREE_TYPE (TREE_TYPE (current_function_decl));
12557 /* Otherwise, we might want to try to write into an optimized static
12558 final, this is an of a different nature, reported further on. */
12559 else if (TREE_CODE (wfl_op1) == EXPR_WITH_FILE_LOCATION
12560 && resolve_expression_name (wfl_op1, &llvalue))
12562 lhs_type = TREE_TYPE (lvalue);
12566 parse_error_context (wfl_op1, "Invalid left hand side of assignment");
12570 rhs_type = TREE_TYPE (rhs);
12572 /* 5.1 Try the assignment conversion for builtin type. */
12573 new_rhs = try_builtin_assignconv (wfl_op1, lhs_type, rhs);
12575 /* 5.2 If it failed, try a reference conversion */
12577 new_rhs = try_reference_assignconv (lhs_type, rhs);
12579 /* 15.25.2 If we have a compound assignment, convert RHS into the
12581 else if (COMPOUND_ASSIGN_P (TREE_OPERAND (node, 1)))
12582 new_rhs = convert (lhs_type, rhs);
12584 /* Explicit cast required. This is an error */
12587 char *t1 = xstrdup (lang_printable_name (TREE_TYPE (rhs), 0));
12588 char *t2 = xstrdup (lang_printable_name (lhs_type, 0));
12590 char operation [32]; /* Max size known */
12592 /* If the assignment is part of a declaration, we use the WFL of
12593 the declared variable to point out the error and call it a
12594 declaration problem. If the assignment is a genuine =
12595 operator, we call is a operator `=' problem, otherwise we
12596 call it an assignment problem. In both of these last cases,
12597 we use the WFL of the operator to indicate the error. */
12599 if (MODIFY_EXPR_FROM_INITIALIZATION_P (node))
12602 strcpy (operation, "declaration");
12606 wfl = wfl_operator;
12607 if (COMPOUND_ASSIGN_P (TREE_OPERAND (node, 1)))
12608 strcpy (operation, "assignment");
12609 else if (is_return)
12610 strcpy (operation, "`return'");
12612 strcpy (operation, "`='");
12615 if (!valid_cast_to_p (rhs_type, lhs_type))
12616 parse_error_context
12617 (wfl, "Incompatible type for %s. Can't convert `%s' to `%s'",
12618 operation, t1, t2);
12620 parse_error_context (wfl, "Incompatible type for %s. Explicit cast needed to convert `%s' to `%s'",
12621 operation, t1, t2);
12622 free (t1); free (t2);
12627 return error_mark_node;
12629 /* If we're processing a `return' statement, promote the actual type
12630 to the promoted type. */
12632 new_rhs = convert (TREE_TYPE (lvalue), new_rhs);
12634 /* 10.10: Array Store Exception runtime check */
12635 if (!flag_emit_class_files
12637 && lvalue_from_array
12638 && JREFERENCE_TYPE_P (TYPE_ARRAY_ELEMENT (lhs_type)))
12640 tree array, store_check, base, index_expr;
12642 /* Save RHS so that it doesn't get re-evaluated by the store check. */
12643 new_rhs = save_expr (new_rhs);
12645 /* Get the INDIRECT_REF. */
12646 array = TREE_OPERAND (TREE_OPERAND (lvalue, 0), 0);
12647 /* Get the array pointer expr. */
12648 array = TREE_OPERAND (array, 0);
12649 store_check = build_java_arraystore_check (array, new_rhs);
12651 index_expr = TREE_OPERAND (lvalue, 1);
12653 if (TREE_CODE (index_expr) == COMPOUND_EXPR)
12655 /* A COMPOUND_EXPR here is a bounds check. The bounds check must
12656 happen before the store check, so prepare to insert the store
12657 check within the second operand of the existing COMPOUND_EXPR. */
12663 index_expr = TREE_OPERAND (base, 1);
12664 TREE_OPERAND (base, 1) = build2 (COMPOUND_EXPR, TREE_TYPE (index_expr),
12665 store_check, index_expr);
12668 /* Final locals can be used as case values in switch
12669 statement. Prepare them for this eventuality. */
12670 if (TREE_CODE (lvalue) == VAR_DECL
12671 && DECL_FINAL (lvalue)
12672 && TREE_CONSTANT (new_rhs)
12673 && IDENTIFIER_LOCAL_VALUE (DECL_NAME (lvalue))
12674 && JINTEGRAL_TYPE_P (TREE_TYPE (lvalue))
12677 TREE_CONSTANT (lvalue) = 1;
12678 TREE_INVARIANT (lvalue) = 1;
12679 DECL_INITIAL (lvalue) = new_rhs;
12682 /* Copy the rhs if it's a reference. */
12683 if (! flag_check_references && ! flag_emit_class_files && optimize > 0)
12685 switch (TREE_CODE (new_rhs))
12689 case COMPONENT_REF:
12690 /* Transform a = foo.bar
12691 into a = ({int tmp; tmp = foo.bar;}).
12692 We need to ensure that if a read from memory fails
12693 because of a NullPointerException, a destination variable
12694 will remain unchanged. An explicit temporary does what
12697 If flag_check_references is set, this is unnecessary
12698 because we'll check each reference before doing any
12699 reads. If optimize is not set the result will never be
12700 written to a stack slot that contains the LHS. */
12702 tree tmp = build_decl (VAR_DECL, get_identifier ("<tmp>"),
12703 TREE_TYPE (new_rhs));
12704 tree block = make_node (BLOCK);
12706 = build2 (MODIFY_EXPR, TREE_TYPE (new_rhs), tmp, fold (new_rhs));
12707 DECL_CONTEXT (tmp) = current_function_decl;
12708 TREE_TYPE (block) = TREE_TYPE (new_rhs);
12709 BLOCK_VARS (block) = tmp;
12710 BLOCK_EXPR_BODY (block) = assignment;
12711 TREE_SIDE_EFFECTS (block) = 1;
12720 TREE_OPERAND (node, 0) = lvalue;
12721 TREE_OPERAND (node, 1) = new_rhs;
12722 TREE_TYPE (node) = lhs_type;
12726 /* Check that type SOURCE can be cast into type DEST. If the cast
12727 can't occur at all, return NULL; otherwise, return a possibly
12731 try_reference_assignconv (tree lhs_type, tree rhs)
12733 tree new_rhs = NULL_TREE;
12734 tree rhs_type = TREE_TYPE (rhs);
12736 if (!JPRIMITIVE_TYPE_P (rhs_type) && JREFERENCE_TYPE_P (lhs_type))
12738 /* `null' may be assigned to any reference type */
12739 if (rhs == null_pointer_node)
12740 new_rhs = null_pointer_node;
12741 /* Try the reference assignment conversion */
12742 else if (valid_ref_assignconv_cast_p (rhs_type, lhs_type, 0))
12744 /* This is a magic assignment that we process differently */
12745 else if (TREE_CODE (rhs) == JAVA_EXC_OBJ_EXPR)
12751 /* Check that RHS can be converted into LHS_TYPE by the assignment
12752 conversion (5.2), for the cases of RHS being a builtin type. Return
12753 NULL_TREE if the conversion fails or if because RHS isn't of a
12754 builtin type. Return a converted RHS if the conversion is possible. */
12757 try_builtin_assignconv (tree wfl_op1, tree lhs_type, tree rhs)
12759 tree new_rhs = NULL_TREE;
12760 tree rhs_type = TREE_TYPE (rhs);
12762 /* Handle boolean specially. */
12763 if (TREE_CODE (rhs_type) == BOOLEAN_TYPE
12764 || TREE_CODE (lhs_type) == BOOLEAN_TYPE)
12766 if (TREE_CODE (rhs_type) == BOOLEAN_TYPE
12767 && TREE_CODE (lhs_type) == BOOLEAN_TYPE)
12771 /* 5.1.1 Try Identity Conversion,
12772 5.1.2 Try Widening Primitive Conversion */
12773 else if (valid_builtin_assignconv_identity_widening_p (lhs_type, rhs_type))
12774 new_rhs = convert (lhs_type, rhs);
12776 /* Try a narrowing primitive conversion (5.1.3):
12777 - expression is a constant expression of type byte, short, char,
12779 - variable is byte, short or char AND
12780 - The value of the expression is representable in the type of the
12782 else if ((rhs_type == byte_type_node || rhs_type == short_type_node
12783 || rhs_type == char_type_node || rhs_type == int_type_node)
12784 && TREE_CONSTANT (rhs)
12785 && (lhs_type == byte_type_node || lhs_type == char_type_node
12786 || lhs_type == short_type_node))
12788 if (int_fits_type_p (rhs, lhs_type))
12789 new_rhs = convert (lhs_type, rhs);
12790 else if (wfl_op1) /* Might be called with a NULL */
12791 parse_warning_context
12792 (wfl_op1, "Constant expression `%s' too wide for narrowing primitive conversion to `%s'",
12793 print_int_node (rhs), lang_printable_name (lhs_type, 0));
12794 /* Reported a warning that will turn into an error further
12795 down, so we don't return */
12801 /* Return 1 if RHS_TYPE can be converted to LHS_TYPE by identity
12802 conversion (5.1.1) or widening primitive conversion (5.1.2). Return
12803 0 is the conversion test fails. This implements parts the method
12804 invocation conversion (5.3). */
12807 valid_builtin_assignconv_identity_widening_p (tree lhs_type, tree rhs_type)
12809 /* 5.1.1: This is the identity conversion part. */
12810 if (lhs_type == rhs_type)
12813 /* Reject non primitive types and boolean conversions. */
12814 if (!JNUMERIC_TYPE_P (lhs_type) || !JNUMERIC_TYPE_P (rhs_type))
12817 /* 5.1.2: widening primitive conversion. byte, even if it's smaller
12818 than a char can't be converted into a char. Short can't too, but
12819 the < test below takes care of that */
12820 if (lhs_type == char_type_node && rhs_type == byte_type_node)
12823 /* Accept all promoted type here. Note, we can't use <= in the test
12824 below, because we still need to bounce out assignments of short
12825 to char and the likes */
12826 if (lhs_type == int_type_node
12827 && (rhs_type == promoted_byte_type_node
12828 || rhs_type == promoted_short_type_node
12829 || rhs_type == promoted_char_type_node
12830 || rhs_type == promoted_boolean_type_node))
12833 /* From here, an integral is widened if its precision is smaller
12834 than the precision of the LHS or if the LHS is a floating point
12835 type, or the RHS is a float and the RHS a double. */
12836 if ((JINTEGRAL_TYPE_P (rhs_type) && JINTEGRAL_TYPE_P (lhs_type)
12837 && (TYPE_PRECISION (rhs_type) < TYPE_PRECISION (lhs_type)))
12838 || (JINTEGRAL_TYPE_P (rhs_type) && JFLOAT_TYPE_P (lhs_type))
12839 || (rhs_type == float_type_node && lhs_type == double_type_node))
12845 /* Check that something of SOURCE type can be assigned or cast to
12846 something of DEST type at runtime. Return 1 if the operation is
12847 valid, 0 otherwise. If CAST is set to 1, we're treating the case
12848 were SOURCE is cast into DEST, which borrows a lot of the
12849 assignment check. */
12852 valid_ref_assignconv_cast_p (tree source, tree dest, int cast)
12854 /* SOURCE or DEST might be null if not from a declared entity. */
12855 if (!source || !dest)
12857 if (JNULLP_TYPE_P (source))
12859 if (TREE_CODE (source) == POINTER_TYPE)
12860 source = TREE_TYPE (source);
12861 if (TREE_CODE (dest) == POINTER_TYPE)
12862 dest = TREE_TYPE (dest);
12864 /* If source and dest are being compiled from bytecode, they may need to
12866 if (CLASS_P (source) && !CLASS_LOADED_P (source))
12868 load_class (source, 1);
12869 safe_layout_class (source);
12871 if (CLASS_P (dest) && !CLASS_LOADED_P (dest))
12873 load_class (dest, 1);
12874 safe_layout_class (dest);
12877 /* Case where SOURCE is a class type */
12878 if (TYPE_CLASS_P (source))
12880 if (TYPE_CLASS_P (dest))
12881 return (source == dest
12882 || inherits_from_p (source, dest)
12883 || (cast && inherits_from_p (dest, source)));
12884 if (TYPE_INTERFACE_P (dest))
12886 /* If doing a cast and SOURCE is final, the operation is
12887 always correct a compile time (because even if SOURCE
12888 does not implement DEST, a subclass of SOURCE might). */
12889 if (cast && !CLASS_FINAL (TYPE_NAME (source)))
12891 /* Otherwise, SOURCE must implement DEST */
12892 return interface_of_p (dest, source);
12894 /* DEST is an array, cast permitted if SOURCE is of Object type */
12895 return (cast && source == object_type_node ? 1 : 0);
12897 if (TYPE_INTERFACE_P (source))
12899 if (TYPE_CLASS_P (dest))
12901 /* If not casting, DEST must be the Object type */
12903 return dest == object_type_node;
12904 /* We're doing a cast. The cast is always valid is class
12905 DEST is not final, otherwise, DEST must implement SOURCE */
12906 else if (!CLASS_FINAL (TYPE_NAME (dest)))
12909 return interface_of_p (source, dest);
12911 if (TYPE_INTERFACE_P (dest))
12913 /* If doing a cast, then if SOURCE and DEST contain method
12914 with the same signature but different return type, then
12915 this is a (compile time) error */
12918 tree method_source, method_dest;
12922 for (method_source = TYPE_METHODS (source); method_source;
12923 method_source = TREE_CHAIN (method_source))
12926 build_java_argument_signature (TREE_TYPE (method_source));
12927 source_type = TREE_TYPE (TREE_TYPE (method_source));
12928 source_name = DECL_NAME (method_source);
12929 for (method_dest = TYPE_METHODS (dest);
12930 method_dest; method_dest = TREE_CHAIN (method_dest))
12932 build_java_argument_signature (TREE_TYPE (method_dest))
12933 && source_name == DECL_NAME (method_dest)
12934 && source_type != TREE_TYPE (TREE_TYPE (method_dest)))
12940 return source == dest || interface_of_p (dest, source);
12946 && (DECL_NAME (TYPE_NAME (source))
12947 == java_lang_cloneable_identifier_node
12948 || (DECL_NAME (TYPE_NAME (source))
12949 == java_io_serializable_identifier_node)));
12952 if (TYPE_ARRAY_P (source))
12954 if (TYPE_CLASS_P (dest))
12955 return dest == object_type_node;
12956 /* Can't cast an array to an interface unless the interface is
12957 java.lang.Cloneable or java.io.Serializable. */
12958 if (TYPE_INTERFACE_P (dest))
12959 return (DECL_NAME (TYPE_NAME (dest))
12960 == java_lang_cloneable_identifier_node
12961 || (DECL_NAME (TYPE_NAME (dest))
12962 == java_io_serializable_identifier_node));
12965 tree source_element_type = TYPE_ARRAY_ELEMENT (source);
12966 tree dest_element_type = TYPE_ARRAY_ELEMENT (dest);
12968 /* In case of severe errors, they turn out null */
12969 if (!dest_element_type || !source_element_type)
12971 if (source_element_type == dest_element_type)
12973 return valid_ref_assignconv_cast_p (source_element_type,
12974 dest_element_type, cast);
12982 valid_cast_to_p (tree source, tree dest)
12984 if (TREE_CODE (source) == POINTER_TYPE)
12985 source = TREE_TYPE (source);
12986 if (TREE_CODE (dest) == POINTER_TYPE)
12987 dest = TREE_TYPE (dest);
12989 if (TREE_CODE (source) == RECORD_TYPE && TREE_CODE (dest) == RECORD_TYPE)
12990 return valid_ref_assignconv_cast_p (source, dest, 1);
12992 else if (JNUMERIC_TYPE_P (source) && JNUMERIC_TYPE_P (dest))
12995 else if (TREE_CODE (source) == BOOLEAN_TYPE
12996 && TREE_CODE (dest) == BOOLEAN_TYPE)
13003 do_unary_numeric_promotion (tree arg)
13005 tree type = TREE_TYPE (arg);
13006 if ((TREE_CODE (type) == INTEGER_TYPE && TYPE_PRECISION (type) < 32)
13007 || TREE_CODE (type) == CHAR_TYPE)
13008 arg = convert (int_type_node, arg);
13012 /* Return a nonzero value if SOURCE can be converted into DEST using
13013 the method invocation conversion rule (5.3). */
13015 valid_method_invocation_conversion_p (tree dest, tree source)
13017 return ((JPRIMITIVE_TYPE_P (source) && JPRIMITIVE_TYPE_P (dest)
13018 && valid_builtin_assignconv_identity_widening_p (dest, source))
13019 || ((JREFERENCE_TYPE_P (source) || JNULLP_TYPE_P (source))
13020 && (JREFERENCE_TYPE_P (dest) || JNULLP_TYPE_P (dest))
13021 && valid_ref_assignconv_cast_p (source, dest, 0)));
13024 /* Build an incomplete binop expression. */
13027 build_binop (enum tree_code op, int op_location, tree op1, tree op2)
13029 tree binop = build2 (op, NULL_TREE, op1, op2);
13030 TREE_SIDE_EFFECTS (binop) = 1;
13031 /* Store the location of the operator, for better error report. The
13032 string of the operator will be rebuild based on the OP value. */
13033 EXPR_WFL_LINECOL (binop) = op_location;
13037 /* Build the string of the operator retained by NODE. If NODE is part
13038 of a compound expression, add an '=' at the end of the string. This
13039 function is called when an error needs to be reported on an
13040 operator. The string is returned as a pointer to a static character
13044 operator_string (tree node)
13046 #define BUILD_OPERATOR_STRING(S) \
13048 sprintf (buffer, "%s%s", S, (COMPOUND_ASSIGN_P (node) ? "=" : "")); \
13052 static char buffer [10];
13053 switch (TREE_CODE (node))
13055 case MULT_EXPR: BUILD_OPERATOR_STRING ("*");
13056 case RDIV_EXPR: BUILD_OPERATOR_STRING ("/");
13057 case TRUNC_MOD_EXPR: BUILD_OPERATOR_STRING ("%");
13058 case PLUS_EXPR: BUILD_OPERATOR_STRING ("+");
13059 case MINUS_EXPR: BUILD_OPERATOR_STRING ("-");
13060 case LSHIFT_EXPR: BUILD_OPERATOR_STRING ("<<");
13061 case RSHIFT_EXPR: BUILD_OPERATOR_STRING (">>");
13062 case URSHIFT_EXPR: BUILD_OPERATOR_STRING (">>>");
13063 case BIT_AND_EXPR: BUILD_OPERATOR_STRING ("&");
13064 case BIT_XOR_EXPR: BUILD_OPERATOR_STRING ("^");
13065 case BIT_IOR_EXPR: BUILD_OPERATOR_STRING ("|");
13066 case TRUTH_ANDIF_EXPR: BUILD_OPERATOR_STRING ("&&");
13067 case TRUTH_ORIF_EXPR: BUILD_OPERATOR_STRING ("||");
13068 case EQ_EXPR: BUILD_OPERATOR_STRING ("==");
13069 case NE_EXPR: BUILD_OPERATOR_STRING ("!=");
13070 case GT_EXPR: BUILD_OPERATOR_STRING (">");
13071 case GE_EXPR: BUILD_OPERATOR_STRING (">=");
13072 case LT_EXPR: BUILD_OPERATOR_STRING ("<");
13073 case LE_EXPR: BUILD_OPERATOR_STRING ("<=");
13074 case UNARY_PLUS_EXPR: BUILD_OPERATOR_STRING ("+");
13075 case NEGATE_EXPR: BUILD_OPERATOR_STRING ("-");
13076 case TRUTH_NOT_EXPR: BUILD_OPERATOR_STRING ("!");
13077 case BIT_NOT_EXPR: BUILD_OPERATOR_STRING ("~");
13078 case PREINCREMENT_EXPR: /* Fall through */
13079 case POSTINCREMENT_EXPR: BUILD_OPERATOR_STRING ("++");
13080 case PREDECREMENT_EXPR: /* Fall through */
13081 case POSTDECREMENT_EXPR: BUILD_OPERATOR_STRING ("--");
13083 internal_error ("unregistered operator %s",
13084 tree_code_name [TREE_CODE (node)]);
13087 #undef BUILD_OPERATOR_STRING
13090 /* Return 1 if VAR_ACCESS1 is equivalent to VAR_ACCESS2. */
13093 java_decl_equiv (tree var_acc1, tree var_acc2)
13095 if (JDECL_P (var_acc1))
13096 return (var_acc1 == var_acc2);
13098 return (TREE_CODE (var_acc1) == COMPONENT_REF
13099 && TREE_CODE (var_acc2) == COMPONENT_REF
13100 && TREE_OPERAND (TREE_OPERAND (var_acc1, 0), 0)
13101 == TREE_OPERAND (TREE_OPERAND (var_acc2, 0), 0)
13102 && TREE_OPERAND (var_acc1, 1) == TREE_OPERAND (var_acc2, 1));
13105 /* Return a nonzero value if CODE is one of the operators that can be
13106 used in conjunction with the `=' operator in a compound assignment. */
13109 binop_compound_p (enum tree_code code)
13112 for (i = 0; i < BINOP_COMPOUND_CANDIDATES; i++)
13113 if (binop_lookup [i] == code)
13116 return i < BINOP_COMPOUND_CANDIDATES;
13119 /* Reorganize after a fold to get SAVE_EXPR to generate what we want. */
13122 java_refold (tree t)
13124 tree c, b, ns, decl;
13126 if (TREE_CODE (t) != MODIFY_EXPR)
13129 c = TREE_OPERAND (t, 1);
13130 if (! (c && TREE_CODE (c) == COMPOUND_EXPR
13131 && TREE_CODE (TREE_OPERAND (c, 0)) == MODIFY_EXPR
13132 && binop_compound_p (TREE_CODE (TREE_OPERAND (c, 1)))))
13135 /* Now the left branch of the binary operator. */
13136 b = TREE_OPERAND (TREE_OPERAND (c, 1), 0);
13137 if (! (b && TREE_CODE (b) == NOP_EXPR
13138 && TREE_CODE (TREE_OPERAND (b, 0)) == SAVE_EXPR))
13141 ns = TREE_OPERAND (TREE_OPERAND (b, 0), 0);
13142 if (! (ns && TREE_CODE (ns) == NOP_EXPR
13143 && TREE_CODE (TREE_OPERAND (ns, 0)) == SAVE_EXPR))
13146 decl = TREE_OPERAND (TREE_OPERAND (ns, 0), 0);
13147 if ((JDECL_P (decl) || TREE_CODE (decl) == COMPONENT_REF)
13148 /* It's got to be the an equivalent decl */
13149 && java_decl_equiv (decl, TREE_OPERAND (TREE_OPERAND (c, 0), 0)))
13151 /* Shorten the NOP_EXPR/SAVE_EXPR path. */
13152 TREE_OPERAND (TREE_OPERAND (c, 1), 0) = TREE_OPERAND (ns, 0);
13153 /* Substitute the COMPOUND_EXPR by the BINOP_EXPR */
13154 TREE_OPERAND (t, 1) = TREE_OPERAND (c, 1);
13155 /* Change the right part of the BINOP_EXPR */
13156 TREE_OPERAND (TREE_OPERAND (t, 1), 1) = TREE_OPERAND (c, 0);
13162 /* Binary operators (15.16 up to 15.18). We return error_mark_node on
13163 errors but we modify NODE so that it contains the type computed
13164 according to the expression, when it's fixed. Otherwise, we write
13165 error_mark_node as the type. It allows us to further the analysis
13166 of remaining nodes and detects more errors in certain cases. */
13169 patch_binop (tree node, tree wfl_op1, tree wfl_op2)
13171 tree op1 = TREE_OPERAND (node, 0);
13172 tree op2 = TREE_OPERAND (node, 1);
13173 tree op1_type = TREE_TYPE (op1);
13174 tree op2_type = TREE_TYPE (op2);
13175 tree prom_type = NULL_TREE, cn;
13176 enum tree_code code = TREE_CODE (node);
13178 /* If 1, tell the routine that we have to return error_mark_node
13179 after checking for the initialization of the RHS */
13180 int error_found = 0;
13182 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
13184 /* If either op<n>_type are NULL, this might be early signs of an
13185 error situation, unless it's too early to tell (in case we're
13186 handling a `+', `==', `!=' or `instanceof'.) We want to set op<n>_type
13187 correctly so the error can be later on reported accurately. */
13188 if (! (code == PLUS_EXPR || code == NE_EXPR
13189 || code == EQ_EXPR || code == INSTANCEOF_EXPR))
13194 n = java_complete_tree (op1);
13195 op1_type = TREE_TYPE (n);
13199 n = java_complete_tree (op2);
13200 op2_type = TREE_TYPE (n);
13206 /* 15.16 Multiplicative operators */
13207 case MULT_EXPR: /* 15.16.1 Multiplication Operator * */
13208 case RDIV_EXPR: /* 15.16.2 Division Operator / */
13209 case TRUNC_DIV_EXPR: /* 15.16.2 Integral type Division Operator / */
13210 case TRUNC_MOD_EXPR: /* 15.16.3 Remainder operator % */
13211 if (!JNUMERIC_TYPE_P (op1_type) || !JNUMERIC_TYPE_P (op2_type))
13213 if (!JNUMERIC_TYPE_P (op1_type))
13214 ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op1_type);
13215 if (!JNUMERIC_TYPE_P (op2_type) && (op1_type != op2_type))
13216 ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op2_type);
13217 TREE_TYPE (node) = error_mark_node;
13221 prom_type = binary_numeric_promotion (op1_type, op2_type, &op1, &op2);
13223 /* Detect integral division by zero */
13224 if ((code == RDIV_EXPR || code == TRUNC_MOD_EXPR)
13225 && TREE_CODE (prom_type) == INTEGER_TYPE
13226 && (op2 == integer_zero_node || op2 == long_zero_node ||
13227 (TREE_CODE (op2) == INTEGER_CST &&
13228 ! TREE_INT_CST_LOW (op2) && ! TREE_INT_CST_HIGH (op2))))
13230 parse_warning_context (wfl_operator, "Evaluating this expression will result in an arithmetic exception being thrown");
13231 TREE_CONSTANT (node) = 0;
13232 TREE_INVARIANT (node) = 0;
13235 /* Change the division operator if necessary */
13236 if (code == RDIV_EXPR && TREE_CODE (prom_type) == INTEGER_TYPE)
13237 TREE_SET_CODE (node, TRUNC_DIV_EXPR);
13239 /* Before divisions as is disappear, try to simplify and bail if
13240 applicable, otherwise we won't perform even simple
13241 simplifications like (1-1)/3. We can't do that with floating
13242 point number, folds can't handle them at this stage. */
13243 if (code == RDIV_EXPR && TREE_CONSTANT (op1) && TREE_CONSTANT (op2)
13244 && JINTEGRAL_TYPE_P (op1) && JINTEGRAL_TYPE_P (op2))
13246 TREE_TYPE (node) = prom_type;
13247 node = fold (node);
13248 if (TREE_CODE (node) != code)
13252 if (TREE_CODE (prom_type) == INTEGER_TYPE
13253 && flag_use_divide_subroutine
13254 && ! flag_emit_class_files
13255 && (code == RDIV_EXPR || code == TRUNC_MOD_EXPR))
13256 return build_java_soft_divmod (TREE_CODE (node), prom_type, op1, op2);
13258 /* This one is more complicated. FLOATs are processed by a
13259 function call to soft_fmod. Duplicate the value of the
13260 COMPOUND_ASSIGN_P flag. */
13261 if (code == TRUNC_MOD_EXPR)
13263 tree mod = build_java_binop (TRUNC_MOD_EXPR, prom_type, op1, op2);
13264 COMPOUND_ASSIGN_P (mod) = COMPOUND_ASSIGN_P (node);
13265 TREE_SIDE_EFFECTS (mod)
13266 = TREE_SIDE_EFFECTS (op1) | TREE_SIDE_EFFECTS (op2);
13271 /* 15.17 Additive Operators */
13272 case PLUS_EXPR: /* 15.17.1 String Concatenation Operator + */
13274 /* Operation is valid if either one argument is a string
13275 constant, a String object or a StringBuffer crafted for the
13276 purpose of the a previous usage of the String concatenation
13279 if (TREE_CODE (op1) == STRING_CST
13280 || TREE_CODE (op2) == STRING_CST
13281 || JSTRING_TYPE_P (op1_type)
13282 || JSTRING_TYPE_P (op2_type)
13283 || IS_CRAFTED_STRING_BUFFER_P (op1)
13284 || IS_CRAFTED_STRING_BUFFER_P (op2))
13285 return build_string_concatenation (op1, op2);
13287 case MINUS_EXPR: /* 15.17.2 Additive Operators (+ and -) for
13289 if (!JNUMERIC_TYPE_P (op1_type) || !JNUMERIC_TYPE_P (op2_type))
13291 if (!JNUMERIC_TYPE_P (op1_type))
13292 ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op1_type);
13293 if (!JNUMERIC_TYPE_P (op2_type) && (op1_type != op2_type))
13294 ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op2_type);
13295 TREE_TYPE (node) = error_mark_node;
13299 prom_type = binary_numeric_promotion (op1_type, op2_type, &op1, &op2);
13302 /* 15.18 Shift Operators */
13306 if (!JINTEGRAL_TYPE_P (op1_type) || !JINTEGRAL_TYPE_P (op2_type))
13308 if (!JINTEGRAL_TYPE_P (op1_type))
13309 ERROR_CAST_NEEDED_TO_INTEGRAL (wfl_operator, node, op1_type);
13312 if (JNUMERIC_TYPE_P (op2_type))
13313 parse_error_context (wfl_operator,
13314 "Incompatible type for `%s'. Explicit cast needed to convert shift distance from `%s' to integral",
13315 operator_string (node),
13316 lang_printable_name (op2_type, 0));
13318 parse_error_context (wfl_operator,
13319 "Incompatible type for `%s'. Can't convert shift distance from `%s' to integral",
13320 operator_string (node),
13321 lang_printable_name (op2_type, 0));
13323 TREE_TYPE (node) = error_mark_node;
13328 /* Unary numeric promotion (5.6.1) is performed on each operand
13330 op1 = do_unary_numeric_promotion (op1);
13331 op2 = do_unary_numeric_promotion (op2);
13333 /* If the right hand side is of type `long', first cast it to
13335 if (TREE_TYPE (op2) == long_type_node)
13336 op2 = build1 (CONVERT_EXPR, int_type_node, op2);
13338 /* The type of the shift expression is the type of the promoted
13339 type of the left-hand operand */
13340 prom_type = TREE_TYPE (op1);
13342 /* Shift int only up to 0x1f and long up to 0x3f */
13343 if (prom_type == int_type_node)
13344 op2 = fold (build2 (BIT_AND_EXPR, int_type_node, op2,
13345 build_int_cst (NULL_TREE, 0x1f, 0)));
13347 op2 = fold (build2 (BIT_AND_EXPR, int_type_node, op2,
13348 build_int_cst (NULL_TREE, 0x3f, 0)));
13350 /* The >>> operator is a >> operating on unsigned quantities */
13351 if (code == URSHIFT_EXPR && ! flag_emit_class_files)
13354 tree utype = java_unsigned_type (prom_type);
13355 op1 = convert (utype, op1);
13356 TREE_SET_CODE (node, RSHIFT_EXPR);
13357 TREE_OPERAND (node, 0) = op1;
13358 TREE_OPERAND (node, 1) = op2;
13359 TREE_TYPE (node) = utype;
13360 to_return = convert (prom_type, node);
13361 /* Copy the original value of the COMPOUND_ASSIGN_P flag */
13362 COMPOUND_ASSIGN_P (to_return) = COMPOUND_ASSIGN_P (node);
13363 TREE_SIDE_EFFECTS (to_return)
13364 = TREE_SIDE_EFFECTS (op1) | TREE_SIDE_EFFECTS (op2);
13369 /* 15.19.1 Type Comparison Operator instanceof */
13370 case INSTANCEOF_EXPR:
13372 TREE_TYPE (node) = boolean_type_node;
13374 /* OP1_TYPE might be NULL when OP1 is a string constant. */
13375 if ((cn = patch_string (op1)))
13378 op1_type = TREE_TYPE (op1);
13380 if (op1_type == NULL_TREE)
13383 if (!(op2_type = resolve_type_during_patch (op2)))
13384 return error_mark_node;
13386 /* The first operand must be a reference type or the null type */
13387 if (!JREFERENCE_TYPE_P (op1_type) && op1 != null_pointer_node)
13388 error_found = 1; /* Error reported further below */
13390 /* The second operand must be a reference type */
13391 if (!JREFERENCE_TYPE_P (op2_type))
13393 SET_WFL_OPERATOR (wfl_operator, node, wfl_op2);
13394 parse_error_context
13395 (wfl_operator, "Invalid argument `%s' for `instanceof'",
13396 lang_printable_name (op2_type, 0));
13400 if (!error_found && valid_ref_assignconv_cast_p (op1_type, op2_type, 1))
13402 /* If the first operand is null, the result is always false */
13403 if (op1 == null_pointer_node)
13404 return boolean_false_node;
13405 else if (flag_emit_class_files)
13407 TREE_OPERAND (node, 1) = op2_type;
13408 TREE_SIDE_EFFECTS (node) = TREE_SIDE_EFFECTS (op1);
13411 /* Otherwise we have to invoke instance of to figure it out */
13413 return build_instanceof (op1, op2_type);
13415 /* There is no way the expression operand can be an instance of
13416 the type operand. This is a compile time error. */
13419 char *t1 = xstrdup (lang_printable_name (op1_type, 0));
13420 SET_WFL_OPERATOR (wfl_operator, node, wfl_op1);
13421 parse_error_context
13422 (wfl_operator, "Impossible for `%s' to be instance of `%s'",
13423 t1, lang_printable_name (op2_type, 0));
13430 /* 15.21 Bitwise and Logical Operators */
13434 if (JINTEGRAL_TYPE_P (op1_type) && JINTEGRAL_TYPE_P (op2_type))
13435 /* Binary numeric promotion is performed on both operand and the
13436 expression retain that type */
13437 prom_type = binary_numeric_promotion (op1_type, op2_type, &op1, &op2);
13439 else if (TREE_CODE (op1_type) == BOOLEAN_TYPE
13440 && TREE_CODE (op1_type) == BOOLEAN_TYPE)
13441 /* The type of the bitwise operator expression is BOOLEAN */
13442 prom_type = boolean_type_node;
13445 if (!JINTEGRAL_TYPE_P (op1_type))
13446 ERROR_CAST_NEEDED_TO_INTEGRAL (wfl_operator, node, op1_type);
13447 if (!JINTEGRAL_TYPE_P (op2_type) && (op1_type != op2_type))
13448 ERROR_CAST_NEEDED_TO_INTEGRAL (wfl_operator, node, op2_type);
13449 TREE_TYPE (node) = error_mark_node;
13451 /* Insert a break here if adding thing before the switch's
13452 break for this case */
13456 /* 15.22 Conditional-And Operator */
13457 case TRUTH_ANDIF_EXPR:
13458 /* 15.23 Conditional-Or Operator */
13459 case TRUTH_ORIF_EXPR:
13460 /* Operands must be of BOOLEAN type */
13461 if (TREE_CODE (op1_type) != BOOLEAN_TYPE ||
13462 TREE_CODE (op2_type) != BOOLEAN_TYPE)
13464 if (TREE_CODE (op1_type) != BOOLEAN_TYPE)
13465 ERROR_CANT_CONVERT_TO_BOOLEAN (wfl_operator, node, op1_type);
13466 if (TREE_CODE (op2_type) != BOOLEAN_TYPE && (op1_type != op2_type))
13467 ERROR_CANT_CONVERT_TO_BOOLEAN (wfl_operator, node, op2_type);
13468 TREE_TYPE (node) = boolean_type_node;
13472 else if (integer_zerop (op1))
13474 return code == TRUTH_ANDIF_EXPR ? op1 : op2;
13476 else if (integer_onep (op1))
13478 return code == TRUTH_ANDIF_EXPR ? op2 : op1;
13480 /* The type of the conditional operators is BOOLEAN */
13481 prom_type = boolean_type_node;
13484 /* 15.19.1 Numerical Comparison Operators <, <=, >, >= */
13489 /* The type of each of the operands must be a primitive numeric
13491 if (!JNUMERIC_TYPE_P (op1_type) || ! JNUMERIC_TYPE_P (op2_type))
13493 if (!JNUMERIC_TYPE_P (op1_type))
13494 ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op1_type);
13495 if (!JNUMERIC_TYPE_P (op2_type) && (op1_type != op2_type))
13496 ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op2_type);
13497 TREE_TYPE (node) = boolean_type_node;
13501 /* Binary numeric promotion is performed on the operands */
13502 binary_numeric_promotion (op1_type, op2_type, &op1, &op2);
13503 /* The type of the relation expression is always BOOLEAN */
13504 prom_type = boolean_type_node;
13507 /* 15.20 Equality Operator */
13510 /* It's time for us to patch the strings. */
13511 if ((cn = patch_string (op1)))
13514 op1_type = TREE_TYPE (op1);
13516 if ((cn = patch_string (op2)))
13519 op2_type = TREE_TYPE (op2);
13522 /* 15.20.1 Numerical Equality Operators == and != */
13523 /* Binary numeric promotion is performed on the operands */
13524 if (JNUMERIC_TYPE_P (op1_type) && JNUMERIC_TYPE_P (op2_type))
13525 binary_numeric_promotion (op1_type, op2_type, &op1, &op2);
13527 /* 15.20.2 Boolean Equality Operators == and != */
13528 else if (TREE_CODE (op1_type) == BOOLEAN_TYPE &&
13529 TREE_CODE (op2_type) == BOOLEAN_TYPE)
13530 ; /* Nothing to do here */
13532 /* 15.20.3 Reference Equality Operators == and != */
13533 /* Types have to be either references or the null type. If
13534 they're references, it must be possible to convert either
13535 type to the other by casting conversion. */
13536 else if (op1 == null_pointer_node || op2 == null_pointer_node
13537 || (JREFERENCE_TYPE_P (op1_type) && JREFERENCE_TYPE_P (op2_type)
13538 && (valid_ref_assignconv_cast_p (op1_type, op2_type, 1)
13539 || valid_ref_assignconv_cast_p (op2_type,
13541 ; /* Nothing to do here */
13543 /* Else we have an error figure what can't be converted into
13544 what and report the error */
13548 t1 = xstrdup (lang_printable_name (op1_type, 0));
13549 parse_error_context
13551 "Incompatible type for `%s'. Can't convert `%s' to `%s'",
13552 operator_string (node), t1,
13553 lang_printable_name (op2_type, 0));
13555 TREE_TYPE (node) = boolean_type_node;
13559 prom_type = boolean_type_node;
13566 return error_mark_node;
13568 TREE_OPERAND (node, 0) = op1;
13569 TREE_OPERAND (node, 1) = op2;
13570 TREE_TYPE (node) = prom_type;
13571 TREE_SIDE_EFFECTS (node) = TREE_SIDE_EFFECTS (op1) | TREE_SIDE_EFFECTS (op2);
13573 if (flag_emit_xref)
13576 /* fold does not respect side-effect order as required for Java but not C.
13577 * Also, it sometimes create SAVE_EXPRs which are bad when emitting
13580 if (flag_emit_class_files ? (TREE_CONSTANT (op1) && TREE_CONSTANT (op2))
13581 : ! TREE_SIDE_EFFECTS (node))
13582 node = fold (node);
13586 /* Concatenate the STRING_CST CSTE and STRING. When AFTER is a non
13587 zero value, the value of CSTE comes after the valude of STRING */
13590 do_merge_string_cste (tree cste, const char *string, int string_len, int after)
13592 const char *old = TREE_STRING_POINTER (cste);
13593 int old_len = TREE_STRING_LENGTH (cste);
13594 int len = old_len + string_len;
13595 char *new = alloca (len+1);
13599 memcpy (new, string, string_len);
13600 memcpy (&new [string_len], old, old_len);
13604 memcpy (new, old, old_len);
13605 memcpy (&new [old_len], string, string_len);
13608 return build_string (len, new);
13611 /* Tries to merge OP1 (a STRING_CST) and OP2 (if suitable). Return a
13612 new STRING_CST on success, NULL_TREE on failure. */
13615 merge_string_cste (tree op1, tree op2, int after)
13617 /* Handle two string constants right away. */
13618 if (TREE_CODE (op2) == STRING_CST)
13619 return do_merge_string_cste (op1, TREE_STRING_POINTER (op2),
13620 TREE_STRING_LENGTH (op2), after);
13622 /* Reasonable integer constant can be treated right away. */
13623 if (TREE_CODE (op2) == INTEGER_CST && !TREE_CONSTANT_OVERFLOW (op2))
13625 static const char *const boolean_true = "true";
13626 static const char *const boolean_false = "false";
13627 static const char *const null_pointer = "null";
13629 const char *string;
13631 if (op2 == boolean_true_node)
13632 string = boolean_true;
13633 else if (op2 == boolean_false_node)
13634 string = boolean_false;
13635 else if (op2 == null_pointer_node
13636 || (integer_zerop (op2)
13637 && TREE_CODE (TREE_TYPE (op2)) == POINTER_TYPE))
13638 /* FIXME: null is not a compile-time constant, so it is only safe to
13639 merge if the overall expression is non-constant. However, this
13640 code always merges without checking the overall expression. */
13641 string = null_pointer;
13642 else if (TREE_TYPE (op2) == char_type_node)
13644 /* Convert the character into UTF-8. */
13645 unsigned int c = (unsigned int) TREE_INT_CST_LOW (op2);
13646 unsigned char *p = (unsigned char *) ch;
13647 if (0x01 <= c && c <= 0x7f)
13648 *p++ = (unsigned char) c;
13649 else if (c < 0x7ff)
13651 *p++ = (unsigned char) (c >> 6 | 0xc0);
13652 *p++ = (unsigned char) ((c & 0x3f) | 0x80);
13656 *p++ = (unsigned char) (c >> 12 | 0xe0);
13657 *p++ = (unsigned char) (((c >> 6) & 0x3f) | 0x80);
13658 *p++ = (unsigned char) ((c & 0x3f) | 0x80);
13665 string = string_convert_int_cst (op2);
13667 return do_merge_string_cste (op1, string, strlen (string), after);
13672 /* Tries to statically concatenate OP1 and OP2 if possible. Either one
13673 has to be a STRING_CST and the other part must be a STRING_CST or a
13674 INTEGRAL constant. Return a new STRING_CST if the operation
13675 succeed, NULL_TREE otherwise.
13677 If the case we want to optimize for space, we might want to return
13678 NULL_TREE for each invocation of this routine. FIXME */
13681 string_constant_concatenation (tree op1, tree op2)
13683 if (TREE_CODE (op1) == STRING_CST || (TREE_CODE (op2) == STRING_CST))
13688 string = (TREE_CODE (op1) == STRING_CST ? op1 : op2);
13689 rest = (string == op1 ? op2 : op1);
13690 invert = (string == op1 ? 0 : 1 );
13692 /* Walk REST, only if it looks reasonable */
13693 if (TREE_CODE (rest) != STRING_CST
13694 && !IS_CRAFTED_STRING_BUFFER_P (rest)
13695 && !JSTRING_TYPE_P (TREE_TYPE (rest))
13696 && TREE_CODE (rest) == EXPR_WITH_FILE_LOCATION)
13698 rest = java_complete_tree (rest);
13699 if (rest == error_mark_node)
13700 return error_mark_node;
13701 rest = fold (rest);
13703 return merge_string_cste (string, rest, invert);
13708 /* Implement the `+' operator. Does static optimization if possible,
13709 otherwise create (if necessary) and append elements to a
13710 StringBuffer. The StringBuffer will be carried around until it is
13711 used for a function call or an assignment. Then toString() will be
13712 called on it to turn it into a String object. */
13715 build_string_concatenation (tree op1, tree op2)
13718 int side_effects = TREE_SIDE_EFFECTS (op1) | TREE_SIDE_EFFECTS (op2);
13720 if (flag_emit_xref)
13721 return build2 (PLUS_EXPR, string_type_node, op1, op2);
13723 /* Try to do some static optimization */
13724 if ((result = string_constant_concatenation (op1, op2)))
13727 /* Discard empty strings on either side of the expression */
13728 if (TREE_CODE (op1) == STRING_CST && TREE_STRING_LENGTH (op1) == 0)
13733 else if (TREE_CODE (op2) == STRING_CST && TREE_STRING_LENGTH (op2) == 0)
13736 /* If operands are string constant, turn then into object references */
13737 if (TREE_CODE (op1) == STRING_CST)
13738 op1 = patch_string_cst (op1);
13739 if (op2 && TREE_CODE (op2) == STRING_CST)
13740 op2 = patch_string_cst (op2);
13742 /* If either one of the constant is null and the other non null
13743 operand is a String constant, return it. */
13744 if ((TREE_CODE (op1) == STRING_CST) && !op2)
13747 /* If OP1 isn't already a StringBuffer, create and
13748 initialize a new one */
13749 if (!IS_CRAFTED_STRING_BUFFER_P (op1))
13751 /* Two solutions here:
13752 1) OP1 is a constant string reference, we call new StringBuffer(OP1)
13753 2) OP1 is something else, we call new StringBuffer().append(OP1). */
13754 if (TREE_CONSTANT (op1) && JSTRING_TYPE_P (TREE_TYPE (op1)))
13755 op1 = BUILD_STRING_BUFFER (op1);
13758 tree aNew = BUILD_STRING_BUFFER (NULL_TREE);
13759 op1 = make_qualified_primary (aNew, BUILD_APPEND (op1), 0);
13765 /* OP1 is no longer the last node holding a crafted StringBuffer */
13766 IS_CRAFTED_STRING_BUFFER_P (op1) = 0;
13767 /* Create a node for `{new...,xxx}.append (op2)' */
13769 op1 = make_qualified_primary (op1, BUILD_APPEND (op2), 0);
13772 /* Mark the last node holding a crafted StringBuffer */
13773 IS_CRAFTED_STRING_BUFFER_P (op1) = 1;
13775 TREE_SIDE_EFFECTS (op1) = side_effects;
13779 /* Patch the string node NODE. NODE can be a STRING_CST of a crafted
13780 StringBuffer. If no string were found to be patched, return
13784 patch_string (tree node)
13786 if (node == error_mark_node)
13787 return error_mark_node;
13788 if (TREE_CODE (node) == STRING_CST)
13789 return patch_string_cst (node);
13790 else if (IS_CRAFTED_STRING_BUFFER_P (node))
13792 int saved = ctxp->explicit_constructor_p;
13793 tree invoke = build_method_invocation (wfl_to_string, NULL_TREE);
13795 /* Temporary disable forbid the use of `this'. */
13796 ctxp->explicit_constructor_p = 0;
13797 ret = java_complete_tree (make_qualified_primary (node, invoke, 0));
13798 /* String concatenation arguments must be evaluated in order too. */
13799 ret = force_evaluation_order (ret);
13800 /* Restore it at its previous value */
13801 ctxp->explicit_constructor_p = saved;
13807 /* Build the internal representation of a string constant. */
13810 patch_string_cst (tree node)
13813 if (! flag_emit_class_files)
13815 node = get_identifier (TREE_STRING_POINTER (node));
13816 location = alloc_name_constant (CONSTANT_String, node);
13817 node = build_ref_from_constant_pool (location);
13819 TREE_CONSTANT (node) = 1;
13820 TREE_INVARIANT (node) = 1;
13822 /* ??? Guessing that the class file code can't handle casts. */
13823 if (! flag_emit_class_files)
13824 node = convert (string_ptr_type_node, node);
13826 TREE_TYPE (node) = string_ptr_type_node;
13831 /* Build an incomplete unary operator expression. */
13834 build_unaryop (int op_token, int op_location, tree op1)
13840 case PLUS_TK: op = UNARY_PLUS_EXPR; break;
13841 case MINUS_TK: op = NEGATE_EXPR; break;
13842 case NEG_TK: op = TRUTH_NOT_EXPR; break;
13843 case NOT_TK: op = BIT_NOT_EXPR; break;
13847 unaryop = build1 (op, NULL_TREE, op1);
13848 TREE_SIDE_EFFECTS (unaryop) = 1;
13849 /* Store the location of the operator, for better error report. The
13850 string of the operator will be rebuild based on the OP value. */
13851 EXPR_WFL_LINECOL (unaryop) = op_location;
13855 /* Special case for the ++/-- operators, since they require an extra
13856 argument to build, which is set to NULL and patched
13857 later. IS_POST_P is 1 if the operator, 0 otherwise. */
13860 build_incdec (int op_token, int op_location, tree op1, int is_post_p)
13862 static const enum tree_code lookup [2][2] =
13864 { PREDECREMENT_EXPR, PREINCREMENT_EXPR, },
13865 { POSTDECREMENT_EXPR, POSTINCREMENT_EXPR, },
13867 tree node = build2 (lookup [is_post_p][(op_token - DECR_TK)],
13868 NULL_TREE, op1, NULL_TREE);
13869 TREE_SIDE_EFFECTS (node) = 1;
13870 /* Store the location of the operator, for better error report. The
13871 string of the operator will be rebuild based on the OP value. */
13872 EXPR_WFL_LINECOL (node) = op_location;
13876 /* Build an incomplete cast operator, based on the use of the
13877 CONVERT_EXPR. Note that TREE_TYPE of the constructed node is
13878 set. java_complete_tree is trained to walk a CONVERT_EXPR even
13879 though its type is already set. */
13882 build_cast (int location, tree type, tree exp)
13884 tree node = build1 (CONVERT_EXPR, type, exp);
13885 EXPR_WFL_LINECOL (node) = location;
13889 /* Build an incomplete class reference operator. */
13891 build_incomplete_class_ref (int location, tree class_name)
13893 tree node = build1 (CLASS_LITERAL, NULL_TREE, class_name);
13894 tree class_decl = GET_CPC ();
13895 tree this_class = TREE_TYPE (class_decl);
13897 /* Generate the synthetic static method `class$'. (Previously we
13898 deferred this, causing different method tables to be emitted
13899 for native code and bytecode.) */
13900 if (!TYPE_DOT_CLASS (this_class)
13901 && !JPRIMITIVE_TYPE_P (class_name)
13902 && !(TREE_CODE (class_name) == VOID_TYPE))
13904 tree cpc_list = GET_CPC_LIST();
13905 tree cpc = cpc_list;
13908 /* For inner classes, add a 'class$' method to their outermost
13909 context, creating it if necessary. */
13911 while (GET_NEXT_ENCLOSING_CPC(cpc))
13912 cpc = GET_NEXT_ENCLOSING_CPC(cpc);
13913 class_decl = TREE_VALUE (cpc);
13915 target_class = TREE_TYPE (class_decl);
13917 if (CLASS_INTERFACE (TYPE_NAME (target_class)))
13919 /* For interfaces, adding a static 'class$' method directly
13920 is illegal. So create an inner class to contain the new
13921 method. Empirically this matches the behavior of javac. */
13923 /* We want the generated inner class inside the outermost class. */
13924 GET_CPC_LIST() = cpc;
13925 t = build_wfl_node (DECL_NAME (TYPE_NAME (object_type_node)));
13926 inner = create_anonymous_class (t);
13927 target_class = TREE_TYPE (inner);
13928 end_class_declaration (1);
13929 GET_CPC_LIST() = cpc_list;
13932 if (TYPE_DOT_CLASS (target_class) == NULL_TREE)
13933 build_dot_class_method (target_class);
13935 if (this_class != target_class)
13936 TYPE_DOT_CLASS (this_class) = TYPE_DOT_CLASS (target_class);
13939 EXPR_WFL_LINECOL (node) = location;
13943 /* Complete an incomplete class reference operator. */
13945 patch_incomplete_class_ref (tree node)
13947 tree type = TREE_OPERAND (node, 0);
13950 if (!(ref_type = resolve_type_during_patch (type)))
13951 return error_mark_node;
13953 /* If we're not emitting class files and we know ref_type is a
13954 compiled class, build a direct reference. */
13955 if ((! flag_emit_class_files && is_compiled_class (ref_type))
13956 || JPRIMITIVE_TYPE_P (ref_type)
13957 || TREE_CODE (ref_type) == VOID_TYPE)
13959 tree dot = build_class_ref (ref_type);
13960 /* A class referenced by `foo.class' is initialized. */
13961 if (!flag_emit_class_files)
13962 dot = build_class_init (ref_type, dot);
13963 return java_complete_tree (dot);
13966 /* If we're emitting class files and we have to deal with non
13967 primitive types, we invoke the synthetic static method `class$'. */
13968 ref_type = build_dot_class_method_invocation (current_class, ref_type);
13969 return java_complete_tree (ref_type);
13972 /* 15.14 Unary operators. We return error_mark_node in case of error,
13973 but preserve the type of NODE if the type is fixed. */
13976 patch_unaryop (tree node, tree wfl_op)
13978 tree op = TREE_OPERAND (node, 0);
13979 tree op_type = TREE_TYPE (op);
13980 tree prom_type = NULL_TREE, value, decl;
13981 int outer_field_flag = 0;
13982 int code = TREE_CODE (node);
13983 int error_found = 0;
13985 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
13989 /* 15.13.2 Postfix Increment Operator ++ */
13990 case POSTINCREMENT_EXPR:
13991 /* 15.13.3 Postfix Increment Operator -- */
13992 case POSTDECREMENT_EXPR:
13993 /* 15.14.1 Prefix Increment Operator ++ */
13994 case PREINCREMENT_EXPR:
13995 /* 15.14.2 Prefix Decrement Operator -- */
13996 case PREDECREMENT_EXPR:
13997 op = decl = strip_out_static_field_access_decl (op);
13998 outer_field_flag = outer_field_expanded_access_p (op, NULL, NULL, NULL);
13999 /* We might be trying to change an outer field accessed using
14001 if (outer_field_flag)
14003 /* Retrieve the decl of the field we're trying to access. We
14004 do that by first retrieving the function we would call to
14005 access the field. It has been already verified that this
14006 field isn't final */
14007 if (flag_emit_class_files)
14008 decl = TREE_OPERAND (op, 0);
14010 decl = TREE_OPERAND (TREE_OPERAND (TREE_OPERAND (op, 0), 0), 0);
14011 decl = DECL_FUNCTION_ACCESS_DECL (decl);
14013 /* We really should have a JAVA_ARRAY_EXPR to avoid this */
14014 else if (!JDECL_P (decl)
14015 && TREE_CODE (decl) != COMPONENT_REF
14016 && !(flag_emit_class_files && TREE_CODE (decl) == ARRAY_REF)
14017 && TREE_CODE (decl) != INDIRECT_REF
14018 && !(TREE_CODE (decl) == COMPOUND_EXPR
14019 && TREE_OPERAND (decl, 1)
14020 && (TREE_CODE (TREE_OPERAND (decl, 1)) == INDIRECT_REF)))
14022 TREE_TYPE (node) = error_mark_node;
14026 /* From now on, we know that op if a variable and that it has a
14027 valid wfl. We use wfl_op to locate errors related to the
14029 if (!JNUMERIC_TYPE_P (op_type))
14031 parse_error_context
14032 (wfl_op, "Invalid argument type `%s' to `%s'",
14033 lang_printable_name (op_type, 0), operator_string (node));
14034 TREE_TYPE (node) = error_mark_node;
14039 /* Before the addition, binary numeric promotion is performed on
14040 both operands, if really necessary */
14041 if (JINTEGRAL_TYPE_P (op_type))
14043 value = build_int_cst (op_type, 1, 0);
14044 TREE_TYPE (node) = op_type;
14048 value = build_int_cst (NULL_TREE, 1, 0);
14050 binary_numeric_promotion (op_type,
14051 TREE_TYPE (value), &op, &value);
14054 /* We remember we might be accessing an outer field */
14055 if (outer_field_flag)
14057 /* We re-generate an access to the field */
14058 value = build2 (PLUS_EXPR, TREE_TYPE (op),
14059 build_outer_field_access (wfl_op, decl), value);
14061 /* And we patch the original access$() into a write
14062 with plus_op as a rhs */
14063 return outer_field_access_fix (node, op, value);
14066 /* And write back into the node. */
14067 TREE_OPERAND (node, 0) = op;
14068 TREE_OPERAND (node, 1) = value;
14069 /* Convert the overall back into its original type, if
14070 necessary, and return */
14071 if (JINTEGRAL_TYPE_P (op_type))
14072 return fold (node);
14074 return fold (convert (op_type, node));
14078 /* 15.14.3 Unary Plus Operator + */
14079 case UNARY_PLUS_EXPR:
14080 /* 15.14.4 Unary Minus Operator - */
14082 if (!JNUMERIC_TYPE_P (op_type))
14084 ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op_type);
14085 TREE_TYPE (node) = error_mark_node;
14088 /* Unary numeric promotion is performed on operand */
14091 op = do_unary_numeric_promotion (op);
14092 prom_type = TREE_TYPE (op);
14093 if (code == UNARY_PLUS_EXPR)
14098 /* 15.14.5 Bitwise Complement Operator ~ */
14100 if (!JINTEGRAL_TYPE_P (op_type))
14102 ERROR_CAST_NEEDED_TO_INTEGRAL (wfl_operator, node, op_type);
14103 TREE_TYPE (node) = error_mark_node;
14108 op = do_unary_numeric_promotion (op);
14109 prom_type = TREE_TYPE (op);
14113 /* 15.14.6 Logical Complement Operator ! */
14114 case TRUTH_NOT_EXPR:
14115 if (TREE_CODE (op_type) != BOOLEAN_TYPE)
14117 ERROR_CANT_CONVERT_TO_BOOLEAN (wfl_operator, node, op_type);
14118 /* But the type is known. We will report an error if further
14119 attempt of a assignment is made with this rhs */
14120 TREE_TYPE (node) = boolean_type_node;
14124 prom_type = boolean_type_node;
14127 /* 15.15 Cast Expression */
14129 value = patch_cast (node, wfl_operator);
14130 if (value == error_mark_node)
14132 /* If this cast is part of an assignment, we tell the code
14133 that deals with it not to complain about a mismatch,
14134 because things have been cast, anyways */
14135 TREE_TYPE (node) = error_mark_node;
14140 value = fold (value);
14141 TREE_SIDE_EFFECTS (value) = TREE_SIDE_EFFECTS (op);
14148 return error_mark_node;
14150 /* There are cases where node has been replaced by something else
14151 and we don't end up returning here: UNARY_PLUS_EXPR,
14152 CONVERT_EXPR, {POST,PRE}{INCR,DECR}EMENT_EXPR. */
14153 TREE_OPERAND (node, 0) = fold (op);
14154 TREE_TYPE (node) = prom_type;
14155 TREE_SIDE_EFFECTS (node) = TREE_SIDE_EFFECTS (op);
14156 return fold (node);
14159 /* Generic type resolution that sometimes takes place during node
14160 patching. Returned the resolved type or generate an error
14161 message. Return the resolved type or NULL_TREE. */
14164 resolve_type_during_patch (tree type)
14166 if (unresolved_type_p (type, NULL))
14168 tree type_decl = resolve_and_layout (EXPR_WFL_NODE (type), type);
14171 parse_error_context (type,
14172 "Class `%s' not found in type declaration",
14173 IDENTIFIER_POINTER (EXPR_WFL_NODE (type)));
14177 check_deprecation (type, type_decl);
14179 return TREE_TYPE (type_decl);
14184 /* 5.5 Casting Conversion. error_mark_node is returned if an error is
14185 found. Otherwise NODE or something meant to replace it is returned. */
14188 patch_cast (tree node, tree wfl_op)
14190 tree op = TREE_OPERAND (node, 0);
14191 tree cast_type = TREE_TYPE (node);
14192 tree patched, op_type;
14195 /* Some string patching might be necessary at this stage */
14196 if ((patched = patch_string (op)))
14197 TREE_OPERAND (node, 0) = op = patched;
14198 op_type = TREE_TYPE (op);
14200 /* First resolve OP_TYPE if unresolved */
14201 if (!(cast_type = resolve_type_during_patch (cast_type)))
14202 return error_mark_node;
14204 /* Check on cast that are proven correct at compile time */
14205 if (JNUMERIC_TYPE_P (cast_type) && JNUMERIC_TYPE_P (op_type))
14208 if (cast_type == op_type)
14211 /* A narrowing conversion from a floating-point number to an
14212 integral type requires special handling (5.1.3). */
14213 if (JFLOAT_TYPE_P (op_type) && JINTEGRAL_TYPE_P (cast_type))
14214 if (cast_type != long_type_node)
14215 op = convert (integer_type_node, op);
14217 /* Try widening/narrowing conversion. Potentially, things need
14218 to be worked out in gcc so we implement the extreme cases
14219 correctly. fold_convert() needs to be fixed. */
14220 return convert (cast_type, op);
14223 /* It's also valid to cast a boolean into a boolean */
14224 if (op_type == boolean_type_node && cast_type == boolean_type_node)
14227 /* null can be casted to references */
14228 if (op == null_pointer_node && JREFERENCE_TYPE_P (cast_type))
14229 return build_null_of_type (cast_type);
14231 /* The remaining legal casts involve conversion between reference
14232 types. Check for their compile time correctness. */
14233 if (JREFERENCE_TYPE_P (op_type) && JREFERENCE_TYPE_P (cast_type)
14234 && valid_ref_assignconv_cast_p (op_type, cast_type, 1))
14236 TREE_TYPE (node) = promote_type (cast_type);
14237 /* Now, the case can be determined correct at compile time if
14238 OP_TYPE can be converted into CAST_TYPE by assignment
14239 conversion (5.2) */
14241 if (valid_ref_assignconv_cast_p (op_type, cast_type, 0))
14243 TREE_SET_CODE (node, NOP_EXPR);
14247 if (flag_emit_class_files)
14249 TREE_SET_CODE (node, CONVERT_EXPR);
14253 /* The cast requires a run-time check */
14254 return build3 (CALL_EXPR, promote_type (cast_type),
14255 build_address_of (soft_checkcast_node),
14256 tree_cons (NULL_TREE, build_class_ref (cast_type),
14257 build_tree_list (NULL_TREE, op)),
14261 /* Any other casts are proven incorrect at compile time */
14262 t1 = xstrdup (lang_printable_name (op_type, 0));
14263 parse_error_context (wfl_op, "Invalid cast from `%s' to `%s'",
14264 t1, lang_printable_name (cast_type, 0));
14266 return error_mark_node;
14269 /* Build a null constant and give it the type TYPE. */
14272 build_null_of_type (tree type)
14274 tree node = build_int_cst (promote_type (type), 0, 0);
14278 /* Build an ARRAY_REF incomplete tree node. Note that operand 1 isn't
14279 a list of indices. */
14281 build_array_ref (int location, tree array, tree index)
14283 tree node = build4 (ARRAY_REF, NULL_TREE, array, index,
14284 NULL_TREE, NULL_TREE);
14285 EXPR_WFL_LINECOL (node) = location;
14289 /* 15.12 Array Access Expression */
14292 patch_array_ref (tree node)
14294 tree array = TREE_OPERAND (node, 0);
14295 tree array_type = TREE_TYPE (array);
14296 tree index = TREE_OPERAND (node, 1);
14297 tree index_type = TREE_TYPE (index);
14298 int error_found = 0;
14300 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
14302 if (TREE_CODE (array_type) == POINTER_TYPE)
14303 array_type = TREE_TYPE (array_type);
14305 /* The array reference must be an array */
14306 if (!TYPE_ARRAY_P (array_type))
14308 parse_error_context
14310 "`[]' can only be applied to arrays. It can't be applied to `%s'",
14311 lang_printable_name (array_type, 0));
14312 TREE_TYPE (node) = error_mark_node;
14316 /* The array index undergoes unary numeric promotion. The promoted
14317 type must be int */
14318 index = do_unary_numeric_promotion (index);
14319 if (TREE_TYPE (index) != int_type_node)
14321 if (valid_cast_to_p (index_type, int_type_node))
14322 parse_error_context (wfl_operator,
14323 "Incompatible type for `[]'. Explicit cast needed to convert `%s' to `int'",
14324 lang_printable_name (index_type, 0));
14326 parse_error_context (wfl_operator,
14327 "Incompatible type for `[]'. Can't convert `%s' to `int'",
14328 lang_printable_name (index_type, 0));
14329 TREE_TYPE (node) = error_mark_node;
14334 return error_mark_node;
14336 array_type = TYPE_ARRAY_ELEMENT (array_type);
14338 if (flag_emit_class_files || flag_emit_xref)
14340 TREE_OPERAND (node, 0) = array;
14341 TREE_OPERAND (node, 1) = index;
14344 node = build_java_arrayaccess (array, array_type, index);
14345 TREE_TYPE (node) = array_type;
14349 /* 15.9 Array Creation Expressions */
14352 build_newarray_node (tree type, tree dims, int extra_dims)
14354 tree node = build3 (NEW_ARRAY_EXPR, NULL_TREE, type,
14356 build_int_cst (NULL_TREE, extra_dims, 0));
14361 patch_newarray (tree node)
14363 tree type = TREE_OPERAND (node, 0);
14364 tree dims = TREE_OPERAND (node, 1);
14365 tree cdim, array_type;
14366 int error_found = 0;
14368 int xdims = TREE_INT_CST_LOW (TREE_OPERAND (node, 2));
14370 /* Dimension types are verified. It's better for the types to be
14371 verified in order. */
14372 for (cdim = dims, ndims = 0; cdim; cdim = TREE_CHAIN (cdim), ndims++ )
14375 tree dim = TREE_VALUE (cdim);
14377 /* Dim might have been saved during its evaluation */
14378 dim = (TREE_CODE (dim) == SAVE_EXPR ? TREE_OPERAND (dim, 0) : dim);
14380 /* The type of each specified dimension must be an integral type. */
14381 if (!JINTEGRAL_TYPE_P (TREE_TYPE (dim)))
14384 /* Each expression undergoes an unary numeric promotion (5.6.1) and the
14385 promoted type must be int. */
14388 dim = do_unary_numeric_promotion (dim);
14389 if (TREE_TYPE (dim) != int_type_node)
14393 /* Report errors on types here */
14396 parse_error_context
14397 (TREE_PURPOSE (cdim),
14398 "Incompatible type for dimension in array creation expression. %s convert `%s' to `int'",
14399 (valid_cast_to_p (TREE_TYPE (dim), int_type_node) ?
14400 "Explicit cast needed to" : "Can't"),
14401 lang_printable_name (TREE_TYPE (dim), 0));
14405 TREE_PURPOSE (cdim) = NULL_TREE;
14408 /* Resolve array base type if unresolved */
14409 if (!(type = resolve_type_during_patch (type)))
14414 /* We don't want further evaluation of this bogus array creation
14416 TREE_TYPE (node) = error_mark_node;
14417 return error_mark_node;
14420 /* Set array_type to the actual (promoted) array type of the result. */
14421 if (TREE_CODE (type) == RECORD_TYPE)
14422 type = build_pointer_type (type);
14423 while (--xdims >= 0)
14425 type = promote_type (build_java_array_type (type, -1));
14427 dims = nreverse (dims);
14429 for (cdim = dims; cdim; cdim = TREE_CHAIN (cdim))
14433 = build_java_array_type (type,
14434 TREE_CODE (cdim) == INTEGER_CST
14435 ? (HOST_WIDE_INT) TREE_INT_CST_LOW (cdim)
14437 array_type = promote_type (array_type);
14439 dims = nreverse (dims);
14441 /* The node is transformed into a function call. Things are done
14442 differently according to the number of dimensions. If the number
14443 of dimension is equal to 1, then the nature of the base type
14444 (primitive or not) matters. */
14446 return build_new_array (type, TREE_VALUE (dims));
14448 /* Can't reuse what's already written in expr.c because it uses the
14449 JVM stack representation. Provide a build_multianewarray. FIXME */
14450 return build3 (CALL_EXPR, array_type,
14451 build_address_of (soft_multianewarray_node),
14452 tree_cons (NULL_TREE,
14453 build_class_ref (TREE_TYPE (array_type)),
14454 tree_cons (NULL_TREE,
14455 build_int_cst (NULL_TREE,
14456 ndims, 0), dims )),
14460 /* 10.6 Array initializer. */
14462 /* Build a wfl for array element that don't have one, so we can
14463 pin-point errors. */
14466 maybe_build_array_element_wfl (tree node)
14468 if (TREE_CODE (node) != EXPR_WITH_FILE_LOCATION)
14469 return build_expr_wfl (NULL_TREE, ctxp->filename,
14470 ctxp->elc.line, ctxp->elc.prev_col);
14475 /* Build a NEW_ARRAY_INIT that features a CONSTRUCTOR node. This makes
14476 identification of initialized arrays easier to detect during walk
14480 build_new_array_init (int location, tree values)
14482 tree constructor = build_constructor (NULL_TREE, values);
14483 tree to_return = build1 (NEW_ARRAY_INIT, NULL_TREE, constructor);
14484 EXPR_WFL_LINECOL (to_return) = location;
14488 /* Expand a NEW_ARRAY_INIT node. Return error_mark_node if an error
14489 occurred. Otherwise return NODE after having set its type
14493 patch_new_array_init (tree type, tree node)
14495 int error_seen = 0;
14496 tree current, element_type;
14497 HOST_WIDE_INT length;
14498 int all_constant = 1;
14499 tree init = TREE_OPERAND (node, 0);
14501 if (TREE_CODE (type) != POINTER_TYPE || ! TYPE_ARRAY_P (TREE_TYPE (type)))
14503 parse_error_context (node,
14504 "Invalid array initializer for non-array type `%s'",
14505 lang_printable_name (type, 1));
14506 return error_mark_node;
14508 type = TREE_TYPE (type);
14509 element_type = TYPE_ARRAY_ELEMENT (type);
14511 CONSTRUCTOR_ELTS (init) = nreverse (CONSTRUCTOR_ELTS (init));
14513 for (length = 0, current = CONSTRUCTOR_ELTS (init);
14514 current; length++, current = TREE_CHAIN (current))
14516 tree elt = TREE_VALUE (current);
14517 if (elt == NULL_TREE || TREE_CODE (elt) != NEW_ARRAY_INIT)
14519 error_seen |= array_constructor_check_entry (element_type, current);
14520 elt = TREE_VALUE (current);
14521 /* When compiling to native code, STRING_CST is converted to
14522 INDIRECT_REF, but still with a TREE_CONSTANT flag. */
14523 if (! TREE_CONSTANT (elt) || TREE_CODE (elt) == INDIRECT_REF)
14528 TREE_VALUE (current) = patch_new_array_init (element_type, elt);
14529 TREE_PURPOSE (current) = NULL_TREE;
14532 if (elt && TREE_CODE (elt) == TREE_LIST
14533 && TREE_VALUE (elt) == error_mark_node)
14538 return error_mark_node;
14540 /* Create a new type. We can't reuse the one we have here by
14541 patching its dimension because it originally is of dimension -1
14542 hence reused by gcc. This would prevent triangular arrays. */
14543 type = build_java_array_type (element_type, length);
14544 TREE_TYPE (init) = TREE_TYPE (TREE_CHAIN (TREE_CHAIN (TYPE_FIELDS (type))));
14545 TREE_TYPE (node) = promote_type (type);
14546 TREE_CONSTANT (init) = all_constant;
14547 TREE_INVARIANT (init) = all_constant;
14548 TREE_CONSTANT (node) = all_constant;
14549 TREE_INVARIANT (node) = all_constant;
14553 /* Verify that one entry of the initializer element list can be
14554 assigned to the array base type. Report 1 if an error occurred, 0
14558 array_constructor_check_entry (tree type, tree entry)
14560 char *array_type_string = NULL; /* For error reports */
14561 tree value, type_value, new_value, wfl_value, patched;
14562 int error_seen = 0;
14564 new_value = NULL_TREE;
14565 wfl_value = TREE_VALUE (entry);
14567 value = java_complete_tree (TREE_VALUE (entry));
14568 /* patch_string return error_mark_node if arg is error_mark_node */
14569 if ((patched = patch_string (value)))
14571 if (value == error_mark_node)
14574 type_value = TREE_TYPE (value);
14576 /* At anytime, try_builtin_assignconv can report a warning on
14577 constant overflow during narrowing. */
14578 SET_WFL_OPERATOR (wfl_operator, TREE_PURPOSE (entry), wfl_value);
14579 new_value = try_builtin_assignconv (wfl_operator, type, value);
14580 if (!new_value && (new_value = try_reference_assignconv (type, value)))
14581 type_value = promote_type (type);
14583 /* Check and report errors */
14586 const char *const msg = (!valid_cast_to_p (type_value, type) ?
14587 "Can't" : "Explicit cast needed to");
14588 if (!array_type_string)
14589 array_type_string = xstrdup (lang_printable_name (type, 1));
14590 parse_error_context
14591 (wfl_operator, "Incompatible type for array. %s convert `%s' to `%s'",
14592 msg, lang_printable_name (type_value, 1), array_type_string);
14597 TREE_VALUE (entry) = new_value;
14599 if (array_type_string)
14600 free (array_type_string);
14602 TREE_PURPOSE (entry) = NULL_TREE;
14607 build_this (int location)
14609 tree node = build_wfl_node (this_identifier_node);
14610 TREE_SET_CODE (node, THIS_EXPR);
14611 EXPR_WFL_LINECOL (node) = location;
14615 /* 14.15 The return statement. It builds a modify expression that
14616 assigns the returned value to the RESULT_DECL that hold the value
14620 build_return (int location, tree op)
14622 tree node = build1 (RETURN_EXPR, NULL_TREE, op);
14623 EXPR_WFL_LINECOL (node) = location;
14624 node = build_debugable_stmt (location, node);
14629 patch_return (tree node)
14631 tree return_exp = TREE_OPERAND (node, 0);
14632 tree meth = current_function_decl;
14633 tree mtype = TREE_TYPE (TREE_TYPE (current_function_decl));
14634 int error_found = 0;
14636 TREE_TYPE (node) = error_mark_node;
14637 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
14639 /* It's invalid to have a return value within a function that is
14640 declared with the keyword void or that is a constructor */
14641 if (return_exp && (mtype == void_type_node || DECL_CONSTRUCTOR_P (meth)))
14644 /* It's invalid to use a return statement in a static block */
14645 if (DECL_CLINIT_P (current_function_decl))
14648 /* It's invalid to have a no return value within a function that
14649 isn't declared with the keyword `void' */
14650 if (!return_exp && (mtype != void_type_node && !DECL_CONSTRUCTOR_P (meth)))
14653 if (DECL_INSTINIT_P (current_function_decl))
14658 if (DECL_INSTINIT_P (current_function_decl))
14659 parse_error_context (wfl_operator,
14660 "`return' inside instance initializer");
14662 else if (DECL_CLINIT_P (current_function_decl))
14663 parse_error_context (wfl_operator,
14664 "`return' inside static initializer");
14666 else if (!DECL_CONSTRUCTOR_P (meth))
14668 char *t = xstrdup (lang_printable_name (mtype, 0));
14669 parse_error_context (wfl_operator,
14670 "`return' with%s value from `%s %s'",
14671 (error_found == 1 ? "" : "out"),
14672 t, lang_printable_name (meth, 0));
14676 parse_error_context (wfl_operator,
14677 "`return' with value from constructor `%s'",
14678 lang_printable_name (meth, 0));
14679 return error_mark_node;
14682 /* If we have a return_exp, build a modify expression and expand
14683 it. Note: at that point, the assignment is declared valid, but we
14684 may want to carry some more hacks */
14687 tree exp = java_complete_tree (return_exp);
14688 tree modify, patched;
14690 if ((patched = patch_string (exp)))
14693 modify = build2 (MODIFY_EXPR, NULL_TREE, DECL_RESULT (meth), exp);
14694 EXPR_WFL_LINECOL (modify) = EXPR_WFL_LINECOL (node);
14695 modify = java_complete_tree (modify);
14697 if (modify != error_mark_node)
14699 TREE_SIDE_EFFECTS (modify) = 1;
14700 TREE_OPERAND (node, 0) = modify;
14703 return error_mark_node;
14705 TREE_TYPE (node) = void_type_node;
14706 TREE_SIDE_EFFECTS (node) = 1;
14710 /* 14.8 The if Statement */
14713 build_if_else_statement (int location, tree expression, tree if_body,
14718 else_body = build_java_empty_stmt ();
14719 node = build3 (COND_EXPR, NULL_TREE, expression, if_body, else_body);
14720 EXPR_WFL_LINECOL (node) = location;
14721 node = build_debugable_stmt (location, node);
14726 patch_if_else_statement (tree node)
14728 tree expression = TREE_OPERAND (node, 0);
14729 int can_complete_normally
14730 = (CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 1))
14731 | CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 2)));
14733 TREE_TYPE (node) = error_mark_node;
14734 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
14736 /* The type of expression must be boolean */
14737 if (TREE_TYPE (expression) != boolean_type_node
14738 && TREE_TYPE (expression) != promoted_boolean_type_node)
14740 parse_error_context
14742 "Incompatible type for `if'. Can't convert `%s' to `boolean'",
14743 lang_printable_name (TREE_TYPE (expression), 0));
14744 return error_mark_node;
14747 TREE_TYPE (node) = void_type_node;
14748 TREE_SIDE_EFFECTS (node) = 1;
14749 CAN_COMPLETE_NORMALLY (node) = can_complete_normally;
14753 /* 14.6 Labeled Statements */
14755 /* Action taken when a labeled statement is parsed. a new
14756 LABELED_BLOCK_EXPR is created. No statement is attached to the
14757 label, yet. LABEL can be NULL_TREE for artificially-generated blocks. */
14760 build_labeled_block (int location, tree label)
14763 tree label_decl, node;
14764 if (label == NULL_TREE || label == continue_identifier_node)
14765 label_name = label;
14768 label_name = merge_qualified_name (label_id, label);
14769 /* Issue an error if we try to reuse a label that was previously
14771 if (IDENTIFIER_LOCAL_VALUE (label_name))
14773 EXPR_WFL_LINECOL (wfl_operator) = location;
14774 parse_error_context (wfl_operator,
14775 "Declaration of `%s' shadows a previous label declaration",
14776 IDENTIFIER_POINTER (label));
14777 EXPR_WFL_LINECOL (wfl_operator) =
14778 EXPR_WFL_LINECOL (IDENTIFIER_LOCAL_VALUE (label_name));
14779 parse_error_context (wfl_operator,
14780 "This is the location of the previous declaration of label `%s'",
14781 IDENTIFIER_POINTER (label));
14782 java_error_count--;
14786 label_decl = create_label_decl (label_name);
14787 node = build2 (LABELED_BLOCK_EXPR, NULL_TREE, label_decl, NULL_TREE);
14788 EXPR_WFL_LINECOL (node) = location;
14789 TREE_SIDE_EFFECTS (node) = 1;
14793 /* A labeled statement LBE is attached a statement. */
14796 finish_labeled_statement (tree lbe, /* Labeled block expr */
14799 /* In anyways, tie the loop to its statement */
14800 LABELED_BLOCK_BODY (lbe) = statement;
14801 pop_labeled_block ();
14802 POP_LABELED_BLOCK ();
14806 /* 14.10, 14.11, 14.12 Loop Statements */
14808 /* Create an empty LOOP_EXPR and make it the last in the nested loop
14812 build_new_loop (tree loop_body)
14814 tree loop = build1 (LOOP_EXPR, NULL_TREE, loop_body);
14815 TREE_SIDE_EFFECTS (loop) = 1;
14820 /* Create a loop body according to the following structure:
14822 COMPOUND_EXPR (loop main body)
14823 EXIT_EXPR (this order is for while/for loops.
14824 LABELED_BLOCK_EXPR the order is reversed for do loops)
14825 LABEL_DECL (a continue occurring here branches at the
14826 BODY end of this labeled block)
14829 REVERSED, if nonzero, tells that the loop condition expr comes
14830 after the body, like in the do-while loop.
14832 To obtain a loop, the loop body structure described above is
14833 encapsulated within a LOOP_EXPR surrounded by a LABELED_BLOCK_EXPR:
14836 LABEL_DECL (use this label to exit the loop)
14838 <structure described above> */
14841 build_loop_body (int location, tree condition, int reversed)
14843 tree first, second, body;
14845 condition = build1 (EXIT_EXPR, NULL_TREE, condition); /* Force walk */
14846 EXPR_WFL_LINECOL (condition) = location; /* For accurate error report */
14847 condition = build_debugable_stmt (location, condition);
14848 TREE_SIDE_EFFECTS (condition) = 1;
14850 body = build_labeled_block (0, continue_identifier_node);
14851 first = (reversed ? body : condition);
14852 second = (reversed ? condition : body);
14853 return build2 (COMPOUND_EXPR, NULL_TREE,
14854 build2 (COMPOUND_EXPR, NULL_TREE, first, second),
14855 build_java_empty_stmt ());
14858 /* Install CONDITION (if any) and loop BODY (using REVERSED to tell
14859 their order) on the current loop. Unlink the current loop from the
14863 finish_loop_body (int location, tree condition, tree body, int reversed)
14865 tree to_return = ctxp->current_loop;
14866 tree loop_body = LOOP_EXPR_BODY (to_return);
14869 tree cnode = LOOP_EXPR_BODY_CONDITION_EXPR (loop_body, reversed);
14870 /* We wrapped the EXIT_EXPR around a WFL so we can debug it.
14871 The real EXIT_EXPR is one operand further. */
14872 EXPR_WFL_LINECOL (cnode) = location;
14873 /* This one is for accurate error reports */
14874 EXPR_WFL_LINECOL (TREE_OPERAND (cnode, 0)) = location;
14875 TREE_OPERAND (TREE_OPERAND (cnode, 0), 0) = condition;
14877 LOOP_EXPR_BODY_BODY_EXPR (loop_body, reversed) = body;
14882 /* Tailored version of finish_loop_body for FOR loops, when FOR
14883 loops feature the condition part */
14886 finish_for_loop (int location, tree condition, tree update, tree body)
14888 /* Put the condition and the loop body in place */
14889 tree loop = finish_loop_body (location, condition, body, 0);
14890 /* LOOP is the current loop which has been now popped of the loop
14891 stack. Mark the update block as reachable and install it. We do
14892 this because the (current interpretation of the) JLS requires
14893 that the update expression be considered reachable even if the
14894 for loop's body doesn't complete normally. */
14895 if (update != NULL_TREE && !IS_EMPTY_STMT (update))
14898 if (TREE_CODE (up2) == EXPR_WITH_FILE_LOCATION)
14899 up2 = EXPR_WFL_NODE (up2);
14900 /* It is possible for the update expression to be an
14901 EXPR_WFL_NODE wrapping nothing. */
14902 if (up2 != NULL_TREE && !IS_EMPTY_STMT (up2))
14904 /* Try to detect constraint violations. These would be
14905 programming errors somewhere. */
14906 if (! IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (up2)))
14907 || TREE_CODE (up2) == LOOP_EXPR)
14909 SUPPRESS_UNREACHABLE_ERROR (up2) = 1;
14912 LOOP_EXPR_BODY_UPDATE_BLOCK (LOOP_EXPR_BODY (loop)) = update;
14916 /* Try to find the loop a block might be related to. This comprises
14917 the case where the LOOP_EXPR is found as the second operand of a
14918 COMPOUND_EXPR, because the loop happens to have an initialization
14919 part, then expressed as the first operand of the COMPOUND_EXPR. If
14920 the search finds something, 1 is returned. Otherwise, 0 is
14921 returned. The search is assumed to start from a
14922 LABELED_BLOCK_EXPR's block. */
14925 search_loop (tree statement)
14927 if (TREE_CODE (statement) == LOOP_EXPR)
14930 if (TREE_CODE (statement) == BLOCK)
14931 statement = BLOCK_SUBBLOCKS (statement);
14935 if (statement && TREE_CODE (statement) == COMPOUND_EXPR)
14936 while (statement && TREE_CODE (statement) == COMPOUND_EXPR)
14937 statement = TREE_OPERAND (statement, 1);
14939 return (TREE_CODE (statement) == LOOP_EXPR
14940 && FOR_LOOP_P (statement) ? statement : NULL_TREE);
14943 /* Return 1 if LOOP can be found in the labeled block BLOCK. 0 is
14944 returned otherwise. */
14947 labeled_block_contains_loop_p (tree block, tree loop)
14952 if (LABELED_BLOCK_BODY (block) == loop)
14955 if (FOR_LOOP_P (loop) && search_loop (LABELED_BLOCK_BODY (block)) == loop)
14961 /* If the loop isn't surrounded by a labeled statement, create one and
14962 insert LOOP as its body. */
14965 patch_loop_statement (tree loop)
14969 TREE_TYPE (loop) = void_type_node;
14970 if (labeled_block_contains_loop_p (ctxp->current_labeled_block, loop))
14973 loop_label = build_labeled_block (0, NULL_TREE);
14974 /* LOOP is an EXPR node, so it should have a valid EXPR_WFL_LINECOL
14975 that LOOP_LABEL could enquire about, for a better accuracy. FIXME */
14976 LABELED_BLOCK_BODY (loop_label) = loop;
14977 PUSH_LABELED_BLOCK (loop_label);
14981 /* 14.13, 14.14: break and continue Statements */
14983 /* Build a break or a continue statement. a null NAME indicates an
14984 unlabeled break/continue statement. */
14987 build_bc_statement (int location, int is_break, tree name)
14989 tree break_continue, label_block_expr = NULL_TREE;
14993 if (!(label_block_expr = IDENTIFIER_LOCAL_VALUE
14994 (merge_qualified_name (label_id, EXPR_WFL_NODE (name)))))
14995 /* Null means that we don't have a target for this named
14996 break/continue. In this case, we make the target to be the
14997 label name, so that the error can be reported accurately in
14998 patch_bc_statement. */
14999 label_block_expr = EXPR_WFL_NODE (name);
15001 /* Unlabeled break/continue will be handled during the
15002 break/continue patch operation */
15003 break_continue = build2 (EXIT_BLOCK_EXPR, NULL_TREE,
15004 label_block_expr, NULL_TREE);
15006 IS_BREAK_STMT_P (break_continue) = is_break;
15007 TREE_SIDE_EFFECTS (break_continue) = 1;
15008 EXPR_WFL_LINECOL (break_continue) = location;
15009 break_continue = build_debugable_stmt (location, break_continue);
15010 return break_continue;
15013 /* Verification of a break/continue statement. */
15016 patch_bc_statement (tree node)
15018 tree bc_label = EXIT_BLOCK_LABELED_BLOCK (node), target_stmt;
15019 tree labeled_block = ctxp->current_labeled_block;
15020 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
15022 /* Having an identifier here means that the target is unknown. */
15023 if (bc_label != NULL_TREE && TREE_CODE (bc_label) == IDENTIFIER_NODE)
15025 parse_error_context (wfl_operator, "No label definition found for `%s'",
15026 IDENTIFIER_POINTER (bc_label));
15027 return error_mark_node;
15029 if (! IS_BREAK_STMT_P (node))
15031 /* It's a continue statement. */
15032 for (;; labeled_block = TREE_CHAIN (labeled_block))
15034 if (labeled_block == NULL_TREE)
15036 if (bc_label == NULL_TREE)
15037 parse_error_context (wfl_operator,
15038 "`continue' must be in loop");
15040 parse_error_context
15041 (wfl_operator, "continue label `%s' does not name a loop",
15042 IDENTIFIER_POINTER (bc_label));
15043 return error_mark_node;
15045 if ((DECL_NAME (LABELED_BLOCK_LABEL (labeled_block))
15046 == continue_identifier_node)
15047 && (bc_label == NULL_TREE
15048 || TREE_CHAIN (labeled_block) == bc_label))
15050 bc_label = labeled_block;
15055 else if (!bc_label)
15057 for (;; labeled_block = TREE_CHAIN (labeled_block))
15059 if (labeled_block == NULL_TREE)
15061 parse_error_context (wfl_operator,
15062 "`break' must be in loop or switch");
15063 return error_mark_node;
15065 target_stmt = LABELED_BLOCK_BODY (labeled_block);
15066 if (TREE_CODE (target_stmt) == SWITCH_EXPR
15067 || search_loop (target_stmt))
15069 bc_label = labeled_block;
15075 EXIT_BLOCK_LABELED_BLOCK (node) = bc_label;
15076 CAN_COMPLETE_NORMALLY (bc_label) = 1;
15078 /* Our break/continue don't return values. */
15079 TREE_TYPE (node) = void_type_node;
15080 /* Encapsulate the break within a compound statement so that it's
15081 expanded all the times by expand_expr (and not clobbered
15082 sometimes, like after a if statement) */
15083 node = add_stmt_to_compound (NULL_TREE, void_type_node, node);
15084 TREE_SIDE_EFFECTS (node) = 1;
15088 /* Process the exit expression belonging to a loop. Its type must be
15092 patch_exit_expr (tree node)
15094 tree expression = TREE_OPERAND (node, 0);
15095 TREE_TYPE (node) = error_mark_node;
15096 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
15098 /* The type of expression must be boolean */
15099 if (TREE_TYPE (expression) != boolean_type_node)
15101 parse_error_context
15103 "Incompatible type for loop conditional. Can't convert `%s' to `boolean'",
15104 lang_printable_name (TREE_TYPE (expression), 0));
15105 return error_mark_node;
15107 /* Now we know things are allright, invert the condition, fold and
15109 TREE_OPERAND (node, 0) =
15110 fold (build1 (TRUTH_NOT_EXPR, boolean_type_node, expression));
15112 if (! integer_zerop (TREE_OPERAND (node, 0))
15113 && ctxp->current_loop != NULL_TREE
15114 && TREE_CODE (ctxp->current_loop) == LOOP_EXPR)
15115 CAN_COMPLETE_NORMALLY (ctxp->current_loop) = 1;
15116 if (! integer_onep (TREE_OPERAND (node, 0)))
15117 CAN_COMPLETE_NORMALLY (node) = 1;
15120 TREE_TYPE (node) = void_type_node;
15124 /* 14.9 Switch statement */
15127 patch_switch_statement (tree node)
15129 tree se = TREE_OPERAND (node, 0), se_type;
15132 /* Complete the switch expression */
15133 se = TREE_OPERAND (node, 0) = java_complete_tree (se);
15134 se_type = TREE_TYPE (se);
15135 /* The type of the switch expression must be char, byte, short or
15137 if (! JINTEGRAL_TYPE_P (se_type) || se_type == long_type_node)
15139 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
15140 parse_error_context (wfl_operator,
15141 "Incompatible type for `switch'. Can't convert `%s' to `int'",
15142 lang_printable_name (se_type, 0));
15143 /* This is what java_complete_tree will check */
15144 TREE_OPERAND (node, 0) = error_mark_node;
15145 return error_mark_node;
15148 /* Save and restore the outer case label list. */
15149 save = case_label_list;
15150 case_label_list = NULL_TREE;
15152 TREE_OPERAND (node, 1) = java_complete_tree (TREE_OPERAND (node, 1));
15154 /* See if we've found a duplicate label. We can't leave this until
15155 code generation, because in `--syntax-only' and `-C' modes we
15156 don't do ordinary code generation. */
15157 for (iter = case_label_list; iter != NULL_TREE; iter = TREE_CHAIN (iter))
15159 HOST_WIDE_INT val = TREE_INT_CST_LOW (TREE_VALUE (iter));
15161 for (subiter = TREE_CHAIN (iter);
15162 subiter != NULL_TREE;
15163 subiter = TREE_CHAIN (subiter))
15165 HOST_WIDE_INT subval = TREE_INT_CST_LOW (TREE_VALUE (subiter));
15168 EXPR_WFL_LINECOL (wfl_operator)
15169 = EXPR_WFL_LINECOL (TREE_PURPOSE (iter));
15170 /* The case_label_list is in reverse order, so print the
15171 outer label first. */
15172 parse_error_context (wfl_operator, "duplicate case label: `"
15173 HOST_WIDE_INT_PRINT_DEC "'", subval);
15174 EXPR_WFL_LINECOL (wfl_operator)
15175 = EXPR_WFL_LINECOL (TREE_PURPOSE (subiter));
15176 parse_error_context (wfl_operator, "original label is here");
15183 case_label_list = save;
15185 /* Ready to return */
15186 if (TREE_CODE (TREE_OPERAND (node, 1)) == ERROR_MARK)
15188 TREE_TYPE (node) = error_mark_node;
15189 return error_mark_node;
15191 TREE_TYPE (node) = void_type_node;
15192 TREE_SIDE_EFFECTS (node) = 1;
15193 CAN_COMPLETE_NORMALLY (node)
15194 = CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 1))
15195 || ! SWITCH_HAS_DEFAULT (node);
15201 /* Build an assertion expression for `assert CONDITION : VALUE'; VALUE
15202 might be NULL_TREE. */
15204 build_assertion (int location, tree condition, tree value)
15207 tree klass = GET_CPC ();
15209 if (! enable_assertions (klass))
15211 condition = build2 (TRUTH_ANDIF_EXPR, NULL_TREE,
15212 boolean_false_node, condition);
15213 if (value == NULL_TREE)
15214 value = build_java_empty_stmt ();
15215 return build_if_else_statement (location, condition,
15219 if (! CLASS_USES_ASSERTIONS (klass))
15221 tree field, classdollar, id, call;
15222 tree class_type = TREE_TYPE (klass);
15224 field = add_field (class_type,
15225 get_identifier ("$assertionsDisabled"),
15227 ACC_PRIVATE | ACC_STATIC | ACC_FINAL);
15228 MAYBE_CREATE_VAR_LANG_DECL_SPECIFIC (field);
15229 FIELD_SYNTHETIC (field) = 1;
15231 classdollar = build_incomplete_class_ref (location, class_type);
15233 /* Call CLASS.desiredAssertionStatus(). */
15234 id = build_wfl_node (get_identifier ("desiredAssertionStatus"));
15235 call = build3 (CALL_EXPR, NULL_TREE, id, NULL_TREE, NULL_TREE);
15236 call = make_qualified_primary (classdollar, call, location);
15237 TREE_SIDE_EFFECTS (call) = 1;
15239 /* Invert to obtain !CLASS.desiredAssertionStatus(). This may
15240 seem odd, but we do it to generate code identical to that of
15242 call = build1 (TRUTH_NOT_EXPR, NULL_TREE, call);
15243 TREE_SIDE_EFFECTS (call) = 1;
15244 DECL_INITIAL (field) = call;
15246 /* Record the initializer in the initializer statement list. */
15247 call = build2 (MODIFY_EXPR, NULL_TREE, field, call);
15248 TREE_CHAIN (call) = CPC_STATIC_INITIALIZER_STMT (ctxp);
15249 SET_CPC_STATIC_INITIALIZER_STMT (ctxp, call);
15250 MODIFY_EXPR_FROM_INITIALIZATION_P (call) = 1;
15252 CLASS_USES_ASSERTIONS (klass) = 1;
15255 if (value != NULL_TREE)
15256 value = tree_cons (NULL_TREE, value, NULL_TREE);
15258 node = build_wfl_node (get_identifier ("java"));
15259 node = make_qualified_name (node, build_wfl_node (get_identifier ("lang")),
15261 node = make_qualified_name (node, build_wfl_node (get_identifier ("AssertionError")),
15264 node = build3 (NEW_CLASS_EXPR, NULL_TREE, node, value, NULL_TREE);
15265 TREE_SIDE_EFFECTS (node) = 1;
15266 /* It is too early to use BUILD_THROW. */
15267 node = build1 (THROW_EXPR, NULL_TREE, node);
15268 TREE_SIDE_EFFECTS (node) = 1;
15270 /* We invert the condition; if we just put NODE as the `else' part
15271 then we generate weird-looking bytecode. */
15272 condition = build1 (TRUTH_NOT_EXPR, NULL_TREE, condition);
15273 /* Check $assertionsDisabled. */
15275 = build2 (TRUTH_ANDIF_EXPR, NULL_TREE,
15276 build1 (TRUTH_NOT_EXPR, NULL_TREE,
15277 build_wfl_node (get_identifier ("$assertionsDisabled"))),
15279 node = build_if_else_statement (location, condition, node, NULL_TREE);
15283 /* 14.18 The try/catch statements */
15285 /* Encapsulate TRY_STMTS' in a try catch sequence. The catch clause
15286 catches TYPE and executes CATCH_STMTS. */
15289 encapsulate_with_try_catch (int location, tree type_or_name, tree try_stmts,
15292 tree try_block, catch_clause_param, catch_block, catch;
15294 /* First build a try block */
15295 try_block = build_expr_block (try_stmts, NULL_TREE);
15297 /* Build a catch block: we need a catch clause parameter */
15298 if (TREE_CODE (type_or_name) == EXPR_WITH_FILE_LOCATION)
15300 tree catch_type = obtain_incomplete_type (type_or_name);
15302 catch_clause_param = build_decl (VAR_DECL, wpv_id, catch_type);
15303 register_incomplete_type (JDEP_VARIABLE, type_or_name,
15304 catch_clause_param, catch_type);
15305 dep = CLASSD_LAST (ctxp->classd_list);
15306 JDEP_GET_PATCH (dep) = &TREE_TYPE (catch_clause_param);
15309 catch_clause_param = build_decl (VAR_DECL, wpv_id,
15310 build_pointer_type (type_or_name));
15313 catch_block = build_expr_block (NULL_TREE, catch_clause_param);
15315 /* Initialize the variable and store in the block */
15316 catch = build2 (MODIFY_EXPR, NULL_TREE, catch_clause_param,
15317 build0 (JAVA_EXC_OBJ_EXPR, ptr_type_node));
15318 add_stmt_to_block (catch_block, NULL_TREE, catch);
15320 /* Add the catch statements */
15321 add_stmt_to_block (catch_block, NULL_TREE, catch_stmts);
15323 /* Now we can build a JAVA_CATCH_EXPR */
15324 catch_block = build1 (JAVA_CATCH_EXPR, NULL_TREE, catch_block);
15326 return build_try_statement (location, try_block, catch_block);
15330 build_try_statement (int location, tree try_block, tree catches)
15332 tree node = build2 (TRY_EXPR, NULL_TREE, try_block, catches);
15333 EXPR_WFL_LINECOL (node) = location;
15338 build_try_finally_statement (int location, tree try_block, tree finally)
15340 tree node = build2 (TRY_FINALLY_EXPR, NULL_TREE, try_block, finally);
15341 EXPR_WFL_LINECOL (node) = location;
15346 patch_try_statement (tree node)
15348 int error_found = 0;
15349 tree try = TREE_OPERAND (node, 0);
15350 /* Exception handlers are considered in left to right order */
15351 tree catch = nreverse (TREE_OPERAND (node, 1));
15352 tree current, caught_type_list = NULL_TREE;
15354 /* Check catch clauses, if any. Every time we find an error, we try
15355 to process the next catch clause. We process the catch clause before
15356 the try block so that when processing the try block we can check thrown
15357 exceptions againts the caught type list. */
15358 for (current = catch; current; current = TREE_CHAIN (current))
15360 tree carg_decl, carg_type;
15361 tree sub_current, catch_block, catch_clause;
15364 /* At this point, the structure of the catch clause is
15365 JAVA_CATCH_EXPR (catch node)
15366 BLOCK (with the decl of the parameter)
15368 MODIFY_EXPR (assignment of the catch parameter)
15369 BLOCK (catch clause block)
15371 catch_clause = TREE_OPERAND (current, 0);
15372 carg_decl = BLOCK_EXPR_DECLS (catch_clause);
15373 carg_type = TREE_TYPE (TREE_TYPE (carg_decl));
15375 /* Catch clauses can't have more than one parameter declared,
15376 but it's already enforced by the grammar. Make sure that the
15377 only parameter of the clause statement in of class Throwable
15378 or a subclass of Throwable, but that was done earlier. The
15379 catch clause parameter type has also been resolved. */
15381 /* Just make sure that the catch clause parameter type inherits
15382 from java.lang.Throwable */
15383 if (!inherits_from_p (carg_type, throwable_type_node))
15385 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (current);
15386 parse_error_context (wfl_operator,
15387 "Can't catch class `%s'. Catch clause parameter type must be a subclass of class `java.lang.Throwable'",
15388 lang_printable_name (carg_type, 0));
15393 /* Partial check for unreachable catch statement: The catch
15394 clause is reachable iff is no earlier catch block A in
15395 the try statement such that the type of the catch
15396 clause's parameter is the same as or a subclass of the
15397 type of A's parameter */
15399 for (sub_current = catch;
15400 sub_current != current; sub_current = TREE_CHAIN (sub_current))
15402 tree sub_catch_clause, decl;
15403 sub_catch_clause = TREE_OPERAND (sub_current, 0);
15404 decl = BLOCK_EXPR_DECLS (sub_catch_clause);
15406 if (inherits_from_p (carg_type, TREE_TYPE (TREE_TYPE (decl))))
15408 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (current);
15409 parse_error_context
15411 "`catch' not reached because of the catch clause at line %d",
15412 EXPR_WFL_LINENO (sub_current));
15413 unreachable = error_found = 1;
15417 /* Complete the catch clause block */
15418 catch_block = java_complete_tree (TREE_OPERAND (current, 0));
15419 if (catch_block == error_mark_node)
15424 if (CAN_COMPLETE_NORMALLY (catch_block))
15425 CAN_COMPLETE_NORMALLY (node) = 1;
15426 TREE_OPERAND (current, 0) = catch_block;
15431 /* Things to do here: the exception must be thrown */
15433 /* Link this type to the caught type list */
15434 caught_type_list = tree_cons (NULL_TREE, carg_type, caught_type_list);
15437 PUSH_EXCEPTIONS (caught_type_list);
15438 if ((try = java_complete_tree (try)) == error_mark_node)
15440 if (CAN_COMPLETE_NORMALLY (try))
15441 CAN_COMPLETE_NORMALLY (node) = 1;
15444 /* Verification ends here */
15446 return error_mark_node;
15448 TREE_OPERAND (node, 0) = try;
15449 TREE_OPERAND (node, 1) = catch;
15450 TREE_TYPE (node) = void_type_node;
15454 /* 14.17 The synchronized Statement */
15457 patch_synchronized_statement (tree node, tree wfl_op1)
15459 tree expr = java_complete_tree (TREE_OPERAND (node, 0));
15460 tree block = TREE_OPERAND (node, 1);
15462 tree tmp, enter, exit, expr_decl, assignment;
15464 if (expr == error_mark_node)
15466 block = java_complete_tree (block);
15470 /* We might be trying to synchronize on a STRING_CST */
15471 if ((tmp = patch_string (expr)))
15474 /* The TYPE of expr must be a reference type */
15475 if (!JREFERENCE_TYPE_P (TREE_TYPE (expr)))
15477 SET_WFL_OPERATOR (wfl_operator, node, wfl_op1);
15478 parse_error_context (wfl_operator, "Incompatible type for `synchronized'. Can't convert `%s' to `java.lang.Object'",
15479 lang_printable_name (TREE_TYPE (expr), 0));
15480 return error_mark_node;
15483 if (flag_emit_xref)
15485 TREE_OPERAND (node, 0) = expr;
15486 TREE_OPERAND (node, 1) = java_complete_tree (block);
15487 CAN_COMPLETE_NORMALLY (node) = 1;
15491 /* Generate a try-finally for the synchronized statement, except
15492 that the handler that catches all throw exception calls
15493 _Jv_MonitorExit and then rethrow the exception.
15494 The synchronized statement is then implemented as:
15497 _Jv_MonitorEnter (expression)
15499 _Jv_MonitorExit (expression)
15503 e = _Jv_exception_info ();
15504 _Jv_MonitorExit (expression)
15508 expr_decl = build_decl (VAR_DECL, generate_name (), TREE_TYPE (expr));
15509 BUILD_MONITOR_ENTER (enter, expr_decl);
15510 BUILD_MONITOR_EXIT (exit, expr_decl);
15511 CAN_COMPLETE_NORMALLY (enter) = 1;
15512 CAN_COMPLETE_NORMALLY (exit) = 1;
15513 assignment = build2 (MODIFY_EXPR, NULL_TREE, expr_decl, expr);
15514 TREE_SIDE_EFFECTS (assignment) = 1;
15515 node = build2 (COMPOUND_EXPR, NULL_TREE,
15516 build2 (COMPOUND_EXPR, NULL_TREE, assignment, enter),
15517 build2 (TRY_FINALLY_EXPR, NULL_TREE, block, exit));
15518 node = build_expr_block (node, expr_decl);
15520 return java_complete_tree (node);
15523 /* 14.16 The throw Statement */
15526 patch_throw_statement (tree node, tree wfl_op1)
15528 tree expr = TREE_OPERAND (node, 0);
15529 tree type = TREE_TYPE (expr);
15530 int unchecked_ok = 0, tryblock_throws_ok = 0;
15532 /* Thrown expression must be assignable to java.lang.Throwable */
15533 if (!try_reference_assignconv (throwable_type_node, expr))
15535 SET_WFL_OPERATOR (wfl_operator, node, wfl_op1);
15536 parse_error_context (wfl_operator,
15537 "Can't throw `%s'; it must be a subclass of class `java.lang.Throwable'",
15538 lang_printable_name (type, 0));
15539 /* If the thrown expression was a reference, we further the
15540 compile-time check. */
15541 if (!JREFERENCE_TYPE_P (type))
15542 return error_mark_node;
15545 /* At least one of the following must be true */
15547 /* The type of the throw expression is a not checked exception,
15548 i.e. is a unchecked expression. */
15549 unchecked_ok = IS_UNCHECKED_EXCEPTION_P (TREE_TYPE (type));
15551 SET_WFL_OPERATOR (wfl_operator, node, wfl_op1);
15552 /* An instance can't throw a checked exception unless that exception
15553 is explicitly declared in the `throws' clause of each
15554 constructor. This doesn't apply to anonymous classes, since they
15555 don't have declared constructors. */
15557 && DECL_INSTINIT_P (current_function_decl)
15558 && !ANONYMOUS_CLASS_P (current_class))
15561 for (current = TYPE_METHODS (current_class); current;
15562 current = TREE_CHAIN (current))
15563 if (DECL_CONSTRUCTOR_P (current)
15564 && !check_thrown_exceptions_do (TREE_TYPE (expr)))
15566 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)",
15567 lang_printable_name (TREE_TYPE (expr), 0));
15568 return error_mark_node;
15572 /* Throw is contained in a try statement and at least one catch
15573 clause can receive the thrown expression or the current method is
15574 declared to throw such an exception. Or, the throw statement is
15575 contained in a method or constructor declaration and the type of
15576 the Expression is assignable to at least one type listed in the
15577 throws clause the declaration. */
15579 tryblock_throws_ok = check_thrown_exceptions_do (TREE_TYPE (expr));
15580 if (!(unchecked_ok || tryblock_throws_ok))
15582 /* If there is a surrounding try block that has no matching
15583 clatch clause, report it first. A surrounding try block exits
15584 only if there is something after the list of checked
15585 exception thrown by the current function (if any). */
15586 if (IN_TRY_BLOCK_P ())
15587 parse_error_context (wfl_operator, "Checked exception `%s' can't be caught by any of the catch clause(s) of the surrounding `try' block",
15588 lang_printable_name (type, 0));
15589 /* If we have no surrounding try statement and the method doesn't have
15590 any throws, report it now. FIXME */
15592 /* We report that the exception can't be throw from a try block
15593 in all circumstances but when the `throw' is inside a static
15595 else if (!EXCEPTIONS_P (currently_caught_type_list)
15596 && !tryblock_throws_ok)
15598 if (DECL_CLINIT_P (current_function_decl))
15599 parse_error_context (wfl_operator,
15600 "Checked exception `%s' can't be thrown in initializer",
15601 lang_printable_name (type, 0));
15603 parse_error_context (wfl_operator,
15604 "Checked exception `%s' isn't thrown from a `try' block",
15605 lang_printable_name (type, 0));
15607 /* Otherwise, the current method doesn't have the appropriate
15608 throws declaration */
15610 parse_error_context (wfl_operator, "Checked exception `%s' doesn't match any of current method's `throws' declaration(s)",
15611 lang_printable_name (type, 0));
15612 return error_mark_node;
15615 if (! flag_emit_class_files && ! flag_emit_xref)
15616 BUILD_THROW (node, expr);
15618 /* If doing xrefs, keep the location where the `throw' was seen. */
15619 if (flag_emit_xref)
15620 EXPR_WFL_LINECOL (node) = EXPR_WFL_LINECOL (wfl_op1);
15624 /* Check that exception said to be thrown by method DECL can be
15625 effectively caught from where DECL is invoked. THIS_EXPR is the
15626 expression that computes `this' for the method call. */
15628 check_thrown_exceptions (int location, tree decl, tree this_expr)
15631 int is_array_call = 0;
15633 /* Skip check within generated methods, such as access$<n>. */
15634 if (OUTER_FIELD_ACCESS_IDENTIFIER_P (DECL_NAME (current_function_decl)))
15637 if (this_expr != NULL_TREE
15638 && TREE_CODE (TREE_TYPE (this_expr)) == POINTER_TYPE
15639 && TYPE_ARRAY_P (TREE_TYPE (TREE_TYPE (this_expr))))
15642 /* For all the unchecked exceptions thrown by DECL. */
15643 for (throws = DECL_FUNCTION_THROWS (decl); throws;
15644 throws = TREE_CHAIN (throws))
15645 if (!check_thrown_exceptions_do (TREE_VALUE (throws)))
15647 /* Suppress errors about cloning arrays. */
15648 if (is_array_call && DECL_NAME (decl) == get_identifier ("clone"))
15651 EXPR_WFL_LINECOL (wfl_operator) = location;
15652 if (DECL_FINIT_P (current_function_decl))
15653 parse_error_context
15654 (wfl_operator, "Exception `%s' can't be thrown in initializer",
15655 lang_printable_name (TREE_VALUE (throws), 0));
15658 parse_error_context
15659 (wfl_operator, "Exception `%s' must be caught, or it must be declared in the `throws' clause of `%s'",
15660 lang_printable_name (TREE_VALUE (throws), 0),
15661 (DECL_INIT_P (current_function_decl) ?
15662 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (current_class))) :
15663 IDENTIFIER_POINTER (DECL_NAME (current_function_decl))));
15668 /* Return 1 if checked EXCEPTION is caught at the current nesting level of
15669 try-catch blocks, OR is listed in the `throws' clause of the
15673 check_thrown_exceptions_do (tree exception)
15675 tree list = currently_caught_type_list;
15676 resolve_and_layout (exception, NULL_TREE);
15677 /* First, all the nested try-catch-finally at that stage. The
15678 last element contains `throws' clause exceptions, if any. */
15679 if (IS_UNCHECKED_EXCEPTION_P (exception))
15684 for (caught = TREE_VALUE (list); caught; caught = TREE_CHAIN (caught))
15685 if (valid_ref_assignconv_cast_p (exception, TREE_VALUE (caught), 0))
15687 list = TREE_CHAIN (list);
15693 purge_unchecked_exceptions (tree mdecl)
15695 tree throws = DECL_FUNCTION_THROWS (mdecl);
15696 tree new = NULL_TREE;
15700 tree next = TREE_CHAIN (throws);
15701 if (!IS_UNCHECKED_EXCEPTION_P (TREE_VALUE (throws)))
15703 TREE_CHAIN (throws) = new;
15708 /* List is inverted here, but it doesn't matter */
15709 DECL_FUNCTION_THROWS (mdecl) = new;
15712 /* This function goes over all of CLASS_TYPE ctors and checks whether
15713 each of them features at least one unchecked exception in its
15714 `throws' clause. If it's the case, it returns `true', `false'
15718 ctors_unchecked_throws_clause_p (tree class_type)
15722 for (current = TYPE_METHODS (class_type); current;
15723 current = TREE_CHAIN (current))
15725 bool ctu = false; /* Ctor Throws Unchecked */
15726 if (DECL_CONSTRUCTOR_P (current))
15729 for (throws = DECL_FUNCTION_THROWS (current); throws && !ctu;
15730 throws = TREE_CHAIN (throws))
15731 if (inherits_from_p (TREE_VALUE (throws), exception_type_node))
15734 /* We return false as we found one ctor that is unfit. */
15735 if (!ctu && DECL_CONSTRUCTOR_P (current))
15738 /* All ctors feature at least one unchecked exception in their
15739 `throws' clause. */
15743 /* 15.24 Conditional Operator ?: */
15746 patch_conditional_expr (tree node, tree wfl_cond, tree wfl_op1)
15748 tree cond = TREE_OPERAND (node, 0);
15749 tree op1 = TREE_OPERAND (node, 1);
15750 tree op2 = TREE_OPERAND (node, 2);
15751 tree resulting_type = NULL_TREE;
15752 tree t1, t2, patched;
15753 int error_found = 0;
15755 /* Operands of ?: might be StringBuffers crafted as a result of a
15756 string concatenation. Obtain a descent operand here. */
15757 if ((patched = patch_string (op1)))
15758 TREE_OPERAND (node, 1) = op1 = patched;
15759 if ((patched = patch_string (op2)))
15760 TREE_OPERAND (node, 2) = op2 = patched;
15762 t1 = TREE_TYPE (op1);
15763 t2 = TREE_TYPE (op2);
15765 /* The first expression must be a boolean */
15766 if (TREE_TYPE (cond) != boolean_type_node)
15768 SET_WFL_OPERATOR (wfl_operator, node, wfl_cond);
15769 parse_error_context (wfl_operator,
15770 "Incompatible type for `?:'. Can't convert `%s' to `boolean'",
15771 lang_printable_name (TREE_TYPE (cond), 0));
15775 /* Second and third can be numeric, boolean (i.e. primitive),
15776 references or null. Anything else results in an error */
15777 if (!((JNUMERIC_TYPE_P (t1) && JNUMERIC_TYPE_P (t2))
15778 || ((JREFERENCE_TYPE_P (t1) || op1 == null_pointer_node)
15779 && (JREFERENCE_TYPE_P (t2) || op2 == null_pointer_node))
15780 || (t1 == boolean_type_node && t2 == boolean_type_node)))
15783 /* Determine the type of the conditional expression. Same types are
15784 easy to deal with */
15786 resulting_type = t1;
15788 /* There are different rules for numeric types */
15789 else if (JNUMERIC_TYPE_P (t1))
15791 /* if byte/short found, the resulting type is short */
15792 if ((t1 == byte_type_node && t2 == short_type_node)
15793 || (t1 == short_type_node && t2 == byte_type_node))
15794 resulting_type = short_type_node;
15796 /* If t1 is a constant int and t2 is of type byte, short or char
15797 and t1's value fits in t2, then the resulting type is t2 */
15798 else if ((t1 == int_type_node && TREE_CONSTANT (TREE_OPERAND (node, 1)))
15799 && JBSC_TYPE_P (t2) && int_fits_type_p (TREE_OPERAND (node, 1), t2))
15800 resulting_type = t2;
15802 /* If t2 is a constant int and t1 is of type byte, short or char
15803 and t2's value fits in t1, then the resulting type is t1 */
15804 else if ((t2 == int_type_node && TREE_CONSTANT (TREE_OPERAND (node, 2)))
15805 && JBSC_TYPE_P (t1) && int_fits_type_p (TREE_OPERAND (node, 2), t1))
15806 resulting_type = t1;
15808 /* Otherwise, binary numeric promotion is applied and the
15809 resulting type is the promoted type of operand 1 and 2 */
15811 resulting_type = binary_numeric_promotion (t1, t2,
15812 &TREE_OPERAND (node, 1),
15813 &TREE_OPERAND (node, 2));
15816 /* Cases of a reference and a null type */
15817 else if (JREFERENCE_TYPE_P (t1) && op2 == null_pointer_node)
15818 resulting_type = t1;
15820 else if (JREFERENCE_TYPE_P (t2) && op1 == null_pointer_node)
15821 resulting_type = t2;
15823 /* Last case: different reference types. If a type can be converted
15824 into the other one by assignment conversion, the latter
15825 determines the type of the expression */
15826 else if ((resulting_type = try_reference_assignconv (t1, op2)))
15827 resulting_type = promote_type (t1);
15829 else if ((resulting_type = try_reference_assignconv (t2, op1)))
15830 resulting_type = promote_type (t2);
15832 /* If we don't have any resulting type, we're in trouble */
15833 if (!resulting_type)
15835 char *t = xstrdup (lang_printable_name (t1, 0));
15836 SET_WFL_OPERATOR (wfl_operator, node, wfl_op1);
15837 parse_error_context (wfl_operator,
15838 "Incompatible type for `?:'. Can't convert `%s' to `%s'",
15839 t, lang_printable_name (t2, 0));
15846 TREE_TYPE (node) = error_mark_node;
15847 return error_mark_node;
15850 TREE_TYPE (node) = resulting_type;
15851 TREE_SET_CODE (node, COND_EXPR);
15852 CAN_COMPLETE_NORMALLY (node) = 1;
15856 /* Wrap EXPR with code to initialize DECL's class, if appropriate. */
15859 maybe_build_class_init_for_field (tree decl, tree expr)
15861 tree clas = DECL_CONTEXT (decl);
15862 if (flag_emit_class_files || flag_emit_xref)
15865 if (TREE_CODE (decl) == VAR_DECL && FIELD_STATIC (decl)
15866 && FIELD_FINAL (decl))
15868 tree init = DECL_INITIAL (decl);
15869 if (init != NULL_TREE)
15870 init = fold_constant_for_init (init, decl);
15871 if (init != NULL_TREE && CONSTANT_VALUE_P (init))
15875 return build_class_init (clas, expr);
15878 /* Try to constant fold NODE.
15879 If NODE is not a constant expression, return NULL_EXPR.
15880 CONTEXT is a static final VAR_DECL whose initializer we are folding. */
15883 fold_constant_for_init (tree node, tree context)
15885 tree op0, op1, val;
15886 enum tree_code code = TREE_CODE (node);
15891 if (node == null_pointer_node)
15900 case TRUNC_MOD_EXPR:
15908 case TRUTH_ANDIF_EXPR:
15909 case TRUTH_ORIF_EXPR:
15916 op0 = TREE_OPERAND (node, 0);
15917 op1 = TREE_OPERAND (node, 1);
15918 val = fold_constant_for_init (op0, context);
15919 if (val == NULL_TREE || ! TREE_CONSTANT (val))
15921 TREE_OPERAND (node, 0) = val;
15922 val = fold_constant_for_init (op1, context);
15923 if (val == NULL_TREE || ! TREE_CONSTANT (val))
15925 TREE_OPERAND (node, 1) = val;
15926 return patch_binop (node, op0, op1);
15928 case UNARY_PLUS_EXPR:
15930 case TRUTH_NOT_EXPR:
15933 op0 = TREE_OPERAND (node, 0);
15934 val = fold_constant_for_init (op0, context);
15935 if (val == NULL_TREE || ! TREE_CONSTANT (val))
15937 TREE_OPERAND (node, 0) = val;
15938 val = patch_unaryop (node, op0);
15939 if (! TREE_CONSTANT (val))
15946 val = fold_constant_for_init (TREE_OPERAND (node, 0), context);
15947 if (val == NULL_TREE || ! TREE_CONSTANT (val))
15949 TREE_OPERAND (node, 0) = val;
15950 val = fold_constant_for_init (TREE_OPERAND (node, 1), context);
15951 if (val == NULL_TREE || ! TREE_CONSTANT (val))
15953 TREE_OPERAND (node, 1) = val;
15954 val = fold_constant_for_init (TREE_OPERAND (node, 2), context);
15955 if (val == NULL_TREE || ! TREE_CONSTANT (val))
15957 TREE_OPERAND (node, 2) = val;
15958 return integer_zerop (TREE_OPERAND (node, 0)) ? TREE_OPERAND (node, 1)
15959 : TREE_OPERAND (node, 2);
15963 if (! FIELD_FINAL (node)
15964 || DECL_INITIAL (node) == NULL_TREE)
15966 val = DECL_INITIAL (node);
15967 /* Guard against infinite recursion. */
15968 DECL_INITIAL (node) = NULL_TREE;
15969 val = fold_constant_for_init (val, node);
15970 if (val != NULL_TREE && TREE_CODE (val) != STRING_CST)
15971 val = try_builtin_assignconv (NULL_TREE, TREE_TYPE (node), val);
15972 DECL_INITIAL (node) = val;
15975 case EXPR_WITH_FILE_LOCATION:
15976 /* Compare java_complete_tree and resolve_expression_name. */
15977 if (!EXPR_WFL_NODE (node) /* Or a PRIMARY flag ? */
15978 || TREE_CODE (EXPR_WFL_NODE (node)) == IDENTIFIER_NODE)
15980 tree name = EXPR_WFL_NODE (node);
15982 if (PRIMARY_P (node))
15984 else if (! QUALIFIED_P (name))
15986 decl = lookup_field_wrapper (DECL_CONTEXT (context), name);
15987 if (decl == NULL_TREE
15988 || (! FIELD_STATIC (decl) && ! FIELD_FINAL (decl)))
15990 return fold_constant_for_init (decl, decl);
15994 tree r = NULL_TREE;
15995 /* Install the proper context for the field resolution. */
15996 tree saved_current_class = current_class;
15997 /* Wait until the USE_COMPONENT_REF re-write. FIXME. */
15998 current_class = DECL_CONTEXT (context);
15999 qualify_ambiguous_name (node);
16000 r = resolve_field_access (node, &decl, NULL);
16001 /* Restore prior context. */
16002 current_class = saved_current_class;
16003 if (r != error_mark_node && decl != NULL_TREE)
16004 return fold_constant_for_init (decl, decl);
16010 op0 = TREE_OPERAND (node, 0);
16011 val = fold_constant_for_init (op0, context);
16012 if (val == NULL_TREE || ! TREE_CONSTANT (val))
16014 TREE_OPERAND (node, 0) = val;
16018 #ifdef USE_COMPONENT_REF
16020 case COMPONENT_REF:
16029 #ifdef USE_COMPONENT_REF
16030 /* Context is 'T' for TypeName, 'P' for PackageName,
16031 'M' for MethodName, 'E' for ExpressionName, and 'A' for AmbiguousName. */
16034 resolve_simple_name (tree name, int context)
16039 resolve_qualified_name (tree name, int context)
16045 init_src_parse (void)
16047 /* Sanity check; we've been bit by this before. */
16048 if (ARRAY_SIZE (ctxp->modifier_ctx) != MODIFIER_TK - PUBLIC_TK)
16054 /* This section deals with the functions that are called when tables
16055 recording class initialization information are traversed. */
16057 /* Attach to PTR (a block) the declaration found in ENTRY. */
16060 attach_init_test_initialization_flags (void **entry, void *ptr)
16062 tree block = (tree)ptr;
16063 struct treetreehash_entry *ite = (struct treetreehash_entry *) *entry;
16065 if (block != error_mark_node)
16067 TREE_CHAIN (ite->value) = BLOCK_EXPR_DECLS (block);
16068 BLOCK_EXPR_DECLS (block) = ite->value;
16073 /* This function is called for each class that is known definitely
16074 initialized when a given static method was called. This function
16075 augments a compound expression (INFO) storing all assignment to
16076 initialized static class flags if a flag already existed, otherwise
16077 a new one is created. */
16080 emit_test_initialization (void **entry_p, void *info)
16082 tree l = (tree) info;
16084 tree key = (tree) *entry_p;
16086 htab_t cf_ht = DECL_FUNCTION_INIT_TEST_TABLE (current_function_decl);
16088 /* If we haven't found a flag and we're dealing with self registered
16089 with current_function_decl, then don't do anything. Self is
16090 always added as definitely initialized but this information is
16091 valid only if used outside the current function. */
16092 if (current_function_decl == TREE_PURPOSE (l)
16093 && java_treetreehash_find (cf_ht, key) == NULL)
16096 ite = java_treetreehash_new (cf_ht, key);
16098 /* If we don't have a variable, create one and install it. */
16103 decl = build_decl (VAR_DECL, NULL_TREE, boolean_type_node);
16104 MAYBE_CREATE_VAR_LANG_DECL_SPECIFIC (decl);
16105 LOCAL_CLASS_INITIALIZATION_FLAG (decl) = 1;
16106 DECL_CONTEXT (decl) = current_function_decl;
16107 DECL_INITIAL (decl) = boolean_true_node;
16108 /* Don't emit any symbolic debugging info for this decl. */
16109 DECL_IGNORED_P (decl) = 1;
16111 /* The trick is to find the right context for it. */
16112 block = BLOCK_SUBBLOCKS (GET_CURRENT_BLOCK (current_function_decl));
16113 TREE_CHAIN (decl) = BLOCK_EXPR_DECLS (block);
16114 BLOCK_EXPR_DECLS (block) = decl;
16120 /* Now simply augment the compound that holds all the assignments
16121 pertaining to this method invocation. */
16122 init = build2 (MODIFY_EXPR, boolean_type_node, decl, boolean_true_node);
16123 TREE_SIDE_EFFECTS (init) = 1;
16124 TREE_VALUE (l) = add_stmt_to_compound (TREE_VALUE (l), void_type_node, init);
16125 TREE_SIDE_EFFECTS (TREE_VALUE (l)) = 1;
16130 #include "gt-java-parse.h"
16131 #include "gtype-java.h"