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"
60 #include "pretty-print.h"
61 #include "diagnostic.h"
63 #include "java-tree.h"
75 #include "tree-inline.h"
79 /* Local function prototypes */
80 static char *java_accstring_lookup (int);
81 static const char *accessibility_string (int);
82 static void classitf_redefinition_error (const char *,tree, tree, tree);
83 static void variable_redefinition_error (tree, tree, tree, int);
84 static tree create_class (int, tree, tree, tree);
85 static tree create_interface (int, tree, tree);
86 static void end_class_declaration (int);
87 static tree find_field (tree, tree);
88 static tree lookup_field_wrapper (tree, tree);
89 static int duplicate_declaration_error_p (tree, tree, tree);
90 static void register_fields (int, tree, tree);
91 static tree parser_qualified_classname (tree);
92 static int parser_check_super (tree, tree, tree);
93 static int parser_check_super_interface (tree, tree, tree);
94 static void check_modifiers_consistency (int);
95 static tree lookup_cl (tree);
96 static tree lookup_java_method2 (tree, tree, int);
97 static tree method_header (int, tree, tree, tree);
98 static void fix_method_argument_names (tree ,tree);
99 static tree method_declarator (tree, tree);
100 static void parse_warning_context (tree cl, const char *msg, ...)
102 #ifdef USE_MAPPED_LOCATION
103 static void issue_warning_error_from_context
104 (source_location, const char *msg, va_list) ATTRIBUTE_PRINTF (2, 0);
106 static void issue_warning_error_from_context (tree, const char *msg, va_list)
107 ATTRIBUTE_PRINTF (2, 0);
109 static void parse_ctor_invocation_error (void);
110 static tree parse_jdk1_1_error (const char *);
111 static void complete_class_report_errors (jdep *);
112 static int process_imports (void);
113 static void read_import_dir (tree);
114 static int find_in_imports_on_demand (tree, tree);
115 static void find_in_imports (tree, tree);
116 static void check_inner_class_access (tree, tree, tree);
117 static int check_pkg_class_access (tree, tree, bool, tree);
118 static void register_package (tree);
119 static tree resolve_package (tree, tree *, tree *);
120 static tree resolve_class (tree, tree, tree, tree);
121 static void declare_local_variables (int, tree, tree);
122 static void dump_java_tree (enum tree_dump_index, tree);
123 static void source_start_java_method (tree);
124 static void source_end_java_method (void);
125 static tree find_name_in_single_imports (tree);
126 static void check_abstract_method_header (tree);
127 static tree lookup_java_interface_method2 (tree, tree);
128 static tree resolve_expression_name (tree, tree *);
129 static tree maybe_create_class_interface_decl (tree, tree, tree, tree);
130 static int check_class_interface_creation (int, int, tree, tree, tree, tree);
131 static tree patch_method_invocation (tree, tree, tree, int, int *, tree *);
132 static tree resolve_and_layout (tree, tree);
133 static tree qualify_and_find (tree, tree, tree);
134 static tree resolve_no_layout (tree, tree);
135 static int invocation_mode (tree, int);
136 static tree find_applicable_accessible_methods_list (int, tree, tree, tree);
137 static void search_applicable_methods_list (int, tree, tree, tree, tree *, tree *);
138 static tree find_most_specific_methods_list (tree);
139 static int argument_types_convertible (tree, tree);
140 static tree patch_invoke (tree, tree, tree);
141 static int maybe_use_access_method (int, tree *, tree *);
142 static tree lookup_method_invoke (int, tree, tree, tree, tree);
143 static tree register_incomplete_type (int, tree, tree, tree);
144 static tree check_inner_circular_reference (tree, tree);
145 static tree check_circular_reference (tree);
146 static tree obtain_incomplete_type (tree);
147 static tree java_complete_lhs (tree);
148 static tree java_complete_tree (tree);
149 static tree maybe_generate_pre_expand_clinit (tree);
150 static int analyze_clinit_body (tree, tree);
151 static int maybe_yank_clinit (tree);
152 static void start_complete_expand_method (tree);
153 static void java_complete_expand_method (tree);
154 static void java_expand_method_bodies (tree);
155 static int unresolved_type_p (tree, tree *);
156 static void create_jdep_list (struct parser_ctxt *);
157 static tree build_expr_block (tree, tree);
158 static tree enter_block (void);
159 static tree exit_block (void);
160 static tree lookup_name_in_blocks (tree);
161 static void maybe_absorb_scoping_blocks (void);
162 static tree build_method_invocation (tree, tree);
163 static tree build_new_invocation (tree, tree);
164 static tree build_assignment (int, int, tree, tree);
165 static tree build_binop (enum tree_code, int, tree, tree);
166 static tree patch_assignment (tree, tree);
167 static tree patch_binop (tree, tree, tree);
168 static tree build_unaryop (int, int, tree);
169 static tree build_incdec (int, int, tree, int);
170 static tree patch_unaryop (tree, tree);
171 static tree build_cast (int, tree, tree);
172 static tree build_null_of_type (tree);
173 static tree patch_cast (tree, tree);
174 static int valid_ref_assignconv_cast_p (tree, tree, int);
175 static int valid_builtin_assignconv_identity_widening_p (tree, tree);
176 static int valid_cast_to_p (tree, tree);
177 static int valid_method_invocation_conversion_p (tree, tree);
178 static tree try_builtin_assignconv (tree, tree, tree);
179 static tree try_reference_assignconv (tree, tree);
180 static tree build_unresolved_array_type (tree);
181 static int build_type_name_from_array_name (tree, tree *);
182 static tree build_array_from_name (tree, tree, tree, tree *);
183 static tree build_array_ref (int, tree, tree);
184 static tree patch_array_ref (tree);
185 #ifdef USE_MAPPED_LOCATION
186 static tree make_qualified_name (tree, tree, source_location);
188 static tree make_qualified_name (tree, tree, int);
190 static tree merge_qualified_name (tree, tree);
191 static tree make_qualified_primary (tree, tree, int);
192 static int resolve_qualified_expression_name (tree, tree *, tree *, tree *);
193 static void qualify_ambiguous_name (tree);
194 static tree resolve_field_access (tree, tree *, tree *);
195 static tree build_newarray_node (tree, tree, int);
196 static tree patch_newarray (tree);
197 static tree resolve_type_during_patch (tree);
198 static tree build_this (int);
199 static tree build_wfl_wrap (tree, int);
200 static tree build_return (int, tree);
201 static tree patch_return (tree);
202 static tree maybe_access_field (tree, tree, tree);
203 static int complete_function_arguments (tree);
204 static int check_for_static_method_reference (tree, tree, tree, tree, tree);
205 static int not_accessible_p (tree, tree, tree, int);
206 static void check_deprecation (tree, tree);
207 static int class_in_current_package (tree);
208 static tree build_if_else_statement (int, tree, tree, tree);
209 static tree patch_if_else_statement (tree);
210 static tree add_stmt_to_block (tree, tree, tree);
211 static tree patch_exit_expr (tree);
212 static tree build_labeled_block (int, tree);
213 static tree finish_labeled_statement (tree, tree);
214 static tree build_bc_statement (int, int, tree);
215 static tree patch_bc_statement (tree);
216 static tree patch_loop_statement (tree);
217 static tree build_new_loop (tree);
218 static tree build_loop_body (int, tree, int);
219 static tree finish_loop_body (int, tree, tree, int);
220 static tree build_debugable_stmt (int, tree);
221 static tree finish_for_loop (int, tree, tree, tree);
222 static tree patch_switch_statement (tree);
223 static tree string_constant_concatenation (tree, tree);
224 static tree build_string_concatenation (tree, tree);
225 static tree patch_string_cst (tree);
226 static tree patch_string (tree);
227 static tree encapsulate_with_try_catch (int, tree, tree, tree);
228 #ifdef USE_MAPPED_LOCATION
229 static tree build_assertion (source_location, tree, tree);
231 static tree build_assertion (int, tree, tree);
233 static tree build_try_statement (int, tree, tree);
234 static tree build_try_finally_statement (int, tree, tree);
235 static tree patch_try_statement (tree);
236 static tree patch_synchronized_statement (tree, tree);
237 static tree patch_throw_statement (tree, tree);
238 #ifdef USE_MAPPED_LOCATION
239 static void check_thrown_exceptions (source_location, tree, tree);
241 static void check_thrown_exceptions (int, tree, tree);
243 static int check_thrown_exceptions_do (tree);
244 static void purge_unchecked_exceptions (tree);
245 static bool ctors_unchecked_throws_clause_p (tree);
246 static void check_concrete_throws_clauses (tree, tree, tree, tree);
247 static void check_throws_clauses (tree, tree, tree);
248 static void finish_method_declaration (tree);
249 static tree build_super_invocation (tree);
250 static int verify_constructor_circularity (tree, tree);
251 static char *constructor_circularity_msg (tree, tree);
252 static tree build_this_super_qualified_invocation (int, tree, tree, int, int);
253 static const char *get_printable_method_name (tree);
254 static tree patch_conditional_expr (tree, tree, tree);
255 static tree generate_finit (tree);
256 static tree generate_instinit (tree);
257 static tree build_instinit_invocation (tree);
258 static void fix_constructors (tree);
259 static tree build_alias_initializer_parameter_list (int, tree, tree, int *);
260 static tree craft_constructor (tree, tree);
261 static int verify_constructor_super (tree);
262 static tree create_artificial_method (tree, int, tree, tree, tree);
263 static void start_artificial_method_body (tree);
264 static void end_artificial_method_body (tree);
265 static int check_method_redefinition (tree, tree);
266 static int check_method_types_complete (tree);
267 static bool hack_is_accessible_p (tree, tree);
268 static void java_check_regular_methods (tree);
269 static void check_interface_throws_clauses (tree, tree);
270 static void java_check_abstract_methods (tree);
271 static void unreachable_stmt_error (tree);
272 static int not_accessible_field_error (tree, tree);
273 static tree find_expr_with_wfl (tree);
274 static void missing_return_error (tree);
275 static tree build_new_array_init (int, tree);
276 static tree patch_new_array_init (tree, tree);
277 static tree maybe_build_array_element_wfl (tree);
278 static int array_constructor_check_entry (tree, tree);
279 static const char *purify_type_name (const char *);
280 static tree fold_constant_for_init (tree, tree);
281 static tree strip_out_static_field_access_decl (tree);
282 static jdeplist *reverse_jdep_list (struct parser_ctxt *);
283 static void static_ref_err (tree, tree, tree);
284 static void parser_add_interface (tree, tree, tree);
285 static void add_superinterfaces (tree, tree);
286 static tree jdep_resolve_class (jdep *);
287 static int note_possible_classname (const char *, int);
288 static void java_complete_expand_classes (void);
289 static void java_complete_expand_class (tree);
290 static void java_complete_expand_methods (tree);
291 static tree cut_identifier_in_qualified (tree);
292 static tree java_stabilize_reference (tree);
293 static tree do_unary_numeric_promotion (tree);
294 static char * operator_string (tree);
295 static tree do_merge_string_cste (tree, const char *, int, int);
296 static tree merge_string_cste (tree, tree, int);
297 static tree java_refold (tree);
298 static int java_decl_equiv (tree, tree);
299 static int binop_compound_p (enum tree_code);
300 static tree search_loop (tree);
301 static int labeled_block_contains_loop_p (tree, tree);
302 static int check_abstract_method_definitions (int, tree, tree);
303 static void java_check_abstract_method_definitions (tree);
304 static void java_debug_context_do (int);
305 static void java_parser_context_push_initialized_field (void);
306 static void java_parser_context_pop_initialized_field (void);
307 static tree reorder_static_initialized (tree);
308 static void java_parser_context_suspend (void);
309 static void java_parser_context_resume (void);
310 static int pop_current_osb (struct parser_ctxt *);
312 /* JDK 1.1 work. FIXME */
314 static tree maybe_make_nested_class_name (tree);
315 static int make_nested_class_name (tree);
316 static void link_nested_class_to_enclosing (void);
317 static tree resolve_inner_class (htab_t, tree, tree *, tree *, tree);
318 static tree find_as_inner_class (tree, tree, tree);
319 static tree find_as_inner_class_do (tree, tree);
320 static int check_inner_class_redefinition (tree, tree);
322 static tree build_thisn_assign (void);
323 static tree build_current_thisn (tree);
324 static tree build_access_to_thisn (tree, tree, int);
325 static tree maybe_build_thisn_access_method (tree);
327 static tree build_outer_field_access (tree, tree);
328 static tree build_outer_field_access_methods (tree);
329 static tree build_outer_field_access_expr (int, tree, tree,
331 static tree build_outer_method_access_method (tree);
332 static tree build_new_access_id (void);
333 static tree build_outer_field_access_method (tree, tree, tree,
336 static int outer_field_access_p (tree, tree);
337 static int outer_field_expanded_access_p (tree, tree *,
339 static tree outer_field_access_fix (tree, tree, tree);
340 static tree build_incomplete_class_ref (int, tree);
341 static tree patch_incomplete_class_ref (tree);
342 static tree create_anonymous_class (tree);
343 static void patch_anonymous_class (tree, tree, tree);
344 static void add_inner_class_fields (tree, tree);
346 static tree build_dot_class_method (tree);
347 static tree build_dot_class_method_invocation (tree, tree);
348 static void create_new_parser_context (int);
349 static tree maybe_build_class_init_for_field (tree, tree);
351 static int attach_init_test_initialization_flags (void **, void *);
352 static int emit_test_initialization (void **, void *);
354 static char *string_convert_int_cst (tree);
356 /* Number of error found so far. */
357 int java_error_count;
358 /* Number of warning found so far. */
359 int java_warning_count;
360 /* Tell when not to fold, when doing xrefs */
362 /* Cyclic inheritance report, as it can be set by layout_class */
363 const char *cyclic_inheritance_report;
365 /* The current parser context */
366 struct parser_ctxt *ctxp;
368 /* List of things that were analyzed for which code will be generated */
369 struct parser_ctxt *ctxp_for_generation = NULL;
371 /* binop_lookup maps token to tree_code. It is used where binary
372 operations are involved and required by the parser. RDIV_EXPR
373 covers both integral/floating point division. The code is changed
374 once the type of both operator is worked out. */
376 static const enum tree_code binop_lookup[19] =
378 PLUS_EXPR, MINUS_EXPR, MULT_EXPR, RDIV_EXPR, TRUNC_MOD_EXPR,
379 LSHIFT_EXPR, RSHIFT_EXPR, URSHIFT_EXPR,
380 BIT_AND_EXPR, BIT_XOR_EXPR, BIT_IOR_EXPR,
381 TRUTH_ANDIF_EXPR, TRUTH_ORIF_EXPR,
382 EQ_EXPR, NE_EXPR, GT_EXPR, GE_EXPR, LT_EXPR, LE_EXPR,
384 #define BINOP_LOOKUP(VALUE) \
385 binop_lookup [((VALUE) - PLUS_TK) % ARRAY_SIZE (binop_lookup)]
387 /* This is the end index for binary operators that can also be used
388 in compound assignments. */
389 #define BINOP_COMPOUND_CANDIDATES 11
391 /* The "$L" identifier we use to create labels. */
392 static GTY(()) tree label_id;
394 /* The "StringBuffer" identifier used for the String `+' operator. */
395 static GTY(()) tree wfl_string_buffer;
397 /* The "append" identifier used for String `+' operator. */
398 static GTY(()) tree wfl_append;
400 /* The "toString" identifier used for String `+' operator. */
401 static GTY(()) tree wfl_to_string;
403 /* The "java.lang" import qualified name. */
404 static GTY(()) tree java_lang_id;
406 /* The generated `inst$' identifier used for generated enclosing
407 instance/field access functions. */
408 static GTY(()) tree inst_id;
410 /* Context and flag for static blocks */
411 static GTY(()) tree current_static_block;
413 /* The generated `write_parm_value$' identifier. */
414 static GTY(()) tree wpv_id;
416 /* The list of all packages we've seen so far */
417 static GTY(()) tree package_list;
419 /* Hold THIS for the scope of the current method decl. */
420 static GTY(()) tree current_this;
422 /* Hold a list of catch clauses list. The first element of this list is
423 the list of the catch clauses of the currently analyzed try block. */
424 static GTY(()) tree currently_caught_type_list;
426 /* This holds a linked list of all the case labels for the current
427 switch statement. It is only used when checking to see if there
428 are duplicate labels. FIXME: probably this should just be attached
429 to the switch itself; then it could be referenced via
430 `ctxp->current_loop'. */
431 static GTY(()) tree case_label_list;
433 /* Anonymous class counter. Will be reset to 1 every time a non
434 anonymous class gets created. */
435 static int anonymous_class_counter = 1;
437 static GTY(()) tree src_parse_roots[1];
439 /* All classes seen from source code */
440 #define gclass_list src_parse_roots[0]
442 /* Check modifiers. If one doesn't fit, retrieve it in its declaration
443 line and point it out. */
444 /* Should point out the one that don't fit. ASCII/unicode, going
447 #define check_modifiers(__message, __value, __mask) do { \
448 if ((__value) & ~(__mask)) \
450 size_t i, remainder = (__value) & ~(__mask); \
451 for (i = 0; i < ARRAY_SIZE (ctxp->modifier_ctx); i++) \
452 if ((1 << i) & remainder) \
453 parse_error_context (ctxp->modifier_ctx [i], (__message), \
454 java_accstring_lookup (1 << i)); \
465 #ifdef USE_MAPPED_LOCATION
466 source_location location;
475 #ifdef USE_MAPPED_LOCATION
476 #define SET_EXPR_LOCATION_FROM_TOKEN(EXPR, TOKEN) \
477 SET_EXPR_LOCATION(EXPR, (TOKEN).location)
479 #define SET_EXPR_LOCATION_FROM_TOKEN(EXPR, TOKEN) \
480 (EXPR_WFL_LINECOL (EXPR) = (TOKEN).location)
488 /* Things defined here have to match the order of what's in the
489 binop_lookup table. */
491 %token PLUS_TK MINUS_TK MULT_TK DIV_TK REM_TK
492 %token LS_TK SRS_TK ZRS_TK
493 %token AND_TK XOR_TK OR_TK
494 %token BOOL_AND_TK BOOL_OR_TK
495 %token EQ_TK NEQ_TK GT_TK GTE_TK LT_TK LTE_TK
497 /* This maps to the same binop_lookup entry than the token above */
499 %token PLUS_ASSIGN_TK MINUS_ASSIGN_TK MULT_ASSIGN_TK DIV_ASSIGN_TK
501 %token LS_ASSIGN_TK SRS_ASSIGN_TK ZRS_ASSIGN_TK
502 %token AND_ASSIGN_TK XOR_ASSIGN_TK OR_ASSIGN_TK
505 /* Modifier TOKEN have to be kept in this order. Don't scramble it */
507 %token PUBLIC_TK PRIVATE_TK PROTECTED_TK
508 %token STATIC_TK FINAL_TK SYNCHRONIZED_TK
509 %token VOLATILE_TK TRANSIENT_TK NATIVE_TK
510 %token PAD_TK ABSTRACT_TK STRICT_TK
513 /* Keep those two in order, too */
514 %token DECR_TK INCR_TK
516 /* From now one, things can be in any order */
518 %token DEFAULT_TK IF_TK THROW_TK
519 %token BOOLEAN_TK DO_TK IMPLEMENTS_TK
520 %token THROWS_TK BREAK_TK IMPORT_TK
521 %token ELSE_TK INSTANCEOF_TK RETURN_TK
522 %token VOID_TK CATCH_TK INTERFACE_TK
523 %token CASE_TK EXTENDS_TK FINALLY_TK
524 %token SUPER_TK WHILE_TK CLASS_TK
525 %token SWITCH_TK CONST_TK TRY_TK
526 %token FOR_TK NEW_TK CONTINUE_TK
527 %token GOTO_TK PACKAGE_TK THIS_TK
530 %token BYTE_TK SHORT_TK INT_TK LONG_TK
531 %token CHAR_TK INTEGRAL_TK
533 %token FLOAT_TK DOUBLE_TK FP_TK
537 %token REL_QM_TK REL_CL_TK NOT_TK NEG_TK
539 %token ASSIGN_ANY_TK ASSIGN_TK
540 %token OP_TK CP_TK OCB_TK CCB_TK OSB_TK CSB_TK SC_TK C_TK DOT_TK
542 %token STRING_LIT_TK CHAR_LIT_TK INT_LIT_TK FP_LIT_TK
543 %token TRUE_TK FALSE_TK BOOL_LIT_TK NULL_TK
545 %type <value> modifiers MODIFIER_TK final synchronized
547 %type <node> super ID_TK identifier
548 %type <node> name simple_name qualified_name
549 %type <node> type_declaration compilation_unit
550 field_declaration method_declaration extends_interfaces
551 interfaces interface_type_list
552 import_declarations package_declaration
553 type_declarations interface_body
554 interface_member_declaration constant_declaration
555 interface_member_declarations interface_type
556 abstract_method_declaration
557 %type <node> class_body_declaration class_member_declaration
558 static_initializer constructor_declaration block
559 %type <node> class_body_declarations constructor_header
560 %type <node> class_or_interface_type class_type class_type_list
561 constructor_declarator explicit_constructor_invocation
562 %type <node> dim_expr dim_exprs this_or_super throws
564 %type <node> variable_declarator_id variable_declarator
565 variable_declarators variable_initializer
566 variable_initializers constructor_body
569 %type <node> class_body block_end constructor_block_end
570 %type <node> statement statement_without_trailing_substatement
571 labeled_statement if_then_statement label_decl
572 if_then_else_statement while_statement for_statement
573 statement_nsi labeled_statement_nsi do_statement
574 if_then_else_statement_nsi while_statement_nsi
575 for_statement_nsi statement_expression_list for_init
576 for_update statement_expression expression_statement
577 primary_no_new_array expression primary array_type
578 array_creation_initialized array_creation_uninitialized
579 class_instance_creation_expression field_access
580 method_invocation array_access something_dot_new
581 argument_list postfix_expression while_expression
582 post_increment_expression post_decrement_expression
583 unary_expression_not_plus_minus unary_expression
584 pre_increment_expression pre_decrement_expression
586 multiplicative_expression additive_expression
587 shift_expression relational_expression
588 equality_expression and_expression
589 exclusive_or_expression inclusive_or_expression
590 conditional_and_expression conditional_or_expression
591 conditional_expression assignment_expression
592 left_hand_side assignment for_header for_begin
593 constant_expression do_statement_begin empty_statement
594 switch_statement synchronized_statement throw_statement
595 try_statement assert_statement
596 switch_expression switch_block
597 catches catch_clause catch_clause_parameter finally
598 anonymous_class_creation trap_overflow_corner_case
599 %type <node> return_statement break_statement continue_statement
601 %type <operator> ASSIGN_TK MULT_ASSIGN_TK DIV_ASSIGN_TK
602 %type <operator> REM_ASSIGN_TK PLUS_ASSIGN_TK MINUS_ASSIGN_TK
603 %type <operator> LS_ASSIGN_TK SRS_ASSIGN_TK ZRS_ASSIGN_TK
604 %type <operator> AND_ASSIGN_TK XOR_ASSIGN_TK OR_ASSIGN_TK
605 %type <operator> ASSIGN_ANY_TK assignment_operator
606 %token <operator> EQ_TK GTE_TK ZRS_TK SRS_TK GT_TK LTE_TK LS_TK
607 %token <operator> BOOL_AND_TK AND_TK BOOL_OR_TK OR_TK INCR_TK PLUS_TK
608 %token <operator> DECR_TK MINUS_TK MULT_TK DIV_TK XOR_TK REM_TK NEQ_TK
609 %token <operator> NEG_TK REL_QM_TK REL_CL_TK NOT_TK LT_TK OCB_TK CCB_TK
610 %token <operator> OP_TK OSB_TK DOT_TK THROW_TK INSTANCEOF_TK
611 %type <operator> THIS_TK SUPER_TK RETURN_TK BREAK_TK CONTINUE_TK
612 %type <operator> CASE_TK DEFAULT_TK TRY_TK CATCH_TK SYNCHRONIZED_TK
613 %type <operator> NEW_TK ASSERT_TK
615 %type <node> method_body
617 %type <node> literal INT_LIT_TK FP_LIT_TK BOOL_LIT_TK CHAR_LIT_TK
618 STRING_LIT_TK NULL_TK VOID_TK
620 %type <node> IF_TK WHILE_TK FOR_TK
622 %type <node> formal_parameter_list formal_parameter
623 method_declarator method_header
625 %type <node> primitive_type reference_type type
626 BOOLEAN_TK INTEGRAL_TK FP_TK
628 /* Added or modified JDK 1.1 rule types */
629 %type <node> type_literals
632 /* 19.2 Production from 2.3: The Syntactic Grammar */
633 goal: compilation_unit
637 /* 19.3 Productions from 3: Lexical structure */
647 /* 19.4 Productions from 4: Types, Values and Variables */
660 class_or_interface_type
664 class_or_interface_type:
669 class_or_interface_type /* Default rule */
673 class_or_interface_type
679 int osb = pop_current_osb (ctxp);
680 tree t = build_java_array_type (($1), -1);
682 t = build_unresolved_array_type (t);
687 int osb = pop_current_osb (ctxp);
690 t = build_unresolved_array_type (t);
695 /* 19.5 Productions from 6: Names */
697 simple_name /* Default rule */
698 | qualified_name /* Default rule */
702 identifier /* Default rule */
706 name DOT_TK identifier
707 { $$ = make_qualified_name ($1, $3, $2.location); }
714 /* 19.6: Production from 7: Packages */
717 | package_declaration
718 | import_declarations
720 | package_declaration import_declarations
721 | package_declaration type_declarations
722 | import_declarations type_declarations
723 | package_declaration import_declarations type_declarations
731 | import_declarations import_declaration
739 | type_declarations type_declaration
743 PACKAGE_TK name SC_TK
745 ctxp->package = EXPR_WFL_NODE ($2);
746 register_package (ctxp->package);
749 {yyerror ("Missing name"); RECOVER;}
750 | PACKAGE_TK name error
751 {yyerror ("';' expected"); RECOVER;}
755 single_type_import_declaration
756 | type_import_on_demand_declaration
759 single_type_import_declaration:
762 tree name = EXPR_WFL_NODE ($2), last_name;
763 int i = IDENTIFIER_LENGTH (name)-1;
764 const char *last = &IDENTIFIER_POINTER (name)[i];
765 while (last != IDENTIFIER_POINTER (name))
771 last_name = get_identifier (++last);
772 if (IS_A_SINGLE_IMPORT_CLASSFILE_NAME_P (last_name))
774 tree err = find_name_in_single_imports (last_name);
775 if (err && err != name)
777 ($2, "Ambiguous class: `%s' and `%s'",
778 IDENTIFIER_POINTER (name),
779 IDENTIFIER_POINTER (err));
781 REGISTER_IMPORT ($2, last_name);
784 REGISTER_IMPORT ($2, last_name);
787 {yyerror ("Missing name"); RECOVER;}
788 | IMPORT_TK name error
789 {yyerror ("';' expected"); RECOVER;}
792 type_import_on_demand_declaration:
793 IMPORT_TK name DOT_TK MULT_TK SC_TK
795 tree name = EXPR_WFL_NODE ($2);
797 /* Search for duplicates. */
798 for (it = ctxp->import_demand_list; it; it = TREE_CHAIN (it))
799 if (EXPR_WFL_NODE (TREE_PURPOSE (it)) == name)
801 /* Don't import the same thing more than once, just ignore
802 duplicates (7.5.2) */
805 read_import_dir ($2);
806 ctxp->import_demand_list =
807 chainon (ctxp->import_demand_list,
808 build_tree_list ($2, NULL_TREE));
811 | IMPORT_TK name DOT_TK error
812 {yyerror ("'*' expected"); RECOVER;}
813 | IMPORT_TK name DOT_TK MULT_TK error
814 {yyerror ("';' expected"); RECOVER;}
819 { end_class_declaration (0); }
820 | interface_declaration
821 { end_class_declaration (0); }
826 yyerror ("Class or interface declaration expected");
830 /* 19.7 Shortened from the original:
831 modifiers: modifier | modifiers modifier
832 modifier: any of public... */
838 | modifiers MODIFIER_TK
843 (ctxp->modifier_ctx [$2], "Modifier `%s' declared twice",
844 java_accstring_lookup (acc));
852 /* 19.8.1 Production from $8.1: Class Declaration */
854 modifiers CLASS_TK identifier super interfaces
855 { create_class ($1, $3, $4, $5); }
858 | CLASS_TK identifier super interfaces
859 { create_class (0, $2, $3, $4); }
862 | modifiers CLASS_TK error
863 { yyerror ("Missing class name"); RECOVER; }
865 { yyerror ("Missing class name"); RECOVER; }
866 | CLASS_TK identifier error
868 if (!ctxp->class_err) yyerror ("'{' expected");
871 | modifiers CLASS_TK identifier error
872 { if (!ctxp->class_err) yyerror ("'{' expected"); RECOVER; }
877 | EXTENDS_TK class_type
879 | EXTENDS_TK class_type error
880 {yyerror ("'{' expected"); ctxp->class_err=1;}
882 {yyerror ("Missing super class name"); ctxp->class_err=1;}
887 | IMPLEMENTS_TK interface_type_list
889 | IMPLEMENTS_TK error
892 yyerror ("Missing interface name");
899 ctxp->interface_number = 1;
900 $$ = build_tree_list ($1, NULL_TREE);
902 | interface_type_list C_TK interface_type
904 ctxp->interface_number++;
905 $$ = chainon ($1, build_tree_list ($3, NULL_TREE));
907 | interface_type_list C_TK error
908 {yyerror ("Missing interface name"); RECOVER;}
914 /* Store the location of the `}' when doing xrefs */
916 DECL_END_SOURCE_LINE (GET_CPC ()) = $2.location;
919 | OCB_TK class_body_declarations CCB_TK
921 /* Store the location of the `}' when doing xrefs */
923 DECL_END_SOURCE_LINE (GET_CPC ()) = $3.location;
928 class_body_declarations:
929 class_body_declaration
930 | class_body_declarations class_body_declaration
933 class_body_declaration:
934 class_member_declaration
936 | constructor_declaration
937 | block /* Added, JDK1.1, instance initializer */
939 if (!IS_EMPTY_STMT ($1))
941 TREE_CHAIN ($1) = CPC_INSTANCE_INITIALIZER_STMT (ctxp);
942 SET_CPC_INSTANCE_INITIALIZER_STMT (ctxp, $1);
947 class_member_declaration:
950 | class_declaration /* Added, JDK1.1 inner classes */
951 { end_class_declaration (1); }
952 | interface_declaration /* Added, JDK1.1 inner interfaces */
953 { end_class_declaration (1); }
957 /* 19.8.2 Productions from 8.3: Field Declarations */
959 type variable_declarators SC_TK
960 { register_fields (0, $1, $2); }
961 | modifiers type variable_declarators SC_TK
964 ("Illegal modifier `%s' for field declaration",
965 $1, FIELD_MODIFIERS);
966 check_modifiers_consistency ($1);
967 register_fields ($1, $2, $3);
971 variable_declarators:
972 /* Should we use build_decl_list () instead ? FIXME */
973 variable_declarator /* Default rule */
974 | variable_declarators C_TK variable_declarator
975 { $$ = chainon ($1, $3); }
976 | variable_declarators C_TK error
977 {yyerror ("Missing term"); RECOVER;}
981 variable_declarator_id
982 { $$ = build_tree_list ($1, NULL_TREE); }
983 | variable_declarator_id ASSIGN_TK variable_initializer
985 if (java_error_count)
988 ($1, build_assignment ($2.token, $2.location, $1, $3));
990 | variable_declarator_id ASSIGN_TK error
992 yyerror ("Missing variable initializer");
993 $$ = build_tree_list ($1, NULL_TREE);
996 | variable_declarator_id ASSIGN_TK variable_initializer error
998 yyerror ("';' expected");
999 $$ = build_tree_list ($1, NULL_TREE);
1004 variable_declarator_id:
1006 | variable_declarator_id OSB_TK CSB_TK
1007 { $$ = build_unresolved_array_type ($1); }
1009 {yyerror ("Invalid declaration"); DRECOVER(vdi);}
1010 | variable_declarator_id OSB_TK error
1012 yyerror ("']' expected");
1015 | variable_declarator_id CSB_TK error
1016 {yyerror ("Unbalanced ']'"); DRECOVER(vdi);}
1019 variable_initializer:
1024 /* 19.8.3 Productions from 8.4: Method Declarations */
1028 current_function_decl = $1;
1029 if (current_function_decl
1030 && TREE_CODE (current_function_decl) == FUNCTION_DECL)
1031 source_start_java_method (current_function_decl);
1033 current_function_decl = NULL_TREE;
1036 { finish_method_declaration ($3); }
1037 | method_header error
1038 {YYNOT_TWICE yyerror ("'{' expected"); RECOVER;}
1042 type method_declarator throws
1043 { $$ = method_header (0, $1, $2, $3); }
1044 | VOID_TK method_declarator throws
1045 { $$ = method_header (0, void_type_node, $2, $3); }
1046 | modifiers type method_declarator throws
1047 { $$ = method_header ($1, $2, $3, $4); }
1048 | modifiers VOID_TK method_declarator throws
1049 { $$ = method_header ($1, void_type_node, $3, $4); }
1052 yyerror ("Invalid method declaration, method name required");
1055 | modifiers type error
1057 yyerror ("Identifier expected");
1062 yyerror ("Identifier expected");
1065 | modifiers VOID_TK error
1067 yyerror ("Identifier expected");
1072 yyerror ("Invalid method declaration, return type required");
1078 identifier OP_TK CP_TK
1080 ctxp->formal_parameter_number = 0;
1081 $$ = method_declarator ($1, NULL_TREE);
1083 | identifier OP_TK formal_parameter_list CP_TK
1084 { $$ = method_declarator ($1, $3); }
1085 | method_declarator OSB_TK CSB_TK
1087 SET_EXPR_LOCATION_FROM_TOKEN (wfl_operator, $2);
1089 build_unresolved_array_type (TREE_PURPOSE ($1));
1090 parse_warning_context
1092 "Discouraged form of returned type specification");
1094 | identifier OP_TK error
1095 {yyerror ("')' expected"); DRECOVER(method_declarator);}
1096 | method_declarator OSB_TK error
1097 {yyerror ("']' expected"); RECOVER;}
1100 formal_parameter_list:
1103 ctxp->formal_parameter_number = 1;
1105 | formal_parameter_list C_TK formal_parameter
1107 ctxp->formal_parameter_number += 1;
1108 $$ = chainon ($1, $3);
1110 | formal_parameter_list C_TK error
1111 { yyerror ("Missing formal parameter term"); RECOVER; }
1115 type variable_declarator_id
1117 $$ = build_tree_list ($2, $1);
1119 | final type variable_declarator_id /* Added, JDK1.1 final parms */
1121 $$ = build_tree_list ($3, $2);
1122 ARG_FINAL_P ($$) = 1;
1126 yyerror ("Missing identifier"); RECOVER;
1131 yyerror ("Missing identifier"); RECOVER;
1139 check_modifiers ("Illegal modifier `%s'. Only `final' was expected here",
1141 if ($1 != ACC_FINAL)
1142 MODIFIER_WFL (FINAL_TK) = build_wfl_node (NULL_TREE);
1148 | THROWS_TK class_type_list
1151 {yyerror ("Missing class type term"); RECOVER;}
1156 { $$ = build_tree_list ($1, $1); }
1157 | class_type_list C_TK class_type
1158 { $$ = tree_cons ($3, $3, $1); }
1159 | class_type_list C_TK error
1160 {yyerror ("Missing class type term"); RECOVER;}
1165 | SC_TK { $$ = NULL_TREE; }
1168 /* 19.8.4 Productions from 8.5: Static Initializers */
1172 TREE_CHAIN ($2) = CPC_STATIC_INITIALIZER_STMT (ctxp);
1173 SET_CPC_STATIC_INITIALIZER_STMT (ctxp, $2);
1174 current_static_block = NULL_TREE;
1178 static: /* Test lval.sub_token here */
1181 check_modifiers ("Illegal modifier `%s' for static initializer", $1, ACC_STATIC);
1182 /* Can't have a static initializer in an innerclass */
1183 if ($1 | ACC_STATIC &&
1184 GET_CPC_LIST () && !TOPLEVEL_CLASS_DECL_P (GET_CPC ()))
1186 (MODIFIER_WFL (STATIC_TK),
1187 "Can't define static initializer in class `%s'. Static initializer can only be defined in top-level classes",
1188 IDENTIFIER_POINTER (DECL_NAME (GET_CPC ())));
1189 SOURCE_FRONTEND_DEBUG (("Modifiers: %d", $1));
1193 /* 19.8.5 Productions from 8.6: Constructor Declarations */
1194 constructor_declaration:
1197 current_function_decl = $1;
1198 source_start_java_method (current_function_decl);
1201 { finish_method_declaration ($3); }
1205 constructor_declarator throws
1206 { $$ = method_header (0, NULL_TREE, $1, $2); }
1207 | modifiers constructor_declarator throws
1208 { $$ = method_header ($1, NULL_TREE, $2, $3); }
1211 constructor_declarator:
1212 simple_name OP_TK CP_TK
1214 ctxp->formal_parameter_number = 0;
1215 $$ = method_declarator ($1, NULL_TREE);
1217 | simple_name OP_TK formal_parameter_list CP_TK
1218 { $$ = method_declarator ($1, $3); }
1222 /* Unlike regular method, we always need a complete (empty)
1223 body so we can safely perform all the required code
1224 addition (super invocation and field initialization) */
1225 block_begin constructor_block_end
1227 BLOCK_EXPR_BODY ($2) = build_java_empty_stmt ();
1230 | block_begin explicit_constructor_invocation constructor_block_end
1232 | block_begin block_statements constructor_block_end
1234 | block_begin explicit_constructor_invocation block_statements constructor_block_end
1238 constructor_block_end:
1242 /* Error recovery for that rule moved down expression_statement: rule. */
1243 explicit_constructor_invocation:
1244 this_or_super OP_TK CP_TK SC_TK
1246 $$ = build_method_invocation ($1, NULL_TREE);
1247 $$ = build_debugable_stmt (EXPR_WFL_LINECOL ($1), $$);
1248 $$ = java_method_add_stmt (current_function_decl, $$);
1250 | this_or_super OP_TK argument_list CP_TK SC_TK
1252 $$ = build_method_invocation ($1, $3);
1253 $$ = build_debugable_stmt (EXPR_WFL_LINECOL ($1), $$);
1254 $$ = java_method_add_stmt (current_function_decl, $$);
1256 /* Added, JDK1.1 inner classes. Modified because the rule
1257 'primary' couldn't work. */
1258 | name DOT_TK SUPER_TK OP_TK argument_list CP_TK SC_TK
1259 {$$ = parse_jdk1_1_error ("explicit constructor invocation"); }
1260 | name DOT_TK SUPER_TK OP_TK CP_TK SC_TK
1261 {$$ = parse_jdk1_1_error ("explicit constructor invocation"); }
1264 this_or_super: /* Added, simplifies error diagnostics */
1267 tree wfl = build_wfl_node (this_identifier_node);
1268 SET_EXPR_LOCATION_FROM_TOKEN (wfl, $1);
1273 tree wfl = build_wfl_node (super_identifier_node);
1274 SET_EXPR_LOCATION_FROM_TOKEN (wfl, $1);
1279 /* 19.9 Productions from 9: Interfaces */
1280 /* 19.9.1 Productions from 9.1: Interfaces Declarations */
1281 interface_declaration:
1282 INTERFACE_TK identifier
1283 { create_interface (0, $2, NULL_TREE); }
1286 | modifiers INTERFACE_TK identifier
1287 { create_interface ($1, $3, NULL_TREE); }
1290 | INTERFACE_TK identifier extends_interfaces
1291 { create_interface (0, $2, $3); }
1294 | modifiers INTERFACE_TK identifier extends_interfaces
1295 { create_interface ($1, $3, $4); }
1298 | INTERFACE_TK identifier error
1299 { yyerror ("'{' expected"); RECOVER; }
1300 | modifiers INTERFACE_TK identifier error
1301 { yyerror ("'{' expected"); RECOVER; }
1305 EXTENDS_TK interface_type
1307 ctxp->interface_number = 1;
1308 $$ = build_tree_list ($2, NULL_TREE);
1310 | extends_interfaces C_TK interface_type
1312 ctxp->interface_number++;
1313 $$ = chainon ($1, build_tree_list ($3, NULL_TREE));
1316 {yyerror ("Invalid interface type"); RECOVER;}
1317 | extends_interfaces C_TK error
1318 {yyerror ("Missing term"); RECOVER;}
1324 | OCB_TK interface_member_declarations CCB_TK
1328 interface_member_declarations:
1329 interface_member_declaration
1330 | interface_member_declarations interface_member_declaration
1333 interface_member_declaration:
1334 constant_declaration
1335 | abstract_method_declaration
1336 | class_declaration /* Added, JDK1.1 inner classes */
1337 { end_class_declaration (1); }
1338 | interface_declaration /* Added, JDK1.1 inner interfaces */
1339 { end_class_declaration (1); }
1342 constant_declaration:
1346 abstract_method_declaration:
1349 check_abstract_method_header ($1);
1350 current_function_decl = NULL_TREE; /* FIXME ? */
1352 | method_header error
1353 {yyerror ("';' expected"); RECOVER;}
1356 /* 19.10 Productions from 10: Arrays */
1359 { $$ = build_new_array_init ($1.location, NULL_TREE); }
1360 | OCB_TK C_TK CCB_TK
1361 { $$ = build_new_array_init ($1.location, NULL_TREE); }
1362 | OCB_TK variable_initializers CCB_TK
1363 { $$ = build_new_array_init ($1.location, $2); }
1364 | OCB_TK variable_initializers C_TK CCB_TK
1365 { $$ = build_new_array_init ($1.location, $2); }
1368 variable_initializers:
1369 variable_initializer
1371 $$ = tree_cons (maybe_build_array_element_wfl ($1),
1374 | variable_initializers C_TK variable_initializer
1376 $$ = tree_cons (maybe_build_array_element_wfl ($3), $3, $1);
1378 | variable_initializers C_TK error
1379 {yyerror ("Missing term"); RECOVER;}
1382 /* 19.11 Production from 14: Blocks and Statements */
1384 block_begin block_end
1386 | block_begin block_statements block_end
1398 maybe_absorb_scoping_blocks ();
1399 /* Store the location of the `}' when doing xrefs */
1400 if (current_function_decl && flag_emit_xref)
1401 DECL_END_SOURCE_LINE (current_function_decl) = $1.location;
1403 if (!BLOCK_SUBBLOCKS ($$))
1404 BLOCK_SUBBLOCKS ($$) = build_java_empty_stmt ();
1410 | block_statements block_statement
1414 local_variable_declaration_statement
1416 { java_method_add_stmt (current_function_decl, $1); }
1417 | class_declaration /* Added, JDK1.1 local classes */
1419 LOCAL_CLASS_P (TREE_TYPE (GET_CPC ())) = 1;
1420 end_class_declaration (1);
1424 local_variable_declaration_statement:
1425 local_variable_declaration SC_TK /* Can't catch missing ';' here */
1428 local_variable_declaration:
1429 type variable_declarators
1430 { declare_local_variables (0, $1, $2); }
1431 | final type variable_declarators /* Added, JDK1.1 final locals */
1432 { declare_local_variables ($1, $2, $3); }
1436 statement_without_trailing_substatement
1439 | if_then_else_statement
1442 { $$ = exit_block (); }
1446 statement_without_trailing_substatement
1447 | labeled_statement_nsi
1448 | if_then_else_statement_nsi
1449 | while_statement_nsi
1451 { $$ = exit_block (); }
1454 statement_without_trailing_substatement:
1457 | expression_statement
1461 | continue_statement
1463 | synchronized_statement
1472 if (flag_extraneous_semicolon
1473 && ! current_static_block
1474 && (! current_function_decl ||
1475 /* Verify we're not in a inner class declaration */
1476 (GET_CPC () != TYPE_NAME
1477 (DECL_CONTEXT (current_function_decl)))))
1480 #ifdef USE_MAPPED_LOCATION
1481 SET_EXPR_LOCATION (wfl_operator, input_location);
1483 EXPR_WFL_SET_LINECOL (wfl_operator, input_line, -1);
1485 parse_warning_context (wfl_operator, "An empty declaration is a deprecated feature that should not be used");
1487 $$ = build_java_empty_stmt ();
1492 identifier REL_CL_TK
1494 $$ = build_labeled_block (EXPR_WFL_LINECOL ($1),
1495 EXPR_WFL_NODE ($1));
1497 push_labeled_block ($$);
1498 PUSH_LABELED_BLOCK ($$);
1503 label_decl statement
1504 { $$ = finish_labeled_statement ($1, $2); }
1506 {yyerror ("':' expected"); RECOVER;}
1509 labeled_statement_nsi:
1510 label_decl statement_nsi
1511 { $$ = finish_labeled_statement ($1, $2); }
1514 /* We concentrate here a bunch of error handling rules that we couldn't write
1515 earlier, because expression_statement catches a missing ';'. */
1516 expression_statement:
1517 statement_expression SC_TK
1519 /* We have a statement. Generate a WFL around it so
1521 #ifdef USE_MAPPED_LOCATION
1522 $$ = expr_add_location ($1, input_location, 1);
1524 $$ = build_expr_wfl ($1, input_filename, input_line, 0);
1525 JAVA_MAYBE_GENERATE_DEBUG_INFO ($$);
1527 /* We know we have a statement, so set the debug
1528 info to be eventually generate here. */
1532 YYNOT_TWICE yyerror ("Invalid expression statement");
1533 DRECOVER (expr_stmt);
1537 YYNOT_TWICE yyerror ("Invalid expression statement");
1538 DRECOVER (expr_stmt);
1542 YYNOT_TWICE yyerror ("Invalid expression statement");
1543 DRECOVER (expr_stmt);
1545 | this_or_super OP_TK error
1546 {yyerror ("')' expected"); RECOVER;}
1547 | this_or_super OP_TK CP_TK error
1549 parse_ctor_invocation_error ();
1552 | this_or_super OP_TK argument_list error
1553 {yyerror ("')' expected"); RECOVER;}
1554 | this_or_super OP_TK argument_list CP_TK error
1556 parse_ctor_invocation_error ();
1559 | name DOT_TK SUPER_TK error
1560 {yyerror ("'(' expected"); RECOVER;}
1561 | name DOT_TK SUPER_TK OP_TK error
1562 {yyerror ("')' expected"); RECOVER;}
1563 | name DOT_TK SUPER_TK OP_TK argument_list error
1564 {yyerror ("')' expected"); RECOVER;}
1565 | name DOT_TK SUPER_TK OP_TK argument_list CP_TK error
1566 {yyerror ("';' expected"); RECOVER;}
1567 | name DOT_TK SUPER_TK OP_TK CP_TK error
1568 {yyerror ("';' expected"); RECOVER;}
1571 statement_expression:
1573 | pre_increment_expression
1574 | pre_decrement_expression
1575 | post_increment_expression
1576 | post_decrement_expression
1578 | class_instance_creation_expression
1582 IF_TK OP_TK expression CP_TK statement
1584 $$ = build_if_else_statement ($2.location, $3,
1588 {yyerror ("'(' expected"); RECOVER;}
1590 {yyerror ("Missing term"); RECOVER;}
1591 | IF_TK OP_TK expression error
1592 {yyerror ("')' expected"); RECOVER;}
1595 if_then_else_statement:
1596 IF_TK OP_TK expression CP_TK statement_nsi ELSE_TK statement
1597 { $$ = build_if_else_statement ($2.location, $3, $5, $7); }
1600 if_then_else_statement_nsi:
1601 IF_TK OP_TK expression CP_TK statement_nsi ELSE_TK statement_nsi
1602 { $$ = build_if_else_statement ($2.location, $3, $5, $7); }
1612 /* Make into "proper list" of COMPOUND_EXPRs.
1613 I.e. make the last statement also have its own
1615 maybe_absorb_scoping_blocks ();
1616 TREE_OPERAND ($1, 1) = exit_block ();
1617 $$ = build_debugable_stmt (EXPR_WFL_LINECOL ($1), $1);
1622 SWITCH_TK OP_TK expression CP_TK
1624 $$ = build3 (SWITCH_EXPR, NULL_TREE, $3,
1625 NULL_TREE, NULL_TREE);
1626 SET_EXPR_LOCATION_FROM_TOKEN ($$, $2);
1629 {yyerror ("'(' expected"); RECOVER;}
1630 | SWITCH_TK OP_TK error
1631 {yyerror ("Missing term or ')'"); DRECOVER(switch_statement);}
1632 | SWITCH_TK OP_TK expression CP_TK error
1633 {yyerror ("'{' expected"); RECOVER;}
1636 /* Default assignment is there to avoid type node on switch_block
1642 | OCB_TK switch_labels CCB_TK
1644 | OCB_TK switch_block_statement_groups CCB_TK
1646 | OCB_TK switch_block_statement_groups switch_labels CCB_TK
1650 switch_block_statement_groups:
1651 switch_block_statement_group
1652 | switch_block_statement_groups switch_block_statement_group
1655 switch_block_statement_group:
1656 switch_labels block_statements
1661 | switch_labels switch_label
1665 CASE_TK constant_expression REL_CL_TK
1667 tree lab = build1 (CASE_EXPR, NULL_TREE, $2);
1668 SET_EXPR_LOCATION_FROM_TOKEN (lab, $1);
1669 java_method_add_stmt (current_function_decl, lab);
1671 | DEFAULT_TK REL_CL_TK
1673 tree lab = make_node (DEFAULT_EXPR);
1674 SET_EXPR_LOCATION_FROM_TOKEN (lab, $1);
1675 java_method_add_stmt (current_function_decl, lab);
1678 {yyerror ("Missing or invalid constant expression"); RECOVER;}
1679 | CASE_TK constant_expression error
1680 {yyerror ("':' expected"); RECOVER;}
1682 {yyerror ("':' expected"); RECOVER;}
1686 WHILE_TK OP_TK expression CP_TK
1688 tree body = build_loop_body ($2.location, $3, 0);
1689 $$ = build_new_loop (body);
1694 while_expression statement
1695 { $$ = finish_loop_body (0, NULL_TREE, $2, 0); }
1697 {YYERROR_NOW; yyerror ("'(' expected"); RECOVER;}
1698 | WHILE_TK OP_TK error
1699 {yyerror ("Missing term and ')' expected"); RECOVER;}
1700 | WHILE_TK OP_TK expression error
1701 {yyerror ("')' expected"); RECOVER;}
1704 while_statement_nsi:
1705 while_expression statement_nsi
1706 { $$ = finish_loop_body (0, NULL_TREE, $2, 0); }
1712 tree body = build_loop_body (0, NULL_TREE, 1);
1713 $$ = build_new_loop (body);
1715 /* Need error handing here. FIXME */
1719 do_statement_begin statement WHILE_TK OP_TK expression CP_TK SC_TK
1720 { $$ = finish_loop_body ($4.location, $5, $2, 1); }
1724 for_begin SC_TK expression SC_TK for_update CP_TK statement
1726 if (CONSTANT_CLASS_P ($3))
1727 $3 = build_wfl_node ($3);
1728 $$ = finish_for_loop (EXPR_WFL_LINECOL ($3), $3, $5, $7);
1730 | for_begin SC_TK SC_TK for_update CP_TK statement
1732 $$ = finish_for_loop (0, NULL_TREE, $4, $6);
1733 /* We have not condition, so we get rid of the EXIT_EXPR */
1734 LOOP_EXPR_BODY_CONDITION_EXPR (LOOP_EXPR_BODY ($$), 0) =
1735 build_java_empty_stmt ();
1737 | for_begin SC_TK error
1738 {yyerror ("Invalid control expression"); RECOVER;}
1739 | for_begin SC_TK expression SC_TK error
1740 {yyerror ("Invalid update expression"); RECOVER;}
1741 | for_begin SC_TK SC_TK error
1742 {yyerror ("Invalid update expression"); RECOVER;}
1746 for_begin SC_TK expression SC_TK for_update CP_TK statement_nsi
1747 { $$ = finish_for_loop (EXPR_WFL_LINECOL ($3), $3, $5, $7);}
1748 | for_begin SC_TK SC_TK for_update CP_TK statement_nsi
1750 $$ = finish_for_loop (0, NULL_TREE, $4, $6);
1751 /* We have not condition, so we get rid of the EXIT_EXPR */
1752 LOOP_EXPR_BODY_CONDITION_EXPR (LOOP_EXPR_BODY ($$), 0) =
1753 build_java_empty_stmt ();
1760 /* This scope defined for local variable that may be
1761 defined within the scope of the for loop */
1765 {yyerror ("'(' expected"); DRECOVER(for_1);}
1766 | FOR_TK OP_TK error
1767 {yyerror ("Invalid init statement"); RECOVER;}
1773 /* We now declare the loop body. The loop is
1774 declared as a for loop. */
1775 tree body = build_loop_body (0, NULL_TREE, 0);
1776 $$ = build_new_loop (body);
1777 FOR_LOOP_P ($$) = 1;
1778 /* The loop is added to the current block the for
1779 statement is defined within */
1780 java_method_add_stmt (current_function_decl, $$);
1783 for_init: /* Can be empty */
1784 { $$ = build_java_empty_stmt (); }
1785 | statement_expression_list
1787 /* Init statement recorded within the previously
1788 defined block scope */
1789 $$ = java_method_add_stmt (current_function_decl, $1);
1791 | local_variable_declaration
1793 /* Local variable are recorded within the previously
1794 defined block scope */
1797 | statement_expression_list error
1798 {yyerror ("';' expected"); DRECOVER(for_init_1);}
1801 for_update: /* Can be empty */
1802 {$$ = build_java_empty_stmt ();}
1803 | statement_expression_list
1804 { $$ = build_debugable_stmt (BUILD_LOCATION (), $1); }
1807 statement_expression_list:
1808 statement_expression
1809 { $$ = add_stmt_to_compound (NULL_TREE, NULL_TREE, $1); }
1810 | statement_expression_list C_TK statement_expression
1811 { $$ = add_stmt_to_compound ($1, NULL_TREE, $3); }
1812 | statement_expression_list C_TK error
1813 {yyerror ("Missing term"); RECOVER;}
1818 { $$ = build_bc_statement ($1.location, 1, NULL_TREE); }
1819 | BREAK_TK identifier SC_TK
1820 { $$ = build_bc_statement ($1.location, 1, $2); }
1822 {yyerror ("Missing term"); RECOVER;}
1823 | BREAK_TK identifier error
1824 {yyerror ("';' expected"); RECOVER;}
1829 { $$ = build_bc_statement ($1.location, 0, NULL_TREE); }
1830 | CONTINUE_TK identifier SC_TK
1831 { $$ = build_bc_statement ($1.location, 0, $2); }
1833 {yyerror ("Missing term"); RECOVER;}
1834 | CONTINUE_TK identifier error
1835 {yyerror ("';' expected"); RECOVER;}
1840 { $$ = build_return ($1.location, NULL_TREE); }
1841 | RETURN_TK expression SC_TK
1842 { $$ = build_return ($1.location, $2); }
1844 {yyerror ("Missing term"); RECOVER;}
1845 | RETURN_TK expression error
1846 {yyerror ("';' expected"); RECOVER;}
1850 THROW_TK expression SC_TK
1852 $$ = build1 (THROW_EXPR, NULL_TREE, $2);
1853 SET_EXPR_LOCATION_FROM_TOKEN ($$, $1);
1856 {yyerror ("Missing term"); RECOVER;}
1857 | THROW_TK expression error
1858 {yyerror ("';' expected"); RECOVER;}
1862 ASSERT_TK expression REL_CL_TK expression SC_TK
1864 $$ = build_assertion ($1.location, $2, $4);
1866 | ASSERT_TK expression SC_TK
1868 $$ = build_assertion ($1.location, $2, NULL_TREE);
1871 {yyerror ("Missing term"); RECOVER;}
1872 | ASSERT_TK expression error
1873 {yyerror ("';' expected"); RECOVER;}
1876 synchronized_statement:
1877 synchronized OP_TK expression CP_TK block
1879 $$ = build2 (SYNCHRONIZED_EXPR, NULL_TREE, $3, $5);
1880 EXPR_WFL_LINECOL ($$) =
1881 EXPR_WFL_LINECOL (MODIFIER_WFL (SYNCHRONIZED_TK));
1883 | synchronized OP_TK expression CP_TK error
1884 {yyerror ("'{' expected"); RECOVER;}
1885 | synchronized error
1886 {yyerror ("'(' expected"); RECOVER;}
1887 | synchronized OP_TK error CP_TK
1888 {yyerror ("Missing term"); RECOVER;}
1889 | synchronized OP_TK error
1890 {yyerror ("Missing term"); RECOVER;}
1897 "Illegal modifier `%s'. Only `synchronized' was expected here",
1898 $1, ACC_SYNCHRONIZED);
1899 if ($1 != ACC_SYNCHRONIZED)
1900 MODIFIER_WFL (SYNCHRONIZED_TK) =
1901 build_wfl_node (NULL_TREE);
1906 TRY_TK block catches
1907 { $$ = build_try_statement ($1.location, $2, $3); }
1908 | TRY_TK block finally
1909 { $$ = build_try_finally_statement ($1.location, $2, $3); }
1910 | TRY_TK block catches finally
1911 { $$ = build_try_finally_statement
1912 ($1.location, build_try_statement ($1.location,
1916 {yyerror ("'{' expected"); DRECOVER (try_statement);}
1921 | catches catch_clause
1923 TREE_CHAIN ($2) = $1;
1929 catch_clause_parameter block
1931 java_method_add_stmt (current_function_decl, $2);
1937 catch_clause_parameter:
1938 CATCH_TK OP_TK formal_parameter CP_TK
1940 /* We add a block to define a scope for
1941 formal_parameter (CCBP). The formal parameter is
1942 declared initialized by the appropriate function
1948 ccpb = enter_block ();
1949 init = build_assignment
1950 (ASSIGN_TK, $2.location, TREE_PURPOSE ($3),
1951 build0 (JAVA_EXC_OBJ_EXPR, ptr_type_node));
1952 declare_local_variables (0, TREE_VALUE ($3),
1954 (TREE_PURPOSE ($3), init));
1955 $$ = build1 (JAVA_CATCH_EXPR, NULL_TREE, ccpb);
1956 SET_EXPR_LOCATION_FROM_TOKEN ($$, $1);
1960 $$ = error_mark_node;
1964 {yyerror ("'(' expected"); RECOVER; $$ = NULL_TREE;}
1965 | CATCH_TK OP_TK error
1967 yyerror ("Missing term or ')' expected");
1968 RECOVER; $$ = NULL_TREE;
1970 | CATCH_TK OP_TK error CP_TK /* That's for () */
1971 {yyerror ("Missing term"); RECOVER; $$ = NULL_TREE;}
1978 {yyerror ("'{' expected"); RECOVER; }
1981 /* 19.12 Production from 15: Expressions */
1983 primary_no_new_array
1984 | array_creation_uninitialized
1985 | array_creation_initialized
1988 primary_no_new_array:
1991 { $$ = build_this ($1.location); }
1992 | OP_TK expression CP_TK
1994 | class_instance_creation_expression
1999 /* Added, JDK1.1 inner classes. Documentation is wrong
2000 referring to a 'ClassName' (class_name) rule that doesn't
2001 exist. Used name: instead. */
2002 | name DOT_TK THIS_TK
2004 tree wfl = build_wfl_node (this_identifier_node);
2005 $$ = make_qualified_primary ($1, wfl, EXPR_WFL_LINECOL ($1));
2007 | OP_TK expression error
2008 {yyerror ("')' expected"); RECOVER;}
2010 {yyerror ("'class' or 'this' expected" ); RECOVER;}
2011 | primitive_type DOT_TK error
2012 {yyerror ("'class' expected" ); RECOVER;}
2013 | VOID_TK DOT_TK error
2014 {yyerror ("'class' expected" ); RECOVER;}
2018 name DOT_TK CLASS_TK
2019 { $$ = build_incomplete_class_ref ($2.location, $1); }
2020 | array_type DOT_TK CLASS_TK
2021 { $$ = build_incomplete_class_ref ($2.location, $1); }
2022 | primitive_type DOT_TK CLASS_TK
2023 { $$ = build_incomplete_class_ref ($2.location, $1); }
2024 | VOID_TK DOT_TK CLASS_TK
2026 $$ = build_incomplete_class_ref ($2.location,
2031 class_instance_creation_expression:
2032 NEW_TK class_type OP_TK argument_list CP_TK
2033 { $$ = build_new_invocation ($2, $4); }
2034 | NEW_TK class_type OP_TK CP_TK
2035 { $$ = build_new_invocation ($2, NULL_TREE); }
2036 | anonymous_class_creation
2037 /* Added, JDK1.1 inner classes, modified to use name or
2038 primary instead of primary solely which couldn't work in
2040 | something_dot_new identifier OP_TK CP_TK
2042 tree ctor = build_new_invocation ($2, NULL_TREE);
2043 $$ = make_qualified_primary ($1, ctor,
2044 EXPR_WFL_LINECOL ($1));
2046 | something_dot_new identifier OP_TK CP_TK class_body
2047 | something_dot_new identifier OP_TK argument_list CP_TK
2049 tree ctor = build_new_invocation ($2, $4);
2050 $$ = make_qualified_primary ($1, ctor,
2051 EXPR_WFL_LINECOL ($1));
2053 | something_dot_new identifier OP_TK argument_list CP_TK class_body
2054 | NEW_TK error SC_TK
2055 {$$ = NULL_TREE; yyerror ("'(' expected"); DRECOVER(new_1);}
2056 | NEW_TK class_type error
2057 {$$ = NULL_TREE; yyerror ("'(' expected"); RECOVER;}
2058 | NEW_TK class_type OP_TK error
2059 {$$ = NULL_TREE; yyerror ("')' or term expected"); RECOVER;}
2060 | NEW_TK class_type OP_TK argument_list error
2061 {$$ = NULL_TREE; yyerror ("')' expected"); RECOVER;}
2062 | something_dot_new error
2066 yyerror ("Identifier expected");
2069 | something_dot_new identifier error
2070 {$$ = NULL_TREE; yyerror ("'(' expected"); RECOVER;}
2073 /* Created after JDK1.1 rules originally added to
2074 class_instance_creation_expression, but modified to use
2075 'class_type' instead of 'TypeName' (type_name) which is mentioned
2076 in the documentation but doesn't exist. */
2078 anonymous_class_creation:
2079 NEW_TK class_type OP_TK argument_list CP_TK
2080 { create_anonymous_class ($2); }
2083 tree id = build_wfl_node (DECL_NAME (GET_CPC ()));
2084 EXPR_WFL_LINECOL (id) = EXPR_WFL_LINECOL ($2);
2086 end_class_declaration (1);
2088 /* Now we can craft the new expression */
2089 $$ = build_new_invocation (id, $4);
2091 /* Note that we can't possibly be here if
2092 `class_type' is an interface (in which case the
2093 anonymous class extends Object and implements
2094 `class_type', hence its constructor can't have
2097 /* Otherwise, the innerclass must feature a
2098 constructor matching `argument_list'. Anonymous
2099 classes are a bit special: it's impossible to
2100 define constructor for them, hence constructors
2101 must be generated following the hints provided by
2102 the `new' expression. Whether a super constructor
2103 of that nature exists or not is to be verified
2104 later on in verify_constructor_super.
2106 It's during the expansion of a `new' statement
2107 referring to an anonymous class that a ctor will
2108 be generated for the anonymous class, with the
2112 | NEW_TK class_type OP_TK CP_TK
2113 { create_anonymous_class ($2); }
2116 tree id = build_wfl_node (DECL_NAME (GET_CPC ()));
2117 EXPR_WFL_LINECOL (id) = EXPR_WFL_LINECOL ($2);
2119 end_class_declaration (1);
2121 /* Now we can craft the new expression. The
2122 statement doesn't need to be remember so that a
2123 constructor can be generated, since its signature
2124 is already known. */
2125 $$ = build_new_invocation (id, NULL_TREE);
2129 something_dot_new: /* Added, not part of the specs. */
2132 | primary DOT_TK NEW_TK
2139 $$ = tree_cons (NULL_TREE, $1, NULL_TREE);
2140 ctxp->formal_parameter_number = 1;
2142 | argument_list C_TK expression
2144 ctxp->formal_parameter_number += 1;
2145 $$ = tree_cons (NULL_TREE, $3, $1);
2147 | argument_list C_TK error
2148 {yyerror ("Missing term"); RECOVER;}
2151 array_creation_uninitialized:
2152 NEW_TK primitive_type dim_exprs
2153 { $$ = build_newarray_node ($2, $3, 0); }
2154 | NEW_TK class_or_interface_type dim_exprs
2155 { $$ = build_newarray_node ($2, $3, 0); }
2156 | NEW_TK primitive_type dim_exprs dims
2157 { $$ = build_newarray_node ($2, $3, pop_current_osb (ctxp));}
2158 | NEW_TK class_or_interface_type dim_exprs dims
2159 { $$ = build_newarray_node ($2, $3, pop_current_osb (ctxp));}
2160 | NEW_TK error CSB_TK
2161 {yyerror ("'[' expected"); DRECOVER ("]");}
2162 | NEW_TK error OSB_TK
2163 {yyerror ("']' expected"); RECOVER;}
2166 array_creation_initialized:
2167 /* Added, JDK1.1 anonymous array. Initial documentation rule
2169 NEW_TK class_or_interface_type dims array_initializer
2172 int osb = pop_current_osb (ctxp);
2174 obstack_grow (&temporary_obstack, "[]", 2);
2175 obstack_1grow (&temporary_obstack, '\0');
2176 sig = obstack_finish (&temporary_obstack);
2177 $$ = build3 (NEW_ANONYMOUS_ARRAY_EXPR, NULL_TREE,
2178 $2, get_identifier (sig), $4);
2180 | NEW_TK primitive_type dims array_initializer
2182 int osb = pop_current_osb (ctxp);
2185 type = build_java_array_type (type, -1);
2186 $$ = build3 (NEW_ANONYMOUS_ARRAY_EXPR, NULL_TREE,
2187 build_pointer_type (type), NULL_TREE, $4);
2189 | NEW_TK error CSB_TK
2190 {yyerror ("'[' expected"); DRECOVER ("]");}
2191 | NEW_TK error OSB_TK
2192 {yyerror ("']' expected"); RECOVER;}
2197 { $$ = build_tree_list (NULL_TREE, $1); }
2198 | dim_exprs dim_expr
2199 { $$ = tree_cons (NULL_TREE, $2, $$); }
2203 OSB_TK expression CSB_TK
2205 if (JNUMERIC_TYPE_P (TREE_TYPE ($2)))
2207 $2 = build_wfl_node ($2);
2208 TREE_TYPE ($2) = NULL_TREE;
2210 EXPR_WFL_LINECOL ($2) = $1.location;
2213 | OSB_TK expression error
2214 {yyerror ("']' expected"); RECOVER;}
2217 yyerror ("Missing term");
2218 yyerror ("']' expected");
2227 /* If not initialized, allocate memory for the osb
2229 if (!ctxp->osb_limit)
2231 allocate = ctxp->osb_limit = 32;
2232 ctxp->osb_depth = -1;
2234 /* If capacity overflown, reallocate a bigger chunk */
2235 else if (ctxp->osb_depth+1 == ctxp->osb_limit)
2236 allocate = ctxp->osb_limit << 1;
2240 allocate *= sizeof (int);
2241 if (ctxp->osb_number)
2242 ctxp->osb_number = xrealloc (ctxp->osb_number,
2245 ctxp->osb_number = xmalloc (allocate);
2248 CURRENT_OSB (ctxp) = 1;
2250 | dims OSB_TK CSB_TK
2251 { CURRENT_OSB (ctxp)++; }
2253 { yyerror ("']' expected"); RECOVER;}
2257 primary DOT_TK identifier
2258 { $$ = make_qualified_primary ($1, $3, $2.location); }
2259 /* FIXME - REWRITE TO:
2260 { $$ = build_binop (COMPONENT_REF, $2.location, $1, $3); } */
2261 | SUPER_TK DOT_TK identifier
2263 tree super_wfl = build_wfl_node (super_identifier_node);
2264 SET_EXPR_LOCATION_FROM_TOKEN (super_wfl, $1);
2265 $$ = make_qualified_name (super_wfl, $3, $2.location);
2268 {yyerror ("Field expected"); DRECOVER (super_field_acces);}
2273 { $$ = build_method_invocation ($1, NULL_TREE); }
2274 | name OP_TK argument_list CP_TK
2275 { $$ = build_method_invocation ($1, $3); }
2276 | primary DOT_TK identifier OP_TK CP_TK
2278 if (TREE_CODE ($1) == THIS_EXPR)
2279 $$ = build_this_super_qualified_invocation
2280 (1, $3, NULL_TREE, 0, $2.location);
2283 tree invok = build_method_invocation ($3, NULL_TREE);
2284 $$ = make_qualified_primary ($1, invok, $2.location);
2287 | primary DOT_TK identifier OP_TK argument_list CP_TK
2289 if (TREE_CODE ($1) == THIS_EXPR)
2290 $$ = build_this_super_qualified_invocation
2291 (1, $3, $5, 0, $2.location);
2294 tree invok = build_method_invocation ($3, $5);
2295 $$ = make_qualified_primary ($1, invok, $2.location);
2298 | SUPER_TK DOT_TK identifier OP_TK CP_TK
2300 $$ = build_this_super_qualified_invocation
2301 (0, $3, NULL_TREE, $1.location, $2.location);
2303 | SUPER_TK DOT_TK identifier OP_TK argument_list CP_TK
2305 $$ = build_this_super_qualified_invocation
2306 (0, $3, $5, $1.location, $2.location);
2308 /* Screws up thing. I let it here until I'm convinced it can
2310 | primary DOT_TK error
2311 {yyerror ("'(' expected"); DRECOVER(bad);} */
2312 | SUPER_TK DOT_TK error CP_TK
2313 { yyerror ("'(' expected"); DRECOVER (method_invocation); }
2314 | SUPER_TK DOT_TK error DOT_TK
2315 { yyerror ("'(' expected"); DRECOVER (method_invocation); }
2319 name OSB_TK expression CSB_TK
2320 { $$ = build_array_ref ($2.location, $1, $3); }
2321 | primary_no_new_array OSB_TK expression CSB_TK
2322 { $$ = build_array_ref ($2.location, $1, $3); }
2323 | array_creation_initialized OSB_TK expression CSB_TK
2324 { $$ = build_array_ref ($2.location, $1, $3); }
2327 yyerror ("Missing term and ']' expected");
2328 DRECOVER(array_access);
2330 | name OSB_TK expression error
2332 yyerror ("']' expected");
2333 DRECOVER(array_access);
2335 | primary_no_new_array OSB_TK error
2337 yyerror ("Missing term and ']' expected");
2338 DRECOVER(array_access);
2340 | primary_no_new_array OSB_TK expression error
2342 yyerror ("']' expected");
2343 DRECOVER(array_access);
2345 | array_creation_initialized OSB_TK error
2347 yyerror ("Missing term and ']' expected");
2348 DRECOVER(array_access);
2350 | array_creation_initialized OSB_TK expression error
2352 yyerror ("']' expected");
2353 DRECOVER(array_access);
2360 | post_increment_expression
2361 | post_decrement_expression
2364 post_increment_expression:
2365 postfix_expression INCR_TK
2366 { $$ = build_incdec ($2.token, $2.location, $1, 1); }
2369 post_decrement_expression:
2370 postfix_expression DECR_TK
2371 { $$ = build_incdec ($2.token, $2.location, $1, 1); }
2374 trap_overflow_corner_case:
2375 pre_increment_expression
2376 | pre_decrement_expression
2377 | PLUS_TK unary_expression
2378 {$$ = build_unaryop ($1.token, $1.location, $2); }
2379 | unary_expression_not_plus_minus
2381 {yyerror ("Missing term"); RECOVER}
2385 trap_overflow_corner_case
2388 error_if_numeric_overflow ($1);
2391 | MINUS_TK trap_overflow_corner_case
2392 {$$ = build_unaryop ($1.token, $1.location, $2); }
2394 {yyerror ("Missing term"); RECOVER}
2397 pre_increment_expression:
2398 INCR_TK unary_expression
2399 {$$ = build_incdec ($1.token, $1.location, $2, 0); }
2401 {yyerror ("Missing term"); RECOVER}
2404 pre_decrement_expression:
2405 DECR_TK unary_expression
2406 {$$ = build_incdec ($1.token, $1.location, $2, 0); }
2408 {yyerror ("Missing term"); RECOVER}
2411 unary_expression_not_plus_minus:
2413 | NOT_TK unary_expression
2414 {$$ = build_unaryop ($1.token, $1.location, $2); }
2415 | NEG_TK unary_expression
2416 {$$ = build_unaryop ($1.token, $1.location, $2); }
2419 {yyerror ("Missing term"); RECOVER}
2421 {yyerror ("Missing term"); RECOVER}
2424 cast_expression: /* Error handling here is potentially weak */
2425 OP_TK primitive_type dims CP_TK unary_expression
2428 int osb = pop_current_osb (ctxp);
2430 type = build_java_array_type (type, -1);
2431 $$ = build_cast ($1.location, type, $5);
2433 | OP_TK primitive_type CP_TK unary_expression
2434 { $$ = build_cast ($1.location, $2, $4); }
2435 | OP_TK expression CP_TK unary_expression_not_plus_minus
2436 { $$ = build_cast ($1.location, $2, $4); }
2437 | OP_TK name dims CP_TK unary_expression_not_plus_minus
2440 int osb = pop_current_osb (ctxp);
2441 obstack_grow (&temporary_obstack,
2442 IDENTIFIER_POINTER (EXPR_WFL_NODE ($2)),
2443 IDENTIFIER_LENGTH (EXPR_WFL_NODE ($2)));
2445 obstack_grow (&temporary_obstack, "[]", 2);
2446 obstack_1grow (&temporary_obstack, '\0');
2447 ptr = obstack_finish (&temporary_obstack);
2448 EXPR_WFL_NODE ($2) = get_identifier (ptr);
2449 $$ = build_cast ($1.location, $2, $5);
2451 | OP_TK primitive_type OSB_TK error
2452 {yyerror ("']' expected, invalid type expression");}
2455 YYNOT_TWICE yyerror ("Invalid type expression"); RECOVER;
2458 | OP_TK primitive_type dims CP_TK error
2459 {yyerror ("Missing term"); RECOVER;}
2460 | OP_TK primitive_type CP_TK error
2461 {yyerror ("Missing term"); RECOVER;}
2462 | OP_TK name dims CP_TK error
2463 {yyerror ("Missing term"); RECOVER;}
2466 multiplicative_expression:
2468 | multiplicative_expression MULT_TK unary_expression
2470 $$ = build_binop (BINOP_LOOKUP ($2.token),
2471 $2.location, $1, $3);
2473 | multiplicative_expression DIV_TK unary_expression
2475 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2478 | multiplicative_expression REM_TK unary_expression
2480 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2483 | multiplicative_expression MULT_TK error
2484 {yyerror ("Missing term"); RECOVER;}
2485 | multiplicative_expression DIV_TK error
2486 {yyerror ("Missing term"); RECOVER;}
2487 | multiplicative_expression REM_TK error
2488 {yyerror ("Missing term"); RECOVER;}
2491 additive_expression:
2492 multiplicative_expression
2493 | additive_expression PLUS_TK multiplicative_expression
2495 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2498 | additive_expression MINUS_TK multiplicative_expression
2500 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2503 | additive_expression PLUS_TK error
2504 {yyerror ("Missing term"); RECOVER;}
2505 | additive_expression MINUS_TK error
2506 {yyerror ("Missing term"); RECOVER;}
2511 | shift_expression LS_TK additive_expression
2513 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2516 | shift_expression SRS_TK additive_expression
2518 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2521 | shift_expression ZRS_TK additive_expression
2523 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2526 | shift_expression LS_TK error
2527 {yyerror ("Missing term"); RECOVER;}
2528 | shift_expression SRS_TK error
2529 {yyerror ("Missing term"); RECOVER;}
2530 | shift_expression ZRS_TK error
2531 {yyerror ("Missing term"); RECOVER;}
2534 relational_expression:
2536 | relational_expression LT_TK shift_expression
2538 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2541 | relational_expression GT_TK shift_expression
2543 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2546 | relational_expression LTE_TK shift_expression
2548 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2551 | relational_expression GTE_TK shift_expression
2553 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2556 | relational_expression INSTANCEOF_TK reference_type
2557 { $$ = build_binop (INSTANCEOF_EXPR, $2.location, $1, $3); }
2558 | relational_expression LT_TK error
2559 {yyerror ("Missing term"); RECOVER;}
2560 | relational_expression GT_TK error
2561 {yyerror ("Missing term"); RECOVER;}
2562 | relational_expression LTE_TK error
2563 {yyerror ("Missing term"); RECOVER;}
2564 | relational_expression GTE_TK error
2565 {yyerror ("Missing term"); RECOVER;}
2566 | relational_expression INSTANCEOF_TK error
2567 {yyerror ("Invalid reference type"); RECOVER;}
2570 equality_expression:
2571 relational_expression
2572 | equality_expression EQ_TK relational_expression
2574 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2577 | equality_expression NEQ_TK relational_expression
2579 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2582 | equality_expression EQ_TK error
2583 {yyerror ("Missing term"); RECOVER;}
2584 | equality_expression NEQ_TK error
2585 {yyerror ("Missing term"); RECOVER;}
2590 | and_expression AND_TK equality_expression
2592 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2595 | and_expression AND_TK error
2596 {yyerror ("Missing term"); RECOVER;}
2599 exclusive_or_expression:
2601 | exclusive_or_expression XOR_TK and_expression
2603 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2606 | exclusive_or_expression XOR_TK error
2607 {yyerror ("Missing term"); RECOVER;}
2610 inclusive_or_expression:
2611 exclusive_or_expression
2612 | inclusive_or_expression OR_TK exclusive_or_expression
2614 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2617 | inclusive_or_expression OR_TK error
2618 {yyerror ("Missing term"); RECOVER;}
2621 conditional_and_expression:
2622 inclusive_or_expression
2623 | conditional_and_expression BOOL_AND_TK inclusive_or_expression
2625 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2628 | conditional_and_expression BOOL_AND_TK error
2629 {yyerror ("Missing term"); RECOVER;}
2632 conditional_or_expression:
2633 conditional_and_expression
2634 | conditional_or_expression BOOL_OR_TK conditional_and_expression
2636 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2639 | conditional_or_expression BOOL_OR_TK error
2640 {yyerror ("Missing term"); RECOVER;}
2643 conditional_expression: /* Error handling here is weak */
2644 conditional_or_expression
2645 | conditional_or_expression REL_QM_TK expression REL_CL_TK conditional_expression
2647 $$ = build3 (CONDITIONAL_EXPR, NULL_TREE, $1, $3, $5);
2648 SET_EXPR_LOCATION_FROM_TOKEN ($$, $2);
2650 | conditional_or_expression REL_QM_TK REL_CL_TK error
2653 yyerror ("Missing term");
2656 | conditional_or_expression REL_QM_TK error
2657 {yyerror ("Missing term"); DRECOVER (2);}
2658 | conditional_or_expression REL_QM_TK expression REL_CL_TK error
2659 {yyerror ("Missing term"); DRECOVER (3);}
2662 assignment_expression:
2663 conditional_expression
2668 left_hand_side assignment_operator assignment_expression
2669 { $$ = build_assignment ($2.token, $2.location, $1, $3); }
2670 | left_hand_side assignment_operator error
2672 YYNOT_TWICE yyerror ("Missing term");
2683 assignment_operator:
2689 assignment_expression
2692 constant_expression:
2698 /* Helper function to retrieve an OSB count. Should be used when the
2699 `dims:' rule is being used. */
2702 pop_current_osb (struct parser_ctxt *ctxp)
2706 if (ctxp->osb_depth < 0)
2709 to_return = CURRENT_OSB (ctxp);
2717 /* This section of the code deal with save/restoring parser contexts.
2718 Add mode documentation here. FIXME */
2720 /* Helper function. Create a new parser context. With
2721 COPY_FROM_PREVIOUS set to a nonzero value, content of the previous
2722 context is copied, otherwise, the new context is zeroed. The newly
2723 created context becomes the current one. */
2726 create_new_parser_context (int copy_from_previous)
2728 struct parser_ctxt *new;
2730 new = ggc_alloc (sizeof (struct parser_ctxt));
2731 if (copy_from_previous)
2733 memcpy (new, ctxp, sizeof (struct parser_ctxt));
2734 /* This flag, indicating the context saves global values,
2735 should only be set by java_parser_context_save_global. */
2736 new->saved_data_ctx = 0;
2739 memset (new, 0, sizeof (struct parser_ctxt));
2745 /* Create a new parser context and make it the current one. */
2748 java_push_parser_context (void)
2750 create_new_parser_context (0);
2754 java_pop_parser_context (int generate)
2757 struct parser_ctxt *next;
2765 input_location = ctxp->save_location;
2766 current_class = ctxp->class_type;
2769 /* If the old and new lexers differ, then free the old one. */
2770 if (ctxp->lexer && next && ctxp->lexer != next->lexer)
2771 java_destroy_lexer (ctxp->lexer);
2773 /* Set the single import class file flag to 0 for the current list
2774 of imported things */
2775 for (current = ctxp->import_list; current; current = TREE_CHAIN (current))
2776 IS_A_SINGLE_IMPORT_CLASSFILE_NAME_P (TREE_VALUE (current)) = 0;
2778 /* If we pushed a context to parse a class intended to be generated,
2779 we keep it so we can remember the class. What we could actually
2780 do is to just update a list of class names. */
2783 ctxp->next = ctxp_for_generation;
2784 ctxp_for_generation = ctxp;
2787 /* And restore those of the previous context */
2788 if ((ctxp = next)) /* Assignment is really meant here */
2789 for (current = ctxp->import_list; current; current = TREE_CHAIN (current))
2790 IS_A_SINGLE_IMPORT_CLASSFILE_NAME_P (TREE_VALUE (current)) = 1;
2793 /* Create a parser context for the use of saving some global
2797 java_parser_context_save_global (void)
2801 java_push_parser_context ();
2802 ctxp->saved_data_ctx = 1;
2805 /* If this context already stores data, create a new one suitable
2806 for data storage. */
2807 else if (ctxp->saved_data)
2809 create_new_parser_context (1);
2810 ctxp->saved_data_ctx = 1;
2813 ctxp->save_location = input_location;
2814 ctxp->class_type = current_class;
2815 ctxp->function_decl = current_function_decl;
2816 ctxp->saved_data = 1;
2819 /* Restore some global variables from the previous context. Make the
2820 previous context the current one. */
2823 java_parser_context_restore_global (void)
2825 input_location = ctxp->save_location;
2826 current_class = ctxp->class_type;
2828 #ifdef USE_MAPPED_LOCATION
2829 SET_EXPR_LOCATION (wfl_operator, ctxp->save_location);
2831 EXPR_WFL_FILENAME_NODE (wfl_operator) = get_identifier (input_filename);
2833 current_function_decl = ctxp->function_decl;
2834 ctxp->saved_data = 0;
2835 if (ctxp->saved_data_ctx)
2836 java_pop_parser_context (0);
2839 /* Suspend vital data for the current class/function being parsed so
2840 that an other class can be parsed. Used to let local/anonymous
2841 classes be parsed. */
2844 java_parser_context_suspend (void)
2846 /* This makes debugging through java_debug_context easier */
2847 static const char *const name = "<inner buffer context>";
2849 /* Duplicate the previous context, use it to save the globals we're
2851 create_new_parser_context (1);
2852 ctxp->function_decl = current_function_decl;
2853 ctxp->class_type = current_class;
2855 /* Then create a new context which inherits all data from the
2856 previous one. This will be the new current context */
2857 create_new_parser_context (1);
2859 /* Help debugging */
2860 ctxp->next->filename = name;
2863 /* Resume vital data for the current class/function being parsed so
2864 that an other class can be parsed. Used to let local/anonymous
2865 classes be parsed. The trick is the data storing file position
2866 informations must be restored to their current value, so parsing
2867 can resume as if no context was ever saved. */
2870 java_parser_context_resume (void)
2872 struct parser_ctxt *old = ctxp; /* This one is to be discarded */
2873 struct parser_ctxt *saver = old->next; /* This one contain saved info */
2874 struct parser_ctxt *restored = saver->next; /* This one is the old current */
2876 /* We need to inherit the list of classes to complete/generate */
2877 restored->classd_list = old->classd_list;
2878 restored->class_list = old->class_list;
2880 /* Restore the current class and function from the saver */
2881 current_class = saver->class_type;
2882 current_function_decl = saver->function_decl;
2884 /* Retrieve the restored context */
2887 /* Re-installed the data for the parsing to carry on */
2888 memcpy (&ctxp->marker_begining, &old->marker_begining,
2889 (size_t)(&ctxp->marker_end - &ctxp->marker_begining));
2892 /* Add a new anchor node to which all statement(s) initializing static
2893 and non static initialized upon declaration field(s) will be
2897 java_parser_context_push_initialized_field (void)
2901 node = build_tree_list (NULL_TREE, NULL_TREE);
2902 TREE_CHAIN (node) = CPC_STATIC_INITIALIZER_LIST (ctxp);
2903 CPC_STATIC_INITIALIZER_LIST (ctxp) = node;
2905 node = build_tree_list (NULL_TREE, NULL_TREE);
2906 TREE_CHAIN (node) = CPC_INITIALIZER_LIST (ctxp);
2907 CPC_INITIALIZER_LIST (ctxp) = node;
2909 node = build_tree_list (NULL_TREE, NULL_TREE);
2910 TREE_CHAIN (node) = CPC_INSTANCE_INITIALIZER_LIST (ctxp);
2911 CPC_INSTANCE_INITIALIZER_LIST (ctxp) = node;
2914 /* Pop the lists of initialized field. If this lists aren't empty,
2915 remember them so we can use it to create and populate the finit$
2916 or <clinit> functions. */
2919 java_parser_context_pop_initialized_field (void)
2922 tree class_type = TREE_TYPE (GET_CPC ());
2924 if (CPC_INITIALIZER_LIST (ctxp))
2926 stmts = CPC_INITIALIZER_STMT (ctxp);
2927 CPC_INITIALIZER_LIST (ctxp) = TREE_CHAIN (CPC_INITIALIZER_LIST (ctxp));
2928 if (stmts && !java_error_count)
2929 TYPE_FINIT_STMT_LIST (class_type) = reorder_static_initialized (stmts);
2932 if (CPC_STATIC_INITIALIZER_LIST (ctxp))
2934 stmts = CPC_STATIC_INITIALIZER_STMT (ctxp);
2935 CPC_STATIC_INITIALIZER_LIST (ctxp) =
2936 TREE_CHAIN (CPC_STATIC_INITIALIZER_LIST (ctxp));
2937 /* Keep initialization in order to enforce 8.5 */
2938 if (stmts && !java_error_count)
2939 TYPE_CLINIT_STMT_LIST (class_type) = nreverse (stmts);
2942 /* JDK 1.1 instance initializers */
2943 if (CPC_INSTANCE_INITIALIZER_LIST (ctxp))
2945 stmts = CPC_INSTANCE_INITIALIZER_STMT (ctxp);
2946 CPC_INSTANCE_INITIALIZER_LIST (ctxp) =
2947 TREE_CHAIN (CPC_INSTANCE_INITIALIZER_LIST (ctxp));
2948 if (stmts && !java_error_count)
2949 TYPE_II_STMT_LIST (class_type) = nreverse (stmts);
2954 reorder_static_initialized (tree list)
2956 /* We have to keep things in order. The alias initializer have to
2957 come first, then the initialized regular field, in reverse to
2958 keep them in lexical order. */
2959 tree marker, previous = NULL_TREE;
2960 for (marker = list; marker; previous = marker, marker = TREE_CHAIN (marker))
2961 if (TREE_CODE (marker) == TREE_LIST
2962 && !TREE_VALUE (marker) && !TREE_PURPOSE (marker))
2965 /* No static initialized, the list is fine as is */
2967 list = TREE_CHAIN (marker);
2969 /* No marker? reverse the whole list */
2971 list = nreverse (list);
2973 /* Otherwise, reverse what's after the marker and the new reordered
2974 sublist will replace the marker. */
2977 TREE_CHAIN (previous) = NULL_TREE;
2978 list = nreverse (list);
2979 list = chainon (TREE_CHAIN (marker), list);
2984 /* Helper functions to dump the parser context stack. */
2986 #define TAB_CONTEXT(C) \
2987 {int i; for (i = 0; i < (C); i++) fputc (' ', stderr);}
2990 java_debug_context_do (int tab)
2992 struct parser_ctxt *copy = ctxp;
2996 fprintf (stderr, "ctxt: 0x%0lX\n", (unsigned long)copy);
2998 fprintf (stderr, "filename: %s\n", copy->filename);
3000 fprintf (stderr, "package: %s\n",
3002 IDENTIFIER_POINTER (copy->package) : "<none>"));
3004 fprintf (stderr, "context for saving: %d\n", copy->saved_data_ctx);
3006 fprintf (stderr, "saved data: %d\n", copy->saved_data);
3012 /* Dump the stacked up parser contexts. Intended to be called from a
3016 java_debug_context (void)
3018 java_debug_context_do (0);
3023 /* Flag for the error report routine to issue the error the first time
3024 it's called (overriding the default behavior which is to drop the
3025 first invocation and honor the second one, taking advantage of a
3027 static int force_error = 0;
3029 /* Reporting an constructor invocation error. */
3031 parse_ctor_invocation_error (void)
3033 if (DECL_CONSTRUCTOR_P (current_function_decl))
3034 yyerror ("Constructor invocation must be first thing in a constructor");
3036 yyerror ("Only constructors can invoke constructors");
3039 /* Reporting JDK1.1 features not implemented. */
3042 parse_jdk1_1_error (const char *msg)
3044 sorry (": `%s' JDK1.1(TM) feature", msg);
3046 return build_java_empty_stmt ();
3049 static int do_warning = 0;
3052 yyerror (const char *msg)
3054 #ifdef USE_MAPPED_LOCATION
3055 static source_location elc;
3056 expanded_location xloc = expand_location (input_location);
3057 int current_line = xloc.line;
3061 int current_line = input_line;
3063 static int prev_lineno;
3064 static const char *prev_msg;
3066 char *remainder, *code_from_source;
3068 if (!force_error && prev_lineno == current_line)
3070 #ifndef USE_MAPPED_LOCATION
3071 current_line = ctxp->lexer->token_start.line;
3074 /* Save current error location but report latter, when the context is
3076 if (ctxp->java_error_flag == 0)
3078 ctxp->java_error_flag = 1;
3079 #ifdef USE_MAPPED_LOCATION
3080 elc = input_location;
3082 elc = ctxp->lexer->token_start;
3084 /* Do something to use the previous line if we're reaching the
3085 end of the file... */
3086 #ifdef VERBOSE_SKELETON
3087 printf ("* Error detected (%s)\n", (msg ? msg : "(null)"));
3092 /* Ignore duplicate message on the same line. BTW, this is dubious. FIXME */
3093 if (!force_error && msg == prev_msg && prev_lineno == current_line)
3096 ctxp->java_error_flag = 0;
3098 java_warning_count++;
3103 if (elc.col == 0 && msg && msg[1] == ';')
3104 elc = ctxp->prev_line_end;
3109 #ifdef USE_MAPPED_LOCATION
3110 prev_lineno = current_line;
3111 code_from_source = java_get_line_col (xloc.file, current_line, xloc.column);
3113 save_lineno = input_line;
3114 prev_lineno = input_line = current_line;
3115 code_from_source = java_get_line_col (input_filename, current_line,
3116 ctxp->lexer->token_start.col);
3120 obstack_grow0 (&temporary_obstack,
3121 code_from_source, strlen (code_from_source));
3122 remainder = obstack_finish (&temporary_obstack);
3124 warning ("%s.\n%s", msg, remainder);
3126 error ("%s.\n%s", msg, remainder);
3128 /* This allow us to cheaply avoid an extra 'Invalid expression
3129 statement' error report when errors have been already reported on
3130 the same line. This occurs when we report an error but don't have
3131 a synchronization point other than ';', which
3132 expression_statement is the only one to take care of. */
3133 #ifndef USE_MAPPED_LOCATION
3134 input_line = save_lineno;
3136 ctxp->prevent_ese = input_line;
3140 issue_warning_error_from_context (
3141 #ifdef USE_MAPPED_LOCATION
3146 const char *msgid, va_list ap)
3148 #ifdef USE_MAPPED_LOCATION
3149 source_location saved_location = input_location;
3150 expanded_location xloc = expand_location (cl);
3152 java_lc save_lc = ctxp->lexer->token_start;
3153 const char *saved = ctxp->filename, *saved_input_filename;
3158 text.err_no = errno;
3159 text.args_ptr = ≈
3160 text.format_spec = msgid;
3161 pp_format_text (global_dc->printer, &text);
3162 strncpy (buffer, pp_formatted_text (global_dc->printer), sizeof (buffer) - 1);
3163 buffer[sizeof (buffer) - 1] = '\0';
3164 pp_clear_output_area (global_dc->printer);
3168 #ifdef USE_MAPPED_LOCATION
3169 if (xloc.file != NULL)
3171 ctxp->filename = xloc.file;
3172 input_location = cl;
3175 ctxp->lexer->token_start.line = EXPR_WFL_LINENO (cl);
3176 ctxp->lexer->token_start.col = (EXPR_WFL_COLNO (cl) == 0xfff ? -1
3177 : EXPR_WFL_COLNO (cl) == 0xffe ? -2
3178 : EXPR_WFL_COLNO (cl));
3180 /* We have a CL, that's a good reason for using it if it contains data */
3181 if (TREE_CODE (cl) == EXPR_WITH_FILE_LOCATION && EXPR_WFL_FILENAME_NODE (cl))
3182 ctxp->filename = EXPR_WFL_FILENAME (cl);
3183 saved_input_filename = input_filename;
3184 input_filename = ctxp->filename;
3187 java_error (buffer);
3188 #ifdef USE_MAPPED_LOCATION
3189 input_location = saved_location;
3191 ctxp->filename = saved;
3192 input_filename = saved_input_filename;
3193 ctxp->lexer->token_start = save_lc;
3198 /* Issue an error message at a current source line CL.
3199 FUTURE/FIXME: change cl to be a source_location. */
3202 parse_error_context (tree cl, const char *msgid, ...)
3205 va_start (ap, msgid);
3206 #ifdef USE_MAPPED_LOCATION
3207 issue_warning_error_from_context (EXPR_LOCATION (cl), msgid, ap);
3209 issue_warning_error_from_context (cl, msgid, ap);
3214 /* Issue a warning at a current source line CL.
3215 FUTURE/FIXME: change cl to be a source_location. */
3218 parse_warning_context (tree cl, const char *msgid, ...)
3221 va_start (ap, msgid);
3224 #ifdef USE_MAPPED_LOCATION
3225 issue_warning_error_from_context (EXPR_LOCATION (cl), msgid, ap);
3227 issue_warning_error_from_context (cl, msgid, ap);
3234 find_expr_with_wfl (tree node)
3238 enum tree_code_class code;
3241 switch (TREE_CODE (node))
3244 node = BLOCK_EXPR_BODY (node);
3248 to_return = find_expr_with_wfl (TREE_OPERAND (node, 0));
3251 node = TREE_OPERAND (node, 1);
3255 node = TREE_OPERAND (node, 0);
3258 case LABELED_BLOCK_EXPR:
3259 node = TREE_OPERAND (node, 1);
3263 code = TREE_CODE_CLASS (TREE_CODE (node));
3264 if (((code == tcc_unary) || (code == tcc_binary)
3265 || (code == tcc_expression))
3266 && EXPR_WFL_LINECOL (node))
3274 /* Issue a missing return statement error. Uses METHOD to figure the
3275 last line of the method the error occurs in. */
3278 missing_return_error (tree method)
3280 #ifdef USE_MAPPED_LOCATION
3281 SET_EXPR_LOCATION (wfl_operator, DECL_FUNCTION_LAST_LINE (method));
3283 EXPR_WFL_SET_LINECOL (wfl_operator, DECL_FUNCTION_LAST_LINE (method), -2);
3285 parse_error_context (wfl_operator, "Missing return statement");
3288 /* Issue an unreachable statement error. From NODE, find the next
3289 statement to report appropriately. */
3291 unreachable_stmt_error (tree node)
3293 /* Browse node to find the next expression node that has a WFL. Use
3294 the location to report the error */
3295 if (TREE_CODE (node) == COMPOUND_EXPR)
3296 node = find_expr_with_wfl (TREE_OPERAND (node, 1));
3298 node = find_expr_with_wfl (node);
3302 #ifdef USE_MAPPED_LOCATION
3303 SET_EXPR_LOCATION (wfl_operator, EXPR_LOCATION (node));
3305 EXPR_WFL_SET_LINECOL (wfl_operator, EXPR_WFL_LINENO (node), -2);
3307 parse_error_context (wfl_operator, "Unreachable statement");
3314 not_accessible_field_error (tree wfl, tree decl)
3317 (wfl, "Can't access %s field `%s.%s' from `%s'",
3318 accessibility_string (get_access_flags_from_decl (decl)),
3319 GET_TYPE_NAME (DECL_CONTEXT (decl)),
3320 IDENTIFIER_POINTER (DECL_NAME (decl)),
3321 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (current_class))));
3326 java_report_errors (void)
3328 if (java_error_count)
3329 fprintf (stderr, "%d error%s",
3330 java_error_count, (java_error_count == 1 ? "" : "s"));
3331 if (java_warning_count)
3332 fprintf (stderr, "%s%d warning%s", (java_error_count ? ", " : ""),
3333 java_warning_count, (java_warning_count == 1 ? "" : "s"));
3334 if (java_error_count || java_warning_count)
3335 putc ('\n', stderr);
3336 return java_error_count;
3340 java_accstring_lookup (int flags)
3342 static char buffer [80];
3343 #define COPY_RETURN(S) {strcpy (buffer, S); return buffer;}
3345 /* Access modifier looked-up first for easier report on forbidden
3347 if (flags & ACC_PUBLIC) COPY_RETURN ("public");
3348 if (flags & ACC_PRIVATE) COPY_RETURN ("private");
3349 if (flags & ACC_PROTECTED) COPY_RETURN ("protected");
3350 if (flags & ACC_STATIC) COPY_RETURN ("static");
3351 if (flags & ACC_FINAL) COPY_RETURN ("final");
3352 if (flags & ACC_SYNCHRONIZED) COPY_RETURN ("synchronized");
3353 if (flags & ACC_VOLATILE) COPY_RETURN ("volatile");
3354 if (flags & ACC_TRANSIENT) COPY_RETURN ("transient");
3355 if (flags & ACC_NATIVE) COPY_RETURN ("native");
3356 if (flags & ACC_INTERFACE) COPY_RETURN ("interface");
3357 if (flags & ACC_ABSTRACT) COPY_RETURN ("abstract");
3364 /* Returns a string denoting the accessibility of a class or a member as
3365 indicated by FLAGS. We need a separate function from
3366 java_accstring_lookup, as the latter can return spurious "static", etc.
3367 if package-private access is defined (in which case none of the
3368 relevant access control bits in FLAGS is set). */
3371 accessibility_string (int flags)
3373 if (flags & ACC_PRIVATE) return "private";
3374 if (flags & ACC_PROTECTED) return "protected";
3375 if (flags & ACC_PUBLIC) return "public";
3377 return "package-private";
3380 /* Issuing error messages upon redefinition of classes, interfaces or
3384 classitf_redefinition_error (const char *context, tree id, tree decl, tree cl)
3386 parse_error_context (cl, "%s `%s' already defined in %s:%d",
3387 context, IDENTIFIER_POINTER (id),
3388 DECL_SOURCE_FILE (decl), DECL_SOURCE_LINE (decl));
3389 /* Here we should point out where its redefined. It's a unicode. FIXME */
3393 variable_redefinition_error (tree context, tree name, tree type, int line)
3395 const char *type_name;
3397 /* Figure a proper name for type. We might haven't resolved it */
3398 if (TREE_CODE (type) == POINTER_TYPE && !TREE_TYPE (type))
3399 type_name = IDENTIFIER_POINTER (TYPE_NAME (type));
3401 type_name = lang_printable_name (type, 0);
3403 parse_error_context (context,
3404 "Variable `%s' is already defined in this method and was declared `%s %s' at line %d",
3405 IDENTIFIER_POINTER (name),
3406 type_name, IDENTIFIER_POINTER (name), line);
3409 /* If ANAME is terminated with `[]', it indicates an array. This
3410 function returns the number of `[]' found and if this number is
3411 greater than zero, it extracts the array type name and places it in
3412 the node pointed to by TRIMMED unless TRIMMED is null. */
3415 build_type_name_from_array_name (tree aname, tree *trimmed)
3417 const char *name = IDENTIFIER_POINTER (aname);
3418 int len = IDENTIFIER_LENGTH (aname);
3421 STRING_STRIP_BRACKETS (name, len, array_dims);
3423 if (array_dims && trimmed)
3424 *trimmed = get_identifier_with_length (name, len);
3430 build_array_from_name (tree type, tree type_wfl, tree name, tree *ret_name)
3434 /* Eventually get more dims */
3435 more_dims = build_type_name_from_array_name (name, &name);
3437 /* If we have, then craft a new type for this variable */
3442 /* If we have a pointer, use its type */
3443 if (TREE_CODE (type) == POINTER_TYPE)
3444 type = TREE_TYPE (type);
3446 /* Building the first dimension of a primitive type uses this
3448 if (JPRIMITIVE_TYPE_P (type))
3450 type = build_java_array_type (type, -1);
3453 /* Otherwise, if we have a WFL for this type, use it (the type
3454 is already an array on an unresolved type, and we just keep
3455 on adding dimensions) */
3459 more_dims += build_type_name_from_array_name (TYPE_NAME (save),
3463 /* Add all the dimensions */
3465 type = build_unresolved_array_type (type);
3467 /* The type may have been incomplete in the first place */
3469 type = obtain_incomplete_type (type);
3477 /* Build something that the type identifier resolver will identify as
3478 being an array to an unresolved type. TYPE_WFL is a WFL on a
3482 build_unresolved_array_type (tree type_or_wfl)
3487 /* TYPE_OR_WFL might be an array on a resolved type. In this case,
3488 just create a array type */
3489 if (TREE_CODE (type_or_wfl) == RECORD_TYPE)
3490 return build_java_array_type (type_or_wfl, -1);
3492 obstack_grow (&temporary_obstack,
3493 IDENTIFIER_POINTER (EXPR_WFL_NODE (type_or_wfl)),
3494 IDENTIFIER_LENGTH (EXPR_WFL_NODE (type_or_wfl)));
3495 obstack_grow0 (&temporary_obstack, "[]", 2);
3496 ptr = obstack_finish (&temporary_obstack);
3497 #ifdef USE_MAPPED_LOCATION
3498 wfl = build_expr_wfl (get_identifier (ptr), EXPR_LOCATION (type_or_wfl));
3500 wfl = build_expr_wfl (get_identifier (ptr),
3501 EXPR_WFL_FILENAME (type_or_wfl),
3502 EXPR_WFL_LINENO (type_or_wfl),
3503 EXPR_WFL_COLNO (type_or_wfl));
3505 /* Re-install the existing qualifications so that the type can be
3506 resolved properly. */
3507 EXPR_WFL_QUALIFICATION (wfl) = EXPR_WFL_QUALIFICATION (type_or_wfl);
3512 parser_add_interface (tree class_decl, tree interface_decl, tree wfl)
3514 if (maybe_add_interface (TREE_TYPE (class_decl), TREE_TYPE (interface_decl)))
3515 parse_error_context (wfl, "Interface `%s' repeated",
3516 IDENTIFIER_POINTER (DECL_NAME (interface_decl)));
3519 /* Bulk of common class/interface checks. Return 1 if an error was
3520 encountered. TAG is 0 for a class, 1 for an interface. */
3523 check_class_interface_creation (int is_interface, int flags, tree raw_name,
3524 tree qualified_name, tree decl, tree cl)
3527 int sca = 0; /* Static class allowed */
3528 int icaf = 0; /* Inner class allowed flags */
3529 int uaaf = CLASS_MODIFIERS; /* Usually allowed access flags */
3532 fprintf (stderr, " %s%s %s",
3533 (CPC_INNER_P () ? "inner" : ""),
3534 (is_interface ? "interface" : "class"),
3535 IDENTIFIER_POINTER (qualified_name));
3537 /* Scope of an interface/class type name:
3538 - Can't be imported by a single type import
3539 - Can't already exists in the package */
3540 if (IS_A_SINGLE_IMPORT_CLASSFILE_NAME_P (raw_name)
3541 && (node = find_name_in_single_imports (raw_name))
3545 (cl, "%s name `%s' clashes with imported type `%s'",
3546 (is_interface ? "Interface" : "Class"),
3547 IDENTIFIER_POINTER (raw_name), IDENTIFIER_POINTER (node));
3550 if (decl && CLASS_COMPLETE_P (decl))
3552 classitf_redefinition_error ((is_interface ? "Interface" : "Class"),
3553 qualified_name, decl, cl);
3557 if (check_inner_class_redefinition (raw_name, cl))
3560 /* If public, file name should match class/interface name, except
3561 when dealing with an inner class */
3562 if (!CPC_INNER_P () && (flags & ACC_PUBLIC ))
3564 const char *fname = input_filename;
3567 for (f = fname + strlen (fname);
3568 f != fname && ! IS_DIR_SEPARATOR (*f);
3571 if (IS_DIR_SEPARATOR (*f))
3573 if (strncmp (IDENTIFIER_POINTER (raw_name),
3574 f , IDENTIFIER_LENGTH (raw_name)) ||
3575 f [IDENTIFIER_LENGTH (raw_name)] != '.')
3577 (cl, "Public %s `%s' must be defined in a file called `%s.java'",
3578 (is_interface ? "interface" : "class"),
3579 IDENTIFIER_POINTER (qualified_name),
3580 IDENTIFIER_POINTER (raw_name));
3583 /* Static classes can be declared only in top level classes. Note:
3584 once static, a inner class is a top level class. */
3585 if (flags & ACC_STATIC)
3587 /* Catch the specific error of declaring an class inner class
3588 with no toplevel enclosing class. Prevent check_modifiers from
3589 complaining a second time */
3590 if (CPC_INNER_P () && !TOPLEVEL_CLASS_DECL_P (GET_CPC()))
3592 parse_error_context (cl, "Inner class `%s' can't be static. Static classes can only occur in interfaces and top-level classes",
3593 IDENTIFIER_POINTER (qualified_name));
3596 /* Else, in the context of a top-level class declaration, let
3597 `check_modifiers' do its job, otherwise, give it a go */
3599 sca = (GET_CPC_LIST () ? ACC_STATIC : 0);
3602 /* Inner classes can be declared private or protected
3603 within their enclosing classes. */
3606 /* A class which is local to a block can't be public, private,
3607 protected or static. But it is created final, so allow this
3609 if (current_function_decl)
3610 icaf = sca = uaaf = ACC_FINAL;
3613 check_modifiers_consistency (flags);
3614 icaf = ACC_PROTECTED;
3615 if (! CLASS_INTERFACE (GET_CPC ()))
3616 icaf |= ACC_PRIVATE;
3623 uaaf = INTERFACE_INNER_MODIFIERS;
3625 uaaf = INTERFACE_MODIFIERS;
3627 check_modifiers ("Illegal modifier `%s' for interface declaration",
3631 check_modifiers ((current_function_decl ?
3632 "Illegal modifier `%s' for local class declaration" :
3633 "Illegal modifier `%s' for class declaration"),
3634 flags, uaaf|sca|icaf);
3638 /* Construct a nested class name. If the final component starts with
3639 a digit, return true. Otherwise return false. */
3641 make_nested_class_name (tree cpc_list)
3648 make_nested_class_name (TREE_CHAIN (cpc_list));
3650 /* Pick the qualified name when dealing with the first upmost
3652 name = (TREE_CHAIN (cpc_list)
3653 ? TREE_PURPOSE (cpc_list) : DECL_NAME (TREE_VALUE (cpc_list)));
3654 obstack_grow (&temporary_obstack,
3655 IDENTIFIER_POINTER (name), IDENTIFIER_LENGTH (name));
3656 obstack_1grow (&temporary_obstack, '$');
3658 return ISDIGIT (IDENTIFIER_POINTER (name)[0]);
3661 /* Can't redefine a class already defined in an earlier scope. */
3664 check_inner_class_redefinition (tree raw_name, tree cl)
3668 for (scope_list = GET_CPC_LIST (); scope_list;
3669 scope_list = GET_NEXT_ENCLOSING_CPC (scope_list))
3670 if (raw_name == GET_CPC_UN_NODE (scope_list))
3673 (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",
3674 IDENTIFIER_POINTER (raw_name));
3680 /* Tries to find a decl for CLASS_TYPE within ENCLOSING. If we fail,
3681 we remember ENCLOSING and SUPER. */
3684 resolve_inner_class (htab_t circularity_hash, tree cl, tree *enclosing,
3685 tree *super, tree class_type)
3687 tree local_enclosing = *enclosing;
3688 tree local_super = NULL_TREE;
3690 while (local_enclosing)
3692 tree intermediate, decl;
3694 *htab_find_slot (circularity_hash, local_enclosing, INSERT) =
3697 if ((decl = find_as_inner_class (local_enclosing, class_type, cl)))
3700 intermediate = local_enclosing;
3701 /* Explore enclosing contexts. */
3702 while (INNER_CLASS_DECL_P (intermediate))
3704 intermediate = DECL_CONTEXT (intermediate);
3705 if ((decl = find_as_inner_class (intermediate, class_type, cl)))
3709 /* Now go to the upper classes, bail out if necessary. We will
3710 analyze the returned SUPER and act accordingly (see
3711 do_resolve_class). */
3712 if (JPRIMITIVE_TYPE_P (TREE_TYPE (local_enclosing))
3713 || TREE_TYPE (local_enclosing) == void_type_node)
3715 parse_error_context (cl, "Qualifier must be a reference");
3716 local_enclosing = NULL_TREE;
3719 local_super = CLASSTYPE_SUPER (TREE_TYPE (local_enclosing));
3720 if (!local_super || local_super == object_type_node)
3723 if (TREE_CODE (local_super) == POINTER_TYPE)
3724 local_super = do_resolve_class (NULL, local_super, NULL, NULL);
3726 local_super = TYPE_NAME (local_super);
3728 /* We may not have checked for circular inheritance yet, so do so
3729 here to prevent an infinite loop. */
3730 if (htab_find (circularity_hash, local_super) != NULL)
3733 cl = lookup_cl (local_enclosing);
3736 (cl, "Cyclic inheritance involving %s",
3737 IDENTIFIER_POINTER (DECL_NAME (local_enclosing)));
3738 local_enclosing = NULL_TREE;
3741 local_enclosing = local_super;
3744 /* We failed. Return LOCAL_SUPER and LOCAL_ENCLOSING. */
3745 *super = local_super;
3746 *enclosing = local_enclosing;
3751 /* Within ENCLOSING, find a decl for NAME and return it. NAME can be
3755 find_as_inner_class (tree enclosing, tree name, tree cl)
3757 tree qual, to_return;
3761 name = TYPE_NAME (name);
3763 /* First search: within the scope of `enclosing', search for name */
3764 if (QUALIFIED_P (name) && cl && EXPR_WFL_NODE (cl) == name)
3765 qual = EXPR_WFL_QUALIFICATION (cl);
3767 qual = build_tree_list (cl, NULL_TREE);
3769 qual = build_tree_list (build_unknown_wfl (name), NULL_TREE);
3771 if ((to_return = find_as_inner_class_do (qual, enclosing)))
3774 /* We're dealing with a qualified name. Try to resolve thing until
3775 we get something that is an enclosing class. */
3776 if (QUALIFIED_P (name) && cl && EXPR_WFL_NODE (cl) == name)
3778 tree acc = NULL_TREE, decl = NULL_TREE, ptr;
3780 for (qual = EXPR_WFL_QUALIFICATION (cl); qual && !decl;
3781 qual = TREE_CHAIN (qual))
3783 acc = merge_qualified_name (acc,
3784 EXPR_WFL_NODE (TREE_PURPOSE (qual)));
3785 BUILD_PTR_FROM_NAME (ptr, acc);
3786 decl = do_resolve_class (NULL_TREE, ptr, NULL_TREE, cl);
3789 /* A NULL qual and a decl means that the search ended
3790 successfully?!? We have to do something then. FIXME */
3795 qual = EXPR_WFL_QUALIFICATION (cl);
3797 /* Otherwise, create a qual for the other part of the resolution. */
3799 qual = build_tree_list (build_unknown_wfl (name), NULL_TREE);
3801 return find_as_inner_class_do (qual, enclosing);
3804 /* We go inside the list of sub classes and try to find a way
3808 find_as_inner_class_do (tree qual, tree enclosing)
3813 for (; qual && enclosing; qual = TREE_CHAIN (qual))
3815 tree name_to_match = EXPR_WFL_NODE (TREE_PURPOSE (qual));
3816 tree next_enclosing = NULL_TREE;
3819 for (inner_list = DECL_INNER_CLASS_LIST (enclosing);
3820 inner_list; inner_list = TREE_CHAIN (inner_list))
3822 if (TREE_VALUE (inner_list) == name_to_match)
3824 next_enclosing = TREE_PURPOSE (inner_list);
3828 enclosing = next_enclosing;
3831 return (!qual && enclosing ? enclosing : NULL_TREE);
3835 link_nested_class_to_enclosing (void)
3837 if (GET_ENCLOSING_CPC ())
3839 tree enclosing = GET_ENCLOSING_CPC_CONTEXT ();
3840 DECL_INNER_CLASS_LIST (enclosing) =
3841 tree_cons (GET_CPC (), GET_CPC_UN (),
3842 DECL_INNER_CLASS_LIST (enclosing));
3847 maybe_make_nested_class_name (tree name)
3849 tree id = NULL_TREE;
3853 /* If we're in a function, we must append a number to create the
3854 nested class name. However, we don't do this if the class we
3855 are constructing is anonymous, because in that case we'll
3856 already have a number as the class name. */
3857 if (! make_nested_class_name (GET_CPC_LIST ())
3858 && current_function_decl != NULL_TREE
3859 && ! ISDIGIT (IDENTIFIER_POINTER (name)[0]))
3862 sprintf (buf, "%d", anonymous_class_counter);
3863 ++anonymous_class_counter;
3864 obstack_grow (&temporary_obstack, buf, strlen (buf));
3865 obstack_1grow (&temporary_obstack, '$');
3867 obstack_grow0 (&temporary_obstack,
3868 IDENTIFIER_POINTER (name),
3869 IDENTIFIER_LENGTH (name));
3870 id = get_identifier (obstack_finish (&temporary_obstack));
3872 QUALIFIED_P (id) = 1;
3877 /* If DECL is NULL, create and push a new DECL, record the current
3878 line CL and do other maintenance things. */
3881 maybe_create_class_interface_decl (tree decl, tree raw_name,
3882 tree qualified_name, tree cl)
3885 decl = push_class (make_class (), qualified_name);
3887 /* Take care of the file and line business */
3888 #ifdef USE_MAPPED_LOCATION
3889 DECL_SOURCE_LOCATION (decl) = EXPR_LOCATION (cl);
3891 DECL_SOURCE_FILE (decl) = EXPR_WFL_FILENAME (cl);
3892 /* If we're emitting xrefs, store the line/col number information */
3894 DECL_SOURCE_LINE (decl) = EXPR_WFL_LINECOL (cl);
3896 DECL_SOURCE_LINE (decl) = EXPR_WFL_LINENO (cl);
3898 CLASS_FROM_SOURCE_P (TREE_TYPE (decl)) = 1;
3899 CLASS_PARSED_P (TREE_TYPE (decl)) = 1;
3900 #ifdef USE_MAPPED_LOCATION
3902 tree tmp = maybe_get_identifier (EXPR_FILENAME (cl));
3903 CLASS_FROM_CURRENTLY_COMPILED_P (TREE_TYPE (decl)) =
3904 tmp && IS_A_COMMAND_LINE_FILENAME_P (tmp);
3907 CLASS_FROM_CURRENTLY_COMPILED_P (TREE_TYPE (decl)) =
3908 IS_A_COMMAND_LINE_FILENAME_P (EXPR_WFL_FILENAME_NODE (cl));
3911 PUSH_CPC (decl, raw_name);
3912 DECL_CONTEXT (decl) = GET_ENCLOSING_CPC_CONTEXT ();
3914 /* Link the declaration to the already seen ones */
3915 TREE_CHAIN (decl) = ctxp->class_list;
3916 ctxp->class_list = decl;
3918 /* Create a new nodes in the global lists */
3919 gclass_list = tree_cons (NULL_TREE, decl, gclass_list);
3920 all_class_list = tree_cons (NULL_TREE, decl, all_class_list);
3922 /* Install a new dependency list element */
3923 create_jdep_list (ctxp);
3925 SOURCE_FRONTEND_DEBUG (("Defining class/interface %s",
3926 IDENTIFIER_POINTER (qualified_name)));
3931 add_superinterfaces (tree decl, tree interface_list)
3934 /* Superinterface(s): if present and defined, parser_check_super_interface ()
3935 takes care of ensuring that:
3936 - This is an accessible interface type,
3937 - Circularity detection.
3938 parser_add_interface is then called. If present but not defined,
3939 the check operation is delayed until the super interface gets
3941 for (node = interface_list; node; node = TREE_CHAIN (node))
3943 tree current = TREE_PURPOSE (node);
3944 tree idecl = IDENTIFIER_CLASS_VALUE (EXPR_WFL_NODE (current));
3945 if (idecl && CLASS_LOADED_P (TREE_TYPE (idecl)))
3947 if (!parser_check_super_interface (idecl, decl, current))
3948 parser_add_interface (decl, idecl, current);
3951 register_incomplete_type (JDEP_INTERFACE,
3952 current, decl, NULL_TREE);
3956 /* Create an interface in pass1 and return its decl. Return the
3957 interface's decl in pass 2. */
3960 create_interface (int flags, tree id, tree super)
3962 tree raw_name = EXPR_WFL_NODE (id);
3963 tree q_name = parser_qualified_classname (raw_name);
3964 tree decl = IDENTIFIER_CLASS_VALUE (q_name);
3966 /* Certain syntax errors are making SUPER be like ID. Avoid this
3968 if (ctxp->class_err && id == super)
3971 EXPR_WFL_NODE (id) = q_name; /* Keep source location, even if refined. */
3973 /* Basic checks: scope, redefinition, modifiers */
3974 if (check_class_interface_creation (1, flags, raw_name, q_name, decl, id))
3980 /* Suspend the current parsing context if we're parsing an inner
3984 java_parser_context_suspend ();
3985 /* Interface members are public. */
3986 if (CLASS_INTERFACE (GET_CPC ()))
3987 flags |= ACC_PUBLIC;
3990 /* Push a new context for (static) initialized upon declaration fields */
3991 java_parser_context_push_initialized_field ();
3993 /* Interface modifiers check
3994 - public/abstract allowed (already done at that point)
3995 - abstract is obsolete (comes first, it's a warning, or should be)
3996 - Can't use twice the same (checked in the modifier rule) */
3997 if ((flags & ACC_ABSTRACT) && flag_redundant)
3998 parse_warning_context
3999 (MODIFIER_WFL (ABSTRACT_TK),
4000 "Redundant use of `abstract' modifier. Interface `%s' is implicitly abstract", IDENTIFIER_POINTER (raw_name));
4002 /* Create a new decl if DECL is NULL, otherwise fix it */
4003 decl = maybe_create_class_interface_decl (decl, raw_name, q_name, id);
4005 /* Interfaces are always abstract. */
4006 flags |= ACC_ABSTRACT;
4008 /* Inner interfaces are always static. */
4009 if (INNER_CLASS_DECL_P (decl))
4010 flags |= ACC_STATIC;
4012 /* Set super info and mark the class a complete */
4013 set_super_info (ACC_INTERFACE | flags, TREE_TYPE (decl),
4014 object_type_node, ctxp->interface_number);
4015 ctxp->interface_number = 0;
4016 CLASS_COMPLETE_P (decl) = 1;
4017 add_superinterfaces (decl, super);
4019 /* Eventually sets the @deprecated tag flag */
4020 CHECK_DEPRECATED (decl);
4025 /* Patch anonymous class CLASS, by either extending or implementing
4029 patch_anonymous_class (tree type_decl, tree class_decl, tree wfl)
4031 tree class = TREE_TYPE (class_decl);
4032 tree type = TREE_TYPE (type_decl);
4033 tree binfo = TYPE_BINFO (class);
4035 /* If it's an interface, implement it */
4036 if (CLASS_INTERFACE (type_decl))
4038 if (parser_check_super_interface (type_decl, class_decl, wfl))
4041 if (!VEC_space (tree, BINFO_BASE_BINFOS (binfo), 1))
4043 /* Extend the binfo - by reallocating and copying it. */
4048 new_binfo = make_tree_binfo ((BINFO_N_BASE_BINFOS (binfo) + 1) * 2);
4049 for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
4050 BINFO_BASE_APPEND (new_binfo, base_binfo);
4051 CLASS_HAS_SUPER_FLAG (new_binfo) = CLASS_HAS_SUPER_FLAG (binfo);
4052 BINFO_VTABLE (new_binfo) = BINFO_VTABLE (binfo);
4053 TYPE_BINFO (class) = new_binfo;
4056 /* And add the interface */
4057 parser_add_interface (class_decl, type_decl, wfl);
4059 /* Otherwise, it's a type we want to extend */
4062 if (parser_check_super (type_decl, class_decl, wfl))
4064 BINFO_TYPE (BINFO_BASE_BINFO (binfo, 0)) = type;
4068 /* Create an anonymous class which extends/implements TYPE_NAME, and return
4072 create_anonymous_class (tree type_name)
4075 tree super = NULL_TREE, itf = NULL_TREE;
4076 tree id, type_decl, class;
4078 /* The unqualified name of the anonymous class. It's just a number. */
4079 sprintf (buffer, "%d", anonymous_class_counter++);
4080 id = build_wfl_node (get_identifier (buffer));
4081 EXPR_WFL_LINECOL (id) = EXPR_WFL_LINECOL (type_name);
4083 /* We know about the type to extend/implement. We go ahead */
4084 if ((type_decl = IDENTIFIER_CLASS_VALUE (EXPR_WFL_NODE (type_name))))
4086 /* Create a class which either implements on extends the designated
4087 class. The class bears an inaccessible name. */
4088 if (CLASS_INTERFACE (type_decl))
4090 /* It's OK to modify it here. It's been already used and
4091 shouldn't be reused */
4092 ctxp->interface_number = 1;
4093 /* Interfaces should presented as a list of WFLs */
4094 itf = build_tree_list (type_name, NULL_TREE);
4100 class = create_class (ACC_FINAL, id, super, itf);
4102 /* We didn't know anything about the stuff. We register a dependence. */
4104 register_incomplete_type (JDEP_ANONYMOUS, type_name, class, NULL_TREE);
4106 ANONYMOUS_CLASS_P (TREE_TYPE (class)) = 1;
4110 /* Create a class in pass1 and return its decl. Return class
4111 interface's decl in pass 2. */
4114 create_class (int flags, tree id, tree super, tree interfaces)
4116 tree raw_name = EXPR_WFL_NODE (id);
4117 tree class_id, decl;
4118 tree super_decl_type;
4120 /* Certain syntax errors are making SUPER be like ID. Avoid this
4122 if (ctxp->class_err && id == super)
4125 class_id = parser_qualified_classname (raw_name);
4126 decl = IDENTIFIER_CLASS_VALUE (class_id);
4127 EXPR_WFL_NODE (id) = class_id;
4129 /* Basic check: scope, redefinition, modifiers */
4130 if (check_class_interface_creation (0, flags, raw_name, class_id, decl, id))
4136 /* Suspend the current parsing context if we're parsing an inner
4137 class or an anonymous class. */
4140 java_parser_context_suspend ();
4141 /* Interface members are public. */
4142 if (CLASS_INTERFACE (GET_CPC ()))
4143 flags |= ACC_PUBLIC;
4146 /* Push a new context for (static) initialized upon declaration fields */
4147 java_parser_context_push_initialized_field ();
4149 /* Class modifier check:
4150 - Allowed modifier (already done at that point)
4151 - abstract AND final forbidden
4152 - Public classes defined in the correct file */
4153 if ((flags & ACC_ABSTRACT) && (flags & ACC_FINAL))
4155 (id, "Class `%s' can't be declared both abstract and final",
4156 IDENTIFIER_POINTER (raw_name));
4158 /* Create a new decl if DECL is NULL, otherwise fix it */
4159 decl = maybe_create_class_interface_decl (decl, raw_name, class_id, id);
4161 /* If SUPER exists, use it, otherwise use Object */
4164 /* java.lang.Object can't extend anything. */
4165 if (TREE_TYPE (IDENTIFIER_CLASS_VALUE (class_id)) == object_type_node)
4167 parse_error_context (id, "`java.lang.Object' can't extend anything");
4172 register_incomplete_type (JDEP_SUPER, super, decl, NULL_TREE);
4174 else if (TREE_TYPE (decl) != object_type_node)
4175 super_decl_type = object_type_node;
4176 /* We're defining java.lang.Object */
4178 super_decl_type = NULL_TREE;
4180 /* A class nested in an interface is implicitly static. */
4181 if (INNER_CLASS_DECL_P (decl)
4182 && CLASS_INTERFACE (TYPE_NAME (TREE_TYPE (DECL_CONTEXT (decl)))))
4184 flags |= ACC_STATIC;
4187 /* Set super info and mark the class as complete. */
4188 set_super_info (flags, TREE_TYPE (decl), super_decl_type,
4189 ctxp->interface_number);
4190 ctxp->interface_number = 0;
4191 CLASS_COMPLETE_P (decl) = 1;
4192 add_superinterfaces (decl, interfaces);
4194 /* TYPE_VFIELD' is a compiler-generated field used to point to
4195 virtual function tables. In gcj, every class has a common base
4196 virtual function table in java.lang.object. */
4197 TYPE_VFIELD (TREE_TYPE (decl)) = TYPE_VFIELD (object_type_node);
4199 /* Add the private this$<n> field, Replicate final locals still in
4200 scope as private final fields mangled like val$<local_name>.
4201 This does not occur for top level (static) inner classes. */
4202 if (PURE_INNER_CLASS_DECL_P (decl))
4203 add_inner_class_fields (decl, current_function_decl);
4205 /* If doing xref, store the location at which the inherited class
4206 (if any) was seen. */
4207 if (flag_emit_xref && super)
4208 DECL_INHERITED_SOURCE_LINE (decl) = EXPR_WFL_LINECOL (super);
4210 /* Eventually sets the @deprecated tag flag */
4211 CHECK_DEPRECATED (decl);
4213 /* Reset the anonymous class counter when declaring non inner classes */
4214 if (!INNER_CLASS_DECL_P (decl))
4215 anonymous_class_counter = 1;
4220 /* End a class declaration: register the statements used to create
4221 finit$ and <clinit>, pop the current class and resume the prior
4222 parser context if necessary. */
4225 end_class_declaration (int resume)
4227 /* If an error occurred, context weren't pushed and won't need to be
4228 popped by a resume. */
4229 int no_error_occurred = ctxp->next && GET_CPC () != error_mark_node;
4231 if (GET_CPC () != error_mark_node)
4232 dump_java_tree (TDI_class, GET_CPC ());
4234 java_parser_context_pop_initialized_field ();
4236 if (resume && no_error_occurred)
4237 java_parser_context_resume ();
4239 /* We're ending a class declaration, this is a good time to reset
4240 the interface cout. Note that might have been already done in
4241 create_interface, but if at that time an inner class was being
4242 dealt with, the interface count was reset in a context created
4243 for the sake of handling inner classes declaration. */
4244 ctxp->interface_number = 0;
4248 add_inner_class_fields (tree class_decl, tree fct_decl)
4250 tree block, marker, f;
4252 f = add_field (TREE_TYPE (class_decl),
4253 build_current_thisn (TREE_TYPE (class_decl)),
4254 build_pointer_type (TREE_TYPE (DECL_CONTEXT (class_decl))),
4256 FIELD_THISN (f) = 1;
4261 for (block = GET_CURRENT_BLOCK (fct_decl);
4262 block && TREE_CODE (block) == BLOCK; block = BLOCK_SUPERCONTEXT (block))
4265 for (decl = BLOCK_EXPR_DECLS (block); decl; decl = TREE_CHAIN (decl))
4268 tree wfl, init, list;
4270 /* Avoid non final arguments. */
4271 if (!LOCAL_FINAL_P (decl))
4274 MANGLE_OUTER_LOCAL_VARIABLE_NAME (name, DECL_NAME (decl));
4275 MANGLE_ALIAS_INITIALIZER_PARAMETER_NAME_ID (pname, DECL_NAME (decl));
4276 wfl = build_wfl_node (name);
4277 init = build_wfl_node (pname);
4278 /* Build an initialization for the field: it will be
4279 initialized by a parameter added to finit$, bearing a
4280 mangled name of the field itself (param$<n>.) The
4281 parameter is provided to finit$ by the constructor
4282 invoking it (hence the constructor will also feature a
4283 hidden parameter, set to the value of the outer context
4284 local at the time the inner class is created.)
4286 Note: we take into account all possible locals that can
4287 be accessed by the inner class. It's actually not trivial
4288 to minimize these aliases down to the ones really
4289 used. One way to do that would be to expand all regular
4290 methods first, then finit$ to get a picture of what's
4291 used. It works with the exception that we would have to
4292 go back on all constructor invoked in regular methods to
4293 have their invocation reworked (to include the right amount
4294 of alias initializer parameters.)
4296 The only real way around, I think, is a first pass to
4297 identify locals really used in the inner class. We leave
4298 the flag FIELD_LOCAL_ALIAS_USED around for that future
4301 On the other hand, it only affect local inner classes,
4302 whose constructors (and finit$ call) will be featuring
4303 unnecessary arguments. It's easy for a developer to keep
4304 this number of parameter down by using the `final'
4305 keyword only when necessary. For the time being, we can
4306 issue a warning on unnecessary finals. FIXME */
4307 init = build_assignment (ASSIGN_TK, EXPR_WFL_LINECOL (wfl),
4310 /* Register the field. The TREE_LIST holding the part
4311 initialized/initializer will be marked ARG_FINAL_P so
4312 that the created field can be marked
4313 FIELD_LOCAL_ALIAS. */
4314 list = build_tree_list (wfl, init);
4315 ARG_FINAL_P (list) = 1;
4316 register_fields (ACC_PRIVATE | ACC_FINAL, TREE_TYPE (decl), list);
4320 if (!CPC_INITIALIZER_STMT (ctxp))
4323 /* If we ever registered an alias field, insert and marker to
4324 remember where the list ends. The second part of the list (the one
4325 featuring initialized fields) so it can be later reversed to
4326 enforce 8.5. The marker will be removed during that operation. */
4327 marker = build_tree_list (NULL_TREE, NULL_TREE);
4328 TREE_CHAIN (marker) = CPC_INITIALIZER_STMT (ctxp);
4329 SET_CPC_INITIALIZER_STMT (ctxp, marker);
4332 /* Can't use lookup_field () since we don't want to load the class and
4333 can't set the CLASS_LOADED_P flag */
4336 find_field (tree class, tree name)
4339 for (decl = TYPE_FIELDS (class); decl; decl = TREE_CHAIN (decl))
4341 if (DECL_NAME (decl) == name)
4347 /* Wrap around lookup_field that doesn't potentially upset the value
4351 lookup_field_wrapper (tree class, tree name)
4354 tree decl = NULL_TREE;
4355 java_parser_context_save_global ();
4357 /* Last chance: if we're within the context of an inner class, we
4358 might be trying to access a local variable defined in an outer
4359 context. We try to look for it now. */
4360 if (INNER_CLASS_TYPE_P (class) && TREE_CODE (name) == IDENTIFIER_NODE)
4363 MANGLE_OUTER_LOCAL_VARIABLE_NAME (new_name, name);
4364 decl = lookup_field (&type, new_name);
4365 if (decl && decl != error_mark_node)
4366 FIELD_LOCAL_ALIAS_USED (decl) = 1;
4368 if (!decl || decl == error_mark_node)
4371 decl = lookup_field (&type, name);
4374 /* If the field still hasn't been found, try the next enclosing context. */
4375 if (!decl && INNER_CLASS_TYPE_P (class))
4377 tree outer_type = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (class)));
4378 decl = lookup_field_wrapper (outer_type, name);
4381 java_parser_context_restore_global ();
4382 return decl == error_mark_node ? NULL : decl;
4385 /* Find duplicate field within the same class declarations and report
4386 the error. Returns 1 if a duplicated field was found, 0
4390 duplicate_declaration_error_p (tree new_field_name, tree new_type, tree cl)
4392 /* This might be modified to work with method decl as well */
4393 tree decl = find_field (TREE_TYPE (GET_CPC ()), new_field_name);
4396 char *t1 = xstrdup (purify_type_name
4397 ((TREE_CODE (new_type) == POINTER_TYPE
4398 && TREE_TYPE (new_type) == NULL_TREE) ?
4399 IDENTIFIER_POINTER (TYPE_NAME (new_type)) :
4400 lang_printable_name (new_type, 1)));
4401 /* The type may not have been completed by the time we report
4403 char *t2 = xstrdup (purify_type_name
4404 ((TREE_CODE (TREE_TYPE (decl)) == POINTER_TYPE
4405 && TREE_TYPE (TREE_TYPE (decl)) == NULL_TREE) ?
4406 IDENTIFIER_POINTER (TYPE_NAME (TREE_TYPE (decl))) :
4407 lang_printable_name (TREE_TYPE (decl), 1)));
4409 (cl , "Duplicate variable declaration: `%s %s' was `%s %s' (%s:%d)",
4410 t1, IDENTIFIER_POINTER (new_field_name),
4411 t2, IDENTIFIER_POINTER (DECL_NAME (decl)),
4412 DECL_SOURCE_FILE (decl), DECL_SOURCE_LINE (decl));
4420 /* Field registration routine. If TYPE doesn't exist, field
4421 declarations are linked to the undefined TYPE dependency list, to
4422 be later resolved in java_complete_class () */
4425 register_fields (int flags, tree type, tree variable_list)
4427 tree current, saved_type;
4428 tree class_type = NULL_TREE;
4429 location_t saved_location = input_location;
4431 tree wfl = NULL_TREE;
4434 class_type = TREE_TYPE (GET_CPC ());
4436 if (!class_type || class_type == error_mark_node)
4439 /* If we're adding fields to interfaces, those fields are public,
4441 if (CLASS_INTERFACE (TYPE_NAME (class_type)))
4443 OBSOLETE_MODIFIER_WARNING (MODIFIER_WFL (PUBLIC_TK),
4444 flags, ACC_PUBLIC, "interface field(s)");
4445 OBSOLETE_MODIFIER_WARNING (MODIFIER_WFL (STATIC_TK),
4446 flags, ACC_STATIC, "interface field(s)");
4447 OBSOLETE_MODIFIER_WARNING (MODIFIER_WFL (FINAL_TK),
4448 flags, ACC_FINAL, "interface field(s)");
4449 check_modifiers ("Illegal interface member modifier `%s'", flags,
4450 INTERFACE_FIELD_MODIFIERS);
4451 flags |= (ACC_PUBLIC | ACC_STATIC | ACC_FINAL);
4454 /* Obtain a suitable type for resolution, if necessary */
4455 SET_TYPE_FOR_RESOLUTION (type, wfl, must_chain);
4457 /* If TYPE is fully resolved and we don't have a reference, make one */
4458 PROMOTE_RECORD_IF_COMPLETE (type, must_chain);
4460 for (current = variable_list, saved_type = type; current;
4461 current = TREE_CHAIN (current), type = saved_type)
4465 tree cl = TREE_PURPOSE (current);
4466 tree init = TREE_VALUE (current);
4467 tree current_name = EXPR_WFL_NODE (cl);
4469 /* Can't declare non-final static fields in inner classes */
4470 if ((flags & ACC_STATIC) && !TOPLEVEL_CLASS_TYPE_P (class_type)
4471 && !(flags & ACC_FINAL))
4473 (cl, "Field `%s' can't be static in inner class `%s' unless it is final",
4474 IDENTIFIER_POINTER (EXPR_WFL_NODE (cl)),
4475 lang_printable_name (class_type, 0));
4477 /* Process NAME, as it may specify extra dimension(s) for it */
4478 type = build_array_from_name (type, wfl, current_name, ¤t_name);
4480 /* Type adjustment. We may have just readjusted TYPE because
4481 the variable specified more dimensions. Make sure we have
4482 a reference if we can and don't have one already. Also
4483 change the name if we have an init. */
4484 if (type != saved_type)
4486 PROMOTE_RECORD_IF_COMPLETE (type, must_chain);
4488 EXPR_WFL_NODE (TREE_OPERAND (init, 0)) = current_name;
4491 real_type = GET_REAL_TYPE (type);
4492 /* Check for redeclarations */
4493 if (duplicate_declaration_error_p (current_name, real_type, cl))
4496 /* Set input_line to the line the field was found and create a
4497 declaration for it. Eventually sets the @deprecated tag flag. */
4498 #ifdef USE_MAPPED_LOCATION
4499 input_location = EXPR_LOCATION (cl);
4502 input_line = EXPR_WFL_LINECOL (cl);
4504 input_line = EXPR_WFL_LINENO (cl);
4506 field_decl = add_field (class_type, current_name, real_type, flags);
4507 CHECK_DEPRECATED_NO_RESET (field_decl);
4509 /* If the field denotes a final instance variable, then we
4510 allocate a LANG_DECL_SPECIFIC part to keep track of its
4511 initialization. We also mark whether the field was
4512 initialized upon its declaration. We don't do that if the
4513 created field is an alias to a final local. */
4514 if (!ARG_FINAL_P (current) && (flags & ACC_FINAL))
4516 MAYBE_CREATE_VAR_LANG_DECL_SPECIFIC (field_decl);
4517 DECL_FIELD_FINAL_WFL (field_decl) = cl;
4520 /* If the couple initializer/initialized is marked ARG_FINAL_P,
4521 we mark the created field FIELD_LOCAL_ALIAS, so that we can
4522 hide parameters to this inner class finit$ and
4523 constructors. It also means that the field isn't final per
4525 if (ARG_FINAL_P (current))
4527 FIELD_LOCAL_ALIAS (field_decl) = 1;
4528 FIELD_FINAL (field_decl) = 0;
4531 /* Check if we must chain. */
4533 register_incomplete_type (JDEP_FIELD, wfl, field_decl, type);
4535 /* If we have an initialization value tied to the field */
4538 /* The field is declared static */
4539 if (flags & ACC_STATIC)
4541 /* We include the field and its initialization part into
4542 a list used to generate <clinit>. After <clinit> is
4543 walked, field initializations will be processed and
4544 fields initialized with known constants will be taken
4545 out of <clinit> and have their DECL_INITIAL set
4547 TREE_CHAIN (init) = CPC_STATIC_INITIALIZER_STMT (ctxp);
4548 SET_CPC_STATIC_INITIALIZER_STMT (ctxp, init);
4549 if (TREE_OPERAND (init, 1)
4550 && TREE_CODE (TREE_OPERAND (init, 1)) == NEW_ARRAY_INIT)
4551 TREE_STATIC (TREE_OPERAND (init, 1)) = 1;
4553 /* A non-static field declared with an immediate initialization is
4554 to be initialized in <init>, if any. This field is remembered
4555 to be processed at the time of the generation of <init>. */
4558 TREE_CHAIN (init) = CPC_INITIALIZER_STMT (ctxp);
4559 SET_CPC_INITIALIZER_STMT (ctxp, init);
4561 MODIFY_EXPR_FROM_INITIALIZATION_P (init) = 1;
4562 DECL_INITIAL (field_decl) = TREE_OPERAND (init, 1);
4567 input_location = saved_location;
4570 /* Generate finit$, using the list of initialized fields to populate
4571 its body. finit$'s parameter(s) list is adjusted to include the
4572 one(s) used to initialized the field(s) caching outer context
4576 generate_finit (tree class_type)
4579 tree list = TYPE_FINIT_STMT_LIST (class_type);
4580 tree mdecl, current, parms;
4582 parms = build_alias_initializer_parameter_list (AIPL_FUNCTION_CREATION,
4583 class_type, NULL_TREE,
4585 CRAFTED_PARAM_LIST_FIXUP (parms);
4586 mdecl = create_artificial_method (class_type, ACC_PRIVATE, void_type_node,
4587 finit_identifier_node, parms);
4588 fix_method_argument_names (parms, mdecl);
4589 layout_class_method (class_type, CLASSTYPE_SUPER (class_type),
4591 DECL_FUNCTION_NAP (mdecl) = count;
4592 start_artificial_method_body (mdecl);
4594 for (current = list; current; current = TREE_CHAIN (current))
4595 java_method_add_stmt (mdecl,
4596 build_debugable_stmt (EXPR_WFL_LINECOL (current),
4598 end_artificial_method_body (mdecl);
4602 /* Generate a function to run the instance initialization code. The
4603 private method is called `instinit$'. Unless we're dealing with an
4604 anonymous class, we determine whether all ctors of CLASS_TYPE
4605 declare a checked exception in their `throws' clause in order to
4606 see whether it's necessary to encapsulate the instance initializer
4607 statements in a try/catch/rethrow sequence. */
4610 generate_instinit (tree class_type)
4613 tree compound = NULL_TREE;
4614 tree parms = tree_cons (this_identifier_node,
4615 build_pointer_type (class_type), end_params_node);
4616 tree mdecl = create_artificial_method (class_type, ACC_PRIVATE,
4618 instinit_identifier_node, parms);
4620 layout_class_method (class_type, CLASSTYPE_SUPER (class_type),
4623 /* Gather all the statements in a compound */
4624 for (current = TYPE_II_STMT_LIST (class_type);
4625 current; current = TREE_CHAIN (current))
4626 compound = add_stmt_to_compound (compound, NULL_TREE, current);
4628 /* We need to encapsulate COMPOUND by a try/catch statement to
4629 rethrow exceptions that might occur in the instance initializer.
4630 We do that only if all ctors of CLASS_TYPE are set to catch a
4631 checked exception. This doesn't apply to anonymous classes (since
4632 they don't have declared ctors.) */
4633 if (!ANONYMOUS_CLASS_P (class_type) &&
4634 ctors_unchecked_throws_clause_p (class_type))
4636 compound = encapsulate_with_try_catch (0, exception_type_node, compound,
4637 build1 (THROW_EXPR, NULL_TREE,
4638 build_wfl_node (wpv_id)));
4639 DECL_FUNCTION_THROWS (mdecl) = build_tree_list (NULL_TREE,
4640 exception_type_node);
4643 start_artificial_method_body (mdecl);
4644 java_method_add_stmt (mdecl, compound);
4645 end_artificial_method_body (mdecl);
4652 build_instinit_invocation (tree class_type)
4654 tree to_return = NULL_TREE;
4656 if (TYPE_II_STMT_LIST (class_type))
4658 tree parm = build_tree_list (NULL_TREE,
4659 build_wfl_node (this_identifier_node));
4661 build_method_invocation (build_wfl_node (instinit_identifier_node),
4667 /* Shared across method_declarator and method_header to remember the
4668 patch stage that was reached during the declaration of the method.
4669 A method DECL is built differently is there is no patch
4670 (JDEP_NO_PATCH) or a patch (JDEP_METHOD or JDEP_METHOD_RETURN)
4671 pending on the currently defined method. */
4673 static int patch_stage;
4675 /* Check the method declaration and add the method to its current
4676 class. If the argument list is known to contain incomplete types,
4677 the method is partially added and the registration will be resume
4678 once the method arguments resolved. If TYPE is NULL, we're dealing
4679 with a constructor. */
4682 method_header (int flags, tree type, tree mdecl, tree throws)
4684 tree type_wfl = NULL_TREE;
4685 tree meth_name = NULL_TREE;
4686 tree current, orig_arg, this_class = NULL;
4688 location_t saved_location;
4689 int constructor_ok = 0, must_chain;
4692 if (mdecl == error_mark_node)
4693 return error_mark_node;
4694 meth = TREE_VALUE (mdecl);
4695 id = TREE_PURPOSE (mdecl);
4697 check_modifiers_consistency (flags);
4700 this_class = TREE_TYPE (GET_CPC ());
4702 if (!this_class || this_class == error_mark_node)
4705 /* There are some forbidden modifiers for an abstract method and its
4706 class must be abstract as well. */
4707 if (type && (flags & ACC_ABSTRACT))
4709 ABSTRACT_CHECK (flags, ACC_PRIVATE, id, "Private");
4710 ABSTRACT_CHECK (flags, ACC_STATIC, id, "Static");
4711 ABSTRACT_CHECK (flags, ACC_FINAL, id, "Final");
4712 ABSTRACT_CHECK (flags, ACC_NATIVE, id, "Native");
4713 ABSTRACT_CHECK (flags, ACC_SYNCHRONIZED, id, "Synchronized");
4714 ABSTRACT_CHECK (flags, ACC_STRICT, id, "Strictfp");
4715 if (!CLASS_ABSTRACT (TYPE_NAME (this_class))
4716 && !CLASS_INTERFACE (TYPE_NAME (this_class)))
4718 (id, "Class `%s' must be declared abstract to define abstract method `%s'",
4719 IDENTIFIER_POINTER (DECL_NAME (GET_CPC ())),
4720 IDENTIFIER_POINTER (EXPR_WFL_NODE (id)));
4723 /* A native method can't be strictfp. */
4724 if ((flags & ACC_NATIVE) && (flags & ACC_STRICT))
4725 parse_error_context (id, "native method `%s' can't be strictfp",
4726 IDENTIFIER_POINTER (EXPR_WFL_NODE (id)));
4727 /* No such thing as a transient or volatile method. */
4728 if ((flags & ACC_TRANSIENT))
4729 parse_error_context (id, "method `%s' can't be transient",
4730 IDENTIFIER_POINTER (EXPR_WFL_NODE (id)));
4731 if ((flags & ACC_VOLATILE))
4732 parse_error_context (id, "method `%s' can't be volatile",
4733 IDENTIFIER_POINTER (EXPR_WFL_NODE (id)));
4735 /* Things to be checked when declaring a constructor */
4738 int ec = java_error_count;
4739 /* 8.6: Constructor declarations: we might be trying to define a
4740 method without specifying a return type. */
4741 if (EXPR_WFL_NODE (id) != GET_CPC_UN ())
4743 (id, "Invalid method declaration, return type required");
4744 /* 8.6.3: Constructor modifiers */
4747 JCONSTRUCTOR_CHECK (flags, ACC_ABSTRACT, id, "abstract");
4748 JCONSTRUCTOR_CHECK (flags, ACC_STATIC, id, "static");
4749 JCONSTRUCTOR_CHECK (flags, ACC_FINAL, id, "final");
4750 JCONSTRUCTOR_CHECK (flags, ACC_NATIVE, id, "native");
4751 JCONSTRUCTOR_CHECK (flags, ACC_SYNCHRONIZED, id, "synchronized");
4752 JCONSTRUCTOR_CHECK (flags, ACC_STRICT, id, "strictfp");
4754 /* If we found error here, we don't consider it's OK to tread
4755 the method definition as a constructor, for the rest of this
4757 if (ec == java_error_count)
4761 /* Method declared within the scope of an interface are implicitly
4762 abstract and public. Conflicts with other erroneously provided
4763 modifiers are checked right after. */
4765 if (CLASS_INTERFACE (TYPE_NAME (this_class)))
4767 /* If FLAGS isn't set because of a modifier, turn the
4768 corresponding modifier WFL to NULL so we issue a warning on
4769 the obsolete use of the modifier */
4770 if (!(flags & ACC_PUBLIC))
4771 MODIFIER_WFL (PUBLIC_TK) = NULL;
4772 if (!(flags & ACC_ABSTRACT))
4773 MODIFIER_WFL (ABSTRACT_TK) = NULL;
4774 flags |= ACC_PUBLIC;
4775 flags |= ACC_ABSTRACT;
4778 /* Inner class can't declare static methods */
4779 if ((flags & ACC_STATIC) && !TOPLEVEL_CLASS_TYPE_P (this_class))
4782 (id, "Method `%s' can't be static in inner class `%s'. Only members of interfaces and top-level classes can be static",
4783 IDENTIFIER_POINTER (EXPR_WFL_NODE (id)),
4784 lang_printable_name (this_class, 0));
4787 /* Modifiers context reset moved up, so abstract method declaration
4788 modifiers can be later checked. */
4790 /* Set constructor returned type to void and method name to <init>,
4791 unless we found an error identifier the constructor (in which
4792 case we retain the original name) */
4795 type = void_type_node;
4797 meth_name = init_identifier_node;
4800 meth_name = EXPR_WFL_NODE (id);
4802 /* Do the returned type resolution and registration if necessary */
4803 SET_TYPE_FOR_RESOLUTION (type, type_wfl, must_chain);
4806 type = build_array_from_name (type, type_wfl, meth_name, &meth_name);
4807 EXPR_WFL_NODE (id) = meth_name;
4808 PROMOTE_RECORD_IF_COMPLETE (type, must_chain);
4812 patch_stage = JDEP_METHOD_RETURN;
4813 register_incomplete_type (patch_stage, type_wfl, id, type);
4814 TREE_TYPE (meth) = GET_REAL_TYPE (type);
4817 TREE_TYPE (meth) = type;
4819 saved_location = input_location;
4820 /* When defining an abstract or interface method, the curly
4821 bracket at level 1 doesn't exist because there is no function
4823 #ifdef USE_MAPPED_LOCATION
4824 input_location = (ctxp->first_ccb_indent1 ? ctxp->first_ccb_indent1 :
4825 EXPR_LOCATION (id));
4827 input_line = (ctxp->first_ccb_indent1 ? (int) ctxp->first_ccb_indent1 :
4828 EXPR_WFL_LINENO (id));
4831 /* Remember the original argument list */
4832 orig_arg = TYPE_ARG_TYPES (meth);
4834 if (patch_stage) /* includes ret type and/or all args */
4837 meth = add_method_1 (this_class, flags, meth_name, meth);
4838 /* Patch for the return type */
4839 if (patch_stage == JDEP_METHOD_RETURN)
4841 jdep = CLASSD_LAST (ctxp->classd_list);
4842 JDEP_GET_PATCH (jdep) = &TREE_TYPE (TREE_TYPE (meth));
4844 /* This is the stop JDEP. METH allows the function's signature
4846 register_incomplete_type (JDEP_METHOD_END, NULL_TREE, meth, NULL_TREE);
4849 meth = add_method (this_class, flags, meth_name,
4850 build_java_signature (meth));
4852 /* Remember final parameters */
4853 MARK_FINAL_PARMS (meth, orig_arg);
4855 /* Fix the method argument list so we have the argument name
4857 fix_method_argument_names (orig_arg, meth);
4859 /* Register the parameter number and re-install the current line
4861 DECL_MAX_LOCALS (meth) = ctxp->formal_parameter_number+1;
4862 input_location = saved_location;
4864 /* Register exception specified by the `throws' keyword for
4865 resolution and set the method decl appropriate field to the list.
4866 Note: the grammar ensures that what we get here are class
4870 throws = nreverse (throws);
4871 for (current = throws; current; current = TREE_CHAIN (current))
4873 register_incomplete_type (JDEP_EXCEPTION, TREE_VALUE (current),
4874 NULL_TREE, NULL_TREE);
4875 JDEP_GET_PATCH (CLASSD_LAST (ctxp->classd_list)) =
4876 &TREE_VALUE (current);
4878 DECL_FUNCTION_THROWS (meth) = throws;
4881 if (TREE_TYPE (GET_CPC ()) != object_type_node)
4882 DECL_FUNCTION_WFL (meth) = id;
4884 /* Set the flag if we correctly processed a constructor */
4887 DECL_CONSTRUCTOR_P (meth) = 1;
4888 /* Compute and store the number of artificial parameters declared
4889 for this constructor */
4890 for (count = 0, current = TYPE_FIELDS (this_class); current;
4891 current = TREE_CHAIN (current))
4892 if (FIELD_LOCAL_ALIAS (current))
4894 DECL_FUNCTION_NAP (meth) = count;
4897 /* Eventually set the @deprecated tag flag */
4898 CHECK_DEPRECATED (meth);
4900 /* If doing xref, store column and line number information instead
4901 of the line number only. */
4904 #ifdef USE_MAPPED_LOCATION
4905 DECL_SOURCE_LOCATION (meth) = EXPR_LOCATION (id);
4907 DECL_SOURCE_LINE (meth) = EXPR_WFL_LINECOL (id);
4915 fix_method_argument_names (tree orig_arg, tree meth)
4917 tree arg = TYPE_ARG_TYPES (TREE_TYPE (meth));
4918 if (TREE_CODE (TREE_TYPE (meth)) == METHOD_TYPE)
4920 TREE_PURPOSE (arg) = this_identifier_node;
4921 arg = TREE_CHAIN (arg);
4923 while (orig_arg != end_params_node)
4925 TREE_PURPOSE (arg) = TREE_PURPOSE (orig_arg);
4926 orig_arg = TREE_CHAIN (orig_arg);
4927 arg = TREE_CHAIN (arg);
4931 /* Complete the method declaration with METHOD_BODY. */
4934 finish_method_declaration (tree method_body)
4938 if (!current_function_decl)
4941 flags = get_access_flags_from_decl (current_function_decl);
4943 /* 8.4.5 Method Body */
4944 if ((flags & ACC_ABSTRACT || flags & ACC_NATIVE) && method_body)
4946 tree name = DECL_NAME (current_function_decl);
4947 parse_error_context (DECL_FUNCTION_WFL (current_function_decl),
4948 "%s method `%s' can't have a body defined",
4949 (METHOD_NATIVE (current_function_decl) ?
4950 "Native" : "Abstract"),
4951 IDENTIFIER_POINTER (name));
4952 method_body = NULL_TREE;
4954 else if (!(flags & ACC_ABSTRACT) && !(flags & ACC_NATIVE) && !method_body)
4956 tree name = DECL_NAME (current_function_decl);
4958 (DECL_FUNCTION_WFL (current_function_decl),
4959 "Non native and non abstract method `%s' must have a body defined",
4960 IDENTIFIER_POINTER (name));
4961 method_body = NULL_TREE;
4964 if (flag_emit_class_files && method_body
4965 && TREE_CODE (method_body) == NOP_EXPR
4966 && TREE_TYPE (current_function_decl)
4967 && TREE_TYPE (TREE_TYPE (current_function_decl)) == void_type_node)
4968 method_body = build1 (RETURN_EXPR, void_type_node, NULL);
4970 BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (current_function_decl)) = method_body;
4971 maybe_absorb_scoping_blocks ();
4972 /* Exit function's body */
4974 /* Merge last line of the function with first line, directly in the
4975 function decl. It will be used to emit correct debug info. */
4976 if (!flag_emit_xref)
4977 DECL_FUNCTION_LAST_LINE (current_function_decl) = ctxp->last_ccb_indent1;
4979 /* Since function's argument's list are shared, reset the
4980 ARG_FINAL_P parameter that might have been set on some of this
4981 function parameters. */
4982 UNMARK_FINAL_PARMS (current_function_decl);
4984 /* So we don't have an irrelevant function declaration context for
4985 the next static block we'll see. */
4986 current_function_decl = NULL_TREE;
4989 /* Build a an error message for constructor circularity errors. */
4992 constructor_circularity_msg (tree from, tree to)
4994 static char string [4096];
4995 char *t = xstrdup (lang_printable_name (from, 2));
4996 sprintf (string, "`%s' invokes `%s'", t, lang_printable_name (to, 2));
5001 /* Verify a circular call to METH. Return 1 if an error is found, 0
5004 static GTY(()) tree vcc_list;
5006 verify_constructor_circularity (tree meth, tree current)
5010 for (c = DECL_CONSTRUCTOR_CALLS (current); c; c = TREE_CHAIN (c))
5012 if (TREE_VALUE (c) == meth)
5018 vcc_list = nreverse (vcc_list);
5019 for (liste = vcc_list; liste; liste = TREE_CHAIN (liste))
5022 (TREE_PURPOSE (TREE_PURPOSE (liste)), "%s",
5023 constructor_circularity_msg
5024 (TREE_VALUE (liste), TREE_VALUE (TREE_PURPOSE (liste))));
5028 t = xstrdup (lang_printable_name (meth, 2));
5029 parse_error_context (TREE_PURPOSE (c),
5030 "%s: recursive invocation of constructor `%s'",
5031 constructor_circularity_msg (current, meth), t);
5033 vcc_list = NULL_TREE;
5037 for (c = DECL_CONSTRUCTOR_CALLS (current); c; c = TREE_CHAIN (c))
5039 vcc_list = tree_cons (c, current, vcc_list);
5040 if (verify_constructor_circularity (meth, TREE_VALUE (c)))
5042 vcc_list = TREE_CHAIN (vcc_list);
5047 /* Check modifiers that can be declared but exclusively */
5050 check_modifiers_consistency (int flags)
5053 tree cl = NULL_TREE;
5055 THIS_MODIFIER_ONLY (flags, ACC_PUBLIC, PUBLIC_TK, acc_count, cl);
5056 THIS_MODIFIER_ONLY (flags, ACC_PRIVATE, PRIVATE_TK, acc_count, cl);
5057 THIS_MODIFIER_ONLY (flags, ACC_PROTECTED, PROTECTED_TK, acc_count, cl);
5060 (cl, "Inconsistent member declaration. At most one of `public', `private', or `protected' may be specified");
5064 THIS_MODIFIER_ONLY (flags, ACC_FINAL, FINAL_TK, acc_count, cl);
5065 THIS_MODIFIER_ONLY (flags, ACC_VOLATILE, VOLATILE_TK, acc_count, cl);
5067 parse_error_context (cl,
5068 "Inconsistent member declaration. At most one of `final' or `volatile' may be specified");
5071 /* Check the methode header METH for abstract specifics features */
5074 check_abstract_method_header (tree meth)
5076 int flags = get_access_flags_from_decl (meth);
5078 OBSOLETE_MODIFIER_WARNING2 (MODIFIER_WFL (ABSTRACT_TK), flags,
5079 ACC_ABSTRACT, "abstract method",
5080 IDENTIFIER_POINTER (DECL_NAME (meth)));
5081 OBSOLETE_MODIFIER_WARNING2 (MODIFIER_WFL (PUBLIC_TK), flags,
5082 ACC_PUBLIC, "abstract method",
5083 IDENTIFIER_POINTER (DECL_NAME (meth)));
5085 check_modifiers ("Illegal modifier `%s' for interface method",
5086 flags, INTERFACE_METHOD_MODIFIERS);
5089 /* Create a FUNCTION_TYPE node and start augmenting it with the
5090 declared function arguments. Arguments type that can't be resolved
5091 are left as they are, but the returned node is marked as containing
5092 incomplete types. */
5095 method_declarator (tree id, tree list)
5097 tree arg_types = NULL_TREE, current, node;
5098 tree meth = make_node (FUNCTION_TYPE);
5101 patch_stage = JDEP_NO_PATCH;
5103 if (GET_CPC () == error_mark_node)
5104 return error_mark_node;
5106 /* If we're dealing with an inner class constructor, we hide the
5107 this$<n> decl in the name field of its parameter declaration. We
5108 also might have to hide the outer context local alias
5109 initializers. Not done when the class is a toplevel class. */
5110 if (PURE_INNER_CLASS_DECL_P (GET_CPC ())
5111 && EXPR_WFL_NODE (id) == GET_CPC_UN ())
5113 tree aliases_list, type, thisn;
5114 /* First the aliases, linked to the regular parameters */
5116 build_alias_initializer_parameter_list (AIPL_FUNCTION_DECLARATION,
5117 TREE_TYPE (GET_CPC ()),
5119 list = chainon (nreverse (aliases_list), list);
5122 type = TREE_TYPE (DECL_CONTEXT (GET_CPC ()));
5123 thisn = build_current_thisn (TREE_TYPE (GET_CPC ()));
5124 list = tree_cons (build_wfl_node (thisn), build_pointer_type (type),
5128 for (current = list; current; current = TREE_CHAIN (current))
5131 tree wfl_name = TREE_PURPOSE (current);
5132 tree type = TREE_VALUE (current);
5133 tree name = EXPR_WFL_NODE (wfl_name);
5134 tree already, arg_node;
5135 tree type_wfl = NULL_TREE;
5138 /* Obtain a suitable type for resolution, if necessary */
5139 SET_TYPE_FOR_RESOLUTION (type, type_wfl, must_chain);
5141 /* Process NAME, as it may specify extra dimension(s) for it */
5142 type = build_array_from_name (type, type_wfl, name, &name);
5143 EXPR_WFL_NODE (wfl_name) = name;
5145 real_type = GET_REAL_TYPE (type);
5146 if (TREE_CODE (real_type) == RECORD_TYPE)
5148 real_type = promote_type (real_type);
5149 if (TREE_CODE (type) == TREE_LIST)
5150 TREE_PURPOSE (type) = real_type;
5153 /* Check redefinition */
5154 for (already = arg_types; already; already = TREE_CHAIN (already))
5155 if (TREE_PURPOSE (already) == name)
5158 (wfl_name, "Variable `%s' is used more than once in the argument list of method `%s'",
5159 IDENTIFIER_POINTER (name),
5160 IDENTIFIER_POINTER (EXPR_WFL_NODE (id)));
5164 /* If we've an incomplete argument type, we know there is a location
5165 to patch when the type get resolved, later. */
5169 patch_stage = JDEP_METHOD;
5170 type = register_incomplete_type (patch_stage,
5171 type_wfl, wfl_name, type);
5172 jdep = CLASSD_LAST (ctxp->classd_list);
5173 JDEP_MISC (jdep) = id;
5176 /* The argument node: a name and a (possibly) incomplete type. */
5177 arg_node = build_tree_list (name, real_type);
5178 /* Remember arguments declared final. */
5179 ARG_FINAL_P (arg_node) = ARG_FINAL_P (current);
5182 JDEP_GET_PATCH (jdep) = &TREE_VALUE (arg_node);
5183 TREE_CHAIN (arg_node) = arg_types;
5184 arg_types = arg_node;
5186 TYPE_ARG_TYPES (meth) = chainon (nreverse (arg_types), end_params_node);
5187 node = build_tree_list (id, meth);
5192 unresolved_type_p (tree wfl, tree *returned)
5194 if (TREE_CODE (wfl) == EXPR_WITH_FILE_LOCATION)
5198 tree decl = IDENTIFIER_CLASS_VALUE (EXPR_WFL_NODE (wfl));
5199 if (decl && current_class && (decl == TYPE_NAME (current_class)))
5200 *returned = TREE_TYPE (decl);
5201 else if (GET_CPC_UN () == EXPR_WFL_NODE (wfl))
5202 *returned = TREE_TYPE (GET_CPC ());
5204 *returned = NULL_TREE;
5213 /* From NAME, build a qualified identifier node using the
5214 qualification from the current package definition. */
5217 parser_qualified_classname (tree name)
5219 tree nested_class_name;
5221 if ((nested_class_name = maybe_make_nested_class_name (name)))
5222 return nested_class_name;
5225 return merge_qualified_name (ctxp->package, name);
5230 /* Called once the type a interface extends is resolved. Returns 0 if
5231 everything is OK. */
5234 parser_check_super_interface (tree super_decl, tree this_decl, tree this_wfl)
5236 tree super_type = TREE_TYPE (super_decl);
5238 /* Has to be an interface */
5239 if (!CLASS_INTERFACE (super_decl))
5242 (this_wfl, "%s `%s' can't implement/extend %s `%s'",
5243 (CLASS_INTERFACE (TYPE_NAME (TREE_TYPE (this_decl))) ?
5244 "Interface" : "Class"),
5245 IDENTIFIER_POINTER (DECL_NAME (this_decl)),
5246 (TYPE_ARRAY_P (super_type) ? "array" : "class"),
5247 IDENTIFIER_POINTER (DECL_NAME (super_decl)));
5251 /* Check top-level interface access. Inner classes are subject to member
5252 access rules (6.6.1). */
5253 if (! INNER_CLASS_P (super_type)
5254 && check_pkg_class_access (DECL_NAME (super_decl),
5255 NULL_TREE, true, this_decl))
5258 SOURCE_FRONTEND_DEBUG (("Completing interface %s with %s",
5259 IDENTIFIER_POINTER (DECL_NAME (this_decl)),
5260 IDENTIFIER_POINTER (DECL_NAME (super_decl))));
5264 /* Makes sure that SUPER_DECL is suitable to extend THIS_DECL. Returns
5265 0 if everything is OK. */
5268 parser_check_super (tree super_decl, tree this_decl, tree wfl)
5270 tree super_type = TREE_TYPE (super_decl);
5272 /* SUPER should be a CLASS (neither an array nor an interface) */
5273 if (TYPE_ARRAY_P (super_type) || CLASS_INTERFACE (TYPE_NAME (super_type)))
5276 (wfl, "Class `%s' can't subclass %s `%s'",
5277 IDENTIFIER_POINTER (DECL_NAME (this_decl)),
5278 (CLASS_INTERFACE (TYPE_NAME (super_type)) ? "interface" : "array"),
5279 IDENTIFIER_POINTER (DECL_NAME (super_decl)));
5283 if (CLASS_FINAL (TYPE_NAME (super_type)))
5285 parse_error_context (wfl, "Can't subclass final classes: %s",
5286 IDENTIFIER_POINTER (DECL_NAME (super_decl)));
5290 /* Check top-level class scope. Inner classes are subject to member access
5292 if (! INNER_CLASS_P (super_type)
5293 && (check_pkg_class_access (DECL_NAME (super_decl), wfl, true, NULL_TREE)))
5296 SOURCE_FRONTEND_DEBUG (("Completing class %s with %s",
5297 IDENTIFIER_POINTER (DECL_NAME (this_decl)),
5298 IDENTIFIER_POINTER (DECL_NAME (super_decl))));
5302 /* Create a new dependency list and link it (in a LIFO manner) to the
5303 CTXP list of type dependency list. */
5306 create_jdep_list (struct parser_ctxt *ctxp)
5308 jdeplist *new = xmalloc (sizeof (jdeplist));
5309 new->first = new->last = NULL;
5310 new->next = ctxp->classd_list;
5311 ctxp->classd_list = new;
5315 reverse_jdep_list (struct parser_ctxt *ctxp)
5317 jdeplist *prev = NULL, *current, *next;
5318 for (current = ctxp->classd_list; current; current = next)
5320 next = current->next;
5321 current->next = prev;
5327 /* Create a fake pointer based on the ID stored in
5328 TYPE_NAME. TYPE_NAME can be a WFL or a incomplete type asking to be
5329 registered again. */
5332 obtain_incomplete_type (tree type_name)
5334 tree ptr = NULL_TREE, name;
5336 if (TREE_CODE (type_name) == EXPR_WITH_FILE_LOCATION)
5337 name = EXPR_WFL_NODE (type_name);
5338 else if (INCOMPLETE_TYPE_P (type_name))
5339 name = TYPE_NAME (type_name);
5343 /* Workaround from build_pointer_type for incomplete types. */
5344 BUILD_PTR_FROM_NAME (ptr, name);
5345 TYPE_MODE (ptr) = ptr_mode;
5351 /* Register a incomplete type whose name is WFL. Reuse PTR if PTR is
5352 non NULL instead of computing a new fake type based on WFL. The new
5353 dependency is inserted in the current type dependency list, in FIFO
5357 register_incomplete_type (int kind, tree wfl, tree decl, tree ptr)
5359 jdep *new = xmalloc (sizeof (jdep));
5361 if (!ptr && kind != JDEP_METHOD_END) /* JDEP_METHOD_END is a mere marker */
5362 ptr = obtain_incomplete_type (wfl);
5364 JDEP_KIND (new) = kind;
5365 JDEP_DECL (new) = decl;
5366 JDEP_TO_RESOLVE (new) = ptr;
5367 JDEP_WFL (new) = wfl;
5368 JDEP_CHAIN (new) = NULL;
5369 JDEP_MISC (new) = NULL_TREE;
5370 /* For some dependencies, set the enclosing class of the current
5371 class to be the enclosing context */
5372 if ((kind == JDEP_INTERFACE || kind == JDEP_ANONYMOUS || kind == JDEP_SUPER)
5373 && GET_ENCLOSING_CPC ())
5374 JDEP_ENCLOSING (new) = TREE_VALUE (GET_ENCLOSING_CPC ());
5376 JDEP_ENCLOSING (new) = GET_CPC ();
5377 JDEP_GET_PATCH (new) = (tree *)NULL;
5379 JDEP_INSERT (ctxp->classd_list, new);
5384 /* This checks for circular references with innerclasses. We start
5385 from SOURCE and should never reach TARGET. Extended/implemented
5386 types in SOURCE have their enclosing context checked not to reach
5387 TARGET. When the last enclosing context of SOURCE is reached, its
5388 extended/implemented types are also checked not to reach TARGET.
5389 In case of error, WFL of the offending type is returned; NULL_TREE
5393 check_inner_circular_reference (tree source, tree target)
5399 for (i = 0; BINFO_BASE_ITERATE (TYPE_BINFO (source), i, base_binfo); i++)
5403 /* We can end up with a NULL_TREE or an incomplete type here if
5404 we encountered previous type resolution errors. It's safe to
5405 simply ignore these cases. */
5406 su = BINFO_TYPE (base_binfo);
5407 if (INCOMPLETE_TYPE_P (su))
5410 if (inherits_from_p (su, target))
5411 return lookup_cl (TYPE_NAME (su));
5413 for (ctx = DECL_CONTEXT (TYPE_NAME (su)); ctx; ctx = DECL_CONTEXT (ctx))
5415 /* An enclosing context shouldn't be TARGET */
5416 if (ctx == TYPE_NAME (target))
5417 return lookup_cl (TYPE_NAME (su));
5419 /* When we reach the enclosing last context, start a check
5420 on it, with the same target */
5421 if (! DECL_CONTEXT (ctx) &&
5422 (cl = check_inner_circular_reference (TREE_TYPE (ctx), target)))
5429 /* Explore TYPE's `extends' clause member(s) and return the WFL of the
5430 offending type if a circularity is detected. NULL_TREE is returned
5431 otherwise. TYPE can be an interface or a class. */
5434 check_circular_reference (tree type)
5439 if (!BINFO_N_BASE_BINFOS (TYPE_BINFO (type)))
5442 if (! CLASS_INTERFACE (TYPE_NAME (type)))
5444 if (inherits_from_p (CLASSTYPE_SUPER (type), type))
5445 return lookup_cl (TYPE_NAME (type));
5449 for (i = 0; BINFO_BASE_ITERATE (TYPE_BINFO (type), i, base_binfo); i++)
5451 if (BINFO_TYPE (base_binfo) != object_type_node
5452 && interface_of_p (type, BINFO_TYPE (base_binfo)))
5453 return lookup_cl (TYPE_NAME (BINFO_TYPE (base_binfo)));
5459 java_check_circular_reference (void)
5462 for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
5464 tree type = TREE_TYPE (current);
5467 cl = check_circular_reference (type);
5469 cl = check_inner_circular_reference (type, type);
5471 parse_error_context (cl, "Cyclic class inheritance%s",
5472 (cyclic_inheritance_report ?
5473 cyclic_inheritance_report : ""));
5477 /* Augment the parameter list PARM with parameters crafted to
5478 initialize outer context locals aliases. Through ARTIFICIAL, a
5479 count is kept of the number of crafted parameters. MODE governs
5480 what eventually gets created: something suitable for a function
5481 creation or a function invocation, either the constructor or
5485 build_alias_initializer_parameter_list (int mode, tree class_type, tree parm,
5489 tree additional_parms = NULL_TREE;
5491 for (field = TYPE_FIELDS (class_type); field; field = TREE_CHAIN (field))
5492 if (FIELD_LOCAL_ALIAS (field))
5494 const char *buffer = IDENTIFIER_POINTER (DECL_NAME (field));
5495 tree purpose = NULL_TREE, value = NULL_TREE, name = NULL_TREE;
5500 case AIPL_FUNCTION_DECLARATION:
5501 MANGLE_ALIAS_INITIALIZER_PARAMETER_NAME_STR (mangled_id,
5503 purpose = build_wfl_node (mangled_id);
5504 if (TREE_CODE (TREE_TYPE (field)) == POINTER_TYPE)
5505 value = build_wfl_node (TYPE_NAME (TREE_TYPE (field)));
5507 value = TREE_TYPE (field);
5510 case AIPL_FUNCTION_CREATION:
5511 MANGLE_ALIAS_INITIALIZER_PARAMETER_NAME_STR (purpose,
5513 value = TREE_TYPE (field);
5516 case AIPL_FUNCTION_FINIT_INVOCATION:
5517 MANGLE_ALIAS_INITIALIZER_PARAMETER_NAME_STR (mangled_id,
5519 /* Now, this is wrong. purpose should always be the NAME
5520 of something and value its matching value (decl, type,
5521 etc...) FIXME -- but there is a lot to fix. */
5523 /* When invoked for this kind of operation, we already
5524 know whether a field is used or not. */
5525 purpose = TREE_TYPE (field);
5526 value = build_wfl_node (mangled_id);
5529 case AIPL_FUNCTION_CTOR_INVOCATION:
5530 /* There are two case: the constructor invocation happens
5531 outside the local inner, in which case, locales from the outer
5532 context are directly used.
5534 Otherwise, we fold to using the alias directly. */
5535 if (class_type == current_class)
5539 name = get_identifier (&buffer[4]);
5540 value = IDENTIFIER_LOCAL_VALUE (name);
5544 additional_parms = tree_cons (purpose, value, additional_parms);
5548 if (additional_parms)
5550 if (ANONYMOUS_CLASS_P (class_type)
5551 && mode == AIPL_FUNCTION_CTOR_INVOCATION)
5552 additional_parms = nreverse (additional_parms);
5553 parm = chainon (additional_parms, parm);
5559 /* Craft a constructor for CLASS_DECL -- what we should do when none
5560 where found. ARGS is non NULL when a special signature must be
5561 enforced. This is the case for anonymous classes. */
5564 craft_constructor (tree class_decl, tree args)
5566 tree class_type = TREE_TYPE (class_decl);
5567 tree parm = NULL_TREE;
5568 /* Inherit access flags for the constructor from its enclosing class. */
5569 int valid_ctor_flags = ACC_PUBLIC | ACC_PROTECTED | ACC_PRIVATE;
5570 int flags = (get_access_flags_from_decl (class_decl) & valid_ctor_flags);
5571 int i = 0, artificial = 0;
5572 tree decl, ctor_name;
5575 ctor_name = init_identifier_node;
5577 /* If we're dealing with an inner class constructor, we hide the
5578 this$<n> decl in the name field of its parameter declaration. */
5579 if (PURE_INNER_CLASS_TYPE_P (class_type))
5581 tree type = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (class_type)));
5582 parm = tree_cons (build_current_thisn (class_type),
5583 build_pointer_type (type), parm);
5585 /* Some more arguments to be hidden here. The values of the local
5586 variables of the outer context that the inner class needs to see. */
5587 parm = build_alias_initializer_parameter_list (AIPL_FUNCTION_CREATION,
5592 /* Then if there are any args to be enforced, enforce them now */
5593 for (; args && args != end_params_node; args = TREE_CHAIN (args))
5595 sprintf (buffer, "parm%d", i++);
5596 parm = tree_cons (get_identifier (buffer), TREE_VALUE (args), parm);
5599 CRAFTED_PARAM_LIST_FIXUP (parm);
5600 decl = create_artificial_method (class_type, flags, void_type_node,
5602 fix_method_argument_names (parm, decl);
5603 /* Now, mark the artificial parameters. */
5604 DECL_FUNCTION_NAP (decl) = artificial;
5605 DECL_FUNCTION_SYNTHETIC_CTOR (decl) = DECL_CONSTRUCTOR_P (decl) = 1;
5606 DECL_INLINE (decl) = 1;
5611 /* Fix the constructors. This will be called right after circular
5612 references have been checked. It is necessary to fix constructors
5613 early even if no code generation will take place for that class:
5614 some generated constructor might be required by the class whose
5615 compilation triggered this one to be simply loaded. */
5618 java_fix_constructors (void)
5622 for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
5624 tree class_type = TREE_TYPE (current);
5628 if (CLASS_INTERFACE (TYPE_NAME (class_type)))
5631 output_class = current_class = class_type;
5632 for (decl = TYPE_METHODS (class_type); decl; decl = TREE_CHAIN (decl))
5634 if (DECL_CONSTRUCTOR_P (decl))
5636 fix_constructors (decl);
5641 /* Anonymous class constructor can't be generated that early. */
5642 if (!saw_ctor && !ANONYMOUS_CLASS_P (class_type))
5643 craft_constructor (current, NULL_TREE);
5647 /* safe_layout_class just makes sure that we can load a class without
5648 disrupting the current_class, input_file, input_line, etc, information
5649 about the class processed currently. */
5652 safe_layout_class (tree class)
5654 tree save_current_class = current_class;
5655 location_t save_location = input_location;
5657 layout_class (class);
5659 current_class = save_current_class;
5660 input_location = save_location;
5664 jdep_resolve_class (jdep *dep)
5668 if (JDEP_RESOLVED_P (dep))
5669 decl = JDEP_RESOLVED_DECL (dep);
5672 decl = resolve_class (JDEP_ENCLOSING (dep), JDEP_TO_RESOLVE (dep),
5673 JDEP_DECL (dep), JDEP_WFL (dep));
5674 JDEP_RESOLVED (dep, decl);
5675 /* If there is no WFL, that's ok. We generate this warning
5677 if (decl && JDEP_WFL (dep) != NULL_TREE)
5678 check_deprecation (JDEP_WFL (dep), decl);
5682 complete_class_report_errors (dep);
5683 else if (INNER_CLASS_DECL_P (decl))
5685 tree inner = TREE_TYPE (decl);
5686 if (! CLASS_LOADED_P (inner))
5688 safe_layout_class (inner);
5689 if (TYPE_SIZE (inner) == error_mark_node)
5690 TYPE_SIZE (inner) = NULL_TREE;
5692 check_inner_class_access (decl, JDEP_ENCLOSING (dep), JDEP_WFL (dep));
5697 /* Complete unsatisfied class declaration and their dependencies */
5700 java_complete_class (void)
5707 /* Process imports */
5710 /* Reverse things so we have the right order */
5711 ctxp->class_list = nreverse (ctxp->class_list);
5712 ctxp->classd_list = reverse_jdep_list (ctxp);
5714 for (cclassd = ctxp->classd_list, cclass = ctxp->class_list;
5716 cclass = TREE_CHAIN (cclass), cclassd = CLASSD_CHAIN (cclassd))
5720 /* We keep the compilation unit imports in the class so that
5721 they can be used later to resolve type dependencies that
5722 aren't necessary to solve now. */
5723 TYPE_IMPORT_LIST (TREE_TYPE (cclass)) = ctxp->import_list;
5724 TYPE_IMPORT_DEMAND_LIST (TREE_TYPE (cclass)) = ctxp->import_demand_list;
5726 for (dep = CLASSD_FIRST (cclassd); dep; dep = JDEP_CHAIN (dep))
5729 if (!(decl = jdep_resolve_class (dep)))
5732 /* Now it's time to patch */
5733 switch (JDEP_KIND (dep))
5736 /* Simply patch super */
5737 if (parser_check_super (decl, JDEP_DECL (dep), JDEP_WFL (dep)))
5739 BINFO_TYPE (BINFO_BASE_BINFO
5740 (TYPE_BINFO (TREE_TYPE (JDEP_DECL (dep))), 0))
5746 /* We do part of the job done in add_field */
5747 tree field_decl = JDEP_DECL (dep);
5748 tree field_type = TREE_TYPE (decl);
5749 if (TREE_CODE (field_type) == RECORD_TYPE)
5750 field_type = promote_type (field_type);
5751 TREE_TYPE (field_decl) = field_type;
5752 DECL_ALIGN (field_decl) = 0;
5753 DECL_USER_ALIGN (field_decl) = 0;
5754 layout_decl (field_decl, 0);
5755 SOURCE_FRONTEND_DEBUG
5756 (("Completed field/var decl `%s' with `%s'",
5757 IDENTIFIER_POINTER (DECL_NAME (field_decl)),
5758 IDENTIFIER_POINTER (DECL_NAME (decl))));
5761 case JDEP_METHOD: /* We start patching a method */
5762 case JDEP_METHOD_RETURN:
5768 type = TREE_TYPE(decl);
5769 if (TREE_CODE (type) == RECORD_TYPE)
5770 type = promote_type (type);
5771 JDEP_APPLY_PATCH (dep, type);
5772 SOURCE_FRONTEND_DEBUG
5773 (((JDEP_KIND (dep) == JDEP_METHOD_RETURN ?
5774 "Completing fct `%s' with ret type `%s'":
5775 "Completing arg `%s' with type `%s'"),
5776 IDENTIFIER_POINTER (EXPR_WFL_NODE
5777 (JDEP_DECL_WFL (dep))),
5778 IDENTIFIER_POINTER (DECL_NAME (decl))));
5782 dep = JDEP_CHAIN (dep);
5783 if (JDEP_KIND (dep) == JDEP_METHOD_END)
5786 decl = jdep_resolve_class (dep);
5790 tree mdecl = JDEP_DECL (dep), signature;
5791 /* Recompute and reset the signature, check first that
5792 all types are now defined. If they're not,
5793 don't build the signature. */
5794 if (check_method_types_complete (mdecl))
5796 signature = build_java_signature (TREE_TYPE (mdecl));
5797 set_java_signature (TREE_TYPE (mdecl), signature);
5804 case JDEP_INTERFACE:
5805 if (parser_check_super_interface (decl, JDEP_DECL (dep),
5808 parser_add_interface (JDEP_DECL (dep), decl, JDEP_WFL (dep));
5813 type = TREE_TYPE(decl);
5814 if (TREE_CODE (type) == RECORD_TYPE)
5815 type = promote_type (type);
5816 JDEP_APPLY_PATCH (dep, type);
5820 JDEP_APPLY_PATCH (dep, TREE_TYPE (decl));
5821 SOURCE_FRONTEND_DEBUG
5822 (("Completing a random type dependency on a '%s' node",
5823 tree_code_name [TREE_CODE (JDEP_DECL (dep))]));
5826 case JDEP_EXCEPTION:
5827 JDEP_APPLY_PATCH (dep, TREE_TYPE (decl));
5828 SOURCE_FRONTEND_DEBUG
5829 (("Completing `%s' `throws' argument node",
5830 IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_WFL (dep)))));
5833 case JDEP_ANONYMOUS:
5834 patch_anonymous_class (decl, JDEP_DECL (dep), JDEP_WFL (dep));
5845 /* Resolve class CLASS_TYPE. Handle the case of trying to resolve an
5849 resolve_class (tree enclosing, tree class_type, tree decl, tree cl)
5851 tree tname = TYPE_NAME (class_type);
5852 tree resolved_type = TREE_TYPE (class_type);
5854 tree resolved_type_decl;
5856 if (resolved_type != NULL_TREE)
5858 tree resolved_type_decl = TYPE_NAME (resolved_type);
5859 if (resolved_type_decl == NULL_TREE
5860 || TREE_CODE (resolved_type_decl) == IDENTIFIER_NODE)
5862 resolved_type_decl = build_decl (TYPE_DECL,
5863 TYPE_NAME (class_type),
5866 return resolved_type_decl;
5869 /* 1- Check to see if we have an array. If true, find what we really
5871 if ((array_dims = build_type_name_from_array_name (tname,
5872 &TYPE_NAME (class_type))))
5873 WFL_STRIP_BRACKET (cl, cl);
5875 /* 2- Resolve the bare type */
5876 if (!(resolved_type_decl = do_resolve_class (enclosing, class_type,
5879 resolved_type = TREE_TYPE (resolved_type_decl);
5881 /* 3- If we have an array, reconstruct the array down to its nesting */
5884 for (; array_dims; array_dims--)
5885 resolved_type = build_java_array_type (resolved_type, -1);
5886 resolved_type_decl = TYPE_NAME (resolved_type);
5888 TREE_TYPE (class_type) = resolved_type;
5889 return resolved_type_decl;
5892 /* Effectively perform the resolution of class CLASS_TYPE. DECL or CL
5893 are used to report error messages; CL must either be NULL_TREE or a
5894 WFL wrapping a class. Do not try to replace TYPE_NAME (class_type)
5895 by a variable, since it is changed by find_in_imports{_on_demand}
5896 and (but it doesn't really matter) qualify_and_find. */
5899 do_resolve_class (tree enclosing, tree class_type, tree decl, tree cl)
5901 tree new_class_decl = NULL_TREE, super = NULL_TREE;
5902 tree saved_enclosing_type = enclosing ? TREE_TYPE (enclosing) : NULL_TREE;
5904 htab_t circularity_hash;
5906 if (QUALIFIED_P (TYPE_NAME (class_type)))
5908 /* If the type name is of the form `Q . Id', then Q is either a
5909 package name or a class name. First we try to find Q as a
5910 class and then treat Id as a member type. If we can't find Q
5911 as a class then we fall through. */
5912 tree q, left, left_type, right;
5913 if (split_qualified_name (&left, &right, TYPE_NAME (class_type)) == 0)
5915 BUILD_PTR_FROM_NAME (left_type, left);
5916 q = do_resolve_class (enclosing, left_type, decl, cl);
5920 saved_enclosing_type = TREE_TYPE (q);
5921 BUILD_PTR_FROM_NAME (class_type, right);
5928 /* This hash table is used to register the classes we're going
5929 through when searching the current class as an inner class, in
5930 order to detect circular references. Remember to free it before
5931 returning the section 0- of this function. */
5932 circularity_hash = htab_create (20, htab_hash_pointer, htab_eq_pointer,
5935 /* 0- Search in the current class as an inner class.
5936 Maybe some code here should be added to load the class or
5937 something, at least if the class isn't an inner class and ended
5938 being loaded from class file. FIXME. */
5941 new_class_decl = resolve_inner_class (circularity_hash, cl, &enclosing,
5942 &super, class_type);
5946 /* If we haven't found anything because SUPER reached Object and
5947 ENCLOSING happens to be an innerclass, try the enclosing context. */
5948 if ((!super || super == object_type_node) &&
5949 enclosing && INNER_CLASS_DECL_P (enclosing))
5950 enclosing = DECL_CONTEXT (enclosing);
5952 enclosing = NULL_TREE;
5955 htab_delete (circularity_hash);
5958 return new_class_decl;
5961 /* 1- Check for the type in single imports. This will change
5962 TYPE_NAME() if something relevant is found */
5963 find_in_imports (saved_enclosing_type, class_type);
5965 /* 2- And check for the type in the current compilation unit */
5966 if ((new_class_decl = IDENTIFIER_CLASS_VALUE (TYPE_NAME (class_type))))
5968 if (!CLASS_LOADED_P (TREE_TYPE (new_class_decl)))
5969 load_class (TYPE_NAME (class_type), 0);
5970 return IDENTIFIER_CLASS_VALUE (TYPE_NAME (class_type));
5973 /* 3- Search according to the current package definition */
5974 if (!QUALIFIED_P (TYPE_NAME (class_type)))
5976 if ((new_class_decl = qualify_and_find (class_type, ctxp->package,
5977 TYPE_NAME (class_type))))
5978 return new_class_decl;
5981 /* 4- Check the import on demands. Don't allow bar.baz to be
5982 imported from foo.* */
5983 if (!QUALIFIED_P (TYPE_NAME (class_type)))
5984 if (find_in_imports_on_demand (saved_enclosing_type, class_type))
5987 /* If found in find_in_imports_on_demand, the type has already been
5989 if ((new_class_decl = IDENTIFIER_CLASS_VALUE (TYPE_NAME (class_type))))
5990 return new_class_decl;
5992 /* 5- Try with a name qualified with the package name we've seen so far */
5993 if (!QUALIFIED_P (TYPE_NAME (class_type)))
5997 /* If there is a current package (ctxp->package), it's the first
5998 element of package_list and we can skip it. */
5999 for (package = (ctxp->package ?
6000 TREE_CHAIN (package_list) : package_list);
6001 package; package = TREE_CHAIN (package))
6002 if ((new_class_decl = qualify_and_find (class_type,
6003 TREE_PURPOSE (package),
6004 TYPE_NAME (class_type))))
6005 return new_class_decl;
6008 /* 5- Check another compilation unit that bears the name of type */
6009 load_class (TYPE_NAME (class_type), 0);
6012 cl = lookup_cl (decl);
6014 /* If we don't have a value for CL, then we're being called recursively.
6015 We can't check package access just yet, but it will be taken care of
6019 if (check_pkg_class_access (TYPE_NAME (class_type), cl, true, NULL_TREE))
6023 /* 6- Last call for a resolution */
6024 decl_result = IDENTIFIER_CLASS_VALUE (TYPE_NAME (class_type));
6026 /* The final lookup might have registered a.b.c into a.b$c If we
6027 failed at the first lookup, progressively change the name if
6028 applicable and use the matching DECL instead. */
6029 if (!decl_result && QUALIFIED_P (TYPE_NAME (class_type)))
6032 tree name = TYPE_NAME (class_type);
6033 char *namebuffer = alloca (IDENTIFIER_LENGTH (name) + 1);
6035 strcpy (namebuffer, IDENTIFIER_POINTER (name));
6039 /* Reach the last '.', and if applicable, replace it by a `$' and
6040 see if this exists as a type. */
6041 if ((separator = strrchr (namebuffer, '.')))
6044 name = get_identifier (namebuffer);
6045 decl_result = IDENTIFIER_CLASS_VALUE (name);
6047 } while (!decl_result && separator);
6053 qualify_and_find (tree class_type, tree package, tree name)
6055 tree new_qualified = merge_qualified_name (package, name);
6056 tree new_class_decl;
6058 if (!IDENTIFIER_CLASS_VALUE (new_qualified))
6059 load_class (new_qualified, 0);
6060 if ((new_class_decl = IDENTIFIER_CLASS_VALUE (new_qualified)))
6062 if (!CLASS_LOADED_P (TREE_TYPE (new_class_decl)))
6063 load_class (TREE_TYPE (new_class_decl), 0);
6064 TYPE_NAME (class_type) = new_qualified;
6065 return IDENTIFIER_CLASS_VALUE (new_qualified);
6070 /* Resolve NAME and lay it out (if not done and if not the current
6071 parsed class). Return a decl node. This function is meant to be
6072 called when type resolution is necessary during the walk pass. */
6075 resolve_and_layout (tree something, tree cl)
6077 tree decl, decl_type;
6079 /* Don't do that on the current class */
6080 if (something == current_class)
6081 return TYPE_NAME (current_class);
6083 /* Don't do anything for void and other primitive types */
6084 if (JPRIMITIVE_TYPE_P (something) || something == void_type_node)
6087 /* Pointer types can be reall pointer types or fake pointers. When
6088 finding a real pointer, recheck for primitive types */
6089 if (TREE_CODE (something) == POINTER_TYPE)
6091 if (TREE_TYPE (something))
6093 something = TREE_TYPE (something);
6094 if (JPRIMITIVE_TYPE_P (something) || something == void_type_node)
6098 something = TYPE_NAME (something);
6101 /* Don't do anything for arrays of primitive types */
6102 if (TREE_CODE (something) == RECORD_TYPE && TYPE_ARRAY_P (something)
6103 && JPRIMITIVE_TYPE_P (TYPE_ARRAY_ELEMENT (something)))
6106 /* Something might be a WFL */
6107 if (TREE_CODE (something) == EXPR_WITH_FILE_LOCATION)
6108 something = EXPR_WFL_NODE (something);
6110 /* Otherwise, if something is not and IDENTIFIER_NODE, it can be a a
6111 TYPE_DECL or a real TYPE */
6112 else if (TREE_CODE (something) != IDENTIFIER_NODE)
6113 something = (TREE_CODE (TYPE_NAME (something)) == TYPE_DECL ?
6114 DECL_NAME (TYPE_NAME (something)) : TYPE_NAME (something));
6116 if (!(decl = resolve_no_layout (something, cl)))
6119 /* Resolve and layout if necessary */
6120 decl_type = TREE_TYPE (decl);
6121 layout_class_methods (decl_type);
6123 if (CLASS_FROM_SOURCE_P (decl_type))
6124 java_check_methods (decl);
6125 /* Layout the type if necessary */
6126 if (decl_type != current_class && !CLASS_LOADED_P (decl_type))
6127 safe_layout_class (decl_type);
6132 /* Resolve a class, returns its decl but doesn't perform any
6133 layout. The current parsing context is saved and restored */
6136 resolve_no_layout (tree name, tree cl)
6139 BUILD_PTR_FROM_NAME (ptr, name);
6140 java_parser_context_save_global ();
6141 decl = resolve_class (TYPE_NAME (current_class), ptr, NULL_TREE, cl);
6142 java_parser_context_restore_global ();
6147 /* Called when reporting errors. Skip the '[]'s in a complex array
6148 type description that failed to be resolved. purify_type_name can't
6149 use an identifier tree. */
6152 purify_type_name (const char *name)
6154 int len = strlen (name);
6157 STRING_STRIP_BRACKETS (name, len, bracket_found);
6160 char *stripped_name = xmemdup (name, len, len+1);
6161 stripped_name [len] = '\0';
6162 return stripped_name;
6167 /* The type CURRENT refers to can't be found. We print error messages. */
6170 complete_class_report_errors (jdep *dep)
6174 if (!JDEP_WFL (dep))
6177 name = IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_WFL (dep)));
6178 switch (JDEP_KIND (dep))
6182 (JDEP_WFL (dep), "Superclass `%s' of class `%s' not found",
6183 purify_type_name (name),
6184 IDENTIFIER_POINTER (DECL_NAME (JDEP_DECL (dep))));
6188 (JDEP_WFL (dep), "Type `%s' not found in declaration of field `%s'",
6189 purify_type_name (name),
6190 IDENTIFIER_POINTER (DECL_NAME (JDEP_DECL (dep))));
6192 case JDEP_METHOD: /* Covers arguments */
6194 (JDEP_WFL (dep), "Type `%s' not found in the declaration of the argument `%s' of method `%s'",
6195 purify_type_name (name),
6196 IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_DECL_WFL (dep))),
6197 IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_MISC (dep))));
6199 case JDEP_METHOD_RETURN: /* Covers return type */
6201 (JDEP_WFL (dep), "Type `%s' not found in the declaration of the return type of method `%s'",
6202 purify_type_name (name),
6203 IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_DECL_WFL (dep))));
6205 case JDEP_INTERFACE:
6207 (JDEP_WFL (dep), "Superinterface `%s' of %s `%s' not found",
6208 IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_WFL (dep))),
6209 (CLASS_OR_INTERFACE (JDEP_DECL (dep), "class", "interface")),
6210 IDENTIFIER_POINTER (DECL_NAME (JDEP_DECL (dep))));
6214 (JDEP_WFL (dep), "Type `%s' not found in the declaration of the local variable `%s'",
6215 purify_type_name (IDENTIFIER_POINTER
6216 (EXPR_WFL_NODE (JDEP_WFL (dep)))),
6217 IDENTIFIER_POINTER (DECL_NAME (JDEP_DECL (dep))));
6219 case JDEP_EXCEPTION: /* As specified by `throws' */
6221 (JDEP_WFL (dep), "Class `%s' not found in `throws'",
6222 IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_WFL (dep))));
6225 /* Fix for -Wall. Just break doing nothing. The error will be
6231 /* Return a static string containing the DECL prototype string. If
6232 DECL is a constructor, use the class name instead of the form
6236 get_printable_method_name (tree decl)
6238 const char *to_return;
6239 tree name = NULL_TREE;
6241 if (DECL_CONSTRUCTOR_P (decl))
6243 name = DECL_NAME (decl);
6244 DECL_NAME (decl) = DECL_NAME (TYPE_NAME (DECL_CONTEXT (decl)));
6247 to_return = lang_printable_name (decl, 2);
6248 if (DECL_CONSTRUCTOR_P (decl))
6249 DECL_NAME (decl) = name;
6254 /* Track method being redefined inside the same class. As a side
6255 effect, set DECL_NAME to an IDENTIFIER (prior entering this
6256 function it's a FWL, so we can track errors more accurately.) */
6259 check_method_redefinition (tree class, tree method)
6263 /* There's no need to verify <clinit> and finit$ and instinit$ */
6264 if (DECL_CLINIT_P (method)
6265 || DECL_FINIT_P (method) || DECL_INSTINIT_P (method))
6268 sig = TYPE_ARGUMENT_SIGNATURE (TREE_TYPE (method));
6269 for (redef = TYPE_METHODS (class); redef; redef = TREE_CHAIN (redef))
6271 if (redef == method)
6273 if (DECL_NAME (redef) == DECL_NAME (method)
6274 && sig == TYPE_ARGUMENT_SIGNATURE (TREE_TYPE (redef))
6275 && !DECL_ARTIFICIAL (method))
6278 (DECL_FUNCTION_WFL (method), "Duplicate %s declaration `%s'",
6279 (DECL_CONSTRUCTOR_P (redef) ? "constructor" : "method"),
6280 get_printable_method_name (redef));
6287 /* Return 1 if check went ok, 0 otherwise. */
6289 check_abstract_method_definitions (int do_interface, tree class_decl,
6292 tree class = TREE_TYPE (class_decl);
6293 tree method, end_type;
6296 end_type = (do_interface ? object_type_node : type);
6297 for (method = TYPE_METHODS (type); method; method = TREE_CHAIN (method))
6299 tree other_super, other_method, method_sig, method_name;
6301 int end_type_reached = 0;
6303 if (!METHOD_ABSTRACT (method) || METHOD_FINAL (method))
6306 /* Now verify that somewhere in between TYPE and CLASS,
6307 abstract method METHOD gets a non abstract definition
6308 that is inherited by CLASS. */
6310 method_sig = build_java_signature (TREE_TYPE (method));
6311 method_name = DECL_NAME (method);
6312 if (TREE_CODE (method_name) == EXPR_WITH_FILE_LOCATION)
6313 method_name = EXPR_WFL_NODE (method_name);
6315 other_super = class;
6317 if (other_super == end_type)
6318 end_type_reached = 1;
6321 for (other_method = TYPE_METHODS (other_super); other_method;
6322 other_method = TREE_CHAIN (other_method))
6324 tree s = build_java_signature (TREE_TYPE (other_method));
6325 tree other_name = DECL_NAME (other_method);
6327 if (TREE_CODE (other_name) == EXPR_WITH_FILE_LOCATION)
6328 other_name = EXPR_WFL_NODE (other_name);
6329 if (!DECL_CLINIT_P (other_method)
6330 && !DECL_CONSTRUCTOR_P (other_method)
6331 && method_name == other_name
6333 && !METHOD_ABSTRACT (other_method))
6339 other_super = CLASSTYPE_SUPER (other_super);
6340 } while (!end_type_reached);
6342 /* Report that abstract METHOD didn't find an implementation
6343 that CLASS can use. */
6346 char *t = xstrdup (lang_printable_name
6347 (TREE_TYPE (TREE_TYPE (method)), 0));
6348 tree ccn = DECL_NAME (TYPE_NAME (DECL_CONTEXT (method)));
6351 (lookup_cl (class_decl),
6352 "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",
6353 IDENTIFIER_POINTER (DECL_NAME (class_decl)),
6354 t, lang_printable_name (method, 2),
6355 (CLASS_INTERFACE (TYPE_NAME (DECL_CONTEXT (method))) ?
6356 "interface" : "class"),
6357 IDENTIFIER_POINTER (ccn),
6358 (CLASS_INTERFACE (class_decl) ? "interface" : "class"),
6359 IDENTIFIER_POINTER (DECL_NAME (class_decl)));
6365 if (ok && do_interface)
6367 /* Check for implemented interfaces. */
6372 ok && BINFO_BASE_ITERATE (TYPE_BINFO (type), i, base_binfo);
6374 ok = check_abstract_method_definitions (1, class_decl,
6375 BINFO_TYPE (base_binfo));
6381 /* Check that CLASS_DECL somehow implements all inherited abstract
6385 java_check_abstract_method_definitions (tree class_decl)
6387 tree class = TREE_TYPE (class_decl);
6388 tree super, base_binfo;
6391 if (CLASS_ABSTRACT (class_decl))
6394 /* Check for inherited types */
6397 super = CLASSTYPE_SUPER (super);
6398 check_abstract_method_definitions (0, class_decl, super);
6399 } while (super != object_type_node);
6401 /* Check for implemented interfaces. */
6402 for (i = 1; BINFO_BASE_ITERATE (TYPE_BINFO (class), i, base_binfo); i++)
6403 check_abstract_method_definitions (1, class_decl, BINFO_TYPE (base_binfo));
6406 /* Check all the types method DECL uses and return 1 if all of them
6407 are now complete, 0 otherwise. This is used to check whether its
6408 safe to build a method signature or not. */
6411 check_method_types_complete (tree decl)
6413 tree type = TREE_TYPE (decl);
6416 if (!INCOMPLETE_TYPE_P (TREE_TYPE (type)))
6419 args = TYPE_ARG_TYPES (type);
6420 if (TREE_CODE (type) == METHOD_TYPE)
6421 args = TREE_CHAIN (args);
6422 for (; args != end_params_node; args = TREE_CHAIN (args))
6423 if (INCOMPLETE_TYPE_P (TREE_VALUE (args)))
6429 /* Visible interface to check methods contained in CLASS_DECL */
6432 java_check_methods (tree class_decl)
6434 if (CLASS_METHOD_CHECKED_P (TREE_TYPE (class_decl)))
6437 if (CLASS_INTERFACE (class_decl))
6438 java_check_abstract_methods (class_decl);
6440 java_check_regular_methods (class_decl);
6442 CLASS_METHOD_CHECKED_P (TREE_TYPE (class_decl)) = 1;
6445 /* Like not_accessible_p, but doesn't refer to the current class at
6448 hack_is_accessible_p (tree member, tree from_where)
6450 int flags = get_access_flags_from_decl (member);
6452 if (from_where == DECL_CONTEXT (member)
6453 || (flags & ACC_PUBLIC))
6456 if ((flags & ACC_PROTECTED))
6458 if (inherits_from_p (from_where, DECL_CONTEXT (member)))
6462 if ((flags & ACC_PRIVATE))
6465 /* Package private, or protected. */
6466 return in_same_package (TYPE_NAME (from_where),
6467 TYPE_NAME (DECL_CONTEXT (member)));
6470 /* Check all the methods of CLASS_DECL. Methods are first completed
6471 then checked according to regular method existence rules. If no
6472 constructor for CLASS_DECL were encountered, then build its
6475 java_check_regular_methods (tree class_decl)
6477 int saw_constructor = ANONYMOUS_CLASS_P (TREE_TYPE (class_decl));
6479 tree class = TREE_TYPE (class_decl);
6480 tree found = NULL_TREE;
6483 /* It is not necessary to check methods defined in java.lang.Object */
6484 if (class == object_type_node)
6487 if (!TYPE_NVIRTUALS (class))
6488 TYPE_METHODS (class) = nreverse (TYPE_METHODS (class));
6490 /* Should take interfaces into account. FIXME */
6491 for (method = TYPE_METHODS (class); method; method = TREE_CHAIN (method))
6494 tree method_wfl = DECL_FUNCTION_WFL (method);
6497 /* Check for redefinitions */
6498 if (check_method_redefinition (class, method))
6501 /* We verify things thrown by the method. They must inherit from
6502 java.lang.Throwable. */
6503 for (mthrows = DECL_FUNCTION_THROWS (method);
6504 mthrows; mthrows = TREE_CHAIN (mthrows))
6506 if (!inherits_from_p (TREE_VALUE (mthrows), throwable_type_node))
6508 (TREE_PURPOSE (mthrows), "Class `%s' in `throws' clause must be a subclass of class `java.lang.Throwable'",
6510 (DECL_NAME (TYPE_NAME (TREE_VALUE (mthrows)))));
6513 /* If we see one constructor a mark so we don't generate the
6514 default one. Also skip other verifications: constructors
6515 can't be inherited hence hidden or overridden. */
6516 if (DECL_CONSTRUCTOR_P (method))
6518 saw_constructor = 1;
6522 sig = build_java_argument_signature (TREE_TYPE (method));
6523 found = lookup_argument_method_generic (class, DECL_NAME (method), sig,
6524 SEARCH_SUPER | SEARCH_INTERFACE);
6526 /* Inner class can't declare static methods */
6527 if (METHOD_STATIC (method) && !TOPLEVEL_CLASS_DECL_P (class_decl))
6529 char *t = xstrdup (lang_printable_name (class, 0));
6531 (method_wfl, "Method `%s' can't be static in inner class `%s'. Only members of interfaces and top-level classes can be static",
6532 lang_printable_name (method, 2), t);
6536 /* Nothing overrides or it's a private method. */
6539 if (METHOD_PRIVATE (found))
6545 /* If `found' is declared in an interface, make sure the
6546 modifier matches. */
6547 if (CLASS_INTERFACE (TYPE_NAME (DECL_CONTEXT (found)))
6548 && clinit_identifier_node != DECL_NAME (found)
6549 && !METHOD_PUBLIC (method))
6551 tree found_decl = TYPE_NAME (DECL_CONTEXT (found));
6552 parse_error_context (method_wfl, "Class `%s' must override `%s' with a public method in order to implement interface `%s'",
6553 IDENTIFIER_POINTER (DECL_NAME (class_decl)),
6554 lang_printable_name (method, 2),
6555 IDENTIFIER_POINTER (DECL_NAME (found_decl)));
6558 /* Can't override a method with the same name and different return
6560 if (TREE_TYPE (TREE_TYPE (found)) != TREE_TYPE (TREE_TYPE (method)))
6563 (lang_printable_name (TREE_TYPE (TREE_TYPE (found)), 2));
6566 "Method `%s' was defined with return type `%s' in class `%s'",
6567 lang_printable_name (found, 2), t,
6569 (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found)))));
6573 aflags = get_access_flags_from_decl (found);
6575 /* Can't override final. Can't override static. */
6576 if (METHOD_FINAL (found) || METHOD_STATIC (found))
6578 /* Static *can* override static */
6579 if (METHOD_STATIC (found) && METHOD_STATIC (method))
6583 "%s methods can't be overridden. Method `%s' is %s in class `%s'",
6584 (METHOD_FINAL (found) ? "Final" : "Static"),
6585 lang_printable_name (found, 2),
6586 (METHOD_FINAL (found) ? "final" : "static"),
6588 (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found)))));
6592 /* Static method can't override instance method. */
6593 if (METHOD_STATIC (method))
6597 "Instance methods can't be overridden by a static method. Method `%s' is an instance method in class `%s'",
6598 lang_printable_name (found, 2),
6600 (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found)))));
6604 /* - Overriding/hiding public must be public
6605 - Overriding/hiding protected must be protected or public
6606 - If the overridden or hidden method has default (package)
6607 access, then the overriding or hiding method must not be
6608 private; otherwise, a compile-time error occurs. If
6609 `found' belongs to an interface, things have been already
6611 if (!CLASS_INTERFACE (TYPE_NAME (DECL_CONTEXT (found)))
6612 && ((METHOD_PUBLIC (found) && !METHOD_PUBLIC (method))
6613 || (METHOD_PROTECTED (found)
6614 && !(METHOD_PUBLIC (method) || METHOD_PROTECTED (method)))
6615 || (!(aflags & (ACC_PUBLIC | ACC_PRIVATE | ACC_STATIC))
6616 && METHOD_PRIVATE (method))))
6620 "Methods can't be overridden to be more private. Method `%s' is not %s in class `%s'", lang_printable_name (method, 2),
6621 (METHOD_PUBLIC (method) ? "public" :
6622 (METHOD_PRIVATE (method) ? "private" : "protected")),
6623 IDENTIFIER_POINTER (DECL_NAME
6624 (TYPE_NAME (DECL_CONTEXT (found)))));
6628 /* Check this method against all the other implementations it
6629 overrides. Here we only check the class hierarchy; the rest
6630 of the checking is done later. If this method is just a
6631 Miranda method, we can skip the check. */
6632 if (! METHOD_INVISIBLE (method))
6633 check_concrete_throws_clauses (class, method, DECL_NAME (method), sig);
6636 /* The above throws clause check only looked at superclasses. Now
6637 we must also make sure that all methods declared in interfaces
6638 have compatible throws clauses. FIXME: there are more efficient
6639 ways to organize this checking; we should implement one. */
6640 check_interface_throws_clauses (class, class);
6642 if (!TYPE_NVIRTUALS (class))
6643 TYPE_METHODS (class) = nreverse (TYPE_METHODS (class));
6645 /* Search for inherited abstract method not yet implemented in this
6647 java_check_abstract_method_definitions (class_decl);
6649 if (!saw_constructor)
6653 /* Check to make sure that all the methods in all the interfaces
6654 implemented by CLASS_DECL are compatible with the concrete
6655 implementations available in CHECK_CLASS_DECL. */
6657 check_interface_throws_clauses (tree check_class_decl, tree class_decl)
6659 for (; class_decl != NULL_TREE; class_decl = CLASSTYPE_SUPER (class_decl))
6663 if (! CLASS_LOADED_P (class_decl))
6665 if (CLASS_FROM_SOURCE_P (class_decl))
6666 safe_layout_class (class_decl);
6668 load_class (class_decl, 1);
6671 for (i = BINFO_N_BASE_BINFOS (TYPE_BINFO (class_decl)) - 1; i > 0; --i)
6674 = BINFO_TYPE (BINFO_BASE_BINFO (TYPE_BINFO (class_decl), i));
6677 for (iface_method = TYPE_METHODS (interface);
6678 iface_method != NULL_TREE;
6679 iface_method = TREE_CHAIN (iface_method))
6683 /* First look for a concrete method implemented or
6684 inherited by this class. No need to search
6685 interfaces here, since we're already looking through
6687 sig = build_java_argument_signature (TREE_TYPE (iface_method));
6689 = lookup_argument_method_generic (check_class_decl,
6690 DECL_NAME (iface_method),
6691 sig, SEARCH_VISIBLE);
6692 /* If we don't find an implementation, that is ok. Any
6693 potential errors from that are diagnosed elsewhere.
6694 Also, multiple inheritance with conflicting throws
6695 clauses is fine in the absence of a concrete
6697 if (method != NULL_TREE && !METHOD_ABSTRACT (method)
6698 && !METHOD_INVISIBLE (iface_method))
6700 tree method_wfl = DECL_FUNCTION_WFL (method);
6701 check_throws_clauses (method, method_wfl, iface_method);
6705 /* Now check superinterfaces. */
6706 check_interface_throws_clauses (check_class_decl, interface);
6711 /* Check throws clauses of a method against the clauses of all the
6712 methods it overrides. We do this by searching up the class
6713 hierarchy, examining all matching accessible methods. */
6715 check_concrete_throws_clauses (tree class, tree self_method,
6716 tree name, tree signature)
6718 tree method = lookup_argument_method_generic (class, name, signature,
6719 SEARCH_SUPER | SEARCH_VISIBLE);
6720 while (method != NULL_TREE)
6722 if (! METHOD_INVISIBLE (method) && hack_is_accessible_p (method, class))
6723 check_throws_clauses (self_method, DECL_FUNCTION_WFL (self_method),
6726 method = lookup_argument_method_generic (DECL_CONTEXT (method),
6728 SEARCH_SUPER | SEARCH_VISIBLE);
6732 /* Generate an error if the `throws' clause of METHOD (if any) is
6733 incompatible with the `throws' clause of FOUND (if any). */
6735 check_throws_clauses (tree method, tree method_wfl, tree found)
6739 /* Can't check these things with class loaded from bytecode. FIXME */
6740 if (!CLASS_FROM_SOURCE_P (DECL_CONTEXT (found)))
6743 for (mthrows = DECL_FUNCTION_THROWS (method);
6744 mthrows; mthrows = TREE_CHAIN (mthrows))
6748 /* We don't verify unchecked expressions */
6749 if (IS_UNCHECKED_EXCEPTION_P (TREE_VALUE (mthrows)))
6751 /* Checked expression must be compatible */
6752 for (fthrows = DECL_FUNCTION_THROWS (found);
6753 fthrows; fthrows = TREE_CHAIN (fthrows))
6755 if (inherits_from_p (TREE_VALUE (mthrows), TREE_VALUE (fthrows)))
6761 (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'",
6762 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (TREE_VALUE (mthrows)))),
6763 lang_printable_name (found, 2),
6765 (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found)))));
6770 /* Check abstract method of interface INTERFACE */
6772 java_check_abstract_methods (tree interface_decl)
6776 tree interface = TREE_TYPE (interface_decl);
6779 for (method = TYPE_METHODS (interface); method; method = TREE_CHAIN (method))
6781 /* 2- Check for double definition inside the defining interface */
6782 if (check_method_redefinition (interface, method))
6785 /* 3- Overriding is OK as far as we preserve the return type. */
6786 found = lookup_java_interface_method2 (interface, method);
6790 t = xstrdup (lang_printable_name (TREE_TYPE (TREE_TYPE (found)), 2));
6792 (DECL_FUNCTION_WFL (found),
6793 "Method `%s' was defined with return type `%s' in class `%s'",
6794 lang_printable_name (found, 2), t,
6796 (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found)))));
6802 /* 4- Inherited methods can't differ by their returned types */
6803 for (i = 0; BINFO_BASE_ITERATE (TYPE_BINFO (interface), i, base_binfo); i++)
6805 tree sub_interface_method, sub_interface;
6807 sub_interface = BINFO_TYPE (base_binfo);
6808 for (sub_interface_method = TYPE_METHODS (sub_interface);
6809 sub_interface_method;
6810 sub_interface_method = TREE_CHAIN (sub_interface_method))
6812 found = lookup_java_interface_method2 (interface,
6813 sub_interface_method);
6814 if (found && (found != sub_interface_method))
6817 (lookup_cl (sub_interface_method),
6818 "Interface `%s' inherits method `%s' from interface `%s'. This method is redefined with a different return type in interface `%s'",
6819 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (interface))),
6820 lang_printable_name (found, 2),
6822 (DECL_NAME (TYPE_NAME
6823 (DECL_CONTEXT (sub_interface_method)))),
6825 (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found)))));
6831 /* Lookup methods in interfaces using their name and partial
6832 signature. Return a matching method only if their types differ. */
6835 lookup_java_interface_method2 (tree class, tree method_decl)
6841 for (i = 0; BINFO_BASE_ITERATE (TYPE_BINFO (class), i, base_binfo); i++)
6843 if ((BINFO_TYPE (base_binfo) != object_type_node)
6845 lookup_java_method2 (BINFO_TYPE (base_binfo), method_decl, 1)))
6848 for (i = 0; BINFO_BASE_ITERATE (TYPE_BINFO (class), i, base_binfo); i++)
6850 to_return = lookup_java_interface_method2
6851 (BINFO_TYPE (base_binfo), method_decl);
6859 /* Lookup method using their name and partial signature. Return a
6860 matching method only if their types differ. */
6863 lookup_java_method2 (tree clas, tree method_decl, int do_interface)
6865 tree method, method_signature, method_name, method_type, name;
6867 method_signature = build_java_argument_signature (TREE_TYPE (method_decl));
6868 name = DECL_NAME (method_decl);
6869 method_name = (TREE_CODE (name) == EXPR_WITH_FILE_LOCATION ?
6870 EXPR_WFL_NODE (name) : name);
6871 method_type = TREE_TYPE (TREE_TYPE (method_decl));
6873 while (clas != NULL_TREE)
6875 for (method = TYPE_METHODS (clas);
6876 method != NULL_TREE; method = TREE_CHAIN (method))
6878 tree method_sig = build_java_argument_signature (TREE_TYPE (method));
6879 tree name = DECL_NAME (method);
6880 if ((TREE_CODE (name) == EXPR_WITH_FILE_LOCATION ?
6881 EXPR_WFL_NODE (name) : name) == method_name
6882 && method_sig == method_signature
6883 && TREE_TYPE (TREE_TYPE (method)) != method_type)
6886 clas = (do_interface ? NULL_TREE : CLASSTYPE_SUPER (clas));
6891 /* Return the line that matches DECL line number, and try its best to
6892 position the column number. Used during error reports.
6893 FUTURE/FIXME: return source_location instead of node. */
6895 static GTY(()) tree cl_v;
6897 lookup_cl (tree decl)
6899 #ifndef USE_MAPPED_LOCATION
6906 if (cl_v == NULL_TREE)
6908 cl_v = build_unknown_wfl (NULL_TREE);
6911 #ifdef USE_MAPPED_LOCATION
6912 SET_EXPR_LOCATION (cl_v, DECL_SOURCE_LOCATION (decl));
6914 EXPR_WFL_FILENAME_NODE (cl_v) = get_identifier (DECL_SOURCE_FILE (decl));
6915 EXPR_WFL_SET_LINECOL (cl_v, DECL_SOURCE_LINE (decl), -1);
6917 line = java_get_line_col (EXPR_WFL_FILENAME (cl_v),
6918 EXPR_WFL_LINENO (cl_v), EXPR_WFL_COLNO (cl_v));
6920 found = strstr ((const char *)line,
6921 (const char *)IDENTIFIER_POINTER (DECL_NAME (decl)));
6923 EXPR_WFL_SET_LINECOL (cl_v, EXPR_WFL_LINENO (cl_v), found - line);
6929 /* Look for a simple name in the single-type import list */
6932 find_name_in_single_imports (tree name)
6936 for (node = ctxp->import_list; node; node = TREE_CHAIN (node))
6937 if (TREE_VALUE (node) == name)
6938 return (EXPR_WFL_NODE (TREE_PURPOSE (node)));
6943 /* Process all single-type import. */
6946 process_imports (void)
6951 for (import = ctxp->import_list; import; import = TREE_CHAIN (import))
6953 tree to_be_found = EXPR_WFL_NODE (TREE_PURPOSE (import));
6954 char *original_name;
6956 original_name = xmemdup (IDENTIFIER_POINTER (to_be_found),
6957 IDENTIFIER_LENGTH (to_be_found),
6958 IDENTIFIER_LENGTH (to_be_found) + 1);
6960 /* Don't load twice something already defined. */
6961 if (IDENTIFIER_CLASS_VALUE (to_be_found))
6968 QUALIFIED_P (to_be_found) = 1;
6969 load_class (to_be_found, 0);
6971 check_pkg_class_access (to_be_found, TREE_PURPOSE (import), true, NULL_TREE);
6973 /* We found it, we can bail out */
6974 if (IDENTIFIER_CLASS_VALUE (to_be_found))
6976 check_deprecation (TREE_PURPOSE (import),
6977 IDENTIFIER_CLASS_VALUE (to_be_found));
6981 /* We haven't found it. Maybe we're trying to access an
6982 inner class. The only way for us to know is to try again
6983 after having dropped a qualifier. If we can't break it further,
6984 we have an error. */
6985 if (split_qualified_name (&left, NULL, to_be_found))
6990 if (!IDENTIFIER_CLASS_VALUE (to_be_found))
6992 parse_error_context (TREE_PURPOSE (import),
6993 "Class or interface `%s' not found in import",
6998 free (original_name);
7005 /* Possibly find and mark a class imported by a single-type import
7009 find_in_imports (tree enclosing_type, tree class_type)
7011 tree import = (enclosing_type ? TYPE_IMPORT_LIST (enclosing_type) :
7015 if (TREE_VALUE (import) == TYPE_NAME (class_type))
7017 TYPE_NAME (class_type) = EXPR_WFL_NODE (TREE_PURPOSE (import));
7018 QUALIFIED_P (TYPE_NAME (class_type)) = 1;
7021 import = TREE_CHAIN (import);
7026 note_possible_classname (const char *name, int len)
7029 if (len > 5 && strncmp (&name [len-5], ".java", 5) == 0)
7031 else if (len > 6 && strncmp (&name [len-6], ".class", 6) == 0)
7035 node = ident_subst (name, len, "", '/', '.', "");
7036 IS_A_CLASSFILE_NAME (node) = 1; /* Or soon to be */
7037 QUALIFIED_P (node) = strchr (name, '/') ? 1 : 0;
7041 /* Read a import directory, gathering potential match for further type
7042 references. Indifferently reads a filesystem or a ZIP archive
7046 read_import_dir (tree wfl)
7048 tree package_id = EXPR_WFL_NODE (wfl);
7049 const char *package_name = IDENTIFIER_POINTER (package_id);
7050 int package_length = IDENTIFIER_LENGTH (package_id);
7052 JCF *saved_jcf = current_jcf;
7057 struct buffer filename[1];
7059 if (IS_AN_IMPORT_ON_DEMAND_P (package_id))
7061 IS_AN_IMPORT_ON_DEMAND_P (package_id) = 1;
7063 BUFFER_INIT (filename);
7064 buffer_grow (filename, package_length + 100);
7066 for (entry = jcf_path_start (); entry != NULL; entry = jcf_path_next (entry))
7068 const char *entry_name = jcf_path_name (entry);
7069 int entry_length = strlen (entry_name);
7070 if (jcf_path_is_zipfile (entry))
7073 buffer_grow (filename, entry_length);
7074 memcpy (filename->data, entry_name, entry_length - 1);
7075 filename->data[entry_length-1] = '\0';
7076 zipf = opendir_in_zip ((const char *) filename->data, jcf_path_is_system (entry));
7078 error ("malformed .zip archive in CLASSPATH: %s", entry_name);
7081 ZipDirectory *zipd = (ZipDirectory *) zipf->central_directory;
7082 BUFFER_RESET (filename);
7083 for (k = 0; k < package_length; k++)
7085 char ch = package_name[k];
7086 *filename->ptr++ = ch == '.' ? '/' : ch;
7088 *filename->ptr++ = '/';
7090 for (k = 0; k < zipf->count; k++, zipd = ZIPDIR_NEXT (zipd))
7092 const char *current_entry = ZIPDIR_FILENAME (zipd);
7093 int current_entry_len = zipd->filename_length;
7095 if (current_entry_len >= BUFFER_LENGTH (filename)
7096 && strncmp ((const char *) filename->data, current_entry,
7097 BUFFER_LENGTH (filename)) != 0)
7099 found |= note_possible_classname (current_entry,
7106 BUFFER_RESET (filename);
7107 buffer_grow (filename, entry_length + package_length + 4);
7108 strcpy ((char *) filename->data, entry_name);
7109 filename->ptr = filename->data + entry_length;
7110 for (k = 0; k < package_length; k++)
7112 char ch = package_name[k];
7113 *filename->ptr++ = ch == '.' ? '/' : ch;
7115 *filename->ptr = '\0';
7117 dirp = opendir ((const char *) filename->data);
7120 *filename->ptr++ = '/';
7125 struct dirent *direntp = readdir (dirp);
7128 d_name = direntp->d_name;
7129 len = strlen (direntp->d_name);
7130 buffer_grow (filename, len+1);
7131 strcpy ((char *) filename->ptr, d_name);
7132 found |= note_possible_classname ((const char *) filename->data + entry_length,
7133 package_length+len+1);
7140 free (filename->data);
7142 /* Here we should have a unified way of retrieving an entry, to be
7146 static int first = 1;
7149 error ("Can't find default package `%s'. Check the CLASSPATH environment variable and the access to the archives", package_name);
7154 parse_error_context (wfl, "Package `%s' not found in import",
7156 current_jcf = saved_jcf;
7159 current_jcf = saved_jcf;
7162 /* Possibly find a type in the import on demands specified
7163 types. Returns 1 if an error occurred, 0 otherwise. Run through the
7164 entire list, to detected potential double definitions. */
7167 find_in_imports_on_demand (tree enclosing_type, tree class_type)
7169 tree class_type_name = TYPE_NAME (class_type);
7170 tree import = (enclosing_type ? TYPE_IMPORT_DEMAND_LIST (enclosing_type) :
7171 ctxp->import_demand_list);
7172 tree cl = NULL_TREE;
7173 int seen_once = -1; /* -1 when not set, 1 if seen once, >1 otherwise. */
7174 int to_return = -1; /* -1 when not set, 0 or 1 otherwise */
7177 for (; import; import = TREE_CHAIN (import))
7179 location_t saved_location = input_location;
7181 const char *id_name;
7182 tree decl, type_name_copy;
7184 obstack_grow (&temporary_obstack,
7185 IDENTIFIER_POINTER (EXPR_WFL_NODE (TREE_PURPOSE (import))),
7186 IDENTIFIER_LENGTH (EXPR_WFL_NODE (TREE_PURPOSE (import))));
7187 obstack_1grow (&temporary_obstack, '.');
7188 obstack_grow0 (&temporary_obstack,
7189 IDENTIFIER_POINTER (class_type_name),
7190 IDENTIFIER_LENGTH (class_type_name));
7191 id_name = obstack_finish (&temporary_obstack);
7193 if (! (node = maybe_get_identifier (id_name)))
7196 /* Setup input_line so that it refers to the line of the import (in
7197 case we parse a class file and encounter errors */
7198 #ifdef USE_MAPPED_LOCATION
7199 input_location = EXPR_LOCATION (TREE_PURPOSE (import));
7201 input_line = EXPR_WFL_LINENO (TREE_PURPOSE (import));
7204 type_name_copy = TYPE_NAME (class_type);
7205 TYPE_NAME (class_type) = node;
7206 QUALIFIED_P (node) = 1;
7207 decl = IDENTIFIER_CLASS_VALUE (node);
7209 /* If there is no DECL set for the class or if the class isn't
7210 loaded and not seen in source yet, then load */
7211 if (!decl || ! CLASS_LOADED_P (TREE_TYPE (decl)))
7213 load_class (node, 0);
7214 decl = IDENTIFIER_CLASS_VALUE (node);
7216 if (decl && ! INNER_CLASS_P (TREE_TYPE (decl)))
7217 access_check = check_pkg_class_access (node, TREE_PURPOSE (import),
7220 /* 6.6.1: Inner classes are subject to member access rules. */
7223 input_location = saved_location;
7225 /* If the loaded class is not accessible or couldn't be loaded,
7226 we restore the original TYPE_NAME and process the next
7228 if (access_check || !decl)
7230 TYPE_NAME (class_type) = type_name_copy;
7234 /* If the loaded class is accessible, we keep a tab on it to
7235 detect and report multiple inclusions. */
7236 if (IS_A_CLASSFILE_NAME (node))
7240 cl = TREE_PURPOSE (import);
7243 else if (seen_once >= 0)
7245 tree location = (cl ? cl : TREE_PURPOSE (import));
7246 tree package = (cl ? EXPR_WFL_NODE (cl) :
7247 EXPR_WFL_NODE (TREE_PURPOSE (import)));
7251 "Type `%s' also potentially defined in package `%s'",
7252 IDENTIFIER_POINTER (TYPE_NAME (class_type)),
7253 IDENTIFIER_POINTER (package));
7256 to_return = access_check;
7262 return (seen_once < 0 ? 0 : seen_once); /* It's ok not to have found */
7265 /* Add package NAME to the list of packages encountered so far. To
7266 speed up class lookup in do_resolve_class, we make sure a
7267 particular package is added only once. */
7270 register_package (tree name)
7276 pht = htab_create (50, htab_hash_pointer, htab_eq_pointer, NULL);
7278 e = htab_find_slot (pht, name, INSERT);
7281 package_list = chainon (package_list, build_tree_list (name, NULL));
7287 resolve_package (tree pkg, tree *next, tree *type_name)
7290 tree decl = NULL_TREE;
7291 *type_name = NULL_TREE;
7293 /* The trick is to determine when the package name stops and were
7294 the name of something contained in the package starts. Then we
7295 return a fully qualified name of what we want to get. */
7297 *next = EXPR_WFL_QUALIFICATION (pkg);
7299 /* Try to progressively construct a type name */
7300 if (TREE_CODE (pkg) == EXPR_WITH_FILE_LOCATION)
7301 for (current = EXPR_WFL_QUALIFICATION (pkg);
7302 current; current = TREE_CHAIN (current))
7304 /* If we don't have what we're expecting, exit now. TYPE_NAME
7305 will be null and the error caught later. */
7306 if (TREE_CODE (QUAL_WFL (current)) != EXPR_WITH_FILE_LOCATION)
7309 merge_qualified_name (*type_name, EXPR_WFL_NODE (QUAL_WFL (current)));
7310 if ((decl = resolve_no_layout (*type_name, NULL_TREE)))
7312 /* resolve_package should be used in a loop, hence we
7313 point at this one to naturally process the next one at
7314 the next iteration. */
7323 /* Check accessibility of inner classes according to member access rules.
7324 DECL is the inner class, ENCLOSING_DECL is the class from which the
7325 access is being attempted. */
7328 check_inner_class_access (tree decl, tree enclosing_decl, tree cl)
7331 tree enclosing_decl_type;
7333 /* We don't issue an error message when CL is null. CL can be null
7334 as a result of processing a JDEP crafted by source_start_java_method
7335 for the purpose of patching its parm decl. But the error would
7336 have been already trapped when fixing the method's signature.
7337 DECL can also be NULL in case of earlier errors. */
7341 enclosing_decl_type = TREE_TYPE (enclosing_decl);
7343 if (CLASS_PRIVATE (decl))
7345 /* Access is permitted only within the body of the top-level
7346 class in which DECL is declared. */
7347 tree top_level = decl;
7348 while (DECL_CONTEXT (top_level))
7349 top_level = DECL_CONTEXT (top_level);
7350 while (DECL_CONTEXT (enclosing_decl))
7351 enclosing_decl = DECL_CONTEXT (enclosing_decl);
7352 if (top_level == enclosing_decl)
7356 else if (CLASS_PROTECTED (decl))
7359 /* Access is permitted from within the same package... */
7360 if (in_same_package (decl, enclosing_decl))
7363 /* ... or from within the body of a subtype of the context in which
7364 DECL is declared. */
7365 decl_context = DECL_CONTEXT (decl);
7366 while (enclosing_decl)
7368 if (CLASS_INTERFACE (decl))
7370 if (interface_of_p (TREE_TYPE (decl_context),
7371 enclosing_decl_type))
7376 /* Eww. The order of the arguments is different!! */
7377 if (inherits_from_p (enclosing_decl_type,
7378 TREE_TYPE (decl_context)))
7381 enclosing_decl = DECL_CONTEXT (enclosing_decl);
7383 access = "protected";
7385 else if (! CLASS_PUBLIC (decl))
7387 /* Access is permitted only from within the same package as DECL. */
7388 if (in_same_package (decl, enclosing_decl))
7390 access = "non-public";
7393 /* Class is public. */
7396 parse_error_context (cl, "Nested %s %s is %s; cannot be accessed from here",
7397 (CLASS_INTERFACE (decl) ? "interface" : "class"),
7398 lang_printable_name (decl, 2), access);
7401 /* Accessibility check for top-level classes. If CLASS_NAME is in a
7402 foreign package, it must be PUBLIC. Return 0 if no access
7403 violations were found, 1 otherwise. If VERBOSE is true and an error
7404 was found, it is reported and accounted for. If CL is NULL then
7405 look it up with THIS_DECL. */
7408 check_pkg_class_access (tree class_name, tree cl, bool verbose, tree this_decl)
7412 if (!IDENTIFIER_CLASS_VALUE (class_name))
7415 if (!(type = TREE_TYPE (IDENTIFIER_CLASS_VALUE (class_name))))
7418 if (!CLASS_PUBLIC (TYPE_NAME (type)))
7420 /* Access to a private class within the same package is
7423 split_qualified_name (&l, &r, class_name);
7424 if (!QUALIFIED_P (class_name) && !ctxp->package)
7425 /* Both in the empty package. */
7427 if (l == ctxp->package)
7428 /* Both in the same package. */
7433 (cl == NULL ? lookup_cl (this_decl): cl,
7434 "Can't access %s `%s'. Only public classes and interfaces in other packages can be accessed",
7435 (CLASS_INTERFACE (TYPE_NAME (type)) ? "interface" : "class"),
7436 IDENTIFIER_POINTER (class_name));
7442 /* Local variable declaration. */
7445 declare_local_variables (int modifier, tree type, tree vlist)
7447 tree decl, current, saved_type;
7448 tree type_wfl = NULL_TREE;
7452 /* Push a new block if statements were seen between the last time we
7453 pushed a block and now. Keep a count of blocks to close */
7454 if (BLOCK_EXPR_BODY (GET_CURRENT_BLOCK (current_function_decl)))
7456 tree b = enter_block ();
7457 BLOCK_IS_IMPLICIT (b) = 1;
7463 for (i = 0; i < ARRAY_SIZE (ctxp->modifier_ctx); i++)
7464 if (1 << i & modifier)
7466 if (modifier == ACC_FINAL)
7471 (ctxp->modifier_ctx [i],
7472 "Only `final' is allowed as a local variables modifier");
7477 /* Obtain an incomplete type if TYPE is not complete. TYPE_WFL will
7478 hold the TYPE value if a new incomplete has to be created (as
7479 opposed to being found already existing and reused). */
7480 SET_TYPE_FOR_RESOLUTION (type, type_wfl, must_chain);
7482 /* If TYPE is fully resolved and we don't have a reference, make one */
7483 PROMOTE_RECORD_IF_COMPLETE (type, must_chain);
7485 /* Go through all the declared variables */
7486 for (current = vlist, saved_type = type; current;
7487 current = TREE_CHAIN (current), type = saved_type)
7489 tree other, real_type;
7490 tree wfl = TREE_PURPOSE (current);
7491 tree name = EXPR_WFL_NODE (wfl);
7492 tree init = TREE_VALUE (current);
7494 /* Process NAME, as it may specify extra dimension(s) for it */
7495 type = build_array_from_name (type, type_wfl, name, &name);
7497 /* Variable redefinition check */
7498 if ((other = lookup_name_in_blocks (name)))
7500 variable_redefinition_error (wfl, name, TREE_TYPE (other),
7501 DECL_SOURCE_LINE (other));
7505 /* Type adjustment. We may have just readjusted TYPE because
7506 the variable specified more dimensions. Make sure we have
7507 a reference if we can and don't have one already. */
7508 PROMOTE_RECORD_IF_COMPLETE (type, must_chain);
7510 real_type = GET_REAL_TYPE (type);
7511 /* Never layout this decl. This will be done when its scope
7513 decl = build_decl (VAR_DECL, name, real_type);
7514 MAYBE_CREATE_VAR_LANG_DECL_SPECIFIC (decl);
7515 DECL_FINAL (decl) = final_p;
7516 BLOCK_CHAIN_DECL (decl);
7518 /* If doing xreferencing, replace the line number with the WFL
7520 #ifdef USE_MAPPED_LOCATION
7522 DECL_SOURCE_LOCATION (decl) = EXPR_LOCATION (wfl);
7525 DECL_SOURCE_LINE (decl) = EXPR_WFL_LINECOL (wfl);
7528 /* Don't try to use an INIT statement when an error was found */
7529 if (init && java_error_count)
7532 /* Remember it if this is an initialized-upon-declaration final
7534 if (init && final_p)
7536 DECL_LOCAL_FINAL_IUD (decl) = 1;
7539 /* Add the initialization function to the current function's code */
7542 /* Name might have been readjusted */
7543 EXPR_WFL_NODE (TREE_OPERAND (init, 0)) = name;
7544 MODIFY_EXPR_FROM_INITIALIZATION_P (init) = 1;
7545 java_method_add_stmt (current_function_decl,
7546 build_debugable_stmt (EXPR_WFL_LINECOL (init),
7550 /* Setup dependency the type of the decl */
7554 register_incomplete_type (JDEP_VARIABLE, type_wfl, decl, type);
7555 dep = CLASSD_LAST (ctxp->classd_list);
7556 JDEP_GET_PATCH (dep) = &TREE_TYPE (decl);
7559 SOURCE_FRONTEND_DEBUG (("Defined locals"));
7562 /* Called during parsing. Build decls from argument list. */
7565 source_start_java_method (tree fndecl)
7574 current_function_decl = fndecl;
7576 /* New scope for the function */
7578 for (tem = TYPE_ARG_TYPES (TREE_TYPE (fndecl)), i = 0;
7579 tem != end_params_node; tem = TREE_CHAIN (tem), i++)
7581 tree type = TREE_VALUE (tem);
7582 tree name = TREE_PURPOSE (tem);
7584 /* If type is incomplete. Create an incomplete decl and ask for
7585 the decl to be patched later */
7586 if (INCOMPLETE_TYPE_P (type))
7589 tree real_type = GET_REAL_TYPE (type);
7590 parm_decl = build_decl (PARM_DECL, name, real_type);
7591 type = obtain_incomplete_type (type);
7592 register_incomplete_type (JDEP_PARM, NULL_TREE, NULL_TREE, type);
7593 jdep = CLASSD_LAST (ctxp->classd_list);
7594 JDEP_MISC (jdep) = name;
7595 JDEP_GET_PATCH (jdep) = &TREE_TYPE (parm_decl);
7598 parm_decl = build_decl (PARM_DECL, name, type);
7600 /* Remember if a local variable was declared final (via its
7601 TREE_LIST of type/name.) Set DECL_FINAL accordingly. */
7602 if (ARG_FINAL_P (tem))
7604 MAYBE_CREATE_VAR_LANG_DECL_SPECIFIC (parm_decl);
7605 DECL_FINAL (parm_decl) = 1;
7608 BLOCK_CHAIN_DECL (parm_decl);
7610 tem = BLOCK_EXPR_DECLS (DECL_FUNCTION_BODY (current_function_decl));
7611 BLOCK_EXPR_DECLS (DECL_FUNCTION_BODY (current_function_decl)) =
7613 DECL_ARG_SLOT_COUNT (current_function_decl) = i;
7614 DECL_MAX_LOCALS (current_function_decl) = i;
7617 /* Called during parsing. Creates an artificial method declaration. */
7620 create_artificial_method (tree class, int flags, tree type,
7621 tree name, tree args)
7624 location_t save_location = input_location;
7626 input_location = DECL_SOURCE_LOCATION (TYPE_NAME (class));
7627 mdecl = make_node (FUNCTION_TYPE);
7628 TREE_TYPE (mdecl) = type;
7629 TYPE_ARG_TYPES (mdecl) = args;
7630 /* We used to compute the signature of MDECL here and then use
7631 add_method(), but that failed because our caller might modify
7632 the type of the returned method, which trashes the cache in
7633 get_type_from_signature(). */
7634 mdecl = add_method_1 (class, flags, name, mdecl);
7635 input_location = save_location;
7636 DECL_ARTIFICIAL (mdecl) = 1;
7640 /* Starts the body if an artificial method. */
7643 start_artificial_method_body (tree mdecl)
7645 #ifdef USE_MAPPED_LOCATION
7646 DECL_SOURCE_LOCATION (mdecl) = ctxp->file_start_location;
7647 DECL_FUNCTION_LAST_LINE (mdecl) = ctxp->file_start_location;
7649 DECL_SOURCE_LINE (mdecl) = 1;
7650 DECL_FUNCTION_LAST_LINE (mdecl) = 1;
7652 source_start_java_method (mdecl);
7657 end_artificial_method_body (tree mdecl)
7659 /* exit_block modifies DECL_FUNCTION_BODY (current_function_decl).
7660 It has to be evaluated first. (if mdecl is current_function_decl,
7661 we have an undefined behavior if no temporary variable is used.) */
7662 tree b = exit_block ();
7663 BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (mdecl)) = b;
7667 /* Dump a tree of some kind. This is a convenience wrapper for the
7668 dump_* functions in tree-dump.c. */
7670 dump_java_tree (enum tree_dump_index phase, tree t)
7675 stream = dump_begin (phase, &flags);
7679 dump_node (t, flags, stream);
7680 dump_end (phase, stream);
7684 /* Terminate a function and expand its body. */
7687 source_end_java_method (void)
7689 tree fndecl = current_function_decl;
7694 java_parser_context_save_global ();
7695 #ifdef USE_MAPPED_LOCATION
7696 input_location = ctxp->last_ccb_indent1;
7698 input_line = ctxp->last_ccb_indent1;
7701 /* Turn function bodies with only a NOP expr null, so they don't get
7702 generated at all and we won't get warnings when using the -W
7704 if (IS_EMPTY_STMT (BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (fndecl))))
7705 BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (fndecl)) = NULL_TREE;
7707 if (BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (fndecl))
7708 && ! flag_emit_class_files
7709 && ! flag_emit_xref)
7710 finish_method (fndecl);
7712 current_function_decl = NULL_TREE;
7713 java_parser_context_restore_global ();
7714 current_function_decl = NULL_TREE;
7717 /* Record EXPR in the current function block. Complements compound
7718 expression second operand if necessary. */
7721 java_method_add_stmt (tree fndecl, tree expr)
7723 if (!GET_CURRENT_BLOCK (fndecl))
7725 return add_stmt_to_block (GET_CURRENT_BLOCK (fndecl), NULL_TREE, expr);
7729 add_stmt_to_block (tree b, tree type, tree stmt)
7731 tree body = BLOCK_EXPR_BODY (b), c;
7733 if (java_error_count)
7736 if ((c = add_stmt_to_compound (body, type, stmt)) == body)
7739 BLOCK_EXPR_BODY (b) = c;
7740 TREE_SIDE_EFFECTS (c) = 1;
7744 /* Lays out the methods for the classes seen so far. */
7747 java_layout_seen_class_methods (void)
7749 tree previous_list = all_class_list;
7750 tree end = NULL_TREE;
7755 for (current = previous_list;
7756 current != end; current = TREE_CHAIN (current))
7758 tree decl = TREE_VALUE (current);
7759 tree cls = TREE_TYPE (decl);
7761 input_location = DECL_SOURCE_LOCATION (decl);
7763 if (! CLASS_LOADED_P (cls))
7764 load_class (cls, 0);
7766 layout_class_methods (cls);
7769 /* Note that new classes might have been added while laying out
7770 methods, changing the value of all_class_list. */
7772 if (previous_list != all_class_list)
7774 end = previous_list;
7775 previous_list = all_class_list;
7782 static GTY(()) tree stop_reordering;
7784 java_reorder_fields (void)
7788 for (current = gclass_list; current; current = TREE_CHAIN (current))
7790 output_class = current_class = TREE_TYPE (TREE_VALUE (current));
7792 if (current_class == stop_reordering)
7795 /* Reverse the fields, but leave the dummy field in front.
7796 Fields are already ordered for Object and Class */
7797 if (TYPE_FIELDS (current_class) && current_class != object_type_node
7798 && current_class != class_type_node)
7800 /* If the dummy field is there, reverse the right fields and
7801 just layout the type for proper fields offset */
7802 if (!DECL_NAME (TYPE_FIELDS (current_class)))
7804 tree fields = TYPE_FIELDS (current_class);
7805 TREE_CHAIN (fields) = nreverse (TREE_CHAIN (fields));
7806 TYPE_SIZE (current_class) = NULL_TREE;
7808 /* We don't have a dummy field, we need to layout the class,
7809 after having reversed the fields */
7812 TYPE_FIELDS (current_class) =
7813 nreverse (TYPE_FIELDS (current_class));
7814 TYPE_SIZE (current_class) = NULL_TREE;
7818 /* There are cases were gclass_list will be empty. */
7820 stop_reordering = TREE_TYPE (TREE_VALUE (gclass_list));
7823 /* Layout the methods of all classes loaded in one way or another.
7824 Check methods of source parsed classes. Then reorder the
7825 fields and layout the classes or the type of all source parsed
7829 java_layout_classes (void)
7832 int save_error_count = java_error_count;
7834 /* Layout the methods of all classes seen so far */
7835 java_layout_seen_class_methods ();
7836 java_parse_abort_on_error ();
7837 all_class_list = NULL_TREE;
7839 /* Then check the methods of all parsed classes */
7840 for (current = gclass_list; current; current = TREE_CHAIN (current))
7841 if (CLASS_FROM_SOURCE_P (TREE_TYPE (TREE_VALUE (current))))
7842 java_check_methods (TREE_VALUE (current));
7843 java_parse_abort_on_error ();
7845 for (current = gclass_list; current; current = TREE_CHAIN (current))
7847 output_class = current_class = TREE_TYPE (TREE_VALUE (current));
7848 layout_class (current_class);
7850 /* Error reported by the caller */
7851 if (java_error_count)
7855 /* We might have reloaded classes durign the process of laying out
7856 classes for code generation. We must layout the methods of those
7857 late additions, as constructor checks might use them */
7858 java_layout_seen_class_methods ();
7859 java_parse_abort_on_error ();
7862 /* Expand methods in the current set of classes remembered for
7866 java_complete_expand_classes (void)
7870 do_not_fold = flag_emit_xref;
7872 for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
7873 if (!INNER_CLASS_DECL_P (current))
7874 java_complete_expand_class (current);
7877 /* Expand the methods found in OUTER, starting first by OUTER's inner
7881 java_complete_expand_class (tree outer)
7885 /* We need to go after all inner classes and start expanding them,
7886 starting with most nested ones. We have to do that because nested
7887 classes might add functions to outer classes */
7889 for (inner_list = DECL_INNER_CLASS_LIST (outer);
7890 inner_list; inner_list = TREE_CHAIN (inner_list))
7891 java_complete_expand_class (TREE_PURPOSE (inner_list));
7893 java_complete_expand_methods (outer);
7896 /* Expand methods registered in CLASS_DECL. The general idea is that
7897 we expand regular methods first. This allows us get an estimate on
7898 how outer context local alias fields are really used so we can add
7899 to the constructor just enough code to initialize them properly (it
7900 also lets us generate finit$ correctly.) Then we expand the
7901 constructors and then <clinit>. */
7904 java_complete_expand_methods (tree class_decl)
7906 tree clinit, decl, first_decl;
7908 output_class = current_class = TREE_TYPE (class_decl);
7910 /* Pre-expand <clinit> to figure whether we really need it or
7911 not. If we do need it, we pre-expand the static fields so they're
7912 ready to be used somewhere else. <clinit> will be fully expanded
7913 after we processed the constructors. */
7914 first_decl = TYPE_METHODS (current_class);
7915 clinit = maybe_generate_pre_expand_clinit (current_class);
7917 /* Then generate finit$ (if we need to) because constructors will
7919 if (TYPE_FINIT_STMT_LIST (current_class))
7920 java_complete_expand_method (generate_finit (current_class));
7922 /* Then generate instinit$ (if we need to) because constructors will
7924 if (TYPE_II_STMT_LIST (current_class))
7925 java_complete_expand_method (generate_instinit (current_class));
7927 /* Now do the constructors */
7928 for (decl = first_decl ; !java_error_count && decl; decl = TREE_CHAIN (decl))
7930 if (!DECL_CONSTRUCTOR_P (decl))
7932 java_complete_expand_method (decl);
7935 /* First, do the ordinary methods. */
7936 for (decl = first_decl; decl; decl = TREE_CHAIN (decl))
7938 /* Ctors aren't part of this batch. */
7939 if (DECL_CONSTRUCTOR_P (decl) || DECL_CLINIT_P (decl))
7942 /* Skip abstract or native methods -- but do handle native
7943 methods when generating JNI stubs. */
7944 if (METHOD_ABSTRACT (decl) || (! flag_jni && METHOD_NATIVE (decl)))
7946 DECL_FUNCTION_BODY (decl) = NULL_TREE;
7950 if (METHOD_NATIVE (decl))
7953 current_function_decl = decl;
7954 body = build_jni_stub (decl);
7955 BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (decl)) = body;
7958 java_complete_expand_method (decl);
7961 /* If there is indeed a <clinit>, fully expand it now */
7964 /* Prevent the use of `this' inside <clinit> */
7965 ctxp->explicit_constructor_p = 1;
7966 java_complete_expand_method (clinit);
7967 ctxp->explicit_constructor_p = 0;
7970 /* We might have generated a class$ that we now want to expand */
7971 if (TYPE_DOT_CLASS (current_class))
7972 java_complete_expand_method (TYPE_DOT_CLASS (current_class));
7974 /* Now verify constructor circularity (stop after the first one we
7976 if (!CLASS_INTERFACE (class_decl))
7977 for (decl = TYPE_METHODS (current_class); decl; decl = TREE_CHAIN (decl))
7978 if (DECL_CONSTRUCTOR_P (decl)
7979 && verify_constructor_circularity (decl, decl))
7983 /* Attempt to create <clinit>. Pre-expand static fields so they can be
7984 safely used in some other methods/constructors. */
7987 maybe_generate_pre_expand_clinit (tree class_type)
7989 tree current, mdecl;
7991 if (!TYPE_CLINIT_STMT_LIST (class_type))
7994 /* Go through all static fields and pre expand them */
7995 for (current = TYPE_FIELDS (class_type); current;
7996 current = TREE_CHAIN (current))
7997 if (FIELD_STATIC (current))
7998 build_field_ref (NULL_TREE, class_type, DECL_NAME (current));
8000 /* Then build the <clinit> method */
8001 mdecl = create_artificial_method (class_type, ACC_STATIC, void_type_node,
8002 clinit_identifier_node, end_params_node);
8003 layout_class_method (class_type, CLASSTYPE_SUPER (class_type),
8005 start_artificial_method_body (mdecl);
8007 /* We process the list of assignment we produced as the result of
8008 the declaration of initialized static field and add them as
8009 statement to the <clinit> method. */
8010 for (current = TYPE_CLINIT_STMT_LIST (class_type); current;
8011 current = TREE_CHAIN (current))
8013 tree stmt = current;
8014 /* We build the assignment expression that will initialize the
8015 field to its value. There are strict rules on static
8016 initializers (8.5). FIXME */
8017 if (TREE_CODE (stmt) != BLOCK && !IS_EMPTY_STMT (stmt))
8018 stmt = build_debugable_stmt (EXPR_WFL_LINECOL (stmt), stmt);
8019 java_method_add_stmt (mdecl, stmt);
8022 end_artificial_method_body (mdecl);
8024 /* Now we want to place <clinit> as the last method (because we need
8025 it at least for interface so that it doesn't interfere with the
8026 dispatch table based lookup. */
8027 if (TREE_CHAIN (TYPE_METHODS (class_type)))
8029 current = TREE_CHAIN (TYPE_METHODS (class_type));
8030 TYPE_METHODS (class_type) = current;
8032 while (TREE_CHAIN (current))
8033 current = TREE_CHAIN (current);
8035 TREE_CHAIN (current) = mdecl;
8036 TREE_CHAIN (mdecl) = NULL_TREE;
8042 /* Analyzes a method body and look for something that isn't a
8043 MODIFY_EXPR with a constant value. */
8046 analyze_clinit_body (tree this_class, tree bbody)
8049 switch (TREE_CODE (bbody))
8052 bbody = BLOCK_EXPR_BODY (bbody);
8055 case EXPR_WITH_FILE_LOCATION:
8056 bbody = EXPR_WFL_NODE (bbody);
8060 if (analyze_clinit_body (this_class, TREE_OPERAND (bbody, 0)))
8062 bbody = TREE_OPERAND (bbody, 1);
8066 /* If we're generating to class file and we're dealing with an
8067 array initialization, we return 1 to keep <clinit> */
8068 if (TREE_CODE (TREE_OPERAND (bbody, 1)) == NEW_ARRAY_INIT
8069 && flag_emit_class_files)
8072 /* There are a few cases where we're required to keep
8074 - If this is an assignment whose operand is not constant,
8075 - If this is an assignment to a non-initialized field,
8076 - If this field is not a member of the current class.
8078 return (! TREE_CONSTANT (TREE_OPERAND (bbody, 1))
8079 || ! DECL_INITIAL (TREE_OPERAND (bbody, 0))
8080 || DECL_CONTEXT (TREE_OPERAND (bbody, 0)) != this_class);
8089 /* See whether we could get rid of <clinit>. Criteria are: all static
8090 final fields have constant initial values and the body of <clinit>
8091 is empty. Return 1 if <clinit> was discarded, 0 otherwise. */
8094 maybe_yank_clinit (tree mdecl)
8099 if (!DECL_CLINIT_P (mdecl))
8102 /* If the body isn't empty, then we keep <clinit>. Note that if
8103 we're emitting classfiles, this isn't enough not to rule it
8105 fbody = DECL_FUNCTION_BODY (mdecl);
8106 bbody = BLOCK_EXPR_BODY (fbody);
8107 if (bbody && bbody != error_mark_node)
8108 bbody = BLOCK_EXPR_BODY (bbody);
8111 if (bbody && ! flag_emit_class_files && !IS_EMPTY_STMT (bbody))
8114 type = DECL_CONTEXT (mdecl);
8115 current = TYPE_FIELDS (type);
8117 for (current = (current ? TREE_CHAIN (current) : current);
8118 current; current = TREE_CHAIN (current))
8122 /* We're not interested in non-static fields. */
8123 if (!FIELD_STATIC (current))
8126 /* Nor in fields without initializers. */
8127 f_init = DECL_INITIAL (current);
8128 if (f_init == NULL_TREE)
8131 /* Anything that isn't String or a basic type is ruled out -- or
8132 if we know how to deal with it (when doing things natively) we
8133 should generated an empty <clinit> so that SUID are computed
8135 if (! JSTRING_TYPE_P (TREE_TYPE (current))
8136 && ! JNUMERIC_TYPE_P (TREE_TYPE (current)))
8139 if (! FIELD_FINAL (current) || ! TREE_CONSTANT (f_init))
8143 /* Now we analyze the method body and look for something that
8144 isn't a MODIFY_EXPR */
8145 if (!IS_EMPTY_STMT (bbody) && analyze_clinit_body (type, bbody))
8148 /* Get rid of <clinit> in the class' list of methods */
8149 if (TYPE_METHODS (type) == mdecl)
8150 TYPE_METHODS (type) = TREE_CHAIN (mdecl);
8152 for (current = TYPE_METHODS (type); current;
8153 current = TREE_CHAIN (current))
8154 if (TREE_CHAIN (current) == mdecl)
8156 TREE_CHAIN (current) = TREE_CHAIN (mdecl);
8163 /* Install the argument from MDECL. Suitable to completion and
8164 expansion of mdecl's body. */
8167 start_complete_expand_method (tree mdecl)
8171 pushlevel (1); /* Prepare for a parameter push */
8172 tem = BLOCK_EXPR_DECLS (DECL_FUNCTION_BODY (current_function_decl));
8173 DECL_ARGUMENTS (mdecl) = tem;
8175 for (; tem; tem = TREE_CHAIN (tem))
8177 /* TREE_CHAIN (tem) will change after pushdecl. */
8178 tree next = TREE_CHAIN (tem);
8179 tree type = TREE_TYPE (tem);
8180 if (targetm.calls.promote_prototypes (type)
8181 && TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node)
8182 && INTEGRAL_TYPE_P (type))
8183 type = integer_type_node;
8184 DECL_ARG_TYPE (tem) = type;
8185 layout_decl (tem, 0);
8187 /* Re-install the next so that the list is kept and the loop
8189 TREE_CHAIN (tem) = next;
8191 pushdecl_force_head (DECL_ARGUMENTS (mdecl));
8192 input_location = DECL_SOURCE_LOCATION (mdecl);
8193 build_result_decl (mdecl);
8197 /* Complete and expand a method. */
8200 java_complete_expand_method (tree mdecl)
8202 tree fbody, block_body, exception_copy;
8204 current_function_decl = mdecl;
8205 /* Fix constructors before expanding them */
8206 if (DECL_CONSTRUCTOR_P (mdecl))
8207 fix_constructors (mdecl);
8209 /* Expand functions that have a body */
8210 if (!DECL_FUNCTION_BODY (mdecl))
8213 fbody = DECL_FUNCTION_BODY (mdecl);
8214 block_body = BLOCK_EXPR_BODY (fbody);
8215 exception_copy = NULL_TREE;
8217 current_function_decl = mdecl;
8220 fprintf (stderr, " [%s.",
8221 lang_printable_name (DECL_CONTEXT (mdecl), 0));
8222 announce_function (mdecl);
8224 fprintf (stderr, "]");
8226 /* Prepare the function for tree completion */
8227 start_complete_expand_method (mdecl);
8229 /* Install the current this */
8230 current_this = (!METHOD_STATIC (mdecl) ?
8231 BLOCK_EXPR_DECLS (DECL_FUNCTION_BODY (mdecl)) : NULL_TREE);
8233 /* Purge the `throws' list of unchecked exceptions (we save a copy
8234 of the list and re-install it later.) */
8235 exception_copy = copy_list (DECL_FUNCTION_THROWS (mdecl));
8236 purge_unchecked_exceptions (mdecl);
8238 /* Install exceptions thrown with `throws' */
8239 PUSH_EXCEPTIONS (DECL_FUNCTION_THROWS (mdecl));
8241 if (block_body != NULL_TREE)
8243 block_body = java_complete_tree (block_body);
8245 /* Before we check initialization, attached all class initialization
8246 variable to the block_body */
8247 htab_traverse (DECL_FUNCTION_INIT_TEST_TABLE (mdecl),
8248 attach_init_test_initialization_flags, block_body);
8250 if (! flag_emit_xref && ! METHOD_NATIVE (mdecl))
8252 check_for_initialization (block_body, mdecl);
8254 /* Go through all the flags marking the initialization of
8255 static variables and see whether they're definitively
8256 assigned, in which case the type is remembered as
8257 definitively initialized in MDECL. */
8258 if (STATIC_CLASS_INIT_OPT_P ())
8260 /* Always register the context as properly initialized in
8261 MDECL. This used with caution helps removing extra
8262 initialization of self. */
8263 if (METHOD_STATIC (mdecl))
8266 (DECL_FUNCTION_INITIALIZED_CLASS_TABLE (mdecl),
8267 DECL_CONTEXT (mdecl), INSERT)) = DECL_CONTEXT (mdecl);
8271 ctxp->explicit_constructor_p = 0;
8274 BLOCK_EXPR_BODY (fbody) = block_body;
8276 /* If we saw a return but couldn't evaluate it properly, we'll have
8277 an error_mark_node here. */
8278 if (block_body != error_mark_node
8279 && (block_body == NULL_TREE || CAN_COMPLETE_NORMALLY (block_body))
8280 && TREE_CODE (TREE_TYPE (TREE_TYPE (mdecl))) != VOID_TYPE
8282 missing_return_error (current_function_decl);
8284 /* See if we can get rid of <clinit> if MDECL happens to be <clinit> */
8285 maybe_yank_clinit (mdecl);
8287 /* Pop the current level, with special measures if we found errors. */
8288 if (java_error_count)
8289 pushdecl_force_head (DECL_ARGUMENTS (mdecl));
8292 /* Pop the exceptions and sanity check */
8294 if (currently_caught_type_list)
8297 /* Restore the copy of the list of exceptions if emitting xrefs. */
8298 DECL_FUNCTION_THROWS (mdecl) = exception_copy;
8301 /* For with each class for which there's code to generate. */
8304 java_expand_method_bodies (tree class)
8307 for (decl = TYPE_METHODS (class); decl; decl = TREE_CHAIN (decl))
8311 if (! DECL_FUNCTION_BODY (decl))
8314 current_function_decl = decl;
8316 block = BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (decl));
8318 /* Save the function body for gimplify and inlining. */
8319 DECL_SAVED_TREE (decl) = block;
8321 /* It's time to assign the variable flagging static class
8322 initialization based on which classes invoked static methods
8323 are definitely initializing. This should be flagged. */
8324 if (STATIC_CLASS_INIT_OPT_P ())
8326 tree list = DECL_FUNCTION_STATIC_METHOD_INVOCATION_COMPOUND (decl);
8327 for (; list != NULL_TREE; list = TREE_CHAIN (list))
8329 /* Executed for each statement calling a static function.
8330 LIST is a TREE_LIST whose PURPOSE is the called function
8331 and VALUE is a compound whose second operand can be patched
8332 with static class initialization flag assignments. */
8334 tree called_method = TREE_PURPOSE (list);
8335 tree compound = TREE_VALUE (list);
8336 tree assignment_compound_list
8337 = build_tree_list (called_method, NULL);
8339 /* For each class definitely initialized in
8340 CALLED_METHOD, fill ASSIGNMENT_COMPOUND with
8341 assignment to the class initialization flag. */
8342 htab_traverse (DECL_FUNCTION_INITIALIZED_CLASS_TABLE (called_method),
8343 emit_test_initialization,
8344 assignment_compound_list);
8346 if (TREE_VALUE (assignment_compound_list))
8347 TREE_OPERAND (compound, 1)
8348 = TREE_VALUE (assignment_compound_list);
8352 /* Expand the function body. */
8353 source_end_java_method ();
8359 /* This section of the code deals with accessing enclosing context
8360 fields either directly by using the relevant access to this$<n> or
8361 by invoking an access method crafted for that purpose. */
8363 /* Build the necessary access from an inner class to an outer
8364 class. This routine could be optimized to cache previous result
8365 (decl, current_class and returned access). When an access method
8366 needs to be generated, it always takes the form of a read. It might
8367 be later turned into a write by calling outer_field_access_fix. */
8370 build_outer_field_access (tree id, tree decl)
8372 tree access = NULL_TREE;
8373 tree ctx = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (current_class)));
8374 tree decl_ctx = DECL_CONTEXT (decl);
8376 /* If the immediate enclosing context of the current class is the
8377 field decl's class or inherits from it; build the access as
8378 `this$<n>.<field>'. Note that we will break the `private' barrier
8379 if we're not emitting bytecodes. */
8380 if ((ctx == decl_ctx || inherits_from_p (ctx, decl_ctx))
8381 && (!FIELD_PRIVATE (decl) || !flag_emit_class_files ))
8383 tree thisn = build_current_thisn (current_class);
8384 access = make_qualified_primary (build_wfl_node (thisn),
8385 id, EXPR_WFL_LINECOL (id));
8387 /* Otherwise, generate access methods to outer this and access the
8388 field (either using an access method or by direct access.) */
8391 int lc = EXPR_WFL_LINECOL (id);
8393 /* Now we chain the required number of calls to the access$0 to
8394 get a hold to the enclosing instance we need, and then we
8395 build the field access. */
8396 access = build_access_to_thisn (current_class, decl_ctx, lc);
8398 /* If the field is private and we're generating bytecode, then
8399 we generate an access method */
8400 if (FIELD_PRIVATE (decl) && flag_emit_class_files )
8402 tree name = build_outer_field_access_methods (decl);
8403 access = build_outer_field_access_expr (lc, decl_ctx,
8404 name, access, NULL_TREE);
8406 /* Otherwise we use `access$(this$<j>). ... access$(this$<i>).<field>'.
8407 Once again we break the `private' access rule from a foreign
8410 access = make_qualified_primary (access, id, lc);
8412 return resolve_expression_name (access, NULL);
8415 /* Return a nonzero value if NODE describes an outer field inner
8419 outer_field_access_p (tree type, tree decl)
8421 if (!INNER_CLASS_TYPE_P (type)
8422 || TREE_CODE (decl) != FIELD_DECL
8423 || DECL_CONTEXT (decl) == type)
8426 /* If the inner class extends the declaration context of the field
8427 we're trying to access, then this isn't an outer field access */
8428 if (inherits_from_p (type, DECL_CONTEXT (decl)))
8431 for (type = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (type))); ;
8432 type = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (type))))
8434 if (type == DECL_CONTEXT (decl))
8437 if (!DECL_CONTEXT (TYPE_NAME (type)))
8439 /* Before we give up, see whether the field is inherited from
8440 the enclosing context we're considering. */
8441 if (inherits_from_p (type, DECL_CONTEXT (decl)))
8450 /* Return a nonzero value if NODE represents an outer field inner
8451 access that was been already expanded. As a side effect, it returns
8452 the name of the field being accessed and the argument passed to the
8453 access function, suitable for a regeneration of the access method
8454 call if necessary. */
8457 outer_field_expanded_access_p (tree node, tree *name, tree *arg_type,
8462 if (TREE_CODE (node) != CALL_EXPR)
8465 /* Well, gcj generates slightly different tree nodes when compiling
8466 to native or bytecodes. It's the case for function calls. */
8468 if (flag_emit_class_files
8469 && TREE_CODE (node) == CALL_EXPR
8470 && OUTER_FIELD_ACCESS_IDENTIFIER_P (DECL_NAME (TREE_OPERAND (node, 0))))
8472 else if (!flag_emit_class_files)
8474 node = TREE_OPERAND (node, 0);
8476 if (node && TREE_OPERAND (node, 0)
8477 && TREE_CODE (TREE_OPERAND (node, 0)) == ADDR_EXPR)
8479 node = TREE_OPERAND (node, 0);
8480 if (TREE_OPERAND (node, 0)
8481 && TREE_CODE (TREE_OPERAND (node, 0)) == FUNCTION_DECL
8482 && (OUTER_FIELD_ACCESS_IDENTIFIER_P
8483 (DECL_NAME (TREE_OPERAND (node, 0)))))
8488 if (identified && name && arg_type && arg)
8490 tree argument = TREE_OPERAND (node, 1);
8491 *name = DECL_NAME (TREE_OPERAND (node, 0));
8492 *arg_type = TREE_TYPE (TREE_TYPE (TREE_VALUE (argument)));
8493 *arg = TREE_VALUE (argument);
8498 /* Detect in NODE an outer field read access from an inner class and
8499 transform it into a write with RHS as an argument. This function is
8500 called from the java_complete_lhs when an assignment to a LHS can
8504 outer_field_access_fix (tree wfl, tree node, tree rhs)
8506 tree name, arg_type, arg;
8508 if (outer_field_expanded_access_p (node, &name, &arg_type, &arg))
8510 node = build_outer_field_access_expr (EXPR_WFL_LINECOL (wfl),
8511 arg_type, name, arg, rhs);
8512 return java_complete_tree (node);
8517 /* Construct the expression that calls an access method:
8518 <type>.access$<n>(<arg1> [, <arg2>]);
8520 ARG2 can be NULL and will be omitted in that case. It will denote a
8524 build_outer_field_access_expr (int lc, tree type, tree access_method_name,
8525 tree arg1, tree arg2)
8527 tree args, cn, access;
8529 args = arg1 ? arg1 :
8530 build_wfl_node (build_current_thisn (current_class));
8531 args = build_tree_list (NULL_TREE, args);
8534 args = tree_cons (NULL_TREE, arg2, args);
8536 access = build_method_invocation (build_wfl_node (access_method_name), args);
8537 cn = build_wfl_node (DECL_NAME (TYPE_NAME (type)));
8538 return make_qualified_primary (cn, access, lc);
8542 build_new_access_id (void)
8544 static int access_n_counter = 1;
8547 sprintf (buffer, "access$%d", access_n_counter++);
8548 return get_identifier (buffer);
8551 /* Create the static access functions for the outer field DECL. We define a
8553 TREE_TYPE (<field>) access$<n> (DECL_CONTEXT (<field>) inst$) {
8557 TREE_TYPE (<field>) access$<n> (DECL_CONTEXT (<field>) inst$,
8558 TREE_TYPE (<field>) value$) {
8559 return inst$.field = value$;
8561 We should have a usage flags on the DECL so we can lazily turn the ones
8562 we're using for code generation. FIXME.
8566 build_outer_field_access_methods (tree decl)
8568 tree id, args, stmt, mdecl;
8570 if (FIELD_INNER_ACCESS_P (decl))
8571 return FIELD_INNER_ACCESS (decl);
8573 MAYBE_CREATE_VAR_LANG_DECL_SPECIFIC (decl);
8575 /* Create the identifier and a function named after it. */
8576 id = build_new_access_id ();
8578 /* The identifier is marked as bearing the name of a generated write
8579 access function for outer field accessed from inner classes. */
8580 OUTER_FIELD_ACCESS_IDENTIFIER_P (id) = 1;
8582 /* Create the read access */
8583 args = build_tree_list (inst_id, build_pointer_type (DECL_CONTEXT (decl)));
8584 TREE_CHAIN (args) = end_params_node;
8585 stmt = make_qualified_primary (build_wfl_node (inst_id),
8586 build_wfl_node (DECL_NAME (decl)), 0);
8587 stmt = build_return (0, stmt);
8588 mdecl = build_outer_field_access_method (DECL_CONTEXT (decl),
8589 TREE_TYPE (decl), id, args, stmt);
8590 DECL_FUNCTION_ACCESS_DECL (mdecl) = decl;
8592 /* Create the write access method. No write access for final variable */
8593 if (!FIELD_FINAL (decl))
8595 args = build_tree_list (inst_id,
8596 build_pointer_type (DECL_CONTEXT (decl)));
8597 TREE_CHAIN (args) = build_tree_list (wpv_id, TREE_TYPE (decl));
8598 TREE_CHAIN (TREE_CHAIN (args)) = end_params_node;
8599 stmt = make_qualified_primary (build_wfl_node (inst_id),
8600 build_wfl_node (DECL_NAME (decl)), 0);
8601 stmt = build_return (0, build_assignment (ASSIGN_TK, 0, stmt,
8602 build_wfl_node (wpv_id)));
8603 mdecl = build_outer_field_access_method (DECL_CONTEXT (decl),
8604 TREE_TYPE (decl), id,
8607 DECL_FUNCTION_ACCESS_DECL (mdecl) = decl;
8609 /* Return the access name */
8610 return FIELD_INNER_ACCESS (decl) = id;
8613 /* Build an field access method NAME. */
8616 build_outer_field_access_method (tree class, tree type, tree name,
8617 tree args, tree body)
8619 tree saved_current_function_decl, mdecl;
8621 /* Create the method */
8622 mdecl = create_artificial_method (class, ACC_STATIC, type, name, args);
8623 fix_method_argument_names (args, mdecl);
8624 layout_class_method (class, NULL_TREE, mdecl, NULL_TREE);
8626 /* Attach the method body. */
8627 saved_current_function_decl = current_function_decl;
8628 start_artificial_method_body (mdecl);
8629 java_method_add_stmt (mdecl, body);
8630 end_artificial_method_body (mdecl);
8631 current_function_decl = saved_current_function_decl;
8637 /* This section deals with building access function necessary for
8638 certain kinds of method invocation from inner classes. */
8641 build_outer_method_access_method (tree decl)
8643 tree saved_current_function_decl, mdecl;
8644 tree args = NULL_TREE, call_args = NULL_TREE;
8645 tree carg, id, body, class;
8647 int parm_id_count = 0;
8649 /* Test this abort with an access to a private field */
8650 if (!strcmp (IDENTIFIER_POINTER (DECL_NAME (decl)), "access$"))
8653 /* Check the cache first */
8654 if (DECL_FUNCTION_INNER_ACCESS (decl))
8655 return DECL_FUNCTION_INNER_ACCESS (decl);
8657 class = DECL_CONTEXT (decl);
8659 /* Obtain an access identifier and mark it */
8660 id = build_new_access_id ();
8661 OUTER_FIELD_ACCESS_IDENTIFIER_P (id) = 1;
8663 carg = TYPE_ARG_TYPES (TREE_TYPE (decl));
8664 /* Create the arguments, as much as the original */
8665 for (; carg && carg != end_params_node;
8666 carg = TREE_CHAIN (carg))
8668 sprintf (buffer, "write_parm_value$%d", parm_id_count++);
8669 args = chainon (args, build_tree_list (get_identifier (buffer),
8670 TREE_VALUE (carg)));
8672 args = chainon (args, end_params_node);
8674 /* Create the method */
8675 mdecl = create_artificial_method (class, ACC_STATIC,
8676 TREE_TYPE (TREE_TYPE (decl)), id, args);
8677 layout_class_method (class, NULL_TREE, mdecl, NULL_TREE);
8678 /* There is a potential bug here. We should be able to use
8679 fix_method_argument_names, but then arg names get mixed up and
8680 eventually a constructor will have its this$0 altered and the
8681 outer context won't be assignment properly. The testcase is
8683 TYPE_ARG_TYPES (TREE_TYPE (mdecl)) = args;
8685 /* Attach the method body. */
8686 saved_current_function_decl = current_function_decl;
8687 start_artificial_method_body (mdecl);
8689 /* The actual method invocation uses the same args. When invoking a
8690 static methods that way, we don't want to skip the first
8693 if (!METHOD_STATIC (decl))
8694 carg = TREE_CHAIN (carg);
8695 for (; carg && carg != end_params_node; carg = TREE_CHAIN (carg))
8696 call_args = tree_cons (NULL_TREE, build_wfl_node (TREE_PURPOSE (carg)),
8699 body = build_method_invocation (build_wfl_node (DECL_NAME (decl)),
8701 if (!METHOD_STATIC (decl))
8702 body = make_qualified_primary (build_wfl_node (TREE_PURPOSE (args)),
8704 if (TREE_TYPE (TREE_TYPE (decl)) != void_type_node)
8705 body = build_return (0, body);
8706 java_method_add_stmt (mdecl,body);
8707 end_artificial_method_body (mdecl);
8708 current_function_decl = saved_current_function_decl;
8710 /* Back tag the access function so it know what it accesses */
8711 DECL_FUNCTION_ACCESS_DECL (decl) = mdecl;
8713 /* Tag the current method so it knows it has an access generated */
8714 return DECL_FUNCTION_INNER_ACCESS (decl) = mdecl;
8718 /* This section of the code deals with building expressions to access
8719 the enclosing instance of an inner class. The enclosing instance is
8720 kept in a generated field called this$<n>, with <n> being the
8721 inner class nesting level (starting from 0.) */
8723 /* Build an access to a given this$<n>, always chaining access call to
8724 others. Access methods to this$<n> are build on the fly if
8725 necessary. This CAN'T be used to solely access this$<n-1> from
8726 this$<n> (which alway yield to special cases and optimization, see
8727 for example build_outer_field_access). */
8730 build_access_to_thisn (tree from, tree to, int lc)
8732 tree access = NULL_TREE;
8734 while (from != to && PURE_INNER_CLASS_TYPE_P (from))
8738 access = build_current_thisn (from);
8739 access = build_wfl_node (access);
8743 tree access0_wfl, cn;
8745 maybe_build_thisn_access_method (from);
8746 access0_wfl = build_wfl_node (access0_identifier_node);
8747 cn = build_wfl_node (DECL_NAME (TYPE_NAME (from)));
8748 EXPR_WFL_LINECOL (access0_wfl) = lc;
8749 access = build_tree_list (NULL_TREE, access);
8750 access = build_method_invocation (access0_wfl, access);
8751 access = make_qualified_primary (cn, access, lc);
8754 /* If FROM isn't an inner class, that's fine, we've done enough.
8755 What we're looking for can be accessed from there. */
8756 from = DECL_CONTEXT (TYPE_NAME (from));
8759 from = TREE_TYPE (from);
8764 /* Build an access function to the this$<n> local to TYPE. NULL_TREE
8765 is returned if nothing needs to be generated. Otherwise, the method
8766 generated and a method decl is returned.
8768 NOTE: These generated methods should be declared in a class file
8769 attribute so that they can't be referred to directly. */
8772 maybe_build_thisn_access_method (tree type)
8774 tree mdecl, args, stmt, rtype;
8775 tree saved_current_function_decl;
8777 /* If TYPE is a top-level class, no access method is required.
8778 If there already is such an access method, bail out. */
8779 if (CLASS_ACCESS0_GENERATED_P (type) || !PURE_INNER_CLASS_TYPE_P (type))
8782 /* We generate the method. The method looks like:
8783 static <outer_of_type> access$0 (<type> inst$) { return inst$.this$<n>; }
8785 args = build_tree_list (inst_id, build_pointer_type (type));
8786 TREE_CHAIN (args) = end_params_node;
8787 rtype = build_pointer_type (TREE_TYPE (DECL_CONTEXT (TYPE_NAME (type))));
8788 mdecl = create_artificial_method (type, ACC_STATIC, rtype,
8789 access0_identifier_node, args);
8790 fix_method_argument_names (args, mdecl);
8791 layout_class_method (type, NULL_TREE, mdecl, NULL_TREE);
8792 stmt = build_current_thisn (type);
8793 stmt = make_qualified_primary (build_wfl_node (inst_id),
8794 build_wfl_node (stmt), 0);
8795 stmt = build_return (0, stmt);
8797 saved_current_function_decl = current_function_decl;
8798 start_artificial_method_body (mdecl);
8799 java_method_add_stmt (mdecl, stmt);
8800 end_artificial_method_body (mdecl);
8801 current_function_decl = saved_current_function_decl;
8803 CLASS_ACCESS0_GENERATED_P (type) = 1;
8808 /* Craft an correctly numbered `this$<n>'string. this$0 is used for
8809 the first level of innerclassing. this$1 for the next one, etc...
8810 This function can be invoked with TYPE to NULL, available and then
8811 has to count the parser context. */
8813 static GTY(()) tree saved_thisn;
8814 static GTY(()) tree saved_type;
8817 build_current_thisn (tree type)
8819 static int saved_i = -1;
8820 static int saved_type_i = 0;
8827 if (type == saved_type)
8831 for (i = -1, decl = DECL_CONTEXT (TYPE_NAME (type));
8832 decl; decl = DECL_CONTEXT (decl), i++)
8840 i = list_length (GET_CPC_LIST ())-2;
8845 sprintf (buffer, "this$%d", i);
8847 saved_thisn = get_identifier (buffer);
8851 /* Return the assignment to the hidden enclosing context `this$<n>'
8852 by the second incoming parameter to the innerclass constructor. The
8853 form used is `this.this$<n> = this$<n>;'. */
8856 build_thisn_assign (void)
8858 if (current_class && PURE_INNER_CLASS_TYPE_P (current_class))
8860 tree thisn = build_current_thisn (current_class);
8861 tree lhs = make_qualified_primary (build_wfl_node (this_identifier_node),
8862 build_wfl_node (thisn), 0);
8863 tree rhs = build_wfl_node (thisn);
8864 #ifdef USE_MAPPED_LOCATION
8865 SET_EXPR_LOCATION (lhs, input_location);
8867 EXPR_WFL_SET_LINECOL (lhs, input_line, 0);
8869 return build_assignment (ASSIGN_TK, EXPR_WFL_LINECOL (lhs), lhs, rhs);
8875 /* Building the synthetic `class$' used to implement the `.class' 1.1
8876 extension for non primitive types. This method looks like:
8878 static Class class$(String type) throws NoClassDefFoundError
8880 try {return (java.lang.Class.forName (String));}
8881 catch (ClassNotFoundException e) {
8882 throw new NoClassDefFoundError(e.getMessage());}
8885 static GTY(()) tree get_message_wfl;
8886 static GTY(()) tree type_parm_wfl;
8889 build_dot_class_method (tree class)
8891 #define BWF(S) build_wfl_node (get_identifier ((S)))
8892 #ifdef USE_MAPPED_LOCATION
8893 #define MQN(X,Y) make_qualified_name ((X), (Y), UNKNOWN_LOCATION)
8895 #define MQN(X,Y) make_qualified_name ((X), (Y), 0)
8897 tree args, tmp, saved_current_function_decl, mdecl, qual_name;
8898 tree stmt, throw_stmt;
8900 if (!get_message_wfl)
8902 get_message_wfl = build_wfl_node (get_identifier ("getMessage"));
8903 type_parm_wfl = build_wfl_node (get_identifier ("type$"));
8906 /* Build the arguments */
8907 args = build_tree_list (get_identifier ("type$"),
8908 build_pointer_type (string_type_node));
8909 TREE_CHAIN (args) = end_params_node;
8911 /* Build the qualified name java.lang.Class.forName */
8912 tmp = MQN (MQN (MQN (BWF ("java"),
8913 BWF ("lang")), BWF ("Class")), BWF ("forName"));
8915 /* Create the "class$" function */
8916 mdecl = create_artificial_method (class, ACC_STATIC,
8917 build_pointer_type (class_type_node),
8918 classdollar_identifier_node, args);
8919 qual_name = MQN (MQN (BWF ("java"), BWF ("lang")),
8920 BWF ("NoClassDefFoundError"));
8921 DECL_FUNCTION_THROWS (mdecl) = build_tree_list (NULL_TREE, qual_name);
8922 register_incomplete_type (JDEP_EXCEPTION, qual_name, NULL_TREE, NULL_TREE);
8923 JDEP_GET_PATCH (CLASSD_LAST (ctxp->classd_list)) =
8924 &TREE_VALUE (DECL_FUNCTION_THROWS (mdecl));
8926 /* We start by building the try block. We need to build:
8927 return (java.lang.Class.forName (type)); */
8928 stmt = build_method_invocation (tmp,
8929 build_tree_list (NULL_TREE, type_parm_wfl));
8930 stmt = build_return (0, stmt);
8932 /* Now onto the catch block. We start by building the expression
8933 throwing a new exception: throw new NoClassDefFoundError (_.getMessage) */
8934 #ifdef USE_MAPPED_LOCATION
8935 throw_stmt = make_qualified_name (build_wfl_node (wpv_id),
8936 get_message_wfl, UNKNOWN_LOCATION);
8938 throw_stmt = make_qualified_name (build_wfl_node (wpv_id),
8939 get_message_wfl, 0);
8941 throw_stmt = build_method_invocation (throw_stmt, NULL_TREE);
8943 /* Build new NoClassDefFoundError (_.getMessage) */
8944 throw_stmt = build_new_invocation
8945 (build_wfl_node (get_identifier ("NoClassDefFoundError")),
8946 build_tree_list (build_pointer_type (string_type_node), throw_stmt));
8948 /* Build the throw, (it's too early to use BUILD_THROW) */
8949 throw_stmt = build1 (THROW_EXPR, NULL_TREE, throw_stmt);
8951 /* Encapsulate STMT in a try block. The catch clause executes THROW_STMT */
8952 qual_name = MQN (MQN (BWF ("java"), BWF ("lang")),
8953 BWF ("ClassNotFoundException"));
8954 stmt = encapsulate_with_try_catch (0, qual_name, stmt, throw_stmt);
8956 fix_method_argument_names (args, mdecl);
8957 layout_class_method (class, NULL_TREE, mdecl, NULL_TREE);
8958 saved_current_function_decl = current_function_decl;
8959 start_artificial_method_body (mdecl);
8960 java_method_add_stmt (mdecl, stmt);
8961 end_artificial_method_body (mdecl);
8962 current_function_decl = saved_current_function_decl;
8963 TYPE_DOT_CLASS (class) = mdecl;
8969 build_dot_class_method_invocation (tree this_class, tree type)
8971 tree dot_class_method = TYPE_DOT_CLASS (this_class);
8974 if (TYPE_ARRAY_P (type))
8975 sig_id = build_java_signature (type);
8977 sig_id = DECL_NAME (TYPE_NAME (type));
8979 /* Ensure that the proper name separator is used */
8980 sig_id = unmangle_classname (IDENTIFIER_POINTER (sig_id),
8981 IDENTIFIER_LENGTH (sig_id));
8983 s = build_string (IDENTIFIER_LENGTH (sig_id),
8984 IDENTIFIER_POINTER (sig_id));
8985 t = build_method_invocation (build_wfl_node (DECL_NAME (dot_class_method)),
8986 build_tree_list (NULL_TREE, s));
8987 if (DECL_CONTEXT (dot_class_method) != this_class)
8989 tree class_name = DECL_NAME (TYPE_NAME (DECL_CONTEXT (dot_class_method)));
8990 t = make_qualified_primary (build_wfl_node (class_name), t, 0);
8995 /* This section of the code deals with constructor. */
8997 /* Craft a body for default constructor. Patch existing constructor
8998 bodies with call to super() and field initialization statements if
9002 fix_constructors (tree mdecl)
9004 tree iii; /* Instance Initializer Invocation */
9005 tree *bodyp = &DECL_FUNCTION_BODY (mdecl);
9006 tree thisn_assign, compound = NULL_TREE;
9007 tree class_type = DECL_CONTEXT (mdecl);
9009 if (DECL_FIXED_CONSTRUCTOR_P (mdecl))
9011 DECL_FIXED_CONSTRUCTOR_P (mdecl) = 1;
9015 /* It is an error for the compiler to generate a default
9016 constructor if the superclass doesn't have a constructor that
9017 takes no argument, or the same args for an anonymous class */
9018 if (verify_constructor_super (mdecl))
9020 tree sclass_decl = TYPE_NAME (CLASSTYPE_SUPER (class_type));
9021 tree save = DECL_NAME (mdecl);
9022 const char *n = IDENTIFIER_POINTER (DECL_NAME (sclass_decl));
9023 DECL_NAME (mdecl) = DECL_NAME (sclass_decl);
9025 (lookup_cl (TYPE_NAME (class_type)),
9026 "No constructor matching `%s' found in class `%s'",
9027 lang_printable_name (mdecl, 2), n);
9028 DECL_NAME (mdecl) = save;
9031 /* The constructor body must be crafted by hand. It's the
9032 constructor we defined when we realize we didn't have the
9033 CLASSNAME() constructor */
9034 start_artificial_method_body (mdecl);
9036 /* Insert an assignment to the this$<n> hidden field, if
9038 if ((thisn_assign = build_thisn_assign ()))
9039 java_method_add_stmt (mdecl, thisn_assign);
9041 /* We don't generate a super constructor invocation if we're
9042 compiling java.lang.Object. build_super_invocation takes care
9044 java_method_add_stmt (mdecl, build_super_invocation (mdecl));
9047 if ((iii = build_instinit_invocation (class_type)))
9048 java_method_add_stmt (mdecl, iii);
9050 end_artificial_method_body (mdecl);
9052 /* Search for an explicit constructor invocation */
9056 int invokes_this = 0;
9057 tree main_block = BLOCK_EXPR_BODY (*bodyp);
9062 switch (TREE_CODE (body))
9065 found = CALL_EXPLICIT_CONSTRUCTOR_P (body);
9066 if (CALL_THIS_CONSTRUCTOR_P (body))
9070 case EXPR_WITH_FILE_LOCATION:
9071 bodyp = &TREE_OPERAND (body, 0);
9074 bodyp = &BLOCK_EXPR_BODY (body);
9082 /* Generate the assignment to this$<n>, if necessary */
9083 if ((thisn_assign = build_thisn_assign ()))
9084 compound = add_stmt_to_compound (compound, NULL_TREE, thisn_assign);
9086 /* The constructor is missing an invocation of super() */
9088 compound = add_stmt_to_compound (compound, NULL_TREE,
9089 build_super_invocation (mdecl));
9090 /* Explicit super() invocation should take place before the
9091 instance initializer blocks. */
9094 compound = add_stmt_to_compound (compound, NULL_TREE, *bodyp);
9095 *bodyp = build_java_empty_stmt ();
9098 DECL_INIT_CALLS_THIS (mdecl) = invokes_this;
9100 /* Insert the instance initializer block right after. */
9101 if (!invokes_this && (iii = build_instinit_invocation (class_type)))
9102 compound = add_stmt_to_compound (compound, NULL_TREE, iii);
9104 /* Fix the constructor main block if we're adding extra stmts */
9107 compound = add_stmt_to_compound (compound, NULL_TREE,
9108 BLOCK_EXPR_BODY (main_block));
9109 BLOCK_EXPR_BODY (main_block) = compound;
9114 /* Browse constructors in the super class, searching for a constructor
9115 that doesn't take any argument. Return 0 if one is found, 1
9116 otherwise. If the current class is an anonymous inner class, look
9117 for something that has the same signature. */
9120 verify_constructor_super (tree mdecl)
9122 tree class = CLASSTYPE_SUPER (current_class);
9123 int super_inner = PURE_INNER_CLASS_TYPE_P (class);
9129 if (ANONYMOUS_CLASS_P (current_class))
9131 tree mdecl_arg_type;
9132 SKIP_THIS_AND_ARTIFICIAL_PARMS (mdecl_arg_type, mdecl);
9133 for (sdecl = TYPE_METHODS (class); sdecl; sdecl = TREE_CHAIN (sdecl))
9134 if (DECL_CONSTRUCTOR_P (sdecl))
9137 tree arg_type = TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (sdecl)));
9139 arg_type = TREE_CHAIN (arg_type);
9140 for (m_arg_type = mdecl_arg_type;
9141 (arg_type != end_params_node
9142 && m_arg_type != end_params_node);
9143 arg_type = TREE_CHAIN (arg_type),
9144 m_arg_type = TREE_CHAIN (m_arg_type))
9145 if (!valid_method_invocation_conversion_p
9146 (TREE_VALUE (arg_type),
9147 TREE_VALUE (m_arg_type)))
9150 if (arg_type == end_params_node && m_arg_type == end_params_node)
9156 for (sdecl = TYPE_METHODS (class); sdecl; sdecl = TREE_CHAIN (sdecl))
9158 tree arg = TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (sdecl)));
9160 arg = TREE_CHAIN (arg);
9161 if (DECL_CONSTRUCTOR_P (sdecl) && arg == end_params_node)
9168 /* Generate code for all context remembered for code generation. */
9170 static GTY(()) tree reversed_class_list;
9172 java_expand_classes (void)
9174 int save_error_count = 0;
9175 static struct parser_ctxt *cur_ctxp = NULL;
9177 java_parse_abort_on_error ();
9178 if (!(ctxp = ctxp_for_generation))
9180 java_layout_classes ();
9181 java_parse_abort_on_error ();
9182 location_t save_location = input_location;
9184 for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
9187 for (current = cur_ctxp->class_list;
9189 current = TREE_CHAIN (current))
9190 gen_indirect_dispatch_tables (TREE_TYPE (current));
9193 for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
9196 input_location = ctxp->file_start_location;
9197 lang_init_source (2); /* Error msgs have method prototypes */
9198 java_complete_expand_classes (); /* Complete and expand classes */
9199 java_parse_abort_on_error ();
9201 input_location = save_location;
9203 /* Find anonymous classes and expand their constructor. This extra pass is
9204 necessary because the constructor itself is only generated when the
9205 method in which it is defined is expanded. */
9206 for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
9210 for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
9212 output_class = current_class = TREE_TYPE (current);
9213 if (ANONYMOUS_CLASS_P (current_class))
9216 for (d = TYPE_METHODS (current_class); d; d = TREE_CHAIN (d))
9218 if (DECL_CONSTRUCTOR_P (d))
9220 java_complete_expand_method (d);
9221 break; /* There is only one constructor. */
9228 /* Expanding the constructors of anonymous classes generates access
9229 methods. Scan all the methods looking for null DECL_RESULTs --
9230 this will be the case if a method hasn't been expanded. */
9231 for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
9235 for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
9238 output_class = current_class = TREE_TYPE (current);
9239 for (d = TYPE_METHODS (current_class); d; d = TREE_CHAIN (d))
9241 if (DECL_RESULT (d) == NULL_TREE)
9242 java_complete_expand_method (d);
9247 /* ??? Instead of all this we could iterate around the list of
9248 classes until there were no more un-expanded methods. It would
9249 take a little longer -- one pass over the whole list of methods
9250 -- but it would be simpler. Like this: */
9253 int something_changed;
9257 something_changed = 0;
9258 for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
9262 for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
9265 output_class = current_class = TREE_TYPE (current);
9266 for (d = TYPE_METHODS (current_class); d; d = TREE_CHAIN (d))
9268 if (DECL_RESULT (d) == NULL_TREE)
9270 something_changed = 1;
9271 java_complete_expand_method (d);
9277 while (something_changed);
9281 /* If we've found error at that stage, don't try to generate
9282 anything, unless we're emitting xrefs or checking the syntax only
9283 (but not using -fsyntax-only for the purpose of generating
9285 if (java_error_count && !flag_emit_xref
9286 && (!flag_syntax_only && !flag_emit_class_files))
9289 /* Now things are stable, go for generation of the class data. */
9291 /* We pessimistically marked all methods and fields external until
9292 we knew what set of classes we were planning to compile. Now mark
9293 those that will be generated locally as not external. */
9294 for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
9298 for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
9299 java_mark_class_local (TREE_TYPE (current));
9302 /* Compile the classes. */
9303 for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
9306 reversed_class_list = NULL;
9310 /* We write out the classes in reverse order. This ensures that
9311 inner classes are written before their containing classes,
9312 which is important for parallel builds. Otherwise, the
9313 class file for the outer class may be found, but the class
9314 file for the inner class may not be present. In that
9315 situation, the compiler cannot fall back to the original
9316 source, having already read the outer class, so we must
9317 prevent that situation. */
9318 for (current = ctxp->class_list;
9320 current = TREE_CHAIN (current))
9322 = tree_cons (NULL_TREE, current, reversed_class_list);
9324 for (current = reversed_class_list;
9326 current = TREE_CHAIN (current))
9328 output_class = current_class = TREE_TYPE (TREE_VALUE (current));
9329 if (flag_emit_class_files)
9330 write_classfile (current_class);
9332 expand_xref (current_class);
9333 else if (! flag_syntax_only)
9334 java_expand_method_bodies (current_class);
9340 java_finish_classes (void)
9342 static struct parser_ctxt *cur_ctxp = NULL;
9343 for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
9347 for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
9349 output_class = current_class = TREE_TYPE (current);
9355 /* Wrap non WFL PRIMARY around a WFL and set EXPR_WFL_QUALIFICATION to
9356 a tree list node containing RIGHT. Fore coming RIGHTs will be
9357 chained to this hook. LOCATION contains the location of the
9358 separating `.' operator. */
9361 make_qualified_primary (tree primary, tree right, int location)
9365 if (TREE_CODE (primary) != EXPR_WITH_FILE_LOCATION)
9366 wfl = build_wfl_wrap (primary, location);
9370 /* If wfl wasn't qualified, we build a first anchor */
9371 if (!EXPR_WFL_QUALIFICATION (wfl))
9372 EXPR_WFL_QUALIFICATION (wfl) = build_tree_list (wfl, NULL_TREE);
9375 /* And chain them */
9376 EXPR_WFL_LINECOL (right) = location;
9377 chainon (EXPR_WFL_QUALIFICATION (wfl), build_tree_list (right, NULL_TREE));
9378 PRIMARY_P (wfl) = 1;
9382 /* Simple merge of two name separated by a `.' */
9385 merge_qualified_name (tree left, tree right)
9388 if (!left && !right)
9397 obstack_grow (&temporary_obstack, IDENTIFIER_POINTER (left),
9398 IDENTIFIER_LENGTH (left));
9399 obstack_1grow (&temporary_obstack, '.');
9400 obstack_grow0 (&temporary_obstack, IDENTIFIER_POINTER (right),
9401 IDENTIFIER_LENGTH (right));
9402 node = get_identifier (obstack_base (&temporary_obstack));
9403 obstack_free (&temporary_obstack, obstack_base (&temporary_obstack));
9404 QUALIFIED_P (node) = 1;
9408 /* Merge the two parts of a qualified name into LEFT. Set the
9409 location information of the resulting node to LOCATION, usually
9410 inherited from the location information of the `.' operator. */
9413 make_qualified_name (tree left, tree right,
9414 #ifdef USE_MAPPED_LOCATION
9415 source_location location
9421 #ifdef USE_COMPONENT_REF
9422 tree node = build3 (COMPONENT_REF, NULL_TREE, left, right, NULL_TREE);
9423 SET_EXPR_LOCATION (node, location);
9426 tree left_id = EXPR_WFL_NODE (left);
9427 tree right_id = EXPR_WFL_NODE (right);
9430 merge = merge_qualified_name (left_id, right_id);
9432 /* Left wasn't qualified and is now qualified */
9433 #ifdef USE_MAPPED_LOCATION
9434 if (!QUALIFIED_P (left_id))
9436 tree wfl = build_expr_wfl (left_id, EXPR_LOCATION (left));
9437 EXPR_WFL_QUALIFICATION (left) = build_tree_list (wfl, NULL_TREE);
9440 wfl = build_expr_wfl (right_id, location);
9442 if (!QUALIFIED_P (left_id))
9444 tree wfl = build_expr_wfl (left_id, ctxp->filename, 0, 0);
9445 EXPR_WFL_LINECOL (wfl) = EXPR_WFL_LINECOL (left);
9446 EXPR_WFL_QUALIFICATION (left) = build_tree_list (wfl, NULL_TREE);
9449 wfl = build_expr_wfl (right_id, ctxp->filename, 0, 0);
9450 EXPR_WFL_LINECOL (wfl) = location;
9452 chainon (EXPR_WFL_QUALIFICATION (left), build_tree_list (wfl, NULL_TREE));
9453 EXPR_WFL_NODE (left) = merge;
9458 /* Extract the last identifier component of the qualified in WFL. The
9459 last identifier is removed from the linked list */
9462 cut_identifier_in_qualified (tree wfl)
9465 tree previous = NULL_TREE;
9466 for (q = EXPR_WFL_QUALIFICATION (wfl); ; previous = q, q = TREE_CHAIN (q))
9467 if (!TREE_CHAIN (q))
9470 /* Operating on a non qualified qualified WFL. */
9473 TREE_CHAIN (previous) = NULL_TREE;
9474 return TREE_PURPOSE (q);
9478 /* Resolve the expression name NAME. Return its decl. */
9481 resolve_expression_name (tree id, tree *orig)
9483 tree name = EXPR_WFL_NODE (id);
9486 /* 6.5.5.1: Simple expression names */
9487 if (!PRIMARY_P (id) && !QUALIFIED_P (name))
9489 /* 15.13.1: NAME can appear within the scope of a local variable
9491 if ((decl = IDENTIFIER_LOCAL_VALUE (name)))
9494 /* 15.13.1: NAME can appear within a class declaration */
9497 decl = lookup_field_wrapper (current_class, name);
9500 tree access = NULL_TREE;
9501 int fs = FIELD_STATIC (decl);
9503 /* If we're accessing an outer scope local alias, make
9504 sure we change the name of the field we're going to
9506 if (FIELD_LOCAL_ALIAS_USED (decl))
9507 name = DECL_NAME (decl);
9509 check_deprecation (id, decl);
9511 /* Instance variable (8.3.1.1) can't appear within
9512 static method, static initializer or initializer for
9513 a static variable. */
9514 if (!fs && METHOD_STATIC (current_function_decl))
9516 static_ref_err (id, name, current_class);
9517 return error_mark_node;
9519 /* Instance variables can't appear as an argument of
9520 an explicit constructor invocation */
9521 if (!fs && ctxp->explicit_constructor_p
9522 && !enclosing_context_p (DECL_CONTEXT (decl), current_class))
9525 (id, "Can't reference `%s' before the superclass constructor has been called", IDENTIFIER_POINTER (name));
9526 return error_mark_node;
9529 /* If we're processing an inner class and we're trying
9530 to access a field belonging to an outer class, build
9531 the access to the field */
9532 if (!fs && outer_field_access_p (current_class, decl))
9534 if (CLASS_STATIC (TYPE_NAME (current_class)))
9536 static_ref_err (id, DECL_NAME (decl), current_class);
9537 return error_mark_node;
9539 access = build_outer_field_access (id, decl);
9545 /* Otherwise build what it takes to access the field */
9546 access = build_field_ref ((fs ? NULL_TREE : current_this),
9547 DECL_CONTEXT (decl), name);
9549 access = maybe_build_class_init_for_field (decl, access);
9550 /* We may be asked to save the real field access node */
9553 /* Last check: can we access the field? */
9554 if (not_accessible_p (current_class, decl, NULL_TREE, 0))
9556 not_accessible_field_error (id, decl);
9557 return error_mark_node;
9559 /* And we return what we got */
9562 /* Fall down to error report on undefined variable */
9565 /* 6.5.5.2 Qualified Expression Names */
9570 qualify_ambiguous_name (id);
9571 /* 15.10.1 Field Access Using a Primary and/or Expression Name */
9572 /* 15.10.2: Accessing Superclass Members using super */
9573 return resolve_field_access (id, orig, NULL);
9576 /* We've got an error here */
9577 if (INNER_CLASS_TYPE_P (current_class))
9578 parse_error_context (id,
9579 "Local variable `%s' can't be accessed from within the inner class `%s' unless it is declared final",
9580 IDENTIFIER_POINTER (name),
9581 IDENTIFIER_POINTER (DECL_NAME
9582 (TYPE_NAME (current_class))));
9584 parse_error_context (id, "Undefined variable `%s'",
9585 IDENTIFIER_POINTER (name));
9587 return error_mark_node;
9591 static_ref_err (tree wfl, tree field_id, tree class_type)
9595 "Can't make a static reference to nonstatic variable `%s' in class `%s'",
9596 IDENTIFIER_POINTER (field_id),
9597 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (class_type))));
9600 /* 15.10.1 Field Access Using a Primary and/or Expression Name.
9601 We return something suitable to generate the field access. We also
9602 return the field decl in FIELD_DECL and its type in FIELD_TYPE. If
9603 recipient's address can be null. */
9606 resolve_field_access (tree qual_wfl, tree *field_decl, tree *field_type)
9610 tree decl = NULL_TREE, where_found, type_found;
9612 if (resolve_qualified_expression_name (qual_wfl, &decl,
9613 &where_found, &type_found))
9614 return error_mark_node;
9616 /* Resolve the LENGTH field of an array here */
9617 if (DECL_P (decl) && DECL_NAME (decl) == length_identifier_node
9618 && type_found && TYPE_ARRAY_P (type_found)
9619 && ! flag_emit_class_files && ! flag_emit_xref)
9621 tree length = build_java_array_length_access (where_found);
9624 /* In case we're dealing with a static array, we need to
9625 initialize its class before the array length can be fetched.
9626 It's also a good time to create a DECL_RTL for the field if
9627 none already exists, otherwise if the field was declared in a
9628 class found in an external file and hasn't been (and won't
9629 be) accessed for its value, none will be created. */
9630 if (TREE_CODE (where_found) == VAR_DECL && FIELD_STATIC (where_found))
9632 build_static_field_ref (where_found);
9633 field_ref = build_class_init (DECL_CONTEXT (where_found), field_ref);
9636 /* We might have been trying to resolve field.method(). In which
9637 case, the resolution is over and decl is the answer */
9638 else if (JDECL_P (decl) && IDENTIFIER_LOCAL_VALUE (DECL_NAME (decl)) == decl)
9640 else if (JDECL_P (decl))
9643 type_found = DECL_CONTEXT (decl);
9644 is_static = FIELD_STATIC (decl);
9645 field_ref = build_field_ref ((is_static && !flag_emit_xref?
9646 NULL_TREE : where_found),
9647 type_found, DECL_NAME (decl));
9648 if (field_ref == error_mark_node)
9649 return error_mark_node;
9651 field_ref = maybe_build_class_init_for_field (decl, field_ref);
9653 /* If we're looking at a static field, we may need to generate a
9654 class initialization for it. This can happen when the access
9655 looks like `field.ref', where `field' is a static field in an
9656 interface we implement. */
9657 if (!flag_emit_class_files
9659 && TREE_CODE (where_found) == VAR_DECL
9660 && FIELD_STATIC (where_found))
9662 build_static_field_ref (where_found);
9663 field_ref = build_class_init (DECL_CONTEXT (where_found), field_ref);
9672 *field_type = (QUAL_DECL_TYPE (decl) ?
9673 QUAL_DECL_TYPE (decl) : TREE_TYPE (decl));
9677 /* If NODE is an access to f static field, strip out the class
9678 initialization part and return the field decl, otherwise, return
9682 strip_out_static_field_access_decl (tree node)
9684 if (TREE_CODE (node) == COMPOUND_EXPR)
9686 tree op1 = TREE_OPERAND (node, 1);
9687 if (TREE_CODE (op1) == COMPOUND_EXPR)
9689 tree call = TREE_OPERAND (op1, 0);
9690 if (TREE_CODE (call) == CALL_EXPR
9691 && TREE_CODE (TREE_OPERAND (call, 0)) == ADDR_EXPR
9692 && TREE_OPERAND (TREE_OPERAND (call, 0), 0)
9693 == soft_initclass_node)
9694 return TREE_OPERAND (op1, 1);
9696 else if (JDECL_P (op1))
9702 /* 6.5.5.2: Qualified Expression Names */
9705 resolve_qualified_expression_name (tree wfl, tree *found_decl,
9706 tree *where_found, tree *type_found)
9708 int from_type = 0; /* Field search initiated from a type */
9709 int from_super = 0, from_cast = 0, from_qualified_this = 0;
9710 int previous_call_static = 0;
9712 tree decl = NULL_TREE, type = NULL_TREE, q;
9713 /* For certain for of inner class instantiation */
9714 tree saved_current, saved_this;
9715 #define RESTORE_THIS_AND_CURRENT_CLASS \
9716 { current_class = saved_current; current_this = saved_this;}
9718 *type_found = *where_found = NULL_TREE;
9720 for (q = EXPR_WFL_QUALIFICATION (wfl); q; q = TREE_CHAIN (q))
9722 tree qual_wfl = QUAL_WFL (q);
9723 tree ret_decl; /* for EH checking */
9724 #ifdef USE_MAPPED_LOCATION
9725 source_location location; /* for EH checking */
9727 int location; /* for EH checking */
9730 /* 15.10.1 Field Access Using a Primary */
9731 switch (TREE_CODE (qual_wfl))
9734 case NEW_CLASS_EXPR:
9735 /* If the access to the function call is a non static field,
9736 build the code to access it. */
9737 if (JDECL_P (decl) && !FIELD_STATIC (decl))
9739 decl = maybe_access_field (decl, *where_found,
9740 DECL_CONTEXT (decl));
9741 if (decl == error_mark_node)
9745 /* And code for the function call */
9746 if (complete_function_arguments (qual_wfl))
9749 /* We might have to setup a new current class and a new this
9750 for the search of an inner class, relative to the type of
9751 a expression resolved as `decl'. The current values are
9752 saved and restored shortly after */
9753 saved_current = current_class;
9754 saved_this = current_this;
9756 && (TREE_CODE (qual_wfl) == NEW_CLASS_EXPR
9757 || from_qualified_this))
9759 /* If we still have `from_qualified_this', we have the form
9760 <T>.this.f() and we need to build <T>.this */
9761 if (from_qualified_this)
9763 decl = build_access_to_thisn (current_class, type, 0);
9764 decl = java_complete_tree (decl);
9765 type = TREE_TYPE (TREE_TYPE (decl));
9767 current_class = type;
9768 current_this = decl;
9769 from_qualified_this = 0;
9772 if (from_super && TREE_CODE (qual_wfl) == CALL_EXPR)
9773 CALL_USING_SUPER (qual_wfl) = 1;
9774 #ifdef USE_MAPPED_LOCATION
9775 location = (TREE_CODE (qual_wfl) == CALL_EXPR
9776 ? EXPR_LOCATION (TREE_OPERAND (qual_wfl, 0))
9777 : UNKNOWN_LOCATION);
9779 location = (TREE_CODE (qual_wfl) == CALL_EXPR ?
9780 EXPR_WFL_LINECOL (TREE_OPERAND (qual_wfl, 0)) : 0);
9782 *where_found = patch_method_invocation (qual_wfl, decl, type,
9784 &is_static, &ret_decl);
9786 if (*where_found == error_mark_node)
9788 RESTORE_THIS_AND_CURRENT_CLASS;
9791 *type_found = type = QUAL_DECL_TYPE (*where_found);
9793 *where_found = force_evaluation_order (*where_found);
9795 /* If we're creating an inner class instance, check for that
9796 an enclosing instance is in scope */
9797 if (TREE_CODE (qual_wfl) == NEW_CLASS_EXPR
9798 && INNER_ENCLOSING_SCOPE_CHECK (type))
9801 (qual_wfl, "No enclosing instance for inner class `%s' is in scope%s",
9802 lang_printable_name (type, 0),
9803 (!current_this ? "" :
9804 "; an explicit one must be provided when creating this inner class"));
9805 RESTORE_THIS_AND_CURRENT_CLASS;
9809 /* In case we had to change then to resolve a inner class
9810 instantiation using a primary qualified by a `new' */
9811 RESTORE_THIS_AND_CURRENT_CLASS;
9813 #ifdef USE_MAPPED_LOCATION
9814 if (location != UNKNOWN_LOCATION)
9819 tree arguments = NULL_TREE;
9820 if (TREE_CODE (qual_wfl) == CALL_EXPR
9821 && TREE_OPERAND (qual_wfl, 1) != NULL_TREE)
9822 arguments = TREE_VALUE (TREE_OPERAND (qual_wfl, 1));
9823 check_thrown_exceptions (location, ret_decl, arguments);
9826 /* If the previous call was static and this one is too,
9827 build a compound expression to hold the two (because in
9828 that case, previous function calls aren't transported as
9829 forcoming function's argument. */
9830 if (previous_call_static && is_static)
9832 /* We must set CAN_COMPLETE_NORMALLY for the first call
9833 since it is done nowhere else. */
9834 CAN_COMPLETE_NORMALLY (decl) = 1;
9835 decl = build2 (COMPOUND_EXPR, TREE_TYPE (*where_found),
9836 decl, *where_found);
9837 TREE_SIDE_EFFECTS (decl) = 1;
9841 previous_call_static = is_static;
9842 decl = *where_found;
9847 case NEW_ARRAY_EXPR:
9848 case NEW_ANONYMOUS_ARRAY_EXPR:
9849 *where_found = decl = java_complete_tree (qual_wfl);
9850 if (decl == error_mark_node)
9852 *type_found = type = QUAL_DECL_TYPE (decl);
9856 *where_found = decl = java_complete_tree (qual_wfl);
9857 if (decl == error_mark_node)
9859 *type_found = type = QUAL_DECL_TYPE (decl);
9863 case CONDITIONAL_EXPR:
9866 *where_found = decl = java_complete_tree (qual_wfl);
9867 if (decl == error_mark_node)
9869 *type_found = type = QUAL_DECL_TYPE (decl);
9873 /* If the access to the function call is a non static field,
9874 build the code to access it. */
9875 if (JDECL_P (decl) && !FIELD_STATIC (decl))
9877 decl = maybe_access_field (decl, *where_found, type);
9878 if (decl == error_mark_node)
9881 /* And code for the array reference expression */
9882 decl = java_complete_tree (qual_wfl);
9883 if (decl == error_mark_node)
9885 type = QUAL_DECL_TYPE (decl);
9889 if ((decl = java_complete_tree (qual_wfl)) == error_mark_node)
9891 if ((type = patch_string (decl)))
9893 *where_found = QUAL_RESOLUTION (q) = decl;
9894 *type_found = type = TREE_TYPE (decl);
9898 if ((decl = java_complete_tree (qual_wfl)) == error_mark_node)
9900 *where_found = QUAL_RESOLUTION (q) = decl;
9901 *type_found = type = TREE_TYPE (decl);
9905 /* Fix for -Wall Just go to the next statement. Don't
9910 /* If we fall here, we weren't processing a (static) function call. */
9911 previous_call_static = 0;
9913 /* It can be the keyword THIS */
9914 if (TREE_CODE (qual_wfl) == EXPR_WITH_FILE_LOCATION
9915 && EXPR_WFL_NODE (qual_wfl) == this_identifier_node)
9920 (wfl, "Keyword `this' used outside allowed context");
9923 if (ctxp->explicit_constructor_p
9924 && type == current_class)
9926 parse_error_context (wfl, "Can't reference `this' before the superclass constructor has been called");
9929 /* We have to generate code for intermediate access */
9930 if (!from_type || TREE_TYPE (TREE_TYPE (current_this)) == type)
9932 *where_found = decl = current_this;
9933 *type_found = type = QUAL_DECL_TYPE (decl);
9935 /* We're trying to access the this from somewhere else. Make sure
9936 it's allowed before doing so. */
9939 if (!enclosing_context_p (type, current_class))
9941 char *p = xstrdup (lang_printable_name (type, 0));
9942 parse_error_context (qual_wfl, "Can't use variable `%s.this': type `%s' isn't an outer type of type `%s'",
9944 lang_printable_name (current_class, 0));
9948 from_qualified_this = 1;
9949 /* If there's nothing else after that, we need to
9950 produce something now, otherwise, the section of the
9951 code that needs to produce <T>.this will generate
9952 what is necessary. */
9953 if (!TREE_CHAIN (q))
9955 decl = build_access_to_thisn (current_class, type, 0);
9956 *where_found = decl = java_complete_tree (decl);
9957 *type_found = type = TREE_TYPE (decl);
9965 /* 15.10.2 Accessing Superclass Members using SUPER */
9966 if (TREE_CODE (qual_wfl) == EXPR_WITH_FILE_LOCATION
9967 && EXPR_WFL_NODE (qual_wfl) == super_identifier_node)
9970 /* Check on the restricted use of SUPER */
9971 if (METHOD_STATIC (current_function_decl)
9972 || current_class == object_type_node)
9975 (wfl, "Keyword `super' used outside allowed context");
9978 /* Otherwise, treat SUPER as (SUPER_CLASS)THIS */
9979 node = build_cast (EXPR_WFL_LINECOL (qual_wfl),
9980 CLASSTYPE_SUPER (current_class),
9981 build_this (EXPR_WFL_LINECOL (qual_wfl)));
9982 *where_found = decl = java_complete_tree (node);
9983 if (decl == error_mark_node)
9985 *type_found = type = QUAL_DECL_TYPE (decl);
9986 from_super = from_type = 1;
9990 /* 15.13.1: Can't search for field name in packages, so we
9991 assume a variable/class name was meant. */
9992 if (RESOLVE_PACKAGE_NAME_P (qual_wfl))
9995 if ((decl = resolve_package (wfl, &q, &name)))
9998 *where_found = decl;
10000 check_pkg_class_access (DECL_NAME (decl), qual_wfl, true, NULL);
10002 /* We want to be absolutely sure that the class is laid
10003 out. We're going to search something inside it. */
10004 *type_found = type = TREE_TYPE (decl);
10005 layout_class (type);
10008 /* Fix them all the way down, if any are left. */
10011 list = TREE_CHAIN (q);
10014 RESOLVE_PACKAGE_NAME_P (QUAL_WFL (list)) = 0;
10015 list = TREE_CHAIN (list);
10021 if (from_super || from_cast)
10022 parse_error_context
10023 ((from_cast ? qual_wfl : wfl),
10024 "No variable `%s' defined in class `%s'",
10025 IDENTIFIER_POINTER (EXPR_WFL_NODE (qual_wfl)),
10026 lang_printable_name (type, 0));
10028 parse_error_context
10029 (qual_wfl, "Undefined variable or class name: `%s'",
10030 IDENTIFIER_POINTER (name));
10035 /* We have a type name. It's been already resolved when the
10036 expression was qualified. */
10037 else if (RESOLVE_TYPE_NAME_P (qual_wfl) && QUAL_RESOLUTION (q))
10039 decl = QUAL_RESOLUTION (q);
10041 /* Sneak preview. If next we see a `new', we're facing a
10042 qualification which resulted in a type being selected
10043 instead of a field. Report the error. */
10045 && TREE_CODE (TREE_PURPOSE (TREE_CHAIN (q))) == NEW_CLASS_EXPR)
10047 parse_error_context (qual_wfl, "Undefined variable `%s'",
10048 IDENTIFIER_POINTER (EXPR_WFL_NODE (wfl)));
10052 check_pkg_class_access (DECL_NAME (decl), qual_wfl, true, NULL);
10054 check_deprecation (qual_wfl, decl);
10056 type = TREE_TYPE (decl);
10059 /* We resolve an expression name */
10062 tree field_decl = NULL_TREE;
10064 /* If there exists an early resolution, use it. That occurs
10065 only once and we know that there are more things to
10066 come. Don't do that when processing something after SUPER
10067 (we need more thing to be put in place below */
10068 if (!from_super && QUAL_RESOLUTION (q))
10070 decl = QUAL_RESOLUTION (q);
10073 if (TREE_CODE (decl) == FIELD_DECL && !FIELD_STATIC (decl))
10076 *where_found = current_this;
10079 static_ref_err (qual_wfl, DECL_NAME (decl),
10083 if (outer_field_access_p (current_class, decl))
10084 decl = build_outer_field_access (qual_wfl, decl);
10088 *where_found = TREE_TYPE (decl);
10089 if (TREE_CODE (*where_found) == POINTER_TYPE)
10090 *where_found = TREE_TYPE (*where_found);
10095 /* Report and error if we're using a numerical literal as a
10096 qualifier. It can only be an INTEGER_CST. */
10097 else if (TREE_CODE (qual_wfl) == INTEGER_CST)
10099 parse_error_context
10100 (wfl, "Can't use type `%s' as a qualifier",
10101 lang_printable_name (TREE_TYPE (qual_wfl), 0));
10105 /* We have to search for a field, knowing the type of its
10106 container. The flag FROM_TYPE indicates that we resolved
10107 the last member of the expression as a type name, which
10108 means that for the resolution of this field, we'll look
10109 for other errors than if it was resolved as a member of
10114 tree field_decl_type; /* For layout */
10116 if (!from_type && !JREFERENCE_TYPE_P (type))
10118 parse_error_context
10119 (qual_wfl, "Attempt to reference field `%s' in `%s %s'",
10120 IDENTIFIER_POINTER (EXPR_WFL_NODE (qual_wfl)),
10121 lang_printable_name (type, 0),
10122 IDENTIFIER_POINTER (DECL_NAME (decl)));
10126 field_decl = lookup_field_wrapper (type,
10127 EXPR_WFL_NODE (qual_wfl));
10129 /* Maybe what we're trying to access to is an inner
10130 class, only if decl is a TYPE_DECL. */
10131 if (!field_decl && TREE_CODE (decl) == TYPE_DECL)
10133 tree ptr, inner_decl;
10135 BUILD_PTR_FROM_NAME (ptr, EXPR_WFL_NODE (qual_wfl));
10136 inner_decl = resolve_class (decl, ptr, NULL_TREE, qual_wfl);
10139 check_inner_class_access (inner_decl, decl, qual_wfl);
10140 type = TREE_TYPE (inner_decl);
10147 if (field_decl == NULL_TREE)
10149 parse_error_context
10150 (qual_wfl, "No variable `%s' defined in type `%s'",
10151 IDENTIFIER_POINTER (EXPR_WFL_NODE (qual_wfl)),
10152 GET_TYPE_NAME (type));
10155 if (field_decl == error_mark_node)
10158 /* Layout the type of field_decl, since we may need
10159 it. Don't do primitive types or loaded classes. The
10160 situation of non primitive arrays may not handled
10161 properly here. FIXME */
10162 if (TREE_CODE (TREE_TYPE (field_decl)) == POINTER_TYPE)
10163 field_decl_type = TREE_TYPE (TREE_TYPE (field_decl));
10165 field_decl_type = TREE_TYPE (field_decl);
10166 if (!JPRIMITIVE_TYPE_P (field_decl_type)
10167 && !CLASS_LOADED_P (field_decl_type)
10168 && !TYPE_ARRAY_P (field_decl_type))
10169 resolve_and_layout (field_decl_type, NULL_TREE);
10171 /* Check on accessibility here */
10172 if (not_accessible_p (current_class, field_decl,
10173 *type_found, from_super))
10174 return not_accessible_field_error (qual_wfl,field_decl);
10175 check_deprecation (qual_wfl, field_decl);
10177 /* There are things to check when fields are accessed
10178 from type. There are no restrictions on a static
10179 declaration of the field when it is accessed from an
10181 is_static = FIELD_STATIC (field_decl);
10182 if (!from_super && from_type
10183 && !TYPE_INTERFACE_P (type)
10185 && (current_function_decl
10186 && METHOD_STATIC (current_function_decl)))
10188 static_ref_err (qual_wfl, EXPR_WFL_NODE (qual_wfl), type);
10191 from_cast = from_super = 0;
10193 /* It's an access from a type but it isn't static, we
10194 make it relative to `this'. */
10195 if (!is_static && from_type)
10196 decl = current_this;
10198 /* If we need to generate something to get a proper
10199 handle on what this field is accessed from, do it
10203 decl = maybe_access_field (decl, *where_found, *type_found);
10204 if (decl == error_mark_node)
10208 /* We want to keep the location were found it, and the type
10210 *where_found = decl;
10211 *type_found = type;
10213 /* Generate the correct expression for field access from
10215 if (from_qualified_this)
10217 field_decl = build_outer_field_access (qual_wfl, field_decl);
10218 from_qualified_this = 0;
10221 /* This is the decl found and eventually the next one to
10226 type = QUAL_DECL_TYPE (decl);
10228 /* Sneak preview. If decl is qualified by a `new', report
10229 the error here to be accurate on the peculiar construct */
10231 && TREE_CODE (TREE_PURPOSE (TREE_CHAIN (q))) == NEW_CLASS_EXPR
10232 && !JREFERENCE_TYPE_P (type))
10234 parse_error_context (qual_wfl, "Attempt to reference field `new' in a `%s'",
10235 lang_printable_name (type, 0));
10239 /* `q' might have changed due to a after package resolution
10240 re-qualification */
10244 *found_decl = decl;
10248 /* 6.6 Qualified name and access control. Returns 1 if MEMBER (a decl)
10249 can't be accessed from REFERENCE (a record type). If MEMBER
10250 features a protected access, we then use WHERE which, if non null,
10251 holds the type of MEMBER's access that is checked against
10252 6.6.2.1. This function should be used when decl is a field or a
10256 not_accessible_p (tree reference, tree member, tree where, int from_super)
10258 int access_flag = get_access_flags_from_decl (member);
10259 bool is_static = false;
10261 if (TREE_CODE (member) == FIELD_DECL ||
10262 TREE_CODE (member) == VAR_DECL)
10263 is_static = FIELD_STATIC (member);
10265 is_static = METHOD_STATIC (member);
10267 /* Access always granted for members declared public */
10268 if (access_flag & ACC_PUBLIC)
10271 /* Check access on protected members */
10272 if (access_flag & ACC_PROTECTED)
10274 /* Access granted if it occurs from within the package
10275 containing the class in which the protected member is
10277 if (class_in_current_package (DECL_CONTEXT (member)))
10280 /* If accessed with the form `super.member', then access is granted */
10284 /* If WHERE is active, access was made through a qualifier. For
10285 non-static members, access is granted if the type of the qualifier
10286 is or is a sublass of the type the access is made from (6.6.2.1.) */
10287 if (where && !is_static)
10291 if (inherits_from_p (where, reference))
10293 if (INNER_CLASS_TYPE_P (reference))
10294 reference = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (reference)));
10301 /* Otherwise, access is granted if occurring from within the class
10302 where member is declared, or a subclass of it. */
10305 if (inherits_from_p (reference, DECL_CONTEXT (member)))
10307 if (INNER_CLASS_TYPE_P (reference))
10308 reference = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (reference)));
10315 /* Check access on private members. Access is granted only if it
10316 occurs from within the class in which it is declared -- that does
10317 it for innerclasses too. */
10318 if (access_flag & ACC_PRIVATE)
10320 if (reference == DECL_CONTEXT (member) ||
10321 common_enclosing_context_p (DECL_CONTEXT (member), reference))
10326 /* Default access is permitted only when occurring from within the
10327 package in which the context (MEMBER) is declared. */
10328 return !class_in_current_package (DECL_CONTEXT (member));
10331 /* Test deprecated decl access. */
10333 check_deprecation (tree wfl, tree decl)
10338 if (! warn_deprecated)
10341 /* We want to look at the element type of arrays here, so we strip
10342 all surrounding array types. */
10343 if (TYPE_ARRAY_P (TREE_TYPE (decl)))
10345 elt = TREE_TYPE (decl);
10346 while (TYPE_ARRAY_P (elt))
10347 elt = TYPE_ARRAY_ELEMENT (elt);
10348 /* We'll end up with a pointer type, so we use TREE_TYPE to go
10350 decl = TYPE_NAME (TREE_TYPE (elt));
10352 file = DECL_SOURCE_FILE (decl);
10354 /* Complain if the field is deprecated and the file it was defined
10355 in isn't compiled at the same time the file which contains its
10357 if (DECL_DEPRECATED (decl)
10358 && !IS_A_COMMAND_LINE_FILENAME_P (get_identifier (file)))
10361 switch (TREE_CODE (decl))
10363 case FUNCTION_DECL:
10371 parse_warning_context (wfl, "The class `%s' has been deprecated",
10372 IDENTIFIER_POINTER (DECL_NAME (decl)));
10377 /* Don't issue a message if the context as been deprecated as a
10379 if (! CLASS_DEPRECATED (TYPE_NAME (DECL_CONTEXT (decl))))
10380 parse_warning_context
10381 (wfl, "The %s `%s' in class `%s' has been deprecated",
10382 the, lang_printable_name (decl, 0),
10383 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (DECL_CONTEXT (decl)))));
10387 /* Returns 1 if class was declared in the current package, 0 otherwise */
10389 static GTY(()) tree cicp_cache;
10391 class_in_current_package (tree class)
10393 int qualified_flag;
10396 if (cicp_cache == class)
10399 qualified_flag = QUALIFIED_P (DECL_NAME (TYPE_NAME (class)));
10401 /* If the current package is empty and the name of CLASS is
10402 qualified, class isn't in the current package. If there is a
10403 current package and the name of the CLASS is not qualified, class
10404 isn't in the current package */
10405 if ((!ctxp->package && qualified_flag) || (ctxp->package && !qualified_flag))
10408 /* If there is not package and the name of CLASS isn't qualified,
10409 they belong to the same unnamed package */
10410 if (!ctxp->package && !qualified_flag)
10413 /* Compare the left part of the name of CLASS with the package name */
10414 split_qualified_name (&left, NULL, DECL_NAME (TYPE_NAME (class)));
10415 if (ctxp->package == left)
10417 cicp_cache = class;
10423 /* This function may generate code to access DECL from WHERE. This is
10424 done only if certain conditions meet. */
10427 maybe_access_field (tree decl, tree where, tree type)
10429 if (TREE_CODE (decl) == FIELD_DECL && decl != current_this
10430 && !FIELD_STATIC (decl))
10431 decl = build_field_ref (where ? where : current_this,
10432 (type ? type : DECL_CONTEXT (decl)),
10437 /* Build a method invocation, by patching PATCH. If non NULL
10438 and according to the situation, PRIMARY and WHERE may be
10439 used. IS_STATIC is set to 1 if the invoked function is static. */
10442 patch_method_invocation (tree patch, tree primary, tree where, int from_super,
10443 int *is_static, tree *ret_decl)
10445 tree wfl = TREE_OPERAND (patch, 0);
10446 tree args = TREE_OPERAND (patch, 1);
10447 tree name = EXPR_WFL_NODE (wfl);
10449 int is_static_flag = 0;
10450 int is_super_init = 0;
10451 tree this_arg = NULL_TREE;
10452 int is_array_clone_call = 0;
10454 /* Should be overridden if everything goes well. Otherwise, if
10455 something fails, it should keep this value. It stop the
10456 evaluation of a bogus assignment. See java_complete_tree,
10457 MODIFY_EXPR: for the reasons why we sometimes want to keep on
10458 evaluating an assignment */
10459 TREE_TYPE (patch) = error_mark_node;
10461 /* Since lookup functions are messing with line numbers, save the
10463 java_parser_context_save_global ();
10465 /* 15.11.1: Compile-Time Step 1: Determine Class or Interface to Search */
10467 /* Resolution of qualified name, excluding constructors */
10468 if (QUALIFIED_P (name) && !CALL_CONSTRUCTOR_P (patch))
10470 tree identifier, identifier_wfl, type, resolved;
10471 /* Extract the last IDENTIFIER of the qualified
10472 expression. This is a wfl and we will use it's location
10473 data during error report. */
10474 identifier_wfl = cut_identifier_in_qualified (wfl);
10475 identifier = EXPR_WFL_NODE (identifier_wfl);
10477 /* Given the context, IDENTIFIER is syntactically qualified
10478 as a MethodName. We need to qualify what's before */
10479 qualify_ambiguous_name (wfl);
10480 resolved = resolve_field_access (wfl, NULL, NULL);
10482 if (TREE_CODE (resolved) == VAR_DECL && FIELD_STATIC (resolved)
10483 && FIELD_FINAL (resolved)
10484 && !inherits_from_p (DECL_CONTEXT (resolved), current_class)
10485 && !flag_emit_class_files && !flag_emit_xref)
10486 resolved = build_class_init (DECL_CONTEXT (resolved), resolved);
10488 if (resolved == error_mark_node)
10489 PATCH_METHOD_RETURN_ERROR ();
10491 type = GET_SKIP_TYPE (resolved);
10492 resolve_and_layout (type, NULL_TREE);
10494 if (JPRIMITIVE_TYPE_P (type))
10496 parse_error_context
10498 "Can't invoke a method on primitive type `%s'",
10499 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type))));
10500 PATCH_METHOD_RETURN_ERROR ();
10503 list = lookup_method_invoke (0, identifier_wfl, type, identifier, args);
10504 args = nreverse (args);
10506 /* We're resolving a call from a type */
10507 if (TREE_CODE (resolved) == TYPE_DECL)
10509 if (CLASS_INTERFACE (resolved))
10511 parse_error_context
10513 "Can't make static reference to method `%s' in interface `%s'",
10514 IDENTIFIER_POINTER (identifier),
10515 IDENTIFIER_POINTER (name));
10516 PATCH_METHOD_RETURN_ERROR ();
10518 if (list && !METHOD_STATIC (list))
10520 char *fct_name = xstrdup (lang_printable_name (list, 2));
10521 parse_error_context
10523 "Can't make static reference to method `%s %s' in class `%s'",
10524 lang_printable_name (TREE_TYPE (TREE_TYPE (list)), 0),
10525 fct_name, IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type))));
10527 PATCH_METHOD_RETURN_ERROR ();
10531 this_arg = primary = resolved;
10533 if (TYPE_ARRAY_P (type) && identifier == get_identifier ("clone"))
10534 is_array_clone_call = 1;
10536 /* IDENTIFIER_WFL will be used to report any problem further */
10537 wfl = identifier_wfl;
10539 /* Resolution of simple names, names generated after a primary: or
10543 tree class_to_search = NULL_TREE;
10544 int lc; /* Looking for Constructor */
10546 /* We search constructor in their target class */
10547 if (CALL_CONSTRUCTOR_P (patch))
10549 if (TREE_CODE (patch) == NEW_CLASS_EXPR)
10550 class_to_search = EXPR_WFL_NODE (wfl);
10551 else if (EXPR_WFL_NODE (TREE_OPERAND (patch, 0)) ==
10552 this_identifier_node)
10553 class_to_search = NULL_TREE;
10554 else if (EXPR_WFL_NODE (TREE_OPERAND (patch, 0)) ==
10555 super_identifier_node)
10558 if (CLASSTYPE_SUPER (current_class))
10560 DECL_NAME (TYPE_NAME (CLASSTYPE_SUPER (current_class)));
10563 parse_error_context (wfl, "Can't invoke super constructor on java.lang.Object");
10564 PATCH_METHOD_RETURN_ERROR ();
10568 /* Class to search is NULL if we're searching the current one */
10569 if (class_to_search)
10571 class_to_search = resolve_and_layout (class_to_search, wfl);
10573 if (!class_to_search)
10575 parse_error_context
10576 (wfl, "Class `%s' not found in type declaration",
10577 IDENTIFIER_POINTER (EXPR_WFL_NODE (wfl)));
10578 PATCH_METHOD_RETURN_ERROR ();
10581 /* Can't instantiate an abstract class, but we can
10582 invoke it's constructor. It's use within the `new'
10583 context is denied here. */
10584 if (CLASS_ABSTRACT (class_to_search)
10585 && TREE_CODE (patch) == NEW_CLASS_EXPR)
10587 parse_error_context
10588 (wfl, "Class `%s' is an abstract class. It can't be instantiated",
10589 IDENTIFIER_POINTER (EXPR_WFL_NODE (wfl)));
10590 PATCH_METHOD_RETURN_ERROR ();
10593 class_to_search = TREE_TYPE (class_to_search);
10596 class_to_search = current_class;
10599 /* This is a regular search in the local class, unless an
10600 alternate class is specified. */
10603 if (where != NULL_TREE)
10604 class_to_search = where;
10605 else if (QUALIFIED_P (name))
10606 class_to_search = current_class;
10609 class_to_search = current_class;
10613 if (has_method (class_to_search, name))
10615 if (! INNER_CLASS_TYPE_P (class_to_search))
10617 parse_error_context (wfl,
10618 "No method named `%s' in scope",
10619 IDENTIFIER_POINTER (name));
10620 PATCH_METHOD_RETURN_ERROR ();
10623 = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (class_to_search)));
10629 /* NAME is a simple identifier or comes from a primary. Search
10630 in the class whose declaration contain the method being
10632 resolve_and_layout (class_to_search, NULL_TREE);
10634 list = lookup_method_invoke (lc, wfl, class_to_search, name, args);
10635 /* Don't continue if no method were found, as the next statement
10636 can't be executed then. */
10638 PATCH_METHOD_RETURN_ERROR ();
10640 if (TYPE_ARRAY_P (class_to_search)
10641 && DECL_NAME (list) == get_identifier ("clone"))
10642 is_array_clone_call = 1;
10644 /* Check for static reference if non static methods */
10645 if (check_for_static_method_reference (wfl, patch, list,
10646 class_to_search, primary))
10647 PATCH_METHOD_RETURN_ERROR ();
10649 /* Check for inner classes creation from illegal contexts */
10650 if (lc && (INNER_CLASS_TYPE_P (class_to_search)
10651 && !CLASS_STATIC (TYPE_NAME (class_to_search)))
10652 && INNER_ENCLOSING_SCOPE_CHECK (class_to_search)
10653 && !DECL_INIT_P (current_function_decl))
10655 parse_error_context
10656 (wfl, "No enclosing instance for inner class `%s' is in scope%s",
10657 lang_printable_name (class_to_search, 0),
10658 (!current_this ? "" :
10659 "; an explicit one must be provided when creating this inner class"));
10660 PATCH_METHOD_RETURN_ERROR ();
10663 /* Non static methods are called with the current object extra
10664 argument. If patch a `new TYPE()', the argument is the value
10665 returned by the object allocator. If method is resolved as a
10666 primary, use the primary otherwise use the current THIS. */
10667 args = nreverse (args);
10668 if (TREE_CODE (patch) != NEW_CLASS_EXPR)
10670 this_arg = primary ? primary : current_this;
10672 /* If we're using an access method, things are different.
10673 There are two family of cases:
10675 1) We're not generating bytecodes:
10677 - LIST is non static. It's invocation is transformed from
10678 x(a1,...,an) into this$<n>.x(a1,....an).
10679 - LIST is static. It's invocation is transformed from
10680 x(a1,...,an) into TYPE_OF(this$<n>).x(a1,....an)
10682 2) We're generating bytecodes:
10684 - LIST is non static. It's invocation is transformed from
10685 x(a1,....,an) into access$<n>(this$<n>,a1,...,an).
10686 - LIST is static. It's invocation is transformed from
10687 x(a1,....,an) into TYPE_OF(this$<n>).x(a1,....an).
10689 Of course, this$<n> can be arbitrarily complex, ranging from
10690 this$0 (the immediate outer context) to
10691 access$0(access$0(...(this$0))).
10693 maybe_use_access_method returns a nonzero value if the
10694 this_arg has to be moved into the (then generated) stub
10695 argument list. In the meantime, the selected function
10696 might have be replaced by a generated stub. */
10698 maybe_use_access_method (is_super_init, &list, &this_arg))
10700 args = tree_cons (NULL_TREE, this_arg, args);
10701 this_arg = NULL_TREE; /* So it doesn't get chained twice */
10706 /* Merge point of all resolution schemes. If we have nothing, this
10707 is an error, already signaled */
10709 PATCH_METHOD_RETURN_ERROR ();
10711 /* Check accessibility, position the is_static flag, build and
10713 if (not_accessible_p (DECL_CONTEXT (current_function_decl), list,
10714 (primary ? TREE_TYPE (TREE_TYPE (primary)) :
10715 NULL_TREE), from_super)
10716 /* Calls to clone() on array types are permitted as a special-case. */
10717 && !is_array_clone_call)
10719 const char *const fct_name = IDENTIFIER_POINTER (DECL_NAME (list));
10720 const char *const access =
10721 accessibility_string (get_access_flags_from_decl (list));
10722 const char *const klass =
10723 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (DECL_CONTEXT (list))));
10724 const char *const refklass =
10725 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (current_class)));
10726 const char *const what = (DECL_CONSTRUCTOR_P (list)
10727 ? "constructor" : "method");
10728 parse_error_context (wfl,
10729 "Can't access %s %s `%s.%s' from `%s'",
10730 access, what, klass, fct_name, refklass);
10731 PATCH_METHOD_RETURN_ERROR ();
10734 /* Deprecation check: check whether the method being invoked or the
10735 instance-being-created's type are deprecated. */
10736 if (TREE_CODE (patch) == NEW_CLASS_EXPR)
10737 check_deprecation (wfl, TYPE_NAME (DECL_CONTEXT (list)));
10738 check_deprecation (wfl, list);
10740 /* If invoking a innerclass constructor, there are hidden parameters
10742 if (TREE_CODE (patch) == NEW_CLASS_EXPR
10743 && PURE_INNER_CLASS_TYPE_P (DECL_CONTEXT (list)))
10745 /* And make sure we add the accessed local variables to be saved
10746 in field aliases. */
10747 args = build_alias_initializer_parameter_list
10748 (AIPL_FUNCTION_CTOR_INVOCATION, DECL_CONTEXT (list), args, NULL);
10750 /* Secretly pass the current_this/primary as a second argument */
10751 if (primary || current_this)
10754 tree this_type = (current_this ?
10755 TREE_TYPE (TREE_TYPE (current_this)) : NULL_TREE);
10756 /* Method's (list) enclosing context */
10757 tree mec = DECL_CONTEXT (TYPE_NAME (DECL_CONTEXT (list)));
10758 /* If we have a primary, use it. */
10760 extra_arg = primary;
10761 /* The current `this' is an inner class but isn't a direct
10762 enclosing context for the inner class we're trying to
10763 create. Build an access to the proper enclosing context
10765 else if (current_this && PURE_INNER_CLASS_TYPE_P (this_type)
10766 && this_type != TREE_TYPE (mec))
10769 extra_arg = build_access_to_thisn (current_class,
10770 TREE_TYPE (mec), 0);
10771 extra_arg = java_complete_tree (extra_arg);
10773 /* Otherwise, just use the current `this' as an enclosing
10776 extra_arg = current_this;
10777 args = tree_cons (NULL_TREE, extra_arg, args);
10780 args = tree_cons (NULL_TREE, integer_zero_node, args);
10783 /* This handles the situation where a constructor invocation needs
10784 to have an enclosing context passed as a second parameter (the
10785 constructor is one of an inner class). */
10786 if ((is_super_init ||
10787 (TREE_CODE (patch) == CALL_EXPR && name == this_identifier_node))
10788 && PURE_INNER_CLASS_TYPE_P (DECL_CONTEXT (list)))
10790 tree dest = TYPE_NAME (DECL_CONTEXT (list));
10792 build_access_to_thisn (current_class, DECL_CONTEXT (dest), 0);
10793 extra_arg = java_complete_tree (extra_arg);
10794 args = tree_cons (NULL_TREE, extra_arg, args);
10797 is_static_flag = METHOD_STATIC (list);
10798 if (! is_static_flag && this_arg != NULL_TREE)
10799 args = tree_cons (NULL_TREE, this_arg, args);
10801 /* In the context of an explicit constructor invocation, we can't
10802 invoke any method relying on `this'. Exceptions are: we're
10803 invoking a static function, primary exists and is not the current
10804 this, we're creating a new object. */
10805 if (ctxp->explicit_constructor_p
10807 && (!primary || primary == current_this)
10808 && (TREE_CODE (patch) != NEW_CLASS_EXPR))
10810 parse_error_context (wfl, "Can't reference `this' before the superclass constructor has been called");
10811 PATCH_METHOD_RETURN_ERROR ();
10813 java_parser_context_restore_global ();
10815 *is_static = is_static_flag;
10816 /* Sometimes, we want the decl of the selected method. Such as for
10820 patch = patch_invoke (patch, list, args);
10822 /* Now is a good time to insert the call to finit$ */
10823 if (is_super_init && CLASS_HAS_FINIT_P (current_class))
10825 tree finit_parms, finit_call;
10827 /* Prepare to pass hidden parameters to finit$, if any. */
10828 finit_parms = build_alias_initializer_parameter_list
10829 (AIPL_FUNCTION_FINIT_INVOCATION, current_class, NULL_TREE, NULL);
10832 build_method_invocation (build_wfl_node (finit_identifier_node),
10835 /* Generate the code used to initialize fields declared with an
10836 initialization statement and build a compound statement along
10837 with the super constructor invocation. */
10838 CAN_COMPLETE_NORMALLY (patch) = 1;
10839 patch = build2 (COMPOUND_EXPR, void_type_node, patch,
10840 java_complete_tree (finit_call));
10845 /* Check that we're not trying to do a static reference to a method in
10846 non static method. Return 1 if it's the case, 0 otherwise. */
10849 check_for_static_method_reference (tree wfl, tree node, tree method,
10850 tree where, tree primary)
10852 if (METHOD_STATIC (current_function_decl)
10853 && !METHOD_STATIC (method) && !primary && !CALL_CONSTRUCTOR_P (node))
10855 char *fct_name = xstrdup (lang_printable_name (method, 0));
10856 parse_error_context
10857 (wfl, "Can't make static reference to method `%s %s' in class `%s'",
10858 lang_printable_name (TREE_TYPE (TREE_TYPE (method)), 0), fct_name,
10859 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (where))));
10866 /* Fix the invocation of *MDECL if necessary in the case of a
10867 invocation from an inner class. *THIS_ARG might be modified
10868 appropriately and an alternative access to *MDECL might be
10872 maybe_use_access_method (int is_super_init, tree *mdecl, tree *this_arg)
10875 tree md = *mdecl, ta = *this_arg;
10877 int non_static_context = !METHOD_STATIC (md);
10880 || DECL_CONTEXT (md) == current_class
10881 || !PURE_INNER_CLASS_TYPE_P (current_class)
10882 || DECL_FINIT_P (md)
10883 || DECL_INSTINIT_P (md))
10886 /* If we're calling a method found in an enclosing class, generate
10887 what it takes to retrieve the right this. Don't do that if we're
10888 invoking a static method. Note that if MD's type is unrelated to
10889 CURRENT_CLASS, then the current this can be used. */
10891 if (non_static_context && DECL_CONTEXT (md) != object_type_node)
10893 ctx = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (current_class)));
10894 if (inherits_from_p (ctx, DECL_CONTEXT (md)))
10896 ta = build_current_thisn (current_class);
10897 ta = build_wfl_node (ta);
10904 maybe_build_thisn_access_method (type);
10905 if (inherits_from_p (type, DECL_CONTEXT (md)))
10907 ta = build_access_to_thisn (ctx, type, 0);
10910 type = (DECL_CONTEXT (TYPE_NAME (type)) ?
10911 TREE_TYPE (DECL_CONTEXT (TYPE_NAME (type))) : NULL_TREE);
10914 ta = java_complete_tree (ta);
10917 /* We might have to use an access method to get to MD. We can
10918 break the method access rule as far as we're not generating
10920 if (METHOD_PRIVATE (md) && flag_emit_class_files)
10922 md = build_outer_method_access_method (md);
10929 /* Returning a nonzero value indicates we were doing a non static
10930 method invocation that is now a static invocation. It will have
10931 callee displace `this' to insert it in the regular argument
10933 return (non_static_context && to_return);
10936 /* Patch an invoke expression METHOD and ARGS, based on its invocation
10940 patch_invoke (tree patch, tree method, tree args)
10943 tree original_call, t, ta;
10944 tree check = NULL_TREE;
10946 /* Last step for args: convert build-in types. If we're dealing with
10947 a new TYPE() type call, the first argument to the constructor
10948 isn't found in the incoming argument list, but delivered by
10950 t = TYPE_ARG_TYPES (TREE_TYPE (method));
10951 if (TREE_CODE (patch) == NEW_CLASS_EXPR)
10952 t = TREE_CHAIN (t);
10953 for (ta = args; t != end_params_node && ta;
10954 t = TREE_CHAIN (t), ta = TREE_CHAIN (ta))
10955 if (JPRIMITIVE_TYPE_P (TREE_TYPE (TREE_VALUE (ta))) &&
10956 TREE_TYPE (TREE_VALUE (ta)) != TREE_VALUE (t))
10957 TREE_VALUE (ta) = convert (TREE_VALUE (t), TREE_VALUE (ta));
10959 /* Resolve unresolved returned type issues */
10960 t = TREE_TYPE (TREE_TYPE (method));
10961 if (TREE_CODE (t) == POINTER_TYPE && !CLASS_LOADED_P (TREE_TYPE (t)))
10962 resolve_and_layout (TREE_TYPE (t), NULL);
10964 if (flag_emit_class_files || flag_emit_xref)
10968 switch (invocation_mode (method, CALL_USING_SUPER (patch)))
10970 case INVOKE_VIRTUAL:
10971 dtable = invoke_build_dtable (0, args);
10972 func = build_invokevirtual (dtable, method);
10975 case INVOKE_NONVIRTUAL:
10976 /* If the object for the method call is null, we throw an
10977 exception. We don't do this if the object is the current
10978 method's `this'. In other cases we just rely on an
10979 optimization pass to eliminate redundant checks. */
10980 if (TREE_VALUE (args) != current_this)
10982 /* We use a save_expr here to make sure we only evaluate
10983 the new `self' expression once. */
10984 tree save_arg = save_expr (TREE_VALUE (args));
10985 TREE_VALUE (args) = save_arg;
10986 check = java_check_reference (save_arg, 1);
10988 /* Fall through. */
10991 case INVOKE_STATIC:
10993 tree signature = build_java_signature (TREE_TYPE (method));
10994 func = build_known_method_ref (method, TREE_TYPE (method),
10995 DECL_CONTEXT (method),
11000 case INVOKE_INTERFACE:
11001 dtable = invoke_build_dtable (1, args);
11002 func = build_invokeinterface (dtable, method);
11009 /* Ensure self_type is initialized, (invokestatic). FIXME */
11010 func = build1 (NOP_EXPR, build_pointer_type (TREE_TYPE (method)), func);
11013 TREE_TYPE (patch) = TREE_TYPE (TREE_TYPE (method));
11014 TREE_OPERAND (patch, 0) = func;
11015 TREE_OPERAND (patch, 1) = args;
11016 patch = check_for_builtin (method, patch);
11017 original_call = patch;
11019 /* We're processing a `new TYPE ()' form. New is called and its
11020 returned value is the first argument to the constructor. We build
11021 a COMPOUND_EXPR and use saved expression so that the overall NEW
11022 expression value is a pointer to a newly created and initialized
11024 if (TREE_CODE (original_call) == NEW_CLASS_EXPR)
11026 tree class = DECL_CONTEXT (method);
11027 tree c1, saved_new, size, new;
11030 if (flag_emit_class_files || flag_emit_xref)
11032 TREE_TYPE (patch) = build_pointer_type (class);
11035 if (!TYPE_SIZE (class))
11036 safe_layout_class (class);
11037 size = size_in_bytes (class);
11039 (class_has_finalize_method (class) ? alloc_object_node
11040 : alloc_no_finalizer_node);
11041 new = build3 (CALL_EXPR, promote_type (class),
11042 build_address_of (alloc_node),
11043 build_tree_list (NULL_TREE, build_class_ref (class)),
11045 saved_new = save_expr (new);
11046 c1 = build_tree_list (NULL_TREE, saved_new);
11047 TREE_CHAIN (c1) = TREE_OPERAND (original_call, 1);
11048 TREE_OPERAND (original_call, 1) = c1;
11049 TREE_SET_CODE (original_call, CALL_EXPR);
11050 patch = build2 (COMPOUND_EXPR, TREE_TYPE (new), patch, saved_new);
11053 /* If CHECK is set, then we are building a check to see if the object
11055 if (check != NULL_TREE)
11057 /* We have to call force_evaluation_order now because creating a
11058 COMPOUND_EXPR wraps the arg list in a way that makes it
11059 unrecognizable by force_evaluation_order later. Yuk. */
11060 patch = build2 (COMPOUND_EXPR, TREE_TYPE (patch), check,
11061 force_evaluation_order (patch));
11062 TREE_SIDE_EFFECTS (patch) = 1;
11065 /* In order to be able to modify PATCH later, we SAVE_EXPR it and
11066 put it as the first expression of a COMPOUND_EXPR. The second
11067 expression being an empty statement to be later patched if
11068 necessary. We remember a TREE_LIST (the PURPOSE is the method,
11069 the VALUE is the compound) in a hashtable and return a
11070 COMPOUND_EXPR built so that the result of the evaluation of the
11071 original PATCH node is returned. */
11072 if (STATIC_CLASS_INIT_OPT_P ()
11073 && current_function_decl && METHOD_STATIC (method))
11076 tree fndecl = current_function_decl;
11077 /* We have to call force_evaluation_order now because creating a
11078 COMPOUND_EXPR wraps the arg list in a way that makes it
11079 unrecognizable by force_evaluation_order later. Yuk. */
11080 tree save = force_evaluation_order (patch);
11081 tree type = TREE_TYPE (patch);
11083 patch = build2 (COMPOUND_EXPR, type, save, build_java_empty_stmt ());
11084 list = tree_cons (method, patch,
11085 DECL_FUNCTION_STATIC_METHOD_INVOCATION_COMPOUND (fndecl));
11087 DECL_FUNCTION_STATIC_METHOD_INVOCATION_COMPOUND (fndecl) = list;
11089 patch = build2 (COMPOUND_EXPR, type, patch, save);
11096 invocation_mode (tree method, int super)
11098 int access = get_access_flags_from_decl (method);
11101 return INVOKE_SUPER;
11103 if (access & ACC_STATIC)
11104 return INVOKE_STATIC;
11106 /* We have to look for a constructor before we handle nonvirtual
11107 calls; otherwise the constructor will look nonvirtual. */
11108 if (DECL_CONSTRUCTOR_P (method))
11109 return INVOKE_STATIC;
11111 if (access & ACC_FINAL || access & ACC_PRIVATE)
11112 return INVOKE_NONVIRTUAL;
11114 if (CLASS_FINAL (TYPE_NAME (DECL_CONTEXT (method))))
11115 return INVOKE_NONVIRTUAL;
11117 if (CLASS_INTERFACE (TYPE_NAME (DECL_CONTEXT (method))))
11118 return INVOKE_INTERFACE;
11120 return INVOKE_VIRTUAL;
11123 /* Retrieve a refined list of matching methods. It covers the step
11124 15.11.2 (Compile-Time Step 2) */
11127 lookup_method_invoke (int lc, tree cl, tree class, tree name, tree arg_list)
11129 tree atl = end_params_node; /* Arg Type List */
11130 tree method, signature, list, node;
11131 const char *candidates; /* Used for error report */
11134 /* Fix the arguments */
11135 for (node = arg_list; node; node = TREE_CHAIN (node))
11137 tree current_arg = TREE_TYPE (TREE_VALUE (node));
11138 /* Non primitive type may have to be resolved */
11139 if (!JPRIMITIVE_TYPE_P (current_arg))
11140 resolve_and_layout (current_arg, NULL_TREE);
11142 if (TREE_CODE (current_arg) == RECORD_TYPE)
11143 current_arg = promote_type (current_arg);
11144 atl = tree_cons (NULL_TREE, current_arg, atl);
11147 /* Presto. If we're dealing with an anonymous class and a
11148 constructor call, generate the right constructor now, since we
11149 know the arguments' types. */
11151 if (lc && ANONYMOUS_CLASS_P (class))
11153 tree mdecl = craft_constructor (TYPE_NAME (class), atl);
11154 /* The anonymous class may have already been laid out, so make sure
11155 the new constructor is laid out here. */
11156 layout_class_method (class, CLASSTYPE_SUPER (class), mdecl, NULL_TREE);
11159 /* Find all candidates and then refine the list, searching for the
11160 most specific method. */
11161 list = find_applicable_accessible_methods_list (lc, class, name, atl);
11162 list = find_most_specific_methods_list (list);
11163 if (list && !TREE_CHAIN (list))
11164 return TREE_VALUE (list);
11166 /* Issue an error. List candidates if any. Candidates are listed
11167 only if accessible (non accessible methods may end-up here for
11168 the sake of a better error report). */
11173 obstack_grow (&temporary_obstack, ". Candidates are:\n", 18);
11174 for (current = list; current; current = TREE_CHAIN (current))
11176 tree cm = TREE_VALUE (current);
11177 char string [4096];
11178 if (!cm || not_accessible_p (class, cm, NULL_TREE, 0))
11181 (string, " `%s' in `%s'%s",
11182 get_printable_method_name (cm),
11183 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (DECL_CONTEXT (cm)))),
11184 (TREE_CHAIN (current) ? "\n" : ""));
11185 obstack_grow (&temporary_obstack, string, strlen (string));
11187 obstack_1grow (&temporary_obstack, '\0');
11188 candidates = obstack_finish (&temporary_obstack);
11190 /* Issue the error message */
11191 method = make_node (FUNCTION_TYPE);
11192 TYPE_ARG_TYPES (method) = atl;
11193 signature = build_java_argument_signature (method);
11194 dup = xstrdup (lang_printable_name (class, 0));
11195 parse_error_context (cl, "Can't find %s `%s(%s)' in type `%s'%s",
11196 (lc ? "constructor" : "method"),
11197 (lc ? dup : IDENTIFIER_POINTER (name)),
11198 IDENTIFIER_POINTER (signature), dup,
11199 (candidates ? candidates : ""));
11204 /* 15.11.2.1: Find Methods that are Applicable and Accessible. LC is 1
11205 when we're looking for a constructor. */
11208 find_applicable_accessible_methods_list (int lc, tree class, tree name,
11211 static htab_t searched_classes;
11212 static int search_not_done = 0;
11213 tree list = NULL_TREE, all_list = NULL_TREE;
11217 /* Check the hash table to determine if this class has been searched
11219 if (searched_classes)
11221 if (htab_find (searched_classes, class) != NULL)
11226 searched_classes = htab_create (10, htab_hash_pointer,
11227 htab_eq_pointer, NULL);
11231 *htab_find_slot (searched_classes, class, INSERT) = class;
11233 if (!CLASS_LOADED_P (class))
11235 load_class (class, 1);
11236 safe_layout_class (class);
11239 /* Search interfaces */
11240 if (TREE_CODE (TYPE_NAME (class)) == TYPE_DECL
11241 && CLASS_INTERFACE (TYPE_NAME (class)))
11243 search_applicable_methods_list (lc, TYPE_METHODS (class),
11244 name, arglist, &list, &all_list);
11245 for (i = 1; BINFO_BASE_ITERATE (TYPE_BINFO (class), i, base_binfo); i++)
11247 tree t = BINFO_TYPE (base_binfo);
11250 rlist = find_applicable_accessible_methods_list (lc, t, name,
11252 list = chainon (rlist, list);
11255 /* Search classes */
11258 search_applicable_methods_list (lc, TYPE_METHODS (class),
11259 name, arglist, &list, &all_list);
11261 /* When looking finit$, class$ or instinit$, we turn LC to 1 so
11262 that we only search in class. Note that we should have found
11263 something at this point. */
11264 if (ID_FINIT_P (name) || ID_CLASSDOLLAR_P (name) || ID_INSTINIT_P (name))
11271 /* We must search all interfaces of this class */
11275 BINFO_BASE_ITERATE (TYPE_BINFO (class), i, base_binfo); i++)
11277 tree t = BINFO_TYPE (base_binfo);
11278 if (t != object_type_node)
11281 = find_applicable_accessible_methods_list (lc, t,
11283 list = chainon (rlist, list);
11288 /* Search superclass */
11289 if (!lc && CLASSTYPE_SUPER (class) != NULL_TREE)
11292 class = CLASSTYPE_SUPER (class);
11293 rlist = find_applicable_accessible_methods_list (lc, class,
11295 list = chainon (rlist, list);
11301 /* We're done. Reset the searched classes list and finally search
11302 java.lang.Object if it wasn't searched already. */
11303 if (!search_not_done)
11306 && TYPE_METHODS (object_type_node)
11307 && htab_find (searched_classes, object_type_node) == NULL)
11309 search_applicable_methods_list (lc,
11310 TYPE_METHODS (object_type_node),
11311 name, arglist, &list, &all_list);
11313 htab_delete (searched_classes);
11314 searched_classes = NULL;
11317 /* Either return the list obtained or all selected (but
11318 inaccessible) methods for better error report. */
11319 return (!list ? all_list : list);
11322 /* Effectively search for the appropriate method in method */
11325 search_applicable_methods_list (int lc, tree method, tree name, tree arglist,
11326 tree *list, tree *all_list)
11328 for (; method; method = TREE_CHAIN (method))
11330 /* When dealing with constructor, stop here, otherwise search
11332 if (lc && !DECL_CONSTRUCTOR_P (method))
11334 else if (!lc && (DECL_CONSTRUCTOR_P (method)
11335 || (DECL_NAME (method) != name)))
11338 if (argument_types_convertible (method, arglist))
11340 /* Retain accessible methods only */
11341 if (!not_accessible_p (DECL_CONTEXT (current_function_decl),
11342 method, NULL_TREE, 0))
11343 *list = tree_cons (NULL_TREE, method, *list);
11345 /* Also retain all selected method here */
11346 *all_list = tree_cons (NULL_TREE, method, *list);
11351 /* 15.11.2.2 Choose the Most Specific Method */
11354 find_most_specific_methods_list (tree list)
11357 int abstract, candidates;
11358 tree current, new_list = NULL_TREE;
11359 for (current = list; current; current = TREE_CHAIN (current))
11362 DECL_SPECIFIC_COUNT (TREE_VALUE (current)) = 0;
11364 for (method = list; method; method = TREE_CHAIN (method))
11366 tree method_v, current_v;
11367 /* Don't test a method against itself */
11368 if (method == current)
11371 method_v = TREE_VALUE (method);
11372 current_v = TREE_VALUE (current);
11374 /* Compare arguments and location where methods where declared */
11375 if (argument_types_convertible (method_v, current_v))
11377 if (valid_method_invocation_conversion_p
11378 (DECL_CONTEXT (method_v), DECL_CONTEXT (current_v))
11379 || (INNER_CLASS_TYPE_P (DECL_CONTEXT (current_v))
11380 && enclosing_context_p (DECL_CONTEXT (method_v),
11381 DECL_CONTEXT (current_v))))
11383 int v = (DECL_SPECIFIC_COUNT (current_v) +=
11384 (INNER_CLASS_TYPE_P (DECL_CONTEXT (current_v)) ? 2 : 1));
11385 max = (v > max ? v : max);
11391 /* Review the list and select the maximally specific methods */
11392 for (current = list, abstract = -1, candidates = -1;
11393 current; current = TREE_CHAIN (current))
11394 if (DECL_SPECIFIC_COUNT (TREE_VALUE (current)) == max)
11396 new_list = tree_cons (NULL_TREE, TREE_VALUE (current), new_list);
11397 abstract += (METHOD_ABSTRACT (TREE_VALUE (current)) ? 1 : 0);
11401 /* If we have several and they're all abstract, just pick the
11403 if (candidates > 0 && candidates == abstract)
11405 /* FIXME: merge the throws clauses. There is no convenient way
11406 to do this in gcj right now, since ideally we'd like to
11407 introduce a new METHOD_DECL here, but that is really not
11409 new_list = nreverse (new_list);
11410 TREE_CHAIN (new_list) = NULL_TREE;
11414 /* We have several (we couldn't find a most specific), all but one
11415 are abstract, we pick the only non abstract one. */
11416 if (candidates > 0 && (candidates == abstract+1))
11418 for (current = new_list; current; current = TREE_CHAIN (current))
11419 if (!METHOD_ABSTRACT (TREE_VALUE (current)))
11421 TREE_CHAIN (current) = NULL_TREE;
11422 new_list = current;
11426 /* If we can't find one, lower expectations and try to gather multiple
11427 maximally specific methods */
11428 while (!new_list && max)
11432 if (DECL_SPECIFIC_COUNT (TREE_VALUE (current)) == max)
11433 new_list = tree_cons (NULL_TREE, TREE_VALUE (current), new_list);
11440 /* Make sure that the type of each M2_OR_ARGLIST arguments can be
11441 converted by method invocation conversion (5.3) to the type of the
11442 corresponding parameter of M1. Implementation expects M2_OR_ARGLIST
11443 to change less often than M1. */
11445 static GTY(()) tree m2_arg_value;
11446 static GTY(()) tree m2_arg_cache;
11449 argument_types_convertible (tree m1, tree m2_or_arglist)
11451 tree m1_arg, m2_arg;
11453 SKIP_THIS_AND_ARTIFICIAL_PARMS (m1_arg, m1)
11455 if (m2_arg_value == m2_or_arglist)
11456 m2_arg = m2_arg_cache;
11459 /* M2_OR_ARGLIST can be a function DECL or a raw list of
11461 if (m2_or_arglist && TREE_CODE (m2_or_arglist) == FUNCTION_DECL)
11463 m2_arg = TYPE_ARG_TYPES (TREE_TYPE (m2_or_arglist));
11464 if (!METHOD_STATIC (m2_or_arglist))
11465 m2_arg = TREE_CHAIN (m2_arg);
11468 m2_arg = m2_or_arglist;
11470 m2_arg_value = m2_or_arglist;
11471 m2_arg_cache = m2_arg;
11474 while (m1_arg != end_params_node && m2_arg != end_params_node)
11476 resolve_and_layout (TREE_VALUE (m1_arg), NULL_TREE);
11477 if (!valid_method_invocation_conversion_p (TREE_VALUE (m1_arg),
11478 TREE_VALUE (m2_arg)))
11480 m1_arg = TREE_CHAIN (m1_arg);
11481 m2_arg = TREE_CHAIN (m2_arg);
11483 return m1_arg == end_params_node && m2_arg == end_params_node;
11486 /* Qualification routines */
11488 /* Given a name x.y.z, look up x locally. If it's found, save the
11489 decl. If it's not found, mark the name as RESOLVE_PACKAGE_NAME_P,
11490 so that we later try and load the appropriate classes. */
11492 qualify_ambiguous_name (tree id)
11496 /* We inspect the first item of the qualification list. As a sanity
11497 check, make sure that it is an identfier node. */
11498 tree qual = EXPR_WFL_QUALIFICATION (id);
11499 tree qual_wfl = QUAL_WFL (qual);
11501 if (TREE_CODE (qual_wfl) != EXPR_WITH_FILE_LOCATION)
11504 name = EXPR_WFL_NODE (qual_wfl);
11506 /* If we don't have an identifier, or we have a 'this' or 'super',
11507 then field access processing is all we need : there is nothing
11509 if (!name || TREE_CODE (name) != IDENTIFIER_NODE ||
11510 name == this_identifier_node ||
11511 name == super_identifier_node)
11514 /* If name appears within the scope of a local variable declaration
11515 or parameter declaration, or is a field within an enclosing
11516 class, then it is an expression name. Save the decl and let
11517 resolve_field_access do it's work. */
11518 if ((decl = IDENTIFIER_LOCAL_VALUE (name)) ||
11519 (decl = lookup_field_wrapper (current_class, name)))
11521 QUAL_RESOLUTION (qual) = decl;
11525 /* If name is a known class name (either declared or imported), mark
11526 us as a type name. */
11527 if ((decl = resolve_and_layout (name, NULL_TREE)))
11529 RESOLVE_TYPE_NAME_P (qual_wfl) = 1;
11530 QUAL_RESOLUTION (qual) = decl;
11533 /* Check here that NAME isn't declared by more than one
11534 type-import-on-demand declaration of the compilation unit
11535 containing NAME. FIXME */
11537 /* We couldn't find a declaration for the name. Assume for now that
11538 we have a qualified class name that needs to be loaded from an
11539 external class file. */
11541 RESOLVE_PACKAGE_NAME_P (qual_wfl) = 1;
11543 /* Propagate the qualification across other components of the
11545 for (qual = TREE_CHAIN (qual); qual;
11546 qual_wfl = QUAL_WFL (qual), qual = TREE_CHAIN (qual))
11548 if (RESOLVE_PACKAGE_NAME_P (qual_wfl))
11549 RESOLVE_PACKAGE_NAME_P (QUAL_WFL (qual)) = 1;
11552 /* Store the global qualification for the ambiguous part of ID back
11554 if (RESOLVE_TYPE_NAME_P (qual_wfl))
11555 RESOLVE_TYPE_NAME_P (id) = 1;
11556 else if (RESOLVE_PACKAGE_NAME_P (qual_wfl))
11557 RESOLVE_PACKAGE_NAME_P (id) = 1;
11560 /* Patch tree nodes in a function body. When a BLOCK is found, push
11561 local variable decls if present.
11562 Same as java_complete_lhs, but does resolve static finals to values. */
11565 java_complete_tree (tree node)
11567 node = java_complete_lhs (node);
11568 if (JDECL_P (node) && CLASS_FINAL_VARIABLE_P (node)
11569 && DECL_INITIAL (node) != NULL_TREE
11570 && !flag_emit_xref)
11572 tree value = fold_constant_for_init (node, node);
11573 if (value != NULL_TREE)
11580 java_stabilize_reference (tree node)
11582 if (TREE_CODE (node) == COMPOUND_EXPR)
11584 tree op0 = TREE_OPERAND (node, 0);
11585 tree op1 = TREE_OPERAND (node, 1);
11586 TREE_OPERAND (node, 0) = save_expr (op0);
11587 TREE_OPERAND (node, 1) = java_stabilize_reference (op1);
11590 return stabilize_reference (node);
11593 /* Patch tree nodes in a function body. When a BLOCK is found, push
11594 local variable decls if present.
11595 Same as java_complete_tree, but does not resolve static finals to values. */
11598 java_complete_lhs (tree node)
11600 tree nn, cn, wfl_op1, wfl_op2, wfl_op3;
11603 /* CONVERT_EXPR always has its type set, even though it needs to be
11605 if (TREE_TYPE (node) && TREE_CODE (node) != CONVERT_EXPR)
11608 /* The switch block implements cases processing container nodes
11609 first. Contained nodes are always written back. Leaves come
11610 next and return a value. */
11611 switch (TREE_CODE (node))
11615 /* 1- Block section.
11616 Set the local values on decl names so we can identify them
11617 faster when they're referenced. At that stage, identifiers
11618 are legal so we don't check for declaration errors. */
11619 for (cn = BLOCK_EXPR_DECLS (node); cn; cn = TREE_CHAIN (cn))
11621 DECL_CONTEXT (cn) = current_function_decl;
11622 IDENTIFIER_LOCAL_VALUE (DECL_NAME (cn)) = cn;
11624 if (BLOCK_EXPR_BODY (node) == NULL_TREE)
11625 CAN_COMPLETE_NORMALLY (node) = 1;
11628 tree stmt = BLOCK_EXPR_BODY (node);
11630 int error_seen = 0;
11631 if (TREE_CODE (stmt) == COMPOUND_EXPR)
11633 /* Re-order from (((A; B); C); ...; Z) to
11634 (A; (B; (C ; (...; Z)))).
11635 This makes it easier to scan the statements left-to-right
11636 without using recursion (which might overflow the stack
11637 if the block has many statements. */
11640 tree left = TREE_OPERAND (stmt, 0);
11641 if (TREE_CODE (left) != COMPOUND_EXPR)
11643 TREE_OPERAND (stmt, 0) = TREE_OPERAND (left, 1);
11644 TREE_OPERAND (left, 1) = stmt;
11647 BLOCK_EXPR_BODY (node) = stmt;
11650 /* Now do the actual complete, without deep recursion for
11652 ptr = &BLOCK_EXPR_BODY (node);
11653 while (TREE_CODE (*ptr) == COMPOUND_EXPR
11654 && !IS_EMPTY_STMT (TREE_OPERAND (*ptr, 1)))
11656 tree cur = java_complete_tree (TREE_OPERAND (*ptr, 0));
11657 tree *next = &TREE_OPERAND (*ptr, 1);
11658 TREE_OPERAND (*ptr, 0) = cur;
11659 if (IS_EMPTY_STMT (cur))
11661 /* Optimization; makes it easier to detect empty bodies.
11662 Most useful for <clinit> with all-constant initializer. */
11666 if (TREE_CODE (cur) == ERROR_MARK)
11668 else if (! CAN_COMPLETE_NORMALLY (cur))
11673 if (TREE_CODE (wfl_op2) == BLOCK)
11674 wfl_op2 = BLOCK_EXPR_BODY (wfl_op2);
11675 else if (TREE_CODE (wfl_op2) == COMPOUND_EXPR)
11676 wfl_op2 = TREE_OPERAND (wfl_op2, 0);
11680 if (TREE_CODE (wfl_op2) != CASE_EXPR
11681 && TREE_CODE (wfl_op2) != DEFAULT_EXPR)
11682 unreachable_stmt_error (*ptr);
11684 if (TREE_TYPE (*ptr) == NULL_TREE)
11685 TREE_TYPE (*ptr) = void_type_node;
11688 *ptr = java_complete_tree (*ptr);
11690 if (TREE_CODE (*ptr) == ERROR_MARK || error_seen > 0)
11691 return error_mark_node;
11692 CAN_COMPLETE_NORMALLY (node) = CAN_COMPLETE_NORMALLY (*ptr);
11694 /* Turn local bindings to null */
11695 for (cn = BLOCK_EXPR_DECLS (node); cn; cn = TREE_CHAIN (cn))
11696 IDENTIFIER_LOCAL_VALUE (DECL_NAME (cn)) = NULL_TREE;
11698 TREE_TYPE (node) = void_type_node;
11701 /* 2- They are expressions but ultimately deal with statements */
11704 wfl_op1 = TREE_OPERAND (node, 0);
11705 COMPLETE_CHECK_OP_0 (node);
11706 /* 14.19 A throw statement cannot complete normally. */
11707 CAN_COMPLETE_NORMALLY (node) = 0;
11708 return patch_throw_statement (node, wfl_op1);
11710 case SYNCHRONIZED_EXPR:
11711 wfl_op1 = TREE_OPERAND (node, 0);
11712 return patch_synchronized_statement (node, wfl_op1);
11715 return patch_try_statement (node);
11717 case TRY_FINALLY_EXPR:
11718 COMPLETE_CHECK_OP_0 (node);
11719 COMPLETE_CHECK_OP_1 (node);
11720 if (IS_EMPTY_STMT (TREE_OPERAND (node, 0)))
11721 /* Reduce try/finally nodes with an empty try block. */
11722 return TREE_OPERAND (node, 1);
11723 if (IS_EMPTY_STMT (TREE_OPERAND (node, 1)))
11724 /* Likewise for an empty finally block. */
11725 return TREE_OPERAND (node, 0);
11726 CAN_COMPLETE_NORMALLY (node)
11727 = (CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 0))
11728 && CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 1)));
11729 TREE_TYPE (node) = TREE_TYPE (TREE_OPERAND (node, 0));
11732 case LABELED_BLOCK_EXPR:
11733 PUSH_LABELED_BLOCK (node);
11734 if (LABELED_BLOCK_BODY (node))
11735 COMPLETE_CHECK_OP_1 (node);
11736 TREE_TYPE (node) = void_type_node;
11737 POP_LABELED_BLOCK ();
11739 if (IS_EMPTY_STMT (LABELED_BLOCK_BODY (node)))
11741 LABELED_BLOCK_BODY (node) = NULL_TREE;
11742 CAN_COMPLETE_NORMALLY (node) = 1;
11744 else if (CAN_COMPLETE_NORMALLY (LABELED_BLOCK_BODY (node)))
11745 CAN_COMPLETE_NORMALLY (node) = 1;
11748 case EXIT_BLOCK_EXPR:
11749 /* We don't complete operand 1, because it's the return value of
11750 the EXIT_BLOCK_EXPR which doesn't exist it Java */
11751 return patch_bc_statement (node);
11754 cn = java_complete_tree (TREE_OPERAND (node, 0));
11755 if (cn == error_mark_node)
11758 /* First, the case expression must be constant. Values of final
11759 fields are accepted. */
11761 if ((TREE_CODE (cn) == COMPOUND_EXPR || TREE_CODE (cn) == COMPONENT_REF)
11762 && JDECL_P (TREE_OPERAND (cn, 1))
11763 && FIELD_FINAL (TREE_OPERAND (cn, 1))
11764 && DECL_INITIAL (TREE_OPERAND (cn, 1)))
11766 cn = fold_constant_for_init (DECL_INITIAL (TREE_OPERAND (cn, 1)),
11767 TREE_OPERAND (cn, 1));
11769 /* Accept final locals too. */
11770 else if (TREE_CODE (cn) == VAR_DECL && DECL_FINAL (cn)
11771 && DECL_INITIAL (cn))
11772 cn = fold_constant_for_init (DECL_INITIAL (cn), cn);
11774 if (!TREE_CONSTANT (cn) && !flag_emit_xref)
11776 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
11777 parse_error_context (node, "Constant expression required");
11778 return error_mark_node;
11781 nn = ctxp->current_loop;
11783 /* It must be assignable to the type of the switch expression. */
11784 if (!try_builtin_assignconv (NULL_TREE,
11785 TREE_TYPE (TREE_OPERAND (nn, 0)), cn))
11787 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
11788 parse_error_context
11790 "Incompatible type for case. Can't convert `%s' to `int'",
11791 lang_printable_name (TREE_TYPE (cn), 0));
11792 return error_mark_node;
11795 cn = fold (convert (int_type_node, cn));
11796 TREE_CONSTANT_OVERFLOW (cn) = 0;
11797 CAN_COMPLETE_NORMALLY (cn) = 1;
11799 /* Save the label on a list so that we can later check for
11801 case_label_list = tree_cons (node, cn, case_label_list);
11803 /* Multiple instance of a case label bearing the same value is
11804 checked later. The case expression is all right so far. */
11805 if (TREE_CODE (cn) == VAR_DECL)
11806 cn = DECL_INITIAL (cn);
11807 TREE_OPERAND (node, 0) = cn;
11808 TREE_TYPE (node) = void_type_node;
11809 CAN_COMPLETE_NORMALLY (node) = 1;
11810 TREE_SIDE_EFFECTS (node) = 1;
11814 nn = ctxp->current_loop;
11815 /* Only one default label is allowed per switch statement */
11816 if (SWITCH_HAS_DEFAULT (nn))
11818 #ifdef USE_MAPPED_LOCATION
11819 SET_EXPR_LOCATION (wfl_operator, EXPR_LOCATION (node));
11821 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
11823 parse_error_context (wfl_operator,
11824 "Duplicate case label: `default'");
11825 return error_mark_node;
11828 SWITCH_HAS_DEFAULT (nn) = 1;
11829 TREE_TYPE (node) = void_type_node;
11830 TREE_SIDE_EFFECTS (node) = 1;
11831 CAN_COMPLETE_NORMALLY (node) = 1;
11837 /* Check whether the loop was enclosed in a labeled
11838 statement. If not, create one, insert the loop in it and
11840 nn = patch_loop_statement (node);
11842 /* Anyways, walk the body of the loop */
11843 if (TREE_CODE (node) == LOOP_EXPR)
11844 TREE_OPERAND (node, 0) = java_complete_tree (TREE_OPERAND (node, 0));
11845 /* Switch statement: walk the switch expression and the cases */
11847 node = patch_switch_statement (node);
11849 if (node == error_mark_node || TREE_OPERAND (node, 0) == error_mark_node)
11850 nn = error_mark_node;
11853 TREE_TYPE (nn) = TREE_TYPE (node) = void_type_node;
11854 /* If we returned something different, that's because we
11855 inserted a label. Pop the label too. */
11858 if (CAN_COMPLETE_NORMALLY (node))
11859 CAN_COMPLETE_NORMALLY (nn) = 1;
11860 POP_LABELED_BLOCK ();
11867 TREE_OPERAND (node, 0) = java_complete_tree (TREE_OPERAND (node, 0));
11868 return patch_exit_expr (node);
11872 TREE_OPERAND (node, 0) = java_complete_tree (TREE_OPERAND (node, 0));
11873 if (TREE_OPERAND (node, 0) == error_mark_node)
11874 return error_mark_node;
11875 /* then-else branches */
11876 TREE_OPERAND (node, 1) = java_complete_tree (TREE_OPERAND (node, 1));
11877 if (TREE_OPERAND (node, 1) == error_mark_node)
11878 return error_mark_node;
11880 /* This is a special case due to build_assertion(). When
11881 assertions are disabled we build a COND_EXPR in which
11882 Operand 1 is the body of the assertion. If that happens to
11883 be a string concatenation we'll need to patch it here. */
11884 tree patched = patch_string (TREE_OPERAND (node, 1));
11886 TREE_OPERAND (node, 1) = patched;
11888 TREE_OPERAND (node, 2) = java_complete_tree (TREE_OPERAND (node, 2));
11889 if (TREE_OPERAND (node, 2) == error_mark_node)
11890 return error_mark_node;
11891 return patch_if_else_statement (node);
11894 case CONDITIONAL_EXPR:
11896 wfl_op1 = TREE_OPERAND (node, 0);
11897 COMPLETE_CHECK_OP_0 (node);
11898 wfl_op2 = TREE_OPERAND (node, 1);
11899 COMPLETE_CHECK_OP_1 (node);
11900 wfl_op3 = TREE_OPERAND (node, 2);
11901 COMPLETE_CHECK_OP_2 (node);
11902 return patch_conditional_expr (node, wfl_op1, wfl_op2);
11904 /* 3- Expression section */
11905 case COMPOUND_EXPR:
11906 wfl_op2 = TREE_OPERAND (node, 1);
11907 TREE_OPERAND (node, 0) = nn =
11908 java_complete_tree (TREE_OPERAND (node, 0));
11909 if (IS_EMPTY_STMT (wfl_op2))
11910 CAN_COMPLETE_NORMALLY (node) = CAN_COMPLETE_NORMALLY (nn);
11913 if (! CAN_COMPLETE_NORMALLY (nn) && TREE_CODE (nn) != ERROR_MARK)
11915 /* An unreachable condition in a do-while statement
11916 is *not* (technically) an unreachable statement. */
11918 if (TREE_CODE (nn) == EXPR_WITH_FILE_LOCATION)
11919 nn = EXPR_WFL_NODE (nn);
11920 /* NN can be NULL_TREE exactly when UPDATE is, in
11921 finish_for_loop. */
11922 if (nn != NULL_TREE && TREE_CODE (nn) != EXIT_EXPR)
11924 SET_WFL_OPERATOR (wfl_operator, node, wfl_op2);
11925 if (SUPPRESS_UNREACHABLE_ERROR (nn))
11927 /* Perhaps this warning should have an
11928 associated flag. The code being compiled is
11929 pedantically correct, but useless. */
11930 parse_warning_context (wfl_operator,
11931 "Unreachable statement");
11934 parse_error_context (wfl_operator,
11935 "Unreachable statement");
11938 TREE_OPERAND (node, 1) = java_complete_tree (TREE_OPERAND (node, 1));
11939 if (TREE_OPERAND (node, 1) == error_mark_node)
11940 return error_mark_node;
11941 /* Even though we might allow the case where the first
11942 operand doesn't return normally, we still should compute
11943 CAN_COMPLETE_NORMALLY correctly. */
11944 CAN_COMPLETE_NORMALLY (node)
11945 = (CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 0))
11946 && CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 1)));
11948 TREE_TYPE (node) = TREE_TYPE (TREE_OPERAND (node, 1));
11952 /* CAN_COMPLETE_NORMALLY (node) = 0; */
11953 return patch_return (node);
11955 case EXPR_WITH_FILE_LOCATION:
11956 if (!EXPR_WFL_NODE (node) /* Or a PRIMARY flag ? */
11957 || TREE_CODE (EXPR_WFL_NODE (node)) == IDENTIFIER_NODE)
11960 node = resolve_expression_name (node, NULL);
11961 if (node == error_mark_node)
11963 /* Keep line number information somewhere were it doesn't
11964 disrupt the completion process. */
11965 if (flag_emit_xref && TREE_CODE (node) != CALL_EXPR)
11967 EXPR_WFL_NODE (wfl) = TREE_OPERAND (node, 1);
11968 TREE_OPERAND (node, 1) = wfl;
11970 CAN_COMPLETE_NORMALLY (node) = 1;
11975 location_t save_location = input_location;
11976 #ifdef USE_MAPPED_LOCATION
11977 input_location = EXPR_LOCATION (node);
11978 if (input_location == UNKNOWN_LOCATION)
11979 input_location = save_location;
11981 input_line = EXPR_WFL_LINENO (node);
11983 body = java_complete_tree (EXPR_WFL_NODE (node));
11984 input_location = save_location;
11985 EXPR_WFL_NODE (node) = body;
11986 TREE_SIDE_EFFECTS (node) = TREE_SIDE_EFFECTS (body);
11987 CAN_COMPLETE_NORMALLY (node) = CAN_COMPLETE_NORMALLY (body);
11988 if (IS_EMPTY_STMT (body) || TREE_CONSTANT (body))
11990 /* Makes it easier to constant fold, detect empty bodies. */
11993 if (body == error_mark_node)
11995 /* Its important for the evaluation of assignment that
11996 this mark on the TREE_TYPE is propagated. */
11997 TREE_TYPE (node) = error_mark_node;
11998 return error_mark_node;
12001 TREE_TYPE (node) = TREE_TYPE (EXPR_WFL_NODE (node));
12006 case NEW_ARRAY_EXPR:
12007 /* Patch all the dimensions */
12009 for (cn = TREE_OPERAND (node, 1); cn; cn = TREE_CHAIN (cn))
12011 int location = EXPR_WFL_LINECOL (TREE_VALUE (cn));
12012 tree dim = convert (int_type_node,
12013 java_complete_tree (TREE_VALUE (cn)));
12014 if (dim == error_mark_node)
12021 TREE_VALUE (cn) = dim;
12022 /* Setup the location of the current dimension, for
12023 later error report. */
12024 #ifdef USE_MAPPED_LOCATION
12025 TREE_PURPOSE (cn) = expr_add_location (NULL_TREE, location, 0);
12027 TREE_PURPOSE (cn) =
12028 build_expr_wfl (NULL_TREE, input_filename, 0, 0);
12029 EXPR_WFL_LINECOL (TREE_PURPOSE (cn)) = location;
12033 /* They complete the array creation expression, if no errors
12035 CAN_COMPLETE_NORMALLY (node) = 1;
12036 return (flag ? error_mark_node
12037 : force_evaluation_order (patch_newarray (node)));
12039 case NEW_ANONYMOUS_ARRAY_EXPR:
12040 /* Create the array type if necessary. */
12041 if (ANONYMOUS_ARRAY_DIMS_SIG (node))
12043 tree type = ANONYMOUS_ARRAY_BASE_TYPE (node);
12044 if (!(type = resolve_type_during_patch (type)))
12045 return error_mark_node;
12046 type = build_array_from_name (type, NULL_TREE,
12047 ANONYMOUS_ARRAY_DIMS_SIG (node), NULL);
12048 ANONYMOUS_ARRAY_BASE_TYPE (node) = build_pointer_type (type);
12050 node = patch_new_array_init (ANONYMOUS_ARRAY_BASE_TYPE (node),
12051 ANONYMOUS_ARRAY_INITIALIZER (node));
12052 if (node == error_mark_node)
12053 return error_mark_node;
12054 CAN_COMPLETE_NORMALLY (node) = 1;
12057 case NEW_CLASS_EXPR:
12059 /* Complete function's argument(s) first */
12060 if (complete_function_arguments (node))
12061 return error_mark_node;
12064 tree decl, wfl = TREE_OPERAND (node, 0);
12065 int in_this = CALL_THIS_CONSTRUCTOR_P (node);
12066 int from_super = (EXPR_WFL_NODE (TREE_OPERAND (node, 0)) ==
12067 super_identifier_node);
12069 #ifdef USE_MAPPED_LOCATION
12070 source_location location = EXPR_LOCATION (node);
12072 int location = EXPR_WFL_LINECOL (node);
12075 node = patch_method_invocation (node, NULL_TREE, NULL_TREE,
12076 from_super, 0, &decl);
12077 if (node == error_mark_node)
12078 return error_mark_node;
12080 if (TREE_CODE (node) == CALL_EXPR
12081 && TREE_OPERAND (node, 1) != NULL_TREE)
12082 arguments = TREE_VALUE (TREE_OPERAND (node, 1));
12084 arguments = NULL_TREE;
12085 check_thrown_exceptions (location, decl, arguments);
12086 /* If we call this(...), register signature and positions */
12088 DECL_CONSTRUCTOR_CALLS (current_function_decl) =
12089 tree_cons (wfl, decl,
12090 DECL_CONSTRUCTOR_CALLS (current_function_decl));
12091 CAN_COMPLETE_NORMALLY (node) = 1;
12092 return force_evaluation_order (node);
12096 /* Save potential wfls */
12097 wfl_op1 = TREE_OPERAND (node, 0);
12098 TREE_OPERAND (node, 0) = nn = java_complete_lhs (wfl_op1);
12100 if (MODIFY_EXPR_FROM_INITIALIZATION_P (node)
12101 && TREE_CODE (nn) == VAR_DECL && TREE_STATIC (nn)
12102 && DECL_INITIAL (nn) != NULL_TREE)
12106 value = fold_constant_for_init (nn, nn);
12108 /* When we have a primitype type, or a string and we're not
12109 emitting a class file, we actually don't want to generate
12110 anything for the assignment. */
12111 if (value != NULL_TREE &&
12112 (JPRIMITIVE_TYPE_P (TREE_TYPE (value)) ||
12113 (TREE_TYPE (value) == string_ptr_type_node &&
12114 ! flag_emit_class_files)))
12116 /* Prepare node for patch_assignment */
12117 TREE_OPERAND (node, 1) = value;
12118 /* Call patch assignment to verify the assignment */
12119 if (patch_assignment (node, wfl_op1) == error_mark_node)
12120 return error_mark_node;
12121 /* Set DECL_INITIAL properly (a conversion might have
12122 been decided by patch_assignment) and return the
12123 empty statement. */
12126 tree patched = patch_string (TREE_OPERAND (node, 1));
12128 DECL_INITIAL (nn) = patched;
12130 DECL_INITIAL (nn) = TREE_OPERAND (node, 1);
12131 DECL_FIELD_FINAL_IUD (nn) = 1;
12132 return build_java_empty_stmt ();
12135 if (! flag_emit_class_files)
12136 DECL_INITIAL (nn) = NULL_TREE;
12138 wfl_op2 = TREE_OPERAND (node, 1);
12140 if (TREE_OPERAND (node, 0) == error_mark_node)
12141 return error_mark_node;
12143 flag = COMPOUND_ASSIGN_P (wfl_op2);
12146 /* This might break when accessing outer field from inner
12147 class. TESTME, FIXME */
12148 tree lvalue = java_stabilize_reference (TREE_OPERAND (node, 0));
12150 /* Hand stabilize the lhs on both places */
12151 TREE_OPERAND (node, 0) = lvalue;
12152 TREE_OPERAND (TREE_OPERAND (node, 1), 0) =
12153 (flag_emit_class_files ? lvalue : save_expr (lvalue));
12155 /* 15.25.2.a: Left hand is not an array access. FIXME */
12156 /* Now complete the RHS. We write it back later on. */
12157 nn = java_complete_tree (TREE_OPERAND (node, 1));
12159 if ((cn = patch_string (nn)))
12162 /* The last part of the rewrite for E1 op= E2 is to have
12163 E1 = (T)(E1 op E2), with T being the type of E1. */
12164 nn = java_complete_tree (build_cast (EXPR_WFL_LINECOL (wfl_op2),
12165 TREE_TYPE (lvalue), nn));
12167 /* If the assignment is compound and has reference type,
12168 then ensure the LHS has type String and nothing else. */
12169 if (JREFERENCE_TYPE_P (TREE_TYPE (lvalue))
12170 && ! JSTRING_TYPE_P (TREE_TYPE (lvalue)))
12171 parse_error_context (wfl_op2,
12172 "Incompatible type for `+='. Can't convert `%s' to `java.lang.String'",
12173 lang_printable_name (TREE_TYPE (lvalue), 0));
12175 /* 15.25.2.b: Left hand is an array access. FIXME */
12178 /* If we're about to patch a NEW_ARRAY_INIT, we call a special
12179 function to complete this RHS. Note that a NEW_ARRAY_INIT
12180 might have been already fully expanded if created as a result
12181 of processing an anonymous array initializer. We avoid doing
12182 the operation twice by testing whether the node already bears
12184 else if (TREE_CODE (wfl_op2) == NEW_ARRAY_INIT && !TREE_TYPE (wfl_op2))
12185 nn = patch_new_array_init (TREE_TYPE (TREE_OPERAND (node, 0)),
12186 TREE_OPERAND (node, 1));
12187 /* Otherwise we simply complete the RHS */
12189 nn = java_complete_tree (TREE_OPERAND (node, 1));
12191 if (nn == error_mark_node)
12192 return error_mark_node;
12194 /* Write back the RHS as we evaluated it. */
12195 TREE_OPERAND (node, 1) = nn;
12197 /* In case we're handling = with a String as a RHS, we need to
12198 produce a String out of the RHS (it might still be a
12199 STRING_CST or a StringBuffer at this stage */
12200 if ((nn = patch_string (TREE_OPERAND (node, 1))))
12201 TREE_OPERAND (node, 1) = nn;
12203 if ((nn = outer_field_access_fix (wfl_op1, TREE_OPERAND (node, 0),
12204 TREE_OPERAND (node, 1))))
12206 /* We return error_mark_node if outer_field_access_fix
12207 detects we write into a final. */
12208 if (nn == error_mark_node)
12209 return error_mark_node;
12214 node = patch_assignment (node, wfl_op1);
12215 if (node == error_mark_node)
12216 return error_mark_node;
12217 /* Reorganize the tree if necessary. */
12218 if (flag && (!JREFERENCE_TYPE_P (TREE_TYPE (node))
12219 || JSTRING_P (TREE_TYPE (node))))
12220 node = java_refold (node);
12223 /* Seek to set DECL_INITIAL to a proper value, since it might have
12224 undergone a conversion in patch_assignment. We do that only when
12225 it's necessary to have DECL_INITIAL properly set. */
12226 nn = TREE_OPERAND (node, 0);
12227 if (TREE_CODE (nn) == VAR_DECL
12228 && DECL_INITIAL (nn) && CONSTANT_VALUE_P (DECL_INITIAL (nn))
12229 && FIELD_STATIC (nn) && FIELD_FINAL (nn)
12230 && (JPRIMITIVE_TYPE_P (TREE_TYPE (nn))
12231 || TREE_TYPE (nn) == string_ptr_type_node))
12232 DECL_INITIAL (nn) = TREE_OPERAND (node, 1);
12234 CAN_COMPLETE_NORMALLY (node) = 1;
12246 case TRUNC_MOD_EXPR:
12247 case TRUNC_DIV_EXPR:
12249 case TRUTH_ANDIF_EXPR:
12250 case TRUTH_ORIF_EXPR:
12257 /* Operands 0 and 1 are WFL in certain cases only. patch_binop
12258 knows how to handle those cases. */
12259 wfl_op1 = TREE_OPERAND (node, 0);
12260 wfl_op2 = TREE_OPERAND (node, 1);
12262 CAN_COMPLETE_NORMALLY (node) = 1;
12263 /* Don't complete string nodes if dealing with the PLUS operand. */
12264 if (TREE_CODE (node) != PLUS_EXPR || !JSTRING_P (wfl_op1))
12266 nn = java_complete_tree (wfl_op1);
12267 if (nn == error_mark_node)
12268 return error_mark_node;
12270 TREE_OPERAND (node, 0) = nn;
12272 if (TREE_CODE (node) != PLUS_EXPR || !JSTRING_P (wfl_op2))
12274 nn = java_complete_tree (wfl_op2);
12275 if (nn == error_mark_node)
12276 return error_mark_node;
12278 TREE_OPERAND (node, 1) = nn;
12280 return patch_binop (node, wfl_op1, wfl_op2);
12282 case INSTANCEOF_EXPR:
12283 wfl_op1 = TREE_OPERAND (node, 0);
12284 COMPLETE_CHECK_OP_0 (node);
12285 if (flag_emit_xref)
12287 TREE_TYPE (node) = boolean_type_node;
12290 return patch_binop (node, wfl_op1, TREE_OPERAND (node, 1));
12292 case UNARY_PLUS_EXPR:
12294 case TRUTH_NOT_EXPR:
12296 case PREDECREMENT_EXPR:
12297 case PREINCREMENT_EXPR:
12298 case POSTDECREMENT_EXPR:
12299 case POSTINCREMENT_EXPR:
12301 /* There are cases were wfl_op1 is a WFL. patch_unaryop knows
12302 how to handle those cases. */
12303 wfl_op1 = TREE_OPERAND (node, 0);
12304 CAN_COMPLETE_NORMALLY (node) = 1;
12305 TREE_OPERAND (node, 0) = java_complete_tree (wfl_op1);
12306 if (TREE_OPERAND (node, 0) == error_mark_node)
12307 return error_mark_node;
12308 node = patch_unaryop (node, wfl_op1);
12309 CAN_COMPLETE_NORMALLY (node) = 1;
12313 /* There are cases were wfl_op1 is a WFL. patch_array_ref knows
12314 how to handle those cases. */
12315 wfl_op1 = TREE_OPERAND (node, 0);
12316 TREE_OPERAND (node, 0) = java_complete_tree (wfl_op1);
12317 if (TREE_OPERAND (node, 0) == error_mark_node)
12318 return error_mark_node;
12319 if (!flag_emit_class_files && !flag_emit_xref)
12320 TREE_OPERAND (node, 0) = save_expr (TREE_OPERAND (node, 0));
12321 /* The same applies to wfl_op2 */
12322 wfl_op2 = TREE_OPERAND (node, 1);
12323 TREE_OPERAND (node, 1) = java_complete_tree (wfl_op2);
12324 if (TREE_OPERAND (node, 1) == error_mark_node)
12325 return error_mark_node;
12326 if (!flag_emit_class_files && !flag_emit_xref)
12327 TREE_OPERAND (node, 1) = save_expr (TREE_OPERAND (node, 1));
12328 return patch_array_ref (node);
12333 case COMPONENT_REF:
12334 /* The first step in the re-write of qualified name handling. FIXME.
12335 So far, this is only to support PRIMTYPE.class -> PRIMCLASS.TYPE. */
12336 TREE_OPERAND (node, 0) = java_complete_tree (TREE_OPERAND (node, 0));
12337 if (TREE_CODE (TREE_OPERAND (node, 0)) == RECORD_TYPE)
12339 tree name = TREE_OPERAND (node, 1);
12340 tree field = lookup_field_wrapper (TREE_OPERAND (node, 0), name);
12341 if (field == NULL_TREE)
12343 error ("missing static field `%s'", IDENTIFIER_POINTER (name));
12344 return error_mark_node;
12346 if (! FIELD_STATIC (field))
12348 error ("not a static field `%s'", IDENTIFIER_POINTER (name));
12349 return error_mark_node;
12358 /* Can't use THIS in a static environment */
12361 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
12362 parse_error_context (wfl_operator,
12363 "Keyword `this' used outside allowed context");
12364 TREE_TYPE (node) = error_mark_node;
12365 return error_mark_node;
12367 if (ctxp->explicit_constructor_p)
12369 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
12370 parse_error_context
12371 (wfl_operator, "Can't reference `this' or `super' before the superclass constructor has been called");
12372 TREE_TYPE (node) = error_mark_node;
12373 return error_mark_node;
12375 return current_this;
12377 case CLASS_LITERAL:
12378 CAN_COMPLETE_NORMALLY (node) = 1;
12379 node = patch_incomplete_class_ref (node);
12380 if (node == error_mark_node)
12381 return error_mark_node;
12385 CAN_COMPLETE_NORMALLY (node) = 1;
12386 /* Ok: may be we have a STRING_CST or a crafted `StringBuffer'
12387 and it's time to turn it into the appropriate String object */
12388 if ((nn = patch_string (node)))
12391 internal_error ("No case for %s", tree_code_name [TREE_CODE (node)]);
12396 /* Complete function call's argument. Return a nonzero value is an
12397 error was found. */
12400 complete_function_arguments (tree node)
12405 ctxp->explicit_constructor_p += (CALL_EXPLICIT_CONSTRUCTOR_P (node) ? 1 : 0);
12406 for (cn = TREE_OPERAND (node, 1); cn; cn = TREE_CHAIN (cn))
12408 tree wfl = TREE_VALUE (cn), parm, temp;
12409 parm = java_complete_tree (wfl);
12411 if (parm == error_mark_node)
12416 /* If we have a string literal that we haven't transformed yet or a
12417 crafted string buffer, as a result of the use of the String
12418 `+' operator. Build `parm.toString()' and expand it. */
12419 if ((temp = patch_string (parm)))
12422 TREE_VALUE (cn) = parm;
12424 ctxp->explicit_constructor_p -= (CALL_EXPLICIT_CONSTRUCTOR_P (node) ? 1 : 0);
12428 /* Sometimes (for loops and variable initialized during their
12429 declaration), we want to wrap a statement around a WFL and turn it
12433 build_debugable_stmt (int location, tree stmt)
12435 if (TREE_CODE (stmt) != EXPR_WITH_FILE_LOCATION)
12437 #ifdef USE_MAPPED_LOCATION
12438 stmt = expr_add_location (stmt, location, 1);
12440 stmt = build_expr_wfl (stmt, input_filename, 0, 0);
12441 EXPR_WFL_LINECOL (stmt) = location;
12442 JAVA_MAYBE_GENERATE_DEBUG_INFO (stmt);
12449 build_expr_block (tree body, tree decls)
12451 tree node = make_node (BLOCK);
12452 BLOCK_EXPR_DECLS (node) = decls;
12453 BLOCK_EXPR_BODY (node) = body;
12455 TREE_TYPE (node) = TREE_TYPE (body);
12456 TREE_SIDE_EFFECTS (node) = 1;
12460 /* Create a new function block and link it appropriately to current
12461 function block chain */
12466 tree b = build_expr_block (NULL_TREE, NULL_TREE);
12468 /* Link block B supercontext to the previous block. The current
12469 function DECL is used as supercontext when enter_a_block is called
12470 for the first time for a given function. The current function body
12471 (DECL_FUNCTION_BODY) is set to be block B. */
12473 tree fndecl = current_function_decl;
12476 BLOCK_SUPERCONTEXT (b) = current_static_block;
12477 current_static_block = b;
12480 else if (!DECL_FUNCTION_BODY (fndecl))
12482 BLOCK_SUPERCONTEXT (b) = fndecl;
12483 DECL_FUNCTION_BODY (fndecl) = b;
12487 BLOCK_SUPERCONTEXT (b) = DECL_FUNCTION_BODY (fndecl);
12488 DECL_FUNCTION_BODY (fndecl) = b;
12493 /* Exit a block by changing the current function body
12494 (DECL_FUNCTION_BODY) to the current block super context, only if
12495 the block being exited isn't the method's top level one. */
12501 if (current_function_decl)
12503 b = DECL_FUNCTION_BODY (current_function_decl);
12504 if (BLOCK_SUPERCONTEXT (b) != current_function_decl)
12505 DECL_FUNCTION_BODY (current_function_decl) = BLOCK_SUPERCONTEXT (b);
12509 b = current_static_block;
12511 if (BLOCK_SUPERCONTEXT (b))
12512 current_static_block = BLOCK_SUPERCONTEXT (b);
12517 /* Lookup for NAME in the nested function's blocks, all the way up to
12518 the current toplevel one. It complies with Java's local variable
12522 lookup_name_in_blocks (tree name)
12524 tree b = GET_CURRENT_BLOCK (current_function_decl);
12526 while (b != current_function_decl)
12530 /* Paranoid sanity check. To be removed */
12531 if (TREE_CODE (b) != BLOCK)
12534 for (current = BLOCK_EXPR_DECLS (b); current;
12535 current = TREE_CHAIN (current))
12536 if (DECL_NAME (current) == name)
12538 b = BLOCK_SUPERCONTEXT (b);
12544 maybe_absorb_scoping_blocks (void)
12546 while (BLOCK_IS_IMPLICIT (GET_CURRENT_BLOCK (current_function_decl)))
12548 tree b = exit_block ();
12549 java_method_add_stmt (current_function_decl, b);
12550 SOURCE_FRONTEND_DEBUG (("Absorbing scoping block at line %d", input_line));
12555 /* This section of the source is reserved to build_* functions that
12556 are building incomplete tree nodes and the patch_* functions that
12557 are completing them. */
12559 /* Wrap a non WFL node around a WFL. */
12562 build_wfl_wrap (tree node, int location)
12564 tree wfl, node_to_insert = node;
12566 /* We want to process THIS . xxx symbolically, to keep it consistent
12567 with the way we're processing SUPER. A THIS from a primary as a
12568 different form than a SUPER. Turn THIS into something symbolic */
12569 if (TREE_CODE (node) == THIS_EXPR)
12570 node_to_insert = wfl = build_wfl_node (this_identifier_node);
12572 #ifdef USE_MAPPED_LOCATION
12573 wfl = build_unknown_wfl (NULL_TREE);
12575 SET_EXPR_LOCATION (wfl, location);
12577 wfl = build_expr_wfl (NULL_TREE, ctxp->filename, 0, 0);
12579 EXPR_WFL_LINECOL (wfl) = location;
12581 EXPR_WFL_QUALIFICATION (wfl) = build_tree_list (node_to_insert, NULL_TREE);
12585 /* Build a super() constructor invocation. Returns an empty statement if
12586 we're currently dealing with the class java.lang.Object. */
12589 build_super_invocation (tree mdecl)
12591 if (DECL_CONTEXT (mdecl) == object_type_node)
12592 return build_java_empty_stmt ();
12595 tree super_wfl = build_wfl_node (super_identifier_node);
12596 tree a = NULL_TREE, t;
12598 /* This is called after parsing is done, so the parser context
12599 won't be accurate. Set location info from current_class decl. */
12600 tree class_wfl = lookup_cl (TYPE_NAME (current_class));
12601 EXPR_WFL_LINECOL (super_wfl) = EXPR_WFL_LINECOL (class_wfl);
12603 /* If we're dealing with an anonymous class, pass the arguments
12604 of the crafted constructor along. */
12605 if (ANONYMOUS_CLASS_P (DECL_CONTEXT (mdecl)))
12607 SKIP_THIS_AND_ARTIFICIAL_PARMS (t, mdecl);
12608 for (; t != end_params_node; t = TREE_CHAIN (t))
12609 a = tree_cons (NULL_TREE, build_wfl_node (TREE_PURPOSE (t)), a);
12611 return build_method_invocation (super_wfl, a);
12615 /* Build a SUPER/THIS qualified method invocation. */
12618 build_this_super_qualified_invocation (int use_this, tree name, tree args,
12619 int lloc, int rloc)
12623 build_wfl_node (use_this ? this_identifier_node : super_identifier_node);
12624 EXPR_WFL_LINECOL (wfl) = lloc;
12625 invok = build_method_invocation (name, args);
12626 return make_qualified_primary (wfl, invok, rloc);
12629 /* Build an incomplete CALL_EXPR node. */
12632 build_method_invocation (tree name, tree args)
12634 tree call = build3 (CALL_EXPR, NULL_TREE, name, args, NULL_TREE);
12635 TREE_SIDE_EFFECTS (call) = 1;
12636 EXPR_WFL_LINECOL (call) = EXPR_WFL_LINECOL (name);
12640 /* Build an incomplete new xxx(...) node. */
12643 build_new_invocation (tree name, tree args)
12645 tree call = build3 (NEW_CLASS_EXPR, NULL_TREE, name, args, NULL_TREE);
12646 TREE_SIDE_EFFECTS (call) = 1;
12647 EXPR_WFL_LINECOL (call) = EXPR_WFL_LINECOL (name);
12651 /* Build an incomplete assignment expression. */
12654 build_assignment (int op, int op_location, tree lhs, tree rhs)
12657 /* Build the corresponding binop if we deal with a Compound
12658 Assignment operator. Mark the binop sub-tree as part of a
12659 Compound Assignment expression */
12660 if (op != ASSIGN_TK)
12662 rhs = build_binop (BINOP_LOOKUP (op), op_location, lhs, rhs);
12663 COMPOUND_ASSIGN_P (rhs) = 1;
12665 assignment = build2 (MODIFY_EXPR, NULL_TREE, lhs, rhs);
12666 TREE_SIDE_EFFECTS (assignment) = 1;
12667 EXPR_WFL_LINECOL (assignment) = op_location;
12671 /* Print an INTEGER_CST node as decimal in a static buffer, and return
12672 the buffer. This is used only for string conversion. */
12674 string_convert_int_cst (tree node)
12676 /* Long.MIN_VALUE is -9223372036854775808, 20 characters. */
12677 static char buffer[21];
12679 unsigned HOST_WIDE_INT lo = TREE_INT_CST_LOW (node);
12680 unsigned HOST_WIDE_INT hi = TREE_INT_CST_HIGH (node);
12681 char *p = buffer + sizeof (buffer);
12684 unsigned HOST_WIDE_INT hibit = (((unsigned HOST_WIDE_INT) 1)
12685 << (HOST_BITS_PER_WIDE_INT - 1));
12689 /* If negative, note the fact and negate the value. */
12699 /* Divide by 10 until there are no bits left. */
12702 unsigned HOST_WIDE_INT acc = 0;
12703 unsigned HOST_WIDE_INT outhi = 0, outlo = 0;
12706 /* Use long division to compute the result and the remainder. */
12707 for (i = 0; i < 2 * HOST_BITS_PER_WIDE_INT; ++i)
12709 /* Shift a bit into accumulator. */
12714 /* Shift the value. */
12720 /* Shift the correct bit into the result. */
12722 if ((outlo & hibit))
12732 /* '0' == 060 in Java, but might not be here (think EBCDIC). */
12733 *--p = '\060' + acc;
12741 *--p = '\055'; /* '-' == 055 in Java, but might not be here. */
12746 /* Print an INTEGER_CST node in a static buffer, and return the
12747 buffer. This is used only for error handling. */
12749 print_int_node (tree node)
12751 static char buffer [80];
12752 if (TREE_CONSTANT_OVERFLOW (node))
12753 sprintf (buffer, "<overflow>");
12755 if (TREE_INT_CST_HIGH (node) == 0)
12756 sprintf (buffer, HOST_WIDE_INT_PRINT_UNSIGNED,
12757 TREE_INT_CST_LOW (node));
12758 else if (TREE_INT_CST_HIGH (node) == -1
12759 && TREE_INT_CST_LOW (node) != 0)
12760 sprintf (buffer, "-" HOST_WIDE_INT_PRINT_UNSIGNED,
12761 -TREE_INT_CST_LOW (node));
12763 sprintf (buffer, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
12764 TREE_INT_CST_HIGH (node), TREE_INT_CST_LOW (node));
12770 /* Return 1 if an assignment to a FINAL is attempted in a non suitable
12773 /* 15.25 Assignment operators. */
12776 patch_assignment (tree node, tree wfl_op1)
12778 tree rhs = TREE_OPERAND (node, 1);
12779 tree lvalue = TREE_OPERAND (node, 0), llvalue;
12780 tree lhs_type = NULL_TREE, rhs_type, new_rhs = NULL_TREE;
12781 int error_found = 0;
12782 int lvalue_from_array = 0;
12785 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
12787 /* Lhs can be a named variable */
12788 if (JDECL_P (lvalue))
12790 lhs_type = TREE_TYPE (lvalue);
12792 /* Or Lhs can be an array access. */
12793 else if (TREE_CODE (lvalue) == ARRAY_REF)
12795 lhs_type = TREE_TYPE (lvalue);
12796 lvalue_from_array = 1;
12798 /* Or a field access */
12799 else if (TREE_CODE (lvalue) == COMPONENT_REF)
12800 lhs_type = TREE_TYPE (lvalue);
12801 /* Or a function return slot */
12802 else if (TREE_CODE (lvalue) == RESULT_DECL)
12804 /* If the return type is an integral type, then we create the
12805 RESULT_DECL with a promoted type, but we need to do these
12806 checks against the unpromoted type to ensure type safety. So
12807 here we look at the real type, not the type of the decl we
12809 lhs_type = TREE_TYPE (TREE_TYPE (current_function_decl));
12812 /* Otherwise, we might want to try to write into an optimized static
12813 final, this is an of a different nature, reported further on. */
12814 else if (TREE_CODE (wfl_op1) == EXPR_WITH_FILE_LOCATION
12815 && resolve_expression_name (wfl_op1, &llvalue))
12817 lhs_type = TREE_TYPE (lvalue);
12821 parse_error_context (wfl_op1, "Invalid left hand side of assignment");
12825 rhs_type = TREE_TYPE (rhs);
12827 /* 5.1 Try the assignment conversion for builtin type. */
12828 new_rhs = try_builtin_assignconv (wfl_op1, lhs_type, rhs);
12830 /* 5.2 If it failed, try a reference conversion */
12832 new_rhs = try_reference_assignconv (lhs_type, rhs);
12834 /* 15.25.2 If we have a compound assignment, convert RHS into the
12836 else if (COMPOUND_ASSIGN_P (TREE_OPERAND (node, 1)))
12837 new_rhs = convert (lhs_type, rhs);
12839 /* Explicit cast required. This is an error */
12842 char *t1 = xstrdup (lang_printable_name (TREE_TYPE (rhs), 0));
12843 char *t2 = xstrdup (lang_printable_name (lhs_type, 0));
12845 char operation [32]; /* Max size known */
12847 /* If the assignment is part of a declaration, we use the WFL of
12848 the declared variable to point out the error and call it a
12849 declaration problem. If the assignment is a genuine =
12850 operator, we call is a operator `=' problem, otherwise we
12851 call it an assignment problem. In both of these last cases,
12852 we use the WFL of the operator to indicate the error. */
12854 if (MODIFY_EXPR_FROM_INITIALIZATION_P (node))
12857 strcpy (operation, "declaration");
12861 wfl = wfl_operator;
12862 if (COMPOUND_ASSIGN_P (TREE_OPERAND (node, 1)))
12863 strcpy (operation, "assignment");
12864 else if (is_return)
12865 strcpy (operation, "`return'");
12867 strcpy (operation, "`='");
12870 if (!valid_cast_to_p (rhs_type, lhs_type))
12871 parse_error_context
12872 (wfl, "Incompatible type for %s. Can't convert `%s' to `%s'",
12873 operation, t1, t2);
12875 parse_error_context (wfl, "Incompatible type for %s. Explicit cast needed to convert `%s' to `%s'",
12876 operation, t1, t2);
12877 free (t1); free (t2);
12882 return error_mark_node;
12884 /* If we're processing a `return' statement, promote the actual type
12885 to the promoted type. */
12887 new_rhs = convert (TREE_TYPE (lvalue), new_rhs);
12889 /* 10.10: Array Store Exception runtime check */
12890 if (!flag_emit_class_files
12892 && lvalue_from_array
12893 && JREFERENCE_TYPE_P (TYPE_ARRAY_ELEMENT (lhs_type)))
12895 tree array, store_check, base, index_expr;
12897 /* Save RHS so that it doesn't get re-evaluated by the store check. */
12898 new_rhs = save_expr (new_rhs);
12900 /* Get the INDIRECT_REF. */
12901 array = TREE_OPERAND (TREE_OPERAND (lvalue, 0), 0);
12902 /* Get the array pointer expr. */
12903 array = TREE_OPERAND (array, 0);
12904 store_check = build_java_arraystore_check (array, new_rhs);
12906 index_expr = TREE_OPERAND (lvalue, 1);
12908 if (TREE_CODE (index_expr) == COMPOUND_EXPR)
12910 /* A COMPOUND_EXPR here is a bounds check. The bounds check must
12911 happen before the store check, so prepare to insert the store
12912 check within the second operand of the existing COMPOUND_EXPR. */
12918 index_expr = TREE_OPERAND (base, 1);
12919 TREE_OPERAND (base, 1) = build2 (COMPOUND_EXPR, TREE_TYPE (index_expr),
12920 store_check, index_expr);
12923 /* Final locals can be used as case values in switch
12924 statement. Prepare them for this eventuality. */
12925 if (TREE_CODE (lvalue) == VAR_DECL
12926 && DECL_FINAL (lvalue)
12927 && TREE_CONSTANT (new_rhs)
12928 && IDENTIFIER_LOCAL_VALUE (DECL_NAME (lvalue))
12929 && JINTEGRAL_TYPE_P (TREE_TYPE (lvalue))
12932 TREE_CONSTANT (lvalue) = 1;
12933 TREE_INVARIANT (lvalue) = 1;
12934 DECL_INITIAL (lvalue) = new_rhs;
12937 /* Copy the rhs if it's a reference. */
12938 if (! flag_check_references && ! flag_emit_class_files && optimize > 0)
12940 switch (TREE_CODE (new_rhs))
12944 case COMPONENT_REF:
12945 /* Transform a = foo.bar
12946 into a = ({int tmp; tmp = foo.bar;}).
12947 We need to ensure that if a read from memory fails
12948 because of a NullPointerException, a destination variable
12949 will remain unchanged. An explicit temporary does what
12952 If flag_check_references is set, this is unnecessary
12953 because we'll check each reference before doing any
12954 reads. If optimize is not set the result will never be
12955 written to a stack slot that contains the LHS. */
12957 tree tmp = build_decl (VAR_DECL, get_identifier ("<tmp>"),
12958 TREE_TYPE (new_rhs));
12959 tree block = make_node (BLOCK);
12961 = build2 (MODIFY_EXPR, TREE_TYPE (new_rhs), tmp, fold (new_rhs));
12962 DECL_CONTEXT (tmp) = current_function_decl;
12963 TREE_TYPE (block) = TREE_TYPE (new_rhs);
12964 BLOCK_VARS (block) = tmp;
12965 BLOCK_EXPR_BODY (block) = assignment;
12966 TREE_SIDE_EFFECTS (block) = 1;
12975 TREE_OPERAND (node, 0) = lvalue;
12976 TREE_OPERAND (node, 1) = new_rhs;
12977 TREE_TYPE (node) = lhs_type;
12981 /* Check that type SOURCE can be cast into type DEST. If the cast
12982 can't occur at all, return NULL; otherwise, return a possibly
12986 try_reference_assignconv (tree lhs_type, tree rhs)
12988 tree new_rhs = NULL_TREE;
12989 tree rhs_type = TREE_TYPE (rhs);
12991 if (!JPRIMITIVE_TYPE_P (rhs_type) && JREFERENCE_TYPE_P (lhs_type))
12993 /* `null' may be assigned to any reference type */
12994 if (rhs == null_pointer_node)
12995 new_rhs = null_pointer_node;
12996 /* Try the reference assignment conversion */
12997 else if (valid_ref_assignconv_cast_p (rhs_type, lhs_type, 0))
12999 /* This is a magic assignment that we process differently */
13000 else if (TREE_CODE (rhs) == JAVA_EXC_OBJ_EXPR)
13006 /* Check that RHS can be converted into LHS_TYPE by the assignment
13007 conversion (5.2), for the cases of RHS being a builtin type. Return
13008 NULL_TREE if the conversion fails or if because RHS isn't of a
13009 builtin type. Return a converted RHS if the conversion is possible. */
13012 try_builtin_assignconv (tree wfl_op1, tree lhs_type, tree rhs)
13014 tree new_rhs = NULL_TREE;
13015 tree rhs_type = TREE_TYPE (rhs);
13017 /* Handle boolean specially. */
13018 if (TREE_CODE (rhs_type) == BOOLEAN_TYPE
13019 || TREE_CODE (lhs_type) == BOOLEAN_TYPE)
13021 if (TREE_CODE (rhs_type) == BOOLEAN_TYPE
13022 && TREE_CODE (lhs_type) == BOOLEAN_TYPE)
13026 /* 5.1.1 Try Identity Conversion,
13027 5.1.2 Try Widening Primitive Conversion */
13028 else if (valid_builtin_assignconv_identity_widening_p (lhs_type, rhs_type))
13029 new_rhs = convert (lhs_type, rhs);
13031 /* Try a narrowing primitive conversion (5.1.3):
13032 - expression is a constant expression of type byte, short, char,
13034 - variable is byte, short or char AND
13035 - The value of the expression is representable in the type of the
13037 else if ((rhs_type == byte_type_node || rhs_type == short_type_node
13038 || rhs_type == char_type_node || rhs_type == int_type_node)
13039 && TREE_CONSTANT (rhs)
13040 && (lhs_type == byte_type_node || lhs_type == char_type_node
13041 || lhs_type == short_type_node))
13043 if (int_fits_type_p (rhs, lhs_type))
13044 new_rhs = convert (lhs_type, rhs);
13045 else if (wfl_op1) /* Might be called with a NULL */
13046 parse_warning_context
13047 (wfl_op1, "Constant expression `%s' too wide for narrowing primitive conversion to `%s'",
13048 print_int_node (rhs), lang_printable_name (lhs_type, 0));
13049 /* Reported a warning that will turn into an error further
13050 down, so we don't return */
13056 /* Return 1 if RHS_TYPE can be converted to LHS_TYPE by identity
13057 conversion (5.1.1) or widening primitive conversion (5.1.2). Return
13058 0 is the conversion test fails. This implements parts the method
13059 invocation conversion (5.3). */
13062 valid_builtin_assignconv_identity_widening_p (tree lhs_type, tree rhs_type)
13064 /* 5.1.1: This is the identity conversion part. */
13065 if (lhs_type == rhs_type)
13068 /* Reject non primitive types and boolean conversions. */
13069 if (!JNUMERIC_TYPE_P (lhs_type) || !JNUMERIC_TYPE_P (rhs_type))
13072 /* 5.1.2: widening primitive conversion. byte, even if it's smaller
13073 than a char can't be converted into a char. Short can't too, but
13074 the < test below takes care of that */
13075 if (lhs_type == char_type_node && rhs_type == byte_type_node)
13078 /* Accept all promoted type here. Note, we can't use <= in the test
13079 below, because we still need to bounce out assignments of short
13080 to char and the likes */
13081 if (lhs_type == int_type_node
13082 && (rhs_type == promoted_byte_type_node
13083 || rhs_type == promoted_short_type_node
13084 || rhs_type == promoted_char_type_node
13085 || rhs_type == promoted_boolean_type_node))
13088 /* From here, an integral is widened if its precision is smaller
13089 than the precision of the LHS or if the LHS is a floating point
13090 type, or the RHS is a float and the RHS a double. */
13091 if ((JINTEGRAL_TYPE_P (rhs_type) && JINTEGRAL_TYPE_P (lhs_type)
13092 && (TYPE_PRECISION (rhs_type) < TYPE_PRECISION (lhs_type)))
13093 || (JINTEGRAL_TYPE_P (rhs_type) && JFLOAT_TYPE_P (lhs_type))
13094 || (rhs_type == float_type_node && lhs_type == double_type_node))
13100 /* Check that something of SOURCE type can be assigned or cast to
13101 something of DEST type at runtime. Return 1 if the operation is
13102 valid, 0 otherwise. If CAST is set to 1, we're treating the case
13103 were SOURCE is cast into DEST, which borrows a lot of the
13104 assignment check. */
13107 valid_ref_assignconv_cast_p (tree source, tree dest, int cast)
13109 /* SOURCE or DEST might be null if not from a declared entity. */
13110 if (!source || !dest)
13112 if (JNULLP_TYPE_P (source))
13114 if (TREE_CODE (source) == POINTER_TYPE)
13115 source = TREE_TYPE (source);
13116 if (TREE_CODE (dest) == POINTER_TYPE)
13117 dest = TREE_TYPE (dest);
13119 /* If source and dest are being compiled from bytecode, they may need to
13121 if (CLASS_P (source) && !CLASS_LOADED_P (source))
13123 load_class (source, 1);
13124 safe_layout_class (source);
13126 if (CLASS_P (dest) && !CLASS_LOADED_P (dest))
13128 load_class (dest, 1);
13129 safe_layout_class (dest);
13132 /* Case where SOURCE is a class type */
13133 if (TYPE_CLASS_P (source))
13135 if (TYPE_CLASS_P (dest))
13136 return (source == dest
13137 || inherits_from_p (source, dest)
13138 || (cast && inherits_from_p (dest, source)));
13139 if (TYPE_INTERFACE_P (dest))
13141 /* If doing a cast and SOURCE is final, the operation is
13142 always correct a compile time (because even if SOURCE
13143 does not implement DEST, a subclass of SOURCE might). */
13144 if (cast && !CLASS_FINAL (TYPE_NAME (source)))
13146 /* Otherwise, SOURCE must implement DEST */
13147 return interface_of_p (dest, source);
13149 /* DEST is an array, cast permitted if SOURCE is of Object type */
13150 return (cast && source == object_type_node ? 1 : 0);
13152 if (TYPE_INTERFACE_P (source))
13154 if (TYPE_CLASS_P (dest))
13156 /* If not casting, DEST must be the Object type */
13158 return dest == object_type_node;
13159 /* We're doing a cast. The cast is always valid is class
13160 DEST is not final, otherwise, DEST must implement SOURCE */
13161 else if (!CLASS_FINAL (TYPE_NAME (dest)))
13164 return interface_of_p (source, dest);
13166 if (TYPE_INTERFACE_P (dest))
13168 /* If doing a cast, then if SOURCE and DEST contain method
13169 with the same signature but different return type, then
13170 this is a (compile time) error */
13173 tree method_source, method_dest;
13177 for (method_source = TYPE_METHODS (source); method_source;
13178 method_source = TREE_CHAIN (method_source))
13181 build_java_argument_signature (TREE_TYPE (method_source));
13182 source_type = TREE_TYPE (TREE_TYPE (method_source));
13183 source_name = DECL_NAME (method_source);
13184 for (method_dest = TYPE_METHODS (dest);
13185 method_dest; method_dest = TREE_CHAIN (method_dest))
13187 build_java_argument_signature (TREE_TYPE (method_dest))
13188 && source_name == DECL_NAME (method_dest)
13189 && source_type != TREE_TYPE (TREE_TYPE (method_dest)))
13195 return source == dest || interface_of_p (dest, source);
13201 && (DECL_NAME (TYPE_NAME (source))
13202 == java_lang_cloneable_identifier_node
13203 || (DECL_NAME (TYPE_NAME (source))
13204 == java_io_serializable_identifier_node)));
13207 if (TYPE_ARRAY_P (source))
13209 if (TYPE_CLASS_P (dest))
13210 return dest == object_type_node;
13211 /* Can't cast an array to an interface unless the interface is
13212 java.lang.Cloneable or java.io.Serializable. */
13213 if (TYPE_INTERFACE_P (dest))
13214 return (DECL_NAME (TYPE_NAME (dest))
13215 == java_lang_cloneable_identifier_node
13216 || (DECL_NAME (TYPE_NAME (dest))
13217 == java_io_serializable_identifier_node));
13220 tree source_element_type = TYPE_ARRAY_ELEMENT (source);
13221 tree dest_element_type = TYPE_ARRAY_ELEMENT (dest);
13223 /* In case of severe errors, they turn out null */
13224 if (!dest_element_type || !source_element_type)
13226 if (source_element_type == dest_element_type)
13228 return valid_ref_assignconv_cast_p (source_element_type,
13229 dest_element_type, cast);
13237 valid_cast_to_p (tree source, tree dest)
13239 if (TREE_CODE (source) == POINTER_TYPE)
13240 source = TREE_TYPE (source);
13241 if (TREE_CODE (dest) == POINTER_TYPE)
13242 dest = TREE_TYPE (dest);
13244 if (TREE_CODE (source) == RECORD_TYPE && TREE_CODE (dest) == RECORD_TYPE)
13245 return valid_ref_assignconv_cast_p (source, dest, 1);
13247 else if (JNUMERIC_TYPE_P (source) && JNUMERIC_TYPE_P (dest))
13250 else if (TREE_CODE (source) == BOOLEAN_TYPE
13251 && TREE_CODE (dest) == BOOLEAN_TYPE)
13258 do_unary_numeric_promotion (tree arg)
13260 tree type = TREE_TYPE (arg);
13261 if ((TREE_CODE (type) == INTEGER_TYPE && TYPE_PRECISION (type) < 32)
13262 || TREE_CODE (type) == CHAR_TYPE)
13263 arg = convert (int_type_node, arg);
13267 /* Return a nonzero value if SOURCE can be converted into DEST using
13268 the method invocation conversion rule (5.3). */
13270 valid_method_invocation_conversion_p (tree dest, tree source)
13272 return ((JPRIMITIVE_TYPE_P (source) && JPRIMITIVE_TYPE_P (dest)
13273 && valid_builtin_assignconv_identity_widening_p (dest, source))
13274 || ((JREFERENCE_TYPE_P (source) || JNULLP_TYPE_P (source))
13275 && (JREFERENCE_TYPE_P (dest) || JNULLP_TYPE_P (dest))
13276 && valid_ref_assignconv_cast_p (source, dest, 0)));
13279 /* Build an incomplete binop expression. */
13282 build_binop (enum tree_code op, int op_location, tree op1, tree op2)
13284 tree binop = build2 (op, NULL_TREE, op1, op2);
13285 TREE_SIDE_EFFECTS (binop) = 1;
13286 /* Store the location of the operator, for better error report. The
13287 string of the operator will be rebuild based on the OP value. */
13288 EXPR_WFL_LINECOL (binop) = op_location;
13292 /* Build the string of the operator retained by NODE. If NODE is part
13293 of a compound expression, add an '=' at the end of the string. This
13294 function is called when an error needs to be reported on an
13295 operator. The string is returned as a pointer to a static character
13299 operator_string (tree node)
13301 #define BUILD_OPERATOR_STRING(S) \
13303 sprintf (buffer, "%s%s", S, (COMPOUND_ASSIGN_P (node) ? "=" : "")); \
13307 static char buffer [10];
13308 switch (TREE_CODE (node))
13310 case MULT_EXPR: BUILD_OPERATOR_STRING ("*");
13311 case RDIV_EXPR: BUILD_OPERATOR_STRING ("/");
13312 case TRUNC_MOD_EXPR: BUILD_OPERATOR_STRING ("%");
13313 case PLUS_EXPR: BUILD_OPERATOR_STRING ("+");
13314 case MINUS_EXPR: BUILD_OPERATOR_STRING ("-");
13315 case LSHIFT_EXPR: BUILD_OPERATOR_STRING ("<<");
13316 case RSHIFT_EXPR: BUILD_OPERATOR_STRING (">>");
13317 case URSHIFT_EXPR: BUILD_OPERATOR_STRING (">>>");
13318 case BIT_AND_EXPR: BUILD_OPERATOR_STRING ("&");
13319 case BIT_XOR_EXPR: BUILD_OPERATOR_STRING ("^");
13320 case BIT_IOR_EXPR: BUILD_OPERATOR_STRING ("|");
13321 case TRUTH_ANDIF_EXPR: BUILD_OPERATOR_STRING ("&&");
13322 case TRUTH_ORIF_EXPR: BUILD_OPERATOR_STRING ("||");
13323 case EQ_EXPR: BUILD_OPERATOR_STRING ("==");
13324 case NE_EXPR: BUILD_OPERATOR_STRING ("!=");
13325 case GT_EXPR: BUILD_OPERATOR_STRING (">");
13326 case GE_EXPR: BUILD_OPERATOR_STRING (">=");
13327 case LT_EXPR: BUILD_OPERATOR_STRING ("<");
13328 case LE_EXPR: BUILD_OPERATOR_STRING ("<=");
13329 case UNARY_PLUS_EXPR: BUILD_OPERATOR_STRING ("+");
13330 case NEGATE_EXPR: BUILD_OPERATOR_STRING ("-");
13331 case TRUTH_NOT_EXPR: BUILD_OPERATOR_STRING ("!");
13332 case BIT_NOT_EXPR: BUILD_OPERATOR_STRING ("~");
13333 case PREINCREMENT_EXPR: /* Fall through */
13334 case POSTINCREMENT_EXPR: BUILD_OPERATOR_STRING ("++");
13335 case PREDECREMENT_EXPR: /* Fall through */
13336 case POSTDECREMENT_EXPR: BUILD_OPERATOR_STRING ("--");
13338 internal_error ("unregistered operator %s",
13339 tree_code_name [TREE_CODE (node)]);
13342 #undef BUILD_OPERATOR_STRING
13345 /* Return 1 if VAR_ACCESS1 is equivalent to VAR_ACCESS2. */
13348 java_decl_equiv (tree var_acc1, tree var_acc2)
13350 if (JDECL_P (var_acc1))
13351 return (var_acc1 == var_acc2);
13353 return (TREE_CODE (var_acc1) == COMPONENT_REF
13354 && TREE_CODE (var_acc2) == COMPONENT_REF
13355 && TREE_OPERAND (TREE_OPERAND (var_acc1, 0), 0)
13356 == TREE_OPERAND (TREE_OPERAND (var_acc2, 0), 0)
13357 && TREE_OPERAND (var_acc1, 1) == TREE_OPERAND (var_acc2, 1));
13360 /* Return a nonzero value if CODE is one of the operators that can be
13361 used in conjunction with the `=' operator in a compound assignment. */
13364 binop_compound_p (enum tree_code code)
13367 for (i = 0; i < BINOP_COMPOUND_CANDIDATES; i++)
13368 if (binop_lookup [i] == code)
13371 return i < BINOP_COMPOUND_CANDIDATES;
13374 /* Reorganize after a fold to get SAVE_EXPR to generate what we want. */
13377 java_refold (tree t)
13379 tree c, b, ns, decl;
13381 if (TREE_CODE (t) != MODIFY_EXPR)
13384 c = TREE_OPERAND (t, 1);
13385 if (! (c && TREE_CODE (c) == COMPOUND_EXPR
13386 && TREE_CODE (TREE_OPERAND (c, 0)) == MODIFY_EXPR
13387 && binop_compound_p (TREE_CODE (TREE_OPERAND (c, 1)))))
13390 /* Now the left branch of the binary operator. */
13391 b = TREE_OPERAND (TREE_OPERAND (c, 1), 0);
13392 if (! (b && TREE_CODE (b) == NOP_EXPR
13393 && TREE_CODE (TREE_OPERAND (b, 0)) == SAVE_EXPR))
13396 ns = TREE_OPERAND (TREE_OPERAND (b, 0), 0);
13397 if (! (ns && TREE_CODE (ns) == NOP_EXPR
13398 && TREE_CODE (TREE_OPERAND (ns, 0)) == SAVE_EXPR))
13401 decl = TREE_OPERAND (TREE_OPERAND (ns, 0), 0);
13402 if ((JDECL_P (decl) || TREE_CODE (decl) == COMPONENT_REF)
13403 /* It's got to be the an equivalent decl */
13404 && java_decl_equiv (decl, TREE_OPERAND (TREE_OPERAND (c, 0), 0)))
13406 /* Shorten the NOP_EXPR/SAVE_EXPR path. */
13407 TREE_OPERAND (TREE_OPERAND (c, 1), 0) = TREE_OPERAND (ns, 0);
13408 /* Substitute the COMPOUND_EXPR by the BINOP_EXPR */
13409 TREE_OPERAND (t, 1) = TREE_OPERAND (c, 1);
13410 /* Change the right part of the BINOP_EXPR */
13411 TREE_OPERAND (TREE_OPERAND (t, 1), 1) = TREE_OPERAND (c, 0);
13417 /* Binary operators (15.16 up to 15.18). We return error_mark_node on
13418 errors but we modify NODE so that it contains the type computed
13419 according to the expression, when it's fixed. Otherwise, we write
13420 error_mark_node as the type. It allows us to further the analysis
13421 of remaining nodes and detects more errors in certain cases. */
13424 patch_binop (tree node, tree wfl_op1, tree wfl_op2)
13426 tree op1 = TREE_OPERAND (node, 0);
13427 tree op2 = TREE_OPERAND (node, 1);
13428 tree op1_type = TREE_TYPE (op1);
13429 tree op2_type = TREE_TYPE (op2);
13430 tree prom_type = NULL_TREE, cn;
13431 enum tree_code code = TREE_CODE (node);
13433 /* If 1, tell the routine that we have to return error_mark_node
13434 after checking for the initialization of the RHS */
13435 int error_found = 0;
13437 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
13439 /* If either op<n>_type are NULL, this might be early signs of an
13440 error situation, unless it's too early to tell (in case we're
13441 handling a `+', `==', `!=' or `instanceof'.) We want to set op<n>_type
13442 correctly so the error can be later on reported accurately. */
13443 if (! (code == PLUS_EXPR || code == NE_EXPR
13444 || code == EQ_EXPR || code == INSTANCEOF_EXPR))
13449 n = java_complete_tree (op1);
13450 op1_type = TREE_TYPE (n);
13454 n = java_complete_tree (op2);
13455 op2_type = TREE_TYPE (n);
13461 /* 15.16 Multiplicative operators */
13462 case MULT_EXPR: /* 15.16.1 Multiplication Operator * */
13463 case RDIV_EXPR: /* 15.16.2 Division Operator / */
13464 case TRUNC_DIV_EXPR: /* 15.16.2 Integral type Division Operator / */
13465 case TRUNC_MOD_EXPR: /* 15.16.3 Remainder operator % */
13466 if (!JNUMERIC_TYPE_P (op1_type) || !JNUMERIC_TYPE_P (op2_type))
13468 if (!JNUMERIC_TYPE_P (op1_type))
13469 ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op1_type);
13470 if (!JNUMERIC_TYPE_P (op2_type) && (op1_type != op2_type))
13471 ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op2_type);
13472 TREE_TYPE (node) = error_mark_node;
13476 prom_type = binary_numeric_promotion (op1_type, op2_type, &op1, &op2);
13478 /* Detect integral division by zero */
13479 if ((code == RDIV_EXPR || code == TRUNC_MOD_EXPR)
13480 && TREE_CODE (prom_type) == INTEGER_TYPE
13481 && (op2 == integer_zero_node || op2 == long_zero_node ||
13482 (TREE_CODE (op2) == INTEGER_CST &&
13483 ! TREE_INT_CST_LOW (op2) && ! TREE_INT_CST_HIGH (op2))))
13485 parse_warning_context (wfl_operator, "Evaluating this expression will result in an arithmetic exception being thrown");
13486 TREE_CONSTANT (node) = 0;
13487 TREE_INVARIANT (node) = 0;
13490 /* Change the division operator if necessary */
13491 if (code == RDIV_EXPR && TREE_CODE (prom_type) == INTEGER_TYPE)
13492 TREE_SET_CODE (node, TRUNC_DIV_EXPR);
13494 /* Before divisions as is disappear, try to simplify and bail if
13495 applicable, otherwise we won't perform even simple
13496 simplifications like (1-1)/3. We can't do that with floating
13497 point number, folds can't handle them at this stage. */
13498 if (code == RDIV_EXPR && TREE_CONSTANT (op1) && TREE_CONSTANT (op2)
13499 && JINTEGRAL_TYPE_P (op1) && JINTEGRAL_TYPE_P (op2))
13501 TREE_TYPE (node) = prom_type;
13502 node = fold (node);
13503 if (TREE_CODE (node) != code)
13507 if (TREE_CODE (prom_type) == INTEGER_TYPE
13508 && flag_use_divide_subroutine
13509 && ! flag_emit_class_files
13510 && (code == RDIV_EXPR || code == TRUNC_MOD_EXPR))
13511 return build_java_soft_divmod (TREE_CODE (node), prom_type, op1, op2);
13513 /* This one is more complicated. FLOATs are processed by a
13514 function call to soft_fmod. Duplicate the value of the
13515 COMPOUND_ASSIGN_P flag. */
13516 if (code == TRUNC_MOD_EXPR)
13518 tree mod = build_java_binop (TRUNC_MOD_EXPR, prom_type, op1, op2);
13519 COMPOUND_ASSIGN_P (mod) = COMPOUND_ASSIGN_P (node);
13524 /* 15.17 Additive Operators */
13525 case PLUS_EXPR: /* 15.17.1 String Concatenation Operator + */
13527 /* Operation is valid if either one argument is a string
13528 constant, a String object or a StringBuffer crafted for the
13529 purpose of the a previous usage of the String concatenation
13532 if (TREE_CODE (op1) == STRING_CST
13533 || TREE_CODE (op2) == STRING_CST
13534 || JSTRING_TYPE_P (op1_type)
13535 || JSTRING_TYPE_P (op2_type)
13536 || IS_CRAFTED_STRING_BUFFER_P (op1)
13537 || IS_CRAFTED_STRING_BUFFER_P (op2))
13538 return build_string_concatenation (op1, op2);
13540 case MINUS_EXPR: /* 15.17.2 Additive Operators (+ and -) for
13542 if (!JNUMERIC_TYPE_P (op1_type) || !JNUMERIC_TYPE_P (op2_type))
13544 if (!JNUMERIC_TYPE_P (op1_type))
13545 ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op1_type);
13546 if (!JNUMERIC_TYPE_P (op2_type) && (op1_type != op2_type))
13547 ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op2_type);
13548 TREE_TYPE (node) = error_mark_node;
13552 prom_type = binary_numeric_promotion (op1_type, op2_type, &op1, &op2);
13555 /* 15.18 Shift Operators */
13559 if (!JINTEGRAL_TYPE_P (op1_type) || !JINTEGRAL_TYPE_P (op2_type))
13561 if (!JINTEGRAL_TYPE_P (op1_type))
13562 ERROR_CAST_NEEDED_TO_INTEGRAL (wfl_operator, node, op1_type);
13565 if (JNUMERIC_TYPE_P (op2_type))
13566 parse_error_context (wfl_operator,
13567 "Incompatible type for `%s'. Explicit cast needed to convert shift distance from `%s' to integral",
13568 operator_string (node),
13569 lang_printable_name (op2_type, 0));
13571 parse_error_context (wfl_operator,
13572 "Incompatible type for `%s'. Can't convert shift distance from `%s' to integral",
13573 operator_string (node),
13574 lang_printable_name (op2_type, 0));
13576 TREE_TYPE (node) = error_mark_node;
13581 /* Unary numeric promotion (5.6.1) is performed on each operand
13583 op1 = do_unary_numeric_promotion (op1);
13584 op2 = do_unary_numeric_promotion (op2);
13586 /* If the right hand side is of type `long', first cast it to
13588 if (TREE_TYPE (op2) == long_type_node)
13589 op2 = build1 (CONVERT_EXPR, int_type_node, op2);
13591 /* The type of the shift expression is the type of the promoted
13592 type of the left-hand operand */
13593 prom_type = TREE_TYPE (op1);
13595 /* Shift int only up to 0x1f and long up to 0x3f */
13596 if (prom_type == int_type_node)
13597 op2 = fold (build2 (BIT_AND_EXPR, int_type_node, op2,
13598 build_int_cst (NULL_TREE, 0x1f)));
13600 op2 = fold (build2 (BIT_AND_EXPR, int_type_node, op2,
13601 build_int_cst (NULL_TREE, 0x3f)));
13603 /* The >>> operator is a >> operating on unsigned quantities */
13604 if (code == URSHIFT_EXPR && ! flag_emit_class_files)
13607 tree utype = java_unsigned_type (prom_type);
13608 op1 = convert (utype, op1);
13609 TREE_SET_CODE (node, RSHIFT_EXPR);
13610 TREE_OPERAND (node, 0) = op1;
13611 TREE_OPERAND (node, 1) = op2;
13612 TREE_TYPE (node) = utype;
13613 to_return = convert (prom_type, node);
13614 /* Copy the original value of the COMPOUND_ASSIGN_P flag */
13615 COMPOUND_ASSIGN_P (to_return) = COMPOUND_ASSIGN_P (node);
13616 TREE_SIDE_EFFECTS (to_return)
13617 = TREE_SIDE_EFFECTS (op1) | TREE_SIDE_EFFECTS (op2);
13622 /* 15.19.1 Type Comparison Operator instanceof */
13623 case INSTANCEOF_EXPR:
13625 TREE_TYPE (node) = boolean_type_node;
13627 /* OP1_TYPE might be NULL when OP1 is a string constant. */
13628 if ((cn = patch_string (op1)))
13631 op1_type = TREE_TYPE (op1);
13633 if (op1_type == NULL_TREE)
13636 if (!(op2_type = resolve_type_during_patch (op2)))
13637 return error_mark_node;
13639 /* The first operand must be a reference type or the null type */
13640 if (!JREFERENCE_TYPE_P (op1_type) && op1 != null_pointer_node)
13641 error_found = 1; /* Error reported further below */
13643 /* The second operand must be a reference type */
13644 if (!JREFERENCE_TYPE_P (op2_type))
13646 SET_WFL_OPERATOR (wfl_operator, node, wfl_op2);
13647 parse_error_context
13648 (wfl_operator, "Invalid argument `%s' for `instanceof'",
13649 lang_printable_name (op2_type, 0));
13653 if (!error_found && valid_ref_assignconv_cast_p (op1_type, op2_type, 1))
13655 /* If the first operand is null, the result is always false */
13656 if (op1 == null_pointer_node)
13657 return boolean_false_node;
13658 else if (flag_emit_class_files)
13660 TREE_OPERAND (node, 1) = op2_type;
13661 TREE_SIDE_EFFECTS (node) = TREE_SIDE_EFFECTS (op1);
13664 /* Otherwise we have to invoke instance of to figure it out */
13666 return build_instanceof (op1, op2_type);
13668 /* There is no way the expression operand can be an instance of
13669 the type operand. This is a compile time error. */
13672 char *t1 = xstrdup (lang_printable_name (op1_type, 0));
13673 SET_WFL_OPERATOR (wfl_operator, node, wfl_op1);
13674 parse_error_context
13675 (wfl_operator, "Impossible for `%s' to be instance of `%s'",
13676 t1, lang_printable_name (op2_type, 0));
13683 /* 15.21 Bitwise and Logical Operators */
13687 if (JINTEGRAL_TYPE_P (op1_type) && JINTEGRAL_TYPE_P (op2_type))
13688 /* Binary numeric promotion is performed on both operand and the
13689 expression retain that type */
13690 prom_type = binary_numeric_promotion (op1_type, op2_type, &op1, &op2);
13692 else if (TREE_CODE (op1_type) == BOOLEAN_TYPE
13693 && TREE_CODE (op1_type) == BOOLEAN_TYPE)
13694 /* The type of the bitwise operator expression is BOOLEAN */
13695 prom_type = boolean_type_node;
13698 if (!JINTEGRAL_TYPE_P (op1_type))
13699 ERROR_CAST_NEEDED_TO_INTEGRAL (wfl_operator, node, op1_type);
13700 if (!JINTEGRAL_TYPE_P (op2_type) && (op1_type != op2_type))
13701 ERROR_CAST_NEEDED_TO_INTEGRAL (wfl_operator, node, op2_type);
13702 TREE_TYPE (node) = error_mark_node;
13704 /* Insert a break here if adding thing before the switch's
13705 break for this case */
13709 /* 15.22 Conditional-And Operator */
13710 case TRUTH_ANDIF_EXPR:
13711 /* 15.23 Conditional-Or Operator */
13712 case TRUTH_ORIF_EXPR:
13713 /* Operands must be of BOOLEAN type */
13714 if (TREE_CODE (op1_type) != BOOLEAN_TYPE ||
13715 TREE_CODE (op2_type) != BOOLEAN_TYPE)
13717 if (TREE_CODE (op1_type) != BOOLEAN_TYPE)
13718 ERROR_CANT_CONVERT_TO_BOOLEAN (wfl_operator, node, op1_type);
13719 if (TREE_CODE (op2_type) != BOOLEAN_TYPE && (op1_type != op2_type))
13720 ERROR_CANT_CONVERT_TO_BOOLEAN (wfl_operator, node, op2_type);
13721 TREE_TYPE (node) = boolean_type_node;
13725 else if (integer_zerop (op1))
13727 return code == TRUTH_ANDIF_EXPR ? op1 : op2;
13729 else if (integer_onep (op1))
13731 return code == TRUTH_ANDIF_EXPR ? op2 : op1;
13733 /* The type of the conditional operators is BOOLEAN */
13734 prom_type = boolean_type_node;
13737 /* 15.19.1 Numerical Comparison Operators <, <=, >, >= */
13742 /* The type of each of the operands must be a primitive numeric
13744 if (!JNUMERIC_TYPE_P (op1_type) || ! JNUMERIC_TYPE_P (op2_type))
13746 if (!JNUMERIC_TYPE_P (op1_type))
13747 ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op1_type);
13748 if (!JNUMERIC_TYPE_P (op2_type) && (op1_type != op2_type))
13749 ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op2_type);
13750 TREE_TYPE (node) = boolean_type_node;
13754 /* Binary numeric promotion is performed on the operands */
13755 binary_numeric_promotion (op1_type, op2_type, &op1, &op2);
13756 /* The type of the relation expression is always BOOLEAN */
13757 prom_type = boolean_type_node;
13760 /* 15.20 Equality Operator */
13763 /* It's time for us to patch the strings. */
13764 if ((cn = patch_string (op1)))
13767 op1_type = TREE_TYPE (op1);
13769 if ((cn = patch_string (op2)))
13772 op2_type = TREE_TYPE (op2);
13775 /* 15.20.1 Numerical Equality Operators == and != */
13776 /* Binary numeric promotion is performed on the operands */
13777 if (JNUMERIC_TYPE_P (op1_type) && JNUMERIC_TYPE_P (op2_type))
13778 binary_numeric_promotion (op1_type, op2_type, &op1, &op2);
13780 /* 15.20.2 Boolean Equality Operators == and != */
13781 else if (TREE_CODE (op1_type) == BOOLEAN_TYPE &&
13782 TREE_CODE (op2_type) == BOOLEAN_TYPE)
13783 ; /* Nothing to do here */
13785 /* 15.20.3 Reference Equality Operators == and != */
13786 /* Types have to be either references or the null type. If
13787 they're references, it must be possible to convert either
13788 type to the other by casting conversion. */
13789 else if (op1 == null_pointer_node || op2 == null_pointer_node
13790 || (JREFERENCE_TYPE_P (op1_type) && JREFERENCE_TYPE_P (op2_type)
13791 && (valid_ref_assignconv_cast_p (op1_type, op2_type, 1)
13792 || valid_ref_assignconv_cast_p (op2_type,
13794 ; /* Nothing to do here */
13796 /* Else we have an error figure what can't be converted into
13797 what and report the error */
13801 t1 = xstrdup (lang_printable_name (op1_type, 0));
13802 parse_error_context
13804 "Incompatible type for `%s'. Can't convert `%s' to `%s'",
13805 operator_string (node), t1,
13806 lang_printable_name (op2_type, 0));
13808 TREE_TYPE (node) = boolean_type_node;
13812 prom_type = boolean_type_node;
13819 return error_mark_node;
13821 TREE_OPERAND (node, 0) = op1;
13822 TREE_OPERAND (node, 1) = op2;
13823 TREE_TYPE (node) = prom_type;
13824 TREE_SIDE_EFFECTS (node) = TREE_SIDE_EFFECTS (op1) | TREE_SIDE_EFFECTS (op2);
13826 if (flag_emit_xref)
13829 /* fold does not respect side-effect order as required for Java but not C.
13830 * Also, it sometimes create SAVE_EXPRs which are bad when emitting
13833 if (flag_emit_class_files ? (TREE_CONSTANT (op1) && TREE_CONSTANT (op2))
13834 : ! TREE_SIDE_EFFECTS (node))
13835 node = fold (node);
13839 /* Concatenate the STRING_CST CSTE and STRING. When AFTER is a non
13840 zero value, the value of CSTE comes after the valude of STRING */
13843 do_merge_string_cste (tree cste, const char *string, int string_len, int after)
13845 const char *old = TREE_STRING_POINTER (cste);
13846 int old_len = TREE_STRING_LENGTH (cste);
13847 int len = old_len + string_len;
13848 char *new = alloca (len+1);
13852 memcpy (new, string, string_len);
13853 memcpy (&new [string_len], old, old_len);
13857 memcpy (new, old, old_len);
13858 memcpy (&new [old_len], string, string_len);
13861 return build_string (len, new);
13864 /* Tries to merge OP1 (a STRING_CST) and OP2 (if suitable). Return a
13865 new STRING_CST on success, NULL_TREE on failure. */
13868 merge_string_cste (tree op1, tree op2, int after)
13870 /* Handle two string constants right away. */
13871 if (TREE_CODE (op2) == STRING_CST)
13872 return do_merge_string_cste (op1, TREE_STRING_POINTER (op2),
13873 TREE_STRING_LENGTH (op2), after);
13875 /* Reasonable integer constant can be treated right away. */
13876 if (TREE_CODE (op2) == INTEGER_CST && !TREE_CONSTANT_OVERFLOW (op2))
13878 static const char *const boolean_true = "true";
13879 static const char *const boolean_false = "false";
13880 static const char *const null_pointer = "null";
13882 const char *string;
13884 if (op2 == boolean_true_node)
13885 string = boolean_true;
13886 else if (op2 == boolean_false_node)
13887 string = boolean_false;
13888 else if (op2 == null_pointer_node
13889 || (integer_zerop (op2)
13890 && TREE_CODE (TREE_TYPE (op2)) == POINTER_TYPE))
13891 /* FIXME: null is not a compile-time constant, so it is only safe to
13892 merge if the overall expression is non-constant. However, this
13893 code always merges without checking the overall expression. */
13894 string = null_pointer;
13895 else if (TREE_TYPE (op2) == char_type_node)
13897 /* Convert the character into UTF-8. */
13898 unsigned int c = (unsigned int) TREE_INT_CST_LOW (op2);
13899 unsigned char *p = (unsigned char *) ch;
13900 if (0x01 <= c && c <= 0x7f)
13901 *p++ = (unsigned char) c;
13902 else if (c < 0x7ff)
13904 *p++ = (unsigned char) (c >> 6 | 0xc0);
13905 *p++ = (unsigned char) ((c & 0x3f) | 0x80);
13909 *p++ = (unsigned char) (c >> 12 | 0xe0);
13910 *p++ = (unsigned char) (((c >> 6) & 0x3f) | 0x80);
13911 *p++ = (unsigned char) ((c & 0x3f) | 0x80);
13918 string = string_convert_int_cst (op2);
13920 return do_merge_string_cste (op1, string, strlen (string), after);
13925 /* Tries to statically concatenate OP1 and OP2 if possible. Either one
13926 has to be a STRING_CST and the other part must be a STRING_CST or a
13927 INTEGRAL constant. Return a new STRING_CST if the operation
13928 succeed, NULL_TREE otherwise.
13930 If the case we want to optimize for space, we might want to return
13931 NULL_TREE for each invocation of this routine. FIXME */
13934 string_constant_concatenation (tree op1, tree op2)
13936 if (TREE_CODE (op1) == STRING_CST || (TREE_CODE (op2) == STRING_CST))
13941 string = (TREE_CODE (op1) == STRING_CST ? op1 : op2);
13942 rest = (string == op1 ? op2 : op1);
13943 invert = (string == op1 ? 0 : 1 );
13945 /* Walk REST, only if it looks reasonable */
13946 if (TREE_CODE (rest) != STRING_CST
13947 && !IS_CRAFTED_STRING_BUFFER_P (rest)
13948 && !JSTRING_TYPE_P (TREE_TYPE (rest))
13949 && TREE_CODE (rest) == EXPR_WITH_FILE_LOCATION)
13951 rest = java_complete_tree (rest);
13952 if (rest == error_mark_node)
13953 return error_mark_node;
13954 rest = fold (rest);
13956 return merge_string_cste (string, rest, invert);
13961 /* Implement the `+' operator. Does static optimization if possible,
13962 otherwise create (if necessary) and append elements to a
13963 StringBuffer. The StringBuffer will be carried around until it is
13964 used for a function call or an assignment. Then toString() will be
13965 called on it to turn it into a String object. */
13968 build_string_concatenation (tree op1, tree op2)
13971 int side_effects = TREE_SIDE_EFFECTS (op1) | TREE_SIDE_EFFECTS (op2);
13973 if (flag_emit_xref)
13974 return build2 (PLUS_EXPR, string_type_node, op1, op2);
13976 /* Try to do some static optimization */
13977 if ((result = string_constant_concatenation (op1, op2)))
13980 /* Discard empty strings on either side of the expression */
13981 if (TREE_CODE (op1) == STRING_CST && TREE_STRING_LENGTH (op1) == 0)
13986 else if (TREE_CODE (op2) == STRING_CST && TREE_STRING_LENGTH (op2) == 0)
13989 /* If operands are string constant, turn then into object references */
13990 if (TREE_CODE (op1) == STRING_CST)
13991 op1 = patch_string_cst (op1);
13992 if (op2 && TREE_CODE (op2) == STRING_CST)
13993 op2 = patch_string_cst (op2);
13995 /* If either one of the constant is null and the other non null
13996 operand is a String constant, return it. */
13997 if ((TREE_CODE (op1) == STRING_CST) && !op2)
14000 /* If OP1 isn't already a StringBuffer, create and
14001 initialize a new one */
14002 if (!IS_CRAFTED_STRING_BUFFER_P (op1))
14004 /* Two solutions here:
14005 1) OP1 is a constant string reference, we call new StringBuffer(OP1)
14006 2) OP1 is something else, we call new StringBuffer().append(OP1). */
14007 if (TREE_CONSTANT (op1) && JSTRING_TYPE_P (TREE_TYPE (op1)))
14008 op1 = BUILD_STRING_BUFFER (op1);
14011 tree aNew = BUILD_STRING_BUFFER (NULL_TREE);
14012 op1 = make_qualified_primary (aNew, BUILD_APPEND (op1), 0);
14018 /* OP1 is no longer the last node holding a crafted StringBuffer */
14019 IS_CRAFTED_STRING_BUFFER_P (op1) = 0;
14020 /* Create a node for `{new...,xxx}.append (op2)' */
14022 op1 = make_qualified_primary (op1, BUILD_APPEND (op2), 0);
14025 /* Mark the last node holding a crafted StringBuffer */
14026 IS_CRAFTED_STRING_BUFFER_P (op1) = 1;
14028 TREE_SIDE_EFFECTS (op1) = side_effects;
14032 /* Patch the string node NODE. NODE can be a STRING_CST of a crafted
14033 StringBuffer. If no string were found to be patched, return
14037 patch_string (tree node)
14039 if (node == error_mark_node)
14040 return error_mark_node;
14041 if (TREE_CODE (node) == STRING_CST)
14042 return patch_string_cst (node);
14043 else if (IS_CRAFTED_STRING_BUFFER_P (node))
14045 int saved = ctxp->explicit_constructor_p;
14046 tree invoke = build_method_invocation (wfl_to_string, NULL_TREE);
14048 /* Temporary disable forbid the use of `this'. */
14049 ctxp->explicit_constructor_p = 0;
14050 ret = java_complete_tree (make_qualified_primary (node, invoke, 0));
14051 /* String concatenation arguments must be evaluated in order too. */
14052 ret = force_evaluation_order (ret);
14053 /* Restore it at its previous value */
14054 ctxp->explicit_constructor_p = saved;
14060 /* Build the internal representation of a string constant. */
14063 patch_string_cst (tree node)
14066 if (! flag_emit_class_files)
14068 node = get_identifier (TREE_STRING_POINTER (node));
14069 location = alloc_name_constant (CONSTANT_String, node);
14070 node = build_ref_from_constant_pool (location);
14072 TREE_CONSTANT (node) = 1;
14073 TREE_INVARIANT (node) = 1;
14075 /* ??? Guessing that the class file code can't handle casts. */
14076 if (! flag_emit_class_files)
14077 node = convert (string_ptr_type_node, node);
14079 TREE_TYPE (node) = string_ptr_type_node;
14084 /* Build an incomplete unary operator expression. */
14087 build_unaryop (int op_token, int op_location, tree op1)
14093 case PLUS_TK: op = UNARY_PLUS_EXPR; break;
14094 case MINUS_TK: op = NEGATE_EXPR; break;
14095 case NEG_TK: op = TRUTH_NOT_EXPR; break;
14096 case NOT_TK: op = BIT_NOT_EXPR; break;
14100 unaryop = build1 (op, NULL_TREE, op1);
14101 TREE_SIDE_EFFECTS (unaryop) = 1;
14102 /* Store the location of the operator, for better error report. The
14103 string of the operator will be rebuild based on the OP value. */
14104 EXPR_WFL_LINECOL (unaryop) = op_location;
14108 /* Special case for the ++/-- operators, since they require an extra
14109 argument to build, which is set to NULL and patched
14110 later. IS_POST_P is 1 if the operator, 0 otherwise. */
14113 build_incdec (int op_token, int op_location, tree op1, int is_post_p)
14115 static const enum tree_code lookup [2][2] =
14117 { PREDECREMENT_EXPR, PREINCREMENT_EXPR, },
14118 { POSTDECREMENT_EXPR, POSTINCREMENT_EXPR, },
14120 tree node = build2 (lookup [is_post_p][(op_token - DECR_TK)],
14121 NULL_TREE, op1, NULL_TREE);
14122 TREE_SIDE_EFFECTS (node) = 1;
14123 /* Store the location of the operator, for better error report. The
14124 string of the operator will be rebuild based on the OP value. */
14125 EXPR_WFL_LINECOL (node) = op_location;
14129 /* Build an incomplete cast operator, based on the use of the
14130 CONVERT_EXPR. Note that TREE_TYPE of the constructed node is
14131 set. java_complete_tree is trained to walk a CONVERT_EXPR even
14132 though its type is already set. */
14135 build_cast (int location, tree type, tree exp)
14137 tree node = build1 (CONVERT_EXPR, type, exp);
14138 EXPR_WFL_LINECOL (node) = location;
14142 /* Build an incomplete class reference operator. */
14144 build_incomplete_class_ref (int location, tree class_name)
14146 tree node = build1 (CLASS_LITERAL, NULL_TREE, class_name);
14147 tree class_decl = GET_CPC ();
14148 tree this_class = TREE_TYPE (class_decl);
14150 /* Generate the synthetic static method `class$'. (Previously we
14151 deferred this, causing different method tables to be emitted
14152 for native code and bytecode.) */
14153 if (!TYPE_DOT_CLASS (this_class)
14154 && !JPRIMITIVE_TYPE_P (class_name)
14155 && !(TREE_CODE (class_name) == VOID_TYPE))
14157 tree cpc_list = GET_CPC_LIST();
14158 tree cpc = cpc_list;
14161 /* For inner classes, add a 'class$' method to their outermost
14162 context, creating it if necessary. */
14164 while (GET_NEXT_ENCLOSING_CPC(cpc))
14165 cpc = GET_NEXT_ENCLOSING_CPC(cpc);
14166 class_decl = TREE_VALUE (cpc);
14168 target_class = TREE_TYPE (class_decl);
14170 if (CLASS_INTERFACE (TYPE_NAME (target_class)))
14172 /* For interfaces, adding a static 'class$' method directly
14173 is illegal. So create an inner class to contain the new
14174 method. Empirically this matches the behavior of javac. */
14176 /* We want the generated inner class inside the outermost class. */
14177 GET_CPC_LIST() = cpc;
14178 t = build_wfl_node (DECL_NAME (TYPE_NAME (object_type_node)));
14179 inner = create_anonymous_class (t);
14180 target_class = TREE_TYPE (inner);
14181 end_class_declaration (1);
14182 GET_CPC_LIST() = cpc_list;
14185 if (TYPE_DOT_CLASS (target_class) == NULL_TREE)
14186 build_dot_class_method (target_class);
14188 if (this_class != target_class)
14189 TYPE_DOT_CLASS (this_class) = TYPE_DOT_CLASS (target_class);
14192 EXPR_WFL_LINECOL (node) = location;
14196 /* Complete an incomplete class reference operator. */
14198 patch_incomplete_class_ref (tree node)
14200 tree type = TREE_OPERAND (node, 0);
14203 if (!(ref_type = resolve_type_during_patch (type)))
14204 return error_mark_node;
14206 /* If we're not emitting class files and we know ref_type is a
14207 compiled class, build a direct reference. */
14208 if ((! flag_emit_class_files && is_compiled_class (ref_type))
14209 || JPRIMITIVE_TYPE_P (ref_type)
14210 || TREE_CODE (ref_type) == VOID_TYPE)
14212 tree dot = build_class_ref (ref_type);
14213 /* A class referenced by `foo.class' is initialized. */
14214 if (!flag_emit_class_files)
14215 dot = build_class_init (ref_type, dot);
14216 return java_complete_tree (dot);
14219 /* If we're emitting class files and we have to deal with non
14220 primitive types, we invoke the synthetic static method `class$'. */
14221 ref_type = build_dot_class_method_invocation (current_class, ref_type);
14222 return java_complete_tree (ref_type);
14225 /* 15.14 Unary operators. We return error_mark_node in case of error,
14226 but preserve the type of NODE if the type is fixed. */
14229 patch_unaryop (tree node, tree wfl_op)
14231 tree op = TREE_OPERAND (node, 0);
14232 tree op_type = TREE_TYPE (op);
14233 tree prom_type = NULL_TREE, value, decl;
14234 int outer_field_flag = 0;
14235 int code = TREE_CODE (node);
14236 int error_found = 0;
14238 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
14242 /* 15.13.2 Postfix Increment Operator ++ */
14243 case POSTINCREMENT_EXPR:
14244 /* 15.13.3 Postfix Increment Operator -- */
14245 case POSTDECREMENT_EXPR:
14246 /* 15.14.1 Prefix Increment Operator ++ */
14247 case PREINCREMENT_EXPR:
14248 /* 15.14.2 Prefix Decrement Operator -- */
14249 case PREDECREMENT_EXPR:
14250 op = decl = strip_out_static_field_access_decl (op);
14251 outer_field_flag = outer_field_expanded_access_p (op, NULL, NULL, NULL);
14252 /* We might be trying to change an outer field accessed using
14254 if (outer_field_flag)
14256 /* Retrieve the decl of the field we're trying to access. We
14257 do that by first retrieving the function we would call to
14258 access the field. It has been already verified that this
14259 field isn't final */
14260 if (flag_emit_class_files)
14261 decl = TREE_OPERAND (op, 0);
14263 decl = TREE_OPERAND (TREE_OPERAND (TREE_OPERAND (op, 0), 0), 0);
14264 decl = DECL_FUNCTION_ACCESS_DECL (decl);
14266 /* We really should have a JAVA_ARRAY_EXPR to avoid this */
14267 else if (!JDECL_P (decl)
14268 && TREE_CODE (decl) != COMPONENT_REF
14269 && !(flag_emit_class_files && TREE_CODE (decl) == ARRAY_REF)
14270 && TREE_CODE (decl) != INDIRECT_REF
14271 && !(TREE_CODE (decl) == COMPOUND_EXPR
14272 && TREE_OPERAND (decl, 1)
14273 && (TREE_CODE (TREE_OPERAND (decl, 1)) == INDIRECT_REF)))
14275 TREE_TYPE (node) = error_mark_node;
14279 /* From now on, we know that op if a variable and that it has a
14280 valid wfl. We use wfl_op to locate errors related to the
14282 if (!JNUMERIC_TYPE_P (op_type))
14284 parse_error_context
14285 (wfl_op, "Invalid argument type `%s' to `%s'",
14286 lang_printable_name (op_type, 0), operator_string (node));
14287 TREE_TYPE (node) = error_mark_node;
14292 /* Before the addition, binary numeric promotion is performed on
14293 both operands, if really necessary */
14294 if (JINTEGRAL_TYPE_P (op_type))
14296 value = build_int_cst (op_type, 1);
14297 TREE_TYPE (node) = op_type;
14301 value = build_int_cst (NULL_TREE, 1);
14303 binary_numeric_promotion (op_type,
14304 TREE_TYPE (value), &op, &value);
14307 /* We remember we might be accessing an outer field */
14308 if (outer_field_flag)
14310 /* We re-generate an access to the field */
14311 value = build2 (PLUS_EXPR, TREE_TYPE (op),
14312 build_outer_field_access (wfl_op, decl), value);
14314 /* And we patch the original access$() into a write
14315 with plus_op as a rhs */
14316 return outer_field_access_fix (node, op, value);
14319 /* And write back into the node. */
14320 TREE_OPERAND (node, 0) = op;
14321 TREE_OPERAND (node, 1) = value;
14322 /* Convert the overall back into its original type, if
14323 necessary, and return */
14324 if (JINTEGRAL_TYPE_P (op_type))
14325 return fold (node);
14327 return fold (convert (op_type, node));
14331 /* 15.14.3 Unary Plus Operator + */
14332 case UNARY_PLUS_EXPR:
14333 /* 15.14.4 Unary Minus Operator - */
14335 if (!JNUMERIC_TYPE_P (op_type))
14337 ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op_type);
14338 TREE_TYPE (node) = error_mark_node;
14341 /* Unary numeric promotion is performed on operand */
14344 op = do_unary_numeric_promotion (op);
14345 prom_type = TREE_TYPE (op);
14346 if (code == UNARY_PLUS_EXPR)
14351 /* 15.14.5 Bitwise Complement Operator ~ */
14353 if (!JINTEGRAL_TYPE_P (op_type))
14355 ERROR_CAST_NEEDED_TO_INTEGRAL (wfl_operator, node, op_type);
14356 TREE_TYPE (node) = error_mark_node;
14361 op = do_unary_numeric_promotion (op);
14362 prom_type = TREE_TYPE (op);
14366 /* 15.14.6 Logical Complement Operator ! */
14367 case TRUTH_NOT_EXPR:
14368 if (TREE_CODE (op_type) != BOOLEAN_TYPE)
14370 ERROR_CANT_CONVERT_TO_BOOLEAN (wfl_operator, node, op_type);
14371 /* But the type is known. We will report an error if further
14372 attempt of a assignment is made with this rhs */
14373 TREE_TYPE (node) = boolean_type_node;
14377 prom_type = boolean_type_node;
14380 /* 15.15 Cast Expression */
14382 value = patch_cast (node, wfl_operator);
14383 if (value == error_mark_node)
14385 /* If this cast is part of an assignment, we tell the code
14386 that deals with it not to complain about a mismatch,
14387 because things have been cast, anyways */
14388 TREE_TYPE (node) = error_mark_node;
14393 value = fold (value);
14400 return error_mark_node;
14402 /* There are cases where node has been replaced by something else
14403 and we don't end up returning here: UNARY_PLUS_EXPR,
14404 CONVERT_EXPR, {POST,PRE}{INCR,DECR}EMENT_EXPR. */
14405 TREE_OPERAND (node, 0) = fold (op);
14406 TREE_TYPE (node) = prom_type;
14407 TREE_SIDE_EFFECTS (node) = TREE_SIDE_EFFECTS (op);
14408 return fold (node);
14411 /* Generic type resolution that sometimes takes place during node
14412 patching. Returned the resolved type or generate an error
14413 message. Return the resolved type or NULL_TREE. */
14416 resolve_type_during_patch (tree type)
14418 if (unresolved_type_p (type, NULL))
14420 tree type_decl = resolve_and_layout (EXPR_WFL_NODE (type), type);
14423 parse_error_context (type,
14424 "Class `%s' not found in type declaration",
14425 IDENTIFIER_POINTER (EXPR_WFL_NODE (type)));
14429 check_deprecation (type, type_decl);
14431 return TREE_TYPE (type_decl);
14436 /* 5.5 Casting Conversion. error_mark_node is returned if an error is
14437 found. Otherwise NODE or something meant to replace it is returned. */
14440 patch_cast (tree node, tree wfl_op)
14442 tree op = TREE_OPERAND (node, 0);
14443 tree cast_type = TREE_TYPE (node);
14444 tree patched, op_type;
14447 /* Some string patching might be necessary at this stage */
14448 if ((patched = patch_string (op)))
14449 TREE_OPERAND (node, 0) = op = patched;
14450 op_type = TREE_TYPE (op);
14452 /* First resolve OP_TYPE if unresolved */
14453 if (!(cast_type = resolve_type_during_patch (cast_type)))
14454 return error_mark_node;
14456 /* Check on cast that are proven correct at compile time */
14457 if (JNUMERIC_TYPE_P (cast_type) && JNUMERIC_TYPE_P (op_type))
14460 if (cast_type == op_type)
14463 /* A narrowing conversion from a floating-point number to an
14464 integral type requires special handling (5.1.3). */
14465 if (JFLOAT_TYPE_P (op_type) && JINTEGRAL_TYPE_P (cast_type))
14466 if (cast_type != long_type_node)
14467 op = convert (integer_type_node, op);
14469 /* Try widening/narrowing conversion. Potentially, things need
14470 to be worked out in gcc so we implement the extreme cases
14471 correctly. fold_convert() needs to be fixed. */
14472 return convert (cast_type, op);
14475 /* It's also valid to cast a boolean into a boolean */
14476 if (op_type == boolean_type_node && cast_type == boolean_type_node)
14479 /* null can be casted to references */
14480 if (op == null_pointer_node && JREFERENCE_TYPE_P (cast_type))
14481 return build_null_of_type (cast_type);
14483 /* The remaining legal casts involve conversion between reference
14484 types. Check for their compile time correctness. */
14485 if (JREFERENCE_TYPE_P (op_type) && JREFERENCE_TYPE_P (cast_type)
14486 && valid_ref_assignconv_cast_p (op_type, cast_type, 1))
14488 TREE_TYPE (node) = promote_type (cast_type);
14489 /* Now, the case can be determined correct at compile time if
14490 OP_TYPE can be converted into CAST_TYPE by assignment
14491 conversion (5.2) */
14493 if (valid_ref_assignconv_cast_p (op_type, cast_type, 0))
14495 TREE_SET_CODE (node, NOP_EXPR);
14499 if (flag_emit_class_files)
14501 TREE_SET_CODE (node, CONVERT_EXPR);
14505 /* The cast requires a run-time check */
14506 return build3 (CALL_EXPR, promote_type (cast_type),
14507 build_address_of (soft_checkcast_node),
14508 tree_cons (NULL_TREE, build_class_ref (cast_type),
14509 build_tree_list (NULL_TREE, op)),
14513 /* Any other casts are proven incorrect at compile time */
14514 t1 = xstrdup (lang_printable_name (op_type, 0));
14515 parse_error_context (wfl_op, "Invalid cast from `%s' to `%s'",
14516 t1, lang_printable_name (cast_type, 0));
14518 return error_mark_node;
14521 /* Build a null constant and give it the type TYPE. */
14524 build_null_of_type (tree type)
14526 tree node = build_int_cst (promote_type (type), 0);
14530 /* Build an ARRAY_REF incomplete tree node. Note that operand 1 isn't
14531 a list of indices. */
14533 build_array_ref (int location, tree array, tree index)
14535 tree node = build4 (ARRAY_REF, NULL_TREE, array, index,
14536 NULL_TREE, NULL_TREE);
14537 EXPR_WFL_LINECOL (node) = location;
14541 /* 15.12 Array Access Expression */
14544 patch_array_ref (tree node)
14546 tree array = TREE_OPERAND (node, 0);
14547 tree array_type = TREE_TYPE (array);
14548 tree index = TREE_OPERAND (node, 1);
14549 tree index_type = TREE_TYPE (index);
14550 int error_found = 0;
14552 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
14554 if (TREE_CODE (array_type) == POINTER_TYPE)
14555 array_type = TREE_TYPE (array_type);
14557 /* The array reference must be an array */
14558 if (!TYPE_ARRAY_P (array_type))
14560 parse_error_context
14562 "`[]' can only be applied to arrays. It can't be applied to `%s'",
14563 lang_printable_name (array_type, 0));
14564 TREE_TYPE (node) = error_mark_node;
14568 /* The array index undergoes unary numeric promotion. The promoted
14569 type must be int */
14570 index = do_unary_numeric_promotion (index);
14571 if (TREE_TYPE (index) != int_type_node)
14573 if (valid_cast_to_p (index_type, int_type_node))
14574 parse_error_context (wfl_operator,
14575 "Incompatible type for `[]'. Explicit cast needed to convert `%s' to `int'",
14576 lang_printable_name (index_type, 0));
14578 parse_error_context (wfl_operator,
14579 "Incompatible type for `[]'. Can't convert `%s' to `int'",
14580 lang_printable_name (index_type, 0));
14581 TREE_TYPE (node) = error_mark_node;
14586 return error_mark_node;
14588 array_type = TYPE_ARRAY_ELEMENT (array_type);
14590 if (flag_emit_class_files || flag_emit_xref)
14592 TREE_OPERAND (node, 0) = array;
14593 TREE_OPERAND (node, 1) = index;
14596 node = build_java_arrayaccess (array, array_type, index);
14597 TREE_TYPE (node) = array_type;
14601 /* 15.9 Array Creation Expressions */
14604 build_newarray_node (tree type, tree dims, int extra_dims)
14606 tree node = build3 (NEW_ARRAY_EXPR, NULL_TREE, type,
14608 build_int_cst (NULL_TREE, extra_dims));
14613 patch_newarray (tree node)
14615 tree type = TREE_OPERAND (node, 0);
14616 tree dims = TREE_OPERAND (node, 1);
14617 tree cdim, array_type;
14618 int error_found = 0;
14620 int xdims = TREE_INT_CST_LOW (TREE_OPERAND (node, 2));
14622 /* Dimension types are verified. It's better for the types to be
14623 verified in order. */
14624 for (cdim = dims, ndims = 0; cdim; cdim = TREE_CHAIN (cdim), ndims++ )
14627 tree dim = TREE_VALUE (cdim);
14629 /* Dim might have been saved during its evaluation */
14630 dim = (TREE_CODE (dim) == SAVE_EXPR ? TREE_OPERAND (dim, 0) : dim);
14632 /* The type of each specified dimension must be an integral type. */
14633 if (!JINTEGRAL_TYPE_P (TREE_TYPE (dim)))
14636 /* Each expression undergoes an unary numeric promotion (5.6.1) and the
14637 promoted type must be int. */
14640 dim = do_unary_numeric_promotion (dim);
14641 if (TREE_TYPE (dim) != int_type_node)
14645 /* Report errors on types here */
14648 parse_error_context
14649 (TREE_PURPOSE (cdim),
14650 "Incompatible type for dimension in array creation expression. %s convert `%s' to `int'",
14651 (valid_cast_to_p (TREE_TYPE (dim), int_type_node) ?
14652 "Explicit cast needed to" : "Can't"),
14653 lang_printable_name (TREE_TYPE (dim), 0));
14657 TREE_PURPOSE (cdim) = NULL_TREE;
14660 /* Resolve array base type if unresolved */
14661 if (!(type = resolve_type_during_patch (type)))
14666 /* We don't want further evaluation of this bogus array creation
14668 TREE_TYPE (node) = error_mark_node;
14669 return error_mark_node;
14672 /* Set array_type to the actual (promoted) array type of the result. */
14673 if (TREE_CODE (type) == RECORD_TYPE)
14674 type = build_pointer_type (type);
14675 while (--xdims >= 0)
14677 type = promote_type (build_java_array_type (type, -1));
14679 dims = nreverse (dims);
14681 for (cdim = dims; cdim; cdim = TREE_CHAIN (cdim))
14685 = build_java_array_type (type,
14686 TREE_CODE (cdim) == INTEGER_CST
14687 ? (HOST_WIDE_INT) TREE_INT_CST_LOW (cdim)
14689 array_type = promote_type (array_type);
14691 dims = nreverse (dims);
14693 /* The node is transformed into a function call. Things are done
14694 differently according to the number of dimensions. If the number
14695 of dimension is equal to 1, then the nature of the base type
14696 (primitive or not) matters. */
14698 return build_new_array (type, TREE_VALUE (dims));
14700 /* Can't reuse what's already written in expr.c because it uses the
14701 JVM stack representation. Provide a build_multianewarray. FIXME */
14702 return build3 (CALL_EXPR, array_type,
14703 build_address_of (soft_multianewarray_node),
14704 tree_cons (NULL_TREE,
14705 build_class_ref (TREE_TYPE (array_type)),
14706 tree_cons (NULL_TREE,
14707 build_int_cst (NULL_TREE, ndims),
14712 /* 10.6 Array initializer. */
14714 /* Build a wfl for array element that don't have one, so we can
14715 pin-point errors. */
14718 maybe_build_array_element_wfl (tree node)
14720 if (TREE_CODE (node) != EXPR_WITH_FILE_LOCATION)
14722 /* FIXME - old code used "prev_lc.line" and "elc.prev_col */
14723 return build_expr_wfl (NULL_TREE,
14724 #ifdef USE_MAPPED_LOCATION
14728 ctxp->lexer->token_start.line,
14729 ctxp->lexer->token_start.col
14737 /* Build a NEW_ARRAY_INIT that features a CONSTRUCTOR node. This makes
14738 identification of initialized arrays easier to detect during walk
14742 build_new_array_init (int location, tree values)
14744 tree constructor = build_constructor (NULL_TREE, values);
14745 tree to_return = build1 (NEW_ARRAY_INIT, NULL_TREE, constructor);
14746 EXPR_WFL_LINECOL (to_return) = location;
14750 /* Expand a NEW_ARRAY_INIT node. Return error_mark_node if an error
14751 occurred. Otherwise return NODE after having set its type
14755 patch_new_array_init (tree type, tree node)
14757 int error_seen = 0;
14758 tree current, element_type;
14759 HOST_WIDE_INT length;
14760 int all_constant = 1;
14761 tree init = TREE_OPERAND (node, 0);
14763 if (TREE_CODE (type) != POINTER_TYPE || ! TYPE_ARRAY_P (TREE_TYPE (type)))
14765 parse_error_context (node,
14766 "Invalid array initializer for non-array type `%s'",
14767 lang_printable_name (type, 1));
14768 return error_mark_node;
14770 type = TREE_TYPE (type);
14771 element_type = TYPE_ARRAY_ELEMENT (type);
14773 CONSTRUCTOR_ELTS (init) = nreverse (CONSTRUCTOR_ELTS (init));
14775 for (length = 0, current = CONSTRUCTOR_ELTS (init);
14776 current; length++, current = TREE_CHAIN (current))
14778 tree elt = TREE_VALUE (current);
14779 if (elt == NULL_TREE || TREE_CODE (elt) != NEW_ARRAY_INIT)
14781 error_seen |= array_constructor_check_entry (element_type, current);
14782 elt = TREE_VALUE (current);
14783 /* When compiling to native code, STRING_CST is converted to
14784 INDIRECT_REF, but still with a TREE_CONSTANT flag. */
14785 if (! TREE_CONSTANT (elt) || TREE_CODE (elt) == INDIRECT_REF)
14790 TREE_VALUE (current) = patch_new_array_init (element_type, elt);
14791 TREE_PURPOSE (current) = NULL_TREE;
14794 if (elt && TREE_CODE (elt) == TREE_LIST
14795 && TREE_VALUE (elt) == error_mark_node)
14800 return error_mark_node;
14802 /* Create a new type. We can't reuse the one we have here by
14803 patching its dimension because it originally is of dimension -1
14804 hence reused by gcc. This would prevent triangular arrays. */
14805 type = build_java_array_type (element_type, length);
14806 TREE_TYPE (init) = TREE_TYPE (TREE_CHAIN (TREE_CHAIN (TYPE_FIELDS (type))));
14807 TREE_TYPE (node) = promote_type (type);
14808 TREE_CONSTANT (init) = all_constant;
14809 TREE_INVARIANT (init) = all_constant;
14810 TREE_CONSTANT (node) = all_constant;
14811 TREE_INVARIANT (node) = all_constant;
14815 /* Verify that one entry of the initializer element list can be
14816 assigned to the array base type. Report 1 if an error occurred, 0
14820 array_constructor_check_entry (tree type, tree entry)
14822 char *array_type_string = NULL; /* For error reports */
14823 tree value, type_value, new_value, wfl_value, patched;
14824 int error_seen = 0;
14826 new_value = NULL_TREE;
14827 wfl_value = TREE_VALUE (entry);
14829 value = java_complete_tree (TREE_VALUE (entry));
14830 /* patch_string return error_mark_node if arg is error_mark_node */
14831 if ((patched = patch_string (value)))
14833 if (value == error_mark_node)
14836 type_value = TREE_TYPE (value);
14838 /* At anytime, try_builtin_assignconv can report a warning on
14839 constant overflow during narrowing. */
14840 SET_WFL_OPERATOR (wfl_operator, TREE_PURPOSE (entry), wfl_value);
14841 new_value = try_builtin_assignconv (wfl_operator, type, value);
14842 if (!new_value && (new_value = try_reference_assignconv (type, value)))
14843 type_value = promote_type (type);
14845 /* Check and report errors */
14848 const char *const msg = (!valid_cast_to_p (type_value, type) ?
14849 "Can't" : "Explicit cast needed to");
14850 if (!array_type_string)
14851 array_type_string = xstrdup (lang_printable_name (type, 1));
14852 parse_error_context
14853 (wfl_operator, "Incompatible type for array. %s convert `%s' to `%s'",
14854 msg, lang_printable_name (type_value, 1), array_type_string);
14859 TREE_VALUE (entry) = new_value;
14861 if (array_type_string)
14862 free (array_type_string);
14864 TREE_PURPOSE (entry) = NULL_TREE;
14869 build_this (int location)
14871 tree node = build_wfl_node (this_identifier_node);
14872 TREE_SET_CODE (node, THIS_EXPR);
14873 EXPR_WFL_LINECOL (node) = location;
14877 /* 14.15 The return statement. It builds a modify expression that
14878 assigns the returned value to the RESULT_DECL that hold the value
14882 build_return (int location, tree op)
14884 tree node = build1 (RETURN_EXPR, NULL_TREE, op);
14885 EXPR_WFL_LINECOL (node) = location;
14886 node = build_debugable_stmt (location, node);
14891 patch_return (tree node)
14893 tree return_exp = TREE_OPERAND (node, 0);
14894 tree meth = current_function_decl;
14895 tree mtype = TREE_TYPE (TREE_TYPE (current_function_decl));
14896 int error_found = 0;
14898 TREE_TYPE (node) = error_mark_node;
14899 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
14901 /* It's invalid to have a return value within a function that is
14902 declared with the keyword void or that is a constructor */
14903 if (return_exp && (mtype == void_type_node || DECL_CONSTRUCTOR_P (meth)))
14906 /* It's invalid to use a return statement in a static block */
14907 if (DECL_CLINIT_P (current_function_decl))
14910 /* It's invalid to have a no return value within a function that
14911 isn't declared with the keyword `void' */
14912 if (!return_exp && (mtype != void_type_node && !DECL_CONSTRUCTOR_P (meth)))
14915 if (DECL_INSTINIT_P (current_function_decl))
14920 if (DECL_INSTINIT_P (current_function_decl))
14921 parse_error_context (wfl_operator,
14922 "`return' inside instance initializer");
14924 else if (DECL_CLINIT_P (current_function_decl))
14925 parse_error_context (wfl_operator,
14926 "`return' inside static initializer");
14928 else if (!DECL_CONSTRUCTOR_P (meth))
14930 char *t = xstrdup (lang_printable_name (mtype, 0));
14931 parse_error_context (wfl_operator,
14932 "`return' with%s value from `%s %s'",
14933 (error_found == 1 ? "" : "out"),
14934 t, lang_printable_name (meth, 2));
14938 parse_error_context (wfl_operator,
14939 "`return' with value from constructor `%s'",
14940 lang_printable_name (meth, 2));
14941 return error_mark_node;
14944 /* If we have a return_exp, build a modify expression and expand
14945 it. Note: at that point, the assignment is declared valid, but we
14946 may want to carry some more hacks */
14949 tree exp = java_complete_tree (return_exp);
14950 tree modify, patched;
14952 if ((patched = patch_string (exp)))
14955 modify = build2 (MODIFY_EXPR, NULL_TREE, DECL_RESULT (meth), exp);
14956 EXPR_WFL_LINECOL (modify) = EXPR_WFL_LINECOL (node);
14957 modify = java_complete_tree (modify);
14959 if (modify != error_mark_node)
14961 TREE_SIDE_EFFECTS (modify) = 1;
14962 TREE_OPERAND (node, 0) = modify;
14965 return error_mark_node;
14967 TREE_TYPE (node) = void_type_node;
14968 TREE_SIDE_EFFECTS (node) = 1;
14972 /* 14.8 The if Statement */
14975 build_if_else_statement (int location, tree expression, tree if_body,
14980 else_body = build_java_empty_stmt ();
14981 node = build3 (COND_EXPR, NULL_TREE, expression, if_body, else_body);
14982 EXPR_WFL_LINECOL (node) = location;
14983 node = build_debugable_stmt (location, node);
14988 patch_if_else_statement (tree node)
14990 tree expression = TREE_OPERAND (node, 0);
14991 int can_complete_normally
14992 = (CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 1))
14993 | CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 2)));
14995 TREE_TYPE (node) = error_mark_node;
14996 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
14998 /* The type of expression must be boolean */
14999 if (TREE_TYPE (expression) != boolean_type_node
15000 && TREE_TYPE (expression) != promoted_boolean_type_node)
15002 parse_error_context
15004 "Incompatible type for `if'. Can't convert `%s' to `boolean'",
15005 lang_printable_name (TREE_TYPE (expression), 0));
15006 return error_mark_node;
15009 TREE_TYPE (node) = void_type_node;
15010 TREE_SIDE_EFFECTS (node) = 1;
15011 CAN_COMPLETE_NORMALLY (node) = can_complete_normally;
15015 /* 14.6 Labeled Statements */
15017 /* Action taken when a labeled statement is parsed. a new
15018 LABELED_BLOCK_EXPR is created. No statement is attached to the
15019 label, yet. LABEL can be NULL_TREE for artificially-generated blocks. */
15022 build_labeled_block (int location, tree label)
15025 tree label_decl, node;
15026 if (label == NULL_TREE || label == continue_identifier_node)
15027 label_name = label;
15030 label_name = merge_qualified_name (label_id, label);
15031 /* Issue an error if we try to reuse a label that was previously
15033 if (IDENTIFIER_LOCAL_VALUE (label_name))
15035 EXPR_WFL_LINECOL (wfl_operator) = location;
15036 parse_error_context (wfl_operator,
15037 "Declaration of `%s' shadows a previous label declaration",
15038 IDENTIFIER_POINTER (label));
15039 EXPR_WFL_LINECOL (wfl_operator) =
15040 EXPR_WFL_LINECOL (IDENTIFIER_LOCAL_VALUE (label_name));
15041 parse_error_context (wfl_operator,
15042 "This is the location of the previous declaration of label `%s'",
15043 IDENTIFIER_POINTER (label));
15044 java_error_count--;
15048 label_decl = create_label_decl (label_name);
15049 node = build2 (LABELED_BLOCK_EXPR, NULL_TREE, label_decl, NULL_TREE);
15050 EXPR_WFL_LINECOL (node) = location;
15051 TREE_SIDE_EFFECTS (node) = 1;
15055 /* A labeled statement LBE is attached a statement. */
15058 finish_labeled_statement (tree lbe, /* Labeled block expr */
15061 /* In anyways, tie the loop to its statement */
15062 LABELED_BLOCK_BODY (lbe) = statement;
15063 pop_labeled_block ();
15064 POP_LABELED_BLOCK ();
15068 /* 14.10, 14.11, 14.12 Loop Statements */
15070 /* Create an empty LOOP_EXPR and make it the last in the nested loop
15074 build_new_loop (tree loop_body)
15076 tree loop = build1 (LOOP_EXPR, NULL_TREE, loop_body);
15077 TREE_SIDE_EFFECTS (loop) = 1;
15082 /* Create a loop body according to the following structure:
15084 COMPOUND_EXPR (loop main body)
15085 EXIT_EXPR (this order is for while/for loops.
15086 LABELED_BLOCK_EXPR the order is reversed for do loops)
15087 LABEL_DECL (a continue occurring here branches at the
15088 BODY end of this labeled block)
15091 REVERSED, if nonzero, tells that the loop condition expr comes
15092 after the body, like in the do-while loop.
15094 To obtain a loop, the loop body structure described above is
15095 encapsulated within a LOOP_EXPR surrounded by a LABELED_BLOCK_EXPR:
15098 LABEL_DECL (use this label to exit the loop)
15100 <structure described above> */
15103 build_loop_body (int location, tree condition, int reversed)
15105 tree first, second, body;
15107 condition = build1 (EXIT_EXPR, NULL_TREE, condition); /* Force walk */
15108 EXPR_WFL_LINECOL (condition) = location; /* For accurate error report */
15109 condition = build_debugable_stmt (location, condition);
15110 TREE_SIDE_EFFECTS (condition) = 1;
15112 body = build_labeled_block (0, continue_identifier_node);
15113 first = (reversed ? body : condition);
15114 second = (reversed ? condition : body);
15115 return build2 (COMPOUND_EXPR, NULL_TREE,
15116 build2 (COMPOUND_EXPR, NULL_TREE, first, second),
15117 build_java_empty_stmt ());
15120 /* Install CONDITION (if any) and loop BODY (using REVERSED to tell
15121 their order) on the current loop. Unlink the current loop from the
15125 finish_loop_body (int location, tree condition, tree body, int reversed)
15127 tree to_return = ctxp->current_loop;
15128 tree loop_body = LOOP_EXPR_BODY (to_return);
15131 tree cnode = LOOP_EXPR_BODY_CONDITION_EXPR (loop_body, reversed);
15132 /* We wrapped the EXIT_EXPR around a WFL so we can debug it.
15133 The real EXIT_EXPR is one operand further. */
15134 EXPR_WFL_LINECOL (cnode) = location;
15135 if (TREE_CODE (cnode) == EXPR_WITH_FILE_LOCATION)
15137 cnode = EXPR_WFL_NODE (cnode);
15138 /* This one is for accurate error reports */
15139 EXPR_WFL_LINECOL (cnode) = location;
15141 TREE_OPERAND (cnode, 0) = condition;
15143 LOOP_EXPR_BODY_BODY_EXPR (loop_body, reversed) = body;
15148 /* Tailored version of finish_loop_body for FOR loops, when FOR
15149 loops feature the condition part */
15152 finish_for_loop (int location, tree condition, tree update, tree body)
15154 /* Put the condition and the loop body in place */
15155 tree loop = finish_loop_body (location, condition, body, 0);
15156 /* LOOP is the current loop which has been now popped of the loop
15157 stack. Mark the update block as reachable and install it. We do
15158 this because the (current interpretation of the) JLS requires
15159 that the update expression be considered reachable even if the
15160 for loop's body doesn't complete normally. */
15161 if (update != NULL_TREE && !IS_EMPTY_STMT (update))
15164 if (TREE_CODE (up2) == EXPR_WITH_FILE_LOCATION)
15165 up2 = EXPR_WFL_NODE (up2);
15166 /* It is possible for the update expression to be an
15167 EXPR_WFL_NODE wrapping nothing. */
15168 if (up2 != NULL_TREE && !IS_EMPTY_STMT (up2))
15170 /* Try to detect constraint violations. These would be
15171 programming errors somewhere. */
15172 if (! EXPR_P (up2) || TREE_CODE (up2) == LOOP_EXPR)
15174 SUPPRESS_UNREACHABLE_ERROR (up2) = 1;
15177 LOOP_EXPR_BODY_UPDATE_BLOCK (LOOP_EXPR_BODY (loop)) = update;
15181 /* Try to find the loop a block might be related to. This comprises
15182 the case where the LOOP_EXPR is found as the second operand of a
15183 COMPOUND_EXPR, because the loop happens to have an initialization
15184 part, then expressed as the first operand of the COMPOUND_EXPR. If
15185 the search finds something, 1 is returned. Otherwise, 0 is
15186 returned. The search is assumed to start from a
15187 LABELED_BLOCK_EXPR's block. */
15190 search_loop (tree statement)
15192 if (TREE_CODE (statement) == LOOP_EXPR)
15195 if (TREE_CODE (statement) == BLOCK)
15196 statement = BLOCK_SUBBLOCKS (statement);
15200 if (statement && TREE_CODE (statement) == COMPOUND_EXPR)
15201 while (statement && TREE_CODE (statement) == COMPOUND_EXPR)
15202 statement = TREE_OPERAND (statement, 1);
15204 return (TREE_CODE (statement) == LOOP_EXPR
15205 && FOR_LOOP_P (statement) ? statement : NULL_TREE);
15208 /* Return 1 if LOOP can be found in the labeled block BLOCK. 0 is
15209 returned otherwise. */
15212 labeled_block_contains_loop_p (tree block, tree loop)
15217 if (LABELED_BLOCK_BODY (block) == loop)
15220 if (FOR_LOOP_P (loop) && search_loop (LABELED_BLOCK_BODY (block)) == loop)
15226 /* If the loop isn't surrounded by a labeled statement, create one and
15227 insert LOOP as its body. */
15230 patch_loop_statement (tree loop)
15234 TREE_TYPE (loop) = void_type_node;
15235 if (labeled_block_contains_loop_p (ctxp->current_labeled_block, loop))
15238 loop_label = build_labeled_block (0, NULL_TREE);
15239 /* LOOP is an EXPR node, so it should have a valid EXPR_WFL_LINECOL
15240 that LOOP_LABEL could enquire about, for a better accuracy. FIXME */
15241 LABELED_BLOCK_BODY (loop_label) = loop;
15242 PUSH_LABELED_BLOCK (loop_label);
15246 /* 14.13, 14.14: break and continue Statements */
15248 /* Build a break or a continue statement. a null NAME indicates an
15249 unlabeled break/continue statement. */
15252 build_bc_statement (int location, int is_break, tree name)
15254 tree break_continue, label_block_expr = NULL_TREE;
15258 if (!(label_block_expr = IDENTIFIER_LOCAL_VALUE
15259 (merge_qualified_name (label_id, EXPR_WFL_NODE (name)))))
15260 /* Null means that we don't have a target for this named
15261 break/continue. In this case, we make the target to be the
15262 label name, so that the error can be reported accurately in
15263 patch_bc_statement. */
15264 label_block_expr = EXPR_WFL_NODE (name);
15266 /* Unlabeled break/continue will be handled during the
15267 break/continue patch operation */
15268 break_continue = build2 (EXIT_BLOCK_EXPR, NULL_TREE,
15269 label_block_expr, NULL_TREE);
15271 IS_BREAK_STMT_P (break_continue) = is_break;
15272 TREE_SIDE_EFFECTS (break_continue) = 1;
15273 EXPR_WFL_LINECOL (break_continue) = location;
15274 break_continue = build_debugable_stmt (location, break_continue);
15275 return break_continue;
15278 /* Verification of a break/continue statement. */
15281 patch_bc_statement (tree node)
15283 tree bc_label = EXIT_BLOCK_LABELED_BLOCK (node), target_stmt;
15284 tree labeled_block = ctxp->current_labeled_block;
15285 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
15287 /* Having an identifier here means that the target is unknown. */
15288 if (bc_label != NULL_TREE && TREE_CODE (bc_label) == IDENTIFIER_NODE)
15290 parse_error_context (wfl_operator, "No label definition found for `%s'",
15291 IDENTIFIER_POINTER (bc_label));
15292 return error_mark_node;
15294 if (! IS_BREAK_STMT_P (node))
15296 /* It's a continue statement. */
15297 for (;; labeled_block = TREE_CHAIN (labeled_block))
15299 if (labeled_block == NULL_TREE)
15301 if (bc_label == NULL_TREE)
15302 parse_error_context (wfl_operator,
15303 "`continue' must be in loop");
15305 parse_error_context
15306 (wfl_operator, "continue label `%s' does not name a loop",
15307 IDENTIFIER_POINTER (bc_label));
15308 return error_mark_node;
15310 if ((DECL_NAME (LABELED_BLOCK_LABEL (labeled_block))
15311 == continue_identifier_node)
15312 && (bc_label == NULL_TREE
15313 || TREE_CHAIN (labeled_block) == bc_label))
15315 bc_label = labeled_block;
15320 else if (!bc_label)
15322 for (;; labeled_block = TREE_CHAIN (labeled_block))
15324 if (labeled_block == NULL_TREE)
15326 parse_error_context (wfl_operator,
15327 "`break' must be in loop or switch");
15328 return error_mark_node;
15330 target_stmt = LABELED_BLOCK_BODY (labeled_block);
15331 if (TREE_CODE (target_stmt) == SWITCH_EXPR
15332 || search_loop (target_stmt))
15334 bc_label = labeled_block;
15340 EXIT_BLOCK_LABELED_BLOCK (node) = bc_label;
15341 CAN_COMPLETE_NORMALLY (bc_label) = 1;
15343 /* Our break/continue don't return values. */
15344 TREE_TYPE (node) = void_type_node;
15345 /* Encapsulate the break within a compound statement so that it's
15346 expanded all the times by expand_expr (and not clobbered
15347 sometimes, like after a if statement) */
15348 node = add_stmt_to_compound (NULL_TREE, void_type_node, node);
15349 TREE_SIDE_EFFECTS (node) = 1;
15353 /* Process the exit expression belonging to a loop. Its type must be
15357 patch_exit_expr (tree node)
15359 tree expression = TREE_OPERAND (node, 0);
15360 TREE_TYPE (node) = error_mark_node;
15361 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
15363 /* The type of expression must be boolean */
15364 if (TREE_TYPE (expression) != boolean_type_node)
15366 parse_error_context
15368 "Incompatible type for loop conditional. Can't convert `%s' to `boolean'",
15369 lang_printable_name (TREE_TYPE (expression), 0));
15370 return error_mark_node;
15372 /* Now we know things are allright, invert the condition, fold and
15374 TREE_OPERAND (node, 0) =
15375 fold (build1 (TRUTH_NOT_EXPR, boolean_type_node, expression));
15377 if (! integer_zerop (TREE_OPERAND (node, 0))
15378 && ctxp->current_loop != NULL_TREE
15379 && TREE_CODE (ctxp->current_loop) == LOOP_EXPR)
15380 CAN_COMPLETE_NORMALLY (ctxp->current_loop) = 1;
15381 if (! integer_onep (TREE_OPERAND (node, 0)))
15382 CAN_COMPLETE_NORMALLY (node) = 1;
15385 TREE_TYPE (node) = void_type_node;
15389 /* 14.9 Switch statement */
15392 patch_switch_statement (tree node)
15394 tree se = TREE_OPERAND (node, 0), se_type;
15397 /* Complete the switch expression */
15398 se = TREE_OPERAND (node, 0) = java_complete_tree (se);
15399 se_type = TREE_TYPE (se);
15400 /* The type of the switch expression must be char, byte, short or
15402 if (! JINTEGRAL_TYPE_P (se_type) || se_type == long_type_node)
15404 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
15405 parse_error_context (wfl_operator,
15406 "Incompatible type for `switch'. Can't convert `%s' to `int'",
15407 lang_printable_name (se_type, 0));
15408 /* This is what java_complete_tree will check */
15409 TREE_OPERAND (node, 0) = error_mark_node;
15410 return error_mark_node;
15413 /* Save and restore the outer case label list. */
15414 save = case_label_list;
15415 case_label_list = NULL_TREE;
15417 TREE_OPERAND (node, 1) = java_complete_tree (TREE_OPERAND (node, 1));
15419 /* See if we've found a duplicate label. We can't leave this until
15420 code generation, because in `--syntax-only' and `-C' modes we
15421 don't do ordinary code generation. */
15422 for (iter = case_label_list; iter != NULL_TREE; iter = TREE_CHAIN (iter))
15424 HOST_WIDE_INT val = TREE_INT_CST_LOW (TREE_VALUE (iter));
15426 for (subiter = TREE_CHAIN (iter);
15427 subiter != NULL_TREE;
15428 subiter = TREE_CHAIN (subiter))
15430 HOST_WIDE_INT subval = TREE_INT_CST_LOW (TREE_VALUE (subiter));
15433 EXPR_WFL_LINECOL (wfl_operator)
15434 = EXPR_WFL_LINECOL (TREE_PURPOSE (iter));
15435 /* The case_label_list is in reverse order, so print the
15436 outer label first. */
15437 parse_error_context (wfl_operator, "duplicate case label: `"
15438 HOST_WIDE_INT_PRINT_DEC "'", subval);
15439 EXPR_WFL_LINECOL (wfl_operator)
15440 = EXPR_WFL_LINECOL (TREE_PURPOSE (subiter));
15441 parse_error_context (wfl_operator, "original label is here");
15448 case_label_list = save;
15450 /* Ready to return */
15451 if (TREE_CODE (TREE_OPERAND (node, 1)) == ERROR_MARK)
15453 TREE_TYPE (node) = error_mark_node;
15454 return error_mark_node;
15456 TREE_TYPE (node) = void_type_node;
15457 TREE_SIDE_EFFECTS (node) = 1;
15458 CAN_COMPLETE_NORMALLY (node)
15459 = CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 1))
15460 || ! SWITCH_HAS_DEFAULT (node);
15466 /* Build an assertion expression for `assert CONDITION : VALUE'; VALUE
15467 might be NULL_TREE. */
15470 #ifdef USE_MAPPED_LOCATION
15471 source_location location,
15475 tree condition, tree value)
15478 tree klass = GET_CPC ();
15480 if (! enable_assertions (klass))
15482 condition = build2 (TRUTH_ANDIF_EXPR, NULL_TREE,
15483 boolean_false_node, condition);
15484 if (value == NULL_TREE)
15485 value = build_java_empty_stmt ();
15486 return build_if_else_statement (location, condition,
15490 if (! CLASS_USES_ASSERTIONS (klass))
15492 tree field, classdollar, id, call;
15493 tree class_type = TREE_TYPE (klass);
15495 field = add_field (class_type,
15496 get_identifier ("$assertionsDisabled"),
15498 ACC_PRIVATE | ACC_STATIC | ACC_FINAL);
15499 MAYBE_CREATE_VAR_LANG_DECL_SPECIFIC (field);
15500 FIELD_SYNTHETIC (field) = 1;
15502 classdollar = build_incomplete_class_ref (location, class_type);
15504 /* Call CLASS.desiredAssertionStatus(). */
15505 id = build_wfl_node (get_identifier ("desiredAssertionStatus"));
15506 call = build3 (CALL_EXPR, NULL_TREE, id, NULL_TREE, NULL_TREE);
15507 call = make_qualified_primary (classdollar, call, location);
15508 TREE_SIDE_EFFECTS (call) = 1;
15510 /* Invert to obtain !CLASS.desiredAssertionStatus(). This may
15511 seem odd, but we do it to generate code identical to that of
15513 call = build1 (TRUTH_NOT_EXPR, NULL_TREE, call);
15514 TREE_SIDE_EFFECTS (call) = 1;
15515 DECL_INITIAL (field) = call;
15517 /* Record the initializer in the initializer statement list. */
15518 call = build2 (MODIFY_EXPR, NULL_TREE, field, call);
15519 TREE_CHAIN (call) = CPC_STATIC_INITIALIZER_STMT (ctxp);
15520 SET_CPC_STATIC_INITIALIZER_STMT (ctxp, call);
15521 MODIFY_EXPR_FROM_INITIALIZATION_P (call) = 1;
15523 CLASS_USES_ASSERTIONS (klass) = 1;
15526 if (value != NULL_TREE)
15527 value = tree_cons (NULL_TREE, value, NULL_TREE);
15529 node = build_wfl_node (get_identifier ("java"));
15530 node = make_qualified_name (node, build_wfl_node (get_identifier ("lang")),
15532 node = make_qualified_name (node, build_wfl_node (get_identifier ("AssertionError")),
15535 node = build3 (NEW_CLASS_EXPR, NULL_TREE, node, value, NULL_TREE);
15536 TREE_SIDE_EFFECTS (node) = 1;
15537 /* It is too early to use BUILD_THROW. */
15538 node = build1 (THROW_EXPR, NULL_TREE, node);
15539 TREE_SIDE_EFFECTS (node) = 1;
15541 /* We invert the condition; if we just put NODE as the `else' part
15542 then we generate weird-looking bytecode. */
15543 condition = build1 (TRUTH_NOT_EXPR, NULL_TREE, condition);
15544 /* Check $assertionsDisabled. */
15546 = build2 (TRUTH_ANDIF_EXPR, NULL_TREE,
15547 build1 (TRUTH_NOT_EXPR, NULL_TREE,
15548 build_wfl_node (get_identifier ("$assertionsDisabled"))),
15550 node = build_if_else_statement (location, condition, node, NULL_TREE);
15554 /* 14.18 The try/catch statements */
15556 /* Encapsulate TRY_STMTS' in a try catch sequence. The catch clause
15557 catches TYPE and executes CATCH_STMTS. */
15560 encapsulate_with_try_catch (int location, tree type_or_name, tree try_stmts,
15563 tree try_block, catch_clause_param, catch_block, catch;
15565 /* First build a try block */
15566 try_block = build_expr_block (try_stmts, NULL_TREE);
15568 /* Build a catch block: we need a catch clause parameter */
15569 if (TREE_CODE (type_or_name) == EXPR_WITH_FILE_LOCATION)
15571 tree catch_type = obtain_incomplete_type (type_or_name);
15573 catch_clause_param = build_decl (VAR_DECL, wpv_id, catch_type);
15574 register_incomplete_type (JDEP_VARIABLE, type_or_name,
15575 catch_clause_param, catch_type);
15576 dep = CLASSD_LAST (ctxp->classd_list);
15577 JDEP_GET_PATCH (dep) = &TREE_TYPE (catch_clause_param);
15580 catch_clause_param = build_decl (VAR_DECL, wpv_id,
15581 build_pointer_type (type_or_name));
15584 catch_block = build_expr_block (NULL_TREE, catch_clause_param);
15586 /* Initialize the variable and store in the block */
15587 catch = build2 (MODIFY_EXPR, NULL_TREE, catch_clause_param,
15588 build0 (JAVA_EXC_OBJ_EXPR, ptr_type_node));
15589 add_stmt_to_block (catch_block, NULL_TREE, catch);
15591 /* Add the catch statements */
15592 add_stmt_to_block (catch_block, NULL_TREE, catch_stmts);
15594 /* Now we can build a JAVA_CATCH_EXPR */
15595 catch_block = build1 (JAVA_CATCH_EXPR, NULL_TREE, catch_block);
15597 return build_try_statement (location, try_block, catch_block);
15601 build_try_statement (int location, tree try_block, tree catches)
15603 tree node = build2 (TRY_EXPR, NULL_TREE, try_block, catches);
15604 EXPR_WFL_LINECOL (node) = location;
15609 build_try_finally_statement (int location, tree try_block, tree finally)
15611 tree node = build2 (TRY_FINALLY_EXPR, NULL_TREE, try_block, finally);
15612 EXPR_WFL_LINECOL (node) = location;
15617 patch_try_statement (tree node)
15619 int error_found = 0;
15620 tree try = TREE_OPERAND (node, 0);
15621 /* Exception handlers are considered in left to right order */
15622 tree catch = nreverse (TREE_OPERAND (node, 1));
15623 tree current, caught_type_list = NULL_TREE;
15625 /* Check catch clauses, if any. Every time we find an error, we try
15626 to process the next catch clause. We process the catch clause before
15627 the try block so that when processing the try block we can check thrown
15628 exceptions against the caught type list. */
15629 for (current = catch; current; current = TREE_CHAIN (current))
15631 tree carg_decl, carg_type;
15632 tree sub_current, catch_block, catch_clause;
15635 /* At this point, the structure of the catch clause is
15636 JAVA_CATCH_EXPR (catch node)
15637 BLOCK (with the decl of the parameter)
15639 MODIFY_EXPR (assignment of the catch parameter)
15640 BLOCK (catch clause block)
15642 catch_clause = TREE_OPERAND (current, 0);
15643 carg_decl = BLOCK_EXPR_DECLS (catch_clause);
15644 carg_type = TREE_TYPE (TREE_TYPE (carg_decl));
15646 /* Catch clauses can't have more than one parameter declared,
15647 but it's already enforced by the grammar. Make sure that the
15648 only parameter of the clause statement in of class Throwable
15649 or a subclass of Throwable, but that was done earlier. The
15650 catch clause parameter type has also been resolved. */
15652 /* Just make sure that the catch clause parameter type inherits
15653 from java.lang.Throwable */
15654 if (!inherits_from_p (carg_type, throwable_type_node))
15656 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (current);
15657 parse_error_context (wfl_operator,
15658 "Can't catch class `%s'. Catch clause parameter type must be a subclass of class `java.lang.Throwable'",
15659 lang_printable_name (carg_type, 0));
15664 /* Partial check for unreachable catch statement: The catch
15665 clause is reachable iff is no earlier catch block A in
15666 the try statement such that the type of the catch
15667 clause's parameter is the same as or a subclass of the
15668 type of A's parameter */
15670 for (sub_current = catch;
15671 sub_current != current; sub_current = TREE_CHAIN (sub_current))
15673 tree sub_catch_clause, decl;
15674 sub_catch_clause = TREE_OPERAND (sub_current, 0);
15675 decl = BLOCK_EXPR_DECLS (sub_catch_clause);
15677 if (inherits_from_p (carg_type, TREE_TYPE (TREE_TYPE (decl))))
15679 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (current);
15680 parse_error_context
15682 "`catch' not reached because of the catch clause at line %d",
15683 EXPR_WFL_LINENO (sub_current));
15684 unreachable = error_found = 1;
15688 /* Complete the catch clause block */
15689 catch_block = java_complete_tree (TREE_OPERAND (current, 0));
15690 if (catch_block == error_mark_node)
15695 if (CAN_COMPLETE_NORMALLY (catch_block))
15696 CAN_COMPLETE_NORMALLY (node) = 1;
15697 TREE_OPERAND (current, 0) = catch_block;
15702 /* Things to do here: the exception must be thrown */
15704 /* Link this type to the caught type list */
15705 caught_type_list = tree_cons (NULL_TREE, carg_type, caught_type_list);
15708 PUSH_EXCEPTIONS (caught_type_list);
15709 if ((try = java_complete_tree (try)) == error_mark_node)
15711 if (CAN_COMPLETE_NORMALLY (try))
15712 CAN_COMPLETE_NORMALLY (node) = 1;
15715 /* Verification ends here */
15717 return error_mark_node;
15719 TREE_OPERAND (node, 0) = try;
15720 TREE_OPERAND (node, 1) = catch;
15721 TREE_TYPE (node) = void_type_node;
15725 /* 14.17 The synchronized Statement */
15728 patch_synchronized_statement (tree node, tree wfl_op1)
15730 tree expr = java_complete_tree (TREE_OPERAND (node, 0));
15731 tree block = TREE_OPERAND (node, 1);
15733 tree tmp, enter, exit, expr_decl, assignment;
15735 if (expr == error_mark_node)
15737 block = java_complete_tree (block);
15741 /* We might be trying to synchronize on a STRING_CST */
15742 if ((tmp = patch_string (expr)))
15745 /* The TYPE of expr must be a reference type */
15746 if (!JREFERENCE_TYPE_P (TREE_TYPE (expr)))
15748 SET_WFL_OPERATOR (wfl_operator, node, wfl_op1);
15749 parse_error_context (wfl_operator, "Incompatible type for `synchronized'. Can't convert `%s' to `java.lang.Object'",
15750 lang_printable_name (TREE_TYPE (expr), 0));
15751 return error_mark_node;
15754 if (flag_emit_xref)
15756 TREE_OPERAND (node, 0) = expr;
15757 TREE_OPERAND (node, 1) = java_complete_tree (block);
15758 CAN_COMPLETE_NORMALLY (node) = 1;
15762 /* Generate a try-finally for the synchronized statement, except
15763 that the handler that catches all throw exception calls
15764 _Jv_MonitorExit and then rethrow the exception.
15765 The synchronized statement is then implemented as:
15768 _Jv_MonitorEnter (expression)
15770 _Jv_MonitorExit (expression)
15774 e = _Jv_exception_info ();
15775 _Jv_MonitorExit (expression)
15779 expr_decl = build_decl (VAR_DECL, generate_name (), TREE_TYPE (expr));
15780 BUILD_MONITOR_ENTER (enter, expr_decl);
15781 BUILD_MONITOR_EXIT (exit, expr_decl);
15782 CAN_COMPLETE_NORMALLY (enter) = 1;
15783 CAN_COMPLETE_NORMALLY (exit) = 1;
15784 assignment = build2 (MODIFY_EXPR, NULL_TREE, expr_decl, expr);
15785 TREE_SIDE_EFFECTS (assignment) = 1;
15786 node = build2 (COMPOUND_EXPR, NULL_TREE,
15787 build2 (COMPOUND_EXPR, NULL_TREE, assignment, enter),
15788 build2 (TRY_FINALLY_EXPR, NULL_TREE, block, exit));
15789 node = build_expr_block (node, expr_decl);
15791 return java_complete_tree (node);
15794 /* 14.16 The throw Statement */
15797 patch_throw_statement (tree node, tree wfl_op1)
15799 tree expr = TREE_OPERAND (node, 0);
15800 tree type = TREE_TYPE (expr);
15801 int unchecked_ok = 0, tryblock_throws_ok = 0;
15803 /* Thrown expression must be assignable to java.lang.Throwable */
15804 if (!try_reference_assignconv (throwable_type_node, expr))
15806 SET_WFL_OPERATOR (wfl_operator, node, wfl_op1);
15807 parse_error_context (wfl_operator,
15808 "Can't throw `%s'; it must be a subclass of class `java.lang.Throwable'",
15809 lang_printable_name (type, 0));
15810 /* If the thrown expression was a reference, we further the
15811 compile-time check. */
15812 if (!JREFERENCE_TYPE_P (type))
15813 return error_mark_node;
15816 /* At least one of the following must be true */
15818 /* The type of the throw expression is a not checked exception,
15819 i.e. is a unchecked expression. */
15820 unchecked_ok = IS_UNCHECKED_EXCEPTION_P (TREE_TYPE (type));
15822 SET_WFL_OPERATOR (wfl_operator, node, wfl_op1);
15823 /* An instance can't throw a checked exception unless that exception
15824 is explicitly declared in the `throws' clause of each
15825 constructor. This doesn't apply to anonymous classes, since they
15826 don't have declared constructors. */
15828 && DECL_INSTINIT_P (current_function_decl)
15829 && !ANONYMOUS_CLASS_P (current_class))
15832 for (current = TYPE_METHODS (current_class); current;
15833 current = TREE_CHAIN (current))
15834 if (DECL_CONSTRUCTOR_P (current)
15835 && !check_thrown_exceptions_do (TREE_TYPE (expr)))
15837 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)",
15838 lang_printable_name (TREE_TYPE (expr), 0));
15839 return error_mark_node;
15843 /* Throw is contained in a try statement and at least one catch
15844 clause can receive the thrown expression or the current method is
15845 declared to throw such an exception. Or, the throw statement is
15846 contained in a method or constructor declaration and the type of
15847 the Expression is assignable to at least one type listed in the
15848 throws clause the declaration. */
15850 tryblock_throws_ok = check_thrown_exceptions_do (TREE_TYPE (expr));
15851 if (!(unchecked_ok || tryblock_throws_ok))
15853 /* If there is a surrounding try block that has no matching
15854 clatch clause, report it first. A surrounding try block exits
15855 only if there is something after the list of checked
15856 exception thrown by the current function (if any). */
15857 if (IN_TRY_BLOCK_P ())
15858 parse_error_context (wfl_operator, "Checked exception `%s' can't be caught by any of the catch clause(s) of the surrounding `try' block",
15859 lang_printable_name (type, 0));
15860 /* If we have no surrounding try statement and the method doesn't have
15861 any throws, report it now. FIXME */
15863 /* We report that the exception can't be throw from a try block
15864 in all circumstances but when the `throw' is inside a static
15866 else if (!EXCEPTIONS_P (currently_caught_type_list)
15867 && !tryblock_throws_ok)
15869 if (DECL_CLINIT_P (current_function_decl))
15870 parse_error_context (wfl_operator,
15871 "Checked exception `%s' can't be thrown in initializer",
15872 lang_printable_name (type, 0));
15874 parse_error_context (wfl_operator,
15875 "Checked exception `%s' isn't thrown from a `try' block",
15876 lang_printable_name (type, 0));
15878 /* Otherwise, the current method doesn't have the appropriate
15879 throws declaration */
15881 parse_error_context (wfl_operator, "Checked exception `%s' doesn't match any of current method's `throws' declaration(s)",
15882 lang_printable_name (type, 0));
15883 return error_mark_node;
15886 if (! flag_emit_class_files && ! flag_emit_xref)
15887 BUILD_THROW (node, expr);
15889 /* If doing xrefs, keep the location where the `throw' was seen. */
15890 if (flag_emit_xref)
15891 EXPR_WFL_LINECOL (node) = EXPR_WFL_LINECOL (wfl_op1);
15895 /* Check that exception said to be thrown by method DECL can be
15896 effectively caught from where DECL is invoked. THIS_EXPR is the
15897 expression that computes `this' for the method call. */
15899 check_thrown_exceptions (
15900 #ifdef USE_MAPPED_LOCATION
15901 source_location location,
15906 tree decl, tree this_expr)
15909 int is_array_call = 0;
15911 /* Skip check within generated methods, such as access$<n>. */
15912 if (OUTER_FIELD_ACCESS_IDENTIFIER_P (DECL_NAME (current_function_decl)))
15915 if (this_expr != NULL_TREE
15916 && TREE_CODE (TREE_TYPE (this_expr)) == POINTER_TYPE
15917 && TYPE_ARRAY_P (TREE_TYPE (TREE_TYPE (this_expr))))
15920 /* For all the unchecked exceptions thrown by DECL. */
15921 for (throws = DECL_FUNCTION_THROWS (decl); throws;
15922 throws = TREE_CHAIN (throws))
15923 if (!check_thrown_exceptions_do (TREE_VALUE (throws)))
15925 /* Suppress errors about cloning arrays. */
15926 if (is_array_call && DECL_NAME (decl) == get_identifier ("clone"))
15929 #ifdef USE_MAPPED_LOCATION
15930 SET_EXPR_LOCATION (wfl_operator, location);
15932 EXPR_WFL_LINECOL (wfl_operator) = location;
15934 if (DECL_FINIT_P (current_function_decl))
15935 parse_error_context
15936 (wfl_operator, "Exception `%s' can't be thrown in initializer",
15937 lang_printable_name (TREE_VALUE (throws), 0));
15940 parse_error_context
15941 (wfl_operator, "Exception `%s' must be caught, or it must be declared in the `throws' clause of `%s'",
15942 lang_printable_name (TREE_VALUE (throws), 0),
15943 (DECL_INIT_P (current_function_decl) ?
15944 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (current_class))) :
15945 IDENTIFIER_POINTER (DECL_NAME (current_function_decl))));
15950 /* Return 1 if checked EXCEPTION is caught at the current nesting level of
15951 try-catch blocks, OR is listed in the `throws' clause of the
15955 check_thrown_exceptions_do (tree exception)
15957 tree list = currently_caught_type_list;
15958 resolve_and_layout (exception, NULL_TREE);
15959 /* First, all the nested try-catch-finally at that stage. The
15960 last element contains `throws' clause exceptions, if any. */
15961 if (IS_UNCHECKED_EXCEPTION_P (exception))
15966 for (caught = TREE_VALUE (list); caught; caught = TREE_CHAIN (caught))
15967 if (valid_ref_assignconv_cast_p (exception, TREE_VALUE (caught), 0))
15969 list = TREE_CHAIN (list);
15975 purge_unchecked_exceptions (tree mdecl)
15977 tree throws = DECL_FUNCTION_THROWS (mdecl);
15978 tree new = NULL_TREE;
15982 tree next = TREE_CHAIN (throws);
15983 if (!IS_UNCHECKED_EXCEPTION_P (TREE_VALUE (throws)))
15985 TREE_CHAIN (throws) = new;
15990 /* List is inverted here, but it doesn't matter */
15991 DECL_FUNCTION_THROWS (mdecl) = new;
15994 /* This function goes over all of CLASS_TYPE ctors and checks whether
15995 each of them features at least one unchecked exception in its
15996 `throws' clause. If it's the case, it returns `true', `false'
16000 ctors_unchecked_throws_clause_p (tree class_type)
16004 for (current = TYPE_METHODS (class_type); current;
16005 current = TREE_CHAIN (current))
16007 bool ctu = false; /* Ctor Throws Unchecked */
16008 if (DECL_CONSTRUCTOR_P (current))
16011 for (throws = DECL_FUNCTION_THROWS (current); throws && !ctu;
16012 throws = TREE_CHAIN (throws))
16013 if (inherits_from_p (TREE_VALUE (throws), exception_type_node))
16016 /* We return false as we found one ctor that is unfit. */
16017 if (!ctu && DECL_CONSTRUCTOR_P (current))
16020 /* All ctors feature at least one unchecked exception in their
16021 `throws' clause. */
16025 /* 15.24 Conditional Operator ?: */
16028 patch_conditional_expr (tree node, tree wfl_cond, tree wfl_op1)
16030 tree cond = TREE_OPERAND (node, 0);
16031 tree op1 = TREE_OPERAND (node, 1);
16032 tree op2 = TREE_OPERAND (node, 2);
16033 tree resulting_type = NULL_TREE;
16034 tree t1, t2, patched;
16035 int error_found = 0;
16037 /* Operands of ?: might be StringBuffers crafted as a result of a
16038 string concatenation. Obtain a descent operand here. */
16039 if ((patched = patch_string (op1)))
16040 TREE_OPERAND (node, 1) = op1 = patched;
16041 if ((patched = patch_string (op2)))
16042 TREE_OPERAND (node, 2) = op2 = patched;
16044 t1 = TREE_TYPE (op1);
16045 t2 = TREE_TYPE (op2);
16047 /* The first expression must be a boolean */
16048 if (TREE_TYPE (cond) != boolean_type_node)
16050 SET_WFL_OPERATOR (wfl_operator, node, wfl_cond);
16051 parse_error_context (wfl_operator,
16052 "Incompatible type for `?:'. Can't convert `%s' to `boolean'",
16053 lang_printable_name (TREE_TYPE (cond), 0));
16057 /* Second and third can be numeric, boolean (i.e. primitive),
16058 references or null. Anything else results in an error */
16059 if (!((JNUMERIC_TYPE_P (t1) && JNUMERIC_TYPE_P (t2))
16060 || ((JREFERENCE_TYPE_P (t1) || op1 == null_pointer_node)
16061 && (JREFERENCE_TYPE_P (t2) || op2 == null_pointer_node))
16062 || (t1 == boolean_type_node && t2 == boolean_type_node)))
16065 /* Determine the type of the conditional expression. Same types are
16066 easy to deal with */
16068 resulting_type = t1;
16070 /* There are different rules for numeric types */
16071 else if (JNUMERIC_TYPE_P (t1))
16073 /* if byte/short found, the resulting type is short */
16074 if ((t1 == byte_type_node && t2 == short_type_node)
16075 || (t1 == short_type_node && t2 == byte_type_node))
16076 resulting_type = short_type_node;
16078 /* If t1 is a constant int and t2 is of type byte, short or char
16079 and t1's value fits in t2, then the resulting type is t2 */
16080 else if ((t1 == int_type_node && TREE_CONSTANT (TREE_OPERAND (node, 1)))
16081 && JBSC_TYPE_P (t2) && int_fits_type_p (TREE_OPERAND (node, 1), t2))
16082 resulting_type = t2;
16084 /* If t2 is a constant int and t1 is of type byte, short or char
16085 and t2's value fits in t1, then the resulting type is t1 */
16086 else if ((t2 == int_type_node && TREE_CONSTANT (TREE_OPERAND (node, 2)))
16087 && JBSC_TYPE_P (t1) && int_fits_type_p (TREE_OPERAND (node, 2), t1))
16088 resulting_type = t1;
16090 /* Otherwise, binary numeric promotion is applied and the
16091 resulting type is the promoted type of operand 1 and 2 */
16093 resulting_type = binary_numeric_promotion (t1, t2,
16094 &TREE_OPERAND (node, 1),
16095 &TREE_OPERAND (node, 2));
16098 /* Cases of a reference and a null type */
16099 else if (JREFERENCE_TYPE_P (t1) && op2 == null_pointer_node)
16100 resulting_type = t1;
16102 else if (JREFERENCE_TYPE_P (t2) && op1 == null_pointer_node)
16103 resulting_type = t2;
16105 /* Last case: different reference types. If a type can be converted
16106 into the other one by assignment conversion, the latter
16107 determines the type of the expression */
16108 else if ((resulting_type = try_reference_assignconv (t1, op2)))
16109 resulting_type = promote_type (t1);
16111 else if ((resulting_type = try_reference_assignconv (t2, op1)))
16112 resulting_type = promote_type (t2);
16114 /* If we don't have any resulting type, we're in trouble */
16115 if (!resulting_type)
16117 char *t = xstrdup (lang_printable_name (t1, 0));
16118 SET_WFL_OPERATOR (wfl_operator, node, wfl_op1);
16119 parse_error_context (wfl_operator,
16120 "Incompatible type for `?:'. Can't convert `%s' to `%s'",
16121 t, lang_printable_name (t2, 0));
16128 TREE_TYPE (node) = error_mark_node;
16129 return error_mark_node;
16132 TREE_TYPE (node) = resulting_type;
16133 TREE_SET_CODE (node, COND_EXPR);
16134 CAN_COMPLETE_NORMALLY (node) = 1;
16138 /* Wrap EXPR with code to initialize DECL's class, if appropriate. */
16141 maybe_build_class_init_for_field (tree decl, tree expr)
16143 tree clas = DECL_CONTEXT (decl);
16144 if (flag_emit_class_files || flag_emit_xref)
16147 if (TREE_CODE (decl) == VAR_DECL && FIELD_STATIC (decl)
16148 && FIELD_FINAL (decl))
16150 tree init = DECL_INITIAL (decl);
16151 if (init != NULL_TREE)
16152 init = fold_constant_for_init (init, decl);
16153 if (init != NULL_TREE && CONSTANT_VALUE_P (init))
16157 return build_class_init (clas, expr);
16160 /* Try to constant fold NODE.
16161 If NODE is not a constant expression, return NULL_EXPR.
16162 CONTEXT is a static final VAR_DECL whose initializer we are folding. */
16165 fold_constant_for_init (tree node, tree context)
16167 tree op0, op1, val;
16168 enum tree_code code = TREE_CODE (node);
16173 if (node == null_pointer_node)
16182 case TRUNC_MOD_EXPR:
16190 case TRUTH_ANDIF_EXPR:
16191 case TRUTH_ORIF_EXPR:
16198 op0 = TREE_OPERAND (node, 0);
16199 op1 = TREE_OPERAND (node, 1);
16200 val = fold_constant_for_init (op0, context);
16201 if (val == NULL_TREE || ! TREE_CONSTANT (val))
16203 TREE_OPERAND (node, 0) = val;
16204 val = fold_constant_for_init (op1, context);
16205 if (val == NULL_TREE || ! TREE_CONSTANT (val))
16207 TREE_OPERAND (node, 1) = val;
16208 return patch_binop (node, op0, op1);
16210 case UNARY_PLUS_EXPR:
16212 case TRUTH_NOT_EXPR:
16215 op0 = TREE_OPERAND (node, 0);
16216 val = fold_constant_for_init (op0, context);
16217 if (val == NULL_TREE || ! TREE_CONSTANT (val))
16219 TREE_OPERAND (node, 0) = val;
16220 val = patch_unaryop (node, op0);
16221 if (! TREE_CONSTANT (val))
16228 val = fold_constant_for_init (TREE_OPERAND (node, 0), context);
16229 if (val == NULL_TREE || ! TREE_CONSTANT (val))
16231 TREE_OPERAND (node, 0) = val;
16232 val = fold_constant_for_init (TREE_OPERAND (node, 1), context);
16233 if (val == NULL_TREE || ! TREE_CONSTANT (val))
16235 TREE_OPERAND (node, 1) = val;
16236 val = fold_constant_for_init (TREE_OPERAND (node, 2), context);
16237 if (val == NULL_TREE || ! TREE_CONSTANT (val))
16239 TREE_OPERAND (node, 2) = val;
16240 return integer_zerop (TREE_OPERAND (node, 0)) ? TREE_OPERAND (node, 1)
16241 : TREE_OPERAND (node, 2);
16245 if (! FIELD_FINAL (node)
16246 || DECL_INITIAL (node) == NULL_TREE)
16248 val = DECL_INITIAL (node);
16249 /* Guard against infinite recursion. */
16250 DECL_INITIAL (node) = NULL_TREE;
16251 val = fold_constant_for_init (val, node);
16252 if (val != NULL_TREE && TREE_CODE (val) != STRING_CST)
16253 val = try_builtin_assignconv (NULL_TREE, TREE_TYPE (node), val);
16254 DECL_INITIAL (node) = val;
16257 case EXPR_WITH_FILE_LOCATION:
16258 /* Compare java_complete_tree and resolve_expression_name. */
16259 if (!EXPR_WFL_NODE (node) /* Or a PRIMARY flag ? */
16260 || TREE_CODE (EXPR_WFL_NODE (node)) == IDENTIFIER_NODE)
16262 tree name = EXPR_WFL_NODE (node);
16264 if (PRIMARY_P (node))
16266 else if (! QUALIFIED_P (name))
16268 decl = lookup_field_wrapper (DECL_CONTEXT (context), name);
16269 if (decl == NULL_TREE
16270 || (! FIELD_STATIC (decl) && ! FIELD_FINAL (decl)))
16272 return fold_constant_for_init (decl, decl);
16276 tree r = NULL_TREE;
16277 /* Install the proper context for the field resolution. */
16278 tree saved_current_class = current_class;
16279 /* Wait until the USE_COMPONENT_REF re-write. FIXME. */
16280 current_class = DECL_CONTEXT (context);
16281 qualify_ambiguous_name (node);
16282 r = resolve_field_access (node, &decl, NULL);
16283 /* Restore prior context. */
16284 current_class = saved_current_class;
16285 if (r != error_mark_node && decl != NULL_TREE)
16286 return fold_constant_for_init (decl, decl);
16292 op0 = TREE_OPERAND (node, 0);
16293 val = fold_constant_for_init (op0, context);
16294 if (val == NULL_TREE || ! TREE_CONSTANT (val))
16296 TREE_OPERAND (node, 0) = val;
16300 #ifdef USE_COMPONENT_REF
16302 case COMPONENT_REF:
16311 #ifdef USE_COMPONENT_REF
16312 /* Context is 'T' for TypeName, 'P' for PackageName,
16313 'M' for MethodName, 'E' for ExpressionName, and 'A' for AmbiguousName. */
16316 resolve_simple_name (tree name, int context)
16321 resolve_qualified_name (tree name, int context)
16327 init_src_parse (void)
16329 /* Sanity check; we've been bit by this before. */
16330 if (ARRAY_SIZE (ctxp->modifier_ctx) != MODIFIER_TK - PUBLIC_TK)
16336 /* This section deals with the functions that are called when tables
16337 recording class initialization information are traversed. */
16339 /* Attach to PTR (a block) the declaration found in ENTRY. */
16342 attach_init_test_initialization_flags (void **entry, void *ptr)
16344 tree block = (tree)ptr;
16345 struct treetreehash_entry *ite = (struct treetreehash_entry *) *entry;
16347 if (block != error_mark_node)
16349 TREE_CHAIN (ite->value) = BLOCK_EXPR_DECLS (block);
16350 BLOCK_EXPR_DECLS (block) = ite->value;
16355 /* This function is called for each class that is known definitely
16356 initialized when a given static method was called. This function
16357 augments a compound expression (INFO) storing all assignment to
16358 initialized static class flags if a flag already existed, otherwise
16359 a new one is created. */
16362 emit_test_initialization (void **entry_p, void *info)
16364 tree l = (tree) info;
16366 tree key = (tree) *entry_p;
16368 htab_t cf_ht = DECL_FUNCTION_INIT_TEST_TABLE (current_function_decl);
16370 /* If we haven't found a flag and we're dealing with self registered
16371 with current_function_decl, then don't do anything. Self is
16372 always added as definitely initialized but this information is
16373 valid only if used outside the current function. */
16374 if (current_function_decl == TREE_PURPOSE (l)
16375 && java_treetreehash_find (cf_ht, key) == NULL)
16378 ite = java_treetreehash_new (cf_ht, key);
16380 /* If we don't have a variable, create one and install it. */
16385 decl = build_decl (VAR_DECL, NULL_TREE, boolean_type_node);
16386 MAYBE_CREATE_VAR_LANG_DECL_SPECIFIC (decl);
16387 LOCAL_CLASS_INITIALIZATION_FLAG (decl) = 1;
16388 DECL_CONTEXT (decl) = current_function_decl;
16389 DECL_INITIAL (decl) = boolean_true_node;
16390 /* Don't emit any symbolic debugging info for this decl. */
16391 DECL_IGNORED_P (decl) = 1;
16393 /* The trick is to find the right context for it. */
16394 block = BLOCK_SUBBLOCKS (GET_CURRENT_BLOCK (current_function_decl));
16395 TREE_CHAIN (decl) = BLOCK_EXPR_DECLS (block);
16396 BLOCK_EXPR_DECLS (block) = decl;
16402 /* Now simply augment the compound that holds all the assignments
16403 pertaining to this method invocation. */
16404 init = build2 (MODIFY_EXPR, boolean_type_node, decl, boolean_true_node);
16405 TREE_SIDE_EFFECTS (init) = 1;
16406 TREE_VALUE (l) = add_stmt_to_compound (TREE_VALUE (l), void_type_node, init);
16407 TREE_SIDE_EFFECTS (TREE_VALUE (l)) = 1;
16412 #include "gt-java-parse.h"
16413 #include "gtype-java.h"