1 /* Source code parsing and tree node generation for the GNU compiler
2 for the Java(TM) language.
3 Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004
4 Free Software Foundation, Inc.
5 Contributed by Alexandre Petit-Bianco (apbianco@cygnus.com)
7 This file is part of GCC.
9 GCC is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 2, or (at your option)
14 GCC is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
19 You should have received a copy of the GNU General Public License
20 along with GCC; see the file COPYING. If not, write to
21 the Free Software Foundation, 59 Temple Place - Suite 330,
22 Boston, MA 02111-1307, USA.
24 Java and all Java-based marks are trademarks or registered trademarks
25 of Sun Microsystems, Inc. in the United States and other countries.
26 The Free Software Foundation is independent of Sun Microsystems, Inc. */
28 /* This file parses java source code and issues a tree node image
29 suitable for code generation (byte code and targeted CPU assembly
32 The grammar conforms to the Java grammar described in "The Java(TM)
33 Language Specification. J. Gosling, B. Joy, G. Steele. Addison Wesley
34 1996, ISBN 0-201-63451-1"
36 The following modifications were brought to the original grammar:
38 method_body: added the rule '| block SC_TK'
39 static_initializer: added the rule 'static block SC_TK'.
41 Note: All the extra rules described above should go away when the
42 empty_statement rule will work.
44 statement_nsi: 'nsi' should be read no_short_if.
46 Some rules have been modified to support JDK1.1 inner classes
47 definitions and other extensions. */
52 #include "coretypes.h"
61 #include "java-tree.h"
73 #include "tree-inline.h"
77 /* Local function prototypes */
78 static char *java_accstring_lookup (int);
79 static const char *accessibility_string (int);
80 static void classitf_redefinition_error (const char *,tree, tree, tree);
81 static void variable_redefinition_error (tree, tree, tree, int);
82 static tree create_class (int, tree, tree, tree);
83 static tree create_interface (int, tree, tree);
84 static void end_class_declaration (int);
85 static tree find_field (tree, tree);
86 static tree lookup_field_wrapper (tree, tree);
87 static int duplicate_declaration_error_p (tree, tree, tree);
88 static void register_fields (int, tree, tree);
89 static tree parser_qualified_classname (tree);
90 static int parser_check_super (tree, tree, tree);
91 static int parser_check_super_interface (tree, tree, tree);
92 static void check_modifiers_consistency (int);
93 static tree lookup_cl (tree);
94 static tree lookup_java_method2 (tree, tree, int);
95 static tree method_header (int, tree, tree, tree);
96 static void fix_method_argument_names (tree ,tree);
97 static tree method_declarator (tree, tree);
98 static void parse_warning_context (tree cl, const char *msg, ...)
100 static void issue_warning_error_from_context (tree, const char *msg, va_list)
101 ATTRIBUTE_PRINTF (2, 0);
102 static void parse_ctor_invocation_error (void);
103 static tree parse_jdk1_1_error (const char *);
104 static void complete_class_report_errors (jdep *);
105 static int process_imports (void);
106 static void read_import_dir (tree);
107 static int find_in_imports_on_demand (tree, tree);
108 static void find_in_imports (tree, tree);
109 static void check_inner_class_access (tree, tree, tree);
110 static int check_pkg_class_access (tree, tree, bool, tree);
111 static void register_package (tree);
112 static tree resolve_package (tree, tree *, tree *);
113 static tree resolve_class (tree, tree, tree, tree);
114 static void declare_local_variables (int, tree, tree);
115 static void dump_java_tree (enum tree_dump_index, tree);
116 static void source_start_java_method (tree);
117 static void source_end_java_method (void);
118 static tree find_name_in_single_imports (tree);
119 static void check_abstract_method_header (tree);
120 static tree lookup_java_interface_method2 (tree, tree);
121 static tree resolve_expression_name (tree, tree *);
122 static tree maybe_create_class_interface_decl (tree, tree, tree, tree);
123 static int check_class_interface_creation (int, int, tree, tree, tree, tree);
124 static tree patch_method_invocation (tree, tree, tree, int, int *, tree *);
125 static tree resolve_and_layout (tree, tree);
126 static tree qualify_and_find (tree, tree, tree);
127 static tree resolve_no_layout (tree, tree);
128 static int invocation_mode (tree, int);
129 static tree find_applicable_accessible_methods_list (int, tree, tree, tree);
130 static void search_applicable_methods_list (int, tree, tree, tree, tree *, tree *);
131 static tree find_most_specific_methods_list (tree);
132 static int argument_types_convertible (tree, tree);
133 static tree patch_invoke (tree, tree, tree);
134 static int maybe_use_access_method (int, tree *, tree *);
135 static tree lookup_method_invoke (int, tree, tree, tree, tree);
136 static tree register_incomplete_type (int, tree, tree, tree);
137 static tree check_inner_circular_reference (tree, tree);
138 static tree check_circular_reference (tree);
139 static tree obtain_incomplete_type (tree);
140 static tree java_complete_lhs (tree);
141 static tree java_complete_tree (tree);
142 static tree maybe_generate_pre_expand_clinit (tree);
143 static int analyze_clinit_body (tree, tree);
144 static int maybe_yank_clinit (tree);
145 static void start_complete_expand_method (tree);
146 static void java_complete_expand_method (tree);
147 static void java_expand_method_bodies (tree);
148 static int unresolved_type_p (tree, tree *);
149 static void create_jdep_list (struct parser_ctxt *);
150 static tree build_expr_block (tree, tree);
151 static tree enter_block (void);
152 static tree exit_block (void);
153 static tree lookup_name_in_blocks (tree);
154 static void maybe_absorb_scoping_blocks (void);
155 static tree build_method_invocation (tree, tree);
156 static tree build_new_invocation (tree, tree);
157 static tree build_assignment (int, int, tree, tree);
158 static tree build_binop (enum tree_code, int, tree, tree);
159 static tree patch_assignment (tree, tree);
160 static tree patch_binop (tree, tree, tree);
161 static tree build_unaryop (int, int, tree);
162 static tree build_incdec (int, int, tree, int);
163 static tree patch_unaryop (tree, tree);
164 static tree build_cast (int, tree, tree);
165 static tree build_null_of_type (tree);
166 static tree patch_cast (tree, tree);
167 static int valid_ref_assignconv_cast_p (tree, tree, int);
168 static int valid_builtin_assignconv_identity_widening_p (tree, tree);
169 static int valid_cast_to_p (tree, tree);
170 static int valid_method_invocation_conversion_p (tree, tree);
171 static tree try_builtin_assignconv (tree, tree, tree);
172 static tree try_reference_assignconv (tree, tree);
173 static tree build_unresolved_array_type (tree);
174 static int build_type_name_from_array_name (tree, tree *);
175 static tree build_array_from_name (tree, tree, tree, tree *);
176 static tree build_array_ref (int, tree, tree);
177 static tree patch_array_ref (tree);
178 static tree make_qualified_name (tree, tree, int);
179 static tree merge_qualified_name (tree, tree);
180 static tree make_qualified_primary (tree, tree, int);
181 static int resolve_qualified_expression_name (tree, tree *, tree *, tree *);
182 static void qualify_ambiguous_name (tree);
183 static tree resolve_field_access (tree, tree *, tree *);
184 static tree build_newarray_node (tree, tree, int);
185 static tree patch_newarray (tree);
186 static tree resolve_type_during_patch (tree);
187 static tree build_this (int);
188 static tree build_wfl_wrap (tree, int);
189 static tree build_return (int, tree);
190 static tree patch_return (tree);
191 static tree maybe_access_field (tree, tree, tree);
192 static int complete_function_arguments (tree);
193 static int check_for_static_method_reference (tree, tree, tree, tree, tree);
194 static int not_accessible_p (tree, tree, tree, int);
195 static void check_deprecation (tree, tree);
196 static int class_in_current_package (tree);
197 static tree build_if_else_statement (int, tree, tree, tree);
198 static tree patch_if_else_statement (tree);
199 static tree add_stmt_to_block (tree, tree, tree);
200 static tree patch_exit_expr (tree);
201 static tree build_labeled_block (int, tree);
202 static tree finish_labeled_statement (tree, tree);
203 static tree build_bc_statement (int, int, tree);
204 static tree patch_bc_statement (tree);
205 static tree patch_loop_statement (tree);
206 static tree build_new_loop (tree);
207 static tree build_loop_body (int, tree, int);
208 static tree finish_loop_body (int, tree, tree, int);
209 static tree build_debugable_stmt (int, tree);
210 static tree finish_for_loop (int, tree, tree, tree);
211 static tree patch_switch_statement (tree);
212 static tree string_constant_concatenation (tree, tree);
213 static tree build_string_concatenation (tree, tree);
214 static tree patch_string_cst (tree);
215 static tree patch_string (tree);
216 static tree encapsulate_with_try_catch (int, tree, tree, tree);
217 static tree build_assertion (int, tree, tree);
218 static tree build_try_statement (int, tree, tree);
219 static tree build_try_finally_statement (int, tree, tree);
220 static tree patch_try_statement (tree);
221 static tree patch_synchronized_statement (tree, tree);
222 static tree patch_throw_statement (tree, tree);
223 static void check_thrown_exceptions (int, tree, tree);
224 static int check_thrown_exceptions_do (tree);
225 static void purge_unchecked_exceptions (tree);
226 static bool ctors_unchecked_throws_clause_p (tree);
227 static void check_concrete_throws_clauses (tree, tree, tree, tree);
228 static void check_throws_clauses (tree, tree, tree);
229 static void finish_method_declaration (tree);
230 static tree build_super_invocation (tree);
231 static int verify_constructor_circularity (tree, tree);
232 static char *constructor_circularity_msg (tree, tree);
233 static tree build_this_super_qualified_invocation (int, tree, tree, int, int);
234 static const char *get_printable_method_name (tree);
235 static tree patch_conditional_expr (tree, tree, tree);
236 static tree generate_finit (tree);
237 static tree generate_instinit (tree);
238 static tree build_instinit_invocation (tree);
239 static void fix_constructors (tree);
240 static tree build_alias_initializer_parameter_list (int, tree, tree, int *);
241 static tree craft_constructor (tree, tree);
242 static int verify_constructor_super (tree);
243 static tree create_artificial_method (tree, int, tree, tree, tree);
244 static void start_artificial_method_body (tree);
245 static void end_artificial_method_body (tree);
246 static int check_method_redefinition (tree, tree);
247 static int check_method_types_complete (tree);
248 static bool hack_is_accessible_p (tree, tree);
249 static void java_check_regular_methods (tree);
250 static void check_interface_throws_clauses (tree, tree);
251 static void java_check_abstract_methods (tree);
252 static void unreachable_stmt_error (tree);
253 static int not_accessible_field_error (tree, tree);
254 static tree find_expr_with_wfl (tree);
255 static void missing_return_error (tree);
256 static tree build_new_array_init (int, tree);
257 static tree patch_new_array_init (tree, tree);
258 static tree maybe_build_array_element_wfl (tree);
259 static int array_constructor_check_entry (tree, tree);
260 static const char *purify_type_name (const char *);
261 static tree fold_constant_for_init (tree, tree);
262 static tree strip_out_static_field_access_decl (tree);
263 static jdeplist *reverse_jdep_list (struct parser_ctxt *);
264 static void static_ref_err (tree, tree, tree);
265 static void parser_add_interface (tree, tree, tree);
266 static void add_superinterfaces (tree, tree);
267 static tree jdep_resolve_class (jdep *);
268 static int note_possible_classname (const char *, int);
269 static void java_complete_expand_classes (void);
270 static void java_complete_expand_class (tree);
271 static void java_complete_expand_methods (tree);
272 static tree cut_identifier_in_qualified (tree);
273 static tree java_stabilize_reference (tree);
274 static tree do_unary_numeric_promotion (tree);
275 static char * operator_string (tree);
276 static tree do_merge_string_cste (tree, const char *, int, int);
277 static tree merge_string_cste (tree, tree, int);
278 static tree java_refold (tree);
279 static int java_decl_equiv (tree, tree);
280 static int binop_compound_p (enum tree_code);
281 static tree search_loop (tree);
282 static int labeled_block_contains_loop_p (tree, tree);
283 static int check_abstract_method_definitions (int, tree, tree);
284 static void java_check_abstract_method_definitions (tree);
285 static void java_debug_context_do (int);
286 static void java_parser_context_push_initialized_field (void);
287 static void java_parser_context_pop_initialized_field (void);
288 static tree reorder_static_initialized (tree);
289 static void java_parser_context_suspend (void);
290 static void java_parser_context_resume (void);
291 static int pop_current_osb (struct parser_ctxt *);
293 /* JDK 1.1 work. FIXME */
295 static tree maybe_make_nested_class_name (tree);
296 static int make_nested_class_name (tree);
297 static void link_nested_class_to_enclosing (void);
298 static tree resolve_inner_class (htab_t, tree, tree *, tree *, tree);
299 static tree find_as_inner_class (tree, tree, tree);
300 static tree find_as_inner_class_do (tree, tree);
301 static int check_inner_class_redefinition (tree, tree);
303 static tree build_thisn_assign (void);
304 static tree build_current_thisn (tree);
305 static tree build_access_to_thisn (tree, tree, int);
306 static tree maybe_build_thisn_access_method (tree);
308 static tree build_outer_field_access (tree, tree);
309 static tree build_outer_field_access_methods (tree);
310 static tree build_outer_field_access_expr (int, tree, tree,
312 static tree build_outer_method_access_method (tree);
313 static tree build_new_access_id (void);
314 static tree build_outer_field_access_method (tree, tree, tree,
317 static int outer_field_access_p (tree, tree);
318 static int outer_field_expanded_access_p (tree, tree *,
320 static tree outer_field_access_fix (tree, tree, tree);
321 static tree build_incomplete_class_ref (int, tree);
322 static tree patch_incomplete_class_ref (tree);
323 static tree create_anonymous_class (tree);
324 static void patch_anonymous_class (tree, tree, tree);
325 static void add_inner_class_fields (tree, tree);
327 static tree build_dot_class_method (tree);
328 static tree build_dot_class_method_invocation (tree, tree);
329 static void create_new_parser_context (int);
330 static tree maybe_build_class_init_for_field (tree, tree);
332 static int attach_init_test_initialization_flags (void **, void *);
333 static int emit_test_initialization (void **, void *);
335 static char *string_convert_int_cst (tree);
337 /* Number of error found so far. */
338 int java_error_count;
339 /* Number of warning found so far. */
340 int java_warning_count;
341 /* Tell when not to fold, when doing xrefs */
343 /* Cyclic inheritance report, as it can be set by layout_class */
344 const char *cyclic_inheritance_report;
346 /* The current parser context */
347 struct parser_ctxt *ctxp;
349 /* List of things that were analyzed for which code will be generated */
350 struct parser_ctxt *ctxp_for_generation = NULL;
352 /* binop_lookup maps token to tree_code. It is used where binary
353 operations are involved and required by the parser. RDIV_EXPR
354 covers both integral/floating point division. The code is changed
355 once the type of both operator is worked out. */
357 static const enum tree_code binop_lookup[19] =
359 PLUS_EXPR, MINUS_EXPR, MULT_EXPR, RDIV_EXPR, TRUNC_MOD_EXPR,
360 LSHIFT_EXPR, RSHIFT_EXPR, URSHIFT_EXPR,
361 BIT_AND_EXPR, BIT_XOR_EXPR, BIT_IOR_EXPR,
362 TRUTH_ANDIF_EXPR, TRUTH_ORIF_EXPR,
363 EQ_EXPR, NE_EXPR, GT_EXPR, GE_EXPR, LT_EXPR, LE_EXPR,
365 #define BINOP_LOOKUP(VALUE) \
366 binop_lookup [((VALUE) - PLUS_TK) % ARRAY_SIZE (binop_lookup)]
368 /* This is the end index for binary operators that can also be used
369 in compound assignments. */
370 #define BINOP_COMPOUND_CANDIDATES 11
372 /* The "$L" identifier we use to create labels. */
373 static GTY(()) tree label_id;
375 /* The "StringBuffer" identifier used for the String `+' operator. */
376 static GTY(()) tree wfl_string_buffer;
378 /* The "append" identifier used for String `+' operator. */
379 static GTY(()) tree wfl_append;
381 /* The "toString" identifier used for String `+' operator. */
382 static GTY(()) tree wfl_to_string;
384 /* The "java.lang" import qualified name. */
385 static GTY(()) tree java_lang_id;
387 /* The generated `inst$' identifier used for generated enclosing
388 instance/field access functions. */
389 static GTY(()) tree inst_id;
391 /* Context and flag for static blocks */
392 static GTY(()) tree current_static_block;
394 /* The generated `write_parm_value$' identifier. */
395 static GTY(()) tree wpv_id;
397 /* The list of all packages we've seen so far */
398 static GTY(()) tree package_list;
400 /* Hold THIS for the scope of the current method decl. */
401 static GTY(()) tree current_this;
403 /* Hold a list of catch clauses list. The first element of this list is
404 the list of the catch clauses of the currently analyzed try block. */
405 static GTY(()) tree currently_caught_type_list;
407 /* This holds a linked list of all the case labels for the current
408 switch statement. It is only used when checking to see if there
409 are duplicate labels. FIXME: probably this should just be attached
410 to the switch itself; then it could be referenced via
411 `ctxp->current_loop'. */
412 static GTY(()) tree case_label_list;
414 /* Anonymous class counter. Will be reset to 1 every time a non
415 anonymous class gets created. */
416 static int anonymous_class_counter = 1;
418 static GTY(()) tree src_parse_roots[1];
420 /* All classes seen from source code */
421 #define gclass_list src_parse_roots[0]
423 /* Check modifiers. If one doesn't fit, retrieve it in its declaration
424 line and point it out. */
425 /* Should point out the one that don't fit. ASCII/unicode, going
428 #define check_modifiers(__message, __value, __mask) do { \
429 if ((__value) & ~(__mask)) \
431 size_t i, remainder = (__value) & ~(__mask); \
432 for (i = 0; i < ARRAY_SIZE (ctxp->modifier_ctx); i++) \
433 if ((1 << i) & remainder) \
434 parse_error_context (ctxp->modifier_ctx [i], (__message), \
435 java_accstring_lookup (1 << i)); \
457 /* Things defined here have to match the order of what's in the
458 binop_lookup table. */
460 %token PLUS_TK MINUS_TK MULT_TK DIV_TK REM_TK
461 %token LS_TK SRS_TK ZRS_TK
462 %token AND_TK XOR_TK OR_TK
463 %token BOOL_AND_TK BOOL_OR_TK
464 %token EQ_TK NEQ_TK GT_TK GTE_TK LT_TK LTE_TK
466 /* This maps to the same binop_lookup entry than the token above */
468 %token PLUS_ASSIGN_TK MINUS_ASSIGN_TK MULT_ASSIGN_TK DIV_ASSIGN_TK
470 %token LS_ASSIGN_TK SRS_ASSIGN_TK ZRS_ASSIGN_TK
471 %token AND_ASSIGN_TK XOR_ASSIGN_TK OR_ASSIGN_TK
474 /* Modifier TOKEN have to be kept in this order. Don't scramble it */
476 %token PUBLIC_TK PRIVATE_TK PROTECTED_TK
477 %token STATIC_TK FINAL_TK SYNCHRONIZED_TK
478 %token VOLATILE_TK TRANSIENT_TK NATIVE_TK
479 %token PAD_TK ABSTRACT_TK STRICT_TK
482 /* Keep those two in order, too */
483 %token DECR_TK INCR_TK
485 /* From now one, things can be in any order */
487 %token DEFAULT_TK IF_TK THROW_TK
488 %token BOOLEAN_TK DO_TK IMPLEMENTS_TK
489 %token THROWS_TK BREAK_TK IMPORT_TK
490 %token ELSE_TK INSTANCEOF_TK RETURN_TK
491 %token VOID_TK CATCH_TK INTERFACE_TK
492 %token CASE_TK EXTENDS_TK FINALLY_TK
493 %token SUPER_TK WHILE_TK CLASS_TK
494 %token SWITCH_TK CONST_TK TRY_TK
495 %token FOR_TK NEW_TK CONTINUE_TK
496 %token GOTO_TK PACKAGE_TK THIS_TK
499 %token BYTE_TK SHORT_TK INT_TK LONG_TK
500 %token CHAR_TK INTEGRAL_TK
502 %token FLOAT_TK DOUBLE_TK FP_TK
506 %token REL_QM_TK REL_CL_TK NOT_TK NEG_TK
508 %token ASSIGN_ANY_TK ASSIGN_TK
509 %token OP_TK CP_TK OCB_TK CCB_TK OSB_TK CSB_TK SC_TK C_TK DOT_TK
511 %token STRING_LIT_TK CHAR_LIT_TK INT_LIT_TK FP_LIT_TK
512 %token TRUE_TK FALSE_TK BOOL_LIT_TK NULL_TK
514 %type <value> modifiers MODIFIER_TK final synchronized
516 %type <node> super ID_TK identifier
517 %type <node> name simple_name qualified_name
518 %type <node> type_declaration compilation_unit
519 field_declaration method_declaration extends_interfaces
520 interfaces interface_type_list
521 import_declarations package_declaration
522 type_declarations interface_body
523 interface_member_declaration constant_declaration
524 interface_member_declarations interface_type
525 abstract_method_declaration
526 %type <node> class_body_declaration class_member_declaration
527 static_initializer constructor_declaration block
528 %type <node> class_body_declarations constructor_header
529 %type <node> class_or_interface_type class_type class_type_list
530 constructor_declarator explicit_constructor_invocation
531 %type <node> dim_expr dim_exprs this_or_super throws
533 %type <node> variable_declarator_id variable_declarator
534 variable_declarators variable_initializer
535 variable_initializers constructor_body
538 %type <node> class_body block_end constructor_block_end
539 %type <node> statement statement_without_trailing_substatement
540 labeled_statement if_then_statement label_decl
541 if_then_else_statement while_statement for_statement
542 statement_nsi labeled_statement_nsi do_statement
543 if_then_else_statement_nsi while_statement_nsi
544 for_statement_nsi statement_expression_list for_init
545 for_update statement_expression expression_statement
546 primary_no_new_array expression primary array_type
547 array_creation_initialized array_creation_uninitialized
548 class_instance_creation_expression field_access
549 method_invocation array_access something_dot_new
550 argument_list postfix_expression while_expression
551 post_increment_expression post_decrement_expression
552 unary_expression_not_plus_minus unary_expression
553 pre_increment_expression pre_decrement_expression
555 multiplicative_expression additive_expression
556 shift_expression relational_expression
557 equality_expression and_expression
558 exclusive_or_expression inclusive_or_expression
559 conditional_and_expression conditional_or_expression
560 conditional_expression assignment_expression
561 left_hand_side assignment for_header for_begin
562 constant_expression do_statement_begin empty_statement
563 switch_statement synchronized_statement throw_statement
564 try_statement assert_statement
565 switch_expression switch_block
566 catches catch_clause catch_clause_parameter finally
567 anonymous_class_creation trap_overflow_corner_case
568 %type <node> return_statement break_statement continue_statement
570 %type <operator> ASSIGN_TK MULT_ASSIGN_TK DIV_ASSIGN_TK
571 %type <operator> REM_ASSIGN_TK PLUS_ASSIGN_TK MINUS_ASSIGN_TK
572 %type <operator> LS_ASSIGN_TK SRS_ASSIGN_TK ZRS_ASSIGN_TK
573 %type <operator> AND_ASSIGN_TK XOR_ASSIGN_TK OR_ASSIGN_TK
574 %type <operator> ASSIGN_ANY_TK assignment_operator
575 %token <operator> EQ_TK GTE_TK ZRS_TK SRS_TK GT_TK LTE_TK LS_TK
576 %token <operator> BOOL_AND_TK AND_TK BOOL_OR_TK OR_TK INCR_TK PLUS_TK
577 %token <operator> DECR_TK MINUS_TK MULT_TK DIV_TK XOR_TK REM_TK NEQ_TK
578 %token <operator> NEG_TK REL_QM_TK REL_CL_TK NOT_TK LT_TK OCB_TK CCB_TK
579 %token <operator> OP_TK OSB_TK DOT_TK THROW_TK INSTANCEOF_TK
580 %type <operator> THIS_TK SUPER_TK RETURN_TK BREAK_TK CONTINUE_TK
581 %type <operator> CASE_TK DEFAULT_TK TRY_TK CATCH_TK SYNCHRONIZED_TK
582 %type <operator> NEW_TK ASSERT_TK
584 %type <node> method_body
586 %type <node> literal INT_LIT_TK FP_LIT_TK BOOL_LIT_TK CHAR_LIT_TK
587 STRING_LIT_TK NULL_TK VOID_TK
589 %type <node> IF_TK WHILE_TK FOR_TK
591 %type <node> formal_parameter_list formal_parameter
592 method_declarator method_header
594 %type <node> primitive_type reference_type type
595 BOOLEAN_TK INTEGRAL_TK FP_TK
597 /* Added or modified JDK 1.1 rule types */
598 %type <node> type_literals
601 /* 19.2 Production from 2.3: The Syntactic Grammar */
602 goal: compilation_unit
606 /* 19.3 Productions from 3: Lexical structure */
616 /* 19.4 Productions from 4: Types, Values and Variables */
629 class_or_interface_type
633 class_or_interface_type:
638 class_or_interface_type /* Default rule */
642 class_or_interface_type
648 int osb = pop_current_osb (ctxp);
649 tree t = build_java_array_type (($1), -1);
651 t = build_unresolved_array_type (t);
656 int osb = pop_current_osb (ctxp);
659 t = build_unresolved_array_type (t);
664 /* 19.5 Productions from 6: Names */
666 simple_name /* Default rule */
667 | qualified_name /* Default rule */
671 identifier /* Default rule */
675 name DOT_TK identifier
676 { $$ = make_qualified_name ($1, $3, $2.location); }
683 /* 19.6: Production from 7: Packages */
686 | package_declaration
687 | import_declarations
689 | package_declaration import_declarations
690 | package_declaration type_declarations
691 | import_declarations type_declarations
692 | package_declaration import_declarations type_declarations
700 | import_declarations import_declaration
708 | type_declarations type_declaration
712 PACKAGE_TK name SC_TK
714 ctxp->package = EXPR_WFL_NODE ($2);
715 register_package (ctxp->package);
718 {yyerror ("Missing name"); RECOVER;}
719 | PACKAGE_TK name error
720 {yyerror ("';' expected"); RECOVER;}
724 single_type_import_declaration
725 | type_import_on_demand_declaration
728 single_type_import_declaration:
731 tree name = EXPR_WFL_NODE ($2), last_name;
732 int i = IDENTIFIER_LENGTH (name)-1;
733 const char *last = &IDENTIFIER_POINTER (name)[i];
734 while (last != IDENTIFIER_POINTER (name))
740 last_name = get_identifier (++last);
741 if (IS_A_SINGLE_IMPORT_CLASSFILE_NAME_P (last_name))
743 tree err = find_name_in_single_imports (last_name);
744 if (err && err != name)
746 ($2, "Ambiguous class: `%s' and `%s'",
747 IDENTIFIER_POINTER (name),
748 IDENTIFIER_POINTER (err));
750 REGISTER_IMPORT ($2, last_name);
753 REGISTER_IMPORT ($2, last_name);
756 {yyerror ("Missing name"); RECOVER;}
757 | IMPORT_TK name error
758 {yyerror ("';' expected"); RECOVER;}
761 type_import_on_demand_declaration:
762 IMPORT_TK name DOT_TK MULT_TK SC_TK
764 tree name = EXPR_WFL_NODE ($2);
766 /* Search for duplicates. */
767 for (it = ctxp->import_demand_list; it; it = TREE_CHAIN (it))
768 if (EXPR_WFL_NODE (TREE_PURPOSE (it)) == name)
770 /* Don't import the same thing more than once, just ignore
771 duplicates (7.5.2) */
774 read_import_dir ($2);
775 ctxp->import_demand_list =
776 chainon (ctxp->import_demand_list,
777 build_tree_list ($2, NULL_TREE));
780 | IMPORT_TK name DOT_TK error
781 {yyerror ("'*' expected"); RECOVER;}
782 | IMPORT_TK name DOT_TK MULT_TK error
783 {yyerror ("';' expected"); RECOVER;}
788 { end_class_declaration (0); }
789 | interface_declaration
790 { end_class_declaration (0); }
795 yyerror ("Class or interface declaration expected");
799 /* 19.7 Shortened from the original:
800 modifiers: modifier | modifiers modifier
801 modifier: any of public... */
807 | modifiers MODIFIER_TK
812 (ctxp->modifier_ctx [$2], "Modifier `%s' declared twice",
813 java_accstring_lookup (acc));
821 /* 19.8.1 Production from $8.1: Class Declaration */
823 modifiers CLASS_TK identifier super interfaces
824 { create_class ($1, $3, $4, $5); }
827 | CLASS_TK identifier super interfaces
828 { create_class (0, $2, $3, $4); }
831 | modifiers CLASS_TK error
832 { yyerror ("Missing class name"); RECOVER; }
834 { yyerror ("Missing class name"); RECOVER; }
835 | CLASS_TK identifier error
837 if (!ctxp->class_err) yyerror ("'{' expected");
840 | modifiers CLASS_TK identifier error
841 { if (!ctxp->class_err) yyerror ("'{' expected"); RECOVER; }
846 | EXTENDS_TK class_type
848 | EXTENDS_TK class_type error
849 {yyerror ("'{' expected"); ctxp->class_err=1;}
851 {yyerror ("Missing super class name"); ctxp->class_err=1;}
856 | IMPLEMENTS_TK interface_type_list
858 | IMPLEMENTS_TK error
861 yyerror ("Missing interface name");
868 ctxp->interface_number = 1;
869 $$ = build_tree_list ($1, NULL_TREE);
871 | interface_type_list C_TK interface_type
873 ctxp->interface_number++;
874 $$ = chainon ($1, build_tree_list ($3, NULL_TREE));
876 | interface_type_list C_TK error
877 {yyerror ("Missing interface name"); RECOVER;}
883 /* Store the location of the `}' when doing xrefs */
885 DECL_END_SOURCE_LINE (GET_CPC ()) =
886 EXPR_WFL_ADD_COL ($2.location, 1);
889 | OCB_TK class_body_declarations CCB_TK
891 /* Store the location of the `}' when doing xrefs */
893 DECL_END_SOURCE_LINE (GET_CPC ()) =
894 EXPR_WFL_ADD_COL ($3.location, 1);
899 class_body_declarations:
900 class_body_declaration
901 | class_body_declarations class_body_declaration
904 class_body_declaration:
905 class_member_declaration
907 | constructor_declaration
908 | block /* Added, JDK1.1, instance initializer */
910 if (!IS_EMPTY_STMT ($1))
912 TREE_CHAIN ($1) = CPC_INSTANCE_INITIALIZER_STMT (ctxp);
913 SET_CPC_INSTANCE_INITIALIZER_STMT (ctxp, $1);
918 class_member_declaration:
921 | class_declaration /* Added, JDK1.1 inner classes */
922 { end_class_declaration (1); }
923 | interface_declaration /* Added, JDK1.1 inner interfaces */
924 { end_class_declaration (1); }
928 /* 19.8.2 Productions from 8.3: Field Declarations */
930 type variable_declarators SC_TK
931 { register_fields (0, $1, $2); }
932 | modifiers type variable_declarators SC_TK
935 ("Illegal modifier `%s' for field declaration",
936 $1, FIELD_MODIFIERS);
937 check_modifiers_consistency ($1);
938 register_fields ($1, $2, $3);
942 variable_declarators:
943 /* Should we use build_decl_list () instead ? FIXME */
944 variable_declarator /* Default rule */
945 | variable_declarators C_TK variable_declarator
946 { $$ = chainon ($1, $3); }
947 | variable_declarators C_TK error
948 {yyerror ("Missing term"); RECOVER;}
952 variable_declarator_id
953 { $$ = build_tree_list ($1, NULL_TREE); }
954 | variable_declarator_id ASSIGN_TK variable_initializer
956 if (java_error_count)
959 ($1, build_assignment ($2.token, $2.location, $1, $3));
961 | variable_declarator_id ASSIGN_TK error
963 yyerror ("Missing variable initializer");
964 $$ = build_tree_list ($1, NULL_TREE);
967 | variable_declarator_id ASSIGN_TK variable_initializer error
969 yyerror ("';' expected");
970 $$ = build_tree_list ($1, NULL_TREE);
975 variable_declarator_id:
977 | variable_declarator_id OSB_TK CSB_TK
978 { $$ = build_unresolved_array_type ($1); }
980 {yyerror ("Invalid declaration"); DRECOVER(vdi);}
981 | variable_declarator_id OSB_TK error
983 yyerror ("']' expected");
986 | variable_declarator_id CSB_TK error
987 {yyerror ("Unbalanced ']'"); DRECOVER(vdi);}
990 variable_initializer:
995 /* 19.8.3 Productions from 8.4: Method Declarations */
999 current_function_decl = $1;
1000 if (current_function_decl
1001 && TREE_CODE (current_function_decl) == FUNCTION_DECL)
1002 source_start_java_method (current_function_decl);
1004 current_function_decl = NULL_TREE;
1007 { finish_method_declaration ($3); }
1008 | method_header error
1009 {YYNOT_TWICE yyerror ("'{' expected"); RECOVER;}
1013 type method_declarator throws
1014 { $$ = method_header (0, $1, $2, $3); }
1015 | VOID_TK method_declarator throws
1016 { $$ = method_header (0, void_type_node, $2, $3); }
1017 | modifiers type method_declarator throws
1018 { $$ = method_header ($1, $2, $3, $4); }
1019 | modifiers VOID_TK method_declarator throws
1020 { $$ = method_header ($1, void_type_node, $3, $4); }
1023 yyerror ("Invalid method declaration, method name required");
1026 | modifiers type error
1028 yyerror ("Identifier expected");
1033 yyerror ("Identifier expected");
1036 | modifiers VOID_TK error
1038 yyerror ("Identifier expected");
1043 yyerror ("Invalid method declaration, return type required");
1049 identifier OP_TK CP_TK
1051 ctxp->formal_parameter_number = 0;
1052 $$ = method_declarator ($1, NULL_TREE);
1054 | identifier OP_TK formal_parameter_list CP_TK
1055 { $$ = method_declarator ($1, $3); }
1056 | method_declarator OSB_TK CSB_TK
1058 EXPR_WFL_LINECOL (wfl_operator) = $2.location;
1060 build_unresolved_array_type (TREE_PURPOSE ($1));
1061 parse_warning_context
1063 "Discouraged form of returned type specification");
1065 | identifier OP_TK error
1066 {yyerror ("')' expected"); DRECOVER(method_declarator);}
1067 | method_declarator OSB_TK error
1068 {yyerror ("']' expected"); RECOVER;}
1071 formal_parameter_list:
1074 ctxp->formal_parameter_number = 1;
1076 | formal_parameter_list C_TK formal_parameter
1078 ctxp->formal_parameter_number += 1;
1079 $$ = chainon ($1, $3);
1081 | formal_parameter_list C_TK error
1082 { yyerror ("Missing formal parameter term"); RECOVER; }
1086 type variable_declarator_id
1088 $$ = build_tree_list ($2, $1);
1090 | final type variable_declarator_id /* Added, JDK1.1 final parms */
1092 $$ = build_tree_list ($3, $2);
1093 ARG_FINAL_P ($$) = 1;
1097 yyerror ("Missing identifier"); RECOVER;
1102 yyerror ("Missing identifier"); RECOVER;
1110 check_modifiers ("Illegal modifier `%s'. Only `final' was expected here",
1112 if ($1 != ACC_FINAL)
1113 MODIFIER_WFL (FINAL_TK) = build_wfl_node (NULL_TREE);
1119 | THROWS_TK class_type_list
1122 {yyerror ("Missing class type term"); RECOVER;}
1127 { $$ = build_tree_list ($1, $1); }
1128 | class_type_list C_TK class_type
1129 { $$ = tree_cons ($3, $3, $1); }
1130 | class_type_list C_TK error
1131 {yyerror ("Missing class type term"); RECOVER;}
1136 | SC_TK { $$ = NULL_TREE; }
1139 /* 19.8.4 Productions from 8.5: Static Initializers */
1143 TREE_CHAIN ($2) = CPC_STATIC_INITIALIZER_STMT (ctxp);
1144 SET_CPC_STATIC_INITIALIZER_STMT (ctxp, $2);
1145 current_static_block = NULL_TREE;
1149 static: /* Test lval.sub_token here */
1152 check_modifiers ("Illegal modifier `%s' for static initializer", $1, ACC_STATIC);
1153 /* Can't have a static initializer in an innerclass */
1154 if ($1 | ACC_STATIC &&
1155 GET_CPC_LIST () && !TOPLEVEL_CLASS_DECL_P (GET_CPC ()))
1157 (MODIFIER_WFL (STATIC_TK),
1158 "Can't define static initializer in class `%s'. Static initializer can only be defined in top-level classes",
1159 IDENTIFIER_POINTER (DECL_NAME (GET_CPC ())));
1160 SOURCE_FRONTEND_DEBUG (("Modifiers: %d", $1));
1164 /* 19.8.5 Productions from 8.6: Constructor Declarations */
1165 constructor_declaration:
1168 current_function_decl = $1;
1169 source_start_java_method (current_function_decl);
1172 { finish_method_declaration ($3); }
1176 constructor_declarator throws
1177 { $$ = method_header (0, NULL_TREE, $1, $2); }
1178 | modifiers constructor_declarator throws
1179 { $$ = method_header ($1, NULL_TREE, $2, $3); }
1182 constructor_declarator:
1183 simple_name OP_TK CP_TK
1185 ctxp->formal_parameter_number = 0;
1186 $$ = method_declarator ($1, NULL_TREE);
1188 | simple_name OP_TK formal_parameter_list CP_TK
1189 { $$ = method_declarator ($1, $3); }
1193 /* Unlike regular method, we always need a complete (empty)
1194 body so we can safely perform all the required code
1195 addition (super invocation and field initialization) */
1196 block_begin constructor_block_end
1198 BLOCK_EXPR_BODY ($2) = build_java_empty_stmt ();
1201 | block_begin explicit_constructor_invocation constructor_block_end
1203 | block_begin block_statements constructor_block_end
1205 | block_begin explicit_constructor_invocation block_statements constructor_block_end
1209 constructor_block_end:
1213 /* Error recovery for that rule moved down expression_statement: rule. */
1214 explicit_constructor_invocation:
1215 this_or_super OP_TK CP_TK SC_TK
1217 $$ = build_method_invocation ($1, NULL_TREE);
1218 $$ = build_debugable_stmt (EXPR_WFL_LINECOL ($1), $$);
1219 $$ = java_method_add_stmt (current_function_decl, $$);
1221 | this_or_super OP_TK argument_list CP_TK SC_TK
1223 $$ = build_method_invocation ($1, $3);
1224 $$ = build_debugable_stmt (EXPR_WFL_LINECOL ($1), $$);
1225 $$ = java_method_add_stmt (current_function_decl, $$);
1227 /* Added, JDK1.1 inner classes. Modified because the rule
1228 'primary' couldn't work. */
1229 | name DOT_TK SUPER_TK OP_TK argument_list CP_TK SC_TK
1230 {$$ = parse_jdk1_1_error ("explicit constructor invocation"); }
1231 | name DOT_TK SUPER_TK OP_TK CP_TK SC_TK
1232 {$$ = parse_jdk1_1_error ("explicit constructor invocation"); }
1235 this_or_super: /* Added, simplifies error diagnostics */
1238 tree wfl = build_wfl_node (this_identifier_node);
1239 EXPR_WFL_LINECOL (wfl) = $1.location;
1244 tree wfl = build_wfl_node (super_identifier_node);
1245 EXPR_WFL_LINECOL (wfl) = $1.location;
1250 /* 19.9 Productions from 9: Interfaces */
1251 /* 19.9.1 Productions from 9.1: Interfaces Declarations */
1252 interface_declaration:
1253 INTERFACE_TK identifier
1254 { create_interface (0, $2, NULL_TREE); }
1257 | modifiers INTERFACE_TK identifier
1258 { create_interface ($1, $3, NULL_TREE); }
1261 | INTERFACE_TK identifier extends_interfaces
1262 { create_interface (0, $2, $3); }
1265 | modifiers INTERFACE_TK identifier extends_interfaces
1266 { create_interface ($1, $3, $4); }
1269 | INTERFACE_TK identifier error
1270 { yyerror ("'{' expected"); RECOVER; }
1271 | modifiers INTERFACE_TK identifier error
1272 { yyerror ("'{' expected"); RECOVER; }
1276 EXTENDS_TK interface_type
1278 ctxp->interface_number = 1;
1279 $$ = build_tree_list ($2, NULL_TREE);
1281 | extends_interfaces C_TK interface_type
1283 ctxp->interface_number++;
1284 $$ = chainon ($1, build_tree_list ($3, NULL_TREE));
1287 {yyerror ("Invalid interface type"); RECOVER;}
1288 | extends_interfaces C_TK error
1289 {yyerror ("Missing term"); RECOVER;}
1295 | OCB_TK interface_member_declarations CCB_TK
1299 interface_member_declarations:
1300 interface_member_declaration
1301 | interface_member_declarations interface_member_declaration
1304 interface_member_declaration:
1305 constant_declaration
1306 | abstract_method_declaration
1307 | class_declaration /* Added, JDK1.1 inner classes */
1308 { end_class_declaration (1); }
1309 | interface_declaration /* Added, JDK1.1 inner interfaces */
1310 { end_class_declaration (1); }
1313 constant_declaration:
1317 abstract_method_declaration:
1320 check_abstract_method_header ($1);
1321 current_function_decl = NULL_TREE; /* FIXME ? */
1323 | method_header error
1324 {yyerror ("';' expected"); RECOVER;}
1327 /* 19.10 Productions from 10: Arrays */
1330 { $$ = build_new_array_init ($1.location, NULL_TREE); }
1331 | OCB_TK C_TK CCB_TK
1332 { $$ = build_new_array_init ($1.location, NULL_TREE); }
1333 | OCB_TK variable_initializers CCB_TK
1334 { $$ = build_new_array_init ($1.location, $2); }
1335 | OCB_TK variable_initializers C_TK CCB_TK
1336 { $$ = build_new_array_init ($1.location, $2); }
1339 variable_initializers:
1340 variable_initializer
1342 $$ = tree_cons (maybe_build_array_element_wfl ($1),
1345 | variable_initializers C_TK variable_initializer
1347 $$ = tree_cons (maybe_build_array_element_wfl ($3), $3, $1);
1349 | variable_initializers C_TK error
1350 {yyerror ("Missing term"); RECOVER;}
1353 /* 19.11 Production from 14: Blocks and Statements */
1355 block_begin block_end
1357 | block_begin block_statements block_end
1369 maybe_absorb_scoping_blocks ();
1370 /* Store the location of the `}' when doing xrefs */
1371 if (current_function_decl && flag_emit_xref)
1372 DECL_END_SOURCE_LINE (current_function_decl) =
1373 EXPR_WFL_ADD_COL ($1.location, 1);
1375 if (!BLOCK_SUBBLOCKS ($$))
1376 BLOCK_SUBBLOCKS ($$) = build_java_empty_stmt ();
1382 | block_statements block_statement
1386 local_variable_declaration_statement
1388 { java_method_add_stmt (current_function_decl, $1); }
1389 | class_declaration /* Added, JDK1.1 local classes */
1391 LOCAL_CLASS_P (TREE_TYPE (GET_CPC ())) = 1;
1392 end_class_declaration (1);
1396 local_variable_declaration_statement:
1397 local_variable_declaration SC_TK /* Can't catch missing ';' here */
1400 local_variable_declaration:
1401 type variable_declarators
1402 { declare_local_variables (0, $1, $2); }
1403 | final type variable_declarators /* Added, JDK1.1 final locals */
1404 { declare_local_variables ($1, $2, $3); }
1408 statement_without_trailing_substatement
1411 | if_then_else_statement
1414 { $$ = exit_block (); }
1418 statement_without_trailing_substatement
1419 | labeled_statement_nsi
1420 | if_then_else_statement_nsi
1421 | while_statement_nsi
1423 { $$ = exit_block (); }
1426 statement_without_trailing_substatement:
1429 | expression_statement
1433 | continue_statement
1435 | synchronized_statement
1444 if (flag_extraneous_semicolon
1445 && ! current_static_block
1446 && (! current_function_decl ||
1447 /* Verify we're not in a inner class declaration */
1448 (GET_CPC () != TYPE_NAME
1449 (DECL_CONTEXT (current_function_decl)))))
1452 EXPR_WFL_SET_LINECOL (wfl_operator, input_line, -1);
1453 parse_warning_context (wfl_operator, "An empty declaration is a deprecated feature that should not be used");
1455 $$ = build_java_empty_stmt ();
1460 identifier REL_CL_TK
1462 $$ = build_labeled_block (EXPR_WFL_LINECOL ($1),
1463 EXPR_WFL_NODE ($1));
1465 push_labeled_block ($$);
1466 PUSH_LABELED_BLOCK ($$);
1471 label_decl statement
1472 { $$ = finish_labeled_statement ($1, $2); }
1474 {yyerror ("':' expected"); RECOVER;}
1477 labeled_statement_nsi:
1478 label_decl statement_nsi
1479 { $$ = finish_labeled_statement ($1, $2); }
1482 /* We concentrate here a bunch of error handling rules that we couldn't write
1483 earlier, because expression_statement catches a missing ';'. */
1484 expression_statement:
1485 statement_expression SC_TK
1487 /* We have a statement. Generate a WFL around it so
1489 $$ = build_expr_wfl ($1, input_filename, input_line, 0);
1490 /* We know we have a statement, so set the debug
1491 info to be eventually generate here. */
1492 $$ = JAVA_MAYBE_GENERATE_DEBUG_INFO ($$);
1496 YYNOT_TWICE yyerror ("Invalid expression statement");
1497 DRECOVER (expr_stmt);
1501 YYNOT_TWICE yyerror ("Invalid expression statement");
1502 DRECOVER (expr_stmt);
1506 YYNOT_TWICE yyerror ("Invalid expression statement");
1507 DRECOVER (expr_stmt);
1509 | this_or_super OP_TK error
1510 {yyerror ("')' expected"); RECOVER;}
1511 | this_or_super OP_TK CP_TK error
1513 parse_ctor_invocation_error ();
1516 | this_or_super OP_TK argument_list error
1517 {yyerror ("')' expected"); RECOVER;}
1518 | this_or_super OP_TK argument_list CP_TK error
1520 parse_ctor_invocation_error ();
1523 | name DOT_TK SUPER_TK error
1524 {yyerror ("'(' expected"); RECOVER;}
1525 | name DOT_TK SUPER_TK OP_TK error
1526 {yyerror ("')' expected"); RECOVER;}
1527 | name DOT_TK SUPER_TK OP_TK argument_list error
1528 {yyerror ("')' expected"); RECOVER;}
1529 | name DOT_TK SUPER_TK OP_TK argument_list CP_TK error
1530 {yyerror ("';' expected"); RECOVER;}
1531 | name DOT_TK SUPER_TK OP_TK CP_TK error
1532 {yyerror ("';' expected"); RECOVER;}
1535 statement_expression:
1537 | pre_increment_expression
1538 | pre_decrement_expression
1539 | post_increment_expression
1540 | post_decrement_expression
1542 | class_instance_creation_expression
1546 IF_TK OP_TK expression CP_TK statement
1548 $$ = build_if_else_statement ($2.location, $3,
1552 {yyerror ("'(' expected"); RECOVER;}
1554 {yyerror ("Missing term"); RECOVER;}
1555 | IF_TK OP_TK expression error
1556 {yyerror ("')' expected"); RECOVER;}
1559 if_then_else_statement:
1560 IF_TK OP_TK expression CP_TK statement_nsi ELSE_TK statement
1561 { $$ = build_if_else_statement ($2.location, $3, $5, $7); }
1564 if_then_else_statement_nsi:
1565 IF_TK OP_TK expression CP_TK statement_nsi ELSE_TK statement_nsi
1566 { $$ = build_if_else_statement ($2.location, $3, $5, $7); }
1576 /* Make into "proper list" of COMPOUND_EXPRs.
1577 I.e. make the last statement also have its own
1579 maybe_absorb_scoping_blocks ();
1580 TREE_OPERAND ($1, 1) = exit_block ();
1581 $$ = build_debugable_stmt (EXPR_WFL_LINECOL ($1), $1);
1586 SWITCH_TK OP_TK expression CP_TK
1588 $$ = build3 (SWITCH_EXPR, NULL_TREE, $3,
1589 NULL_TREE, NULL_TREE);
1590 EXPR_WFL_LINECOL ($$) = $2.location;
1593 {yyerror ("'(' expected"); RECOVER;}
1594 | SWITCH_TK OP_TK error
1595 {yyerror ("Missing term or ')'"); DRECOVER(switch_statement);}
1596 | SWITCH_TK OP_TK expression CP_TK error
1597 {yyerror ("'{' expected"); RECOVER;}
1600 /* Default assignment is there to avoid type node on switch_block
1606 | OCB_TK switch_labels CCB_TK
1608 | OCB_TK switch_block_statement_groups CCB_TK
1610 | OCB_TK switch_block_statement_groups switch_labels CCB_TK
1614 switch_block_statement_groups:
1615 switch_block_statement_group
1616 | switch_block_statement_groups switch_block_statement_group
1619 switch_block_statement_group:
1620 switch_labels block_statements
1625 | switch_labels switch_label
1629 CASE_TK constant_expression REL_CL_TK
1631 tree lab = build1 (CASE_EXPR, NULL_TREE, $2);
1632 EXPR_WFL_LINECOL (lab) = $1.location;
1633 java_method_add_stmt (current_function_decl, lab);
1635 | DEFAULT_TK REL_CL_TK
1637 tree lab = make_node (DEFAULT_EXPR);
1638 EXPR_WFL_LINECOL (lab) = $1.location;
1639 java_method_add_stmt (current_function_decl, lab);
1642 {yyerror ("Missing or invalid constant expression"); RECOVER;}
1643 | CASE_TK constant_expression error
1644 {yyerror ("':' expected"); RECOVER;}
1646 {yyerror ("':' expected"); RECOVER;}
1650 WHILE_TK OP_TK expression CP_TK
1652 tree body = build_loop_body ($2.location, $3, 0);
1653 $$ = build_new_loop (body);
1658 while_expression statement
1659 { $$ = finish_loop_body (0, NULL_TREE, $2, 0); }
1661 {YYERROR_NOW; yyerror ("'(' expected"); RECOVER;}
1662 | WHILE_TK OP_TK error
1663 {yyerror ("Missing term and ')' expected"); RECOVER;}
1664 | WHILE_TK OP_TK expression error
1665 {yyerror ("')' expected"); RECOVER;}
1668 while_statement_nsi:
1669 while_expression statement_nsi
1670 { $$ = finish_loop_body (0, NULL_TREE, $2, 0); }
1676 tree body = build_loop_body (0, NULL_TREE, 1);
1677 $$ = build_new_loop (body);
1679 /* Need error handing here. FIXME */
1683 do_statement_begin statement WHILE_TK OP_TK expression CP_TK SC_TK
1684 { $$ = finish_loop_body ($4.location, $5, $2, 1); }
1688 for_begin SC_TK expression SC_TK for_update CP_TK statement
1690 if (TREE_CODE_CLASS (TREE_CODE ($3)) == 'c')
1691 $3 = build_wfl_node ($3);
1692 $$ = finish_for_loop (EXPR_WFL_LINECOL ($3), $3, $5, $7);
1694 | for_begin SC_TK SC_TK for_update CP_TK statement
1696 $$ = finish_for_loop (0, NULL_TREE, $4, $6);
1697 /* We have not condition, so we get rid of the EXIT_EXPR */
1698 LOOP_EXPR_BODY_CONDITION_EXPR (LOOP_EXPR_BODY ($$), 0) =
1699 build_java_empty_stmt ();
1701 | for_begin SC_TK error
1702 {yyerror ("Invalid control expression"); RECOVER;}
1703 | for_begin SC_TK expression SC_TK error
1704 {yyerror ("Invalid update expression"); RECOVER;}
1705 | for_begin SC_TK SC_TK error
1706 {yyerror ("Invalid update expression"); RECOVER;}
1710 for_begin SC_TK expression SC_TK for_update CP_TK statement_nsi
1711 { $$ = finish_for_loop (EXPR_WFL_LINECOL ($3), $3, $5, $7);}
1712 | for_begin SC_TK SC_TK for_update CP_TK statement_nsi
1714 $$ = finish_for_loop (0, NULL_TREE, $4, $6);
1715 /* We have not condition, so we get rid of the EXIT_EXPR */
1716 LOOP_EXPR_BODY_CONDITION_EXPR (LOOP_EXPR_BODY ($$), 0) =
1717 build_java_empty_stmt ();
1724 /* This scope defined for local variable that may be
1725 defined within the scope of the for loop */
1729 {yyerror ("'(' expected"); DRECOVER(for_1);}
1730 | FOR_TK OP_TK error
1731 {yyerror ("Invalid init statement"); RECOVER;}
1737 /* We now declare the loop body. The loop is
1738 declared as a for loop. */
1739 tree body = build_loop_body (0, NULL_TREE, 0);
1740 $$ = build_new_loop (body);
1741 FOR_LOOP_P ($$) = 1;
1742 /* The loop is added to the current block the for
1743 statement is defined within */
1744 java_method_add_stmt (current_function_decl, $$);
1747 for_init: /* Can be empty */
1748 { $$ = build_java_empty_stmt (); }
1749 | statement_expression_list
1751 /* Init statement recorded within the previously
1752 defined block scope */
1753 $$ = java_method_add_stmt (current_function_decl, $1);
1755 | local_variable_declaration
1757 /* Local variable are recorded within the previously
1758 defined block scope */
1761 | statement_expression_list error
1762 {yyerror ("';' expected"); DRECOVER(for_init_1);}
1765 for_update: /* Can be empty */
1766 {$$ = build_java_empty_stmt ();}
1767 | statement_expression_list
1768 { $$ = build_debugable_stmt (BUILD_LOCATION (), $1); }
1771 statement_expression_list:
1772 statement_expression
1773 { $$ = add_stmt_to_compound (NULL_TREE, NULL_TREE, $1); }
1774 | statement_expression_list C_TK statement_expression
1775 { $$ = add_stmt_to_compound ($1, NULL_TREE, $3); }
1776 | statement_expression_list C_TK error
1777 {yyerror ("Missing term"); RECOVER;}
1782 { $$ = build_bc_statement ($1.location, 1, NULL_TREE); }
1783 | BREAK_TK identifier SC_TK
1784 { $$ = build_bc_statement ($1.location, 1, $2); }
1786 {yyerror ("Missing term"); RECOVER;}
1787 | BREAK_TK identifier error
1788 {yyerror ("';' expected"); RECOVER;}
1793 { $$ = build_bc_statement ($1.location, 0, NULL_TREE); }
1794 | CONTINUE_TK identifier SC_TK
1795 { $$ = build_bc_statement ($1.location, 0, $2); }
1797 {yyerror ("Missing term"); RECOVER;}
1798 | CONTINUE_TK identifier error
1799 {yyerror ("';' expected"); RECOVER;}
1804 { $$ = build_return ($1.location, NULL_TREE); }
1805 | RETURN_TK expression SC_TK
1806 { $$ = build_return ($1.location, $2); }
1808 {yyerror ("Missing term"); RECOVER;}
1809 | RETURN_TK expression error
1810 {yyerror ("';' expected"); RECOVER;}
1814 THROW_TK expression SC_TK
1816 $$ = build1 (THROW_EXPR, NULL_TREE, $2);
1817 EXPR_WFL_LINECOL ($$) = $1.location;
1820 {yyerror ("Missing term"); RECOVER;}
1821 | THROW_TK expression error
1822 {yyerror ("';' expected"); RECOVER;}
1826 ASSERT_TK expression REL_CL_TK expression SC_TK
1828 $$ = build_assertion ($1.location, $2, $4);
1830 | ASSERT_TK expression SC_TK
1832 $$ = build_assertion ($1.location, $2, NULL_TREE);
1835 {yyerror ("Missing term"); RECOVER;}
1836 | ASSERT_TK expression error
1837 {yyerror ("';' expected"); RECOVER;}
1840 synchronized_statement:
1841 synchronized OP_TK expression CP_TK block
1843 $$ = build2 (SYNCHRONIZED_EXPR, NULL_TREE, $3, $5);
1844 EXPR_WFL_LINECOL ($$) =
1845 EXPR_WFL_LINECOL (MODIFIER_WFL (SYNCHRONIZED_TK));
1847 | synchronized OP_TK expression CP_TK error
1848 {yyerror ("'{' expected"); RECOVER;}
1849 | synchronized error
1850 {yyerror ("'(' expected"); RECOVER;}
1851 | synchronized OP_TK error CP_TK
1852 {yyerror ("Missing term"); RECOVER;}
1853 | synchronized OP_TK error
1854 {yyerror ("Missing term"); RECOVER;}
1861 "Illegal modifier `%s'. Only `synchronized' was expected here",
1862 $1, ACC_SYNCHRONIZED);
1863 if ($1 != ACC_SYNCHRONIZED)
1864 MODIFIER_WFL (SYNCHRONIZED_TK) =
1865 build_wfl_node (NULL_TREE);
1870 TRY_TK block catches
1871 { $$ = build_try_statement ($1.location, $2, $3); }
1872 | TRY_TK block finally
1873 { $$ = build_try_finally_statement ($1.location, $2, $3); }
1874 | TRY_TK block catches finally
1875 { $$ = build_try_finally_statement
1876 ($1.location, build_try_statement ($1.location,
1880 {yyerror ("'{' expected"); DRECOVER (try_statement);}
1885 | catches catch_clause
1887 TREE_CHAIN ($2) = $1;
1893 catch_clause_parameter block
1895 java_method_add_stmt (current_function_decl, $2);
1901 catch_clause_parameter:
1902 CATCH_TK OP_TK formal_parameter CP_TK
1904 /* We add a block to define a scope for
1905 formal_parameter (CCBP). The formal parameter is
1906 declared initialized by the appropriate function
1912 ccpb = enter_block ();
1913 init = build_assignment
1914 (ASSIGN_TK, $2.location, TREE_PURPOSE ($3),
1915 build0 (JAVA_EXC_OBJ_EXPR, ptr_type_node));
1916 declare_local_variables (0, TREE_VALUE ($3),
1918 (TREE_PURPOSE ($3), init));
1919 $$ = build1 (JAVA_CATCH_EXPR, NULL_TREE, ccpb);
1920 EXPR_WFL_LINECOL ($$) = $1.location;
1924 $$ = error_mark_node;
1928 {yyerror ("'(' expected"); RECOVER; $$ = NULL_TREE;}
1929 | CATCH_TK OP_TK error
1931 yyerror ("Missing term or ')' expected");
1932 RECOVER; $$ = NULL_TREE;
1934 | CATCH_TK OP_TK error CP_TK /* That's for () */
1935 {yyerror ("Missing term"); RECOVER; $$ = NULL_TREE;}
1942 {yyerror ("'{' expected"); RECOVER; }
1945 /* 19.12 Production from 15: Expressions */
1947 primary_no_new_array
1948 | array_creation_uninitialized
1949 | array_creation_initialized
1952 primary_no_new_array:
1955 { $$ = build_this ($1.location); }
1956 | OP_TK expression CP_TK
1958 | class_instance_creation_expression
1963 /* Added, JDK1.1 inner classes. Documentation is wrong
1964 refering to a 'ClassName' (class_name) rule that doesn't
1965 exist. Used name: instead. */
1966 | name DOT_TK THIS_TK
1968 tree wfl = build_wfl_node (this_identifier_node);
1969 $$ = make_qualified_primary ($1, wfl, EXPR_WFL_LINECOL ($1));
1971 | OP_TK expression error
1972 {yyerror ("')' expected"); RECOVER;}
1974 {yyerror ("'class' or 'this' expected" ); RECOVER;}
1975 | primitive_type DOT_TK error
1976 {yyerror ("'class' expected" ); RECOVER;}
1977 | VOID_TK DOT_TK error
1978 {yyerror ("'class' expected" ); RECOVER;}
1982 name DOT_TK CLASS_TK
1983 { $$ = build_incomplete_class_ref ($2.location, $1); }
1984 | array_type DOT_TK CLASS_TK
1985 { $$ = build_incomplete_class_ref ($2.location, $1); }
1986 | primitive_type DOT_TK CLASS_TK
1987 { $$ = build_incomplete_class_ref ($2.location, $1); }
1988 | VOID_TK DOT_TK CLASS_TK
1990 $$ = build_incomplete_class_ref ($2.location,
1995 class_instance_creation_expression:
1996 NEW_TK class_type OP_TK argument_list CP_TK
1997 { $$ = build_new_invocation ($2, $4); }
1998 | NEW_TK class_type OP_TK CP_TK
1999 { $$ = build_new_invocation ($2, NULL_TREE); }
2000 | anonymous_class_creation
2001 /* Added, JDK1.1 inner classes, modified to use name or
2002 primary instead of primary solely which couldn't work in
2004 | something_dot_new identifier OP_TK CP_TK
2006 tree ctor = build_new_invocation ($2, NULL_TREE);
2007 $$ = make_qualified_primary ($1, ctor,
2008 EXPR_WFL_LINECOL ($1));
2010 | something_dot_new identifier OP_TK CP_TK class_body
2011 | something_dot_new identifier OP_TK argument_list CP_TK
2013 tree ctor = build_new_invocation ($2, $4);
2014 $$ = make_qualified_primary ($1, ctor,
2015 EXPR_WFL_LINECOL ($1));
2017 | something_dot_new identifier OP_TK argument_list CP_TK class_body
2018 | NEW_TK error SC_TK
2019 {yyerror ("'(' expected"); DRECOVER(new_1);}
2020 | NEW_TK class_type error
2021 {yyerror ("'(' expected"); RECOVER;}
2022 | NEW_TK class_type OP_TK error
2023 {yyerror ("')' or term expected"); RECOVER;}
2024 | NEW_TK class_type OP_TK argument_list error
2025 {yyerror ("')' expected"); RECOVER;}
2026 | something_dot_new error
2027 {YYERROR_NOW; yyerror ("Identifier expected"); RECOVER;}
2028 | something_dot_new identifier error
2029 {yyerror ("'(' expected"); RECOVER;}
2032 /* Created after JDK1.1 rules originally added to
2033 class_instance_creation_expression, but modified to use
2034 'class_type' instead of 'TypeName' (type_name) which is mentioned
2035 in the documentation but doesn't exist. */
2037 anonymous_class_creation:
2038 NEW_TK class_type OP_TK argument_list CP_TK
2039 { create_anonymous_class ($2); }
2042 tree id = build_wfl_node (DECL_NAME (GET_CPC ()));
2043 EXPR_WFL_LINECOL (id) = EXPR_WFL_LINECOL ($2);
2045 end_class_declaration (1);
2047 /* Now we can craft the new expression */
2048 $$ = build_new_invocation (id, $4);
2050 /* Note that we can't possibly be here if
2051 `class_type' is an interface (in which case the
2052 anonymous class extends Object and implements
2053 `class_type', hence its constructor can't have
2056 /* Otherwise, the innerclass must feature a
2057 constructor matching `argument_list'. Anonymous
2058 classes are a bit special: it's impossible to
2059 define constructor for them, hence constructors
2060 must be generated following the hints provided by
2061 the `new' expression. Whether a super constructor
2062 of that nature exists or not is to be verified
2063 later on in verify_constructor_super.
2065 It's during the expansion of a `new' statement
2066 refering to an anonymous class that a ctor will
2067 be generated for the anonymous class, with the
2071 | NEW_TK class_type OP_TK CP_TK
2072 { create_anonymous_class ($2); }
2075 tree id = build_wfl_node (DECL_NAME (GET_CPC ()));
2076 EXPR_WFL_LINECOL (id) = EXPR_WFL_LINECOL ($2);
2078 end_class_declaration (1);
2080 /* Now we can craft the new expression. The
2081 statement doesn't need to be remember so that a
2082 constructor can be generated, since its signature
2083 is already known. */
2084 $$ = build_new_invocation (id, NULL_TREE);
2088 something_dot_new: /* Added, not part of the specs. */
2091 | primary DOT_TK NEW_TK
2098 $$ = tree_cons (NULL_TREE, $1, NULL_TREE);
2099 ctxp->formal_parameter_number = 1;
2101 | argument_list C_TK expression
2103 ctxp->formal_parameter_number += 1;
2104 $$ = tree_cons (NULL_TREE, $3, $1);
2106 | argument_list C_TK error
2107 {yyerror ("Missing term"); RECOVER;}
2110 array_creation_uninitialized:
2111 NEW_TK primitive_type dim_exprs
2112 { $$ = build_newarray_node ($2, $3, 0); }
2113 | NEW_TK class_or_interface_type dim_exprs
2114 { $$ = build_newarray_node ($2, $3, 0); }
2115 | NEW_TK primitive_type dim_exprs dims
2116 { $$ = build_newarray_node ($2, $3, pop_current_osb (ctxp));}
2117 | NEW_TK class_or_interface_type dim_exprs dims
2118 { $$ = build_newarray_node ($2, $3, pop_current_osb (ctxp));}
2119 | NEW_TK error CSB_TK
2120 {yyerror ("'[' expected"); DRECOVER ("]");}
2121 | NEW_TK error OSB_TK
2122 {yyerror ("']' expected"); RECOVER;}
2125 array_creation_initialized:
2126 /* Added, JDK1.1 anonymous array. Initial documentation rule
2128 NEW_TK class_or_interface_type dims array_initializer
2131 int osb = pop_current_osb (ctxp);
2133 obstack_grow (&temporary_obstack, "[]", 2);
2134 obstack_1grow (&temporary_obstack, '\0');
2135 sig = obstack_finish (&temporary_obstack);
2136 $$ = build3 (NEW_ANONYMOUS_ARRAY_EXPR, NULL_TREE,
2137 $2, get_identifier (sig), $4);
2139 | NEW_TK primitive_type dims array_initializer
2141 int osb = pop_current_osb (ctxp);
2144 type = build_java_array_type (type, -1);
2145 $$ = build3 (NEW_ANONYMOUS_ARRAY_EXPR, NULL_TREE,
2146 build_pointer_type (type), NULL_TREE, $4);
2148 | NEW_TK error CSB_TK
2149 {yyerror ("'[' expected"); DRECOVER ("]");}
2150 | NEW_TK error OSB_TK
2151 {yyerror ("']' expected"); RECOVER;}
2156 { $$ = build_tree_list (NULL_TREE, $1); }
2157 | dim_exprs dim_expr
2158 { $$ = tree_cons (NULL_TREE, $2, $$); }
2162 OSB_TK expression CSB_TK
2164 if (JNUMERIC_TYPE_P (TREE_TYPE ($2)))
2166 $2 = build_wfl_node ($2);
2167 TREE_TYPE ($2) = NULL_TREE;
2169 EXPR_WFL_LINECOL ($2) = $1.location;
2172 | OSB_TK expression error
2173 {yyerror ("']' expected"); RECOVER;}
2176 yyerror ("Missing term");
2177 yyerror ("']' expected");
2186 /* If not initialized, allocate memory for the osb
2188 if (!ctxp->osb_limit)
2190 allocate = ctxp->osb_limit = 32;
2191 ctxp->osb_depth = -1;
2193 /* If capacity overflown, reallocate a bigger chunk */
2194 else if (ctxp->osb_depth+1 == ctxp->osb_limit)
2195 allocate = ctxp->osb_limit << 1;
2199 allocate *= sizeof (int);
2200 if (ctxp->osb_number)
2201 ctxp->osb_number = xrealloc (ctxp->osb_number,
2204 ctxp->osb_number = xmalloc (allocate);
2207 CURRENT_OSB (ctxp) = 1;
2209 | dims OSB_TK CSB_TK
2210 { CURRENT_OSB (ctxp)++; }
2212 { yyerror ("']' expected"); RECOVER;}
2216 primary DOT_TK identifier
2217 { $$ = make_qualified_primary ($1, $3, $2.location); }
2218 /* FIXME - REWRITE TO:
2219 { $$ = build_binop (COMPONENT_REF, $2.location, $1, $3); } */
2220 | SUPER_TK DOT_TK identifier
2222 tree super_wfl = build_wfl_node (super_identifier_node);
2223 EXPR_WFL_LINECOL (super_wfl) = $1.location;
2224 $$ = make_qualified_name (super_wfl, $3, $2.location);
2227 {yyerror ("Field expected"); DRECOVER (super_field_acces);}
2232 { $$ = build_method_invocation ($1, NULL_TREE); }
2233 | name OP_TK argument_list CP_TK
2234 { $$ = build_method_invocation ($1, $3); }
2235 | primary DOT_TK identifier OP_TK CP_TK
2237 if (TREE_CODE ($1) == THIS_EXPR)
2238 $$ = build_this_super_qualified_invocation
2239 (1, $3, NULL_TREE, 0, $2.location);
2242 tree invok = build_method_invocation ($3, NULL_TREE);
2243 $$ = make_qualified_primary ($1, invok, $2.location);
2246 | primary DOT_TK identifier OP_TK argument_list CP_TK
2248 if (TREE_CODE ($1) == THIS_EXPR)
2249 $$ = build_this_super_qualified_invocation
2250 (1, $3, $5, 0, $2.location);
2253 tree invok = build_method_invocation ($3, $5);
2254 $$ = make_qualified_primary ($1, invok, $2.location);
2257 | SUPER_TK DOT_TK identifier OP_TK CP_TK
2259 $$ = build_this_super_qualified_invocation
2260 (0, $3, NULL_TREE, $1.location, $2.location);
2262 | SUPER_TK DOT_TK identifier OP_TK argument_list CP_TK
2264 $$ = build_this_super_qualified_invocation
2265 (0, $3, $5, $1.location, $2.location);
2267 /* Screws up thing. I let it here until I'm convinced it can
2269 | primary DOT_TK error
2270 {yyerror ("'(' expected"); DRECOVER(bad);} */
2271 | SUPER_TK DOT_TK error CP_TK
2272 { yyerror ("'(' expected"); DRECOVER (method_invocation); }
2273 | SUPER_TK DOT_TK error DOT_TK
2274 { yyerror ("'(' expected"); DRECOVER (method_invocation); }
2278 name OSB_TK expression CSB_TK
2279 { $$ = build_array_ref ($2.location, $1, $3); }
2280 | primary_no_new_array OSB_TK expression CSB_TK
2281 { $$ = build_array_ref ($2.location, $1, $3); }
2282 | array_creation_initialized OSB_TK expression CSB_TK
2283 { $$ = build_array_ref ($2.location, $1, $3); }
2286 yyerror ("Missing term and ']' expected");
2287 DRECOVER(array_access);
2289 | name OSB_TK expression error
2291 yyerror ("']' expected");
2292 DRECOVER(array_access);
2294 | primary_no_new_array OSB_TK error
2296 yyerror ("Missing term and ']' expected");
2297 DRECOVER(array_access);
2299 | primary_no_new_array OSB_TK expression error
2301 yyerror ("']' expected");
2302 DRECOVER(array_access);
2304 | array_creation_initialized OSB_TK error
2306 yyerror ("Missing term and ']' expected");
2307 DRECOVER(array_access);
2309 | array_creation_initialized OSB_TK expression error
2311 yyerror ("']' expected");
2312 DRECOVER(array_access);
2319 | post_increment_expression
2320 | post_decrement_expression
2323 post_increment_expression:
2324 postfix_expression INCR_TK
2325 { $$ = build_incdec ($2.token, $2.location, $1, 1); }
2328 post_decrement_expression:
2329 postfix_expression DECR_TK
2330 { $$ = build_incdec ($2.token, $2.location, $1, 1); }
2333 trap_overflow_corner_case:
2334 pre_increment_expression
2335 | pre_decrement_expression
2336 | PLUS_TK unary_expression
2337 {$$ = build_unaryop ($1.token, $1.location, $2); }
2338 | unary_expression_not_plus_minus
2340 {yyerror ("Missing term"); RECOVER}
2344 trap_overflow_corner_case
2346 error_if_numeric_overflow ($1);
2349 | MINUS_TK trap_overflow_corner_case
2350 {$$ = build_unaryop ($1.token, $1.location, $2); }
2352 {yyerror ("Missing term"); RECOVER}
2355 pre_increment_expression:
2356 INCR_TK unary_expression
2357 {$$ = build_incdec ($1.token, $1.location, $2, 0); }
2359 {yyerror ("Missing term"); RECOVER}
2362 pre_decrement_expression:
2363 DECR_TK unary_expression
2364 {$$ = build_incdec ($1.token, $1.location, $2, 0); }
2366 {yyerror ("Missing term"); RECOVER}
2369 unary_expression_not_plus_minus:
2371 | NOT_TK unary_expression
2372 {$$ = build_unaryop ($1.token, $1.location, $2); }
2373 | NEG_TK unary_expression
2374 {$$ = build_unaryop ($1.token, $1.location, $2); }
2377 {yyerror ("Missing term"); RECOVER}
2379 {yyerror ("Missing term"); RECOVER}
2382 cast_expression: /* Error handling here is potentially weak */
2383 OP_TK primitive_type dims CP_TK unary_expression
2386 int osb = pop_current_osb (ctxp);
2388 type = build_java_array_type (type, -1);
2389 $$ = build_cast ($1.location, type, $5);
2391 | OP_TK primitive_type CP_TK unary_expression
2392 { $$ = build_cast ($1.location, $2, $4); }
2393 | OP_TK expression CP_TK unary_expression_not_plus_minus
2394 { $$ = build_cast ($1.location, $2, $4); }
2395 | OP_TK name dims CP_TK unary_expression_not_plus_minus
2398 int osb = pop_current_osb (ctxp);
2399 obstack_grow (&temporary_obstack,
2400 IDENTIFIER_POINTER (EXPR_WFL_NODE ($2)),
2401 IDENTIFIER_LENGTH (EXPR_WFL_NODE ($2)));
2403 obstack_grow (&temporary_obstack, "[]", 2);
2404 obstack_1grow (&temporary_obstack, '\0');
2405 ptr = obstack_finish (&temporary_obstack);
2406 EXPR_WFL_NODE ($2) = get_identifier (ptr);
2407 $$ = build_cast ($1.location, $2, $5);
2409 | OP_TK primitive_type OSB_TK error
2410 {yyerror ("']' expected, invalid type expression");}
2413 YYNOT_TWICE yyerror ("Invalid type expression"); RECOVER;
2416 | OP_TK primitive_type dims CP_TK error
2417 {yyerror ("Missing term"); RECOVER;}
2418 | OP_TK primitive_type CP_TK error
2419 {yyerror ("Missing term"); RECOVER;}
2420 | OP_TK name dims CP_TK error
2421 {yyerror ("Missing term"); RECOVER;}
2424 multiplicative_expression:
2426 | multiplicative_expression MULT_TK unary_expression
2428 $$ = build_binop (BINOP_LOOKUP ($2.token),
2429 $2.location, $1, $3);
2431 | multiplicative_expression DIV_TK unary_expression
2433 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2436 | multiplicative_expression REM_TK unary_expression
2438 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2441 | multiplicative_expression MULT_TK error
2442 {yyerror ("Missing term"); RECOVER;}
2443 | multiplicative_expression DIV_TK error
2444 {yyerror ("Missing term"); RECOVER;}
2445 | multiplicative_expression REM_TK error
2446 {yyerror ("Missing term"); RECOVER;}
2449 additive_expression:
2450 multiplicative_expression
2451 | additive_expression PLUS_TK multiplicative_expression
2453 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2456 | additive_expression MINUS_TK multiplicative_expression
2458 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2461 | additive_expression PLUS_TK error
2462 {yyerror ("Missing term"); RECOVER;}
2463 | additive_expression MINUS_TK error
2464 {yyerror ("Missing term"); RECOVER;}
2469 | shift_expression LS_TK additive_expression
2471 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2474 | shift_expression SRS_TK additive_expression
2476 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2479 | shift_expression ZRS_TK additive_expression
2481 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2484 | shift_expression LS_TK error
2485 {yyerror ("Missing term"); RECOVER;}
2486 | shift_expression SRS_TK error
2487 {yyerror ("Missing term"); RECOVER;}
2488 | shift_expression ZRS_TK error
2489 {yyerror ("Missing term"); RECOVER;}
2492 relational_expression:
2494 | relational_expression LT_TK shift_expression
2496 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2499 | relational_expression GT_TK shift_expression
2501 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2504 | relational_expression LTE_TK shift_expression
2506 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2509 | relational_expression GTE_TK shift_expression
2511 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2514 | relational_expression INSTANCEOF_TK reference_type
2515 { $$ = build_binop (INSTANCEOF_EXPR, $2.location, $1, $3); }
2516 | relational_expression LT_TK error
2517 {yyerror ("Missing term"); RECOVER;}
2518 | relational_expression GT_TK error
2519 {yyerror ("Missing term"); RECOVER;}
2520 | relational_expression LTE_TK error
2521 {yyerror ("Missing term"); RECOVER;}
2522 | relational_expression GTE_TK error
2523 {yyerror ("Missing term"); RECOVER;}
2524 | relational_expression INSTANCEOF_TK error
2525 {yyerror ("Invalid reference type"); RECOVER;}
2528 equality_expression:
2529 relational_expression
2530 | equality_expression EQ_TK relational_expression
2532 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2535 | equality_expression NEQ_TK relational_expression
2537 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2540 | equality_expression EQ_TK error
2541 {yyerror ("Missing term"); RECOVER;}
2542 | equality_expression NEQ_TK error
2543 {yyerror ("Missing term"); RECOVER;}
2548 | and_expression AND_TK equality_expression
2550 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2553 | and_expression AND_TK error
2554 {yyerror ("Missing term"); RECOVER;}
2557 exclusive_or_expression:
2559 | exclusive_or_expression XOR_TK and_expression
2561 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2564 | exclusive_or_expression XOR_TK error
2565 {yyerror ("Missing term"); RECOVER;}
2568 inclusive_or_expression:
2569 exclusive_or_expression
2570 | inclusive_or_expression OR_TK exclusive_or_expression
2572 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2575 | inclusive_or_expression OR_TK error
2576 {yyerror ("Missing term"); RECOVER;}
2579 conditional_and_expression:
2580 inclusive_or_expression
2581 | conditional_and_expression BOOL_AND_TK inclusive_or_expression
2583 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2586 | conditional_and_expression BOOL_AND_TK error
2587 {yyerror ("Missing term"); RECOVER;}
2590 conditional_or_expression:
2591 conditional_and_expression
2592 | conditional_or_expression BOOL_OR_TK conditional_and_expression
2594 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2597 | conditional_or_expression BOOL_OR_TK error
2598 {yyerror ("Missing term"); RECOVER;}
2601 conditional_expression: /* Error handling here is weak */
2602 conditional_or_expression
2603 | conditional_or_expression REL_QM_TK expression REL_CL_TK conditional_expression
2605 $$ = build3 (CONDITIONAL_EXPR, NULL_TREE, $1, $3, $5);
2606 EXPR_WFL_LINECOL ($$) = $2.location;
2608 | conditional_or_expression REL_QM_TK REL_CL_TK error
2611 yyerror ("Missing term");
2614 | conditional_or_expression REL_QM_TK error
2615 {yyerror ("Missing term"); DRECOVER (2);}
2616 | conditional_or_expression REL_QM_TK expression REL_CL_TK error
2617 {yyerror ("Missing term"); DRECOVER (3);}
2620 assignment_expression:
2621 conditional_expression
2626 left_hand_side assignment_operator assignment_expression
2627 { $$ = build_assignment ($2.token, $2.location, $1, $3); }
2628 | left_hand_side assignment_operator error
2630 YYNOT_TWICE yyerror ("Missing term");
2641 assignment_operator:
2647 assignment_expression
2650 constant_expression:
2656 /* Helper function to retrieve an OSB count. Should be used when the
2657 `dims:' rule is being used. */
2660 pop_current_osb (struct parser_ctxt *ctxp)
2664 if (ctxp->osb_depth < 0)
2667 to_return = CURRENT_OSB (ctxp);
2675 /* This section of the code deal with save/restoring parser contexts.
2676 Add mode documentation here. FIXME */
2678 /* Helper function. Create a new parser context. With
2679 COPY_FROM_PREVIOUS set to a nonzero value, content of the previous
2680 context is copied, otherwise, the new context is zeroed. The newly
2681 created context becomes the current one. */
2684 create_new_parser_context (int copy_from_previous)
2686 struct parser_ctxt *new;
2688 new = ggc_alloc (sizeof (struct parser_ctxt));
2689 if (copy_from_previous)
2691 memcpy (new, ctxp, sizeof (struct parser_ctxt));
2692 /* This flag, indicating the context saves global values,
2693 should only be set by java_parser_context_save_global. */
2694 new->saved_data_ctx = 0;
2697 memset (new, 0, sizeof (struct parser_ctxt));
2703 /* Create a new parser context and make it the current one. */
2706 java_push_parser_context (void)
2708 create_new_parser_context (0);
2712 java_pop_parser_context (int generate)
2715 struct parser_ctxt *toFree, *next;
2724 input_line = ctxp->lineno;
2725 current_class = ctxp->class_type;
2728 /* If the old and new lexers differ, then free the old one. */
2729 if (ctxp->lexer && next && ctxp->lexer != next->lexer)
2730 java_destroy_lexer (ctxp->lexer);
2732 /* Set the single import class file flag to 0 for the current list
2733 of imported things */
2734 for (current = ctxp->import_list; current; current = TREE_CHAIN (current))
2735 IS_A_SINGLE_IMPORT_CLASSFILE_NAME_P (TREE_VALUE (current)) = 0;
2737 /* And restore those of the previous context */
2738 if ((ctxp = next)) /* Assignment is really meant here */
2739 for (current = ctxp->import_list; current; current = TREE_CHAIN (current))
2740 IS_A_SINGLE_IMPORT_CLASSFILE_NAME_P (TREE_VALUE (current)) = 1;
2742 /* If we pushed a context to parse a class intended to be generated,
2743 we keep it so we can remember the class. What we could actually
2744 do is to just update a list of class names. */
2747 toFree->next = ctxp_for_generation;
2748 ctxp_for_generation = toFree;
2752 /* Create a parser context for the use of saving some global
2756 java_parser_context_save_global (void)
2760 java_push_parser_context ();
2761 ctxp->saved_data_ctx = 1;
2764 /* If this context already stores data, create a new one suitable
2765 for data storage. */
2766 else if (ctxp->saved_data)
2768 create_new_parser_context (1);
2769 ctxp->saved_data_ctx = 1;
2772 ctxp->lineno = input_line;
2773 ctxp->class_type = current_class;
2774 ctxp->filename = input_filename;
2775 ctxp->function_decl = current_function_decl;
2776 ctxp->saved_data = 1;
2779 /* Restore some global variables from the previous context. Make the
2780 previous context the current one. */
2783 java_parser_context_restore_global (void)
2785 input_line = ctxp->lineno;
2786 current_class = ctxp->class_type;
2787 input_filename = ctxp->filename;
2789 EXPR_WFL_FILENAME_NODE (wfl_operator) = get_identifier (input_filename);
2790 current_function_decl = ctxp->function_decl;
2791 ctxp->saved_data = 0;
2792 if (ctxp->saved_data_ctx)
2793 java_pop_parser_context (0);
2796 /* Suspend vital data for the current class/function being parsed so
2797 that an other class can be parsed. Used to let local/anonymous
2798 classes be parsed. */
2801 java_parser_context_suspend (void)
2803 /* This makes debugging through java_debug_context easier */
2804 static const char *const name = "<inner buffer context>";
2806 /* Duplicate the previous context, use it to save the globals we're
2808 create_new_parser_context (1);
2809 ctxp->function_decl = current_function_decl;
2810 ctxp->class_type = current_class;
2812 /* Then create a new context which inherits all data from the
2813 previous one. This will be the new current context */
2814 create_new_parser_context (1);
2816 /* Help debugging */
2817 ctxp->next->filename = name;
2820 /* Resume vital data for the current class/function being parsed so
2821 that an other class can be parsed. Used to let local/anonymous
2822 classes be parsed. The trick is the data storing file position
2823 informations must be restored to their current value, so parsing
2824 can resume as if no context was ever saved. */
2827 java_parser_context_resume (void)
2829 struct parser_ctxt *old = ctxp; /* This one is to be discarded */
2830 struct parser_ctxt *saver = old->next; /* This one contain saved info */
2831 struct parser_ctxt *restored = saver->next; /* This one is the old current */
2833 /* We need to inherit the list of classes to complete/generate */
2834 restored->classd_list = old->classd_list;
2835 restored->class_list = old->class_list;
2837 /* Restore the current class and function from the saver */
2838 current_class = saver->class_type;
2839 current_function_decl = saver->function_decl;
2841 /* Retrieve the restored context */
2844 /* Re-installed the data for the parsing to carry on */
2845 memcpy (&ctxp->marker_begining, &old->marker_begining,
2846 (size_t)(&ctxp->marker_end - &ctxp->marker_begining));
2849 /* Add a new anchor node to which all statement(s) initializing static
2850 and non static initialized upon declaration field(s) will be
2854 java_parser_context_push_initialized_field (void)
2858 node = build_tree_list (NULL_TREE, NULL_TREE);
2859 TREE_CHAIN (node) = CPC_STATIC_INITIALIZER_LIST (ctxp);
2860 CPC_STATIC_INITIALIZER_LIST (ctxp) = node;
2862 node = build_tree_list (NULL_TREE, NULL_TREE);
2863 TREE_CHAIN (node) = CPC_INITIALIZER_LIST (ctxp);
2864 CPC_INITIALIZER_LIST (ctxp) = node;
2866 node = build_tree_list (NULL_TREE, NULL_TREE);
2867 TREE_CHAIN (node) = CPC_INSTANCE_INITIALIZER_LIST (ctxp);
2868 CPC_INSTANCE_INITIALIZER_LIST (ctxp) = node;
2871 /* Pop the lists of initialized field. If this lists aren't empty,
2872 remember them so we can use it to create and populate the finit$
2873 or <clinit> functions. */
2876 java_parser_context_pop_initialized_field (void)
2879 tree class_type = TREE_TYPE (GET_CPC ());
2881 if (CPC_INITIALIZER_LIST (ctxp))
2883 stmts = CPC_INITIALIZER_STMT (ctxp);
2884 CPC_INITIALIZER_LIST (ctxp) = TREE_CHAIN (CPC_INITIALIZER_LIST (ctxp));
2885 if (stmts && !java_error_count)
2886 TYPE_FINIT_STMT_LIST (class_type) = reorder_static_initialized (stmts);
2889 if (CPC_STATIC_INITIALIZER_LIST (ctxp))
2891 stmts = CPC_STATIC_INITIALIZER_STMT (ctxp);
2892 CPC_STATIC_INITIALIZER_LIST (ctxp) =
2893 TREE_CHAIN (CPC_STATIC_INITIALIZER_LIST (ctxp));
2894 /* Keep initialization in order to enforce 8.5 */
2895 if (stmts && !java_error_count)
2896 TYPE_CLINIT_STMT_LIST (class_type) = nreverse (stmts);
2899 /* JDK 1.1 instance initializers */
2900 if (CPC_INSTANCE_INITIALIZER_LIST (ctxp))
2902 stmts = CPC_INSTANCE_INITIALIZER_STMT (ctxp);
2903 CPC_INSTANCE_INITIALIZER_LIST (ctxp) =
2904 TREE_CHAIN (CPC_INSTANCE_INITIALIZER_LIST (ctxp));
2905 if (stmts && !java_error_count)
2906 TYPE_II_STMT_LIST (class_type) = nreverse (stmts);
2911 reorder_static_initialized (tree list)
2913 /* We have to keep things in order. The alias initializer have to
2914 come first, then the initialized regular field, in reverse to
2915 keep them in lexical order. */
2916 tree marker, previous = NULL_TREE;
2917 for (marker = list; marker; previous = marker, marker = TREE_CHAIN (marker))
2918 if (TREE_CODE (marker) == TREE_LIST
2919 && !TREE_VALUE (marker) && !TREE_PURPOSE (marker))
2922 /* No static initialized, the list is fine as is */
2924 list = TREE_CHAIN (marker);
2926 /* No marker? reverse the whole list */
2928 list = nreverse (list);
2930 /* Otherwise, reverse what's after the marker and the new reordered
2931 sublist will replace the marker. */
2934 TREE_CHAIN (previous) = NULL_TREE;
2935 list = nreverse (list);
2936 list = chainon (TREE_CHAIN (marker), list);
2941 /* Helper functions to dump the parser context stack. */
2943 #define TAB_CONTEXT(C) \
2944 {int i; for (i = 0; i < (C); i++) fputc (' ', stderr);}
2947 java_debug_context_do (int tab)
2949 struct parser_ctxt *copy = ctxp;
2953 fprintf (stderr, "ctxt: 0x%0lX\n", (unsigned long)copy);
2955 fprintf (stderr, "filename: %s\n", copy->filename);
2957 fprintf (stderr, "lineno: %d\n", copy->lineno);
2959 fprintf (stderr, "package: %s\n",
2961 IDENTIFIER_POINTER (copy->package) : "<none>"));
2963 fprintf (stderr, "context for saving: %d\n", copy->saved_data_ctx);
2965 fprintf (stderr, "saved data: %d\n", copy->saved_data);
2971 /* Dump the stacked up parser contexts. Intended to be called from a
2975 java_debug_context (void)
2977 java_debug_context_do (0);
2982 /* Flag for the error report routine to issue the error the first time
2983 it's called (overriding the default behavior which is to drop the
2984 first invocation and honor the second one, taking advantage of a
2986 static int force_error = 0;
2988 /* Reporting an constructor invocation error. */
2990 parse_ctor_invocation_error (void)
2992 if (DECL_CONSTRUCTOR_P (current_function_decl))
2993 yyerror ("Constructor invocation must be first thing in a constructor");
2995 yyerror ("Only constructors can invoke constructors");
2998 /* Reporting JDK1.1 features not implemented. */
3001 parse_jdk1_1_error (const char *msg)
3003 sorry (": `%s' JDK1.1(TM) feature", msg);
3005 return build_java_empty_stmt ();
3008 static int do_warning = 0;
3011 yyerror (const char *msg)
3014 static int prev_lineno;
3015 static const char *prev_msg;
3018 char *remainder, *code_from_source;
3020 if (!force_error && prev_lineno == input_line)
3023 /* Save current error location but report latter, when the context is
3025 if (ctxp->java_error_flag == 0)
3027 ctxp->java_error_flag = 1;
3029 /* Do something to use the previous line if we're reaching the
3030 end of the file... */
3031 #ifdef VERBOSE_SKELETON
3032 printf ("* Error detected (%s)\n", (msg ? msg : "(null)"));
3037 /* Ignore duplicate message on the same line. BTW, this is dubious. FIXME */
3038 if (!force_error && msg == prev_msg && prev_lineno == elc.line)
3041 ctxp->java_error_flag = 0;
3043 java_warning_count++;
3047 if (elc.col == 0 && msg && msg[1] == ';')
3049 elc.col = ctxp->p_line->char_col-1;
3050 elc.line = ctxp->p_line->lineno;
3053 save_lineno = input_line;
3054 prev_lineno = input_line = elc.line;
3057 code_from_source = java_get_line_col (ctxp->filename, elc.line, elc.col);
3058 obstack_grow0 (&temporary_obstack,
3059 code_from_source, strlen (code_from_source));
3060 remainder = obstack_finish (&temporary_obstack);
3062 warning ("%s.\n%s", msg, remainder);
3064 error ("%s.\n%s", msg, remainder);
3066 /* This allow us to cheaply avoid an extra 'Invalid expression
3067 statement' error report when errors have been already reported on
3068 the same line. This occurs when we report an error but don't have
3069 a synchronization point other than ';', which
3070 expression_statement is the only one to take care of. */
3071 ctxp->prevent_ese = input_line = save_lineno;
3075 issue_warning_error_from_context (tree cl, const char *msg, va_list ap)
3077 const char *saved, *saved_input_filename;
3079 vsprintf (buffer, msg, ap);
3082 ctxp->elc.line = EXPR_WFL_LINENO (cl);
3083 ctxp->elc.col = (EXPR_WFL_COLNO (cl) == 0xfff ? -1 :
3084 (EXPR_WFL_COLNO (cl) == 0xffe ? -2 : EXPR_WFL_COLNO (cl)));
3086 /* We have a CL, that's a good reason for using it if it contains data */
3087 saved = ctxp->filename;
3088 if (TREE_CODE (cl) == EXPR_WITH_FILE_LOCATION && EXPR_WFL_FILENAME_NODE (cl))
3089 ctxp->filename = EXPR_WFL_FILENAME (cl);
3090 saved_input_filename = input_filename;
3091 input_filename = ctxp->filename;
3093 java_error (buffer);
3094 ctxp->filename = saved;
3095 input_filename = saved_input_filename;
3099 /* Issue an error message at a current source line CL */
3102 parse_error_context (tree cl, const char *msg, ...)
3106 issue_warning_error_from_context (cl, msg, ap);
3110 /* Issue a warning at a current source line CL */
3113 parse_warning_context (tree cl, const char *msg, ...)
3118 force_error = do_warning = 1;
3119 issue_warning_error_from_context (cl, msg, ap);
3120 do_warning = force_error = 0;
3125 find_expr_with_wfl (tree node)
3132 switch (TREE_CODE (node))
3135 node = BLOCK_EXPR_BODY (node);
3139 to_return = find_expr_with_wfl (TREE_OPERAND (node, 0));
3142 node = TREE_OPERAND (node, 1);
3146 node = TREE_OPERAND (node, 0);
3149 case LABELED_BLOCK_EXPR:
3150 node = TREE_OPERAND (node, 1);
3154 code = TREE_CODE_CLASS (TREE_CODE (node));
3155 if (((code == '1') || (code == '2') || (code == 'e'))
3156 && EXPR_WFL_LINECOL (node))
3164 /* Issue a missing return statement error. Uses METHOD to figure the
3165 last line of the method the error occurs in. */
3168 missing_return_error (tree method)
3170 EXPR_WFL_SET_LINECOL (wfl_operator, DECL_FUNCTION_LAST_LINE (method), -2);
3171 parse_error_context (wfl_operator, "Missing return statement");
3174 /* Issue an unreachable statement error. From NODE, find the next
3175 statement to report appropriately. */
3177 unreachable_stmt_error (tree node)
3179 /* Browse node to find the next expression node that has a WFL. Use
3180 the location to report the error */
3181 if (TREE_CODE (node) == COMPOUND_EXPR)
3182 node = find_expr_with_wfl (TREE_OPERAND (node, 1));
3184 node = find_expr_with_wfl (node);
3188 EXPR_WFL_SET_LINECOL (wfl_operator, EXPR_WFL_LINENO (node), -2);
3189 parse_error_context (wfl_operator, "Unreachable statement");
3196 not_accessible_field_error (tree wfl, tree decl)
3199 (wfl, "Can't access %s field `%s.%s' from `%s'",
3200 accessibility_string (get_access_flags_from_decl (decl)),
3201 GET_TYPE_NAME (DECL_CONTEXT (decl)),
3202 IDENTIFIER_POINTER (DECL_NAME (decl)),
3203 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (current_class))));
3208 java_report_errors (void)
3210 if (java_error_count)
3211 fprintf (stderr, "%d error%s",
3212 java_error_count, (java_error_count == 1 ? "" : "s"));
3213 if (java_warning_count)
3214 fprintf (stderr, "%s%d warning%s", (java_error_count ? ", " : ""),
3215 java_warning_count, (java_warning_count == 1 ? "" : "s"));
3216 if (java_error_count || java_warning_count)
3217 putc ('\n', stderr);
3218 return java_error_count;
3222 java_accstring_lookup (int flags)
3224 static char buffer [80];
3225 #define COPY_RETURN(S) {strcpy (buffer, S); return buffer;}
3227 /* Access modifier looked-up first for easier report on forbidden
3229 if (flags & ACC_PUBLIC) COPY_RETURN ("public");
3230 if (flags & ACC_PRIVATE) COPY_RETURN ("private");
3231 if (flags & ACC_PROTECTED) COPY_RETURN ("protected");
3232 if (flags & ACC_STATIC) COPY_RETURN ("static");
3233 if (flags & ACC_FINAL) COPY_RETURN ("final");
3234 if (flags & ACC_SYNCHRONIZED) COPY_RETURN ("synchronized");
3235 if (flags & ACC_VOLATILE) COPY_RETURN ("volatile");
3236 if (flags & ACC_TRANSIENT) COPY_RETURN ("transient");
3237 if (flags & ACC_NATIVE) COPY_RETURN ("native");
3238 if (flags & ACC_INTERFACE) COPY_RETURN ("interface");
3239 if (flags & ACC_ABSTRACT) COPY_RETURN ("abstract");
3246 /* Returns a string denoting the accessibility of a class or a member as
3247 indicated by FLAGS. We need a separate function from
3248 java_accstring_lookup, as the latter can return spurious "static", etc.
3249 if package-private access is defined (in which case none of the
3250 relevant access control bits in FLAGS is set). */
3253 accessibility_string (int flags)
3255 if (flags & ACC_PRIVATE) return "private";
3256 if (flags & ACC_PROTECTED) return "protected";
3257 if (flags & ACC_PUBLIC) return "public";
3259 return "package-private";
3262 /* Issuing error messages upon redefinition of classes, interfaces or
3266 classitf_redefinition_error (const char *context, tree id, tree decl, tree cl)
3268 parse_error_context (cl, "%s `%s' already defined in %s:%d",
3269 context, IDENTIFIER_POINTER (id),
3270 DECL_SOURCE_FILE (decl), DECL_SOURCE_LINE (decl));
3271 /* Here we should point out where its redefined. It's a unicode. FIXME */
3275 variable_redefinition_error (tree context, tree name, tree type, int line)
3277 const char *type_name;
3279 /* Figure a proper name for type. We might haven't resolved it */
3280 if (TREE_CODE (type) == POINTER_TYPE && !TREE_TYPE (type))
3281 type_name = IDENTIFIER_POINTER (TYPE_NAME (type));
3283 type_name = lang_printable_name (type, 0);
3285 parse_error_context (context,
3286 "Variable `%s' is already defined in this method and was declared `%s %s' at line %d",
3287 IDENTIFIER_POINTER (name),
3288 type_name, IDENTIFIER_POINTER (name), line);
3291 /* If ANAME is terminated with `[]', it indicates an array. This
3292 function returns the number of `[]' found and if this number is
3293 greater than zero, it extracts the array type name and places it in
3294 the node pointed to by TRIMMED unless TRIMMED is null. */
3297 build_type_name_from_array_name (tree aname, tree *trimmed)
3299 const char *name = IDENTIFIER_POINTER (aname);
3300 int len = IDENTIFIER_LENGTH (aname);
3303 STRING_STRIP_BRACKETS (name, len, array_dims);
3305 if (array_dims && trimmed)
3306 *trimmed = get_identifier_with_length (name, len);
3312 build_array_from_name (tree type, tree type_wfl, tree name, tree *ret_name)
3316 /* Eventually get more dims */
3317 more_dims = build_type_name_from_array_name (name, &name);
3319 /* If we have, then craft a new type for this variable */
3324 /* If we have a pointer, use its type */
3325 if (TREE_CODE (type) == POINTER_TYPE)
3326 type = TREE_TYPE (type);
3328 /* Building the first dimension of a primitive type uses this
3330 if (JPRIMITIVE_TYPE_P (type))
3332 type = build_java_array_type (type, -1);
3335 /* Otherwise, if we have a WFL for this type, use it (the type
3336 is already an array on an unresolved type, and we just keep
3337 on adding dimensions) */
3341 more_dims += build_type_name_from_array_name (TYPE_NAME (save),
3345 /* Add all the dimensions */
3347 type = build_unresolved_array_type (type);
3349 /* The type may have been incomplete in the first place */
3351 type = obtain_incomplete_type (type);
3359 /* Build something that the type identifier resolver will identify as
3360 being an array to an unresolved type. TYPE_WFL is a WFL on a
3364 build_unresolved_array_type (tree type_or_wfl)
3369 /* TYPE_OR_WFL might be an array on a resolved type. In this case,
3370 just create a array type */
3371 if (TREE_CODE (type_or_wfl) == RECORD_TYPE)
3372 return build_java_array_type (type_or_wfl, -1);
3374 obstack_grow (&temporary_obstack,
3375 IDENTIFIER_POINTER (EXPR_WFL_NODE (type_or_wfl)),
3376 IDENTIFIER_LENGTH (EXPR_WFL_NODE (type_or_wfl)));
3377 obstack_grow0 (&temporary_obstack, "[]", 2);
3378 ptr = obstack_finish (&temporary_obstack);
3379 wfl = build_expr_wfl (get_identifier (ptr),
3380 EXPR_WFL_FILENAME (type_or_wfl),
3381 EXPR_WFL_LINENO (type_or_wfl),
3382 EXPR_WFL_COLNO (type_or_wfl));
3383 /* Re-install the existing qualifications so that the type can be
3384 resolved properly. */
3385 EXPR_WFL_QUALIFICATION (wfl) = EXPR_WFL_QUALIFICATION (type_or_wfl);
3390 parser_add_interface (tree class_decl, tree interface_decl, tree wfl)
3392 if (maybe_add_interface (TREE_TYPE (class_decl), TREE_TYPE (interface_decl)))
3393 parse_error_context (wfl, "Interface `%s' repeated",
3394 IDENTIFIER_POINTER (DECL_NAME (interface_decl)));
3397 /* Bulk of common class/interface checks. Return 1 if an error was
3398 encountered. TAG is 0 for a class, 1 for an interface. */
3401 check_class_interface_creation (int is_interface, int flags, tree raw_name,
3402 tree qualified_name, tree decl, tree cl)
3405 int sca = 0; /* Static class allowed */
3406 int icaf = 0; /* Inner class allowed flags */
3407 int uaaf = CLASS_MODIFIERS; /* Usually allowed access flags */
3410 fprintf (stderr, " %s%s %s",
3411 (CPC_INNER_P () ? "inner" : ""),
3412 (is_interface ? "interface" : "class"),
3413 IDENTIFIER_POINTER (qualified_name));
3415 /* Scope of an interface/class type name:
3416 - Can't be imported by a single type import
3417 - Can't already exists in the package */
3418 if (IS_A_SINGLE_IMPORT_CLASSFILE_NAME_P (raw_name)
3419 && (node = find_name_in_single_imports (raw_name))
3423 (cl, "%s name `%s' clashes with imported type `%s'",
3424 (is_interface ? "Interface" : "Class"),
3425 IDENTIFIER_POINTER (raw_name), IDENTIFIER_POINTER (node));
3428 if (decl && CLASS_COMPLETE_P (decl))
3430 classitf_redefinition_error ((is_interface ? "Interface" : "Class"),
3431 qualified_name, decl, cl);
3435 if (check_inner_class_redefinition (raw_name, cl))
3438 /* If public, file name should match class/interface name, except
3439 when dealing with an inner class */
3440 if (!CPC_INNER_P () && (flags & ACC_PUBLIC ))
3444 for (f = &input_filename [strlen (input_filename)];
3445 f != input_filename && ! IS_DIR_SEPARATOR (f[0]);
3448 if (IS_DIR_SEPARATOR (f[0]))
3450 if (strncmp (IDENTIFIER_POINTER (raw_name),
3451 f , IDENTIFIER_LENGTH (raw_name)) ||
3452 f [IDENTIFIER_LENGTH (raw_name)] != '.')
3454 (cl, "Public %s `%s' must be defined in a file called `%s.java'",
3455 (is_interface ? "interface" : "class"),
3456 IDENTIFIER_POINTER (qualified_name),
3457 IDENTIFIER_POINTER (raw_name));
3460 /* Static classes can be declared only in top level classes. Note:
3461 once static, a inner class is a top level class. */
3462 if (flags & ACC_STATIC)
3464 /* Catch the specific error of declaring an class inner class
3465 with no toplevel enclosing class. Prevent check_modifiers from
3466 complaining a second time */
3467 if (CPC_INNER_P () && !TOPLEVEL_CLASS_DECL_P (GET_CPC()))
3469 parse_error_context (cl, "Inner class `%s' can't be static. Static classes can only occur in interfaces and top-level classes",
3470 IDENTIFIER_POINTER (qualified_name));
3473 /* Else, in the context of a top-level class declaration, let
3474 `check_modifiers' do its job, otherwise, give it a go */
3476 sca = (GET_CPC_LIST () ? ACC_STATIC : 0);
3479 /* Inner classes can be declared private or protected
3480 within their enclosing classes. */
3483 /* A class which is local to a block can't be public, private,
3484 protected or static. But it is created final, so allow this
3486 if (current_function_decl)
3487 icaf = sca = uaaf = ACC_FINAL;
3490 check_modifiers_consistency (flags);
3491 icaf = ACC_PROTECTED;
3492 if (! CLASS_INTERFACE (GET_CPC ()))
3493 icaf |= ACC_PRIVATE;
3500 uaaf = INTERFACE_INNER_MODIFIERS;
3502 uaaf = INTERFACE_MODIFIERS;
3504 check_modifiers ("Illegal modifier `%s' for interface declaration",
3508 check_modifiers ((current_function_decl ?
3509 "Illegal modifier `%s' for local class declaration" :
3510 "Illegal modifier `%s' for class declaration"),
3511 flags, uaaf|sca|icaf);
3515 /* Construct a nested class name. If the final component starts with
3516 a digit, return true. Otherwise return false. */
3518 make_nested_class_name (tree cpc_list)
3525 make_nested_class_name (TREE_CHAIN (cpc_list));
3527 /* Pick the qualified name when dealing with the first upmost
3529 name = (TREE_CHAIN (cpc_list)
3530 ? TREE_PURPOSE (cpc_list) : DECL_NAME (TREE_VALUE (cpc_list)));
3531 obstack_grow (&temporary_obstack,
3532 IDENTIFIER_POINTER (name), IDENTIFIER_LENGTH (name));
3533 obstack_1grow (&temporary_obstack, '$');
3535 return ISDIGIT (IDENTIFIER_POINTER (name)[0]);
3538 /* Can't redefine a class already defined in an earlier scope. */
3541 check_inner_class_redefinition (tree raw_name, tree cl)
3545 for (scope_list = GET_CPC_LIST (); scope_list;
3546 scope_list = GET_NEXT_ENCLOSING_CPC (scope_list))
3547 if (raw_name == GET_CPC_UN_NODE (scope_list))
3550 (cl, "The class name `%s' is already defined in this scope. An inner class may not have the same simple name as any of its enclosing classes",
3551 IDENTIFIER_POINTER (raw_name));
3557 /* Tries to find a decl for CLASS_TYPE within ENCLOSING. If we fail,
3558 we remember ENCLOSING and SUPER. */
3561 resolve_inner_class (htab_t circularity_hash, tree cl, tree *enclosing,
3562 tree *super, tree class_type)
3564 tree local_enclosing = *enclosing;
3565 tree local_super = NULL_TREE;
3567 while (local_enclosing)
3569 tree intermediate, decl;
3571 *htab_find_slot (circularity_hash, local_enclosing, INSERT) =
3574 if ((decl = find_as_inner_class (local_enclosing, class_type, cl)))
3577 intermediate = local_enclosing;
3578 /* Explore enclosing contexts. */
3579 while (INNER_CLASS_DECL_P (intermediate))
3581 intermediate = DECL_CONTEXT (intermediate);
3582 if ((decl = find_as_inner_class (intermediate, class_type, cl)))
3586 /* Now go to the upper classes, bail out if necessary. We will
3587 analyze the returned SUPER and act accordingly (see
3588 do_resolve_class). */
3589 if (JPRIMITIVE_TYPE_P (TREE_TYPE (local_enclosing))
3590 || TREE_TYPE (local_enclosing) == void_type_node)
3592 parse_error_context (cl, "Qualifier must be a reference");
3593 local_enclosing = NULL_TREE;
3596 local_super = CLASSTYPE_SUPER (TREE_TYPE (local_enclosing));
3597 if (!local_super || local_super == object_type_node)
3600 if (TREE_CODE (local_super) == POINTER_TYPE)
3601 local_super = do_resolve_class (NULL, local_super, NULL, NULL);
3603 local_super = TYPE_NAME (local_super);
3605 /* We may not have checked for circular inheritance yet, so do so
3606 here to prevent an infinite loop. */
3607 if (htab_find (circularity_hash, local_super) != NULL)
3610 cl = lookup_cl (local_enclosing);
3613 (cl, "Cyclic inheritance involving %s",
3614 IDENTIFIER_POINTER (DECL_NAME (local_enclosing)));
3615 local_enclosing = NULL_TREE;
3618 local_enclosing = local_super;
3621 /* We failed. Return LOCAL_SUPER and LOCAL_ENCLOSING. */
3622 *super = local_super;
3623 *enclosing = local_enclosing;
3628 /* Within ENCLOSING, find a decl for NAME and return it. NAME can be
3632 find_as_inner_class (tree enclosing, tree name, tree cl)
3634 tree qual, to_return;
3638 name = TYPE_NAME (name);
3640 /* First search: within the scope of `enclosing', search for name */
3641 if (QUALIFIED_P (name) && cl && EXPR_WFL_NODE (cl) == name)
3642 qual = EXPR_WFL_QUALIFICATION (cl);
3644 qual = build_tree_list (cl, NULL_TREE);
3646 qual = build_tree_list (build_expr_wfl (name, NULL, 0, 0), NULL_TREE);
3648 if ((to_return = find_as_inner_class_do (qual, enclosing)))
3651 /* We're dealing with a qualified name. Try to resolve thing until
3652 we get something that is an enclosing class. */
3653 if (QUALIFIED_P (name) && cl && EXPR_WFL_NODE (cl) == name)
3655 tree acc = NULL_TREE, decl = NULL_TREE, ptr;
3657 for (qual = EXPR_WFL_QUALIFICATION (cl); qual && !decl;
3658 qual = TREE_CHAIN (qual))
3660 acc = merge_qualified_name (acc,
3661 EXPR_WFL_NODE (TREE_PURPOSE (qual)));
3662 BUILD_PTR_FROM_NAME (ptr, acc);
3663 decl = do_resolve_class (NULL_TREE, ptr, NULL_TREE, cl);
3666 /* A NULL qual and a decl means that the search ended
3667 successfully?!? We have to do something then. FIXME */
3672 qual = EXPR_WFL_QUALIFICATION (cl);
3674 /* Otherwise, create a qual for the other part of the resolution. */
3676 qual = build_tree_list (build_expr_wfl (name, NULL, 0, 0), NULL_TREE);
3678 return find_as_inner_class_do (qual, enclosing);
3681 /* We go inside the list of sub classes and try to find a way
3685 find_as_inner_class_do (tree qual, tree enclosing)
3690 for (; qual && enclosing; qual = TREE_CHAIN (qual))
3692 tree name_to_match = EXPR_WFL_NODE (TREE_PURPOSE (qual));
3693 tree next_enclosing = NULL_TREE;
3696 for (inner_list = DECL_INNER_CLASS_LIST (enclosing);
3697 inner_list; inner_list = TREE_CHAIN (inner_list))
3699 if (TREE_VALUE (inner_list) == name_to_match)
3701 next_enclosing = TREE_PURPOSE (inner_list);
3705 enclosing = next_enclosing;
3708 return (!qual && enclosing ? enclosing : NULL_TREE);
3712 link_nested_class_to_enclosing (void)
3714 if (GET_ENCLOSING_CPC ())
3716 tree enclosing = GET_ENCLOSING_CPC_CONTEXT ();
3717 DECL_INNER_CLASS_LIST (enclosing) =
3718 tree_cons (GET_CPC (), GET_CPC_UN (),
3719 DECL_INNER_CLASS_LIST (enclosing));
3724 maybe_make_nested_class_name (tree name)
3726 tree id = NULL_TREE;
3730 /* If we're in a function, we must append a number to create the
3731 nested class name. However, we don't do this if the class we
3732 are constructing is anonymous, because in that case we'll
3733 already have a number as the class name. */
3734 if (! make_nested_class_name (GET_CPC_LIST ())
3735 && current_function_decl != NULL_TREE
3736 && ! ISDIGIT (IDENTIFIER_POINTER (name)[0]))
3739 sprintf (buf, "%d", anonymous_class_counter);
3740 ++anonymous_class_counter;
3741 obstack_grow (&temporary_obstack, buf, strlen (buf));
3742 obstack_1grow (&temporary_obstack, '$');
3744 obstack_grow0 (&temporary_obstack,
3745 IDENTIFIER_POINTER (name),
3746 IDENTIFIER_LENGTH (name));
3747 id = get_identifier (obstack_finish (&temporary_obstack));
3749 QUALIFIED_P (id) = 1;
3754 /* If DECL is NULL, create and push a new DECL, record the current
3755 line CL and do other maintenance things. */
3758 maybe_create_class_interface_decl (tree decl, tree raw_name,
3759 tree qualified_name, tree cl)
3762 decl = push_class (make_class (), qualified_name);
3764 /* Take care of the file and line business */
3765 DECL_SOURCE_FILE (decl) = EXPR_WFL_FILENAME (cl);
3766 /* If we're emitting xrefs, store the line/col number information */
3768 DECL_SOURCE_LINE (decl) = EXPR_WFL_LINECOL (cl);
3770 DECL_SOURCE_LINE (decl) = EXPR_WFL_LINENO (cl);
3771 CLASS_FROM_SOURCE_P (TREE_TYPE (decl)) = 1;
3772 CLASS_PARSED_P (TREE_TYPE (decl)) = 1;
3773 CLASS_FROM_CURRENTLY_COMPILED_P (TREE_TYPE (decl)) =
3774 IS_A_COMMAND_LINE_FILENAME_P (EXPR_WFL_FILENAME_NODE (cl));
3776 PUSH_CPC (decl, raw_name);
3777 DECL_CONTEXT (decl) = GET_ENCLOSING_CPC_CONTEXT ();
3779 /* Link the declaration to the already seen ones */
3780 TREE_CHAIN (decl) = ctxp->class_list;
3781 ctxp->class_list = decl;
3783 /* Create a new nodes in the global lists */
3784 gclass_list = tree_cons (NULL_TREE, decl, gclass_list);
3785 all_class_list = tree_cons (NULL_TREE, decl, all_class_list);
3787 /* Install a new dependency list element */
3788 create_jdep_list (ctxp);
3790 SOURCE_FRONTEND_DEBUG (("Defining class/interface %s",
3791 IDENTIFIER_POINTER (qualified_name)));
3796 add_superinterfaces (tree decl, tree interface_list)
3799 /* Superinterface(s): if present and defined, parser_check_super_interface ()
3800 takes care of ensuring that:
3801 - This is an accessible interface type,
3802 - Circularity detection.
3803 parser_add_interface is then called. If present but not defined,
3804 the check operation is delayed until the super interface gets
3806 for (node = interface_list; node; node = TREE_CHAIN (node))
3808 tree current = TREE_PURPOSE (node);
3809 tree idecl = IDENTIFIER_CLASS_VALUE (EXPR_WFL_NODE (current));
3810 if (idecl && CLASS_LOADED_P (TREE_TYPE (idecl)))
3812 if (!parser_check_super_interface (idecl, decl, current))
3813 parser_add_interface (decl, idecl, current);
3816 register_incomplete_type (JDEP_INTERFACE,
3817 current, decl, NULL_TREE);
3821 /* Create an interface in pass1 and return its decl. Return the
3822 interface's decl in pass 2. */
3825 create_interface (int flags, tree id, tree super)
3827 tree raw_name = EXPR_WFL_NODE (id);
3828 tree q_name = parser_qualified_classname (raw_name);
3829 tree decl = IDENTIFIER_CLASS_VALUE (q_name);
3831 /* Certain syntax errors are making SUPER be like ID. Avoid this
3833 if (ctxp->class_err && id == super)
3836 EXPR_WFL_NODE (id) = q_name; /* Keep source location, even if refined. */
3838 /* Basic checks: scope, redefinition, modifiers */
3839 if (check_class_interface_creation (1, flags, raw_name, q_name, decl, id))
3845 /* Suspend the current parsing context if we're parsing an inner
3849 java_parser_context_suspend ();
3850 /* Interface members are public. */
3851 if (CLASS_INTERFACE (GET_CPC ()))
3852 flags |= ACC_PUBLIC;
3855 /* Push a new context for (static) initialized upon declaration fields */
3856 java_parser_context_push_initialized_field ();
3858 /* Interface modifiers check
3859 - public/abstract allowed (already done at that point)
3860 - abstract is obsolete (comes first, it's a warning, or should be)
3861 - Can't use twice the same (checked in the modifier rule) */
3862 if ((flags & ACC_ABSTRACT) && flag_redundant)
3863 parse_warning_context
3864 (MODIFIER_WFL (ABSTRACT_TK),
3865 "Redundant use of `abstract' modifier. Interface `%s' is implicitly abstract", IDENTIFIER_POINTER (raw_name));
3867 /* Create a new decl if DECL is NULL, otherwise fix it */
3868 decl = maybe_create_class_interface_decl (decl, raw_name, q_name, id);
3870 /* Interfaces are always abstract. */
3871 flags |= ACC_ABSTRACT;
3873 /* Inner interfaces are always static. */
3874 if (INNER_CLASS_DECL_P (decl))
3875 flags |= ACC_STATIC;
3877 /* Set super info and mark the class a complete */
3878 set_super_info (ACC_INTERFACE | flags, TREE_TYPE (decl),
3879 object_type_node, ctxp->interface_number);
3880 ctxp->interface_number = 0;
3881 CLASS_COMPLETE_P (decl) = 1;
3882 add_superinterfaces (decl, super);
3884 /* Eventually sets the @deprecated tag flag */
3885 CHECK_DEPRECATED (decl);
3890 /* Patch anonymous class CLASS, by either extending or implementing
3894 patch_anonymous_class (tree type_decl, tree class_decl, tree wfl)
3896 tree class = TREE_TYPE (class_decl);
3897 tree type = TREE_TYPE (type_decl);
3898 tree binfo = TYPE_BINFO (class);
3900 /* If it's an interface, implement it */
3901 if (CLASS_INTERFACE (type_decl))
3903 if (parser_check_super_interface (type_decl, class_decl, wfl))
3906 if (VEC_space (tree, BINFO_BASE_BINFOS (binfo), 1))
3908 /* Extend the binfo - by reallocating and copying it. */
3913 new_binfo = make_tree_binfo ((BINFO_N_BASE_BINFOS (binfo) + 1) * 2);
3914 for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
3915 BINFO_BASE_APPEND (new_binfo, base_binfo);
3916 CLASS_HAS_SUPER_FLAG (new_binfo) = CLASS_HAS_SUPER_FLAG (binfo);
3917 BINFO_VTABLE (new_binfo) = BINFO_VTABLE (binfo);
3918 TYPE_BINFO (class) = new_binfo;
3921 /* And add the interface */
3922 parser_add_interface (class_decl, type_decl, wfl);
3924 /* Otherwise, it's a type we want to extend */
3927 if (parser_check_super (type_decl, class_decl, wfl))
3929 BINFO_TYPE (BINFO_BASE_BINFO (binfo, 0)) = type;
3933 /* Create an anonymous class which extends/implements TYPE_NAME, and return
3937 create_anonymous_class (tree type_name)
3940 tree super = NULL_TREE, itf = NULL_TREE;
3941 tree id, type_decl, class;
3943 /* The unqualified name of the anonymous class. It's just a number. */
3944 sprintf (buffer, "%d", anonymous_class_counter++);
3945 id = build_wfl_node (get_identifier (buffer));
3946 EXPR_WFL_LINECOL (id) = EXPR_WFL_LINECOL (type_name);
3948 /* We know about the type to extend/implement. We go ahead */
3949 if ((type_decl = IDENTIFIER_CLASS_VALUE (EXPR_WFL_NODE (type_name))))
3951 /* Create a class which either implements on extends the designated
3952 class. The class bears an inaccessible name. */
3953 if (CLASS_INTERFACE (type_decl))
3955 /* It's OK to modify it here. It's been already used and
3956 shouldn't be reused */
3957 ctxp->interface_number = 1;
3958 /* Interfaces should presented as a list of WFLs */
3959 itf = build_tree_list (type_name, NULL_TREE);
3965 class = create_class (ACC_FINAL, id, super, itf);
3967 /* We didn't know anything about the stuff. We register a dependence. */
3969 register_incomplete_type (JDEP_ANONYMOUS, type_name, class, NULL_TREE);
3971 ANONYMOUS_CLASS_P (TREE_TYPE (class)) = 1;
3975 /* Create a class in pass1 and return its decl. Return class
3976 interface's decl in pass 2. */
3979 create_class (int flags, tree id, tree super, tree interfaces)
3981 tree raw_name = EXPR_WFL_NODE (id);
3982 tree class_id, decl;
3983 tree super_decl_type;
3985 /* Certain syntax errors are making SUPER be like ID. Avoid this
3987 if (ctxp->class_err && id == super)
3990 class_id = parser_qualified_classname (raw_name);
3991 decl = IDENTIFIER_CLASS_VALUE (class_id);
3992 EXPR_WFL_NODE (id) = class_id;
3994 /* Basic check: scope, redefinition, modifiers */
3995 if (check_class_interface_creation (0, flags, raw_name, class_id, decl, id))
4001 /* Suspend the current parsing context if we're parsing an inner
4002 class or an anonymous class. */
4005 java_parser_context_suspend ();
4006 /* Interface members are public. */
4007 if (CLASS_INTERFACE (GET_CPC ()))
4008 flags |= ACC_PUBLIC;
4011 /* Push a new context for (static) initialized upon declaration fields */
4012 java_parser_context_push_initialized_field ();
4014 /* Class modifier check:
4015 - Allowed modifier (already done at that point)
4016 - abstract AND final forbidden
4017 - Public classes defined in the correct file */
4018 if ((flags & ACC_ABSTRACT) && (flags & ACC_FINAL))
4020 (id, "Class `%s' can't be declared both abstract and final",
4021 IDENTIFIER_POINTER (raw_name));
4023 /* Create a new decl if DECL is NULL, otherwise fix it */
4024 decl = maybe_create_class_interface_decl (decl, raw_name, class_id, id);
4026 /* If SUPER exists, use it, otherwise use Object */
4029 /* java.lang.Object can't extend anything. */
4030 if (TREE_TYPE (IDENTIFIER_CLASS_VALUE (class_id)) == object_type_node)
4032 parse_error_context (id, "`java.lang.Object' can't extend anything");
4037 register_incomplete_type (JDEP_SUPER, super, decl, NULL_TREE);
4039 else if (TREE_TYPE (decl) != object_type_node)
4040 super_decl_type = object_type_node;
4041 /* We're defining java.lang.Object */
4043 super_decl_type = NULL_TREE;
4045 /* A class nested in an interface is implicitly static. */
4046 if (INNER_CLASS_DECL_P (decl)
4047 && CLASS_INTERFACE (TYPE_NAME (TREE_TYPE (DECL_CONTEXT (decl)))))
4049 flags |= ACC_STATIC;
4052 /* Set super info and mark the class as complete. */
4053 set_super_info (flags, TREE_TYPE (decl), super_decl_type,
4054 ctxp->interface_number);
4055 ctxp->interface_number = 0;
4056 CLASS_COMPLETE_P (decl) = 1;
4057 add_superinterfaces (decl, interfaces);
4059 /* TYPE_VFIELD' is a compiler-generated field used to point to
4060 virtual function tables. In gcj, every class has a common base
4061 virtual function table in java.lang.object. */
4062 TYPE_VFIELD (TREE_TYPE (decl)) = TYPE_VFIELD (object_type_node);
4064 /* Add the private this$<n> field, Replicate final locals still in
4065 scope as private final fields mangled like val$<local_name>.
4066 This does not occur for top level (static) inner classes. */
4067 if (PURE_INNER_CLASS_DECL_P (decl))
4068 add_inner_class_fields (decl, current_function_decl);
4070 /* If doing xref, store the location at which the inherited class
4071 (if any) was seen. */
4072 if (flag_emit_xref && super)
4073 DECL_INHERITED_SOURCE_LINE (decl) = EXPR_WFL_LINECOL (super);
4075 /* Eventually sets the @deprecated tag flag */
4076 CHECK_DEPRECATED (decl);
4078 /* Reset the anonymous class counter when declaring non inner classes */
4079 if (!INNER_CLASS_DECL_P (decl))
4080 anonymous_class_counter = 1;
4085 /* End a class declaration: register the statements used to create
4086 finit$ and <clinit>, pop the current class and resume the prior
4087 parser context if necessary. */
4090 end_class_declaration (int resume)
4092 /* If an error occurred, context weren't pushed and won't need to be
4093 popped by a resume. */
4094 int no_error_occurred = ctxp->next && GET_CPC () != error_mark_node;
4096 if (GET_CPC () != error_mark_node)
4097 dump_java_tree (TDI_class, GET_CPC ());
4099 java_parser_context_pop_initialized_field ();
4101 if (resume && no_error_occurred)
4102 java_parser_context_resume ();
4104 /* We're ending a class declaration, this is a good time to reset
4105 the interface cout. Note that might have been already done in
4106 create_interface, but if at that time an inner class was being
4107 dealt with, the interface count was reset in a context created
4108 for the sake of handling inner classes declaration. */
4109 ctxp->interface_number = 0;
4113 add_inner_class_fields (tree class_decl, tree fct_decl)
4115 tree block, marker, f;
4117 f = add_field (TREE_TYPE (class_decl),
4118 build_current_thisn (TREE_TYPE (class_decl)),
4119 build_pointer_type (TREE_TYPE (DECL_CONTEXT (class_decl))),
4121 FIELD_THISN (f) = 1;
4126 for (block = GET_CURRENT_BLOCK (fct_decl);
4127 block && TREE_CODE (block) == BLOCK; block = BLOCK_SUPERCONTEXT (block))
4130 for (decl = BLOCK_EXPR_DECLS (block); decl; decl = TREE_CHAIN (decl))
4133 tree wfl, init, list;
4135 /* Avoid non final arguments. */
4136 if (!LOCAL_FINAL_P (decl))
4139 MANGLE_OUTER_LOCAL_VARIABLE_NAME (name, DECL_NAME (decl));
4140 MANGLE_ALIAS_INITIALIZER_PARAMETER_NAME_ID (pname, DECL_NAME (decl));
4141 wfl = build_wfl_node (name);
4142 init = build_wfl_node (pname);
4143 /* Build an initialization for the field: it will be
4144 initialized by a parameter added to finit$, bearing a
4145 mangled name of the field itself (param$<n>.) The
4146 parameter is provided to finit$ by the constructor
4147 invoking it (hence the constructor will also feature a
4148 hidden parameter, set to the value of the outer context
4149 local at the time the inner class is created.)
4151 Note: we take into account all possible locals that can
4152 be accessed by the inner class. It's actually not trivial
4153 to minimize these aliases down to the ones really
4154 used. One way to do that would be to expand all regular
4155 methods first, then finit$ to get a picture of what's
4156 used. It works with the exception that we would have to
4157 go back on all constructor invoked in regular methods to
4158 have their invocation reworked (to include the right amount
4159 of alias initializer parameters.)
4161 The only real way around, I think, is a first pass to
4162 identify locals really used in the inner class. We leave
4163 the flag FIELD_LOCAL_ALIAS_USED around for that future
4166 On the other hand, it only affect local inner classes,
4167 whose constructors (and finit$ call) will be featuring
4168 unnecessary arguments. It's easy for a developer to keep
4169 this number of parameter down by using the `final'
4170 keyword only when necessary. For the time being, we can
4171 issue a warning on unnecessary finals. FIXME */
4172 init = build_assignment (ASSIGN_TK, EXPR_WFL_LINECOL (wfl),
4175 /* Register the field. The TREE_LIST holding the part
4176 initialized/initializer will be marked ARG_FINAL_P so
4177 that the created field can be marked
4178 FIELD_LOCAL_ALIAS. */
4179 list = build_tree_list (wfl, init);
4180 ARG_FINAL_P (list) = 1;
4181 register_fields (ACC_PRIVATE | ACC_FINAL, TREE_TYPE (decl), list);
4185 if (!CPC_INITIALIZER_STMT (ctxp))
4188 /* If we ever registered an alias field, insert and marker to
4189 remember where the list ends. The second part of the list (the one
4190 featuring initialized fields) so it can be later reversed to
4191 enforce 8.5. The marker will be removed during that operation. */
4192 marker = build_tree_list (NULL_TREE, NULL_TREE);
4193 TREE_CHAIN (marker) = CPC_INITIALIZER_STMT (ctxp);
4194 SET_CPC_INITIALIZER_STMT (ctxp, marker);
4197 /* Can't use lookup_field () since we don't want to load the class and
4198 can't set the CLASS_LOADED_P flag */
4201 find_field (tree class, tree name)
4204 for (decl = TYPE_FIELDS (class); decl; decl = TREE_CHAIN (decl))
4206 if (DECL_NAME (decl) == name)
4212 /* Wrap around lookup_field that doesn't potentially upset the value
4216 lookup_field_wrapper (tree class, tree name)
4219 tree decl = NULL_TREE;
4220 java_parser_context_save_global ();
4222 /* Last chance: if we're within the context of an inner class, we
4223 might be trying to access a local variable defined in an outer
4224 context. We try to look for it now. */
4225 if (INNER_CLASS_TYPE_P (class) && TREE_CODE (name) == IDENTIFIER_NODE)
4228 MANGLE_OUTER_LOCAL_VARIABLE_NAME (new_name, name);
4229 decl = lookup_field (&type, new_name);
4230 if (decl && decl != error_mark_node)
4231 FIELD_LOCAL_ALIAS_USED (decl) = 1;
4233 if (!decl || decl == error_mark_node)
4236 decl = lookup_field (&type, name);
4239 /* If the field still hasn't been found, try the next enclosing context. */
4240 if (!decl && INNER_CLASS_TYPE_P (class))
4242 tree outer_type = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (class)));
4243 decl = lookup_field_wrapper (outer_type, name);
4246 java_parser_context_restore_global ();
4247 return decl == error_mark_node ? NULL : decl;
4250 /* Find duplicate field within the same class declarations and report
4251 the error. Returns 1 if a duplicated field was found, 0
4255 duplicate_declaration_error_p (tree new_field_name, tree new_type, tree cl)
4257 /* This might be modified to work with method decl as well */
4258 tree decl = find_field (TREE_TYPE (GET_CPC ()), new_field_name);
4261 char *t1 = xstrdup (purify_type_name
4262 ((TREE_CODE (new_type) == POINTER_TYPE
4263 && TREE_TYPE (new_type) == NULL_TREE) ?
4264 IDENTIFIER_POINTER (TYPE_NAME (new_type)) :
4265 lang_printable_name (new_type, 1)));
4266 /* The type may not have been completed by the time we report
4268 char *t2 = xstrdup (purify_type_name
4269 ((TREE_CODE (TREE_TYPE (decl)) == POINTER_TYPE
4270 && TREE_TYPE (TREE_TYPE (decl)) == NULL_TREE) ?
4271 IDENTIFIER_POINTER (TYPE_NAME (TREE_TYPE (decl))) :
4272 lang_printable_name (TREE_TYPE (decl), 1)));
4274 (cl , "Duplicate variable declaration: `%s %s' was `%s %s' (%s:%d)",
4275 t1, IDENTIFIER_POINTER (new_field_name),
4276 t2, IDENTIFIER_POINTER (DECL_NAME (decl)),
4277 DECL_SOURCE_FILE (decl), DECL_SOURCE_LINE (decl));
4285 /* Field registration routine. If TYPE doesn't exist, field
4286 declarations are linked to the undefined TYPE dependency list, to
4287 be later resolved in java_complete_class () */
4290 register_fields (int flags, tree type, tree variable_list)
4292 tree current, saved_type;
4293 tree class_type = NULL_TREE;
4294 int saved_lineno = input_line;
4296 tree wfl = NULL_TREE;
4299 class_type = TREE_TYPE (GET_CPC ());
4301 if (!class_type || class_type == error_mark_node)
4304 /* If we're adding fields to interfaces, those fields are public,
4306 if (CLASS_INTERFACE (TYPE_NAME (class_type)))
4308 OBSOLETE_MODIFIER_WARNING (MODIFIER_WFL (PUBLIC_TK),
4309 flags, ACC_PUBLIC, "interface field(s)");
4310 OBSOLETE_MODIFIER_WARNING (MODIFIER_WFL (STATIC_TK),
4311 flags, ACC_STATIC, "interface field(s)");
4312 OBSOLETE_MODIFIER_WARNING (MODIFIER_WFL (FINAL_TK),
4313 flags, ACC_FINAL, "interface field(s)");
4314 check_modifiers ("Illegal interface member modifier `%s'", flags,
4315 INTERFACE_FIELD_MODIFIERS);
4316 flags |= (ACC_PUBLIC | ACC_STATIC | ACC_FINAL);
4319 /* Obtain a suitable type for resolution, if necessary */
4320 SET_TYPE_FOR_RESOLUTION (type, wfl, must_chain);
4322 /* If TYPE is fully resolved and we don't have a reference, make one */
4323 PROMOTE_RECORD_IF_COMPLETE (type, must_chain);
4325 for (current = variable_list, saved_type = type; current;
4326 current = TREE_CHAIN (current), type = saved_type)
4330 tree cl = TREE_PURPOSE (current);
4331 tree init = TREE_VALUE (current);
4332 tree current_name = EXPR_WFL_NODE (cl);
4334 /* Can't declare non-final static fields in inner classes */
4335 if ((flags & ACC_STATIC) && !TOPLEVEL_CLASS_TYPE_P (class_type)
4336 && !(flags & ACC_FINAL))
4338 (cl, "Field `%s' can't be static in inner class `%s' unless it is final",
4339 IDENTIFIER_POINTER (EXPR_WFL_NODE (cl)),
4340 lang_printable_name (class_type, 0));
4342 /* Process NAME, as it may specify extra dimension(s) for it */
4343 type = build_array_from_name (type, wfl, current_name, ¤t_name);
4345 /* Type adjustment. We may have just readjusted TYPE because
4346 the variable specified more dimensions. Make sure we have
4347 a reference if we can and don't have one already. Also
4348 change the name if we have an init. */
4349 if (type != saved_type)
4351 PROMOTE_RECORD_IF_COMPLETE (type, must_chain);
4353 EXPR_WFL_NODE (TREE_OPERAND (init, 0)) = current_name;
4356 real_type = GET_REAL_TYPE (type);
4357 /* Check for redeclarations */
4358 if (duplicate_declaration_error_p (current_name, real_type, cl))
4361 /* Set input_line to the line the field was found and create a
4362 declaration for it. Eventually sets the @deprecated tag flag. */
4364 input_line = EXPR_WFL_LINECOL (cl);
4366 input_line = EXPR_WFL_LINENO (cl);
4367 field_decl = add_field (class_type, current_name, real_type, flags);
4368 CHECK_DEPRECATED_NO_RESET (field_decl);
4370 /* If the field denotes a final instance variable, then we
4371 allocate a LANG_DECL_SPECIFIC part to keep track of its
4372 initialization. We also mark whether the field was
4373 initialized upon its declaration. We don't do that if the
4374 created field is an alias to a final local. */
4375 if (!ARG_FINAL_P (current) && (flags & ACC_FINAL))
4377 MAYBE_CREATE_VAR_LANG_DECL_SPECIFIC (field_decl);
4378 DECL_FIELD_FINAL_WFL (field_decl) = cl;
4381 /* If the couple initializer/initialized is marked ARG_FINAL_P,
4382 we mark the created field FIELD_LOCAL_ALIAS, so that we can
4383 hide parameters to this inner class finit$ and
4384 constructors. It also means that the field isn't final per
4386 if (ARG_FINAL_P (current))
4388 FIELD_LOCAL_ALIAS (field_decl) = 1;
4389 FIELD_FINAL (field_decl) = 0;
4392 /* Check if we must chain. */
4394 register_incomplete_type (JDEP_FIELD, wfl, field_decl, type);
4396 /* If we have an initialization value tied to the field */
4399 /* The field is declared static */
4400 if (flags & ACC_STATIC)
4402 /* We include the field and its initialization part into
4403 a list used to generate <clinit>. After <clinit> is
4404 walked, field initializations will be processed and
4405 fields initialized with known constants will be taken
4406 out of <clinit> and have their DECL_INITIAL set
4408 TREE_CHAIN (init) = CPC_STATIC_INITIALIZER_STMT (ctxp);
4409 SET_CPC_STATIC_INITIALIZER_STMT (ctxp, init);
4410 if (TREE_OPERAND (init, 1)
4411 && TREE_CODE (TREE_OPERAND (init, 1)) == NEW_ARRAY_INIT)
4412 TREE_STATIC (TREE_OPERAND (init, 1)) = 1;
4414 /* A non-static field declared with an immediate initialization is
4415 to be initialized in <init>, if any. This field is remembered
4416 to be processed at the time of the generation of <init>. */
4419 TREE_CHAIN (init) = CPC_INITIALIZER_STMT (ctxp);
4420 SET_CPC_INITIALIZER_STMT (ctxp, init);
4422 MODIFY_EXPR_FROM_INITIALIZATION_P (init) = 1;
4423 DECL_INITIAL (field_decl) = TREE_OPERAND (init, 1);
4428 input_line = saved_lineno;
4431 /* Generate finit$, using the list of initialized fields to populate
4432 its body. finit$'s parameter(s) list is adjusted to include the
4433 one(s) used to initialized the field(s) caching outer context
4437 generate_finit (tree class_type)
4440 tree list = TYPE_FINIT_STMT_LIST (class_type);
4441 tree mdecl, current, parms;
4443 parms = build_alias_initializer_parameter_list (AIPL_FUNCTION_CREATION,
4444 class_type, NULL_TREE,
4446 CRAFTED_PARAM_LIST_FIXUP (parms);
4447 mdecl = create_artificial_method (class_type, ACC_PRIVATE, void_type_node,
4448 finit_identifier_node, parms);
4449 fix_method_argument_names (parms, mdecl);
4450 layout_class_method (class_type, CLASSTYPE_SUPER (class_type),
4452 DECL_FUNCTION_NAP (mdecl) = count;
4453 start_artificial_method_body (mdecl);
4455 for (current = list; current; current = TREE_CHAIN (current))
4456 java_method_add_stmt (mdecl,
4457 build_debugable_stmt (EXPR_WFL_LINECOL (current),
4459 end_artificial_method_body (mdecl);
4463 /* Generate a function to run the instance initialization code. The
4464 private method is called `instinit$'. Unless we're dealing with an
4465 anonymous class, we determine whether all ctors of CLASS_TYPE
4466 declare a checked exception in their `throws' clause in order to
4467 see whether it's necessary to encapsulate the instance initializer
4468 statements in a try/catch/rethrow sequence. */
4471 generate_instinit (tree class_type)
4474 tree compound = NULL_TREE;
4475 tree parms = tree_cons (this_identifier_node,
4476 build_pointer_type (class_type), end_params_node);
4477 tree mdecl = create_artificial_method (class_type, ACC_PRIVATE,
4479 instinit_identifier_node, parms);
4481 layout_class_method (class_type, CLASSTYPE_SUPER (class_type),
4484 /* Gather all the statements in a compound */
4485 for (current = TYPE_II_STMT_LIST (class_type);
4486 current; current = TREE_CHAIN (current))
4487 compound = add_stmt_to_compound (compound, NULL_TREE, current);
4489 /* We need to encapsulate COMPOUND by a try/catch statement to
4490 rethrow exceptions that might occur in the instance initializer.
4491 We do that only if all ctors of CLASS_TYPE are set to catch a
4492 checked exception. This doesn't apply to anonymous classes (since
4493 they don't have declared ctors.) */
4494 if (!ANONYMOUS_CLASS_P (class_type) &&
4495 ctors_unchecked_throws_clause_p (class_type))
4497 compound = encapsulate_with_try_catch (0, exception_type_node, compound,
4498 build1 (THROW_EXPR, NULL_TREE,
4499 build_wfl_node (wpv_id)));
4500 DECL_FUNCTION_THROWS (mdecl) = build_tree_list (NULL_TREE,
4501 exception_type_node);
4504 start_artificial_method_body (mdecl);
4505 java_method_add_stmt (mdecl, compound);
4506 end_artificial_method_body (mdecl);
4513 build_instinit_invocation (tree class_type)
4515 tree to_return = NULL_TREE;
4517 if (TYPE_II_STMT_LIST (class_type))
4519 tree parm = build_tree_list (NULL_TREE,
4520 build_wfl_node (this_identifier_node));
4522 build_method_invocation (build_wfl_node (instinit_identifier_node),
4528 /* Shared across method_declarator and method_header to remember the
4529 patch stage that was reached during the declaration of the method.
4530 A method DECL is built differently is there is no patch
4531 (JDEP_NO_PATCH) or a patch (JDEP_METHOD or JDEP_METHOD_RETURN)
4532 pending on the currently defined method. */
4534 static int patch_stage;
4536 /* Check the method declaration and add the method to its current
4537 class. If the argument list is known to contain incomplete types,
4538 the method is partially added and the registration will be resume
4539 once the method arguments resolved. If TYPE is NULL, we're dealing
4540 with a constructor. */
4543 method_header (int flags, tree type, tree mdecl, tree throws)
4545 tree type_wfl = NULL_TREE;
4546 tree meth_name = NULL_TREE;
4547 tree current, orig_arg, this_class = NULL;
4550 int constructor_ok = 0, must_chain;
4553 if (mdecl == error_mark_node)
4554 return error_mark_node;
4555 meth = TREE_VALUE (mdecl);
4556 id = TREE_PURPOSE (mdecl);
4558 check_modifiers_consistency (flags);
4561 this_class = TREE_TYPE (GET_CPC ());
4563 if (!this_class || this_class == error_mark_node)
4566 /* There are some forbidden modifiers for an abstract method and its
4567 class must be abstract as well. */
4568 if (type && (flags & ACC_ABSTRACT))
4570 ABSTRACT_CHECK (flags, ACC_PRIVATE, id, "Private");
4571 ABSTRACT_CHECK (flags, ACC_STATIC, id, "Static");
4572 ABSTRACT_CHECK (flags, ACC_FINAL, id, "Final");
4573 ABSTRACT_CHECK (flags, ACC_NATIVE, id, "Native");
4574 ABSTRACT_CHECK (flags, ACC_SYNCHRONIZED, id, "Synchronized");
4575 ABSTRACT_CHECK (flags, ACC_STRICT, id, "Strictfp");
4576 if (!CLASS_ABSTRACT (TYPE_NAME (this_class))
4577 && !CLASS_INTERFACE (TYPE_NAME (this_class)))
4579 (id, "Class `%s' must be declared abstract to define abstract method `%s'",
4580 IDENTIFIER_POINTER (DECL_NAME (GET_CPC ())),
4581 IDENTIFIER_POINTER (EXPR_WFL_NODE (id)));
4584 /* A native method can't be strictfp. */
4585 if ((flags & ACC_NATIVE) && (flags & ACC_STRICT))
4586 parse_error_context (id, "native method `%s' can't be strictfp",
4587 IDENTIFIER_POINTER (EXPR_WFL_NODE (id)));
4588 /* No such thing as a transient or volatile method. */
4589 if ((flags & ACC_TRANSIENT))
4590 parse_error_context (id, "method `%s' can't be transient",
4591 IDENTIFIER_POINTER (EXPR_WFL_NODE (id)));
4592 if ((flags & ACC_VOLATILE))
4593 parse_error_context (id, "method `%s' can't be volatile",
4594 IDENTIFIER_POINTER (EXPR_WFL_NODE (id)));
4596 /* Things to be checked when declaring a constructor */
4599 int ec = java_error_count;
4600 /* 8.6: Constructor declarations: we might be trying to define a
4601 method without specifying a return type. */
4602 if (EXPR_WFL_NODE (id) != GET_CPC_UN ())
4604 (id, "Invalid method declaration, return type required");
4605 /* 8.6.3: Constructor modifiers */
4608 JCONSTRUCTOR_CHECK (flags, ACC_ABSTRACT, id, "abstract");
4609 JCONSTRUCTOR_CHECK (flags, ACC_STATIC, id, "static");
4610 JCONSTRUCTOR_CHECK (flags, ACC_FINAL, id, "final");
4611 JCONSTRUCTOR_CHECK (flags, ACC_NATIVE, id, "native");
4612 JCONSTRUCTOR_CHECK (flags, ACC_SYNCHRONIZED, id, "synchronized");
4613 JCONSTRUCTOR_CHECK (flags, ACC_STRICT, id, "strictfp");
4615 /* If we found error here, we don't consider it's OK to tread
4616 the method definition as a constructor, for the rest of this
4618 if (ec == java_error_count)
4622 /* Method declared within the scope of an interface are implicitly
4623 abstract and public. Conflicts with other erroneously provided
4624 modifiers are checked right after. */
4626 if (CLASS_INTERFACE (TYPE_NAME (this_class)))
4628 /* If FLAGS isn't set because of a modifier, turn the
4629 corresponding modifier WFL to NULL so we issue a warning on
4630 the obsolete use of the modifier */
4631 if (!(flags & ACC_PUBLIC))
4632 MODIFIER_WFL (PUBLIC_TK) = NULL;
4633 if (!(flags & ACC_ABSTRACT))
4634 MODIFIER_WFL (ABSTRACT_TK) = NULL;
4635 flags |= ACC_PUBLIC;
4636 flags |= ACC_ABSTRACT;
4639 /* Inner class can't declare static methods */
4640 if ((flags & ACC_STATIC) && !TOPLEVEL_CLASS_TYPE_P (this_class))
4643 (id, "Method `%s' can't be static in inner class `%s'. Only members of interfaces and top-level classes can be static",
4644 IDENTIFIER_POINTER (EXPR_WFL_NODE (id)),
4645 lang_printable_name (this_class, 0));
4648 /* Modifiers context reset moved up, so abstract method declaration
4649 modifiers can be later checked. */
4651 /* Set constructor returned type to void and method name to <init>,
4652 unless we found an error identifier the constructor (in which
4653 case we retain the original name) */
4656 type = void_type_node;
4658 meth_name = init_identifier_node;
4661 meth_name = EXPR_WFL_NODE (id);
4663 /* Do the returned type resolution and registration if necessary */
4664 SET_TYPE_FOR_RESOLUTION (type, type_wfl, must_chain);
4667 type = build_array_from_name (type, type_wfl, meth_name, &meth_name);
4668 EXPR_WFL_NODE (id) = meth_name;
4669 PROMOTE_RECORD_IF_COMPLETE (type, must_chain);
4673 patch_stage = JDEP_METHOD_RETURN;
4674 register_incomplete_type (patch_stage, type_wfl, id, type);
4675 TREE_TYPE (meth) = GET_REAL_TYPE (type);
4678 TREE_TYPE (meth) = type;
4680 saved_lineno = input_line;
4681 /* When defining an abstract or interface method, the curly
4682 bracket at level 1 doesn't exist because there is no function
4684 input_line = (ctxp->first_ccb_indent1 ? ctxp->first_ccb_indent1 :
4685 EXPR_WFL_LINENO (id));
4687 /* Remember the original argument list */
4688 orig_arg = TYPE_ARG_TYPES (meth);
4690 if (patch_stage) /* includes ret type and/or all args */
4693 meth = add_method_1 (this_class, flags, meth_name, meth);
4694 /* Patch for the return type */
4695 if (patch_stage == JDEP_METHOD_RETURN)
4697 jdep = CLASSD_LAST (ctxp->classd_list);
4698 JDEP_GET_PATCH (jdep) = &TREE_TYPE (TREE_TYPE (meth));
4700 /* This is the stop JDEP. METH allows the function's signature
4702 register_incomplete_type (JDEP_METHOD_END, NULL_TREE, meth, NULL_TREE);
4705 meth = add_method (this_class, flags, meth_name,
4706 build_java_signature (meth));
4708 /* Remember final parameters */
4709 MARK_FINAL_PARMS (meth, orig_arg);
4711 /* Fix the method argument list so we have the argument name
4713 fix_method_argument_names (orig_arg, meth);
4715 /* Register the parameter number and re-install the current line
4717 DECL_MAX_LOCALS (meth) = ctxp->formal_parameter_number+1;
4718 input_line = saved_lineno;
4720 /* Register exception specified by the `throws' keyword for
4721 resolution and set the method decl appropriate field to the list.
4722 Note: the grammar ensures that what we get here are class
4726 throws = nreverse (throws);
4727 for (current = throws; current; current = TREE_CHAIN (current))
4729 register_incomplete_type (JDEP_EXCEPTION, TREE_VALUE (current),
4730 NULL_TREE, NULL_TREE);
4731 JDEP_GET_PATCH (CLASSD_LAST (ctxp->classd_list)) =
4732 &TREE_VALUE (current);
4734 DECL_FUNCTION_THROWS (meth) = throws;
4737 if (TREE_TYPE (GET_CPC ()) != object_type_node)
4738 DECL_FUNCTION_WFL (meth) = id;
4740 /* Set the flag if we correctly processed a constructor */
4743 DECL_CONSTRUCTOR_P (meth) = 1;
4744 /* Compute and store the number of artificial parameters declared
4745 for this constructor */
4746 for (count = 0, current = TYPE_FIELDS (this_class); current;
4747 current = TREE_CHAIN (current))
4748 if (FIELD_LOCAL_ALIAS (current))
4750 DECL_FUNCTION_NAP (meth) = count;
4753 /* Eventually set the @deprecated tag flag */
4754 CHECK_DEPRECATED (meth);
4756 /* If doing xref, store column and line number information instead
4757 of the line number only. */
4759 DECL_SOURCE_LINE (meth) = EXPR_WFL_LINECOL (id);
4765 fix_method_argument_names (tree orig_arg, tree meth)
4767 tree arg = TYPE_ARG_TYPES (TREE_TYPE (meth));
4768 if (TREE_CODE (TREE_TYPE (meth)) == METHOD_TYPE)
4770 TREE_PURPOSE (arg) = this_identifier_node;
4771 arg = TREE_CHAIN (arg);
4773 while (orig_arg != end_params_node)
4775 TREE_PURPOSE (arg) = TREE_PURPOSE (orig_arg);
4776 orig_arg = TREE_CHAIN (orig_arg);
4777 arg = TREE_CHAIN (arg);
4781 /* Complete the method declaration with METHOD_BODY. */
4784 finish_method_declaration (tree method_body)
4788 if (!current_function_decl)
4791 flags = get_access_flags_from_decl (current_function_decl);
4793 /* 8.4.5 Method Body */
4794 if ((flags & ACC_ABSTRACT || flags & ACC_NATIVE) && method_body)
4796 tree name = DECL_NAME (current_function_decl);
4797 parse_error_context (DECL_FUNCTION_WFL (current_function_decl),
4798 "%s method `%s' can't have a body defined",
4799 (METHOD_NATIVE (current_function_decl) ?
4800 "Native" : "Abstract"),
4801 IDENTIFIER_POINTER (name));
4802 method_body = NULL_TREE;
4804 else if (!(flags & ACC_ABSTRACT) && !(flags & ACC_NATIVE) && !method_body)
4806 tree name = DECL_NAME (current_function_decl);
4808 (DECL_FUNCTION_WFL (current_function_decl),
4809 "Non native and non abstract method `%s' must have a body defined",
4810 IDENTIFIER_POINTER (name));
4811 method_body = NULL_TREE;
4814 if (flag_emit_class_files && method_body
4815 && TREE_CODE (method_body) == NOP_EXPR
4816 && TREE_TYPE (current_function_decl)
4817 && TREE_TYPE (TREE_TYPE (current_function_decl)) == void_type_node)
4818 method_body = build1 (RETURN_EXPR, void_type_node, NULL);
4820 BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (current_function_decl)) = method_body;
4821 maybe_absorb_scoping_blocks ();
4822 /* Exit function's body */
4824 /* Merge last line of the function with first line, directly in the
4825 function decl. It will be used to emit correct debug info. */
4826 if (!flag_emit_xref)
4827 DECL_FUNCTION_LAST_LINE (current_function_decl) = ctxp->last_ccb_indent1;
4829 /* Since function's argument's list are shared, reset the
4830 ARG_FINAL_P parameter that might have been set on some of this
4831 function parameters. */
4832 UNMARK_FINAL_PARMS (current_function_decl);
4834 /* So we don't have an irrelevant function declaration context for
4835 the next static block we'll see. */
4836 current_function_decl = NULL_TREE;
4839 /* Build a an error message for constructor circularity errors. */
4842 constructor_circularity_msg (tree from, tree to)
4844 static char string [4096];
4845 char *t = xstrdup (lang_printable_name (from, 2));
4846 sprintf (string, "`%s' invokes `%s'", t, lang_printable_name (to, 2));
4851 /* Verify a circular call to METH. Return 1 if an error is found, 0
4854 static GTY(()) tree vcc_list;
4856 verify_constructor_circularity (tree meth, tree current)
4860 for (c = DECL_CONSTRUCTOR_CALLS (current); c; c = TREE_CHAIN (c))
4862 if (TREE_VALUE (c) == meth)
4868 vcc_list = nreverse (vcc_list);
4869 for (liste = vcc_list; liste; liste = TREE_CHAIN (liste))
4872 (TREE_PURPOSE (TREE_PURPOSE (liste)), "%s",
4873 constructor_circularity_msg
4874 (TREE_VALUE (liste), TREE_VALUE (TREE_PURPOSE (liste))));
4878 t = xstrdup (lang_printable_name (meth, 2));
4879 parse_error_context (TREE_PURPOSE (c),
4880 "%s: recursive invocation of constructor `%s'",
4881 constructor_circularity_msg (current, meth), t);
4883 vcc_list = NULL_TREE;
4887 for (c = DECL_CONSTRUCTOR_CALLS (current); c; c = TREE_CHAIN (c))
4889 vcc_list = tree_cons (c, current, vcc_list);
4890 if (verify_constructor_circularity (meth, TREE_VALUE (c)))
4892 vcc_list = TREE_CHAIN (vcc_list);
4897 /* Check modifiers that can be declared but exclusively */
4900 check_modifiers_consistency (int flags)
4903 tree cl = NULL_TREE;
4905 THIS_MODIFIER_ONLY (flags, ACC_PUBLIC, PUBLIC_TK, acc_count, cl);
4906 THIS_MODIFIER_ONLY (flags, ACC_PRIVATE, PRIVATE_TK, acc_count, cl);
4907 THIS_MODIFIER_ONLY (flags, ACC_PROTECTED, PROTECTED_TK, acc_count, cl);
4910 (cl, "Inconsistent member declaration. At most one of `public', `private', or `protected' may be specified");
4914 THIS_MODIFIER_ONLY (flags, ACC_FINAL, FINAL_TK, acc_count, cl);
4915 THIS_MODIFIER_ONLY (flags, ACC_VOLATILE, VOLATILE_TK, acc_count, cl);
4917 parse_error_context (cl,
4918 "Inconsistent member declaration. At most one of `final' or `volatile' may be specified");
4921 /* Check the methode header METH for abstract specifics features */
4924 check_abstract_method_header (tree meth)
4926 int flags = get_access_flags_from_decl (meth);
4928 OBSOLETE_MODIFIER_WARNING2 (MODIFIER_WFL (ABSTRACT_TK), flags,
4929 ACC_ABSTRACT, "abstract method",
4930 IDENTIFIER_POINTER (DECL_NAME (meth)));
4931 OBSOLETE_MODIFIER_WARNING2 (MODIFIER_WFL (PUBLIC_TK), flags,
4932 ACC_PUBLIC, "abstract method",
4933 IDENTIFIER_POINTER (DECL_NAME (meth)));
4935 check_modifiers ("Illegal modifier `%s' for interface method",
4936 flags, INTERFACE_METHOD_MODIFIERS);
4939 /* Create a FUNCTION_TYPE node and start augmenting it with the
4940 declared function arguments. Arguments type that can't be resolved
4941 are left as they are, but the returned node is marked as containing
4942 incomplete types. */
4945 method_declarator (tree id, tree list)
4947 tree arg_types = NULL_TREE, current, node;
4948 tree meth = make_node (FUNCTION_TYPE);
4951 patch_stage = JDEP_NO_PATCH;
4953 if (GET_CPC () == error_mark_node)
4954 return error_mark_node;
4956 /* If we're dealing with an inner class constructor, we hide the
4957 this$<n> decl in the name field of its parameter declaration. We
4958 also might have to hide the outer context local alias
4959 initializers. Not done when the class is a toplevel class. */
4960 if (PURE_INNER_CLASS_DECL_P (GET_CPC ())
4961 && EXPR_WFL_NODE (id) == GET_CPC_UN ())
4963 tree aliases_list, type, thisn;
4964 /* First the aliases, linked to the regular parameters */
4966 build_alias_initializer_parameter_list (AIPL_FUNCTION_DECLARATION,
4967 TREE_TYPE (GET_CPC ()),
4969 list = chainon (nreverse (aliases_list), list);
4972 type = TREE_TYPE (DECL_CONTEXT (GET_CPC ()));
4973 thisn = build_current_thisn (TREE_TYPE (GET_CPC ()));
4974 list = tree_cons (build_wfl_node (thisn), build_pointer_type (type),
4978 for (current = list; current; current = TREE_CHAIN (current))
4981 tree wfl_name = TREE_PURPOSE (current);
4982 tree type = TREE_VALUE (current);
4983 tree name = EXPR_WFL_NODE (wfl_name);
4984 tree already, arg_node;
4985 tree type_wfl = NULL_TREE;
4988 /* Obtain a suitable type for resolution, if necessary */
4989 SET_TYPE_FOR_RESOLUTION (type, type_wfl, must_chain);
4991 /* Process NAME, as it may specify extra dimension(s) for it */
4992 type = build_array_from_name (type, type_wfl, name, &name);
4993 EXPR_WFL_NODE (wfl_name) = name;
4995 real_type = GET_REAL_TYPE (type);
4996 if (TREE_CODE (real_type) == RECORD_TYPE)
4998 real_type = promote_type (real_type);
4999 if (TREE_CODE (type) == TREE_LIST)
5000 TREE_PURPOSE (type) = real_type;
5003 /* Check redefinition */
5004 for (already = arg_types; already; already = TREE_CHAIN (already))
5005 if (TREE_PURPOSE (already) == name)
5008 (wfl_name, "Variable `%s' is used more than once in the argument list of method `%s'",
5009 IDENTIFIER_POINTER (name),
5010 IDENTIFIER_POINTER (EXPR_WFL_NODE (id)));
5014 /* If we've an incomplete argument type, we know there is a location
5015 to patch when the type get resolved, later. */
5019 patch_stage = JDEP_METHOD;
5020 type = register_incomplete_type (patch_stage,
5021 type_wfl, wfl_name, type);
5022 jdep = CLASSD_LAST (ctxp->classd_list);
5023 JDEP_MISC (jdep) = id;
5026 /* The argument node: a name and a (possibly) incomplete type. */
5027 arg_node = build_tree_list (name, real_type);
5028 /* Remember arguments declared final. */
5029 ARG_FINAL_P (arg_node) = ARG_FINAL_P (current);
5032 JDEP_GET_PATCH (jdep) = &TREE_VALUE (arg_node);
5033 TREE_CHAIN (arg_node) = arg_types;
5034 arg_types = arg_node;
5036 TYPE_ARG_TYPES (meth) = chainon (nreverse (arg_types), end_params_node);
5037 node = build_tree_list (id, meth);
5042 unresolved_type_p (tree wfl, tree *returned)
5044 if (TREE_CODE (wfl) == EXPR_WITH_FILE_LOCATION)
5048 tree decl = IDENTIFIER_CLASS_VALUE (EXPR_WFL_NODE (wfl));
5049 if (decl && current_class && (decl == TYPE_NAME (current_class)))
5050 *returned = TREE_TYPE (decl);
5051 else if (GET_CPC_UN () == EXPR_WFL_NODE (wfl))
5052 *returned = TREE_TYPE (GET_CPC ());
5054 *returned = NULL_TREE;
5063 /* From NAME, build a qualified identifier node using the
5064 qualification from the current package definition. */
5067 parser_qualified_classname (tree name)
5069 tree nested_class_name;
5071 if ((nested_class_name = maybe_make_nested_class_name (name)))
5072 return nested_class_name;
5075 return merge_qualified_name (ctxp->package, name);
5080 /* Called once the type a interface extends is resolved. Returns 0 if
5081 everything is OK. */
5084 parser_check_super_interface (tree super_decl, tree this_decl, tree this_wfl)
5086 tree super_type = TREE_TYPE (super_decl);
5088 /* Has to be an interface */
5089 if (!CLASS_INTERFACE (super_decl))
5092 (this_wfl, "%s `%s' can't implement/extend %s `%s'",
5093 (CLASS_INTERFACE (TYPE_NAME (TREE_TYPE (this_decl))) ?
5094 "Interface" : "Class"),
5095 IDENTIFIER_POINTER (DECL_NAME (this_decl)),
5096 (TYPE_ARRAY_P (super_type) ? "array" : "class"),
5097 IDENTIFIER_POINTER (DECL_NAME (super_decl)));
5101 /* Check top-level interface access. Inner classes are subject to member
5102 access rules (6.6.1). */
5103 if (! INNER_CLASS_P (super_type)
5104 && check_pkg_class_access (DECL_NAME (super_decl),
5105 NULL_TREE, true, this_decl))
5108 SOURCE_FRONTEND_DEBUG (("Completing interface %s with %s",
5109 IDENTIFIER_POINTER (DECL_NAME (this_decl)),
5110 IDENTIFIER_POINTER (DECL_NAME (super_decl))));
5114 /* Makes sure that SUPER_DECL is suitable to extend THIS_DECL. Returns
5115 0 if everything is OK. */
5118 parser_check_super (tree super_decl, tree this_decl, tree wfl)
5120 tree super_type = TREE_TYPE (super_decl);
5122 /* SUPER should be a CLASS (neither an array nor an interface) */
5123 if (TYPE_ARRAY_P (super_type) || CLASS_INTERFACE (TYPE_NAME (super_type)))
5126 (wfl, "Class `%s' can't subclass %s `%s'",
5127 IDENTIFIER_POINTER (DECL_NAME (this_decl)),
5128 (CLASS_INTERFACE (TYPE_NAME (super_type)) ? "interface" : "array"),
5129 IDENTIFIER_POINTER (DECL_NAME (super_decl)));
5133 if (CLASS_FINAL (TYPE_NAME (super_type)))
5135 parse_error_context (wfl, "Can't subclass final classes: %s",
5136 IDENTIFIER_POINTER (DECL_NAME (super_decl)));
5140 /* Check top-level class scope. Inner classes are subject to member access
5142 if (! INNER_CLASS_P (super_type)
5143 && (check_pkg_class_access (DECL_NAME (super_decl), wfl, true, NULL_TREE)))
5146 SOURCE_FRONTEND_DEBUG (("Completing class %s with %s",
5147 IDENTIFIER_POINTER (DECL_NAME (this_decl)),
5148 IDENTIFIER_POINTER (DECL_NAME (super_decl))));
5152 /* Create a new dependency list and link it (in a LIFO manner) to the
5153 CTXP list of type dependency list. */
5156 create_jdep_list (struct parser_ctxt *ctxp)
5158 jdeplist *new = xmalloc (sizeof (jdeplist));
5159 new->first = new->last = NULL;
5160 new->next = ctxp->classd_list;
5161 ctxp->classd_list = new;
5165 reverse_jdep_list (struct parser_ctxt *ctxp)
5167 jdeplist *prev = NULL, *current, *next;
5168 for (current = ctxp->classd_list; current; current = next)
5170 next = current->next;
5171 current->next = prev;
5177 /* Create a fake pointer based on the ID stored in
5178 TYPE_NAME. TYPE_NAME can be a WFL or a incomplete type asking to be
5179 registered again. */
5182 obtain_incomplete_type (tree type_name)
5184 tree ptr = NULL_TREE, name;
5186 if (TREE_CODE (type_name) == EXPR_WITH_FILE_LOCATION)
5187 name = EXPR_WFL_NODE (type_name);
5188 else if (INCOMPLETE_TYPE_P (type_name))
5189 name = TYPE_NAME (type_name);
5193 /* Workaround from build_pointer_type for incomplete types. */
5194 BUILD_PTR_FROM_NAME (ptr, name);
5195 TYPE_MODE (ptr) = ptr_mode;
5201 /* Register a incomplete type whose name is WFL. Reuse PTR if PTR is
5202 non NULL instead of computing a new fake type based on WFL. The new
5203 dependency is inserted in the current type dependency list, in FIFO
5207 register_incomplete_type (int kind, tree wfl, tree decl, tree ptr)
5209 jdep *new = xmalloc (sizeof (jdep));
5211 if (!ptr && kind != JDEP_METHOD_END) /* JDEP_METHOD_END is a mere marker */
5212 ptr = obtain_incomplete_type (wfl);
5214 JDEP_KIND (new) = kind;
5215 JDEP_DECL (new) = decl;
5216 JDEP_TO_RESOLVE (new) = ptr;
5217 JDEP_WFL (new) = wfl;
5218 JDEP_CHAIN (new) = NULL;
5219 JDEP_MISC (new) = NULL_TREE;
5220 /* For some dependencies, set the enclosing class of the current
5221 class to be the enclosing context */
5222 if ((kind == JDEP_INTERFACE || kind == JDEP_ANONYMOUS || kind == JDEP_SUPER)
5223 && GET_ENCLOSING_CPC ())
5224 JDEP_ENCLOSING (new) = TREE_VALUE (GET_ENCLOSING_CPC ());
5226 JDEP_ENCLOSING (new) = GET_CPC ();
5227 JDEP_GET_PATCH (new) = (tree *)NULL;
5229 JDEP_INSERT (ctxp->classd_list, new);
5234 /* This checks for circular references with innerclasses. We start
5235 from SOURCE and should never reach TARGET. Extended/implemented
5236 types in SOURCE have their enclosing context checked not to reach
5237 TARGET. When the last enclosing context of SOURCE is reached, its
5238 extended/implemented types are also checked not to reach TARGET.
5239 In case of error, WFL of the offending type is returned; NULL_TREE
5243 check_inner_circular_reference (tree source, tree target)
5249 for (i = 0; BINFO_BASE_ITERATE (TYPE_BINFO (source), i, base_binfo); i++)
5253 /* We can end up with a NULL_TREE or an incomplete type here if
5254 we encountered previous type resolution errors. It's safe to
5255 simply ignore these cases. */
5256 su = BINFO_TYPE (base_binfo);
5257 if (INCOMPLETE_TYPE_P (su))
5260 if (inherits_from_p (su, target))
5261 return lookup_cl (TYPE_NAME (su));
5263 for (ctx = DECL_CONTEXT (TYPE_NAME (su)); ctx; ctx = DECL_CONTEXT (ctx))
5265 /* An enclosing context shouldn't be TARGET */
5266 if (ctx == TYPE_NAME (target))
5267 return lookup_cl (TYPE_NAME (su));
5269 /* When we reach the enclosing last context, start a check
5270 on it, with the same target */
5271 if (! DECL_CONTEXT (ctx) &&
5272 (cl = check_inner_circular_reference (TREE_TYPE (ctx), target)))
5279 /* Explore TYPE's `extends' clause member(s) and return the WFL of the
5280 offending type if a circularity is detected. NULL_TREE is returned
5281 otherwise. TYPE can be an interface or a class. */
5284 check_circular_reference (tree type)
5289 if (!BINFO_N_BASE_BINFOS (TYPE_BINFO (type)))
5292 if (! CLASS_INTERFACE (TYPE_NAME (type)))
5294 if (inherits_from_p (CLASSTYPE_SUPER (type), type))
5295 return lookup_cl (TYPE_NAME (type));
5299 for (i = 0; BINFO_BASE_ITERATE (TYPE_BINFO (type), i, base_binfo); i++)
5301 if (BINFO_TYPE (base_binfo) != object_type_node
5302 && interface_of_p (type, BINFO_TYPE (base_binfo)))
5303 return lookup_cl (TYPE_NAME (BINFO_TYPE (base_binfo)));
5309 java_check_circular_reference (void)
5312 for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
5314 tree type = TREE_TYPE (current);
5317 cl = check_circular_reference (type);
5319 cl = check_inner_circular_reference (type, type);
5321 parse_error_context (cl, "Cyclic class inheritance%s",
5322 (cyclic_inheritance_report ?
5323 cyclic_inheritance_report : ""));
5327 /* Augment the parameter list PARM with parameters crafted to
5328 initialize outer context locals aliases. Through ARTIFICIAL, a
5329 count is kept of the number of crafted parameters. MODE governs
5330 what eventually gets created: something suitable for a function
5331 creation or a function invocation, either the constructor or
5335 build_alias_initializer_parameter_list (int mode, tree class_type, tree parm,
5339 tree additional_parms = NULL_TREE;
5341 for (field = TYPE_FIELDS (class_type); field; field = TREE_CHAIN (field))
5342 if (FIELD_LOCAL_ALIAS (field))
5344 const char *buffer = IDENTIFIER_POINTER (DECL_NAME (field));
5345 tree purpose = NULL_TREE, value = NULL_TREE, name = NULL_TREE;
5350 case AIPL_FUNCTION_DECLARATION:
5351 MANGLE_ALIAS_INITIALIZER_PARAMETER_NAME_STR (mangled_id,
5353 purpose = build_wfl_node (mangled_id);
5354 if (TREE_CODE (TREE_TYPE (field)) == POINTER_TYPE)
5355 value = build_wfl_node (TYPE_NAME (TREE_TYPE (field)));
5357 value = TREE_TYPE (field);
5360 case AIPL_FUNCTION_CREATION:
5361 MANGLE_ALIAS_INITIALIZER_PARAMETER_NAME_STR (purpose,
5363 value = TREE_TYPE (field);
5366 case AIPL_FUNCTION_FINIT_INVOCATION:
5367 MANGLE_ALIAS_INITIALIZER_PARAMETER_NAME_STR (mangled_id,
5369 /* Now, this is wrong. purpose should always be the NAME
5370 of something and value its matching value (decl, type,
5371 etc...) FIXME -- but there is a lot to fix. */
5373 /* When invoked for this kind of operation, we already
5374 know whether a field is used or not. */
5375 purpose = TREE_TYPE (field);
5376 value = build_wfl_node (mangled_id);
5379 case AIPL_FUNCTION_CTOR_INVOCATION:
5380 /* There are two case: the constructor invocation happens
5381 outside the local inner, in which case, locales from the outer
5382 context are directly used.
5384 Otherwise, we fold to using the alias directly. */
5385 if (class_type == current_class)
5389 name = get_identifier (&buffer[4]);
5390 value = IDENTIFIER_LOCAL_VALUE (name);
5394 additional_parms = tree_cons (purpose, value, additional_parms);
5398 if (additional_parms)
5400 if (ANONYMOUS_CLASS_P (class_type)
5401 && mode == AIPL_FUNCTION_CTOR_INVOCATION)
5402 additional_parms = nreverse (additional_parms);
5403 parm = chainon (additional_parms, parm);
5409 /* Craft a constructor for CLASS_DECL -- what we should do when none
5410 where found. ARGS is non NULL when a special signature must be
5411 enforced. This is the case for anonymous classes. */
5414 craft_constructor (tree class_decl, tree args)
5416 tree class_type = TREE_TYPE (class_decl);
5417 tree parm = NULL_TREE;
5418 /* Inherit access flags for the constructor from its enclosing class. */
5419 int valid_ctor_flags = ACC_PUBLIC | ACC_PROTECTED | ACC_PRIVATE;
5420 int flags = (get_access_flags_from_decl (class_decl) & valid_ctor_flags);
5421 int i = 0, artificial = 0;
5422 tree decl, ctor_name;
5425 ctor_name = init_identifier_node;
5427 /* If we're dealing with an inner class constructor, we hide the
5428 this$<n> decl in the name field of its parameter declaration. */
5429 if (PURE_INNER_CLASS_TYPE_P (class_type))
5431 tree type = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (class_type)));
5432 parm = tree_cons (build_current_thisn (class_type),
5433 build_pointer_type (type), parm);
5435 /* Some more arguments to be hidden here. The values of the local
5436 variables of the outer context that the inner class needs to see. */
5437 parm = build_alias_initializer_parameter_list (AIPL_FUNCTION_CREATION,
5442 /* Then if there are any args to be enforced, enforce them now */
5443 for (; args && args != end_params_node; args = TREE_CHAIN (args))
5445 sprintf (buffer, "parm%d", i++);
5446 parm = tree_cons (get_identifier (buffer), TREE_VALUE (args), parm);
5449 CRAFTED_PARAM_LIST_FIXUP (parm);
5450 decl = create_artificial_method (class_type, flags, void_type_node,
5452 fix_method_argument_names (parm, decl);
5453 /* Now, mark the artificial parameters. */
5454 DECL_FUNCTION_NAP (decl) = artificial;
5455 DECL_FUNCTION_SYNTHETIC_CTOR (decl) = DECL_CONSTRUCTOR_P (decl) = 1;
5456 DECL_INLINE (decl) = 1;
5461 /* Fix the constructors. This will be called right after circular
5462 references have been checked. It is necessary to fix constructors
5463 early even if no code generation will take place for that class:
5464 some generated constructor might be required by the class whose
5465 compilation triggered this one to be simply loaded. */
5468 java_fix_constructors (void)
5472 for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
5474 tree class_type = TREE_TYPE (current);
5478 if (CLASS_INTERFACE (TYPE_NAME (class_type)))
5481 output_class = current_class = class_type;
5482 for (decl = TYPE_METHODS (class_type); decl; decl = TREE_CHAIN (decl))
5484 if (DECL_CONSTRUCTOR_P (decl))
5486 fix_constructors (decl);
5491 /* Anonymous class constructor can't be generated that early. */
5492 if (!saw_ctor && !ANONYMOUS_CLASS_P (class_type))
5493 craft_constructor (current, NULL_TREE);
5497 /* safe_layout_class just makes sure that we can load a class without
5498 disrupting the current_class, input_file, input_line, etc, information
5499 about the class processed currently. */
5502 safe_layout_class (tree class)
5504 tree save_current_class = current_class;
5505 location_t save_location = input_location;
5507 layout_class (class);
5509 current_class = save_current_class;
5510 input_location = save_location;
5514 jdep_resolve_class (jdep *dep)
5518 if (JDEP_RESOLVED_P (dep))
5519 decl = JDEP_RESOLVED_DECL (dep);
5522 decl = resolve_class (JDEP_ENCLOSING (dep), JDEP_TO_RESOLVE (dep),
5523 JDEP_DECL (dep), JDEP_WFL (dep));
5524 JDEP_RESOLVED (dep, decl);
5525 /* If there is no WFL, that's ok. We generate this warning
5527 if (decl && JDEP_WFL (dep) != NULL_TREE)
5528 check_deprecation (JDEP_WFL (dep), decl);
5532 complete_class_report_errors (dep);
5533 else if (INNER_CLASS_DECL_P (decl))
5535 tree inner = TREE_TYPE (decl);
5536 if (! CLASS_LOADED_P (inner))
5538 safe_layout_class (inner);
5539 if (TYPE_SIZE (inner) == error_mark_node)
5540 TYPE_SIZE (inner) = NULL_TREE;
5542 check_inner_class_access (decl, JDEP_ENCLOSING (dep), JDEP_WFL (dep));
5547 /* Complete unsatisfied class declaration and their dependencies */
5550 java_complete_class (void)
5557 /* Process imports */
5560 /* Reverse things so we have the right order */
5561 ctxp->class_list = nreverse (ctxp->class_list);
5562 ctxp->classd_list = reverse_jdep_list (ctxp);
5564 for (cclassd = ctxp->classd_list, cclass = ctxp->class_list;
5566 cclass = TREE_CHAIN (cclass), cclassd = CLASSD_CHAIN (cclassd))
5570 /* We keep the compilation unit imports in the class so that
5571 they can be used later to resolve type dependencies that
5572 aren't necessary to solve now. */
5573 TYPE_IMPORT_LIST (TREE_TYPE (cclass)) = ctxp->import_list;
5574 TYPE_IMPORT_DEMAND_LIST (TREE_TYPE (cclass)) = ctxp->import_demand_list;
5576 for (dep = CLASSD_FIRST (cclassd); dep; dep = JDEP_CHAIN (dep))
5579 if (!(decl = jdep_resolve_class (dep)))
5582 /* Now it's time to patch */
5583 switch (JDEP_KIND (dep))
5586 /* Simply patch super */
5587 if (parser_check_super (decl, JDEP_DECL (dep), JDEP_WFL (dep)))
5589 BINFO_TYPE (BINFO_BASE_BINFO
5590 (TYPE_BINFO (TREE_TYPE (JDEP_DECL (dep))), 0))
5596 /* We do part of the job done in add_field */
5597 tree field_decl = JDEP_DECL (dep);
5598 tree field_type = TREE_TYPE (decl);
5599 if (TREE_CODE (field_type) == RECORD_TYPE)
5600 field_type = promote_type (field_type);
5601 TREE_TYPE (field_decl) = field_type;
5602 DECL_ALIGN (field_decl) = 0;
5603 DECL_USER_ALIGN (field_decl) = 0;
5604 layout_decl (field_decl, 0);
5605 SOURCE_FRONTEND_DEBUG
5606 (("Completed field/var decl `%s' with `%s'",
5607 IDENTIFIER_POINTER (DECL_NAME (field_decl)),
5608 IDENTIFIER_POINTER (DECL_NAME (decl))));
5611 case JDEP_METHOD: /* We start patching a method */
5612 case JDEP_METHOD_RETURN:
5618 type = TREE_TYPE(decl);
5619 if (TREE_CODE (type) == RECORD_TYPE)
5620 type = promote_type (type);
5621 JDEP_APPLY_PATCH (dep, type);
5622 SOURCE_FRONTEND_DEBUG
5623 (((JDEP_KIND (dep) == JDEP_METHOD_RETURN ?
5624 "Completing fct `%s' with ret type `%s'":
5625 "Completing arg `%s' with type `%s'"),
5626 IDENTIFIER_POINTER (EXPR_WFL_NODE
5627 (JDEP_DECL_WFL (dep))),
5628 IDENTIFIER_POINTER (DECL_NAME (decl))));
5632 dep = JDEP_CHAIN (dep);
5633 if (JDEP_KIND (dep) == JDEP_METHOD_END)
5636 decl = jdep_resolve_class (dep);
5640 tree mdecl = JDEP_DECL (dep), signature;
5641 /* Recompute and reset the signature, check first that
5642 all types are now defined. If they're not,
5643 don't build the signature. */
5644 if (check_method_types_complete (mdecl))
5646 signature = build_java_signature (TREE_TYPE (mdecl));
5647 set_java_signature (TREE_TYPE (mdecl), signature);
5654 case JDEP_INTERFACE:
5655 if (parser_check_super_interface (decl, JDEP_DECL (dep),
5658 parser_add_interface (JDEP_DECL (dep), decl, JDEP_WFL (dep));
5663 type = TREE_TYPE(decl);
5664 if (TREE_CODE (type) == RECORD_TYPE)
5665 type = promote_type (type);
5666 JDEP_APPLY_PATCH (dep, type);
5670 JDEP_APPLY_PATCH (dep, TREE_TYPE (decl));
5671 SOURCE_FRONTEND_DEBUG
5672 (("Completing a random type dependency on a '%s' node",
5673 tree_code_name [TREE_CODE (JDEP_DECL (dep))]));
5676 case JDEP_EXCEPTION:
5677 JDEP_APPLY_PATCH (dep, TREE_TYPE (decl));
5678 SOURCE_FRONTEND_DEBUG
5679 (("Completing `%s' `throws' argument node",
5680 IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_WFL (dep)))));
5683 case JDEP_ANONYMOUS:
5684 patch_anonymous_class (decl, JDEP_DECL (dep), JDEP_WFL (dep));
5695 /* Resolve class CLASS_TYPE. Handle the case of trying to resolve an
5699 resolve_class (tree enclosing, tree class_type, tree decl, tree cl)
5701 tree tname = TYPE_NAME (class_type);
5702 tree resolved_type = TREE_TYPE (class_type);
5704 tree resolved_type_decl;
5706 if (resolved_type != NULL_TREE)
5708 tree resolved_type_decl = TYPE_NAME (resolved_type);
5709 if (resolved_type_decl == NULL_TREE
5710 || TREE_CODE (resolved_type_decl) == IDENTIFIER_NODE)
5712 resolved_type_decl = build_decl (TYPE_DECL,
5713 TYPE_NAME (class_type),
5716 return resolved_type_decl;
5719 /* 1- Check to see if we have an array. If true, find what we really
5721 if ((array_dims = build_type_name_from_array_name (tname,
5722 &TYPE_NAME (class_type))))
5723 WFL_STRIP_BRACKET (cl, cl);
5725 /* 2- Resolve the bare type */
5726 if (!(resolved_type_decl = do_resolve_class (enclosing, class_type,
5729 resolved_type = TREE_TYPE (resolved_type_decl);
5731 /* 3- If we have an array, reconstruct the array down to its nesting */
5734 for (; array_dims; array_dims--)
5735 resolved_type = build_java_array_type (resolved_type, -1);
5736 resolved_type_decl = TYPE_NAME (resolved_type);
5738 TREE_TYPE (class_type) = resolved_type;
5739 return resolved_type_decl;
5742 /* Effectively perform the resolution of class CLASS_TYPE. DECL or CL
5743 are used to report error messages; CL must either be NULL_TREE or a
5744 WFL wrapping a class. Do not try to replace TYPE_NAME (class_type)
5745 by a variable, since it is changed by find_in_imports{_on_demand}
5746 and (but it doesn't really matter) qualify_and_find. */
5749 do_resolve_class (tree enclosing, tree class_type, tree decl, tree cl)
5751 tree new_class_decl = NULL_TREE, super = NULL_TREE;
5752 tree saved_enclosing_type = enclosing ? TREE_TYPE (enclosing) : NULL_TREE;
5754 htab_t circularity_hash;
5756 if (QUALIFIED_P (TYPE_NAME (class_type)))
5758 /* If the type name is of the form `Q . Id', then Q is either a
5759 package name or a class name. First we try to find Q as a
5760 class and then treat Id as a member type. If we can't find Q
5761 as a class then we fall through. */
5762 tree q, left, left_type, right;
5763 if (split_qualified_name (&left, &right, TYPE_NAME (class_type)) == 0)
5765 BUILD_PTR_FROM_NAME (left_type, left);
5766 q = do_resolve_class (enclosing, left_type, decl, cl);
5770 saved_enclosing_type = TREE_TYPE (q);
5771 BUILD_PTR_FROM_NAME (class_type, right);
5778 /* This hash table is used to register the classes we're going
5779 through when searching the current class as an inner class, in
5780 order to detect circular references. Remember to free it before
5781 returning the section 0- of this function. */
5782 circularity_hash = htab_create (20, htab_hash_pointer, htab_eq_pointer,
5785 /* 0- Search in the current class as an inner class.
5786 Maybe some code here should be added to load the class or
5787 something, at least if the class isn't an inner class and ended
5788 being loaded from class file. FIXME. */
5791 new_class_decl = resolve_inner_class (circularity_hash, cl, &enclosing,
5792 &super, class_type);
5796 /* If we haven't found anything because SUPER reached Object and
5797 ENCLOSING happens to be an innerclass, try the enclosing context. */
5798 if ((!super || super == object_type_node) &&
5799 enclosing && INNER_CLASS_DECL_P (enclosing))
5800 enclosing = DECL_CONTEXT (enclosing);
5802 enclosing = NULL_TREE;
5805 htab_delete (circularity_hash);
5808 return new_class_decl;
5811 /* 1- Check for the type in single imports. This will change
5812 TYPE_NAME() if something relevant is found */
5813 find_in_imports (saved_enclosing_type, class_type);
5815 /* 2- And check for the type in the current compilation unit */
5816 if ((new_class_decl = IDENTIFIER_CLASS_VALUE (TYPE_NAME (class_type))))
5818 if (!CLASS_LOADED_P (TREE_TYPE (new_class_decl)))
5819 load_class (TYPE_NAME (class_type), 0);
5820 return IDENTIFIER_CLASS_VALUE (TYPE_NAME (class_type));
5823 /* 3- Search according to the current package definition */
5824 if (!QUALIFIED_P (TYPE_NAME (class_type)))
5826 if ((new_class_decl = qualify_and_find (class_type, ctxp->package,
5827 TYPE_NAME (class_type))))
5828 return new_class_decl;
5831 /* 4- Check the import on demands. Don't allow bar.baz to be
5832 imported from foo.* */
5833 if (!QUALIFIED_P (TYPE_NAME (class_type)))
5834 if (find_in_imports_on_demand (saved_enclosing_type, class_type))
5837 /* If found in find_in_imports_on_demand, the type has already been
5839 if ((new_class_decl = IDENTIFIER_CLASS_VALUE (TYPE_NAME (class_type))))
5840 return new_class_decl;
5842 /* 5- Try with a name qualified with the package name we've seen so far */
5843 if (!QUALIFIED_P (TYPE_NAME (class_type)))
5847 /* If there is a current package (ctxp->package), it's the first
5848 element of package_list and we can skip it. */
5849 for (package = (ctxp->package ?
5850 TREE_CHAIN (package_list) : package_list);
5851 package; package = TREE_CHAIN (package))
5852 if ((new_class_decl = qualify_and_find (class_type,
5853 TREE_PURPOSE (package),
5854 TYPE_NAME (class_type))))
5855 return new_class_decl;
5858 /* 5- Check another compilation unit that bears the name of type */
5859 load_class (TYPE_NAME (class_type), 0);
5862 cl = lookup_cl (decl);
5864 /* If we don't have a value for CL, then we're being called recursively.
5865 We can't check package access just yet, but it will be taken care of
5869 if (check_pkg_class_access (TYPE_NAME (class_type), cl, true, NULL_TREE))
5873 /* 6- Last call for a resolution */
5874 decl_result = IDENTIFIER_CLASS_VALUE (TYPE_NAME (class_type));
5876 /* The final lookup might have registered a.b.c into a.b$c If we
5877 failed at the first lookup, progressively change the name if
5878 applicable and use the matching DECL instead. */
5879 if (!decl_result && QUALIFIED_P (TYPE_NAME (class_type)))
5882 tree name = TYPE_NAME (class_type);
5883 char *namebuffer = alloca (IDENTIFIER_LENGTH (name) + 1);
5885 strcpy (namebuffer, IDENTIFIER_POINTER (name));
5889 /* Reach the last '.', and if applicable, replace it by a `$' and
5890 see if this exists as a type. */
5891 if ((separator = strrchr (namebuffer, '.')))
5894 name = get_identifier (namebuffer);
5895 decl_result = IDENTIFIER_CLASS_VALUE (name);
5897 } while (!decl_result && separator);
5903 qualify_and_find (tree class_type, tree package, tree name)
5905 tree new_qualified = merge_qualified_name (package, name);
5906 tree new_class_decl;
5908 if (!IDENTIFIER_CLASS_VALUE (new_qualified))
5909 load_class (new_qualified, 0);
5910 if ((new_class_decl = IDENTIFIER_CLASS_VALUE (new_qualified)))
5912 if (!CLASS_LOADED_P (TREE_TYPE (new_class_decl)))
5913 load_class (TREE_TYPE (new_class_decl), 0);
5914 TYPE_NAME (class_type) = new_qualified;
5915 return IDENTIFIER_CLASS_VALUE (new_qualified);
5920 /* Resolve NAME and lay it out (if not done and if not the current
5921 parsed class). Return a decl node. This function is meant to be
5922 called when type resolution is necessary during the walk pass. */
5925 resolve_and_layout (tree something, tree cl)
5927 tree decl, decl_type;
5929 /* Don't do that on the current class */
5930 if (something == current_class)
5931 return TYPE_NAME (current_class);
5933 /* Don't do anything for void and other primitive types */
5934 if (JPRIMITIVE_TYPE_P (something) || something == void_type_node)
5937 /* Pointer types can be reall pointer types or fake pointers. When
5938 finding a real pointer, recheck for primitive types */
5939 if (TREE_CODE (something) == POINTER_TYPE)
5941 if (TREE_TYPE (something))
5943 something = TREE_TYPE (something);
5944 if (JPRIMITIVE_TYPE_P (something) || something == void_type_node)
5948 something = TYPE_NAME (something);
5951 /* Don't do anything for arrays of primitive types */
5952 if (TREE_CODE (something) == RECORD_TYPE && TYPE_ARRAY_P (something)
5953 && JPRIMITIVE_TYPE_P (TYPE_ARRAY_ELEMENT (something)))
5956 /* Something might be a WFL */
5957 if (TREE_CODE (something) == EXPR_WITH_FILE_LOCATION)
5958 something = EXPR_WFL_NODE (something);
5960 /* Otherwise, if something is not and IDENTIFIER_NODE, it can be a a
5961 TYPE_DECL or a real TYPE */
5962 else if (TREE_CODE (something) != IDENTIFIER_NODE)
5963 something = (TREE_CODE (TYPE_NAME (something)) == TYPE_DECL ?
5964 DECL_NAME (TYPE_NAME (something)) : TYPE_NAME (something));
5966 if (!(decl = resolve_no_layout (something, cl)))
5969 /* Resolve and layout if necessary */
5970 decl_type = TREE_TYPE (decl);
5971 layout_class_methods (decl_type);
5973 if (CLASS_FROM_SOURCE_P (decl_type))
5974 java_check_methods (decl);
5975 /* Layout the type if necessary */
5976 if (decl_type != current_class && !CLASS_LOADED_P (decl_type))
5977 safe_layout_class (decl_type);
5982 /* Resolve a class, returns its decl but doesn't perform any
5983 layout. The current parsing context is saved and restored */
5986 resolve_no_layout (tree name, tree cl)
5989 BUILD_PTR_FROM_NAME (ptr, name);
5990 java_parser_context_save_global ();
5991 decl = resolve_class (TYPE_NAME (current_class), ptr, NULL_TREE, cl);
5992 java_parser_context_restore_global ();
5997 /* Called when reporting errors. Skip the '[]'s in a complex array
5998 type description that failed to be resolved. purify_type_name can't
5999 use an identifier tree. */
6002 purify_type_name (const char *name)
6004 int len = strlen (name);
6007 STRING_STRIP_BRACKETS (name, len, bracket_found);
6010 char *stripped_name = xmemdup (name, len, len+1);
6011 stripped_name [len] = '\0';
6012 return stripped_name;
6017 /* The type CURRENT refers to can't be found. We print error messages. */
6020 complete_class_report_errors (jdep *dep)
6024 if (!JDEP_WFL (dep))
6027 name = IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_WFL (dep)));
6028 switch (JDEP_KIND (dep))
6032 (JDEP_WFL (dep), "Superclass `%s' of class `%s' not found",
6033 purify_type_name (name),
6034 IDENTIFIER_POINTER (DECL_NAME (JDEP_DECL (dep))));
6038 (JDEP_WFL (dep), "Type `%s' not found in declaration of field `%s'",
6039 purify_type_name (name),
6040 IDENTIFIER_POINTER (DECL_NAME (JDEP_DECL (dep))));
6042 case JDEP_METHOD: /* Covers arguments */
6044 (JDEP_WFL (dep), "Type `%s' not found in the declaration of the argument `%s' of method `%s'",
6045 purify_type_name (name),
6046 IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_DECL_WFL (dep))),
6047 IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_MISC (dep))));
6049 case JDEP_METHOD_RETURN: /* Covers return type */
6051 (JDEP_WFL (dep), "Type `%s' not found in the declaration of the return type of method `%s'",
6052 purify_type_name (name),
6053 IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_DECL_WFL (dep))));
6055 case JDEP_INTERFACE:
6057 (JDEP_WFL (dep), "Superinterface `%s' of %s `%s' not found",
6058 IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_WFL (dep))),
6059 (CLASS_OR_INTERFACE (JDEP_DECL (dep), "class", "interface")),
6060 IDENTIFIER_POINTER (DECL_NAME (JDEP_DECL (dep))));
6064 (JDEP_WFL (dep), "Type `%s' not found in the declaration of the local variable `%s'",
6065 purify_type_name (IDENTIFIER_POINTER
6066 (EXPR_WFL_NODE (JDEP_WFL (dep)))),
6067 IDENTIFIER_POINTER (DECL_NAME (JDEP_DECL (dep))));
6069 case JDEP_EXCEPTION: /* As specified by `throws' */
6071 (JDEP_WFL (dep), "Class `%s' not found in `throws'",
6072 IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_WFL (dep))));
6075 /* Fix for -Wall. Just break doing nothing. The error will be
6081 /* Return a static string containing the DECL prototype string. If
6082 DECL is a constructor, use the class name instead of the form
6086 get_printable_method_name (tree decl)
6088 const char *to_return;
6089 tree name = NULL_TREE;
6091 if (DECL_CONSTRUCTOR_P (decl))
6093 name = DECL_NAME (decl);
6094 DECL_NAME (decl) = DECL_NAME (TYPE_NAME (DECL_CONTEXT (decl)));
6097 to_return = lang_printable_name (decl, 2);
6098 if (DECL_CONSTRUCTOR_P (decl))
6099 DECL_NAME (decl) = name;
6104 /* Track method being redefined inside the same class. As a side
6105 effect, set DECL_NAME to an IDENTIFIER (prior entering this
6106 function it's a FWL, so we can track errors more accurately.) */
6109 check_method_redefinition (tree class, tree method)
6113 /* There's no need to verify <clinit> and finit$ and instinit$ */
6114 if (DECL_CLINIT_P (method)
6115 || DECL_FINIT_P (method) || DECL_INSTINIT_P (method))
6118 sig = TYPE_ARGUMENT_SIGNATURE (TREE_TYPE (method));
6119 for (redef = TYPE_METHODS (class); redef; redef = TREE_CHAIN (redef))
6121 if (redef == method)
6123 if (DECL_NAME (redef) == DECL_NAME (method)
6124 && sig == TYPE_ARGUMENT_SIGNATURE (TREE_TYPE (redef))
6125 && !DECL_ARTIFICIAL (method))
6128 (DECL_FUNCTION_WFL (method), "Duplicate %s declaration `%s'",
6129 (DECL_CONSTRUCTOR_P (redef) ? "constructor" : "method"),
6130 get_printable_method_name (redef));
6137 /* Return 1 if check went ok, 0 otherwise. */
6139 check_abstract_method_definitions (int do_interface, tree class_decl,
6142 tree class = TREE_TYPE (class_decl);
6143 tree method, end_type;
6146 end_type = (do_interface ? object_type_node : type);
6147 for (method = TYPE_METHODS (type); method; method = TREE_CHAIN (method))
6149 tree other_super, other_method, method_sig, method_name;
6151 int end_type_reached = 0;
6153 if (!METHOD_ABSTRACT (method) || METHOD_FINAL (method))
6156 /* Now verify that somewhere in between TYPE and CLASS,
6157 abstract method METHOD gets a non abstract definition
6158 that is inherited by CLASS. */
6160 method_sig = build_java_signature (TREE_TYPE (method));
6161 method_name = DECL_NAME (method);
6162 if (TREE_CODE (method_name) == EXPR_WITH_FILE_LOCATION)
6163 method_name = EXPR_WFL_NODE (method_name);
6165 other_super = class;
6167 if (other_super == end_type)
6168 end_type_reached = 1;
6171 for (other_method = TYPE_METHODS (other_super); other_method;
6172 other_method = TREE_CHAIN (other_method))
6174 tree s = build_java_signature (TREE_TYPE (other_method));
6175 tree other_name = DECL_NAME (other_method);
6177 if (TREE_CODE (other_name) == EXPR_WITH_FILE_LOCATION)
6178 other_name = EXPR_WFL_NODE (other_name);
6179 if (!DECL_CLINIT_P (other_method)
6180 && !DECL_CONSTRUCTOR_P (other_method)
6181 && method_name == other_name
6183 && !METHOD_ABSTRACT (other_method))
6189 other_super = CLASSTYPE_SUPER (other_super);
6190 } while (!end_type_reached);
6192 /* Report that abstract METHOD didn't find an implementation
6193 that CLASS can use. */
6196 char *t = xstrdup (lang_printable_name
6197 (TREE_TYPE (TREE_TYPE (method)), 0));
6198 tree ccn = DECL_NAME (TYPE_NAME (DECL_CONTEXT (method)));
6201 (lookup_cl (class_decl),
6202 "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",
6203 IDENTIFIER_POINTER (DECL_NAME (class_decl)),
6204 t, lang_printable_name (method, 2),
6205 (CLASS_INTERFACE (TYPE_NAME (DECL_CONTEXT (method))) ?
6206 "interface" : "class"),
6207 IDENTIFIER_POINTER (ccn),
6208 (CLASS_INTERFACE (class_decl) ? "interface" : "class"),
6209 IDENTIFIER_POINTER (DECL_NAME (class_decl)));
6215 if (ok && do_interface)
6217 /* Check for implemented interfaces. */
6222 ok && BINFO_BASE_ITERATE (TYPE_BINFO (type), i, base_binfo);
6224 ok = check_abstract_method_definitions (1, class_decl,
6225 BINFO_TYPE (base_binfo));
6231 /* Check that CLASS_DECL somehow implements all inherited abstract
6235 java_check_abstract_method_definitions (tree class_decl)
6237 tree class = TREE_TYPE (class_decl);
6238 tree super, base_binfo;
6241 if (CLASS_ABSTRACT (class_decl))
6244 /* Check for inherited types */
6247 super = CLASSTYPE_SUPER (super);
6248 check_abstract_method_definitions (0, class_decl, super);
6249 } while (super != object_type_node);
6251 /* Check for implemented interfaces. */
6252 for (i = 1; BINFO_BASE_ITERATE (TYPE_BINFO (class), i, base_binfo); i++)
6253 check_abstract_method_definitions (1, class_decl, BINFO_TYPE (base_binfo));
6256 /* Check all the types method DECL uses and return 1 if all of them
6257 are now complete, 0 otherwise. This is used to check whether its
6258 safe to build a method signature or not. */
6261 check_method_types_complete (tree decl)
6263 tree type = TREE_TYPE (decl);
6266 if (!INCOMPLETE_TYPE_P (TREE_TYPE (type)))
6269 args = TYPE_ARG_TYPES (type);
6270 if (TREE_CODE (type) == METHOD_TYPE)
6271 args = TREE_CHAIN (args);
6272 for (; args != end_params_node; args = TREE_CHAIN (args))
6273 if (INCOMPLETE_TYPE_P (TREE_VALUE (args)))
6279 /* Visible interface to check methods contained in CLASS_DECL */
6282 java_check_methods (tree class_decl)
6284 if (CLASS_METHOD_CHECKED_P (TREE_TYPE (class_decl)))
6287 if (CLASS_INTERFACE (class_decl))
6288 java_check_abstract_methods (class_decl);
6290 java_check_regular_methods (class_decl);
6292 CLASS_METHOD_CHECKED_P (TREE_TYPE (class_decl)) = 1;
6295 /* Like not_accessible_p, but doesn't refer to the current class at
6298 hack_is_accessible_p (tree member, tree from_where)
6300 int flags = get_access_flags_from_decl (member);
6302 if (from_where == DECL_CONTEXT (member)
6303 || (flags & ACC_PUBLIC))
6306 if ((flags & ACC_PROTECTED))
6308 if (inherits_from_p (from_where, DECL_CONTEXT (member)))
6312 if ((flags & ACC_PRIVATE))
6315 /* Package private, or protected. */
6316 return in_same_package (TYPE_NAME (from_where),
6317 TYPE_NAME (DECL_CONTEXT (member)));
6320 /* Check all the methods of CLASS_DECL. Methods are first completed
6321 then checked according to regular method existence rules. If no
6322 constructor for CLASS_DECL were encountered, then build its
6325 java_check_regular_methods (tree class_decl)
6327 int saw_constructor = ANONYMOUS_CLASS_P (TREE_TYPE (class_decl));
6329 tree class = TREE_TYPE (class_decl);
6330 tree found = NULL_TREE;
6333 /* It is not necessary to check methods defined in java.lang.Object */
6334 if (class == object_type_node)
6337 if (!TYPE_NVIRTUALS (class))
6338 TYPE_METHODS (class) = nreverse (TYPE_METHODS (class));
6340 /* Should take interfaces into account. FIXME */
6341 for (method = TYPE_METHODS (class); method; method = TREE_CHAIN (method))
6344 tree method_wfl = DECL_FUNCTION_WFL (method);
6347 /* Check for redefinitions */
6348 if (check_method_redefinition (class, method))
6351 /* We verify things thrown by the method. They must inherit from
6352 java.lang.Throwable. */
6353 for (mthrows = DECL_FUNCTION_THROWS (method);
6354 mthrows; mthrows = TREE_CHAIN (mthrows))
6356 if (!inherits_from_p (TREE_VALUE (mthrows), throwable_type_node))
6358 (TREE_PURPOSE (mthrows), "Class `%s' in `throws' clause must be a subclass of class `java.lang.Throwable'",
6360 (DECL_NAME (TYPE_NAME (TREE_VALUE (mthrows)))));
6363 /* If we see one constructor a mark so we don't generate the
6364 default one. Also skip other verifications: constructors
6365 can't be inherited hence hidden or overridden. */
6366 if (DECL_CONSTRUCTOR_P (method))
6368 saw_constructor = 1;
6372 sig = build_java_argument_signature (TREE_TYPE (method));
6373 found = lookup_argument_method_generic (class, DECL_NAME (method), sig,
6374 SEARCH_SUPER | SEARCH_INTERFACE);
6376 /* Inner class can't declare static methods */
6377 if (METHOD_STATIC (method) && !TOPLEVEL_CLASS_DECL_P (class_decl))
6379 char *t = xstrdup (lang_printable_name (class, 0));
6381 (method_wfl, "Method `%s' can't be static in inner class `%s'. Only members of interfaces and top-level classes can be static",
6382 lang_printable_name (method, 2), t);
6386 /* Nothing overrides or it's a private method. */
6389 if (METHOD_PRIVATE (found))
6395 /* If `found' is declared in an interface, make sure the
6396 modifier matches. */
6397 if (CLASS_INTERFACE (TYPE_NAME (DECL_CONTEXT (found)))
6398 && clinit_identifier_node != DECL_NAME (found)
6399 && !METHOD_PUBLIC (method))
6401 tree found_decl = TYPE_NAME (DECL_CONTEXT (found));
6402 parse_error_context (method_wfl, "Class `%s' must override `%s' with a public method in order to implement interface `%s'",
6403 IDENTIFIER_POINTER (DECL_NAME (class_decl)),
6404 lang_printable_name (method, 2),
6405 IDENTIFIER_POINTER (DECL_NAME (found_decl)));
6408 /* Can't override a method with the same name and different return
6410 if (TREE_TYPE (TREE_TYPE (found)) != TREE_TYPE (TREE_TYPE (method)))
6413 (lang_printable_name (TREE_TYPE (TREE_TYPE (found)), 2));
6416 "Method `%s' was defined with return type `%s' in class `%s'",
6417 lang_printable_name (found, 2), t,
6419 (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found)))));
6423 aflags = get_access_flags_from_decl (found);
6425 /* Can't override final. Can't override static. */
6426 if (METHOD_FINAL (found) || METHOD_STATIC (found))
6428 /* Static *can* override static */
6429 if (METHOD_STATIC (found) && METHOD_STATIC (method))
6433 "%s methods can't be overridden. Method `%s' is %s in class `%s'",
6434 (METHOD_FINAL (found) ? "Final" : "Static"),
6435 lang_printable_name (found, 2),
6436 (METHOD_FINAL (found) ? "final" : "static"),
6438 (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found)))));
6442 /* Static method can't override instance method. */
6443 if (METHOD_STATIC (method))
6447 "Instance methods can't be overridden by a static method. Method `%s' is an instance method in class `%s'",
6448 lang_printable_name (found, 2),
6450 (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found)))));
6454 /* - Overriding/hiding public must be public
6455 - Overriding/hiding protected must be protected or public
6456 - If the overridden or hidden method has default (package)
6457 access, then the overriding or hiding method must not be
6458 private; otherwise, a compile-time error occurs. If
6459 `found' belongs to an interface, things have been already
6461 if (!CLASS_INTERFACE (TYPE_NAME (DECL_CONTEXT (found)))
6462 && ((METHOD_PUBLIC (found) && !METHOD_PUBLIC (method))
6463 || (METHOD_PROTECTED (found)
6464 && !(METHOD_PUBLIC (method) || METHOD_PROTECTED (method)))
6465 || (!(aflags & (ACC_PUBLIC | ACC_PRIVATE | ACC_STATIC))
6466 && METHOD_PRIVATE (method))))
6470 "Methods can't be overridden to be more private. Method `%s' is not %s in class `%s'", lang_printable_name (method, 2),
6471 (METHOD_PUBLIC (method) ? "public" :
6472 (METHOD_PRIVATE (method) ? "private" : "protected")),
6473 IDENTIFIER_POINTER (DECL_NAME
6474 (TYPE_NAME (DECL_CONTEXT (found)))));
6478 /* Check this method against all the other implementations it
6479 overrides. Here we only check the class hierarchy; the rest
6480 of the checking is done later. If this method is just a
6481 Miranda method, we can skip the check. */
6482 if (! METHOD_INVISIBLE (method))
6483 check_concrete_throws_clauses (class, method, DECL_NAME (method), sig);
6486 /* The above throws clause check only looked at superclasses. Now
6487 we must also make sure that all methods declared in interfaces
6488 have compatible throws clauses. FIXME: there are more efficient
6489 ways to organize this checking; we should implement one. */
6490 check_interface_throws_clauses (class, class);
6492 if (!TYPE_NVIRTUALS (class))
6493 TYPE_METHODS (class) = nreverse (TYPE_METHODS (class));
6495 /* Search for inherited abstract method not yet implemented in this
6497 java_check_abstract_method_definitions (class_decl);
6499 if (!saw_constructor)
6503 /* Check to make sure that all the methods in all the interfaces
6504 implemented by CLASS_DECL are compatible with the concrete
6505 implementations available in CHECK_CLASS_DECL. */
6507 check_interface_throws_clauses (tree check_class_decl, tree class_decl)
6509 for (; class_decl != NULL_TREE; class_decl = CLASSTYPE_SUPER (class_decl))
6513 if (! CLASS_LOADED_P (class_decl))
6515 if (CLASS_FROM_SOURCE_P (class_decl))
6516 safe_layout_class (class_decl);
6518 load_class (class_decl, 1);
6521 for (i = BINFO_N_BASE_BINFOS (TYPE_BINFO (class_decl)) - 1; i > 0; --i)
6524 = BINFO_TYPE (BINFO_BASE_BINFO (TYPE_BINFO (class_decl), i));
6527 for (iface_method = TYPE_METHODS (interface);
6528 iface_method != NULL_TREE;
6529 iface_method = TREE_CHAIN (iface_method))
6533 /* First look for a concrete method implemented or
6534 inherited by this class. No need to search
6535 interfaces here, since we're already looking through
6537 sig = build_java_argument_signature (TREE_TYPE (iface_method));
6539 = lookup_argument_method_generic (check_class_decl,
6540 DECL_NAME (iface_method),
6541 sig, SEARCH_VISIBLE);
6542 /* If we don't find an implementation, that is ok. Any
6543 potential errors from that are diagnosed elsewhere.
6544 Also, multiple inheritance with conflicting throws
6545 clauses is fine in the absence of a concrete
6547 if (method != NULL_TREE && !METHOD_ABSTRACT (method)
6548 && !METHOD_INVISIBLE (iface_method))
6550 tree method_wfl = DECL_FUNCTION_WFL (method);
6551 check_throws_clauses (method, method_wfl, iface_method);
6555 /* Now check superinterfaces. */
6556 check_interface_throws_clauses (check_class_decl, interface);
6561 /* Check throws clauses of a method against the clauses of all the
6562 methods it overrides. We do this by searching up the class
6563 hierarchy, examining all matching accessible methods. */
6565 check_concrete_throws_clauses (tree class, tree self_method,
6566 tree name, tree signature)
6568 tree method = lookup_argument_method_generic (class, name, signature,
6569 SEARCH_SUPER | SEARCH_VISIBLE);
6570 while (method != NULL_TREE)
6572 if (! METHOD_INVISIBLE (method) && hack_is_accessible_p (method, class))
6573 check_throws_clauses (self_method, DECL_FUNCTION_WFL (self_method),
6576 method = lookup_argument_method_generic (DECL_CONTEXT (method),
6578 SEARCH_SUPER | SEARCH_VISIBLE);
6582 /* Generate an error if the `throws' clause of METHOD (if any) is
6583 incompatible with the `throws' clause of FOUND (if any). */
6585 check_throws_clauses (tree method, tree method_wfl, tree found)
6589 /* Can't check these things with class loaded from bytecode. FIXME */
6590 if (!CLASS_FROM_SOURCE_P (DECL_CONTEXT (found)))
6593 for (mthrows = DECL_FUNCTION_THROWS (method);
6594 mthrows; mthrows = TREE_CHAIN (mthrows))
6598 /* We don't verify unchecked expressions */
6599 if (IS_UNCHECKED_EXCEPTION_P (TREE_VALUE (mthrows)))
6601 /* Checked expression must be compatible */
6602 for (fthrows = DECL_FUNCTION_THROWS (found);
6603 fthrows; fthrows = TREE_CHAIN (fthrows))
6605 if (inherits_from_p (TREE_VALUE (mthrows), TREE_VALUE (fthrows)))
6611 (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'",
6612 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (TREE_VALUE (mthrows)))),
6613 lang_printable_name (found, 2),
6615 (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found)))));
6620 /* Check abstract method of interface INTERFACE */
6622 java_check_abstract_methods (tree interface_decl)
6626 tree interface = TREE_TYPE (interface_decl);
6629 for (method = TYPE_METHODS (interface); method; method = TREE_CHAIN (method))
6631 /* 2- Check for double definition inside the defining interface */
6632 if (check_method_redefinition (interface, method))
6635 /* 3- Overriding is OK as far as we preserve the return type. */
6636 found = lookup_java_interface_method2 (interface, method);
6640 t = xstrdup (lang_printable_name (TREE_TYPE (TREE_TYPE (found)), 2));
6642 (DECL_FUNCTION_WFL (found),
6643 "Method `%s' was defined with return type `%s' in class `%s'",
6644 lang_printable_name (found, 2), t,
6646 (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found)))));
6652 /* 4- Inherited methods can't differ by their returned types */
6653 for (i = 0; BINFO_BASE_ITERATE (TYPE_BINFO (interface), i, base_binfo); i++)
6655 tree sub_interface_method, sub_interface;
6657 sub_interface = BINFO_TYPE (base_binfo);
6658 for (sub_interface_method = TYPE_METHODS (sub_interface);
6659 sub_interface_method;
6660 sub_interface_method = TREE_CHAIN (sub_interface_method))
6662 found = lookup_java_interface_method2 (interface,
6663 sub_interface_method);
6664 if (found && (found != sub_interface_method))
6667 (lookup_cl (sub_interface_method),
6668 "Interface `%s' inherits method `%s' from interface `%s'. This method is redefined with a different return type in interface `%s'",
6669 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (interface))),
6670 lang_printable_name (found, 2),
6672 (DECL_NAME (TYPE_NAME
6673 (DECL_CONTEXT (sub_interface_method)))),
6675 (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found)))));
6681 /* Lookup methods in interfaces using their name and partial
6682 signature. Return a matching method only if their types differ. */
6685 lookup_java_interface_method2 (tree class, tree method_decl)
6691 for (i = 0; BINFO_BASE_ITERATE (TYPE_BINFO (class), i, base_binfo); i++)
6693 if ((BINFO_TYPE (base_binfo) != object_type_node)
6695 lookup_java_method2 (BINFO_TYPE (base_binfo), method_decl, 1)))
6698 for (i = 0; BINFO_BASE_ITERATE (TYPE_BINFO (class), i, base_binfo); i++)
6700 to_return = lookup_java_interface_method2
6701 (BINFO_TYPE (base_binfo), method_decl);
6709 /* Lookup method using their name and partial signature. Return a
6710 matching method only if their types differ. */
6713 lookup_java_method2 (tree clas, tree method_decl, int do_interface)
6715 tree method, method_signature, method_name, method_type, name;
6717 method_signature = build_java_argument_signature (TREE_TYPE (method_decl));
6718 name = DECL_NAME (method_decl);
6719 method_name = (TREE_CODE (name) == EXPR_WITH_FILE_LOCATION ?
6720 EXPR_WFL_NODE (name) : name);
6721 method_type = TREE_TYPE (TREE_TYPE (method_decl));
6723 while (clas != NULL_TREE)
6725 for (method = TYPE_METHODS (clas);
6726 method != NULL_TREE; method = TREE_CHAIN (method))
6728 tree method_sig = build_java_argument_signature (TREE_TYPE (method));
6729 tree name = DECL_NAME (method);
6730 if ((TREE_CODE (name) == EXPR_WITH_FILE_LOCATION ?
6731 EXPR_WFL_NODE (name) : name) == method_name
6732 && method_sig == method_signature
6733 && TREE_TYPE (TREE_TYPE (method)) != method_type)
6736 clas = (do_interface ? NULL_TREE : CLASSTYPE_SUPER (clas));
6741 /* Return the line that matches DECL line number, and try its best to
6742 position the column number. Used during error reports. */
6744 static GTY(()) tree cl_v;
6746 lookup_cl (tree decl)
6753 if (cl_v == NULL_TREE)
6755 cl_v = build_expr_wfl (NULL_TREE, NULL, 0, 0);
6758 EXPR_WFL_FILENAME_NODE (cl_v) = get_identifier (DECL_SOURCE_FILE (decl));
6759 EXPR_WFL_SET_LINECOL (cl_v, DECL_SOURCE_LINE (decl), -1);
6761 line = java_get_line_col (EXPR_WFL_FILENAME (cl_v),
6762 EXPR_WFL_LINENO (cl_v), EXPR_WFL_COLNO (cl_v));
6764 found = strstr ((const char *)line,
6765 (const char *)IDENTIFIER_POINTER (DECL_NAME (decl)));
6767 EXPR_WFL_SET_LINECOL (cl_v, EXPR_WFL_LINENO (cl_v), found - line);
6772 /* Look for a simple name in the single-type import list */
6775 find_name_in_single_imports (tree name)
6779 for (node = ctxp->import_list; node; node = TREE_CHAIN (node))
6780 if (TREE_VALUE (node) == name)
6781 return (EXPR_WFL_NODE (TREE_PURPOSE (node)));
6786 /* Process all single-type import. */
6789 process_imports (void)
6794 for (import = ctxp->import_list; import; import = TREE_CHAIN (import))
6796 tree to_be_found = EXPR_WFL_NODE (TREE_PURPOSE (import));
6797 char *original_name;
6799 original_name = xmemdup (IDENTIFIER_POINTER (to_be_found),
6800 IDENTIFIER_LENGTH (to_be_found),
6801 IDENTIFIER_LENGTH (to_be_found) + 1);
6803 /* Don't load twice something already defined. */
6804 if (IDENTIFIER_CLASS_VALUE (to_be_found))
6811 QUALIFIED_P (to_be_found) = 1;
6812 load_class (to_be_found, 0);
6814 check_pkg_class_access (to_be_found, TREE_PURPOSE (import), true, NULL_TREE);
6816 /* We found it, we can bail out */
6817 if (IDENTIFIER_CLASS_VALUE (to_be_found))
6819 check_deprecation (TREE_PURPOSE (import),
6820 IDENTIFIER_CLASS_VALUE (to_be_found));
6824 /* We haven't found it. Maybe we're trying to access an
6825 inner class. The only way for us to know is to try again
6826 after having dropped a qualifier. If we can't break it further,
6827 we have an error. */
6828 if (split_qualified_name (&left, NULL, to_be_found))
6833 if (!IDENTIFIER_CLASS_VALUE (to_be_found))
6835 parse_error_context (TREE_PURPOSE (import),
6836 "Class or interface `%s' not found in import",
6841 free (original_name);
6848 /* Possibly find and mark a class imported by a single-type import
6852 find_in_imports (tree enclosing_type, tree class_type)
6854 tree import = (enclosing_type ? TYPE_IMPORT_LIST (enclosing_type) :
6858 if (TREE_VALUE (import) == TYPE_NAME (class_type))
6860 TYPE_NAME (class_type) = EXPR_WFL_NODE (TREE_PURPOSE (import));
6861 QUALIFIED_P (TYPE_NAME (class_type)) = 1;
6864 import = TREE_CHAIN (import);
6869 note_possible_classname (const char *name, int len)
6872 if (len > 5 && strncmp (&name [len-5], ".java", 5) == 0)
6874 else if (len > 6 && strncmp (&name [len-6], ".class", 6) == 0)
6878 node = ident_subst (name, len, "", '/', '.', "");
6879 IS_A_CLASSFILE_NAME (node) = 1; /* Or soon to be */
6880 QUALIFIED_P (node) = strchr (name, '/') ? 1 : 0;
6884 /* Read a import directory, gathering potential match for further type
6885 references. Indifferently reads a filesystem or a ZIP archive
6889 read_import_dir (tree wfl)
6891 tree package_id = EXPR_WFL_NODE (wfl);
6892 const char *package_name = IDENTIFIER_POINTER (package_id);
6893 int package_length = IDENTIFIER_LENGTH (package_id);
6895 JCF *saved_jcf = current_jcf;
6900 struct buffer filename[1];
6902 if (IS_AN_IMPORT_ON_DEMAND_P (package_id))
6904 IS_AN_IMPORT_ON_DEMAND_P (package_id) = 1;
6906 BUFFER_INIT (filename);
6907 buffer_grow (filename, package_length + 100);
6909 for (entry = jcf_path_start (); entry != NULL; entry = jcf_path_next (entry))
6911 const char *entry_name = jcf_path_name (entry);
6912 int entry_length = strlen (entry_name);
6913 if (jcf_path_is_zipfile (entry))
6916 buffer_grow (filename, entry_length);
6917 memcpy (filename->data, entry_name, entry_length - 1);
6918 filename->data[entry_length-1] = '\0';
6919 zipf = opendir_in_zip ((const char *) filename->data, jcf_path_is_system (entry));
6921 error ("malformed .zip archive in CLASSPATH: %s", entry_name);
6924 ZipDirectory *zipd = (ZipDirectory *) zipf->central_directory;
6925 BUFFER_RESET (filename);
6926 for (k = 0; k < package_length; k++)
6928 char ch = package_name[k];
6929 *filename->ptr++ = ch == '.' ? '/' : ch;
6931 *filename->ptr++ = '/';
6933 for (k = 0; k < zipf->count; k++, zipd = ZIPDIR_NEXT (zipd))
6935 const char *current_entry = ZIPDIR_FILENAME (zipd);
6936 int current_entry_len = zipd->filename_length;
6938 if (current_entry_len >= BUFFER_LENGTH (filename)
6939 && strncmp ((const char *) filename->data, current_entry,
6940 BUFFER_LENGTH (filename)) != 0)
6942 found |= note_possible_classname (current_entry,
6949 BUFFER_RESET (filename);
6950 buffer_grow (filename, entry_length + package_length + 4);
6951 strcpy ((char *) filename->data, entry_name);
6952 filename->ptr = filename->data + entry_length;
6953 for (k = 0; k < package_length; k++)
6955 char ch = package_name[k];
6956 *filename->ptr++ = ch == '.' ? '/' : ch;
6958 *filename->ptr = '\0';
6960 dirp = opendir ((const char *) filename->data);
6963 *filename->ptr++ = '/';
6968 struct dirent *direntp = readdir (dirp);
6971 d_name = direntp->d_name;
6972 len = strlen (direntp->d_name);
6973 buffer_grow (filename, len+1);
6974 strcpy ((char *) filename->ptr, d_name);
6975 found |= note_possible_classname ((const char *) filename->data + entry_length,
6976 package_length+len+1);
6983 free (filename->data);
6985 /* Here we should have a unified way of retrieving an entry, to be
6989 static int first = 1;
6992 error ("Can't find default package `%s'. Check the CLASSPATH environment variable and the access to the archives", package_name);
6997 parse_error_context (wfl, "Package `%s' not found in import",
6999 current_jcf = saved_jcf;
7002 current_jcf = saved_jcf;
7005 /* Possibly find a type in the import on demands specified
7006 types. Returns 1 if an error occurred, 0 otherwise. Run through the
7007 entire list, to detected potential double definitions. */
7010 find_in_imports_on_demand (tree enclosing_type, tree class_type)
7012 tree class_type_name = TYPE_NAME (class_type);
7013 tree import = (enclosing_type ? TYPE_IMPORT_DEMAND_LIST (enclosing_type) :
7014 ctxp->import_demand_list);
7015 tree cl = NULL_TREE;
7016 int seen_once = -1; /* -1 when not set, 1 if seen once, >1 otherwise. */
7017 int to_return = -1; /* -1 when not set, 0 or 1 otherwise */
7020 for (; import; import = TREE_CHAIN (import))
7022 int saved_lineno = input_line;
7024 const char *id_name;
7025 tree decl, type_name_copy;
7027 obstack_grow (&temporary_obstack,
7028 IDENTIFIER_POINTER (EXPR_WFL_NODE (TREE_PURPOSE (import))),
7029 IDENTIFIER_LENGTH (EXPR_WFL_NODE (TREE_PURPOSE (import))));
7030 obstack_1grow (&temporary_obstack, '.');
7031 obstack_grow0 (&temporary_obstack,
7032 IDENTIFIER_POINTER (class_type_name),
7033 IDENTIFIER_LENGTH (class_type_name));
7034 id_name = obstack_finish (&temporary_obstack);
7036 if (! (node = maybe_get_identifier (id_name)))
7039 /* Setup input_line so that it refers to the line of the import (in
7040 case we parse a class file and encounter errors */
7041 input_line = EXPR_WFL_LINENO (TREE_PURPOSE (import));
7043 type_name_copy = TYPE_NAME (class_type);
7044 TYPE_NAME (class_type) = node;
7045 QUALIFIED_P (node) = 1;
7046 decl = IDENTIFIER_CLASS_VALUE (node);
7048 /* If there is no DECL set for the class or if the class isn't
7049 loaded and not seen in source yet, then load */
7050 if (!decl || ! CLASS_LOADED_P (TREE_TYPE (decl)))
7052 load_class (node, 0);
7053 decl = IDENTIFIER_CLASS_VALUE (node);
7055 if (decl && ! INNER_CLASS_P (TREE_TYPE (decl)))
7056 access_check = check_pkg_class_access (node, TREE_PURPOSE (import),
7059 /* 6.6.1: Inner classes are subject to member access rules. */
7062 input_line = saved_lineno;
7064 /* If the loaded class is not accessible or couldn't be loaded,
7065 we restore the original TYPE_NAME and process the next
7067 if (access_check || !decl)
7069 TYPE_NAME (class_type) = type_name_copy;
7073 /* If the loaded class is accessible, we keep a tab on it to
7074 detect and report multiple inclusions. */
7075 if (IS_A_CLASSFILE_NAME (node))
7079 cl = TREE_PURPOSE (import);
7082 else if (seen_once >= 0)
7084 tree location = (cl ? cl : TREE_PURPOSE (import));
7085 tree package = (cl ? EXPR_WFL_NODE (cl) :
7086 EXPR_WFL_NODE (TREE_PURPOSE (import)));
7090 "Type `%s' also potentially defined in package `%s'",
7091 IDENTIFIER_POINTER (TYPE_NAME (class_type)),
7092 IDENTIFIER_POINTER (package));
7095 to_return = access_check;
7101 return (seen_once < 0 ? 0 : seen_once); /* It's ok not to have found */
7104 /* Add package NAME to the list of packages encountered so far. To
7105 speed up class lookup in do_resolve_class, we make sure a
7106 particular package is added only once. */
7109 register_package (tree name)
7115 pht = htab_create (50, htab_hash_pointer, htab_eq_pointer, NULL);
7117 e = htab_find_slot (pht, name, INSERT);
7120 package_list = chainon (package_list, build_tree_list (name, NULL));
7126 resolve_package (tree pkg, tree *next, tree *type_name)
7129 tree decl = NULL_TREE;
7130 *type_name = NULL_TREE;
7132 /* The trick is to determine when the package name stops and were
7133 the name of something contained in the package starts. Then we
7134 return a fully qualified name of what we want to get. */
7136 *next = EXPR_WFL_QUALIFICATION (pkg);
7138 /* Try to progressively construct a type name */
7139 if (TREE_CODE (pkg) == EXPR_WITH_FILE_LOCATION)
7140 for (current = EXPR_WFL_QUALIFICATION (pkg);
7141 current; current = TREE_CHAIN (current))
7143 /* If we don't have what we're expecting, exit now. TYPE_NAME
7144 will be null and the error caught later. */
7145 if (TREE_CODE (QUAL_WFL (current)) != EXPR_WITH_FILE_LOCATION)
7148 merge_qualified_name (*type_name, EXPR_WFL_NODE (QUAL_WFL (current)));
7149 if ((decl = resolve_no_layout (*type_name, NULL_TREE)))
7151 /* resolve_package should be used in a loop, hence we
7152 point at this one to naturally process the next one at
7153 the next iteration. */
7162 /* Check accessibility of inner classes according to member access rules.
7163 DECL is the inner class, ENCLOSING_DECL is the class from which the
7164 access is being attempted. */
7167 check_inner_class_access (tree decl, tree enclosing_decl, tree cl)
7170 tree enclosing_decl_type;
7172 /* We don't issue an error message when CL is null. CL can be null
7173 as a result of processing a JDEP crafted by source_start_java_method
7174 for the purpose of patching its parm decl. But the error would
7175 have been already trapped when fixing the method's signature.
7176 DECL can also be NULL in case of earlier errors. */
7180 enclosing_decl_type = TREE_TYPE (enclosing_decl);
7182 if (CLASS_PRIVATE (decl))
7184 /* Access is permitted only within the body of the top-level
7185 class in which DECL is declared. */
7186 tree top_level = decl;
7187 while (DECL_CONTEXT (top_level))
7188 top_level = DECL_CONTEXT (top_level);
7189 while (DECL_CONTEXT (enclosing_decl))
7190 enclosing_decl = DECL_CONTEXT (enclosing_decl);
7191 if (top_level == enclosing_decl)
7195 else if (CLASS_PROTECTED (decl))
7198 /* Access is permitted from within the same package... */
7199 if (in_same_package (decl, enclosing_decl))
7202 /* ... or from within the body of a subtype of the context in which
7203 DECL is declared. */
7204 decl_context = DECL_CONTEXT (decl);
7205 while (enclosing_decl)
7207 if (CLASS_INTERFACE (decl))
7209 if (interface_of_p (TREE_TYPE (decl_context),
7210 enclosing_decl_type))
7215 /* Eww. The order of the arguments is different!! */
7216 if (inherits_from_p (enclosing_decl_type,
7217 TREE_TYPE (decl_context)))
7220 enclosing_decl = DECL_CONTEXT (enclosing_decl);
7222 access = "protected";
7224 else if (! CLASS_PUBLIC (decl))
7226 /* Access is permitted only from within the same package as DECL. */
7227 if (in_same_package (decl, enclosing_decl))
7229 access = "non-public";
7232 /* Class is public. */
7235 parse_error_context (cl, "Nested %s %s is %s; cannot be accessed from here",
7236 (CLASS_INTERFACE (decl) ? "interface" : "class"),
7237 lang_printable_name (decl, 2), access);
7240 /* Accessibility check for top-level classes. If CLASS_NAME is in a
7241 foreign package, it must be PUBLIC. Return 0 if no access
7242 violations were found, 1 otherwise. If VERBOSE is true and an error
7243 was found, it is reported and accounted for. If CL is NULL then
7244 look it up with THIS_DECL. */
7247 check_pkg_class_access (tree class_name, tree cl, bool verbose, tree this_decl)
7251 if (!IDENTIFIER_CLASS_VALUE (class_name))
7254 if (!(type = TREE_TYPE (IDENTIFIER_CLASS_VALUE (class_name))))
7257 if (!CLASS_PUBLIC (TYPE_NAME (type)))
7259 /* Access to a private class within the same package is
7262 split_qualified_name (&l, &r, class_name);
7263 if (!QUALIFIED_P (class_name) && !ctxp->package)
7264 /* Both in the empty package. */
7266 if (l == ctxp->package)
7267 /* Both in the same package. */
7272 (cl == NULL ? lookup_cl (this_decl): cl,
7273 "Can't access %s `%s'. Only public classes and interfaces in other packages can be accessed",
7274 (CLASS_INTERFACE (TYPE_NAME (type)) ? "interface" : "class"),
7275 IDENTIFIER_POINTER (class_name));
7281 /* Local variable declaration. */
7284 declare_local_variables (int modifier, tree type, tree vlist)
7286 tree decl, current, saved_type;
7287 tree type_wfl = NULL_TREE;
7291 /* Push a new block if statements were seen between the last time we
7292 pushed a block and now. Keep a count of blocks to close */
7293 if (BLOCK_EXPR_BODY (GET_CURRENT_BLOCK (current_function_decl)))
7295 tree b = enter_block ();
7296 BLOCK_IS_IMPLICIT (b) = 1;
7302 for (i = 0; i < ARRAY_SIZE (ctxp->modifier_ctx); i++)
7303 if (1 << i & modifier)
7305 if (modifier == ACC_FINAL)
7310 (ctxp->modifier_ctx [i],
7311 "Only `final' is allowed as a local variables modifier");
7316 /* Obtain an incomplete type if TYPE is not complete. TYPE_WFL will
7317 hold the TYPE value if a new incomplete has to be created (as
7318 opposed to being found already existing and reused). */
7319 SET_TYPE_FOR_RESOLUTION (type, type_wfl, must_chain);
7321 /* If TYPE is fully resolved and we don't have a reference, make one */
7322 PROMOTE_RECORD_IF_COMPLETE (type, must_chain);
7324 /* Go through all the declared variables */
7325 for (current = vlist, saved_type = type; current;
7326 current = TREE_CHAIN (current), type = saved_type)
7328 tree other, real_type;
7329 tree wfl = TREE_PURPOSE (current);
7330 tree name = EXPR_WFL_NODE (wfl);
7331 tree init = TREE_VALUE (current);
7333 /* Process NAME, as it may specify extra dimension(s) for it */
7334 type = build_array_from_name (type, type_wfl, name, &name);
7336 /* Variable redefinition check */
7337 if ((other = lookup_name_in_blocks (name)))
7339 variable_redefinition_error (wfl, name, TREE_TYPE (other),
7340 DECL_SOURCE_LINE (other));
7344 /* Type adjustment. We may have just readjusted TYPE because
7345 the variable specified more dimensions. Make sure we have
7346 a reference if we can and don't have one already. */
7347 PROMOTE_RECORD_IF_COMPLETE (type, must_chain);
7349 real_type = GET_REAL_TYPE (type);
7350 /* Never layout this decl. This will be done when its scope
7352 decl = build_decl (VAR_DECL, name, real_type);
7353 MAYBE_CREATE_VAR_LANG_DECL_SPECIFIC (decl);
7354 DECL_FINAL (decl) = final_p;
7355 BLOCK_CHAIN_DECL (decl);
7357 /* If doing xreferencing, replace the line number with the WFL
7360 DECL_SOURCE_LINE (decl) = EXPR_WFL_LINECOL (wfl);
7362 /* Don't try to use an INIT statement when an error was found */
7363 if (init && java_error_count)
7366 /* Remember it if this is an initialized-upon-declaration final
7368 if (init && final_p)
7370 DECL_LOCAL_FINAL_IUD (decl) = 1;
7373 /* Add the initialization function to the current function's code */
7376 /* Name might have been readjusted */
7377 EXPR_WFL_NODE (TREE_OPERAND (init, 0)) = name;
7378 MODIFY_EXPR_FROM_INITIALIZATION_P (init) = 1;
7379 java_method_add_stmt (current_function_decl,
7380 build_debugable_stmt (EXPR_WFL_LINECOL (init),
7384 /* Setup dependency the type of the decl */
7388 register_incomplete_type (JDEP_VARIABLE, type_wfl, decl, type);
7389 dep = CLASSD_LAST (ctxp->classd_list);
7390 JDEP_GET_PATCH (dep) = &TREE_TYPE (decl);
7393 SOURCE_FRONTEND_DEBUG (("Defined locals"));
7396 /* Called during parsing. Build decls from argument list. */
7399 source_start_java_method (tree fndecl)
7408 current_function_decl = fndecl;
7410 /* New scope for the function */
7412 for (tem = TYPE_ARG_TYPES (TREE_TYPE (fndecl)), i = 0;
7413 tem != end_params_node; tem = TREE_CHAIN (tem), i++)
7415 tree type = TREE_VALUE (tem);
7416 tree name = TREE_PURPOSE (tem);
7418 /* If type is incomplete. Create an incomplete decl and ask for
7419 the decl to be patched later */
7420 if (INCOMPLETE_TYPE_P (type))
7423 tree real_type = GET_REAL_TYPE (type);
7424 parm_decl = build_decl (PARM_DECL, name, real_type);
7425 type = obtain_incomplete_type (type);
7426 register_incomplete_type (JDEP_PARM, NULL_TREE, NULL_TREE, type);
7427 jdep = CLASSD_LAST (ctxp->classd_list);
7428 JDEP_MISC (jdep) = name;
7429 JDEP_GET_PATCH (jdep) = &TREE_TYPE (parm_decl);
7432 parm_decl = build_decl (PARM_DECL, name, type);
7434 /* Remember if a local variable was declared final (via its
7435 TREE_LIST of type/name.) Set DECL_FINAL accordingly. */
7436 if (ARG_FINAL_P (tem))
7438 MAYBE_CREATE_VAR_LANG_DECL_SPECIFIC (parm_decl);
7439 DECL_FINAL (parm_decl) = 1;
7442 BLOCK_CHAIN_DECL (parm_decl);
7444 tem = BLOCK_EXPR_DECLS (DECL_FUNCTION_BODY (current_function_decl));
7445 BLOCK_EXPR_DECLS (DECL_FUNCTION_BODY (current_function_decl)) =
7447 DECL_ARG_SLOT_COUNT (current_function_decl) = i;
7448 DECL_MAX_LOCALS (current_function_decl) = i;
7451 /* Called during parsing. Creates an artificial method declaration. */
7454 create_artificial_method (tree class, int flags, tree type,
7455 tree name, tree args)
7459 java_parser_context_save_global ();
7461 mdecl = make_node (FUNCTION_TYPE);
7462 TREE_TYPE (mdecl) = type;
7463 TYPE_ARG_TYPES (mdecl) = args;
7464 mdecl = add_method (class, flags, name, build_java_signature (mdecl));
7465 java_parser_context_restore_global ();
7466 DECL_ARTIFICIAL (mdecl) = 1;
7470 /* Starts the body if an artificial method. */
7473 start_artificial_method_body (tree mdecl)
7475 DECL_SOURCE_LINE (mdecl) = 1;
7476 DECL_FUNCTION_LAST_LINE (mdecl) = 1;
7477 source_start_java_method (mdecl);
7482 end_artificial_method_body (tree mdecl)
7484 /* exit_block modifies DECL_FUNCTION_BODY (current_function_decl).
7485 It has to be evaluated first. (if mdecl is current_function_decl,
7486 we have an undefined behavior if no temporary variable is used.) */
7487 tree b = exit_block ();
7488 BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (mdecl)) = b;
7492 /* Dump a tree of some kind. This is a convenience wrapper for the
7493 dump_* functions in tree-dump.c. */
7495 dump_java_tree (enum tree_dump_index phase, tree t)
7500 stream = dump_begin (phase, &flags);
7504 dump_node (t, flags, stream);
7505 dump_end (phase, stream);
7509 /* Terminate a function and expand its body. */
7512 source_end_java_method (void)
7514 tree fndecl = current_function_decl;
7519 java_parser_context_save_global ();
7520 input_line = ctxp->last_ccb_indent1;
7522 /* Turn function bodies with only a NOP expr null, so they don't get
7523 generated at all and we won't get warnings when using the -W
7525 if (IS_EMPTY_STMT (BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (fndecl))))
7526 BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (fndecl)) = NULL_TREE;
7528 if (BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (fndecl))
7529 && ! flag_emit_class_files
7530 && ! flag_emit_xref)
7531 finish_method (fndecl);
7533 current_function_decl = NULL_TREE;
7534 java_parser_context_restore_global ();
7535 current_function_decl = NULL_TREE;
7538 /* Record EXPR in the current function block. Complements compound
7539 expression second operand if necessary. */
7542 java_method_add_stmt (tree fndecl, tree expr)
7544 if (!GET_CURRENT_BLOCK (fndecl))
7546 return add_stmt_to_block (GET_CURRENT_BLOCK (fndecl), NULL_TREE, expr);
7550 add_stmt_to_block (tree b, tree type, tree stmt)
7552 tree body = BLOCK_EXPR_BODY (b), c;
7554 if (java_error_count)
7557 if ((c = add_stmt_to_compound (body, type, stmt)) == body)
7560 BLOCK_EXPR_BODY (b) = c;
7561 TREE_SIDE_EFFECTS (c) = 1;
7565 /* Lays out the methods for the classes seen so far. */
7568 java_layout_seen_class_methods (void)
7570 tree previous_list = all_class_list;
7571 tree end = NULL_TREE;
7576 for (current = previous_list;
7577 current != end; current = TREE_CHAIN (current))
7579 tree cls = TREE_TYPE (TREE_VALUE (current));
7581 if (! CLASS_LOADED_P (cls))
7582 load_class (cls, 0);
7584 layout_class_methods (cls);
7587 /* Note that new classes might have been added while laying out
7588 methods, changing the value of all_class_list. */
7590 if (previous_list != all_class_list)
7592 end = previous_list;
7593 previous_list = all_class_list;
7600 static GTY(()) tree stop_reordering;
7602 java_reorder_fields (void)
7606 for (current = gclass_list; current; current = TREE_CHAIN (current))
7608 output_class = current_class = TREE_TYPE (TREE_VALUE (current));
7610 if (current_class == stop_reordering)
7613 /* Reverse the fields, but leave the dummy field in front.
7614 Fields are already ordered for Object and Class */
7615 if (TYPE_FIELDS (current_class) && current_class != object_type_node
7616 && current_class != class_type_node)
7618 /* If the dummy field is there, reverse the right fields and
7619 just layout the type for proper fields offset */
7620 if (!DECL_NAME (TYPE_FIELDS (current_class)))
7622 tree fields = TYPE_FIELDS (current_class);
7623 TREE_CHAIN (fields) = nreverse (TREE_CHAIN (fields));
7624 TYPE_SIZE (current_class) = NULL_TREE;
7626 /* We don't have a dummy field, we need to layout the class,
7627 after having reversed the fields */
7630 TYPE_FIELDS (current_class) =
7631 nreverse (TYPE_FIELDS (current_class));
7632 TYPE_SIZE (current_class) = NULL_TREE;
7636 /* There are cases were gclass_list will be empty. */
7638 stop_reordering = TREE_TYPE (TREE_VALUE (gclass_list));
7641 /* Layout the methods of all classes loaded in one way or another.
7642 Check methods of source parsed classes. Then reorder the
7643 fields and layout the classes or the type of all source parsed
7647 java_layout_classes (void)
7650 int save_error_count = java_error_count;
7652 /* Layout the methods of all classes seen so far */
7653 java_layout_seen_class_methods ();
7654 java_parse_abort_on_error ();
7655 all_class_list = NULL_TREE;
7657 /* Then check the methods of all parsed classes */
7658 for (current = gclass_list; current; current = TREE_CHAIN (current))
7659 if (CLASS_FROM_SOURCE_P (TREE_TYPE (TREE_VALUE (current))))
7660 java_check_methods (TREE_VALUE (current));
7661 java_parse_abort_on_error ();
7663 for (current = gclass_list; current; current = TREE_CHAIN (current))
7665 output_class = current_class = TREE_TYPE (TREE_VALUE (current));
7666 layout_class (current_class);
7668 /* Error reported by the caller */
7669 if (java_error_count)
7673 /* We might have reloaded classes durign the process of laying out
7674 classes for code generation. We must layout the methods of those
7675 late additions, as constructor checks might use them */
7676 java_layout_seen_class_methods ();
7677 java_parse_abort_on_error ();
7680 /* Expand methods in the current set of classes remembered for
7684 java_complete_expand_classes (void)
7688 do_not_fold = flag_emit_xref;
7690 for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
7691 if (!INNER_CLASS_DECL_P (current))
7692 java_complete_expand_class (current);
7695 /* Expand the methods found in OUTER, starting first by OUTER's inner
7699 java_complete_expand_class (tree outer)
7703 /* We need to go after all inner classes and start expanding them,
7704 starting with most nested ones. We have to do that because nested
7705 classes might add functions to outer classes */
7707 for (inner_list = DECL_INNER_CLASS_LIST (outer);
7708 inner_list; inner_list = TREE_CHAIN (inner_list))
7709 java_complete_expand_class (TREE_PURPOSE (inner_list));
7711 java_complete_expand_methods (outer);
7714 /* Expand methods registered in CLASS_DECL. The general idea is that
7715 we expand regular methods first. This allows us get an estimate on
7716 how outer context local alias fields are really used so we can add
7717 to the constructor just enough code to initialize them properly (it
7718 also lets us generate finit$ correctly.) Then we expand the
7719 constructors and then <clinit>. */
7722 java_complete_expand_methods (tree class_decl)
7724 tree clinit, decl, first_decl;
7726 output_class = current_class = TREE_TYPE (class_decl);
7728 /* Pre-expand <clinit> to figure whether we really need it or
7729 not. If we do need it, we pre-expand the static fields so they're
7730 ready to be used somewhere else. <clinit> will be fully expanded
7731 after we processed the constructors. */
7732 first_decl = TYPE_METHODS (current_class);
7733 clinit = maybe_generate_pre_expand_clinit (current_class);
7735 /* Then generate finit$ (if we need to) because constructors will
7737 if (TYPE_FINIT_STMT_LIST (current_class))
7738 java_complete_expand_method (generate_finit (current_class));
7740 /* Then generate instinit$ (if we need to) because constructors will
7742 if (TYPE_II_STMT_LIST (current_class))
7743 java_complete_expand_method (generate_instinit (current_class));
7745 /* Now do the constructors */
7746 for (decl = first_decl ; !java_error_count && decl; decl = TREE_CHAIN (decl))
7748 if (!DECL_CONSTRUCTOR_P (decl))
7750 java_complete_expand_method (decl);
7753 /* First, do the ordinary methods. */
7754 for (decl = first_decl; decl; decl = TREE_CHAIN (decl))
7756 /* Ctors aren't part of this batch. */
7757 if (DECL_CONSTRUCTOR_P (decl) || DECL_CLINIT_P (decl))
7760 /* Skip abstract or native methods -- but do handle native
7761 methods when generating JNI stubs. */
7762 if (METHOD_ABSTRACT (decl) || (! flag_jni && METHOD_NATIVE (decl)))
7764 DECL_FUNCTION_BODY (decl) = NULL_TREE;
7768 if (METHOD_NATIVE (decl))
7771 current_function_decl = decl;
7772 body = build_jni_stub (decl);
7773 BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (decl)) = body;
7776 java_complete_expand_method (decl);
7779 /* If there is indeed a <clinit>, fully expand it now */
7782 /* Prevent the use of `this' inside <clinit> */
7783 ctxp->explicit_constructor_p = 1;
7784 java_complete_expand_method (clinit);
7785 ctxp->explicit_constructor_p = 0;
7788 /* We might have generated a class$ that we now want to expand */
7789 if (TYPE_DOT_CLASS (current_class))
7790 java_complete_expand_method (TYPE_DOT_CLASS (current_class));
7792 /* Now verify constructor circularity (stop after the first one we
7794 if (!CLASS_INTERFACE (class_decl))
7795 for (decl = TYPE_METHODS (current_class); decl; decl = TREE_CHAIN (decl))
7796 if (DECL_CONSTRUCTOR_P (decl)
7797 && verify_constructor_circularity (decl, decl))
7801 /* Attempt to create <clinit>. Pre-expand static fields so they can be
7802 safely used in some other methods/constructors. */
7805 maybe_generate_pre_expand_clinit (tree class_type)
7807 tree current, mdecl;
7809 if (!TYPE_CLINIT_STMT_LIST (class_type))
7812 /* Go through all static fields and pre expand them */
7813 for (current = TYPE_FIELDS (class_type); current;
7814 current = TREE_CHAIN (current))
7815 if (FIELD_STATIC (current))
7816 build_field_ref (NULL_TREE, class_type, DECL_NAME (current));
7818 /* Then build the <clinit> method */
7819 mdecl = create_artificial_method (class_type, ACC_STATIC, void_type_node,
7820 clinit_identifier_node, end_params_node);
7821 layout_class_method (class_type, CLASSTYPE_SUPER (class_type),
7823 start_artificial_method_body (mdecl);
7825 /* We process the list of assignment we produced as the result of
7826 the declaration of initialized static field and add them as
7827 statement to the <clinit> method. */
7828 for (current = TYPE_CLINIT_STMT_LIST (class_type); current;
7829 current = TREE_CHAIN (current))
7831 tree stmt = current;
7832 /* We build the assignment expression that will initialize the
7833 field to its value. There are strict rules on static
7834 initializers (8.5). FIXME */
7835 if (TREE_CODE (stmt) != BLOCK && !IS_EMPTY_STMT (stmt))
7836 stmt = build_debugable_stmt (EXPR_WFL_LINECOL (stmt), stmt);
7837 java_method_add_stmt (mdecl, stmt);
7840 end_artificial_method_body (mdecl);
7842 /* Now we want to place <clinit> as the last method (because we need
7843 it at least for interface so that it doesn't interfere with the
7844 dispatch table based lookup. */
7845 if (TREE_CHAIN (TYPE_METHODS (class_type)))
7847 current = TREE_CHAIN (TYPE_METHODS (class_type));
7848 TYPE_METHODS (class_type) = current;
7850 while (TREE_CHAIN (current))
7851 current = TREE_CHAIN (current);
7853 TREE_CHAIN (current) = mdecl;
7854 TREE_CHAIN (mdecl) = NULL_TREE;
7860 /* Analyzes a method body and look for something that isn't a
7861 MODIFY_EXPR with a constant value. */
7864 analyze_clinit_body (tree this_class, tree bbody)
7867 switch (TREE_CODE (bbody))
7870 bbody = BLOCK_EXPR_BODY (bbody);
7873 case EXPR_WITH_FILE_LOCATION:
7874 bbody = EXPR_WFL_NODE (bbody);
7878 if (analyze_clinit_body (this_class, TREE_OPERAND (bbody, 0)))
7880 bbody = TREE_OPERAND (bbody, 1);
7884 /* If we're generating to class file and we're dealing with an
7885 array initialization, we return 1 to keep <clinit> */
7886 if (TREE_CODE (TREE_OPERAND (bbody, 1)) == NEW_ARRAY_INIT
7887 && flag_emit_class_files)
7890 /* There are a few cases where we're required to keep
7892 - If this is an assignment whose operand is not constant,
7893 - If this is an assignment to a non-initialized field,
7894 - If this field is not a member of the current class.
7896 return (! TREE_CONSTANT (TREE_OPERAND (bbody, 1))
7897 || ! DECL_INITIAL (TREE_OPERAND (bbody, 0))
7898 || DECL_CONTEXT (TREE_OPERAND (bbody, 0)) != this_class);
7907 /* See whether we could get rid of <clinit>. Criteria are: all static
7908 final fields have constant initial values and the body of <clinit>
7909 is empty. Return 1 if <clinit> was discarded, 0 otherwise. */
7912 maybe_yank_clinit (tree mdecl)
7917 if (!DECL_CLINIT_P (mdecl))
7920 /* If the body isn't empty, then we keep <clinit>. Note that if
7921 we're emitting classfiles, this isn't enough not to rule it
7923 fbody = DECL_FUNCTION_BODY (mdecl);
7924 bbody = BLOCK_EXPR_BODY (fbody);
7925 if (bbody && bbody != error_mark_node)
7926 bbody = BLOCK_EXPR_BODY (bbody);
7929 if (bbody && ! flag_emit_class_files && !IS_EMPTY_STMT (bbody))
7932 type = DECL_CONTEXT (mdecl);
7933 current = TYPE_FIELDS (type);
7935 for (current = (current ? TREE_CHAIN (current) : current);
7936 current; current = TREE_CHAIN (current))
7940 /* We're not interested in non-static fields. */
7941 if (!FIELD_STATIC (current))
7944 /* Nor in fields without initializers. */
7945 f_init = DECL_INITIAL (current);
7946 if (f_init == NULL_TREE)
7949 /* Anything that isn't String or a basic type is ruled out -- or
7950 if we know how to deal with it (when doing things natively) we
7951 should generated an empty <clinit> so that SUID are computed
7953 if (! JSTRING_TYPE_P (TREE_TYPE (current))
7954 && ! JNUMERIC_TYPE_P (TREE_TYPE (current)))
7957 if (! FIELD_FINAL (current) || ! TREE_CONSTANT (f_init))
7961 /* Now we analyze the method body and look for something that
7962 isn't a MODIFY_EXPR */
7963 if (!IS_EMPTY_STMT (bbody) && analyze_clinit_body (type, bbody))
7966 /* Get rid of <clinit> in the class' list of methods */
7967 if (TYPE_METHODS (type) == mdecl)
7968 TYPE_METHODS (type) = TREE_CHAIN (mdecl);
7970 for (current = TYPE_METHODS (type); current;
7971 current = TREE_CHAIN (current))
7972 if (TREE_CHAIN (current) == mdecl)
7974 TREE_CHAIN (current) = TREE_CHAIN (mdecl);
7981 /* Install the argument from MDECL. Suitable to completion and
7982 expansion of mdecl's body. */
7985 start_complete_expand_method (tree mdecl)
7989 pushlevel (1); /* Prepare for a parameter push */
7990 tem = BLOCK_EXPR_DECLS (DECL_FUNCTION_BODY (current_function_decl));
7991 DECL_ARGUMENTS (mdecl) = tem;
7993 for (; tem; tem = TREE_CHAIN (tem))
7995 /* TREE_CHAIN (tem) will change after pushdecl. */
7996 tree next = TREE_CHAIN (tem);
7997 tree type = TREE_TYPE (tem);
7998 if (targetm.calls.promote_prototypes (type)
7999 && TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node)
8000 && INTEGRAL_TYPE_P (type))
8001 type = integer_type_node;
8002 DECL_ARG_TYPE (tem) = type;
8003 layout_decl (tem, 0);
8005 /* Re-install the next so that the list is kept and the loop
8007 TREE_CHAIN (tem) = next;
8009 pushdecl_force_head (DECL_ARGUMENTS (mdecl));
8010 input_line = DECL_SOURCE_LINE (mdecl);
8011 build_result_decl (mdecl);
8015 /* Complete and expand a method. */
8018 java_complete_expand_method (tree mdecl)
8020 tree fbody, block_body, exception_copy;
8022 current_function_decl = mdecl;
8023 /* Fix constructors before expanding them */
8024 if (DECL_CONSTRUCTOR_P (mdecl))
8025 fix_constructors (mdecl);
8027 /* Expand functions that have a body */
8028 if (!DECL_FUNCTION_BODY (mdecl))
8031 fbody = DECL_FUNCTION_BODY (mdecl);
8032 block_body = BLOCK_EXPR_BODY (fbody);
8033 exception_copy = NULL_TREE;
8035 current_function_decl = mdecl;
8038 fprintf (stderr, " [%s.",
8039 lang_printable_name (DECL_CONTEXT (mdecl), 0));
8040 announce_function (mdecl);
8042 fprintf (stderr, "]");
8044 /* Prepare the function for tree completion */
8045 start_complete_expand_method (mdecl);
8047 /* Install the current this */
8048 current_this = (!METHOD_STATIC (mdecl) ?
8049 BLOCK_EXPR_DECLS (DECL_FUNCTION_BODY (mdecl)) : NULL_TREE);
8051 /* Purge the `throws' list of unchecked exceptions (we save a copy
8052 of the list and re-install it later.) */
8053 exception_copy = copy_list (DECL_FUNCTION_THROWS (mdecl));
8054 purge_unchecked_exceptions (mdecl);
8056 /* Install exceptions thrown with `throws' */
8057 PUSH_EXCEPTIONS (DECL_FUNCTION_THROWS (mdecl));
8059 if (block_body != NULL_TREE)
8061 block_body = java_complete_tree (block_body);
8063 /* Before we check initialization, attached all class initialization
8064 variable to the block_body */
8065 htab_traverse (DECL_FUNCTION_INIT_TEST_TABLE (mdecl),
8066 attach_init_test_initialization_flags, block_body);
8068 if (! flag_emit_xref && ! METHOD_NATIVE (mdecl))
8070 check_for_initialization (block_body, mdecl);
8072 /* Go through all the flags marking the initialization of
8073 static variables and see whether they're definitively
8074 assigned, in which case the type is remembered as
8075 definitively initialized in MDECL. */
8076 if (STATIC_CLASS_INIT_OPT_P ())
8078 /* Always register the context as properly initialized in
8079 MDECL. This used with caution helps removing extra
8080 initialization of self. */
8081 if (METHOD_STATIC (mdecl))
8084 (DECL_FUNCTION_INITIALIZED_CLASS_TABLE (mdecl),
8085 DECL_CONTEXT (mdecl), INSERT)) = DECL_CONTEXT (mdecl);
8089 ctxp->explicit_constructor_p = 0;
8092 BLOCK_EXPR_BODY (fbody) = block_body;
8094 /* If we saw a return but couldn't evaluate it properly, we'll have
8095 an error_mark_node here. */
8096 if (block_body != error_mark_node
8097 && (block_body == NULL_TREE || CAN_COMPLETE_NORMALLY (block_body))
8098 && TREE_CODE (TREE_TYPE (TREE_TYPE (mdecl))) != VOID_TYPE
8100 missing_return_error (current_function_decl);
8102 /* See if we can get rid of <clinit> if MDECL happens to be <clinit> */
8103 maybe_yank_clinit (mdecl);
8105 /* Pop the current level, with special measures if we found errors. */
8106 if (java_error_count)
8107 pushdecl_force_head (DECL_ARGUMENTS (mdecl));
8110 /* Pop the exceptions and sanity check */
8112 if (currently_caught_type_list)
8115 /* Restore the copy of the list of exceptions if emitting xrefs. */
8116 DECL_FUNCTION_THROWS (mdecl) = exception_copy;
8119 /* For with each class for which there's code to generate. */
8122 java_expand_method_bodies (tree class)
8125 for (decl = TYPE_METHODS (class); decl; decl = TREE_CHAIN (decl))
8129 if (! DECL_FUNCTION_BODY (decl))
8132 current_function_decl = decl;
8134 block = BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (decl));
8136 /* Save the function body for gimplify and inlining. */
8137 DECL_SAVED_TREE (decl) = block;
8139 /* It's time to assign the variable flagging static class
8140 initialization based on which classes invoked static methods
8141 are definitely initializing. This should be flagged. */
8142 if (STATIC_CLASS_INIT_OPT_P ())
8144 tree list = DECL_FUNCTION_STATIC_METHOD_INVOCATION_COMPOUND (decl);
8145 for (; list != NULL_TREE; list = TREE_CHAIN (list))
8147 /* Executed for each statement calling a static function.
8148 LIST is a TREE_LIST whose PURPOSE is the called function
8149 and VALUE is a compound whose second operand can be patched
8150 with static class initialization flag assignments. */
8152 tree called_method = TREE_PURPOSE (list);
8153 tree compound = TREE_VALUE (list);
8154 tree assignment_compound_list
8155 = build_tree_list (called_method, NULL);
8157 /* For each class definitely initialized in
8158 CALLED_METHOD, fill ASSIGNMENT_COMPOUND with
8159 assignment to the class initialization flag. */
8160 htab_traverse (DECL_FUNCTION_INITIALIZED_CLASS_TABLE (called_method),
8161 emit_test_initialization,
8162 assignment_compound_list);
8164 if (TREE_VALUE (assignment_compound_list))
8165 TREE_OPERAND (compound, 1)
8166 = TREE_VALUE (assignment_compound_list);
8170 /* Expand the function body. */
8171 source_end_java_method ();
8177 /* This section of the code deals with accessing enclosing context
8178 fields either directly by using the relevant access to this$<n> or
8179 by invoking an access method crafted for that purpose. */
8181 /* Build the necessary access from an inner class to an outer
8182 class. This routine could be optimized to cache previous result
8183 (decl, current_class and returned access). When an access method
8184 needs to be generated, it always takes the form of a read. It might
8185 be later turned into a write by calling outer_field_access_fix. */
8188 build_outer_field_access (tree id, tree decl)
8190 tree access = NULL_TREE;
8191 tree ctx = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (current_class)));
8192 tree decl_ctx = DECL_CONTEXT (decl);
8194 /* If the immediate enclosing context of the current class is the
8195 field decl's class or inherits from it; build the access as
8196 `this$<n>.<field>'. Note that we will break the `private' barrier
8197 if we're not emitting bytecodes. */
8198 if ((ctx == decl_ctx || inherits_from_p (ctx, decl_ctx))
8199 && (!FIELD_PRIVATE (decl) || !flag_emit_class_files ))
8201 tree thisn = build_current_thisn (current_class);
8202 access = make_qualified_primary (build_wfl_node (thisn),
8203 id, EXPR_WFL_LINECOL (id));
8205 /* Otherwise, generate access methods to outer this and access the
8206 field (either using an access method or by direct access.) */
8209 int lc = EXPR_WFL_LINECOL (id);
8211 /* Now we chain the required number of calls to the access$0 to
8212 get a hold to the enclosing instance we need, and then we
8213 build the field access. */
8214 access = build_access_to_thisn (current_class, decl_ctx, lc);
8216 /* If the field is private and we're generating bytecode, then
8217 we generate an access method */
8218 if (FIELD_PRIVATE (decl) && flag_emit_class_files )
8220 tree name = build_outer_field_access_methods (decl);
8221 access = build_outer_field_access_expr (lc, decl_ctx,
8222 name, access, NULL_TREE);
8224 /* Otherwise we use `access$(this$<j>). ... access$(this$<i>).<field>'.
8225 Once again we break the `private' access rule from a foreign
8228 access = make_qualified_primary (access, id, lc);
8230 return resolve_expression_name (access, NULL);
8233 /* Return a nonzero value if NODE describes an outer field inner
8237 outer_field_access_p (tree type, tree decl)
8239 if (!INNER_CLASS_TYPE_P (type)
8240 || TREE_CODE (decl) != FIELD_DECL
8241 || DECL_CONTEXT (decl) == type)
8244 /* If the inner class extends the declaration context of the field
8245 we're trying to access, then this isn't an outer field access */
8246 if (inherits_from_p (type, DECL_CONTEXT (decl)))
8249 for (type = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (type))); ;
8250 type = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (type))))
8252 if (type == DECL_CONTEXT (decl))
8255 if (!DECL_CONTEXT (TYPE_NAME (type)))
8257 /* Before we give up, see whether the field is inherited from
8258 the enclosing context we're considering. */
8259 if (inherits_from_p (type, DECL_CONTEXT (decl)))
8268 /* Return a nonzero value if NODE represents an outer field inner
8269 access that was been already expanded. As a side effect, it returns
8270 the name of the field being accessed and the argument passed to the
8271 access function, suitable for a regeneration of the access method
8272 call if necessary. */
8275 outer_field_expanded_access_p (tree node, tree *name, tree *arg_type,
8280 if (TREE_CODE (node) != CALL_EXPR)
8283 /* Well, gcj generates slightly different tree nodes when compiling
8284 to native or bytecodes. It's the case for function calls. */
8286 if (flag_emit_class_files
8287 && TREE_CODE (node) == CALL_EXPR
8288 && OUTER_FIELD_ACCESS_IDENTIFIER_P (DECL_NAME (TREE_OPERAND (node, 0))))
8290 else if (!flag_emit_class_files)
8292 node = TREE_OPERAND (node, 0);
8294 if (node && TREE_OPERAND (node, 0)
8295 && TREE_CODE (TREE_OPERAND (node, 0)) == ADDR_EXPR)
8297 node = TREE_OPERAND (node, 0);
8298 if (TREE_OPERAND (node, 0)
8299 && TREE_CODE (TREE_OPERAND (node, 0)) == FUNCTION_DECL
8300 && (OUTER_FIELD_ACCESS_IDENTIFIER_P
8301 (DECL_NAME (TREE_OPERAND (node, 0)))))
8306 if (identified && name && arg_type && arg)
8308 tree argument = TREE_OPERAND (node, 1);
8309 *name = DECL_NAME (TREE_OPERAND (node, 0));
8310 *arg_type = TREE_TYPE (TREE_TYPE (TREE_VALUE (argument)));
8311 *arg = TREE_VALUE (argument);
8316 /* Detect in NODE an outer field read access from an inner class and
8317 transform it into a write with RHS as an argument. This function is
8318 called from the java_complete_lhs when an assignment to a LHS can
8322 outer_field_access_fix (tree wfl, tree node, tree rhs)
8324 tree name, arg_type, arg;
8326 if (outer_field_expanded_access_p (node, &name, &arg_type, &arg))
8328 node = build_outer_field_access_expr (EXPR_WFL_LINECOL (wfl),
8329 arg_type, name, arg, rhs);
8330 return java_complete_tree (node);
8335 /* Construct the expression that calls an access method:
8336 <type>.access$<n>(<arg1> [, <arg2>]);
8338 ARG2 can be NULL and will be omitted in that case. It will denote a
8342 build_outer_field_access_expr (int lc, tree type, tree access_method_name,
8343 tree arg1, tree arg2)
8345 tree args, cn, access;
8347 args = arg1 ? arg1 :
8348 build_wfl_node (build_current_thisn (current_class));
8349 args = build_tree_list (NULL_TREE, args);
8352 args = tree_cons (NULL_TREE, arg2, args);
8354 access = build_method_invocation (build_wfl_node (access_method_name), args);
8355 cn = build_wfl_node (DECL_NAME (TYPE_NAME (type)));
8356 return make_qualified_primary (cn, access, lc);
8360 build_new_access_id (void)
8362 static int access_n_counter = 1;
8365 sprintf (buffer, "access$%d", access_n_counter++);
8366 return get_identifier (buffer);
8369 /* Create the static access functions for the outer field DECL. We define a
8371 TREE_TYPE (<field>) access$<n> (DECL_CONTEXT (<field>) inst$) {
8375 TREE_TYPE (<field>) access$<n> (DECL_CONTEXT (<field>) inst$,
8376 TREE_TYPE (<field>) value$) {
8377 return inst$.field = value$;
8379 We should have a usage flags on the DECL so we can lazily turn the ones
8380 we're using for code generation. FIXME.
8384 build_outer_field_access_methods (tree decl)
8386 tree id, args, stmt, mdecl;
8388 if (FIELD_INNER_ACCESS_P (decl))
8389 return FIELD_INNER_ACCESS (decl);
8391 MAYBE_CREATE_VAR_LANG_DECL_SPECIFIC (decl);
8393 /* Create the identifier and a function named after it. */
8394 id = build_new_access_id ();
8396 /* The identifier is marked as bearing the name of a generated write
8397 access function for outer field accessed from inner classes. */
8398 OUTER_FIELD_ACCESS_IDENTIFIER_P (id) = 1;
8400 /* Create the read access */
8401 args = build_tree_list (inst_id, build_pointer_type (DECL_CONTEXT (decl)));
8402 TREE_CHAIN (args) = end_params_node;
8403 stmt = make_qualified_primary (build_wfl_node (inst_id),
8404 build_wfl_node (DECL_NAME (decl)), 0);
8405 stmt = build_return (0, stmt);
8406 mdecl = build_outer_field_access_method (DECL_CONTEXT (decl),
8407 TREE_TYPE (decl), id, args, stmt);
8408 DECL_FUNCTION_ACCESS_DECL (mdecl) = decl;
8410 /* Create the write access method. No write access for final variable */
8411 if (!FIELD_FINAL (decl))
8413 args = build_tree_list (inst_id,
8414 build_pointer_type (DECL_CONTEXT (decl)));
8415 TREE_CHAIN (args) = build_tree_list (wpv_id, TREE_TYPE (decl));
8416 TREE_CHAIN (TREE_CHAIN (args)) = end_params_node;
8417 stmt = make_qualified_primary (build_wfl_node (inst_id),
8418 build_wfl_node (DECL_NAME (decl)), 0);
8419 stmt = build_return (0, build_assignment (ASSIGN_TK, 0, stmt,
8420 build_wfl_node (wpv_id)));
8421 mdecl = build_outer_field_access_method (DECL_CONTEXT (decl),
8422 TREE_TYPE (decl), id,
8425 DECL_FUNCTION_ACCESS_DECL (mdecl) = decl;
8427 /* Return the access name */
8428 return FIELD_INNER_ACCESS (decl) = id;
8431 /* Build an field access method NAME. */
8434 build_outer_field_access_method (tree class, tree type, tree name,
8435 tree args, tree body)
8437 tree saved_current_function_decl, mdecl;
8439 /* Create the method */
8440 mdecl = create_artificial_method (class, ACC_STATIC, type, name, args);
8441 fix_method_argument_names (args, mdecl);
8442 layout_class_method (class, NULL_TREE, mdecl, NULL_TREE);
8444 /* Attach the method body. */
8445 saved_current_function_decl = current_function_decl;
8446 start_artificial_method_body (mdecl);
8447 java_method_add_stmt (mdecl, body);
8448 end_artificial_method_body (mdecl);
8449 current_function_decl = saved_current_function_decl;
8455 /* This section deals with building access function necessary for
8456 certain kinds of method invocation from inner classes. */
8459 build_outer_method_access_method (tree decl)
8461 tree saved_current_function_decl, mdecl;
8462 tree args = NULL_TREE, call_args = NULL_TREE;
8463 tree carg, id, body, class;
8465 int parm_id_count = 0;
8467 /* Test this abort with an access to a private field */
8468 if (!strcmp (IDENTIFIER_POINTER (DECL_NAME (decl)), "access$"))
8471 /* Check the cache first */
8472 if (DECL_FUNCTION_INNER_ACCESS (decl))
8473 return DECL_FUNCTION_INNER_ACCESS (decl);
8475 class = DECL_CONTEXT (decl);
8477 /* Obtain an access identifier and mark it */
8478 id = build_new_access_id ();
8479 OUTER_FIELD_ACCESS_IDENTIFIER_P (id) = 1;
8481 carg = TYPE_ARG_TYPES (TREE_TYPE (decl));
8482 /* Create the arguments, as much as the original */
8483 for (; carg && carg != end_params_node;
8484 carg = TREE_CHAIN (carg))
8486 sprintf (buffer, "write_parm_value$%d", parm_id_count++);
8487 args = chainon (args, build_tree_list (get_identifier (buffer),
8488 TREE_VALUE (carg)));
8490 args = chainon (args, end_params_node);
8492 /* Create the method */
8493 mdecl = create_artificial_method (class, ACC_STATIC,
8494 TREE_TYPE (TREE_TYPE (decl)), id, args);
8495 layout_class_method (class, NULL_TREE, mdecl, NULL_TREE);
8496 /* There is a potential bug here. We should be able to use
8497 fix_method_argument_names, but then arg names get mixed up and
8498 eventually a constructor will have its this$0 altered and the
8499 outer context won't be assignment properly. The testcase is
8501 TYPE_ARG_TYPES (TREE_TYPE (mdecl)) = args;
8503 /* Attach the method body. */
8504 saved_current_function_decl = current_function_decl;
8505 start_artificial_method_body (mdecl);
8507 /* The actual method invocation uses the same args. When invoking a
8508 static methods that way, we don't want to skip the first
8511 if (!METHOD_STATIC (decl))
8512 carg = TREE_CHAIN (carg);
8513 for (; carg && carg != end_params_node; carg = TREE_CHAIN (carg))
8514 call_args = tree_cons (NULL_TREE, build_wfl_node (TREE_PURPOSE (carg)),
8517 body = build_method_invocation (build_wfl_node (DECL_NAME (decl)),
8519 if (!METHOD_STATIC (decl))
8520 body = make_qualified_primary (build_wfl_node (TREE_PURPOSE (args)),
8522 if (TREE_TYPE (TREE_TYPE (decl)) != void_type_node)
8523 body = build_return (0, body);
8524 java_method_add_stmt (mdecl,body);
8525 end_artificial_method_body (mdecl);
8526 current_function_decl = saved_current_function_decl;
8528 /* Back tag the access function so it know what it accesses */
8529 DECL_FUNCTION_ACCESS_DECL (decl) = mdecl;
8531 /* Tag the current method so it knows it has an access generated */
8532 return DECL_FUNCTION_INNER_ACCESS (decl) = mdecl;
8536 /* This section of the code deals with building expressions to access
8537 the enclosing instance of an inner class. The enclosing instance is
8538 kept in a generated field called this$<n>, with <n> being the
8539 inner class nesting level (starting from 0.) */
8541 /* Build an access to a given this$<n>, always chaining access call to
8542 others. Access methods to this$<n> are build on the fly if
8543 necessary. This CAN'T be used to solely access this$<n-1> from
8544 this$<n> (which alway yield to special cases and optimization, see
8545 for example build_outer_field_access). */
8548 build_access_to_thisn (tree from, tree to, int lc)
8550 tree access = NULL_TREE;
8552 while (from != to && PURE_INNER_CLASS_TYPE_P (from))
8556 access = build_current_thisn (from);
8557 access = build_wfl_node (access);
8561 tree access0_wfl, cn;
8563 maybe_build_thisn_access_method (from);
8564 access0_wfl = build_wfl_node (access0_identifier_node);
8565 cn = build_wfl_node (DECL_NAME (TYPE_NAME (from)));
8566 EXPR_WFL_LINECOL (access0_wfl) = lc;
8567 access = build_tree_list (NULL_TREE, access);
8568 access = build_method_invocation (access0_wfl, access);
8569 access = make_qualified_primary (cn, access, lc);
8572 /* If FROM isn't an inner class, that's fine, we've done enough.
8573 What we're looking for can be accessed from there. */
8574 from = DECL_CONTEXT (TYPE_NAME (from));
8577 from = TREE_TYPE (from);
8582 /* Build an access function to the this$<n> local to TYPE. NULL_TREE
8583 is returned if nothing needs to be generated. Otherwise, the method
8584 generated and a method decl is returned.
8586 NOTE: These generated methods should be declared in a class file
8587 attribute so that they can't be referred to directly. */
8590 maybe_build_thisn_access_method (tree type)
8592 tree mdecl, args, stmt, rtype;
8593 tree saved_current_function_decl;
8595 /* If TYPE is a top-level class, no access method is required.
8596 If there already is such an access method, bail out. */
8597 if (CLASS_ACCESS0_GENERATED_P (type) || !PURE_INNER_CLASS_TYPE_P (type))
8600 /* We generate the method. The method looks like:
8601 static <outer_of_type> access$0 (<type> inst$) { return inst$.this$<n>; }
8603 args = build_tree_list (inst_id, build_pointer_type (type));
8604 TREE_CHAIN (args) = end_params_node;
8605 rtype = build_pointer_type (TREE_TYPE (DECL_CONTEXT (TYPE_NAME (type))));
8606 mdecl = create_artificial_method (type, ACC_STATIC, rtype,
8607 access0_identifier_node, args);
8608 fix_method_argument_names (args, mdecl);
8609 layout_class_method (type, NULL_TREE, mdecl, NULL_TREE);
8610 stmt = build_current_thisn (type);
8611 stmt = make_qualified_primary (build_wfl_node (inst_id),
8612 build_wfl_node (stmt), 0);
8613 stmt = build_return (0, stmt);
8615 saved_current_function_decl = current_function_decl;
8616 start_artificial_method_body (mdecl);
8617 java_method_add_stmt (mdecl, stmt);
8618 end_artificial_method_body (mdecl);
8619 current_function_decl = saved_current_function_decl;
8621 CLASS_ACCESS0_GENERATED_P (type) = 1;
8626 /* Craft an correctly numbered `this$<n>'string. this$0 is used for
8627 the first level of innerclassing. this$1 for the next one, etc...
8628 This function can be invoked with TYPE to NULL, available and then
8629 has to count the parser context. */
8631 static GTY(()) tree saved_thisn;
8632 static GTY(()) tree saved_type;
8635 build_current_thisn (tree type)
8637 static int saved_i = -1;
8638 static int saved_type_i = 0;
8645 if (type == saved_type)
8649 for (i = -1, decl = DECL_CONTEXT (TYPE_NAME (type));
8650 decl; decl = DECL_CONTEXT (decl), i++)
8658 i = list_length (GET_CPC_LIST ())-2;
8663 sprintf (buffer, "this$%d", i);
8665 saved_thisn = get_identifier (buffer);
8669 /* Return the assignment to the hidden enclosing context `this$<n>'
8670 by the second incoming parameter to the innerclass constructor. The
8671 form used is `this.this$<n> = this$<n>;'. */
8674 build_thisn_assign (void)
8676 if (current_class && PURE_INNER_CLASS_TYPE_P (current_class))
8678 tree thisn = build_current_thisn (current_class);
8679 tree lhs = make_qualified_primary (build_wfl_node (this_identifier_node),
8680 build_wfl_node (thisn), 0);
8681 tree rhs = build_wfl_node (thisn);
8682 EXPR_WFL_SET_LINECOL (lhs, input_line, 0);
8683 return build_assignment (ASSIGN_TK, EXPR_WFL_LINECOL (lhs), lhs, rhs);
8689 /* Building the synthetic `class$' used to implement the `.class' 1.1
8690 extension for non primitive types. This method looks like:
8692 static Class class$(String type) throws NoClassDefFoundError
8694 try {return (java.lang.Class.forName (String));}
8695 catch (ClassNotFoundException e) {
8696 throw new NoClassDefFoundError(e.getMessage());}
8699 static GTY(()) tree get_message_wfl;
8700 static GTY(()) tree type_parm_wfl;
8703 build_dot_class_method (tree class)
8705 #define BWF(S) build_wfl_node (get_identifier ((S)))
8706 #define MQN(X,Y) make_qualified_name ((X), (Y), 0)
8707 tree args, tmp, saved_current_function_decl, mdecl, qual_name;
8708 tree stmt, throw_stmt;
8710 if (!get_message_wfl)
8712 get_message_wfl = build_wfl_node (get_identifier ("getMessage"));
8713 type_parm_wfl = build_wfl_node (get_identifier ("type$"));
8716 /* Build the arguments */
8717 args = build_tree_list (get_identifier ("type$"),
8718 build_pointer_type (string_type_node));
8719 TREE_CHAIN (args) = end_params_node;
8721 /* Build the qualified name java.lang.Class.forName */
8722 tmp = MQN (MQN (MQN (BWF ("java"),
8723 BWF ("lang")), BWF ("Class")), BWF ("forName"));
8725 /* Create the "class$" function */
8726 mdecl = create_artificial_method (class, ACC_STATIC,
8727 build_pointer_type (class_type_node),
8728 classdollar_identifier_node, args);
8729 qual_name = MQN (MQN (BWF ("java"), BWF ("lang")),
8730 BWF ("NoClassDefFoundError"));
8731 DECL_FUNCTION_THROWS (mdecl) = build_tree_list (NULL_TREE, qual_name);
8732 register_incomplete_type (JDEP_EXCEPTION, qual_name, NULL_TREE, NULL_TREE);
8733 JDEP_GET_PATCH (CLASSD_LAST (ctxp->classd_list)) =
8734 &TREE_VALUE (DECL_FUNCTION_THROWS (mdecl));
8736 /* We start by building the try block. We need to build:
8737 return (java.lang.Class.forName (type)); */
8738 stmt = build_method_invocation (tmp,
8739 build_tree_list (NULL_TREE, type_parm_wfl));
8740 stmt = build_return (0, stmt);
8742 /* Now onto the catch block. We start by building the expression
8743 throwing a new exception: throw new NoClassDefFoundError (_.getMessage) */
8744 throw_stmt = make_qualified_name (build_wfl_node (wpv_id),
8745 get_message_wfl, 0);
8746 throw_stmt = build_method_invocation (throw_stmt, NULL_TREE);
8748 /* Build new NoClassDefFoundError (_.getMessage) */
8749 throw_stmt = build_new_invocation
8750 (build_wfl_node (get_identifier ("NoClassDefFoundError")),
8751 build_tree_list (build_pointer_type (string_type_node), throw_stmt));
8753 /* Build the throw, (it's too early to use BUILD_THROW) */
8754 throw_stmt = build1 (THROW_EXPR, NULL_TREE, throw_stmt);
8756 /* Encapsulate STMT in a try block. The catch clause executes THROW_STMT */
8757 qual_name = MQN (MQN (BWF ("java"), BWF ("lang")),
8758 BWF ("ClassNotFoundException"));
8759 stmt = encapsulate_with_try_catch (0, qual_name, stmt, throw_stmt);
8761 fix_method_argument_names (args, mdecl);
8762 layout_class_method (class, NULL_TREE, mdecl, NULL_TREE);
8763 saved_current_function_decl = current_function_decl;
8764 start_artificial_method_body (mdecl);
8765 java_method_add_stmt (mdecl, stmt);
8766 end_artificial_method_body (mdecl);
8767 current_function_decl = saved_current_function_decl;
8768 TYPE_DOT_CLASS (class) = mdecl;
8774 build_dot_class_method_invocation (tree this_class, tree type)
8776 tree dot_class_method = TYPE_DOT_CLASS (this_class);
8779 if (TYPE_ARRAY_P (type))
8780 sig_id = build_java_signature (type);
8782 sig_id = DECL_NAME (TYPE_NAME (type));
8784 /* Ensure that the proper name separator is used */
8785 sig_id = unmangle_classname (IDENTIFIER_POINTER (sig_id),
8786 IDENTIFIER_LENGTH (sig_id));
8788 s = build_string (IDENTIFIER_LENGTH (sig_id),
8789 IDENTIFIER_POINTER (sig_id));
8790 t = build_method_invocation (build_wfl_node (DECL_NAME (dot_class_method)),
8791 build_tree_list (NULL_TREE, s));
8792 if (DECL_CONTEXT (dot_class_method) != this_class)
8794 tree class_name = DECL_NAME (TYPE_NAME (DECL_CONTEXT (dot_class_method)));
8795 t = make_qualified_primary (build_wfl_node (class_name), t, 0);
8800 /* This section of the code deals with constructor. */
8802 /* Craft a body for default constructor. Patch existing constructor
8803 bodies with call to super() and field initialization statements if
8807 fix_constructors (tree mdecl)
8809 tree iii; /* Instance Initializer Invocation */
8810 tree body = DECL_FUNCTION_BODY (mdecl);
8811 tree thisn_assign, compound = NULL_TREE;
8812 tree class_type = DECL_CONTEXT (mdecl);
8814 if (DECL_FIXED_CONSTRUCTOR_P (mdecl))
8816 DECL_FIXED_CONSTRUCTOR_P (mdecl) = 1;
8820 /* It is an error for the compiler to generate a default
8821 constructor if the superclass doesn't have a constructor that
8822 takes no argument, or the same args for an anonymous class */
8823 if (verify_constructor_super (mdecl))
8825 tree sclass_decl = TYPE_NAME (CLASSTYPE_SUPER (class_type));
8826 tree save = DECL_NAME (mdecl);
8827 const char *n = IDENTIFIER_POINTER (DECL_NAME (sclass_decl));
8828 DECL_NAME (mdecl) = DECL_NAME (sclass_decl);
8830 (lookup_cl (TYPE_NAME (class_type)),
8831 "No constructor matching `%s' found in class `%s'",
8832 lang_printable_name (mdecl, 2), n);
8833 DECL_NAME (mdecl) = save;
8836 /* The constructor body must be crafted by hand. It's the
8837 constructor we defined when we realize we didn't have the
8838 CLASSNAME() constructor */
8839 start_artificial_method_body (mdecl);
8841 /* Insert an assignment to the this$<n> hidden field, if
8843 if ((thisn_assign = build_thisn_assign ()))
8844 java_method_add_stmt (mdecl, thisn_assign);
8846 /* We don't generate a super constructor invocation if we're
8847 compiling java.lang.Object. build_super_invocation takes care
8849 java_method_add_stmt (mdecl, build_super_invocation (mdecl));
8852 if ((iii = build_instinit_invocation (class_type)))
8853 java_method_add_stmt (mdecl, iii);
8855 end_artificial_method_body (mdecl);
8857 /* Search for an explicit constructor invocation */
8861 int invokes_this = 0;
8862 tree found_call = NULL_TREE;
8863 tree main_block = BLOCK_EXPR_BODY (body);
8866 switch (TREE_CODE (body))
8869 found = CALL_EXPLICIT_CONSTRUCTOR_P (body);
8870 if (CALL_THIS_CONSTRUCTOR_P (body))
8875 case EXPR_WITH_FILE_LOCATION:
8877 body = TREE_OPERAND (body, 0);
8881 body = BLOCK_EXPR_BODY (body);
8888 /* Generate the assignment to this$<n>, if necessary */
8889 if ((thisn_assign = build_thisn_assign ()))
8890 compound = add_stmt_to_compound (compound, NULL_TREE, thisn_assign);
8892 /* The constructor is missing an invocation of super() */
8894 compound = add_stmt_to_compound (compound, NULL_TREE,
8895 build_super_invocation (mdecl));
8896 /* Explicit super() invocation should take place before the
8897 instance initializer blocks. */
8900 compound = add_stmt_to_compound (compound, NULL_TREE,
8901 TREE_OPERAND (found_call, 0));
8902 TREE_OPERAND (found_call, 0) = build_java_empty_stmt ();
8905 DECL_INIT_CALLS_THIS (mdecl) = invokes_this;
8907 /* Insert the instance initializer block right after. */
8908 if (!invokes_this && (iii = build_instinit_invocation (class_type)))
8909 compound = add_stmt_to_compound (compound, NULL_TREE, iii);
8911 /* Fix the constructor main block if we're adding extra stmts */
8914 compound = add_stmt_to_compound (compound, NULL_TREE,
8915 BLOCK_EXPR_BODY (main_block));
8916 BLOCK_EXPR_BODY (main_block) = compound;
8921 /* Browse constructors in the super class, searching for a constructor
8922 that doesn't take any argument. Return 0 if one is found, 1
8923 otherwise. If the current class is an anonymous inner class, look
8924 for something that has the same signature. */
8927 verify_constructor_super (tree mdecl)
8929 tree class = CLASSTYPE_SUPER (current_class);
8930 int super_inner = PURE_INNER_CLASS_TYPE_P (class);
8936 if (ANONYMOUS_CLASS_P (current_class))
8938 tree mdecl_arg_type;
8939 SKIP_THIS_AND_ARTIFICIAL_PARMS (mdecl_arg_type, mdecl);
8940 for (sdecl = TYPE_METHODS (class); sdecl; sdecl = TREE_CHAIN (sdecl))
8941 if (DECL_CONSTRUCTOR_P (sdecl))
8944 tree arg_type = TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (sdecl)));
8946 arg_type = TREE_CHAIN (arg_type);
8947 for (m_arg_type = mdecl_arg_type;
8948 (arg_type != end_params_node
8949 && m_arg_type != end_params_node);
8950 arg_type = TREE_CHAIN (arg_type),
8951 m_arg_type = TREE_CHAIN (m_arg_type))
8952 if (!valid_method_invocation_conversion_p
8953 (TREE_VALUE (arg_type),
8954 TREE_VALUE (m_arg_type)))
8957 if (arg_type == end_params_node && m_arg_type == end_params_node)
8963 for (sdecl = TYPE_METHODS (class); sdecl; sdecl = TREE_CHAIN (sdecl))
8965 tree arg = TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (sdecl)));
8967 arg = TREE_CHAIN (arg);
8968 if (DECL_CONSTRUCTOR_P (sdecl) && arg == end_params_node)
8975 /* Generate code for all context remembered for code generation. */
8977 static GTY(()) tree reversed_class_list;
8979 java_expand_classes (void)
8981 int save_error_count = 0;
8982 static struct parser_ctxt *cur_ctxp = NULL;
8984 java_parse_abort_on_error ();
8985 if (!(ctxp = ctxp_for_generation))
8987 java_layout_classes ();
8988 java_parse_abort_on_error ();
8990 for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
8993 for (current = cur_ctxp->class_list;
8995 current = TREE_CHAIN (current))
8996 gen_indirect_dispatch_tables (TREE_TYPE (current));
8999 for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
9002 input_filename = ctxp->filename;
9003 lang_init_source (2); /* Error msgs have method prototypes */
9004 java_complete_expand_classes (); /* Complete and expand classes */
9005 java_parse_abort_on_error ();
9007 input_filename = main_input_filename;
9009 /* Find anonymous classes and expand their constructor. This extra pass is
9010 necessary because the constructor itself is only generated when the
9011 method in which it is defined is expanded. */
9012 for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
9016 for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
9018 output_class = current_class = TREE_TYPE (current);
9019 if (ANONYMOUS_CLASS_P (current_class))
9022 for (d = TYPE_METHODS (current_class); d; d = TREE_CHAIN (d))
9024 if (DECL_CONSTRUCTOR_P (d))
9026 java_complete_expand_method (d);
9027 break; /* There is only one constructor. */
9034 /* Expanding the constructors of anonymous classes generates access
9035 methods. Scan all the methods looking for null DECL_RESULTs --
9036 this will be the case if a method hasn't been expanded. */
9037 for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
9041 for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
9044 output_class = current_class = TREE_TYPE (current);
9045 for (d = TYPE_METHODS (current_class); d; d = TREE_CHAIN (d))
9047 if (DECL_RESULT (d) == NULL_TREE)
9048 java_complete_expand_method (d);
9053 /* ??? Instead of all this we could iterate around the list of
9054 classes until there were no more un-expanded methods. It would
9055 take a little longer -- one pass over the whole list of methods
9056 -- but it would be simpler. Like this: */
9059 int something_changed;
9063 something_changed = 0;
9064 for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
9068 for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
9071 output_class = current_class = TREE_TYPE (current);
9072 for (d = TYPE_METHODS (current_class); d; d = TREE_CHAIN (d))
9074 if (DECL_RESULT (d) == NULL_TREE)
9076 something_changed = 1;
9077 java_complete_expand_method (d);
9083 while (something_changed);
9087 /* If we've found error at that stage, don't try to generate
9088 anything, unless we're emitting xrefs or checking the syntax only
9089 (but not using -fsyntax-only for the purpose of generating
9091 if (java_error_count && !flag_emit_xref
9092 && (!flag_syntax_only && !flag_emit_class_files))
9095 /* Now things are stable, go for generation of the class data. */
9097 /* We pessimistically marked all methods and fields external until
9098 we knew what set of classes we were planning to compile. Now mark
9099 those that will be generated locally as not external. */
9100 for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
9104 for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
9105 java_mark_class_local (TREE_TYPE (current));
9108 /* Compile the classes. */
9109 for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
9112 reversed_class_list = NULL;
9116 /* We write out the classes in reverse order. This ensures that
9117 inner classes are written before their containing classes,
9118 which is important for parallel builds. Otherwise, the
9119 class file for the outer class may be found, but the class
9120 file for the inner class may not be present. In that
9121 situation, the compiler cannot fall back to the original
9122 source, having already read the outer class, so we must
9123 prevent that situation. */
9124 for (current = ctxp->class_list;
9126 current = TREE_CHAIN (current))
9128 = tree_cons (NULL_TREE, current, reversed_class_list);
9130 for (current = reversed_class_list;
9132 current = TREE_CHAIN (current))
9134 output_class = current_class = TREE_TYPE (TREE_VALUE (current));
9135 if (flag_emit_class_files)
9136 write_classfile (current_class);
9138 expand_xref (current_class);
9139 else if (! flag_syntax_only)
9140 java_expand_method_bodies (current_class);
9146 java_finish_classes (void)
9148 static struct parser_ctxt *cur_ctxp = NULL;
9149 for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
9153 for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
9155 output_class = current_class = TREE_TYPE (current);
9161 /* Wrap non WFL PRIMARY around a WFL and set EXPR_WFL_QUALIFICATION to
9162 a tree list node containing RIGHT. Fore coming RIGHTs will be
9163 chained to this hook. LOCATION contains the location of the
9164 separating `.' operator. */
9167 make_qualified_primary (tree primary, tree right, int location)
9171 if (TREE_CODE (primary) != EXPR_WITH_FILE_LOCATION)
9172 wfl = build_wfl_wrap (primary, location);
9176 /* If wfl wasn't qualified, we build a first anchor */
9177 if (!EXPR_WFL_QUALIFICATION (wfl))
9178 EXPR_WFL_QUALIFICATION (wfl) = build_tree_list (wfl, NULL_TREE);
9181 /* And chain them */
9182 EXPR_WFL_LINECOL (right) = location;
9183 chainon (EXPR_WFL_QUALIFICATION (wfl), build_tree_list (right, NULL_TREE));
9184 PRIMARY_P (wfl) = 1;
9188 /* Simple merge of two name separated by a `.' */
9191 merge_qualified_name (tree left, tree right)
9194 if (!left && !right)
9203 obstack_grow (&temporary_obstack, IDENTIFIER_POINTER (left),
9204 IDENTIFIER_LENGTH (left));
9205 obstack_1grow (&temporary_obstack, '.');
9206 obstack_grow0 (&temporary_obstack, IDENTIFIER_POINTER (right),
9207 IDENTIFIER_LENGTH (right));
9208 node = get_identifier (obstack_base (&temporary_obstack));
9209 obstack_free (&temporary_obstack, obstack_base (&temporary_obstack));
9210 QUALIFIED_P (node) = 1;
9214 /* Merge the two parts of a qualified name into LEFT. Set the
9215 location information of the resulting node to LOCATION, usually
9216 inherited from the location information of the `.' operator. */
9219 make_qualified_name (tree left, tree right, int location)
9221 #ifdef USE_COMPONENT_REF
9222 tree node = build3 (COMPONENT_REF, NULL_TREE, left, right, NULL_TREE);
9223 EXPR_WFL_LINECOL (node) = location;
9226 tree left_id = EXPR_WFL_NODE (left);
9227 tree right_id = EXPR_WFL_NODE (right);
9230 merge = merge_qualified_name (left_id, right_id);
9232 /* Left wasn't qualified and is now qualified */
9233 if (!QUALIFIED_P (left_id))
9235 tree wfl = build_expr_wfl (left_id, ctxp->filename, 0, 0);
9236 EXPR_WFL_LINECOL (wfl) = EXPR_WFL_LINECOL (left);
9237 EXPR_WFL_QUALIFICATION (left) = build_tree_list (wfl, NULL_TREE);
9240 wfl = build_expr_wfl (right_id, ctxp->filename, 0, 0);
9241 EXPR_WFL_LINECOL (wfl) = location;
9242 chainon (EXPR_WFL_QUALIFICATION (left), build_tree_list (wfl, NULL_TREE));
9244 EXPR_WFL_NODE (left) = merge;
9249 /* Extract the last identifier component of the qualified in WFL. The
9250 last identifier is removed from the linked list */
9253 cut_identifier_in_qualified (tree wfl)
9256 tree previous = NULL_TREE;
9257 for (q = EXPR_WFL_QUALIFICATION (wfl); ; previous = q, q = TREE_CHAIN (q))
9258 if (!TREE_CHAIN (q))
9261 /* Operating on a non qualified qualified WFL. */
9264 TREE_CHAIN (previous) = NULL_TREE;
9265 return TREE_PURPOSE (q);
9269 /* Resolve the expression name NAME. Return its decl. */
9272 resolve_expression_name (tree id, tree *orig)
9274 tree name = EXPR_WFL_NODE (id);
9277 /* 6.5.5.1: Simple expression names */
9278 if (!PRIMARY_P (id) && !QUALIFIED_P (name))
9280 /* 15.13.1: NAME can appear within the scope of a local variable
9282 if ((decl = IDENTIFIER_LOCAL_VALUE (name)))
9285 /* 15.13.1: NAME can appear within a class declaration */
9288 decl = lookup_field_wrapper (current_class, name);
9291 tree access = NULL_TREE;
9292 int fs = FIELD_STATIC (decl);
9294 /* If we're accessing an outer scope local alias, make
9295 sure we change the name of the field we're going to
9297 if (FIELD_LOCAL_ALIAS_USED (decl))
9298 name = DECL_NAME (decl);
9300 check_deprecation (id, decl);
9302 /* Instance variable (8.3.1.1) can't appear within
9303 static method, static initializer or initializer for
9304 a static variable. */
9305 if (!fs && METHOD_STATIC (current_function_decl))
9307 static_ref_err (id, name, current_class);
9308 return error_mark_node;
9310 /* Instance variables can't appear as an argument of
9311 an explicit constructor invocation */
9312 if (!fs && ctxp->explicit_constructor_p
9313 && !enclosing_context_p (DECL_CONTEXT (decl), current_class))
9316 (id, "Can't reference `%s' before the superclass constructor has been called", IDENTIFIER_POINTER (name));
9317 return error_mark_node;
9320 /* If we're processing an inner class and we're trying
9321 to access a field belonging to an outer class, build
9322 the access to the field */
9323 if (!fs && outer_field_access_p (current_class, decl))
9325 if (CLASS_STATIC (TYPE_NAME (current_class)))
9327 static_ref_err (id, DECL_NAME (decl), current_class);
9328 return error_mark_node;
9330 access = build_outer_field_access (id, decl);
9336 /* Otherwise build what it takes to access the field */
9337 access = build_field_ref ((fs ? NULL_TREE : current_this),
9338 DECL_CONTEXT (decl), name);
9340 access = maybe_build_class_init_for_field (decl, access);
9341 /* We may be asked to save the real field access node */
9344 /* Last check: can we access the field? */
9345 if (not_accessible_p (current_class, decl, NULL_TREE, 0))
9347 not_accessible_field_error (id, decl);
9348 return error_mark_node;
9350 /* And we return what we got */
9353 /* Fall down to error report on undefined variable */
9356 /* 6.5.5.2 Qualified Expression Names */
9361 qualify_ambiguous_name (id);
9362 /* 15.10.1 Field Access Using a Primary and/or Expression Name */
9363 /* 15.10.2: Accessing Superclass Members using super */
9364 return resolve_field_access (id, orig, NULL);
9367 /* We've got an error here */
9368 if (INNER_CLASS_TYPE_P (current_class))
9369 parse_error_context (id,
9370 "Local variable `%s' can't be accessed from within the inner class `%s' unless it is declared final",
9371 IDENTIFIER_POINTER (name),
9372 IDENTIFIER_POINTER (DECL_NAME
9373 (TYPE_NAME (current_class))));
9375 parse_error_context (id, "Undefined variable `%s'",
9376 IDENTIFIER_POINTER (name));
9378 return error_mark_node;
9382 static_ref_err (tree wfl, tree field_id, tree class_type)
9386 "Can't make a static reference to nonstatic variable `%s' in class `%s'",
9387 IDENTIFIER_POINTER (field_id),
9388 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (class_type))));
9391 /* 15.10.1 Field Access Using a Primary and/or Expression Name.
9392 We return something suitable to generate the field access. We also
9393 return the field decl in FIELD_DECL and its type in FIELD_TYPE. If
9394 recipient's address can be null. */
9397 resolve_field_access (tree qual_wfl, tree *field_decl, tree *field_type)
9401 tree decl = NULL_TREE, where_found, type_found;
9403 if (resolve_qualified_expression_name (qual_wfl, &decl,
9404 &where_found, &type_found))
9405 return error_mark_node;
9407 /* Resolve the LENGTH field of an array here */
9408 if (DECL_P (decl) && DECL_NAME (decl) == length_identifier_node
9409 && type_found && TYPE_ARRAY_P (type_found)
9410 && ! flag_emit_class_files && ! flag_emit_xref)
9412 tree length = build_java_array_length_access (where_found);
9415 /* In case we're dealing with a static array, we need to
9416 initialize its class before the array length can be fetched.
9417 It's also a good time to create a DECL_RTL for the field if
9418 none already exists, otherwise if the field was declared in a
9419 class found in an external file and hasn't been (and won't
9420 be) accessed for its value, none will be created. */
9421 if (TREE_CODE (where_found) == VAR_DECL && FIELD_STATIC (where_found))
9423 build_static_field_ref (where_found);
9424 field_ref = build_class_init (DECL_CONTEXT (where_found), field_ref);
9427 /* We might have been trying to resolve field.method(). In which
9428 case, the resolution is over and decl is the answer */
9429 else if (JDECL_P (decl) && IDENTIFIER_LOCAL_VALUE (DECL_NAME (decl)) == decl)
9431 else if (JDECL_P (decl))
9434 type_found = DECL_CONTEXT (decl);
9435 is_static = FIELD_STATIC (decl);
9436 field_ref = build_field_ref ((is_static && !flag_emit_xref?
9437 NULL_TREE : where_found),
9438 type_found, DECL_NAME (decl));
9439 if (field_ref == error_mark_node)
9440 return error_mark_node;
9442 field_ref = maybe_build_class_init_for_field (decl, field_ref);
9444 /* If we're looking at a static field, we may need to generate a
9445 class initialization for it. This can happen when the access
9446 looks like `field.ref', where `field' is a static field in an
9447 interface we implement. */
9448 if (!flag_emit_class_files
9450 && TREE_CODE (where_found) == VAR_DECL
9451 && FIELD_STATIC (where_found))
9453 build_static_field_ref (where_found);
9454 field_ref = build_class_init (DECL_CONTEXT (where_found), field_ref);
9463 *field_type = (QUAL_DECL_TYPE (decl) ?
9464 QUAL_DECL_TYPE (decl) : TREE_TYPE (decl));
9468 /* If NODE is an access to f static field, strip out the class
9469 initialization part and return the field decl, otherwise, return
9473 strip_out_static_field_access_decl (tree node)
9475 if (TREE_CODE (node) == COMPOUND_EXPR)
9477 tree op1 = TREE_OPERAND (node, 1);
9478 if (TREE_CODE (op1) == COMPOUND_EXPR)
9480 tree call = TREE_OPERAND (op1, 0);
9481 if (TREE_CODE (call) == CALL_EXPR
9482 && TREE_CODE (TREE_OPERAND (call, 0)) == ADDR_EXPR
9483 && TREE_OPERAND (TREE_OPERAND (call, 0), 0)
9484 == soft_initclass_node)
9485 return TREE_OPERAND (op1, 1);
9487 else if (JDECL_P (op1))
9493 /* 6.5.5.2: Qualified Expression Names */
9496 resolve_qualified_expression_name (tree wfl, tree *found_decl,
9497 tree *where_found, tree *type_found)
9499 int from_type = 0; /* Field search initiated from a type */
9500 int from_super = 0, from_cast = 0, from_qualified_this = 0;
9501 int previous_call_static = 0;
9503 tree decl = NULL_TREE, type = NULL_TREE, q;
9504 /* For certain for of inner class instantiation */
9505 tree saved_current, saved_this;
9506 #define RESTORE_THIS_AND_CURRENT_CLASS \
9507 { current_class = saved_current; current_this = saved_this;}
9509 *type_found = *where_found = NULL_TREE;
9511 for (q = EXPR_WFL_QUALIFICATION (wfl); q; q = TREE_CHAIN (q))
9513 tree qual_wfl = QUAL_WFL (q);
9514 tree ret_decl; /* for EH checking */
9515 int location; /* for EH checking */
9517 /* 15.10.1 Field Access Using a Primary */
9518 switch (TREE_CODE (qual_wfl))
9521 case NEW_CLASS_EXPR:
9522 /* If the access to the function call is a non static field,
9523 build the code to access it. */
9524 if (JDECL_P (decl) && !FIELD_STATIC (decl))
9526 decl = maybe_access_field (decl, *where_found,
9527 DECL_CONTEXT (decl));
9528 if (decl == error_mark_node)
9532 /* And code for the function call */
9533 if (complete_function_arguments (qual_wfl))
9536 /* We might have to setup a new current class and a new this
9537 for the search of an inner class, relative to the type of
9538 a expression resolved as `decl'. The current values are
9539 saved and restored shortly after */
9540 saved_current = current_class;
9541 saved_this = current_this;
9543 && (TREE_CODE (qual_wfl) == NEW_CLASS_EXPR
9544 || from_qualified_this))
9546 /* If we still have `from_qualified_this', we have the form
9547 <T>.this.f() and we need to build <T>.this */
9548 if (from_qualified_this)
9550 decl = build_access_to_thisn (current_class, type, 0);
9551 decl = java_complete_tree (decl);
9552 type = TREE_TYPE (TREE_TYPE (decl));
9554 current_class = type;
9555 current_this = decl;
9556 from_qualified_this = 0;
9559 if (from_super && TREE_CODE (qual_wfl) == CALL_EXPR)
9560 CALL_USING_SUPER (qual_wfl) = 1;
9561 location = (TREE_CODE (qual_wfl) == CALL_EXPR ?
9562 EXPR_WFL_LINECOL (TREE_OPERAND (qual_wfl, 0)) : 0);
9563 *where_found = patch_method_invocation (qual_wfl, decl, type,
9565 &is_static, &ret_decl);
9567 if (*where_found == error_mark_node)
9569 RESTORE_THIS_AND_CURRENT_CLASS;
9572 *type_found = type = QUAL_DECL_TYPE (*where_found);
9574 *where_found = force_evaluation_order (*where_found);
9576 /* If we're creating an inner class instance, check for that
9577 an enclosing instance is in scope */
9578 if (TREE_CODE (qual_wfl) == NEW_CLASS_EXPR
9579 && INNER_ENCLOSING_SCOPE_CHECK (type))
9582 (qual_wfl, "No enclosing instance for inner class `%s' is in scope%s",
9583 lang_printable_name (type, 0),
9584 (!current_this ? "" :
9585 "; an explicit one must be provided when creating this inner class"));
9586 RESTORE_THIS_AND_CURRENT_CLASS;
9590 /* In case we had to change then to resolve a inner class
9591 instantiation using a primary qualified by a `new' */
9592 RESTORE_THIS_AND_CURRENT_CLASS;
9596 tree arguments = NULL_TREE;
9597 if (TREE_CODE (qual_wfl) == CALL_EXPR
9598 && TREE_OPERAND (qual_wfl, 1) != NULL_TREE)
9599 arguments = TREE_VALUE (TREE_OPERAND (qual_wfl, 1));
9600 check_thrown_exceptions (location, ret_decl, arguments);
9603 /* If the previous call was static and this one is too,
9604 build a compound expression to hold the two (because in
9605 that case, previous function calls aren't transported as
9606 forcoming function's argument. */
9607 if (previous_call_static && is_static)
9609 decl = build2 (COMPOUND_EXPR, TREE_TYPE (*where_found),
9610 decl, *where_found);
9611 TREE_SIDE_EFFECTS (decl) = 1;
9615 previous_call_static = is_static;
9616 decl = *where_found;
9621 case NEW_ARRAY_EXPR:
9622 case NEW_ANONYMOUS_ARRAY_EXPR:
9623 *where_found = decl = java_complete_tree (qual_wfl);
9624 if (decl == error_mark_node)
9626 *type_found = type = QUAL_DECL_TYPE (decl);
9630 *where_found = decl = java_complete_tree (qual_wfl);
9631 if (decl == error_mark_node)
9633 *type_found = type = QUAL_DECL_TYPE (decl);
9637 case CONDITIONAL_EXPR:
9640 *where_found = decl = java_complete_tree (qual_wfl);
9641 if (decl == error_mark_node)
9643 *type_found = type = QUAL_DECL_TYPE (decl);
9647 /* If the access to the function call is a non static field,
9648 build the code to access it. */
9649 if (JDECL_P (decl) && !FIELD_STATIC (decl))
9651 decl = maybe_access_field (decl, *where_found, type);
9652 if (decl == error_mark_node)
9655 /* And code for the array reference expression */
9656 decl = java_complete_tree (qual_wfl);
9657 if (decl == error_mark_node)
9659 type = QUAL_DECL_TYPE (decl);
9663 if ((decl = java_complete_tree (qual_wfl)) == error_mark_node)
9665 if ((type = patch_string (decl)))
9667 *where_found = QUAL_RESOLUTION (q) = decl;
9668 *type_found = type = TREE_TYPE (decl);
9672 if ((decl = java_complete_tree (qual_wfl)) == error_mark_node)
9674 *where_found = QUAL_RESOLUTION (q) = decl;
9675 *type_found = type = TREE_TYPE (decl);
9679 /* Fix for -Wall Just go to the next statement. Don't
9684 /* If we fall here, we weren't processing a (static) function call. */
9685 previous_call_static = 0;
9687 /* It can be the keyword THIS */
9688 if (TREE_CODE (qual_wfl) == EXPR_WITH_FILE_LOCATION
9689 && EXPR_WFL_NODE (qual_wfl) == this_identifier_node)
9694 (wfl, "Keyword `this' used outside allowed context");
9697 if (ctxp->explicit_constructor_p
9698 && type == current_class)
9700 parse_error_context (wfl, "Can't reference `this' before the superclass constructor has been called");
9703 /* We have to generate code for intermediate access */
9704 if (!from_type || TREE_TYPE (TREE_TYPE (current_this)) == type)
9706 *where_found = decl = current_this;
9707 *type_found = type = QUAL_DECL_TYPE (decl);
9709 /* We're trying to access the this from somewhere else. Make sure
9710 it's allowed before doing so. */
9713 if (!enclosing_context_p (type, current_class))
9715 char *p = xstrdup (lang_printable_name (type, 0));
9716 parse_error_context (qual_wfl, "Can't use variable `%s.this': type `%s' isn't an outer type of type `%s'",
9718 lang_printable_name (current_class, 0));
9722 from_qualified_this = 1;
9723 /* If there's nothing else after that, we need to
9724 produce something now, otherwise, the section of the
9725 code that needs to produce <T>.this will generate
9726 what is necessary. */
9727 if (!TREE_CHAIN (q))
9729 decl = build_access_to_thisn (current_class, type, 0);
9730 *where_found = decl = java_complete_tree (decl);
9731 *type_found = type = TREE_TYPE (decl);
9739 /* 15.10.2 Accessing Superclass Members using SUPER */
9740 if (TREE_CODE (qual_wfl) == EXPR_WITH_FILE_LOCATION
9741 && EXPR_WFL_NODE (qual_wfl) == super_identifier_node)
9744 /* Check on the restricted use of SUPER */
9745 if (METHOD_STATIC (current_function_decl)
9746 || current_class == object_type_node)
9749 (wfl, "Keyword `super' used outside allowed context");
9752 /* Otherwise, treat SUPER as (SUPER_CLASS)THIS */
9753 node = build_cast (EXPR_WFL_LINECOL (qual_wfl),
9754 CLASSTYPE_SUPER (current_class),
9755 build_this (EXPR_WFL_LINECOL (qual_wfl)));
9756 *where_found = decl = java_complete_tree (node);
9757 if (decl == error_mark_node)
9759 *type_found = type = QUAL_DECL_TYPE (decl);
9760 from_super = from_type = 1;
9764 /* 15.13.1: Can't search for field name in packages, so we
9765 assume a variable/class name was meant. */
9766 if (RESOLVE_PACKAGE_NAME_P (qual_wfl))
9769 if ((decl = resolve_package (wfl, &q, &name)))
9772 *where_found = decl;
9774 check_pkg_class_access (DECL_NAME (decl), qual_wfl, true, NULL);
9776 /* We want to be absolutely sure that the class is laid
9777 out. We're going to search something inside it. */
9778 *type_found = type = TREE_TYPE (decl);
9779 layout_class (type);
9782 /* Fix them all the way down, if any are left. */
9785 list = TREE_CHAIN (q);
9788 RESOLVE_PACKAGE_NAME_P (QUAL_WFL (list)) = 0;
9789 list = TREE_CHAIN (list);
9795 if (from_super || from_cast)
9797 ((from_cast ? qual_wfl : wfl),
9798 "No variable `%s' defined in class `%s'",
9799 IDENTIFIER_POINTER (EXPR_WFL_NODE (qual_wfl)),
9800 lang_printable_name (type, 0));
9803 (qual_wfl, "Undefined variable or class name: `%s'",
9804 IDENTIFIER_POINTER (name));
9809 /* We have a type name. It's been already resolved when the
9810 expression was qualified. */
9811 else if (RESOLVE_TYPE_NAME_P (qual_wfl) && QUAL_RESOLUTION (q))
9813 decl = QUAL_RESOLUTION (q);
9815 /* Sneak preview. If next we see a `new', we're facing a
9816 qualification which resulted in a type being selected
9817 instead of a field. Report the error. */
9819 && TREE_CODE (TREE_PURPOSE (TREE_CHAIN (q))) == NEW_CLASS_EXPR)
9821 parse_error_context (qual_wfl, "Undefined variable `%s'",
9822 IDENTIFIER_POINTER (EXPR_WFL_NODE (wfl)));
9826 check_pkg_class_access (DECL_NAME (decl), qual_wfl, true, NULL);
9828 check_deprecation (qual_wfl, decl);
9830 type = TREE_TYPE (decl);
9833 /* We resolve an expression name */
9836 tree field_decl = NULL_TREE;
9838 /* If there exists an early resolution, use it. That occurs
9839 only once and we know that there are more things to
9840 come. Don't do that when processing something after SUPER
9841 (we need more thing to be put in place below */
9842 if (!from_super && QUAL_RESOLUTION (q))
9844 decl = QUAL_RESOLUTION (q);
9847 if (TREE_CODE (decl) == FIELD_DECL && !FIELD_STATIC (decl))
9850 *where_found = current_this;
9853 static_ref_err (qual_wfl, DECL_NAME (decl),
9857 if (outer_field_access_p (current_class, decl))
9858 decl = build_outer_field_access (qual_wfl, decl);
9862 *where_found = TREE_TYPE (decl);
9863 if (TREE_CODE (*where_found) == POINTER_TYPE)
9864 *where_found = TREE_TYPE (*where_found);
9869 /* Report and error if we're using a numerical literal as a
9870 qualifier. It can only be an INTEGER_CST. */
9871 else if (TREE_CODE (qual_wfl) == INTEGER_CST)
9874 (wfl, "Can't use type `%s' as a qualifier",
9875 lang_printable_name (TREE_TYPE (qual_wfl), 0));
9879 /* We have to search for a field, knowing the type of its
9880 container. The flag FROM_TYPE indicates that we resolved
9881 the last member of the expression as a type name, which
9882 means that for the resolution of this field, we'll look
9883 for other errors than if it was resolved as a member of
9888 tree field_decl_type; /* For layout */
9890 if (!from_type && !JREFERENCE_TYPE_P (type))
9893 (qual_wfl, "Attempt to reference field `%s' in `%s %s'",
9894 IDENTIFIER_POINTER (EXPR_WFL_NODE (qual_wfl)),
9895 lang_printable_name (type, 0),
9896 IDENTIFIER_POINTER (DECL_NAME (decl)));
9900 field_decl = lookup_field_wrapper (type,
9901 EXPR_WFL_NODE (qual_wfl));
9903 /* Maybe what we're trying to access to is an inner
9904 class, only if decl is a TYPE_DECL. */
9905 if (!field_decl && TREE_CODE (decl) == TYPE_DECL)
9907 tree ptr, inner_decl;
9909 BUILD_PTR_FROM_NAME (ptr, EXPR_WFL_NODE (qual_wfl));
9910 inner_decl = resolve_class (decl, ptr, NULL_TREE, qual_wfl);
9913 check_inner_class_access (inner_decl, decl, qual_wfl);
9914 type = TREE_TYPE (inner_decl);
9921 if (field_decl == NULL_TREE)
9924 (qual_wfl, "No variable `%s' defined in type `%s'",
9925 IDENTIFIER_POINTER (EXPR_WFL_NODE (qual_wfl)),
9926 GET_TYPE_NAME (type));
9929 if (field_decl == error_mark_node)
9932 /* Layout the type of field_decl, since we may need
9933 it. Don't do primitive types or loaded classes. The
9934 situation of non primitive arrays may not handled
9935 properly here. FIXME */
9936 if (TREE_CODE (TREE_TYPE (field_decl)) == POINTER_TYPE)
9937 field_decl_type = TREE_TYPE (TREE_TYPE (field_decl));
9939 field_decl_type = TREE_TYPE (field_decl);
9940 if (!JPRIMITIVE_TYPE_P (field_decl_type)
9941 && !CLASS_LOADED_P (field_decl_type)
9942 && !TYPE_ARRAY_P (field_decl_type))
9943 resolve_and_layout (field_decl_type, NULL_TREE);
9945 /* Check on accessibility here */
9946 if (not_accessible_p (current_class, field_decl,
9947 *type_found, from_super))
9948 return not_accessible_field_error (qual_wfl,field_decl);
9949 check_deprecation (qual_wfl, field_decl);
9951 /* There are things to check when fields are accessed
9952 from type. There are no restrictions on a static
9953 declaration of the field when it is accessed from an
9955 is_static = FIELD_STATIC (field_decl);
9956 if (!from_super && from_type
9957 && !TYPE_INTERFACE_P (type)
9959 && (current_function_decl
9960 && METHOD_STATIC (current_function_decl)))
9962 static_ref_err (qual_wfl, EXPR_WFL_NODE (qual_wfl), type);
9965 from_cast = from_super = 0;
9967 /* It's an access from a type but it isn't static, we
9968 make it relative to `this'. */
9969 if (!is_static && from_type)
9970 decl = current_this;
9972 /* If we need to generate something to get a proper
9973 handle on what this field is accessed from, do it
9977 decl = maybe_access_field (decl, *where_found, *type_found);
9978 if (decl == error_mark_node)
9982 /* We want to keep the location were found it, and the type
9984 *where_found = decl;
9987 /* Generate the correct expression for field access from
9989 if (from_qualified_this)
9991 field_decl = build_outer_field_access (qual_wfl, field_decl);
9992 from_qualified_this = 0;
9995 /* This is the decl found and eventually the next one to
10000 type = QUAL_DECL_TYPE (decl);
10002 /* Sneak preview. If decl is qualified by a `new', report
10003 the error here to be accurate on the peculiar construct */
10005 && TREE_CODE (TREE_PURPOSE (TREE_CHAIN (q))) == NEW_CLASS_EXPR
10006 && !JREFERENCE_TYPE_P (type))
10008 parse_error_context (qual_wfl, "Attempt to reference field `new' in a `%s'",
10009 lang_printable_name (type, 0));
10013 /* `q' might have changed due to a after package resolution
10014 re-qualification */
10018 *found_decl = decl;
10022 /* 6.6 Qualified name and access control. Returns 1 if MEMBER (a decl)
10023 can't be accessed from REFERENCE (a record type). If MEMBER
10024 features a protected access, we then use WHERE which, if non null,
10025 holds the type of MEMBER's access that is checked against
10026 6.6.2.1. This function should be used when decl is a field or a
10030 not_accessible_p (tree reference, tree member, tree where, int from_super)
10032 int access_flag = get_access_flags_from_decl (member);
10033 bool is_static = false;
10035 if (TREE_CODE (member) == FIELD_DECL ||
10036 TREE_CODE (member) == VAR_DECL)
10037 is_static = FIELD_STATIC (member);
10039 is_static = METHOD_STATIC (member);
10041 /* Access always granted for members declared public */
10042 if (access_flag & ACC_PUBLIC)
10045 /* Check access on protected members */
10046 if (access_flag & ACC_PROTECTED)
10048 /* Access granted if it occurs from within the package
10049 containing the class in which the protected member is
10051 if (class_in_current_package (DECL_CONTEXT (member)))
10054 /* If accessed with the form `super.member', then access is granted */
10058 /* If WHERE is active, access was made through a qualifier. For
10059 non-static members, access is granted if the type of the qualifier
10060 is or is a sublass of the type the access is made from (6.6.2.1.) */
10061 if (where && !is_static)
10065 if (inherits_from_p (where, reference))
10067 if (PURE_INNER_CLASS_TYPE_P (reference))
10068 reference = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (reference)));
10075 /* Otherwise, access is granted if occurring from within the class
10076 where member is declared, or a subclass of it. */
10079 if (inherits_from_p (reference, DECL_CONTEXT (member)))
10081 if (PURE_INNER_CLASS_TYPE_P (reference))
10082 reference = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (reference)));
10089 /* Check access on private members. Access is granted only if it
10090 occurs from within the class in which it is declared -- that does
10091 it for innerclasses too. */
10092 if (access_flag & ACC_PRIVATE)
10094 if (reference == DECL_CONTEXT (member) ||
10095 common_enclosing_context_p (DECL_CONTEXT (member), reference))
10100 /* Default access is permitted only when occurring from within the
10101 package in which the context (MEMBER) is declared. */
10102 return !class_in_current_package (DECL_CONTEXT (member));
10105 /* Test deprecated decl access. */
10107 check_deprecation (tree wfl, tree decl)
10112 if (! warn_deprecated)
10115 /* We want to look at the element type of arrays here, so we strip
10116 all surrounding array types. */
10117 if (TYPE_ARRAY_P (TREE_TYPE (decl)))
10119 elt = TREE_TYPE (decl);
10120 while (TYPE_ARRAY_P (elt))
10121 elt = TYPE_ARRAY_ELEMENT (elt);
10122 /* We'll end up with a pointer type, so we use TREE_TYPE to go
10124 decl = TYPE_NAME (TREE_TYPE (elt));
10126 file = DECL_SOURCE_FILE (decl);
10128 /* Complain if the field is deprecated and the file it was defined
10129 in isn't compiled at the same time the file which contains its
10131 if (DECL_DEPRECATED (decl)
10132 && !IS_A_COMMAND_LINE_FILENAME_P (get_identifier (file)))
10135 switch (TREE_CODE (decl))
10137 case FUNCTION_DECL:
10145 parse_warning_context (wfl, "The class `%s' has been deprecated",
10146 IDENTIFIER_POINTER (DECL_NAME (decl)));
10151 /* Don't issue a message if the context as been deprecated as a
10153 if (! CLASS_DEPRECATED (TYPE_NAME (DECL_CONTEXT (decl))))
10154 parse_warning_context
10155 (wfl, "The %s `%s' in class `%s' has been deprecated",
10156 the, lang_printable_name (decl, 0),
10157 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (DECL_CONTEXT (decl)))));
10161 /* Returns 1 if class was declared in the current package, 0 otherwise */
10163 static GTY(()) tree cicp_cache;
10165 class_in_current_package (tree class)
10167 int qualified_flag;
10170 if (cicp_cache == class)
10173 qualified_flag = QUALIFIED_P (DECL_NAME (TYPE_NAME (class)));
10175 /* If the current package is empty and the name of CLASS is
10176 qualified, class isn't in the current package. If there is a
10177 current package and the name of the CLASS is not qualified, class
10178 isn't in the current package */
10179 if ((!ctxp->package && qualified_flag) || (ctxp->package && !qualified_flag))
10182 /* If there is not package and the name of CLASS isn't qualified,
10183 they belong to the same unnamed package */
10184 if (!ctxp->package && !qualified_flag)
10187 /* Compare the left part of the name of CLASS with the package name */
10188 split_qualified_name (&left, NULL, DECL_NAME (TYPE_NAME (class)));
10189 if (ctxp->package == left)
10191 cicp_cache = class;
10197 /* This function may generate code to access DECL from WHERE. This is
10198 done only if certain conditions meet. */
10201 maybe_access_field (tree decl, tree where, tree type)
10203 if (TREE_CODE (decl) == FIELD_DECL && decl != current_this
10204 && !FIELD_STATIC (decl))
10205 decl = build_field_ref (where ? where : current_this,
10206 (type ? type : DECL_CONTEXT (decl)),
10211 /* Build a method invocation, by patching PATCH. If non NULL
10212 and according to the situation, PRIMARY and WHERE may be
10213 used. IS_STATIC is set to 1 if the invoked function is static. */
10216 patch_method_invocation (tree patch, tree primary, tree where, int from_super,
10217 int *is_static, tree *ret_decl)
10219 tree wfl = TREE_OPERAND (patch, 0);
10220 tree args = TREE_OPERAND (patch, 1);
10221 tree name = EXPR_WFL_NODE (wfl);
10223 int is_static_flag = 0;
10224 int is_super_init = 0;
10225 tree this_arg = NULL_TREE;
10226 int is_array_clone_call = 0;
10228 /* Should be overridden if everything goes well. Otherwise, if
10229 something fails, it should keep this value. It stop the
10230 evaluation of a bogus assignment. See java_complete_tree,
10231 MODIFY_EXPR: for the reasons why we sometimes want to keep on
10232 evaluating an assignment */
10233 TREE_TYPE (patch) = error_mark_node;
10235 /* Since lookup functions are messing with line numbers, save the
10237 java_parser_context_save_global ();
10239 /* 15.11.1: Compile-Time Step 1: Determine Class or Interface to Search */
10241 /* Resolution of qualified name, excluding constructors */
10242 if (QUALIFIED_P (name) && !CALL_CONSTRUCTOR_P (patch))
10244 tree identifier, identifier_wfl, type, resolved;
10245 /* Extract the last IDENTIFIER of the qualified
10246 expression. This is a wfl and we will use it's location
10247 data during error report. */
10248 identifier_wfl = cut_identifier_in_qualified (wfl);
10249 identifier = EXPR_WFL_NODE (identifier_wfl);
10251 /* Given the context, IDENTIFIER is syntactically qualified
10252 as a MethodName. We need to qualify what's before */
10253 qualify_ambiguous_name (wfl);
10254 resolved = resolve_field_access (wfl, NULL, NULL);
10256 if (TREE_CODE (resolved) == VAR_DECL && FIELD_STATIC (resolved)
10257 && FIELD_FINAL (resolved)
10258 && !inherits_from_p (DECL_CONTEXT (resolved), current_class)
10259 && !flag_emit_class_files && !flag_emit_xref)
10260 resolved = build_class_init (DECL_CONTEXT (resolved), resolved);
10262 if (resolved == error_mark_node)
10263 PATCH_METHOD_RETURN_ERROR ();
10265 type = GET_SKIP_TYPE (resolved);
10266 resolve_and_layout (type, NULL_TREE);
10268 if (JPRIMITIVE_TYPE_P (type))
10270 parse_error_context
10272 "Can't invoke a method on primitive type `%s'",
10273 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type))));
10274 PATCH_METHOD_RETURN_ERROR ();
10277 list = lookup_method_invoke (0, identifier_wfl, type, identifier, args);
10278 args = nreverse (args);
10280 /* We're resolving a call from a type */
10281 if (TREE_CODE (resolved) == TYPE_DECL)
10283 if (CLASS_INTERFACE (resolved))
10285 parse_error_context
10287 "Can't make static reference to method `%s' in interface `%s'",
10288 IDENTIFIER_POINTER (identifier),
10289 IDENTIFIER_POINTER (name));
10290 PATCH_METHOD_RETURN_ERROR ();
10292 if (list && !METHOD_STATIC (list))
10294 char *fct_name = xstrdup (lang_printable_name (list, 2));
10295 parse_error_context
10297 "Can't make static reference to method `%s %s' in class `%s'",
10298 lang_printable_name (TREE_TYPE (TREE_TYPE (list)), 0),
10299 fct_name, IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type))));
10301 PATCH_METHOD_RETURN_ERROR ();
10305 this_arg = primary = resolved;
10307 if (TYPE_ARRAY_P (type) && identifier == get_identifier ("clone"))
10308 is_array_clone_call = 1;
10310 /* IDENTIFIER_WFL will be used to report any problem further */
10311 wfl = identifier_wfl;
10313 /* Resolution of simple names, names generated after a primary: or
10317 tree class_to_search = NULL_TREE;
10318 int lc; /* Looking for Constructor */
10320 /* We search constructor in their target class */
10321 if (CALL_CONSTRUCTOR_P (patch))
10323 if (TREE_CODE (patch) == NEW_CLASS_EXPR)
10324 class_to_search = EXPR_WFL_NODE (wfl);
10325 else if (EXPR_WFL_NODE (TREE_OPERAND (patch, 0)) ==
10326 this_identifier_node)
10327 class_to_search = NULL_TREE;
10328 else if (EXPR_WFL_NODE (TREE_OPERAND (patch, 0)) ==
10329 super_identifier_node)
10332 if (CLASSTYPE_SUPER (current_class))
10334 DECL_NAME (TYPE_NAME (CLASSTYPE_SUPER (current_class)));
10337 parse_error_context (wfl, "Can't invoke super constructor on java.lang.Object");
10338 PATCH_METHOD_RETURN_ERROR ();
10342 /* Class to search is NULL if we're searching the current one */
10343 if (class_to_search)
10345 class_to_search = resolve_and_layout (class_to_search, wfl);
10347 if (!class_to_search)
10349 parse_error_context
10350 (wfl, "Class `%s' not found in type declaration",
10351 IDENTIFIER_POINTER (EXPR_WFL_NODE (wfl)));
10352 PATCH_METHOD_RETURN_ERROR ();
10355 /* Can't instantiate an abstract class, but we can
10356 invoke it's constructor. It's use within the `new'
10357 context is denied here. */
10358 if (CLASS_ABSTRACT (class_to_search)
10359 && TREE_CODE (patch) == NEW_CLASS_EXPR)
10361 parse_error_context
10362 (wfl, "Class `%s' is an abstract class. It can't be instantiated",
10363 IDENTIFIER_POINTER (EXPR_WFL_NODE (wfl)));
10364 PATCH_METHOD_RETURN_ERROR ();
10367 class_to_search = TREE_TYPE (class_to_search);
10370 class_to_search = current_class;
10373 /* This is a regular search in the local class, unless an
10374 alternate class is specified. */
10377 if (where != NULL_TREE)
10378 class_to_search = where;
10379 else if (QUALIFIED_P (name))
10380 class_to_search = current_class;
10383 class_to_search = current_class;
10387 if (has_method (class_to_search, name))
10389 if (! INNER_CLASS_TYPE_P (class_to_search))
10391 parse_error_context (wfl,
10392 "No method named `%s' in scope",
10393 IDENTIFIER_POINTER (name));
10394 PATCH_METHOD_RETURN_ERROR ();
10397 = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (class_to_search)));
10403 /* NAME is a simple identifier or comes from a primary. Search
10404 in the class whose declaration contain the method being
10406 resolve_and_layout (class_to_search, NULL_TREE);
10408 list = lookup_method_invoke (lc, wfl, class_to_search, name, args);
10409 /* Don't continue if no method were found, as the next statement
10410 can't be executed then. */
10412 PATCH_METHOD_RETURN_ERROR ();
10414 if (TYPE_ARRAY_P (class_to_search)
10415 && DECL_NAME (list) == get_identifier ("clone"))
10416 is_array_clone_call = 1;
10418 /* Check for static reference if non static methods */
10419 if (check_for_static_method_reference (wfl, patch, list,
10420 class_to_search, primary))
10421 PATCH_METHOD_RETURN_ERROR ();
10423 /* Check for inner classes creation from illegal contexts */
10424 if (lc && (INNER_CLASS_TYPE_P (class_to_search)
10425 && !CLASS_STATIC (TYPE_NAME (class_to_search)))
10426 && INNER_ENCLOSING_SCOPE_CHECK (class_to_search)
10427 && !DECL_INIT_P (current_function_decl))
10429 parse_error_context
10430 (wfl, "No enclosing instance for inner class `%s' is in scope%s",
10431 lang_printable_name (class_to_search, 0),
10432 (!current_this ? "" :
10433 "; an explicit one must be provided when creating this inner class"));
10434 PATCH_METHOD_RETURN_ERROR ();
10437 /* Non static methods are called with the current object extra
10438 argument. If patch a `new TYPE()', the argument is the value
10439 returned by the object allocator. If method is resolved as a
10440 primary, use the primary otherwise use the current THIS. */
10441 args = nreverse (args);
10442 if (TREE_CODE (patch) != NEW_CLASS_EXPR)
10444 this_arg = primary ? primary : current_this;
10446 /* If we're using an access method, things are different.
10447 There are two family of cases:
10449 1) We're not generating bytecodes:
10451 - LIST is non static. It's invocation is transformed from
10452 x(a1,...,an) into this$<n>.x(a1,....an).
10453 - LIST is static. It's invocation is transformed from
10454 x(a1,...,an) into TYPE_OF(this$<n>).x(a1,....an)
10456 2) We're generating bytecodes:
10458 - LIST is non static. It's invocation is transformed from
10459 x(a1,....,an) into access$<n>(this$<n>,a1,...,an).
10460 - LIST is static. It's invocation is transformed from
10461 x(a1,....,an) into TYPE_OF(this$<n>).x(a1,....an).
10463 Of course, this$<n> can be arbitrarily complex, ranging from
10464 this$0 (the immediate outer context) to
10465 access$0(access$0(...(this$0))).
10467 maybe_use_access_method returns a nonzero value if the
10468 this_arg has to be moved into the (then generated) stub
10469 argument list. In the meantime, the selected function
10470 might have be replaced by a generated stub. */
10472 maybe_use_access_method (is_super_init, &list, &this_arg))
10474 args = tree_cons (NULL_TREE, this_arg, args);
10475 this_arg = NULL_TREE; /* So it doesn't get chained twice */
10480 /* Merge point of all resolution schemes. If we have nothing, this
10481 is an error, already signaled */
10483 PATCH_METHOD_RETURN_ERROR ();
10485 /* Check accessibility, position the is_static flag, build and
10487 if (not_accessible_p (DECL_CONTEXT (current_function_decl), list,
10488 (primary ? TREE_TYPE (TREE_TYPE (primary)) :
10489 NULL_TREE), from_super)
10490 /* Calls to clone() on array types are permitted as a special-case. */
10491 && !is_array_clone_call)
10493 const char *const fct_name = IDENTIFIER_POINTER (DECL_NAME (list));
10494 const char *const access =
10495 accessibility_string (get_access_flags_from_decl (list));
10496 const char *const klass =
10497 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (DECL_CONTEXT (list))));
10498 const char *const refklass =
10499 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (current_class)));
10500 const char *const what = (DECL_CONSTRUCTOR_P (list)
10501 ? "constructor" : "method");
10502 parse_error_context (wfl,
10503 "Can't access %s %s `%s.%s' from `%s'",
10504 access, what, klass, fct_name, refklass);
10505 PATCH_METHOD_RETURN_ERROR ();
10508 /* Deprecation check: check whether the method being invoked or the
10509 instance-being-created's type are deprecated. */
10510 if (TREE_CODE (patch) == NEW_CLASS_EXPR)
10511 check_deprecation (wfl, TYPE_NAME (DECL_CONTEXT (list)));
10512 check_deprecation (wfl, list);
10514 /* If invoking a innerclass constructor, there are hidden parameters
10516 if (TREE_CODE (patch) == NEW_CLASS_EXPR
10517 && PURE_INNER_CLASS_TYPE_P (DECL_CONTEXT (list)))
10519 /* And make sure we add the accessed local variables to be saved
10520 in field aliases. */
10521 args = build_alias_initializer_parameter_list
10522 (AIPL_FUNCTION_CTOR_INVOCATION, DECL_CONTEXT (list), args, NULL);
10524 /* Secretly pass the current_this/primary as a second argument */
10525 if (primary || current_this)
10528 tree this_type = (current_this ?
10529 TREE_TYPE (TREE_TYPE (current_this)) : NULL_TREE);
10530 /* Method's (list) enclosing context */
10531 tree mec = DECL_CONTEXT (TYPE_NAME (DECL_CONTEXT (list)));
10532 /* If we have a primary, use it. */
10534 extra_arg = primary;
10535 /* The current `this' is an inner class but isn't a direct
10536 enclosing context for the inner class we're trying to
10537 create. Build an access to the proper enclosing context
10539 else if (current_this && PURE_INNER_CLASS_TYPE_P (this_type)
10540 && this_type != TREE_TYPE (mec))
10543 extra_arg = build_access_to_thisn (current_class,
10544 TREE_TYPE (mec), 0);
10545 extra_arg = java_complete_tree (extra_arg);
10547 /* Otherwise, just use the current `this' as an enclosing
10550 extra_arg = current_this;
10551 args = tree_cons (NULL_TREE, extra_arg, args);
10554 args = tree_cons (NULL_TREE, integer_zero_node, args);
10557 /* This handles the situation where a constructor invocation needs
10558 to have an enclosing context passed as a second parameter (the
10559 constructor is one of an inner class). */
10560 if ((is_super_init ||
10561 (TREE_CODE (patch) == CALL_EXPR && name == this_identifier_node))
10562 && PURE_INNER_CLASS_TYPE_P (DECL_CONTEXT (list)))
10564 tree dest = TYPE_NAME (DECL_CONTEXT (list));
10566 build_access_to_thisn (current_class, DECL_CONTEXT (dest), 0);
10567 extra_arg = java_complete_tree (extra_arg);
10568 args = tree_cons (NULL_TREE, extra_arg, args);
10571 is_static_flag = METHOD_STATIC (list);
10572 if (! is_static_flag && this_arg != NULL_TREE)
10573 args = tree_cons (NULL_TREE, this_arg, args);
10575 /* In the context of an explicit constructor invocation, we can't
10576 invoke any method relying on `this'. Exceptions are: we're
10577 invoking a static function, primary exists and is not the current
10578 this, we're creating a new object. */
10579 if (ctxp->explicit_constructor_p
10581 && (!primary || primary == current_this)
10582 && (TREE_CODE (patch) != NEW_CLASS_EXPR))
10584 parse_error_context (wfl, "Can't reference `this' before the superclass constructor has been called");
10585 PATCH_METHOD_RETURN_ERROR ();
10587 java_parser_context_restore_global ();
10589 *is_static = is_static_flag;
10590 /* Sometimes, we want the decl of the selected method. Such as for
10594 patch = patch_invoke (patch, list, args);
10596 /* Now is a good time to insert the call to finit$ */
10597 if (is_super_init && CLASS_HAS_FINIT_P (current_class))
10599 tree finit_parms, finit_call;
10601 /* Prepare to pass hidden parameters to finit$, if any. */
10602 finit_parms = build_alias_initializer_parameter_list
10603 (AIPL_FUNCTION_FINIT_INVOCATION, current_class, NULL_TREE, NULL);
10606 build_method_invocation (build_wfl_node (finit_identifier_node),
10609 /* Generate the code used to initialize fields declared with an
10610 initialization statement and build a compound statement along
10611 with the super constructor invocation. */
10612 CAN_COMPLETE_NORMALLY (patch) = 1;
10613 patch = build2 (COMPOUND_EXPR, void_type_node, patch,
10614 java_complete_tree (finit_call));
10619 /* Check that we're not trying to do a static reference to a method in
10620 non static method. Return 1 if it's the case, 0 otherwise. */
10623 check_for_static_method_reference (tree wfl, tree node, tree method,
10624 tree where, tree primary)
10626 if (METHOD_STATIC (current_function_decl)
10627 && !METHOD_STATIC (method) && !primary && !CALL_CONSTRUCTOR_P (node))
10629 char *fct_name = xstrdup (lang_printable_name (method, 0));
10630 parse_error_context
10631 (wfl, "Can't make static reference to method `%s %s' in class `%s'",
10632 lang_printable_name (TREE_TYPE (TREE_TYPE (method)), 0), fct_name,
10633 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (where))));
10640 /* Fix the invocation of *MDECL if necessary in the case of a
10641 invocation from an inner class. *THIS_ARG might be modified
10642 appropriately and an alternative access to *MDECL might be
10646 maybe_use_access_method (int is_super_init, tree *mdecl, tree *this_arg)
10649 tree md = *mdecl, ta = *this_arg;
10651 int non_static_context = !METHOD_STATIC (md);
10654 || DECL_CONTEXT (md) == current_class
10655 || !PURE_INNER_CLASS_TYPE_P (current_class)
10656 || DECL_FINIT_P (md)
10657 || DECL_INSTINIT_P (md))
10660 /* If we're calling a method found in an enclosing class, generate
10661 what it takes to retrieve the right this. Don't do that if we're
10662 invoking a static method. Note that if MD's type is unrelated to
10663 CURRENT_CLASS, then the current this can be used. */
10665 if (non_static_context && DECL_CONTEXT (md) != object_type_node)
10667 ctx = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (current_class)));
10668 if (inherits_from_p (ctx, DECL_CONTEXT (md)))
10670 ta = build_current_thisn (current_class);
10671 ta = build_wfl_node (ta);
10678 maybe_build_thisn_access_method (type);
10679 if (inherits_from_p (type, DECL_CONTEXT (md)))
10681 ta = build_access_to_thisn (ctx, type, 0);
10684 type = (DECL_CONTEXT (TYPE_NAME (type)) ?
10685 TREE_TYPE (DECL_CONTEXT (TYPE_NAME (type))) : NULL_TREE);
10688 ta = java_complete_tree (ta);
10691 /* We might have to use an access method to get to MD. We can
10692 break the method access rule as far as we're not generating
10694 if (METHOD_PRIVATE (md) && flag_emit_class_files)
10696 md = build_outer_method_access_method (md);
10703 /* Returning a nonzero value indicates we were doing a non static
10704 method invocation that is now a static invocation. It will have
10705 callee displace `this' to insert it in the regular argument
10707 return (non_static_context && to_return);
10710 /* Patch an invoke expression METHOD and ARGS, based on its invocation
10714 patch_invoke (tree patch, tree method, tree args)
10717 tree original_call, t, ta;
10718 tree check = NULL_TREE;
10720 /* Last step for args: convert build-in types. If we're dealing with
10721 a new TYPE() type call, the first argument to the constructor
10722 isn't found in the incoming argument list, but delivered by
10724 t = TYPE_ARG_TYPES (TREE_TYPE (method));
10725 if (TREE_CODE (patch) == NEW_CLASS_EXPR)
10726 t = TREE_CHAIN (t);
10727 for (ta = args; t != end_params_node && ta;
10728 t = TREE_CHAIN (t), ta = TREE_CHAIN (ta))
10729 if (JPRIMITIVE_TYPE_P (TREE_TYPE (TREE_VALUE (ta))) &&
10730 TREE_TYPE (TREE_VALUE (ta)) != TREE_VALUE (t))
10731 TREE_VALUE (ta) = convert (TREE_VALUE (t), TREE_VALUE (ta));
10733 /* Resolve unresolved returned type issues */
10734 t = TREE_TYPE (TREE_TYPE (method));
10735 if (TREE_CODE (t) == POINTER_TYPE && !CLASS_LOADED_P (TREE_TYPE (t)))
10736 resolve_and_layout (TREE_TYPE (t), NULL);
10738 if (flag_emit_class_files || flag_emit_xref)
10742 switch (invocation_mode (method, CALL_USING_SUPER (patch)))
10744 case INVOKE_VIRTUAL:
10745 dtable = invoke_build_dtable (0, args);
10746 func = build_invokevirtual (dtable, method);
10749 case INVOKE_NONVIRTUAL:
10750 /* If the object for the method call is null, we throw an
10751 exception. We don't do this if the object is the current
10752 method's `this'. In other cases we just rely on an
10753 optimization pass to eliminate redundant checks. */
10754 if (TREE_VALUE (args) != current_this)
10756 /* We use a save_expr here to make sure we only evaluate
10757 the new `self' expression once. */
10758 tree save_arg = save_expr (TREE_VALUE (args));
10759 TREE_VALUE (args) = save_arg;
10760 check = java_check_reference (save_arg, 1);
10762 /* Fall through. */
10765 case INVOKE_STATIC:
10767 tree signature = build_java_signature (TREE_TYPE (method));
10768 func = build_known_method_ref (method, TREE_TYPE (method),
10769 DECL_CONTEXT (method),
10774 case INVOKE_INTERFACE:
10775 dtable = invoke_build_dtable (1, args);
10776 func = build_invokeinterface (dtable, method);
10783 /* Ensure self_type is initialized, (invokestatic). FIXME */
10784 func = build1 (NOP_EXPR, build_pointer_type (TREE_TYPE (method)), func);
10787 TREE_TYPE (patch) = TREE_TYPE (TREE_TYPE (method));
10788 TREE_OPERAND (patch, 0) = func;
10789 TREE_OPERAND (patch, 1) = args;
10790 patch = check_for_builtin (method, patch);
10791 original_call = patch;
10793 /* We're processing a `new TYPE ()' form. New is called and its
10794 returned value is the first argument to the constructor. We build
10795 a COMPOUND_EXPR and use saved expression so that the overall NEW
10796 expression value is a pointer to a newly created and initialized
10798 if (TREE_CODE (original_call) == NEW_CLASS_EXPR)
10800 tree class = DECL_CONTEXT (method);
10801 tree c1, saved_new, size, new;
10804 if (flag_emit_class_files || flag_emit_xref)
10806 TREE_TYPE (patch) = build_pointer_type (class);
10809 if (!TYPE_SIZE (class))
10810 safe_layout_class (class);
10811 size = size_in_bytes (class);
10813 (class_has_finalize_method (class) ? alloc_object_node
10814 : alloc_no_finalizer_node);
10815 new = build3 (CALL_EXPR, promote_type (class),
10816 build_address_of (alloc_node),
10817 build_tree_list (NULL_TREE, build_class_ref (class)),
10819 saved_new = save_expr (new);
10820 c1 = build_tree_list (NULL_TREE, saved_new);
10821 TREE_CHAIN (c1) = TREE_OPERAND (original_call, 1);
10822 TREE_OPERAND (original_call, 1) = c1;
10823 TREE_SET_CODE (original_call, CALL_EXPR);
10824 patch = build2 (COMPOUND_EXPR, TREE_TYPE (new), patch, saved_new);
10827 /* If CHECK is set, then we are building a check to see if the object
10829 if (check != NULL_TREE)
10831 /* We have to call force_evaluation_order now because creating a
10832 COMPOUND_EXPR wraps the arg list in a way that makes it
10833 unrecognizable by force_evaluation_order later. Yuk. */
10834 patch = build2 (COMPOUND_EXPR, TREE_TYPE (patch), check,
10835 force_evaluation_order (patch));
10836 TREE_SIDE_EFFECTS (patch) = 1;
10839 /* In order to be able to modify PATCH later, we SAVE_EXPR it and
10840 put it as the first expression of a COMPOUND_EXPR. The second
10841 expression being an empty statement to be later patched if
10842 necessary. We remember a TREE_LIST (the PURPOSE is the method,
10843 the VALUE is the compound) in a hashtable and return a
10844 COMPOUND_EXPR built so that the result of the evaluation of the
10845 original PATCH node is returned. */
10846 if (STATIC_CLASS_INIT_OPT_P ()
10847 && current_function_decl && METHOD_STATIC (method))
10850 tree fndecl = current_function_decl;
10851 /* We have to call force_evaluation_order now because creating a
10852 COMPOUND_EXPR wraps the arg list in a way that makes it
10853 unrecognizable by force_evaluation_order later. Yuk. */
10854 tree save = force_evaluation_order (patch);
10855 tree type = TREE_TYPE (patch);
10857 patch = build2 (COMPOUND_EXPR, type, save, build_java_empty_stmt ());
10858 list = tree_cons (method, patch,
10859 DECL_FUNCTION_STATIC_METHOD_INVOCATION_COMPOUND (fndecl));
10861 DECL_FUNCTION_STATIC_METHOD_INVOCATION_COMPOUND (fndecl) = list;
10863 patch = build2 (COMPOUND_EXPR, type, patch, save);
10870 invocation_mode (tree method, int super)
10872 int access = get_access_flags_from_decl (method);
10875 return INVOKE_SUPER;
10877 if (access & ACC_STATIC)
10878 return INVOKE_STATIC;
10880 /* We have to look for a constructor before we handle nonvirtual
10881 calls; otherwise the constructor will look nonvirtual. */
10882 if (DECL_CONSTRUCTOR_P (method))
10883 return INVOKE_STATIC;
10885 if (access & ACC_FINAL || access & ACC_PRIVATE)
10886 return INVOKE_NONVIRTUAL;
10888 if (CLASS_FINAL (TYPE_NAME (DECL_CONTEXT (method))))
10889 return INVOKE_NONVIRTUAL;
10891 if (CLASS_INTERFACE (TYPE_NAME (DECL_CONTEXT (method))))
10892 return INVOKE_INTERFACE;
10894 return INVOKE_VIRTUAL;
10897 /* Retrieve a refined list of matching methods. It covers the step
10898 15.11.2 (Compile-Time Step 2) */
10901 lookup_method_invoke (int lc, tree cl, tree class, tree name, tree arg_list)
10903 tree atl = end_params_node; /* Arg Type List */
10904 tree method, signature, list, node;
10905 const char *candidates; /* Used for error report */
10908 /* Fix the arguments */
10909 for (node = arg_list; node; node = TREE_CHAIN (node))
10911 tree current_arg = TREE_TYPE (TREE_VALUE (node));
10912 /* Non primitive type may have to be resolved */
10913 if (!JPRIMITIVE_TYPE_P (current_arg))
10914 resolve_and_layout (current_arg, NULL_TREE);
10916 if (TREE_CODE (current_arg) == RECORD_TYPE)
10917 current_arg = promote_type (current_arg);
10918 atl = tree_cons (NULL_TREE, current_arg, atl);
10921 /* Presto. If we're dealing with an anonymous class and a
10922 constructor call, generate the right constructor now, since we
10923 know the arguments' types. */
10925 if (lc && ANONYMOUS_CLASS_P (class))
10927 tree mdecl = craft_constructor (TYPE_NAME (class), atl);
10928 /* The anonymous class may have already been laid out, so make sure
10929 the new constructor is laid out here. */
10930 layout_class_method (class, CLASSTYPE_SUPER (class), mdecl, NULL_TREE);
10933 /* Find all candidates and then refine the list, searching for the
10934 most specific method. */
10935 list = find_applicable_accessible_methods_list (lc, class, name, atl);
10936 list = find_most_specific_methods_list (list);
10937 if (list && !TREE_CHAIN (list))
10938 return TREE_VALUE (list);
10940 /* Issue an error. List candidates if any. Candidates are listed
10941 only if accessible (non accessible methods may end-up here for
10942 the sake of a better error report). */
10947 obstack_grow (&temporary_obstack, ". Candidates are:\n", 18);
10948 for (current = list; current; current = TREE_CHAIN (current))
10950 tree cm = TREE_VALUE (current);
10951 char string [4096];
10952 if (!cm || not_accessible_p (class, cm, NULL_TREE, 0))
10955 (string, " `%s' in `%s'%s",
10956 get_printable_method_name (cm),
10957 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (DECL_CONTEXT (cm)))),
10958 (TREE_CHAIN (current) ? "\n" : ""));
10959 obstack_grow (&temporary_obstack, string, strlen (string));
10961 obstack_1grow (&temporary_obstack, '\0');
10962 candidates = obstack_finish (&temporary_obstack);
10964 /* Issue the error message */
10965 method = make_node (FUNCTION_TYPE);
10966 TYPE_ARG_TYPES (method) = atl;
10967 signature = build_java_argument_signature (method);
10968 dup = xstrdup (lang_printable_name (class, 0));
10969 parse_error_context (cl, "Can't find %s `%s(%s)' in type `%s'%s",
10970 (lc ? "constructor" : "method"),
10971 (lc ? dup : IDENTIFIER_POINTER (name)),
10972 IDENTIFIER_POINTER (signature), dup,
10973 (candidates ? candidates : ""));
10978 /* 15.11.2.1: Find Methods that are Applicable and Accessible. LC is 1
10979 when we're looking for a constructor. */
10982 find_applicable_accessible_methods_list (int lc, tree class, tree name,
10985 static htab_t searched_classes;
10986 static int search_not_done = 0;
10987 tree list = NULL_TREE, all_list = NULL_TREE;
10991 /* Check the hash table to determine if this class has been searched
10993 if (searched_classes)
10995 if (htab_find (searched_classes, class) != NULL)
11000 searched_classes = htab_create (10, htab_hash_pointer,
11001 htab_eq_pointer, NULL);
11005 *htab_find_slot (searched_classes, class, INSERT) = class;
11007 if (!CLASS_LOADED_P (class))
11009 load_class (class, 1);
11010 safe_layout_class (class);
11013 /* Search interfaces */
11014 if (TREE_CODE (TYPE_NAME (class)) == TYPE_DECL
11015 && CLASS_INTERFACE (TYPE_NAME (class)))
11017 search_applicable_methods_list (lc, TYPE_METHODS (class),
11018 name, arglist, &list, &all_list);
11019 for (i = 1; BINFO_BASE_ITERATE (TYPE_BINFO (class), i, base_binfo); i++)
11021 tree t = BINFO_TYPE (base_binfo);
11024 rlist = find_applicable_accessible_methods_list (lc, t, name,
11026 list = chainon (rlist, list);
11029 /* Search classes */
11032 search_applicable_methods_list (lc, TYPE_METHODS (class),
11033 name, arglist, &list, &all_list);
11035 /* When looking finit$, class$ or instinit$, we turn LC to 1 so
11036 that we only search in class. Note that we should have found
11037 something at this point. */
11038 if (ID_FINIT_P (name) || ID_CLASSDOLLAR_P (name) || ID_INSTINIT_P (name))
11045 /* We must search all interfaces of this class */
11049 BINFO_BASE_ITERATE (TYPE_BINFO (class), i, base_binfo); i++)
11051 tree t = BINFO_TYPE (base_binfo);
11052 if (t != object_type_node)
11055 = find_applicable_accessible_methods_list (lc, t,
11057 list = chainon (rlist, list);
11062 /* Search superclass */
11063 if (!lc && CLASSTYPE_SUPER (class) != NULL_TREE)
11066 class = CLASSTYPE_SUPER (class);
11067 rlist = find_applicable_accessible_methods_list (lc, class,
11069 list = chainon (rlist, list);
11075 /* We're done. Reset the searched classes list and finally search
11076 java.lang.Object if it wasn't searched already. */
11077 if (!search_not_done)
11080 && TYPE_METHODS (object_type_node)
11081 && htab_find (searched_classes, object_type_node) == NULL)
11083 search_applicable_methods_list (lc,
11084 TYPE_METHODS (object_type_node),
11085 name, arglist, &list, &all_list);
11087 htab_delete (searched_classes);
11088 searched_classes = NULL;
11091 /* Either return the list obtained or all selected (but
11092 inaccessible) methods for better error report. */
11093 return (!list ? all_list : list);
11096 /* Effectively search for the appropriate method in method */
11099 search_applicable_methods_list (int lc, tree method, tree name, tree arglist,
11100 tree *list, tree *all_list)
11102 for (; method; method = TREE_CHAIN (method))
11104 /* When dealing with constructor, stop here, otherwise search
11106 if (lc && !DECL_CONSTRUCTOR_P (method))
11108 else if (!lc && (DECL_CONSTRUCTOR_P (method)
11109 || (DECL_NAME (method) != name)))
11112 if (argument_types_convertible (method, arglist))
11114 /* Retain accessible methods only */
11115 if (!not_accessible_p (DECL_CONTEXT (current_function_decl),
11116 method, NULL_TREE, 0))
11117 *list = tree_cons (NULL_TREE, method, *list);
11119 /* Also retain all selected method here */
11120 *all_list = tree_cons (NULL_TREE, method, *list);
11125 /* 15.11.2.2 Choose the Most Specific Method */
11128 find_most_specific_methods_list (tree list)
11131 int abstract, candidates;
11132 tree current, new_list = NULL_TREE;
11133 for (current = list; current; current = TREE_CHAIN (current))
11136 DECL_SPECIFIC_COUNT (TREE_VALUE (current)) = 0;
11138 for (method = list; method; method = TREE_CHAIN (method))
11140 tree method_v, current_v;
11141 /* Don't test a method against itself */
11142 if (method == current)
11145 method_v = TREE_VALUE (method);
11146 current_v = TREE_VALUE (current);
11148 /* Compare arguments and location where methods where declared */
11149 if (argument_types_convertible (method_v, current_v))
11151 if (valid_method_invocation_conversion_p
11152 (DECL_CONTEXT (method_v), DECL_CONTEXT (current_v))
11153 || (INNER_CLASS_TYPE_P (DECL_CONTEXT (current_v))
11154 && enclosing_context_p (DECL_CONTEXT (method_v),
11155 DECL_CONTEXT (current_v))))
11157 int v = (DECL_SPECIFIC_COUNT (current_v) +=
11158 (INNER_CLASS_TYPE_P (DECL_CONTEXT (current_v)) ? 2 : 1));
11159 max = (v > max ? v : max);
11165 /* Review the list and select the maximally specific methods */
11166 for (current = list, abstract = -1, candidates = -1;
11167 current; current = TREE_CHAIN (current))
11168 if (DECL_SPECIFIC_COUNT (TREE_VALUE (current)) == max)
11170 new_list = tree_cons (NULL_TREE, TREE_VALUE (current), new_list);
11171 abstract += (METHOD_ABSTRACT (TREE_VALUE (current)) ? 1 : 0);
11175 /* If we have several and they're all abstract, just pick the
11177 if (candidates > 0 && candidates == abstract)
11179 /* FIXME: merge the throws clauses. There is no convenient way
11180 to do this in gcj right now, since ideally we'd like to
11181 introduce a new METHOD_DECL here, but that is really not
11183 new_list = nreverse (new_list);
11184 TREE_CHAIN (new_list) = NULL_TREE;
11188 /* We have several (we couldn't find a most specific), all but one
11189 are abstract, we pick the only non abstract one. */
11190 if (candidates > 0 && (candidates == abstract+1))
11192 for (current = new_list; current; current = TREE_CHAIN (current))
11193 if (!METHOD_ABSTRACT (TREE_VALUE (current)))
11195 TREE_CHAIN (current) = NULL_TREE;
11196 new_list = current;
11200 /* If we can't find one, lower expectations and try to gather multiple
11201 maximally specific methods */
11202 while (!new_list && max)
11206 if (DECL_SPECIFIC_COUNT (TREE_VALUE (current)) == max)
11207 new_list = tree_cons (NULL_TREE, TREE_VALUE (current), new_list);
11214 /* Make sure that the type of each M2_OR_ARGLIST arguments can be
11215 converted by method invocation conversion (5.3) to the type of the
11216 corresponding parameter of M1. Implementation expects M2_OR_ARGLIST
11217 to change less often than M1. */
11219 static GTY(()) tree m2_arg_value;
11220 static GTY(()) tree m2_arg_cache;
11223 argument_types_convertible (tree m1, tree m2_or_arglist)
11225 tree m1_arg, m2_arg;
11227 SKIP_THIS_AND_ARTIFICIAL_PARMS (m1_arg, m1)
11229 if (m2_arg_value == m2_or_arglist)
11230 m2_arg = m2_arg_cache;
11233 /* M2_OR_ARGLIST can be a function DECL or a raw list of
11235 if (m2_or_arglist && TREE_CODE (m2_or_arglist) == FUNCTION_DECL)
11237 m2_arg = TYPE_ARG_TYPES (TREE_TYPE (m2_or_arglist));
11238 if (!METHOD_STATIC (m2_or_arglist))
11239 m2_arg = TREE_CHAIN (m2_arg);
11242 m2_arg = m2_or_arglist;
11244 m2_arg_value = m2_or_arglist;
11245 m2_arg_cache = m2_arg;
11248 while (m1_arg != end_params_node && m2_arg != end_params_node)
11250 resolve_and_layout (TREE_VALUE (m1_arg), NULL_TREE);
11251 if (!valid_method_invocation_conversion_p (TREE_VALUE (m1_arg),
11252 TREE_VALUE (m2_arg)))
11254 m1_arg = TREE_CHAIN (m1_arg);
11255 m2_arg = TREE_CHAIN (m2_arg);
11257 return m1_arg == end_params_node && m2_arg == end_params_node;
11260 /* Qualification routines */
11262 /* Given a name x.y.z, look up x locally. If it's found, save the
11263 decl. If it's not found, mark the name as RESOLVE_PACKAGE_NAME_P,
11264 so that we later try and load the appropriate classes. */
11266 qualify_ambiguous_name (tree id)
11270 /* We inspect the first item of the qualification list. As a sanity
11271 check, make sure that it is an identfier node. */
11272 tree qual = EXPR_WFL_QUALIFICATION (id);
11273 tree qual_wfl = QUAL_WFL (qual);
11275 if (TREE_CODE (qual_wfl) != EXPR_WITH_FILE_LOCATION)
11278 name = EXPR_WFL_NODE (qual_wfl);
11280 /* If we don't have an identifier, or we have a 'this' or 'super',
11281 then field access processing is all we need : there is nothing
11283 if (!name || TREE_CODE (name) != IDENTIFIER_NODE ||
11284 name == this_identifier_node ||
11285 name == super_identifier_node)
11288 /* If name appears within the scope of a local variable declaration
11289 or parameter declaration, or is a field within an enclosing
11290 class, then it is an expression name. Save the decl and let
11291 resolve_field_access do it's work. */
11292 if ((decl = IDENTIFIER_LOCAL_VALUE (name)) ||
11293 (decl = lookup_field_wrapper (current_class, name)))
11295 QUAL_RESOLUTION (qual) = decl;
11299 /* If name is a known class name (either declared or imported), mark
11300 us as a type name. */
11301 if ((decl = resolve_and_layout (name, NULL_TREE)))
11303 RESOLVE_TYPE_NAME_P (qual_wfl) = 1;
11304 QUAL_RESOLUTION (qual) = decl;
11307 /* Check here that NAME isn't declared by more than one
11308 type-import-on-demand declaration of the compilation unit
11309 containing NAME. FIXME */
11311 /* We couldn't find a declaration for the name. Assume for now that
11312 we have a qualified class name that needs to be loaded from an
11313 external class file. */
11315 RESOLVE_PACKAGE_NAME_P (qual_wfl) = 1;
11317 /* Propagate the qualification across other components of the
11319 for (qual = TREE_CHAIN (qual); qual;
11320 qual_wfl = QUAL_WFL (qual), qual = TREE_CHAIN (qual))
11322 if (RESOLVE_PACKAGE_NAME_P (qual_wfl))
11323 RESOLVE_PACKAGE_NAME_P (QUAL_WFL (qual)) = 1;
11326 /* Store the global qualification for the ambiguous part of ID back
11328 if (RESOLVE_TYPE_NAME_P (qual_wfl))
11329 RESOLVE_TYPE_NAME_P (id) = 1;
11330 else if (RESOLVE_PACKAGE_NAME_P (qual_wfl))
11331 RESOLVE_PACKAGE_NAME_P (id) = 1;
11334 /* Patch tree nodes in a function body. When a BLOCK is found, push
11335 local variable decls if present.
11336 Same as java_complete_lhs, but does resolve static finals to values. */
11339 java_complete_tree (tree node)
11341 node = java_complete_lhs (node);
11342 if (JDECL_P (node) && CLASS_FINAL_VARIABLE_P (node)
11343 && DECL_INITIAL (node) != NULL_TREE
11344 && !flag_emit_xref)
11346 tree value = fold_constant_for_init (node, node);
11347 if (value != NULL_TREE)
11354 java_stabilize_reference (tree node)
11356 if (TREE_CODE (node) == COMPOUND_EXPR)
11358 tree op0 = TREE_OPERAND (node, 0);
11359 tree op1 = TREE_OPERAND (node, 1);
11360 TREE_OPERAND (node, 0) = save_expr (op0);
11361 TREE_OPERAND (node, 1) = java_stabilize_reference (op1);
11364 return stabilize_reference (node);
11367 /* Patch tree nodes in a function body. When a BLOCK is found, push
11368 local variable decls if present.
11369 Same as java_complete_tree, but does not resolve static finals to values. */
11372 java_complete_lhs (tree node)
11374 tree nn, cn, wfl_op1, wfl_op2, wfl_op3;
11377 /* CONVERT_EXPR always has its type set, even though it needs to be
11379 if (TREE_TYPE (node) && TREE_CODE (node) != CONVERT_EXPR)
11382 /* The switch block implements cases processing container nodes
11383 first. Contained nodes are always written back. Leaves come
11384 next and return a value. */
11385 switch (TREE_CODE (node))
11389 /* 1- Block section.
11390 Set the local values on decl names so we can identify them
11391 faster when they're referenced. At that stage, identifiers
11392 are legal so we don't check for declaration errors. */
11393 for (cn = BLOCK_EXPR_DECLS (node); cn; cn = TREE_CHAIN (cn))
11395 DECL_CONTEXT (cn) = current_function_decl;
11396 IDENTIFIER_LOCAL_VALUE (DECL_NAME (cn)) = cn;
11398 if (BLOCK_EXPR_BODY (node) == NULL_TREE)
11399 CAN_COMPLETE_NORMALLY (node) = 1;
11402 tree stmt = BLOCK_EXPR_BODY (node);
11404 int error_seen = 0;
11405 if (TREE_CODE (stmt) == COMPOUND_EXPR)
11407 /* Re-order from (((A; B); C); ...; Z) to
11408 (A; (B; (C ; (...; Z)))).
11409 This makes it easier to scan the statements left-to-right
11410 without using recursion (which might overflow the stack
11411 if the block has many statements. */
11414 tree left = TREE_OPERAND (stmt, 0);
11415 if (TREE_CODE (left) != COMPOUND_EXPR)
11417 TREE_OPERAND (stmt, 0) = TREE_OPERAND (left, 1);
11418 TREE_OPERAND (left, 1) = stmt;
11421 BLOCK_EXPR_BODY (node) = stmt;
11424 /* Now do the actual complete, without deep recursion for
11426 ptr = &BLOCK_EXPR_BODY (node);
11427 while (TREE_CODE (*ptr) == COMPOUND_EXPR
11428 && !IS_EMPTY_STMT (TREE_OPERAND (*ptr, 1)))
11430 tree cur = java_complete_tree (TREE_OPERAND (*ptr, 0));
11431 tree *next = &TREE_OPERAND (*ptr, 1);
11432 TREE_OPERAND (*ptr, 0) = cur;
11433 if (IS_EMPTY_STMT (cur))
11435 /* Optimization; makes it easier to detect empty bodies.
11436 Most useful for <clinit> with all-constant initializer. */
11440 if (TREE_CODE (cur) == ERROR_MARK)
11442 else if (! CAN_COMPLETE_NORMALLY (cur))
11447 if (TREE_CODE (wfl_op2) == BLOCK)
11448 wfl_op2 = BLOCK_EXPR_BODY (wfl_op2);
11449 else if (TREE_CODE (wfl_op2) == COMPOUND_EXPR)
11450 wfl_op2 = TREE_OPERAND (wfl_op2, 0);
11454 if (TREE_CODE (wfl_op2) != CASE_EXPR
11455 && TREE_CODE (wfl_op2) != DEFAULT_EXPR)
11456 unreachable_stmt_error (*ptr);
11458 if (TREE_TYPE (*ptr) == NULL_TREE)
11459 TREE_TYPE (*ptr) = void_type_node;
11462 *ptr = java_complete_tree (*ptr);
11464 if (TREE_CODE (*ptr) == ERROR_MARK || error_seen > 0)
11465 return error_mark_node;
11466 CAN_COMPLETE_NORMALLY (node) = CAN_COMPLETE_NORMALLY (*ptr);
11468 /* Turn local bindings to null */
11469 for (cn = BLOCK_EXPR_DECLS (node); cn; cn = TREE_CHAIN (cn))
11470 IDENTIFIER_LOCAL_VALUE (DECL_NAME (cn)) = NULL_TREE;
11472 TREE_TYPE (node) = void_type_node;
11475 /* 2- They are expressions but ultimately deal with statements */
11478 wfl_op1 = TREE_OPERAND (node, 0);
11479 COMPLETE_CHECK_OP_0 (node);
11480 /* 14.19 A throw statement cannot complete normally. */
11481 CAN_COMPLETE_NORMALLY (node) = 0;
11482 return patch_throw_statement (node, wfl_op1);
11484 case SYNCHRONIZED_EXPR:
11485 wfl_op1 = TREE_OPERAND (node, 0);
11486 return patch_synchronized_statement (node, wfl_op1);
11489 return patch_try_statement (node);
11491 case TRY_FINALLY_EXPR:
11492 COMPLETE_CHECK_OP_0 (node);
11493 COMPLETE_CHECK_OP_1 (node);
11494 if (IS_EMPTY_STMT (TREE_OPERAND (node, 0)))
11495 /* Reduce try/finally nodes with an empty try block. */
11496 return TREE_OPERAND (node, 1);
11497 if (IS_EMPTY_STMT (TREE_OPERAND (node, 1)))
11498 /* Likewise for an empty finally block. */
11499 return TREE_OPERAND (node, 0);
11500 CAN_COMPLETE_NORMALLY (node)
11501 = (CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 0))
11502 && CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 1)));
11503 TREE_TYPE (node) = TREE_TYPE (TREE_OPERAND (node, 0));
11506 case LABELED_BLOCK_EXPR:
11507 PUSH_LABELED_BLOCK (node);
11508 if (LABELED_BLOCK_BODY (node))
11509 COMPLETE_CHECK_OP_1 (node);
11510 TREE_TYPE (node) = void_type_node;
11511 POP_LABELED_BLOCK ();
11513 if (IS_EMPTY_STMT (LABELED_BLOCK_BODY (node)))
11515 LABELED_BLOCK_BODY (node) = NULL_TREE;
11516 CAN_COMPLETE_NORMALLY (node) = 1;
11518 else if (CAN_COMPLETE_NORMALLY (LABELED_BLOCK_BODY (node)))
11519 CAN_COMPLETE_NORMALLY (node) = 1;
11522 case EXIT_BLOCK_EXPR:
11523 /* We don't complete operand 1, because it's the return value of
11524 the EXIT_BLOCK_EXPR which doesn't exist it Java */
11525 return patch_bc_statement (node);
11528 cn = java_complete_tree (TREE_OPERAND (node, 0));
11529 if (cn == error_mark_node)
11532 /* First, the case expression must be constant. Values of final
11533 fields are accepted. */
11535 if ((TREE_CODE (cn) == COMPOUND_EXPR || TREE_CODE (cn) == COMPONENT_REF)
11536 && JDECL_P (TREE_OPERAND (cn, 1))
11537 && FIELD_FINAL (TREE_OPERAND (cn, 1))
11538 && DECL_INITIAL (TREE_OPERAND (cn, 1)))
11540 cn = fold_constant_for_init (DECL_INITIAL (TREE_OPERAND (cn, 1)),
11541 TREE_OPERAND (cn, 1));
11543 /* Accept final locals too. */
11544 else if (TREE_CODE (cn) == VAR_DECL && DECL_FINAL (cn)
11545 && DECL_INITIAL (cn))
11546 cn = fold_constant_for_init (DECL_INITIAL (cn), cn);
11548 if (!TREE_CONSTANT (cn) && !flag_emit_xref)
11550 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
11551 parse_error_context (node, "Constant expression required");
11552 return error_mark_node;
11555 nn = ctxp->current_loop;
11557 /* It must be assignable to the type of the switch expression. */
11558 if (!try_builtin_assignconv (NULL_TREE,
11559 TREE_TYPE (TREE_OPERAND (nn, 0)), cn))
11561 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
11562 parse_error_context
11564 "Incompatible type for case. Can't convert `%s' to `int'",
11565 lang_printable_name (TREE_TYPE (cn), 0));
11566 return error_mark_node;
11569 cn = fold (convert (int_type_node, cn));
11570 TREE_CONSTANT_OVERFLOW (cn) = 0;
11571 CAN_COMPLETE_NORMALLY (cn) = 1;
11573 /* Save the label on a list so that we can later check for
11575 case_label_list = tree_cons (node, cn, case_label_list);
11577 /* Multiple instance of a case label bearing the same value is
11578 checked later. The case expression is all right so far. */
11579 if (TREE_CODE (cn) == VAR_DECL)
11580 cn = DECL_INITIAL (cn);
11581 TREE_OPERAND (node, 0) = cn;
11582 TREE_TYPE (node) = void_type_node;
11583 CAN_COMPLETE_NORMALLY (node) = 1;
11584 TREE_SIDE_EFFECTS (node) = 1;
11588 nn = ctxp->current_loop;
11589 /* Only one default label is allowed per switch statement */
11590 if (SWITCH_HAS_DEFAULT (nn))
11592 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
11593 parse_error_context (wfl_operator,
11594 "Duplicate case label: `default'");
11595 return error_mark_node;
11598 SWITCH_HAS_DEFAULT (nn) = 1;
11599 TREE_TYPE (node) = void_type_node;
11600 TREE_SIDE_EFFECTS (node) = 1;
11601 CAN_COMPLETE_NORMALLY (node) = 1;
11607 /* Check whether the loop was enclosed in a labeled
11608 statement. If not, create one, insert the loop in it and
11610 nn = patch_loop_statement (node);
11612 /* Anyways, walk the body of the loop */
11613 if (TREE_CODE (node) == LOOP_EXPR)
11614 TREE_OPERAND (node, 0) = java_complete_tree (TREE_OPERAND (node, 0));
11615 /* Switch statement: walk the switch expression and the cases */
11617 node = patch_switch_statement (node);
11619 if (node == error_mark_node || TREE_OPERAND (node, 0) == error_mark_node)
11620 nn = error_mark_node;
11623 TREE_TYPE (nn) = TREE_TYPE (node) = void_type_node;
11624 /* If we returned something different, that's because we
11625 inserted a label. Pop the label too. */
11628 if (CAN_COMPLETE_NORMALLY (node))
11629 CAN_COMPLETE_NORMALLY (nn) = 1;
11630 POP_LABELED_BLOCK ();
11637 TREE_OPERAND (node, 0) = java_complete_tree (TREE_OPERAND (node, 0));
11638 return patch_exit_expr (node);
11642 TREE_OPERAND (node, 0) = java_complete_tree (TREE_OPERAND (node, 0));
11643 if (TREE_OPERAND (node, 0) == error_mark_node)
11644 return error_mark_node;
11645 /* then-else branches */
11646 TREE_OPERAND (node, 1) = java_complete_tree (TREE_OPERAND (node, 1));
11647 if (TREE_OPERAND (node, 1) == error_mark_node)
11648 return error_mark_node;
11649 TREE_OPERAND (node, 2) = java_complete_tree (TREE_OPERAND (node, 2));
11650 if (TREE_OPERAND (node, 2) == error_mark_node)
11651 return error_mark_node;
11652 return patch_if_else_statement (node);
11655 case CONDITIONAL_EXPR:
11657 wfl_op1 = TREE_OPERAND (node, 0);
11658 COMPLETE_CHECK_OP_0 (node);
11659 wfl_op2 = TREE_OPERAND (node, 1);
11660 COMPLETE_CHECK_OP_1 (node);
11661 wfl_op3 = TREE_OPERAND (node, 2);
11662 COMPLETE_CHECK_OP_2 (node);
11663 return patch_conditional_expr (node, wfl_op1, wfl_op2);
11665 /* 3- Expression section */
11666 case COMPOUND_EXPR:
11667 wfl_op2 = TREE_OPERAND (node, 1);
11668 TREE_OPERAND (node, 0) = nn =
11669 java_complete_tree (TREE_OPERAND (node, 0));
11670 if (IS_EMPTY_STMT (wfl_op2))
11671 CAN_COMPLETE_NORMALLY (node) = CAN_COMPLETE_NORMALLY (nn);
11674 if (! CAN_COMPLETE_NORMALLY (nn) && TREE_CODE (nn) != ERROR_MARK)
11676 /* An unreachable condition in a do-while statement
11677 is *not* (technically) an unreachable statement. */
11679 if (TREE_CODE (nn) == EXPR_WITH_FILE_LOCATION)
11680 nn = EXPR_WFL_NODE (nn);
11681 /* NN can be NULL_TREE exactly when UPDATE is, in
11682 finish_for_loop. */
11683 if (nn != NULL_TREE && TREE_CODE (nn) != EXIT_EXPR)
11685 SET_WFL_OPERATOR (wfl_operator, node, wfl_op2);
11686 if (SUPPRESS_UNREACHABLE_ERROR (nn))
11688 /* Perhaps this warning should have an
11689 associated flag. The code being compiled is
11690 pedantically correct, but useless. */
11691 parse_warning_context (wfl_operator,
11692 "Unreachable statement");
11695 parse_error_context (wfl_operator,
11696 "Unreachable statement");
11699 TREE_OPERAND (node, 1) = java_complete_tree (TREE_OPERAND (node, 1));
11700 if (TREE_OPERAND (node, 1) == error_mark_node)
11701 return error_mark_node;
11702 /* Even though we might allow the case where the first
11703 operand doesn't return normally, we still should compute
11704 CAN_COMPLETE_NORMALLY correctly. */
11705 CAN_COMPLETE_NORMALLY (node)
11706 = (CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 0))
11707 && CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 1)));
11709 TREE_TYPE (node) = TREE_TYPE (TREE_OPERAND (node, 1));
11713 /* CAN_COMPLETE_NORMALLY (node) = 0; */
11714 return patch_return (node);
11716 case EXPR_WITH_FILE_LOCATION:
11717 if (!EXPR_WFL_NODE (node) /* Or a PRIMARY flag ? */
11718 || TREE_CODE (EXPR_WFL_NODE (node)) == IDENTIFIER_NODE)
11721 node = resolve_expression_name (node, NULL);
11722 if (node == error_mark_node)
11724 /* Keep line number information somewhere were it doesn't
11725 disrupt the completion process. */
11726 if (flag_emit_xref && TREE_CODE (node) != CALL_EXPR)
11728 EXPR_WFL_NODE (wfl) = TREE_OPERAND (node, 1);
11729 TREE_OPERAND (node, 1) = wfl;
11731 CAN_COMPLETE_NORMALLY (node) = 1;
11736 int save_lineno = input_line;
11737 input_line = EXPR_WFL_LINENO (node);
11738 body = java_complete_tree (EXPR_WFL_NODE (node));
11739 input_line = save_lineno;
11740 EXPR_WFL_NODE (node) = body;
11741 TREE_SIDE_EFFECTS (node) = TREE_SIDE_EFFECTS (body);
11742 CAN_COMPLETE_NORMALLY (node) = CAN_COMPLETE_NORMALLY (body);
11743 if (IS_EMPTY_STMT (body) || TREE_CONSTANT (body))
11745 /* Makes it easier to constant fold, detect empty bodies. */
11748 if (body == error_mark_node)
11750 /* Its important for the evaluation of assignment that
11751 this mark on the TREE_TYPE is propagated. */
11752 TREE_TYPE (node) = error_mark_node;
11753 return error_mark_node;
11756 TREE_TYPE (node) = TREE_TYPE (EXPR_WFL_NODE (node));
11761 case NEW_ARRAY_EXPR:
11762 /* Patch all the dimensions */
11764 for (cn = TREE_OPERAND (node, 1); cn; cn = TREE_CHAIN (cn))
11766 int location = EXPR_WFL_LINECOL (TREE_VALUE (cn));
11767 tree dim = convert (int_type_node,
11768 java_complete_tree (TREE_VALUE (cn)));
11769 if (dim == error_mark_node)
11776 TREE_VALUE (cn) = dim;
11777 /* Setup the location of the current dimension, for
11778 later error report. */
11779 TREE_PURPOSE (cn) =
11780 build_expr_wfl (NULL_TREE, input_filename, 0, 0);
11781 EXPR_WFL_LINECOL (TREE_PURPOSE (cn)) = location;
11784 /* They complete the array creation expression, if no errors
11786 CAN_COMPLETE_NORMALLY (node) = 1;
11787 return (flag ? error_mark_node
11788 : force_evaluation_order (patch_newarray (node)));
11790 case NEW_ANONYMOUS_ARRAY_EXPR:
11791 /* Create the array type if necessary. */
11792 if (ANONYMOUS_ARRAY_DIMS_SIG (node))
11794 tree type = ANONYMOUS_ARRAY_BASE_TYPE (node);
11795 if (!(type = resolve_type_during_patch (type)))
11796 return error_mark_node;
11797 type = build_array_from_name (type, NULL_TREE,
11798 ANONYMOUS_ARRAY_DIMS_SIG (node), NULL);
11799 ANONYMOUS_ARRAY_BASE_TYPE (node) = build_pointer_type (type);
11801 node = patch_new_array_init (ANONYMOUS_ARRAY_BASE_TYPE (node),
11802 ANONYMOUS_ARRAY_INITIALIZER (node));
11803 if (node == error_mark_node)
11804 return error_mark_node;
11805 CAN_COMPLETE_NORMALLY (node) = 1;
11808 case NEW_CLASS_EXPR:
11810 /* Complete function's argument(s) first */
11811 if (complete_function_arguments (node))
11812 return error_mark_node;
11815 tree decl, wfl = TREE_OPERAND (node, 0);
11816 int in_this = CALL_THIS_CONSTRUCTOR_P (node);
11817 int from_super = (EXPR_WFL_NODE (TREE_OPERAND (node, 0)) ==
11818 super_identifier_node);
11820 int location = EXPR_WFL_LINECOL (node);
11822 node = patch_method_invocation (node, NULL_TREE, NULL_TREE,
11823 from_super, 0, &decl);
11824 if (node == error_mark_node)
11825 return error_mark_node;
11827 if (TREE_CODE (node) == CALL_EXPR
11828 && TREE_OPERAND (node, 1) != NULL_TREE)
11829 arguments = TREE_VALUE (TREE_OPERAND (node, 1));
11831 arguments = NULL_TREE;
11832 check_thrown_exceptions (location, decl, arguments);
11833 /* If we call this(...), register signature and positions */
11835 DECL_CONSTRUCTOR_CALLS (current_function_decl) =
11836 tree_cons (wfl, decl,
11837 DECL_CONSTRUCTOR_CALLS (current_function_decl));
11838 CAN_COMPLETE_NORMALLY (node) = 1;
11839 return force_evaluation_order (node);
11843 /* Save potential wfls */
11844 wfl_op1 = TREE_OPERAND (node, 0);
11845 TREE_OPERAND (node, 0) = nn = java_complete_lhs (wfl_op1);
11847 if (MODIFY_EXPR_FROM_INITIALIZATION_P (node)
11848 && TREE_CODE (nn) == VAR_DECL && TREE_STATIC (nn)
11849 && DECL_INITIAL (nn) != NULL_TREE)
11853 value = fold_constant_for_init (nn, nn);
11855 /* When we have a primitype type, or a string and we're not
11856 emitting a class file, we actually don't want to generate
11857 anything for the assignment. */
11858 if (value != NULL_TREE &&
11859 (JPRIMITIVE_TYPE_P (TREE_TYPE (value)) ||
11860 (TREE_TYPE (value) == string_ptr_type_node &&
11861 ! flag_emit_class_files)))
11863 /* Prepare node for patch_assignment */
11864 TREE_OPERAND (node, 1) = value;
11865 /* Call patch assignment to verify the assignment */
11866 if (patch_assignment (node, wfl_op1) == error_mark_node)
11867 return error_mark_node;
11868 /* Set DECL_INITIAL properly (a conversion might have
11869 been decided by patch_assignment) and return the
11870 empty statement. */
11873 tree patched = patch_string (TREE_OPERAND (node, 1));
11875 DECL_INITIAL (nn) = patched;
11877 DECL_INITIAL (nn) = TREE_OPERAND (node, 1);
11878 DECL_FIELD_FINAL_IUD (nn) = 1;
11879 return build_java_empty_stmt ();
11882 if (! flag_emit_class_files)
11883 DECL_INITIAL (nn) = NULL_TREE;
11885 wfl_op2 = TREE_OPERAND (node, 1);
11887 if (TREE_OPERAND (node, 0) == error_mark_node)
11888 return error_mark_node;
11890 flag = COMPOUND_ASSIGN_P (wfl_op2);
11893 /* This might break when accessing outer field from inner
11894 class. TESTME, FIXME */
11895 tree lvalue = java_stabilize_reference (TREE_OPERAND (node, 0));
11897 /* Hand stabilize the lhs on both places */
11898 TREE_OPERAND (node, 0) = lvalue;
11899 TREE_OPERAND (TREE_OPERAND (node, 1), 0) =
11900 (flag_emit_class_files ? lvalue : save_expr (lvalue));
11902 /* 15.25.2.a: Left hand is not an array access. FIXME */
11903 /* Now complete the RHS. We write it back later on. */
11904 nn = java_complete_tree (TREE_OPERAND (node, 1));
11906 if ((cn = patch_string (nn)))
11909 /* The last part of the rewrite for E1 op= E2 is to have
11910 E1 = (T)(E1 op E2), with T being the type of E1. */
11911 nn = java_complete_tree (build_cast (EXPR_WFL_LINECOL (wfl_op2),
11912 TREE_TYPE (lvalue), nn));
11914 /* If the assignment is compound and has reference type,
11915 then ensure the LHS has type String and nothing else. */
11916 if (JREFERENCE_TYPE_P (TREE_TYPE (lvalue))
11917 && ! JSTRING_TYPE_P (TREE_TYPE (lvalue)))
11918 parse_error_context (wfl_op2,
11919 "Incompatible type for `+='. Can't convert `%s' to `java.lang.String'",
11920 lang_printable_name (TREE_TYPE (lvalue), 0));
11922 /* 15.25.2.b: Left hand is an array access. FIXME */
11925 /* If we're about to patch a NEW_ARRAY_INIT, we call a special
11926 function to complete this RHS. Note that a NEW_ARRAY_INIT
11927 might have been already fully expanded if created as a result
11928 of processing an anonymous array initializer. We avoid doing
11929 the operation twice by testing whether the node already bears
11931 else if (TREE_CODE (wfl_op2) == NEW_ARRAY_INIT && !TREE_TYPE (wfl_op2))
11932 nn = patch_new_array_init (TREE_TYPE (TREE_OPERAND (node, 0)),
11933 TREE_OPERAND (node, 1));
11934 /* Otherwise we simply complete the RHS */
11936 nn = java_complete_tree (TREE_OPERAND (node, 1));
11938 if (nn == error_mark_node)
11939 return error_mark_node;
11941 /* Write back the RHS as we evaluated it. */
11942 TREE_OPERAND (node, 1) = nn;
11944 /* In case we're handling = with a String as a RHS, we need to
11945 produce a String out of the RHS (it might still be a
11946 STRING_CST or a StringBuffer at this stage */
11947 if ((nn = patch_string (TREE_OPERAND (node, 1))))
11948 TREE_OPERAND (node, 1) = nn;
11950 if ((nn = outer_field_access_fix (wfl_op1, TREE_OPERAND (node, 0),
11951 TREE_OPERAND (node, 1))))
11953 /* We return error_mark_node if outer_field_access_fix
11954 detects we write into a final. */
11955 if (nn == error_mark_node)
11956 return error_mark_node;
11961 node = patch_assignment (node, wfl_op1);
11962 if (node == error_mark_node)
11963 return error_mark_node;
11964 /* Reorganize the tree if necessary. */
11965 if (flag && (!JREFERENCE_TYPE_P (TREE_TYPE (node))
11966 || JSTRING_P (TREE_TYPE (node))))
11967 node = java_refold (node);
11970 /* Seek to set DECL_INITIAL to a proper value, since it might have
11971 undergone a conversion in patch_assignment. We do that only when
11972 it's necessary to have DECL_INITIAL properly set. */
11973 nn = TREE_OPERAND (node, 0);
11974 if (TREE_CODE (nn) == VAR_DECL
11975 && DECL_INITIAL (nn) && CONSTANT_VALUE_P (DECL_INITIAL (nn))
11976 && FIELD_STATIC (nn) && FIELD_FINAL (nn)
11977 && (JPRIMITIVE_TYPE_P (TREE_TYPE (nn))
11978 || TREE_TYPE (nn) == string_ptr_type_node))
11979 DECL_INITIAL (nn) = TREE_OPERAND (node, 1);
11981 CAN_COMPLETE_NORMALLY (node) = 1;
11993 case TRUNC_MOD_EXPR:
11994 case TRUNC_DIV_EXPR:
11996 case TRUTH_ANDIF_EXPR:
11997 case TRUTH_ORIF_EXPR:
12004 /* Operands 0 and 1 are WFL in certain cases only. patch_binop
12005 knows how to handle those cases. */
12006 wfl_op1 = TREE_OPERAND (node, 0);
12007 wfl_op2 = TREE_OPERAND (node, 1);
12009 CAN_COMPLETE_NORMALLY (node) = 1;
12010 /* Don't complete string nodes if dealing with the PLUS operand. */
12011 if (TREE_CODE (node) != PLUS_EXPR || !JSTRING_P (wfl_op1))
12013 nn = java_complete_tree (wfl_op1);
12014 if (nn == error_mark_node)
12015 return error_mark_node;
12017 TREE_OPERAND (node, 0) = nn;
12019 if (TREE_CODE (node) != PLUS_EXPR || !JSTRING_P (wfl_op2))
12021 nn = java_complete_tree (wfl_op2);
12022 if (nn == error_mark_node)
12023 return error_mark_node;
12025 TREE_OPERAND (node, 1) = nn;
12027 return patch_binop (node, wfl_op1, wfl_op2);
12029 case INSTANCEOF_EXPR:
12030 wfl_op1 = TREE_OPERAND (node, 0);
12031 COMPLETE_CHECK_OP_0 (node);
12032 if (flag_emit_xref)
12034 TREE_TYPE (node) = boolean_type_node;
12037 return patch_binop (node, wfl_op1, TREE_OPERAND (node, 1));
12039 case UNARY_PLUS_EXPR:
12041 case TRUTH_NOT_EXPR:
12043 case PREDECREMENT_EXPR:
12044 case PREINCREMENT_EXPR:
12045 case POSTDECREMENT_EXPR:
12046 case POSTINCREMENT_EXPR:
12048 /* There are cases were wfl_op1 is a WFL. patch_unaryop knows
12049 how to handle those cases. */
12050 wfl_op1 = TREE_OPERAND (node, 0);
12051 CAN_COMPLETE_NORMALLY (node) = 1;
12052 TREE_OPERAND (node, 0) = java_complete_tree (wfl_op1);
12053 if (TREE_OPERAND (node, 0) == error_mark_node)
12054 return error_mark_node;
12055 node = patch_unaryop (node, wfl_op1);
12056 CAN_COMPLETE_NORMALLY (node) = 1;
12060 /* There are cases were wfl_op1 is a WFL. patch_array_ref knows
12061 how to handle those cases. */
12062 wfl_op1 = TREE_OPERAND (node, 0);
12063 TREE_OPERAND (node, 0) = java_complete_tree (wfl_op1);
12064 if (TREE_OPERAND (node, 0) == error_mark_node)
12065 return error_mark_node;
12066 if (!flag_emit_class_files && !flag_emit_xref)
12067 TREE_OPERAND (node, 0) = save_expr (TREE_OPERAND (node, 0));
12068 /* The same applies to wfl_op2 */
12069 wfl_op2 = TREE_OPERAND (node, 1);
12070 TREE_OPERAND (node, 1) = java_complete_tree (wfl_op2);
12071 if (TREE_OPERAND (node, 1) == error_mark_node)
12072 return error_mark_node;
12073 if (!flag_emit_class_files && !flag_emit_xref)
12074 TREE_OPERAND (node, 1) = save_expr (TREE_OPERAND (node, 1));
12075 return patch_array_ref (node);
12080 case COMPONENT_REF:
12081 /* The first step in the re-write of qualified name handling. FIXME.
12082 So far, this is only to support PRIMTYPE.class -> PRIMCLASS.TYPE. */
12083 TREE_OPERAND (node, 0) = java_complete_tree (TREE_OPERAND (node, 0));
12084 if (TREE_CODE (TREE_OPERAND (node, 0)) == RECORD_TYPE)
12086 tree name = TREE_OPERAND (node, 1);
12087 tree field = lookup_field_wrapper (TREE_OPERAND (node, 0), name);
12088 if (field == NULL_TREE)
12090 error ("missing static field `%s'", IDENTIFIER_POINTER (name));
12091 return error_mark_node;
12093 if (! FIELD_STATIC (field))
12095 error ("not a static field `%s'", IDENTIFIER_POINTER (name));
12096 return error_mark_node;
12105 /* Can't use THIS in a static environment */
12108 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
12109 parse_error_context (wfl_operator,
12110 "Keyword `this' used outside allowed context");
12111 TREE_TYPE (node) = error_mark_node;
12112 return error_mark_node;
12114 if (ctxp->explicit_constructor_p)
12116 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
12117 parse_error_context
12118 (wfl_operator, "Can't reference `this' or `super' before the superclass constructor has been called");
12119 TREE_TYPE (node) = error_mark_node;
12120 return error_mark_node;
12122 return current_this;
12124 case CLASS_LITERAL:
12125 CAN_COMPLETE_NORMALLY (node) = 1;
12126 node = patch_incomplete_class_ref (node);
12127 if (node == error_mark_node)
12128 return error_mark_node;
12132 CAN_COMPLETE_NORMALLY (node) = 1;
12133 /* Ok: may be we have a STRING_CST or a crafted `StringBuffer'
12134 and it's time to turn it into the appropriate String object */
12135 if ((nn = patch_string (node)))
12138 internal_error ("No case for %s", tree_code_name [TREE_CODE (node)]);
12143 /* Complete function call's argument. Return a nonzero value is an
12144 error was found. */
12147 complete_function_arguments (tree node)
12152 ctxp->explicit_constructor_p += (CALL_EXPLICIT_CONSTRUCTOR_P (node) ? 1 : 0);
12153 for (cn = TREE_OPERAND (node, 1); cn; cn = TREE_CHAIN (cn))
12155 tree wfl = TREE_VALUE (cn), parm, temp;
12156 parm = java_complete_tree (wfl);
12158 if (parm == error_mark_node)
12163 /* If we have a string literal that we haven't transformed yet or a
12164 crafted string buffer, as a result of the use of the String
12165 `+' operator. Build `parm.toString()' and expand it. */
12166 if ((temp = patch_string (parm)))
12169 TREE_VALUE (cn) = parm;
12171 ctxp->explicit_constructor_p -= (CALL_EXPLICIT_CONSTRUCTOR_P (node) ? 1 : 0);
12175 /* Sometimes (for loops and variable initialized during their
12176 declaration), we want to wrap a statement around a WFL and turn it
12180 build_debugable_stmt (int location, tree stmt)
12182 if (TREE_CODE (stmt) != EXPR_WITH_FILE_LOCATION)
12184 stmt = build_expr_wfl (stmt, input_filename, 0, 0);
12185 EXPR_WFL_LINECOL (stmt) = location;
12187 JAVA_MAYBE_GENERATE_DEBUG_INFO (stmt);
12192 build_expr_block (tree body, tree decls)
12194 tree node = make_node (BLOCK);
12195 BLOCK_EXPR_DECLS (node) = decls;
12196 BLOCK_EXPR_BODY (node) = body;
12198 TREE_TYPE (node) = TREE_TYPE (body);
12199 TREE_SIDE_EFFECTS (node) = 1;
12203 /* Create a new function block and link it appropriately to current
12204 function block chain */
12209 tree b = build_expr_block (NULL_TREE, NULL_TREE);
12211 /* Link block B supercontext to the previous block. The current
12212 function DECL is used as supercontext when enter_a_block is called
12213 for the first time for a given function. The current function body
12214 (DECL_FUNCTION_BODY) is set to be block B. */
12216 tree fndecl = current_function_decl;
12219 BLOCK_SUPERCONTEXT (b) = current_static_block;
12220 current_static_block = b;
12223 else if (!DECL_FUNCTION_BODY (fndecl))
12225 BLOCK_SUPERCONTEXT (b) = fndecl;
12226 DECL_FUNCTION_BODY (fndecl) = b;
12230 BLOCK_SUPERCONTEXT (b) = DECL_FUNCTION_BODY (fndecl);
12231 DECL_FUNCTION_BODY (fndecl) = b;
12236 /* Exit a block by changing the current function body
12237 (DECL_FUNCTION_BODY) to the current block super context, only if
12238 the block being exited isn't the method's top level one. */
12244 if (current_function_decl)
12246 b = DECL_FUNCTION_BODY (current_function_decl);
12247 if (BLOCK_SUPERCONTEXT (b) != current_function_decl)
12248 DECL_FUNCTION_BODY (current_function_decl) = BLOCK_SUPERCONTEXT (b);
12252 b = current_static_block;
12254 if (BLOCK_SUPERCONTEXT (b))
12255 current_static_block = BLOCK_SUPERCONTEXT (b);
12260 /* Lookup for NAME in the nested function's blocks, all the way up to
12261 the current toplevel one. It complies with Java's local variable
12265 lookup_name_in_blocks (tree name)
12267 tree b = GET_CURRENT_BLOCK (current_function_decl);
12269 while (b != current_function_decl)
12273 /* Paranoid sanity check. To be removed */
12274 if (TREE_CODE (b) != BLOCK)
12277 for (current = BLOCK_EXPR_DECLS (b); current;
12278 current = TREE_CHAIN (current))
12279 if (DECL_NAME (current) == name)
12281 b = BLOCK_SUPERCONTEXT (b);
12287 maybe_absorb_scoping_blocks (void)
12289 while (BLOCK_IS_IMPLICIT (GET_CURRENT_BLOCK (current_function_decl)))
12291 tree b = exit_block ();
12292 java_method_add_stmt (current_function_decl, b);
12293 SOURCE_FRONTEND_DEBUG (("Absorbing scoping block at line %d", input_line));
12298 /* This section of the source is reserved to build_* functions that
12299 are building incomplete tree nodes and the patch_* functions that
12300 are completing them. */
12302 /* Wrap a non WFL node around a WFL. */
12305 build_wfl_wrap (tree node, int location)
12307 tree wfl, node_to_insert = node;
12309 /* We want to process THIS . xxx symbolically, to keep it consistent
12310 with the way we're processing SUPER. A THIS from a primary as a
12311 different form than a SUPER. Turn THIS into something symbolic */
12312 if (TREE_CODE (node) == THIS_EXPR)
12313 node_to_insert = wfl = build_wfl_node (this_identifier_node);
12315 wfl = build_expr_wfl (NULL_TREE, ctxp->filename, 0, 0);
12317 EXPR_WFL_LINECOL (wfl) = location;
12318 EXPR_WFL_QUALIFICATION (wfl) = build_tree_list (node_to_insert, NULL_TREE);
12322 /* Build a super() constructor invocation. Returns an empty statement if
12323 we're currently dealing with the class java.lang.Object. */
12326 build_super_invocation (tree mdecl)
12328 if (DECL_CONTEXT (mdecl) == object_type_node)
12329 return build_java_empty_stmt ();
12332 tree super_wfl = build_wfl_node (super_identifier_node);
12333 tree a = NULL_TREE, t;
12335 /* This is called after parsing is done, so the parser context
12336 won't be accurate. Set location info from current_class decl. */
12337 tree class_wfl = lookup_cl (TYPE_NAME (current_class));
12338 EXPR_WFL_LINECOL (super_wfl) = EXPR_WFL_LINECOL (class_wfl);
12340 /* If we're dealing with an anonymous class, pass the arguments
12341 of the crafted constructor along. */
12342 if (ANONYMOUS_CLASS_P (DECL_CONTEXT (mdecl)))
12344 SKIP_THIS_AND_ARTIFICIAL_PARMS (t, mdecl);
12345 for (; t != end_params_node; t = TREE_CHAIN (t))
12346 a = tree_cons (NULL_TREE, build_wfl_node (TREE_PURPOSE (t)), a);
12348 return build_method_invocation (super_wfl, a);
12352 /* Build a SUPER/THIS qualified method invocation. */
12355 build_this_super_qualified_invocation (int use_this, tree name, tree args,
12356 int lloc, int rloc)
12360 build_wfl_node (use_this ? this_identifier_node : super_identifier_node);
12361 EXPR_WFL_LINECOL (wfl) = lloc;
12362 invok = build_method_invocation (name, args);
12363 return make_qualified_primary (wfl, invok, rloc);
12366 /* Build an incomplete CALL_EXPR node. */
12369 build_method_invocation (tree name, tree args)
12371 tree call = build3 (CALL_EXPR, NULL_TREE, name, args, NULL_TREE);
12372 TREE_SIDE_EFFECTS (call) = 1;
12373 EXPR_WFL_LINECOL (call) = EXPR_WFL_LINECOL (name);
12377 /* Build an incomplete new xxx(...) node. */
12380 build_new_invocation (tree name, tree args)
12382 tree call = build3 (NEW_CLASS_EXPR, NULL_TREE, name, args, NULL_TREE);
12383 TREE_SIDE_EFFECTS (call) = 1;
12384 EXPR_WFL_LINECOL (call) = EXPR_WFL_LINECOL (name);
12388 /* Build an incomplete assignment expression. */
12391 build_assignment (int op, int op_location, tree lhs, tree rhs)
12394 /* Build the corresponding binop if we deal with a Compound
12395 Assignment operator. Mark the binop sub-tree as part of a
12396 Compound Assignment expression */
12397 if (op != ASSIGN_TK)
12399 rhs = build_binop (BINOP_LOOKUP (op), op_location, lhs, rhs);
12400 COMPOUND_ASSIGN_P (rhs) = 1;
12402 assignment = build2 (MODIFY_EXPR, NULL_TREE, lhs, rhs);
12403 TREE_SIDE_EFFECTS (assignment) = 1;
12404 EXPR_WFL_LINECOL (assignment) = op_location;
12408 /* Print an INTEGER_CST node as decimal in a static buffer, and return
12409 the buffer. This is used only for string conversion. */
12411 string_convert_int_cst (tree node)
12413 /* Long.MIN_VALUE is -9223372036854775808, 20 characters. */
12414 static char buffer[21];
12416 unsigned HOST_WIDE_INT lo = TREE_INT_CST_LOW (node);
12417 unsigned HOST_WIDE_INT hi = TREE_INT_CST_HIGH (node);
12418 char *p = buffer + sizeof (buffer);
12421 unsigned HOST_WIDE_INT hibit = (((unsigned HOST_WIDE_INT) 1)
12422 << (HOST_BITS_PER_WIDE_INT - 1));
12426 /* If negative, note the fact and negate the value. */
12436 /* Divide by 10 until there are no bits left. */
12439 unsigned HOST_WIDE_INT acc = 0;
12440 unsigned HOST_WIDE_INT outhi = 0, outlo = 0;
12443 /* Use long division to compute the result and the remainder. */
12444 for (i = 0; i < 2 * HOST_BITS_PER_WIDE_INT; ++i)
12446 /* Shift a bit into accumulator. */
12451 /* Shift the value. */
12457 /* Shift the correct bit into the result. */
12459 if ((outlo & hibit))
12469 /* '0' == 060 in Java, but might not be here (think EBCDIC). */
12470 *--p = '\060' + acc;
12478 *--p = '\055'; /* '-' == 055 in Java, but might not be here. */
12483 /* Print an INTEGER_CST node in a static buffer, and return the
12484 buffer. This is used only for error handling. */
12486 print_int_node (tree node)
12488 static char buffer [80];
12489 if (TREE_CONSTANT_OVERFLOW (node))
12490 sprintf (buffer, "<overflow>");
12492 if (TREE_INT_CST_HIGH (node) == 0)
12493 sprintf (buffer, HOST_WIDE_INT_PRINT_UNSIGNED,
12494 TREE_INT_CST_LOW (node));
12495 else if (TREE_INT_CST_HIGH (node) == -1
12496 && TREE_INT_CST_LOW (node) != 0)
12497 sprintf (buffer, "-" HOST_WIDE_INT_PRINT_UNSIGNED,
12498 -TREE_INT_CST_LOW (node));
12500 sprintf (buffer, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
12501 TREE_INT_CST_HIGH (node), TREE_INT_CST_LOW (node));
12507 /* Return 1 if an assignment to a FINAL is attempted in a non suitable
12510 /* 15.25 Assignment operators. */
12513 patch_assignment (tree node, tree wfl_op1)
12515 tree rhs = TREE_OPERAND (node, 1);
12516 tree lvalue = TREE_OPERAND (node, 0), llvalue;
12517 tree lhs_type = NULL_TREE, rhs_type, new_rhs = NULL_TREE;
12518 int error_found = 0;
12519 int lvalue_from_array = 0;
12522 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
12524 /* Lhs can be a named variable */
12525 if (JDECL_P (lvalue))
12527 lhs_type = TREE_TYPE (lvalue);
12529 /* Or Lhs can be an array access. */
12530 else if (TREE_CODE (lvalue) == ARRAY_REF)
12532 lhs_type = TREE_TYPE (lvalue);
12533 lvalue_from_array = 1;
12535 /* Or a field access */
12536 else if (TREE_CODE (lvalue) == COMPONENT_REF)
12537 lhs_type = TREE_TYPE (lvalue);
12538 /* Or a function return slot */
12539 else if (TREE_CODE (lvalue) == RESULT_DECL)
12541 /* If the return type is an integral type, then we create the
12542 RESULT_DECL with a promoted type, but we need to do these
12543 checks against the unpromoted type to ensure type safety. So
12544 here we look at the real type, not the type of the decl we
12546 lhs_type = TREE_TYPE (TREE_TYPE (current_function_decl));
12549 /* Otherwise, we might want to try to write into an optimized static
12550 final, this is an of a different nature, reported further on. */
12551 else if (TREE_CODE (wfl_op1) == EXPR_WITH_FILE_LOCATION
12552 && resolve_expression_name (wfl_op1, &llvalue))
12554 lhs_type = TREE_TYPE (lvalue);
12558 parse_error_context (wfl_op1, "Invalid left hand side of assignment");
12562 rhs_type = TREE_TYPE (rhs);
12564 /* 5.1 Try the assignment conversion for builtin type. */
12565 new_rhs = try_builtin_assignconv (wfl_op1, lhs_type, rhs);
12567 /* 5.2 If it failed, try a reference conversion */
12569 new_rhs = try_reference_assignconv (lhs_type, rhs);
12571 /* 15.25.2 If we have a compound assignment, convert RHS into the
12573 else if (COMPOUND_ASSIGN_P (TREE_OPERAND (node, 1)))
12574 new_rhs = convert (lhs_type, rhs);
12576 /* Explicit cast required. This is an error */
12579 char *t1 = xstrdup (lang_printable_name (TREE_TYPE (rhs), 0));
12580 char *t2 = xstrdup (lang_printable_name (lhs_type, 0));
12582 char operation [32]; /* Max size known */
12584 /* If the assignment is part of a declaration, we use the WFL of
12585 the declared variable to point out the error and call it a
12586 declaration problem. If the assignment is a genuine =
12587 operator, we call is a operator `=' problem, otherwise we
12588 call it an assignment problem. In both of these last cases,
12589 we use the WFL of the operator to indicate the error. */
12591 if (MODIFY_EXPR_FROM_INITIALIZATION_P (node))
12594 strcpy (operation, "declaration");
12598 wfl = wfl_operator;
12599 if (COMPOUND_ASSIGN_P (TREE_OPERAND (node, 1)))
12600 strcpy (operation, "assignment");
12601 else if (is_return)
12602 strcpy (operation, "`return'");
12604 strcpy (operation, "`='");
12607 if (!valid_cast_to_p (rhs_type, lhs_type))
12608 parse_error_context
12609 (wfl, "Incompatible type for %s. Can't convert `%s' to `%s'",
12610 operation, t1, t2);
12612 parse_error_context (wfl, "Incompatible type for %s. Explicit cast needed to convert `%s' to `%s'",
12613 operation, t1, t2);
12614 free (t1); free (t2);
12619 return error_mark_node;
12621 /* If we're processing a `return' statement, promote the actual type
12622 to the promoted type. */
12624 new_rhs = convert (TREE_TYPE (lvalue), new_rhs);
12626 /* 10.10: Array Store Exception runtime check */
12627 if (!flag_emit_class_files
12629 && lvalue_from_array
12630 && JREFERENCE_TYPE_P (TYPE_ARRAY_ELEMENT (lhs_type)))
12632 tree array, store_check, base, index_expr;
12634 /* Save RHS so that it doesn't get re-evaluated by the store check. */
12635 new_rhs = save_expr (new_rhs);
12637 /* Get the INDIRECT_REF. */
12638 array = TREE_OPERAND (TREE_OPERAND (lvalue, 0), 0);
12639 /* Get the array pointer expr. */
12640 array = TREE_OPERAND (array, 0);
12641 store_check = build_java_arraystore_check (array, new_rhs);
12643 index_expr = TREE_OPERAND (lvalue, 1);
12645 if (TREE_CODE (index_expr) == COMPOUND_EXPR)
12647 /* A COMPOUND_EXPR here is a bounds check. The bounds check must
12648 happen before the store check, so prepare to insert the store
12649 check within the second operand of the existing COMPOUND_EXPR. */
12655 index_expr = TREE_OPERAND (base, 1);
12656 TREE_OPERAND (base, 1) = build2 (COMPOUND_EXPR, TREE_TYPE (index_expr),
12657 store_check, index_expr);
12660 /* Final locals can be used as case values in switch
12661 statement. Prepare them for this eventuality. */
12662 if (TREE_CODE (lvalue) == VAR_DECL
12663 && DECL_FINAL (lvalue)
12664 && TREE_CONSTANT (new_rhs)
12665 && IDENTIFIER_LOCAL_VALUE (DECL_NAME (lvalue))
12666 && JINTEGRAL_TYPE_P (TREE_TYPE (lvalue))
12669 TREE_CONSTANT (lvalue) = 1;
12670 TREE_INVARIANT (lvalue) = 1;
12671 DECL_INITIAL (lvalue) = new_rhs;
12674 /* Copy the rhs if it's a reference. */
12675 if (! flag_check_references && ! flag_emit_class_files && optimize > 0)
12677 switch (TREE_CODE (new_rhs))
12681 case COMPONENT_REF:
12682 /* Transform a = foo.bar
12683 into a = ({int tmp; tmp = foo.bar;}).
12684 We need to ensure that if a read from memory fails
12685 because of a NullPointerException, a destination variable
12686 will remain unchanged. An explicit temporary does what
12689 If flag_check_references is set, this is unnecessary
12690 because we'll check each reference before doing any
12691 reads. If optimize is not set the result will never be
12692 written to a stack slot that contains the LHS. */
12694 tree tmp = build_decl (VAR_DECL, get_identifier ("<tmp>"),
12695 TREE_TYPE (new_rhs));
12696 tree block = make_node (BLOCK);
12698 = build2 (MODIFY_EXPR, TREE_TYPE (new_rhs), tmp, fold (new_rhs));
12699 DECL_CONTEXT (tmp) = current_function_decl;
12700 TREE_TYPE (block) = TREE_TYPE (new_rhs);
12701 BLOCK_VARS (block) = tmp;
12702 BLOCK_EXPR_BODY (block) = assignment;
12703 TREE_SIDE_EFFECTS (block) = 1;
12712 TREE_OPERAND (node, 0) = lvalue;
12713 TREE_OPERAND (node, 1) = new_rhs;
12714 TREE_TYPE (node) = lhs_type;
12718 /* Check that type SOURCE can be cast into type DEST. If the cast
12719 can't occur at all, return NULL; otherwise, return a possibly
12723 try_reference_assignconv (tree lhs_type, tree rhs)
12725 tree new_rhs = NULL_TREE;
12726 tree rhs_type = TREE_TYPE (rhs);
12728 if (!JPRIMITIVE_TYPE_P (rhs_type) && JREFERENCE_TYPE_P (lhs_type))
12730 /* `null' may be assigned to any reference type */
12731 if (rhs == null_pointer_node)
12732 new_rhs = null_pointer_node;
12733 /* Try the reference assignment conversion */
12734 else if (valid_ref_assignconv_cast_p (rhs_type, lhs_type, 0))
12736 /* This is a magic assignment that we process differently */
12737 else if (TREE_CODE (rhs) == JAVA_EXC_OBJ_EXPR)
12743 /* Check that RHS can be converted into LHS_TYPE by the assignment
12744 conversion (5.2), for the cases of RHS being a builtin type. Return
12745 NULL_TREE if the conversion fails or if because RHS isn't of a
12746 builtin type. Return a converted RHS if the conversion is possible. */
12749 try_builtin_assignconv (tree wfl_op1, tree lhs_type, tree rhs)
12751 tree new_rhs = NULL_TREE;
12752 tree rhs_type = TREE_TYPE (rhs);
12754 /* Handle boolean specially. */
12755 if (TREE_CODE (rhs_type) == BOOLEAN_TYPE
12756 || TREE_CODE (lhs_type) == BOOLEAN_TYPE)
12758 if (TREE_CODE (rhs_type) == BOOLEAN_TYPE
12759 && TREE_CODE (lhs_type) == BOOLEAN_TYPE)
12763 /* 5.1.1 Try Identity Conversion,
12764 5.1.2 Try Widening Primitive Conversion */
12765 else if (valid_builtin_assignconv_identity_widening_p (lhs_type, rhs_type))
12766 new_rhs = convert (lhs_type, rhs);
12768 /* Try a narrowing primitive conversion (5.1.3):
12769 - expression is a constant expression of type byte, short, char,
12771 - variable is byte, short or char AND
12772 - The value of the expression is representable in the type of the
12774 else if ((rhs_type == byte_type_node || rhs_type == short_type_node
12775 || rhs_type == char_type_node || rhs_type == int_type_node)
12776 && TREE_CONSTANT (rhs)
12777 && (lhs_type == byte_type_node || lhs_type == char_type_node
12778 || lhs_type == short_type_node))
12780 if (int_fits_type_p (rhs, lhs_type))
12781 new_rhs = convert (lhs_type, rhs);
12782 else if (wfl_op1) /* Might be called with a NULL */
12783 parse_warning_context
12784 (wfl_op1, "Constant expression `%s' too wide for narrowing primitive conversion to `%s'",
12785 print_int_node (rhs), lang_printable_name (lhs_type, 0));
12786 /* Reported a warning that will turn into an error further
12787 down, so we don't return */
12793 /* Return 1 if RHS_TYPE can be converted to LHS_TYPE by identity
12794 conversion (5.1.1) or widening primitive conversion (5.1.2). Return
12795 0 is the conversion test fails. This implements parts the method
12796 invocation conversion (5.3). */
12799 valid_builtin_assignconv_identity_widening_p (tree lhs_type, tree rhs_type)
12801 /* 5.1.1: This is the identity conversion part. */
12802 if (lhs_type == rhs_type)
12805 /* Reject non primitive types and boolean conversions. */
12806 if (!JNUMERIC_TYPE_P (lhs_type) || !JNUMERIC_TYPE_P (rhs_type))
12809 /* 5.1.2: widening primitive conversion. byte, even if it's smaller
12810 than a char can't be converted into a char. Short can't too, but
12811 the < test below takes care of that */
12812 if (lhs_type == char_type_node && rhs_type == byte_type_node)
12815 /* Accept all promoted type here. Note, we can't use <= in the test
12816 below, because we still need to bounce out assignments of short
12817 to char and the likes */
12818 if (lhs_type == int_type_node
12819 && (rhs_type == promoted_byte_type_node
12820 || rhs_type == promoted_short_type_node
12821 || rhs_type == promoted_char_type_node
12822 || rhs_type == promoted_boolean_type_node))
12825 /* From here, an integral is widened if its precision is smaller
12826 than the precision of the LHS or if the LHS is a floating point
12827 type, or the RHS is a float and the RHS a double. */
12828 if ((JINTEGRAL_TYPE_P (rhs_type) && JINTEGRAL_TYPE_P (lhs_type)
12829 && (TYPE_PRECISION (rhs_type) < TYPE_PRECISION (lhs_type)))
12830 || (JINTEGRAL_TYPE_P (rhs_type) && JFLOAT_TYPE_P (lhs_type))
12831 || (rhs_type == float_type_node && lhs_type == double_type_node))
12837 /* Check that something of SOURCE type can be assigned or cast to
12838 something of DEST type at runtime. Return 1 if the operation is
12839 valid, 0 otherwise. If CAST is set to 1, we're treating the case
12840 were SOURCE is cast into DEST, which borrows a lot of the
12841 assignment check. */
12844 valid_ref_assignconv_cast_p (tree source, tree dest, int cast)
12846 /* SOURCE or DEST might be null if not from a declared entity. */
12847 if (!source || !dest)
12849 if (JNULLP_TYPE_P (source))
12851 if (TREE_CODE (source) == POINTER_TYPE)
12852 source = TREE_TYPE (source);
12853 if (TREE_CODE (dest) == POINTER_TYPE)
12854 dest = TREE_TYPE (dest);
12856 /* If source and dest are being compiled from bytecode, they may need to
12858 if (CLASS_P (source) && !CLASS_LOADED_P (source))
12860 load_class (source, 1);
12861 safe_layout_class (source);
12863 if (CLASS_P (dest) && !CLASS_LOADED_P (dest))
12865 load_class (dest, 1);
12866 safe_layout_class (dest);
12869 /* Case where SOURCE is a class type */
12870 if (TYPE_CLASS_P (source))
12872 if (TYPE_CLASS_P (dest))
12873 return (source == dest
12874 || inherits_from_p (source, dest)
12875 || (cast && inherits_from_p (dest, source)));
12876 if (TYPE_INTERFACE_P (dest))
12878 /* If doing a cast and SOURCE is final, the operation is
12879 always correct a compile time (because even if SOURCE
12880 does not implement DEST, a subclass of SOURCE might). */
12881 if (cast && !CLASS_FINAL (TYPE_NAME (source)))
12883 /* Otherwise, SOURCE must implement DEST */
12884 return interface_of_p (dest, source);
12886 /* DEST is an array, cast permitted if SOURCE is of Object type */
12887 return (cast && source == object_type_node ? 1 : 0);
12889 if (TYPE_INTERFACE_P (source))
12891 if (TYPE_CLASS_P (dest))
12893 /* If not casting, DEST must be the Object type */
12895 return dest == object_type_node;
12896 /* We're doing a cast. The cast is always valid is class
12897 DEST is not final, otherwise, DEST must implement SOURCE */
12898 else if (!CLASS_FINAL (TYPE_NAME (dest)))
12901 return interface_of_p (source, dest);
12903 if (TYPE_INTERFACE_P (dest))
12905 /* If doing a cast, then if SOURCE and DEST contain method
12906 with the same signature but different return type, then
12907 this is a (compile time) error */
12910 tree method_source, method_dest;
12914 for (method_source = TYPE_METHODS (source); method_source;
12915 method_source = TREE_CHAIN (method_source))
12918 build_java_argument_signature (TREE_TYPE (method_source));
12919 source_type = TREE_TYPE (TREE_TYPE (method_source));
12920 source_name = DECL_NAME (method_source);
12921 for (method_dest = TYPE_METHODS (dest);
12922 method_dest; method_dest = TREE_CHAIN (method_dest))
12924 build_java_argument_signature (TREE_TYPE (method_dest))
12925 && source_name == DECL_NAME (method_dest)
12926 && source_type != TREE_TYPE (TREE_TYPE (method_dest)))
12932 return source == dest || interface_of_p (dest, source);
12938 && (DECL_NAME (TYPE_NAME (source))
12939 == java_lang_cloneable_identifier_node
12940 || (DECL_NAME (TYPE_NAME (source))
12941 == java_io_serializable_identifier_node)));
12944 if (TYPE_ARRAY_P (source))
12946 if (TYPE_CLASS_P (dest))
12947 return dest == object_type_node;
12948 /* Can't cast an array to an interface unless the interface is
12949 java.lang.Cloneable or java.io.Serializable. */
12950 if (TYPE_INTERFACE_P (dest))
12951 return (DECL_NAME (TYPE_NAME (dest))
12952 == java_lang_cloneable_identifier_node
12953 || (DECL_NAME (TYPE_NAME (dest))
12954 == java_io_serializable_identifier_node));
12957 tree source_element_type = TYPE_ARRAY_ELEMENT (source);
12958 tree dest_element_type = TYPE_ARRAY_ELEMENT (dest);
12960 /* In case of severe errors, they turn out null */
12961 if (!dest_element_type || !source_element_type)
12963 if (source_element_type == dest_element_type)
12965 return valid_ref_assignconv_cast_p (source_element_type,
12966 dest_element_type, cast);
12974 valid_cast_to_p (tree source, tree dest)
12976 if (TREE_CODE (source) == POINTER_TYPE)
12977 source = TREE_TYPE (source);
12978 if (TREE_CODE (dest) == POINTER_TYPE)
12979 dest = TREE_TYPE (dest);
12981 if (TREE_CODE (source) == RECORD_TYPE && TREE_CODE (dest) == RECORD_TYPE)
12982 return valid_ref_assignconv_cast_p (source, dest, 1);
12984 else if (JNUMERIC_TYPE_P (source) && JNUMERIC_TYPE_P (dest))
12987 else if (TREE_CODE (source) == BOOLEAN_TYPE
12988 && TREE_CODE (dest) == BOOLEAN_TYPE)
12995 do_unary_numeric_promotion (tree arg)
12997 tree type = TREE_TYPE (arg);
12998 if ((TREE_CODE (type) == INTEGER_TYPE && TYPE_PRECISION (type) < 32)
12999 || TREE_CODE (type) == CHAR_TYPE)
13000 arg = convert (int_type_node, arg);
13004 /* Return a nonzero value if SOURCE can be converted into DEST using
13005 the method invocation conversion rule (5.3). */
13007 valid_method_invocation_conversion_p (tree dest, tree source)
13009 return ((JPRIMITIVE_TYPE_P (source) && JPRIMITIVE_TYPE_P (dest)
13010 && valid_builtin_assignconv_identity_widening_p (dest, source))
13011 || ((JREFERENCE_TYPE_P (source) || JNULLP_TYPE_P (source))
13012 && (JREFERENCE_TYPE_P (dest) || JNULLP_TYPE_P (dest))
13013 && valid_ref_assignconv_cast_p (source, dest, 0)));
13016 /* Build an incomplete binop expression. */
13019 build_binop (enum tree_code op, int op_location, tree op1, tree op2)
13021 tree binop = build2 (op, NULL_TREE, op1, op2);
13022 TREE_SIDE_EFFECTS (binop) = 1;
13023 /* Store the location of the operator, for better error report. The
13024 string of the operator will be rebuild based on the OP value. */
13025 EXPR_WFL_LINECOL (binop) = op_location;
13029 /* Build the string of the operator retained by NODE. If NODE is part
13030 of a compound expression, add an '=' at the end of the string. This
13031 function is called when an error needs to be reported on an
13032 operator. The string is returned as a pointer to a static character
13036 operator_string (tree node)
13038 #define BUILD_OPERATOR_STRING(S) \
13040 sprintf (buffer, "%s%s", S, (COMPOUND_ASSIGN_P (node) ? "=" : "")); \
13044 static char buffer [10];
13045 switch (TREE_CODE (node))
13047 case MULT_EXPR: BUILD_OPERATOR_STRING ("*");
13048 case RDIV_EXPR: BUILD_OPERATOR_STRING ("/");
13049 case TRUNC_MOD_EXPR: BUILD_OPERATOR_STRING ("%");
13050 case PLUS_EXPR: BUILD_OPERATOR_STRING ("+");
13051 case MINUS_EXPR: BUILD_OPERATOR_STRING ("-");
13052 case LSHIFT_EXPR: BUILD_OPERATOR_STRING ("<<");
13053 case RSHIFT_EXPR: BUILD_OPERATOR_STRING (">>");
13054 case URSHIFT_EXPR: BUILD_OPERATOR_STRING (">>>");
13055 case BIT_AND_EXPR: BUILD_OPERATOR_STRING ("&");
13056 case BIT_XOR_EXPR: BUILD_OPERATOR_STRING ("^");
13057 case BIT_IOR_EXPR: BUILD_OPERATOR_STRING ("|");
13058 case TRUTH_ANDIF_EXPR: BUILD_OPERATOR_STRING ("&&");
13059 case TRUTH_ORIF_EXPR: BUILD_OPERATOR_STRING ("||");
13060 case EQ_EXPR: BUILD_OPERATOR_STRING ("==");
13061 case NE_EXPR: BUILD_OPERATOR_STRING ("!=");
13062 case GT_EXPR: BUILD_OPERATOR_STRING (">");
13063 case GE_EXPR: BUILD_OPERATOR_STRING (">=");
13064 case LT_EXPR: BUILD_OPERATOR_STRING ("<");
13065 case LE_EXPR: BUILD_OPERATOR_STRING ("<=");
13066 case UNARY_PLUS_EXPR: BUILD_OPERATOR_STRING ("+");
13067 case NEGATE_EXPR: BUILD_OPERATOR_STRING ("-");
13068 case TRUTH_NOT_EXPR: BUILD_OPERATOR_STRING ("!");
13069 case BIT_NOT_EXPR: BUILD_OPERATOR_STRING ("~");
13070 case PREINCREMENT_EXPR: /* Fall through */
13071 case POSTINCREMENT_EXPR: BUILD_OPERATOR_STRING ("++");
13072 case PREDECREMENT_EXPR: /* Fall through */
13073 case POSTDECREMENT_EXPR: BUILD_OPERATOR_STRING ("--");
13075 internal_error ("unregistered operator %s",
13076 tree_code_name [TREE_CODE (node)]);
13079 #undef BUILD_OPERATOR_STRING
13082 /* Return 1 if VAR_ACCESS1 is equivalent to VAR_ACCESS2. */
13085 java_decl_equiv (tree var_acc1, tree var_acc2)
13087 if (JDECL_P (var_acc1))
13088 return (var_acc1 == var_acc2);
13090 return (TREE_CODE (var_acc1) == COMPONENT_REF
13091 && TREE_CODE (var_acc2) == COMPONENT_REF
13092 && TREE_OPERAND (TREE_OPERAND (var_acc1, 0), 0)
13093 == TREE_OPERAND (TREE_OPERAND (var_acc2, 0), 0)
13094 && TREE_OPERAND (var_acc1, 1) == TREE_OPERAND (var_acc2, 1));
13097 /* Return a nonzero value if CODE is one of the operators that can be
13098 used in conjunction with the `=' operator in a compound assignment. */
13101 binop_compound_p (enum tree_code code)
13104 for (i = 0; i < BINOP_COMPOUND_CANDIDATES; i++)
13105 if (binop_lookup [i] == code)
13108 return i < BINOP_COMPOUND_CANDIDATES;
13111 /* Reorganize after a fold to get SAVE_EXPR to generate what we want. */
13114 java_refold (tree t)
13116 tree c, b, ns, decl;
13118 if (TREE_CODE (t) != MODIFY_EXPR)
13121 c = TREE_OPERAND (t, 1);
13122 if (! (c && TREE_CODE (c) == COMPOUND_EXPR
13123 && TREE_CODE (TREE_OPERAND (c, 0)) == MODIFY_EXPR
13124 && binop_compound_p (TREE_CODE (TREE_OPERAND (c, 1)))))
13127 /* Now the left branch of the binary operator. */
13128 b = TREE_OPERAND (TREE_OPERAND (c, 1), 0);
13129 if (! (b && TREE_CODE (b) == NOP_EXPR
13130 && TREE_CODE (TREE_OPERAND (b, 0)) == SAVE_EXPR))
13133 ns = TREE_OPERAND (TREE_OPERAND (b, 0), 0);
13134 if (! (ns && TREE_CODE (ns) == NOP_EXPR
13135 && TREE_CODE (TREE_OPERAND (ns, 0)) == SAVE_EXPR))
13138 decl = TREE_OPERAND (TREE_OPERAND (ns, 0), 0);
13139 if ((JDECL_P (decl) || TREE_CODE (decl) == COMPONENT_REF)
13140 /* It's got to be the an equivalent decl */
13141 && java_decl_equiv (decl, TREE_OPERAND (TREE_OPERAND (c, 0), 0)))
13143 /* Shorten the NOP_EXPR/SAVE_EXPR path. */
13144 TREE_OPERAND (TREE_OPERAND (c, 1), 0) = TREE_OPERAND (ns, 0);
13145 /* Substitute the COMPOUND_EXPR by the BINOP_EXPR */
13146 TREE_OPERAND (t, 1) = TREE_OPERAND (c, 1);
13147 /* Change the right part of the BINOP_EXPR */
13148 TREE_OPERAND (TREE_OPERAND (t, 1), 1) = TREE_OPERAND (c, 0);
13154 /* Binary operators (15.16 up to 15.18). We return error_mark_node on
13155 errors but we modify NODE so that it contains the type computed
13156 according to the expression, when it's fixed. Otherwise, we write
13157 error_mark_node as the type. It allows us to further the analysis
13158 of remaining nodes and detects more errors in certain cases. */
13161 patch_binop (tree node, tree wfl_op1, tree wfl_op2)
13163 tree op1 = TREE_OPERAND (node, 0);
13164 tree op2 = TREE_OPERAND (node, 1);
13165 tree op1_type = TREE_TYPE (op1);
13166 tree op2_type = TREE_TYPE (op2);
13167 tree prom_type = NULL_TREE, cn;
13168 enum tree_code code = TREE_CODE (node);
13170 /* If 1, tell the routine that we have to return error_mark_node
13171 after checking for the initialization of the RHS */
13172 int error_found = 0;
13174 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
13176 /* If either op<n>_type are NULL, this might be early signs of an
13177 error situation, unless it's too early to tell (in case we're
13178 handling a `+', `==', `!=' or `instanceof'.) We want to set op<n>_type
13179 correctly so the error can be later on reported accurately. */
13180 if (! (code == PLUS_EXPR || code == NE_EXPR
13181 || code == EQ_EXPR || code == INSTANCEOF_EXPR))
13186 n = java_complete_tree (op1);
13187 op1_type = TREE_TYPE (n);
13191 n = java_complete_tree (op2);
13192 op2_type = TREE_TYPE (n);
13198 /* 15.16 Multiplicative operators */
13199 case MULT_EXPR: /* 15.16.1 Multiplication Operator * */
13200 case RDIV_EXPR: /* 15.16.2 Division Operator / */
13201 case TRUNC_DIV_EXPR: /* 15.16.2 Integral type Division Operator / */
13202 case TRUNC_MOD_EXPR: /* 15.16.3 Remainder operator % */
13203 if (!JNUMERIC_TYPE_P (op1_type) || !JNUMERIC_TYPE_P (op2_type))
13205 if (!JNUMERIC_TYPE_P (op1_type))
13206 ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op1_type);
13207 if (!JNUMERIC_TYPE_P (op2_type) && (op1_type != op2_type))
13208 ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op2_type);
13209 TREE_TYPE (node) = error_mark_node;
13213 prom_type = binary_numeric_promotion (op1_type, op2_type, &op1, &op2);
13215 /* Detect integral division by zero */
13216 if ((code == RDIV_EXPR || code == TRUNC_MOD_EXPR)
13217 && TREE_CODE (prom_type) == INTEGER_TYPE
13218 && (op2 == integer_zero_node || op2 == long_zero_node ||
13219 (TREE_CODE (op2) == INTEGER_CST &&
13220 ! TREE_INT_CST_LOW (op2) && ! TREE_INT_CST_HIGH (op2))))
13222 parse_warning_context (wfl_operator, "Evaluating this expression will result in an arithmetic exception being thrown");
13223 TREE_CONSTANT (node) = 0;
13224 TREE_INVARIANT (node) = 0;
13227 /* Change the division operator if necessary */
13228 if (code == RDIV_EXPR && TREE_CODE (prom_type) == INTEGER_TYPE)
13229 TREE_SET_CODE (node, TRUNC_DIV_EXPR);
13231 /* Before divisions as is disappear, try to simplify and bail if
13232 applicable, otherwise we won't perform even simple
13233 simplifications like (1-1)/3. We can't do that with floating
13234 point number, folds can't handle them at this stage. */
13235 if (code == RDIV_EXPR && TREE_CONSTANT (op1) && TREE_CONSTANT (op2)
13236 && JINTEGRAL_TYPE_P (op1) && JINTEGRAL_TYPE_P (op2))
13238 TREE_TYPE (node) = prom_type;
13239 node = fold (node);
13240 if (TREE_CODE (node) != code)
13244 if (TREE_CODE (prom_type) == INTEGER_TYPE
13245 && flag_use_divide_subroutine
13246 && ! flag_emit_class_files
13247 && (code == RDIV_EXPR || code == TRUNC_MOD_EXPR))
13248 return build_java_soft_divmod (TREE_CODE (node), prom_type, op1, op2);
13250 /* This one is more complicated. FLOATs are processed by a
13251 function call to soft_fmod. Duplicate the value of the
13252 COMPOUND_ASSIGN_P flag. */
13253 if (code == TRUNC_MOD_EXPR)
13255 tree mod = build_java_binop (TRUNC_MOD_EXPR, prom_type, op1, op2);
13256 COMPOUND_ASSIGN_P (mod) = COMPOUND_ASSIGN_P (node);
13257 TREE_SIDE_EFFECTS (mod)
13258 = TREE_SIDE_EFFECTS (op1) | TREE_SIDE_EFFECTS (op2);
13263 /* 15.17 Additive Operators */
13264 case PLUS_EXPR: /* 15.17.1 String Concatenation Operator + */
13266 /* Operation is valid if either one argument is a string
13267 constant, a String object or a StringBuffer crafted for the
13268 purpose of the a previous usage of the String concatenation
13271 if (TREE_CODE (op1) == STRING_CST
13272 || TREE_CODE (op2) == STRING_CST
13273 || JSTRING_TYPE_P (op1_type)
13274 || JSTRING_TYPE_P (op2_type)
13275 || IS_CRAFTED_STRING_BUFFER_P (op1)
13276 || IS_CRAFTED_STRING_BUFFER_P (op2))
13277 return build_string_concatenation (op1, op2);
13279 case MINUS_EXPR: /* 15.17.2 Additive Operators (+ and -) for
13281 if (!JNUMERIC_TYPE_P (op1_type) || !JNUMERIC_TYPE_P (op2_type))
13283 if (!JNUMERIC_TYPE_P (op1_type))
13284 ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op1_type);
13285 if (!JNUMERIC_TYPE_P (op2_type) && (op1_type != op2_type))
13286 ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op2_type);
13287 TREE_TYPE (node) = error_mark_node;
13291 prom_type = binary_numeric_promotion (op1_type, op2_type, &op1, &op2);
13294 /* 15.18 Shift Operators */
13298 if (!JINTEGRAL_TYPE_P (op1_type) || !JINTEGRAL_TYPE_P (op2_type))
13300 if (!JINTEGRAL_TYPE_P (op1_type))
13301 ERROR_CAST_NEEDED_TO_INTEGRAL (wfl_operator, node, op1_type);
13304 if (JNUMERIC_TYPE_P (op2_type))
13305 parse_error_context (wfl_operator,
13306 "Incompatible type for `%s'. Explicit cast needed to convert shift distance from `%s' to integral",
13307 operator_string (node),
13308 lang_printable_name (op2_type, 0));
13310 parse_error_context (wfl_operator,
13311 "Incompatible type for `%s'. Can't convert shift distance from `%s' to integral",
13312 operator_string (node),
13313 lang_printable_name (op2_type, 0));
13315 TREE_TYPE (node) = error_mark_node;
13320 /* Unary numeric promotion (5.6.1) is performed on each operand
13322 op1 = do_unary_numeric_promotion (op1);
13323 op2 = do_unary_numeric_promotion (op2);
13325 /* If the right hand side is of type `long', first cast it to
13327 if (TREE_TYPE (op2) == long_type_node)
13328 op2 = build1 (CONVERT_EXPR, int_type_node, op2);
13330 /* The type of the shift expression is the type of the promoted
13331 type of the left-hand operand */
13332 prom_type = TREE_TYPE (op1);
13334 /* Shift int only up to 0x1f and long up to 0x3f */
13335 if (prom_type == int_type_node)
13336 op2 = fold (build2 (BIT_AND_EXPR, int_type_node, op2,
13337 build_int_cst (NULL_TREE, 0x1f, 0)));
13339 op2 = fold (build2 (BIT_AND_EXPR, int_type_node, op2,
13340 build_int_cst (NULL_TREE, 0x3f, 0)));
13342 /* The >>> operator is a >> operating on unsigned quantities */
13343 if (code == URSHIFT_EXPR && ! flag_emit_class_files)
13346 tree utype = java_unsigned_type (prom_type);
13347 op1 = convert (utype, op1);
13348 TREE_SET_CODE (node, RSHIFT_EXPR);
13349 TREE_OPERAND (node, 0) = op1;
13350 TREE_OPERAND (node, 1) = op2;
13351 TREE_TYPE (node) = utype;
13352 to_return = convert (prom_type, node);
13353 /* Copy the original value of the COMPOUND_ASSIGN_P flag */
13354 COMPOUND_ASSIGN_P (to_return) = COMPOUND_ASSIGN_P (node);
13355 TREE_SIDE_EFFECTS (to_return)
13356 = TREE_SIDE_EFFECTS (op1) | TREE_SIDE_EFFECTS (op2);
13361 /* 15.19.1 Type Comparison Operator instanceof */
13362 case INSTANCEOF_EXPR:
13364 TREE_TYPE (node) = boolean_type_node;
13366 /* OP1_TYPE might be NULL when OP1 is a string constant. */
13367 if ((cn = patch_string (op1)))
13370 op1_type = TREE_TYPE (op1);
13372 if (op1_type == NULL_TREE)
13375 if (!(op2_type = resolve_type_during_patch (op2)))
13376 return error_mark_node;
13378 /* The first operand must be a reference type or the null type */
13379 if (!JREFERENCE_TYPE_P (op1_type) && op1 != null_pointer_node)
13380 error_found = 1; /* Error reported further below */
13382 /* The second operand must be a reference type */
13383 if (!JREFERENCE_TYPE_P (op2_type))
13385 SET_WFL_OPERATOR (wfl_operator, node, wfl_op2);
13386 parse_error_context
13387 (wfl_operator, "Invalid argument `%s' for `instanceof'",
13388 lang_printable_name (op2_type, 0));
13392 if (!error_found && valid_ref_assignconv_cast_p (op1_type, op2_type, 1))
13394 /* If the first operand is null, the result is always false */
13395 if (op1 == null_pointer_node)
13396 return boolean_false_node;
13397 else if (flag_emit_class_files)
13399 TREE_OPERAND (node, 1) = op2_type;
13400 TREE_SIDE_EFFECTS (node) = TREE_SIDE_EFFECTS (op1);
13403 /* Otherwise we have to invoke instance of to figure it out */
13405 return build_instanceof (op1, op2_type);
13407 /* There is no way the expression operand can be an instance of
13408 the type operand. This is a compile time error. */
13411 char *t1 = xstrdup (lang_printable_name (op1_type, 0));
13412 SET_WFL_OPERATOR (wfl_operator, node, wfl_op1);
13413 parse_error_context
13414 (wfl_operator, "Impossible for `%s' to be instance of `%s'",
13415 t1, lang_printable_name (op2_type, 0));
13422 /* 15.21 Bitwise and Logical Operators */
13426 if (JINTEGRAL_TYPE_P (op1_type) && JINTEGRAL_TYPE_P (op2_type))
13427 /* Binary numeric promotion is performed on both operand and the
13428 expression retain that type */
13429 prom_type = binary_numeric_promotion (op1_type, op2_type, &op1, &op2);
13431 else if (TREE_CODE (op1_type) == BOOLEAN_TYPE
13432 && TREE_CODE (op1_type) == BOOLEAN_TYPE)
13433 /* The type of the bitwise operator expression is BOOLEAN */
13434 prom_type = boolean_type_node;
13437 if (!JINTEGRAL_TYPE_P (op1_type))
13438 ERROR_CAST_NEEDED_TO_INTEGRAL (wfl_operator, node, op1_type);
13439 if (!JINTEGRAL_TYPE_P (op2_type) && (op1_type != op2_type))
13440 ERROR_CAST_NEEDED_TO_INTEGRAL (wfl_operator, node, op2_type);
13441 TREE_TYPE (node) = error_mark_node;
13443 /* Insert a break here if adding thing before the switch's
13444 break for this case */
13448 /* 15.22 Conditional-And Operator */
13449 case TRUTH_ANDIF_EXPR:
13450 /* 15.23 Conditional-Or Operator */
13451 case TRUTH_ORIF_EXPR:
13452 /* Operands must be of BOOLEAN type */
13453 if (TREE_CODE (op1_type) != BOOLEAN_TYPE ||
13454 TREE_CODE (op2_type) != BOOLEAN_TYPE)
13456 if (TREE_CODE (op1_type) != BOOLEAN_TYPE)
13457 ERROR_CANT_CONVERT_TO_BOOLEAN (wfl_operator, node, op1_type);
13458 if (TREE_CODE (op2_type) != BOOLEAN_TYPE && (op1_type != op2_type))
13459 ERROR_CANT_CONVERT_TO_BOOLEAN (wfl_operator, node, op2_type);
13460 TREE_TYPE (node) = boolean_type_node;
13464 else if (integer_zerop (op1))
13466 return code == TRUTH_ANDIF_EXPR ? op1 : op2;
13468 else if (integer_onep (op1))
13470 return code == TRUTH_ANDIF_EXPR ? op2 : op1;
13472 /* The type of the conditional operators is BOOLEAN */
13473 prom_type = boolean_type_node;
13476 /* 15.19.1 Numerical Comparison Operators <, <=, >, >= */
13481 /* The type of each of the operands must be a primitive numeric
13483 if (!JNUMERIC_TYPE_P (op1_type) || ! JNUMERIC_TYPE_P (op2_type))
13485 if (!JNUMERIC_TYPE_P (op1_type))
13486 ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op1_type);
13487 if (!JNUMERIC_TYPE_P (op2_type) && (op1_type != op2_type))
13488 ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op2_type);
13489 TREE_TYPE (node) = boolean_type_node;
13493 /* Binary numeric promotion is performed on the operands */
13494 binary_numeric_promotion (op1_type, op2_type, &op1, &op2);
13495 /* The type of the relation expression is always BOOLEAN */
13496 prom_type = boolean_type_node;
13499 /* 15.20 Equality Operator */
13502 /* It's time for us to patch the strings. */
13503 if ((cn = patch_string (op1)))
13506 op1_type = TREE_TYPE (op1);
13508 if ((cn = patch_string (op2)))
13511 op2_type = TREE_TYPE (op2);
13514 /* 15.20.1 Numerical Equality Operators == and != */
13515 /* Binary numeric promotion is performed on the operands */
13516 if (JNUMERIC_TYPE_P (op1_type) && JNUMERIC_TYPE_P (op2_type))
13517 binary_numeric_promotion (op1_type, op2_type, &op1, &op2);
13519 /* 15.20.2 Boolean Equality Operators == and != */
13520 else if (TREE_CODE (op1_type) == BOOLEAN_TYPE &&
13521 TREE_CODE (op2_type) == BOOLEAN_TYPE)
13522 ; /* Nothing to do here */
13524 /* 15.20.3 Reference Equality Operators == and != */
13525 /* Types have to be either references or the null type. If
13526 they're references, it must be possible to convert either
13527 type to the other by casting conversion. */
13528 else if (op1 == null_pointer_node || op2 == null_pointer_node
13529 || (JREFERENCE_TYPE_P (op1_type) && JREFERENCE_TYPE_P (op2_type)
13530 && (valid_ref_assignconv_cast_p (op1_type, op2_type, 1)
13531 || valid_ref_assignconv_cast_p (op2_type,
13533 ; /* Nothing to do here */
13535 /* Else we have an error figure what can't be converted into
13536 what and report the error */
13540 t1 = xstrdup (lang_printable_name (op1_type, 0));
13541 parse_error_context
13543 "Incompatible type for `%s'. Can't convert `%s' to `%s'",
13544 operator_string (node), t1,
13545 lang_printable_name (op2_type, 0));
13547 TREE_TYPE (node) = boolean_type_node;
13551 prom_type = boolean_type_node;
13558 return error_mark_node;
13560 TREE_OPERAND (node, 0) = op1;
13561 TREE_OPERAND (node, 1) = op2;
13562 TREE_TYPE (node) = prom_type;
13563 TREE_SIDE_EFFECTS (node) = TREE_SIDE_EFFECTS (op1) | TREE_SIDE_EFFECTS (op2);
13565 if (flag_emit_xref)
13568 /* fold does not respect side-effect order as required for Java but not C.
13569 * Also, it sometimes create SAVE_EXPRs which are bad when emitting
13572 if (flag_emit_class_files ? (TREE_CONSTANT (op1) && TREE_CONSTANT (op2))
13573 : ! TREE_SIDE_EFFECTS (node))
13574 node = fold (node);
13578 /* Concatenate the STRING_CST CSTE and STRING. When AFTER is a non
13579 zero value, the value of CSTE comes after the valude of STRING */
13582 do_merge_string_cste (tree cste, const char *string, int string_len, int after)
13584 const char *old = TREE_STRING_POINTER (cste);
13585 int old_len = TREE_STRING_LENGTH (cste);
13586 int len = old_len + string_len;
13587 char *new = alloca (len+1);
13591 memcpy (new, string, string_len);
13592 memcpy (&new [string_len], old, old_len);
13596 memcpy (new, old, old_len);
13597 memcpy (&new [old_len], string, string_len);
13600 return build_string (len, new);
13603 /* Tries to merge OP1 (a STRING_CST) and OP2 (if suitable). Return a
13604 new STRING_CST on success, NULL_TREE on failure. */
13607 merge_string_cste (tree op1, tree op2, int after)
13609 /* Handle two string constants right away. */
13610 if (TREE_CODE (op2) == STRING_CST)
13611 return do_merge_string_cste (op1, TREE_STRING_POINTER (op2),
13612 TREE_STRING_LENGTH (op2), after);
13614 /* Reasonable integer constant can be treated right away. */
13615 if (TREE_CODE (op2) == INTEGER_CST && !TREE_CONSTANT_OVERFLOW (op2))
13617 static const char *const boolean_true = "true";
13618 static const char *const boolean_false = "false";
13619 static const char *const null_pointer = "null";
13621 const char *string;
13623 if (op2 == boolean_true_node)
13624 string = boolean_true;
13625 else if (op2 == boolean_false_node)
13626 string = boolean_false;
13627 else if (op2 == null_pointer_node
13628 || (integer_zerop (op2)
13629 && TREE_CODE (TREE_TYPE (op2)) == POINTER_TYPE))
13630 /* FIXME: null is not a compile-time constant, so it is only safe to
13631 merge if the overall expression is non-constant. However, this
13632 code always merges without checking the overall expression. */
13633 string = null_pointer;
13634 else if (TREE_TYPE (op2) == char_type_node)
13636 /* Convert the character into UTF-8. */
13637 unsigned int c = (unsigned int) TREE_INT_CST_LOW (op2);
13638 unsigned char *p = (unsigned char *) ch;
13639 if (0x01 <= c && c <= 0x7f)
13640 *p++ = (unsigned char) c;
13641 else if (c < 0x7ff)
13643 *p++ = (unsigned char) (c >> 6 | 0xc0);
13644 *p++ = (unsigned char) ((c & 0x3f) | 0x80);
13648 *p++ = (unsigned char) (c >> 12 | 0xe0);
13649 *p++ = (unsigned char) (((c >> 6) & 0x3f) | 0x80);
13650 *p++ = (unsigned char) ((c & 0x3f) | 0x80);
13657 string = string_convert_int_cst (op2);
13659 return do_merge_string_cste (op1, string, strlen (string), after);
13664 /* Tries to statically concatenate OP1 and OP2 if possible. Either one
13665 has to be a STRING_CST and the other part must be a STRING_CST or a
13666 INTEGRAL constant. Return a new STRING_CST if the operation
13667 succeed, NULL_TREE otherwise.
13669 If the case we want to optimize for space, we might want to return
13670 NULL_TREE for each invocation of this routine. FIXME */
13673 string_constant_concatenation (tree op1, tree op2)
13675 if (TREE_CODE (op1) == STRING_CST || (TREE_CODE (op2) == STRING_CST))
13680 string = (TREE_CODE (op1) == STRING_CST ? op1 : op2);
13681 rest = (string == op1 ? op2 : op1);
13682 invert = (string == op1 ? 0 : 1 );
13684 /* Walk REST, only if it looks reasonable */
13685 if (TREE_CODE (rest) != STRING_CST
13686 && !IS_CRAFTED_STRING_BUFFER_P (rest)
13687 && !JSTRING_TYPE_P (TREE_TYPE (rest))
13688 && TREE_CODE (rest) == EXPR_WITH_FILE_LOCATION)
13690 rest = java_complete_tree (rest);
13691 if (rest == error_mark_node)
13692 return error_mark_node;
13693 rest = fold (rest);
13695 return merge_string_cste (string, rest, invert);
13700 /* Implement the `+' operator. Does static optimization if possible,
13701 otherwise create (if necessary) and append elements to a
13702 StringBuffer. The StringBuffer will be carried around until it is
13703 used for a function call or an assignment. Then toString() will be
13704 called on it to turn it into a String object. */
13707 build_string_concatenation (tree op1, tree op2)
13710 int side_effects = TREE_SIDE_EFFECTS (op1) | TREE_SIDE_EFFECTS (op2);
13712 if (flag_emit_xref)
13713 return build2 (PLUS_EXPR, string_type_node, op1, op2);
13715 /* Try to do some static optimization */
13716 if ((result = string_constant_concatenation (op1, op2)))
13719 /* Discard empty strings on either side of the expression */
13720 if (TREE_CODE (op1) == STRING_CST && TREE_STRING_LENGTH (op1) == 0)
13725 else if (TREE_CODE (op2) == STRING_CST && TREE_STRING_LENGTH (op2) == 0)
13728 /* If operands are string constant, turn then into object references */
13729 if (TREE_CODE (op1) == STRING_CST)
13730 op1 = patch_string_cst (op1);
13731 if (op2 && TREE_CODE (op2) == STRING_CST)
13732 op2 = patch_string_cst (op2);
13734 /* If either one of the constant is null and the other non null
13735 operand is a String constant, return it. */
13736 if ((TREE_CODE (op1) == STRING_CST) && !op2)
13739 /* If OP1 isn't already a StringBuffer, create and
13740 initialize a new one */
13741 if (!IS_CRAFTED_STRING_BUFFER_P (op1))
13743 /* Two solutions here:
13744 1) OP1 is a constant string reference, we call new StringBuffer(OP1)
13745 2) OP1 is something else, we call new StringBuffer().append(OP1). */
13746 if (TREE_CONSTANT (op1) && JSTRING_TYPE_P (TREE_TYPE (op1)))
13747 op1 = BUILD_STRING_BUFFER (op1);
13750 tree aNew = BUILD_STRING_BUFFER (NULL_TREE);
13751 op1 = make_qualified_primary (aNew, BUILD_APPEND (op1), 0);
13757 /* OP1 is no longer the last node holding a crafted StringBuffer */
13758 IS_CRAFTED_STRING_BUFFER_P (op1) = 0;
13759 /* Create a node for `{new...,xxx}.append (op2)' */
13761 op1 = make_qualified_primary (op1, BUILD_APPEND (op2), 0);
13764 /* Mark the last node holding a crafted StringBuffer */
13765 IS_CRAFTED_STRING_BUFFER_P (op1) = 1;
13767 TREE_SIDE_EFFECTS (op1) = side_effects;
13771 /* Patch the string node NODE. NODE can be a STRING_CST of a crafted
13772 StringBuffer. If no string were found to be patched, return
13776 patch_string (tree node)
13778 if (node == error_mark_node)
13779 return error_mark_node;
13780 if (TREE_CODE (node) == STRING_CST)
13781 return patch_string_cst (node);
13782 else if (IS_CRAFTED_STRING_BUFFER_P (node))
13784 int saved = ctxp->explicit_constructor_p;
13785 tree invoke = build_method_invocation (wfl_to_string, NULL_TREE);
13787 /* Temporary disable forbid the use of `this'. */
13788 ctxp->explicit_constructor_p = 0;
13789 ret = java_complete_tree (make_qualified_primary (node, invoke, 0));
13790 /* String concatenation arguments must be evaluated in order too. */
13791 ret = force_evaluation_order (ret);
13792 /* Restore it at its previous value */
13793 ctxp->explicit_constructor_p = saved;
13799 /* Build the internal representation of a string constant. */
13802 patch_string_cst (tree node)
13805 if (! flag_emit_class_files)
13807 node = get_identifier (TREE_STRING_POINTER (node));
13808 location = alloc_name_constant (CONSTANT_String, node);
13809 node = build_ref_from_constant_pool (location);
13811 TREE_CONSTANT (node) = 1;
13812 TREE_INVARIANT (node) = 1;
13814 /* ??? Guessing that the class file code can't handle casts. */
13815 if (! flag_emit_class_files)
13816 node = convert (string_ptr_type_node, node);
13818 TREE_TYPE (node) = string_ptr_type_node;
13823 /* Build an incomplete unary operator expression. */
13826 build_unaryop (int op_token, int op_location, tree op1)
13832 case PLUS_TK: op = UNARY_PLUS_EXPR; break;
13833 case MINUS_TK: op = NEGATE_EXPR; break;
13834 case NEG_TK: op = TRUTH_NOT_EXPR; break;
13835 case NOT_TK: op = BIT_NOT_EXPR; break;
13839 unaryop = build1 (op, NULL_TREE, op1);
13840 TREE_SIDE_EFFECTS (unaryop) = 1;
13841 /* Store the location of the operator, for better error report. The
13842 string of the operator will be rebuild based on the OP value. */
13843 EXPR_WFL_LINECOL (unaryop) = op_location;
13847 /* Special case for the ++/-- operators, since they require an extra
13848 argument to build, which is set to NULL and patched
13849 later. IS_POST_P is 1 if the operator, 0 otherwise. */
13852 build_incdec (int op_token, int op_location, tree op1, int is_post_p)
13854 static const enum tree_code lookup [2][2] =
13856 { PREDECREMENT_EXPR, PREINCREMENT_EXPR, },
13857 { POSTDECREMENT_EXPR, POSTINCREMENT_EXPR, },
13859 tree node = build2 (lookup [is_post_p][(op_token - DECR_TK)],
13860 NULL_TREE, op1, NULL_TREE);
13861 TREE_SIDE_EFFECTS (node) = 1;
13862 /* Store the location of the operator, for better error report. The
13863 string of the operator will be rebuild based on the OP value. */
13864 EXPR_WFL_LINECOL (node) = op_location;
13868 /* Build an incomplete cast operator, based on the use of the
13869 CONVERT_EXPR. Note that TREE_TYPE of the constructed node is
13870 set. java_complete_tree is trained to walk a CONVERT_EXPR even
13871 though its type is already set. */
13874 build_cast (int location, tree type, tree exp)
13876 tree node = build1 (CONVERT_EXPR, type, exp);
13877 EXPR_WFL_LINECOL (node) = location;
13881 /* Build an incomplete class reference operator. */
13883 build_incomplete_class_ref (int location, tree class_name)
13885 tree node = build1 (CLASS_LITERAL, NULL_TREE, class_name);
13886 tree class_decl = GET_CPC ();
13887 tree this_class = TREE_TYPE (class_decl);
13889 /* Generate the synthetic static method `class$'. (Previously we
13890 deferred this, causing different method tables to be emitted
13891 for native code and bytecode.) */
13892 if (!TYPE_DOT_CLASS (this_class)
13893 && !JPRIMITIVE_TYPE_P (class_name)
13894 && !(TREE_CODE (class_name) == VOID_TYPE))
13896 tree cpc_list = GET_CPC_LIST();
13897 tree cpc = cpc_list;
13900 /* For inner classes, add a 'class$' method to their outermost
13901 context, creating it if necessary. */
13903 while (GET_NEXT_ENCLOSING_CPC(cpc))
13904 cpc = GET_NEXT_ENCLOSING_CPC(cpc);
13905 class_decl = TREE_VALUE (cpc);
13907 target_class = TREE_TYPE (class_decl);
13909 if (CLASS_INTERFACE (TYPE_NAME (target_class)))
13911 /* For interfaces, adding a static 'class$' method directly
13912 is illegal. So create an inner class to contain the new
13913 method. Empirically this matches the behavior of javac. */
13915 /* We want the generated inner class inside the outermost class. */
13916 GET_CPC_LIST() = cpc;
13917 t = build_wfl_node (DECL_NAME (TYPE_NAME (object_type_node)));
13918 inner = create_anonymous_class (t);
13919 target_class = TREE_TYPE (inner);
13920 end_class_declaration (1);
13921 GET_CPC_LIST() = cpc_list;
13924 if (TYPE_DOT_CLASS (target_class) == NULL_TREE)
13925 build_dot_class_method (target_class);
13927 if (this_class != target_class)
13928 TYPE_DOT_CLASS (this_class) = TYPE_DOT_CLASS (target_class);
13931 EXPR_WFL_LINECOL (node) = location;
13935 /* Complete an incomplete class reference operator. */
13937 patch_incomplete_class_ref (tree node)
13939 tree type = TREE_OPERAND (node, 0);
13942 if (!(ref_type = resolve_type_during_patch (type)))
13943 return error_mark_node;
13945 /* If we're not emitting class files and we know ref_type is a
13946 compiled class, build a direct reference. */
13947 if ((! flag_emit_class_files && is_compiled_class (ref_type))
13948 || JPRIMITIVE_TYPE_P (ref_type)
13949 || TREE_CODE (ref_type) == VOID_TYPE)
13951 tree dot = build_class_ref (ref_type);
13952 /* A class referenced by `foo.class' is initialized. */
13953 if (!flag_emit_class_files)
13954 dot = build_class_init (ref_type, dot);
13955 return java_complete_tree (dot);
13958 /* If we're emitting class files and we have to deal with non
13959 primitive types, we invoke the synthetic static method `class$'. */
13960 ref_type = build_dot_class_method_invocation (current_class, ref_type);
13961 return java_complete_tree (ref_type);
13964 /* 15.14 Unary operators. We return error_mark_node in case of error,
13965 but preserve the type of NODE if the type is fixed. */
13968 patch_unaryop (tree node, tree wfl_op)
13970 tree op = TREE_OPERAND (node, 0);
13971 tree op_type = TREE_TYPE (op);
13972 tree prom_type = NULL_TREE, value, decl;
13973 int outer_field_flag = 0;
13974 int code = TREE_CODE (node);
13975 int error_found = 0;
13977 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
13981 /* 15.13.2 Postfix Increment Operator ++ */
13982 case POSTINCREMENT_EXPR:
13983 /* 15.13.3 Postfix Increment Operator -- */
13984 case POSTDECREMENT_EXPR:
13985 /* 15.14.1 Prefix Increment Operator ++ */
13986 case PREINCREMENT_EXPR:
13987 /* 15.14.2 Prefix Decrement Operator -- */
13988 case PREDECREMENT_EXPR:
13989 op = decl = strip_out_static_field_access_decl (op);
13990 outer_field_flag = outer_field_expanded_access_p (op, NULL, NULL, NULL);
13991 /* We might be trying to change an outer field accessed using
13993 if (outer_field_flag)
13995 /* Retrieve the decl of the field we're trying to access. We
13996 do that by first retrieving the function we would call to
13997 access the field. It has been already verified that this
13998 field isn't final */
13999 if (flag_emit_class_files)
14000 decl = TREE_OPERAND (op, 0);
14002 decl = TREE_OPERAND (TREE_OPERAND (TREE_OPERAND (op, 0), 0), 0);
14003 decl = DECL_FUNCTION_ACCESS_DECL (decl);
14005 /* We really should have a JAVA_ARRAY_EXPR to avoid this */
14006 else if (!JDECL_P (decl)
14007 && TREE_CODE (decl) != COMPONENT_REF
14008 && !(flag_emit_class_files && TREE_CODE (decl) == ARRAY_REF)
14009 && TREE_CODE (decl) != INDIRECT_REF
14010 && !(TREE_CODE (decl) == COMPOUND_EXPR
14011 && TREE_OPERAND (decl, 1)
14012 && (TREE_CODE (TREE_OPERAND (decl, 1)) == INDIRECT_REF)))
14014 TREE_TYPE (node) = error_mark_node;
14018 /* From now on, we know that op if a variable and that it has a
14019 valid wfl. We use wfl_op to locate errors related to the
14021 if (!JNUMERIC_TYPE_P (op_type))
14023 parse_error_context
14024 (wfl_op, "Invalid argument type `%s' to `%s'",
14025 lang_printable_name (op_type, 0), operator_string (node));
14026 TREE_TYPE (node) = error_mark_node;
14031 /* Before the addition, binary numeric promotion is performed on
14032 both operands, if really necessary */
14033 if (JINTEGRAL_TYPE_P (op_type))
14035 value = build_int_cst (op_type, 1, 0);
14036 TREE_TYPE (node) = op_type;
14040 value = build_int_cst (NULL_TREE, 1, 0);
14042 binary_numeric_promotion (op_type,
14043 TREE_TYPE (value), &op, &value);
14046 /* We remember we might be accessing an outer field */
14047 if (outer_field_flag)
14049 /* We re-generate an access to the field */
14050 value = build2 (PLUS_EXPR, TREE_TYPE (op),
14051 build_outer_field_access (wfl_op, decl), value);
14053 /* And we patch the original access$() into a write
14054 with plus_op as a rhs */
14055 return outer_field_access_fix (node, op, value);
14058 /* And write back into the node. */
14059 TREE_OPERAND (node, 0) = op;
14060 TREE_OPERAND (node, 1) = value;
14061 /* Convert the overall back into its original type, if
14062 necessary, and return */
14063 if (JINTEGRAL_TYPE_P (op_type))
14064 return fold (node);
14066 return fold (convert (op_type, node));
14070 /* 15.14.3 Unary Plus Operator + */
14071 case UNARY_PLUS_EXPR:
14072 /* 15.14.4 Unary Minus Operator - */
14074 if (!JNUMERIC_TYPE_P (op_type))
14076 ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op_type);
14077 TREE_TYPE (node) = error_mark_node;
14080 /* Unary numeric promotion is performed on operand */
14083 op = do_unary_numeric_promotion (op);
14084 prom_type = TREE_TYPE (op);
14085 if (code == UNARY_PLUS_EXPR)
14090 /* 15.14.5 Bitwise Complement Operator ~ */
14092 if (!JINTEGRAL_TYPE_P (op_type))
14094 ERROR_CAST_NEEDED_TO_INTEGRAL (wfl_operator, node, op_type);
14095 TREE_TYPE (node) = error_mark_node;
14100 op = do_unary_numeric_promotion (op);
14101 prom_type = TREE_TYPE (op);
14105 /* 15.14.6 Logical Complement Operator ! */
14106 case TRUTH_NOT_EXPR:
14107 if (TREE_CODE (op_type) != BOOLEAN_TYPE)
14109 ERROR_CANT_CONVERT_TO_BOOLEAN (wfl_operator, node, op_type);
14110 /* But the type is known. We will report an error if further
14111 attempt of a assignment is made with this rhs */
14112 TREE_TYPE (node) = boolean_type_node;
14116 prom_type = boolean_type_node;
14119 /* 15.15 Cast Expression */
14121 value = patch_cast (node, wfl_operator);
14122 if (value == error_mark_node)
14124 /* If this cast is part of an assignment, we tell the code
14125 that deals with it not to complain about a mismatch,
14126 because things have been cast, anyways */
14127 TREE_TYPE (node) = error_mark_node;
14132 value = fold (value);
14133 TREE_SIDE_EFFECTS (value) = TREE_SIDE_EFFECTS (op);
14140 return error_mark_node;
14142 /* There are cases where node has been replaced by something else
14143 and we don't end up returning here: UNARY_PLUS_EXPR,
14144 CONVERT_EXPR, {POST,PRE}{INCR,DECR}EMENT_EXPR. */
14145 TREE_OPERAND (node, 0) = fold (op);
14146 TREE_TYPE (node) = prom_type;
14147 TREE_SIDE_EFFECTS (node) = TREE_SIDE_EFFECTS (op);
14148 return fold (node);
14151 /* Generic type resolution that sometimes takes place during node
14152 patching. Returned the resolved type or generate an error
14153 message. Return the resolved type or NULL_TREE. */
14156 resolve_type_during_patch (tree type)
14158 if (unresolved_type_p (type, NULL))
14160 tree type_decl = resolve_and_layout (EXPR_WFL_NODE (type), type);
14163 parse_error_context (type,
14164 "Class `%s' not found in type declaration",
14165 IDENTIFIER_POINTER (EXPR_WFL_NODE (type)));
14169 check_deprecation (type, type_decl);
14171 return TREE_TYPE (type_decl);
14176 /* 5.5 Casting Conversion. error_mark_node is returned if an error is
14177 found. Otherwise NODE or something meant to replace it is returned. */
14180 patch_cast (tree node, tree wfl_op)
14182 tree op = TREE_OPERAND (node, 0);
14183 tree cast_type = TREE_TYPE (node);
14184 tree patched, op_type;
14187 /* Some string patching might be necessary at this stage */
14188 if ((patched = patch_string (op)))
14189 TREE_OPERAND (node, 0) = op = patched;
14190 op_type = TREE_TYPE (op);
14192 /* First resolve OP_TYPE if unresolved */
14193 if (!(cast_type = resolve_type_during_patch (cast_type)))
14194 return error_mark_node;
14196 /* Check on cast that are proven correct at compile time */
14197 if (JNUMERIC_TYPE_P (cast_type) && JNUMERIC_TYPE_P (op_type))
14200 if (cast_type == op_type)
14203 /* A narrowing conversion from a floating-point number to an
14204 integral type requires special handling (5.1.3). */
14205 if (JFLOAT_TYPE_P (op_type) && JINTEGRAL_TYPE_P (cast_type))
14206 if (cast_type != long_type_node)
14207 op = convert (integer_type_node, op);
14209 /* Try widening/narrowing conversion. Potentially, things need
14210 to be worked out in gcc so we implement the extreme cases
14211 correctly. fold_convert() needs to be fixed. */
14212 return convert (cast_type, op);
14215 /* It's also valid to cast a boolean into a boolean */
14216 if (op_type == boolean_type_node && cast_type == boolean_type_node)
14219 /* null can be casted to references */
14220 if (op == null_pointer_node && JREFERENCE_TYPE_P (cast_type))
14221 return build_null_of_type (cast_type);
14223 /* The remaining legal casts involve conversion between reference
14224 types. Check for their compile time correctness. */
14225 if (JREFERENCE_TYPE_P (op_type) && JREFERENCE_TYPE_P (cast_type)
14226 && valid_ref_assignconv_cast_p (op_type, cast_type, 1))
14228 TREE_TYPE (node) = promote_type (cast_type);
14229 /* Now, the case can be determined correct at compile time if
14230 OP_TYPE can be converted into CAST_TYPE by assignment
14231 conversion (5.2) */
14233 if (valid_ref_assignconv_cast_p (op_type, cast_type, 0))
14235 TREE_SET_CODE (node, NOP_EXPR);
14239 if (flag_emit_class_files)
14241 TREE_SET_CODE (node, CONVERT_EXPR);
14245 /* The cast requires a run-time check */
14246 return build3 (CALL_EXPR, promote_type (cast_type),
14247 build_address_of (soft_checkcast_node),
14248 tree_cons (NULL_TREE, build_class_ref (cast_type),
14249 build_tree_list (NULL_TREE, op)),
14253 /* Any other casts are proven incorrect at compile time */
14254 t1 = xstrdup (lang_printable_name (op_type, 0));
14255 parse_error_context (wfl_op, "Invalid cast from `%s' to `%s'",
14256 t1, lang_printable_name (cast_type, 0));
14258 return error_mark_node;
14261 /* Build a null constant and give it the type TYPE. */
14264 build_null_of_type (tree type)
14266 tree node = build_int_cst (promote_type (type), 0, 0);
14270 /* Build an ARRAY_REF incomplete tree node. Note that operand 1 isn't
14271 a list of indices. */
14273 build_array_ref (int location, tree array, tree index)
14275 tree node = build4 (ARRAY_REF, NULL_TREE, array, index,
14276 NULL_TREE, NULL_TREE);
14277 EXPR_WFL_LINECOL (node) = location;
14281 /* 15.12 Array Access Expression */
14284 patch_array_ref (tree node)
14286 tree array = TREE_OPERAND (node, 0);
14287 tree array_type = TREE_TYPE (array);
14288 tree index = TREE_OPERAND (node, 1);
14289 tree index_type = TREE_TYPE (index);
14290 int error_found = 0;
14292 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
14294 if (TREE_CODE (array_type) == POINTER_TYPE)
14295 array_type = TREE_TYPE (array_type);
14297 /* The array reference must be an array */
14298 if (!TYPE_ARRAY_P (array_type))
14300 parse_error_context
14302 "`[]' can only be applied to arrays. It can't be applied to `%s'",
14303 lang_printable_name (array_type, 0));
14304 TREE_TYPE (node) = error_mark_node;
14308 /* The array index undergoes unary numeric promotion. The promoted
14309 type must be int */
14310 index = do_unary_numeric_promotion (index);
14311 if (TREE_TYPE (index) != int_type_node)
14313 if (valid_cast_to_p (index_type, int_type_node))
14314 parse_error_context (wfl_operator,
14315 "Incompatible type for `[]'. Explicit cast needed to convert `%s' to `int'",
14316 lang_printable_name (index_type, 0));
14318 parse_error_context (wfl_operator,
14319 "Incompatible type for `[]'. Can't convert `%s' to `int'",
14320 lang_printable_name (index_type, 0));
14321 TREE_TYPE (node) = error_mark_node;
14326 return error_mark_node;
14328 array_type = TYPE_ARRAY_ELEMENT (array_type);
14330 if (flag_emit_class_files || flag_emit_xref)
14332 TREE_OPERAND (node, 0) = array;
14333 TREE_OPERAND (node, 1) = index;
14336 node = build_java_arrayaccess (array, array_type, index);
14337 TREE_TYPE (node) = array_type;
14341 /* 15.9 Array Creation Expressions */
14344 build_newarray_node (tree type, tree dims, int extra_dims)
14346 tree node = build3 (NEW_ARRAY_EXPR, NULL_TREE, type,
14348 build_int_cst (NULL_TREE, extra_dims, 0));
14353 patch_newarray (tree node)
14355 tree type = TREE_OPERAND (node, 0);
14356 tree dims = TREE_OPERAND (node, 1);
14357 tree cdim, array_type;
14358 int error_found = 0;
14360 int xdims = TREE_INT_CST_LOW (TREE_OPERAND (node, 2));
14362 /* Dimension types are verified. It's better for the types to be
14363 verified in order. */
14364 for (cdim = dims, ndims = 0; cdim; cdim = TREE_CHAIN (cdim), ndims++ )
14367 tree dim = TREE_VALUE (cdim);
14369 /* Dim might have been saved during its evaluation */
14370 dim = (TREE_CODE (dim) == SAVE_EXPR ? TREE_OPERAND (dim, 0) : dim);
14372 /* The type of each specified dimension must be an integral type. */
14373 if (!JINTEGRAL_TYPE_P (TREE_TYPE (dim)))
14376 /* Each expression undergoes an unary numeric promotion (5.6.1) and the
14377 promoted type must be int. */
14380 dim = do_unary_numeric_promotion (dim);
14381 if (TREE_TYPE (dim) != int_type_node)
14385 /* Report errors on types here */
14388 parse_error_context
14389 (TREE_PURPOSE (cdim),
14390 "Incompatible type for dimension in array creation expression. %s convert `%s' to `int'",
14391 (valid_cast_to_p (TREE_TYPE (dim), int_type_node) ?
14392 "Explicit cast needed to" : "Can't"),
14393 lang_printable_name (TREE_TYPE (dim), 0));
14397 TREE_PURPOSE (cdim) = NULL_TREE;
14400 /* Resolve array base type if unresolved */
14401 if (!(type = resolve_type_during_patch (type)))
14406 /* We don't want further evaluation of this bogus array creation
14408 TREE_TYPE (node) = error_mark_node;
14409 return error_mark_node;
14412 /* Set array_type to the actual (promoted) array type of the result. */
14413 if (TREE_CODE (type) == RECORD_TYPE)
14414 type = build_pointer_type (type);
14415 while (--xdims >= 0)
14417 type = promote_type (build_java_array_type (type, -1));
14419 dims = nreverse (dims);
14421 for (cdim = dims; cdim; cdim = TREE_CHAIN (cdim))
14425 = build_java_array_type (type,
14426 TREE_CODE (cdim) == INTEGER_CST
14427 ? (HOST_WIDE_INT) TREE_INT_CST_LOW (cdim)
14429 array_type = promote_type (array_type);
14431 dims = nreverse (dims);
14433 /* The node is transformed into a function call. Things are done
14434 differently according to the number of dimensions. If the number
14435 of dimension is equal to 1, then the nature of the base type
14436 (primitive or not) matters. */
14438 return build_new_array (type, TREE_VALUE (dims));
14440 /* Can't reuse what's already written in expr.c because it uses the
14441 JVM stack representation. Provide a build_multianewarray. FIXME */
14442 return build3 (CALL_EXPR, array_type,
14443 build_address_of (soft_multianewarray_node),
14444 tree_cons (NULL_TREE,
14445 build_class_ref (TREE_TYPE (array_type)),
14446 tree_cons (NULL_TREE,
14447 build_int_cst (NULL_TREE,
14448 ndims, 0), dims )),
14452 /* 10.6 Array initializer. */
14454 /* Build a wfl for array element that don't have one, so we can
14455 pin-point errors. */
14458 maybe_build_array_element_wfl (tree node)
14460 if (TREE_CODE (node) != EXPR_WITH_FILE_LOCATION)
14461 return build_expr_wfl (NULL_TREE, ctxp->filename,
14462 ctxp->elc.line, ctxp->elc.prev_col);
14467 /* Build a NEW_ARRAY_INIT that features a CONSTRUCTOR node. This makes
14468 identification of initialized arrays easier to detect during walk
14472 build_new_array_init (int location, tree values)
14474 tree constructor = build_constructor (NULL_TREE, values);
14475 tree to_return = build1 (NEW_ARRAY_INIT, NULL_TREE, constructor);
14476 EXPR_WFL_LINECOL (to_return) = location;
14480 /* Expand a NEW_ARRAY_INIT node. Return error_mark_node if an error
14481 occurred. Otherwise return NODE after having set its type
14485 patch_new_array_init (tree type, tree node)
14487 int error_seen = 0;
14488 tree current, element_type;
14489 HOST_WIDE_INT length;
14490 int all_constant = 1;
14491 tree init = TREE_OPERAND (node, 0);
14493 if (TREE_CODE (type) != POINTER_TYPE || ! TYPE_ARRAY_P (TREE_TYPE (type)))
14495 parse_error_context (node,
14496 "Invalid array initializer for non-array type `%s'",
14497 lang_printable_name (type, 1));
14498 return error_mark_node;
14500 type = TREE_TYPE (type);
14501 element_type = TYPE_ARRAY_ELEMENT (type);
14503 CONSTRUCTOR_ELTS (init) = nreverse (CONSTRUCTOR_ELTS (init));
14505 for (length = 0, current = CONSTRUCTOR_ELTS (init);
14506 current; length++, current = TREE_CHAIN (current))
14508 tree elt = TREE_VALUE (current);
14509 if (elt == NULL_TREE || TREE_CODE (elt) != NEW_ARRAY_INIT)
14511 error_seen |= array_constructor_check_entry (element_type, current);
14512 elt = TREE_VALUE (current);
14513 /* When compiling to native code, STRING_CST is converted to
14514 INDIRECT_REF, but still with a TREE_CONSTANT flag. */
14515 if (! TREE_CONSTANT (elt) || TREE_CODE (elt) == INDIRECT_REF)
14520 TREE_VALUE (current) = patch_new_array_init (element_type, elt);
14521 TREE_PURPOSE (current) = NULL_TREE;
14524 if (elt && TREE_CODE (elt) == TREE_LIST
14525 && TREE_VALUE (elt) == error_mark_node)
14530 return error_mark_node;
14532 /* Create a new type. We can't reuse the one we have here by
14533 patching its dimension because it originally is of dimension -1
14534 hence reused by gcc. This would prevent triangular arrays. */
14535 type = build_java_array_type (element_type, length);
14536 TREE_TYPE (init) = TREE_TYPE (TREE_CHAIN (TREE_CHAIN (TYPE_FIELDS (type))));
14537 TREE_TYPE (node) = promote_type (type);
14538 TREE_CONSTANT (init) = all_constant;
14539 TREE_INVARIANT (init) = all_constant;
14540 TREE_CONSTANT (node) = all_constant;
14541 TREE_INVARIANT (node) = all_constant;
14545 /* Verify that one entry of the initializer element list can be
14546 assigned to the array base type. Report 1 if an error occurred, 0
14550 array_constructor_check_entry (tree type, tree entry)
14552 char *array_type_string = NULL; /* For error reports */
14553 tree value, type_value, new_value, wfl_value, patched;
14554 int error_seen = 0;
14556 new_value = NULL_TREE;
14557 wfl_value = TREE_VALUE (entry);
14559 value = java_complete_tree (TREE_VALUE (entry));
14560 /* patch_string return error_mark_node if arg is error_mark_node */
14561 if ((patched = patch_string (value)))
14563 if (value == error_mark_node)
14566 type_value = TREE_TYPE (value);
14568 /* At anytime, try_builtin_assignconv can report a warning on
14569 constant overflow during narrowing. */
14570 SET_WFL_OPERATOR (wfl_operator, TREE_PURPOSE (entry), wfl_value);
14571 new_value = try_builtin_assignconv (wfl_operator, type, value);
14572 if (!new_value && (new_value = try_reference_assignconv (type, value)))
14573 type_value = promote_type (type);
14575 /* Check and report errors */
14578 const char *const msg = (!valid_cast_to_p (type_value, type) ?
14579 "Can't" : "Explicit cast needed to");
14580 if (!array_type_string)
14581 array_type_string = xstrdup (lang_printable_name (type, 1));
14582 parse_error_context
14583 (wfl_operator, "Incompatible type for array. %s convert `%s' to `%s'",
14584 msg, lang_printable_name (type_value, 1), array_type_string);
14589 TREE_VALUE (entry) = new_value;
14591 if (array_type_string)
14592 free (array_type_string);
14594 TREE_PURPOSE (entry) = NULL_TREE;
14599 build_this (int location)
14601 tree node = build_wfl_node (this_identifier_node);
14602 TREE_SET_CODE (node, THIS_EXPR);
14603 EXPR_WFL_LINECOL (node) = location;
14607 /* 14.15 The return statement. It builds a modify expression that
14608 assigns the returned value to the RESULT_DECL that hold the value
14612 build_return (int location, tree op)
14614 tree node = build1 (RETURN_EXPR, NULL_TREE, op);
14615 EXPR_WFL_LINECOL (node) = location;
14616 node = build_debugable_stmt (location, node);
14621 patch_return (tree node)
14623 tree return_exp = TREE_OPERAND (node, 0);
14624 tree meth = current_function_decl;
14625 tree mtype = TREE_TYPE (TREE_TYPE (current_function_decl));
14626 int error_found = 0;
14628 TREE_TYPE (node) = error_mark_node;
14629 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
14631 /* It's invalid to have a return value within a function that is
14632 declared with the keyword void or that is a constructor */
14633 if (return_exp && (mtype == void_type_node || DECL_CONSTRUCTOR_P (meth)))
14636 /* It's invalid to use a return statement in a static block */
14637 if (DECL_CLINIT_P (current_function_decl))
14640 /* It's invalid to have a no return value within a function that
14641 isn't declared with the keyword `void' */
14642 if (!return_exp && (mtype != void_type_node && !DECL_CONSTRUCTOR_P (meth)))
14645 if (DECL_INSTINIT_P (current_function_decl))
14650 if (DECL_INSTINIT_P (current_function_decl))
14651 parse_error_context (wfl_operator,
14652 "`return' inside instance initializer");
14654 else if (DECL_CLINIT_P (current_function_decl))
14655 parse_error_context (wfl_operator,
14656 "`return' inside static initializer");
14658 else if (!DECL_CONSTRUCTOR_P (meth))
14660 char *t = xstrdup (lang_printable_name (mtype, 0));
14661 parse_error_context (wfl_operator,
14662 "`return' with%s value from `%s %s'",
14663 (error_found == 1 ? "" : "out"),
14664 t, lang_printable_name (meth, 2));
14668 parse_error_context (wfl_operator,
14669 "`return' with value from constructor `%s'",
14670 lang_printable_name (meth, 2));
14671 return error_mark_node;
14674 /* If we have a return_exp, build a modify expression and expand
14675 it. Note: at that point, the assignment is declared valid, but we
14676 may want to carry some more hacks */
14679 tree exp = java_complete_tree (return_exp);
14680 tree modify, patched;
14682 if ((patched = patch_string (exp)))
14685 modify = build2 (MODIFY_EXPR, NULL_TREE, DECL_RESULT (meth), exp);
14686 EXPR_WFL_LINECOL (modify) = EXPR_WFL_LINECOL (node);
14687 modify = java_complete_tree (modify);
14689 if (modify != error_mark_node)
14691 TREE_SIDE_EFFECTS (modify) = 1;
14692 TREE_OPERAND (node, 0) = modify;
14695 return error_mark_node;
14697 TREE_TYPE (node) = void_type_node;
14698 TREE_SIDE_EFFECTS (node) = 1;
14702 /* 14.8 The if Statement */
14705 build_if_else_statement (int location, tree expression, tree if_body,
14710 else_body = build_java_empty_stmt ();
14711 node = build3 (COND_EXPR, NULL_TREE, expression, if_body, else_body);
14712 EXPR_WFL_LINECOL (node) = location;
14713 node = build_debugable_stmt (location, node);
14718 patch_if_else_statement (tree node)
14720 tree expression = TREE_OPERAND (node, 0);
14721 int can_complete_normally
14722 = (CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 1))
14723 | CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 2)));
14725 TREE_TYPE (node) = error_mark_node;
14726 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
14728 /* The type of expression must be boolean */
14729 if (TREE_TYPE (expression) != boolean_type_node
14730 && TREE_TYPE (expression) != promoted_boolean_type_node)
14732 parse_error_context
14734 "Incompatible type for `if'. Can't convert `%s' to `boolean'",
14735 lang_printable_name (TREE_TYPE (expression), 0));
14736 return error_mark_node;
14739 TREE_TYPE (node) = void_type_node;
14740 TREE_SIDE_EFFECTS (node) = 1;
14741 CAN_COMPLETE_NORMALLY (node) = can_complete_normally;
14745 /* 14.6 Labeled Statements */
14747 /* Action taken when a labeled statement is parsed. a new
14748 LABELED_BLOCK_EXPR is created. No statement is attached to the
14749 label, yet. LABEL can be NULL_TREE for artificially-generated blocks. */
14752 build_labeled_block (int location, tree label)
14755 tree label_decl, node;
14756 if (label == NULL_TREE || label == continue_identifier_node)
14757 label_name = label;
14760 label_name = merge_qualified_name (label_id, label);
14761 /* Issue an error if we try to reuse a label that was previously
14763 if (IDENTIFIER_LOCAL_VALUE (label_name))
14765 EXPR_WFL_LINECOL (wfl_operator) = location;
14766 parse_error_context (wfl_operator,
14767 "Declaration of `%s' shadows a previous label declaration",
14768 IDENTIFIER_POINTER (label));
14769 EXPR_WFL_LINECOL (wfl_operator) =
14770 EXPR_WFL_LINECOL (IDENTIFIER_LOCAL_VALUE (label_name));
14771 parse_error_context (wfl_operator,
14772 "This is the location of the previous declaration of label `%s'",
14773 IDENTIFIER_POINTER (label));
14774 java_error_count--;
14778 label_decl = create_label_decl (label_name);
14779 node = build2 (LABELED_BLOCK_EXPR, NULL_TREE, label_decl, NULL_TREE);
14780 EXPR_WFL_LINECOL (node) = location;
14781 TREE_SIDE_EFFECTS (node) = 1;
14785 /* A labeled statement LBE is attached a statement. */
14788 finish_labeled_statement (tree lbe, /* Labeled block expr */
14791 /* In anyways, tie the loop to its statement */
14792 LABELED_BLOCK_BODY (lbe) = statement;
14793 pop_labeled_block ();
14794 POP_LABELED_BLOCK ();
14798 /* 14.10, 14.11, 14.12 Loop Statements */
14800 /* Create an empty LOOP_EXPR and make it the last in the nested loop
14804 build_new_loop (tree loop_body)
14806 tree loop = build1 (LOOP_EXPR, NULL_TREE, loop_body);
14807 TREE_SIDE_EFFECTS (loop) = 1;
14812 /* Create a loop body according to the following structure:
14814 COMPOUND_EXPR (loop main body)
14815 EXIT_EXPR (this order is for while/for loops.
14816 LABELED_BLOCK_EXPR the order is reversed for do loops)
14817 LABEL_DECL (a continue occurring here branches at the
14818 BODY end of this labeled block)
14821 REVERSED, if nonzero, tells that the loop condition expr comes
14822 after the body, like in the do-while loop.
14824 To obtain a loop, the loop body structure described above is
14825 encapsulated within a LOOP_EXPR surrounded by a LABELED_BLOCK_EXPR:
14828 LABEL_DECL (use this label to exit the loop)
14830 <structure described above> */
14833 build_loop_body (int location, tree condition, int reversed)
14835 tree first, second, body;
14837 condition = build1 (EXIT_EXPR, NULL_TREE, condition); /* Force walk */
14838 EXPR_WFL_LINECOL (condition) = location; /* For accurate error report */
14839 condition = build_debugable_stmt (location, condition);
14840 TREE_SIDE_EFFECTS (condition) = 1;
14842 body = build_labeled_block (0, continue_identifier_node);
14843 first = (reversed ? body : condition);
14844 second = (reversed ? condition : body);
14845 return build2 (COMPOUND_EXPR, NULL_TREE,
14846 build2 (COMPOUND_EXPR, NULL_TREE, first, second),
14847 build_java_empty_stmt ());
14850 /* Install CONDITION (if any) and loop BODY (using REVERSED to tell
14851 their order) on the current loop. Unlink the current loop from the
14855 finish_loop_body (int location, tree condition, tree body, int reversed)
14857 tree to_return = ctxp->current_loop;
14858 tree loop_body = LOOP_EXPR_BODY (to_return);
14861 tree cnode = LOOP_EXPR_BODY_CONDITION_EXPR (loop_body, reversed);
14862 /* We wrapped the EXIT_EXPR around a WFL so we can debug it.
14863 The real EXIT_EXPR is one operand further. */
14864 EXPR_WFL_LINECOL (cnode) = location;
14865 /* This one is for accurate error reports */
14866 EXPR_WFL_LINECOL (TREE_OPERAND (cnode, 0)) = location;
14867 TREE_OPERAND (TREE_OPERAND (cnode, 0), 0) = condition;
14869 LOOP_EXPR_BODY_BODY_EXPR (loop_body, reversed) = body;
14874 /* Tailored version of finish_loop_body for FOR loops, when FOR
14875 loops feature the condition part */
14878 finish_for_loop (int location, tree condition, tree update, tree body)
14880 /* Put the condition and the loop body in place */
14881 tree loop = finish_loop_body (location, condition, body, 0);
14882 /* LOOP is the current loop which has been now popped of the loop
14883 stack. Mark the update block as reachable and install it. We do
14884 this because the (current interpretation of the) JLS requires
14885 that the update expression be considered reachable even if the
14886 for loop's body doesn't complete normally. */
14887 if (update != NULL_TREE && !IS_EMPTY_STMT (update))
14890 if (TREE_CODE (up2) == EXPR_WITH_FILE_LOCATION)
14891 up2 = EXPR_WFL_NODE (up2);
14892 /* It is possible for the update expression to be an
14893 EXPR_WFL_NODE wrapping nothing. */
14894 if (up2 != NULL_TREE && !IS_EMPTY_STMT (up2))
14896 /* Try to detect constraint violations. These would be
14897 programming errors somewhere. */
14898 if (! IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (up2)))
14899 || TREE_CODE (up2) == LOOP_EXPR)
14901 SUPPRESS_UNREACHABLE_ERROR (up2) = 1;
14904 LOOP_EXPR_BODY_UPDATE_BLOCK (LOOP_EXPR_BODY (loop)) = update;
14908 /* Try to find the loop a block might be related to. This comprises
14909 the case where the LOOP_EXPR is found as the second operand of a
14910 COMPOUND_EXPR, because the loop happens to have an initialization
14911 part, then expressed as the first operand of the COMPOUND_EXPR. If
14912 the search finds something, 1 is returned. Otherwise, 0 is
14913 returned. The search is assumed to start from a
14914 LABELED_BLOCK_EXPR's block. */
14917 search_loop (tree statement)
14919 if (TREE_CODE (statement) == LOOP_EXPR)
14922 if (TREE_CODE (statement) == BLOCK)
14923 statement = BLOCK_SUBBLOCKS (statement);
14927 if (statement && TREE_CODE (statement) == COMPOUND_EXPR)
14928 while (statement && TREE_CODE (statement) == COMPOUND_EXPR)
14929 statement = TREE_OPERAND (statement, 1);
14931 return (TREE_CODE (statement) == LOOP_EXPR
14932 && FOR_LOOP_P (statement) ? statement : NULL_TREE);
14935 /* Return 1 if LOOP can be found in the labeled block BLOCK. 0 is
14936 returned otherwise. */
14939 labeled_block_contains_loop_p (tree block, tree loop)
14944 if (LABELED_BLOCK_BODY (block) == loop)
14947 if (FOR_LOOP_P (loop) && search_loop (LABELED_BLOCK_BODY (block)) == loop)
14953 /* If the loop isn't surrounded by a labeled statement, create one and
14954 insert LOOP as its body. */
14957 patch_loop_statement (tree loop)
14961 TREE_TYPE (loop) = void_type_node;
14962 if (labeled_block_contains_loop_p (ctxp->current_labeled_block, loop))
14965 loop_label = build_labeled_block (0, NULL_TREE);
14966 /* LOOP is an EXPR node, so it should have a valid EXPR_WFL_LINECOL
14967 that LOOP_LABEL could enquire about, for a better accuracy. FIXME */
14968 LABELED_BLOCK_BODY (loop_label) = loop;
14969 PUSH_LABELED_BLOCK (loop_label);
14973 /* 14.13, 14.14: break and continue Statements */
14975 /* Build a break or a continue statement. a null NAME indicates an
14976 unlabeled break/continue statement. */
14979 build_bc_statement (int location, int is_break, tree name)
14981 tree break_continue, label_block_expr = NULL_TREE;
14985 if (!(label_block_expr = IDENTIFIER_LOCAL_VALUE
14986 (merge_qualified_name (label_id, EXPR_WFL_NODE (name)))))
14987 /* Null means that we don't have a target for this named
14988 break/continue. In this case, we make the target to be the
14989 label name, so that the error can be reported accurately in
14990 patch_bc_statement. */
14991 label_block_expr = EXPR_WFL_NODE (name);
14993 /* Unlabeled break/continue will be handled during the
14994 break/continue patch operation */
14995 break_continue = build2 (EXIT_BLOCK_EXPR, NULL_TREE,
14996 label_block_expr, NULL_TREE);
14998 IS_BREAK_STMT_P (break_continue) = is_break;
14999 TREE_SIDE_EFFECTS (break_continue) = 1;
15000 EXPR_WFL_LINECOL (break_continue) = location;
15001 break_continue = build_debugable_stmt (location, break_continue);
15002 return break_continue;
15005 /* Verification of a break/continue statement. */
15008 patch_bc_statement (tree node)
15010 tree bc_label = EXIT_BLOCK_LABELED_BLOCK (node), target_stmt;
15011 tree labeled_block = ctxp->current_labeled_block;
15012 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
15014 /* Having an identifier here means that the target is unknown. */
15015 if (bc_label != NULL_TREE && TREE_CODE (bc_label) == IDENTIFIER_NODE)
15017 parse_error_context (wfl_operator, "No label definition found for `%s'",
15018 IDENTIFIER_POINTER (bc_label));
15019 return error_mark_node;
15021 if (! IS_BREAK_STMT_P (node))
15023 /* It's a continue statement. */
15024 for (;; labeled_block = TREE_CHAIN (labeled_block))
15026 if (labeled_block == NULL_TREE)
15028 if (bc_label == NULL_TREE)
15029 parse_error_context (wfl_operator,
15030 "`continue' must be in loop");
15032 parse_error_context
15033 (wfl_operator, "continue label `%s' does not name a loop",
15034 IDENTIFIER_POINTER (bc_label));
15035 return error_mark_node;
15037 if ((DECL_NAME (LABELED_BLOCK_LABEL (labeled_block))
15038 == continue_identifier_node)
15039 && (bc_label == NULL_TREE
15040 || TREE_CHAIN (labeled_block) == bc_label))
15042 bc_label = labeled_block;
15047 else if (!bc_label)
15049 for (;; labeled_block = TREE_CHAIN (labeled_block))
15051 if (labeled_block == NULL_TREE)
15053 parse_error_context (wfl_operator,
15054 "`break' must be in loop or switch");
15055 return error_mark_node;
15057 target_stmt = LABELED_BLOCK_BODY (labeled_block);
15058 if (TREE_CODE (target_stmt) == SWITCH_EXPR
15059 || search_loop (target_stmt))
15061 bc_label = labeled_block;
15067 EXIT_BLOCK_LABELED_BLOCK (node) = bc_label;
15068 CAN_COMPLETE_NORMALLY (bc_label) = 1;
15070 /* Our break/continue don't return values. */
15071 TREE_TYPE (node) = void_type_node;
15072 /* Encapsulate the break within a compound statement so that it's
15073 expanded all the times by expand_expr (and not clobbered
15074 sometimes, like after a if statement) */
15075 node = add_stmt_to_compound (NULL_TREE, void_type_node, node);
15076 TREE_SIDE_EFFECTS (node) = 1;
15080 /* Process the exit expression belonging to a loop. Its type must be
15084 patch_exit_expr (tree node)
15086 tree expression = TREE_OPERAND (node, 0);
15087 TREE_TYPE (node) = error_mark_node;
15088 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
15090 /* The type of expression must be boolean */
15091 if (TREE_TYPE (expression) != boolean_type_node)
15093 parse_error_context
15095 "Incompatible type for loop conditional. Can't convert `%s' to `boolean'",
15096 lang_printable_name (TREE_TYPE (expression), 0));
15097 return error_mark_node;
15099 /* Now we know things are allright, invert the condition, fold and
15101 TREE_OPERAND (node, 0) =
15102 fold (build1 (TRUTH_NOT_EXPR, boolean_type_node, expression));
15104 if (! integer_zerop (TREE_OPERAND (node, 0))
15105 && ctxp->current_loop != NULL_TREE
15106 && TREE_CODE (ctxp->current_loop) == LOOP_EXPR)
15107 CAN_COMPLETE_NORMALLY (ctxp->current_loop) = 1;
15108 if (! integer_onep (TREE_OPERAND (node, 0)))
15109 CAN_COMPLETE_NORMALLY (node) = 1;
15112 TREE_TYPE (node) = void_type_node;
15116 /* 14.9 Switch statement */
15119 patch_switch_statement (tree node)
15121 tree se = TREE_OPERAND (node, 0), se_type;
15124 /* Complete the switch expression */
15125 se = TREE_OPERAND (node, 0) = java_complete_tree (se);
15126 se_type = TREE_TYPE (se);
15127 /* The type of the switch expression must be char, byte, short or
15129 if (! JINTEGRAL_TYPE_P (se_type) || se_type == long_type_node)
15131 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
15132 parse_error_context (wfl_operator,
15133 "Incompatible type for `switch'. Can't convert `%s' to `int'",
15134 lang_printable_name (se_type, 0));
15135 /* This is what java_complete_tree will check */
15136 TREE_OPERAND (node, 0) = error_mark_node;
15137 return error_mark_node;
15140 /* Save and restore the outer case label list. */
15141 save = case_label_list;
15142 case_label_list = NULL_TREE;
15144 TREE_OPERAND (node, 1) = java_complete_tree (TREE_OPERAND (node, 1));
15146 /* See if we've found a duplicate label. We can't leave this until
15147 code generation, because in `--syntax-only' and `-C' modes we
15148 don't do ordinary code generation. */
15149 for (iter = case_label_list; iter != NULL_TREE; iter = TREE_CHAIN (iter))
15151 HOST_WIDE_INT val = TREE_INT_CST_LOW (TREE_VALUE (iter));
15153 for (subiter = TREE_CHAIN (iter);
15154 subiter != NULL_TREE;
15155 subiter = TREE_CHAIN (subiter))
15157 HOST_WIDE_INT subval = TREE_INT_CST_LOW (TREE_VALUE (subiter));
15160 EXPR_WFL_LINECOL (wfl_operator)
15161 = EXPR_WFL_LINECOL (TREE_PURPOSE (iter));
15162 /* The case_label_list is in reverse order, so print the
15163 outer label first. */
15164 parse_error_context (wfl_operator, "duplicate case label: `"
15165 HOST_WIDE_INT_PRINT_DEC "'", subval);
15166 EXPR_WFL_LINECOL (wfl_operator)
15167 = EXPR_WFL_LINECOL (TREE_PURPOSE (subiter));
15168 parse_error_context (wfl_operator, "original label is here");
15175 case_label_list = save;
15177 /* Ready to return */
15178 if (TREE_CODE (TREE_OPERAND (node, 1)) == ERROR_MARK)
15180 TREE_TYPE (node) = error_mark_node;
15181 return error_mark_node;
15183 TREE_TYPE (node) = void_type_node;
15184 TREE_SIDE_EFFECTS (node) = 1;
15185 CAN_COMPLETE_NORMALLY (node)
15186 = CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 1))
15187 || ! SWITCH_HAS_DEFAULT (node);
15193 /* Build an assertion expression for `assert CONDITION : VALUE'; VALUE
15194 might be NULL_TREE. */
15196 build_assertion (int location, tree condition, tree value)
15199 tree klass = GET_CPC ();
15201 if (! enable_assertions (klass))
15203 condition = build2 (TRUTH_ANDIF_EXPR, NULL_TREE,
15204 boolean_false_node, condition);
15205 if (value == NULL_TREE)
15206 value = build_java_empty_stmt ();
15207 return build_if_else_statement (location, condition,
15211 if (! CLASS_USES_ASSERTIONS (klass))
15213 tree field, classdollar, id, call;
15214 tree class_type = TREE_TYPE (klass);
15216 field = add_field (class_type,
15217 get_identifier ("$assertionsDisabled"),
15219 ACC_PRIVATE | ACC_STATIC | ACC_FINAL);
15220 MAYBE_CREATE_VAR_LANG_DECL_SPECIFIC (field);
15221 FIELD_SYNTHETIC (field) = 1;
15223 classdollar = build_incomplete_class_ref (location, class_type);
15225 /* Call CLASS.desiredAssertionStatus(). */
15226 id = build_wfl_node (get_identifier ("desiredAssertionStatus"));
15227 call = build3 (CALL_EXPR, NULL_TREE, id, NULL_TREE, NULL_TREE);
15228 call = make_qualified_primary (classdollar, call, location);
15229 TREE_SIDE_EFFECTS (call) = 1;
15231 /* Invert to obtain !CLASS.desiredAssertionStatus(). This may
15232 seem odd, but we do it to generate code identical to that of
15234 call = build1 (TRUTH_NOT_EXPR, NULL_TREE, call);
15235 TREE_SIDE_EFFECTS (call) = 1;
15236 DECL_INITIAL (field) = call;
15238 /* Record the initializer in the initializer statement list. */
15239 call = build2 (MODIFY_EXPR, NULL_TREE, field, call);
15240 TREE_CHAIN (call) = CPC_STATIC_INITIALIZER_STMT (ctxp);
15241 SET_CPC_STATIC_INITIALIZER_STMT (ctxp, call);
15242 MODIFY_EXPR_FROM_INITIALIZATION_P (call) = 1;
15244 CLASS_USES_ASSERTIONS (klass) = 1;
15247 if (value != NULL_TREE)
15248 value = tree_cons (NULL_TREE, value, NULL_TREE);
15250 node = build_wfl_node (get_identifier ("java"));
15251 node = make_qualified_name (node, build_wfl_node (get_identifier ("lang")),
15253 node = make_qualified_name (node, build_wfl_node (get_identifier ("AssertionError")),
15256 node = build3 (NEW_CLASS_EXPR, NULL_TREE, node, value, NULL_TREE);
15257 TREE_SIDE_EFFECTS (node) = 1;
15258 /* It is too early to use BUILD_THROW. */
15259 node = build1 (THROW_EXPR, NULL_TREE, node);
15260 TREE_SIDE_EFFECTS (node) = 1;
15262 /* We invert the condition; if we just put NODE as the `else' part
15263 then we generate weird-looking bytecode. */
15264 condition = build1 (TRUTH_NOT_EXPR, NULL_TREE, condition);
15265 /* Check $assertionsDisabled. */
15267 = build2 (TRUTH_ANDIF_EXPR, NULL_TREE,
15268 build1 (TRUTH_NOT_EXPR, NULL_TREE,
15269 build_wfl_node (get_identifier ("$assertionsDisabled"))),
15271 node = build_if_else_statement (location, condition, node, NULL_TREE);
15275 /* 14.18 The try/catch statements */
15277 /* Encapsulate TRY_STMTS' in a try catch sequence. The catch clause
15278 catches TYPE and executes CATCH_STMTS. */
15281 encapsulate_with_try_catch (int location, tree type_or_name, tree try_stmts,
15284 tree try_block, catch_clause_param, catch_block, catch;
15286 /* First build a try block */
15287 try_block = build_expr_block (try_stmts, NULL_TREE);
15289 /* Build a catch block: we need a catch clause parameter */
15290 if (TREE_CODE (type_or_name) == EXPR_WITH_FILE_LOCATION)
15292 tree catch_type = obtain_incomplete_type (type_or_name);
15294 catch_clause_param = build_decl (VAR_DECL, wpv_id, catch_type);
15295 register_incomplete_type (JDEP_VARIABLE, type_or_name,
15296 catch_clause_param, catch_type);
15297 dep = CLASSD_LAST (ctxp->classd_list);
15298 JDEP_GET_PATCH (dep) = &TREE_TYPE (catch_clause_param);
15301 catch_clause_param = build_decl (VAR_DECL, wpv_id,
15302 build_pointer_type (type_or_name));
15305 catch_block = build_expr_block (NULL_TREE, catch_clause_param);
15307 /* Initialize the variable and store in the block */
15308 catch = build2 (MODIFY_EXPR, NULL_TREE, catch_clause_param,
15309 build0 (JAVA_EXC_OBJ_EXPR, ptr_type_node));
15310 add_stmt_to_block (catch_block, NULL_TREE, catch);
15312 /* Add the catch statements */
15313 add_stmt_to_block (catch_block, NULL_TREE, catch_stmts);
15315 /* Now we can build a JAVA_CATCH_EXPR */
15316 catch_block = build1 (JAVA_CATCH_EXPR, NULL_TREE, catch_block);
15318 return build_try_statement (location, try_block, catch_block);
15322 build_try_statement (int location, tree try_block, tree catches)
15324 tree node = build2 (TRY_EXPR, NULL_TREE, try_block, catches);
15325 EXPR_WFL_LINECOL (node) = location;
15330 build_try_finally_statement (int location, tree try_block, tree finally)
15332 tree node = build2 (TRY_FINALLY_EXPR, NULL_TREE, try_block, finally);
15333 EXPR_WFL_LINECOL (node) = location;
15338 patch_try_statement (tree node)
15340 int error_found = 0;
15341 tree try = TREE_OPERAND (node, 0);
15342 /* Exception handlers are considered in left to right order */
15343 tree catch = nreverse (TREE_OPERAND (node, 1));
15344 tree current, caught_type_list = NULL_TREE;
15346 /* Check catch clauses, if any. Every time we find an error, we try
15347 to process the next catch clause. We process the catch clause before
15348 the try block so that when processing the try block we can check thrown
15349 exceptions againts the caught type list. */
15350 for (current = catch; current; current = TREE_CHAIN (current))
15352 tree carg_decl, carg_type;
15353 tree sub_current, catch_block, catch_clause;
15356 /* At this point, the structure of the catch clause is
15357 JAVA_CATCH_EXPR (catch node)
15358 BLOCK (with the decl of the parameter)
15360 MODIFY_EXPR (assignment of the catch parameter)
15361 BLOCK (catch clause block)
15363 catch_clause = TREE_OPERAND (current, 0);
15364 carg_decl = BLOCK_EXPR_DECLS (catch_clause);
15365 carg_type = TREE_TYPE (TREE_TYPE (carg_decl));
15367 /* Catch clauses can't have more than one parameter declared,
15368 but it's already enforced by the grammar. Make sure that the
15369 only parameter of the clause statement in of class Throwable
15370 or a subclass of Throwable, but that was done earlier. The
15371 catch clause parameter type has also been resolved. */
15373 /* Just make sure that the catch clause parameter type inherits
15374 from java.lang.Throwable */
15375 if (!inherits_from_p (carg_type, throwable_type_node))
15377 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (current);
15378 parse_error_context (wfl_operator,
15379 "Can't catch class `%s'. Catch clause parameter type must be a subclass of class `java.lang.Throwable'",
15380 lang_printable_name (carg_type, 0));
15385 /* Partial check for unreachable catch statement: The catch
15386 clause is reachable iff is no earlier catch block A in
15387 the try statement such that the type of the catch
15388 clause's parameter is the same as or a subclass of the
15389 type of A's parameter */
15391 for (sub_current = catch;
15392 sub_current != current; sub_current = TREE_CHAIN (sub_current))
15394 tree sub_catch_clause, decl;
15395 sub_catch_clause = TREE_OPERAND (sub_current, 0);
15396 decl = BLOCK_EXPR_DECLS (sub_catch_clause);
15398 if (inherits_from_p (carg_type, TREE_TYPE (TREE_TYPE (decl))))
15400 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (current);
15401 parse_error_context
15403 "`catch' not reached because of the catch clause at line %d",
15404 EXPR_WFL_LINENO (sub_current));
15405 unreachable = error_found = 1;
15409 /* Complete the catch clause block */
15410 catch_block = java_complete_tree (TREE_OPERAND (current, 0));
15411 if (catch_block == error_mark_node)
15416 if (CAN_COMPLETE_NORMALLY (catch_block))
15417 CAN_COMPLETE_NORMALLY (node) = 1;
15418 TREE_OPERAND (current, 0) = catch_block;
15423 /* Things to do here: the exception must be thrown */
15425 /* Link this type to the caught type list */
15426 caught_type_list = tree_cons (NULL_TREE, carg_type, caught_type_list);
15429 PUSH_EXCEPTIONS (caught_type_list);
15430 if ((try = java_complete_tree (try)) == error_mark_node)
15432 if (CAN_COMPLETE_NORMALLY (try))
15433 CAN_COMPLETE_NORMALLY (node) = 1;
15436 /* Verification ends here */
15438 return error_mark_node;
15440 TREE_OPERAND (node, 0) = try;
15441 TREE_OPERAND (node, 1) = catch;
15442 TREE_TYPE (node) = void_type_node;
15446 /* 14.17 The synchronized Statement */
15449 patch_synchronized_statement (tree node, tree wfl_op1)
15451 tree expr = java_complete_tree (TREE_OPERAND (node, 0));
15452 tree block = TREE_OPERAND (node, 1);
15454 tree tmp, enter, exit, expr_decl, assignment;
15456 if (expr == error_mark_node)
15458 block = java_complete_tree (block);
15462 /* We might be trying to synchronize on a STRING_CST */
15463 if ((tmp = patch_string (expr)))
15466 /* The TYPE of expr must be a reference type */
15467 if (!JREFERENCE_TYPE_P (TREE_TYPE (expr)))
15469 SET_WFL_OPERATOR (wfl_operator, node, wfl_op1);
15470 parse_error_context (wfl_operator, "Incompatible type for `synchronized'. Can't convert `%s' to `java.lang.Object'",
15471 lang_printable_name (TREE_TYPE (expr), 0));
15472 return error_mark_node;
15475 if (flag_emit_xref)
15477 TREE_OPERAND (node, 0) = expr;
15478 TREE_OPERAND (node, 1) = java_complete_tree (block);
15479 CAN_COMPLETE_NORMALLY (node) = 1;
15483 /* Generate a try-finally for the synchronized statement, except
15484 that the handler that catches all throw exception calls
15485 _Jv_MonitorExit and then rethrow the exception.
15486 The synchronized statement is then implemented as:
15489 _Jv_MonitorEnter (expression)
15491 _Jv_MonitorExit (expression)
15495 e = _Jv_exception_info ();
15496 _Jv_MonitorExit (expression)
15500 expr_decl = build_decl (VAR_DECL, generate_name (), TREE_TYPE (expr));
15501 BUILD_MONITOR_ENTER (enter, expr_decl);
15502 BUILD_MONITOR_EXIT (exit, expr_decl);
15503 CAN_COMPLETE_NORMALLY (enter) = 1;
15504 CAN_COMPLETE_NORMALLY (exit) = 1;
15505 assignment = build2 (MODIFY_EXPR, NULL_TREE, expr_decl, expr);
15506 TREE_SIDE_EFFECTS (assignment) = 1;
15507 node = build2 (COMPOUND_EXPR, NULL_TREE,
15508 build2 (COMPOUND_EXPR, NULL_TREE, assignment, enter),
15509 build2 (TRY_FINALLY_EXPR, NULL_TREE, block, exit));
15510 node = build_expr_block (node, expr_decl);
15512 return java_complete_tree (node);
15515 /* 14.16 The throw Statement */
15518 patch_throw_statement (tree node, tree wfl_op1)
15520 tree expr = TREE_OPERAND (node, 0);
15521 tree type = TREE_TYPE (expr);
15522 int unchecked_ok = 0, tryblock_throws_ok = 0;
15524 /* Thrown expression must be assignable to java.lang.Throwable */
15525 if (!try_reference_assignconv (throwable_type_node, expr))
15527 SET_WFL_OPERATOR (wfl_operator, node, wfl_op1);
15528 parse_error_context (wfl_operator,
15529 "Can't throw `%s'; it must be a subclass of class `java.lang.Throwable'",
15530 lang_printable_name (type, 0));
15531 /* If the thrown expression was a reference, we further the
15532 compile-time check. */
15533 if (!JREFERENCE_TYPE_P (type))
15534 return error_mark_node;
15537 /* At least one of the following must be true */
15539 /* The type of the throw expression is a not checked exception,
15540 i.e. is a unchecked expression. */
15541 unchecked_ok = IS_UNCHECKED_EXCEPTION_P (TREE_TYPE (type));
15543 SET_WFL_OPERATOR (wfl_operator, node, wfl_op1);
15544 /* An instance can't throw a checked exception unless that exception
15545 is explicitly declared in the `throws' clause of each
15546 constructor. This doesn't apply to anonymous classes, since they
15547 don't have declared constructors. */
15549 && DECL_INSTINIT_P (current_function_decl)
15550 && !ANONYMOUS_CLASS_P (current_class))
15553 for (current = TYPE_METHODS (current_class); current;
15554 current = TREE_CHAIN (current))
15555 if (DECL_CONSTRUCTOR_P (current)
15556 && !check_thrown_exceptions_do (TREE_TYPE (expr)))
15558 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)",
15559 lang_printable_name (TREE_TYPE (expr), 0));
15560 return error_mark_node;
15564 /* Throw is contained in a try statement and at least one catch
15565 clause can receive the thrown expression or the current method is
15566 declared to throw such an exception. Or, the throw statement is
15567 contained in a method or constructor declaration and the type of
15568 the Expression is assignable to at least one type listed in the
15569 throws clause the declaration. */
15571 tryblock_throws_ok = check_thrown_exceptions_do (TREE_TYPE (expr));
15572 if (!(unchecked_ok || tryblock_throws_ok))
15574 /* If there is a surrounding try block that has no matching
15575 clatch clause, report it first. A surrounding try block exits
15576 only if there is something after the list of checked
15577 exception thrown by the current function (if any). */
15578 if (IN_TRY_BLOCK_P ())
15579 parse_error_context (wfl_operator, "Checked exception `%s' can't be caught by any of the catch clause(s) of the surrounding `try' block",
15580 lang_printable_name (type, 0));
15581 /* If we have no surrounding try statement and the method doesn't have
15582 any throws, report it now. FIXME */
15584 /* We report that the exception can't be throw from a try block
15585 in all circumstances but when the `throw' is inside a static
15587 else if (!EXCEPTIONS_P (currently_caught_type_list)
15588 && !tryblock_throws_ok)
15590 if (DECL_CLINIT_P (current_function_decl))
15591 parse_error_context (wfl_operator,
15592 "Checked exception `%s' can't be thrown in initializer",
15593 lang_printable_name (type, 0));
15595 parse_error_context (wfl_operator,
15596 "Checked exception `%s' isn't thrown from a `try' block",
15597 lang_printable_name (type, 0));
15599 /* Otherwise, the current method doesn't have the appropriate
15600 throws declaration */
15602 parse_error_context (wfl_operator, "Checked exception `%s' doesn't match any of current method's `throws' declaration(s)",
15603 lang_printable_name (type, 0));
15604 return error_mark_node;
15607 if (! flag_emit_class_files && ! flag_emit_xref)
15608 BUILD_THROW (node, expr);
15610 /* If doing xrefs, keep the location where the `throw' was seen. */
15611 if (flag_emit_xref)
15612 EXPR_WFL_LINECOL (node) = EXPR_WFL_LINECOL (wfl_op1);
15616 /* Check that exception said to be thrown by method DECL can be
15617 effectively caught from where DECL is invoked. THIS_EXPR is the
15618 expression that computes `this' for the method call. */
15620 check_thrown_exceptions (int location, tree decl, tree this_expr)
15623 int is_array_call = 0;
15625 /* Skip check within generated methods, such as access$<n>. */
15626 if (OUTER_FIELD_ACCESS_IDENTIFIER_P (DECL_NAME (current_function_decl)))
15629 if (this_expr != NULL_TREE
15630 && TREE_CODE (TREE_TYPE (this_expr)) == POINTER_TYPE
15631 && TYPE_ARRAY_P (TREE_TYPE (TREE_TYPE (this_expr))))
15634 /* For all the unchecked exceptions thrown by DECL. */
15635 for (throws = DECL_FUNCTION_THROWS (decl); throws;
15636 throws = TREE_CHAIN (throws))
15637 if (!check_thrown_exceptions_do (TREE_VALUE (throws)))
15639 /* Suppress errors about cloning arrays. */
15640 if (is_array_call && DECL_NAME (decl) == get_identifier ("clone"))
15643 EXPR_WFL_LINECOL (wfl_operator) = location;
15644 if (DECL_FINIT_P (current_function_decl))
15645 parse_error_context
15646 (wfl_operator, "Exception `%s' can't be thrown in initializer",
15647 lang_printable_name (TREE_VALUE (throws), 0));
15650 parse_error_context
15651 (wfl_operator, "Exception `%s' must be caught, or it must be declared in the `throws' clause of `%s'",
15652 lang_printable_name (TREE_VALUE (throws), 0),
15653 (DECL_INIT_P (current_function_decl) ?
15654 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (current_class))) :
15655 IDENTIFIER_POINTER (DECL_NAME (current_function_decl))));
15660 /* Return 1 if checked EXCEPTION is caught at the current nesting level of
15661 try-catch blocks, OR is listed in the `throws' clause of the
15665 check_thrown_exceptions_do (tree exception)
15667 tree list = currently_caught_type_list;
15668 resolve_and_layout (exception, NULL_TREE);
15669 /* First, all the nested try-catch-finally at that stage. The
15670 last element contains `throws' clause exceptions, if any. */
15671 if (IS_UNCHECKED_EXCEPTION_P (exception))
15676 for (caught = TREE_VALUE (list); caught; caught = TREE_CHAIN (caught))
15677 if (valid_ref_assignconv_cast_p (exception, TREE_VALUE (caught), 0))
15679 list = TREE_CHAIN (list);
15685 purge_unchecked_exceptions (tree mdecl)
15687 tree throws = DECL_FUNCTION_THROWS (mdecl);
15688 tree new = NULL_TREE;
15692 tree next = TREE_CHAIN (throws);
15693 if (!IS_UNCHECKED_EXCEPTION_P (TREE_VALUE (throws)))
15695 TREE_CHAIN (throws) = new;
15700 /* List is inverted here, but it doesn't matter */
15701 DECL_FUNCTION_THROWS (mdecl) = new;
15704 /* This function goes over all of CLASS_TYPE ctors and checks whether
15705 each of them features at least one unchecked exception in its
15706 `throws' clause. If it's the case, it returns `true', `false'
15710 ctors_unchecked_throws_clause_p (tree class_type)
15714 for (current = TYPE_METHODS (class_type); current;
15715 current = TREE_CHAIN (current))
15717 bool ctu = false; /* Ctor Throws Unchecked */
15718 if (DECL_CONSTRUCTOR_P (current))
15721 for (throws = DECL_FUNCTION_THROWS (current); throws && !ctu;
15722 throws = TREE_CHAIN (throws))
15723 if (inherits_from_p (TREE_VALUE (throws), exception_type_node))
15726 /* We return false as we found one ctor that is unfit. */
15727 if (!ctu && DECL_CONSTRUCTOR_P (current))
15730 /* All ctors feature at least one unchecked exception in their
15731 `throws' clause. */
15735 /* 15.24 Conditional Operator ?: */
15738 patch_conditional_expr (tree node, tree wfl_cond, tree wfl_op1)
15740 tree cond = TREE_OPERAND (node, 0);
15741 tree op1 = TREE_OPERAND (node, 1);
15742 tree op2 = TREE_OPERAND (node, 2);
15743 tree resulting_type = NULL_TREE;
15744 tree t1, t2, patched;
15745 int error_found = 0;
15747 /* Operands of ?: might be StringBuffers crafted as a result of a
15748 string concatenation. Obtain a descent operand here. */
15749 if ((patched = patch_string (op1)))
15750 TREE_OPERAND (node, 1) = op1 = patched;
15751 if ((patched = patch_string (op2)))
15752 TREE_OPERAND (node, 2) = op2 = patched;
15754 t1 = TREE_TYPE (op1);
15755 t2 = TREE_TYPE (op2);
15757 /* The first expression must be a boolean */
15758 if (TREE_TYPE (cond) != boolean_type_node)
15760 SET_WFL_OPERATOR (wfl_operator, node, wfl_cond);
15761 parse_error_context (wfl_operator,
15762 "Incompatible type for `?:'. Can't convert `%s' to `boolean'",
15763 lang_printable_name (TREE_TYPE (cond), 0));
15767 /* Second and third can be numeric, boolean (i.e. primitive),
15768 references or null. Anything else results in an error */
15769 if (!((JNUMERIC_TYPE_P (t1) && JNUMERIC_TYPE_P (t2))
15770 || ((JREFERENCE_TYPE_P (t1) || op1 == null_pointer_node)
15771 && (JREFERENCE_TYPE_P (t2) || op2 == null_pointer_node))
15772 || (t1 == boolean_type_node && t2 == boolean_type_node)))
15775 /* Determine the type of the conditional expression. Same types are
15776 easy to deal with */
15778 resulting_type = t1;
15780 /* There are different rules for numeric types */
15781 else if (JNUMERIC_TYPE_P (t1))
15783 /* if byte/short found, the resulting type is short */
15784 if ((t1 == byte_type_node && t2 == short_type_node)
15785 || (t1 == short_type_node && t2 == byte_type_node))
15786 resulting_type = short_type_node;
15788 /* If t1 is a constant int and t2 is of type byte, short or char
15789 and t1's value fits in t2, then the resulting type is t2 */
15790 else if ((t1 == int_type_node && TREE_CONSTANT (TREE_OPERAND (node, 1)))
15791 && JBSC_TYPE_P (t2) && int_fits_type_p (TREE_OPERAND (node, 1), t2))
15792 resulting_type = t2;
15794 /* If t2 is a constant int and t1 is of type byte, short or char
15795 and t2's value fits in t1, then the resulting type is t1 */
15796 else if ((t2 == int_type_node && TREE_CONSTANT (TREE_OPERAND (node, 2)))
15797 && JBSC_TYPE_P (t1) && int_fits_type_p (TREE_OPERAND (node, 2), t1))
15798 resulting_type = t1;
15800 /* Otherwise, binary numeric promotion is applied and the
15801 resulting type is the promoted type of operand 1 and 2 */
15803 resulting_type = binary_numeric_promotion (t1, t2,
15804 &TREE_OPERAND (node, 1),
15805 &TREE_OPERAND (node, 2));
15808 /* Cases of a reference and a null type */
15809 else if (JREFERENCE_TYPE_P (t1) && op2 == null_pointer_node)
15810 resulting_type = t1;
15812 else if (JREFERENCE_TYPE_P (t2) && op1 == null_pointer_node)
15813 resulting_type = t2;
15815 /* Last case: different reference types. If a type can be converted
15816 into the other one by assignment conversion, the latter
15817 determines the type of the expression */
15818 else if ((resulting_type = try_reference_assignconv (t1, op2)))
15819 resulting_type = promote_type (t1);
15821 else if ((resulting_type = try_reference_assignconv (t2, op1)))
15822 resulting_type = promote_type (t2);
15824 /* If we don't have any resulting type, we're in trouble */
15825 if (!resulting_type)
15827 char *t = xstrdup (lang_printable_name (t1, 0));
15828 SET_WFL_OPERATOR (wfl_operator, node, wfl_op1);
15829 parse_error_context (wfl_operator,
15830 "Incompatible type for `?:'. Can't convert `%s' to `%s'",
15831 t, lang_printable_name (t2, 0));
15838 TREE_TYPE (node) = error_mark_node;
15839 return error_mark_node;
15842 TREE_TYPE (node) = resulting_type;
15843 TREE_SET_CODE (node, COND_EXPR);
15844 CAN_COMPLETE_NORMALLY (node) = 1;
15848 /* Wrap EXPR with code to initialize DECL's class, if appropriate. */
15851 maybe_build_class_init_for_field (tree decl, tree expr)
15853 tree clas = DECL_CONTEXT (decl);
15854 if (flag_emit_class_files || flag_emit_xref)
15857 if (TREE_CODE (decl) == VAR_DECL && FIELD_STATIC (decl)
15858 && FIELD_FINAL (decl))
15860 tree init = DECL_INITIAL (decl);
15861 if (init != NULL_TREE)
15862 init = fold_constant_for_init (init, decl);
15863 if (init != NULL_TREE && CONSTANT_VALUE_P (init))
15867 return build_class_init (clas, expr);
15870 /* Try to constant fold NODE.
15871 If NODE is not a constant expression, return NULL_EXPR.
15872 CONTEXT is a static final VAR_DECL whose initializer we are folding. */
15875 fold_constant_for_init (tree node, tree context)
15877 tree op0, op1, val;
15878 enum tree_code code = TREE_CODE (node);
15883 if (node == null_pointer_node)
15892 case TRUNC_MOD_EXPR:
15900 case TRUTH_ANDIF_EXPR:
15901 case TRUTH_ORIF_EXPR:
15908 op0 = TREE_OPERAND (node, 0);
15909 op1 = TREE_OPERAND (node, 1);
15910 val = fold_constant_for_init (op0, context);
15911 if (val == NULL_TREE || ! TREE_CONSTANT (val))
15913 TREE_OPERAND (node, 0) = val;
15914 val = fold_constant_for_init (op1, context);
15915 if (val == NULL_TREE || ! TREE_CONSTANT (val))
15917 TREE_OPERAND (node, 1) = val;
15918 return patch_binop (node, op0, op1);
15920 case UNARY_PLUS_EXPR:
15922 case TRUTH_NOT_EXPR:
15925 op0 = TREE_OPERAND (node, 0);
15926 val = fold_constant_for_init (op0, context);
15927 if (val == NULL_TREE || ! TREE_CONSTANT (val))
15929 TREE_OPERAND (node, 0) = val;
15930 val = patch_unaryop (node, op0);
15931 if (! TREE_CONSTANT (val))
15938 val = fold_constant_for_init (TREE_OPERAND (node, 0), context);
15939 if (val == NULL_TREE || ! TREE_CONSTANT (val))
15941 TREE_OPERAND (node, 0) = val;
15942 val = fold_constant_for_init (TREE_OPERAND (node, 1), context);
15943 if (val == NULL_TREE || ! TREE_CONSTANT (val))
15945 TREE_OPERAND (node, 1) = val;
15946 val = fold_constant_for_init (TREE_OPERAND (node, 2), context);
15947 if (val == NULL_TREE || ! TREE_CONSTANT (val))
15949 TREE_OPERAND (node, 2) = val;
15950 return integer_zerop (TREE_OPERAND (node, 0)) ? TREE_OPERAND (node, 1)
15951 : TREE_OPERAND (node, 2);
15955 if (! FIELD_FINAL (node)
15956 || DECL_INITIAL (node) == NULL_TREE)
15958 val = DECL_INITIAL (node);
15959 /* Guard against infinite recursion. */
15960 DECL_INITIAL (node) = NULL_TREE;
15961 val = fold_constant_for_init (val, node);
15962 if (val != NULL_TREE && TREE_CODE (val) != STRING_CST)
15963 val = try_builtin_assignconv (NULL_TREE, TREE_TYPE (node), val);
15964 DECL_INITIAL (node) = val;
15967 case EXPR_WITH_FILE_LOCATION:
15968 /* Compare java_complete_tree and resolve_expression_name. */
15969 if (!EXPR_WFL_NODE (node) /* Or a PRIMARY flag ? */
15970 || TREE_CODE (EXPR_WFL_NODE (node)) == IDENTIFIER_NODE)
15972 tree name = EXPR_WFL_NODE (node);
15974 if (PRIMARY_P (node))
15976 else if (! QUALIFIED_P (name))
15978 decl = lookup_field_wrapper (DECL_CONTEXT (context), name);
15979 if (decl == NULL_TREE
15980 || (! FIELD_STATIC (decl) && ! FIELD_FINAL (decl)))
15982 return fold_constant_for_init (decl, decl);
15986 tree r = NULL_TREE;
15987 /* Install the proper context for the field resolution. */
15988 tree saved_current_class = current_class;
15989 /* Wait until the USE_COMPONENT_REF re-write. FIXME. */
15990 current_class = DECL_CONTEXT (context);
15991 qualify_ambiguous_name (node);
15992 r = resolve_field_access (node, &decl, NULL);
15993 /* Restore prior context. */
15994 current_class = saved_current_class;
15995 if (r != error_mark_node && decl != NULL_TREE)
15996 return fold_constant_for_init (decl, decl);
16002 op0 = TREE_OPERAND (node, 0);
16003 val = fold_constant_for_init (op0, context);
16004 if (val == NULL_TREE || ! TREE_CONSTANT (val))
16006 TREE_OPERAND (node, 0) = val;
16010 #ifdef USE_COMPONENT_REF
16012 case COMPONENT_REF:
16021 #ifdef USE_COMPONENT_REF
16022 /* Context is 'T' for TypeName, 'P' for PackageName,
16023 'M' for MethodName, 'E' for ExpressionName, and 'A' for AmbiguousName. */
16026 resolve_simple_name (tree name, int context)
16031 resolve_qualified_name (tree name, int context)
16037 init_src_parse (void)
16039 /* Sanity check; we've been bit by this before. */
16040 if (ARRAY_SIZE (ctxp->modifier_ctx) != MODIFIER_TK - PUBLIC_TK)
16046 /* This section deals with the functions that are called when tables
16047 recording class initialization information are traversed. */
16049 /* Attach to PTR (a block) the declaration found in ENTRY. */
16052 attach_init_test_initialization_flags (void **entry, void *ptr)
16054 tree block = (tree)ptr;
16055 struct treetreehash_entry *ite = (struct treetreehash_entry *) *entry;
16057 if (block != error_mark_node)
16059 TREE_CHAIN (ite->value) = BLOCK_EXPR_DECLS (block);
16060 BLOCK_EXPR_DECLS (block) = ite->value;
16065 /* This function is called for each class that is known definitely
16066 initialized when a given static method was called. This function
16067 augments a compound expression (INFO) storing all assignment to
16068 initialized static class flags if a flag already existed, otherwise
16069 a new one is created. */
16072 emit_test_initialization (void **entry_p, void *info)
16074 tree l = (tree) info;
16076 tree key = (tree) *entry_p;
16078 htab_t cf_ht = DECL_FUNCTION_INIT_TEST_TABLE (current_function_decl);
16080 /* If we haven't found a flag and we're dealing with self registered
16081 with current_function_decl, then don't do anything. Self is
16082 always added as definitely initialized but this information is
16083 valid only if used outside the current function. */
16084 if (current_function_decl == TREE_PURPOSE (l)
16085 && java_treetreehash_find (cf_ht, key) == NULL)
16088 ite = java_treetreehash_new (cf_ht, key);
16090 /* If we don't have a variable, create one and install it. */
16095 decl = build_decl (VAR_DECL, NULL_TREE, boolean_type_node);
16096 MAYBE_CREATE_VAR_LANG_DECL_SPECIFIC (decl);
16097 LOCAL_CLASS_INITIALIZATION_FLAG (decl) = 1;
16098 DECL_CONTEXT (decl) = current_function_decl;
16099 DECL_INITIAL (decl) = boolean_true_node;
16100 /* Don't emit any symbolic debugging info for this decl. */
16101 DECL_IGNORED_P (decl) = 1;
16103 /* The trick is to find the right context for it. */
16104 block = BLOCK_SUBBLOCKS (GET_CURRENT_BLOCK (current_function_decl));
16105 TREE_CHAIN (decl) = BLOCK_EXPR_DECLS (block);
16106 BLOCK_EXPR_DECLS (block) = decl;
16112 /* Now simply augment the compound that holds all the assignments
16113 pertaining to this method invocation. */
16114 init = build2 (MODIFY_EXPR, boolean_type_node, decl, boolean_true_node);
16115 TREE_SIDE_EFFECTS (init) = 1;
16116 TREE_VALUE (l) = add_stmt_to_compound (TREE_VALUE (l), void_type_node, init);
16117 TREE_SIDE_EFFECTS (TREE_VALUE (l)) = 1;
16122 #include "gt-java-parse.h"
16123 #include "gtype-java.h"