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
4 Free Software Foundation, Inc.
5 Contributed by Alexandre Petit-Bianco (apbianco@cygnus.com)
7 This file is part of GCC.
9 GCC is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 2, or (at your option)
14 GCC is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
19 You should have received a copy of the GNU General Public License
20 along with GCC; see the file COPYING. If not, write to
21 the Free Software Foundation, 59 Temple Place - Suite 330,
22 Boston, MA 02111-1307, USA.
24 Java and all Java-based marks are trademarks or registered trademarks
25 of Sun Microsystems, Inc. in the United States and other countries.
26 The Free Software Foundation is independent of Sun Microsystems, Inc. */
28 /* This file parses java source code and issues a tree node image
29 suitable for code generation (byte code and targeted CPU assembly
32 The grammar conforms to the Java grammar described in "The Java(TM)
33 Language Specification. J. Gosling, B. Joy, G. Steele. Addison Wesley
34 1996, ISBN 0-201-63451-1"
36 The following modifications were brought to the original grammar:
38 method_body: added the rule '| block SC_TK'
39 static_initializer: added the rule 'static block SC_TK'.
41 Note: All the extra rules described above should go away when the
42 empty_statement rule will work.
44 statement_nsi: 'nsi' should be read no_short_if.
46 Some rules have been modified to support JDK1.1 inner classes
47 definitions and other extensions. */
52 #include "coretypes.h"
61 #include "java-tree.h"
73 #include "tree-inline.h"
76 /* Local function prototypes */
77 static char *java_accstring_lookup (int);
78 static void classitf_redefinition_error (const char *,tree, tree, tree);
79 static void variable_redefinition_error (tree, tree, tree, int);
80 static tree create_class (int, tree, tree, tree);
81 static tree create_interface (int, tree, tree);
82 static void end_class_declaration (int);
83 static tree find_field (tree, tree);
84 static tree lookup_field_wrapper (tree, tree);
85 static int duplicate_declaration_error_p (tree, tree, tree);
86 static void register_fields (int, tree, tree);
87 static tree parser_qualified_classname (tree);
88 static int parser_check_super (tree, tree, tree);
89 static int parser_check_super_interface (tree, tree, tree);
90 static void check_modifiers_consistency (int);
91 static tree lookup_cl (tree);
92 static tree lookup_java_method2 (tree, tree, int);
93 static tree method_header (int, tree, tree, tree);
94 static void fix_method_argument_names (tree ,tree);
95 static tree method_declarator (tree, tree);
96 static void parse_warning_context (tree cl, const char *msg, ...)
98 static void issue_warning_error_from_context (tree, const char *msg, va_list)
99 ATTRIBUTE_PRINTF (2, 0);
100 static void parse_ctor_invocation_error (void);
101 static tree parse_jdk1_1_error (const char *);
102 static void complete_class_report_errors (jdep *);
103 static int process_imports (void);
104 static void read_import_dir (tree);
105 static int find_in_imports_on_demand (tree, tree);
106 static void find_in_imports (tree, tree);
107 static void check_inner_class_access (tree, tree, tree);
108 static int check_pkg_class_access (tree, tree, bool);
109 static void register_package (tree);
110 static tree resolve_package (tree, tree *, tree *);
111 static tree resolve_class (tree, tree, tree, tree);
112 static void declare_local_variables (int, tree, tree);
113 static void dump_java_tree (enum tree_dump_index, tree);
114 static void source_start_java_method (tree);
115 static void source_end_java_method (void);
116 static tree find_name_in_single_imports (tree);
117 static void check_abstract_method_header (tree);
118 static tree lookup_java_interface_method2 (tree, tree);
119 static tree resolve_expression_name (tree, tree *);
120 static tree maybe_create_class_interface_decl (tree, tree, tree, tree);
121 static int check_class_interface_creation (int, int, tree, tree, tree, tree);
122 static tree patch_method_invocation (tree, tree, tree, int, int *, tree *);
123 static int breakdown_qualified (tree *, tree *, tree);
124 static int in_same_package (tree, tree);
125 static tree resolve_and_layout (tree, tree);
126 static tree qualify_and_find (tree, tree, tree);
127 static tree resolve_no_layout (tree, tree);
128 static int invocation_mode (tree, int);
129 static tree find_applicable_accessible_methods_list (int, tree, tree, tree);
130 static void search_applicable_methods_list (int, tree, tree, tree, tree *, tree *);
131 static tree find_most_specific_methods_list (tree);
132 static int argument_types_convertible (tree, tree);
133 static tree patch_invoke (tree, tree, tree);
134 static int maybe_use_access_method (int, tree *, tree *);
135 static tree lookup_method_invoke (int, tree, tree, tree, tree);
136 static tree register_incomplete_type (int, tree, tree, tree);
137 static tree check_inner_circular_reference (tree, tree);
138 static tree check_circular_reference (tree);
139 static tree obtain_incomplete_type (tree);
140 static tree java_complete_lhs (tree);
141 static tree java_complete_tree (tree);
142 static tree maybe_generate_pre_expand_clinit (tree);
143 static int analyze_clinit_body (tree, tree);
144 static int maybe_yank_clinit (tree);
145 static void java_complete_expand_method (tree);
146 static void java_expand_method_bodies (tree);
147 static int unresolved_type_p (tree, tree *);
148 static void create_jdep_list (struct parser_ctxt *);
149 static tree build_expr_block (tree, tree);
150 static tree enter_block (void);
151 static tree exit_block (void);
152 static tree lookup_name_in_blocks (tree);
153 static void maybe_absorb_scoping_blocks (void);
154 static tree build_method_invocation (tree, tree);
155 static tree build_new_invocation (tree, tree);
156 static tree build_assignment (int, int, tree, tree);
157 static tree build_binop (enum tree_code, int, tree, tree);
158 static tree patch_assignment (tree, tree);
159 static tree patch_binop (tree, tree, tree);
160 static tree build_unaryop (int, int, tree);
161 static tree build_incdec (int, int, tree, int);
162 static tree patch_unaryop (tree, tree);
163 static tree build_cast (int, tree, tree);
164 static tree build_null_of_type (tree);
165 static tree patch_cast (tree, tree);
166 static int valid_ref_assignconv_cast_p (tree, tree, int);
167 static int valid_builtin_assignconv_identity_widening_p (tree, tree);
168 static int valid_cast_to_p (tree, tree);
169 static int valid_method_invocation_conversion_p (tree, tree);
170 static tree try_builtin_assignconv (tree, tree, tree);
171 static tree try_reference_assignconv (tree, tree);
172 static tree build_unresolved_array_type (tree);
173 static int build_type_name_from_array_name (tree, tree *);
174 static tree build_array_from_name (tree, tree, tree, tree *);
175 static tree build_array_ref (int, tree, tree);
176 static tree patch_array_ref (tree);
177 static tree make_qualified_name (tree, tree, int);
178 static tree merge_qualified_name (tree, tree);
179 static tree make_qualified_primary (tree, tree, int);
180 static int resolve_qualified_expression_name (tree, tree *, tree *, tree *);
181 static void qualify_ambiguous_name (tree);
182 static tree resolve_field_access (tree, tree *, tree *);
183 static tree build_newarray_node (tree, tree, int);
184 static tree patch_newarray (tree);
185 static tree resolve_type_during_patch (tree);
186 static tree build_this (int);
187 static tree build_wfl_wrap (tree, int);
188 static tree build_return (int, tree);
189 static tree patch_return (tree);
190 static tree maybe_access_field (tree, tree, tree);
191 static int complete_function_arguments (tree);
192 static int check_for_static_method_reference (tree, tree, tree, tree, tree);
193 static int not_accessible_p (tree, tree, tree, int);
194 static void check_deprecation (tree, tree);
195 static int class_in_current_package (tree);
196 static tree build_if_else_statement (int, tree, tree, tree);
197 static tree patch_if_else_statement (tree);
198 static tree add_stmt_to_compound (tree, tree, tree);
199 static tree add_stmt_to_block (tree, tree, tree);
200 static tree patch_exit_expr (tree);
201 static tree build_labeled_block (int, tree);
202 static tree finish_labeled_statement (tree, tree);
203 static tree build_bc_statement (int, int, tree);
204 static tree patch_bc_statement (tree);
205 static tree patch_loop_statement (tree);
206 static tree build_new_loop (tree);
207 static tree build_loop_body (int, tree, int);
208 static tree finish_loop_body (int, tree, tree, int);
209 static tree build_debugable_stmt (int, tree);
210 static tree finish_for_loop (int, tree, tree, tree);
211 static tree patch_switch_statement (tree);
212 static tree string_constant_concatenation (tree, tree);
213 static tree build_string_concatenation (tree, tree);
214 static tree patch_string_cst (tree);
215 static tree patch_string (tree);
216 static tree encapsulate_with_try_catch (int, tree, tree, tree);
217 static tree build_assertion (int, tree, tree);
218 static tree build_try_statement (int, tree, tree);
219 static tree build_try_finally_statement (int, tree, tree);
220 static tree patch_try_statement (tree);
221 static tree patch_synchronized_statement (tree, tree);
222 static tree patch_throw_statement (tree, tree);
223 static void check_thrown_exceptions (int, tree, tree);
224 static int check_thrown_exceptions_do (tree);
225 static void purge_unchecked_exceptions (tree);
226 static bool ctors_unchecked_throws_clause_p (tree);
227 static void check_concrete_throws_clauses (tree, tree, tree, tree);
228 static void check_throws_clauses (tree, tree, tree);
229 static void finish_method_declaration (tree);
230 static tree build_super_invocation (tree);
231 static int verify_constructor_circularity (tree, tree);
232 static char *constructor_circularity_msg (tree, tree);
233 static tree build_this_super_qualified_invocation (int, tree, tree, int, int);
234 static const char *get_printable_method_name (tree);
235 static tree patch_conditional_expr (tree, tree, tree);
236 static tree generate_finit (tree);
237 static tree generate_instinit (tree);
238 static tree build_instinit_invocation (tree);
239 static void fix_constructors (tree);
240 static tree build_alias_initializer_parameter_list (int, tree, tree, int *);
241 static tree craft_constructor (tree, tree);
242 static int verify_constructor_super (tree);
243 static tree create_artificial_method (tree, int, tree, tree, tree);
244 static void start_artificial_method_body (tree);
245 static void end_artificial_method_body (tree);
246 static int check_method_redefinition (tree, tree);
247 static int check_method_types_complete (tree);
248 static bool hack_is_accessible_p (tree, tree);
249 static void java_check_regular_methods (tree);
250 static void check_interface_throws_clauses (tree, tree);
251 static void java_check_abstract_methods (tree);
252 static void unreachable_stmt_error (tree);
253 static int not_accessible_field_error (tree, tree);
254 static tree find_expr_with_wfl (tree);
255 static void missing_return_error (tree);
256 static tree build_new_array_init (int, tree);
257 static tree patch_new_array_init (tree, tree);
258 static tree maybe_build_array_element_wfl (tree);
259 static int array_constructor_check_entry (tree, tree);
260 static const char *purify_type_name (const char *);
261 static tree fold_constant_for_init (tree, tree);
262 static tree strip_out_static_field_access_decl (tree);
263 static jdeplist *reverse_jdep_list (struct parser_ctxt *);
264 static void static_ref_err (tree, tree, tree);
265 static void parser_add_interface (tree, tree, tree);
266 static void add_superinterfaces (tree, tree);
267 static tree jdep_resolve_class (jdep *);
268 static int note_possible_classname (const char *, int);
269 static void java_complete_expand_classes (void);
270 static void java_complete_expand_class (tree);
271 static void java_complete_expand_methods (tree);
272 static tree cut_identifier_in_qualified (tree);
273 static tree java_stabilize_reference (tree);
274 static tree do_unary_numeric_promotion (tree);
275 static char * operator_string (tree);
276 static tree do_merge_string_cste (tree, const char *, int, int);
277 static tree merge_string_cste (tree, tree, int);
278 static tree java_refold (tree);
279 static int java_decl_equiv (tree, tree);
280 static int binop_compound_p (enum tree_code);
281 static tree search_loop (tree);
282 static int labeled_block_contains_loop_p (tree, tree);
283 static int check_abstract_method_definitions (int, tree, tree);
284 static void java_check_abstract_method_definitions (tree);
285 static void java_debug_context_do (int);
286 static void java_parser_context_push_initialized_field (void);
287 static void java_parser_context_pop_initialized_field (void);
288 static tree reorder_static_initialized (tree);
289 static void java_parser_context_suspend (void);
290 static void java_parser_context_resume (void);
291 static int pop_current_osb (struct parser_ctxt *);
293 /* JDK 1.1 work. FIXME */
295 static tree maybe_make_nested_class_name (tree);
296 static int make_nested_class_name (tree);
297 static void set_nested_class_simple_name_value (tree, int);
298 static void link_nested_class_to_enclosing (void);
299 static tree resolve_inner_class (htab_t, tree, tree *, tree *, tree);
300 static tree find_as_inner_class (tree, tree, tree);
301 static tree find_as_inner_class_do (tree, tree);
302 static int check_inner_class_redefinition (tree, tree);
304 static tree build_thisn_assign (void);
305 static tree build_current_thisn (tree);
306 static tree build_access_to_thisn (tree, tree, int);
307 static tree maybe_build_thisn_access_method (tree);
309 static tree build_outer_field_access (tree, tree);
310 static tree build_outer_field_access_methods (tree);
311 static tree build_outer_field_access_expr (int, tree, tree,
313 static tree build_outer_method_access_method (tree);
314 static tree build_new_access_id (void);
315 static tree build_outer_field_access_method (tree, tree, tree,
318 static int outer_field_access_p (tree, tree);
319 static int outer_field_expanded_access_p (tree, tree *,
321 static tree outer_field_access_fix (tree, tree, tree);
322 static tree build_incomplete_class_ref (int, tree);
323 static tree patch_incomplete_class_ref (tree);
324 static tree create_anonymous_class (int, tree);
325 static void patch_anonymous_class (tree, tree, tree);
326 static void add_inner_class_fields (tree, tree);
328 static tree build_dot_class_method (tree);
329 static tree build_dot_class_method_invocation (tree, tree);
330 static void create_new_parser_context (int);
331 static tree maybe_build_class_init_for_field (tree, tree);
333 static int attach_init_test_initialization_flags (void **, void *);
334 static int emit_test_initialization (void **, void *);
336 static char *string_convert_int_cst (tree);
338 /* Number of error found so far. */
339 int java_error_count;
340 /* Number of warning found so far. */
341 int java_warning_count;
342 /* Tell when not to fold, when doing xrefs */
344 /* Cyclic inheritance report, as it can be set by layout_class */
345 const char *cyclic_inheritance_report;
347 /* The current parser context */
348 struct parser_ctxt *ctxp;
350 /* List of things that were analyzed for which code will be generated */
351 struct parser_ctxt *ctxp_for_generation = NULL;
353 /* binop_lookup maps token to tree_code. It is used where binary
354 operations are involved and required by the parser. RDIV_EXPR
355 covers both integral/floating point division. The code is changed
356 once the type of both operator is worked out. */
358 static const enum tree_code binop_lookup[19] =
360 PLUS_EXPR, MINUS_EXPR, MULT_EXPR, RDIV_EXPR, TRUNC_MOD_EXPR,
361 LSHIFT_EXPR, RSHIFT_EXPR, URSHIFT_EXPR,
362 BIT_AND_EXPR, BIT_XOR_EXPR, BIT_IOR_EXPR,
363 TRUTH_ANDIF_EXPR, TRUTH_ORIF_EXPR,
364 EQ_EXPR, NE_EXPR, GT_EXPR, GE_EXPR, LT_EXPR, LE_EXPR,
366 #define BINOP_LOOKUP(VALUE) \
367 binop_lookup [((VALUE) - PLUS_TK) % ARRAY_SIZE (binop_lookup)]
369 /* This is the end index for binary operators that can also be used
370 in compound assignments. */
371 #define BINOP_COMPOUND_CANDIDATES 11
373 /* The "$L" identifier we use to create labels. */
374 static GTY(()) tree label_id;
376 /* The "StringBuffer" identifier used for the String `+' operator. */
377 static GTY(()) tree wfl_string_buffer;
379 /* The "append" identifier used for String `+' operator. */
380 static GTY(()) tree wfl_append;
382 /* The "toString" identifier used for String `+' operator. */
383 static GTY(()) tree wfl_to_string;
385 /* The "java.lang" import qualified name. */
386 static GTY(()) tree java_lang_id;
388 /* The generated `inst$' identifier used for generated enclosing
389 instance/field access functions. */
390 static GTY(()) tree inst_id;
392 /* Context and flag for static blocks */
393 static GTY(()) tree current_static_block;
395 /* The generated `write_parm_value$' identifier. */
396 static GTY(()) tree wpv_id;
398 /* The list of all packages we've seen so far */
399 static GTY(()) tree package_list;
401 /* Hold THIS for the scope of the current method decl. */
402 static GTY(()) tree current_this;
404 /* Hold a list of catch clauses list. The first element of this list is
405 the list of the catch clauses of the currently analyzed try block. */
406 static GTY(()) tree currently_caught_type_list;
408 /* This holds a linked list of all the case labels for the current
409 switch statement. It is only used when checking to see if there
410 are duplicate labels. FIXME: probably this should just be attached
411 to the switch itself; then it could be referenced via
412 `ctxp->current_loop'. */
413 static GTY(()) tree case_label_list;
415 /* Anonymous class counter. Will be reset to 1 every time a non
416 anonymous class gets created. */
417 static int anonymous_class_counter = 1;
419 static GTY(()) tree src_parse_roots[1];
421 /* All classes seen from source code */
422 #define gclass_list src_parse_roots[0]
424 /* Check modifiers. If one doesn't fit, retrieve it in its declaration
425 line and point it out. */
426 /* Should point out the one that don't fit. ASCII/unicode, going
429 #define check_modifiers(__message, __value, __mask) do { \
430 if ((__value) & ~(__mask)) \
432 size_t i, remainder = (__value) & ~(__mask); \
433 for (i = 0; i < ARRAY_SIZE (ctxp->modifier_ctx); i++) \
434 if ((1 << i) & remainder) \
435 parse_error_context (ctxp->modifier_ctx [i], (__message), \
436 java_accstring_lookup (1 << i)); \
458 /* Things defined here have to match the order of what's in the
459 binop_lookup table. */
461 %token PLUS_TK MINUS_TK MULT_TK DIV_TK REM_TK
462 %token LS_TK SRS_TK ZRS_TK
463 %token AND_TK XOR_TK OR_TK
464 %token BOOL_AND_TK BOOL_OR_TK
465 %token EQ_TK NEQ_TK GT_TK GTE_TK LT_TK LTE_TK
467 /* This maps to the same binop_lookup entry than the token above */
469 %token PLUS_ASSIGN_TK MINUS_ASSIGN_TK MULT_ASSIGN_TK DIV_ASSIGN_TK
471 %token LS_ASSIGN_TK SRS_ASSIGN_TK ZRS_ASSIGN_TK
472 %token AND_ASSIGN_TK XOR_ASSIGN_TK OR_ASSIGN_TK
475 /* Modifier TOKEN have to be kept in this order. Don't scramble it */
477 %token PUBLIC_TK PRIVATE_TK PROTECTED_TK
478 %token STATIC_TK FINAL_TK SYNCHRONIZED_TK
479 %token VOLATILE_TK TRANSIENT_TK NATIVE_TK
480 %token PAD_TK ABSTRACT_TK STRICT_TK
483 /* Keep those two in order, too */
484 %token DECR_TK INCR_TK
486 /* From now one, things can be in any order */
488 %token DEFAULT_TK IF_TK THROW_TK
489 %token BOOLEAN_TK DO_TK IMPLEMENTS_TK
490 %token THROWS_TK BREAK_TK IMPORT_TK
491 %token ELSE_TK INSTANCEOF_TK RETURN_TK
492 %token VOID_TK CATCH_TK INTERFACE_TK
493 %token CASE_TK EXTENDS_TK FINALLY_TK
494 %token SUPER_TK WHILE_TK CLASS_TK
495 %token SWITCH_TK CONST_TK TRY_TK
496 %token FOR_TK NEW_TK CONTINUE_TK
497 %token GOTO_TK PACKAGE_TK THIS_TK
500 %token BYTE_TK SHORT_TK INT_TK LONG_TK
501 %token CHAR_TK INTEGRAL_TK
503 %token FLOAT_TK DOUBLE_TK FP_TK
507 %token REL_QM_TK REL_CL_TK NOT_TK NEG_TK
509 %token ASSIGN_ANY_TK ASSIGN_TK
510 %token OP_TK CP_TK OCB_TK CCB_TK OSB_TK CSB_TK SC_TK C_TK DOT_TK
512 %token STRING_LIT_TK CHAR_LIT_TK INT_LIT_TK FP_LIT_TK
513 %token TRUE_TK FALSE_TK BOOL_LIT_TK NULL_TK
515 %type <value> modifiers MODIFIER_TK final synchronized
517 %type <node> super ID_TK identifier
518 %type <node> name simple_name qualified_name
519 %type <node> type_declaration compilation_unit
520 field_declaration method_declaration extends_interfaces
521 interfaces interface_type_list
522 import_declarations package_declaration
523 type_declarations interface_body
524 interface_member_declaration constant_declaration
525 interface_member_declarations interface_type
526 abstract_method_declaration
527 %type <node> class_body_declaration class_member_declaration
528 static_initializer constructor_declaration block
529 %type <node> class_body_declarations constructor_header
530 %type <node> class_or_interface_type class_type class_type_list
531 constructor_declarator explicit_constructor_invocation
532 %type <node> dim_expr dim_exprs this_or_super throws
534 %type <node> variable_declarator_id variable_declarator
535 variable_declarators variable_initializer
536 variable_initializers constructor_body
539 %type <node> class_body block_end constructor_block_end
540 %type <node> statement statement_without_trailing_substatement
541 labeled_statement if_then_statement label_decl
542 if_then_else_statement while_statement for_statement
543 statement_nsi labeled_statement_nsi do_statement
544 if_then_else_statement_nsi while_statement_nsi
545 for_statement_nsi statement_expression_list for_init
546 for_update statement_expression expression_statement
547 primary_no_new_array expression primary
548 array_creation_expression array_type
549 class_instance_creation_expression field_access
550 method_invocation array_access something_dot_new
551 argument_list postfix_expression while_expression
552 post_increment_expression post_decrement_expression
553 unary_expression_not_plus_minus unary_expression
554 pre_increment_expression pre_decrement_expression
556 multiplicative_expression additive_expression
557 shift_expression relational_expression
558 equality_expression and_expression
559 exclusive_or_expression inclusive_or_expression
560 conditional_and_expression conditional_or_expression
561 conditional_expression assignment_expression
562 left_hand_side assignment for_header for_begin
563 constant_expression do_statement_begin empty_statement
564 switch_statement synchronized_statement throw_statement
565 try_statement assert_statement
566 switch_expression switch_block
567 catches catch_clause catch_clause_parameter finally
568 anonymous_class_creation trap_overflow_corner_case
569 %type <node> return_statement break_statement continue_statement
571 %type <operator> ASSIGN_TK MULT_ASSIGN_TK DIV_ASSIGN_TK
572 %type <operator> REM_ASSIGN_TK PLUS_ASSIGN_TK MINUS_ASSIGN_TK
573 %type <operator> LS_ASSIGN_TK SRS_ASSIGN_TK ZRS_ASSIGN_TK
574 %type <operator> AND_ASSIGN_TK XOR_ASSIGN_TK OR_ASSIGN_TK
575 %type <operator> ASSIGN_ANY_TK assignment_operator
576 %token <operator> EQ_TK GTE_TK ZRS_TK SRS_TK GT_TK LTE_TK LS_TK
577 %token <operator> BOOL_AND_TK AND_TK BOOL_OR_TK OR_TK INCR_TK PLUS_TK
578 %token <operator> DECR_TK MINUS_TK MULT_TK DIV_TK XOR_TK REM_TK NEQ_TK
579 %token <operator> NEG_TK REL_QM_TK REL_CL_TK NOT_TK LT_TK OCB_TK CCB_TK
580 %token <operator> OP_TK OSB_TK DOT_TK THROW_TK INSTANCEOF_TK
581 %type <operator> THIS_TK SUPER_TK RETURN_TK BREAK_TK CONTINUE_TK
582 %type <operator> CASE_TK DEFAULT_TK TRY_TK CATCH_TK SYNCHRONIZED_TK
583 %type <operator> NEW_TK ASSERT_TK
585 %type <node> method_body
587 %type <node> literal INT_LIT_TK FP_LIT_TK BOOL_LIT_TK CHAR_LIT_TK
588 STRING_LIT_TK NULL_TK VOID_TK
590 %type <node> IF_TK WHILE_TK FOR_TK
592 %type <node> formal_parameter_list formal_parameter
593 method_declarator method_header
595 %type <node> primitive_type reference_type type
596 BOOLEAN_TK INTEGRAL_TK FP_TK
598 /* Added or modified JDK 1.1 rule types */
599 %type <node> type_literals
602 /* 19.2 Production from 2.3: The Syntactic Grammar */
603 goal: compilation_unit
607 /* 19.3 Productions from 3: Lexical structure */
617 /* 19.4 Productions from 4: Types, Values and Variables */
630 class_or_interface_type
634 class_or_interface_type:
639 class_or_interface_type /* Default rule */
643 class_or_interface_type
649 int osb = pop_current_osb (ctxp);
650 tree t = build_java_array_type (($1), -1);
652 t = build_unresolved_array_type (t);
657 int osb = pop_current_osb (ctxp);
660 t = build_unresolved_array_type (t);
665 /* 19.5 Productions from 6: Names */
667 simple_name /* Default rule */
668 | qualified_name /* Default rule */
672 identifier /* Default rule */
676 name DOT_TK identifier
677 { $$ = make_qualified_name ($1, $3, $2.location); }
684 /* 19.6: Production from 7: Packages */
687 | package_declaration
688 | import_declarations
690 | package_declaration import_declarations
691 | package_declaration type_declarations
692 | import_declarations type_declarations
693 | package_declaration import_declarations type_declarations
701 | import_declarations import_declaration
709 | type_declarations type_declaration
713 PACKAGE_TK name SC_TK
715 ctxp->package = EXPR_WFL_NODE ($2);
716 register_package (ctxp->package);
719 {yyerror ("Missing name"); RECOVER;}
720 | PACKAGE_TK name error
721 {yyerror ("';' expected"); RECOVER;}
725 single_type_import_declaration
726 | type_import_on_demand_declaration
729 single_type_import_declaration:
732 tree name = EXPR_WFL_NODE ($2), last_name;
733 int i = IDENTIFIER_LENGTH (name)-1;
734 const char *last = &IDENTIFIER_POINTER (name)[i];
735 while (last != IDENTIFIER_POINTER (name))
741 last_name = get_identifier (++last);
742 if (IS_A_SINGLE_IMPORT_CLASSFILE_NAME_P (last_name))
744 tree err = find_name_in_single_imports (last_name);
745 if (err && err != name)
747 ($2, "Ambiguous class: `%s' and `%s'",
748 IDENTIFIER_POINTER (name),
749 IDENTIFIER_POINTER (err));
751 REGISTER_IMPORT ($2, last_name);
754 REGISTER_IMPORT ($2, last_name);
757 {yyerror ("Missing name"); RECOVER;}
758 | IMPORT_TK name error
759 {yyerror ("';' expected"); RECOVER;}
762 type_import_on_demand_declaration:
763 IMPORT_TK name DOT_TK MULT_TK SC_TK
765 tree name = EXPR_WFL_NODE ($2);
767 /* Search for duplicates. */
768 for (it = ctxp->import_demand_list; it; it = TREE_CHAIN (it))
769 if (EXPR_WFL_NODE (TREE_PURPOSE (it)) == name)
771 /* Don't import the same thing more than once, just ignore
772 duplicates (7.5.2) */
775 read_import_dir ($2);
776 ctxp->import_demand_list =
777 chainon (ctxp->import_demand_list,
778 build_tree_list ($2, NULL_TREE));
781 | IMPORT_TK name DOT_TK error
782 {yyerror ("'*' expected"); RECOVER;}
783 | IMPORT_TK name DOT_TK MULT_TK error
784 {yyerror ("';' expected"); RECOVER;}
789 { end_class_declaration (0); }
790 | interface_declaration
791 { end_class_declaration (0); }
796 yyerror ("Class or interface declaration expected");
800 /* 19.7 Shortened from the original:
801 modifiers: modifier | modifiers modifier
802 modifier: any of public... */
808 | modifiers MODIFIER_TK
813 (ctxp->modifier_ctx [$2], "Modifier `%s' declared twice",
814 java_accstring_lookup (acc));
822 /* 19.8.1 Production from $8.1: Class Declaration */
824 modifiers CLASS_TK identifier super interfaces
825 { create_class ($1, $3, $4, $5); }
828 | CLASS_TK identifier super interfaces
829 { create_class (0, $2, $3, $4); }
832 | modifiers CLASS_TK error
833 { yyerror ("Missing class name"); RECOVER; }
835 { yyerror ("Missing class name"); RECOVER; }
836 | CLASS_TK identifier error
838 if (!ctxp->class_err) yyerror ("'{' expected");
841 | modifiers CLASS_TK identifier error
842 { if (!ctxp->class_err) yyerror ("'{' expected"); RECOVER; }
847 | EXTENDS_TK class_type
849 | EXTENDS_TK class_type error
850 {yyerror ("'{' expected"); ctxp->class_err=1;}
852 {yyerror ("Missing super class name"); ctxp->class_err=1;}
857 | IMPLEMENTS_TK interface_type_list
859 | IMPLEMENTS_TK error
862 yyerror ("Missing interface name");
869 ctxp->interface_number = 1;
870 $$ = build_tree_list ($1, NULL_TREE);
872 | interface_type_list C_TK interface_type
874 ctxp->interface_number++;
875 $$ = chainon ($1, build_tree_list ($3, NULL_TREE));
877 | interface_type_list C_TK error
878 {yyerror ("Missing interface name"); RECOVER;}
884 /* Store the location of the `}' when doing xrefs */
886 DECL_END_SOURCE_LINE (GET_CPC ()) =
887 EXPR_WFL_ADD_COL ($2.location, 1);
890 | OCB_TK class_body_declarations CCB_TK
892 /* Store the location of the `}' when doing xrefs */
894 DECL_END_SOURCE_LINE (GET_CPC ()) =
895 EXPR_WFL_ADD_COL ($3.location, 1);
900 class_body_declarations:
901 class_body_declaration
902 | class_body_declarations class_body_declaration
905 class_body_declaration:
906 class_member_declaration
908 | constructor_declaration
909 | block /* Added, JDK1.1, instance initializer */
911 if ($1 != empty_stmt_node)
913 TREE_CHAIN ($1) = CPC_INSTANCE_INITIALIZER_STMT (ctxp);
914 SET_CPC_INSTANCE_INITIALIZER_STMT (ctxp, $1);
919 class_member_declaration:
922 | class_declaration /* Added, JDK1.1 inner classes */
923 { end_class_declaration (1); }
924 | interface_declaration /* Added, JDK1.1 inner interfaces */
925 { end_class_declaration (1); }
929 /* 19.8.2 Productions from 8.3: Field Declarations */
931 type variable_declarators SC_TK
932 { register_fields (0, $1, $2); }
933 | modifiers type variable_declarators SC_TK
936 ("Illegal modifier `%s' for field declaration",
937 $1, FIELD_MODIFIERS);
938 check_modifiers_consistency ($1);
939 register_fields ($1, $2, $3);
943 variable_declarators:
944 /* Should we use build_decl_list () instead ? FIXME */
945 variable_declarator /* Default rule */
946 | variable_declarators C_TK variable_declarator
947 { $$ = chainon ($1, $3); }
948 | variable_declarators C_TK error
949 {yyerror ("Missing term"); RECOVER;}
953 variable_declarator_id
954 { $$ = build_tree_list ($1, NULL_TREE); }
955 | variable_declarator_id ASSIGN_TK variable_initializer
957 if (java_error_count)
960 ($1, build_assignment ($2.token, $2.location, $1, $3));
962 | variable_declarator_id ASSIGN_TK error
964 yyerror ("Missing variable initializer");
965 $$ = build_tree_list ($1, NULL_TREE);
968 | variable_declarator_id ASSIGN_TK variable_initializer error
970 yyerror ("';' expected");
971 $$ = build_tree_list ($1, NULL_TREE);
976 variable_declarator_id:
978 | variable_declarator_id OSB_TK CSB_TK
979 { $$ = build_unresolved_array_type ($1); }
981 {yyerror ("Invalid declaration"); DRECOVER(vdi);}
982 | variable_declarator_id OSB_TK error
984 yyerror ("']' expected");
987 | variable_declarator_id CSB_TK error
988 {yyerror ("Unbalanced ']'"); DRECOVER(vdi);}
991 variable_initializer:
996 /* 19.8.3 Productions from 8.4: Method Declarations */
1000 current_function_decl = $1;
1001 if (current_function_decl
1002 && TREE_CODE (current_function_decl) == FUNCTION_DECL)
1003 source_start_java_method (current_function_decl);
1005 current_function_decl = NULL_TREE;
1008 { finish_method_declaration ($3); }
1009 | method_header error
1010 {YYNOT_TWICE yyerror ("'{' expected"); RECOVER;}
1014 type method_declarator throws
1015 { $$ = method_header (0, $1, $2, $3); }
1016 | VOID_TK method_declarator throws
1017 { $$ = method_header (0, void_type_node, $2, $3); }
1018 | modifiers type method_declarator throws
1019 { $$ = method_header ($1, $2, $3, $4); }
1020 | modifiers VOID_TK method_declarator throws
1021 { $$ = method_header ($1, void_type_node, $3, $4); }
1024 yyerror ("Invalid method declaration, method name required");
1027 | modifiers type error
1029 yyerror ("Identifier expected");
1034 yyerror ("Identifier expected");
1037 | modifiers VOID_TK error
1039 yyerror ("Identifier expected");
1044 yyerror ("Invalid method declaration, return type required");
1050 identifier OP_TK CP_TK
1052 ctxp->formal_parameter_number = 0;
1053 $$ = method_declarator ($1, NULL_TREE);
1055 | identifier OP_TK formal_parameter_list CP_TK
1056 { $$ = method_declarator ($1, $3); }
1057 | method_declarator OSB_TK CSB_TK
1059 EXPR_WFL_LINECOL (wfl_operator) = $2.location;
1061 build_unresolved_array_type (TREE_PURPOSE ($1));
1062 parse_warning_context
1064 "Discouraged form of returned type specification");
1066 | identifier OP_TK error
1067 {yyerror ("')' expected"); DRECOVER(method_declarator);}
1068 | method_declarator OSB_TK error
1069 {yyerror ("']' expected"); RECOVER;}
1072 formal_parameter_list:
1075 ctxp->formal_parameter_number = 1;
1077 | formal_parameter_list C_TK formal_parameter
1079 ctxp->formal_parameter_number += 1;
1080 $$ = chainon ($1, $3);
1082 | formal_parameter_list C_TK error
1083 { yyerror ("Missing formal parameter term"); RECOVER; }
1087 type variable_declarator_id
1089 $$ = build_tree_list ($2, $1);
1091 | final type variable_declarator_id /* Added, JDK1.1 final parms */
1093 $$ = build_tree_list ($3, $2);
1094 ARG_FINAL_P ($$) = 1;
1098 yyerror ("Missing identifier"); RECOVER;
1103 yyerror ("Missing identifier"); RECOVER;
1111 check_modifiers ("Illegal modifier `%s'. Only `final' was expected here",
1113 if ($1 != ACC_FINAL)
1114 MODIFIER_WFL (FINAL_TK) = build_wfl_node (NULL_TREE);
1120 | THROWS_TK class_type_list
1123 {yyerror ("Missing class type term"); RECOVER;}
1128 { $$ = build_tree_list ($1, $1); }
1129 | class_type_list C_TK class_type
1130 { $$ = tree_cons ($3, $3, $1); }
1131 | class_type_list C_TK error
1132 {yyerror ("Missing class type term"); RECOVER;}
1137 | SC_TK { $$ = NULL_TREE; }
1140 /* 19.8.4 Productions from 8.5: Static Initializers */
1144 TREE_CHAIN ($2) = CPC_STATIC_INITIALIZER_STMT (ctxp);
1145 SET_CPC_STATIC_INITIALIZER_STMT (ctxp, $2);
1146 current_static_block = NULL_TREE;
1150 static: /* Test lval.sub_token here */
1153 check_modifiers ("Illegal modifier `%s' for static initializer", $1, ACC_STATIC);
1154 /* Can't have a static initializer in an innerclass */
1155 if ($1 | ACC_STATIC &&
1156 GET_CPC_LIST () && !TOPLEVEL_CLASS_DECL_P (GET_CPC ()))
1158 (MODIFIER_WFL (STATIC_TK),
1159 "Can't define static initializer in class `%s'. Static initializer can only be defined in top-level classes",
1160 IDENTIFIER_POINTER (DECL_NAME (GET_CPC ())));
1161 SOURCE_FRONTEND_DEBUG (("Modifiers: %d", $1));
1165 /* 19.8.5 Productions from 8.6: Constructor Declarations */
1166 constructor_declaration:
1169 current_function_decl = $1;
1170 source_start_java_method (current_function_decl);
1173 { finish_method_declaration ($3); }
1177 constructor_declarator throws
1178 { $$ = method_header (0, NULL_TREE, $1, $2); }
1179 | modifiers constructor_declarator throws
1180 { $$ = method_header ($1, NULL_TREE, $2, $3); }
1183 constructor_declarator:
1184 simple_name OP_TK CP_TK
1186 ctxp->formal_parameter_number = 0;
1187 $$ = method_declarator ($1, NULL_TREE);
1189 | simple_name OP_TK formal_parameter_list CP_TK
1190 { $$ = method_declarator ($1, $3); }
1194 /* Unlike regular method, we always need a complete (empty)
1195 body so we can safely perform all the required code
1196 addition (super invocation and field initialization) */
1197 block_begin constructor_block_end
1199 BLOCK_EXPR_BODY ($2) = empty_stmt_node;
1202 | block_begin explicit_constructor_invocation constructor_block_end
1204 | block_begin block_statements constructor_block_end
1206 | block_begin explicit_constructor_invocation block_statements constructor_block_end
1210 constructor_block_end:
1214 /* Error recovery for that rule moved down expression_statement: rule. */
1215 explicit_constructor_invocation:
1216 this_or_super OP_TK CP_TK SC_TK
1218 $$ = build_method_invocation ($1, NULL_TREE);
1219 $$ = build_debugable_stmt (EXPR_WFL_LINECOL ($1), $$);
1220 $$ = java_method_add_stmt (current_function_decl, $$);
1222 | this_or_super OP_TK argument_list CP_TK SC_TK
1224 $$ = build_method_invocation ($1, $3);
1225 $$ = build_debugable_stmt (EXPR_WFL_LINECOL ($1), $$);
1226 $$ = java_method_add_stmt (current_function_decl, $$);
1228 /* Added, JDK1.1 inner classes. Modified because the rule
1229 'primary' couldn't work. */
1230 | name DOT_TK SUPER_TK OP_TK argument_list CP_TK SC_TK
1231 {$$ = parse_jdk1_1_error ("explicit constructor invocation"); }
1232 | name DOT_TK SUPER_TK OP_TK CP_TK SC_TK
1233 {$$ = parse_jdk1_1_error ("explicit constructor invocation"); }
1236 this_or_super: /* Added, simplifies error diagnostics */
1239 tree wfl = build_wfl_node (this_identifier_node);
1240 EXPR_WFL_LINECOL (wfl) = $1.location;
1245 tree wfl = build_wfl_node (super_identifier_node);
1246 EXPR_WFL_LINECOL (wfl) = $1.location;
1251 /* 19.9 Productions from 9: Interfaces */
1252 /* 19.9.1 Productions from 9.1: Interfaces Declarations */
1253 interface_declaration:
1254 INTERFACE_TK identifier
1255 { create_interface (0, $2, NULL_TREE); }
1258 | modifiers INTERFACE_TK identifier
1259 { create_interface ($1, $3, NULL_TREE); }
1262 | INTERFACE_TK identifier extends_interfaces
1263 { create_interface (0, $2, $3); }
1266 | modifiers INTERFACE_TK identifier extends_interfaces
1267 { create_interface ($1, $3, $4); }
1270 | INTERFACE_TK identifier error
1271 { yyerror ("'{' expected"); RECOVER; }
1272 | modifiers INTERFACE_TK identifier error
1273 { yyerror ("'{' expected"); RECOVER; }
1277 EXTENDS_TK interface_type
1279 ctxp->interface_number = 1;
1280 $$ = build_tree_list ($2, NULL_TREE);
1282 | extends_interfaces C_TK interface_type
1284 ctxp->interface_number++;
1285 $$ = chainon ($1, build_tree_list ($3, NULL_TREE));
1288 {yyerror ("Invalid interface type"); RECOVER;}
1289 | extends_interfaces C_TK error
1290 {yyerror ("Missing term"); RECOVER;}
1296 | OCB_TK interface_member_declarations CCB_TK
1300 interface_member_declarations:
1301 interface_member_declaration
1302 | interface_member_declarations interface_member_declaration
1305 interface_member_declaration:
1306 constant_declaration
1307 | abstract_method_declaration
1308 | class_declaration /* Added, JDK1.1 inner classes */
1309 { end_class_declaration (1); }
1310 | interface_declaration /* Added, JDK1.1 inner interfaces */
1311 { end_class_declaration (1); }
1314 constant_declaration:
1318 abstract_method_declaration:
1321 check_abstract_method_header ($1);
1322 current_function_decl = NULL_TREE; /* FIXME ? */
1324 | method_header error
1325 {yyerror ("';' expected"); RECOVER;}
1328 /* 19.10 Productions from 10: Arrays */
1331 { $$ = build_new_array_init ($1.location, NULL_TREE); }
1332 | OCB_TK C_TK CCB_TK
1333 { $$ = build_new_array_init ($1.location, NULL_TREE); }
1334 | OCB_TK variable_initializers CCB_TK
1335 { $$ = build_new_array_init ($1.location, $2); }
1336 | OCB_TK variable_initializers C_TK CCB_TK
1337 { $$ = build_new_array_init ($1.location, $2); }
1340 variable_initializers:
1341 variable_initializer
1343 $$ = tree_cons (maybe_build_array_element_wfl ($1),
1346 | variable_initializers C_TK variable_initializer
1348 $$ = tree_cons (maybe_build_array_element_wfl ($3), $3, $1);
1350 | variable_initializers C_TK error
1351 {yyerror ("Missing term"); RECOVER;}
1354 /* 19.11 Production from 14: Blocks and Statements */
1356 block_begin block_end
1358 | block_begin block_statements block_end
1370 maybe_absorb_scoping_blocks ();
1371 /* Store the location of the `}' when doing xrefs */
1372 if (current_function_decl && flag_emit_xref)
1373 DECL_END_SOURCE_LINE (current_function_decl) =
1374 EXPR_WFL_ADD_COL ($1.location, 1);
1376 if (!BLOCK_SUBBLOCKS ($$))
1377 BLOCK_SUBBLOCKS ($$) = empty_stmt_node;
1383 | block_statements block_statement
1387 local_variable_declaration_statement
1389 { java_method_add_stmt (current_function_decl, $1); }
1390 | class_declaration /* Added, JDK1.1 local classes */
1392 LOCAL_CLASS_P (TREE_TYPE (GET_CPC ())) = 1;
1393 end_class_declaration (1);
1397 local_variable_declaration_statement:
1398 local_variable_declaration SC_TK /* Can't catch missing ';' here */
1401 local_variable_declaration:
1402 type variable_declarators
1403 { declare_local_variables (0, $1, $2); }
1404 | final type variable_declarators /* Added, JDK1.1 final locals */
1405 { declare_local_variables ($1, $2, $3); }
1409 statement_without_trailing_substatement
1412 | if_then_else_statement
1415 { $$ = exit_block (); }
1419 statement_without_trailing_substatement
1420 | labeled_statement_nsi
1421 | if_then_else_statement_nsi
1422 | while_statement_nsi
1424 { $$ = exit_block (); }
1427 statement_without_trailing_substatement:
1430 | expression_statement
1434 | continue_statement
1436 | synchronized_statement
1445 if (flag_extraneous_semicolon
1446 && ! current_static_block
1447 && (! current_function_decl ||
1448 /* Verify we're not in a inner class declaration */
1449 (GET_CPC () != TYPE_NAME
1450 (DECL_CONTEXT (current_function_decl)))))
1453 EXPR_WFL_SET_LINECOL (wfl_operator, input_line, -1);
1454 parse_warning_context (wfl_operator, "An empty declaration is a deprecated feature that should not be used");
1456 $$ = empty_stmt_node;
1461 identifier REL_CL_TK
1463 $$ = build_labeled_block (EXPR_WFL_LINECOL ($1),
1464 EXPR_WFL_NODE ($1));
1466 push_labeled_block ($$);
1467 PUSH_LABELED_BLOCK ($$);
1472 label_decl statement
1473 { $$ = finish_labeled_statement ($1, $2); }
1475 {yyerror ("':' expected"); RECOVER;}
1478 labeled_statement_nsi:
1479 label_decl statement_nsi
1480 { $$ = finish_labeled_statement ($1, $2); }
1483 /* We concentrate here a bunch of error handling rules that we couldn't write
1484 earlier, because expression_statement catches a missing ';'. */
1485 expression_statement:
1486 statement_expression SC_TK
1488 /* We have a statement. Generate a WFL around it so
1490 $$ = build_expr_wfl ($1, input_filename, input_line, 0);
1491 /* We know we have a statement, so set the debug
1492 info to be eventually generate here. */
1493 $$ = JAVA_MAYBE_GENERATE_DEBUG_INFO ($$);
1497 YYNOT_TWICE yyerror ("Invalid expression statement");
1498 DRECOVER (expr_stmt);
1502 YYNOT_TWICE yyerror ("Invalid expression statement");
1503 DRECOVER (expr_stmt);
1507 YYNOT_TWICE yyerror ("Invalid expression statement");
1508 DRECOVER (expr_stmt);
1510 | this_or_super OP_TK error
1511 {yyerror ("')' expected"); RECOVER;}
1512 | this_or_super OP_TK CP_TK error
1514 parse_ctor_invocation_error ();
1517 | this_or_super OP_TK argument_list error
1518 {yyerror ("')' expected"); RECOVER;}
1519 | this_or_super OP_TK argument_list CP_TK error
1521 parse_ctor_invocation_error ();
1524 | name DOT_TK SUPER_TK error
1525 {yyerror ("'(' expected"); RECOVER;}
1526 | name DOT_TK SUPER_TK OP_TK error
1527 {yyerror ("')' expected"); RECOVER;}
1528 | name DOT_TK SUPER_TK OP_TK argument_list error
1529 {yyerror ("')' expected"); RECOVER;}
1530 | name DOT_TK SUPER_TK OP_TK argument_list CP_TK error
1531 {yyerror ("';' expected"); RECOVER;}
1532 | name DOT_TK SUPER_TK OP_TK CP_TK error
1533 {yyerror ("';' expected"); RECOVER;}
1536 statement_expression:
1538 | pre_increment_expression
1539 | pre_decrement_expression
1540 | post_increment_expression
1541 | post_decrement_expression
1543 | class_instance_creation_expression
1547 IF_TK OP_TK expression CP_TK statement
1549 $$ = build_if_else_statement ($2.location, $3,
1553 {yyerror ("'(' expected"); RECOVER;}
1555 {yyerror ("Missing term"); RECOVER;}
1556 | IF_TK OP_TK expression error
1557 {yyerror ("')' expected"); RECOVER;}
1560 if_then_else_statement:
1561 IF_TK OP_TK expression CP_TK statement_nsi ELSE_TK statement
1562 { $$ = build_if_else_statement ($2.location, $3, $5, $7); }
1565 if_then_else_statement_nsi:
1566 IF_TK OP_TK expression CP_TK statement_nsi ELSE_TK statement_nsi
1567 { $$ = build_if_else_statement ($2.location, $3, $5, $7); }
1577 /* Make into "proper list" of COMPOUND_EXPRs.
1578 I.e. make the last statement also have its own
1580 maybe_absorb_scoping_blocks ();
1581 TREE_OPERAND ($1, 1) = exit_block ();
1582 $$ = build_debugable_stmt (EXPR_WFL_LINECOL ($1), $1);
1587 SWITCH_TK OP_TK expression CP_TK
1589 $$ = build (SWITCH_EXPR, NULL_TREE, $3, NULL_TREE);
1590 EXPR_WFL_LINECOL ($$) = $2.location;
1593 {yyerror ("'(' expected"); RECOVER;}
1594 | SWITCH_TK OP_TK error
1595 {yyerror ("Missing term or ')'"); DRECOVER(switch_statement);}
1596 | SWITCH_TK OP_TK expression CP_TK error
1597 {yyerror ("'{' expected"); RECOVER;}
1600 /* Default assignment is there to avoid type node on switch_block
1606 | OCB_TK switch_labels CCB_TK
1608 | OCB_TK switch_block_statement_groups CCB_TK
1610 | OCB_TK switch_block_statement_groups switch_labels CCB_TK
1614 switch_block_statement_groups:
1615 switch_block_statement_group
1616 | switch_block_statement_groups switch_block_statement_group
1619 switch_block_statement_group:
1620 switch_labels block_statements
1625 | switch_labels switch_label
1629 CASE_TK constant_expression REL_CL_TK
1631 tree lab = build1 (CASE_EXPR, NULL_TREE, $2);
1632 EXPR_WFL_LINECOL (lab) = $1.location;
1633 java_method_add_stmt (current_function_decl, lab);
1635 | DEFAULT_TK REL_CL_TK
1637 tree lab = build (DEFAULT_EXPR, NULL_TREE, NULL_TREE);
1638 EXPR_WFL_LINECOL (lab) = $1.location;
1639 java_method_add_stmt (current_function_decl, lab);
1642 {yyerror ("Missing or invalid constant expression"); RECOVER;}
1643 | CASE_TK constant_expression error
1644 {yyerror ("':' expected"); RECOVER;}
1646 {yyerror ("':' expected"); RECOVER;}
1650 WHILE_TK OP_TK expression CP_TK
1652 tree body = build_loop_body ($2.location, $3, 0);
1653 $$ = build_new_loop (body);
1658 while_expression statement
1659 { $$ = finish_loop_body (0, NULL_TREE, $2, 0); }
1661 {YYERROR_NOW; yyerror ("'(' expected"); RECOVER;}
1662 | WHILE_TK OP_TK error
1663 {yyerror ("Missing term and ')' expected"); RECOVER;}
1664 | WHILE_TK OP_TK expression error
1665 {yyerror ("')' expected"); RECOVER;}
1668 while_statement_nsi:
1669 while_expression statement_nsi
1670 { $$ = finish_loop_body (0, NULL_TREE, $2, 0); }
1676 tree body = build_loop_body (0, NULL_TREE, 1);
1677 $$ = build_new_loop (body);
1679 /* Need error handing here. FIXME */
1683 do_statement_begin statement WHILE_TK OP_TK expression CP_TK SC_TK
1684 { $$ = finish_loop_body ($4.location, $5, $2, 1); }
1688 for_begin SC_TK expression SC_TK for_update CP_TK statement
1690 if (TREE_CODE_CLASS (TREE_CODE ($3)) == 'c')
1691 $3 = build_wfl_node ($3);
1692 $$ = finish_for_loop (EXPR_WFL_LINECOL ($3), $3, $5, $7);
1694 | for_begin SC_TK SC_TK for_update CP_TK statement
1696 $$ = finish_for_loop (0, NULL_TREE, $4, $6);
1697 /* We have not condition, so we get rid of the EXIT_EXPR */
1698 LOOP_EXPR_BODY_CONDITION_EXPR (LOOP_EXPR_BODY ($$), 0) =
1701 | for_begin SC_TK error
1702 {yyerror ("Invalid control expression"); RECOVER;}
1703 | for_begin SC_TK expression SC_TK error
1704 {yyerror ("Invalid update expression"); RECOVER;}
1705 | for_begin SC_TK SC_TK error
1706 {yyerror ("Invalid update expression"); RECOVER;}
1710 for_begin SC_TK expression SC_TK for_update CP_TK statement_nsi
1711 { $$ = finish_for_loop (EXPR_WFL_LINECOL ($3), $3, $5, $7);}
1712 | for_begin SC_TK SC_TK for_update CP_TK statement_nsi
1714 $$ = finish_for_loop (0, NULL_TREE, $4, $6);
1715 /* We have not condition, so we get rid of the EXIT_EXPR */
1716 LOOP_EXPR_BODY_CONDITION_EXPR (LOOP_EXPR_BODY ($$), 0) =
1724 /* This scope defined for local variable that may be
1725 defined within the scope of the for loop */
1729 {yyerror ("'(' expected"); DRECOVER(for_1);}
1730 | FOR_TK OP_TK error
1731 {yyerror ("Invalid init statement"); RECOVER;}
1737 /* We now declare the loop body. The loop is
1738 declared as a for loop. */
1739 tree body = build_loop_body (0, NULL_TREE, 0);
1740 $$ = build_new_loop (body);
1741 FOR_LOOP_P ($$) = 1;
1742 /* The loop is added to the current block the for
1743 statement is defined within */
1744 java_method_add_stmt (current_function_decl, $$);
1747 for_init: /* Can be empty */
1748 { $$ = empty_stmt_node; }
1749 | statement_expression_list
1751 /* Init statement recorded within the previously
1752 defined block scope */
1753 $$ = java_method_add_stmt (current_function_decl, $1);
1755 | local_variable_declaration
1757 /* Local variable are recorded within the previously
1758 defined block scope */
1761 | statement_expression_list error
1762 {yyerror ("';' expected"); DRECOVER(for_init_1);}
1765 for_update: /* Can be empty */
1766 {$$ = empty_stmt_node;}
1767 | statement_expression_list
1768 { $$ = build_debugable_stmt (BUILD_LOCATION (), $1); }
1771 statement_expression_list:
1772 statement_expression
1773 { $$ = add_stmt_to_compound (NULL_TREE, NULL_TREE, $1); }
1774 | statement_expression_list C_TK statement_expression
1775 { $$ = add_stmt_to_compound ($1, NULL_TREE, $3); }
1776 | statement_expression_list C_TK error
1777 {yyerror ("Missing term"); RECOVER;}
1782 { $$ = build_bc_statement ($1.location, 1, NULL_TREE); }
1783 | BREAK_TK identifier SC_TK
1784 { $$ = build_bc_statement ($1.location, 1, $2); }
1786 {yyerror ("Missing term"); RECOVER;}
1787 | BREAK_TK identifier error
1788 {yyerror ("';' expected"); RECOVER;}
1793 { $$ = build_bc_statement ($1.location, 0, NULL_TREE); }
1794 | CONTINUE_TK identifier SC_TK
1795 { $$ = build_bc_statement ($1.location, 0, $2); }
1797 {yyerror ("Missing term"); RECOVER;}
1798 | CONTINUE_TK identifier error
1799 {yyerror ("';' expected"); RECOVER;}
1804 { $$ = build_return ($1.location, NULL_TREE); }
1805 | RETURN_TK expression SC_TK
1806 { $$ = build_return ($1.location, $2); }
1808 {yyerror ("Missing term"); RECOVER;}
1809 | RETURN_TK expression error
1810 {yyerror ("';' expected"); RECOVER;}
1814 THROW_TK expression SC_TK
1816 $$ = build1 (THROW_EXPR, NULL_TREE, $2);
1817 EXPR_WFL_LINECOL ($$) = $1.location;
1820 {yyerror ("Missing term"); RECOVER;}
1821 | THROW_TK expression error
1822 {yyerror ("';' expected"); RECOVER;}
1826 ASSERT_TK expression REL_CL_TK expression SC_TK
1828 $$ = build_assertion ($1.location, $2, $4);
1830 | ASSERT_TK expression SC_TK
1832 $$ = build_assertion ($1.location, $2, NULL_TREE);
1835 {yyerror ("Missing term"); RECOVER;}
1836 | ASSERT_TK expression error
1837 {yyerror ("';' expected"); RECOVER;}
1840 synchronized_statement:
1841 synchronized OP_TK expression CP_TK block
1843 $$ = build (SYNCHRONIZED_EXPR, NULL_TREE, $3, $5);
1844 EXPR_WFL_LINECOL ($$) =
1845 EXPR_WFL_LINECOL (MODIFIER_WFL (SYNCHRONIZED_TK));
1847 | synchronized OP_TK expression CP_TK error
1848 {yyerror ("'{' expected"); RECOVER;}
1849 | synchronized error
1850 {yyerror ("'(' expected"); RECOVER;}
1851 | synchronized OP_TK error CP_TK
1852 {yyerror ("Missing term"); RECOVER;}
1853 | synchronized OP_TK error
1854 {yyerror ("Missing term"); RECOVER;}
1861 "Illegal modifier `%s'. Only `synchronized' was expected here",
1862 $1, ACC_SYNCHRONIZED);
1863 if ($1 != ACC_SYNCHRONIZED)
1864 MODIFIER_WFL (SYNCHRONIZED_TK) =
1865 build_wfl_node (NULL_TREE);
1870 TRY_TK block catches
1871 { $$ = build_try_statement ($1.location, $2, $3); }
1872 | TRY_TK block finally
1873 { $$ = build_try_finally_statement ($1.location, $2, $3); }
1874 | TRY_TK block catches finally
1875 { $$ = build_try_finally_statement
1876 ($1.location, build_try_statement ($1.location,
1880 {yyerror ("'{' expected"); DRECOVER (try_statement);}
1885 | catches catch_clause
1887 TREE_CHAIN ($2) = $1;
1893 catch_clause_parameter block
1895 java_method_add_stmt (current_function_decl, $2);
1901 catch_clause_parameter:
1902 CATCH_TK OP_TK formal_parameter CP_TK
1904 /* We add a block to define a scope for
1905 formal_parameter (CCBP). The formal parameter is
1906 declared initialized by the appropriate function
1908 tree ccpb = enter_block ();
1909 tree init = build_assignment
1910 (ASSIGN_TK, $2.location, TREE_PURPOSE ($3),
1911 build (JAVA_EXC_OBJ_EXPR, ptr_type_node));
1912 declare_local_variables (0, TREE_VALUE ($3),
1913 build_tree_list (TREE_PURPOSE ($3),
1915 $$ = build1 (CATCH_EXPR, NULL_TREE, ccpb);
1916 EXPR_WFL_LINECOL ($$) = $1.location;
1919 {yyerror ("'(' expected"); RECOVER; $$ = NULL_TREE;}
1920 | CATCH_TK OP_TK error
1922 yyerror ("Missing term or ')' expected");
1923 RECOVER; $$ = NULL_TREE;
1925 | CATCH_TK OP_TK error CP_TK /* That's for () */
1926 {yyerror ("Missing term"); RECOVER; $$ = NULL_TREE;}
1933 {yyerror ("'{' expected"); RECOVER; }
1936 /* 19.12 Production from 15: Expressions */
1938 primary_no_new_array
1939 | array_creation_expression
1942 primary_no_new_array:
1945 { $$ = build_this ($1.location); }
1946 | OP_TK expression CP_TK
1948 | class_instance_creation_expression
1953 /* Added, JDK1.1 inner classes. Documentation is wrong
1954 refering to a 'ClassName' (class_name) rule that doesn't
1955 exist. Used name: instead. */
1956 | name DOT_TK THIS_TK
1958 tree wfl = build_wfl_node (this_identifier_node);
1959 $$ = make_qualified_primary ($1, wfl, EXPR_WFL_LINECOL ($1));
1961 | OP_TK expression error
1962 {yyerror ("')' expected"); RECOVER;}
1964 {yyerror ("'class' or 'this' expected" ); RECOVER;}
1965 | primitive_type DOT_TK error
1966 {yyerror ("'class' expected" ); RECOVER;}
1967 | VOID_TK DOT_TK error
1968 {yyerror ("'class' expected" ); RECOVER;}
1972 name DOT_TK CLASS_TK
1973 { $$ = build_incomplete_class_ref ($2.location, $1); }
1974 | array_type DOT_TK CLASS_TK
1975 { $$ = build_incomplete_class_ref ($2.location, $1); }
1976 | primitive_type DOT_TK CLASS_TK
1977 { $$ = build_incomplete_class_ref ($2.location, $1); }
1978 | VOID_TK DOT_TK CLASS_TK
1980 $$ = build_incomplete_class_ref ($2.location,
1985 class_instance_creation_expression:
1986 NEW_TK class_type OP_TK argument_list CP_TK
1987 { $$ = build_new_invocation ($2, $4); }
1988 | NEW_TK class_type OP_TK CP_TK
1989 { $$ = build_new_invocation ($2, NULL_TREE); }
1990 | anonymous_class_creation
1991 /* Added, JDK1.1 inner classes, modified to use name or
1992 primary instead of primary solely which couldn't work in
1994 | something_dot_new identifier OP_TK CP_TK
1996 tree ctor = build_new_invocation ($2, NULL_TREE);
1997 $$ = make_qualified_primary ($1, ctor,
1998 EXPR_WFL_LINECOL ($1));
2000 | something_dot_new identifier OP_TK CP_TK class_body
2001 | something_dot_new identifier OP_TK argument_list CP_TK
2003 tree ctor = build_new_invocation ($2, $4);
2004 $$ = make_qualified_primary ($1, ctor,
2005 EXPR_WFL_LINECOL ($1));
2007 | something_dot_new identifier OP_TK argument_list CP_TK class_body
2008 | NEW_TK error SC_TK
2009 {yyerror ("'(' expected"); DRECOVER(new_1);}
2010 | NEW_TK class_type error
2011 {yyerror ("'(' expected"); RECOVER;}
2012 | NEW_TK class_type OP_TK error
2013 {yyerror ("')' or term expected"); RECOVER;}
2014 | NEW_TK class_type OP_TK argument_list error
2015 {yyerror ("')' expected"); RECOVER;}
2016 | something_dot_new error
2017 {YYERROR_NOW; yyerror ("Identifier expected"); RECOVER;}
2018 | something_dot_new identifier error
2019 {yyerror ("'(' expected"); RECOVER;}
2022 /* Created after JDK1.1 rules originally added to
2023 class_instance_creation_expression, but modified to use
2024 'class_type' instead of 'TypeName' (type_name) which is mentioned
2025 in the documentation but doesn't exist. */
2027 anonymous_class_creation:
2028 NEW_TK class_type OP_TK argument_list CP_TK
2029 { create_anonymous_class ($1.location, $2); }
2032 tree id = build_wfl_node (DECL_NAME (GET_CPC ()));
2033 EXPR_WFL_LINECOL (id) = EXPR_WFL_LINECOL ($2);
2035 end_class_declaration (1);
2037 /* Now we can craft the new expression */
2038 $$ = build_new_invocation (id, $4);
2040 /* Note that we can't possibly be here if
2041 `class_type' is an interface (in which case the
2042 anonymous class extends Object and implements
2043 `class_type', hence its constructor can't have
2046 /* Otherwise, the innerclass must feature a
2047 constructor matching `argument_list'. Anonymous
2048 classes are a bit special: it's impossible to
2049 define constructor for them, hence constructors
2050 must be generated following the hints provided by
2051 the `new' expression. Whether a super constructor
2052 of that nature exists or not is to be verified
2053 later on in verify_constructor_super.
2055 It's during the expansion of a `new' statement
2056 refering to an anonymous class that a ctor will
2057 be generated for the anonymous class, with the
2061 | NEW_TK class_type OP_TK CP_TK
2062 { create_anonymous_class ($1.location, $2); }
2065 tree id = build_wfl_node (DECL_NAME (GET_CPC ()));
2066 EXPR_WFL_LINECOL (id) = EXPR_WFL_LINECOL ($2);
2068 end_class_declaration (1);
2070 /* Now we can craft the new expression. The
2071 statement doesn't need to be remember so that a
2072 constructor can be generated, since its signature
2073 is already known. */
2074 $$ = build_new_invocation (id, NULL_TREE);
2078 something_dot_new: /* Added, not part of the specs. */
2081 | primary DOT_TK NEW_TK
2088 $$ = tree_cons (NULL_TREE, $1, NULL_TREE);
2089 ctxp->formal_parameter_number = 1;
2091 | argument_list C_TK expression
2093 ctxp->formal_parameter_number += 1;
2094 $$ = tree_cons (NULL_TREE, $3, $1);
2096 | argument_list C_TK error
2097 {yyerror ("Missing term"); RECOVER;}
2100 array_creation_expression:
2101 NEW_TK primitive_type dim_exprs
2102 { $$ = build_newarray_node ($2, $3, 0); }
2103 | NEW_TK class_or_interface_type dim_exprs
2104 { $$ = build_newarray_node ($2, $3, 0); }
2105 | NEW_TK primitive_type dim_exprs dims
2106 { $$ = build_newarray_node ($2, $3, pop_current_osb (ctxp));}
2107 | NEW_TK class_or_interface_type dim_exprs dims
2108 { $$ = build_newarray_node ($2, $3, pop_current_osb (ctxp));}
2109 /* Added, JDK1.1 anonymous array. Initial documentation rule
2111 | NEW_TK class_or_interface_type dims array_initializer
2114 int osb = pop_current_osb (ctxp);
2116 obstack_grow (&temporary_obstack, "[]", 2);
2117 obstack_1grow (&temporary_obstack, '\0');
2118 sig = obstack_finish (&temporary_obstack);
2119 $$ = build (NEW_ANONYMOUS_ARRAY_EXPR, NULL_TREE,
2120 $2, get_identifier (sig), $4);
2122 | NEW_TK primitive_type dims array_initializer
2124 int osb = pop_current_osb (ctxp);
2127 type = build_java_array_type (type, -1);
2128 $$ = build (NEW_ANONYMOUS_ARRAY_EXPR, NULL_TREE,
2129 build_pointer_type (type), NULL_TREE, $4);
2131 | NEW_TK error CSB_TK
2132 {yyerror ("'[' expected"); DRECOVER ("]");}
2133 | NEW_TK error OSB_TK
2134 {yyerror ("']' expected"); RECOVER;}
2139 { $$ = build_tree_list (NULL_TREE, $1); }
2140 | dim_exprs dim_expr
2141 { $$ = tree_cons (NULL_TREE, $2, $$); }
2145 OSB_TK expression CSB_TK
2147 if (JNUMERIC_TYPE_P (TREE_TYPE ($2)))
2149 $2 = build_wfl_node ($2);
2150 TREE_TYPE ($2) = NULL_TREE;
2152 EXPR_WFL_LINECOL ($2) = $1.location;
2155 | OSB_TK expression error
2156 {yyerror ("']' expected"); RECOVER;}
2159 yyerror ("Missing term");
2160 yyerror ("']' expected");
2169 /* If not initialized, allocate memory for the osb
2171 if (!ctxp->osb_limit)
2173 allocate = ctxp->osb_limit = 32;
2174 ctxp->osb_depth = -1;
2176 /* If capacity overflown, reallocate a bigger chunk */
2177 else if (ctxp->osb_depth+1 == ctxp->osb_limit)
2178 allocate = ctxp->osb_limit << 1;
2182 allocate *= sizeof (int);
2183 if (ctxp->osb_number)
2184 ctxp->osb_number = xrealloc (ctxp->osb_number,
2187 ctxp->osb_number = xmalloc (allocate);
2190 CURRENT_OSB (ctxp) = 1;
2192 | dims OSB_TK CSB_TK
2193 { CURRENT_OSB (ctxp)++; }
2195 { yyerror ("']' expected"); RECOVER;}
2199 primary DOT_TK identifier
2200 { $$ = make_qualified_primary ($1, $3, $2.location); }
2201 /* FIXME - REWRITE TO:
2202 { $$ = build_binop (COMPONENT_REF, $2.location, $1, $3); } */
2203 | SUPER_TK DOT_TK identifier
2205 tree super_wfl = build_wfl_node (super_identifier_node);
2206 EXPR_WFL_LINECOL (super_wfl) = $1.location;
2207 $$ = make_qualified_name (super_wfl, $3, $2.location);
2210 {yyerror ("Field expected"); DRECOVER (super_field_acces);}
2215 { $$ = build_method_invocation ($1, NULL_TREE); }
2216 | name OP_TK argument_list CP_TK
2217 { $$ = build_method_invocation ($1, $3); }
2218 | primary DOT_TK identifier OP_TK CP_TK
2220 if (TREE_CODE ($1) == THIS_EXPR)
2221 $$ = build_this_super_qualified_invocation
2222 (1, $3, NULL_TREE, 0, $2.location);
2225 tree invok = build_method_invocation ($3, NULL_TREE);
2226 $$ = make_qualified_primary ($1, invok, $2.location);
2229 | primary DOT_TK identifier OP_TK argument_list CP_TK
2231 if (TREE_CODE ($1) == THIS_EXPR)
2232 $$ = build_this_super_qualified_invocation
2233 (1, $3, $5, 0, $2.location);
2236 tree invok = build_method_invocation ($3, $5);
2237 $$ = make_qualified_primary ($1, invok, $2.location);
2240 | SUPER_TK DOT_TK identifier OP_TK CP_TK
2242 $$ = build_this_super_qualified_invocation
2243 (0, $3, NULL_TREE, $1.location, $2.location);
2245 | SUPER_TK DOT_TK identifier OP_TK argument_list CP_TK
2247 $$ = build_this_super_qualified_invocation
2248 (0, $3, $5, $1.location, $2.location);
2250 /* Screws up thing. I let it here until I'm convinced it can
2252 | primary DOT_TK error
2253 {yyerror ("'(' expected"); DRECOVER(bad);} */
2254 | SUPER_TK DOT_TK error CP_TK
2255 { yyerror ("'(' expected"); DRECOVER (method_invocation); }
2256 | SUPER_TK DOT_TK error DOT_TK
2257 { yyerror ("'(' expected"); DRECOVER (method_invocation); }
2261 name OSB_TK expression CSB_TK
2262 { $$ = build_array_ref ($2.location, $1, $3); }
2263 | primary_no_new_array OSB_TK expression CSB_TK
2264 { $$ = build_array_ref ($2.location, $1, $3); }
2267 yyerror ("Missing term and ']' expected");
2268 DRECOVER(array_access);
2270 | name OSB_TK expression error
2272 yyerror ("']' expected");
2273 DRECOVER(array_access);
2275 | primary_no_new_array OSB_TK error
2277 yyerror ("Missing term and ']' expected");
2278 DRECOVER(array_access);
2280 | primary_no_new_array OSB_TK expression error
2282 yyerror ("']' expected");
2283 DRECOVER(array_access);
2290 | post_increment_expression
2291 | post_decrement_expression
2294 post_increment_expression:
2295 postfix_expression INCR_TK
2296 { $$ = build_incdec ($2.token, $2.location, $1, 1); }
2299 post_decrement_expression:
2300 postfix_expression DECR_TK
2301 { $$ = build_incdec ($2.token, $2.location, $1, 1); }
2304 trap_overflow_corner_case:
2305 pre_increment_expression
2306 | pre_decrement_expression
2307 | PLUS_TK unary_expression
2308 {$$ = build_unaryop ($1.token, $1.location, $2); }
2309 | unary_expression_not_plus_minus
2311 {yyerror ("Missing term"); RECOVER}
2315 trap_overflow_corner_case
2317 error_if_numeric_overflow ($1);
2320 | MINUS_TK trap_overflow_corner_case
2321 {$$ = build_unaryop ($1.token, $1.location, $2); }
2323 {yyerror ("Missing term"); RECOVER}
2326 pre_increment_expression:
2327 INCR_TK unary_expression
2328 {$$ = build_incdec ($1.token, $1.location, $2, 0); }
2330 {yyerror ("Missing term"); RECOVER}
2333 pre_decrement_expression:
2334 DECR_TK unary_expression
2335 {$$ = build_incdec ($1.token, $1.location, $2, 0); }
2337 {yyerror ("Missing term"); RECOVER}
2340 unary_expression_not_plus_minus:
2342 | NOT_TK unary_expression
2343 {$$ = build_unaryop ($1.token, $1.location, $2); }
2344 | NEG_TK unary_expression
2345 {$$ = build_unaryop ($1.token, $1.location, $2); }
2348 {yyerror ("Missing term"); RECOVER}
2350 {yyerror ("Missing term"); RECOVER}
2353 cast_expression: /* Error handling here is potentially weak */
2354 OP_TK primitive_type dims CP_TK unary_expression
2357 int osb = pop_current_osb (ctxp);
2359 type = build_java_array_type (type, -1);
2360 $$ = build_cast ($1.location, type, $5);
2362 | OP_TK primitive_type CP_TK unary_expression
2363 { $$ = build_cast ($1.location, $2, $4); }
2364 | OP_TK expression CP_TK unary_expression_not_plus_minus
2365 { $$ = build_cast ($1.location, $2, $4); }
2366 | OP_TK name dims CP_TK unary_expression_not_plus_minus
2369 int osb = pop_current_osb (ctxp);
2370 obstack_grow (&temporary_obstack,
2371 IDENTIFIER_POINTER (EXPR_WFL_NODE ($2)),
2372 IDENTIFIER_LENGTH (EXPR_WFL_NODE ($2)));
2374 obstack_grow (&temporary_obstack, "[]", 2);
2375 obstack_1grow (&temporary_obstack, '\0');
2376 ptr = obstack_finish (&temporary_obstack);
2377 EXPR_WFL_NODE ($2) = get_identifier (ptr);
2378 $$ = build_cast ($1.location, $2, $5);
2380 | OP_TK primitive_type OSB_TK error
2381 {yyerror ("']' expected, invalid type expression");}
2384 YYNOT_TWICE yyerror ("Invalid type expression"); RECOVER;
2387 | OP_TK primitive_type dims CP_TK error
2388 {yyerror ("Missing term"); RECOVER;}
2389 | OP_TK primitive_type CP_TK error
2390 {yyerror ("Missing term"); RECOVER;}
2391 | OP_TK name dims CP_TK error
2392 {yyerror ("Missing term"); RECOVER;}
2395 multiplicative_expression:
2397 | multiplicative_expression MULT_TK unary_expression
2399 $$ = build_binop (BINOP_LOOKUP ($2.token),
2400 $2.location, $1, $3);
2402 | multiplicative_expression DIV_TK unary_expression
2404 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2407 | multiplicative_expression REM_TK unary_expression
2409 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2412 | multiplicative_expression MULT_TK error
2413 {yyerror ("Missing term"); RECOVER;}
2414 | multiplicative_expression DIV_TK error
2415 {yyerror ("Missing term"); RECOVER;}
2416 | multiplicative_expression REM_TK error
2417 {yyerror ("Missing term"); RECOVER;}
2420 additive_expression:
2421 multiplicative_expression
2422 | additive_expression PLUS_TK multiplicative_expression
2424 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2427 | additive_expression MINUS_TK multiplicative_expression
2429 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2432 | additive_expression PLUS_TK error
2433 {yyerror ("Missing term"); RECOVER;}
2434 | additive_expression MINUS_TK error
2435 {yyerror ("Missing term"); RECOVER;}
2440 | shift_expression LS_TK additive_expression
2442 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2445 | shift_expression SRS_TK additive_expression
2447 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2450 | shift_expression ZRS_TK additive_expression
2452 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2455 | shift_expression LS_TK error
2456 {yyerror ("Missing term"); RECOVER;}
2457 | shift_expression SRS_TK error
2458 {yyerror ("Missing term"); RECOVER;}
2459 | shift_expression ZRS_TK error
2460 {yyerror ("Missing term"); RECOVER;}
2463 relational_expression:
2465 | relational_expression LT_TK shift_expression
2467 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2470 | relational_expression GT_TK shift_expression
2472 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2475 | relational_expression LTE_TK shift_expression
2477 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2480 | relational_expression GTE_TK shift_expression
2482 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2485 | relational_expression INSTANCEOF_TK reference_type
2486 { $$ = build_binop (INSTANCEOF_EXPR, $2.location, $1, $3); }
2487 | relational_expression LT_TK error
2488 {yyerror ("Missing term"); RECOVER;}
2489 | relational_expression GT_TK error
2490 {yyerror ("Missing term"); RECOVER;}
2491 | relational_expression LTE_TK error
2492 {yyerror ("Missing term"); RECOVER;}
2493 | relational_expression GTE_TK error
2494 {yyerror ("Missing term"); RECOVER;}
2495 | relational_expression INSTANCEOF_TK error
2496 {yyerror ("Invalid reference type"); RECOVER;}
2499 equality_expression:
2500 relational_expression
2501 | equality_expression EQ_TK relational_expression
2503 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2506 | equality_expression NEQ_TK relational_expression
2508 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2511 | equality_expression EQ_TK error
2512 {yyerror ("Missing term"); RECOVER;}
2513 | equality_expression NEQ_TK error
2514 {yyerror ("Missing term"); RECOVER;}
2519 | and_expression AND_TK equality_expression
2521 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2524 | and_expression AND_TK error
2525 {yyerror ("Missing term"); RECOVER;}
2528 exclusive_or_expression:
2530 | exclusive_or_expression XOR_TK and_expression
2532 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2535 | exclusive_or_expression XOR_TK error
2536 {yyerror ("Missing term"); RECOVER;}
2539 inclusive_or_expression:
2540 exclusive_or_expression
2541 | inclusive_or_expression OR_TK exclusive_or_expression
2543 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2546 | inclusive_or_expression OR_TK error
2547 {yyerror ("Missing term"); RECOVER;}
2550 conditional_and_expression:
2551 inclusive_or_expression
2552 | conditional_and_expression BOOL_AND_TK inclusive_or_expression
2554 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2557 | conditional_and_expression BOOL_AND_TK error
2558 {yyerror ("Missing term"); RECOVER;}
2561 conditional_or_expression:
2562 conditional_and_expression
2563 | conditional_or_expression BOOL_OR_TK conditional_and_expression
2565 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2568 | conditional_or_expression BOOL_OR_TK error
2569 {yyerror ("Missing term"); RECOVER;}
2572 conditional_expression: /* Error handling here is weak */
2573 conditional_or_expression
2574 | conditional_or_expression REL_QM_TK expression REL_CL_TK conditional_expression
2576 $$ = build (CONDITIONAL_EXPR, NULL_TREE, $1, $3, $5);
2577 EXPR_WFL_LINECOL ($$) = $2.location;
2579 | conditional_or_expression REL_QM_TK REL_CL_TK error
2582 yyerror ("Missing term");
2585 | conditional_or_expression REL_QM_TK error
2586 {yyerror ("Missing term"); DRECOVER (2);}
2587 | conditional_or_expression REL_QM_TK expression REL_CL_TK error
2588 {yyerror ("Missing term"); DRECOVER (3);}
2591 assignment_expression:
2592 conditional_expression
2597 left_hand_side assignment_operator assignment_expression
2598 { $$ = build_assignment ($2.token, $2.location, $1, $3); }
2599 | left_hand_side assignment_operator error
2601 YYNOT_TWICE yyerror ("Missing term");
2612 assignment_operator:
2618 assignment_expression
2621 constant_expression:
2627 /* Helper function to retrieve an OSB count. Should be used when the
2628 `dims:' rule is being used. */
2631 pop_current_osb (struct parser_ctxt *ctxp)
2635 if (ctxp->osb_depth < 0)
2638 to_return = CURRENT_OSB (ctxp);
2646 /* This section of the code deal with save/restoring parser contexts.
2647 Add mode documentation here. FIXME */
2649 /* Helper function. Create a new parser context. With
2650 COPY_FROM_PREVIOUS set to a nonzero value, content of the previous
2651 context is copied, otherwise, the new context is zeroed. The newly
2652 created context becomes the current one. */
2655 create_new_parser_context (int copy_from_previous)
2657 struct parser_ctxt *new;
2659 new = ggc_alloc (sizeof (struct parser_ctxt));
2660 if (copy_from_previous)
2662 memcpy (new, ctxp, sizeof (struct parser_ctxt));
2663 /* This flag, indicating the context saves global values,
2664 should only be set by java_parser_context_save_global. */
2665 new->saved_data_ctx = 0;
2668 memset (new, 0, sizeof (struct parser_ctxt));
2674 /* Create a new parser context and make it the current one. */
2677 java_push_parser_context (void)
2679 create_new_parser_context (0);
2683 java_pop_parser_context (int generate)
2686 struct parser_ctxt *toFree, *next;
2695 input_line = ctxp->lineno;
2696 current_class = ctxp->class_type;
2699 /* If the old and new lexers differ, then free the old one. */
2700 if (ctxp->lexer && next && ctxp->lexer != next->lexer)
2701 java_destroy_lexer (ctxp->lexer);
2703 /* Set the single import class file flag to 0 for the current list
2704 of imported things */
2705 for (current = ctxp->import_list; current; current = TREE_CHAIN (current))
2706 IS_A_SINGLE_IMPORT_CLASSFILE_NAME_P (TREE_VALUE (current)) = 0;
2708 /* And restore those of the previous context */
2709 if ((ctxp = next)) /* Assignment is really meant here */
2710 for (current = ctxp->import_list; current; current = TREE_CHAIN (current))
2711 IS_A_SINGLE_IMPORT_CLASSFILE_NAME_P (TREE_VALUE (current)) = 1;
2713 /* If we pushed a context to parse a class intended to be generated,
2714 we keep it so we can remember the class. What we could actually
2715 do is to just update a list of class names. */
2718 toFree->next = ctxp_for_generation;
2719 ctxp_for_generation = toFree;
2723 /* Create a parser context for the use of saving some global
2727 java_parser_context_save_global (void)
2731 java_push_parser_context ();
2732 ctxp->saved_data_ctx = 1;
2735 /* If this context already stores data, create a new one suitable
2736 for data storage. */
2737 else if (ctxp->saved_data)
2739 create_new_parser_context (1);
2740 ctxp->saved_data_ctx = 1;
2743 ctxp->lineno = input_line;
2744 ctxp->class_type = current_class;
2745 ctxp->filename = input_filename;
2746 ctxp->function_decl = current_function_decl;
2747 ctxp->saved_data = 1;
2750 /* Restore some global variables from the previous context. Make the
2751 previous context the current one. */
2754 java_parser_context_restore_global (void)
2756 input_line = ctxp->lineno;
2757 current_class = ctxp->class_type;
2758 input_filename = ctxp->filename;
2762 BUILD_FILENAME_IDENTIFIER_NODE (s, input_filename);
2763 EXPR_WFL_FILENAME_NODE (wfl_operator) = s;
2765 current_function_decl = ctxp->function_decl;
2766 ctxp->saved_data = 0;
2767 if (ctxp->saved_data_ctx)
2768 java_pop_parser_context (0);
2771 /* Suspend vital data for the current class/function being parsed so
2772 that an other class can be parsed. Used to let local/anonymous
2773 classes be parsed. */
2776 java_parser_context_suspend (void)
2778 /* This makes debugging through java_debug_context easier */
2779 static const char *const name = "<inner buffer context>";
2781 /* Duplicate the previous context, use it to save the globals we're
2783 create_new_parser_context (1);
2784 ctxp->function_decl = current_function_decl;
2785 ctxp->class_type = current_class;
2787 /* Then create a new context which inherits all data from the
2788 previous one. This will be the new current context */
2789 create_new_parser_context (1);
2791 /* Help debugging */
2792 ctxp->next->filename = name;
2795 /* Resume vital data for the current class/function being parsed so
2796 that an other class can be parsed. Used to let local/anonymous
2797 classes be parsed. The trick is the data storing file position
2798 informations must be restored to their current value, so parsing
2799 can resume as if no context was ever saved. */
2802 java_parser_context_resume (void)
2804 struct parser_ctxt *old = ctxp; /* This one is to be discarded */
2805 struct parser_ctxt *saver = old->next; /* This one contain saved info */
2806 struct parser_ctxt *restored = saver->next; /* This one is the old current */
2808 /* We need to inherit the list of classes to complete/generate */
2809 restored->classd_list = old->classd_list;
2810 restored->class_list = old->class_list;
2812 /* Restore the current class and function from the saver */
2813 current_class = saver->class_type;
2814 current_function_decl = saver->function_decl;
2816 /* Retrieve the restored context */
2819 /* Re-installed the data for the parsing to carry on */
2820 memcpy (&ctxp->marker_begining, &old->marker_begining,
2821 (size_t)(&ctxp->marker_end - &ctxp->marker_begining));
2824 /* Add a new anchor node to which all statement(s) initializing static
2825 and non static initialized upon declaration field(s) will be
2829 java_parser_context_push_initialized_field (void)
2833 node = build_tree_list (NULL_TREE, NULL_TREE);
2834 TREE_CHAIN (node) = CPC_STATIC_INITIALIZER_LIST (ctxp);
2835 CPC_STATIC_INITIALIZER_LIST (ctxp) = node;
2837 node = build_tree_list (NULL_TREE, NULL_TREE);
2838 TREE_CHAIN (node) = CPC_INITIALIZER_LIST (ctxp);
2839 CPC_INITIALIZER_LIST (ctxp) = node;
2841 node = build_tree_list (NULL_TREE, NULL_TREE);
2842 TREE_CHAIN (node) = CPC_INSTANCE_INITIALIZER_LIST (ctxp);
2843 CPC_INSTANCE_INITIALIZER_LIST (ctxp) = node;
2846 /* Pop the lists of initialized field. If this lists aren't empty,
2847 remember them so we can use it to create and populate the finit$
2848 or <clinit> functions. */
2851 java_parser_context_pop_initialized_field (void)
2854 tree class_type = TREE_TYPE (GET_CPC ());
2856 if (CPC_INITIALIZER_LIST (ctxp))
2858 stmts = CPC_INITIALIZER_STMT (ctxp);
2859 CPC_INITIALIZER_LIST (ctxp) = TREE_CHAIN (CPC_INITIALIZER_LIST (ctxp));
2860 if (stmts && !java_error_count)
2861 TYPE_FINIT_STMT_LIST (class_type) = reorder_static_initialized (stmts);
2864 if (CPC_STATIC_INITIALIZER_LIST (ctxp))
2866 stmts = CPC_STATIC_INITIALIZER_STMT (ctxp);
2867 CPC_STATIC_INITIALIZER_LIST (ctxp) =
2868 TREE_CHAIN (CPC_STATIC_INITIALIZER_LIST (ctxp));
2869 /* Keep initialization in order to enforce 8.5 */
2870 if (stmts && !java_error_count)
2871 TYPE_CLINIT_STMT_LIST (class_type) = nreverse (stmts);
2874 /* JDK 1.1 instance initializers */
2875 if (CPC_INSTANCE_INITIALIZER_LIST (ctxp))
2877 stmts = CPC_INSTANCE_INITIALIZER_STMT (ctxp);
2878 CPC_INSTANCE_INITIALIZER_LIST (ctxp) =
2879 TREE_CHAIN (CPC_INSTANCE_INITIALIZER_LIST (ctxp));
2880 if (stmts && !java_error_count)
2881 TYPE_II_STMT_LIST (class_type) = nreverse (stmts);
2886 reorder_static_initialized (tree list)
2888 /* We have to keep things in order. The alias initializer have to
2889 come first, then the initialized regular field, in reverse to
2890 keep them in lexical order. */
2891 tree marker, previous = NULL_TREE;
2892 for (marker = list; marker; previous = marker, marker = TREE_CHAIN (marker))
2893 if (TREE_CODE (marker) == TREE_LIST
2894 && !TREE_VALUE (marker) && !TREE_PURPOSE (marker))
2897 /* No static initialized, the list is fine as is */
2899 list = TREE_CHAIN (marker);
2901 /* No marker? reverse the whole list */
2903 list = nreverse (list);
2905 /* Otherwise, reverse what's after the marker and the new reordered
2906 sublist will replace the marker. */
2909 TREE_CHAIN (previous) = NULL_TREE;
2910 list = nreverse (list);
2911 list = chainon (TREE_CHAIN (marker), list);
2916 /* Helper functions to dump the parser context stack. */
2918 #define TAB_CONTEXT(C) \
2919 {int i; for (i = 0; i < (C); i++) fputc (' ', stderr);}
2922 java_debug_context_do (int tab)
2924 struct parser_ctxt *copy = ctxp;
2928 fprintf (stderr, "ctxt: 0x%0lX\n", (unsigned long)copy);
2930 fprintf (stderr, "filename: %s\n", copy->filename);
2932 fprintf (stderr, "lineno: %d\n", copy->lineno);
2934 fprintf (stderr, "package: %s\n",
2936 IDENTIFIER_POINTER (copy->package) : "<none>"));
2938 fprintf (stderr, "context for saving: %d\n", copy->saved_data_ctx);
2940 fprintf (stderr, "saved data: %d\n", copy->saved_data);
2946 /* Dump the stacked up parser contexts. Intended to be called from a
2950 java_debug_context (void)
2952 java_debug_context_do (0);
2957 /* Flag for the error report routine to issue the error the first time
2958 it's called (overriding the default behavior which is to drop the
2959 first invocation and honor the second one, taking advantage of a
2961 static int force_error = 0;
2963 /* Reporting an constructor invocation error. */
2965 parse_ctor_invocation_error (void)
2967 if (DECL_CONSTRUCTOR_P (current_function_decl))
2968 yyerror ("Constructor invocation must be first thing in a constructor");
2970 yyerror ("Only constructors can invoke constructors");
2973 /* Reporting JDK1.1 features not implemented. */
2976 parse_jdk1_1_error (const char *msg)
2978 sorry (": `%s' JDK1.1(TM) feature", msg);
2980 return empty_stmt_node;
2983 static int do_warning = 0;
2986 yyerror (const char *msg)
2989 static int prev_lineno;
2990 static const char *prev_msg;
2993 char *remainder, *code_from_source;
2995 if (!force_error && prev_lineno == input_line)
2998 /* Save current error location but report latter, when the context is
3000 if (ctxp->java_error_flag == 0)
3002 ctxp->java_error_flag = 1;
3004 /* Do something to use the previous line if we're reaching the
3005 end of the file... */
3006 #ifdef VERBOSE_SKELETON
3007 printf ("* Error detected (%s)\n", (msg ? msg : "(null)"));
3012 /* Ignore duplicate message on the same line. BTW, this is dubious. FIXME */
3013 if (!force_error && msg == prev_msg && prev_lineno == elc.line)
3016 ctxp->java_error_flag = 0;
3018 java_warning_count++;
3022 if (elc.col == 0 && msg && msg[1] == ';')
3024 elc.col = ctxp->p_line->char_col-1;
3025 elc.line = ctxp->p_line->lineno;
3028 save_lineno = input_line;
3029 prev_lineno = input_line = elc.line;
3032 code_from_source = java_get_line_col (ctxp->filename, elc.line, elc.col);
3033 obstack_grow0 (&temporary_obstack,
3034 code_from_source, strlen (code_from_source));
3035 remainder = obstack_finish (&temporary_obstack);
3037 warning ("%s.\n%s", msg, remainder);
3039 error ("%s.\n%s", msg, remainder);
3041 /* This allow us to cheaply avoid an extra 'Invalid expression
3042 statement' error report when errors have been already reported on
3043 the same line. This occurs when we report an error but don't have
3044 a synchronization point other than ';', which
3045 expression_statement is the only one to take care of. */
3046 ctxp->prevent_ese = input_line = save_lineno;
3050 issue_warning_error_from_context (tree cl, const char *msg, va_list ap)
3052 const char *saved, *saved_input_filename;
3054 vsprintf (buffer, msg, ap);
3057 ctxp->elc.line = EXPR_WFL_LINENO (cl);
3058 ctxp->elc.col = (EXPR_WFL_COLNO (cl) == 0xfff ? -1 :
3059 (EXPR_WFL_COLNO (cl) == 0xffe ? -2 : EXPR_WFL_COLNO (cl)));
3061 /* We have a CL, that's a good reason for using it if it contains data */
3062 saved = ctxp->filename;
3063 if (TREE_CODE (cl) == EXPR_WITH_FILE_LOCATION && EXPR_WFL_FILENAME_NODE (cl))
3064 ctxp->filename = EXPR_WFL_FILENAME (cl);
3065 saved_input_filename = input_filename;
3066 input_filename = ctxp->filename;
3068 java_error (buffer);
3069 ctxp->filename = saved;
3070 input_filename = saved_input_filename;
3074 /* Issue an error message at a current source line CL */
3077 parse_error_context (tree cl, const char *msg, ...)
3081 issue_warning_error_from_context (cl, msg, ap);
3085 /* Issue a warning at a current source line CL */
3088 parse_warning_context (tree cl, const char *msg, ...)
3093 force_error = do_warning = 1;
3094 issue_warning_error_from_context (cl, msg, ap);
3095 do_warning = force_error = 0;
3100 find_expr_with_wfl (tree node)
3107 switch (TREE_CODE (node))
3110 node = BLOCK_EXPR_BODY (node);
3114 to_return = find_expr_with_wfl (TREE_OPERAND (node, 0));
3117 node = TREE_OPERAND (node, 1);
3121 node = TREE_OPERAND (node, 0);
3124 case LABELED_BLOCK_EXPR:
3125 node = TREE_OPERAND (node, 1);
3129 code = TREE_CODE_CLASS (TREE_CODE (node));
3130 if (((code == '1') || (code == '2') || (code == 'e'))
3131 && EXPR_WFL_LINECOL (node))
3139 /* Issue a missing return statement error. Uses METHOD to figure the
3140 last line of the method the error occurs in. */
3143 missing_return_error (tree method)
3145 EXPR_WFL_SET_LINECOL (wfl_operator, DECL_FUNCTION_LAST_LINE (method), -2);
3146 parse_error_context (wfl_operator, "Missing return statement");
3149 /* Issue an unreachable statement error. From NODE, find the next
3150 statement to report appropriately. */
3152 unreachable_stmt_error (tree node)
3154 /* Browse node to find the next expression node that has a WFL. Use
3155 the location to report the error */
3156 if (TREE_CODE (node) == COMPOUND_EXPR)
3157 node = find_expr_with_wfl (TREE_OPERAND (node, 1));
3159 node = find_expr_with_wfl (node);
3163 EXPR_WFL_SET_LINECOL (wfl_operator, EXPR_WFL_LINENO (node), -2);
3164 parse_error_context (wfl_operator, "Unreachable statement");
3171 not_accessible_field_error (tree wfl, tree decl)
3174 (wfl, "Can't access %s field `%s.%s' from `%s'",
3175 java_accstring_lookup (get_access_flags_from_decl (decl)),
3176 GET_TYPE_NAME (DECL_CONTEXT (decl)),
3177 IDENTIFIER_POINTER (DECL_NAME (decl)),
3178 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (current_class))));
3183 java_report_errors (void)
3185 if (java_error_count)
3186 fprintf (stderr, "%d error%s",
3187 java_error_count, (java_error_count == 1 ? "" : "s"));
3188 if (java_warning_count)
3189 fprintf (stderr, "%s%d warning%s", (java_error_count ? ", " : ""),
3190 java_warning_count, (java_warning_count == 1 ? "" : "s"));
3191 if (java_error_count || java_warning_count)
3192 putc ('\n', stderr);
3193 return java_error_count;
3197 java_accstring_lookup (int flags)
3199 static char buffer [80];
3200 #define COPY_RETURN(S) {strcpy (buffer, S); return buffer;}
3202 /* Access modifier looked-up first for easier report on forbidden
3204 if (flags & ACC_PUBLIC) COPY_RETURN ("public");
3205 if (flags & ACC_PRIVATE) COPY_RETURN ("private");
3206 if (flags & ACC_PROTECTED) COPY_RETURN ("protected");
3207 if (flags & ACC_STATIC) COPY_RETURN ("static");
3208 if (flags & ACC_FINAL) COPY_RETURN ("final");
3209 if (flags & ACC_SYNCHRONIZED) COPY_RETURN ("synchronized");
3210 if (flags & ACC_VOLATILE) COPY_RETURN ("volatile");
3211 if (flags & ACC_TRANSIENT) COPY_RETURN ("transient");
3212 if (flags & ACC_NATIVE) COPY_RETURN ("native");
3213 if (flags & ACC_INTERFACE) COPY_RETURN ("interface");
3214 if (flags & ACC_ABSTRACT) COPY_RETURN ("abstract");
3221 /* Issuing error messages upon redefinition of classes, interfaces or
3225 classitf_redefinition_error (const char *context, tree id, tree decl, tree cl)
3227 parse_error_context (cl, "%s `%s' already defined in %s:%d",
3228 context, IDENTIFIER_POINTER (id),
3229 DECL_SOURCE_FILE (decl), DECL_SOURCE_LINE (decl));
3230 /* Here we should point out where its redefined. It's a unicode. FIXME */
3234 variable_redefinition_error (tree context, tree name, tree type, int line)
3236 const char *type_name;
3238 /* Figure a proper name for type. We might haven't resolved it */
3239 if (TREE_CODE (type) == POINTER_TYPE && !TREE_TYPE (type))
3240 type_name = IDENTIFIER_POINTER (TYPE_NAME (type));
3242 type_name = lang_printable_name (type, 0);
3244 parse_error_context (context,
3245 "Variable `%s' is already defined in this method and was declared `%s %s' at line %d",
3246 IDENTIFIER_POINTER (name),
3247 type_name, IDENTIFIER_POINTER (name), line);
3250 /* If ANAME is terminated with `[]', it indicates an array. This
3251 function returns the number of `[]' found and if this number is
3252 greater than zero, it extracts the array type name and places it in
3253 the node pointed to by TRIMMED unless TRIMMED is null. */
3256 build_type_name_from_array_name (tree aname, tree *trimmed)
3258 const char *name = IDENTIFIER_POINTER (aname);
3259 int len = IDENTIFIER_LENGTH (aname);
3262 STRING_STRIP_BRACKETS (name, len, array_dims);
3264 if (array_dims && trimmed)
3265 *trimmed = get_identifier_with_length (name, len);
3271 build_array_from_name (tree type, tree type_wfl, tree name, tree *ret_name)
3275 /* Eventually get more dims */
3276 more_dims = build_type_name_from_array_name (name, &name);
3278 /* If we have, then craft a new type for this variable */
3283 /* If we have a pointer, use its type */
3284 if (TREE_CODE (type) == POINTER_TYPE)
3285 type = TREE_TYPE (type);
3287 /* Building the first dimension of a primitive type uses this
3289 if (JPRIMITIVE_TYPE_P (type))
3291 type = build_java_array_type (type, -1);
3294 /* Otherwise, if we have a WFL for this type, use it (the type
3295 is already an array on an unresolved type, and we just keep
3296 on adding dimensions) */
3300 more_dims += build_type_name_from_array_name (TYPE_NAME (save),
3304 /* Add all the dimensions */
3306 type = build_unresolved_array_type (type);
3308 /* The type may have been incomplete in the first place */
3310 type = obtain_incomplete_type (type);
3318 /* Build something that the type identifier resolver will identify as
3319 being an array to an unresolved type. TYPE_WFL is a WFL on a
3323 build_unresolved_array_type (tree type_or_wfl)
3328 /* TYPE_OR_WFL might be an array on a resolved type. In this case,
3329 just create a array type */
3330 if (TREE_CODE (type_or_wfl) == RECORD_TYPE)
3331 return build_java_array_type (type_or_wfl, -1);
3333 obstack_grow (&temporary_obstack,
3334 IDENTIFIER_POINTER (EXPR_WFL_NODE (type_or_wfl)),
3335 IDENTIFIER_LENGTH (EXPR_WFL_NODE (type_or_wfl)));
3336 obstack_grow0 (&temporary_obstack, "[]", 2);
3337 ptr = obstack_finish (&temporary_obstack);
3338 wfl = build_expr_wfl (get_identifier (ptr),
3339 EXPR_WFL_FILENAME (type_or_wfl),
3340 EXPR_WFL_LINENO (type_or_wfl),
3341 EXPR_WFL_COLNO (type_or_wfl));
3342 /* Re-install the existing qualifications so that the type can be
3343 resolved properly. */
3344 EXPR_WFL_QUALIFICATION (wfl) = EXPR_WFL_QUALIFICATION (type_or_wfl);
3349 parser_add_interface (tree class_decl, tree interface_decl, tree wfl)
3351 if (maybe_add_interface (TREE_TYPE (class_decl), TREE_TYPE (interface_decl)))
3352 parse_error_context (wfl, "Interface `%s' repeated",
3353 IDENTIFIER_POINTER (DECL_NAME (interface_decl)));
3356 /* Bulk of common class/interface checks. Return 1 if an error was
3357 encountered. TAG is 0 for a class, 1 for an interface. */
3360 check_class_interface_creation (int is_interface, int flags, tree raw_name,
3361 tree qualified_name, tree decl, tree cl)
3364 int sca = 0; /* Static class allowed */
3365 int icaf = 0; /* Inner class allowed flags */
3366 int uaaf = CLASS_MODIFIERS; /* Usually allowed access flags */
3369 fprintf (stderr, " %s%s %s",
3370 (CPC_INNER_P () ? "inner" : ""),
3371 (is_interface ? "interface" : "class"),
3372 IDENTIFIER_POINTER (qualified_name));
3374 /* Scope of an interface/class type name:
3375 - Can't be imported by a single type import
3376 - Can't already exists in the package */
3377 if (IS_A_SINGLE_IMPORT_CLASSFILE_NAME_P (raw_name)
3378 && (node = find_name_in_single_imports (raw_name))
3382 (cl, "%s name `%s' clashes with imported type `%s'",
3383 (is_interface ? "Interface" : "Class"),
3384 IDENTIFIER_POINTER (raw_name), IDENTIFIER_POINTER (node));
3387 if (decl && CLASS_COMPLETE_P (decl))
3389 classitf_redefinition_error ((is_interface ? "Interface" : "Class"),
3390 qualified_name, decl, cl);
3394 if (check_inner_class_redefinition (raw_name, cl))
3397 /* If public, file name should match class/interface name, except
3398 when dealing with an inner class */
3399 if (!CPC_INNER_P () && (flags & ACC_PUBLIC ))
3403 for (f = &input_filename [strlen (input_filename)];
3404 f != input_filename && ! IS_DIR_SEPARATOR (f[0]);
3407 if (IS_DIR_SEPARATOR (f[0]))
3409 if (strncmp (IDENTIFIER_POINTER (raw_name),
3410 f , IDENTIFIER_LENGTH (raw_name)) ||
3411 f [IDENTIFIER_LENGTH (raw_name)] != '.')
3413 (cl, "Public %s `%s' must be defined in a file called `%s.java'",
3414 (is_interface ? "interface" : "class"),
3415 IDENTIFIER_POINTER (qualified_name),
3416 IDENTIFIER_POINTER (raw_name));
3419 /* Static classes can be declared only in top level classes. Note:
3420 once static, a inner class is a top level class. */
3421 if (flags & ACC_STATIC)
3423 /* Catch the specific error of declaring an class inner class
3424 with no toplevel enclosing class. Prevent check_modifiers from
3425 complaining a second time */
3426 if (CPC_INNER_P () && !TOPLEVEL_CLASS_DECL_P (GET_CPC()))
3428 parse_error_context (cl, "Inner class `%s' can't be static. Static classes can only occur in interfaces and top-level classes",
3429 IDENTIFIER_POINTER (qualified_name));
3432 /* Else, in the context of a top-level class declaration, let
3433 `check_modifiers' do its job, otherwise, give it a go */
3435 sca = (GET_CPC_LIST () ? ACC_STATIC : 0);
3438 /* Inner classes can be declared private or protected
3439 within their enclosing classes. */
3442 /* A class which is local to a block can't be public, private,
3443 protected or static. But it is created final, so allow this
3445 if (current_function_decl)
3446 icaf = sca = uaaf = ACC_FINAL;
3449 check_modifiers_consistency (flags);
3450 icaf = ACC_PROTECTED;
3451 if (! CLASS_INTERFACE (GET_CPC ()))
3452 icaf |= ACC_PRIVATE;
3459 uaaf = INTERFACE_INNER_MODIFIERS;
3461 uaaf = INTERFACE_MODIFIERS;
3463 check_modifiers ("Illegal modifier `%s' for interface declaration",
3467 check_modifiers ((current_function_decl ?
3468 "Illegal modifier `%s' for local class declaration" :
3469 "Illegal modifier `%s' for class declaration"),
3470 flags, uaaf|sca|icaf);
3474 /* Construct a nested class name. If the final component starts with
3475 a digit, return true. Otherwise return false. */
3477 make_nested_class_name (tree cpc_list)
3484 make_nested_class_name (TREE_CHAIN (cpc_list));
3486 /* Pick the qualified name when dealing with the first upmost
3488 name = (TREE_CHAIN (cpc_list)
3489 ? TREE_PURPOSE (cpc_list) : DECL_NAME (TREE_VALUE (cpc_list)));
3490 obstack_grow (&temporary_obstack,
3491 IDENTIFIER_POINTER (name), IDENTIFIER_LENGTH (name));
3492 obstack_1grow (&temporary_obstack, '$');
3494 return ISDIGIT (IDENTIFIER_POINTER (name)[0]);
3497 /* Can't redefine a class already defined in an earlier scope. */
3500 check_inner_class_redefinition (tree raw_name, tree cl)
3504 for (scope_list = GET_CPC_LIST (); scope_list;
3505 scope_list = GET_NEXT_ENCLOSING_CPC (scope_list))
3506 if (raw_name == GET_CPC_UN_NODE (scope_list))
3509 (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",
3510 IDENTIFIER_POINTER (raw_name));
3516 /* Tries to find a decl for CLASS_TYPE within ENCLOSING. If we fail,
3517 we remember ENCLOSING and SUPER. */
3520 resolve_inner_class (htab_t circularity_hash, tree cl, tree *enclosing,
3521 tree *super, tree class_type)
3523 tree local_enclosing = *enclosing;
3524 tree local_super = NULL_TREE;
3526 while (local_enclosing)
3528 tree intermediate, decl;
3530 *htab_find_slot (circularity_hash, local_enclosing, INSERT) =
3533 if ((decl = find_as_inner_class (local_enclosing, class_type, cl)))
3536 intermediate = local_enclosing;
3537 /* Explore enclosing contexts. */
3538 while (INNER_CLASS_DECL_P (intermediate))
3540 intermediate = DECL_CONTEXT (intermediate);
3541 if ((decl = find_as_inner_class (intermediate, class_type, cl)))
3545 /* Now go to the upper classes, bail out if necessary. We will
3546 analyze the returned SUPER and act accordingly (see
3547 do_resolve_class). */
3548 if (JPRIMITIVE_TYPE_P (TREE_TYPE (local_enclosing))
3549 || TREE_TYPE (local_enclosing) == void_type_node)
3551 parse_error_context (cl, "Qualifier must be a reference");
3552 local_enclosing = NULL_TREE;
3555 local_super = CLASSTYPE_SUPER (TREE_TYPE (local_enclosing));
3556 if (!local_super || local_super == object_type_node)
3559 if (TREE_CODE (local_super) == POINTER_TYPE)
3560 local_super = do_resolve_class (NULL, local_super, NULL, NULL);
3562 local_super = TYPE_NAME (local_super);
3564 /* We may not have checked for circular inheritance yet, so do so
3565 here to prevent an infinite loop. */
3566 if (htab_find (circularity_hash, local_super) != NULL)
3569 cl = lookup_cl (local_enclosing);
3572 (cl, "Cyclic inheritance involving %s",
3573 IDENTIFIER_POINTER (DECL_NAME (local_enclosing)));
3574 local_enclosing = NULL_TREE;
3577 local_enclosing = local_super;
3580 /* We failed. Return LOCAL_SUPER and LOCAL_ENCLOSING. */
3581 *super = local_super;
3582 *enclosing = local_enclosing;
3587 /* Within ENCLOSING, find a decl for NAME and return it. NAME can be
3591 find_as_inner_class (tree enclosing, tree name, tree cl)
3593 tree qual, to_return;
3597 name = TYPE_NAME (name);
3599 /* First search: within the scope of `enclosing', search for name */
3600 if (QUALIFIED_P (name) && cl && EXPR_WFL_NODE (cl) == name)
3601 qual = EXPR_WFL_QUALIFICATION (cl);
3603 qual = build_tree_list (cl, NULL_TREE);
3605 qual = build_tree_list (build_expr_wfl (name, NULL, 0, 0), NULL_TREE);
3607 if ((to_return = find_as_inner_class_do (qual, enclosing)))
3610 /* We're dealing with a qualified name. Try to resolve thing until
3611 we get something that is an enclosing class. */
3612 if (QUALIFIED_P (name) && cl && EXPR_WFL_NODE (cl) == name)
3614 tree acc = NULL_TREE, decl = NULL_TREE, ptr;
3616 for (qual = EXPR_WFL_QUALIFICATION (cl); qual && !decl;
3617 qual = TREE_CHAIN (qual))
3619 acc = merge_qualified_name (acc,
3620 EXPR_WFL_NODE (TREE_PURPOSE (qual)));
3621 BUILD_PTR_FROM_NAME (ptr, acc);
3622 decl = do_resolve_class (NULL_TREE, ptr, NULL_TREE, cl);
3625 /* A NULL qual and a decl means that the search ended
3626 successfully?!? We have to do something then. FIXME */
3631 qual = EXPR_WFL_QUALIFICATION (cl);
3633 /* Otherwise, create a qual for the other part of the resolution. */
3635 qual = build_tree_list (build_expr_wfl (name, NULL, 0, 0), NULL_TREE);
3637 return find_as_inner_class_do (qual, enclosing);
3640 /* We go inside the list of sub classes and try to find a way
3644 find_as_inner_class_do (tree qual, tree enclosing)
3649 for (; qual && enclosing; qual = TREE_CHAIN (qual))
3651 tree name_to_match = EXPR_WFL_NODE (TREE_PURPOSE (qual));
3652 tree next_enclosing = NULL_TREE;
3655 for (inner_list = DECL_INNER_CLASS_LIST (enclosing);
3656 inner_list; inner_list = TREE_CHAIN (inner_list))
3658 if (TREE_VALUE (inner_list) == name_to_match)
3660 next_enclosing = TREE_PURPOSE (inner_list);
3664 enclosing = next_enclosing;
3667 return (!qual && enclosing ? enclosing : NULL_TREE);
3670 /* Reach all inner classes and tie their unqualified name to a
3674 set_nested_class_simple_name_value (tree outer, int set)
3678 for (l = DECL_INNER_CLASS_LIST (outer); l; l = TREE_CHAIN (l))
3679 IDENTIFIER_GLOBAL_VALUE (TREE_VALUE (l)) = (set ?
3680 TREE_PURPOSE (l) : NULL_TREE);
3684 link_nested_class_to_enclosing (void)
3686 if (GET_ENCLOSING_CPC ())
3688 tree enclosing = GET_ENCLOSING_CPC_CONTEXT ();
3689 DECL_INNER_CLASS_LIST (enclosing) =
3690 tree_cons (GET_CPC (), GET_CPC_UN (),
3691 DECL_INNER_CLASS_LIST (enclosing));
3696 maybe_make_nested_class_name (tree name)
3698 tree id = NULL_TREE;
3702 /* If we're in a function, we must append a number to create the
3703 nested class name. However, we don't do this if the class we
3704 are constructing is anonymous, because in that case we'll
3705 already have a number as the class name. */
3706 if (! make_nested_class_name (GET_CPC_LIST ())
3707 && current_function_decl != NULL_TREE
3708 && ! ISDIGIT (IDENTIFIER_POINTER (name)[0]))
3711 sprintf (buf, "%d", anonymous_class_counter);
3712 ++anonymous_class_counter;
3713 obstack_grow (&temporary_obstack, buf, strlen (buf));
3714 obstack_1grow (&temporary_obstack, '$');
3716 obstack_grow0 (&temporary_obstack,
3717 IDENTIFIER_POINTER (name),
3718 IDENTIFIER_LENGTH (name));
3719 id = get_identifier (obstack_finish (&temporary_obstack));
3721 QUALIFIED_P (id) = 1;
3726 /* If DECL is NULL, create and push a new DECL, record the current
3727 line CL and do other maintenance things. */
3730 maybe_create_class_interface_decl (tree decl, tree raw_name,
3731 tree qualified_name, tree cl)
3734 decl = push_class (make_class (), qualified_name);
3736 /* Take care of the file and line business */
3737 DECL_SOURCE_FILE (decl) = EXPR_WFL_FILENAME (cl);
3738 /* If we're emitting xrefs, store the line/col number information */
3740 DECL_SOURCE_LINE (decl) = EXPR_WFL_LINECOL (cl);
3742 DECL_SOURCE_LINE (decl) = EXPR_WFL_LINENO (cl);
3743 CLASS_FROM_SOURCE_P (TREE_TYPE (decl)) = 1;
3744 CLASS_PARSED_P (TREE_TYPE (decl)) = 1;
3745 CLASS_FROM_CURRENTLY_COMPILED_P (TREE_TYPE (decl)) =
3746 IS_A_COMMAND_LINE_FILENAME_P (EXPR_WFL_FILENAME_NODE (cl));
3748 PUSH_CPC (decl, raw_name);
3749 DECL_CONTEXT (decl) = GET_ENCLOSING_CPC_CONTEXT ();
3751 /* Link the declaration to the already seen ones */
3752 TREE_CHAIN (decl) = ctxp->class_list;
3753 ctxp->class_list = decl;
3755 /* Create a new nodes in the global lists */
3756 gclass_list = tree_cons (NULL_TREE, decl, gclass_list);
3757 all_class_list = tree_cons (NULL_TREE, decl, all_class_list);
3759 /* Install a new dependency list element */
3760 create_jdep_list (ctxp);
3762 SOURCE_FRONTEND_DEBUG (("Defining class/interface %s",
3763 IDENTIFIER_POINTER (qualified_name)));
3768 add_superinterfaces (tree decl, tree interface_list)
3771 /* Superinterface(s): if present and defined, parser_check_super_interface ()
3772 takes care of ensuring that:
3773 - This is an accessible interface type,
3774 - Circularity detection.
3775 parser_add_interface is then called. If present but not defined,
3776 the check operation is delayed until the super interface gets
3778 for (node = interface_list; node; node = TREE_CHAIN (node))
3780 tree current = TREE_PURPOSE (node);
3781 tree idecl = IDENTIFIER_CLASS_VALUE (EXPR_WFL_NODE (current));
3782 if (idecl && CLASS_LOADED_P (TREE_TYPE (idecl)))
3784 if (!parser_check_super_interface (idecl, decl, current))
3785 parser_add_interface (decl, idecl, current);
3788 register_incomplete_type (JDEP_INTERFACE,
3789 current, decl, NULL_TREE);
3793 /* Create an interface in pass1 and return its decl. Return the
3794 interface's decl in pass 2. */
3797 create_interface (int flags, tree id, tree super)
3799 tree raw_name = EXPR_WFL_NODE (id);
3800 tree q_name = parser_qualified_classname (raw_name);
3801 tree decl = IDENTIFIER_CLASS_VALUE (q_name);
3803 /* Certain syntax errors are making SUPER be like ID. Avoid this
3805 if (ctxp->class_err && id == super)
3808 EXPR_WFL_NODE (id) = q_name; /* Keep source location, even if refined. */
3810 /* Basic checks: scope, redefinition, modifiers */
3811 if (check_class_interface_creation (1, flags, raw_name, q_name, decl, id))
3817 /* Suspend the current parsing context if we're parsing an inner
3821 java_parser_context_suspend ();
3822 /* Interface members are public. */
3823 if (CLASS_INTERFACE (GET_CPC ()))
3824 flags |= ACC_PUBLIC;
3827 /* Push a new context for (static) initialized upon declaration fields */
3828 java_parser_context_push_initialized_field ();
3830 /* Interface modifiers check
3831 - public/abstract allowed (already done at that point)
3832 - abstract is obsolete (comes first, it's a warning, or should be)
3833 - Can't use twice the same (checked in the modifier rule) */
3834 if ((flags & ACC_ABSTRACT) && flag_redundant)
3835 parse_warning_context
3836 (MODIFIER_WFL (ABSTRACT_TK),
3837 "Redundant use of `abstract' modifier. Interface `%s' is implicitly abstract", IDENTIFIER_POINTER (raw_name));
3839 /* Create a new decl if DECL is NULL, otherwise fix it */
3840 decl = maybe_create_class_interface_decl (decl, raw_name, q_name, id);
3842 /* Set super info and mark the class a complete */
3843 set_super_info (ACC_INTERFACE | flags, TREE_TYPE (decl),
3844 object_type_node, ctxp->interface_number);
3845 ctxp->interface_number = 0;
3846 CLASS_COMPLETE_P (decl) = 1;
3847 add_superinterfaces (decl, super);
3849 /* Eventually sets the @deprecated tag flag */
3850 CHECK_DEPRECATED (decl);
3855 /* Patch anonymous class CLASS, by either extending or implementing
3859 patch_anonymous_class (tree type_decl, tree class_decl, tree wfl)
3861 tree class = TREE_TYPE (class_decl);
3862 tree type = TREE_TYPE (type_decl);
3863 tree binfo = TYPE_BINFO (class);
3865 /* If it's an interface, implement it */
3866 if (CLASS_INTERFACE (type_decl))
3871 if (parser_check_super_interface (type_decl, class_decl, wfl))
3874 s_binfo = TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO (class)), 0);
3875 length = TREE_VEC_LENGTH (TYPE_BINFO_BASETYPES (class))+1;
3876 TYPE_BINFO_BASETYPES (class) = make_tree_vec (length);
3877 TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO (class)), 0) = s_binfo;
3878 /* And add the interface */
3879 parser_add_interface (class_decl, type_decl, wfl);
3881 /* Otherwise, it's a type we want to extend */
3884 if (parser_check_super (type_decl, class_decl, wfl))
3886 BINFO_TYPE (TREE_VEC_ELT (BINFO_BASETYPES (binfo), 0)) = type;
3891 create_anonymous_class (int location, tree type_name)
3894 tree super = NULL_TREE, itf = NULL_TREE;
3895 tree id, type_decl, class;
3897 /* The unqualified name of the anonymous class. It's just a number. */
3898 sprintf (buffer, "%d", anonymous_class_counter++);
3899 id = build_wfl_node (get_identifier (buffer));
3900 EXPR_WFL_LINECOL (id) = location;
3902 /* We know about the type to extend/implement. We go ahead */
3903 if ((type_decl = IDENTIFIER_CLASS_VALUE (EXPR_WFL_NODE (type_name))))
3905 /* Create a class which either implements on extends the designated
3906 class. The class bears an inaccessible name. */
3907 if (CLASS_INTERFACE (type_decl))
3909 /* It's OK to modify it here. It's been already used and
3910 shouldn't be reused */
3911 ctxp->interface_number = 1;
3912 /* Interfaces should presented as a list of WFLs */
3913 itf = build_tree_list (type_name, NULL_TREE);
3919 class = create_class (ACC_FINAL, id, super, itf);
3921 /* We didn't know anything about the stuff. We register a dependence. */
3923 register_incomplete_type (JDEP_ANONYMOUS, type_name, class, NULL_TREE);
3925 ANONYMOUS_CLASS_P (TREE_TYPE (class)) = 1;
3929 /* Create a class in pass1 and return its decl. Return class
3930 interface's decl in pass 2. */
3933 create_class (int flags, tree id, tree super, tree interfaces)
3935 tree raw_name = EXPR_WFL_NODE (id);
3936 tree class_id, decl;
3937 tree super_decl_type;
3939 /* Certain syntax errors are making SUPER be like ID. Avoid this
3941 if (ctxp->class_err && id == super)
3944 class_id = parser_qualified_classname (raw_name);
3945 decl = IDENTIFIER_CLASS_VALUE (class_id);
3946 EXPR_WFL_NODE (id) = class_id;
3948 /* Basic check: scope, redefinition, modifiers */
3949 if (check_class_interface_creation (0, flags, raw_name, class_id, decl, id))
3955 /* Suspend the current parsing context if we're parsing an inner
3956 class or an anonymous class. */
3959 java_parser_context_suspend ();
3960 /* Interface members are public. */
3961 if (CLASS_INTERFACE (GET_CPC ()))
3962 flags |= ACC_PUBLIC;
3965 /* Push a new context for (static) initialized upon declaration fields */
3966 java_parser_context_push_initialized_field ();
3968 /* Class modifier check:
3969 - Allowed modifier (already done at that point)
3970 - abstract AND final forbidden
3971 - Public classes defined in the correct file */
3972 if ((flags & ACC_ABSTRACT) && (flags & ACC_FINAL))
3974 (id, "Class `%s' can't be declared both abstract and final",
3975 IDENTIFIER_POINTER (raw_name));
3977 /* Create a new decl if DECL is NULL, otherwise fix it */
3978 decl = maybe_create_class_interface_decl (decl, raw_name, class_id, id);
3980 /* If SUPER exists, use it, otherwise use Object */
3983 /* Can't extend java.lang.Object */
3984 if (TREE_TYPE (IDENTIFIER_CLASS_VALUE (class_id)) == object_type_node)
3986 parse_error_context (id, "Can't extend `java.lang.Object'");
3991 register_incomplete_type (JDEP_SUPER, super, decl, NULL_TREE);
3993 else if (TREE_TYPE (decl) != object_type_node)
3994 super_decl_type = object_type_node;
3995 /* We're defining java.lang.Object */
3997 super_decl_type = NULL_TREE;
3999 /* A class nested in an interface is implicitly static. */
4000 if (INNER_CLASS_DECL_P (decl)
4001 && CLASS_INTERFACE (TYPE_NAME (TREE_TYPE (DECL_CONTEXT (decl)))))
4003 flags |= ACC_STATIC;
4006 /* Set super info and mark the class as complete. */
4007 set_super_info (flags, TREE_TYPE (decl), super_decl_type,
4008 ctxp->interface_number);
4009 ctxp->interface_number = 0;
4010 CLASS_COMPLETE_P (decl) = 1;
4011 add_superinterfaces (decl, interfaces);
4013 /* Add the private this$<n> field, Replicate final locals still in
4014 scope as private final fields mangled like val$<local_name>.
4015 This doesn't not occur for top level (static) inner classes. */
4016 if (PURE_INNER_CLASS_DECL_P (decl))
4017 add_inner_class_fields (decl, current_function_decl);
4019 /* If doing xref, store the location at which the inherited class
4020 (if any) was seen. */
4021 if (flag_emit_xref && super)
4022 DECL_INHERITED_SOURCE_LINE (decl) = EXPR_WFL_LINECOL (super);
4024 /* Eventually sets the @deprecated tag flag */
4025 CHECK_DEPRECATED (decl);
4027 /* Reset the anonymous class counter when declaring non inner classes */
4028 if (!INNER_CLASS_DECL_P (decl))
4029 anonymous_class_counter = 1;
4034 /* End a class declaration: register the statements used to create
4035 finit$ and <clinit>, pop the current class and resume the prior
4036 parser context if necessary. */
4039 end_class_declaration (int resume)
4041 /* If an error occurred, context weren't pushed and won't need to be
4042 popped by a resume. */
4043 int no_error_occurred = ctxp->next && GET_CPC () != error_mark_node;
4045 if (GET_CPC () != error_mark_node)
4046 dump_java_tree (TDI_class, GET_CPC ());
4048 java_parser_context_pop_initialized_field ();
4050 if (resume && no_error_occurred)
4051 java_parser_context_resume ();
4053 /* We're ending a class declaration, this is a good time to reset
4054 the interface cout. Note that might have been already done in
4055 create_interface, but if at that time an inner class was being
4056 dealt with, the interface count was reset in a context created
4057 for the sake of handling inner classes declaration. */
4058 ctxp->interface_number = 0;
4062 add_inner_class_fields (tree class_decl, tree fct_decl)
4064 tree block, marker, f;
4066 f = add_field (TREE_TYPE (class_decl),
4067 build_current_thisn (TREE_TYPE (class_decl)),
4068 build_pointer_type (TREE_TYPE (DECL_CONTEXT (class_decl))),
4070 FIELD_THISN (f) = 1;
4075 for (block = GET_CURRENT_BLOCK (fct_decl);
4076 block && TREE_CODE (block) == BLOCK; block = BLOCK_SUPERCONTEXT (block))
4079 for (decl = BLOCK_EXPR_DECLS (block); decl; decl = TREE_CHAIN (decl))
4082 tree wfl, init, list;
4084 /* Avoid non final arguments. */
4085 if (!LOCAL_FINAL_P (decl))
4088 MANGLE_OUTER_LOCAL_VARIABLE_NAME (name, DECL_NAME (decl));
4089 MANGLE_ALIAS_INITIALIZER_PARAMETER_NAME_ID (pname, DECL_NAME (decl));
4090 wfl = build_wfl_node (name);
4091 init = build_wfl_node (pname);
4092 /* Build an initialization for the field: it will be
4093 initialized by a parameter added to finit$, bearing a
4094 mangled name of the field itself (param$<n>.) The
4095 parameter is provided to finit$ by the constructor
4096 invoking it (hence the constructor will also feature a
4097 hidden parameter, set to the value of the outer context
4098 local at the time the inner class is created.)
4100 Note: we take into account all possible locals that can
4101 be accessed by the inner class. It's actually not trivial
4102 to minimize these aliases down to the ones really
4103 used. One way to do that would be to expand all regular
4104 methods first, then finit$ to get a picture of what's
4105 used. It works with the exception that we would have to
4106 go back on all constructor invoked in regular methods to
4107 have their invocation reworked (to include the right amount
4108 of alias initializer parameters.)
4110 The only real way around, I think, is a first pass to
4111 identify locals really used in the inner class. We leave
4112 the flag FIELD_LOCAL_ALIAS_USED around for that future
4115 On the other hand, it only affect local inner classes,
4116 whose constructors (and finit$ call) will be featuring
4117 unnecessary arguments. It's easy for a developer to keep
4118 this number of parameter down by using the `final'
4119 keyword only when necessary. For the time being, we can
4120 issue a warning on unnecessary finals. FIXME */
4121 init = build_assignment (ASSIGN_TK, EXPR_WFL_LINECOL (wfl),
4124 /* Register the field. The TREE_LIST holding the part
4125 initialized/initializer will be marked ARG_FINAL_P so
4126 that the created field can be marked
4127 FIELD_LOCAL_ALIAS. */
4128 list = build_tree_list (wfl, init);
4129 ARG_FINAL_P (list) = 1;
4130 register_fields (ACC_PRIVATE | ACC_FINAL, TREE_TYPE (decl), list);
4134 if (!CPC_INITIALIZER_STMT (ctxp))
4137 /* If we ever registered an alias field, insert and marker to
4138 remember where the list ends. The second part of the list (the one
4139 featuring initialized fields) so it can be later reversed to
4140 enforce 8.5. The marker will be removed during that operation. */
4141 marker = build_tree_list (NULL_TREE, NULL_TREE);
4142 TREE_CHAIN (marker) = CPC_INITIALIZER_STMT (ctxp);
4143 SET_CPC_INITIALIZER_STMT (ctxp, marker);
4146 /* Can't use lookup_field () since we don't want to load the class and
4147 can't set the CLASS_LOADED_P flag */
4150 find_field (tree class, tree name)
4153 for (decl = TYPE_FIELDS (class); decl; decl = TREE_CHAIN (decl))
4155 if (DECL_NAME (decl) == name)
4161 /* Wrap around lookup_field that doesn't potentially upset the value
4165 lookup_field_wrapper (tree class, tree name)
4168 tree decl = NULL_TREE;
4169 java_parser_context_save_global ();
4171 /* Last chance: if we're within the context of an inner class, we
4172 might be trying to access a local variable defined in an outer
4173 context. We try to look for it now. */
4174 if (INNER_CLASS_TYPE_P (class) && TREE_CODE (name) == IDENTIFIER_NODE)
4177 MANGLE_OUTER_LOCAL_VARIABLE_NAME (new_name, name);
4178 decl = lookup_field (&type, new_name);
4179 if (decl && decl != error_mark_node)
4180 FIELD_LOCAL_ALIAS_USED (decl) = 1;
4182 if (!decl || decl == error_mark_node)
4185 decl = lookup_field (&type, name);
4188 /* If the field still hasn't been found, try the next enclosing context. */
4189 if (!decl && INNER_CLASS_TYPE_P (class))
4191 tree outer_type = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (class)));
4192 decl = lookup_field_wrapper (outer_type, name);
4195 java_parser_context_restore_global ();
4196 return decl == error_mark_node ? NULL : decl;
4199 /* Find duplicate field within the same class declarations and report
4200 the error. Returns 1 if a duplicated field was found, 0
4204 duplicate_declaration_error_p (tree new_field_name, tree new_type, tree cl)
4206 /* This might be modified to work with method decl as well */
4207 tree decl = find_field (TREE_TYPE (GET_CPC ()), new_field_name);
4210 char *t1 = xstrdup (purify_type_name
4211 ((TREE_CODE (new_type) == POINTER_TYPE
4212 && TREE_TYPE (new_type) == NULL_TREE) ?
4213 IDENTIFIER_POINTER (TYPE_NAME (new_type)) :
4214 lang_printable_name (new_type, 1)));
4215 /* The type may not have been completed by the time we report
4217 char *t2 = xstrdup (purify_type_name
4218 ((TREE_CODE (TREE_TYPE (decl)) == POINTER_TYPE
4219 && TREE_TYPE (TREE_TYPE (decl)) == NULL_TREE) ?
4220 IDENTIFIER_POINTER (TYPE_NAME (TREE_TYPE (decl))) :
4221 lang_printable_name (TREE_TYPE (decl), 1)));
4223 (cl , "Duplicate variable declaration: `%s %s' was `%s %s' (%s:%d)",
4224 t1, IDENTIFIER_POINTER (new_field_name),
4225 t2, IDENTIFIER_POINTER (DECL_NAME (decl)),
4226 DECL_SOURCE_FILE (decl), DECL_SOURCE_LINE (decl));
4234 /* Field registration routine. If TYPE doesn't exist, field
4235 declarations are linked to the undefined TYPE dependency list, to
4236 be later resolved in java_complete_class () */
4239 register_fields (int flags, tree type, tree variable_list)
4241 tree current, saved_type;
4242 tree class_type = NULL_TREE;
4243 int saved_lineno = input_line;
4245 tree wfl = NULL_TREE;
4248 class_type = TREE_TYPE (GET_CPC ());
4250 if (!class_type || class_type == error_mark_node)
4253 /* If we're adding fields to interfaces, those fields are public,
4255 if (CLASS_INTERFACE (TYPE_NAME (class_type)))
4257 OBSOLETE_MODIFIER_WARNING (MODIFIER_WFL (PUBLIC_TK),
4258 flags, ACC_PUBLIC, "interface field(s)");
4259 OBSOLETE_MODIFIER_WARNING (MODIFIER_WFL (STATIC_TK),
4260 flags, ACC_STATIC, "interface field(s)");
4261 OBSOLETE_MODIFIER_WARNING (MODIFIER_WFL (FINAL_TK),
4262 flags, ACC_FINAL, "interface field(s)");
4263 check_modifiers ("Illegal interface member modifier `%s'", flags,
4264 INTERFACE_FIELD_MODIFIERS);
4265 flags |= (ACC_PUBLIC | ACC_STATIC | ACC_FINAL);
4268 /* Obtain a suitable type for resolution, if necessary */
4269 SET_TYPE_FOR_RESOLUTION (type, wfl, must_chain);
4271 /* If TYPE is fully resolved and we don't have a reference, make one */
4272 PROMOTE_RECORD_IF_COMPLETE (type, must_chain);
4274 for (current = variable_list, saved_type = type; current;
4275 current = TREE_CHAIN (current), type = saved_type)
4279 tree cl = TREE_PURPOSE (current);
4280 tree init = TREE_VALUE (current);
4281 tree current_name = EXPR_WFL_NODE (cl);
4283 /* Can't declare non-final static fields in inner classes */
4284 if ((flags & ACC_STATIC) && !TOPLEVEL_CLASS_TYPE_P (class_type)
4285 && !(flags & ACC_FINAL))
4287 (cl, "Field `%s' can't be static in inner class `%s' unless it is final",
4288 IDENTIFIER_POINTER (EXPR_WFL_NODE (cl)),
4289 lang_printable_name (class_type, 0));
4291 /* Process NAME, as it may specify extra dimension(s) for it */
4292 type = build_array_from_name (type, wfl, current_name, ¤t_name);
4294 /* Type adjustment. We may have just readjusted TYPE because
4295 the variable specified more dimensions. Make sure we have
4296 a reference if we can and don't have one already. Also
4297 change the name if we have an init. */
4298 if (type != saved_type)
4300 PROMOTE_RECORD_IF_COMPLETE (type, must_chain);
4302 EXPR_WFL_NODE (TREE_OPERAND (init, 0)) = current_name;
4305 real_type = GET_REAL_TYPE (type);
4306 /* Check for redeclarations */
4307 if (duplicate_declaration_error_p (current_name, real_type, cl))
4310 /* Set lineno to the line the field was found and create a
4311 declaration for it. Eventually sets the @deprecated tag flag. */
4313 input_line = EXPR_WFL_LINECOL (cl);
4315 input_line = EXPR_WFL_LINENO (cl);
4316 field_decl = add_field (class_type, current_name, real_type, flags);
4317 CHECK_DEPRECATED_NO_RESET (field_decl);
4319 /* If the field denotes a final instance variable, then we
4320 allocate a LANG_DECL_SPECIFIC part to keep track of its
4321 initialization. We also mark whether the field was
4322 initialized upon its declaration. We don't do that if the
4323 created field is an alias to a final local. */
4324 if (!ARG_FINAL_P (current) && (flags & ACC_FINAL))
4326 MAYBE_CREATE_VAR_LANG_DECL_SPECIFIC (field_decl);
4327 DECL_FIELD_FINAL_WFL (field_decl) = cl;
4330 /* If the couple initializer/initialized is marked ARG_FINAL_P,
4331 we mark the created field FIELD_LOCAL_ALIAS, so that we can
4332 hide parameters to this inner class finit$ and
4333 constructors. It also means that the field isn't final per
4335 if (ARG_FINAL_P (current))
4337 FIELD_LOCAL_ALIAS (field_decl) = 1;
4338 FIELD_FINAL (field_decl) = 0;
4341 /* Check if we must chain. */
4343 register_incomplete_type (JDEP_FIELD, wfl, field_decl, type);
4345 /* If we have an initialization value tied to the field */
4348 /* The field is declared static */
4349 if (flags & ACC_STATIC)
4351 /* We include the field and its initialization part into
4352 a list used to generate <clinit>. After <clinit> is
4353 walked, field initializations will be processed and
4354 fields initialized with known constants will be taken
4355 out of <clinit> and have their DECL_INITIAL set
4357 TREE_CHAIN (init) = CPC_STATIC_INITIALIZER_STMT (ctxp);
4358 SET_CPC_STATIC_INITIALIZER_STMT (ctxp, init);
4359 if (TREE_OPERAND (init, 1)
4360 && TREE_CODE (TREE_OPERAND (init, 1)) == NEW_ARRAY_INIT)
4361 TREE_STATIC (TREE_OPERAND (init, 1)) = 1;
4363 /* A non-static field declared with an immediate initialization is
4364 to be initialized in <init>, if any. This field is remembered
4365 to be processed at the time of the generation of <init>. */
4368 TREE_CHAIN (init) = CPC_INITIALIZER_STMT (ctxp);
4369 SET_CPC_INITIALIZER_STMT (ctxp, init);
4371 MODIFY_EXPR_FROM_INITIALIZATION_P (init) = 1;
4372 DECL_INITIAL (field_decl) = TREE_OPERAND (init, 1);
4377 input_line = saved_lineno;
4380 /* Generate finit$, using the list of initialized fields to populate
4381 its body. finit$'s parameter(s) list is adjusted to include the
4382 one(s) used to initialized the field(s) caching outer context
4386 generate_finit (tree class_type)
4389 tree list = TYPE_FINIT_STMT_LIST (class_type);
4390 tree mdecl, current, parms;
4392 parms = build_alias_initializer_parameter_list (AIPL_FUNCTION_CREATION,
4393 class_type, NULL_TREE,
4395 CRAFTED_PARAM_LIST_FIXUP (parms);
4396 mdecl = create_artificial_method (class_type, ACC_PRIVATE, void_type_node,
4397 finit_identifier_node, parms);
4398 fix_method_argument_names (parms, mdecl);
4399 layout_class_method (class_type, CLASSTYPE_SUPER (class_type),
4401 DECL_FUNCTION_NAP (mdecl) = count;
4402 start_artificial_method_body (mdecl);
4404 for (current = list; current; current = TREE_CHAIN (current))
4405 java_method_add_stmt (mdecl,
4406 build_debugable_stmt (EXPR_WFL_LINECOL (current),
4408 end_artificial_method_body (mdecl);
4412 /* Generate a function to run the instance initialization code. The
4413 private method is called `instinit$'. Unless we're dealing with an
4414 anonymous class, we determine whether all ctors of CLASS_TYPE
4415 declare a checked exception in their `throws' clause in order to
4416 see whether it's necessary to encapsulate the instance initializer
4417 statements in a try/catch/rethrow sequence. */
4420 generate_instinit (tree class_type)
4423 tree compound = NULL_TREE;
4424 tree parms = tree_cons (this_identifier_node,
4425 build_pointer_type (class_type), end_params_node);
4426 tree mdecl = create_artificial_method (class_type, ACC_PRIVATE,
4428 instinit_identifier_node, parms);
4430 layout_class_method (class_type, CLASSTYPE_SUPER (class_type),
4433 /* Gather all the statements in a compound */
4434 for (current = TYPE_II_STMT_LIST (class_type);
4435 current; current = TREE_CHAIN (current))
4436 compound = add_stmt_to_compound (compound, NULL_TREE, current);
4438 /* We need to encapsulate COMPOUND by a try/catch statement to
4439 rethrow exceptions that might occur in the instance initializer.
4440 We do that only if all ctors of CLASS_TYPE are set to catch a
4441 checked exception. This doesn't apply to anonymous classes (since
4442 they don't have declared ctors.) */
4443 if (!ANONYMOUS_CLASS_P (class_type) &&
4444 ctors_unchecked_throws_clause_p (class_type))
4446 compound = encapsulate_with_try_catch (0, exception_type_node, compound,
4447 build1 (THROW_EXPR, NULL_TREE,
4448 build_wfl_node (wpv_id)));
4449 DECL_FUNCTION_THROWS (mdecl) = build_tree_list (NULL_TREE,
4450 exception_type_node);
4453 start_artificial_method_body (mdecl);
4454 java_method_add_stmt (mdecl, compound);
4455 end_artificial_method_body (mdecl);
4462 build_instinit_invocation (tree class_type)
4464 tree to_return = NULL_TREE;
4466 if (TYPE_II_STMT_LIST (class_type))
4468 tree parm = build_tree_list (NULL_TREE,
4469 build_wfl_node (this_identifier_node));
4471 build_method_invocation (build_wfl_node (instinit_identifier_node),
4477 /* Shared across method_declarator and method_header to remember the
4478 patch stage that was reached during the declaration of the method.
4479 A method DECL is built differently is there is no patch
4480 (JDEP_NO_PATCH) or a patch (JDEP_METHOD or JDEP_METHOD_RETURN)
4481 pending on the currently defined method. */
4483 static int patch_stage;
4485 /* Check the method declaration and add the method to its current
4486 class. If the argument list is known to contain incomplete types,
4487 the method is partially added and the registration will be resume
4488 once the method arguments resolved. If TYPE is NULL, we're dealing
4489 with a constructor. */
4492 method_header (int flags, tree type, tree mdecl, tree throws)
4494 tree type_wfl = NULL_TREE;
4495 tree meth_name = NULL_TREE;
4496 tree current, orig_arg, this_class = NULL;
4499 int constructor_ok = 0, must_chain;
4502 if (mdecl == error_mark_node)
4503 return error_mark_node;
4504 meth = TREE_VALUE (mdecl);
4505 id = TREE_PURPOSE (mdecl);
4507 check_modifiers_consistency (flags);
4510 this_class = TREE_TYPE (GET_CPC ());
4512 if (!this_class || this_class == error_mark_node)
4515 /* There are some forbidden modifiers for an abstract method and its
4516 class must be abstract as well. */
4517 if (type && (flags & ACC_ABSTRACT))
4519 ABSTRACT_CHECK (flags, ACC_PRIVATE, id, "Private");
4520 ABSTRACT_CHECK (flags, ACC_STATIC, id, "Static");
4521 ABSTRACT_CHECK (flags, ACC_FINAL, id, "Final");
4522 ABSTRACT_CHECK (flags, ACC_NATIVE, id, "Native");
4523 ABSTRACT_CHECK (flags, ACC_SYNCHRONIZED, id, "Synchronized");
4524 ABSTRACT_CHECK (flags, ACC_STRICT, id, "Strictfp");
4525 if (!CLASS_ABSTRACT (TYPE_NAME (this_class))
4526 && !CLASS_INTERFACE (TYPE_NAME (this_class)))
4528 (id, "Class `%s' must be declared abstract to define abstract method `%s'",
4529 IDENTIFIER_POINTER (DECL_NAME (GET_CPC ())),
4530 IDENTIFIER_POINTER (EXPR_WFL_NODE (id)));
4533 /* A native method can't be strictfp. */
4534 if ((flags & ACC_NATIVE) && (flags & ACC_STRICT))
4535 parse_error_context (id, "native method `%s' can't be strictfp",
4536 IDENTIFIER_POINTER (EXPR_WFL_NODE (id)));
4537 /* No such thing as a transient or volatile method. */
4538 if ((flags & ACC_TRANSIENT))
4539 parse_error_context (id, "method `%s' can't be transient",
4540 IDENTIFIER_POINTER (EXPR_WFL_NODE (id)));
4541 if ((flags & ACC_VOLATILE))
4542 parse_error_context (id, "method `%s' can't be volatile",
4543 IDENTIFIER_POINTER (EXPR_WFL_NODE (id)));
4545 /* Things to be checked when declaring a constructor */
4548 int ec = java_error_count;
4549 /* 8.6: Constructor declarations: we might be trying to define a
4550 method without specifying a return type. */
4551 if (EXPR_WFL_NODE (id) != GET_CPC_UN ())
4553 (id, "Invalid method declaration, return type required");
4554 /* 8.6.3: Constructor modifiers */
4557 JCONSTRUCTOR_CHECK (flags, ACC_ABSTRACT, id, "abstract");
4558 JCONSTRUCTOR_CHECK (flags, ACC_STATIC, id, "static");
4559 JCONSTRUCTOR_CHECK (flags, ACC_FINAL, id, "final");
4560 JCONSTRUCTOR_CHECK (flags, ACC_NATIVE, id, "native");
4561 JCONSTRUCTOR_CHECK (flags, ACC_SYNCHRONIZED, id, "synchronized");
4562 JCONSTRUCTOR_CHECK (flags, ACC_STRICT, id, "strictfp");
4564 /* If we found error here, we don't consider it's OK to tread
4565 the method definition as a constructor, for the rest of this
4567 if (ec == java_error_count)
4571 /* Method declared within the scope of an interface are implicitly
4572 abstract and public. Conflicts with other erroneously provided
4573 modifiers are checked right after. */
4575 if (CLASS_INTERFACE (TYPE_NAME (this_class)))
4577 /* If FLAGS isn't set because of a modifier, turn the
4578 corresponding modifier WFL to NULL so we issue a warning on
4579 the obsolete use of the modifier */
4580 if (!(flags & ACC_PUBLIC))
4581 MODIFIER_WFL (PUBLIC_TK) = NULL;
4582 if (!(flags & ACC_ABSTRACT))
4583 MODIFIER_WFL (ABSTRACT_TK) = NULL;
4584 flags |= ACC_PUBLIC;
4585 flags |= ACC_ABSTRACT;
4588 /* Inner class can't declare static methods */
4589 if ((flags & ACC_STATIC) && !TOPLEVEL_CLASS_TYPE_P (this_class))
4592 (id, "Method `%s' can't be static in inner class `%s'. Only members of interfaces and top-level classes can be static",
4593 IDENTIFIER_POINTER (EXPR_WFL_NODE (id)),
4594 lang_printable_name (this_class, 0));
4597 /* Modifiers context reset moved up, so abstract method declaration
4598 modifiers can be later checked. */
4600 /* Set constructor returned type to void and method name to <init>,
4601 unless we found an error identifier the constructor (in which
4602 case we retain the original name) */
4605 type = void_type_node;
4607 meth_name = init_identifier_node;
4610 meth_name = EXPR_WFL_NODE (id);
4612 /* Do the returned type resolution and registration if necessary */
4613 SET_TYPE_FOR_RESOLUTION (type, type_wfl, must_chain);
4616 type = build_array_from_name (type, type_wfl, meth_name, &meth_name);
4617 EXPR_WFL_NODE (id) = meth_name;
4618 PROMOTE_RECORD_IF_COMPLETE (type, must_chain);
4622 patch_stage = JDEP_METHOD_RETURN;
4623 register_incomplete_type (patch_stage, type_wfl, id, type);
4624 TREE_TYPE (meth) = GET_REAL_TYPE (type);
4627 TREE_TYPE (meth) = type;
4629 saved_lineno = input_line;
4630 /* When defining an abstract or interface method, the curly
4631 bracket at level 1 doesn't exist because there is no function
4633 input_line = (ctxp->first_ccb_indent1 ? ctxp->first_ccb_indent1 :
4634 EXPR_WFL_LINENO (id));
4636 /* Remember the original argument list */
4637 orig_arg = TYPE_ARG_TYPES (meth);
4639 if (patch_stage) /* includes ret type and/or all args */
4642 meth = add_method_1 (this_class, flags, meth_name, meth);
4643 /* Patch for the return type */
4644 if (patch_stage == JDEP_METHOD_RETURN)
4646 jdep = CLASSD_LAST (ctxp->classd_list);
4647 JDEP_GET_PATCH (jdep) = &TREE_TYPE (TREE_TYPE (meth));
4649 /* This is the stop JDEP. METH allows the function's signature
4651 register_incomplete_type (JDEP_METHOD_END, NULL_TREE, meth, NULL_TREE);
4654 meth = add_method (this_class, flags, meth_name,
4655 build_java_signature (meth));
4657 /* Remember final parameters */
4658 MARK_FINAL_PARMS (meth, orig_arg);
4660 /* Fix the method argument list so we have the argument name
4662 fix_method_argument_names (orig_arg, meth);
4664 /* Register the parameter number and re-install the current line
4666 DECL_MAX_LOCALS (meth) = ctxp->formal_parameter_number+1;
4667 input_line = saved_lineno;
4669 /* Register exception specified by the `throws' keyword for
4670 resolution and set the method decl appropriate field to the list.
4671 Note: the grammar ensures that what we get here are class
4675 throws = nreverse (throws);
4676 for (current = throws; current; current = TREE_CHAIN (current))
4678 register_incomplete_type (JDEP_EXCEPTION, TREE_VALUE (current),
4679 NULL_TREE, NULL_TREE);
4680 JDEP_GET_PATCH (CLASSD_LAST (ctxp->classd_list)) =
4681 &TREE_VALUE (current);
4683 DECL_FUNCTION_THROWS (meth) = throws;
4686 if (TREE_TYPE (GET_CPC ()) != object_type_node)
4687 DECL_FUNCTION_WFL (meth) = id;
4689 /* Set the flag if we correctly processed a constructor */
4692 DECL_CONSTRUCTOR_P (meth) = 1;
4693 /* Compute and store the number of artificial parameters declared
4694 for this constructor */
4695 for (count = 0, current = TYPE_FIELDS (this_class); current;
4696 current = TREE_CHAIN (current))
4697 if (FIELD_LOCAL_ALIAS (current))
4699 DECL_FUNCTION_NAP (meth) = count;
4702 /* Eventually set the @deprecated tag flag */
4703 CHECK_DEPRECATED (meth);
4705 /* If doing xref, store column and line number information instead
4706 of the line number only. */
4708 DECL_SOURCE_LINE (meth) = EXPR_WFL_LINECOL (id);
4714 fix_method_argument_names (tree orig_arg, tree meth)
4716 tree arg = TYPE_ARG_TYPES (TREE_TYPE (meth));
4717 if (TREE_CODE (TREE_TYPE (meth)) == METHOD_TYPE)
4719 TREE_PURPOSE (arg) = this_identifier_node;
4720 arg = TREE_CHAIN (arg);
4722 while (orig_arg != end_params_node)
4724 TREE_PURPOSE (arg) = TREE_PURPOSE (orig_arg);
4725 orig_arg = TREE_CHAIN (orig_arg);
4726 arg = TREE_CHAIN (arg);
4730 /* Complete the method declaration with METHOD_BODY. */
4733 finish_method_declaration (tree method_body)
4737 if (!current_function_decl)
4740 flags = get_access_flags_from_decl (current_function_decl);
4742 /* 8.4.5 Method Body */
4743 if ((flags & ACC_ABSTRACT || flags & ACC_NATIVE) && method_body)
4745 tree name = DECL_NAME (current_function_decl);
4746 parse_error_context (DECL_FUNCTION_WFL (current_function_decl),
4747 "%s method `%s' can't have a body defined",
4748 (METHOD_NATIVE (current_function_decl) ?
4749 "Native" : "Abstract"),
4750 IDENTIFIER_POINTER (name));
4751 method_body = NULL_TREE;
4753 else if (!(flags & ACC_ABSTRACT) && !(flags & ACC_NATIVE) && !method_body)
4755 tree name = DECL_NAME (current_function_decl);
4757 (DECL_FUNCTION_WFL (current_function_decl),
4758 "Non native and non abstract method `%s' must have a body defined",
4759 IDENTIFIER_POINTER (name));
4760 method_body = NULL_TREE;
4763 if (flag_emit_class_files && method_body
4764 && TREE_CODE (method_body) == NOP_EXPR
4765 && TREE_TYPE (current_function_decl)
4766 && TREE_TYPE (TREE_TYPE (current_function_decl)) == void_type_node)
4767 method_body = build1 (RETURN_EXPR, void_type_node, NULL);
4769 BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (current_function_decl)) = method_body;
4770 maybe_absorb_scoping_blocks ();
4771 /* Exit function's body */
4773 /* Merge last line of the function with first line, directly in the
4774 function decl. It will be used to emit correct debug info. */
4775 if (!flag_emit_xref)
4776 DECL_FUNCTION_LAST_LINE (current_function_decl) = ctxp->last_ccb_indent1;
4778 /* Since function's argument's list are shared, reset the
4779 ARG_FINAL_P parameter that might have been set on some of this
4780 function parameters. */
4781 UNMARK_FINAL_PARMS (current_function_decl);
4783 /* So we don't have an irrelevant function declaration context for
4784 the next static block we'll see. */
4785 current_function_decl = NULL_TREE;
4788 /* Build a an error message for constructor circularity errors. */
4791 constructor_circularity_msg (tree from, tree to)
4793 static char string [4096];
4794 char *t = xstrdup (lang_printable_name (from, 0));
4795 sprintf (string, "`%s' invokes `%s'", t, lang_printable_name (to, 0));
4800 /* Verify a circular call to METH. Return 1 if an error is found, 0
4803 static GTY(()) tree vcc_list;
4805 verify_constructor_circularity (tree meth, tree current)
4809 for (c = DECL_CONSTRUCTOR_CALLS (current); c; c = TREE_CHAIN (c))
4811 if (TREE_VALUE (c) == meth)
4817 vcc_list = nreverse (vcc_list);
4818 for (liste = vcc_list; liste; liste = TREE_CHAIN (liste))
4821 (TREE_PURPOSE (TREE_PURPOSE (liste)), "%s",
4822 constructor_circularity_msg
4823 (TREE_VALUE (liste), TREE_VALUE (TREE_PURPOSE (liste))));
4827 t = xstrdup (lang_printable_name (meth, 0));
4828 parse_error_context (TREE_PURPOSE (c),
4829 "%s: recursive invocation of constructor `%s'",
4830 constructor_circularity_msg (current, meth), t);
4832 vcc_list = NULL_TREE;
4836 for (c = DECL_CONSTRUCTOR_CALLS (current); c; c = TREE_CHAIN (c))
4838 vcc_list = tree_cons (c, current, vcc_list);
4839 if (verify_constructor_circularity (meth, TREE_VALUE (c)))
4841 vcc_list = TREE_CHAIN (vcc_list);
4846 /* Check modifiers that can be declared but exclusively */
4849 check_modifiers_consistency (int flags)
4852 tree cl = NULL_TREE;
4854 THIS_MODIFIER_ONLY (flags, ACC_PUBLIC, PUBLIC_TK, acc_count, cl);
4855 THIS_MODIFIER_ONLY (flags, ACC_PRIVATE, PRIVATE_TK, acc_count, cl);
4856 THIS_MODIFIER_ONLY (flags, ACC_PROTECTED, PROTECTED_TK, acc_count, cl);
4859 (cl, "Inconsistent member declaration. At most one of `public', `private', or `protected' may be specified");
4863 THIS_MODIFIER_ONLY (flags, ACC_FINAL, FINAL_TK, acc_count, cl);
4864 THIS_MODIFIER_ONLY (flags, ACC_VOLATILE, VOLATILE_TK, acc_count, cl);
4866 parse_error_context (cl,
4867 "Inconsistent member declaration. At most one of `final' or `volatile' may be specified");
4870 /* Check the methode header METH for abstract specifics features */
4873 check_abstract_method_header (tree meth)
4875 int flags = get_access_flags_from_decl (meth);
4877 OBSOLETE_MODIFIER_WARNING2 (MODIFIER_WFL (ABSTRACT_TK), flags,
4878 ACC_ABSTRACT, "abstract method",
4879 IDENTIFIER_POINTER (DECL_NAME (meth)));
4880 OBSOLETE_MODIFIER_WARNING2 (MODIFIER_WFL (PUBLIC_TK), flags,
4881 ACC_PUBLIC, "abstract method",
4882 IDENTIFIER_POINTER (DECL_NAME (meth)));
4884 check_modifiers ("Illegal modifier `%s' for interface method",
4885 flags, INTERFACE_METHOD_MODIFIERS);
4888 /* Create a FUNCTION_TYPE node and start augmenting it with the
4889 declared function arguments. Arguments type that can't be resolved
4890 are left as they are, but the returned node is marked as containing
4891 incomplete types. */
4894 method_declarator (tree id, tree list)
4896 tree arg_types = NULL_TREE, current, node;
4897 tree meth = make_node (FUNCTION_TYPE);
4900 patch_stage = JDEP_NO_PATCH;
4902 if (GET_CPC () == error_mark_node)
4903 return error_mark_node;
4905 /* If we're dealing with an inner class constructor, we hide the
4906 this$<n> decl in the name field of its parameter declaration. We
4907 also might have to hide the outer context local alias
4908 initializers. Not done when the class is a toplevel class. */
4909 if (PURE_INNER_CLASS_DECL_P (GET_CPC ())
4910 && EXPR_WFL_NODE (id) == GET_CPC_UN ())
4912 tree aliases_list, type, thisn;
4913 /* First the aliases, linked to the regular parameters */
4915 build_alias_initializer_parameter_list (AIPL_FUNCTION_DECLARATION,
4916 TREE_TYPE (GET_CPC ()),
4918 list = chainon (nreverse (aliases_list), list);
4921 type = TREE_TYPE (DECL_CONTEXT (GET_CPC ()));
4922 thisn = build_current_thisn (TREE_TYPE (GET_CPC ()));
4923 list = tree_cons (build_wfl_node (thisn), build_pointer_type (type),
4927 for (current = list; current; current = TREE_CHAIN (current))
4930 tree wfl_name = TREE_PURPOSE (current);
4931 tree type = TREE_VALUE (current);
4932 tree name = EXPR_WFL_NODE (wfl_name);
4933 tree already, arg_node;
4934 tree type_wfl = NULL_TREE;
4937 /* Obtain a suitable type for resolution, if necessary */
4938 SET_TYPE_FOR_RESOLUTION (type, type_wfl, must_chain);
4940 /* Process NAME, as it may specify extra dimension(s) for it */
4941 type = build_array_from_name (type, type_wfl, name, &name);
4942 EXPR_WFL_NODE (wfl_name) = name;
4944 real_type = GET_REAL_TYPE (type);
4945 if (TREE_CODE (real_type) == RECORD_TYPE)
4947 real_type = promote_type (real_type);
4948 if (TREE_CODE (type) == TREE_LIST)
4949 TREE_PURPOSE (type) = real_type;
4952 /* Check redefinition */
4953 for (already = arg_types; already; already = TREE_CHAIN (already))
4954 if (TREE_PURPOSE (already) == name)
4957 (wfl_name, "Variable `%s' is used more than once in the argument list of method `%s'",
4958 IDENTIFIER_POINTER (name),
4959 IDENTIFIER_POINTER (EXPR_WFL_NODE (id)));
4963 /* If we've an incomplete argument type, we know there is a location
4964 to patch when the type get resolved, later. */
4968 patch_stage = JDEP_METHOD;
4969 type = register_incomplete_type (patch_stage,
4970 type_wfl, wfl_name, type);
4971 jdep = CLASSD_LAST (ctxp->classd_list);
4972 JDEP_MISC (jdep) = id;
4975 /* The argument node: a name and a (possibly) incomplete type. */
4976 arg_node = build_tree_list (name, real_type);
4977 /* Remember arguments declared final. */
4978 ARG_FINAL_P (arg_node) = ARG_FINAL_P (current);
4981 JDEP_GET_PATCH (jdep) = &TREE_VALUE (arg_node);
4982 TREE_CHAIN (arg_node) = arg_types;
4983 arg_types = arg_node;
4985 TYPE_ARG_TYPES (meth) = chainon (nreverse (arg_types), end_params_node);
4986 node = build_tree_list (id, meth);
4991 unresolved_type_p (tree wfl, tree *returned)
4994 if (TREE_CODE (wfl) == EXPR_WITH_FILE_LOCATION)
4998 tree decl = IDENTIFIER_CLASS_VALUE (EXPR_WFL_NODE (wfl));
4999 if (decl && current_class && (decl == TYPE_NAME (current_class)))
5000 *returned = TREE_TYPE (decl);
5001 else if (GET_CPC_UN () == EXPR_WFL_NODE (wfl))
5002 *returned = TREE_TYPE (GET_CPC ());
5004 *returned = NULL_TREE;
5013 /* From NAME, build a qualified identifier node using the
5014 qualification from the current package definition. */
5017 parser_qualified_classname (tree name)
5019 tree nested_class_name;
5021 if ((nested_class_name = maybe_make_nested_class_name (name)))
5022 return nested_class_name;
5025 return merge_qualified_name (ctxp->package, name);
5030 /* Called once the type a interface extends is resolved. Returns 0 if
5031 everything is OK. */
5034 parser_check_super_interface (tree super_decl, tree this_decl, tree this_wfl)
5036 tree super_type = TREE_TYPE (super_decl);
5038 /* Has to be an interface */
5039 if (!CLASS_INTERFACE (super_decl))
5042 (this_wfl, "%s `%s' can't implement/extend %s `%s'",
5043 (CLASS_INTERFACE (TYPE_NAME (TREE_TYPE (this_decl))) ?
5044 "Interface" : "Class"),
5045 IDENTIFIER_POINTER (DECL_NAME (this_decl)),
5046 (TYPE_ARRAY_P (super_type) ? "array" : "class"),
5047 IDENTIFIER_POINTER (DECL_NAME (super_decl)));
5051 /* Check top-level interface access. Inner classes are subject to member
5052 access rules (6.6.1). */
5053 if (! INNER_CLASS_P (super_type)
5054 && check_pkg_class_access (DECL_NAME (super_decl),
5055 lookup_cl (this_decl), true))
5058 SOURCE_FRONTEND_DEBUG (("Completing interface %s with %s",
5059 IDENTIFIER_POINTER (DECL_NAME (this_decl)),
5060 IDENTIFIER_POINTER (DECL_NAME (super_decl))));
5064 /* Makes sure that SUPER_DECL is suitable to extend THIS_DECL. Returns
5065 0 if everything is OK. */
5068 parser_check_super (tree super_decl, tree this_decl, tree wfl)
5070 tree super_type = TREE_TYPE (super_decl);
5072 /* SUPER should be a CLASS (neither an array nor an interface) */
5073 if (TYPE_ARRAY_P (super_type) || CLASS_INTERFACE (TYPE_NAME (super_type)))
5076 (wfl, "Class `%s' can't subclass %s `%s'",
5077 IDENTIFIER_POINTER (DECL_NAME (this_decl)),
5078 (CLASS_INTERFACE (TYPE_NAME (super_type)) ? "interface" : "array"),
5079 IDENTIFIER_POINTER (DECL_NAME (super_decl)));
5083 if (CLASS_FINAL (TYPE_NAME (super_type)))
5085 parse_error_context (wfl, "Can't subclass final classes: %s",
5086 IDENTIFIER_POINTER (DECL_NAME (super_decl)));
5090 /* Check top-level class scope. Inner classes are subject to member access
5092 if (! INNER_CLASS_P (super_type)
5093 && (check_pkg_class_access (DECL_NAME (super_decl), wfl, true)))
5096 SOURCE_FRONTEND_DEBUG (("Completing class %s with %s",
5097 IDENTIFIER_POINTER (DECL_NAME (this_decl)),
5098 IDENTIFIER_POINTER (DECL_NAME (super_decl))));
5102 /* Create a new dependency list and link it (in a LIFO manner) to the
5103 CTXP list of type dependency list. */
5106 create_jdep_list (struct parser_ctxt *ctxp)
5108 jdeplist *new = xmalloc (sizeof (jdeplist));
5109 new->first = new->last = NULL;
5110 new->next = ctxp->classd_list;
5111 ctxp->classd_list = new;
5115 reverse_jdep_list (struct parser_ctxt *ctxp)
5117 register jdeplist *prev = NULL, *current, *next;
5118 for (current = ctxp->classd_list; current; current = next)
5120 next = current->next;
5121 current->next = prev;
5127 /* Create a fake pointer based on the ID stored in
5128 TYPE_NAME. TYPE_NAME can be a WFL or a incomplete type asking to be
5129 registered again. */
5132 obtain_incomplete_type (tree type_name)
5134 tree ptr = NULL_TREE, name;
5136 if (TREE_CODE (type_name) == EXPR_WITH_FILE_LOCATION)
5137 name = EXPR_WFL_NODE (type_name);
5138 else if (INCOMPLETE_TYPE_P (type_name))
5139 name = TYPE_NAME (type_name);
5143 /* Workaround from build_pointer_type for incomplete types. */
5144 BUILD_PTR_FROM_NAME (ptr, name);
5145 TYPE_MODE (ptr) = ptr_mode;
5151 /* Register a incomplete type whose name is WFL. Reuse PTR if PTR is
5152 non NULL instead of computing a new fake type based on WFL. The new
5153 dependency is inserted in the current type dependency list, in FIFO
5157 register_incomplete_type (int kind, tree wfl, tree decl, tree ptr)
5159 jdep *new = xmalloc (sizeof (jdep));
5161 if (!ptr && kind != JDEP_METHOD_END) /* JDEP_METHOD_END is a mere marker */
5162 ptr = obtain_incomplete_type (wfl);
5164 JDEP_KIND (new) = kind;
5165 JDEP_DECL (new) = decl;
5166 JDEP_TO_RESOLVE (new) = ptr;
5167 JDEP_WFL (new) = wfl;
5168 JDEP_CHAIN (new) = NULL;
5169 JDEP_MISC (new) = NULL_TREE;
5170 /* For some dependencies, set the enclosing class of the current
5171 class to be the enclosing context */
5172 if ((kind == JDEP_INTERFACE || kind == JDEP_ANONYMOUS)
5173 && GET_ENCLOSING_CPC ())
5174 JDEP_ENCLOSING (new) = TREE_VALUE (GET_ENCLOSING_CPC ());
5175 else if (kind == JDEP_SUPER)
5176 JDEP_ENCLOSING (new) = (GET_ENCLOSING_CPC () ?
5177 TREE_VALUE (GET_ENCLOSING_CPC ()) : NULL_TREE);
5179 JDEP_ENCLOSING (new) = GET_CPC ();
5180 JDEP_GET_PATCH (new) = (tree *)NULL;
5182 JDEP_INSERT (ctxp->classd_list, new);
5187 /* This checks for circular references with innerclasses. We start
5188 from SOURCE and should never reach TARGET. Extended/implemented
5189 types in SOURCE have their enclosing context checked not to reach
5190 TARGET. When the last enclosing context of SOURCE is reached, its
5191 extended/implemented types are also checked not to reach TARGET.
5192 In case of error, WFL of the offending type is returned; NULL_TREE
5196 check_inner_circular_reference (tree source, tree target)
5198 tree basetype_vec = TYPE_BINFO_BASETYPES (source);
5205 for (i = 0; i < TREE_VEC_LENGTH (basetype_vec); i++)
5209 /* We can end up with a NULL_TREE or an incomplete type here if
5210 we encountered previous type resolution errors. It's safe to
5211 simply ignore these cases. */
5212 if (TREE_VEC_ELT (basetype_vec, i) == NULL_TREE)
5214 su = BINFO_TYPE (TREE_VEC_ELT (basetype_vec, i));
5215 if (INCOMPLETE_TYPE_P (su))
5218 if (inherits_from_p (su, target))
5219 return lookup_cl (TYPE_NAME (su));
5221 for (ctx = DECL_CONTEXT (TYPE_NAME (su)); ctx; ctx = DECL_CONTEXT (ctx))
5223 /* An enclosing context shouldn't be TARGET */
5224 if (ctx == TYPE_NAME (target))
5225 return lookup_cl (TYPE_NAME (su));
5227 /* When we reach the enclosing last context, start a check
5228 on it, with the same target */
5229 if (! DECL_CONTEXT (ctx) &&
5230 (cl = check_inner_circular_reference (TREE_TYPE (ctx), target)))
5237 /* Explore TYPE's `extends' clause member(s) and return the WFL of the
5238 offending type if a circularity is detected. NULL_TREE is returned
5239 otherwise. TYPE can be an interface or a class. */
5242 check_circular_reference (tree type)
5244 tree basetype_vec = TYPE_BINFO_BASETYPES (type);
5250 if (! CLASS_INTERFACE (TYPE_NAME (type)))
5252 if (inherits_from_p (CLASSTYPE_SUPER (type), type))
5253 return lookup_cl (TYPE_NAME (type));
5257 for (i = 0; i < TREE_VEC_LENGTH (basetype_vec); i++)
5259 tree vec_elt = TREE_VEC_ELT (basetype_vec, i);
5260 if (vec_elt && BINFO_TYPE (vec_elt) != object_type_node
5261 && interface_of_p (type, BINFO_TYPE (vec_elt)))
5262 return lookup_cl (TYPE_NAME (BINFO_TYPE (vec_elt)));
5268 java_check_circular_reference (void)
5271 for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
5273 tree type = TREE_TYPE (current);
5276 cl = check_circular_reference (type);
5278 cl = check_inner_circular_reference (type, type);
5280 parse_error_context (cl, "Cyclic class inheritance%s",
5281 (cyclic_inheritance_report ?
5282 cyclic_inheritance_report : ""));
5286 /* Augment the parameter list PARM with parameters crafted to
5287 initialize outer context locals aliases. Through ARTIFICIAL, a
5288 count is kept of the number of crafted parameters. MODE governs
5289 what eventually gets created: something suitable for a function
5290 creation or a function invocation, either the constructor or
5294 build_alias_initializer_parameter_list (int mode, tree class_type, tree parm,
5298 tree additional_parms = NULL_TREE;
5300 for (field = TYPE_FIELDS (class_type); field; field = TREE_CHAIN (field))
5301 if (FIELD_LOCAL_ALIAS (field))
5303 const char *buffer = IDENTIFIER_POINTER (DECL_NAME (field));
5304 tree purpose = NULL_TREE, value = NULL_TREE, name = NULL_TREE;
5309 case AIPL_FUNCTION_DECLARATION:
5310 MANGLE_ALIAS_INITIALIZER_PARAMETER_NAME_STR (mangled_id,
5312 purpose = build_wfl_node (mangled_id);
5313 if (TREE_CODE (TREE_TYPE (field)) == POINTER_TYPE)
5314 value = build_wfl_node (TYPE_NAME (TREE_TYPE (field)));
5316 value = TREE_TYPE (field);
5319 case AIPL_FUNCTION_CREATION:
5320 MANGLE_ALIAS_INITIALIZER_PARAMETER_NAME_STR (purpose,
5322 value = TREE_TYPE (field);
5325 case AIPL_FUNCTION_FINIT_INVOCATION:
5326 MANGLE_ALIAS_INITIALIZER_PARAMETER_NAME_STR (mangled_id,
5328 /* Now, this is wrong. purpose should always be the NAME
5329 of something and value its matching value (decl, type,
5330 etc...) FIXME -- but there is a lot to fix. */
5332 /* When invoked for this kind of operation, we already
5333 know whether a field is used or not. */
5334 purpose = TREE_TYPE (field);
5335 value = build_wfl_node (mangled_id);
5338 case AIPL_FUNCTION_CTOR_INVOCATION:
5339 /* There are two case: the constructor invocation happens
5340 outside the local inner, in which case, locales from the outer
5341 context are directly used.
5343 Otherwise, we fold to using the alias directly. */
5344 if (class_type == current_class)
5348 name = get_identifier (&buffer[4]);
5349 value = IDENTIFIER_LOCAL_VALUE (name);
5353 additional_parms = tree_cons (purpose, value, additional_parms);
5357 if (additional_parms)
5359 if (ANONYMOUS_CLASS_P (class_type)
5360 && mode == AIPL_FUNCTION_CTOR_INVOCATION)
5361 additional_parms = nreverse (additional_parms);
5362 parm = chainon (additional_parms, parm);
5368 /* Craft a constructor for CLASS_DECL -- what we should do when none
5369 where found. ARGS is non NULL when a special signature must be
5370 enforced. This is the case for anonymous classes. */
5373 craft_constructor (tree class_decl, tree args)
5375 tree class_type = TREE_TYPE (class_decl);
5376 tree parm = NULL_TREE;
5377 int flags = (get_access_flags_from_decl (class_decl) & ACC_PUBLIC ?
5379 int i = 0, artificial = 0;
5380 tree decl, ctor_name;
5383 /* The constructor name is <init> unless we're dealing with an
5384 anonymous class, in which case the name will be fixed after having
5386 if (ANONYMOUS_CLASS_P (class_type))
5387 ctor_name = DECL_NAME (class_decl);
5389 ctor_name = init_identifier_node;
5391 /* If we're dealing with an inner class constructor, we hide the
5392 this$<n> decl in the name field of its parameter declaration. */
5393 if (PURE_INNER_CLASS_TYPE_P (class_type))
5395 tree type = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (class_type)));
5396 parm = tree_cons (build_current_thisn (class_type),
5397 build_pointer_type (type), parm);
5399 /* Some more arguments to be hidden here. The values of the local
5400 variables of the outer context that the inner class needs to see. */
5401 parm = build_alias_initializer_parameter_list (AIPL_FUNCTION_CREATION,
5406 /* Then if there are any args to be enforced, enforce them now */
5407 for (; args && args != end_params_node; args = TREE_CHAIN (args))
5409 sprintf (buffer, "parm%d", i++);
5410 parm = tree_cons (get_identifier (buffer), TREE_VALUE (args), parm);
5413 CRAFTED_PARAM_LIST_FIXUP (parm);
5414 decl = create_artificial_method (class_type, flags, void_type_node,
5416 fix_method_argument_names (parm, decl);
5417 /* Now, mark the artificial parameters. */
5418 DECL_FUNCTION_NAP (decl) = artificial;
5419 DECL_FUNCTION_SYNTHETIC_CTOR (decl) = DECL_CONSTRUCTOR_P (decl) = 1;
5420 DECL_INLINE (decl) = 1;
5425 /* Fix the constructors. This will be called right after circular
5426 references have been checked. It is necessary to fix constructors
5427 early even if no code generation will take place for that class:
5428 some generated constructor might be required by the class whose
5429 compilation triggered this one to be simply loaded. */
5432 java_fix_constructors (void)
5436 for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
5438 tree class_type = TREE_TYPE (current);
5442 if (CLASS_INTERFACE (TYPE_NAME (class_type)))
5445 current_class = class_type;
5446 for (decl = TYPE_METHODS (class_type); decl; decl = TREE_CHAIN (decl))
5448 if (DECL_CONSTRUCTOR_P (decl))
5450 fix_constructors (decl);
5455 /* Anonymous class constructor can't be generated that early. */
5456 if (!saw_ctor && !ANONYMOUS_CLASS_P (class_type))
5457 craft_constructor (current, NULL_TREE);
5461 /* safe_layout_class just makes sure that we can load a class without
5462 disrupting the current_class, input_file, lineno, etc, information
5463 about the class processed currently. */
5466 safe_layout_class (tree class)
5468 tree save_current_class = current_class;
5469 location_t save_location = input_location;
5471 layout_class (class);
5473 current_class = save_current_class;
5474 input_location = save_location;
5478 jdep_resolve_class (jdep *dep)
5482 if (JDEP_RESOLVED_P (dep))
5483 decl = JDEP_RESOLVED_DECL (dep);
5486 decl = resolve_class (JDEP_ENCLOSING (dep), JDEP_TO_RESOLVE (dep),
5487 JDEP_DECL (dep), JDEP_WFL (dep));
5488 JDEP_RESOLVED (dep, decl);
5489 /* If there is no WFL, that's ok. We generate this warning
5491 if (decl && JDEP_WFL (dep) != NULL_TREE)
5492 check_deprecation (JDEP_WFL (dep), decl);
5496 complete_class_report_errors (dep);
5497 else if (PURE_INNER_CLASS_DECL_P (decl))
5499 tree inner = TREE_TYPE (decl);
5500 if (! CLASS_LOADED_P (inner))
5502 safe_layout_class (inner);
5503 if (TYPE_SIZE (inner) == error_mark_node)
5504 TYPE_SIZE (inner) = NULL_TREE;
5506 check_inner_class_access (decl, JDEP_ENCLOSING (dep), JDEP_WFL (dep));
5511 /* Complete unsatisfied class declaration and their dependencies */
5514 java_complete_class (void)
5521 /* Process imports */
5524 /* Reverse things so we have the right order */
5525 ctxp->class_list = nreverse (ctxp->class_list);
5526 ctxp->classd_list = reverse_jdep_list (ctxp);
5528 for (cclassd = ctxp->classd_list, cclass = ctxp->class_list;
5530 cclass = TREE_CHAIN (cclass), cclassd = CLASSD_CHAIN (cclassd))
5534 /* We keep the compilation unit imports in the class so that
5535 they can be used later to resolve type dependencies that
5536 aren't necessary to solve now. */
5537 TYPE_IMPORT_LIST (TREE_TYPE (cclass)) = ctxp->import_list;
5538 TYPE_IMPORT_DEMAND_LIST (TREE_TYPE (cclass)) = ctxp->import_demand_list;
5540 for (dep = CLASSD_FIRST (cclassd); dep; dep = JDEP_CHAIN (dep))
5543 if (!(decl = jdep_resolve_class (dep)))
5546 /* Now it's time to patch */
5547 switch (JDEP_KIND (dep))
5550 /* Simply patch super */
5551 if (parser_check_super (decl, JDEP_DECL (dep), JDEP_WFL (dep)))
5553 BINFO_TYPE (TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO
5554 (TREE_TYPE (JDEP_DECL (dep)))), 0)) = TREE_TYPE (decl);
5559 /* We do part of the job done in add_field */
5560 tree field_decl = JDEP_DECL (dep);
5561 tree field_type = TREE_TYPE (decl);
5562 if (TREE_CODE (field_type) == RECORD_TYPE)
5563 field_type = promote_type (field_type);
5564 TREE_TYPE (field_decl) = field_type;
5565 DECL_ALIGN (field_decl) = 0;
5566 DECL_USER_ALIGN (field_decl) = 0;
5567 layout_decl (field_decl, 0);
5568 SOURCE_FRONTEND_DEBUG
5569 (("Completed field/var decl `%s' with `%s'",
5570 IDENTIFIER_POINTER (DECL_NAME (field_decl)),
5571 IDENTIFIER_POINTER (DECL_NAME (decl))));
5574 case JDEP_METHOD: /* We start patching a method */
5575 case JDEP_METHOD_RETURN:
5581 type = TREE_TYPE(decl);
5582 if (TREE_CODE (type) == RECORD_TYPE)
5583 type = promote_type (type);
5584 JDEP_APPLY_PATCH (dep, type);
5585 SOURCE_FRONTEND_DEBUG
5586 (((JDEP_KIND (dep) == JDEP_METHOD_RETURN ?
5587 "Completing fct `%s' with ret type `%s'":
5588 "Completing arg `%s' with type `%s'"),
5589 IDENTIFIER_POINTER (EXPR_WFL_NODE
5590 (JDEP_DECL_WFL (dep))),
5591 IDENTIFIER_POINTER (DECL_NAME (decl))));
5595 dep = JDEP_CHAIN (dep);
5596 if (JDEP_KIND (dep) == JDEP_METHOD_END)
5599 decl = jdep_resolve_class (dep);
5603 tree mdecl = JDEP_DECL (dep), signature;
5604 /* Recompute and reset the signature, check first that
5605 all types are now defined. If they're not,
5606 don't build the signature. */
5607 if (check_method_types_complete (mdecl))
5609 signature = build_java_signature (TREE_TYPE (mdecl));
5610 set_java_signature (TREE_TYPE (mdecl), signature);
5617 case JDEP_INTERFACE:
5618 if (parser_check_super_interface (decl, JDEP_DECL (dep),
5621 parser_add_interface (JDEP_DECL (dep), decl, JDEP_WFL (dep));
5626 type = TREE_TYPE(decl);
5627 if (TREE_CODE (type) == RECORD_TYPE)
5628 type = promote_type (type);
5629 JDEP_APPLY_PATCH (dep, type);
5633 JDEP_APPLY_PATCH (dep, TREE_TYPE (decl));
5634 SOURCE_FRONTEND_DEBUG
5635 (("Completing a random type dependency on a '%s' node",
5636 tree_code_name [TREE_CODE (JDEP_DECL (dep))]));
5639 case JDEP_EXCEPTION:
5640 JDEP_APPLY_PATCH (dep, TREE_TYPE (decl));
5641 SOURCE_FRONTEND_DEBUG
5642 (("Completing `%s' `throws' argument node",
5643 IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_WFL (dep)))));
5646 case JDEP_ANONYMOUS:
5647 patch_anonymous_class (decl, JDEP_DECL (dep), JDEP_WFL (dep));
5658 /* Resolve class CLASS_TYPE. Handle the case of trying to resolve an
5662 resolve_class (tree enclosing, tree class_type, tree decl, tree cl)
5664 tree tname = TYPE_NAME (class_type);
5665 tree resolved_type = TREE_TYPE (class_type);
5667 tree resolved_type_decl;
5669 if (resolved_type != NULL_TREE)
5671 tree resolved_type_decl = TYPE_NAME (resolved_type);
5672 if (resolved_type_decl == NULL_TREE
5673 || TREE_CODE (resolved_type_decl) == IDENTIFIER_NODE)
5675 resolved_type_decl = build_decl (TYPE_DECL,
5676 TYPE_NAME (class_type),
5679 return resolved_type_decl;
5682 /* 1- Check to see if we have an array. If true, find what we really
5684 if ((array_dims = build_type_name_from_array_name (tname,
5685 &TYPE_NAME (class_type))))
5686 WFL_STRIP_BRACKET (cl, cl);
5688 /* 2- Resolve the bare type */
5689 if (!(resolved_type_decl = do_resolve_class (enclosing, class_type,
5692 resolved_type = TREE_TYPE (resolved_type_decl);
5694 /* 3- If we have an array, reconstruct the array down to its nesting */
5697 for (; array_dims; array_dims--)
5698 resolved_type = build_java_array_type (resolved_type, -1);
5699 resolved_type_decl = TYPE_NAME (resolved_type);
5701 TREE_TYPE (class_type) = resolved_type;
5702 return resolved_type_decl;
5705 /* Effectively perform the resolution of class CLASS_TYPE. DECL or CL
5706 are used to report error messages; CL must either be NULL_TREE or a
5707 WFL wrapping a class. Do not try to replace TYPE_NAME (class_type)
5708 by a variable, since it is changed by find_in_imports{_on_demand}
5709 and (but it doesn't really matter) qualify_and_find. */
5712 do_resolve_class (tree enclosing, tree class_type, tree decl, tree cl)
5714 tree new_class_decl = NULL_TREE, super = NULL_TREE;
5715 tree saved_enclosing_type = enclosing ? TREE_TYPE (enclosing) : NULL_TREE;
5717 htab_t circularity_hash;
5719 if (QUALIFIED_P (TYPE_NAME (class_type)))
5721 /* If the type name is of the form `Q . Id', then Q is either a
5722 package name or a class name. First we try to find Q as a
5723 class and then treat Id as a member type. If we can't find Q
5724 as a class then we fall through. */
5725 tree q, left, left_type, right;
5726 if (breakdown_qualified (&left, &right, TYPE_NAME (class_type)) == 0)
5728 BUILD_PTR_FROM_NAME (left_type, left);
5729 q = do_resolve_class (enclosing, left_type, decl, cl);
5733 saved_enclosing_type = TREE_TYPE (q);
5734 BUILD_PTR_FROM_NAME (class_type, right);
5741 /* This hash table is used to register the classes we're going
5742 through when searching the current class as an inner class, in
5743 order to detect circular references. Remember to free it before
5744 returning the section 0- of this function. */
5745 circularity_hash = htab_create (20, htab_hash_pointer, htab_eq_pointer,
5748 /* 0- Search in the current class as an inner class.
5749 Maybe some code here should be added to load the class or
5750 something, at least if the class isn't an inner class and ended
5751 being loaded from class file. FIXME. */
5754 new_class_decl = resolve_inner_class (circularity_hash, cl, &enclosing,
5755 &super, class_type);
5759 /* If we haven't found anything because SUPER reached Object and
5760 ENCLOSING happens to be an innerclass, try the enclosing context. */
5761 if ((!super || super == object_type_node) &&
5762 enclosing && INNER_CLASS_DECL_P (enclosing))
5763 enclosing = DECL_CONTEXT (enclosing);
5765 enclosing = NULL_TREE;
5768 htab_delete (circularity_hash);
5771 return new_class_decl;
5774 /* 1- Check for the type in single imports. This will change
5775 TYPE_NAME() if something relevant is found */
5776 find_in_imports (saved_enclosing_type, class_type);
5778 /* 2- And check for the type in the current compilation unit */
5779 if ((new_class_decl = IDENTIFIER_CLASS_VALUE (TYPE_NAME (class_type))))
5781 if (!CLASS_LOADED_P (TREE_TYPE (new_class_decl)) &&
5782 !CLASS_FROM_SOURCE_P (TREE_TYPE (new_class_decl)))
5783 load_class (TYPE_NAME (class_type), 0);
5784 return IDENTIFIER_CLASS_VALUE (TYPE_NAME (class_type));
5787 /* 3- Search according to the current package definition */
5788 if (!QUALIFIED_P (TYPE_NAME (class_type)))
5790 if ((new_class_decl = qualify_and_find (class_type, ctxp->package,
5791 TYPE_NAME (class_type))))
5792 return new_class_decl;
5795 /* 4- Check the import on demands. Don't allow bar.baz to be
5796 imported from foo.* */
5797 if (!QUALIFIED_P (TYPE_NAME (class_type)))
5798 if (find_in_imports_on_demand (saved_enclosing_type, class_type))
5801 /* If found in find_in_imports_on_demand, the type has already been
5803 if ((new_class_decl = IDENTIFIER_CLASS_VALUE (TYPE_NAME (class_type))))
5804 return new_class_decl;
5806 /* 5- Try with a name qualified with the package name we've seen so far */
5807 if (!QUALIFIED_P (TYPE_NAME (class_type)))
5811 /* If there is a current package (ctxp->package), it's the first
5812 element of package_list and we can skip it. */
5813 for (package = (ctxp->package ?
5814 TREE_CHAIN (package_list) : package_list);
5815 package; package = TREE_CHAIN (package))
5816 if ((new_class_decl = qualify_and_find (class_type,
5817 TREE_PURPOSE (package),
5818 TYPE_NAME (class_type))))
5819 return new_class_decl;
5822 /* 5- Check another compilation unit that bears the name of type */
5823 load_class (TYPE_NAME (class_type), 0);
5826 cl = lookup_cl (decl);
5828 /* If we don't have a value for CL, then we're being called recursively.
5829 We can't check package access just yet, but it will be taken care of
5833 if (check_pkg_class_access (TYPE_NAME (class_type), cl, true))
5837 /* 6- Last call for a resolution */
5838 decl_result = IDENTIFIER_CLASS_VALUE (TYPE_NAME (class_type));
5840 /* The final lookup might have registered a.b.c into a.b$c If we
5841 failed at the first lookup, progressively change the name if
5842 applicable and use the matching DECL instead. */
5843 if (!decl_result && QUALIFIED_P (TYPE_NAME (class_type)))
5846 tree name = TYPE_NAME (class_type);
5847 char *namebuffer = alloca (IDENTIFIER_LENGTH (name) + 1);
5849 strcpy (namebuffer, IDENTIFIER_POINTER (name));
5853 /* Reach the last '.', and if applicable, replace it by a `$' and
5854 see if this exists as a type. */
5855 if ((separator = strrchr (namebuffer, '.')))
5858 name = get_identifier (namebuffer);
5859 decl_result = IDENTIFIER_CLASS_VALUE (name);
5861 } while (!decl_result && separator);
5867 qualify_and_find (tree class_type, tree package, tree name)
5869 tree new_qualified = merge_qualified_name (package, name);
5870 tree new_class_decl;
5872 if (!IDENTIFIER_CLASS_VALUE (new_qualified))
5873 load_class (new_qualified, 0);
5874 if ((new_class_decl = IDENTIFIER_CLASS_VALUE (new_qualified)))
5876 if (!CLASS_LOADED_P (TREE_TYPE (new_class_decl)) &&
5877 !CLASS_FROM_SOURCE_P (TREE_TYPE (new_class_decl)))
5878 load_class (new_qualified, 0);
5879 TYPE_NAME (class_type) = new_qualified;
5880 return IDENTIFIER_CLASS_VALUE (new_qualified);
5885 /* Resolve NAME and lay it out (if not done and if not the current
5886 parsed class). Return a decl node. This function is meant to be
5887 called when type resolution is necessary during the walk pass. */
5890 resolve_and_layout (tree something, tree cl)
5892 tree decl, decl_type;
5894 /* Don't do that on the current class */
5895 if (something == current_class)
5896 return TYPE_NAME (current_class);
5898 /* Don't do anything for void and other primitive types */
5899 if (JPRIMITIVE_TYPE_P (something) || something == void_type_node)
5902 /* Pointer types can be reall pointer types or fake pointers. When
5903 finding a real pointer, recheck for primitive types */
5904 if (TREE_CODE (something) == POINTER_TYPE)
5906 if (TREE_TYPE (something))
5908 something = TREE_TYPE (something);
5909 if (JPRIMITIVE_TYPE_P (something) || something == void_type_node)
5913 something = TYPE_NAME (something);
5916 /* Don't do anything for arrays of primitive types */
5917 if (TREE_CODE (something) == RECORD_TYPE && TYPE_ARRAY_P (something)
5918 && JPRIMITIVE_TYPE_P (TYPE_ARRAY_ELEMENT (something)))
5921 /* Something might be a WFL */
5922 if (TREE_CODE (something) == EXPR_WITH_FILE_LOCATION)
5923 something = EXPR_WFL_NODE (something);
5925 /* Otherwise, if something is not and IDENTIFIER_NODE, it can be a a
5926 TYPE_DECL or a real TYPE */
5927 else if (TREE_CODE (something) != IDENTIFIER_NODE)
5928 something = (TREE_CODE (TYPE_NAME (something)) == TYPE_DECL ?
5929 DECL_NAME (TYPE_NAME (something)) : TYPE_NAME (something));
5931 if (!(decl = resolve_no_layout (something, cl)))
5934 /* Resolve and layout if necessary */
5935 decl_type = TREE_TYPE (decl);
5936 layout_class_methods (decl_type);
5938 if (CLASS_FROM_SOURCE_P (decl_type))
5939 java_check_methods (decl);
5940 /* Layout the type if necessary */
5941 if (decl_type != current_class && !CLASS_LOADED_P (decl_type))
5942 safe_layout_class (decl_type);
5947 /* Resolve a class, returns its decl but doesn't perform any
5948 layout. The current parsing context is saved and restored */
5951 resolve_no_layout (tree name, tree cl)
5954 BUILD_PTR_FROM_NAME (ptr, name);
5955 java_parser_context_save_global ();
5956 decl = resolve_class (TYPE_NAME (current_class), ptr, NULL_TREE, cl);
5957 java_parser_context_restore_global ();
5962 /* Called when reporting errors. Skip the '[]'s in a complex array
5963 type description that failed to be resolved. purify_type_name can't
5964 use an identifier tree. */
5967 purify_type_name (const char *name)
5969 int len = strlen (name);
5972 STRING_STRIP_BRACKETS (name, len, bracket_found);
5975 char *stripped_name = xmemdup (name, len, len+1);
5976 stripped_name [len] = '\0';
5977 return stripped_name;
5982 /* The type CURRENT refers to can't be found. We print error messages. */
5985 complete_class_report_errors (jdep *dep)
5989 if (!JDEP_WFL (dep))
5992 name = IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_WFL (dep)));
5993 switch (JDEP_KIND (dep))
5997 (JDEP_WFL (dep), "Superclass `%s' of class `%s' not found",
5998 purify_type_name (name),
5999 IDENTIFIER_POINTER (DECL_NAME (JDEP_DECL (dep))));
6003 (JDEP_WFL (dep), "Type `%s' not found in declaration of field `%s'",
6004 purify_type_name (name),
6005 IDENTIFIER_POINTER (DECL_NAME (JDEP_DECL (dep))));
6007 case JDEP_METHOD: /* Covers arguments */
6009 (JDEP_WFL (dep), "Type `%s' not found in the declaration of the argument `%s' of method `%s'",
6010 purify_type_name (name),
6011 IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_DECL_WFL (dep))),
6012 IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_MISC (dep))));
6014 case JDEP_METHOD_RETURN: /* Covers return type */
6016 (JDEP_WFL (dep), "Type `%s' not found in the declaration of the return type of method `%s'",
6017 purify_type_name (name),
6018 IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_DECL_WFL (dep))));
6020 case JDEP_INTERFACE:
6022 (JDEP_WFL (dep), "Superinterface `%s' of %s `%s' not found",
6023 IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_WFL (dep))),
6024 (CLASS_OR_INTERFACE (JDEP_DECL (dep), "class", "interface")),
6025 IDENTIFIER_POINTER (DECL_NAME (JDEP_DECL (dep))));
6029 (JDEP_WFL (dep), "Type `%s' not found in the declaration of the local variable `%s'",
6030 purify_type_name (IDENTIFIER_POINTER
6031 (EXPR_WFL_NODE (JDEP_WFL (dep)))),
6032 IDENTIFIER_POINTER (DECL_NAME (JDEP_DECL (dep))));
6034 case JDEP_EXCEPTION: /* As specified by `throws' */
6036 (JDEP_WFL (dep), "Class `%s' not found in `throws'",
6037 IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_WFL (dep))));
6040 /* Fix for -Wall. Just break doing nothing. The error will be
6046 /* Return a static string containing the DECL prototype string. If
6047 DECL is a constructor, use the class name instead of the form
6051 get_printable_method_name (tree decl)
6053 const char *to_return;
6054 tree name = NULL_TREE;
6056 if (DECL_CONSTRUCTOR_P (decl))
6058 name = DECL_NAME (decl);
6059 DECL_NAME (decl) = DECL_NAME (TYPE_NAME (DECL_CONTEXT (decl)));
6062 to_return = lang_printable_name (decl, 0);
6063 if (DECL_CONSTRUCTOR_P (decl))
6064 DECL_NAME (decl) = name;
6069 /* Track method being redefined inside the same class. As a side
6070 effect, set DECL_NAME to an IDENTIFIER (prior entering this
6071 function it's a FWL, so we can track errors more accurately.) */
6074 check_method_redefinition (tree class, tree method)
6078 /* There's no need to verify <clinit> and finit$ and instinit$ */
6079 if (DECL_CLINIT_P (method)
6080 || DECL_FINIT_P (method) || DECL_INSTINIT_P (method))
6083 sig = TYPE_ARGUMENT_SIGNATURE (TREE_TYPE (method));
6084 for (redef = TYPE_METHODS (class); redef; redef = TREE_CHAIN (redef))
6086 if (redef == method)
6088 if (DECL_NAME (redef) == DECL_NAME (method)
6089 && sig == TYPE_ARGUMENT_SIGNATURE (TREE_TYPE (redef))
6090 && !DECL_ARTIFICIAL (method))
6093 (DECL_FUNCTION_WFL (method), "Duplicate %s declaration `%s'",
6094 (DECL_CONSTRUCTOR_P (redef) ? "constructor" : "method"),
6095 get_printable_method_name (redef));
6102 /* Return 1 if check went ok, 0 otherwise. */
6104 check_abstract_method_definitions (int do_interface, tree class_decl,
6107 tree class = TREE_TYPE (class_decl);
6108 tree method, end_type;
6111 end_type = (do_interface ? object_type_node : type);
6112 for (method = TYPE_METHODS (type); method; method = TREE_CHAIN (method))
6114 tree other_super, other_method, method_sig, method_name;
6116 int end_type_reached = 0;
6118 if (!METHOD_ABSTRACT (method) || METHOD_FINAL (method))
6121 /* Now verify that somewhere in between TYPE and CLASS,
6122 abstract method METHOD gets a non abstract definition
6123 that is inherited by CLASS. */
6125 method_sig = build_java_signature (TREE_TYPE (method));
6126 method_name = DECL_NAME (method);
6127 if (TREE_CODE (method_name) == EXPR_WITH_FILE_LOCATION)
6128 method_name = EXPR_WFL_NODE (method_name);
6130 other_super = class;
6132 if (other_super == end_type)
6133 end_type_reached = 1;
6136 for (other_method = TYPE_METHODS (other_super); other_method;
6137 other_method = TREE_CHAIN (other_method))
6139 tree s = build_java_signature (TREE_TYPE (other_method));
6140 tree other_name = DECL_NAME (other_method);
6142 if (TREE_CODE (other_name) == EXPR_WITH_FILE_LOCATION)
6143 other_name = EXPR_WFL_NODE (other_name);
6144 if (!DECL_CLINIT_P (other_method)
6145 && !DECL_CONSTRUCTOR_P (other_method)
6146 && method_name == other_name
6148 && !METHOD_ABSTRACT (other_method))
6154 other_super = CLASSTYPE_SUPER (other_super);
6155 } while (!end_type_reached);
6157 /* Report that abstract METHOD didn't find an implementation
6158 that CLASS can use. */
6161 char *t = xstrdup (lang_printable_name
6162 (TREE_TYPE (TREE_TYPE (method)), 0));
6163 tree ccn = DECL_NAME (TYPE_NAME (DECL_CONTEXT (method)));
6166 (lookup_cl (class_decl),
6167 "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",
6168 IDENTIFIER_POINTER (DECL_NAME (class_decl)),
6169 t, lang_printable_name (method, 0),
6170 (CLASS_INTERFACE (TYPE_NAME (DECL_CONTEXT (method))) ?
6171 "interface" : "class"),
6172 IDENTIFIER_POINTER (ccn),
6173 (CLASS_INTERFACE (class_decl) ? "interface" : "class"),
6174 IDENTIFIER_POINTER (DECL_NAME (class_decl)));
6180 if (ok && do_interface)
6182 /* Check for implemented interfaces. */
6184 tree vector = TYPE_BINFO_BASETYPES (type);
6185 for (i = 1; ok && vector && i < TREE_VEC_LENGTH (vector); i++)
6187 tree super = BINFO_TYPE (TREE_VEC_ELT (vector, i));
6188 ok = check_abstract_method_definitions (1, class_decl, super);
6195 /* Check that CLASS_DECL somehow implements all inherited abstract
6199 java_check_abstract_method_definitions (tree class_decl)
6201 tree class = TREE_TYPE (class_decl);
6205 if (CLASS_ABSTRACT (class_decl))
6208 /* Check for inherited types */
6211 super = CLASSTYPE_SUPER (super);
6212 check_abstract_method_definitions (0, class_decl, super);
6213 } while (super != object_type_node);
6215 /* Check for implemented interfaces. */
6216 vector = TYPE_BINFO_BASETYPES (class);
6217 for (i = 1; i < TREE_VEC_LENGTH (vector); i++)
6219 super = BINFO_TYPE (TREE_VEC_ELT (vector, i));
6220 check_abstract_method_definitions (1, class_decl, super);
6224 /* Check all the types method DECL uses and return 1 if all of them
6225 are now complete, 0 otherwise. This is used to check whether its
6226 safe to build a method signature or not. */
6229 check_method_types_complete (tree decl)
6231 tree type = TREE_TYPE (decl);
6234 if (!INCOMPLETE_TYPE_P (TREE_TYPE (type)))
6237 args = TYPE_ARG_TYPES (type);
6238 if (TREE_CODE (type) == METHOD_TYPE)
6239 args = TREE_CHAIN (args);
6240 for (; args != end_params_node; args = TREE_CHAIN (args))
6241 if (INCOMPLETE_TYPE_P (TREE_VALUE (args)))
6247 /* Visible interface to check methods contained in CLASS_DECL */
6250 java_check_methods (tree class_decl)
6252 if (CLASS_METHOD_CHECKED_P (TREE_TYPE (class_decl)))
6255 if (CLASS_INTERFACE (class_decl))
6256 java_check_abstract_methods (class_decl);
6258 java_check_regular_methods (class_decl);
6260 CLASS_METHOD_CHECKED_P (TREE_TYPE (class_decl)) = 1;
6263 /* Like not_accessible_p, but doesn't refer to the current class at
6266 hack_is_accessible_p (tree member, tree from_where)
6268 int flags = get_access_flags_from_decl (member);
6270 if (from_where == DECL_CONTEXT (member)
6271 || (flags & ACC_PUBLIC))
6274 if ((flags & ACC_PROTECTED))
6276 if (inherits_from_p (from_where, DECL_CONTEXT (member)))
6280 if ((flags & ACC_PRIVATE))
6283 /* Package private, or protected. */
6284 return in_same_package (TYPE_NAME (from_where),
6285 TYPE_NAME (DECL_CONTEXT (member)));
6288 /* Check all the methods of CLASS_DECL. Methods are first completed
6289 then checked according to regular method existence rules. If no
6290 constructor for CLASS_DECL were encountered, then build its
6293 java_check_regular_methods (tree class_decl)
6295 int saw_constructor = ANONYMOUS_CLASS_P (TREE_TYPE (class_decl));
6297 tree class = TREE_TYPE (class_decl);
6298 tree found = NULL_TREE;
6301 /* It is not necessary to check methods defined in java.lang.Object */
6302 if (class == object_type_node)
6305 if (!TYPE_NVIRTUALS (class))
6306 TYPE_METHODS (class) = nreverse (TYPE_METHODS (class));
6308 /* Should take interfaces into account. FIXME */
6309 for (method = TYPE_METHODS (class); method; method = TREE_CHAIN (method))
6312 tree method_wfl = DECL_FUNCTION_WFL (method);
6315 /* Check for redefinitions */
6316 if (check_method_redefinition (class, method))
6319 /* We verify things thrown by the method. They must inherit from
6320 java.lang.Throwable. */
6321 for (mthrows = DECL_FUNCTION_THROWS (method);
6322 mthrows; mthrows = TREE_CHAIN (mthrows))
6324 if (!inherits_from_p (TREE_VALUE (mthrows), throwable_type_node))
6326 (TREE_PURPOSE (mthrows), "Class `%s' in `throws' clause must be a subclass of class `java.lang.Throwable'",
6328 (DECL_NAME (TYPE_NAME (TREE_VALUE (mthrows)))));
6331 /* If we see one constructor a mark so we don't generate the
6332 default one. Also skip other verifications: constructors
6333 can't be inherited hence hidden or overridden. */
6334 if (DECL_CONSTRUCTOR_P (method))
6336 saw_constructor = 1;
6340 sig = build_java_argument_signature (TREE_TYPE (method));
6341 found = lookup_argument_method_generic (class, DECL_NAME (method), sig,
6342 SEARCH_SUPER | SEARCH_INTERFACE);
6344 /* Inner class can't declare static methods */
6345 if (METHOD_STATIC (method) && !TOPLEVEL_CLASS_DECL_P (class_decl))
6347 char *t = xstrdup (lang_printable_name (class, 0));
6349 (method_wfl, "Method `%s' can't be static in inner class `%s'. Only members of interfaces and top-level classes can be static",
6350 lang_printable_name (method, 0), t);
6354 /* Nothing overrides or it's a private method. */
6357 if (METHOD_PRIVATE (found))
6363 /* If `found' is declared in an interface, make sure the
6364 modifier matches. */
6365 if (CLASS_INTERFACE (TYPE_NAME (DECL_CONTEXT (found)))
6366 && clinit_identifier_node != DECL_NAME (found)
6367 && !METHOD_PUBLIC (method))
6369 tree found_decl = TYPE_NAME (DECL_CONTEXT (found));
6370 parse_error_context (method_wfl, "Class `%s' must override `%s' with a public method in order to implement interface `%s'",
6371 IDENTIFIER_POINTER (DECL_NAME (class_decl)),
6372 lang_printable_name (method, 0),
6373 IDENTIFIER_POINTER (DECL_NAME (found_decl)));
6376 /* Can't override a method with the same name and different return
6378 if (TREE_TYPE (TREE_TYPE (found)) != TREE_TYPE (TREE_TYPE (method)))
6381 (lang_printable_name (TREE_TYPE (TREE_TYPE (found)), 0));
6384 "Method `%s' was defined with return type `%s' in class `%s'",
6385 lang_printable_name (found, 0), t,
6387 (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found)))));
6391 aflags = get_access_flags_from_decl (found);
6393 /* Can't override final. Can't override static. */
6394 if (METHOD_FINAL (found) || METHOD_STATIC (found))
6396 /* Static *can* override static */
6397 if (METHOD_STATIC (found) && METHOD_STATIC (method))
6401 "%s methods can't be overridden. Method `%s' is %s in class `%s'",
6402 (METHOD_FINAL (found) ? "Final" : "Static"),
6403 lang_printable_name (found, 0),
6404 (METHOD_FINAL (found) ? "final" : "static"),
6406 (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found)))));
6410 /* Static method can't override instance method. */
6411 if (METHOD_STATIC (method))
6415 "Instance methods can't be overridden by a static method. Method `%s' is an instance method in class `%s'",
6416 lang_printable_name (found, 0),
6418 (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found)))));
6422 /* - Overriding/hiding public must be public
6423 - Overriding/hiding protected must be protected or public
6424 - If the overridden or hidden method has default (package)
6425 access, then the overriding or hiding method must not be
6426 private; otherwise, a compile-time error occurs. If
6427 `found' belongs to an interface, things have been already
6429 if (!CLASS_INTERFACE (TYPE_NAME (DECL_CONTEXT (found)))
6430 && ((METHOD_PUBLIC (found) && !METHOD_PUBLIC (method))
6431 || (METHOD_PROTECTED (found)
6432 && !(METHOD_PUBLIC (method) || METHOD_PROTECTED (method)))
6433 || (!(aflags & (ACC_PUBLIC | ACC_PRIVATE | ACC_STATIC))
6434 && METHOD_PRIVATE (method))))
6438 "Methods can't be overridden to be more private. Method `%s' is not %s in class `%s'", lang_printable_name (method, 0),
6439 (METHOD_PUBLIC (method) ? "public" :
6440 (METHOD_PRIVATE (method) ? "private" : "protected")),
6441 IDENTIFIER_POINTER (DECL_NAME
6442 (TYPE_NAME (DECL_CONTEXT (found)))));
6446 /* Check this method against all the other implementations it
6447 overrides. Here we only check the class hierarchy; the rest
6448 of the checking is done later. If this method is just a
6449 Miranda method, we can skip the check. */
6450 if (! METHOD_INVISIBLE (method))
6451 check_concrete_throws_clauses (class, method, DECL_NAME (method), sig);
6454 /* The above throws clause check only looked at superclasses. Now
6455 we must also make sure that all methods declared in interfaces
6456 have compatible throws clauses. FIXME: there are more efficient
6457 ways to organize this checking; we should implement one. */
6458 check_interface_throws_clauses (class, class);
6460 if (!TYPE_NVIRTUALS (class))
6461 TYPE_METHODS (class) = nreverse (TYPE_METHODS (class));
6463 /* Search for inherited abstract method not yet implemented in this
6465 java_check_abstract_method_definitions (class_decl);
6467 if (!saw_constructor)
6471 /* Check to make sure that all the methods in all the interfaces
6472 implemented by CLASS_DECL are compatible with the concrete
6473 implementations available in CHECK_CLASS_DECL. */
6475 check_interface_throws_clauses (tree check_class_decl, tree class_decl)
6477 for (; class_decl != NULL_TREE; class_decl = CLASSTYPE_SUPER (class_decl))
6479 tree bases = TYPE_BINFO_BASETYPES (class_decl);
6480 int iface_len = TREE_VEC_LENGTH (bases) - 1;
6483 for (i = iface_len; i > 0; --i)
6485 tree interface = BINFO_TYPE (TREE_VEC_ELT (bases, i));
6488 for (iface_method = TYPE_METHODS (interface);
6489 iface_method != NULL_TREE;
6490 iface_method = TREE_CHAIN (iface_method))
6494 /* First look for a concrete method implemented or
6495 inherited by this class. No need to search
6496 interfaces here, since we're already looking through
6498 sig = build_java_argument_signature (TREE_TYPE (iface_method));
6500 = lookup_argument_method_generic (check_class_decl,
6501 DECL_NAME (iface_method),
6502 sig, SEARCH_VISIBLE);
6503 /* If we don't find an implementation, that is ok. Any
6504 potential errors from that are diagnosed elsewhere.
6505 Also, multiple inheritance with conflicting throws
6506 clauses is fine in the absence of a concrete
6508 if (method != NULL_TREE && !METHOD_ABSTRACT (method))
6510 tree method_wfl = DECL_FUNCTION_WFL (method);
6511 check_throws_clauses (method, method_wfl, iface_method);
6515 /* Now check superinterfaces. */
6516 check_interface_throws_clauses (check_class_decl, interface);
6521 /* Check throws clauses of a method against the clauses of all the
6522 methods it overrides. We do this by searching up the class
6523 hierarchy, examining all matching accessible methods. */
6525 check_concrete_throws_clauses (tree class, tree self_method,
6526 tree name, tree signature)
6528 tree method = lookup_argument_method_generic (class, name, signature,
6529 SEARCH_SUPER | SEARCH_VISIBLE);
6530 while (method != NULL_TREE)
6532 if (! METHOD_INVISIBLE (method) && hack_is_accessible_p (method, class))
6533 check_throws_clauses (self_method, DECL_FUNCTION_WFL (self_method),
6536 method = lookup_argument_method_generic (DECL_CONTEXT (method),
6538 SEARCH_SUPER | SEARCH_VISIBLE);
6542 /* Generate an error if the `throws' clause of METHOD (if any) is
6543 incompatible with the `throws' clause of FOUND (if any). */
6545 check_throws_clauses (tree method, tree method_wfl, tree found)
6549 /* Can't check these things with class loaded from bytecode. FIXME */
6550 if (!CLASS_FROM_SOURCE_P (DECL_CONTEXT (found)))
6553 for (mthrows = DECL_FUNCTION_THROWS (method);
6554 mthrows; mthrows = TREE_CHAIN (mthrows))
6558 /* We don't verify unchecked expressions */
6559 if (IS_UNCHECKED_EXCEPTION_P (TREE_VALUE (mthrows)))
6561 /* Checked expression must be compatible */
6562 for (fthrows = DECL_FUNCTION_THROWS (found);
6563 fthrows; fthrows = TREE_CHAIN (fthrows))
6565 if (inherits_from_p (TREE_VALUE (mthrows), TREE_VALUE (fthrows)))
6571 (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'",
6572 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (TREE_VALUE (mthrows)))),
6573 lang_printable_name (found, 0),
6575 (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found)))));
6580 /* Check abstract method of interface INTERFACE */
6582 java_check_abstract_methods (tree interface_decl)
6585 tree method, basetype_vec, found;
6586 tree interface = TREE_TYPE (interface_decl);
6588 for (method = TYPE_METHODS (interface); method; method = TREE_CHAIN (method))
6590 /* 2- Check for double definition inside the defining interface */
6591 if (check_method_redefinition (interface, method))
6594 /* 3- Overriding is OK as far as we preserve the return type. */
6595 found = lookup_java_interface_method2 (interface, method);
6599 t = xstrdup (lang_printable_name (TREE_TYPE (TREE_TYPE (found)), 0));
6601 (DECL_FUNCTION_WFL (found),
6602 "Method `%s' was defined with return type `%s' in class `%s'",
6603 lang_printable_name (found, 0), t,
6605 (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found)))));
6611 /* 4- Inherited methods can't differ by their returned types */
6612 if (!(basetype_vec = TYPE_BINFO_BASETYPES (interface)))
6614 n = TREE_VEC_LENGTH (basetype_vec);
6615 for (i = 0; i < n; i++)
6617 tree sub_interface_method, sub_interface;
6618 tree vec_elt = TREE_VEC_ELT (basetype_vec, i);
6621 sub_interface = BINFO_TYPE (vec_elt);
6622 for (sub_interface_method = TYPE_METHODS (sub_interface);
6623 sub_interface_method;
6624 sub_interface_method = TREE_CHAIN (sub_interface_method))
6626 found = lookup_java_interface_method2 (interface,
6627 sub_interface_method);
6628 if (found && (found != sub_interface_method))
6631 (lookup_cl (sub_interface_method),
6632 "Interface `%s' inherits method `%s' from interface `%s'. This method is redefined with a different return type in interface `%s'",
6633 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (interface))),
6634 lang_printable_name (found, 0),
6636 (DECL_NAME (TYPE_NAME
6637 (DECL_CONTEXT (sub_interface_method)))),
6639 (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found)))));
6645 /* Lookup methods in interfaces using their name and partial
6646 signature. Return a matching method only if their types differ. */
6649 lookup_java_interface_method2 (tree class, tree method_decl)
6652 tree basetype_vec = TYPE_BINFO_BASETYPES (class), to_return;
6657 n = TREE_VEC_LENGTH (basetype_vec);
6658 for (i = 0; i < n; i++)
6660 tree vec_elt = TREE_VEC_ELT (basetype_vec, i), to_return;
6661 if ((BINFO_TYPE (vec_elt) != object_type_node)
6663 lookup_java_method2 (BINFO_TYPE (vec_elt), method_decl, 1)))
6666 for (i = 0; i < n; i++)
6668 to_return = lookup_java_interface_method2
6669 (BINFO_TYPE (TREE_VEC_ELT (basetype_vec, i)), method_decl);
6677 /* Lookup method using their name and partial signature. Return a
6678 matching method only if their types differ. */
6681 lookup_java_method2 (tree clas, tree method_decl, int do_interface)
6683 tree method, method_signature, method_name, method_type, name;
6685 method_signature = build_java_argument_signature (TREE_TYPE (method_decl));
6686 name = DECL_NAME (method_decl);
6687 method_name = (TREE_CODE (name) == EXPR_WITH_FILE_LOCATION ?
6688 EXPR_WFL_NODE (name) : name);
6689 method_type = TREE_TYPE (TREE_TYPE (method_decl));
6691 while (clas != NULL_TREE)
6693 for (method = TYPE_METHODS (clas);
6694 method != NULL_TREE; method = TREE_CHAIN (method))
6696 tree method_sig = build_java_argument_signature (TREE_TYPE (method));
6697 tree name = DECL_NAME (method);
6698 if ((TREE_CODE (name) == EXPR_WITH_FILE_LOCATION ?
6699 EXPR_WFL_NODE (name) : name) == method_name
6700 && method_sig == method_signature
6701 && TREE_TYPE (TREE_TYPE (method)) != method_type)
6704 clas = (do_interface ? NULL_TREE : CLASSTYPE_SUPER (clas));
6709 /* Return the line that matches DECL line number, and try its best to
6710 position the column number. Used during error reports. */
6712 static GTY(()) tree cl_v;
6714 lookup_cl (tree decl)
6721 if (cl_v == NULL_TREE)
6723 cl_v = build_expr_wfl (NULL_TREE, NULL, 0, 0);
6726 EXPR_WFL_FILENAME_NODE (cl_v) = get_identifier (DECL_SOURCE_FILE (decl));
6727 EXPR_WFL_SET_LINECOL (cl_v, DECL_SOURCE_LINE (decl), -1);
6729 line = java_get_line_col (EXPR_WFL_FILENAME (cl_v),
6730 EXPR_WFL_LINENO (cl_v), EXPR_WFL_COLNO (cl_v));
6732 found = strstr ((const char *)line,
6733 (const char *)IDENTIFIER_POINTER (DECL_NAME (decl)));
6735 EXPR_WFL_SET_LINECOL (cl_v, EXPR_WFL_LINENO (cl_v), found - line);
6740 /* Look for a simple name in the single-type import list */
6743 find_name_in_single_imports (tree name)
6747 for (node = ctxp->import_list; node; node = TREE_CHAIN (node))
6748 if (TREE_VALUE (node) == name)
6749 return (EXPR_WFL_NODE (TREE_PURPOSE (node)));
6754 /* Process all single-type import. */
6757 process_imports (void)
6762 for (import = ctxp->import_list; import; import = TREE_CHAIN (import))
6764 tree to_be_found = EXPR_WFL_NODE (TREE_PURPOSE (import));
6765 char *original_name;
6767 original_name = xmemdup (IDENTIFIER_POINTER (to_be_found),
6768 IDENTIFIER_LENGTH (to_be_found),
6769 IDENTIFIER_LENGTH (to_be_found) + 1);
6771 /* Don't load twice something already defined. */
6772 if (IDENTIFIER_CLASS_VALUE (to_be_found))
6779 QUALIFIED_P (to_be_found) = 1;
6780 load_class (to_be_found, 0);
6782 check_pkg_class_access (to_be_found, TREE_PURPOSE (import), true);
6784 /* We found it, we can bail out */
6785 if (IDENTIFIER_CLASS_VALUE (to_be_found))
6787 check_deprecation (TREE_PURPOSE (import),
6788 IDENTIFIER_CLASS_VALUE (to_be_found));
6792 /* We haven't found it. Maybe we're trying to access an
6793 inner class. The only way for us to know is to try again
6794 after having dropped a qualifier. If we can't break it further,
6795 we have an error. */
6796 if (breakdown_qualified (&left, NULL, to_be_found))
6801 if (!IDENTIFIER_CLASS_VALUE (to_be_found))
6803 parse_error_context (TREE_PURPOSE (import),
6804 "Class or interface `%s' not found in import",
6809 free (original_name);
6816 /* Possibly find and mark a class imported by a single-type import
6820 find_in_imports (tree enclosing_type, tree class_type)
6822 tree import = (enclosing_type ? TYPE_IMPORT_LIST (enclosing_type) :
6826 if (TREE_VALUE (import) == TYPE_NAME (class_type))
6828 TYPE_NAME (class_type) = EXPR_WFL_NODE (TREE_PURPOSE (import));
6829 QUALIFIED_P (TYPE_NAME (class_type)) = 1;
6832 import = TREE_CHAIN (import);
6837 note_possible_classname (const char *name, int len)
6840 if (len > 5 && strncmp (&name [len-5], ".java", 5) == 0)
6842 else if (len > 6 && strncmp (&name [len-6], ".class", 6) == 0)
6846 node = ident_subst (name, len, "", '/', '.', "");
6847 IS_A_CLASSFILE_NAME (node) = 1; /* Or soon to be */
6848 QUALIFIED_P (node) = strchr (name, '/') ? 1 : 0;
6852 /* Read a import directory, gathering potential match for further type
6853 references. Indifferently reads a filesystem or a ZIP archive
6857 read_import_dir (tree wfl)
6859 tree package_id = EXPR_WFL_NODE (wfl);
6860 const char *package_name = IDENTIFIER_POINTER (package_id);
6861 int package_length = IDENTIFIER_LENGTH (package_id);
6863 JCF *saved_jcf = current_jcf;
6868 struct buffer filename[1];
6870 if (IS_AN_IMPORT_ON_DEMAND_P (package_id))
6872 IS_AN_IMPORT_ON_DEMAND_P (package_id) = 1;
6874 BUFFER_INIT (filename);
6875 buffer_grow (filename, package_length + 100);
6877 for (entry = jcf_path_start (); entry != NULL; entry = jcf_path_next (entry))
6879 const char *entry_name = jcf_path_name (entry);
6880 int entry_length = strlen (entry_name);
6881 if (jcf_path_is_zipfile (entry))
6884 buffer_grow (filename, entry_length);
6885 memcpy (filename->data, entry_name, entry_length - 1);
6886 filename->data[entry_length-1] = '\0';
6887 zipf = opendir_in_zip (filename->data, jcf_path_is_system (entry));
6889 error ("malformed .zip archive in CLASSPATH: %s", entry_name);
6892 ZipDirectory *zipd = (ZipDirectory *) zipf->central_directory;
6893 BUFFER_RESET (filename);
6894 for (k = 0; k < package_length; k++)
6896 char ch = package_name[k];
6897 *filename->ptr++ = ch == '.' ? '/' : ch;
6899 *filename->ptr++ = '/';
6901 for (k = 0; k < zipf->count; k++, zipd = ZIPDIR_NEXT (zipd))
6903 const char *current_entry = ZIPDIR_FILENAME (zipd);
6904 int current_entry_len = zipd->filename_length;
6906 if (current_entry_len >= BUFFER_LENGTH (filename)
6907 && strncmp (filename->data, current_entry,
6908 BUFFER_LENGTH (filename)) != 0)
6910 found |= note_possible_classname (current_entry,
6917 BUFFER_RESET (filename);
6918 buffer_grow (filename, entry_length + package_length + 4);
6919 strcpy (filename->data, entry_name);
6920 filename->ptr = filename->data + entry_length;
6921 for (k = 0; k < package_length; k++)
6923 char ch = package_name[k];
6924 *filename->ptr++ = ch == '.' ? '/' : ch;
6926 *filename->ptr = '\0';
6928 dirp = opendir (filename->data);
6931 *filename->ptr++ = '/';
6936 struct dirent *direntp = readdir (dirp);
6939 d_name = direntp->d_name;
6940 len = strlen (direntp->d_name);
6941 buffer_grow (filename, len+1);
6942 strcpy (filename->ptr, d_name);
6943 found |= note_possible_classname (filename->data + entry_length,
6944 package_length+len+1);
6951 free (filename->data);
6953 /* Here we should have a unified way of retrieving an entry, to be
6957 static int first = 1;
6960 error ("Can't find default package `%s'. Check the CLASSPATH environment variable and the access to the archives", package_name);
6965 parse_error_context (wfl, "Package `%s' not found in import",
6967 current_jcf = saved_jcf;
6970 current_jcf = saved_jcf;
6973 /* Possibly find a type in the import on demands specified
6974 types. Returns 1 if an error occurred, 0 otherwise. Run through the
6975 entire list, to detected potential double definitions. */
6978 find_in_imports_on_demand (tree enclosing_type, tree class_type)
6980 tree class_type_name = TYPE_NAME (class_type);
6981 tree import = (enclosing_type ? TYPE_IMPORT_DEMAND_LIST (enclosing_type) :
6982 ctxp->import_demand_list);
6983 tree cl = NULL_TREE;
6984 int seen_once = -1; /* -1 when not set, 1 if seen once, >1 otherwise. */
6985 int to_return = -1; /* -1 when not set, 0 or 1 otherwise */
6988 for (; import; import = TREE_CHAIN (import))
6990 int saved_lineno = input_line;
6992 const char *id_name;
6993 tree decl, type_name_copy;
6995 obstack_grow (&temporary_obstack,
6996 IDENTIFIER_POINTER (EXPR_WFL_NODE (TREE_PURPOSE (import))),
6997 IDENTIFIER_LENGTH (EXPR_WFL_NODE (TREE_PURPOSE (import))));
6998 obstack_1grow (&temporary_obstack, '.');
6999 obstack_grow0 (&temporary_obstack,
7000 IDENTIFIER_POINTER (class_type_name),
7001 IDENTIFIER_LENGTH (class_type_name));
7002 id_name = obstack_finish (&temporary_obstack);
7004 if (! (node = maybe_get_identifier (id_name)))
7007 /* Setup lineno so that it refers to the line of the import (in
7008 case we parse a class file and encounter errors */
7009 input_line = EXPR_WFL_LINENO (TREE_PURPOSE (import));
7011 type_name_copy = TYPE_NAME (class_type);
7012 TYPE_NAME (class_type) = node;
7013 QUALIFIED_P (node) = 1;
7014 decl = IDENTIFIER_CLASS_VALUE (node);
7016 /* If there is no DECL set for the class or if the class isn't
7017 loaded and not seen in source yet, then load */
7018 if (!decl || (!CLASS_LOADED_P (TREE_TYPE (decl))
7019 && !CLASS_FROM_SOURCE_P (TREE_TYPE (decl))))
7021 load_class (node, 0);
7022 decl = IDENTIFIER_CLASS_VALUE (node);
7024 if (decl && ! INNER_CLASS_P (TREE_TYPE (decl)))
7025 access_check = check_pkg_class_access (node, TREE_PURPOSE (import),
7028 /* 6.6.1: Inner classes are subject to member access rules. */
7031 input_line = saved_lineno;
7033 /* If the loaded class is not accessible or couldn't be loaded,
7034 we restore the original TYPE_NAME and process the next
7036 if (access_check || !decl)
7038 TYPE_NAME (class_type) = type_name_copy;
7042 /* If the loaded class is accessible, we keep a tab on it to
7043 detect and report multiple inclusions. */
7044 if (IS_A_CLASSFILE_NAME (node))
7048 cl = TREE_PURPOSE (import);
7051 else if (seen_once >= 0)
7053 tree location = (cl ? cl : TREE_PURPOSE (import));
7054 tree package = (cl ? EXPR_WFL_NODE (cl) :
7055 EXPR_WFL_NODE (TREE_PURPOSE (import)));
7059 "Type `%s' also potentially defined in package `%s'",
7060 IDENTIFIER_POINTER (TYPE_NAME (class_type)),
7061 IDENTIFIER_POINTER (package));
7064 to_return = access_check;
7070 return (seen_once < 0 ? 0 : seen_once); /* It's ok not to have found */
7073 /* Add package NAME to the list of packages encountered so far. To
7074 speed up class lookup in do_resolve_class, we make sure a
7075 particular package is added only once. */
7078 register_package (tree name)
7084 pht = htab_create (50, htab_hash_pointer, htab_eq_pointer, NULL);
7086 e = htab_find_slot (pht, name, INSERT);
7089 package_list = chainon (package_list, build_tree_list (name, NULL));
7095 resolve_package (tree pkg, tree *next, tree *type_name)
7098 tree decl = NULL_TREE;
7099 *type_name = NULL_TREE;
7101 /* The trick is to determine when the package name stops and were
7102 the name of something contained in the package starts. Then we
7103 return a fully qualified name of what we want to get. */
7105 *next = EXPR_WFL_QUALIFICATION (pkg);
7107 /* Try to progressively construct a type name */
7108 if (TREE_CODE (pkg) == EXPR_WITH_FILE_LOCATION)
7109 for (current = EXPR_WFL_QUALIFICATION (pkg);
7110 current; current = TREE_CHAIN (current))
7112 /* If we don't have what we're expecting, exit now. TYPE_NAME
7113 will be null and the error caught later. */
7114 if (TREE_CODE (QUAL_WFL (current)) != EXPR_WITH_FILE_LOCATION)
7117 merge_qualified_name (*type_name, EXPR_WFL_NODE (QUAL_WFL (current)));
7118 if ((decl = resolve_no_layout (*type_name, NULL_TREE)))
7120 /* resolve_package should be used in a loop, hence we
7121 point at this one to naturally process the next one at
7122 the next iteration. */
7131 /* Check accessibility of inner classes according to member access rules.
7132 DECL is the inner class, ENCLOSING_DECL is the class from which the
7133 access is being attempted. */
7136 check_inner_class_access (tree decl, tree enclosing_decl, tree cl)
7139 tree enclosing_decl_type;
7141 /* We don't issue an error message when CL is null. CL can be null
7142 as a result of processing a JDEP crafted by source_start_java_method
7143 for the purpose of patching its parm decl. But the error would
7144 have been already trapped when fixing the method's signature.
7145 DECL can also be NULL in case of earlier errors. */
7149 enclosing_decl_type = TREE_TYPE (enclosing_decl);
7151 if (CLASS_PRIVATE (decl))
7153 /* Access is permitted only within the body of the top-level
7154 class in which DECL is declared. */
7155 tree top_level = decl;
7156 while (DECL_CONTEXT (top_level))
7157 top_level = DECL_CONTEXT (top_level);
7158 while (DECL_CONTEXT (enclosing_decl))
7159 enclosing_decl = DECL_CONTEXT (enclosing_decl);
7160 if (top_level == enclosing_decl)
7164 else if (CLASS_PROTECTED (decl))
7167 /* Access is permitted from within the same package... */
7168 if (in_same_package (decl, enclosing_decl))
7171 /* ... or from within the body of a subtype of the context in which
7172 DECL is declared. */
7173 decl_context = DECL_CONTEXT (decl);
7174 while (enclosing_decl)
7176 if (CLASS_INTERFACE (decl))
7178 if (interface_of_p (TREE_TYPE (decl_context),
7179 enclosing_decl_type))
7184 /* Eww. The order of the arguments is different!! */
7185 if (inherits_from_p (enclosing_decl_type,
7186 TREE_TYPE (decl_context)))
7189 enclosing_decl = DECL_CONTEXT (enclosing_decl);
7191 access = "protected";
7193 else if (! CLASS_PUBLIC (decl))
7195 /* Access is permitted only from within the same package as DECL. */
7196 if (in_same_package (decl, enclosing_decl))
7198 access = "non-public";
7201 /* Class is public. */
7204 parse_error_context (cl, "Nested %s %s is %s; cannot be accessed from here",
7205 (CLASS_INTERFACE (decl) ? "interface" : "class"),
7206 lang_printable_name (decl, 0), access);
7209 /* Accessibility check for top-level classes. If CLASS_NAME is in a
7210 foreign package, it must be PUBLIC. Return 0 if no access
7211 violations were found, 1 otherwise. If VERBOSE is true and an error
7212 was found, it is reported and accounted for. */
7215 check_pkg_class_access (tree class_name, tree cl, bool verbose)
7219 if (!IDENTIFIER_CLASS_VALUE (class_name))
7222 if (!(type = TREE_TYPE (IDENTIFIER_CLASS_VALUE (class_name))))
7225 if (!CLASS_PUBLIC (TYPE_NAME (type)))
7227 /* Access to a private class within the same package is
7230 breakdown_qualified (&l, &r, class_name);
7231 if (!QUALIFIED_P (class_name) && !ctxp->package)
7232 /* Both in the empty package. */
7234 if (l == ctxp->package)
7235 /* Both in the same package. */
7240 (cl, "Can't access %s `%s'. Only public classes and interfaces in other packages can be accessed",
7241 (CLASS_INTERFACE (TYPE_NAME (type)) ? "interface" : "class"),
7242 IDENTIFIER_POINTER (class_name));
7248 /* Local variable declaration. */
7251 declare_local_variables (int modifier, tree type, tree vlist)
7253 tree decl, current, saved_type;
7254 tree type_wfl = NULL_TREE;
7258 /* Push a new block if statements were seen between the last time we
7259 pushed a block and now. Keep a count of blocks to close */
7260 if (BLOCK_EXPR_BODY (GET_CURRENT_BLOCK (current_function_decl)))
7262 tree b = enter_block ();
7263 BLOCK_IS_IMPLICIT (b) = 1;
7269 for (i = 0; i < ARRAY_SIZE (ctxp->modifier_ctx); i++)
7270 if (1 << i & modifier)
7272 if (modifier == ACC_FINAL)
7277 (ctxp->modifier_ctx [i],
7278 "Only `final' is allowed as a local variables modifier");
7283 /* Obtain an incomplete type if TYPE is not complete. TYPE_WFL will
7284 hold the TYPE value if a new incomplete has to be created (as
7285 opposed to being found already existing and reused). */
7286 SET_TYPE_FOR_RESOLUTION (type, type_wfl, must_chain);
7288 /* If TYPE is fully resolved and we don't have a reference, make one */
7289 PROMOTE_RECORD_IF_COMPLETE (type, must_chain);
7291 /* Go through all the declared variables */
7292 for (current = vlist, saved_type = type; current;
7293 current = TREE_CHAIN (current), type = saved_type)
7295 tree other, real_type;
7296 tree wfl = TREE_PURPOSE (current);
7297 tree name = EXPR_WFL_NODE (wfl);
7298 tree init = TREE_VALUE (current);
7300 /* Process NAME, as it may specify extra dimension(s) for it */
7301 type = build_array_from_name (type, type_wfl, name, &name);
7303 /* Variable redefinition check */
7304 if ((other = lookup_name_in_blocks (name)))
7306 variable_redefinition_error (wfl, name, TREE_TYPE (other),
7307 DECL_SOURCE_LINE (other));
7311 /* Type adjustment. We may have just readjusted TYPE because
7312 the variable specified more dimensions. Make sure we have
7313 a reference if we can and don't have one already. */
7314 PROMOTE_RECORD_IF_COMPLETE (type, must_chain);
7316 real_type = GET_REAL_TYPE (type);
7317 /* Never layout this decl. This will be done when its scope
7319 decl = build_decl (VAR_DECL, name, real_type);
7320 MAYBE_CREATE_VAR_LANG_DECL_SPECIFIC (decl);
7321 DECL_FINAL (decl) = final_p;
7322 BLOCK_CHAIN_DECL (decl);
7324 /* If doing xreferencing, replace the line number with the WFL
7327 DECL_SOURCE_LINE (decl) = EXPR_WFL_LINECOL (wfl);
7329 /* Don't try to use an INIT statement when an error was found */
7330 if (init && java_error_count)
7333 /* Add the initialization function to the current function's code */
7336 /* Name might have been readjusted */
7337 EXPR_WFL_NODE (TREE_OPERAND (init, 0)) = name;
7338 MODIFY_EXPR_FROM_INITIALIZATION_P (init) = 1;
7339 java_method_add_stmt (current_function_decl,
7340 build_debugable_stmt (EXPR_WFL_LINECOL (init),
7344 /* Setup dependency the type of the decl */
7348 register_incomplete_type (JDEP_VARIABLE, type_wfl, decl, type);
7349 dep = CLASSD_LAST (ctxp->classd_list);
7350 JDEP_GET_PATCH (dep) = &TREE_TYPE (decl);
7353 SOURCE_FRONTEND_DEBUG (("Defined locals"));
7356 /* Called during parsing. Build decls from argument list. */
7359 source_start_java_method (tree fndecl)
7368 current_function_decl = fndecl;
7370 /* New scope for the function */
7372 for (tem = TYPE_ARG_TYPES (TREE_TYPE (fndecl)), i = 0;
7373 tem != end_params_node; tem = TREE_CHAIN (tem), i++)
7375 tree type = TREE_VALUE (tem);
7376 tree name = TREE_PURPOSE (tem);
7378 /* If type is incomplete. Create an incomplete decl and ask for
7379 the decl to be patched later */
7380 if (INCOMPLETE_TYPE_P (type))
7383 tree real_type = GET_REAL_TYPE (type);
7384 parm_decl = build_decl (PARM_DECL, name, real_type);
7385 type = obtain_incomplete_type (type);
7386 register_incomplete_type (JDEP_PARM, NULL_TREE, NULL_TREE, type);
7387 jdep = CLASSD_LAST (ctxp->classd_list);
7388 JDEP_MISC (jdep) = name;
7389 JDEP_GET_PATCH (jdep) = &TREE_TYPE (parm_decl);
7392 parm_decl = build_decl (PARM_DECL, name, type);
7394 /* Remember if a local variable was declared final (via its
7395 TREE_LIST of type/name.) Set DECL_FINAL accordingly. */
7396 if (ARG_FINAL_P (tem))
7398 MAYBE_CREATE_VAR_LANG_DECL_SPECIFIC (parm_decl);
7399 DECL_FINAL (parm_decl) = 1;
7402 BLOCK_CHAIN_DECL (parm_decl);
7404 tem = BLOCK_EXPR_DECLS (DECL_FUNCTION_BODY (current_function_decl));
7405 BLOCK_EXPR_DECLS (DECL_FUNCTION_BODY (current_function_decl)) =
7407 DECL_ARG_SLOT_COUNT (current_function_decl) = i;
7408 DECL_MAX_LOCALS (current_function_decl) = i;
7411 /* Called during parsing. Creates an artificial method declaration. */
7414 create_artificial_method (tree class, int flags, tree type,
7415 tree name, tree args)
7419 java_parser_context_save_global ();
7421 mdecl = make_node (FUNCTION_TYPE);
7422 TREE_TYPE (mdecl) = type;
7423 TYPE_ARG_TYPES (mdecl) = args;
7424 mdecl = add_method (class, flags, name, build_java_signature (mdecl));
7425 java_parser_context_restore_global ();
7426 DECL_ARTIFICIAL (mdecl) = 1;
7430 /* Starts the body if an artificial method. */
7433 start_artificial_method_body (tree mdecl)
7435 DECL_SOURCE_LINE (mdecl) = 1;
7436 DECL_FUNCTION_LAST_LINE (mdecl) = 1;
7437 source_start_java_method (mdecl);
7442 end_artificial_method_body (tree mdecl)
7444 /* exit_block modifies DECL_FUNCTION_BODY (current_function_decl).
7445 It has to be evaluated first. (if mdecl is current_function_decl,
7446 we have an undefined behavior if no temporary variable is used.) */
7447 tree b = exit_block ();
7448 BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (mdecl)) = b;
7452 /* Dump a tree of some kind. This is a convenience wrapper for the
7453 dump_* functions in tree-dump.c. */
7455 dump_java_tree (enum tree_dump_index phase, tree t)
7460 stream = dump_begin (phase, &flags);
7464 dump_node (t, flags, stream);
7465 dump_end (phase, stream);
7469 /* Terminate a function and expand its body. */
7472 source_end_java_method (void)
7474 tree fndecl = current_function_decl;
7479 java_parser_context_save_global ();
7480 input_line = ctxp->last_ccb_indent1;
7482 /* Turn function bodies with only a NOP expr null, so they don't get
7483 generated at all and we won't get warnings when using the -W
7485 if (BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (fndecl)) == empty_stmt_node)
7486 BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (fndecl)) = NULL_TREE;
7488 /* We've generated all the trees for this function, and it has been
7489 patched. Dump it to a file if the user requested it. */
7490 dump_java_tree (TDI_original, fndecl);
7492 /* Defer expanding the method until cgraph analysis is complete. */
7493 if (DECL_SAVED_TREE (fndecl))
7494 cgraph_finalize_function (fndecl, false);
7496 current_function_decl = NULL_TREE;
7497 java_parser_context_restore_global ();
7500 /* Record EXPR in the current function block. Complements compound
7501 expression second operand if necessary. */
7504 java_method_add_stmt (tree fndecl, tree expr)
7506 if (!GET_CURRENT_BLOCK (fndecl))
7508 return add_stmt_to_block (GET_CURRENT_BLOCK (fndecl), NULL_TREE, expr);
7512 add_stmt_to_block (tree b, tree type, tree stmt)
7514 tree body = BLOCK_EXPR_BODY (b), c;
7516 if (java_error_count)
7519 if ((c = add_stmt_to_compound (body, type, stmt)) == body)
7522 BLOCK_EXPR_BODY (b) = c;
7523 TREE_SIDE_EFFECTS (c) = 1;
7527 /* Add STMT to EXISTING if possible, otherwise create a new
7528 COMPOUND_EXPR and add STMT to it. */
7531 add_stmt_to_compound (tree existing, tree type, tree stmt)
7534 return build (COMPOUND_EXPR, type, existing, stmt);
7539 void java_layout_seen_class_methods (void)
7541 tree previous_list = all_class_list;
7542 tree end = NULL_TREE;
7547 for (current = previous_list;
7548 current != end; current = TREE_CHAIN (current))
7549 layout_class_methods (TREE_TYPE (TREE_VALUE (current)));
7551 if (previous_list != all_class_list)
7553 end = previous_list;
7554 previous_list = all_class_list;
7561 static GTY(()) tree stop_reordering;
7563 java_reorder_fields (void)
7567 for (current = gclass_list; current; current = TREE_CHAIN (current))
7569 current_class = TREE_TYPE (TREE_VALUE (current));
7571 if (current_class == stop_reordering)
7574 /* Reverse the fields, but leave the dummy field in front.
7575 Fields are already ordered for Object and Class */
7576 if (TYPE_FIELDS (current_class) && current_class != object_type_node
7577 && current_class != class_type_node)
7579 /* If the dummy field is there, reverse the right fields and
7580 just layout the type for proper fields offset */
7581 if (!DECL_NAME (TYPE_FIELDS (current_class)))
7583 tree fields = TYPE_FIELDS (current_class);
7584 TREE_CHAIN (fields) = nreverse (TREE_CHAIN (fields));
7585 TYPE_SIZE (current_class) = NULL_TREE;
7587 /* We don't have a dummy field, we need to layout the class,
7588 after having reversed the fields */
7591 TYPE_FIELDS (current_class) =
7592 nreverse (TYPE_FIELDS (current_class));
7593 TYPE_SIZE (current_class) = NULL_TREE;
7597 /* There are cases were gclass_list will be empty. */
7599 stop_reordering = TREE_TYPE (TREE_VALUE (gclass_list));
7602 /* Layout the methods of all classes loaded in one way or another.
7603 Check methods of source parsed classes. Then reorder the
7604 fields and layout the classes or the type of all source parsed
7608 java_layout_classes (void)
7611 int save_error_count = java_error_count;
7613 /* Layout the methods of all classes seen so far */
7614 java_layout_seen_class_methods ();
7615 java_parse_abort_on_error ();
7616 all_class_list = NULL_TREE;
7618 /* Then check the methods of all parsed classes */
7619 for (current = gclass_list; current; current = TREE_CHAIN (current))
7620 if (CLASS_FROM_SOURCE_P (TREE_TYPE (TREE_VALUE (current))))
7621 java_check_methods (TREE_VALUE (current));
7622 java_parse_abort_on_error ();
7624 for (current = gclass_list; current; current = TREE_CHAIN (current))
7626 current_class = TREE_TYPE (TREE_VALUE (current));
7627 layout_class (current_class);
7629 /* Error reported by the caller */
7630 if (java_error_count)
7634 /* We might have reloaded classes durign the process of laying out
7635 classes for code generation. We must layout the methods of those
7636 late additions, as constructor checks might use them */
7637 java_layout_seen_class_methods ();
7638 java_parse_abort_on_error ();
7641 /* Expand methods in the current set of classes remembered for
7645 java_complete_expand_classes (void)
7649 do_not_fold = flag_emit_xref;
7651 for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
7652 if (!INNER_CLASS_DECL_P (current))
7653 java_complete_expand_class (current);
7656 /* Expand the methods found in OUTER, starting first by OUTER's inner
7660 java_complete_expand_class (tree outer)
7664 set_nested_class_simple_name_value (outer, 1); /* Set */
7666 /* We need to go after all inner classes and start expanding them,
7667 starting with most nested ones. We have to do that because nested
7668 classes might add functions to outer classes */
7670 for (inner_list = DECL_INNER_CLASS_LIST (outer);
7671 inner_list; inner_list = TREE_CHAIN (inner_list))
7672 java_complete_expand_class (TREE_PURPOSE (inner_list));
7674 java_complete_expand_methods (outer);
7675 set_nested_class_simple_name_value (outer, 0); /* Reset */
7678 /* Expand methods registered in CLASS_DECL. The general idea is that
7679 we expand regular methods first. This allows us get an estimate on
7680 how outer context local alias fields are really used so we can add
7681 to the constructor just enough code to initialize them properly (it
7682 also lets us generate finit$ correctly.) Then we expand the
7683 constructors and then <clinit>. */
7686 java_complete_expand_methods (tree class_decl)
7688 tree clinit, decl, first_decl;
7690 current_class = TREE_TYPE (class_decl);
7692 /* Initialize a new constant pool */
7693 init_outgoing_cpool ();
7695 /* Pre-expand <clinit> to figure whether we really need it or
7696 not. If we do need it, we pre-expand the static fields so they're
7697 ready to be used somewhere else. <clinit> will be fully expanded
7698 after we processed the constructors. */
7699 first_decl = TYPE_METHODS (current_class);
7700 clinit = maybe_generate_pre_expand_clinit (current_class);
7702 /* Then generate finit$ (if we need to) because constructors will
7704 if (TYPE_FINIT_STMT_LIST (current_class))
7705 java_complete_expand_method (generate_finit (current_class));
7707 /* Then generate instinit$ (if we need to) because constructors will
7709 if (TYPE_II_STMT_LIST (current_class))
7710 java_complete_expand_method (generate_instinit (current_class));
7712 /* Now do the constructors */
7713 for (decl = first_decl ; !java_error_count && decl; decl = TREE_CHAIN (decl))
7717 if (!DECL_CONSTRUCTOR_P (decl))
7720 no_body = !DECL_FUNCTION_BODY (decl);
7721 /* Don't generate debug info on line zero when expanding a
7722 generated constructor. */
7724 restore_line_number_status (1);
7726 java_complete_expand_method (decl);
7729 restore_line_number_status (0);
7732 /* First, do the ordinary methods. */
7733 for (decl = first_decl; decl; decl = TREE_CHAIN (decl))
7735 /* Ctors aren't part of this batch. */
7736 if (DECL_CONSTRUCTOR_P (decl) || DECL_CLINIT_P (decl))
7739 /* Skip abstract or native methods -- but do handle native
7740 methods when generating JNI stubs. */
7741 if (METHOD_ABSTRACT (decl) || (! flag_jni && METHOD_NATIVE (decl)))
7743 DECL_FUNCTION_BODY (decl) = NULL_TREE;
7747 if (METHOD_NATIVE (decl))
7750 current_function_decl = decl;
7751 body = build_jni_stub (decl);
7752 BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (decl)) = body;
7755 java_complete_expand_method (decl);
7758 /* If there is indeed a <clinit>, fully expand it now */
7761 /* Prevent the use of `this' inside <clinit> */
7762 ctxp->explicit_constructor_p = 1;
7763 java_complete_expand_method (clinit);
7764 ctxp->explicit_constructor_p = 0;
7767 /* We might have generated a class$ that we now want to expand */
7768 if (TYPE_DOT_CLASS (current_class))
7769 java_complete_expand_method (TYPE_DOT_CLASS (current_class));
7771 /* Now verify constructor circularity (stop after the first one we
7773 if (!CLASS_INTERFACE (class_decl))
7774 for (decl = TYPE_METHODS (current_class); decl; decl = TREE_CHAIN (decl))
7775 if (DECL_CONSTRUCTOR_P (decl)
7776 && verify_constructor_circularity (decl, decl))
7779 /* Save the constant pool. We'll need to restore it later. */
7780 TYPE_CPOOL (current_class) = outgoing_cpool;
7783 /* Attempt to create <clinit>. Pre-expand static fields so they can be
7784 safely used in some other methods/constructors. */
7787 maybe_generate_pre_expand_clinit (tree class_type)
7789 tree current, mdecl;
7791 if (!TYPE_CLINIT_STMT_LIST (class_type))
7794 /* Go through all static fields and pre expand them */
7795 for (current = TYPE_FIELDS (class_type); current;
7796 current = TREE_CHAIN (current))
7797 if (FIELD_STATIC (current))
7798 build_field_ref (NULL_TREE, class_type, DECL_NAME (current));
7800 /* Then build the <clinit> method */
7801 mdecl = create_artificial_method (class_type, ACC_STATIC, void_type_node,
7802 clinit_identifier_node, end_params_node);
7803 layout_class_method (class_type, CLASSTYPE_SUPER (class_type),
7805 start_artificial_method_body (mdecl);
7807 /* We process the list of assignment we produced as the result of
7808 the declaration of initialized static field and add them as
7809 statement to the <clinit> method. */
7810 for (current = TYPE_CLINIT_STMT_LIST (class_type); current;
7811 current = TREE_CHAIN (current))
7813 tree stmt = current;
7814 /* We build the assignment expression that will initialize the
7815 field to its value. There are strict rules on static
7816 initializers (8.5). FIXME */
7817 if (TREE_CODE (stmt) != BLOCK && stmt != empty_stmt_node)
7818 stmt = build_debugable_stmt (EXPR_WFL_LINECOL (stmt), stmt);
7819 java_method_add_stmt (mdecl, stmt);
7822 end_artificial_method_body (mdecl);
7824 /* Now we want to place <clinit> as the last method (because we need
7825 it at least for interface so that it doesn't interfere with the
7826 dispatch table based lookup. */
7827 if (TREE_CHAIN (TYPE_METHODS (class_type)))
7829 current = TREE_CHAIN (TYPE_METHODS (class_type));
7830 TYPE_METHODS (class_type) = current;
7832 while (TREE_CHAIN (current))
7833 current = TREE_CHAIN (current);
7835 TREE_CHAIN (current) = mdecl;
7836 TREE_CHAIN (mdecl) = NULL_TREE;
7842 /* Analyzes a method body and look for something that isn't a
7843 MODIFY_EXPR with a constant value. */
7846 analyze_clinit_body (tree this_class, tree bbody)
7849 switch (TREE_CODE (bbody))
7852 bbody = BLOCK_EXPR_BODY (bbody);
7855 case EXPR_WITH_FILE_LOCATION:
7856 bbody = EXPR_WFL_NODE (bbody);
7860 if (analyze_clinit_body (this_class, TREE_OPERAND (bbody, 0)))
7862 bbody = TREE_OPERAND (bbody, 1);
7866 /* If we're generating to class file and we're dealing with an
7867 array initialization, we return 1 to keep <clinit> */
7868 if (TREE_CODE (TREE_OPERAND (bbody, 1)) == NEW_ARRAY_INIT
7869 && flag_emit_class_files)
7872 /* There are a few cases where we're required to keep
7874 - If this is an assignment whose operand is not constant,
7875 - If this is an assignment to a non-initialized field,
7876 - If this field is not a member of the current class.
7878 return (! TREE_CONSTANT (TREE_OPERAND (bbody, 1))
7879 || ! DECL_INITIAL (TREE_OPERAND (bbody, 0))
7880 || DECL_CONTEXT (TREE_OPERAND (bbody, 0)) != this_class);
7889 /* See whether we could get rid of <clinit>. Criteria are: all static
7890 final fields have constant initial values and the body of <clinit>
7891 is empty. Return 1 if <clinit> was discarded, 0 otherwise. */
7894 maybe_yank_clinit (tree mdecl)
7899 if (!DECL_CLINIT_P (mdecl))
7902 /* If the body isn't empty, then we keep <clinit>. Note that if
7903 we're emitting classfiles, this isn't enough not to rule it
7905 fbody = DECL_FUNCTION_BODY (mdecl);
7906 bbody = BLOCK_EXPR_BODY (fbody);
7907 if (bbody && bbody != error_mark_node)
7908 bbody = BLOCK_EXPR_BODY (bbody);
7911 if (bbody && ! flag_emit_class_files && bbody != empty_stmt_node)
7914 type = DECL_CONTEXT (mdecl);
7915 current = TYPE_FIELDS (type);
7917 for (current = (current ? TREE_CHAIN (current) : current);
7918 current; current = TREE_CHAIN (current))
7922 /* We're not interested in non-static fields. */
7923 if (!FIELD_STATIC (current))
7926 /* Nor in fields without initializers. */
7927 f_init = DECL_INITIAL (current);
7928 if (f_init == NULL_TREE)
7931 /* Anything that isn't String or a basic type is ruled out -- or
7932 if we know how to deal with it (when doing things natively) we
7933 should generated an empty <clinit> so that SUID are computed
7935 if (! JSTRING_TYPE_P (TREE_TYPE (current))
7936 && ! JNUMERIC_TYPE_P (TREE_TYPE (current)))
7939 if (! FIELD_FINAL (current) || ! TREE_CONSTANT (f_init))
7943 /* Now we analyze the method body and look for something that
7944 isn't a MODIFY_EXPR */
7945 if (bbody != empty_stmt_node && analyze_clinit_body (type, bbody))
7948 /* Get rid of <clinit> in the class' list of methods */
7949 if (TYPE_METHODS (type) == mdecl)
7950 TYPE_METHODS (type) = TREE_CHAIN (mdecl);
7952 for (current = TYPE_METHODS (type); current;
7953 current = TREE_CHAIN (current))
7954 if (TREE_CHAIN (current) == mdecl)
7956 TREE_CHAIN (current) = TREE_CHAIN (mdecl);
7963 /* Install the argument from MDECL. Suitable to completion and
7964 expansion of mdecl's body. */
7967 start_complete_expand_method (tree mdecl)
7971 pushlevel (1); /* Prepare for a parameter push */
7972 tem = BLOCK_EXPR_DECLS (DECL_FUNCTION_BODY (current_function_decl));
7973 DECL_ARGUMENTS (mdecl) = tem;
7975 for (; tem; tem = TREE_CHAIN (tem))
7977 /* TREE_CHAIN (tem) will change after pushdecl. */
7978 tree next = TREE_CHAIN (tem);
7979 tree type = TREE_TYPE (tem);
7980 if (PROMOTE_PROTOTYPES
7981 && TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node)
7982 && INTEGRAL_TYPE_P (type))
7983 type = integer_type_node;
7984 DECL_ARG_TYPE (tem) = type;
7985 layout_decl (tem, 0);
7987 /* Re-install the next so that the list is kept and the loop
7989 TREE_CHAIN (tem) = next;
7991 pushdecl_force_head (DECL_ARGUMENTS (mdecl));
7992 input_line = DECL_SOURCE_LINE (mdecl);
7993 build_result_decl (mdecl);
7997 /* Complete and expand a method. */
8000 java_complete_expand_method (tree mdecl)
8002 tree fbody, block_body, exception_copy;
8004 current_function_decl = mdecl;
8005 /* Fix constructors before expanding them */
8006 if (DECL_CONSTRUCTOR_P (mdecl))
8007 fix_constructors (mdecl);
8009 /* Expand functions that have a body */
8010 if (!DECL_FUNCTION_BODY (mdecl))
8013 fbody = DECL_FUNCTION_BODY (mdecl);
8014 block_body = BLOCK_EXPR_BODY (fbody);
8015 exception_copy = NULL_TREE;
8017 current_function_decl = mdecl;
8020 fprintf (stderr, " [%s.",
8021 lang_printable_name (DECL_CONTEXT (mdecl), 0));
8022 announce_function (mdecl);
8024 fprintf (stderr, "]");
8026 /* Prepare the function for tree completion */
8027 start_complete_expand_method (mdecl);
8029 /* Install the current this */
8030 current_this = (!METHOD_STATIC (mdecl) ?
8031 BLOCK_EXPR_DECLS (DECL_FUNCTION_BODY (mdecl)) : NULL_TREE);
8033 /* Purge the `throws' list of unchecked exceptions (we save a copy
8034 of the list and re-install it later.) */
8035 exception_copy = copy_list (DECL_FUNCTION_THROWS (mdecl));
8036 purge_unchecked_exceptions (mdecl);
8038 /* Install exceptions thrown with `throws' */
8039 PUSH_EXCEPTIONS (DECL_FUNCTION_THROWS (mdecl));
8041 if (block_body != NULL_TREE)
8043 block_body = java_complete_tree (block_body);
8045 /* Before we check initialization, attached all class initialization
8046 variable to the block_body */
8047 htab_traverse (DECL_FUNCTION_INIT_TEST_TABLE (mdecl),
8048 attach_init_test_initialization_flags, block_body);
8050 if (! flag_emit_xref && ! METHOD_NATIVE (mdecl))
8052 check_for_initialization (block_body, mdecl);
8054 /* Go through all the flags marking the initialization of
8055 static variables and see whether they're definitively
8056 assigned, in which case the type is remembered as
8057 definitively initialized in MDECL. */
8058 if (STATIC_CLASS_INIT_OPT_P ())
8060 /* Always register the context as properly initialized in
8061 MDECL. This used with caution helps removing extra
8062 initialization of self. */
8063 if (METHOD_STATIC (mdecl))
8066 (DECL_FUNCTION_INITIALIZED_CLASS_TABLE (mdecl),
8067 DECL_CONTEXT (mdecl), INSERT)) = DECL_CONTEXT (mdecl);
8071 ctxp->explicit_constructor_p = 0;
8074 BLOCK_EXPR_BODY (fbody) = block_body;
8076 /* If we saw a return but couldn't evaluate it properly, we'll have
8077 an error_mark_node here. */
8078 if (block_body != error_mark_node
8079 && (block_body == NULL_TREE || CAN_COMPLETE_NORMALLY (block_body))
8080 && TREE_CODE (TREE_TYPE (TREE_TYPE (mdecl))) != VOID_TYPE
8082 missing_return_error (current_function_decl);
8084 /* See if we can get rid of <clinit> if MDECL happens to be <clinit> */
8085 maybe_yank_clinit (mdecl);
8087 /* Pop the current level, with special measures if we found errors. */
8088 if (java_error_count)
8089 pushdecl_force_head (DECL_ARGUMENTS (mdecl));
8092 /* Pop the exceptions and sanity check */
8094 if (currently_caught_type_list)
8097 /* Restore the copy of the list of exceptions if emitting xrefs. */
8098 DECL_FUNCTION_THROWS (mdecl) = exception_copy;
8101 /* For with each class for which there's code to generate. */
8104 java_expand_method_bodies (tree class)
8107 for (decl = TYPE_METHODS (class); decl; decl = TREE_CHAIN (decl))
8112 if (! DECL_FUNCTION_BODY (decl))
8115 current_function_decl = decl;
8117 block = BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (decl));
8119 if (TREE_CODE (block) != BLOCK)
8122 /* Save the function body for inlining. */
8123 DECL_SAVED_TREE (decl) = block;
8125 body = BLOCK_EXPR_BODY (block);
8127 if (TREE_TYPE (body) == NULL_TREE)
8130 /* It's time to assign the variable flagging static class
8131 initialization based on which classes invoked static methods
8132 are definitely initializing. This should be flagged. */
8133 if (STATIC_CLASS_INIT_OPT_P ())
8135 tree list = DECL_FUNCTION_STATIC_METHOD_INVOCATION_COMPOUND (decl);
8136 for (; list != NULL_TREE; list = TREE_CHAIN (list))
8138 /* Executed for each statement calling a static function.
8139 LIST is a TREE_LIST whose PURPOSE is the called function
8140 and VALUE is a compound whose second operand can be patched
8141 with static class initialization flag assignments. */
8143 tree called_method = TREE_PURPOSE (list);
8144 tree compound = TREE_VALUE (list);
8145 tree assignment_compound_list
8146 = build_tree_list (called_method, NULL);
8148 /* For each class definitely initialized in
8149 CALLED_METHOD, fill ASSIGNMENT_COMPOUND with
8150 assignment to the class initialization flag. */
8151 htab_traverse (DECL_FUNCTION_INITIALIZED_CLASS_TABLE (called_method),
8152 emit_test_initialization,
8153 assignment_compound_list);
8155 if (TREE_VALUE (assignment_compound_list))
8156 TREE_OPERAND (compound, 1)
8157 = TREE_VALUE (assignment_compound_list);
8161 /* Prepend class initialization to static methods. */
8162 if (METHOD_STATIC (decl) && ! METHOD_PRIVATE (decl)
8163 && ! flag_emit_class_files
8164 && ! DECL_CLINIT_P (decl)
8165 && ! CLASS_INTERFACE (TYPE_NAME (class)))
8167 tree init = build (CALL_EXPR, void_type_node,
8168 build_address_of (soft_initclass_node),
8169 build_tree_list (NULL_TREE,
8170 build_class_ref (class)),
8172 TREE_SIDE_EFFECTS (init) = 1;
8173 body = build (COMPOUND_EXPR, TREE_TYPE (body), init, body);
8174 BLOCK_EXPR_BODY (block) = body;
8177 /* Wrap synchronized method bodies in a monitorenter
8178 plus monitorexit cleanup. */
8179 if (METHOD_SYNCHRONIZED (decl) && ! flag_emit_class_files)
8181 tree enter, exit, lock;
8182 if (METHOD_STATIC (decl))
8183 lock = build_class_ref (class);
8185 lock = DECL_ARGUMENTS (decl);
8186 BUILD_MONITOR_ENTER (enter, lock);
8187 BUILD_MONITOR_EXIT (exit, lock);
8189 body = build (COMPOUND_EXPR, void_type_node,
8191 build (TRY_FINALLY_EXPR, void_type_node, body, exit));
8192 BLOCK_EXPR_BODY (block) = body;
8195 /* Expand the the function body. */
8196 source_end_java_method ();
8202 /* This section of the code deals with accessing enclosing context
8203 fields either directly by using the relevant access to this$<n> or
8204 by invoking an access method crafted for that purpose. */
8206 /* Build the necessary access from an inner class to an outer
8207 class. This routine could be optimized to cache previous result
8208 (decl, current_class and returned access). When an access method
8209 needs to be generated, it always takes the form of a read. It might
8210 be later turned into a write by calling outer_field_access_fix. */
8213 build_outer_field_access (tree id, tree decl)
8215 tree access = NULL_TREE;
8216 tree ctx = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (current_class)));
8217 tree decl_ctx = DECL_CONTEXT (decl);
8219 /* If the immediate enclosing context of the current class is the
8220 field decl's class or inherits from it; build the access as
8221 `this$<n>.<field>'. Note that we will break the `private' barrier
8222 if we're not emitting bytecodes. */
8223 if ((ctx == decl_ctx || inherits_from_p (ctx, decl_ctx))
8224 && (!FIELD_PRIVATE (decl) || !flag_emit_class_files ))
8226 tree thisn = build_current_thisn (current_class);
8227 access = make_qualified_primary (build_wfl_node (thisn),
8228 id, EXPR_WFL_LINECOL (id));
8230 /* Otherwise, generate access methods to outer this and access the
8231 field (either using an access method or by direct access.) */
8234 int lc = EXPR_WFL_LINECOL (id);
8236 /* Now we chain the required number of calls to the access$0 to
8237 get a hold to the enclosing instance we need, and then we
8238 build the field access. */
8239 access = build_access_to_thisn (current_class, decl_ctx, lc);
8241 /* If the field is private and we're generating bytecode, then
8242 we generate an access method */
8243 if (FIELD_PRIVATE (decl) && flag_emit_class_files )
8245 tree name = build_outer_field_access_methods (decl);
8246 access = build_outer_field_access_expr (lc, decl_ctx,
8247 name, access, NULL_TREE);
8249 /* Otherwise we use `access$(this$<j>). ... access$(this$<i>).<field>'.
8250 Once again we break the `private' access rule from a foreign
8253 access = make_qualified_primary (access, id, lc);
8255 return resolve_expression_name (access, NULL);
8258 /* Return a nonzero value if NODE describes an outer field inner
8262 outer_field_access_p (tree type, tree decl)
8264 if (!INNER_CLASS_TYPE_P (type)
8265 || TREE_CODE (decl) != FIELD_DECL
8266 || DECL_CONTEXT (decl) == type)
8269 /* If the inner class extends the declaration context of the field
8270 we're trying to access, then this isn't an outer field access */
8271 if (inherits_from_p (type, DECL_CONTEXT (decl)))
8274 for (type = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (type))); ;
8275 type = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (type))))
8277 if (type == DECL_CONTEXT (decl))
8280 if (!DECL_CONTEXT (TYPE_NAME (type)))
8282 /* Before we give up, see whether the field is inherited from
8283 the enclosing context we're considering. */
8284 if (inherits_from_p (type, DECL_CONTEXT (decl)))
8293 /* Return a nonzero value if NODE represents an outer field inner
8294 access that was been already expanded. As a side effect, it returns
8295 the name of the field being accessed and the argument passed to the
8296 access function, suitable for a regeneration of the access method
8297 call if necessary. */
8300 outer_field_expanded_access_p (tree node, tree *name, tree *arg_type,
8305 if (TREE_CODE (node) != CALL_EXPR)
8308 /* Well, gcj generates slightly different tree nodes when compiling
8309 to native or bytecodes. It's the case for function calls. */
8311 if (flag_emit_class_files
8312 && TREE_CODE (node) == CALL_EXPR
8313 && OUTER_FIELD_ACCESS_IDENTIFIER_P (DECL_NAME (TREE_OPERAND (node, 0))))
8315 else if (!flag_emit_class_files)
8317 node = TREE_OPERAND (node, 0);
8319 if (node && TREE_OPERAND (node, 0)
8320 && TREE_CODE (TREE_OPERAND (node, 0)) == ADDR_EXPR)
8322 node = TREE_OPERAND (node, 0);
8323 if (TREE_OPERAND (node, 0)
8324 && TREE_CODE (TREE_OPERAND (node, 0)) == FUNCTION_DECL
8325 && (OUTER_FIELD_ACCESS_IDENTIFIER_P
8326 (DECL_NAME (TREE_OPERAND (node, 0)))))
8331 if (identified && name && arg_type && arg)
8333 tree argument = TREE_OPERAND (node, 1);
8334 *name = DECL_NAME (TREE_OPERAND (node, 0));
8335 *arg_type = TREE_TYPE (TREE_TYPE (TREE_VALUE (argument)));
8336 *arg = TREE_VALUE (argument);
8341 /* Detect in NODE an outer field read access from an inner class and
8342 transform it into a write with RHS as an argument. This function is
8343 called from the java_complete_lhs when an assignment to a LHS can
8347 outer_field_access_fix (tree wfl, tree node, tree rhs)
8349 tree name, arg_type, arg;
8351 if (outer_field_expanded_access_p (node, &name, &arg_type, &arg))
8353 node = build_outer_field_access_expr (EXPR_WFL_LINECOL (wfl),
8354 arg_type, name, arg, rhs);
8355 return java_complete_tree (node);
8360 /* Construct the expression that calls an access method:
8361 <type>.access$<n>(<arg1> [, <arg2>]);
8363 ARG2 can be NULL and will be omitted in that case. It will denote a
8367 build_outer_field_access_expr (int lc, tree type, tree access_method_name,
8368 tree arg1, tree arg2)
8370 tree args, cn, access;
8372 args = arg1 ? arg1 :
8373 build_wfl_node (build_current_thisn (current_class));
8374 args = build_tree_list (NULL_TREE, args);
8377 args = tree_cons (NULL_TREE, arg2, args);
8379 access = build_method_invocation (build_wfl_node (access_method_name), args);
8380 cn = build_wfl_node (DECL_NAME (TYPE_NAME (type)));
8381 return make_qualified_primary (cn, access, lc);
8385 build_new_access_id (void)
8387 static int access_n_counter = 1;
8390 sprintf (buffer, "access$%d", access_n_counter++);
8391 return get_identifier (buffer);
8394 /* Create the static access functions for the outer field DECL. We define a
8396 TREE_TYPE (<field>) access$<n> (DECL_CONTEXT (<field>) inst$) {
8400 TREE_TYPE (<field>) access$<n> (DECL_CONTEXT (<field>) inst$,
8401 TREE_TYPE (<field>) value$) {
8402 return inst$.field = value$;
8404 We should have a usage flags on the DECL so we can lazily turn the ones
8405 we're using for code generation. FIXME.
8409 build_outer_field_access_methods (tree decl)
8411 tree id, args, stmt, mdecl;
8413 if (FIELD_INNER_ACCESS_P (decl))
8414 return FIELD_INNER_ACCESS (decl);
8416 MAYBE_CREATE_VAR_LANG_DECL_SPECIFIC (decl);
8418 /* Create the identifier and a function named after it. */
8419 id = build_new_access_id ();
8421 /* The identifier is marked as bearing the name of a generated write
8422 access function for outer field accessed from inner classes. */
8423 OUTER_FIELD_ACCESS_IDENTIFIER_P (id) = 1;
8425 /* Create the read access */
8426 args = build_tree_list (inst_id, build_pointer_type (DECL_CONTEXT (decl)));
8427 TREE_CHAIN (args) = end_params_node;
8428 stmt = make_qualified_primary (build_wfl_node (inst_id),
8429 build_wfl_node (DECL_NAME (decl)), 0);
8430 stmt = build_return (0, stmt);
8431 mdecl = build_outer_field_access_method (DECL_CONTEXT (decl),
8432 TREE_TYPE (decl), id, args, stmt);
8433 DECL_FUNCTION_ACCESS_DECL (mdecl) = decl;
8435 /* Create the write access method. No write access for final variable */
8436 if (!FIELD_FINAL (decl))
8438 args = build_tree_list (inst_id,
8439 build_pointer_type (DECL_CONTEXT (decl)));
8440 TREE_CHAIN (args) = build_tree_list (wpv_id, TREE_TYPE (decl));
8441 TREE_CHAIN (TREE_CHAIN (args)) = end_params_node;
8442 stmt = make_qualified_primary (build_wfl_node (inst_id),
8443 build_wfl_node (DECL_NAME (decl)), 0);
8444 stmt = build_return (0, build_assignment (ASSIGN_TK, 0, stmt,
8445 build_wfl_node (wpv_id)));
8446 mdecl = build_outer_field_access_method (DECL_CONTEXT (decl),
8447 TREE_TYPE (decl), id,
8450 DECL_FUNCTION_ACCESS_DECL (mdecl) = decl;
8452 /* Return the access name */
8453 return FIELD_INNER_ACCESS (decl) = id;
8456 /* Build an field access method NAME. */
8459 build_outer_field_access_method (tree class, tree type, tree name,
8460 tree args, tree body)
8462 tree saved_current_function_decl, mdecl;
8464 /* Create the method */
8465 mdecl = create_artificial_method (class, ACC_STATIC, type, name, args);
8466 fix_method_argument_names (args, mdecl);
8467 layout_class_method (class, NULL_TREE, mdecl, NULL_TREE);
8469 /* Attach the method body. */
8470 saved_current_function_decl = current_function_decl;
8471 start_artificial_method_body (mdecl);
8472 java_method_add_stmt (mdecl, body);
8473 end_artificial_method_body (mdecl);
8474 current_function_decl = saved_current_function_decl;
8480 /* This section deals with building access function necessary for
8481 certain kinds of method invocation from inner classes. */
8484 build_outer_method_access_method (tree decl)
8486 tree saved_current_function_decl, mdecl;
8487 tree args = NULL_TREE, call_args = NULL_TREE;
8488 tree carg, id, body, class;
8490 int parm_id_count = 0;
8492 /* Test this abort with an access to a private field */
8493 if (!strcmp (IDENTIFIER_POINTER (DECL_NAME (decl)), "access$"))
8496 /* Check the cache first */
8497 if (DECL_FUNCTION_INNER_ACCESS (decl))
8498 return DECL_FUNCTION_INNER_ACCESS (decl);
8500 class = DECL_CONTEXT (decl);
8502 /* Obtain an access identifier and mark it */
8503 id = build_new_access_id ();
8504 OUTER_FIELD_ACCESS_IDENTIFIER_P (id) = 1;
8506 carg = TYPE_ARG_TYPES (TREE_TYPE (decl));
8507 /* Create the arguments, as much as the original */
8508 for (; carg && carg != end_params_node;
8509 carg = TREE_CHAIN (carg))
8511 sprintf (buffer, "write_parm_value$%d", parm_id_count++);
8512 args = chainon (args, build_tree_list (get_identifier (buffer),
8513 TREE_VALUE (carg)));
8515 args = chainon (args, end_params_node);
8517 /* Create the method */
8518 mdecl = create_artificial_method (class, ACC_STATIC,
8519 TREE_TYPE (TREE_TYPE (decl)), id, args);
8520 layout_class_method (class, NULL_TREE, mdecl, NULL_TREE);
8521 /* There is a potential bug here. We should be able to use
8522 fix_method_argument_names, but then arg names get mixed up and
8523 eventually a constructor will have its this$0 altered and the
8524 outer context won't be assignment properly. The testcase is
8526 TYPE_ARG_TYPES (TREE_TYPE (mdecl)) = args;
8528 /* Attach the method body. */
8529 saved_current_function_decl = current_function_decl;
8530 start_artificial_method_body (mdecl);
8532 /* The actual method invocation uses the same args. When invoking a
8533 static methods that way, we don't want to skip the first
8536 if (!METHOD_STATIC (decl))
8537 carg = TREE_CHAIN (carg);
8538 for (; carg && carg != end_params_node; carg = TREE_CHAIN (carg))
8539 call_args = tree_cons (NULL_TREE, build_wfl_node (TREE_PURPOSE (carg)),
8542 body = build_method_invocation (build_wfl_node (DECL_NAME (decl)),
8544 if (!METHOD_STATIC (decl))
8545 body = make_qualified_primary (build_wfl_node (TREE_PURPOSE (args)),
8547 if (TREE_TYPE (TREE_TYPE (decl)) != void_type_node)
8548 body = build_return (0, body);
8549 java_method_add_stmt (mdecl,body);
8550 end_artificial_method_body (mdecl);
8551 current_function_decl = saved_current_function_decl;
8553 /* Back tag the access function so it know what it accesses */
8554 DECL_FUNCTION_ACCESS_DECL (decl) = mdecl;
8556 /* Tag the current method so it knows it has an access generated */
8557 return DECL_FUNCTION_INNER_ACCESS (decl) = mdecl;
8561 /* This section of the code deals with building expressions to access
8562 the enclosing instance of an inner class. The enclosing instance is
8563 kept in a generated field called this$<n>, with <n> being the
8564 inner class nesting level (starting from 0.) */
8566 /* Build an access to a given this$<n>, always chaining access call to
8567 others. Access methods to this$<n> are build on the fly if
8568 necessary. This CAN'T be used to solely access this$<n-1> from
8569 this$<n> (which alway yield to special cases and optimization, see
8570 for example build_outer_field_access). */
8573 build_access_to_thisn (tree from, tree to, int lc)
8575 tree access = NULL_TREE;
8577 while (from != to && PURE_INNER_CLASS_TYPE_P (from))
8581 access = build_current_thisn (from);
8582 access = build_wfl_node (access);
8586 tree access0_wfl, cn;
8588 maybe_build_thisn_access_method (from);
8589 access0_wfl = build_wfl_node (access0_identifier_node);
8590 cn = build_wfl_node (DECL_NAME (TYPE_NAME (from)));
8591 EXPR_WFL_LINECOL (access0_wfl) = lc;
8592 access = build_tree_list (NULL_TREE, access);
8593 access = build_method_invocation (access0_wfl, access);
8594 access = make_qualified_primary (cn, access, lc);
8597 /* If FROM isn't an inner class, that's fine, we've done enough.
8598 What we're looking for can be accessed from there. */
8599 from = DECL_CONTEXT (TYPE_NAME (from));
8602 from = TREE_TYPE (from);
8607 /* Build an access function to the this$<n> local to TYPE. NULL_TREE
8608 is returned if nothing needs to be generated. Otherwise, the method
8609 generated and a method decl is returned.
8611 NOTE: These generated methods should be declared in a class file
8612 attribute so that they can't be referred to directly. */
8615 maybe_build_thisn_access_method (tree type)
8617 tree mdecl, args, stmt, rtype;
8618 tree saved_current_function_decl;
8620 /* If TYPE is a top-level class, no access method is required.
8621 If there already is such an access method, bail out. */
8622 if (CLASS_ACCESS0_GENERATED_P (type) || !PURE_INNER_CLASS_TYPE_P (type))
8625 /* We generate the method. The method looks like:
8626 static <outer_of_type> access$0 (<type> inst$) { return inst$.this$<n>; }
8628 args = build_tree_list (inst_id, build_pointer_type (type));
8629 TREE_CHAIN (args) = end_params_node;
8630 rtype = build_pointer_type (TREE_TYPE (DECL_CONTEXT (TYPE_NAME (type))));
8631 mdecl = create_artificial_method (type, ACC_STATIC, rtype,
8632 access0_identifier_node, args);
8633 fix_method_argument_names (args, mdecl);
8634 layout_class_method (type, NULL_TREE, mdecl, NULL_TREE);
8635 stmt = build_current_thisn (type);
8636 stmt = make_qualified_primary (build_wfl_node (inst_id),
8637 build_wfl_node (stmt), 0);
8638 stmt = build_return (0, stmt);
8640 saved_current_function_decl = current_function_decl;
8641 start_artificial_method_body (mdecl);
8642 java_method_add_stmt (mdecl, stmt);
8643 end_artificial_method_body (mdecl);
8644 current_function_decl = saved_current_function_decl;
8646 CLASS_ACCESS0_GENERATED_P (type) = 1;
8651 /* Craft an correctly numbered `this$<n>'string. this$0 is used for
8652 the first level of innerclassing. this$1 for the next one, etc...
8653 This function can be invoked with TYPE to NULL, available and then
8654 has to count the parser context. */
8656 static GTY(()) tree saved_thisn;
8657 static GTY(()) tree saved_type;
8660 build_current_thisn (tree type)
8662 static int saved_i = -1;
8663 static int saved_type_i = 0;
8670 if (type == saved_type)
8674 for (i = -1, decl = DECL_CONTEXT (TYPE_NAME (type));
8675 decl; decl = DECL_CONTEXT (decl), i++)
8683 i = list_length (GET_CPC_LIST ())-2;
8688 sprintf (buffer, "this$%d", i);
8690 saved_thisn = get_identifier (buffer);
8694 /* Return the assignment to the hidden enclosing context `this$<n>'
8695 by the second incoming parameter to the innerclass constructor. The
8696 form used is `this.this$<n> = this$<n>;'. */
8699 build_thisn_assign (void)
8701 if (current_class && PURE_INNER_CLASS_TYPE_P (current_class))
8703 tree thisn = build_current_thisn (current_class);
8704 tree lhs = make_qualified_primary (build_wfl_node (this_identifier_node),
8705 build_wfl_node (thisn), 0);
8706 tree rhs = build_wfl_node (thisn);
8707 EXPR_WFL_SET_LINECOL (lhs, input_line, 0);
8708 return build_assignment (ASSIGN_TK, EXPR_WFL_LINECOL (lhs), lhs, rhs);
8714 /* Building the synthetic `class$' used to implement the `.class' 1.1
8715 extension for non primitive types. This method looks like:
8717 static Class class$(String type) throws NoClassDefFoundError
8719 try {return (java.lang.Class.forName (String));}
8720 catch (ClassNotFoundException e) {
8721 throw new NoClassDefFoundError(e.getMessage());}
8724 static GTY(()) tree get_message_wfl;
8725 static GTY(()) tree type_parm_wfl;
8728 build_dot_class_method (tree class)
8730 #define BWF(S) build_wfl_node (get_identifier ((S)))
8731 #define MQN(X,Y) make_qualified_name ((X), (Y), 0)
8732 tree args, tmp, saved_current_function_decl, mdecl, qual_name;
8733 tree stmt, throw_stmt;
8735 if (!get_message_wfl)
8737 get_message_wfl = build_wfl_node (get_identifier ("getMessage"));
8738 type_parm_wfl = build_wfl_node (get_identifier ("type$"));
8741 /* Build the arguments */
8742 args = build_tree_list (get_identifier ("type$"),
8743 build_pointer_type (string_type_node));
8744 TREE_CHAIN (args) = end_params_node;
8746 /* Build the qualified name java.lang.Class.forName */
8747 tmp = MQN (MQN (MQN (BWF ("java"),
8748 BWF ("lang")), BWF ("Class")), BWF ("forName"));
8750 /* Create the "class$" function */
8751 mdecl = create_artificial_method (class, ACC_STATIC,
8752 build_pointer_type (class_type_node),
8753 classdollar_identifier_node, args);
8754 qual_name = MQN (MQN (BWF ("java"), BWF ("lang")),
8755 BWF ("NoClassDefFoundError"));
8756 DECL_FUNCTION_THROWS (mdecl) = build_tree_list (NULL_TREE, qual_name);
8757 register_incomplete_type (JDEP_EXCEPTION, qual_name, NULL_TREE, NULL_TREE);
8758 JDEP_GET_PATCH (CLASSD_LAST (ctxp->classd_list)) =
8759 &TREE_VALUE (DECL_FUNCTION_THROWS (mdecl));
8761 /* We start by building the try block. We need to build:
8762 return (java.lang.Class.forName (type)); */
8763 stmt = build_method_invocation (tmp,
8764 build_tree_list (NULL_TREE, type_parm_wfl));
8765 stmt = build_return (0, stmt);
8767 /* Now onto the catch block. We start by building the expression
8768 throwing a new exception: throw new NoClassDefFoundError (_.getMessage) */
8769 throw_stmt = make_qualified_name (build_wfl_node (wpv_id),
8770 get_message_wfl, 0);
8771 throw_stmt = build_method_invocation (throw_stmt, NULL_TREE);
8773 /* Build new NoClassDefFoundError (_.getMessage) */
8774 throw_stmt = build_new_invocation
8775 (build_wfl_node (get_identifier ("NoClassDefFoundError")),
8776 build_tree_list (build_pointer_type (string_type_node), throw_stmt));
8778 /* Build the throw, (it's too early to use BUILD_THROW) */
8779 throw_stmt = build1 (THROW_EXPR, NULL_TREE, throw_stmt);
8781 /* Encapsulate STMT in a try block. The catch clause executes THROW_STMT */
8782 qual_name = MQN (MQN (BWF ("java"), BWF ("lang")),
8783 BWF ("ClassNotFoundException"));
8784 stmt = encapsulate_with_try_catch (0, qual_name, stmt, throw_stmt);
8786 fix_method_argument_names (args, mdecl);
8787 layout_class_method (class, NULL_TREE, mdecl, NULL_TREE);
8788 saved_current_function_decl = current_function_decl;
8789 start_artificial_method_body (mdecl);
8790 java_method_add_stmt (mdecl, stmt);
8791 end_artificial_method_body (mdecl);
8792 current_function_decl = saved_current_function_decl;
8793 TYPE_DOT_CLASS (class) = mdecl;
8799 build_dot_class_method_invocation (tree this_class, tree type)
8801 tree dot_class_method = TYPE_DOT_CLASS (this_class);
8804 if (TYPE_ARRAY_P (type))
8805 sig_id = build_java_signature (type);
8807 sig_id = DECL_NAME (TYPE_NAME (type));
8809 /* Ensure that the proper name separator is used */
8810 sig_id = unmangle_classname (IDENTIFIER_POINTER (sig_id),
8811 IDENTIFIER_LENGTH (sig_id));
8813 s = build_string (IDENTIFIER_LENGTH (sig_id),
8814 IDENTIFIER_POINTER (sig_id));
8815 t = build_method_invocation (build_wfl_node (DECL_NAME (dot_class_method)),
8816 build_tree_list (NULL_TREE, s));
8817 if (DECL_CONTEXT (dot_class_method) != this_class)
8819 tree class_name = DECL_NAME (TYPE_NAME (DECL_CONTEXT (dot_class_method)));
8820 t = make_qualified_primary (build_wfl_node (class_name), t, 0);
8825 /* This section of the code deals with constructor. */
8827 /* Craft a body for default constructor. Patch existing constructor
8828 bodies with call to super() and field initialization statements if
8832 fix_constructors (tree mdecl)
8834 tree iii; /* Instance Initializer Invocation */
8835 tree body = DECL_FUNCTION_BODY (mdecl);
8836 tree thisn_assign, compound = NULL_TREE;
8837 tree class_type = DECL_CONTEXT (mdecl);
8839 if (DECL_FIXED_CONSTRUCTOR_P (mdecl))
8841 DECL_FIXED_CONSTRUCTOR_P (mdecl) = 1;
8845 /* It is an error for the compiler to generate a default
8846 constructor if the superclass doesn't have a constructor that
8847 takes no argument, or the same args for an anonymous class */
8848 if (verify_constructor_super (mdecl))
8850 tree sclass_decl = TYPE_NAME (CLASSTYPE_SUPER (class_type));
8851 tree save = DECL_NAME (mdecl);
8852 const char *n = IDENTIFIER_POINTER (DECL_NAME (sclass_decl));
8853 DECL_NAME (mdecl) = DECL_NAME (sclass_decl);
8855 (lookup_cl (TYPE_NAME (class_type)),
8856 "No constructor matching `%s' found in class `%s'",
8857 lang_printable_name (mdecl, 0), n);
8858 DECL_NAME (mdecl) = save;
8861 /* The constructor body must be crafted by hand. It's the
8862 constructor we defined when we realize we didn't have the
8863 CLASSNAME() constructor */
8864 start_artificial_method_body (mdecl);
8866 /* Insert an assignment to the this$<n> hidden field, if
8868 if ((thisn_assign = build_thisn_assign ()))
8869 java_method_add_stmt (mdecl, thisn_assign);
8871 /* We don't generate a super constructor invocation if we're
8872 compiling java.lang.Object. build_super_invocation takes care
8874 java_method_add_stmt (mdecl, build_super_invocation (mdecl));
8877 if ((iii = build_instinit_invocation (class_type)))
8878 java_method_add_stmt (mdecl, iii);
8880 end_artificial_method_body (mdecl);
8882 /* Search for an explicit constructor invocation */
8886 int invokes_this = 0;
8887 tree found_call = NULL_TREE;
8888 tree main_block = BLOCK_EXPR_BODY (body);
8891 switch (TREE_CODE (body))
8894 found = CALL_EXPLICIT_CONSTRUCTOR_P (body);
8895 if (CALL_THIS_CONSTRUCTOR_P (body))
8900 case EXPR_WITH_FILE_LOCATION:
8902 body = TREE_OPERAND (body, 0);
8906 body = BLOCK_EXPR_BODY (body);
8913 /* Generate the assignment to this$<n>, if necessary */
8914 if ((thisn_assign = build_thisn_assign ()))
8915 compound = add_stmt_to_compound (compound, NULL_TREE, thisn_assign);
8917 /* The constructor is missing an invocation of super() */
8919 compound = add_stmt_to_compound (compound, NULL_TREE,
8920 build_super_invocation (mdecl));
8921 /* Explicit super() invocation should take place before the
8922 instance initializer blocks. */
8925 compound = add_stmt_to_compound (compound, NULL_TREE,
8926 TREE_OPERAND (found_call, 0));
8927 TREE_OPERAND (found_call, 0) = empty_stmt_node;
8930 DECL_INIT_CALLS_THIS (mdecl) = invokes_this;
8932 /* Insert the instance initializer block right after. */
8933 if (!invokes_this && (iii = build_instinit_invocation (class_type)))
8934 compound = add_stmt_to_compound (compound, NULL_TREE, iii);
8936 /* Fix the constructor main block if we're adding extra stmts */
8939 compound = add_stmt_to_compound (compound, NULL_TREE,
8940 BLOCK_EXPR_BODY (main_block));
8941 BLOCK_EXPR_BODY (main_block) = compound;
8946 /* Browse constructors in the super class, searching for a constructor
8947 that doesn't take any argument. Return 0 if one is found, 1
8948 otherwise. If the current class is an anonymous inner class, look
8949 for something that has the same signature. */
8952 verify_constructor_super (tree mdecl)
8954 tree class = CLASSTYPE_SUPER (current_class);
8955 int super_inner = PURE_INNER_CLASS_TYPE_P (class);
8961 if (ANONYMOUS_CLASS_P (current_class))
8963 tree mdecl_arg_type;
8964 SKIP_THIS_AND_ARTIFICIAL_PARMS (mdecl_arg_type, mdecl);
8965 for (sdecl = TYPE_METHODS (class); sdecl; sdecl = TREE_CHAIN (sdecl))
8966 if (DECL_CONSTRUCTOR_P (sdecl))
8969 tree arg_type = TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (sdecl)));
8971 arg_type = TREE_CHAIN (arg_type);
8972 for (m_arg_type = mdecl_arg_type;
8973 (arg_type != end_params_node
8974 && m_arg_type != end_params_node);
8975 arg_type = TREE_CHAIN (arg_type),
8976 m_arg_type = TREE_CHAIN (m_arg_type))
8977 if (!valid_method_invocation_conversion_p
8978 (TREE_VALUE (arg_type),
8979 TREE_VALUE (m_arg_type)))
8982 if (arg_type == end_params_node && m_arg_type == end_params_node)
8988 for (sdecl = TYPE_METHODS (class); sdecl; sdecl = TREE_CHAIN (sdecl))
8990 tree arg = TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (sdecl)));
8992 arg = TREE_CHAIN (arg);
8993 if (DECL_CONSTRUCTOR_P (sdecl) && arg == end_params_node)
9000 /* Generate code for all context remembered for code generation. */
9002 static GTY(()) tree reversed_class_list;
9004 java_expand_classes (void)
9006 int save_error_count = 0;
9007 static struct parser_ctxt *cur_ctxp = NULL;
9009 java_parse_abort_on_error ();
9010 if (!(ctxp = ctxp_for_generation))
9012 java_layout_classes ();
9013 java_parse_abort_on_error ();
9015 for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
9018 input_filename = ctxp->filename;
9019 lang_init_source (2); /* Error msgs have method prototypes */
9020 java_complete_expand_classes (); /* Complete and expand classes */
9021 java_parse_abort_on_error ();
9023 input_filename = main_input_filename;
9026 /* Find anonymous classes and expand their constructor. This extra pass is
9027 necessary because the constructor itself is only generated when the
9028 method in which it is defined is expanded. */
9029 for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
9033 for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
9035 current_class = TREE_TYPE (current);
9036 if (ANONYMOUS_CLASS_P (current_class))
9039 for (d = TYPE_METHODS (current_class); d; d = TREE_CHAIN (d))
9041 if (DECL_CONSTRUCTOR_P (d))
9043 restore_line_number_status (1);
9044 java_complete_expand_method (d);
9045 restore_line_number_status (0);
9046 break; /* There is only one constructor. */
9053 /* Expanding the constructors of anonymous classes generates access
9054 methods. Scan all the methods looking for null DECL_RESULTs --
9055 this will be the case if a method hasn't been expanded. */
9056 for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
9060 for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
9063 current_class = TREE_TYPE (current);
9064 for (d = TYPE_METHODS (current_class); d; d = TREE_CHAIN (d))
9066 if (DECL_RESULT (d) == NULL_TREE)
9068 restore_line_number_status (1);
9069 java_complete_expand_method (d);
9070 restore_line_number_status (0);
9076 /* ??? Instead of all this we could iterate around the list of
9077 classes until there were no more un-expanded methods. It would
9078 take a little longer -- one pass over the whole list of methods
9079 -- but it would be simpler. Like this: */
9082 int something_changed;
9086 something_changed = 0;
9087 for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
9091 for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
9094 current_class = TREE_TYPE (current);
9095 for (d = TYPE_METHODS (current_class); d; d = TREE_CHAIN (d))
9097 if (DECL_RESULT (d) == NULL_TREE)
9099 something_changed = 1;
9100 restore_line_number_status (1);
9101 java_complete_expand_method (d);
9102 restore_line_number_status (0);
9108 while (something_changed);
9112 /* If we've found error at that stage, don't try to generate
9113 anything, unless we're emitting xrefs or checking the syntax only
9114 (but not using -fsyntax-only for the purpose of generating
9116 if (java_error_count && !flag_emit_xref
9117 && (!flag_syntax_only && !flag_emit_class_files))
9120 /* Now things are stable, go for generation of the class data. */
9122 /* We pessimistically marked all methods and fields external until
9123 we knew what set of classes we were planning to compile. Now mark
9124 those that will be generated locally as not external. */
9125 for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
9129 for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
9130 java_mark_class_local (TREE_TYPE (current));
9133 /* Compile the classes. */
9134 for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
9137 reversed_class_list = NULL;
9141 /* We write out the classes in reverse order. This ensures that
9142 inner classes are written before their containing classes,
9143 which is important for parallel builds. Otherwise, the
9144 class file for the outer class may be found, but the class
9145 file for the inner class may not be present. In that
9146 situation, the compiler cannot fall back to the original
9147 source, having already read the outer class, so we must
9148 prevent that situation. */
9149 for (current = ctxp->class_list;
9151 current = TREE_CHAIN (current))
9153 = tree_cons (NULL_TREE, current, reversed_class_list);
9155 for (current = reversed_class_list;
9157 current = TREE_CHAIN (current))
9159 current_class = TREE_TYPE (TREE_VALUE (current));
9160 outgoing_cpool = TYPE_CPOOL (current_class);
9161 if (flag_emit_class_files)
9162 write_classfile (current_class);
9164 expand_xref (current_class);
9165 else if (! flag_syntax_only)
9166 java_expand_method_bodies (current_class);
9172 java_finish_classes (void)
9174 static struct parser_ctxt *cur_ctxp = NULL;
9175 for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
9179 for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
9181 current_class = TREE_TYPE (current);
9182 outgoing_cpool = TYPE_CPOOL (current_class);
9188 /* Wrap non WFL PRIMARY around a WFL and set EXPR_WFL_QUALIFICATION to
9189 a tree list node containing RIGHT. Fore coming RIGHTs will be
9190 chained to this hook. LOCATION contains the location of the
9191 separating `.' operator. */
9194 make_qualified_primary (tree primary, tree right, int location)
9198 if (TREE_CODE (primary) != EXPR_WITH_FILE_LOCATION)
9199 wfl = build_wfl_wrap (primary, location);
9203 /* If wfl wasn't qualified, we build a first anchor */
9204 if (!EXPR_WFL_QUALIFICATION (wfl))
9205 EXPR_WFL_QUALIFICATION (wfl) = build_tree_list (wfl, NULL_TREE);
9208 /* And chain them */
9209 EXPR_WFL_LINECOL (right) = location;
9210 chainon (EXPR_WFL_QUALIFICATION (wfl), build_tree_list (right, NULL_TREE));
9211 PRIMARY_P (wfl) = 1;
9215 /* Simple merge of two name separated by a `.' */
9218 merge_qualified_name (tree left, tree right)
9221 if (!left && !right)
9230 obstack_grow (&temporary_obstack, IDENTIFIER_POINTER (left),
9231 IDENTIFIER_LENGTH (left));
9232 obstack_1grow (&temporary_obstack, '.');
9233 obstack_grow0 (&temporary_obstack, IDENTIFIER_POINTER (right),
9234 IDENTIFIER_LENGTH (right));
9235 node = get_identifier (obstack_base (&temporary_obstack));
9236 obstack_free (&temporary_obstack, obstack_base (&temporary_obstack));
9237 QUALIFIED_P (node) = 1;
9241 /* Merge the two parts of a qualified name into LEFT. Set the
9242 location information of the resulting node to LOCATION, usually
9243 inherited from the location information of the `.' operator. */
9246 make_qualified_name (tree left, tree right, int location)
9248 #ifdef USE_COMPONENT_REF
9249 tree node = build (COMPONENT_REF, NULL_TREE, left, right);
9250 EXPR_WFL_LINECOL (node) = location;
9253 tree left_id = EXPR_WFL_NODE (left);
9254 tree right_id = EXPR_WFL_NODE (right);
9257 merge = merge_qualified_name (left_id, right_id);
9259 /* Left wasn't qualified and is now qualified */
9260 if (!QUALIFIED_P (left_id))
9262 tree wfl = build_expr_wfl (left_id, ctxp->filename, 0, 0);
9263 EXPR_WFL_LINECOL (wfl) = EXPR_WFL_LINECOL (left);
9264 EXPR_WFL_QUALIFICATION (left) = build_tree_list (wfl, NULL_TREE);
9267 wfl = build_expr_wfl (right_id, ctxp->filename, 0, 0);
9268 EXPR_WFL_LINECOL (wfl) = location;
9269 chainon (EXPR_WFL_QUALIFICATION (left), build_tree_list (wfl, NULL_TREE));
9271 EXPR_WFL_NODE (left) = merge;
9276 /* Extract the last identifier component of the qualified in WFL. The
9277 last identifier is removed from the linked list */
9280 cut_identifier_in_qualified (tree wfl)
9283 tree previous = NULL_TREE;
9284 for (q = EXPR_WFL_QUALIFICATION (wfl); ; previous = q, q = TREE_CHAIN (q))
9285 if (!TREE_CHAIN (q))
9288 /* Operating on a non qualified qualified WFL. */
9291 TREE_CHAIN (previous) = NULL_TREE;
9292 return TREE_PURPOSE (q);
9296 /* Resolve the expression name NAME. Return its decl. */
9299 resolve_expression_name (tree id, tree *orig)
9301 tree name = EXPR_WFL_NODE (id);
9304 /* 6.5.5.1: Simple expression names */
9305 if (!PRIMARY_P (id) && !QUALIFIED_P (name))
9307 /* 15.13.1: NAME can appear within the scope of a local variable
9309 if ((decl = IDENTIFIER_LOCAL_VALUE (name)))
9312 /* 15.13.1: NAME can appear within a class declaration */
9315 decl = lookup_field_wrapper (current_class, name);
9318 tree access = NULL_TREE;
9319 int fs = FIELD_STATIC (decl);
9321 /* If we're accessing an outer scope local alias, make
9322 sure we change the name of the field we're going to
9324 if (FIELD_LOCAL_ALIAS_USED (decl))
9325 name = DECL_NAME (decl);
9327 check_deprecation (id, decl);
9329 /* Instance variable (8.3.1.1) can't appear within
9330 static method, static initializer or initializer for
9331 a static variable. */
9332 if (!fs && METHOD_STATIC (current_function_decl))
9334 static_ref_err (id, name, current_class);
9335 return error_mark_node;
9337 /* Instance variables can't appear as an argument of
9338 an explicit constructor invocation */
9339 if (!fs && ctxp->explicit_constructor_p
9340 && !enclosing_context_p (DECL_CONTEXT (decl), current_class))
9343 (id, "Can't reference `%s' before the superclass constructor has been called", IDENTIFIER_POINTER (name));
9344 return error_mark_node;
9347 /* If we're processing an inner class and we're trying
9348 to access a field belonging to an outer class, build
9349 the access to the field */
9350 if (!fs && outer_field_access_p (current_class, decl))
9352 if (CLASS_STATIC (TYPE_NAME (current_class)))
9354 static_ref_err (id, DECL_NAME (decl), current_class);
9355 return error_mark_node;
9357 access = build_outer_field_access (id, decl);
9363 /* Otherwise build what it takes to access the field */
9364 access = build_field_ref ((fs ? NULL_TREE : current_this),
9365 DECL_CONTEXT (decl), name);
9367 access = maybe_build_class_init_for_field (decl, access);
9368 /* We may be asked to save the real field access node */
9371 /* Last check: can we access the field? */
9372 if (not_accessible_p (current_class, decl, NULL_TREE, 0))
9374 not_accessible_field_error (id, decl);
9375 return error_mark_node;
9377 /* And we return what we got */
9380 /* Fall down to error report on undefined variable */
9383 /* 6.5.5.2 Qualified Expression Names */
9388 qualify_ambiguous_name (id);
9389 /* 15.10.1 Field Access Using a Primary and/or Expression Name */
9390 /* 15.10.2: Accessing Superclass Members using super */
9391 return resolve_field_access (id, orig, NULL);
9394 /* We've got an error here */
9395 if (INNER_CLASS_TYPE_P (current_class))
9396 parse_error_context (id,
9397 "Local variable `%s' can't be accessed from within the inner class `%s' unless it is declared final",
9398 IDENTIFIER_POINTER (name),
9399 IDENTIFIER_POINTER (DECL_NAME
9400 (TYPE_NAME (current_class))));
9402 parse_error_context (id, "Undefined variable `%s'",
9403 IDENTIFIER_POINTER (name));
9405 return error_mark_node;
9409 static_ref_err (tree wfl, tree field_id, tree class_type)
9413 "Can't make a static reference to nonstatic variable `%s' in class `%s'",
9414 IDENTIFIER_POINTER (field_id),
9415 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (class_type))));
9418 /* 15.10.1 Field Access Using a Primary and/or Expression Name.
9419 We return something suitable to generate the field access. We also
9420 return the field decl in FIELD_DECL and its type in FIELD_TYPE. If
9421 recipient's address can be null. */
9424 resolve_field_access (tree qual_wfl, tree *field_decl, tree *field_type)
9428 tree decl, where_found, type_found;
9430 if (resolve_qualified_expression_name (qual_wfl, &decl,
9431 &where_found, &type_found))
9432 return error_mark_node;
9434 /* Resolve the LENGTH field of an array here */
9435 if (DECL_P (decl) && DECL_NAME (decl) == length_identifier_node
9436 && type_found && TYPE_ARRAY_P (type_found)
9437 && ! flag_emit_class_files && ! flag_emit_xref)
9439 tree length = build_java_array_length_access (where_found);
9442 /* In case we're dealing with a static array, we need to
9443 initialize its class before the array length can be fetched.
9444 It's also a good time to create a DECL_RTL for the field if
9445 none already exists, otherwise if the field was declared in a
9446 class found in an external file and hasn't been (and won't
9447 be) accessed for its value, none will be created. */
9448 if (TREE_CODE (where_found) == VAR_DECL && FIELD_STATIC (where_found))
9450 build_static_field_ref (where_found);
9451 field_ref = build_class_init (DECL_CONTEXT (where_found), field_ref);
9454 /* We might have been trying to resolve field.method(). In which
9455 case, the resolution is over and decl is the answer */
9456 else if (JDECL_P (decl) && IDENTIFIER_LOCAL_VALUE (DECL_NAME (decl)) == decl)
9458 else if (JDECL_P (decl))
9461 type_found = DECL_CONTEXT (decl);
9462 is_static = FIELD_STATIC (decl);
9463 field_ref = build_field_ref ((is_static && !flag_emit_xref?
9464 NULL_TREE : where_found),
9465 type_found, DECL_NAME (decl));
9466 if (field_ref == error_mark_node)
9467 return error_mark_node;
9469 field_ref = maybe_build_class_init_for_field (decl, field_ref);
9471 /* If we're looking at a static field, we may need to generate a
9472 class initialization for it. This can happen when the access
9473 looks like `field.ref', where `field' is a static field in an
9474 interface we implement. */
9475 if (!flag_emit_class_files
9477 && TREE_CODE (where_found) == VAR_DECL
9478 && FIELD_STATIC (where_found))
9480 build_static_field_ref (where_found);
9481 field_ref = build_class_init (DECL_CONTEXT (where_found), field_ref);
9490 *field_type = (QUAL_DECL_TYPE (decl) ?
9491 QUAL_DECL_TYPE (decl) : TREE_TYPE (decl));
9495 /* If NODE is an access to f static field, strip out the class
9496 initialization part and return the field decl, otherwise, return
9500 strip_out_static_field_access_decl (tree node)
9502 if (TREE_CODE (node) == COMPOUND_EXPR)
9504 tree op1 = TREE_OPERAND (node, 1);
9505 if (TREE_CODE (op1) == COMPOUND_EXPR)
9507 tree call = TREE_OPERAND (op1, 0);
9508 if (TREE_CODE (call) == CALL_EXPR
9509 && TREE_CODE (TREE_OPERAND (call, 0)) == ADDR_EXPR
9510 && TREE_OPERAND (TREE_OPERAND (call, 0), 0)
9511 == soft_initclass_node)
9512 return TREE_OPERAND (op1, 1);
9514 else if (JDECL_P (op1))
9520 /* 6.5.5.2: Qualified Expression Names */
9523 resolve_qualified_expression_name (tree wfl, tree *found_decl,
9524 tree *where_found, tree *type_found)
9526 int from_type = 0; /* Field search initiated from a type */
9527 int from_super = 0, from_cast = 0, from_qualified_this = 0;
9528 int previous_call_static = 0;
9530 tree decl = NULL_TREE, type = NULL_TREE, q;
9531 /* For certain for of inner class instantiation */
9532 tree saved_current, saved_this;
9533 #define RESTORE_THIS_AND_CURRENT_CLASS \
9534 { current_class = saved_current; current_this = saved_this;}
9536 *type_found = *where_found = NULL_TREE;
9538 for (q = EXPR_WFL_QUALIFICATION (wfl); q; q = TREE_CHAIN (q))
9540 tree qual_wfl = QUAL_WFL (q);
9541 tree ret_decl; /* for EH checking */
9542 int location; /* for EH checking */
9544 /* 15.10.1 Field Access Using a Primary */
9545 switch (TREE_CODE (qual_wfl))
9548 case NEW_CLASS_EXPR:
9549 /* If the access to the function call is a non static field,
9550 build the code to access it. */
9551 if (JDECL_P (decl) && !FIELD_STATIC (decl))
9553 decl = maybe_access_field (decl, *where_found,
9554 DECL_CONTEXT (decl));
9555 if (decl == error_mark_node)
9559 /* And code for the function call */
9560 if (complete_function_arguments (qual_wfl))
9563 /* We might have to setup a new current class and a new this
9564 for the search of an inner class, relative to the type of
9565 a expression resolved as `decl'. The current values are
9566 saved and restored shortly after */
9567 saved_current = current_class;
9568 saved_this = current_this;
9570 && (TREE_CODE (qual_wfl) == NEW_CLASS_EXPR
9571 || from_qualified_this))
9573 /* If we still have `from_qualified_this', we have the form
9574 <T>.this.f() and we need to build <T>.this */
9575 if (from_qualified_this)
9577 decl = build_access_to_thisn (current_class, type, 0);
9578 decl = java_complete_tree (decl);
9579 type = TREE_TYPE (TREE_TYPE (decl));
9581 current_class = type;
9582 current_this = decl;
9583 from_qualified_this = 0;
9586 if (from_super && TREE_CODE (qual_wfl) == CALL_EXPR)
9587 CALL_USING_SUPER (qual_wfl) = 1;
9588 location = (TREE_CODE (qual_wfl) == CALL_EXPR ?
9589 EXPR_WFL_LINECOL (TREE_OPERAND (qual_wfl, 0)) : 0);
9590 *where_found = patch_method_invocation (qual_wfl, decl, type,
9592 &is_static, &ret_decl);
9594 if (*where_found == error_mark_node)
9596 RESTORE_THIS_AND_CURRENT_CLASS;
9599 *type_found = type = QUAL_DECL_TYPE (*where_found);
9601 *where_found = force_evaluation_order (*where_found);
9603 /* If we're creating an inner class instance, check for that
9604 an enclosing instance is in scope */
9605 if (TREE_CODE (qual_wfl) == NEW_CLASS_EXPR
9606 && INNER_ENCLOSING_SCOPE_CHECK (type))
9609 (qual_wfl, "No enclosing instance for inner class `%s' is in scope%s",
9610 lang_printable_name (type, 0),
9611 (!current_this ? "" :
9612 "; an explicit one must be provided when creating this inner class"));
9613 RESTORE_THIS_AND_CURRENT_CLASS;
9617 /* In case we had to change then to resolve a inner class
9618 instantiation using a primary qualified by a `new' */
9619 RESTORE_THIS_AND_CURRENT_CLASS;
9623 tree arguments = NULL_TREE;
9624 if (TREE_CODE (qual_wfl) == CALL_EXPR
9625 && TREE_OPERAND (qual_wfl, 1) != NULL_TREE)
9626 arguments = TREE_VALUE (TREE_OPERAND (qual_wfl, 1));
9627 check_thrown_exceptions (location, ret_decl, arguments);
9630 /* If the previous call was static and this one is too,
9631 build a compound expression to hold the two (because in
9632 that case, previous function calls aren't transported as
9633 forcoming function's argument. */
9634 if (previous_call_static && is_static)
9636 decl = build (COMPOUND_EXPR, TREE_TYPE (*where_found),
9637 decl, *where_found);
9638 TREE_SIDE_EFFECTS (decl) = 1;
9642 previous_call_static = is_static;
9643 decl = *where_found;
9648 case NEW_ARRAY_EXPR:
9649 case NEW_ANONYMOUS_ARRAY_EXPR:
9650 *where_found = decl = java_complete_tree (qual_wfl);
9651 if (decl == error_mark_node)
9653 *type_found = type = QUAL_DECL_TYPE (decl);
9657 *where_found = decl = java_complete_tree (qual_wfl);
9658 if (decl == error_mark_node)
9660 *type_found = type = QUAL_DECL_TYPE (decl);
9664 case CONDITIONAL_EXPR:
9667 *where_found = decl = java_complete_tree (qual_wfl);
9668 if (decl == error_mark_node)
9670 *type_found = type = QUAL_DECL_TYPE (decl);
9674 /* If the access to the function call is a non static field,
9675 build the code to access it. */
9676 if (JDECL_P (decl) && !FIELD_STATIC (decl))
9678 decl = maybe_access_field (decl, *where_found, type);
9679 if (decl == error_mark_node)
9682 /* And code for the array reference expression */
9683 decl = java_complete_tree (qual_wfl);
9684 if (decl == error_mark_node)
9686 type = QUAL_DECL_TYPE (decl);
9690 if ((decl = java_complete_tree (qual_wfl)) == error_mark_node)
9692 if ((type = patch_string (decl)))
9694 *where_found = QUAL_RESOLUTION (q) = decl;
9695 *type_found = type = TREE_TYPE (decl);
9699 if ((decl = java_complete_tree (qual_wfl)) == error_mark_node)
9701 *where_found = QUAL_RESOLUTION (q) = decl;
9702 *type_found = type = TREE_TYPE (decl);
9706 /* Fix for -Wall Just go to the next statement. Don't
9711 /* If we fall here, we weren't processing a (static) function call. */
9712 previous_call_static = 0;
9714 /* It can be the keyword THIS */
9715 if (TREE_CODE (qual_wfl) == EXPR_WITH_FILE_LOCATION
9716 && EXPR_WFL_NODE (qual_wfl) == this_identifier_node)
9721 (wfl, "Keyword `this' used outside allowed context");
9724 if (ctxp->explicit_constructor_p
9725 && type == current_class)
9727 parse_error_context (wfl, "Can't reference `this' before the superclass constructor has been called");
9730 /* We have to generate code for intermediate access */
9731 if (!from_type || TREE_TYPE (TREE_TYPE (current_this)) == type)
9733 *where_found = decl = current_this;
9734 *type_found = type = QUAL_DECL_TYPE (decl);
9736 /* We're trying to access the this from somewhere else. Make sure
9737 it's allowed before doing so. */
9740 if (!enclosing_context_p (type, current_class))
9742 char *p = xstrdup (lang_printable_name (type, 0));
9743 parse_error_context (qual_wfl, "Can't use variable `%s.this': type `%s' isn't an outer type of type `%s'",
9745 lang_printable_name (current_class, 0));
9749 from_qualified_this = 1;
9750 /* If there's nothing else after that, we need to
9751 produce something now, otherwise, the section of the
9752 code that needs to produce <T>.this will generate
9753 what is necessary. */
9754 if (!TREE_CHAIN (q))
9756 decl = build_access_to_thisn (current_class, type, 0);
9757 *where_found = decl = java_complete_tree (decl);
9758 *type_found = type = TREE_TYPE (decl);
9766 /* 15.10.2 Accessing Superclass Members using SUPER */
9767 if (TREE_CODE (qual_wfl) == EXPR_WITH_FILE_LOCATION
9768 && EXPR_WFL_NODE (qual_wfl) == super_identifier_node)
9771 /* Check on the restricted use of SUPER */
9772 if (METHOD_STATIC (current_function_decl)
9773 || current_class == object_type_node)
9776 (wfl, "Keyword `super' used outside allowed context");
9779 /* Otherwise, treat SUPER as (SUPER_CLASS)THIS */
9780 node = build_cast (EXPR_WFL_LINECOL (qual_wfl),
9781 CLASSTYPE_SUPER (current_class),
9782 build_this (EXPR_WFL_LINECOL (qual_wfl)));
9783 *where_found = decl = java_complete_tree (node);
9784 if (decl == error_mark_node)
9786 *type_found = type = QUAL_DECL_TYPE (decl);
9787 from_super = from_type = 1;
9791 /* 15.13.1: Can't search for field name in packages, so we
9792 assume a variable/class name was meant. */
9793 if (RESOLVE_PACKAGE_NAME_P (qual_wfl))
9796 if ((decl = resolve_package (wfl, &q, &name)))
9799 *where_found = decl;
9801 /* We want to be absolutely sure that the class is laid
9802 out. We're going to search something inside it. */
9803 *type_found = type = TREE_TYPE (decl);
9804 layout_class (type);
9807 /* Fix them all the way down, if any are left. */
9810 list = TREE_CHAIN (q);
9813 RESOLVE_EXPRESSION_NAME_P (QUAL_WFL (list)) = 1;
9814 RESOLVE_PACKAGE_NAME_P (QUAL_WFL (list)) = 0;
9815 list = TREE_CHAIN (list);
9821 if (from_super || from_cast)
9823 ((from_cast ? qual_wfl : wfl),
9824 "No variable `%s' defined in class `%s'",
9825 IDENTIFIER_POINTER (EXPR_WFL_NODE (qual_wfl)),
9826 lang_printable_name (type, 0));
9829 (qual_wfl, "Undefined variable or class name: `%s'",
9830 IDENTIFIER_POINTER (name));
9835 /* We have a type name. It's been already resolved when the
9836 expression was qualified. */
9837 else if (RESOLVE_TYPE_NAME_P (qual_wfl) && QUAL_RESOLUTION (q))
9839 decl = QUAL_RESOLUTION (q);
9841 /* Sneak preview. If next we see a `new', we're facing a
9842 qualification with resulted in a type being selected
9843 instead of a field. Report the error */
9845 && TREE_CODE (TREE_PURPOSE (TREE_CHAIN (q))) == NEW_CLASS_EXPR)
9847 parse_error_context (qual_wfl, "Undefined variable `%s'",
9848 IDENTIFIER_POINTER (EXPR_WFL_NODE (wfl)));
9852 if (not_accessible_p (TREE_TYPE (decl), decl, type, 0))
9853 return not_accessible_field_error (qual_wfl, decl);
9854 check_deprecation (qual_wfl, decl);
9856 type = TREE_TYPE (decl);
9859 /* We resolve an expression name */
9862 tree field_decl = NULL_TREE;
9864 /* If there exists an early resolution, use it. That occurs
9865 only once and we know that there are more things to
9866 come. Don't do that when processing something after SUPER
9867 (we need more thing to be put in place below */
9868 if (!from_super && QUAL_RESOLUTION (q))
9870 decl = QUAL_RESOLUTION (q);
9873 if (TREE_CODE (decl) == FIELD_DECL && !FIELD_STATIC (decl))
9876 *where_found = current_this;
9879 static_ref_err (qual_wfl, DECL_NAME (decl),
9883 if (outer_field_access_p (current_class, decl))
9884 decl = build_outer_field_access (qual_wfl, decl);
9888 *where_found = TREE_TYPE (decl);
9889 if (TREE_CODE (*where_found) == POINTER_TYPE)
9890 *where_found = TREE_TYPE (*where_found);
9895 /* Report and error if we're using a numerical literal as a
9896 qualifier. It can only be an INTEGER_CST. */
9897 else if (TREE_CODE (qual_wfl) == INTEGER_CST)
9900 (wfl, "Can't use type `%s' as a qualifier",
9901 lang_printable_name (TREE_TYPE (qual_wfl), 0));
9905 /* We have to search for a field, knowing the type of its
9906 container. The flag FROM_TYPE indicates that we resolved
9907 the last member of the expression as a type name, which
9908 means that for the resolution of this field, we'll look
9909 for other errors than if it was resolved as a member of
9914 tree field_decl_type; /* For layout */
9916 if (!from_type && !JREFERENCE_TYPE_P (type))
9919 (qual_wfl, "Attempt to reference field `%s' in `%s %s'",
9920 IDENTIFIER_POINTER (EXPR_WFL_NODE (qual_wfl)),
9921 lang_printable_name (type, 0),
9922 IDENTIFIER_POINTER (DECL_NAME (decl)));
9926 field_decl = lookup_field_wrapper (type,
9927 EXPR_WFL_NODE (qual_wfl));
9929 /* Maybe what we're trying to access to is an inner
9930 class, only if decl is a TYPE_DECL. */
9931 if (!field_decl && TREE_CODE (decl) == TYPE_DECL)
9933 tree ptr, inner_decl;
9935 BUILD_PTR_FROM_NAME (ptr, EXPR_WFL_NODE (qual_wfl));
9936 inner_decl = resolve_class (decl, ptr, NULL_TREE, qual_wfl);
9939 check_inner_class_access (inner_decl, decl, qual_wfl);
9940 type = TREE_TYPE (inner_decl);
9947 if (field_decl == NULL_TREE)
9950 (qual_wfl, "No variable `%s' defined in type `%s'",
9951 IDENTIFIER_POINTER (EXPR_WFL_NODE (qual_wfl)),
9952 GET_TYPE_NAME (type));
9955 if (field_decl == error_mark_node)
9958 /* Layout the type of field_decl, since we may need
9959 it. Don't do primitive types or loaded classes. The
9960 situation of non primitive arrays may not handled
9961 properly here. FIXME */
9962 if (TREE_CODE (TREE_TYPE (field_decl)) == POINTER_TYPE)
9963 field_decl_type = TREE_TYPE (TREE_TYPE (field_decl));
9965 field_decl_type = TREE_TYPE (field_decl);
9966 if (!JPRIMITIVE_TYPE_P (field_decl_type)
9967 && !CLASS_LOADED_P (field_decl_type)
9968 && !TYPE_ARRAY_P (field_decl_type))
9969 resolve_and_layout (field_decl_type, NULL_TREE);
9971 /* Check on accessibility here */
9972 if (not_accessible_p (current_class, field_decl,
9973 DECL_CONTEXT (field_decl), from_super))
9974 return not_accessible_field_error (qual_wfl,field_decl);
9975 check_deprecation (qual_wfl, field_decl);
9977 /* There are things to check when fields are accessed
9978 from type. There are no restrictions on a static
9979 declaration of the field when it is accessed from an
9981 is_static = FIELD_STATIC (field_decl);
9982 if (!from_super && from_type
9983 && !TYPE_INTERFACE_P (type)
9985 && (current_function_decl
9986 && METHOD_STATIC (current_function_decl)))
9988 static_ref_err (qual_wfl, EXPR_WFL_NODE (qual_wfl), type);
9991 from_cast = from_super = 0;
9993 /* It's an access from a type but it isn't static, we
9994 make it relative to `this'. */
9995 if (!is_static && from_type)
9996 decl = current_this;
9998 /* If we need to generate something to get a proper
9999 handle on what this field is accessed from, do it
10003 decl = maybe_access_field (decl, *where_found, *type_found);
10004 if (decl == error_mark_node)
10008 /* We want to keep the location were found it, and the type
10010 *where_found = decl;
10011 *type_found = type;
10013 /* Generate the correct expression for field access from
10015 if (from_qualified_this)
10017 field_decl = build_outer_field_access (qual_wfl, field_decl);
10018 from_qualified_this = 0;
10021 /* This is the decl found and eventually the next one to
10026 type = QUAL_DECL_TYPE (decl);
10028 /* Sneak preview. If decl is qualified by a `new', report
10029 the error here to be accurate on the peculiar construct */
10031 && TREE_CODE (TREE_PURPOSE (TREE_CHAIN (q))) == NEW_CLASS_EXPR
10032 && !JREFERENCE_TYPE_P (type))
10034 parse_error_context (qual_wfl, "Attempt to reference field `new' in a `%s'",
10035 lang_printable_name (type, 0));
10039 /* `q' might have changed due to a after package resolution
10040 re-qualification */
10044 *found_decl = decl;
10048 /* 6.6 Qualified name and access control. Returns 1 if MEMBER (a decl)
10049 can't be accessed from REFERENCE (a record type). If MEMBER
10050 features a protected access, we then use WHERE which, if non null,
10051 holds the type of MEMBER's access that is checked against
10052 6.6.2.1. This function should be used when decl is a field or a
10056 not_accessible_p (tree reference, tree member, tree where, int from_super)
10058 int access_flag = get_access_flags_from_decl (member);
10060 /* Inner classes are processed by check_inner_class_access */
10061 if (INNER_CLASS_TYPE_P (reference))
10064 /* Access always granted for members declared public */
10065 if (access_flag & ACC_PUBLIC)
10068 /* Check access on protected members */
10069 if (access_flag & ACC_PROTECTED)
10071 /* Access granted if it occurs from within the package
10072 containing the class in which the protected member is
10074 if (class_in_current_package (DECL_CONTEXT (member)))
10077 /* If accessed with the form `super.member', then access is granted */
10081 /* If where is active, access was made through a
10082 qualifier. Access is granted if the type of the qualifier is
10083 or is a sublass of the type the access made from (6.6.2.1.) */
10084 if (where && !inherits_from_p (reference, where))
10087 /* Otherwise, access is granted if occurring from the class where
10088 member is declared or a subclass of it. Find the right
10089 context to perform the check */
10090 if (PURE_INNER_CLASS_TYPE_P (reference))
10092 while (INNER_CLASS_TYPE_P (reference))
10094 if (inherits_from_p (reference, DECL_CONTEXT (member)))
10096 reference = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (reference)));
10099 if (inherits_from_p (reference, DECL_CONTEXT (member)))
10104 /* Check access on private members. Access is granted only if it
10105 occurs from within the class in which it is declared -- that does
10106 it for innerclasses too. */
10107 if (access_flag & ACC_PRIVATE)
10109 if (reference == DECL_CONTEXT (member))
10111 if (enclosing_context_p (reference, DECL_CONTEXT (member)))
10116 /* Default access are permitted only when occurring within the
10117 package in which the type (REFERENCE) is declared. In other words,
10118 REFERENCE is defined in the current package */
10120 return !class_in_current_package (reference);
10122 /* Otherwise, access is granted */
10126 /* Test deprecated decl access. */
10128 check_deprecation (tree wfl, tree decl)
10133 if (! flag_deprecated)
10136 /* We want to look at the element type of arrays here, so we strip
10137 all surrounding array types. */
10138 if (TYPE_ARRAY_P (TREE_TYPE (decl)))
10140 elt = TREE_TYPE (decl);
10141 while (TYPE_ARRAY_P (elt))
10142 elt = TYPE_ARRAY_ELEMENT (elt);
10143 /* We'll end up with a pointer type, so we use TREE_TYPE to go
10145 decl = TYPE_NAME (TREE_TYPE (elt));
10147 file = DECL_SOURCE_FILE (decl);
10149 /* Complain if the field is deprecated and the file it was defined
10150 in isn't compiled at the same time the file which contains its
10152 if (DECL_DEPRECATED (decl)
10153 && !IS_A_COMMAND_LINE_FILENAME_P (get_identifier (file)))
10156 switch (TREE_CODE (decl))
10158 case FUNCTION_DECL:
10166 parse_warning_context (wfl, "The class `%s' has been deprecated",
10167 IDENTIFIER_POINTER (DECL_NAME (decl)));
10172 /* Don't issue a message if the context as been deprecated as a
10174 if (! CLASS_DEPRECATED (TYPE_NAME (DECL_CONTEXT (decl))))
10175 parse_warning_context
10176 (wfl, "The %s `%s' in class `%s' has been deprecated",
10177 the, lang_printable_name (decl, 0),
10178 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (DECL_CONTEXT (decl)))));
10182 /* Returns 1 if class was declared in the current package, 0 otherwise */
10184 static GTY(()) tree cicp_cache;
10186 class_in_current_package (tree class)
10188 int qualified_flag;
10191 if (cicp_cache == class)
10194 qualified_flag = QUALIFIED_P (DECL_NAME (TYPE_NAME (class)));
10196 /* If the current package is empty and the name of CLASS is
10197 qualified, class isn't in the current package. If there is a
10198 current package and the name of the CLASS is not qualified, class
10199 isn't in the current package */
10200 if ((!ctxp->package && qualified_flag) || (ctxp->package && !qualified_flag))
10203 /* If there is not package and the name of CLASS isn't qualified,
10204 they belong to the same unnamed package */
10205 if (!ctxp->package && !qualified_flag)
10208 /* Compare the left part of the name of CLASS with the package name */
10209 breakdown_qualified (&left, NULL, DECL_NAME (TYPE_NAME (class)));
10210 if (ctxp->package == left)
10212 cicp_cache = class;
10218 /* This function may generate code to access DECL from WHERE. This is
10219 done only if certain conditions meet. */
10222 maybe_access_field (tree decl, tree where, tree type)
10224 if (TREE_CODE (decl) == FIELD_DECL && decl != current_this
10225 && !FIELD_STATIC (decl))
10226 decl = build_field_ref (where ? where : current_this,
10227 (type ? type : DECL_CONTEXT (decl)),
10232 /* Build a method invocation, by patching PATCH. If non NULL
10233 and according to the situation, PRIMARY and WHERE may be
10234 used. IS_STATIC is set to 1 if the invoked function is static. */
10237 patch_method_invocation (tree patch, tree primary, tree where, int from_super,
10238 int *is_static, tree *ret_decl)
10240 tree wfl = TREE_OPERAND (patch, 0);
10241 tree args = TREE_OPERAND (patch, 1);
10242 tree name = EXPR_WFL_NODE (wfl);
10244 int is_static_flag = 0;
10245 int is_super_init = 0;
10246 tree this_arg = NULL_TREE;
10247 int is_array_clone_call = 0;
10249 /* Should be overridden if everything goes well. Otherwise, if
10250 something fails, it should keep this value. It stop the
10251 evaluation of a bogus assignment. See java_complete_tree,
10252 MODIFY_EXPR: for the reasons why we sometimes want to keep on
10253 evaluating an assignment */
10254 TREE_TYPE (patch) = error_mark_node;
10256 /* Since lookup functions are messing with line numbers, save the
10258 java_parser_context_save_global ();
10260 /* 15.11.1: Compile-Time Step 1: Determine Class or Interface to Search */
10262 /* Resolution of qualified name, excluding constructors */
10263 if (QUALIFIED_P (name) && !CALL_CONSTRUCTOR_P (patch))
10265 tree identifier, identifier_wfl, type, resolved;
10266 /* Extract the last IDENTIFIER of the qualified
10267 expression. This is a wfl and we will use it's location
10268 data during error report. */
10269 identifier_wfl = cut_identifier_in_qualified (wfl);
10270 identifier = EXPR_WFL_NODE (identifier_wfl);
10272 /* Given the context, IDENTIFIER is syntactically qualified
10273 as a MethodName. We need to qualify what's before */
10274 qualify_ambiguous_name (wfl);
10275 resolved = resolve_field_access (wfl, NULL, NULL);
10277 if (TREE_CODE (resolved) == VAR_DECL && FIELD_STATIC (resolved)
10278 && FIELD_FINAL (resolved)
10279 && !inherits_from_p (DECL_CONTEXT (resolved), current_class)
10280 && !flag_emit_class_files && !flag_emit_xref)
10281 resolved = build_class_init (DECL_CONTEXT (resolved), resolved);
10283 if (resolved == error_mark_node)
10284 PATCH_METHOD_RETURN_ERROR ();
10286 type = GET_SKIP_TYPE (resolved);
10287 resolve_and_layout (type, NULL_TREE);
10289 if (JPRIMITIVE_TYPE_P (type))
10291 parse_error_context
10293 "Can't invoke a method on primitive type `%s'",
10294 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type))));
10295 PATCH_METHOD_RETURN_ERROR ();
10298 list = lookup_method_invoke (0, identifier_wfl, type, identifier, args);
10299 args = nreverse (args);
10301 /* We're resolving a call from a type */
10302 if (TREE_CODE (resolved) == TYPE_DECL)
10304 if (CLASS_INTERFACE (resolved))
10306 parse_error_context
10308 "Can't make static reference to method `%s' in interface `%s'",
10309 IDENTIFIER_POINTER (identifier),
10310 IDENTIFIER_POINTER (name));
10311 PATCH_METHOD_RETURN_ERROR ();
10313 if (list && !METHOD_STATIC (list))
10315 char *fct_name = xstrdup (lang_printable_name (list, 0));
10316 parse_error_context
10318 "Can't make static reference to method `%s %s' in class `%s'",
10319 lang_printable_name (TREE_TYPE (TREE_TYPE (list)), 0),
10320 fct_name, IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type))));
10322 PATCH_METHOD_RETURN_ERROR ();
10326 this_arg = primary = resolved;
10328 if (TYPE_ARRAY_P (type) && identifier == get_identifier ("clone"))
10329 is_array_clone_call = 1;
10331 /* IDENTIFIER_WFL will be used to report any problem further */
10332 wfl = identifier_wfl;
10334 /* Resolution of simple names, names generated after a primary: or
10338 tree class_to_search = NULL_TREE;
10339 int lc; /* Looking for Constructor */
10341 /* We search constructor in their target class */
10342 if (CALL_CONSTRUCTOR_P (patch))
10344 if (TREE_CODE (patch) == NEW_CLASS_EXPR)
10345 class_to_search = EXPR_WFL_NODE (wfl);
10346 else if (EXPR_WFL_NODE (TREE_OPERAND (patch, 0)) ==
10347 this_identifier_node)
10348 class_to_search = NULL_TREE;
10349 else if (EXPR_WFL_NODE (TREE_OPERAND (patch, 0)) ==
10350 super_identifier_node)
10353 if (CLASSTYPE_SUPER (current_class))
10355 DECL_NAME (TYPE_NAME (CLASSTYPE_SUPER (current_class)));
10358 parse_error_context (wfl, "Can't invoke super constructor on java.lang.Object");
10359 PATCH_METHOD_RETURN_ERROR ();
10363 /* Class to search is NULL if we're searching the current one */
10364 if (class_to_search)
10366 class_to_search = resolve_and_layout (class_to_search, wfl);
10368 if (!class_to_search)
10370 parse_error_context
10371 (wfl, "Class `%s' not found in type declaration",
10372 IDENTIFIER_POINTER (EXPR_WFL_NODE (wfl)));
10373 PATCH_METHOD_RETURN_ERROR ();
10376 /* Can't instantiate an abstract class, but we can
10377 invoke it's constructor. It's use within the `new'
10378 context is denied here. */
10379 if (CLASS_ABSTRACT (class_to_search)
10380 && TREE_CODE (patch) == NEW_CLASS_EXPR)
10382 parse_error_context
10383 (wfl, "Class `%s' is an abstract class. It can't be instantiated",
10384 IDENTIFIER_POINTER (EXPR_WFL_NODE (wfl)));
10385 PATCH_METHOD_RETURN_ERROR ();
10388 class_to_search = TREE_TYPE (class_to_search);
10391 class_to_search = current_class;
10394 /* This is a regular search in the local class, unless an
10395 alternate class is specified. */
10398 if (where != NULL_TREE)
10399 class_to_search = where;
10400 else if (QUALIFIED_P (name))
10401 class_to_search = current_class;
10404 class_to_search = current_class;
10408 if (has_method (class_to_search, name))
10410 if (! INNER_CLASS_TYPE_P (class_to_search))
10412 parse_error_context (wfl,
10413 "No method named `%s' in scope",
10414 IDENTIFIER_POINTER (name));
10415 PATCH_METHOD_RETURN_ERROR ();
10418 = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (class_to_search)));
10424 /* NAME is a simple identifier or comes from a primary. Search
10425 in the class whose declaration contain the method being
10427 resolve_and_layout (class_to_search, NULL_TREE);
10429 list = lookup_method_invoke (lc, wfl, class_to_search, name, args);
10430 /* Don't continue if no method were found, as the next statement
10431 can't be executed then. */
10433 PATCH_METHOD_RETURN_ERROR ();
10435 if (TYPE_ARRAY_P (class_to_search)
10436 && DECL_NAME (list) == get_identifier ("clone"))
10437 is_array_clone_call = 1;
10439 /* Check for static reference if non static methods */
10440 if (check_for_static_method_reference (wfl, patch, list,
10441 class_to_search, primary))
10442 PATCH_METHOD_RETURN_ERROR ();
10444 /* Check for inner classes creation from illegal contexts */
10445 if (lc && (INNER_CLASS_TYPE_P (class_to_search)
10446 && !CLASS_STATIC (TYPE_NAME (class_to_search)))
10447 && INNER_ENCLOSING_SCOPE_CHECK (class_to_search)
10448 && !DECL_INIT_P (current_function_decl))
10450 parse_error_context
10451 (wfl, "No enclosing instance for inner class `%s' is in scope%s",
10452 lang_printable_name (class_to_search, 0),
10453 (!current_this ? "" :
10454 "; an explicit one must be provided when creating this inner class"));
10455 PATCH_METHOD_RETURN_ERROR ();
10458 /* Non static methods are called with the current object extra
10459 argument. If patch a `new TYPE()', the argument is the value
10460 returned by the object allocator. If method is resolved as a
10461 primary, use the primary otherwise use the current THIS. */
10462 args = nreverse (args);
10463 if (TREE_CODE (patch) != NEW_CLASS_EXPR)
10465 this_arg = primary ? primary : current_this;
10467 /* If we're using an access method, things are different.
10468 There are two family of cases:
10470 1) We're not generating bytecodes:
10472 - LIST is non static. It's invocation is transformed from
10473 x(a1,...,an) into this$<n>.x(a1,....an).
10474 - LIST is static. It's invocation is transformed from
10475 x(a1,...,an) into TYPE_OF(this$<n>).x(a1,....an)
10477 2) We're generating bytecodes:
10479 - LIST is non static. It's invocation is transformed from
10480 x(a1,....,an) into access$<n>(this$<n>,a1,...,an).
10481 - LIST is static. It's invocation is transformed from
10482 x(a1,....,an) into TYPE_OF(this$<n>).x(a1,....an).
10484 Of course, this$<n> can be arbitrarily complex, ranging from
10485 this$0 (the immediate outer context) to
10486 access$0(access$0(...(this$0))).
10488 maybe_use_access_method returns a nonzero value if the
10489 this_arg has to be moved into the (then generated) stub
10490 argument list. In the meantime, the selected function
10491 might have be replaced by a generated stub. */
10493 maybe_use_access_method (is_super_init, &list, &this_arg))
10495 args = tree_cons (NULL_TREE, this_arg, args);
10496 this_arg = NULL_TREE; /* So it doesn't get chained twice */
10501 /* Merge point of all resolution schemes. If we have nothing, this
10502 is an error, already signaled */
10504 PATCH_METHOD_RETURN_ERROR ();
10506 /* Check accessibility, position the is_static flag, build and
10508 if (not_accessible_p (DECL_CONTEXT (current_function_decl), list,
10509 (primary ? TREE_TYPE (TREE_TYPE (primary)) :
10510 NULL_TREE), from_super)
10511 /* Calls to clone() on array types are permitted as a special-case. */
10512 && !is_array_clone_call)
10514 const char *const fct_name = IDENTIFIER_POINTER (DECL_NAME (list));
10515 const char *const access =
10516 java_accstring_lookup (get_access_flags_from_decl (list));
10517 const char *const klass =
10518 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (DECL_CONTEXT (list))));
10519 const char *const refklass =
10520 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (current_class)));
10521 const char *const what = (DECL_CONSTRUCTOR_P (list)
10522 ? "constructor" : "method");
10523 /* FIXME: WFL yields the wrong message here but I don't know
10524 what else to use. */
10525 parse_error_context (wfl,
10526 "Can't access %s %s `%s.%s' from `%s'",
10527 access, what, klass, fct_name, refklass);
10528 PATCH_METHOD_RETURN_ERROR ();
10531 /* Deprecation check: check whether the method being invoked or the
10532 instance-being-created's type are deprecated. */
10533 if (TREE_CODE (patch) == NEW_CLASS_EXPR)
10534 check_deprecation (wfl, TYPE_NAME (DECL_CONTEXT (list)));
10535 check_deprecation (wfl, list);
10537 /* If invoking a innerclass constructor, there are hidden parameters
10539 if (TREE_CODE (patch) == NEW_CLASS_EXPR
10540 && PURE_INNER_CLASS_TYPE_P (DECL_CONTEXT (list)))
10542 /* And make sure we add the accessed local variables to be saved
10543 in field aliases. */
10544 args = build_alias_initializer_parameter_list
10545 (AIPL_FUNCTION_CTOR_INVOCATION, DECL_CONTEXT (list), args, NULL);
10547 /* Secretly pass the current_this/primary as a second argument */
10548 if (primary || current_this)
10551 tree this_type = (current_this ?
10552 TREE_TYPE (TREE_TYPE (current_this)) : NULL_TREE);
10553 /* Method's (list) enclosing context */
10554 tree mec = DECL_CONTEXT (TYPE_NAME (DECL_CONTEXT (list)));
10555 /* If we have a primary, use it. */
10557 extra_arg = primary;
10558 /* The current `this' is an inner class but isn't a direct
10559 enclosing context for the inner class we're trying to
10560 create. Build an access to the proper enclosing context
10562 else if (current_this && PURE_INNER_CLASS_TYPE_P (this_type)
10563 && this_type != TREE_TYPE (mec))
10566 extra_arg = build_access_to_thisn (current_class,
10567 TREE_TYPE (mec), 0);
10568 extra_arg = java_complete_tree (extra_arg);
10570 /* Otherwise, just use the current `this' as an enclosing
10573 extra_arg = current_this;
10574 args = tree_cons (NULL_TREE, extra_arg, args);
10577 args = tree_cons (NULL_TREE, integer_zero_node, args);
10580 /* This handles the situation where a constructor invocation needs
10581 to have an enclosing context passed as a second parameter (the
10582 constructor is one of an inner class). */
10583 if ((is_super_init ||
10584 (TREE_CODE (patch) == CALL_EXPR && name == this_identifier_node))
10585 && PURE_INNER_CLASS_TYPE_P (DECL_CONTEXT (list)))
10587 tree dest = TYPE_NAME (DECL_CONTEXT (list));
10589 build_access_to_thisn (current_class, DECL_CONTEXT (dest), 0);
10590 extra_arg = java_complete_tree (extra_arg);
10591 args = tree_cons (NULL_TREE, extra_arg, args);
10594 is_static_flag = METHOD_STATIC (list);
10595 if (! is_static_flag && this_arg != NULL_TREE)
10596 args = tree_cons (NULL_TREE, this_arg, args);
10598 /* In the context of an explicit constructor invocation, we can't
10599 invoke any method relying on `this'. Exceptions are: we're
10600 invoking a static function, primary exists and is not the current
10601 this, we're creating a new object. */
10602 if (ctxp->explicit_constructor_p
10604 && (!primary || primary == current_this)
10605 && (TREE_CODE (patch) != NEW_CLASS_EXPR))
10607 parse_error_context (wfl, "Can't reference `this' before the superclass constructor has been called");
10608 PATCH_METHOD_RETURN_ERROR ();
10610 java_parser_context_restore_global ();
10612 *is_static = is_static_flag;
10613 /* Sometimes, we want the decl of the selected method. Such as for
10617 patch = patch_invoke (patch, list, args);
10619 /* Now is a good time to insert the call to finit$ */
10620 if (is_super_init && CLASS_HAS_FINIT_P (current_class))
10622 tree finit_parms, finit_call;
10624 /* Prepare to pass hidden parameters to finit$, if any. */
10625 finit_parms = build_alias_initializer_parameter_list
10626 (AIPL_FUNCTION_FINIT_INVOCATION, current_class, NULL_TREE, NULL);
10629 build_method_invocation (build_wfl_node (finit_identifier_node),
10632 /* Generate the code used to initialize fields declared with an
10633 initialization statement and build a compound statement along
10634 with the super constructor invocation. */
10635 CAN_COMPLETE_NORMALLY (patch) = 1;
10636 patch = build (COMPOUND_EXPR, void_type_node, patch,
10637 java_complete_tree (finit_call));
10642 /* Check that we're not trying to do a static reference to a method in
10643 non static method. Return 1 if it's the case, 0 otherwise. */
10646 check_for_static_method_reference (tree wfl, tree node, tree method,
10647 tree where, tree primary)
10649 if (METHOD_STATIC (current_function_decl)
10650 && !METHOD_STATIC (method) && !primary && !CALL_CONSTRUCTOR_P (node))
10652 char *fct_name = xstrdup (lang_printable_name (method, 0));
10653 parse_error_context
10654 (wfl, "Can't make static reference to method `%s %s' in class `%s'",
10655 lang_printable_name (TREE_TYPE (TREE_TYPE (method)), 0), fct_name,
10656 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (where))));
10663 /* Fix the invocation of *MDECL if necessary in the case of a
10664 invocation from an inner class. *THIS_ARG might be modified
10665 appropriately and an alternative access to *MDECL might be
10669 maybe_use_access_method (int is_super_init, tree *mdecl, tree *this_arg)
10672 tree md = *mdecl, ta = *this_arg;
10674 int non_static_context = !METHOD_STATIC (md);
10677 || DECL_CONTEXT (md) == current_class
10678 || !PURE_INNER_CLASS_TYPE_P (current_class)
10679 || DECL_FINIT_P (md)
10680 || DECL_INSTINIT_P (md))
10683 /* If we're calling a method found in an enclosing class, generate
10684 what it takes to retrieve the right this. Don't do that if we're
10685 invoking a static method. Note that if MD's type is unrelated to
10686 CURRENT_CLASS, then the current this can be used. */
10688 if (non_static_context && DECL_CONTEXT (md) != object_type_node)
10690 ctx = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (current_class)));
10691 if (inherits_from_p (ctx, DECL_CONTEXT (md)))
10693 ta = build_current_thisn (current_class);
10694 ta = build_wfl_node (ta);
10701 maybe_build_thisn_access_method (type);
10702 if (inherits_from_p (type, DECL_CONTEXT (md)))
10704 ta = build_access_to_thisn (ctx, type, 0);
10707 type = (DECL_CONTEXT (TYPE_NAME (type)) ?
10708 TREE_TYPE (DECL_CONTEXT (TYPE_NAME (type))) : NULL_TREE);
10711 ta = java_complete_tree (ta);
10714 /* We might have to use an access method to get to MD. We can
10715 break the method access rule as far as we're not generating
10717 if (METHOD_PRIVATE (md) && flag_emit_class_files)
10719 md = build_outer_method_access_method (md);
10726 /* Returning a nonzero value indicates we were doing a non static
10727 method invocation that is now a static invocation. It will have
10728 callee displace `this' to insert it in the regular argument
10730 return (non_static_context && to_return);
10733 /* Patch an invoke expression METHOD and ARGS, based on its invocation
10737 patch_invoke (tree patch, tree method, tree args)
10740 tree original_call, t, ta;
10741 tree check = NULL_TREE;
10743 /* Last step for args: convert build-in types. If we're dealing with
10744 a new TYPE() type call, the first argument to the constructor
10745 isn't found in the incoming argument list, but delivered by
10747 t = TYPE_ARG_TYPES (TREE_TYPE (method));
10748 if (TREE_CODE (patch) == NEW_CLASS_EXPR)
10749 t = TREE_CHAIN (t);
10750 for (ta = args; t != end_params_node && ta;
10751 t = TREE_CHAIN (t), ta = TREE_CHAIN (ta))
10752 if (JPRIMITIVE_TYPE_P (TREE_TYPE (TREE_VALUE (ta))) &&
10753 TREE_TYPE (TREE_VALUE (ta)) != TREE_VALUE (t))
10754 TREE_VALUE (ta) = convert (TREE_VALUE (t), TREE_VALUE (ta));
10756 /* Resolve unresolved returned type issues */
10757 t = TREE_TYPE (TREE_TYPE (method));
10758 if (TREE_CODE (t) == POINTER_TYPE && !CLASS_LOADED_P (TREE_TYPE (t)))
10759 resolve_and_layout (TREE_TYPE (t), NULL);
10761 if (flag_emit_class_files || flag_emit_xref)
10765 switch (invocation_mode (method, CALL_USING_SUPER (patch)))
10767 case INVOKE_VIRTUAL:
10768 dtable = invoke_build_dtable (0, args);
10769 func = build_invokevirtual (dtable, method);
10772 case INVOKE_NONVIRTUAL:
10773 /* If the object for the method call is null, we throw an
10774 exception. We don't do this if the object is the current
10775 method's `this'. In other cases we just rely on an
10776 optimization pass to eliminate redundant checks. */
10777 if (TREE_VALUE (args) != current_this)
10779 /* We use a save_expr here to make sure we only evaluate
10780 the new `self' expression once. */
10781 tree save_arg = save_expr (TREE_VALUE (args));
10782 TREE_VALUE (args) = save_arg;
10783 check = java_check_reference (save_arg, 1);
10785 /* Fall through. */
10788 case INVOKE_STATIC:
10790 tree signature = build_java_signature (TREE_TYPE (method));
10791 func = build_known_method_ref (method, TREE_TYPE (method),
10792 DECL_CONTEXT (method),
10797 case INVOKE_INTERFACE:
10798 dtable = invoke_build_dtable (1, args);
10799 func = build_invokeinterface (dtable, method);
10806 /* Ensure self_type is initialized, (invokestatic). FIXME */
10807 func = build1 (NOP_EXPR, build_pointer_type (TREE_TYPE (method)), func);
10810 TREE_TYPE (patch) = TREE_TYPE (TREE_TYPE (method));
10811 TREE_OPERAND (patch, 0) = func;
10812 TREE_OPERAND (patch, 1) = args;
10813 patch = check_for_builtin (method, patch);
10814 original_call = patch;
10816 /* We're processing a `new TYPE ()' form. New is called and its
10817 returned value is the first argument to the constructor. We build
10818 a COMPOUND_EXPR and use saved expression so that the overall NEW
10819 expression value is a pointer to a newly created and initialized
10821 if (TREE_CODE (original_call) == NEW_CLASS_EXPR)
10823 tree class = DECL_CONTEXT (method);
10824 tree c1, saved_new, size, new;
10827 if (flag_emit_class_files || flag_emit_xref)
10829 TREE_TYPE (patch) = build_pointer_type (class);
10832 if (!TYPE_SIZE (class))
10833 safe_layout_class (class);
10834 size = size_in_bytes (class);
10836 (class_has_finalize_method (class) ? alloc_object_node
10837 : alloc_no_finalizer_node);
10838 new = build (CALL_EXPR, promote_type (class),
10839 build_address_of (alloc_node),
10840 tree_cons (NULL_TREE, build_class_ref (class),
10841 build_tree_list (NULL_TREE,
10842 size_in_bytes (class))),
10844 saved_new = save_expr (new);
10845 c1 = build_tree_list (NULL_TREE, saved_new);
10846 TREE_CHAIN (c1) = TREE_OPERAND (original_call, 1);
10847 TREE_OPERAND (original_call, 1) = c1;
10848 TREE_SET_CODE (original_call, CALL_EXPR);
10849 patch = build (COMPOUND_EXPR, TREE_TYPE (new), patch, saved_new);
10852 /* If CHECK is set, then we are building a check to see if the object
10854 if (check != NULL_TREE)
10856 /* We have to call force_evaluation_order now because creating a
10857 COMPOUND_EXPR wraps the arg list in a way that makes it
10858 unrecognizable by force_evaluation_order later. Yuk. */
10859 patch = build (COMPOUND_EXPR, TREE_TYPE (patch), check,
10860 force_evaluation_order (patch));
10861 TREE_SIDE_EFFECTS (patch) = 1;
10864 /* In order to be able to modify PATCH later, we SAVE_EXPR it and
10865 put it as the first expression of a COMPOUND_EXPR. The second
10866 expression being an empty statement to be later patched if
10867 necessary. We remember a TREE_LIST (the PURPOSE is the method,
10868 the VALUE is the compound) in a hashtable and return a
10869 COMPOUND_EXPR built so that the result of the evaluation of the
10870 original PATCH node is returned. */
10871 if (STATIC_CLASS_INIT_OPT_P ()
10872 && current_function_decl && METHOD_STATIC (method))
10875 tree fndecl = current_function_decl;
10876 /* We have to call force_evaluation_order now because creating a
10877 COMPOUND_EXPR wraps the arg list in a way that makes it
10878 unrecognizable by force_evaluation_order later. Yuk. */
10879 tree save = save_expr (force_evaluation_order (patch));
10880 tree type = TREE_TYPE (patch);
10882 patch = build (COMPOUND_EXPR, type, save, empty_stmt_node);
10883 list = tree_cons (method, patch,
10884 DECL_FUNCTION_STATIC_METHOD_INVOCATION_COMPOUND (fndecl));
10886 DECL_FUNCTION_STATIC_METHOD_INVOCATION_COMPOUND (fndecl) = list;
10888 patch = build (COMPOUND_EXPR, type, patch, save);
10895 invocation_mode (tree method, int super)
10897 int access = get_access_flags_from_decl (method);
10900 return INVOKE_SUPER;
10902 if (access & ACC_STATIC)
10903 return INVOKE_STATIC;
10905 /* We have to look for a constructor before we handle nonvirtual
10906 calls; otherwise the constructor will look nonvirtual. */
10907 if (DECL_CONSTRUCTOR_P (method))
10908 return INVOKE_STATIC;
10910 if (access & ACC_FINAL || access & ACC_PRIVATE)
10911 return INVOKE_NONVIRTUAL;
10913 if (CLASS_FINAL (TYPE_NAME (DECL_CONTEXT (method))))
10914 return INVOKE_NONVIRTUAL;
10916 if (CLASS_INTERFACE (TYPE_NAME (DECL_CONTEXT (method))))
10917 return INVOKE_INTERFACE;
10919 return INVOKE_VIRTUAL;
10922 /* Retrieve a refined list of matching methods. It covers the step
10923 15.11.2 (Compile-Time Step 2) */
10926 lookup_method_invoke (int lc, tree cl, tree class, tree name, tree arg_list)
10928 tree atl = end_params_node; /* Arg Type List */
10929 tree method, signature, list, node;
10930 const char *candidates; /* Used for error report */
10933 /* Fix the arguments */
10934 for (node = arg_list; node; node = TREE_CHAIN (node))
10936 tree current_arg = TREE_TYPE (TREE_VALUE (node));
10937 /* Non primitive type may have to be resolved */
10938 if (!JPRIMITIVE_TYPE_P (current_arg))
10939 resolve_and_layout (current_arg, NULL_TREE);
10941 if (TREE_CODE (current_arg) == RECORD_TYPE)
10942 current_arg = promote_type (current_arg);
10943 atl = tree_cons (NULL_TREE, current_arg, atl);
10946 /* Presto. If we're dealing with an anonymous class and a
10947 constructor call, generate the right constructor now, since we
10948 know the arguments' types. */
10950 if (lc && ANONYMOUS_CLASS_P (class))
10952 tree saved_current_class;
10953 tree mdecl = craft_constructor (TYPE_NAME (class), atl);
10954 saved_current_class = current_class;
10955 current_class = class;
10956 fix_constructors (mdecl);
10957 current_class = saved_current_class;
10960 /* Find all candidates and then refine the list, searching for the
10961 most specific method. */
10962 list = find_applicable_accessible_methods_list (lc, class, name, atl);
10963 list = find_most_specific_methods_list (list);
10964 if (list && !TREE_CHAIN (list))
10965 return TREE_VALUE (list);
10967 /* Issue an error. List candidates if any. Candidates are listed
10968 only if accessible (non accessible methods may end-up here for
10969 the sake of a better error report). */
10974 obstack_grow (&temporary_obstack, ". Candidates are:\n", 18);
10975 for (current = list; current; current = TREE_CHAIN (current))
10977 tree cm = TREE_VALUE (current);
10978 char string [4096];
10979 if (!cm || not_accessible_p (class, cm, NULL_TREE, 0))
10982 (string, " `%s' in `%s'%s",
10983 get_printable_method_name (cm),
10984 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (DECL_CONTEXT (cm)))),
10985 (TREE_CHAIN (current) ? "\n" : ""));
10986 obstack_grow (&temporary_obstack, string, strlen (string));
10988 obstack_1grow (&temporary_obstack, '\0');
10989 candidates = obstack_finish (&temporary_obstack);
10991 /* Issue the error message */
10992 method = make_node (FUNCTION_TYPE);
10993 TYPE_ARG_TYPES (method) = atl;
10994 signature = build_java_argument_signature (method);
10995 dup = xstrdup (lang_printable_name (class, 0));
10996 parse_error_context (cl, "Can't find %s `%s(%s)' in type `%s'%s",
10997 (lc ? "constructor" : "method"),
10998 (lc ? dup : IDENTIFIER_POINTER (name)),
10999 IDENTIFIER_POINTER (signature), dup,
11000 (candidates ? candidates : ""));
11005 /* 15.11.2.1: Find Methods that are Applicable and Accessible. LC is 1
11006 when we're looking for a constructor. */
11009 find_applicable_accessible_methods_list (int lc, tree class, tree name,
11012 static htab_t searched_classes;
11013 static int search_not_done = 0;
11014 tree list = NULL_TREE, all_list = NULL_TREE;
11016 /* Check the hash table to determine if this class has been searched
11018 if (searched_classes)
11020 if (htab_find (searched_classes, class) != NULL)
11025 searched_classes = htab_create (10, htab_hash_pointer,
11026 htab_eq_pointer, NULL);
11030 *htab_find_slot (searched_classes, class, INSERT) = class;
11032 if (!CLASS_LOADED_P (class) && !CLASS_FROM_SOURCE_P (class))
11034 load_class (class, 1);
11035 safe_layout_class (class);
11038 /* Search interfaces */
11039 if (TREE_CODE (TYPE_NAME (class)) == TYPE_DECL
11040 && CLASS_INTERFACE (TYPE_NAME (class)))
11043 tree basetype_vec = TYPE_BINFO_BASETYPES (class);
11044 search_applicable_methods_list (lc, TYPE_METHODS (class),
11045 name, arglist, &list, &all_list);
11046 n = TREE_VEC_LENGTH (basetype_vec);
11047 for (i = 1; i < n; i++)
11049 tree t = BINFO_TYPE (TREE_VEC_ELT (basetype_vec, i));
11052 rlist = find_applicable_accessible_methods_list (lc, t, name,
11054 list = chainon (rlist, list);
11057 /* Search classes */
11060 search_applicable_methods_list (lc, TYPE_METHODS (class),
11061 name, arglist, &list, &all_list);
11063 /* When looking finit$, class$ or instinit$, we turn LC to 1 so
11064 that we only search in class. Note that we should have found
11065 something at this point. */
11066 if (ID_FINIT_P (name) || ID_CLASSDOLLAR_P (name) || ID_INSTINIT_P (name))
11073 /* We must search all interfaces of this class */
11076 tree basetype_vec = TYPE_BINFO_BASETYPES (class);
11077 int n = TREE_VEC_LENGTH (basetype_vec), i;
11078 for (i = 1; i < n; i++)
11080 tree t = BINFO_TYPE (TREE_VEC_ELT (basetype_vec, i));
11081 if (t != object_type_node)
11084 = find_applicable_accessible_methods_list (lc, t,
11086 list = chainon (rlist, list);
11091 /* Search superclass */
11092 if (!lc && CLASSTYPE_SUPER (class) != NULL_TREE)
11095 class = CLASSTYPE_SUPER (class);
11096 rlist = find_applicable_accessible_methods_list (lc, class,
11098 list = chainon (rlist, list);
11104 /* We're done. Reset the searched classes list and finally search
11105 java.lang.Object if it wasn't searched already. */
11106 if (!search_not_done)
11109 && TYPE_METHODS (object_type_node)
11110 && htab_find (searched_classes, object_type_node) == NULL)
11112 search_applicable_methods_list (lc,
11113 TYPE_METHODS (object_type_node),
11114 name, arglist, &list, &all_list);
11116 htab_delete (searched_classes);
11117 searched_classes = NULL;
11120 /* Either return the list obtained or all selected (but
11121 inaccessible) methods for better error report. */
11122 return (!list ? all_list : list);
11125 /* Effectively search for the appropriate method in method */
11128 search_applicable_methods_list (int lc, tree method, tree name, tree arglist,
11129 tree *list, tree *all_list)
11131 for (; method; method = TREE_CHAIN (method))
11133 /* When dealing with constructor, stop here, otherwise search
11135 if (lc && !DECL_CONSTRUCTOR_P (method))
11137 else if (!lc && (DECL_CONSTRUCTOR_P (method)
11138 || (DECL_NAME (method) != name)))
11141 if (argument_types_convertible (method, arglist))
11143 /* Retain accessible methods only */
11144 if (!not_accessible_p (DECL_CONTEXT (current_function_decl),
11145 method, NULL_TREE, 0))
11146 *list = tree_cons (NULL_TREE, method, *list);
11148 /* Also retain all selected method here */
11149 *all_list = tree_cons (NULL_TREE, method, *list);
11154 /* 15.11.2.2 Choose the Most Specific Method */
11157 find_most_specific_methods_list (tree list)
11160 int abstract, candidates;
11161 tree current, new_list = NULL_TREE;
11162 for (current = list; current; current = TREE_CHAIN (current))
11165 DECL_SPECIFIC_COUNT (TREE_VALUE (current)) = 0;
11167 for (method = list; method; method = TREE_CHAIN (method))
11169 tree method_v, current_v;
11170 /* Don't test a method against itself */
11171 if (method == current)
11174 method_v = TREE_VALUE (method);
11175 current_v = TREE_VALUE (current);
11177 /* Compare arguments and location where methods where declared */
11178 if (argument_types_convertible (method_v, current_v))
11180 if (valid_method_invocation_conversion_p
11181 (DECL_CONTEXT (method_v), DECL_CONTEXT (current_v))
11182 || (INNER_CLASS_TYPE_P (DECL_CONTEXT (current_v))
11183 && enclosing_context_p (DECL_CONTEXT (method_v),
11184 DECL_CONTEXT (current_v))))
11186 int v = (DECL_SPECIFIC_COUNT (current_v) +=
11187 (INNER_CLASS_TYPE_P (DECL_CONTEXT (current_v)) ? 2 : 1));
11188 max = (v > max ? v : max);
11194 /* Review the list and select the maximally specific methods */
11195 for (current = list, abstract = -1, candidates = -1;
11196 current; current = TREE_CHAIN (current))
11197 if (DECL_SPECIFIC_COUNT (TREE_VALUE (current)) == max)
11199 new_list = tree_cons (NULL_TREE, TREE_VALUE (current), new_list);
11200 abstract += (METHOD_ABSTRACT (TREE_VALUE (current)) ? 1 : 0);
11204 /* If we have several and they're all abstract, just pick the
11206 if (candidates > 0 && candidates == abstract)
11208 /* FIXME: merge the throws clauses. There is no convenient way
11209 to do this in gcj right now, since ideally we'd like to
11210 introduce a new METHOD_DECL here, but that is really not
11212 new_list = nreverse (new_list);
11213 TREE_CHAIN (new_list) = NULL_TREE;
11217 /* We have several (we couldn't find a most specific), all but one
11218 are abstract, we pick the only non abstract one. */
11219 if (candidates > 0 && (candidates == abstract+1))
11221 for (current = new_list; current; current = TREE_CHAIN (current))
11222 if (!METHOD_ABSTRACT (TREE_VALUE (current)))
11224 TREE_CHAIN (current) = NULL_TREE;
11225 new_list = current;
11229 /* If we can't find one, lower expectations and try to gather multiple
11230 maximally specific methods */
11231 while (!new_list && max)
11235 if (DECL_SPECIFIC_COUNT (TREE_VALUE (current)) == max)
11236 new_list = tree_cons (NULL_TREE, TREE_VALUE (current), new_list);
11243 /* Make sure that the type of each M2_OR_ARGLIST arguments can be
11244 converted by method invocation conversion (5.3) to the type of the
11245 corresponding parameter of M1. Implementation expects M2_OR_ARGLIST
11246 to change less often than M1. */
11248 static GTY(()) tree m2_arg_value;
11249 static GTY(()) tree m2_arg_cache;
11252 argument_types_convertible (tree m1, tree m2_or_arglist)
11254 register tree m1_arg, m2_arg;
11256 SKIP_THIS_AND_ARTIFICIAL_PARMS (m1_arg, m1)
11258 if (m2_arg_value == m2_or_arglist)
11259 m2_arg = m2_arg_cache;
11262 /* M2_OR_ARGLIST can be a function DECL or a raw list of
11264 if (m2_or_arglist && TREE_CODE (m2_or_arglist) == FUNCTION_DECL)
11266 m2_arg = TYPE_ARG_TYPES (TREE_TYPE (m2_or_arglist));
11267 if (!METHOD_STATIC (m2_or_arglist))
11268 m2_arg = TREE_CHAIN (m2_arg);
11271 m2_arg = m2_or_arglist;
11273 m2_arg_value = m2_or_arglist;
11274 m2_arg_cache = m2_arg;
11277 while (m1_arg != end_params_node && m2_arg != end_params_node)
11279 resolve_and_layout (TREE_VALUE (m1_arg), NULL_TREE);
11280 if (!valid_method_invocation_conversion_p (TREE_VALUE (m1_arg),
11281 TREE_VALUE (m2_arg)))
11283 m1_arg = TREE_CHAIN (m1_arg);
11284 m2_arg = TREE_CHAIN (m2_arg);
11286 return m1_arg == end_params_node && m2_arg == end_params_node;
11289 /* Qualification routines */
11292 qualify_ambiguous_name (tree id)
11294 tree qual, qual_wfl, name = NULL_TREE, decl, ptr_type = NULL_TREE,
11295 saved_current_class;
11296 int again, super_found = 0, this_found = 0, new_array_found = 0;
11299 /* We first qualify the first element, then derive qualification of
11300 others based on the first one. If the first element is qualified
11301 by a resolution (field or type), this resolution is stored in the
11302 QUAL_RESOLUTION of the qual element being examined. We need to
11303 save the current_class since the use of SUPER might change the
11305 saved_current_class = current_class;
11306 qual = EXPR_WFL_QUALIFICATION (id);
11309 /* Simple qualified expression feature a qual_wfl that is a
11310 WFL. Expression derived from a primary feature more complicated
11311 things like a CALL_EXPR. Expression from primary need to be
11312 worked out to extract the part on which the qualification will
11314 qual_wfl = QUAL_WFL (qual);
11315 switch (TREE_CODE (qual_wfl))
11318 qual_wfl = TREE_OPERAND (qual_wfl, 0);
11319 if (TREE_CODE (qual_wfl) != EXPR_WITH_FILE_LOCATION
11320 || (EXPR_WFL_QUALIFICATION (qual_wfl)
11321 && TREE_CODE (EXPR_WFL_QUALIFICATION (qual_wfl)) == TREE_LIST))
11323 qual = EXPR_WFL_QUALIFICATION (qual_wfl);
11324 qual_wfl = QUAL_WFL (qual);
11327 case NEW_ARRAY_EXPR:
11328 case NEW_ANONYMOUS_ARRAY_EXPR:
11329 qual = TREE_CHAIN (qual);
11330 again = new_array_found = 1;
11334 case NEW_CLASS_EXPR:
11335 qual_wfl = TREE_OPERAND (qual_wfl, 0);
11338 while (TREE_CODE (qual_wfl) == ARRAY_REF)
11339 qual_wfl = TREE_OPERAND (qual_wfl, 0);
11342 qual = TREE_CHAIN (qual);
11343 qual_wfl = QUAL_WFL (qual);
11345 case CLASS_LITERAL:
11346 qual = TREE_CHAIN (qual);
11347 qual_wfl = QUAL_WFL (qual);
11350 /* Fix for -Wall. Just break doing nothing */
11354 ptr_type = current_class;
11356 code = TREE_CODE (qual_wfl);
11358 /* Pos evaluation: non WFL leading expression nodes */
11359 if (code == CONVERT_EXPR
11360 && TREE_CODE (TREE_TYPE (qual_wfl)) == EXPR_WITH_FILE_LOCATION)
11361 name = EXPR_WFL_NODE (TREE_TYPE (qual_wfl));
11363 else if (code == INTEGER_CST)
11366 else if (code == CONVERT_EXPR &&
11367 TREE_CODE (TREE_OPERAND (qual_wfl, 0)) == EXPR_WITH_FILE_LOCATION)
11368 name = TREE_OPERAND (qual_wfl, 0);
11370 else if (code == CONVERT_EXPR
11371 && TREE_CODE (TREE_OPERAND (qual_wfl, 0)) == CALL_EXPR
11372 && (TREE_CODE (TREE_OPERAND (TREE_OPERAND (qual_wfl, 0), 0))
11373 == EXPR_WITH_FILE_LOCATION))
11374 name = TREE_OPERAND (TREE_OPERAND (qual_wfl, 0), 0);
11376 else if ((code == ARRAY_REF || code == CALL_EXPR || code == MODIFY_EXPR) &&
11377 TREE_CODE (TREE_OPERAND (qual_wfl, 0)) == EXPR_WITH_FILE_LOCATION)
11378 name = EXPR_WFL_NODE (TREE_OPERAND (qual_wfl, 0));
11380 else if (code == TREE_LIST)
11381 name = EXPR_WFL_NODE (TREE_PURPOSE (qual_wfl));
11383 else if (code == STRING_CST || code == CONDITIONAL_EXPR
11384 || code == PLUS_EXPR)
11386 qual = TREE_CHAIN (qual);
11387 qual_wfl = QUAL_WFL (qual);
11392 name = EXPR_WFL_NODE (qual_wfl);
11395 qual = EXPR_WFL_QUALIFICATION (qual_wfl);
11400 /* If we have a THIS (from a primary), we set the context accordingly */
11401 if (name == this_identifier_node)
11403 /* This isn't really elegant. One more added irregularity
11404 before I start using COMPONENT_REF (hopefully very soon.) */
11405 if (TREE_CODE (TREE_PURPOSE (qual)) == ARRAY_REF
11406 && TREE_CODE (TREE_OPERAND (TREE_PURPOSE (qual), 0)) ==
11407 EXPR_WITH_FILE_LOCATION
11408 && EXPR_WFL_NODE (TREE_OPERAND (TREE_PURPOSE (qual), 0)) ==
11409 this_identifier_node)
11411 qual = TREE_OPERAND (TREE_PURPOSE (qual), 0);
11412 qual = EXPR_WFL_QUALIFICATION (qual);
11414 qual = TREE_CHAIN (qual);
11415 qual_wfl = QUAL_WFL (qual);
11416 if (TREE_CODE (qual_wfl) == CALL_EXPR)
11418 else if (TREE_CODE (qual_wfl) == EXPR_WITH_FILE_LOCATION)
11419 name = EXPR_WFL_NODE (qual_wfl);
11420 else if (TREE_CODE (qual_wfl) == NEW_CLASS_EXPR)
11421 name = TREE_OPERAND (qual_wfl, 0);
11424 /* If we have a SUPER, we set the context accordingly */
11425 if (name == super_identifier_node)
11427 current_class = CLASSTYPE_SUPER (ptr_type);
11428 /* Check that there is such a thing as a super class. If not,
11429 return. The error will be caught later on, during the
11431 if (!current_class)
11433 current_class = saved_current_class;
11436 qual = TREE_CHAIN (qual);
11437 /* Do one more iteration to set things up */
11438 super_found = again = 1;
11442 /* If name appears within the scope of a local variable declaration
11443 or parameter declaration, then it is an expression name. We don't
11444 carry this test out if we're in the context of the use of SUPER
11446 if (!this_found && !super_found
11447 && TREE_CODE (name) != STRING_CST && TREE_CODE (name) != INTEGER_CST
11448 && (decl = IDENTIFIER_LOCAL_VALUE (name)))
11450 RESOLVE_EXPRESSION_NAME_P (qual_wfl) = 1;
11451 QUAL_RESOLUTION (qual) = decl;
11454 /* If within the class/interface NAME was found to be used there
11455 exists a (possibly inherited) field named NAME, then this is an
11456 expression name. If we saw a NEW_ARRAY_EXPR before and want to
11457 address length, it is OK. */
11458 else if ((decl = lookup_field_wrapper (ptr_type, name))
11459 || name == length_identifier_node)
11461 RESOLVE_EXPRESSION_NAME_P (qual_wfl) = 1;
11462 QUAL_RESOLUTION (qual) = (new_array_found ? NULL_TREE : decl);
11465 /* We reclassify NAME as yielding to a type name resolution if:
11466 - NAME is a class/interface declared within the compilation
11467 unit containing NAME,
11468 - NAME is imported via a single-type-import declaration,
11469 - NAME is declared in an another compilation unit of the package
11470 of the compilation unit containing NAME,
11471 - NAME is declared by exactly on type-import-on-demand declaration
11472 of the compilation unit containing NAME.
11473 - NAME is actually a STRING_CST.
11474 This can't happen if the expression was qualified by `this.' */
11475 else if (! this_found &&
11476 (TREE_CODE (name) == STRING_CST ||
11477 TREE_CODE (name) == INTEGER_CST ||
11478 (decl = resolve_and_layout (name, NULL_TREE))))
11480 RESOLVE_TYPE_NAME_P (qual_wfl) = 1;
11481 QUAL_RESOLUTION (qual) = decl;
11484 /* Method call, array references and cast are expression name */
11485 else if (TREE_CODE (QUAL_WFL (qual)) == CALL_EXPR
11486 || TREE_CODE (QUAL_WFL (qual)) == ARRAY_REF
11487 || TREE_CODE (QUAL_WFL (qual)) == CONVERT_EXPR
11488 || TREE_CODE (QUAL_WFL (qual)) == MODIFY_EXPR)
11489 RESOLVE_EXPRESSION_NAME_P (qual_wfl) = 1;
11491 /* Check here that NAME isn't declared by more than one
11492 type-import-on-demand declaration of the compilation unit
11493 containing NAME. FIXME */
11495 /* Otherwise, NAME is reclassified as a package name */
11497 RESOLVE_PACKAGE_NAME_P (qual_wfl) = 1;
11499 /* Propagate the qualification across other components of the
11501 for (qual = TREE_CHAIN (qual); qual;
11502 qual_wfl = QUAL_WFL (qual), qual = TREE_CHAIN (qual))
11504 if (RESOLVE_PACKAGE_NAME_P (qual_wfl))
11505 RESOLVE_PACKAGE_NAME_P (QUAL_WFL (qual)) = 1;
11507 RESOLVE_EXPRESSION_NAME_P (QUAL_WFL (qual)) = 1;
11510 /* Store the global qualification for the ambiguous part of ID back
11512 if (RESOLVE_EXPRESSION_NAME_P (qual_wfl))
11513 RESOLVE_EXPRESSION_NAME_P (id) = 1;
11514 else if (RESOLVE_TYPE_NAME_P (qual_wfl))
11515 RESOLVE_TYPE_NAME_P (id) = 1;
11516 else if (RESOLVE_PACKAGE_NAME_P (qual_wfl))
11517 RESOLVE_PACKAGE_NAME_P (id) = 1;
11519 /* Restore the current class */
11520 current_class = saved_current_class;
11524 breakdown_qualified (tree *left, tree *right, tree source)
11527 int l = IDENTIFIER_LENGTH (source);
11529 base = alloca (l + 1);
11530 memcpy (base, IDENTIFIER_POINTER (source), l + 1);
11532 /* Breakdown NAME into REMAINDER . IDENTIFIER. */
11534 while (*p != '.' && p != base)
11537 /* We didn't find a '.'. Return an error. */
11543 *right = get_identifier (p+1);
11544 *left = get_identifier (base);
11549 /* Return TRUE if two classes are from the same package. */
11552 in_same_package (tree name1, tree name2)
11558 if (TREE_CODE (name1) == TYPE_DECL)
11559 name1 = DECL_NAME (name1);
11560 if (TREE_CODE (name2) == TYPE_DECL)
11561 name2 = DECL_NAME (name2);
11563 if (QUALIFIED_P (name1) != QUALIFIED_P (name2))
11564 /* One in empty package. */
11567 if (QUALIFIED_P (name1) == 0 && QUALIFIED_P (name2) == 0)
11568 /* Both in empty package. */
11571 breakdown_qualified (&pkg1, &tmp, name1);
11572 breakdown_qualified (&pkg2, &tmp, name2);
11574 return (pkg1 == pkg2);
11577 /* Patch tree nodes in a function body. When a BLOCK is found, push
11578 local variable decls if present.
11579 Same as java_complete_lhs, but does resolve static finals to values. */
11582 java_complete_tree (tree node)
11584 node = java_complete_lhs (node);
11585 if (JDECL_P (node) && CLASS_FINAL_VARIABLE_P (node)
11586 && DECL_INITIAL (node) != NULL_TREE
11587 && !flag_emit_xref)
11589 tree value = fold_constant_for_init (node, node);
11590 if (value != NULL_TREE)
11597 java_stabilize_reference (tree node)
11599 if (TREE_CODE (node) == COMPOUND_EXPR)
11601 tree op0 = TREE_OPERAND (node, 0);
11602 tree op1 = TREE_OPERAND (node, 1);
11603 TREE_OPERAND (node, 0) = save_expr (op0);
11604 TREE_OPERAND (node, 1) = java_stabilize_reference (op1);
11607 return stabilize_reference (node);
11610 /* Patch tree nodes in a function body. When a BLOCK is found, push
11611 local variable decls if present.
11612 Same as java_complete_tree, but does not resolve static finals to values. */
11615 java_complete_lhs (tree node)
11617 tree nn, cn, wfl_op1, wfl_op2, wfl_op3;
11620 /* CONVERT_EXPR always has its type set, even though it needs to be
11622 if (TREE_TYPE (node) && TREE_CODE (node) != CONVERT_EXPR)
11625 /* The switch block implements cases processing container nodes
11626 first. Contained nodes are always written back. Leaves come
11627 next and return a value. */
11628 switch (TREE_CODE (node))
11632 /* 1- Block section.
11633 Set the local values on decl names so we can identify them
11634 faster when they're referenced. At that stage, identifiers
11635 are legal so we don't check for declaration errors. */
11636 for (cn = BLOCK_EXPR_DECLS (node); cn; cn = TREE_CHAIN (cn))
11638 DECL_CONTEXT (cn) = current_function_decl;
11639 IDENTIFIER_LOCAL_VALUE (DECL_NAME (cn)) = cn;
11641 if (BLOCK_EXPR_BODY (node) == NULL_TREE)
11642 CAN_COMPLETE_NORMALLY (node) = 1;
11645 tree stmt = BLOCK_EXPR_BODY (node);
11647 int error_seen = 0;
11648 if (TREE_CODE (stmt) == COMPOUND_EXPR)
11650 /* Re-order from (((A; B); C); ...; Z) to
11651 (A; (B; (C ; (...; Z)))).
11652 This makes it easier to scan the statements left-to-right
11653 without using recursion (which might overflow the stack
11654 if the block has many statements. */
11657 tree left = TREE_OPERAND (stmt, 0);
11658 if (TREE_CODE (left) != COMPOUND_EXPR)
11660 TREE_OPERAND (stmt, 0) = TREE_OPERAND (left, 1);
11661 TREE_OPERAND (left, 1) = stmt;
11664 BLOCK_EXPR_BODY (node) = stmt;
11667 /* Now do the actual complete, without deep recursion for
11669 ptr = &BLOCK_EXPR_BODY (node);
11670 while (TREE_CODE (*ptr) == COMPOUND_EXPR
11671 && TREE_OPERAND (*ptr, 1) != empty_stmt_node)
11673 tree cur = java_complete_tree (TREE_OPERAND (*ptr, 0));
11674 tree *next = &TREE_OPERAND (*ptr, 1);
11675 TREE_OPERAND (*ptr, 0) = cur;
11676 if (cur == empty_stmt_node)
11678 /* Optimization; makes it easier to detect empty bodies.
11679 Most useful for <clinit> with all-constant initializer. */
11683 if (TREE_CODE (cur) == ERROR_MARK)
11685 else if (! CAN_COMPLETE_NORMALLY (cur))
11690 if (TREE_CODE (wfl_op2) == BLOCK)
11691 wfl_op2 = BLOCK_EXPR_BODY (wfl_op2);
11692 else if (TREE_CODE (wfl_op2) == COMPOUND_EXPR)
11693 wfl_op2 = TREE_OPERAND (wfl_op2, 0);
11697 if (TREE_CODE (wfl_op2) != CASE_EXPR
11698 && TREE_CODE (wfl_op2) != DEFAULT_EXPR)
11699 unreachable_stmt_error (*ptr);
11701 if (TREE_TYPE (*ptr) == NULL_TREE)
11702 TREE_TYPE (*ptr) = void_type_node;
11705 *ptr = java_complete_tree (*ptr);
11707 if (TREE_CODE (*ptr) == ERROR_MARK || error_seen > 0)
11708 return error_mark_node;
11709 CAN_COMPLETE_NORMALLY (node) = CAN_COMPLETE_NORMALLY (*ptr);
11711 /* Turn local bindings to null */
11712 for (cn = BLOCK_EXPR_DECLS (node); cn; cn = TREE_CHAIN (cn))
11713 IDENTIFIER_LOCAL_VALUE (DECL_NAME (cn)) = NULL_TREE;
11715 TREE_TYPE (node) = void_type_node;
11718 /* 2- They are expressions but ultimately deal with statements */
11721 wfl_op1 = TREE_OPERAND (node, 0);
11722 COMPLETE_CHECK_OP_0 (node);
11723 /* 14.19 A throw statement cannot complete normally. */
11724 CAN_COMPLETE_NORMALLY (node) = 0;
11725 return patch_throw_statement (node, wfl_op1);
11727 case SYNCHRONIZED_EXPR:
11728 wfl_op1 = TREE_OPERAND (node, 0);
11729 return patch_synchronized_statement (node, wfl_op1);
11732 return patch_try_statement (node);
11734 case TRY_FINALLY_EXPR:
11735 COMPLETE_CHECK_OP_0 (node);
11736 COMPLETE_CHECK_OP_1 (node);
11737 /* Reduce try/finally nodes with an empty try block. */
11738 if (TREE_OPERAND (node, 0) == empty_stmt_node
11739 || BLOCK_EMPTY_P (TREE_OPERAND (node, 0)))
11740 return TREE_OPERAND (node, 1);
11741 /* Likewise for an empty finally block. */
11742 if (TREE_OPERAND (node, 1) == empty_stmt_node
11743 || BLOCK_EMPTY_P (TREE_OPERAND (node, 1)))
11744 return TREE_OPERAND (node, 0);
11745 CAN_COMPLETE_NORMALLY (node)
11746 = (CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 0))
11747 && CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 1)));
11748 TREE_TYPE (node) = TREE_TYPE (TREE_OPERAND (node, 0));
11751 case LABELED_BLOCK_EXPR:
11752 PUSH_LABELED_BLOCK (node);
11753 if (LABELED_BLOCK_BODY (node))
11754 COMPLETE_CHECK_OP_1 (node);
11755 TREE_TYPE (node) = void_type_node;
11756 POP_LABELED_BLOCK ();
11758 if (LABELED_BLOCK_BODY (node) == empty_stmt_node)
11760 LABELED_BLOCK_BODY (node) = NULL_TREE;
11761 CAN_COMPLETE_NORMALLY (node) = 1;
11763 else if (CAN_COMPLETE_NORMALLY (LABELED_BLOCK_BODY (node)))
11764 CAN_COMPLETE_NORMALLY (node) = 1;
11767 case EXIT_BLOCK_EXPR:
11768 /* We don't complete operand 1, because it's the return value of
11769 the EXIT_BLOCK_EXPR which doesn't exist it Java */
11770 return patch_bc_statement (node);
11773 cn = java_complete_tree (TREE_OPERAND (node, 0));
11774 if (cn == error_mark_node)
11777 /* First, the case expression must be constant. Values of final
11778 fields are accepted. */
11780 if ((TREE_CODE (cn) == COMPOUND_EXPR || TREE_CODE (cn) == COMPONENT_REF)
11781 && JDECL_P (TREE_OPERAND (cn, 1))
11782 && FIELD_FINAL (TREE_OPERAND (cn, 1))
11783 && DECL_INITIAL (TREE_OPERAND (cn, 1)))
11785 cn = fold_constant_for_init (DECL_INITIAL (TREE_OPERAND (cn, 1)),
11786 TREE_OPERAND (cn, 1));
11788 /* Accept final locals too. */
11789 else if (TREE_CODE (cn) == VAR_DECL && DECL_FINAL (cn))
11790 cn = fold_constant_for_init (DECL_INITIAL (cn), cn);
11792 if (!TREE_CONSTANT (cn) && !flag_emit_xref)
11794 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
11795 parse_error_context (node, "Constant expression required");
11796 return error_mark_node;
11799 nn = ctxp->current_loop;
11801 /* It must be assignable to the type of the switch expression. */
11802 if (!try_builtin_assignconv (NULL_TREE,
11803 TREE_TYPE (TREE_OPERAND (nn, 0)), cn))
11805 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
11806 parse_error_context
11808 "Incompatible type for case. Can't convert `%s' to `int'",
11809 lang_printable_name (TREE_TYPE (cn), 0));
11810 return error_mark_node;
11813 cn = fold (convert (int_type_node, cn));
11814 TREE_CONSTANT_OVERFLOW (cn) = 0;
11815 CAN_COMPLETE_NORMALLY (cn) = 1;
11817 /* Save the label on a list so that we can later check for
11819 case_label_list = tree_cons (node, cn, case_label_list);
11821 /* Multiple instance of a case label bearing the same value is
11822 checked later. The case expression is all right so far. */
11823 if (TREE_CODE (cn) == VAR_DECL)
11824 cn = DECL_INITIAL (cn);
11825 TREE_OPERAND (node, 0) = cn;
11826 TREE_TYPE (node) = void_type_node;
11827 CAN_COMPLETE_NORMALLY (node) = 1;
11828 TREE_SIDE_EFFECTS (node) = 1;
11832 nn = ctxp->current_loop;
11833 /* Only one default label is allowed per switch statement */
11834 if (SWITCH_HAS_DEFAULT (nn))
11836 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
11837 parse_error_context (wfl_operator,
11838 "Duplicate case label: `default'");
11839 return error_mark_node;
11842 SWITCH_HAS_DEFAULT (nn) = 1;
11843 TREE_TYPE (node) = void_type_node;
11844 TREE_SIDE_EFFECTS (node) = 1;
11845 CAN_COMPLETE_NORMALLY (node) = 1;
11851 /* Check whether the loop was enclosed in a labeled
11852 statement. If not, create one, insert the loop in it and
11854 nn = patch_loop_statement (node);
11856 /* Anyways, walk the body of the loop */
11857 if (TREE_CODE (node) == LOOP_EXPR)
11858 TREE_OPERAND (node, 0) = java_complete_tree (TREE_OPERAND (node, 0));
11859 /* Switch statement: walk the switch expression and the cases */
11861 node = patch_switch_statement (node);
11863 if (node == error_mark_node || TREE_OPERAND (node, 0) == error_mark_node)
11864 nn = error_mark_node;
11867 TREE_TYPE (nn) = TREE_TYPE (node) = void_type_node;
11868 /* If we returned something different, that's because we
11869 inserted a label. Pop the label too. */
11872 if (CAN_COMPLETE_NORMALLY (node))
11873 CAN_COMPLETE_NORMALLY (nn) = 1;
11874 POP_LABELED_BLOCK ();
11881 TREE_OPERAND (node, 0) = java_complete_tree (TREE_OPERAND (node, 0));
11882 return patch_exit_expr (node);
11886 TREE_OPERAND (node, 0) = java_complete_tree (TREE_OPERAND (node, 0));
11887 if (TREE_OPERAND (node, 0) == error_mark_node)
11888 return error_mark_node;
11889 /* then-else branches */
11890 TREE_OPERAND (node, 1) = java_complete_tree (TREE_OPERAND (node, 1));
11891 if (TREE_OPERAND (node, 1) == error_mark_node)
11892 return error_mark_node;
11893 TREE_OPERAND (node, 2) = java_complete_tree (TREE_OPERAND (node, 2));
11894 if (TREE_OPERAND (node, 2) == error_mark_node)
11895 return error_mark_node;
11896 return patch_if_else_statement (node);
11899 case CONDITIONAL_EXPR:
11901 wfl_op1 = TREE_OPERAND (node, 0);
11902 COMPLETE_CHECK_OP_0 (node);
11903 wfl_op2 = TREE_OPERAND (node, 1);
11904 COMPLETE_CHECK_OP_1 (node);
11905 wfl_op3 = TREE_OPERAND (node, 2);
11906 COMPLETE_CHECK_OP_2 (node);
11907 return patch_conditional_expr (node, wfl_op1, wfl_op2);
11909 /* 3- Expression section */
11910 case COMPOUND_EXPR:
11911 wfl_op2 = TREE_OPERAND (node, 1);
11912 TREE_OPERAND (node, 0) = nn =
11913 java_complete_tree (TREE_OPERAND (node, 0));
11914 if (wfl_op2 == empty_stmt_node)
11915 CAN_COMPLETE_NORMALLY (node) = CAN_COMPLETE_NORMALLY (nn);
11918 if (! CAN_COMPLETE_NORMALLY (nn) && TREE_CODE (nn) != ERROR_MARK)
11920 /* An unreachable condition in a do-while statement
11921 is *not* (technically) an unreachable statement. */
11923 if (TREE_CODE (nn) == EXPR_WITH_FILE_LOCATION)
11924 nn = EXPR_WFL_NODE (nn);
11925 /* NN can be NULL_TREE exactly when UPDATE is, in
11926 finish_for_loop. */
11927 if (nn != NULL_TREE && TREE_CODE (nn) != EXIT_EXPR)
11929 SET_WFL_OPERATOR (wfl_operator, node, wfl_op2);
11930 if (SUPPRESS_UNREACHABLE_ERROR (nn))
11932 /* Perhaps this warning should have an
11933 associated flag. The code being compiled is
11934 pedantically correct, but useless. */
11935 parse_warning_context (wfl_operator,
11936 "Unreachable statement");
11939 parse_error_context (wfl_operator,
11940 "Unreachable statement");
11943 TREE_OPERAND (node, 1) = java_complete_tree (TREE_OPERAND (node, 1));
11944 if (TREE_OPERAND (node, 1) == error_mark_node)
11945 return error_mark_node;
11946 /* Even though we might allow the case where the first
11947 operand doesn't return normally, we still should compute
11948 CAN_COMPLETE_NORMALLY correctly. */
11949 CAN_COMPLETE_NORMALLY (node)
11950 = (CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 0))
11951 && CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 1)));
11953 TREE_TYPE (node) = TREE_TYPE (TREE_OPERAND (node, 1));
11957 /* CAN_COMPLETE_NORMALLY (node) = 0; */
11958 return patch_return (node);
11960 case EXPR_WITH_FILE_LOCATION:
11961 if (!EXPR_WFL_NODE (node) /* Or a PRIMARY flag ? */
11962 || TREE_CODE (EXPR_WFL_NODE (node)) == IDENTIFIER_NODE)
11965 node = resolve_expression_name (node, NULL);
11966 if (node == error_mark_node)
11968 /* Keep line number information somewhere were it doesn't
11969 disrupt the completion process. */
11970 if (flag_emit_xref && TREE_CODE (node) != CALL_EXPR)
11972 EXPR_WFL_NODE (wfl) = TREE_OPERAND (node, 1);
11973 TREE_OPERAND (node, 1) = wfl;
11975 CAN_COMPLETE_NORMALLY (node) = 1;
11980 int save_lineno = input_line;
11981 input_line = EXPR_WFL_LINENO (node);
11982 body = java_complete_tree (EXPR_WFL_NODE (node));
11983 input_line = save_lineno;
11984 EXPR_WFL_NODE (node) = body;
11985 TREE_SIDE_EFFECTS (node) = TREE_SIDE_EFFECTS (body);
11986 CAN_COMPLETE_NORMALLY (node) = CAN_COMPLETE_NORMALLY (body);
11987 if (body == empty_stmt_node || TREE_CONSTANT (body))
11989 /* Makes it easier to constant fold, detect empty bodies. */
11992 if (body == error_mark_node)
11994 /* Its important for the evaluation of assignment that
11995 this mark on the TREE_TYPE is propagated. */
11996 TREE_TYPE (node) = error_mark_node;
11997 return error_mark_node;
12000 TREE_TYPE (node) = TREE_TYPE (EXPR_WFL_NODE (node));
12005 case NEW_ARRAY_EXPR:
12006 /* Patch all the dimensions */
12008 for (cn = TREE_OPERAND (node, 1); cn; cn = TREE_CHAIN (cn))
12010 int location = EXPR_WFL_LINECOL (TREE_VALUE (cn));
12011 tree dim = convert (int_type_node,
12012 java_complete_tree (TREE_VALUE (cn)));
12013 if (dim == error_mark_node)
12020 TREE_VALUE (cn) = dim;
12021 /* Setup the location of the current dimension, for
12022 later error report. */
12023 TREE_PURPOSE (cn) =
12024 build_expr_wfl (NULL_TREE, input_filename, 0, 0);
12025 EXPR_WFL_LINECOL (TREE_PURPOSE (cn)) = location;
12028 /* They complete the array creation expression, if no errors
12030 CAN_COMPLETE_NORMALLY (node) = 1;
12031 return (flag ? error_mark_node
12032 : force_evaluation_order (patch_newarray (node)));
12034 case NEW_ANONYMOUS_ARRAY_EXPR:
12035 /* Create the array type if necessary. */
12036 if (ANONYMOUS_ARRAY_DIMS_SIG (node))
12038 tree type = ANONYMOUS_ARRAY_BASE_TYPE (node);
12039 if (!(type = resolve_type_during_patch (type)))
12040 return error_mark_node;
12041 type = build_array_from_name (type, NULL_TREE,
12042 ANONYMOUS_ARRAY_DIMS_SIG (node), NULL);
12043 ANONYMOUS_ARRAY_BASE_TYPE (node) = build_pointer_type (type);
12045 node = patch_new_array_init (ANONYMOUS_ARRAY_BASE_TYPE (node),
12046 ANONYMOUS_ARRAY_INITIALIZER (node));
12047 if (node == error_mark_node)
12048 return error_mark_node;
12049 CAN_COMPLETE_NORMALLY (node) = 1;
12052 case NEW_CLASS_EXPR:
12054 /* Complete function's argument(s) first */
12055 if (complete_function_arguments (node))
12056 return error_mark_node;
12059 tree decl, wfl = TREE_OPERAND (node, 0);
12060 int in_this = CALL_THIS_CONSTRUCTOR_P (node);
12061 int from_super = (EXPR_WFL_NODE (TREE_OPERAND (node, 0)) ==
12062 super_identifier_node);
12065 node = patch_method_invocation (node, NULL_TREE, NULL_TREE,
12066 from_super, 0, &decl);
12067 if (node == error_mark_node)
12068 return error_mark_node;
12070 if (TREE_CODE (node) == CALL_EXPR
12071 && TREE_OPERAND (node, 1) != NULL_TREE)
12072 arguments = TREE_VALUE (TREE_OPERAND (node, 1));
12074 arguments = NULL_TREE;
12075 check_thrown_exceptions (EXPR_WFL_LINECOL (node), decl,
12077 /* If we call this(...), register signature and positions */
12079 DECL_CONSTRUCTOR_CALLS (current_function_decl) =
12080 tree_cons (wfl, decl,
12081 DECL_CONSTRUCTOR_CALLS (current_function_decl));
12082 CAN_COMPLETE_NORMALLY (node) = 1;
12083 return force_evaluation_order (node);
12087 /* Save potential wfls */
12088 wfl_op1 = TREE_OPERAND (node, 0);
12089 TREE_OPERAND (node, 0) = nn = java_complete_lhs (wfl_op1);
12091 if (MODIFY_EXPR_FROM_INITIALIZATION_P (node)
12092 && TREE_CODE (nn) == VAR_DECL && TREE_STATIC (nn)
12093 && DECL_INITIAL (nn) != NULL_TREE)
12097 value = fold_constant_for_init (nn, nn);
12099 /* When we have a primitype type, or a string and we're not
12100 emitting a class file, we actually don't want to generate
12101 anything for the assignment. */
12102 if (value != NULL_TREE &&
12103 (JPRIMITIVE_TYPE_P (TREE_TYPE (value)) ||
12104 (TREE_TYPE (value) == string_ptr_type_node &&
12105 ! flag_emit_class_files)))
12107 /* Prepare node for patch_assignment */
12108 TREE_OPERAND (node, 1) = value;
12109 /* Call patch assignment to verify the assignment */
12110 if (patch_assignment (node, wfl_op1) == error_mark_node)
12111 return error_mark_node;
12112 /* Set DECL_INITIAL properly (a conversion might have
12113 been decided by patch_assignment) and return the
12114 empty statement. */
12117 tree patched = patch_string (TREE_OPERAND (node, 1));
12119 DECL_INITIAL (nn) = patched;
12121 DECL_INITIAL (nn) = TREE_OPERAND (node, 1);
12122 DECL_FIELD_FINAL_IUD (nn) = 1;
12123 return empty_stmt_node;
12126 if (! flag_emit_class_files)
12127 DECL_INITIAL (nn) = NULL_TREE;
12129 wfl_op2 = TREE_OPERAND (node, 1);
12131 if (TREE_OPERAND (node, 0) == error_mark_node)
12132 return error_mark_node;
12134 flag = COMPOUND_ASSIGN_P (wfl_op2);
12137 /* This might break when accessing outer field from inner
12138 class. TESTME, FIXME */
12139 tree lvalue = java_stabilize_reference (TREE_OPERAND (node, 0));
12141 /* Hand stabilize the lhs on both places */
12142 TREE_OPERAND (node, 0) = lvalue;
12143 TREE_OPERAND (TREE_OPERAND (node, 1), 0) =
12144 (flag_emit_class_files ? lvalue : save_expr (lvalue));
12146 /* 15.25.2.a: Left hand is not an array access. FIXME */
12147 /* Now complete the RHS. We write it back later on. */
12148 nn = java_complete_tree (TREE_OPERAND (node, 1));
12150 if ((cn = patch_string (nn)))
12153 /* The last part of the rewrite for E1 op= E2 is to have
12154 E1 = (T)(E1 op E2), with T being the type of E1. */
12155 nn = java_complete_tree (build_cast (EXPR_WFL_LINECOL (wfl_op2),
12156 TREE_TYPE (lvalue), nn));
12158 /* If the assignment is compound and has reference type,
12159 then ensure the LHS has type String and nothing else. */
12160 if (JREFERENCE_TYPE_P (TREE_TYPE (lvalue))
12161 && ! JSTRING_TYPE_P (TREE_TYPE (lvalue)))
12162 parse_error_context (wfl_op2,
12163 "Incompatible type for `+='. Can't convert `%s' to `java.lang.String'",
12164 lang_printable_name (TREE_TYPE (lvalue), 0));
12166 /* 15.25.2.b: Left hand is an array access. FIXME */
12169 /* If we're about to patch a NEW_ARRAY_INIT, we call a special
12170 function to complete this RHS. Note that a NEW_ARRAY_INIT
12171 might have been already fully expanded if created as a result
12172 of processing an anonymous array initializer. We avoid doing
12173 the operation twice by testing whether the node already bears
12175 else if (TREE_CODE (wfl_op2) == NEW_ARRAY_INIT && !TREE_TYPE (wfl_op2))
12176 nn = patch_new_array_init (TREE_TYPE (TREE_OPERAND (node, 0)),
12177 TREE_OPERAND (node, 1));
12178 /* Otherwise we simply complete the RHS */
12180 nn = java_complete_tree (TREE_OPERAND (node, 1));
12182 if (nn == error_mark_node)
12183 return error_mark_node;
12185 /* Write back the RHS as we evaluated it. */
12186 TREE_OPERAND (node, 1) = nn;
12188 /* In case we're handling = with a String as a RHS, we need to
12189 produce a String out of the RHS (it might still be a
12190 STRING_CST or a StringBuffer at this stage */
12191 if ((nn = patch_string (TREE_OPERAND (node, 1))))
12192 TREE_OPERAND (node, 1) = nn;
12194 if ((nn = outer_field_access_fix (wfl_op1, TREE_OPERAND (node, 0),
12195 TREE_OPERAND (node, 1))))
12197 /* We return error_mark_node if outer_field_access_fix
12198 detects we write into a final. */
12199 if (nn == error_mark_node)
12200 return error_mark_node;
12205 node = patch_assignment (node, wfl_op1);
12206 if (node == error_mark_node)
12207 return error_mark_node;
12208 /* Reorganize the tree if necessary. */
12209 if (flag && (!JREFERENCE_TYPE_P (TREE_TYPE (node))
12210 || JSTRING_P (TREE_TYPE (node))))
12211 node = java_refold (node);
12214 /* Seek to set DECL_INITIAL to a proper value, since it might have
12215 undergone a conversion in patch_assignment. We do that only when
12216 it's necessary to have DECL_INITIAL properly set. */
12217 nn = TREE_OPERAND (node, 0);
12218 if (TREE_CODE (nn) == VAR_DECL
12219 && DECL_INITIAL (nn) && CONSTANT_VALUE_P (DECL_INITIAL (nn))
12220 && FIELD_STATIC (nn) && FIELD_FINAL (nn)
12221 && (JPRIMITIVE_TYPE_P (TREE_TYPE (nn))
12222 || TREE_TYPE (nn) == string_ptr_type_node))
12223 DECL_INITIAL (nn) = TREE_OPERAND (node, 1);
12225 CAN_COMPLETE_NORMALLY (node) = 1;
12237 case TRUNC_MOD_EXPR:
12238 case TRUNC_DIV_EXPR:
12240 case TRUTH_ANDIF_EXPR:
12241 case TRUTH_ORIF_EXPR:
12248 /* Operands 0 and 1 are WFL in certain cases only. patch_binop
12249 knows how to handle those cases. */
12250 wfl_op1 = TREE_OPERAND (node, 0);
12251 wfl_op2 = TREE_OPERAND (node, 1);
12253 CAN_COMPLETE_NORMALLY (node) = 1;
12254 /* Don't complete string nodes if dealing with the PLUS operand. */
12255 if (TREE_CODE (node) != PLUS_EXPR || !JSTRING_P (wfl_op1))
12257 nn = java_complete_tree (wfl_op1);
12258 if (nn == error_mark_node)
12259 return error_mark_node;
12261 TREE_OPERAND (node, 0) = nn;
12263 if (TREE_CODE (node) != PLUS_EXPR || !JSTRING_P (wfl_op2))
12265 nn = java_complete_tree (wfl_op2);
12266 if (nn == error_mark_node)
12267 return error_mark_node;
12269 TREE_OPERAND (node, 1) = nn;
12271 return patch_binop (node, wfl_op1, wfl_op2);
12273 case INSTANCEOF_EXPR:
12274 wfl_op1 = TREE_OPERAND (node, 0);
12275 COMPLETE_CHECK_OP_0 (node);
12276 if (flag_emit_xref)
12278 TREE_TYPE (node) = boolean_type_node;
12281 return patch_binop (node, wfl_op1, TREE_OPERAND (node, 1));
12283 case UNARY_PLUS_EXPR:
12285 case TRUTH_NOT_EXPR:
12287 case PREDECREMENT_EXPR:
12288 case PREINCREMENT_EXPR:
12289 case POSTDECREMENT_EXPR:
12290 case POSTINCREMENT_EXPR:
12292 /* There are cases were wfl_op1 is a WFL. patch_unaryop knows
12293 how to handle those cases. */
12294 wfl_op1 = TREE_OPERAND (node, 0);
12295 CAN_COMPLETE_NORMALLY (node) = 1;
12296 TREE_OPERAND (node, 0) = java_complete_tree (wfl_op1);
12297 if (TREE_OPERAND (node, 0) == error_mark_node)
12298 return error_mark_node;
12299 node = patch_unaryop (node, wfl_op1);
12300 CAN_COMPLETE_NORMALLY (node) = 1;
12304 /* There are cases were wfl_op1 is a WFL. patch_array_ref knows
12305 how to handle those cases. */
12306 wfl_op1 = TREE_OPERAND (node, 0);
12307 TREE_OPERAND (node, 0) = java_complete_tree (wfl_op1);
12308 if (TREE_OPERAND (node, 0) == error_mark_node)
12309 return error_mark_node;
12310 if (!flag_emit_class_files && !flag_emit_xref)
12311 TREE_OPERAND (node, 0) = save_expr (TREE_OPERAND (node, 0));
12312 /* The same applies to wfl_op2 */
12313 wfl_op2 = TREE_OPERAND (node, 1);
12314 TREE_OPERAND (node, 1) = java_complete_tree (wfl_op2);
12315 if (TREE_OPERAND (node, 1) == error_mark_node)
12316 return error_mark_node;
12317 if (!flag_emit_class_files && !flag_emit_xref)
12318 TREE_OPERAND (node, 1) = save_expr (TREE_OPERAND (node, 1));
12319 return patch_array_ref (node);
12324 case COMPONENT_REF:
12325 /* The first step in the re-write of qualified name handling. FIXME.
12326 So far, this is only to support PRIMTYPE.class -> PRIMCLASS.TYPE. */
12327 TREE_OPERAND (node, 0) = java_complete_tree (TREE_OPERAND (node, 0));
12328 if (TREE_CODE (TREE_OPERAND (node, 0)) == RECORD_TYPE)
12330 tree name = TREE_OPERAND (node, 1);
12331 tree field = lookup_field_wrapper (TREE_OPERAND (node, 0), name);
12332 if (field == NULL_TREE)
12334 error ("missing static field `%s'", IDENTIFIER_POINTER (name));
12335 return error_mark_node;
12337 if (! FIELD_STATIC (field))
12339 error ("not a static field `%s'", IDENTIFIER_POINTER (name));
12340 return error_mark_node;
12349 /* Can't use THIS in a static environment */
12352 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
12353 parse_error_context (wfl_operator,
12354 "Keyword `this' used outside allowed context");
12355 TREE_TYPE (node) = error_mark_node;
12356 return error_mark_node;
12358 if (ctxp->explicit_constructor_p)
12360 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
12361 parse_error_context
12362 (wfl_operator, "Can't reference `this' or `super' before the superclass constructor has been called");
12363 TREE_TYPE (node) = error_mark_node;
12364 return error_mark_node;
12366 return current_this;
12368 case CLASS_LITERAL:
12369 CAN_COMPLETE_NORMALLY (node) = 1;
12370 node = patch_incomplete_class_ref (node);
12371 if (node == error_mark_node)
12372 return error_mark_node;
12376 CAN_COMPLETE_NORMALLY (node) = 1;
12377 /* Ok: may be we have a STRING_CST or a crafted `StringBuffer'
12378 and it's time to turn it into the appropriate String object */
12379 if ((nn = patch_string (node)))
12382 internal_error ("No case for %s", tree_code_name [TREE_CODE (node)]);
12387 /* Complete function call's argument. Return a nonzero value is an
12388 error was found. */
12391 complete_function_arguments (tree node)
12396 ctxp->explicit_constructor_p += (CALL_EXPLICIT_CONSTRUCTOR_P (node) ? 1 : 0);
12397 for (cn = TREE_OPERAND (node, 1); cn; cn = TREE_CHAIN (cn))
12399 tree wfl = TREE_VALUE (cn), parm, temp;
12400 parm = java_complete_tree (wfl);
12402 if (parm == error_mark_node)
12407 /* If have a string literal that we haven't transformed yet or a
12408 crafted string buffer, as a result of use of the the String
12409 `+' operator. Build `parm.toString()' and expand it. */
12410 if ((temp = patch_string (parm)))
12413 TREE_VALUE (cn) = parm;
12415 ctxp->explicit_constructor_p -= (CALL_EXPLICIT_CONSTRUCTOR_P (node) ? 1 : 0);
12419 /* Sometimes (for loops and variable initialized during their
12420 declaration), we want to wrap a statement around a WFL and turn it
12424 build_debugable_stmt (int location, tree stmt)
12426 if (TREE_CODE (stmt) != EXPR_WITH_FILE_LOCATION)
12428 stmt = build_expr_wfl (stmt, input_filename, 0, 0);
12429 EXPR_WFL_LINECOL (stmt) = location;
12431 JAVA_MAYBE_GENERATE_DEBUG_INFO (stmt);
12436 build_expr_block (tree body, tree decls)
12439 tree node = make_node (BLOCK);
12440 BLOCK_EXPR_DECLS (node) = decls;
12441 BLOCK_EXPR_BODY (node) = body;
12443 TREE_TYPE (node) = TREE_TYPE (body);
12444 TREE_SIDE_EFFECTS (node) = 1;
12448 /* Create a new function block and link it appropriately to current
12449 function block chain */
12454 tree b = build_expr_block (NULL_TREE, NULL_TREE);
12456 /* Link block B supercontext to the previous block. The current
12457 function DECL is used as supercontext when enter_a_block is called
12458 for the first time for a given function. The current function body
12459 (DECL_FUNCTION_BODY) is set to be block B. */
12461 tree fndecl = current_function_decl;
12464 BLOCK_SUPERCONTEXT (b) = current_static_block;
12465 current_static_block = b;
12468 else if (!DECL_FUNCTION_BODY (fndecl))
12470 BLOCK_SUPERCONTEXT (b) = fndecl;
12471 DECL_FUNCTION_BODY (fndecl) = b;
12475 BLOCK_SUPERCONTEXT (b) = DECL_FUNCTION_BODY (fndecl);
12476 DECL_FUNCTION_BODY (fndecl) = b;
12481 /* Exit a block by changing the current function body
12482 (DECL_FUNCTION_BODY) to the current block super context, only if
12483 the block being exited isn't the method's top level one. */
12489 if (current_function_decl)
12491 b = DECL_FUNCTION_BODY (current_function_decl);
12492 if (BLOCK_SUPERCONTEXT (b) != current_function_decl)
12493 DECL_FUNCTION_BODY (current_function_decl) = BLOCK_SUPERCONTEXT (b);
12497 b = current_static_block;
12499 if (BLOCK_SUPERCONTEXT (b))
12500 current_static_block = BLOCK_SUPERCONTEXT (b);
12505 /* Lookup for NAME in the nested function's blocks, all the way up to
12506 the current toplevel one. It complies with Java's local variable
12510 lookup_name_in_blocks (tree name)
12512 tree b = GET_CURRENT_BLOCK (current_function_decl);
12514 while (b != current_function_decl)
12518 /* Paranoid sanity check. To be removed */
12519 if (TREE_CODE (b) != BLOCK)
12522 for (current = BLOCK_EXPR_DECLS (b); current;
12523 current = TREE_CHAIN (current))
12524 if (DECL_NAME (current) == name)
12526 b = BLOCK_SUPERCONTEXT (b);
12532 maybe_absorb_scoping_blocks (void)
12534 while (BLOCK_IS_IMPLICIT (GET_CURRENT_BLOCK (current_function_decl)))
12536 tree b = exit_block ();
12537 java_method_add_stmt (current_function_decl, b);
12538 SOURCE_FRONTEND_DEBUG (("Absorbing scoping block at line %d", input_line));
12543 /* This section of the source is reserved to build_* functions that
12544 are building incomplete tree nodes and the patch_* functions that
12545 are completing them. */
12547 /* Wrap a non WFL node around a WFL. */
12550 build_wfl_wrap (tree node, int location)
12552 tree wfl, node_to_insert = node;
12554 /* We want to process THIS . xxx symbolically, to keep it consistent
12555 with the way we're processing SUPER. A THIS from a primary as a
12556 different form than a SUPER. Turn THIS into something symbolic */
12557 if (TREE_CODE (node) == THIS_EXPR)
12558 node_to_insert = wfl = build_wfl_node (this_identifier_node);
12560 wfl = build_expr_wfl (NULL_TREE, ctxp->filename, 0, 0);
12562 EXPR_WFL_LINECOL (wfl) = location;
12563 EXPR_WFL_QUALIFICATION (wfl) = build_tree_list (node_to_insert, NULL_TREE);
12567 /* Build a super() constructor invocation. Returns empty_stmt_node if
12568 we're currently dealing with the class java.lang.Object. */
12571 build_super_invocation (tree mdecl)
12573 if (DECL_CONTEXT (mdecl) == object_type_node)
12574 return empty_stmt_node;
12577 tree super_wfl = build_wfl_node (super_identifier_node);
12578 tree a = NULL_TREE, t;
12579 /* If we're dealing with an anonymous class, pass the arguments
12580 of the crafted constructor along. */
12581 if (ANONYMOUS_CLASS_P (DECL_CONTEXT (mdecl)))
12583 SKIP_THIS_AND_ARTIFICIAL_PARMS (t, mdecl);
12584 for (; t != end_params_node; t = TREE_CHAIN (t))
12585 a = tree_cons (NULL_TREE, build_wfl_node (TREE_PURPOSE (t)), a);
12587 return build_method_invocation (super_wfl, a);
12591 /* Build a SUPER/THIS qualified method invocation. */
12594 build_this_super_qualified_invocation (int use_this, tree name, tree args,
12595 int lloc, int rloc)
12599 build_wfl_node (use_this ? this_identifier_node : super_identifier_node);
12600 EXPR_WFL_LINECOL (wfl) = lloc;
12601 invok = build_method_invocation (name, args);
12602 return make_qualified_primary (wfl, invok, rloc);
12605 /* Build an incomplete CALL_EXPR node. */
12608 build_method_invocation (tree name, tree args)
12610 tree call = build (CALL_EXPR, NULL_TREE, name, args, NULL_TREE);
12611 TREE_SIDE_EFFECTS (call) = 1;
12612 EXPR_WFL_LINECOL (call) = EXPR_WFL_LINECOL (name);
12616 /* Build an incomplete new xxx(...) node. */
12619 build_new_invocation (tree name, tree args)
12621 tree call = build (NEW_CLASS_EXPR, NULL_TREE, name, args, NULL_TREE);
12622 TREE_SIDE_EFFECTS (call) = 1;
12623 EXPR_WFL_LINECOL (call) = EXPR_WFL_LINECOL (name);
12627 /* Build an incomplete assignment expression. */
12630 build_assignment (int op, int op_location, tree lhs, tree rhs)
12633 /* Build the corresponding binop if we deal with a Compound
12634 Assignment operator. Mark the binop sub-tree as part of a
12635 Compound Assignment expression */
12636 if (op != ASSIGN_TK)
12638 rhs = build_binop (BINOP_LOOKUP (op), op_location, lhs, rhs);
12639 COMPOUND_ASSIGN_P (rhs) = 1;
12641 assignment = build (MODIFY_EXPR, NULL_TREE, lhs, rhs);
12642 TREE_SIDE_EFFECTS (assignment) = 1;
12643 EXPR_WFL_LINECOL (assignment) = op_location;
12647 /* Print an INTEGER_CST node as decimal in a static buffer, and return
12648 the buffer. This is used only for string conversion. */
12650 string_convert_int_cst (tree node)
12652 /* Long.MIN_VALUE is -9223372036854775808, 20 characters. */
12653 static char buffer[21];
12655 unsigned HOST_WIDE_INT lo = TREE_INT_CST_LOW (node);
12656 unsigned HOST_WIDE_INT hi = TREE_INT_CST_HIGH (node);
12657 char *p = buffer + sizeof (buffer);
12660 unsigned HOST_WIDE_INT hibit = (((unsigned HOST_WIDE_INT) 1)
12661 << (HOST_BITS_PER_WIDE_INT - 1));
12665 /* If negative, note the fact and negate the value. */
12675 /* Divide by 10 until there are no bits left. */
12678 unsigned HOST_WIDE_INT acc = 0;
12679 unsigned HOST_WIDE_INT outhi = 0, outlo = 0;
12682 /* Use long division to compute the result and the remainder. */
12683 for (i = 0; i < 2 * HOST_BITS_PER_WIDE_INT; ++i)
12685 /* Shift a bit into accumulator. */
12690 /* Shift the value. */
12696 /* Shift the correct bit into the result. */
12698 if ((outlo & hibit))
12708 /* '0' == 060 in Java, but might not be here (think EBCDIC). */
12709 *--p = '\060' + acc;
12717 *--p = '\055'; /* '-' == 055 in Java, but might not be here. */
12722 /* Print an INTEGER_CST node in a static buffer, and return the
12723 buffer. This is used only for error handling. */
12725 print_int_node (tree node)
12727 static char buffer [80];
12728 if (TREE_CONSTANT_OVERFLOW (node))
12729 sprintf (buffer, "<overflow>");
12731 if (TREE_INT_CST_HIGH (node) == 0)
12732 sprintf (buffer, HOST_WIDE_INT_PRINT_UNSIGNED,
12733 TREE_INT_CST_LOW (node));
12734 else if (TREE_INT_CST_HIGH (node) == -1
12735 && TREE_INT_CST_LOW (node) != 0)
12736 sprintf (buffer, "-" HOST_WIDE_INT_PRINT_UNSIGNED,
12737 -TREE_INT_CST_LOW (node));
12739 sprintf (buffer, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
12740 TREE_INT_CST_HIGH (node), TREE_INT_CST_LOW (node));
12746 /* Return 1 if an assignment to a FINAL is attempted in a non suitable
12749 /* 15.25 Assignment operators. */
12752 patch_assignment (tree node, tree wfl_op1)
12754 tree rhs = TREE_OPERAND (node, 1);
12755 tree lvalue = TREE_OPERAND (node, 0), llvalue;
12756 tree lhs_type = NULL_TREE, rhs_type, new_rhs = NULL_TREE;
12757 int error_found = 0;
12758 int lvalue_from_array = 0;
12761 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
12763 /* Lhs can be a named variable */
12764 if (JDECL_P (lvalue))
12766 lhs_type = TREE_TYPE (lvalue);
12768 /* Or Lhs can be an array access. */
12769 else if (TREE_CODE (lvalue) == ARRAY_REF)
12771 lhs_type = TREE_TYPE (lvalue);
12772 lvalue_from_array = 1;
12774 /* Or a field access */
12775 else if (TREE_CODE (lvalue) == COMPONENT_REF)
12776 lhs_type = TREE_TYPE (lvalue);
12777 /* Or a function return slot */
12778 else if (TREE_CODE (lvalue) == RESULT_DECL)
12780 /* If the return type is an integral type, then we create the
12781 RESULT_DECL with a promoted type, but we need to do these
12782 checks against the unpromoted type to ensure type safety. So
12783 here we look at the real type, not the type of the decl we
12785 lhs_type = TREE_TYPE (TREE_TYPE (current_function_decl));
12788 /* Otherwise, we might want to try to write into an optimized static
12789 final, this is an of a different nature, reported further on. */
12790 else if (TREE_CODE (wfl_op1) == EXPR_WITH_FILE_LOCATION
12791 && resolve_expression_name (wfl_op1, &llvalue))
12793 lhs_type = TREE_TYPE (lvalue);
12797 parse_error_context (wfl_op1, "Invalid left hand side of assignment");
12801 rhs_type = TREE_TYPE (rhs);
12803 /* 5.1 Try the assignment conversion for builtin type. */
12804 new_rhs = try_builtin_assignconv (wfl_op1, lhs_type, rhs);
12806 /* 5.2 If it failed, try a reference conversion */
12807 if (!new_rhs && (new_rhs = try_reference_assignconv (lhs_type, rhs)))
12808 lhs_type = promote_type (rhs_type);
12810 /* 15.25.2 If we have a compound assignment, convert RHS into the
12812 else if (COMPOUND_ASSIGN_P (TREE_OPERAND (node, 1)))
12813 new_rhs = convert (lhs_type, rhs);
12815 /* Explicit cast required. This is an error */
12818 char *t1 = xstrdup (lang_printable_name (TREE_TYPE (rhs), 0));
12819 char *t2 = xstrdup (lang_printable_name (lhs_type, 0));
12821 char operation [32]; /* Max size known */
12823 /* If the assignment is part of a declaration, we use the WFL of
12824 the declared variable to point out the error and call it a
12825 declaration problem. If the assignment is a genuine =
12826 operator, we call is a operator `=' problem, otherwise we
12827 call it an assignment problem. In both of these last cases,
12828 we use the WFL of the operator to indicate the error. */
12830 if (MODIFY_EXPR_FROM_INITIALIZATION_P (node))
12833 strcpy (operation, "declaration");
12837 wfl = wfl_operator;
12838 if (COMPOUND_ASSIGN_P (TREE_OPERAND (node, 1)))
12839 strcpy (operation, "assignment");
12840 else if (is_return)
12841 strcpy (operation, "`return'");
12843 strcpy (operation, "`='");
12846 if (!valid_cast_to_p (rhs_type, lhs_type))
12847 parse_error_context
12848 (wfl, "Incompatible type for %s. Can't convert `%s' to `%s'",
12849 operation, t1, t2);
12851 parse_error_context (wfl, "Incompatible type for %s. Explicit cast needed to convert `%s' to `%s'",
12852 operation, t1, t2);
12853 free (t1); free (t2);
12858 return error_mark_node;
12860 /* If we're processing a `return' statement, promote the actual type
12861 to the promoted type. */
12863 new_rhs = convert (TREE_TYPE (lvalue), new_rhs);
12865 /* 10.10: Array Store Exception runtime check */
12866 if (!flag_emit_class_files
12868 && lvalue_from_array
12869 && JREFERENCE_TYPE_P (TYPE_ARRAY_ELEMENT (lhs_type)))
12871 tree array, store_check, base, index_expr;
12873 /* Save RHS so that it doesn't get re-evaluated by the store check. */
12874 new_rhs = save_expr (new_rhs);
12876 /* Get the INDIRECT_REF. */
12877 array = TREE_OPERAND (TREE_OPERAND (lvalue, 0), 0);
12878 /* Get the array pointer expr. */
12879 array = TREE_OPERAND (array, 0);
12880 store_check = build_java_arraystore_check (array, new_rhs);
12882 index_expr = TREE_OPERAND (lvalue, 1);
12884 if (TREE_CODE (index_expr) == COMPOUND_EXPR)
12886 /* A COMPOUND_EXPR here is a bounds check. The bounds check must
12887 happen before the store check, so prepare to insert the store
12888 check within the second operand of the existing COMPOUND_EXPR. */
12894 index_expr = TREE_OPERAND (base, 1);
12895 TREE_OPERAND (base, 1) = build (COMPOUND_EXPR, TREE_TYPE (index_expr),
12896 store_check, index_expr);
12899 /* Final locals can be used as case values in switch
12900 statement. Prepare them for this eventuality. */
12901 if (TREE_CODE (lvalue) == VAR_DECL
12902 && DECL_FINAL (lvalue)
12903 && TREE_CONSTANT (new_rhs)
12904 && IDENTIFIER_LOCAL_VALUE (DECL_NAME (lvalue))
12905 && JINTEGRAL_TYPE_P (TREE_TYPE (lvalue))
12908 TREE_CONSTANT (lvalue) = 1;
12909 DECL_INITIAL (lvalue) = new_rhs;
12912 /* Copy the rhs if it's a reference. */
12913 if (! flag_check_references && ! flag_emit_class_files && optimize > 0)
12915 switch (TREE_CODE (new_rhs))
12919 case COMPONENT_REF:
12920 /* Transform a = foo.bar
12921 into a = { int tmp; tmp = foo.bar; tmp; ).
12922 We need to ensure that if a read from memory fails
12923 because of a NullPointerException, a destination variable
12924 will remain unchanged. An explicit temporary does what
12927 If flag_check_references is set, this is unnecessary
12928 because we'll check each reference before doing any
12929 reads. If optimize is not set the result will never be
12930 written to a stack slot that contains the LHS. */
12932 tree tmp = build_decl (VAR_DECL, get_identifier ("<tmp>"),
12933 TREE_TYPE (new_rhs));
12934 tree block = make_node (BLOCK);
12936 = build (MODIFY_EXPR, TREE_TYPE (new_rhs), tmp, fold (new_rhs));
12937 DECL_CONTEXT (tmp) = current_function_decl;
12938 TREE_TYPE (block) = TREE_TYPE (new_rhs);
12939 BLOCK_VARS (block) = tmp;
12940 BLOCK_EXPR_BODY (block)
12941 = build (COMPOUND_EXPR, TREE_TYPE (new_rhs), assignment, tmp);
12942 TREE_SIDE_EFFECTS (block) = 1;
12951 TREE_OPERAND (node, 0) = lvalue;
12952 TREE_OPERAND (node, 1) = new_rhs;
12953 TREE_TYPE (node) = lhs_type;
12957 /* Check that type SOURCE can be cast into type DEST. If the cast
12958 can't occur at all, return NULL; otherwise, return a possibly
12962 try_reference_assignconv (tree lhs_type, tree rhs)
12964 tree new_rhs = NULL_TREE;
12965 tree rhs_type = TREE_TYPE (rhs);
12967 if (!JPRIMITIVE_TYPE_P (rhs_type) && JREFERENCE_TYPE_P (lhs_type))
12969 /* `null' may be assigned to any reference type */
12970 if (rhs == null_pointer_node)
12971 new_rhs = null_pointer_node;
12972 /* Try the reference assignment conversion */
12973 else if (valid_ref_assignconv_cast_p (rhs_type, lhs_type, 0))
12975 /* This is a magic assignment that we process differently */
12976 else if (TREE_CODE (rhs) == JAVA_EXC_OBJ_EXPR)
12982 /* Check that RHS can be converted into LHS_TYPE by the assignment
12983 conversion (5.2), for the cases of RHS being a builtin type. Return
12984 NULL_TREE if the conversion fails or if because RHS isn't of a
12985 builtin type. Return a converted RHS if the conversion is possible. */
12988 try_builtin_assignconv (tree wfl_op1, tree lhs_type, tree rhs)
12990 tree new_rhs = NULL_TREE;
12991 tree rhs_type = TREE_TYPE (rhs);
12993 /* Handle boolean specially. */
12994 if (TREE_CODE (rhs_type) == BOOLEAN_TYPE
12995 || TREE_CODE (lhs_type) == BOOLEAN_TYPE)
12997 if (TREE_CODE (rhs_type) == BOOLEAN_TYPE
12998 && TREE_CODE (lhs_type) == BOOLEAN_TYPE)
13002 /* 5.1.1 Try Identity Conversion,
13003 5.1.2 Try Widening Primitive Conversion */
13004 else if (valid_builtin_assignconv_identity_widening_p (lhs_type, rhs_type))
13005 new_rhs = convert (lhs_type, rhs);
13007 /* Try a narrowing primitive conversion (5.1.3):
13008 - expression is a constant expression of type byte, short, char,
13010 - variable is byte, short or char AND
13011 - The value of the expression is representable in the type of the
13013 else if ((rhs_type == byte_type_node || rhs_type == short_type_node
13014 || rhs_type == char_type_node || rhs_type == int_type_node)
13015 && TREE_CONSTANT (rhs)
13016 && (lhs_type == byte_type_node || lhs_type == char_type_node
13017 || lhs_type == short_type_node))
13019 if (int_fits_type_p (rhs, lhs_type))
13020 new_rhs = convert (lhs_type, rhs);
13021 else if (wfl_op1) /* Might be called with a NULL */
13022 parse_warning_context
13023 (wfl_op1, "Constant expression `%s' too wide for narrowing primitive conversion to `%s'",
13024 print_int_node (rhs), lang_printable_name (lhs_type, 0));
13025 /* Reported a warning that will turn into an error further
13026 down, so we don't return */
13032 /* Return 1 if RHS_TYPE can be converted to LHS_TYPE by identity
13033 conversion (5.1.1) or widening primitive conversion (5.1.2). Return
13034 0 is the conversion test fails. This implements parts the method
13035 invocation conversion (5.3). */
13038 valid_builtin_assignconv_identity_widening_p (tree lhs_type, tree rhs_type)
13040 /* 5.1.1: This is the identity conversion part. */
13041 if (lhs_type == rhs_type)
13044 /* Reject non primitive types and boolean conversions. */
13045 if (!JNUMERIC_TYPE_P (lhs_type) || !JNUMERIC_TYPE_P (rhs_type))
13048 /* 5.1.2: widening primitive conversion. byte, even if it's smaller
13049 than a char can't be converted into a char. Short can't too, but
13050 the < test below takes care of that */
13051 if (lhs_type == char_type_node && rhs_type == byte_type_node)
13054 /* Accept all promoted type here. Note, we can't use <= in the test
13055 below, because we still need to bounce out assignments of short
13056 to char and the likes */
13057 if (lhs_type == int_type_node
13058 && (rhs_type == promoted_byte_type_node
13059 || rhs_type == promoted_short_type_node
13060 || rhs_type == promoted_char_type_node
13061 || rhs_type == promoted_boolean_type_node))
13064 /* From here, an integral is widened if its precision is smaller
13065 than the precision of the LHS or if the LHS is a floating point
13066 type, or the RHS is a float and the RHS a double. */
13067 if ((JINTEGRAL_TYPE_P (rhs_type) && JINTEGRAL_TYPE_P (lhs_type)
13068 && (TYPE_PRECISION (rhs_type) < TYPE_PRECISION (lhs_type)))
13069 || (JINTEGRAL_TYPE_P (rhs_type) && JFLOAT_TYPE_P (lhs_type))
13070 || (rhs_type == float_type_node && lhs_type == double_type_node))
13076 /* Check that something of SOURCE type can be assigned or cast to
13077 something of DEST type at runtime. Return 1 if the operation is
13078 valid, 0 otherwise. If CAST is set to 1, we're treating the case
13079 were SOURCE is cast into DEST, which borrows a lot of the
13080 assignment check. */
13083 valid_ref_assignconv_cast_p (tree source, tree dest, int cast)
13085 /* SOURCE or DEST might be null if not from a declared entity. */
13086 if (!source || !dest)
13088 if (JNULLP_TYPE_P (source))
13090 if (TREE_CODE (source) == POINTER_TYPE)
13091 source = TREE_TYPE (source);
13092 if (TREE_CODE (dest) == POINTER_TYPE)
13093 dest = TREE_TYPE (dest);
13095 /* If source and dest are being compiled from bytecode, they may need to
13097 if (CLASS_P (source) && !CLASS_LOADED_P (source))
13099 load_class (source, 1);
13100 safe_layout_class (source);
13102 if (CLASS_P (dest) && !CLASS_LOADED_P (dest))
13104 load_class (dest, 1);
13105 safe_layout_class (dest);
13108 /* Case where SOURCE is a class type */
13109 if (TYPE_CLASS_P (source))
13111 if (TYPE_CLASS_P (dest))
13112 return (source == dest
13113 || inherits_from_p (source, dest)
13114 || (cast && inherits_from_p (dest, source)));
13115 if (TYPE_INTERFACE_P (dest))
13117 /* If doing a cast and SOURCE is final, the operation is
13118 always correct a compile time (because even if SOURCE
13119 does not implement DEST, a subclass of SOURCE might). */
13120 if (cast && !CLASS_FINAL (TYPE_NAME (source)))
13122 /* Otherwise, SOURCE must implement DEST */
13123 return interface_of_p (dest, source);
13125 /* DEST is an array, cast permitted if SOURCE is of Object type */
13126 return (cast && source == object_type_node ? 1 : 0);
13128 if (TYPE_INTERFACE_P (source))
13130 if (TYPE_CLASS_P (dest))
13132 /* If not casting, DEST must be the Object type */
13134 return dest == object_type_node;
13135 /* We're doing a cast. The cast is always valid is class
13136 DEST is not final, otherwise, DEST must implement SOURCE */
13137 else if (!CLASS_FINAL (TYPE_NAME (dest)))
13140 return interface_of_p (source, dest);
13142 if (TYPE_INTERFACE_P (dest))
13144 /* If doing a cast, then if SOURCE and DEST contain method
13145 with the same signature but different return type, then
13146 this is a (compile time) error */
13149 tree method_source, method_dest;
13153 for (method_source = TYPE_METHODS (source); method_source;
13154 method_source = TREE_CHAIN (method_source))
13157 build_java_argument_signature (TREE_TYPE (method_source));
13158 source_type = TREE_TYPE (TREE_TYPE (method_source));
13159 source_name = DECL_NAME (method_source);
13160 for (method_dest = TYPE_METHODS (dest);
13161 method_dest; method_dest = TREE_CHAIN (method_dest))
13163 build_java_argument_signature (TREE_TYPE (method_dest))
13164 && source_name == DECL_NAME (method_dest)
13165 && source_type != TREE_TYPE (TREE_TYPE (method_dest)))
13171 return source == dest || interface_of_p (dest, source);
13177 && (DECL_NAME (TYPE_NAME (source))
13178 == java_lang_cloneable_identifier_node
13179 || (DECL_NAME (TYPE_NAME (source))
13180 == java_io_serializable_identifier_node)));
13183 if (TYPE_ARRAY_P (source))
13185 if (TYPE_CLASS_P (dest))
13186 return dest == object_type_node;
13187 /* Can't cast an array to an interface unless the interface is
13188 java.lang.Cloneable or java.io.Serializable. */
13189 if (TYPE_INTERFACE_P (dest))
13190 return (DECL_NAME (TYPE_NAME (dest))
13191 == java_lang_cloneable_identifier_node
13192 || (DECL_NAME (TYPE_NAME (dest))
13193 == java_io_serializable_identifier_node));
13196 tree source_element_type = TYPE_ARRAY_ELEMENT (source);
13197 tree dest_element_type = TYPE_ARRAY_ELEMENT (dest);
13199 /* In case of severe errors, they turn out null */
13200 if (!dest_element_type || !source_element_type)
13202 if (source_element_type == dest_element_type)
13204 return valid_ref_assignconv_cast_p (source_element_type,
13205 dest_element_type, cast);
13213 valid_cast_to_p (tree source, tree dest)
13215 if (TREE_CODE (source) == POINTER_TYPE)
13216 source = TREE_TYPE (source);
13217 if (TREE_CODE (dest) == POINTER_TYPE)
13218 dest = TREE_TYPE (dest);
13220 if (TREE_CODE (source) == RECORD_TYPE && TREE_CODE (dest) == RECORD_TYPE)
13221 return valid_ref_assignconv_cast_p (source, dest, 1);
13223 else if (JNUMERIC_TYPE_P (source) && JNUMERIC_TYPE_P (dest))
13226 else if (TREE_CODE (source) == BOOLEAN_TYPE
13227 && TREE_CODE (dest) == BOOLEAN_TYPE)
13234 do_unary_numeric_promotion (tree arg)
13236 tree type = TREE_TYPE (arg);
13237 if ((TREE_CODE (type) == INTEGER_TYPE && TYPE_PRECISION (type) < 32)
13238 || TREE_CODE (type) == CHAR_TYPE)
13239 arg = convert (int_type_node, arg);
13243 /* Return a nonzero value if SOURCE can be converted into DEST using
13244 the method invocation conversion rule (5.3). */
13246 valid_method_invocation_conversion_p (tree dest, tree source)
13248 return ((JPRIMITIVE_TYPE_P (source) && JPRIMITIVE_TYPE_P (dest)
13249 && valid_builtin_assignconv_identity_widening_p (dest, source))
13250 || ((JREFERENCE_TYPE_P (source) || JNULLP_TYPE_P (source))
13251 && (JREFERENCE_TYPE_P (dest) || JNULLP_TYPE_P (dest))
13252 && valid_ref_assignconv_cast_p (source, dest, 0)));
13255 /* Build an incomplete binop expression. */
13258 build_binop (enum tree_code op, int op_location, tree op1, tree op2)
13260 tree binop = build (op, NULL_TREE, op1, op2);
13261 TREE_SIDE_EFFECTS (binop) = 1;
13262 /* Store the location of the operator, for better error report. The
13263 string of the operator will be rebuild based on the OP value. */
13264 EXPR_WFL_LINECOL (binop) = op_location;
13268 /* Build the string of the operator retained by NODE. If NODE is part
13269 of a compound expression, add an '=' at the end of the string. This
13270 function is called when an error needs to be reported on an
13271 operator. The string is returned as a pointer to a static character
13275 operator_string (tree node)
13277 #define BUILD_OPERATOR_STRING(S) \
13279 sprintf (buffer, "%s%s", S, (COMPOUND_ASSIGN_P (node) ? "=" : "")); \
13283 static char buffer [10];
13284 switch (TREE_CODE (node))
13286 case MULT_EXPR: BUILD_OPERATOR_STRING ("*");
13287 case RDIV_EXPR: BUILD_OPERATOR_STRING ("/");
13288 case TRUNC_MOD_EXPR: BUILD_OPERATOR_STRING ("%");
13289 case PLUS_EXPR: BUILD_OPERATOR_STRING ("+");
13290 case MINUS_EXPR: BUILD_OPERATOR_STRING ("-");
13291 case LSHIFT_EXPR: BUILD_OPERATOR_STRING ("<<");
13292 case RSHIFT_EXPR: BUILD_OPERATOR_STRING (">>");
13293 case URSHIFT_EXPR: BUILD_OPERATOR_STRING (">>>");
13294 case BIT_AND_EXPR: BUILD_OPERATOR_STRING ("&");
13295 case BIT_XOR_EXPR: BUILD_OPERATOR_STRING ("^");
13296 case BIT_IOR_EXPR: BUILD_OPERATOR_STRING ("|");
13297 case TRUTH_ANDIF_EXPR: BUILD_OPERATOR_STRING ("&&");
13298 case TRUTH_ORIF_EXPR: BUILD_OPERATOR_STRING ("||");
13299 case EQ_EXPR: BUILD_OPERATOR_STRING ("==");
13300 case NE_EXPR: BUILD_OPERATOR_STRING ("!=");
13301 case GT_EXPR: BUILD_OPERATOR_STRING (">");
13302 case GE_EXPR: BUILD_OPERATOR_STRING (">=");
13303 case LT_EXPR: BUILD_OPERATOR_STRING ("<");
13304 case LE_EXPR: BUILD_OPERATOR_STRING ("<=");
13305 case UNARY_PLUS_EXPR: BUILD_OPERATOR_STRING ("+");
13306 case NEGATE_EXPR: BUILD_OPERATOR_STRING ("-");
13307 case TRUTH_NOT_EXPR: BUILD_OPERATOR_STRING ("!");
13308 case BIT_NOT_EXPR: BUILD_OPERATOR_STRING ("~");
13309 case PREINCREMENT_EXPR: /* Fall through */
13310 case POSTINCREMENT_EXPR: BUILD_OPERATOR_STRING ("++");
13311 case PREDECREMENT_EXPR: /* Fall through */
13312 case POSTDECREMENT_EXPR: BUILD_OPERATOR_STRING ("--");
13314 internal_error ("unregistered operator %s",
13315 tree_code_name [TREE_CODE (node)]);
13318 #undef BUILD_OPERATOR_STRING
13321 /* Return 1 if VAR_ACCESS1 is equivalent to VAR_ACCESS2. */
13324 java_decl_equiv (tree var_acc1, tree var_acc2)
13326 if (JDECL_P (var_acc1))
13327 return (var_acc1 == var_acc2);
13329 return (TREE_CODE (var_acc1) == COMPONENT_REF
13330 && TREE_CODE (var_acc2) == COMPONENT_REF
13331 && TREE_OPERAND (TREE_OPERAND (var_acc1, 0), 0)
13332 == TREE_OPERAND (TREE_OPERAND (var_acc2, 0), 0)
13333 && TREE_OPERAND (var_acc1, 1) == TREE_OPERAND (var_acc2, 1));
13336 /* Return a nonzero value if CODE is one of the operators that can be
13337 used in conjunction with the `=' operator in a compound assignment. */
13340 binop_compound_p (enum tree_code code)
13343 for (i = 0; i < BINOP_COMPOUND_CANDIDATES; i++)
13344 if (binop_lookup [i] == code)
13347 return i < BINOP_COMPOUND_CANDIDATES;
13350 /* Reorganize after a fold to get SAVE_EXPR to generate what we want. */
13353 java_refold (tree t)
13355 tree c, b, ns, decl;
13357 if (TREE_CODE (t) != MODIFY_EXPR)
13360 c = TREE_OPERAND (t, 1);
13361 if (! (c && TREE_CODE (c) == COMPOUND_EXPR
13362 && TREE_CODE (TREE_OPERAND (c, 0)) == MODIFY_EXPR
13363 && binop_compound_p (TREE_CODE (TREE_OPERAND (c, 1)))))
13366 /* Now the left branch of the binary operator. */
13367 b = TREE_OPERAND (TREE_OPERAND (c, 1), 0);
13368 if (! (b && TREE_CODE (b) == NOP_EXPR
13369 && TREE_CODE (TREE_OPERAND (b, 0)) == SAVE_EXPR))
13372 ns = TREE_OPERAND (TREE_OPERAND (b, 0), 0);
13373 if (! (ns && TREE_CODE (ns) == NOP_EXPR
13374 && TREE_CODE (TREE_OPERAND (ns, 0)) == SAVE_EXPR))
13377 decl = TREE_OPERAND (TREE_OPERAND (ns, 0), 0);
13378 if ((JDECL_P (decl) || TREE_CODE (decl) == COMPONENT_REF)
13379 /* It's got to be the an equivalent decl */
13380 && java_decl_equiv (decl, TREE_OPERAND (TREE_OPERAND (c, 0), 0)))
13382 /* Shorten the NOP_EXPR/SAVE_EXPR path. */
13383 TREE_OPERAND (TREE_OPERAND (c, 1), 0) = TREE_OPERAND (ns, 0);
13384 /* Substitute the COMPOUND_EXPR by the BINOP_EXPR */
13385 TREE_OPERAND (t, 1) = TREE_OPERAND (c, 1);
13386 /* Change the right part of the BINOP_EXPR */
13387 TREE_OPERAND (TREE_OPERAND (t, 1), 1) = TREE_OPERAND (c, 0);
13393 /* Binary operators (15.16 up to 15.18). We return error_mark_node on
13394 errors but we modify NODE so that it contains the type computed
13395 according to the expression, when it's fixed. Otherwise, we write
13396 error_mark_node as the type. It allows us to further the analysis
13397 of remaining nodes and detects more errors in certain cases. */
13400 patch_binop (tree node, tree wfl_op1, tree wfl_op2)
13402 tree op1 = TREE_OPERAND (node, 0);
13403 tree op2 = TREE_OPERAND (node, 1);
13404 tree op1_type = TREE_TYPE (op1);
13405 tree op2_type = TREE_TYPE (op2);
13406 tree prom_type = NULL_TREE, cn;
13407 enum tree_code code = TREE_CODE (node);
13409 /* If 1, tell the routine that we have to return error_mark_node
13410 after checking for the initialization of the RHS */
13411 int error_found = 0;
13413 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
13415 /* If either op<n>_type are NULL, this might be early signs of an
13416 error situation, unless it's too early to tell (in case we're
13417 handling a `+', `==', `!=' or `instanceof'.) We want to set op<n>_type
13418 correctly so the error can be later on reported accurately. */
13419 if (! (code == PLUS_EXPR || code == NE_EXPR
13420 || code == EQ_EXPR || code == INSTANCEOF_EXPR))
13425 n = java_complete_tree (op1);
13426 op1_type = TREE_TYPE (n);
13430 n = java_complete_tree (op2);
13431 op2_type = TREE_TYPE (n);
13437 /* 15.16 Multiplicative operators */
13438 case MULT_EXPR: /* 15.16.1 Multiplication Operator * */
13439 case RDIV_EXPR: /* 15.16.2 Division Operator / */
13440 case TRUNC_DIV_EXPR: /* 15.16.2 Integral type Division Operator / */
13441 case TRUNC_MOD_EXPR: /* 15.16.3 Remainder operator % */
13442 if (!JNUMERIC_TYPE_P (op1_type) || !JNUMERIC_TYPE_P (op2_type))
13444 if (!JNUMERIC_TYPE_P (op1_type))
13445 ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op1_type);
13446 if (!JNUMERIC_TYPE_P (op2_type) && (op1_type != op2_type))
13447 ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op2_type);
13448 TREE_TYPE (node) = error_mark_node;
13452 prom_type = binary_numeric_promotion (op1_type, op2_type, &op1, &op2);
13454 /* Detect integral division by zero */
13455 if ((code == RDIV_EXPR || code == TRUNC_MOD_EXPR)
13456 && TREE_CODE (prom_type) == INTEGER_TYPE
13457 && (op2 == integer_zero_node || op2 == long_zero_node ||
13458 (TREE_CODE (op2) == INTEGER_CST &&
13459 ! TREE_INT_CST_LOW (op2) && ! TREE_INT_CST_HIGH (op2))))
13461 parse_warning_context (wfl_operator, "Evaluating this expression will result in an arithmetic exception being thrown");
13462 TREE_CONSTANT (node) = 0;
13465 /* Change the division operator if necessary */
13466 if (code == RDIV_EXPR && TREE_CODE (prom_type) == INTEGER_TYPE)
13467 TREE_SET_CODE (node, TRUNC_DIV_EXPR);
13469 /* Before divisions as is disappear, try to simplify and bail if
13470 applicable, otherwise we won't perform even simple
13471 simplifications like (1-1)/3. We can't do that with floating
13472 point number, folds can't handle them at this stage. */
13473 if (code == RDIV_EXPR && TREE_CONSTANT (op1) && TREE_CONSTANT (op2)
13474 && JINTEGRAL_TYPE_P (op1) && JINTEGRAL_TYPE_P (op2))
13476 TREE_TYPE (node) = prom_type;
13477 node = fold (node);
13478 if (TREE_CODE (node) != code)
13482 if (TREE_CODE (prom_type) == INTEGER_TYPE
13483 && flag_use_divide_subroutine
13484 && ! flag_emit_class_files
13485 && (code == RDIV_EXPR || code == TRUNC_MOD_EXPR))
13486 return build_java_soft_divmod (TREE_CODE (node), prom_type, op1, op2);
13488 /* This one is more complicated. FLOATs are processed by a
13489 function call to soft_fmod. Duplicate the value of the
13490 COMPOUND_ASSIGN_P flag. */
13491 if (code == TRUNC_MOD_EXPR)
13493 tree mod = build_java_binop (TRUNC_MOD_EXPR, prom_type, op1, op2);
13494 COMPOUND_ASSIGN_P (mod) = COMPOUND_ASSIGN_P (node);
13495 TREE_SIDE_EFFECTS (mod)
13496 = TREE_SIDE_EFFECTS (op1) | TREE_SIDE_EFFECTS (op2);
13501 /* 15.17 Additive Operators */
13502 case PLUS_EXPR: /* 15.17.1 String Concatenation Operator + */
13504 /* Operation is valid if either one argument is a string
13505 constant, a String object or a StringBuffer crafted for the
13506 purpose of the a previous usage of the String concatenation
13509 if (TREE_CODE (op1) == STRING_CST
13510 || TREE_CODE (op2) == STRING_CST
13511 || JSTRING_TYPE_P (op1_type)
13512 || JSTRING_TYPE_P (op2_type)
13513 || IS_CRAFTED_STRING_BUFFER_P (op1)
13514 || IS_CRAFTED_STRING_BUFFER_P (op2))
13515 return build_string_concatenation (op1, op2);
13517 case MINUS_EXPR: /* 15.17.2 Additive Operators (+ and -) for
13519 if (!JNUMERIC_TYPE_P (op1_type) || !JNUMERIC_TYPE_P (op2_type))
13521 if (!JNUMERIC_TYPE_P (op1_type))
13522 ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op1_type);
13523 if (!JNUMERIC_TYPE_P (op2_type) && (op1_type != op2_type))
13524 ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op2_type);
13525 TREE_TYPE (node) = error_mark_node;
13529 prom_type = binary_numeric_promotion (op1_type, op2_type, &op1, &op2);
13532 /* 15.18 Shift Operators */
13536 if (!JINTEGRAL_TYPE_P (op1_type) || !JINTEGRAL_TYPE_P (op2_type))
13538 if (!JINTEGRAL_TYPE_P (op1_type))
13539 ERROR_CAST_NEEDED_TO_INTEGRAL (wfl_operator, node, op1_type);
13542 if (JNUMERIC_TYPE_P (op2_type))
13543 parse_error_context (wfl_operator,
13544 "Incompatible type for `%s'. Explicit cast needed to convert shift distance from `%s' to integral",
13545 operator_string (node),
13546 lang_printable_name (op2_type, 0));
13548 parse_error_context (wfl_operator,
13549 "Incompatible type for `%s'. Can't convert shift distance from `%s' to integral",
13550 operator_string (node),
13551 lang_printable_name (op2_type, 0));
13553 TREE_TYPE (node) = error_mark_node;
13558 /* Unary numeric promotion (5.6.1) is performed on each operand
13560 op1 = do_unary_numeric_promotion (op1);
13561 op2 = do_unary_numeric_promotion (op2);
13563 /* If the right hand side is of type `long', first cast it to
13565 if (TREE_TYPE (op2) == long_type_node)
13566 op2 = build1 (CONVERT_EXPR, int_type_node, op2);
13568 /* The type of the shift expression is the type of the promoted
13569 type of the left-hand operand */
13570 prom_type = TREE_TYPE (op1);
13572 /* Shift int only up to 0x1f and long up to 0x3f */
13573 if (prom_type == int_type_node)
13574 op2 = fold (build (BIT_AND_EXPR, int_type_node, op2,
13575 build_int_2 (0x1f, 0)));
13577 op2 = fold (build (BIT_AND_EXPR, int_type_node, op2,
13578 build_int_2 (0x3f, 0)));
13580 /* The >>> operator is a >> operating on unsigned quantities */
13581 if (code == URSHIFT_EXPR && ! flag_emit_class_files)
13584 tree utype = java_unsigned_type (prom_type);
13585 op1 = convert (utype, op1);
13586 TREE_SET_CODE (node, RSHIFT_EXPR);
13587 TREE_OPERAND (node, 0) = op1;
13588 TREE_OPERAND (node, 1) = op2;
13589 TREE_TYPE (node) = utype;
13590 to_return = convert (prom_type, node);
13591 /* Copy the original value of the COMPOUND_ASSIGN_P flag */
13592 COMPOUND_ASSIGN_P (to_return) = COMPOUND_ASSIGN_P (node);
13593 TREE_SIDE_EFFECTS (to_return)
13594 = TREE_SIDE_EFFECTS (op1) | TREE_SIDE_EFFECTS (op2);
13599 /* 15.19.1 Type Comparison Operator instanceof */
13600 case INSTANCEOF_EXPR:
13602 TREE_TYPE (node) = boolean_type_node;
13604 /* OP1_TYPE might be NULL when OP1 is a string constant. */
13605 if ((cn = patch_string (op1)))
13608 op1_type = TREE_TYPE (op1);
13610 if (op1_type == NULL_TREE)
13613 if (!(op2_type = resolve_type_during_patch (op2)))
13614 return error_mark_node;
13616 /* The first operand must be a reference type or the null type */
13617 if (!JREFERENCE_TYPE_P (op1_type) && op1 != null_pointer_node)
13618 error_found = 1; /* Error reported further below */
13620 /* The second operand must be a reference type */
13621 if (!JREFERENCE_TYPE_P (op2_type))
13623 SET_WFL_OPERATOR (wfl_operator, node, wfl_op2);
13624 parse_error_context
13625 (wfl_operator, "Invalid argument `%s' for `instanceof'",
13626 lang_printable_name (op2_type, 0));
13630 if (!error_found && valid_ref_assignconv_cast_p (op1_type, op2_type, 1))
13632 /* If the first operand is null, the result is always false */
13633 if (op1 == null_pointer_node)
13634 return boolean_false_node;
13635 else if (flag_emit_class_files)
13637 TREE_OPERAND (node, 1) = op2_type;
13638 TREE_SIDE_EFFECTS (node) = TREE_SIDE_EFFECTS (op1);
13641 /* Otherwise we have to invoke instance of to figure it out */
13643 return build_instanceof (op1, op2_type);
13645 /* There is no way the expression operand can be an instance of
13646 the type operand. This is a compile time error. */
13649 char *t1 = xstrdup (lang_printable_name (op1_type, 0));
13650 SET_WFL_OPERATOR (wfl_operator, node, wfl_op1);
13651 parse_error_context
13652 (wfl_operator, "Impossible for `%s' to be instance of `%s'",
13653 t1, lang_printable_name (op2_type, 0));
13660 /* 15.21 Bitwise and Logical Operators */
13664 if (JINTEGRAL_TYPE_P (op1_type) && JINTEGRAL_TYPE_P (op2_type))
13665 /* Binary numeric promotion is performed on both operand and the
13666 expression retain that type */
13667 prom_type = binary_numeric_promotion (op1_type, op2_type, &op1, &op2);
13669 else if (TREE_CODE (op1_type) == BOOLEAN_TYPE
13670 && TREE_CODE (op1_type) == BOOLEAN_TYPE)
13671 /* The type of the bitwise operator expression is BOOLEAN */
13672 prom_type = boolean_type_node;
13675 if (!JINTEGRAL_TYPE_P (op1_type))
13676 ERROR_CAST_NEEDED_TO_INTEGRAL (wfl_operator, node, op1_type);
13677 if (!JINTEGRAL_TYPE_P (op2_type) && (op1_type != op2_type))
13678 ERROR_CAST_NEEDED_TO_INTEGRAL (wfl_operator, node, op2_type);
13679 TREE_TYPE (node) = error_mark_node;
13681 /* Insert a break here if adding thing before the switch's
13682 break for this case */
13686 /* 15.22 Conditional-And Operator */
13687 case TRUTH_ANDIF_EXPR:
13688 /* 15.23 Conditional-Or Operator */
13689 case TRUTH_ORIF_EXPR:
13690 /* Operands must be of BOOLEAN type */
13691 if (TREE_CODE (op1_type) != BOOLEAN_TYPE ||
13692 TREE_CODE (op2_type) != BOOLEAN_TYPE)
13694 if (TREE_CODE (op1_type) != BOOLEAN_TYPE)
13695 ERROR_CANT_CONVERT_TO_BOOLEAN (wfl_operator, node, op1_type);
13696 if (TREE_CODE (op2_type) != BOOLEAN_TYPE && (op1_type != op2_type))
13697 ERROR_CANT_CONVERT_TO_BOOLEAN (wfl_operator, node, op2_type);
13698 TREE_TYPE (node) = boolean_type_node;
13702 else if (integer_zerop (op1))
13704 return code == TRUTH_ANDIF_EXPR ? op1 : op2;
13706 else if (integer_onep (op1))
13708 return code == TRUTH_ANDIF_EXPR ? op2 : op1;
13710 /* The type of the conditional operators is BOOLEAN */
13711 prom_type = boolean_type_node;
13714 /* 15.19.1 Numerical Comparison Operators <, <=, >, >= */
13719 /* The type of each of the operands must be a primitive numeric
13721 if (!JNUMERIC_TYPE_P (op1_type) || ! JNUMERIC_TYPE_P (op2_type))
13723 if (!JNUMERIC_TYPE_P (op1_type))
13724 ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op1_type);
13725 if (!JNUMERIC_TYPE_P (op2_type) && (op1_type != op2_type))
13726 ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op2_type);
13727 TREE_TYPE (node) = boolean_type_node;
13731 /* Binary numeric promotion is performed on the operands */
13732 binary_numeric_promotion (op1_type, op2_type, &op1, &op2);
13733 /* The type of the relation expression is always BOOLEAN */
13734 prom_type = boolean_type_node;
13737 /* 15.20 Equality Operator */
13740 /* It's time for us to patch the strings. */
13741 if ((cn = patch_string (op1)))
13744 op1_type = TREE_TYPE (op1);
13746 if ((cn = patch_string (op2)))
13749 op2_type = TREE_TYPE (op2);
13752 /* 15.20.1 Numerical Equality Operators == and != */
13753 /* Binary numeric promotion is performed on the operands */
13754 if (JNUMERIC_TYPE_P (op1_type) && JNUMERIC_TYPE_P (op2_type))
13755 binary_numeric_promotion (op1_type, op2_type, &op1, &op2);
13757 /* 15.20.2 Boolean Equality Operators == and != */
13758 else if (TREE_CODE (op1_type) == BOOLEAN_TYPE &&
13759 TREE_CODE (op2_type) == BOOLEAN_TYPE)
13760 ; /* Nothing to do here */
13762 /* 15.20.3 Reference Equality Operators == and != */
13763 /* Types have to be either references or the null type. If
13764 they're references, it must be possible to convert either
13765 type to the other by casting conversion. */
13766 else if (op1 == null_pointer_node || op2 == null_pointer_node
13767 || (JREFERENCE_TYPE_P (op1_type) && JREFERENCE_TYPE_P (op2_type)
13768 && (valid_ref_assignconv_cast_p (op1_type, op2_type, 1)
13769 || valid_ref_assignconv_cast_p (op2_type,
13771 ; /* Nothing to do here */
13773 /* Else we have an error figure what can't be converted into
13774 what and report the error */
13778 t1 = xstrdup (lang_printable_name (op1_type, 0));
13779 parse_error_context
13781 "Incompatible type for `%s'. Can't convert `%s' to `%s'",
13782 operator_string (node), t1,
13783 lang_printable_name (op2_type, 0));
13785 TREE_TYPE (node) = boolean_type_node;
13789 prom_type = boolean_type_node;
13796 return error_mark_node;
13798 TREE_OPERAND (node, 0) = op1;
13799 TREE_OPERAND (node, 1) = op2;
13800 TREE_TYPE (node) = prom_type;
13801 TREE_SIDE_EFFECTS (node) = TREE_SIDE_EFFECTS (op1) | TREE_SIDE_EFFECTS (op2);
13803 if (flag_emit_xref)
13806 /* fold does not respect side-effect order as required for Java but not C.
13807 * Also, it sometimes create SAVE_EXPRs which are bad when emitting
13810 if (flag_emit_class_files ? (TREE_CONSTANT (op1) && TREE_CONSTANT (op2))
13811 : ! TREE_SIDE_EFFECTS (node))
13812 node = fold (node);
13816 /* Concatenate the STRING_CST CSTE and STRING. When AFTER is a non
13817 zero value, the value of CSTE comes after the valude of STRING */
13820 do_merge_string_cste (tree cste, const char *string, int string_len, int after)
13822 const char *old = TREE_STRING_POINTER (cste);
13823 int old_len = TREE_STRING_LENGTH (cste);
13824 int len = old_len + string_len;
13825 char *new = alloca (len+1);
13829 memcpy (new, string, string_len);
13830 memcpy (&new [string_len], old, old_len);
13834 memcpy (new, old, old_len);
13835 memcpy (&new [old_len], string, string_len);
13838 return build_string (len, new);
13841 /* Tries to merge OP1 (a STRING_CST) and OP2 (if suitable). Return a
13842 new STRING_CST on success, NULL_TREE on failure. */
13845 merge_string_cste (tree op1, tree op2, int after)
13847 /* Handle two string constants right away. */
13848 if (TREE_CODE (op2) == STRING_CST)
13849 return do_merge_string_cste (op1, TREE_STRING_POINTER (op2),
13850 TREE_STRING_LENGTH (op2), after);
13852 /* Reasonable integer constant can be treated right away. */
13853 if (TREE_CODE (op2) == INTEGER_CST && !TREE_CONSTANT_OVERFLOW (op2))
13855 static const char *const boolean_true = "true";
13856 static const char *const boolean_false = "false";
13857 static const char *const null_pointer = "null";
13859 const char *string;
13861 if (op2 == boolean_true_node)
13862 string = boolean_true;
13863 else if (op2 == boolean_false_node)
13864 string = boolean_false;
13865 else if (op2 == null_pointer_node
13866 || (integer_zerop (op2)
13867 && TREE_CODE (TREE_TYPE (op2)) == POINTER_TYPE))
13868 /* FIXME: null is not a compile-time constant, so it is only safe to
13869 merge if the overall expression is non-constant. However, this
13870 code always merges without checking the overall expression. */
13871 string = null_pointer;
13872 else if (TREE_TYPE (op2) == char_type_node)
13874 /* Convert the character into UTF-8. */
13875 unsigned int c = (unsigned int) TREE_INT_CST_LOW (op2);
13876 unsigned char *p = (unsigned char *) ch;
13877 if (0x01 <= c && c <= 0x7f)
13878 *p++ = (unsigned char) c;
13879 else if (c < 0x7ff)
13881 *p++ = (unsigned char) (c >> 6 | 0xc0);
13882 *p++ = (unsigned char) ((c & 0x3f) | 0x80);
13886 *p++ = (unsigned char) (c >> 12 | 0xe0);
13887 *p++ = (unsigned char) (((c >> 6) & 0x3f) | 0x80);
13888 *p++ = (unsigned char) ((c & 0x3f) | 0x80);
13895 string = string_convert_int_cst (op2);
13897 return do_merge_string_cste (op1, string, strlen (string), after);
13902 /* Tries to statically concatenate OP1 and OP2 if possible. Either one
13903 has to be a STRING_CST and the other part must be a STRING_CST or a
13904 INTEGRAL constant. Return a new STRING_CST if the operation
13905 succeed, NULL_TREE otherwise.
13907 If the case we want to optimize for space, we might want to return
13908 NULL_TREE for each invocation of this routine. FIXME */
13911 string_constant_concatenation (tree op1, tree op2)
13913 if (TREE_CODE (op1) == STRING_CST || (TREE_CODE (op2) == STRING_CST))
13918 string = (TREE_CODE (op1) == STRING_CST ? op1 : op2);
13919 rest = (string == op1 ? op2 : op1);
13920 invert = (string == op1 ? 0 : 1 );
13922 /* Walk REST, only if it looks reasonable */
13923 if (TREE_CODE (rest) != STRING_CST
13924 && !IS_CRAFTED_STRING_BUFFER_P (rest)
13925 && !JSTRING_TYPE_P (TREE_TYPE (rest))
13926 && TREE_CODE (rest) == EXPR_WITH_FILE_LOCATION)
13928 rest = java_complete_tree (rest);
13929 if (rest == error_mark_node)
13930 return error_mark_node;
13931 rest = fold (rest);
13933 return merge_string_cste (string, rest, invert);
13938 /* Implement the `+' operator. Does static optimization if possible,
13939 otherwise create (if necessary) and append elements to a
13940 StringBuffer. The StringBuffer will be carried around until it is
13941 used for a function call or an assignment. Then toString() will be
13942 called on it to turn it into a String object. */
13945 build_string_concatenation (tree op1, tree op2)
13948 int side_effects = TREE_SIDE_EFFECTS (op1) | TREE_SIDE_EFFECTS (op2);
13950 if (flag_emit_xref)
13951 return build (PLUS_EXPR, string_type_node, op1, op2);
13953 /* Try to do some static optimization */
13954 if ((result = string_constant_concatenation (op1, op2)))
13957 /* Discard empty strings on either side of the expression */
13958 if (TREE_CODE (op1) == STRING_CST && TREE_STRING_LENGTH (op1) == 0)
13963 else if (TREE_CODE (op2) == STRING_CST && TREE_STRING_LENGTH (op2) == 0)
13966 /* If operands are string constant, turn then into object references */
13967 if (TREE_CODE (op1) == STRING_CST)
13968 op1 = patch_string_cst (op1);
13969 if (op2 && TREE_CODE (op2) == STRING_CST)
13970 op2 = patch_string_cst (op2);
13972 /* If either one of the constant is null and the other non null
13973 operand is a String constant, return it. */
13974 if ((TREE_CODE (op1) == STRING_CST) && !op2)
13977 /* If OP1 isn't already a StringBuffer, create and
13978 initialize a new one */
13979 if (!IS_CRAFTED_STRING_BUFFER_P (op1))
13981 /* Two solutions here:
13982 1) OP1 is a constant string reference, we call new StringBuffer(OP1)
13983 2) OP1 is something else, we call new StringBuffer().append(OP1). */
13984 if (TREE_CONSTANT (op1) && JSTRING_TYPE_P (TREE_TYPE (op1)))
13985 op1 = BUILD_STRING_BUFFER (op1);
13988 tree aNew = BUILD_STRING_BUFFER (NULL_TREE);
13989 op1 = make_qualified_primary (aNew, BUILD_APPEND (op1), 0);
13995 /* OP1 is no longer the last node holding a crafted StringBuffer */
13996 IS_CRAFTED_STRING_BUFFER_P (op1) = 0;
13997 /* Create a node for `{new...,xxx}.append (op2)' */
13999 op1 = make_qualified_primary (op1, BUILD_APPEND (op2), 0);
14002 /* Mark the last node holding a crafted StringBuffer */
14003 IS_CRAFTED_STRING_BUFFER_P (op1) = 1;
14005 TREE_SIDE_EFFECTS (op1) = side_effects;
14009 /* Patch the string node NODE. NODE can be a STRING_CST of a crafted
14010 StringBuffer. If no string were found to be patched, return
14014 patch_string (tree node)
14016 if (node == error_mark_node)
14017 return error_mark_node;
14018 if (TREE_CODE (node) == STRING_CST)
14019 return patch_string_cst (node);
14020 else if (IS_CRAFTED_STRING_BUFFER_P (node))
14022 int saved = ctxp->explicit_constructor_p;
14023 tree invoke = build_method_invocation (wfl_to_string, NULL_TREE);
14025 /* Temporary disable forbid the use of `this'. */
14026 ctxp->explicit_constructor_p = 0;
14027 ret = java_complete_tree (make_qualified_primary (node, invoke, 0));
14028 /* String concatenation arguments must be evaluated in order too. */
14029 ret = force_evaluation_order (ret);
14030 /* Restore it at its previous value */
14031 ctxp->explicit_constructor_p = saved;
14037 /* Build the internal representation of a string constant. */
14040 patch_string_cst (tree node)
14043 if (! flag_emit_class_files)
14045 node = get_identifier (TREE_STRING_POINTER (node));
14046 location = alloc_name_constant (CONSTANT_String, node);
14047 node = build_ref_from_constant_pool (location);
14049 TREE_TYPE (node) = string_ptr_type_node;
14050 TREE_CONSTANT (node) = 1;
14054 /* Build an incomplete unary operator expression. */
14057 build_unaryop (int op_token, int op_location, tree op1)
14063 case PLUS_TK: op = UNARY_PLUS_EXPR; break;
14064 case MINUS_TK: op = NEGATE_EXPR; break;
14065 case NEG_TK: op = TRUTH_NOT_EXPR; break;
14066 case NOT_TK: op = BIT_NOT_EXPR; break;
14070 unaryop = build1 (op, NULL_TREE, op1);
14071 TREE_SIDE_EFFECTS (unaryop) = 1;
14072 /* Store the location of the operator, for better error report. The
14073 string of the operator will be rebuild based on the OP value. */
14074 EXPR_WFL_LINECOL (unaryop) = op_location;
14078 /* Special case for the ++/-- operators, since they require an extra
14079 argument to build, which is set to NULL and patched
14080 later. IS_POST_P is 1 if the operator, 0 otherwise. */
14083 build_incdec (int op_token, int op_location, tree op1, int is_post_p)
14085 static const enum tree_code lookup [2][2] =
14087 { PREDECREMENT_EXPR, PREINCREMENT_EXPR, },
14088 { POSTDECREMENT_EXPR, POSTINCREMENT_EXPR, },
14090 tree node = build (lookup [is_post_p][(op_token - DECR_TK)],
14091 NULL_TREE, op1, NULL_TREE);
14092 TREE_SIDE_EFFECTS (node) = 1;
14093 /* Store the location of the operator, for better error report. The
14094 string of the operator will be rebuild based on the OP value. */
14095 EXPR_WFL_LINECOL (node) = op_location;
14099 /* Build an incomplete cast operator, based on the use of the
14100 CONVERT_EXPR. Note that TREE_TYPE of the constructed node is
14101 set. java_complete_tree is trained to walk a CONVERT_EXPR even
14102 though its type is already set. */
14105 build_cast (int location, tree type, tree exp)
14107 tree node = build1 (CONVERT_EXPR, type, exp);
14108 EXPR_WFL_LINECOL (node) = location;
14112 /* Build an incomplete class reference operator. */
14114 build_incomplete_class_ref (int location, tree class_name)
14116 tree node = build1 (CLASS_LITERAL, NULL_TREE, class_name);
14117 tree class_decl = GET_CPC ();
14118 tree this_class = TREE_TYPE (class_decl);
14120 /* Generate the synthetic static method `class$'. (Previously we
14121 deferred this, causing different method tables to be emitted
14122 for native code and bytecode.) */
14123 if (!TYPE_DOT_CLASS (this_class)
14124 && !JPRIMITIVE_TYPE_P (class_name)
14125 && !(TREE_CODE (class_name) == VOID_TYPE))
14129 if (CLASS_INTERFACE (TYPE_NAME (this_class)))
14131 /* For interfaces, adding a static 'class$' method directly
14132 is illegal. So create an inner class to contain the new
14133 method. Empirically this matches the behavior of javac. */
14134 tree t = build_wfl_node (DECL_NAME (TYPE_NAME (object_type_node)));
14135 tree inner = create_anonymous_class (0, t);
14136 target_class = TREE_TYPE (inner);
14137 end_class_declaration (1);
14141 /* For inner classes, add a 'class$' method to their outermost
14142 context, creating it if necessary. */
14143 while (INNER_CLASS_DECL_P (class_decl))
14144 class_decl = DECL_CONTEXT (class_decl);
14145 target_class = TREE_TYPE (class_decl);
14148 if (TYPE_DOT_CLASS (target_class) == NULL_TREE)
14149 build_dot_class_method (target_class);
14151 if (this_class != target_class)
14152 TYPE_DOT_CLASS (this_class) = TYPE_DOT_CLASS (target_class);
14155 EXPR_WFL_LINECOL (node) = location;
14159 /* Complete an incomplete class reference operator. */
14161 patch_incomplete_class_ref (tree node)
14163 tree type = TREE_OPERAND (node, 0);
14166 if (!(ref_type = resolve_type_during_patch (type)))
14167 return error_mark_node;
14169 /* If we're not emitting class files and we know ref_type is a
14170 compiled class, build a direct reference. */
14171 if ((! flag_emit_class_files && is_compiled_class (ref_type))
14172 || JPRIMITIVE_TYPE_P (ref_type)
14173 || TREE_CODE (ref_type) == VOID_TYPE)
14175 tree dot = build_class_ref (ref_type);
14176 /* A class referenced by `foo.class' is initialized. */
14177 if (!flag_emit_class_files)
14178 dot = build_class_init (ref_type, dot);
14179 return java_complete_tree (dot);
14182 /* If we're emitting class files and we have to deal with non
14183 primitive types, we invoke the synthetic static method `class$'. */
14184 ref_type = build_dot_class_method_invocation (current_class, ref_type);
14185 return java_complete_tree (ref_type);
14188 /* 15.14 Unary operators. We return error_mark_node in case of error,
14189 but preserve the type of NODE if the type is fixed. */
14192 patch_unaryop (tree node, tree wfl_op)
14194 tree op = TREE_OPERAND (node, 0);
14195 tree op_type = TREE_TYPE (op);
14196 tree prom_type = NULL_TREE, value, decl;
14197 int outer_field_flag = 0;
14198 int code = TREE_CODE (node);
14199 int error_found = 0;
14201 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
14205 /* 15.13.2 Postfix Increment Operator ++ */
14206 case POSTINCREMENT_EXPR:
14207 /* 15.13.3 Postfix Increment Operator -- */
14208 case POSTDECREMENT_EXPR:
14209 /* 15.14.1 Prefix Increment Operator ++ */
14210 case PREINCREMENT_EXPR:
14211 /* 15.14.2 Prefix Decrement Operator -- */
14212 case PREDECREMENT_EXPR:
14213 op = decl = strip_out_static_field_access_decl (op);
14214 outer_field_flag = outer_field_expanded_access_p (op, NULL, NULL, NULL);
14215 /* We might be trying to change an outer field accessed using
14217 if (outer_field_flag)
14219 /* Retrieve the decl of the field we're trying to access. We
14220 do that by first retrieving the function we would call to
14221 access the field. It has been already verified that this
14222 field isn't final */
14223 if (flag_emit_class_files)
14224 decl = TREE_OPERAND (op, 0);
14226 decl = TREE_OPERAND (TREE_OPERAND (TREE_OPERAND (op, 0), 0), 0);
14227 decl = DECL_FUNCTION_ACCESS_DECL (decl);
14229 /* We really should have a JAVA_ARRAY_EXPR to avoid this */
14230 else if (!JDECL_P (decl)
14231 && TREE_CODE (decl) != COMPONENT_REF
14232 && !(flag_emit_class_files && TREE_CODE (decl) == ARRAY_REF)
14233 && TREE_CODE (decl) != INDIRECT_REF
14234 && !(TREE_CODE (decl) == COMPOUND_EXPR
14235 && TREE_OPERAND (decl, 1)
14236 && (TREE_CODE (TREE_OPERAND (decl, 1)) == INDIRECT_REF)))
14238 TREE_TYPE (node) = error_mark_node;
14242 /* From now on, we know that op if a variable and that it has a
14243 valid wfl. We use wfl_op to locate errors related to the
14245 if (!JNUMERIC_TYPE_P (op_type))
14247 parse_error_context
14248 (wfl_op, "Invalid argument type `%s' to `%s'",
14249 lang_printable_name (op_type, 0), operator_string (node));
14250 TREE_TYPE (node) = error_mark_node;
14255 /* Before the addition, binary numeric promotion is performed on
14256 both operands, if really necessary */
14257 if (JINTEGRAL_TYPE_P (op_type))
14259 value = build_int_2 (1, 0);
14260 TREE_TYPE (value) = TREE_TYPE (node) = op_type;
14264 value = build_int_2 (1, 0);
14266 binary_numeric_promotion (op_type,
14267 TREE_TYPE (value), &op, &value);
14270 /* We remember we might be accessing an outer field */
14271 if (outer_field_flag)
14273 /* We re-generate an access to the field */
14274 value = build (PLUS_EXPR, TREE_TYPE (op),
14275 build_outer_field_access (wfl_op, decl), value);
14277 /* And we patch the original access$() into a write
14278 with plus_op as a rhs */
14279 return outer_field_access_fix (node, op, value);
14282 /* And write back into the node. */
14283 TREE_OPERAND (node, 0) = op;
14284 TREE_OPERAND (node, 1) = value;
14285 /* Convert the overall back into its original type, if
14286 necessary, and return */
14287 if (JINTEGRAL_TYPE_P (op_type))
14288 return fold (node);
14290 return fold (convert (op_type, node));
14294 /* 15.14.3 Unary Plus Operator + */
14295 case UNARY_PLUS_EXPR:
14296 /* 15.14.4 Unary Minus Operator - */
14298 if (!JNUMERIC_TYPE_P (op_type))
14300 ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op_type);
14301 TREE_TYPE (node) = error_mark_node;
14304 /* Unary numeric promotion is performed on operand */
14307 op = do_unary_numeric_promotion (op);
14308 prom_type = TREE_TYPE (op);
14309 if (code == UNARY_PLUS_EXPR)
14314 /* 15.14.5 Bitwise Complement Operator ~ */
14316 if (!JINTEGRAL_TYPE_P (op_type))
14318 ERROR_CAST_NEEDED_TO_INTEGRAL (wfl_operator, node, op_type);
14319 TREE_TYPE (node) = error_mark_node;
14324 op = do_unary_numeric_promotion (op);
14325 prom_type = TREE_TYPE (op);
14329 /* 15.14.6 Logical Complement Operator ! */
14330 case TRUTH_NOT_EXPR:
14331 if (TREE_CODE (op_type) != BOOLEAN_TYPE)
14333 ERROR_CANT_CONVERT_TO_BOOLEAN (wfl_operator, node, op_type);
14334 /* But the type is known. We will report an error if further
14335 attempt of a assignment is made with this rhs */
14336 TREE_TYPE (node) = boolean_type_node;
14340 prom_type = boolean_type_node;
14343 /* 15.15 Cast Expression */
14345 value = patch_cast (node, wfl_operator);
14346 if (value == error_mark_node)
14348 /* If this cast is part of an assignment, we tell the code
14349 that deals with it not to complain about a mismatch,
14350 because things have been cast, anyways */
14351 TREE_TYPE (node) = error_mark_node;
14356 value = fold (value);
14357 TREE_SIDE_EFFECTS (value) = TREE_SIDE_EFFECTS (op);
14364 return error_mark_node;
14366 /* There are cases where node has been replaced by something else
14367 and we don't end up returning here: UNARY_PLUS_EXPR,
14368 CONVERT_EXPR, {POST,PRE}{INCR,DECR}EMENT_EXPR. */
14369 TREE_OPERAND (node, 0) = fold (op);
14370 TREE_TYPE (node) = prom_type;
14371 TREE_SIDE_EFFECTS (node) = TREE_SIDE_EFFECTS (op);
14372 return fold (node);
14375 /* Generic type resolution that sometimes takes place during node
14376 patching. Returned the resolved type or generate an error
14377 message. Return the resolved type or NULL_TREE. */
14380 resolve_type_during_patch (tree type)
14382 if (unresolved_type_p (type, NULL))
14384 tree type_decl = resolve_and_layout (EXPR_WFL_NODE (type), type);
14387 parse_error_context (type,
14388 "Class `%s' not found in type declaration",
14389 IDENTIFIER_POINTER (EXPR_WFL_NODE (type)));
14393 check_deprecation (type, type_decl);
14395 return TREE_TYPE (type_decl);
14400 /* 5.5 Casting Conversion. error_mark_node is returned if an error is
14401 found. Otherwise NODE or something meant to replace it is returned. */
14404 patch_cast (tree node, tree wfl_op)
14406 tree op = TREE_OPERAND (node, 0);
14407 tree cast_type = TREE_TYPE (node);
14408 tree patched, op_type;
14411 /* Some string patching might be necessary at this stage */
14412 if ((patched = patch_string (op)))
14413 TREE_OPERAND (node, 0) = op = patched;
14414 op_type = TREE_TYPE (op);
14416 /* First resolve OP_TYPE if unresolved */
14417 if (!(cast_type = resolve_type_during_patch (cast_type)))
14418 return error_mark_node;
14420 /* Check on cast that are proven correct at compile time */
14421 if (JNUMERIC_TYPE_P (cast_type) && JNUMERIC_TYPE_P (op_type))
14424 if (cast_type == op_type)
14427 /* A narrowing conversion from a floating-point number to an
14428 integral type requires special handling (5.1.3). */
14429 if (JFLOAT_TYPE_P (op_type) && JINTEGRAL_TYPE_P (cast_type))
14430 if (cast_type != long_type_node)
14431 op = convert (integer_type_node, op);
14433 /* Try widening/narrowing conversion. Potentially, things need
14434 to be worked out in gcc so we implement the extreme cases
14435 correctly. fold_convert() needs to be fixed. */
14436 return convert (cast_type, op);
14439 /* It's also valid to cast a boolean into a boolean */
14440 if (op_type == boolean_type_node && cast_type == boolean_type_node)
14443 /* null can be casted to references */
14444 if (op == null_pointer_node && JREFERENCE_TYPE_P (cast_type))
14445 return build_null_of_type (cast_type);
14447 /* The remaining legal casts involve conversion between reference
14448 types. Check for their compile time correctness. */
14449 if (JREFERENCE_TYPE_P (op_type) && JREFERENCE_TYPE_P (cast_type)
14450 && valid_ref_assignconv_cast_p (op_type, cast_type, 1))
14452 TREE_TYPE (node) = promote_type (cast_type);
14453 /* Now, the case can be determined correct at compile time if
14454 OP_TYPE can be converted into CAST_TYPE by assignment
14455 conversion (5.2) */
14457 if (valid_ref_assignconv_cast_p (op_type, cast_type, 0))
14459 TREE_SET_CODE (node, NOP_EXPR);
14463 if (flag_emit_class_files)
14465 TREE_SET_CODE (node, CONVERT_EXPR);
14469 /* The cast requires a run-time check */
14470 return build (CALL_EXPR, promote_type (cast_type),
14471 build_address_of (soft_checkcast_node),
14472 tree_cons (NULL_TREE, build_class_ref (cast_type),
14473 build_tree_list (NULL_TREE, op)),
14477 /* Any other casts are proven incorrect at compile time */
14478 t1 = xstrdup (lang_printable_name (op_type, 0));
14479 parse_error_context (wfl_op, "Invalid cast from `%s' to `%s'",
14480 t1, lang_printable_name (cast_type, 0));
14482 return error_mark_node;
14485 /* Build a null constant and give it the type TYPE. */
14488 build_null_of_type (tree type)
14490 tree node = build_int_2 (0, 0);
14491 TREE_TYPE (node) = promote_type (type);
14495 /* Build an ARRAY_REF incomplete tree node. Note that operand 1 isn't
14496 a list of indices. */
14498 build_array_ref (int location, tree array, tree index)
14500 tree node = build (ARRAY_REF, NULL_TREE, array, index);
14501 EXPR_WFL_LINECOL (node) = location;
14505 /* 15.12 Array Access Expression */
14508 patch_array_ref (tree node)
14510 tree array = TREE_OPERAND (node, 0);
14511 tree array_type = TREE_TYPE (array);
14512 tree index = TREE_OPERAND (node, 1);
14513 tree index_type = TREE_TYPE (index);
14514 int error_found = 0;
14516 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
14518 if (TREE_CODE (array_type) == POINTER_TYPE)
14519 array_type = TREE_TYPE (array_type);
14521 /* The array reference must be an array */
14522 if (!TYPE_ARRAY_P (array_type))
14524 parse_error_context
14526 "`[]' can only be applied to arrays. It can't be applied to `%s'",
14527 lang_printable_name (array_type, 0));
14528 TREE_TYPE (node) = error_mark_node;
14532 /* The array index undergoes unary numeric promotion. The promoted
14533 type must be int */
14534 index = do_unary_numeric_promotion (index);
14535 if (TREE_TYPE (index) != int_type_node)
14537 if (valid_cast_to_p (index_type, int_type_node))
14538 parse_error_context (wfl_operator,
14539 "Incompatible type for `[]'. Explicit cast needed to convert `%s' to `int'",
14540 lang_printable_name (index_type, 0));
14542 parse_error_context (wfl_operator,
14543 "Incompatible type for `[]'. Can't convert `%s' to `int'",
14544 lang_printable_name (index_type, 0));
14545 TREE_TYPE (node) = error_mark_node;
14550 return error_mark_node;
14552 array_type = TYPE_ARRAY_ELEMENT (array_type);
14554 if (flag_emit_class_files || flag_emit_xref)
14556 TREE_OPERAND (node, 0) = array;
14557 TREE_OPERAND (node, 1) = index;
14560 node = build_java_arrayaccess (array, array_type, index);
14561 TREE_TYPE (node) = array_type;
14565 /* 15.9 Array Creation Expressions */
14568 build_newarray_node (tree type, tree dims, int extra_dims)
14571 build (NEW_ARRAY_EXPR, NULL_TREE, type, nreverse (dims),
14572 build_int_2 (extra_dims, 0));
14577 patch_newarray (tree node)
14579 tree type = TREE_OPERAND (node, 0);
14580 tree dims = TREE_OPERAND (node, 1);
14581 tree cdim, array_type;
14582 int error_found = 0;
14584 int xdims = TREE_INT_CST_LOW (TREE_OPERAND (node, 2));
14586 /* Dimension types are verified. It's better for the types to be
14587 verified in order. */
14588 for (cdim = dims, ndims = 0; cdim; cdim = TREE_CHAIN (cdim), ndims++ )
14591 tree dim = TREE_VALUE (cdim);
14593 /* Dim might have been saved during its evaluation */
14594 dim = (TREE_CODE (dim) == SAVE_EXPR ? TREE_OPERAND (dim, 0) : dim);
14596 /* The type of each specified dimension must be an integral type. */
14597 if (!JINTEGRAL_TYPE_P (TREE_TYPE (dim)))
14600 /* Each expression undergoes an unary numeric promotion (5.6.1) and the
14601 promoted type must be int. */
14604 dim = do_unary_numeric_promotion (dim);
14605 if (TREE_TYPE (dim) != int_type_node)
14609 /* Report errors on types here */
14612 parse_error_context
14613 (TREE_PURPOSE (cdim),
14614 "Incompatible type for dimension in array creation expression. %s convert `%s' to `int'",
14615 (valid_cast_to_p (TREE_TYPE (dim), int_type_node) ?
14616 "Explicit cast needed to" : "Can't"),
14617 lang_printable_name (TREE_TYPE (dim), 0));
14621 TREE_PURPOSE (cdim) = NULL_TREE;
14624 /* Resolve array base type if unresolved */
14625 if (!(type = resolve_type_during_patch (type)))
14630 /* We don't want further evaluation of this bogus array creation
14632 TREE_TYPE (node) = error_mark_node;
14633 return error_mark_node;
14636 /* Set array_type to the actual (promoted) array type of the result. */
14637 if (TREE_CODE (type) == RECORD_TYPE)
14638 type = build_pointer_type (type);
14639 while (--xdims >= 0)
14641 type = promote_type (build_java_array_type (type, -1));
14643 dims = nreverse (dims);
14645 for (cdim = dims; cdim; cdim = TREE_CHAIN (cdim))
14649 = build_java_array_type (type,
14650 TREE_CODE (cdim) == INTEGER_CST
14651 ? (HOST_WIDE_INT) TREE_INT_CST_LOW (cdim)
14653 array_type = promote_type (array_type);
14655 dims = nreverse (dims);
14657 /* The node is transformed into a function call. Things are done
14658 differently according to the number of dimensions. If the number
14659 of dimension is equal to 1, then the nature of the base type
14660 (primitive or not) matters. */
14662 return build_new_array (type, TREE_VALUE (dims));
14664 /* Can't reuse what's already written in expr.c because it uses the
14665 JVM stack representation. Provide a build_multianewarray. FIXME */
14666 return build (CALL_EXPR, array_type,
14667 build_address_of (soft_multianewarray_node),
14668 tree_cons (NULL_TREE, build_class_ref (TREE_TYPE (array_type)),
14669 tree_cons (NULL_TREE,
14670 build_int_2 (ndims, 0), dims )),
14674 /* 10.6 Array initializer. */
14676 /* Build a wfl for array element that don't have one, so we can
14677 pin-point errors. */
14680 maybe_build_array_element_wfl (tree node)
14682 if (TREE_CODE (node) != EXPR_WITH_FILE_LOCATION)
14683 return build_expr_wfl (NULL_TREE, ctxp->filename,
14684 ctxp->elc.line, ctxp->elc.prev_col);
14689 /* Build a NEW_ARRAY_INIT that features a CONSTRUCTOR node. This makes
14690 identification of initialized arrays easier to detect during walk
14694 build_new_array_init (int location, tree values)
14696 tree constructor = build_constructor (NULL_TREE, values);
14697 tree to_return = build1 (NEW_ARRAY_INIT, NULL_TREE, constructor);
14698 EXPR_WFL_LINECOL (to_return) = location;
14702 /* Expand a NEW_ARRAY_INIT node. Return error_mark_node if an error
14703 occurred. Otherwise return NODE after having set its type
14707 patch_new_array_init (tree type, tree node)
14709 int error_seen = 0;
14710 tree current, element_type;
14711 HOST_WIDE_INT length;
14712 int all_constant = 1;
14713 tree init = TREE_OPERAND (node, 0);
14715 if (TREE_CODE (type) != POINTER_TYPE || ! TYPE_ARRAY_P (TREE_TYPE (type)))
14717 parse_error_context (node,
14718 "Invalid array initializer for non-array type `%s'",
14719 lang_printable_name (type, 1));
14720 return error_mark_node;
14722 type = TREE_TYPE (type);
14723 element_type = TYPE_ARRAY_ELEMENT (type);
14725 CONSTRUCTOR_ELTS (init) = nreverse (CONSTRUCTOR_ELTS (init));
14727 for (length = 0, current = CONSTRUCTOR_ELTS (init);
14728 current; length++, current = TREE_CHAIN (current))
14730 tree elt = TREE_VALUE (current);
14731 if (elt == NULL_TREE || TREE_CODE (elt) != NEW_ARRAY_INIT)
14733 error_seen |= array_constructor_check_entry (element_type, current);
14734 elt = TREE_VALUE (current);
14735 /* When compiling to native code, STRING_CST is converted to
14736 INDIRECT_REF, but still with a TREE_CONSTANT flag. */
14737 if (! TREE_CONSTANT (elt) || TREE_CODE (elt) == INDIRECT_REF)
14742 TREE_VALUE (current) = patch_new_array_init (element_type, elt);
14743 TREE_PURPOSE (current) = NULL_TREE;
14746 if (elt && TREE_CODE (elt) == TREE_LIST
14747 && TREE_VALUE (elt) == error_mark_node)
14752 return error_mark_node;
14754 /* Create a new type. We can't reuse the one we have here by
14755 patching its dimension because it originally is of dimension -1
14756 hence reused by gcc. This would prevent triangular arrays. */
14757 type = build_java_array_type (element_type, length);
14758 TREE_TYPE (init) = TREE_TYPE (TREE_CHAIN (TREE_CHAIN (TYPE_FIELDS (type))));
14759 TREE_TYPE (node) = promote_type (type);
14760 TREE_CONSTANT (init) = all_constant;
14761 TREE_CONSTANT (node) = all_constant;
14765 /* Verify that one entry of the initializer element list can be
14766 assigned to the array base type. Report 1 if an error occurred, 0
14770 array_constructor_check_entry (tree type, tree entry)
14772 char *array_type_string = NULL; /* For error reports */
14773 tree value, type_value, new_value, wfl_value, patched;
14774 int error_seen = 0;
14776 new_value = NULL_TREE;
14777 wfl_value = TREE_VALUE (entry);
14779 value = java_complete_tree (TREE_VALUE (entry));
14780 /* patch_string return error_mark_node if arg is error_mark_node */
14781 if ((patched = patch_string (value)))
14783 if (value == error_mark_node)
14786 type_value = TREE_TYPE (value);
14788 /* At anytime, try_builtin_assignconv can report a warning on
14789 constant overflow during narrowing. */
14790 SET_WFL_OPERATOR (wfl_operator, TREE_PURPOSE (entry), wfl_value);
14791 new_value = try_builtin_assignconv (wfl_operator, type, value);
14792 if (!new_value && (new_value = try_reference_assignconv (type, value)))
14793 type_value = promote_type (type);
14795 /* Check and report errors */
14798 const char *const msg = (!valid_cast_to_p (type_value, type) ?
14799 "Can't" : "Explicit cast needed to");
14800 if (!array_type_string)
14801 array_type_string = xstrdup (lang_printable_name (type, 1));
14802 parse_error_context
14803 (wfl_operator, "Incompatible type for array. %s convert `%s' to `%s'",
14804 msg, lang_printable_name (type_value, 1), array_type_string);
14809 TREE_VALUE (entry) = new_value;
14811 if (array_type_string)
14812 free (array_type_string);
14814 TREE_PURPOSE (entry) = NULL_TREE;
14819 build_this (int location)
14821 tree node = build_wfl_node (this_identifier_node);
14822 TREE_SET_CODE (node, THIS_EXPR);
14823 EXPR_WFL_LINECOL (node) = location;
14827 /* 14.15 The return statement. It builds a modify expression that
14828 assigns the returned value to the RESULT_DECL that hold the value
14832 build_return (int location, tree op)
14834 tree node = build1 (RETURN_EXPR, NULL_TREE, op);
14835 EXPR_WFL_LINECOL (node) = location;
14836 node = build_debugable_stmt (location, node);
14841 patch_return (tree node)
14843 tree return_exp = TREE_OPERAND (node, 0);
14844 tree meth = current_function_decl;
14845 tree mtype = TREE_TYPE (TREE_TYPE (current_function_decl));
14846 int error_found = 0;
14848 TREE_TYPE (node) = error_mark_node;
14849 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
14851 /* It's invalid to have a return value within a function that is
14852 declared with the keyword void or that is a constructor */
14853 if (return_exp && (mtype == void_type_node || DECL_CONSTRUCTOR_P (meth)))
14856 /* It's invalid to use a return statement in a static block */
14857 if (DECL_CLINIT_P (current_function_decl))
14860 /* It's invalid to have a no return value within a function that
14861 isn't declared with the keyword `void' */
14862 if (!return_exp && (mtype != void_type_node && !DECL_CONSTRUCTOR_P (meth)))
14865 if (DECL_INSTINIT_P (current_function_decl))
14870 if (DECL_INSTINIT_P (current_function_decl))
14871 parse_error_context (wfl_operator,
14872 "`return' inside instance initializer");
14874 else if (DECL_CLINIT_P (current_function_decl))
14875 parse_error_context (wfl_operator,
14876 "`return' inside static initializer");
14878 else if (!DECL_CONSTRUCTOR_P (meth))
14880 char *t = xstrdup (lang_printable_name (mtype, 0));
14881 parse_error_context (wfl_operator,
14882 "`return' with%s value from `%s %s'",
14883 (error_found == 1 ? "" : "out"),
14884 t, lang_printable_name (meth, 0));
14888 parse_error_context (wfl_operator,
14889 "`return' with value from constructor `%s'",
14890 lang_printable_name (meth, 0));
14891 return error_mark_node;
14894 /* If we have a return_exp, build a modify expression and expand
14895 it. Note: at that point, the assignment is declared valid, but we
14896 may want to carry some more hacks */
14899 tree exp = java_complete_tree (return_exp);
14900 tree modify, patched;
14902 if ((patched = patch_string (exp)))
14905 modify = build (MODIFY_EXPR, NULL_TREE, DECL_RESULT (meth), exp);
14906 EXPR_WFL_LINECOL (modify) = EXPR_WFL_LINECOL (node);
14907 modify = java_complete_tree (modify);
14909 if (modify != error_mark_node)
14911 TREE_SIDE_EFFECTS (modify) = 1;
14912 TREE_OPERAND (node, 0) = modify;
14915 return error_mark_node;
14917 TREE_TYPE (node) = void_type_node;
14918 TREE_SIDE_EFFECTS (node) = 1;
14922 /* 14.8 The if Statement */
14925 build_if_else_statement (int location, tree expression, tree if_body,
14930 else_body = empty_stmt_node;
14931 node = build (COND_EXPR, NULL_TREE, expression, if_body, else_body);
14932 EXPR_WFL_LINECOL (node) = location;
14933 node = build_debugable_stmt (location, node);
14938 patch_if_else_statement (tree node)
14940 tree expression = TREE_OPERAND (node, 0);
14941 int can_complete_normally
14942 = (CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 1))
14943 | CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 2)));
14945 TREE_TYPE (node) = error_mark_node;
14946 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
14948 /* The type of expression must be boolean */
14949 if (TREE_TYPE (expression) != boolean_type_node
14950 && TREE_TYPE (expression) != promoted_boolean_type_node)
14952 parse_error_context
14954 "Incompatible type for `if'. Can't convert `%s' to `boolean'",
14955 lang_printable_name (TREE_TYPE (expression), 0));
14956 return error_mark_node;
14959 if (TREE_CODE (expression) == INTEGER_CST)
14961 if (integer_zerop (expression))
14962 node = TREE_OPERAND (node, 2);
14964 node = TREE_OPERAND (node, 1);
14965 if (CAN_COMPLETE_NORMALLY (node) != can_complete_normally)
14967 node = build (COMPOUND_EXPR, void_type_node, node, empty_stmt_node);
14968 CAN_COMPLETE_NORMALLY (node) = can_complete_normally;
14972 TREE_TYPE (node) = void_type_node;
14973 TREE_SIDE_EFFECTS (node) = 1;
14974 CAN_COMPLETE_NORMALLY (node) = can_complete_normally;
14978 /* 14.6 Labeled Statements */
14980 /* Action taken when a labeled statement is parsed. a new
14981 LABELED_BLOCK_EXPR is created. No statement is attached to the
14982 label, yet. LABEL can be NULL_TREE for artificially-generated blocks. */
14985 build_labeled_block (int location, tree label)
14988 tree label_decl, node;
14989 if (label == NULL_TREE || label == continue_identifier_node)
14990 label_name = label;
14993 label_name = merge_qualified_name (label_id, label);
14994 /* Issue an error if we try to reuse a label that was previously
14996 if (IDENTIFIER_LOCAL_VALUE (label_name))
14998 EXPR_WFL_LINECOL (wfl_operator) = location;
14999 parse_error_context (wfl_operator,
15000 "Declaration of `%s' shadows a previous label declaration",
15001 IDENTIFIER_POINTER (label));
15002 EXPR_WFL_LINECOL (wfl_operator) =
15003 EXPR_WFL_LINECOL (IDENTIFIER_LOCAL_VALUE (label_name));
15004 parse_error_context (wfl_operator,
15005 "This is the location of the previous declaration of label `%s'",
15006 IDENTIFIER_POINTER (label));
15007 java_error_count--;
15011 label_decl = create_label_decl (label_name);
15012 node = build (LABELED_BLOCK_EXPR, NULL_TREE, label_decl, NULL_TREE);
15013 EXPR_WFL_LINECOL (node) = location;
15014 TREE_SIDE_EFFECTS (node) = 1;
15018 /* A labeled statement LBE is attached a statement. */
15021 finish_labeled_statement (tree lbe, /* Labeled block expr */
15024 /* In anyways, tie the loop to its statement */
15025 LABELED_BLOCK_BODY (lbe) = statement;
15026 pop_labeled_block ();
15027 POP_LABELED_BLOCK ();
15031 /* 14.10, 14.11, 14.12 Loop Statements */
15033 /* Create an empty LOOP_EXPR and make it the last in the nested loop
15037 build_new_loop (tree loop_body)
15039 tree loop = build (LOOP_EXPR, NULL_TREE, loop_body);
15040 TREE_SIDE_EFFECTS (loop) = 1;
15045 /* Create a loop body according to the following structure:
15047 COMPOUND_EXPR (loop main body)
15048 EXIT_EXPR (this order is for while/for loops.
15049 LABELED_BLOCK_EXPR the order is reversed for do loops)
15050 LABEL_DECL (a continue occurring here branches at the
15051 BODY end of this labeled block)
15054 REVERSED, if nonzero, tells that the loop condition expr comes
15055 after the body, like in the do-while loop.
15057 To obtain a loop, the loop body structure described above is
15058 encapsulated within a LOOP_EXPR surrounded by a LABELED_BLOCK_EXPR:
15061 LABEL_DECL (use this label to exit the loop)
15063 <structure described above> */
15066 build_loop_body (int location, tree condition, int reversed)
15068 tree first, second, body;
15070 condition = build (EXIT_EXPR, NULL_TREE, condition); /* Force walk */
15071 EXPR_WFL_LINECOL (condition) = location; /* For accurate error report */
15072 condition = build_debugable_stmt (location, condition);
15073 TREE_SIDE_EFFECTS (condition) = 1;
15075 body = build_labeled_block (0, continue_identifier_node);
15076 first = (reversed ? body : condition);
15077 second = (reversed ? condition : body);
15079 build (COMPOUND_EXPR, NULL_TREE,
15080 build (COMPOUND_EXPR, NULL_TREE, first, second), empty_stmt_node);
15083 /* Install CONDITION (if any) and loop BODY (using REVERSED to tell
15084 their order) on the current loop. Unlink the current loop from the
15088 finish_loop_body (int location, tree condition, tree body, int reversed)
15090 tree to_return = ctxp->current_loop;
15091 tree loop_body = LOOP_EXPR_BODY (to_return);
15094 tree cnode = LOOP_EXPR_BODY_CONDITION_EXPR (loop_body, reversed);
15095 /* We wrapped the EXIT_EXPR around a WFL so we can debug it.
15096 The real EXIT_EXPR is one operand further. */
15097 EXPR_WFL_LINECOL (cnode) = location;
15098 /* This one is for accurate error reports */
15099 EXPR_WFL_LINECOL (TREE_OPERAND (cnode, 0)) = location;
15100 TREE_OPERAND (TREE_OPERAND (cnode, 0), 0) = condition;
15102 LOOP_EXPR_BODY_BODY_EXPR (loop_body, reversed) = body;
15107 /* Tailored version of finish_loop_body for FOR loops, when FOR
15108 loops feature the condition part */
15111 finish_for_loop (int location, tree condition, tree update, tree body)
15113 /* Put the condition and the loop body in place */
15114 tree loop = finish_loop_body (location, condition, body, 0);
15115 /* LOOP is the current loop which has been now popped of the loop
15116 stack. Mark the update block as reachable and install it. We do
15117 this because the (current interpretation of the) JLS requires
15118 that the update expression be considered reachable even if the
15119 for loop's body doesn't complete normally. */
15120 if (update != NULL_TREE && update != empty_stmt_node)
15123 if (TREE_CODE (up2) == EXPR_WITH_FILE_LOCATION)
15124 up2 = EXPR_WFL_NODE (up2);
15125 /* It is possible for the update expression to be an
15126 EXPR_WFL_NODE wrapping nothing. */
15127 if (up2 != NULL_TREE && up2 != empty_stmt_node)
15129 /* Try to detect constraint violations. These would be
15130 programming errors somewhere. */
15131 if (! IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (up2)))
15132 || TREE_CODE (up2) == LOOP_EXPR)
15134 SUPPRESS_UNREACHABLE_ERROR (up2) = 1;
15137 LOOP_EXPR_BODY_UPDATE_BLOCK (LOOP_EXPR_BODY (loop)) = update;
15141 /* Try to find the loop a block might be related to. This comprises
15142 the case where the LOOP_EXPR is found as the second operand of a
15143 COMPOUND_EXPR, because the loop happens to have an initialization
15144 part, then expressed as the first operand of the COMPOUND_EXPR. If
15145 the search finds something, 1 is returned. Otherwise, 0 is
15146 returned. The search is assumed to start from a
15147 LABELED_BLOCK_EXPR's block. */
15150 search_loop (tree statement)
15152 if (TREE_CODE (statement) == LOOP_EXPR)
15155 if (TREE_CODE (statement) == BLOCK)
15156 statement = BLOCK_SUBBLOCKS (statement);
15160 if (statement && TREE_CODE (statement) == COMPOUND_EXPR)
15161 while (statement && TREE_CODE (statement) == COMPOUND_EXPR)
15162 statement = TREE_OPERAND (statement, 1);
15164 return (TREE_CODE (statement) == LOOP_EXPR
15165 && FOR_LOOP_P (statement) ? statement : NULL_TREE);
15168 /* Return 1 if LOOP can be found in the labeled block BLOCK. 0 is
15169 returned otherwise. */
15172 labeled_block_contains_loop_p (tree block, tree loop)
15177 if (LABELED_BLOCK_BODY (block) == loop)
15180 if (FOR_LOOP_P (loop) && search_loop (LABELED_BLOCK_BODY (block)) == loop)
15186 /* If the loop isn't surrounded by a labeled statement, create one and
15187 insert LOOP as its body. */
15190 patch_loop_statement (tree loop)
15194 TREE_TYPE (loop) = void_type_node;
15195 if (labeled_block_contains_loop_p (ctxp->current_labeled_block, loop))
15198 loop_label = build_labeled_block (0, NULL_TREE);
15199 /* LOOP is an EXPR node, so it should have a valid EXPR_WFL_LINECOL
15200 that LOOP_LABEL could enquire about, for a better accuracy. FIXME */
15201 LABELED_BLOCK_BODY (loop_label) = loop;
15202 PUSH_LABELED_BLOCK (loop_label);
15206 /* 14.13, 14.14: break and continue Statements */
15208 /* Build a break or a continue statement. a null NAME indicates an
15209 unlabeled break/continue statement. */
15212 build_bc_statement (int location, int is_break, tree name)
15214 tree break_continue, label_block_expr = NULL_TREE;
15218 if (!(label_block_expr = IDENTIFIER_LOCAL_VALUE
15219 (merge_qualified_name (label_id, EXPR_WFL_NODE (name)))))
15220 /* Null means that we don't have a target for this named
15221 break/continue. In this case, we make the target to be the
15222 label name, so that the error can be reported accurately in
15223 patch_bc_statement. */
15224 label_block_expr = EXPR_WFL_NODE (name);
15226 /* Unlabeled break/continue will be handled during the
15227 break/continue patch operation */
15229 = build (EXIT_BLOCK_EXPR, NULL_TREE, label_block_expr, NULL_TREE);
15231 IS_BREAK_STMT_P (break_continue) = is_break;
15232 TREE_SIDE_EFFECTS (break_continue) = 1;
15233 EXPR_WFL_LINECOL (break_continue) = location;
15234 break_continue = build_debugable_stmt (location, break_continue);
15235 return break_continue;
15238 /* Verification of a break/continue statement. */
15241 patch_bc_statement (tree node)
15243 tree bc_label = EXIT_BLOCK_LABELED_BLOCK (node), target_stmt;
15244 tree labeled_block = ctxp->current_labeled_block;
15245 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
15247 /* Having an identifier here means that the target is unknown. */
15248 if (bc_label != NULL_TREE && TREE_CODE (bc_label) == IDENTIFIER_NODE)
15250 parse_error_context (wfl_operator, "No label definition found for `%s'",
15251 IDENTIFIER_POINTER (bc_label));
15252 return error_mark_node;
15254 if (! IS_BREAK_STMT_P (node))
15256 /* It's a continue statement. */
15257 for (;; labeled_block = TREE_CHAIN (labeled_block))
15259 if (labeled_block == NULL_TREE)
15261 if (bc_label == NULL_TREE)
15262 parse_error_context (wfl_operator,
15263 "`continue' must be in loop");
15265 parse_error_context
15266 (wfl_operator, "continue label `%s' does not name a loop",
15267 IDENTIFIER_POINTER (bc_label));
15268 return error_mark_node;
15270 if ((DECL_NAME (LABELED_BLOCK_LABEL (labeled_block))
15271 == continue_identifier_node)
15272 && (bc_label == NULL_TREE
15273 || TREE_CHAIN (labeled_block) == bc_label))
15275 bc_label = labeled_block;
15280 else if (!bc_label)
15282 for (;; labeled_block = TREE_CHAIN (labeled_block))
15284 if (labeled_block == NULL_TREE)
15286 parse_error_context (wfl_operator,
15287 "`break' must be in loop or switch");
15288 return error_mark_node;
15290 target_stmt = LABELED_BLOCK_BODY (labeled_block);
15291 if (TREE_CODE (target_stmt) == SWITCH_EXPR
15292 || search_loop (target_stmt))
15294 bc_label = labeled_block;
15300 EXIT_BLOCK_LABELED_BLOCK (node) = bc_label;
15301 CAN_COMPLETE_NORMALLY (bc_label) = 1;
15303 /* Our break/continue don't return values. */
15304 TREE_TYPE (node) = void_type_node;
15305 /* Encapsulate the break within a compound statement so that it's
15306 expanded all the times by expand_expr (and not clobbered
15307 sometimes, like after a if statement) */
15308 node = add_stmt_to_compound (NULL_TREE, void_type_node, node);
15309 TREE_SIDE_EFFECTS (node) = 1;
15313 /* Process the exit expression belonging to a loop. Its type must be
15317 patch_exit_expr (tree node)
15319 tree expression = TREE_OPERAND (node, 0);
15320 TREE_TYPE (node) = error_mark_node;
15321 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
15323 /* The type of expression must be boolean */
15324 if (TREE_TYPE (expression) != boolean_type_node)
15326 parse_error_context
15328 "Incompatible type for loop conditional. Can't convert `%s' to `boolean'",
15329 lang_printable_name (TREE_TYPE (expression), 0));
15330 return error_mark_node;
15332 /* Now we know things are allright, invert the condition, fold and
15334 TREE_OPERAND (node, 0) =
15335 fold (build1 (TRUTH_NOT_EXPR, boolean_type_node, expression));
15337 if (! integer_zerop (TREE_OPERAND (node, 0))
15338 && ctxp->current_loop != NULL_TREE
15339 && TREE_CODE (ctxp->current_loop) == LOOP_EXPR)
15340 CAN_COMPLETE_NORMALLY (ctxp->current_loop) = 1;
15341 if (! integer_onep (TREE_OPERAND (node, 0)))
15342 CAN_COMPLETE_NORMALLY (node) = 1;
15345 TREE_TYPE (node) = void_type_node;
15349 /* 14.9 Switch statement */
15352 patch_switch_statement (tree node)
15354 tree se = TREE_OPERAND (node, 0), se_type;
15357 /* Complete the switch expression */
15358 se = TREE_OPERAND (node, 0) = java_complete_tree (se);
15359 se_type = TREE_TYPE (se);
15360 /* The type of the switch expression must be char, byte, short or
15362 if (! JINTEGRAL_TYPE_P (se_type) || se_type == long_type_node)
15364 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
15365 parse_error_context (wfl_operator,
15366 "Incompatible type for `switch'. Can't convert `%s' to `int'",
15367 lang_printable_name (se_type, 0));
15368 /* This is what java_complete_tree will check */
15369 TREE_OPERAND (node, 0) = error_mark_node;
15370 return error_mark_node;
15373 /* Save and restore the outer case label list. */
15374 save = case_label_list;
15375 case_label_list = NULL_TREE;
15377 TREE_OPERAND (node, 1) = java_complete_tree (TREE_OPERAND (node, 1));
15379 /* See if we've found a duplicate label. We can't leave this until
15380 code generation, because in `--syntax-only' and `-C' modes we
15381 don't do ordinary code generation. */
15382 for (iter = case_label_list; iter != NULL_TREE; iter = TREE_CHAIN (iter))
15384 HOST_WIDE_INT val = TREE_INT_CST_LOW (TREE_VALUE (iter));
15386 for (subiter = TREE_CHAIN (iter);
15387 subiter != NULL_TREE;
15388 subiter = TREE_CHAIN (subiter))
15390 HOST_WIDE_INT subval = TREE_INT_CST_LOW (TREE_VALUE (subiter));
15393 EXPR_WFL_LINECOL (wfl_operator)
15394 = EXPR_WFL_LINECOL (TREE_PURPOSE (iter));
15395 /* The case_label_list is in reverse order, so print the
15396 outer label first. */
15397 parse_error_context (wfl_operator, "duplicate case label: `"
15398 HOST_WIDE_INT_PRINT_DEC "'", subval);
15399 EXPR_WFL_LINECOL (wfl_operator)
15400 = EXPR_WFL_LINECOL (TREE_PURPOSE (subiter));
15401 parse_error_context (wfl_operator, "original label is here");
15408 case_label_list = save;
15410 /* Ready to return */
15411 if (TREE_CODE (TREE_OPERAND (node, 1)) == ERROR_MARK)
15413 TREE_TYPE (node) = error_mark_node;
15414 return error_mark_node;
15416 TREE_TYPE (node) = void_type_node;
15417 TREE_SIDE_EFFECTS (node) = 1;
15418 CAN_COMPLETE_NORMALLY (node)
15419 = CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 1))
15420 || ! SWITCH_HAS_DEFAULT (node);
15426 /* Build an assertion expression for `assert CONDITION : VALUE'; VALUE
15427 might be NULL_TREE. */
15429 build_assertion (int location, tree condition, tree value)
15432 tree klass = GET_CPC ();
15434 if (! CLASS_USES_ASSERTIONS (klass))
15436 tree field, classdollar, id, call;
15437 tree class_type = TREE_TYPE (klass);
15439 field = add_field (class_type,
15440 get_identifier ("$assertionsDisabled"),
15442 ACC_PRIVATE | ACC_STATIC | ACC_FINAL);
15443 MAYBE_CREATE_VAR_LANG_DECL_SPECIFIC (field);
15444 FIELD_SYNTHETIC (field) = 1;
15446 if (!TYPE_DOT_CLASS (class_type))
15447 build_dot_class_method (class_type);
15448 classdollar = build_dot_class_method_invocation (class_type, class_type);
15450 /* Call CLASS.desiredAssertionStatus(). */
15451 id = build_wfl_node (get_identifier ("desiredAssertionStatus"));
15452 call = build (CALL_EXPR, NULL_TREE, id, NULL_TREE, NULL_TREE);
15453 call = make_qualified_primary (classdollar, call, location);
15454 TREE_SIDE_EFFECTS (call) = 1;
15456 /* Invert to obtain !CLASS.desiredAssertionStatus(). This may
15457 seem odd, but we do it to generate code identical to that of
15459 call = build1 (TRUTH_NOT_EXPR, NULL_TREE, call);
15460 TREE_SIDE_EFFECTS (call) = 1;
15461 DECL_INITIAL (field) = call;
15463 /* Record the initializer in the initializer statement list. */
15464 call = build (MODIFY_EXPR, NULL_TREE, field, call);
15465 TREE_CHAIN (call) = CPC_STATIC_INITIALIZER_STMT (ctxp);
15466 SET_CPC_STATIC_INITIALIZER_STMT (ctxp, call);
15467 MODIFY_EXPR_FROM_INITIALIZATION_P (call) = 1;
15469 CLASS_USES_ASSERTIONS (klass) = 1;
15472 if (value != NULL_TREE)
15473 value = tree_cons (NULL_TREE, value, NULL_TREE);
15475 node = build_wfl_node (get_identifier ("java"));
15476 node = make_qualified_name (node, build_wfl_node (get_identifier ("lang")),
15478 node = make_qualified_name (node, build_wfl_node (get_identifier ("AssertionError")),
15481 node = build (NEW_CLASS_EXPR, NULL_TREE, node, value, NULL_TREE);
15482 TREE_SIDE_EFFECTS (node) = 1;
15483 /* It is too early to use BUILD_THROW. */
15484 node = build1 (THROW_EXPR, NULL_TREE, node);
15485 TREE_SIDE_EFFECTS (node) = 1;
15487 /* We invert the condition; if we just put NODE as the `else' part
15488 then we generate weird-looking bytecode. */
15489 condition = build1 (TRUTH_NOT_EXPR, NULL_TREE, condition);
15490 /* Check $assertionsDisabled. */
15492 = build (TRUTH_ANDIF_EXPR, NULL_TREE,
15493 build1 (TRUTH_NOT_EXPR, NULL_TREE,
15494 build_wfl_node (get_identifier ("$assertionsDisabled"))),
15496 node = build_if_else_statement (location, condition, node, NULL_TREE);
15500 /* 14.18 The try/catch statements */
15502 /* Encapsulate TRY_STMTS' in a try catch sequence. The catch clause
15503 catches TYPE and executes CATCH_STMTS. */
15506 encapsulate_with_try_catch (int location, tree type_or_name, tree try_stmts,
15509 tree try_block, catch_clause_param, catch_block, catch;
15511 /* First build a try block */
15512 try_block = build_expr_block (try_stmts, NULL_TREE);
15514 /* Build a catch block: we need a catch clause parameter */
15515 if (TREE_CODE (type_or_name) == EXPR_WITH_FILE_LOCATION)
15517 tree catch_type = obtain_incomplete_type (type_or_name);
15519 catch_clause_param = build_decl (VAR_DECL, wpv_id, catch_type);
15520 register_incomplete_type (JDEP_VARIABLE, type_or_name,
15521 catch_clause_param, catch_type);
15522 dep = CLASSD_LAST (ctxp->classd_list);
15523 JDEP_GET_PATCH (dep) = &TREE_TYPE (catch_clause_param);
15526 catch_clause_param = build_decl (VAR_DECL, wpv_id,
15527 build_pointer_type (type_or_name));
15530 catch_block = build_expr_block (NULL_TREE, catch_clause_param);
15532 /* Initialize the variable and store in the block */
15533 catch = build (MODIFY_EXPR, NULL_TREE, catch_clause_param,
15534 build (JAVA_EXC_OBJ_EXPR, ptr_type_node));
15535 add_stmt_to_block (catch_block, NULL_TREE, catch);
15537 /* Add the catch statements */
15538 add_stmt_to_block (catch_block, NULL_TREE, catch_stmts);
15540 /* Now we can build a CATCH_EXPR */
15541 catch_block = build1 (CATCH_EXPR, NULL_TREE, catch_block);
15543 return build_try_statement (location, try_block, catch_block);
15547 build_try_statement (int location, tree try_block, tree catches)
15549 tree node = build (TRY_EXPR, NULL_TREE, try_block, catches);
15550 EXPR_WFL_LINECOL (node) = location;
15555 build_try_finally_statement (int location, tree try_block, tree finally)
15557 tree node = build (TRY_FINALLY_EXPR, NULL_TREE, try_block, finally);
15558 EXPR_WFL_LINECOL (node) = location;
15563 patch_try_statement (tree node)
15565 int error_found = 0;
15566 tree try = TREE_OPERAND (node, 0);
15567 /* Exception handlers are considered in left to right order */
15568 tree catch = nreverse (TREE_OPERAND (node, 1));
15569 tree current, caught_type_list = NULL_TREE;
15571 /* Check catch clauses, if any. Every time we find an error, we try
15572 to process the next catch clause. We process the catch clause before
15573 the try block so that when processing the try block we can check thrown
15574 exceptions againts the caught type list. */
15575 for (current = catch; current; current = TREE_CHAIN (current))
15577 tree carg_decl, carg_type;
15578 tree sub_current, catch_block, catch_clause;
15581 /* At this point, the structure of the catch clause is
15582 CATCH_EXPR (catch node)
15583 BLOCK (with the decl of the parameter)
15585 MODIFY_EXPR (assignment of the catch parameter)
15586 BLOCK (catch clause block)
15588 catch_clause = TREE_OPERAND (current, 0);
15589 carg_decl = BLOCK_EXPR_DECLS (catch_clause);
15590 carg_type = TREE_TYPE (TREE_TYPE (carg_decl));
15592 /* Catch clauses can't have more than one parameter declared,
15593 but it's already enforced by the grammar. Make sure that the
15594 only parameter of the clause statement in of class Throwable
15595 or a subclass of Throwable, but that was done earlier. The
15596 catch clause parameter type has also been resolved. */
15598 /* Just make sure that the catch clause parameter type inherits
15599 from java.lang.Throwable */
15600 if (!inherits_from_p (carg_type, throwable_type_node))
15602 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (current);
15603 parse_error_context (wfl_operator,
15604 "Can't catch class `%s'. Catch clause parameter type must be a subclass of class `java.lang.Throwable'",
15605 lang_printable_name (carg_type, 0));
15610 /* Partial check for unreachable catch statement: The catch
15611 clause is reachable iff is no earlier catch block A in
15612 the try statement such that the type of the catch
15613 clause's parameter is the same as or a subclass of the
15614 type of A's parameter */
15616 for (sub_current = catch;
15617 sub_current != current; sub_current = TREE_CHAIN (sub_current))
15619 tree sub_catch_clause, decl;
15620 sub_catch_clause = TREE_OPERAND (sub_current, 0);
15621 decl = BLOCK_EXPR_DECLS (sub_catch_clause);
15623 if (inherits_from_p (carg_type, TREE_TYPE (TREE_TYPE (decl))))
15625 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (current);
15626 parse_error_context
15628 "`catch' not reached because of the catch clause at line %d",
15629 EXPR_WFL_LINENO (sub_current));
15630 unreachable = error_found = 1;
15634 /* Complete the catch clause block */
15635 catch_block = java_complete_tree (TREE_OPERAND (current, 0));
15636 if (catch_block == error_mark_node)
15641 if (CAN_COMPLETE_NORMALLY (catch_block))
15642 CAN_COMPLETE_NORMALLY (node) = 1;
15643 TREE_OPERAND (current, 0) = catch_block;
15648 /* Things to do here: the exception must be thrown */
15650 /* Link this type to the caught type list */
15651 caught_type_list = tree_cons (NULL_TREE, carg_type, caught_type_list);
15654 PUSH_EXCEPTIONS (caught_type_list);
15655 if ((try = java_complete_tree (try)) == error_mark_node)
15657 if (CAN_COMPLETE_NORMALLY (try))
15658 CAN_COMPLETE_NORMALLY (node) = 1;
15661 /* Verification ends here */
15663 return error_mark_node;
15665 TREE_OPERAND (node, 0) = try;
15666 TREE_OPERAND (node, 1) = catch;
15667 TREE_TYPE (node) = void_type_node;
15671 /* 14.17 The synchronized Statement */
15674 patch_synchronized_statement (tree node, tree wfl_op1)
15676 tree expr = java_complete_tree (TREE_OPERAND (node, 0));
15677 tree block = TREE_OPERAND (node, 1);
15679 tree tmp, enter, exit, expr_decl, assignment;
15681 if (expr == error_mark_node)
15683 block = java_complete_tree (block);
15687 /* We might be trying to synchronize on a STRING_CST */
15688 if ((tmp = patch_string (expr)))
15691 /* The TYPE of expr must be a reference type */
15692 if (!JREFERENCE_TYPE_P (TREE_TYPE (expr)))
15694 SET_WFL_OPERATOR (wfl_operator, node, wfl_op1);
15695 parse_error_context (wfl_operator, "Incompatible type for `synchronized'. Can't convert `%s' to `java.lang.Object'",
15696 lang_printable_name (TREE_TYPE (expr), 0));
15697 return error_mark_node;
15700 if (flag_emit_xref)
15702 TREE_OPERAND (node, 0) = expr;
15703 TREE_OPERAND (node, 1) = java_complete_tree (block);
15704 CAN_COMPLETE_NORMALLY (node) = 1;
15708 /* Generate a try-finally for the synchronized statement, except
15709 that the handler that catches all throw exception calls
15710 _Jv_MonitorExit and then rethrow the exception.
15711 The synchronized statement is then implemented as:
15714 _Jv_MonitorEnter (expression)
15716 _Jv_MonitorExit (expression)
15720 e = _Jv_exception_info ();
15721 _Jv_MonitorExit (expression)
15725 expr_decl = build_decl (VAR_DECL, generate_name (), TREE_TYPE (expr));
15726 BUILD_MONITOR_ENTER (enter, expr_decl);
15727 BUILD_MONITOR_EXIT (exit, expr_decl);
15728 CAN_COMPLETE_NORMALLY (enter) = 1;
15729 CAN_COMPLETE_NORMALLY (exit) = 1;
15730 assignment = build (MODIFY_EXPR, NULL_TREE, expr_decl, expr);
15731 TREE_SIDE_EFFECTS (assignment) = 1;
15732 node = build (COMPOUND_EXPR, NULL_TREE,
15733 build (COMPOUND_EXPR, NULL_TREE, assignment, enter),
15734 build (TRY_FINALLY_EXPR, NULL_TREE, block, exit));
15735 node = build_expr_block (node, expr_decl);
15737 return java_complete_tree (node);
15740 /* 14.16 The throw Statement */
15743 patch_throw_statement (tree node, tree wfl_op1)
15745 tree expr = TREE_OPERAND (node, 0);
15746 tree type = TREE_TYPE (expr);
15747 int unchecked_ok = 0, tryblock_throws_ok = 0;
15749 /* Thrown expression must be assignable to java.lang.Throwable */
15750 if (!try_reference_assignconv (throwable_type_node, expr))
15752 SET_WFL_OPERATOR (wfl_operator, node, wfl_op1);
15753 parse_error_context (wfl_operator,
15754 "Can't throw `%s'; it must be a subclass of class `java.lang.Throwable'",
15755 lang_printable_name (type, 0));
15756 /* If the thrown expression was a reference, we further the
15757 compile-time check. */
15758 if (!JREFERENCE_TYPE_P (type))
15759 return error_mark_node;
15762 /* At least one of the following must be true */
15764 /* The type of the throw expression is a not checked exception,
15765 i.e. is a unchecked expression. */
15766 unchecked_ok = IS_UNCHECKED_EXCEPTION_P (TREE_TYPE (type));
15768 SET_WFL_OPERATOR (wfl_operator, node, wfl_op1);
15769 /* An instance can't throw a checked exception unless that exception
15770 is explicitly declared in the `throws' clause of each
15771 constructor. This doesn't apply to anonymous classes, since they
15772 don't have declared constructors. */
15774 && DECL_INSTINIT_P (current_function_decl)
15775 && !ANONYMOUS_CLASS_P (current_class))
15778 for (current = TYPE_METHODS (current_class); current;
15779 current = TREE_CHAIN (current))
15780 if (DECL_CONSTRUCTOR_P (current)
15781 && !check_thrown_exceptions_do (TREE_TYPE (expr)))
15783 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)",
15784 lang_printable_name (TREE_TYPE (expr), 0));
15785 return error_mark_node;
15789 /* Throw is contained in a try statement and at least one catch
15790 clause can receive the thrown expression or the current method is
15791 declared to throw such an exception. Or, the throw statement is
15792 contained in a method or constructor declaration and the type of
15793 the Expression is assignable to at least one type listed in the
15794 throws clause the declaration. */
15796 tryblock_throws_ok = check_thrown_exceptions_do (TREE_TYPE (expr));
15797 if (!(unchecked_ok || tryblock_throws_ok))
15799 /* If there is a surrounding try block that has no matching
15800 clatch clause, report it first. A surrounding try block exits
15801 only if there is something after the list of checked
15802 exception thrown by the current function (if any). */
15803 if (IN_TRY_BLOCK_P ())
15804 parse_error_context (wfl_operator, "Checked exception `%s' can't be caught by any of the catch clause(s) of the surrounding `try' block",
15805 lang_printable_name (type, 0));
15806 /* If we have no surrounding try statement and the method doesn't have
15807 any throws, report it now. FIXME */
15809 /* We report that the exception can't be throw from a try block
15810 in all circumstances but when the `throw' is inside a static
15812 else if (!EXCEPTIONS_P (currently_caught_type_list)
15813 && !tryblock_throws_ok)
15815 if (DECL_CLINIT_P (current_function_decl))
15816 parse_error_context (wfl_operator,
15817 "Checked exception `%s' can't be thrown in initializer",
15818 lang_printable_name (type, 0));
15820 parse_error_context (wfl_operator,
15821 "Checked exception `%s' isn't thrown from a `try' block",
15822 lang_printable_name (type, 0));
15824 /* Otherwise, the current method doesn't have the appropriate
15825 throws declaration */
15827 parse_error_context (wfl_operator, "Checked exception `%s' doesn't match any of current method's `throws' declaration(s)",
15828 lang_printable_name (type, 0));
15829 return error_mark_node;
15832 if (! flag_emit_class_files && ! flag_emit_xref)
15833 BUILD_THROW (node, expr);
15835 /* If doing xrefs, keep the location where the `throw' was seen. */
15836 if (flag_emit_xref)
15837 EXPR_WFL_LINECOL (node) = EXPR_WFL_LINECOL (wfl_op1);
15841 /* Check that exception said to be thrown by method DECL can be
15842 effectively caught from where DECL is invoked. THIS_EXPR is the
15843 expression that computes `this' for the method call. */
15845 check_thrown_exceptions (int location, tree decl, tree this_expr)
15848 int is_array_call = 0;
15850 /* Skip check within generated methods, such as access$<n>. */
15851 if (OUTER_FIELD_ACCESS_IDENTIFIER_P (DECL_NAME (current_function_decl)))
15854 if (this_expr != NULL_TREE
15855 && TREE_CODE (TREE_TYPE (this_expr)) == POINTER_TYPE
15856 && TYPE_ARRAY_P (TREE_TYPE (TREE_TYPE (this_expr))))
15859 /* For all the unchecked exceptions thrown by DECL. */
15860 for (throws = DECL_FUNCTION_THROWS (decl); throws;
15861 throws = TREE_CHAIN (throws))
15862 if (!check_thrown_exceptions_do (TREE_VALUE (throws)))
15864 /* Suppress errors about cloning arrays. */
15865 if (is_array_call && DECL_NAME (decl) == get_identifier ("clone"))
15868 EXPR_WFL_LINECOL (wfl_operator) = location;
15869 if (DECL_FINIT_P (current_function_decl))
15870 parse_error_context
15871 (wfl_operator, "Exception `%s' can't be thrown in initializer",
15872 lang_printable_name (TREE_VALUE (throws), 0));
15875 parse_error_context
15876 (wfl_operator, "Exception `%s' must be caught, or it must be declared in the `throws' clause of `%s'",
15877 lang_printable_name (TREE_VALUE (throws), 0),
15878 (DECL_INIT_P (current_function_decl) ?
15879 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (current_class))) :
15880 IDENTIFIER_POINTER (DECL_NAME (current_function_decl))));
15885 /* Return 1 if checked EXCEPTION is caught at the current nesting level of
15886 try-catch blocks, OR is listed in the `throws' clause of the
15890 check_thrown_exceptions_do (tree exception)
15892 tree list = currently_caught_type_list;
15893 resolve_and_layout (exception, NULL_TREE);
15894 /* First, all the nested try-catch-finally at that stage. The
15895 last element contains `throws' clause exceptions, if any. */
15896 if (IS_UNCHECKED_EXCEPTION_P (exception))
15901 for (caught = TREE_VALUE (list); caught; caught = TREE_CHAIN (caught))
15902 if (valid_ref_assignconv_cast_p (exception, TREE_VALUE (caught), 0))
15904 list = TREE_CHAIN (list);
15910 purge_unchecked_exceptions (tree mdecl)
15912 tree throws = DECL_FUNCTION_THROWS (mdecl);
15913 tree new = NULL_TREE;
15917 tree next = TREE_CHAIN (throws);
15918 if (!IS_UNCHECKED_EXCEPTION_P (TREE_VALUE (throws)))
15920 TREE_CHAIN (throws) = new;
15925 /* List is inverted here, but it doesn't matter */
15926 DECL_FUNCTION_THROWS (mdecl) = new;
15929 /* This function goes over all of CLASS_TYPE ctors and checks whether
15930 each of them features at least one unchecked exception in its
15931 `throws' clause. If it's the case, it returns `true', `false'
15935 ctors_unchecked_throws_clause_p (tree class_type)
15939 for (current = TYPE_METHODS (class_type); current;
15940 current = TREE_CHAIN (current))
15942 bool ctu = false; /* Ctor Throws Unchecked */
15943 if (DECL_CONSTRUCTOR_P (current))
15946 for (throws = DECL_FUNCTION_THROWS (current); throws && !ctu;
15947 throws = TREE_CHAIN (throws))
15948 if (inherits_from_p (TREE_VALUE (throws), exception_type_node))
15951 /* We return false as we found one ctor that is unfit. */
15952 if (!ctu && DECL_CONSTRUCTOR_P (current))
15955 /* All ctors feature at least one unchecked exception in their
15956 `throws' clause. */
15960 /* 15.24 Conditional Operator ?: */
15963 patch_conditional_expr (tree node, tree wfl_cond, tree wfl_op1)
15965 tree cond = TREE_OPERAND (node, 0);
15966 tree op1 = TREE_OPERAND (node, 1);
15967 tree op2 = TREE_OPERAND (node, 2);
15968 tree resulting_type = NULL_TREE;
15969 tree t1, t2, patched;
15970 int error_found = 0;
15972 /* Operands of ?: might be StringBuffers crafted as a result of a
15973 string concatenation. Obtain a descent operand here. */
15974 if ((patched = patch_string (op1)))
15975 TREE_OPERAND (node, 1) = op1 = patched;
15976 if ((patched = patch_string (op2)))
15977 TREE_OPERAND (node, 2) = op2 = patched;
15979 t1 = TREE_TYPE (op1);
15980 t2 = TREE_TYPE (op2);
15982 /* The first expression must be a boolean */
15983 if (TREE_TYPE (cond) != boolean_type_node)
15985 SET_WFL_OPERATOR (wfl_operator, node, wfl_cond);
15986 parse_error_context (wfl_operator,
15987 "Incompatible type for `?:'. Can't convert `%s' to `boolean'",
15988 lang_printable_name (TREE_TYPE (cond), 0));
15992 /* Second and third can be numeric, boolean (i.e. primitive),
15993 references or null. Anything else results in an error */
15994 if (!((JNUMERIC_TYPE_P (t1) && JNUMERIC_TYPE_P (t2))
15995 || ((JREFERENCE_TYPE_P (t1) || op1 == null_pointer_node)
15996 && (JREFERENCE_TYPE_P (t2) || op2 == null_pointer_node))
15997 || (t1 == boolean_type_node && t2 == boolean_type_node)))
16000 /* Determine the type of the conditional expression. Same types are
16001 easy to deal with */
16003 resulting_type = t1;
16005 /* There are different rules for numeric types */
16006 else if (JNUMERIC_TYPE_P (t1))
16008 /* if byte/short found, the resulting type is short */
16009 if ((t1 == byte_type_node && t2 == short_type_node)
16010 || (t1 == short_type_node && t2 == byte_type_node))
16011 resulting_type = short_type_node;
16013 /* If t1 is a constant int and t2 is of type byte, short or char
16014 and t1's value fits in t2, then the resulting type is t2 */
16015 else if ((t1 == int_type_node && TREE_CONSTANT (TREE_OPERAND (node, 1)))
16016 && JBSC_TYPE_P (t2) && int_fits_type_p (TREE_OPERAND (node, 1), t2))
16017 resulting_type = t2;
16019 /* If t2 is a constant int and t1 is of type byte, short or char
16020 and t2's value fits in t1, then the resulting type is t1 */
16021 else if ((t2 == int_type_node && TREE_CONSTANT (TREE_OPERAND (node, 2)))
16022 && JBSC_TYPE_P (t1) && int_fits_type_p (TREE_OPERAND (node, 2), t1))
16023 resulting_type = t1;
16025 /* Otherwise, binary numeric promotion is applied and the
16026 resulting type is the promoted type of operand 1 and 2 */
16028 resulting_type = binary_numeric_promotion (t1, t2,
16029 &TREE_OPERAND (node, 1),
16030 &TREE_OPERAND (node, 2));
16033 /* Cases of a reference and a null type */
16034 else if (JREFERENCE_TYPE_P (t1) && op2 == null_pointer_node)
16035 resulting_type = t1;
16037 else if (JREFERENCE_TYPE_P (t2) && op1 == null_pointer_node)
16038 resulting_type = t2;
16040 /* Last case: different reference types. If a type can be converted
16041 into the other one by assignment conversion, the latter
16042 determines the type of the expression */
16043 else if ((resulting_type = try_reference_assignconv (t1, op2)))
16044 resulting_type = promote_type (t1);
16046 else if ((resulting_type = try_reference_assignconv (t2, op1)))
16047 resulting_type = promote_type (t2);
16049 /* If we don't have any resulting type, we're in trouble */
16050 if (!resulting_type)
16052 char *t = xstrdup (lang_printable_name (t1, 0));
16053 SET_WFL_OPERATOR (wfl_operator, node, wfl_op1);
16054 parse_error_context (wfl_operator,
16055 "Incompatible type for `?:'. Can't convert `%s' to `%s'",
16056 t, lang_printable_name (t2, 0));
16063 TREE_TYPE (node) = error_mark_node;
16064 return error_mark_node;
16067 TREE_TYPE (node) = resulting_type;
16068 TREE_SET_CODE (node, COND_EXPR);
16069 CAN_COMPLETE_NORMALLY (node) = 1;
16073 /* Wrap EXPR with code to initialize DECL's class, if appropriate. */
16076 maybe_build_class_init_for_field (tree decl, tree expr)
16078 tree clas = DECL_CONTEXT (decl);
16079 if (flag_emit_class_files || flag_emit_xref)
16082 if (TREE_CODE (decl) == VAR_DECL && FIELD_STATIC (decl)
16083 && FIELD_FINAL (decl))
16085 tree init = DECL_INITIAL (decl);
16086 if (init != NULL_TREE)
16087 init = fold_constant_for_init (init, decl);
16088 if (init != NULL_TREE && CONSTANT_VALUE_P (init))
16092 return build_class_init (clas, expr);
16095 /* Try to constant fold NODE.
16096 If NODE is not a constant expression, return NULL_EXPR.
16097 CONTEXT is a static final VAR_DECL whose initializer we are folding. */
16100 fold_constant_for_init (tree node, tree context)
16102 tree op0, op1, val;
16103 enum tree_code code = TREE_CODE (node);
16108 if (node == null_pointer_node)
16117 case TRUNC_MOD_EXPR:
16125 case TRUTH_ANDIF_EXPR:
16126 case TRUTH_ORIF_EXPR:
16133 op0 = TREE_OPERAND (node, 0);
16134 op1 = TREE_OPERAND (node, 1);
16135 val = fold_constant_for_init (op0, context);
16136 if (val == NULL_TREE || ! TREE_CONSTANT (val))
16138 TREE_OPERAND (node, 0) = val;
16139 val = fold_constant_for_init (op1, context);
16140 if (val == NULL_TREE || ! TREE_CONSTANT (val))
16142 TREE_OPERAND (node, 1) = val;
16143 return patch_binop (node, op0, op1);
16145 case UNARY_PLUS_EXPR:
16147 case TRUTH_NOT_EXPR:
16150 op0 = TREE_OPERAND (node, 0);
16151 val = fold_constant_for_init (op0, context);
16152 if (val == NULL_TREE || ! TREE_CONSTANT (val))
16154 TREE_OPERAND (node, 0) = val;
16155 val = patch_unaryop (node, op0);
16156 if (! TREE_CONSTANT (val))
16163 val = fold_constant_for_init (TREE_OPERAND (node, 0), context);
16164 if (val == NULL_TREE || ! TREE_CONSTANT (val))
16166 TREE_OPERAND (node, 0) = val;
16167 val = fold_constant_for_init (TREE_OPERAND (node, 1), context);
16168 if (val == NULL_TREE || ! TREE_CONSTANT (val))
16170 TREE_OPERAND (node, 1) = val;
16171 val = fold_constant_for_init (TREE_OPERAND (node, 2), context);
16172 if (val == NULL_TREE || ! TREE_CONSTANT (val))
16174 TREE_OPERAND (node, 2) = val;
16175 return integer_zerop (TREE_OPERAND (node, 0)) ? TREE_OPERAND (node, 1)
16176 : TREE_OPERAND (node, 2);
16180 if (! FIELD_FINAL (node)
16181 || DECL_INITIAL (node) == NULL_TREE)
16183 val = DECL_INITIAL (node);
16184 /* Guard against infinite recursion. */
16185 DECL_INITIAL (node) = NULL_TREE;
16186 val = fold_constant_for_init (val, node);
16187 if (val != NULL_TREE && TREE_CODE (val) != STRING_CST)
16188 val = try_builtin_assignconv (NULL_TREE, TREE_TYPE (node), val);
16189 DECL_INITIAL (node) = val;
16192 case EXPR_WITH_FILE_LOCATION:
16193 /* Compare java_complete_tree and resolve_expression_name. */
16194 if (!EXPR_WFL_NODE (node) /* Or a PRIMARY flag ? */
16195 || TREE_CODE (EXPR_WFL_NODE (node)) == IDENTIFIER_NODE)
16197 tree name = EXPR_WFL_NODE (node);
16199 if (PRIMARY_P (node))
16201 else if (! QUALIFIED_P (name))
16203 decl = lookup_field_wrapper (DECL_CONTEXT (context), name);
16204 if (decl == NULL_TREE
16205 || (! FIELD_STATIC (decl) && ! FIELD_FINAL (decl)))
16207 return fold_constant_for_init (decl, decl);
16211 /* Install the proper context for the field resolution.
16212 The prior context is restored once the name is
16213 properly qualified. */
16214 tree saved_current_class = current_class;
16215 /* Wait until the USE_COMPONENT_REF re-write. FIXME. */
16216 current_class = DECL_CONTEXT (context);
16217 qualify_ambiguous_name (node);
16218 current_class = saved_current_class;
16219 if (resolve_field_access (node, &decl, NULL)
16220 && decl != NULL_TREE)
16221 return fold_constant_for_init (decl, decl);
16227 op0 = TREE_OPERAND (node, 0);
16228 val = fold_constant_for_init (op0, context);
16229 if (val == NULL_TREE || ! TREE_CONSTANT (val))
16231 TREE_OPERAND (node, 0) = val;
16235 #ifdef USE_COMPONENT_REF
16237 case COMPONENT_REF:
16246 #ifdef USE_COMPONENT_REF
16247 /* Context is 'T' for TypeName, 'P' for PackageName,
16248 'M' for MethodName, 'E' for ExpressionName, and 'A' for AmbiguousName. */
16251 resolve_simple_name (tree name, int context)
16256 resolve_qualified_name (tree name, int context)
16262 init_src_parse (void)
16264 /* Sanity check; we've been bit by this before. */
16265 if (ARRAY_SIZE (ctxp->modifier_ctx) != MODIFIER_TK - PUBLIC_TK)
16271 /* This section deals with the functions that are called when tables
16272 recording class initialization information are traversed. */
16274 /* Attach to PTR (a block) the declaration found in ENTRY. */
16277 attach_init_test_initialization_flags (void **entry, void *ptr)
16279 tree block = (tree)ptr;
16280 struct treetreehash_entry *ite = (struct treetreehash_entry *) *entry;
16282 if (block != error_mark_node)
16284 TREE_CHAIN (ite->value) = BLOCK_EXPR_DECLS (block);
16285 BLOCK_EXPR_DECLS (block) = ite->value;
16290 /* This function is called for each class that is known definitely
16291 initialized when a given static method was called. This function
16292 augments a compound expression (INFO) storing all assignment to
16293 initialized static class flags if a flag already existed, otherwise
16294 a new one is created. */
16297 emit_test_initialization (void **entry_p, void *info)
16299 tree l = (tree) info;
16301 tree key = (tree) *entry_p;
16303 htab_t cf_ht = DECL_FUNCTION_INIT_TEST_TABLE (current_function_decl);
16305 /* If we haven't found a flag and we're dealing with self registered
16306 with current_function_decl, then don't do anything. Self is
16307 always added as definitely initialized but this information is
16308 valid only if used outside the current function. */
16309 if (current_function_decl == TREE_PURPOSE (l)
16310 && java_treetreehash_find (cf_ht, key) == NULL)
16313 ite = java_treetreehash_new (cf_ht, key);
16315 /* If we don't have a variable, create one and install it. */
16320 decl = build_decl (VAR_DECL, NULL_TREE, boolean_type_node);
16321 MAYBE_CREATE_VAR_LANG_DECL_SPECIFIC (decl);
16322 LOCAL_CLASS_INITIALIZATION_FLAG (decl) = 1;
16323 DECL_CONTEXT (decl) = current_function_decl;
16324 DECL_INITIAL (decl) = boolean_true_node;
16325 /* Don't emit any symbolic debugging info for this decl. */
16326 DECL_IGNORED_P (decl) = 1;
16328 /* The trick is to find the right context for it. */
16329 block = BLOCK_SUBBLOCKS (GET_CURRENT_BLOCK (current_function_decl));
16330 TREE_CHAIN (decl) = BLOCK_EXPR_DECLS (block);
16331 BLOCK_EXPR_DECLS (block) = decl;
16337 /* Now simply augment the compound that holds all the assignments
16338 pertaining to this method invocation. */
16339 init = build (MODIFY_EXPR, boolean_type_node, decl, boolean_true_node);
16340 TREE_SIDE_EFFECTS (init) = 1;
16341 TREE_VALUE (l) = add_stmt_to_compound (TREE_VALUE (l), void_type_node, init);
16342 TREE_SIDE_EFFECTS (TREE_VALUE (l)) = 1;
16347 #include "gt-java-parse.h"
16348 #include "gtype-java.h"