?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
PR other/22202
[official-gcc.git] / gcc / java / parse.y
blob555541c4bd4e6d52717c6c17c2bf2f17fff1a404
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, 2005
4 Free Software Foundation, Inc.
5 Contributed by Alexandre Petit-Bianco (apbianco@cygnus.com)
6
7 This file is part of GCC.
8
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)
12 any later version.
13
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.
18
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, 51 Franklin Street, Fifth Floor,
22 Boston, MA 02110-1301, USA.
23
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. */
27
28 /* This file parses java source code and issues a tree node image
29 suitable for code generation (byte code and targeted CPU assembly
30 language).
31
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"
35
36 The following modifications were brought to the original grammar:
37
38 method_body: added the rule '| block SC_TK'
39 static_initializer: added the rule 'static block SC_TK'.
40
41 Note: All the extra rules described above should go away when the
42 empty_statement rule will work.
43
44 statement_nsi: 'nsi' should be read no_short_if.
45
46 Some rules have been modified to support JDK1.1 inner classes
47 definitions and other extensions. */
48
49 %{
50 #include "config.h"
51 #include "system.h"
52 #include "coretypes.h"
53 #include "tm.h"
54 #include <dirent.h>
55 #include "tree.h"
56 #include "rtl.h"
57 #include "real.h"
58 #include "obstack.h"
59 #include "toplev.h"
60 #include "pretty-print.h"
61 #include "diagnostic.h"
62 #include "flags.h"
63 #include "java-tree.h"
64 #include "jcf.h"
65 #include "lex.h"
66 #include "parse.h"
67 #include "zipfile.h"
68 #include "convert.h"
69 #include "buffer.h"
70 #include "function.h"
71 #include "except.h"
72 #include "ggc.h"
73 #include "debug.h"
74 #include "tree-inline.h"
75 #include "tree-dump.h"
76 #include "cgraph.h"
77 #include "target.h"
78
79 /* Local function prototypes */
80 static char *java_accstring_lookup (int);
81 static const char *accessibility_string (int);
82 static void classitf_redefinition_error (const char *,tree, tree, tree);
83 static void variable_redefinition_error (tree, tree, tree, int);
84 static tree create_class (int, tree, tree, tree);
85 static tree create_interface (int, tree, tree);
86 static void end_class_declaration (int);
87 static tree find_field (tree, tree);
88 static tree lookup_field_wrapper (tree, tree);
89 static int duplicate_declaration_error_p (tree, tree, tree);
90 static void register_fields (int, tree, tree);
91 static tree parser_qualified_classname (tree);
92 static int parser_check_super (tree, tree, tree);
93 static int parser_check_super_interface (tree, tree, tree);
94 static void check_modifiers_consistency (int);
95 static tree lookup_cl (tree);
96 static tree lookup_java_method2 (tree, tree, int);
97 static tree method_header (int, tree, tree, tree);
98 static void fix_method_argument_names (tree ,tree);
99 static tree method_declarator (tree, tree);
100 static void parse_warning_context (tree cl, const char *gmsgid, ...) ATTRIBUTE_GCC_DIAG(2,3);
101 #ifdef USE_MAPPED_LOCATION
102 static void issue_warning_error_from_context
103 (source_location, const char *gmsgid, va_list *);
104 #else
105 static void issue_warning_error_from_context
106 (tree, const char *gmsgid, va_list *);
107 #endif
108 static void parse_ctor_invocation_error (void);
109 static tree parse_jdk1_1_error (const char *);
110 static void complete_class_report_errors (jdep *);
111 static int process_imports (void);
112 static void read_import_dir (tree);
113 static int find_in_imports_on_demand (tree, tree);
114 static void find_in_imports (tree, tree);
115 static bool inner_class_accessible (tree, tree);
116 static void check_inner_class_access (tree, tree, tree);
117 static int check_pkg_class_access (tree, tree, bool, tree);
118 static tree resolve_package (tree, tree *, tree *);
119 static tree resolve_class (tree, tree, tree, tree);
120 static void declare_local_variables (int, tree, tree);
121 static void dump_java_tree (enum tree_dump_index, tree);
122 static void source_start_java_method (tree);
123 static void source_end_java_method (void);
124 static tree find_name_in_single_imports (tree);
125 static void check_abstract_method_header (tree);
126 static tree lookup_java_interface_method2 (tree, tree);
127 static tree resolve_expression_name (tree, tree *);
128 static tree maybe_create_class_interface_decl (tree, tree, tree, tree);
129 static int check_class_interface_creation (int, int, tree, tree, tree, tree);
130 static tree patch_method_invocation (tree, tree, tree, int, int *, tree *);
131 static tree resolve_and_layout (tree, tree);
132 static tree qualify_and_find (tree, tree, tree);
133 static tree resolve_no_layout (tree, tree);
134 static int invocation_mode (tree, int);
135 static tree find_applicable_accessible_methods_list (int, tree, tree, tree);
136 static void search_applicable_methods_list (int, tree, tree, tree, tree *, tree *);
137 static tree find_most_specific_methods_list (tree);
138 static int argument_types_convertible (tree, tree);
139 static tree patch_invoke (tree, tree, tree);
140 static int maybe_use_access_method (int, tree *, tree *);
141 static tree lookup_method_invoke (int, tree, tree, tree, tree);
142 static tree register_incomplete_type (int, tree, tree, tree);
143 static tree check_inner_circular_reference (tree, tree);
144 static tree check_circular_reference (tree);
145 static tree obtain_incomplete_type (tree);
146 static tree java_complete_lhs (tree);
147 static tree java_complete_tree (tree);
148 static tree maybe_generate_pre_expand_clinit (tree);
149 static int analyze_clinit_body (tree, tree);
150 static int maybe_yank_clinit (tree);
151 static void start_complete_expand_method (tree);
152 static void java_complete_expand_method (tree);
153 static void java_expand_method_bodies (tree);
154 static int unresolved_type_p (tree, tree *);
155 static void create_jdep_list (struct parser_ctxt *);
156 static tree build_expr_block (tree, tree);
157 static tree enter_block (void);
158 static tree exit_block (void);
159 static tree lookup_name_in_blocks (tree);
160 static void maybe_absorb_scoping_blocks (void);
161 static tree build_method_invocation (tree, tree);
162 static tree build_new_invocation (tree, tree);
163 static tree build_assignment (int, int, tree, tree);
164 static tree build_binop (enum tree_code, int, tree, tree);
165 static tree patch_assignment (tree, tree);
166 static tree patch_binop (tree, tree, tree, int);
167 static tree build_unaryop (int, int, tree);
168 static tree build_incdec (int, int, tree, int);
169 static tree patch_unaryop (tree, tree);
170 static tree build_cast (int, tree, tree);
171 static tree build_null_of_type (tree);
172 static tree patch_cast (tree, tree);
173 static int valid_ref_assignconv_cast_p (tree, tree, int);
174 static int valid_builtin_assignconv_identity_widening_p (tree, tree);
175 static int valid_cast_to_p (tree, tree);
176 static int valid_method_invocation_conversion_p (tree, tree);
177 static tree try_builtin_assignconv (tree, tree, tree);
178 static tree try_reference_assignconv (tree, tree);
179 static tree build_unresolved_array_type (tree);
180 static int build_type_name_from_array_name (tree, tree *);
181 static tree build_array_from_name (tree, tree, tree, tree *);
182 static tree build_array_ref (int, tree, tree);
183 static tree patch_array_ref (tree);
184 #ifdef USE_MAPPED_LOCATION
185 static tree make_qualified_name (tree, tree, source_location);
186 #else
187 static tree make_qualified_name (tree, tree, int);
188 #endif
189 static tree merge_qualified_name (tree, tree);
190 static tree make_qualified_primary (tree, tree, int);
191 static int resolve_qualified_expression_name (tree, tree *, tree *, tree *);
192 static void qualify_ambiguous_name (tree);
193 static tree resolve_field_access (tree, tree *, tree *);
194 static tree build_newarray_node (tree, tree, int);
195 static tree patch_newarray (tree);
196 static tree resolve_type_during_patch (tree);
197 static tree build_this (int);
198 static tree build_wfl_wrap (tree, int);
199 static tree build_return (int, tree);
200 static tree patch_return (tree);
201 static tree maybe_access_field (tree, tree, tree);
202 static int complete_function_arguments (tree);
203 static int check_for_static_method_reference (tree, tree, tree, tree, tree);
204 static int not_accessible_p (tree, tree, tree, int);
205 static void check_deprecation (tree, tree);
206 static int class_in_current_package (tree);
207 static tree build_if_else_statement (int, tree, tree, tree);
208 static tree patch_if_else_statement (tree);
209 static tree add_stmt_to_block (tree, tree, tree);
210 static tree patch_exit_expr (tree);
211 static tree build_labeled_block (int, tree);
212 static tree finish_labeled_statement (tree, tree);
213 static tree build_bc_statement (int, int, tree);
214 static tree patch_bc_statement (tree);
215 static tree patch_loop_statement (tree);
216 static tree build_new_loop (tree);
217 static tree build_loop_body (int, tree, int);
218 static tree finish_loop_body (int, tree, tree, int);
219 static tree build_debugable_stmt (int, tree);
220 static tree finish_for_loop (int, tree, tree, tree);
221 static tree patch_switch_statement (tree);
222 static tree string_constant_concatenation (tree, tree);
223 static tree build_string_concatenation (tree, tree);
224 static tree patch_string_cst (tree);
225 static tree patch_string (tree);
226 static tree encapsulate_with_try_catch (int, tree, tree, tree);
227 #ifdef USE_MAPPED_LOCATION
228 static tree build_assertion (source_location, tree, tree);
229 #else
230 static tree build_assertion (int, tree, tree);
231 #endif
232 static tree build_try_statement (int, tree, tree);
233 static tree build_try_finally_statement (int, tree, tree);
234 static tree patch_try_statement (tree);
235 static tree patch_synchronized_statement (tree, tree);
236 static tree patch_throw_statement (tree, tree);
237 static void add_exception_to_throws (tree, tree);
238 #ifdef USE_MAPPED_LOCATION
239 static void check_thrown_exceptions (source_location, tree, tree);
240 #else
241 static void check_thrown_exceptions (int, tree, tree);
242 #endif
243 static int check_thrown_exceptions_do (tree);
244 static bool ctors_unchecked_throws_clause_p (tree);
245 static void check_concrete_throws_clauses (tree, tree, tree, tree);
246 static void check_throws_clauses (tree, tree, tree);
247 static void finish_method_declaration (tree);
248 static tree build_super_invocation (tree);
249 static int verify_constructor_circularity (tree, tree);
250 static char *constructor_circularity_msg (tree, tree);
251 static tree build_this_super_qualified_invocation (int, tree, tree, int, int);
252 static const char *get_printable_method_name (tree);
253 static tree patch_conditional_expr (tree, tree, tree);
254 static tree generate_finit (tree);
255 static tree generate_instinit (tree);
256 static tree build_instinit_invocation (tree);
257 static void fix_constructors (tree);
258 static tree build_alias_initializer_parameter_list (int, tree, tree, int *);
259 static tree craft_constructor (tree, tree);
260 static tree get_constructor_super (tree);
261 static tree create_artificial_method (tree, int, tree, tree, tree);
262 static void start_artificial_method_body (tree);
263 static void end_artificial_method_body (tree);
264 static int check_method_redefinition (tree, tree);
265 static int check_method_types_complete (tree);
266 static bool hack_is_accessible_p (tree, tree);
267 static void java_check_regular_methods (tree);
268 static void check_interface_throws_clauses (tree, tree);
269 static void java_check_abstract_methods (tree);
270 static void unreachable_stmt_error (tree);
271 static int not_accessible_field_error (tree, tree);
272 static tree find_expr_with_wfl (tree);
273 static void missing_return_error (tree);
274 static tree build_new_array_init (int, tree);
275 static tree patch_new_array_init (tree, tree);
276 static tree maybe_build_array_element_wfl (tree);
277 static int array_constructor_check_entry (tree, constructor_elt *);
278 static const char *purify_type_name (const char *);
279 static tree fold_constant_for_init (tree, tree);
280 static jdeplist *reverse_jdep_list (struct parser_ctxt *);
281 static void static_ref_err (tree, tree, tree);
282 static void parser_add_interface (tree, tree, tree);
283 static void add_superinterfaces (tree, tree);
284 static tree jdep_resolve_class (jdep *);
285 static int note_possible_classname (const char *, int);
286 static void java_complete_expand_classes (void);
287 static void java_complete_expand_class (tree);
288 static void java_complete_expand_methods (tree);
289 static tree cut_identifier_in_qualified (tree);
290 static tree java_stabilize_reference (tree);
291 static tree do_unary_numeric_promotion (tree);
292 static char * operator_string (tree);
293 static tree do_merge_string_cste (tree, const char *, int, int);
294 static tree merge_string_cste (tree, tree, int);
295 static tree java_refold (tree);
296 static int java_decl_equiv (tree, tree);
297 static int binop_compound_p (enum tree_code);
298 static tree search_loop (tree);
299 static int labeled_block_contains_loop_p (tree, tree);
300 static int check_abstract_method_definitions (int, tree, tree);
301 static void java_check_abstract_method_definitions (tree);
302 static void java_debug_context_do (int);
303 static void java_parser_context_push_initialized_field (void);
304 static void java_parser_context_pop_initialized_field (void);
305 static tree reorder_static_initialized (tree);
306 static void java_parser_context_suspend (void);
307 static void java_parser_context_resume (void);
308 static int pop_current_osb (struct parser_ctxt *);
309
310 /* JDK 1.1 work. FIXME */
311
312 static tree maybe_make_nested_class_name (tree);
313 static int make_nested_class_name (tree);
314 static void link_nested_class_to_enclosing (void);
315 static tree resolve_inner_class (tree, tree, tree, tree);
316 static tree find_as_inner_class (tree, tree, tree);
317 static tree find_as_inner_class_do (tree, tree);
318 static int check_inner_class_redefinition (tree, tree);
319
320 static tree build_thisn_assign (void);
321 static tree build_current_thisn (tree);
322 static tree build_access_to_thisn (tree, tree, int);
323 static tree maybe_build_thisn_access_method (tree);
324
325 static tree build_nested_field_access (tree, tree);
326 static tree build_nested_field_access_methods (tree);
327 static tree build_nested_field_access_method (tree, tree, tree, tree, tree);
328 static tree build_nested_field_access_expr (int, tree, tree, tree, tree);
329 static tree build_nested_method_access_method (tree);
330 static tree build_new_access_id (void);
331
332 static int nested_member_access_p (tree, tree);
333 static int nested_field_expanded_access_p (tree, tree *, tree *, tree *);
334 static tree nested_field_access_fix (tree, tree, tree);
335
336 static tree build_incomplete_class_ref (int, tree);
337 static tree patch_incomplete_class_ref (tree);
338 static tree create_anonymous_class (tree);
339 static void patch_anonymous_class (tree, tree, tree);
340 static void add_inner_class_fields (tree, tree);
341
342 static tree build_dot_class_method (tree);
343 static tree build_dot_class_method_invocation (tree, tree);
344 static void create_new_parser_context (int);
345 static tree maybe_build_class_init_for_field (tree, tree);
346
347 static int emit_test_initialization (void **, void *);
348
349 static char *string_convert_int_cst (tree);
350
351 /* Number of error found so far. */
352 int java_error_count;
353 /* Number of warning found so far. */
354 int java_warning_count;
355 /* Cyclic inheritance report, as it can be set by layout_class */
356 const char *cyclic_inheritance_report;
357
358 /* The current parser context */
359 struct parser_ctxt *ctxp;
360
361 /* List of things that were analyzed for which code will be generated */
362 struct parser_ctxt *ctxp_for_generation = NULL;
363 struct parser_ctxt *ctxp_for_generation_last = NULL;
364
365 /* binop_lookup maps token to tree_code. It is used where binary
366 operations are involved and required by the parser. RDIV_EXPR
367 covers both integral/floating point division. The code is changed
368 once the type of both operator is worked out. */
369
370 static const enum tree_code binop_lookup[19] =
371 {
372 PLUS_EXPR, MINUS_EXPR, MULT_EXPR, RDIV_EXPR, TRUNC_MOD_EXPR,
373 LSHIFT_EXPR, RSHIFT_EXPR, URSHIFT_EXPR,
374 BIT_AND_EXPR, BIT_XOR_EXPR, BIT_IOR_EXPR,
375 TRUTH_ANDIF_EXPR, TRUTH_ORIF_EXPR,
376 EQ_EXPR, NE_EXPR, GT_EXPR, GE_EXPR, LT_EXPR, LE_EXPR,
377 };
378 #define BINOP_LOOKUP(VALUE) \
379 binop_lookup [((VALUE) - PLUS_TK) % ARRAY_SIZE (binop_lookup)]
380
381 /* This is the end index for binary operators that can also be used
382 in compound assignments. */
383 #define BINOP_COMPOUND_CANDIDATES 11
384
385 /* The "$L" identifier we use to create labels. */
386 static GTY(()) tree label_id;
387
388 /* The "StringBuffer" identifier used for the String `+' operator. */
389 static GTY(()) tree wfl_string_buffer;
390
391 /* The "append" identifier used for String `+' operator. */
392 static GTY(()) tree wfl_append;
393
394 /* The "toString" identifier used for String `+' operator. */
395 static GTY(()) tree wfl_to_string;
396
397 /* The "java.lang" import qualified name. */
398 static GTY(()) tree java_lang_id;
399
400 /* The generated `inst$' identifier used for generated enclosing
401 instance/field access functions. */
402 static GTY(()) tree inst_id;
403
404 /* Context and flag for static blocks */
405 static GTY(()) tree current_static_block;
406
407 /* The generated `write_parm_value$' identifier. */
408 static GTY(()) tree wpv_id;
409
410 /* Hold THIS for the scope of the current method decl. */
411 static GTY(()) tree current_this;
412
413 /* Hold a list of catch clauses list. The first element of this list is
414 the list of the catch clauses of the currently analyzed try block. */
415 static GTY(()) tree currently_caught_type_list;
416
417 /* This holds a linked list of all the case labels for the current
418 switch statement. It is only used when checking to see if there
419 are duplicate labels. FIXME: probably this should just be attached
420 to the switch itself; then it could be referenced via
421 `ctxp->current_loop'. */
422 static GTY(()) tree case_label_list;
423
424 /* Anonymous class counter. Will be reset to 1 every time a non
425 anonymous class gets created. */
426 static int anonymous_class_counter = 1;
427
428 static GTY(()) tree src_parse_roots[1];
429
430 /* All classes seen from source code */
431 #define gclass_list src_parse_roots[0]
432
433 /* Check modifiers. If one doesn't fit, retrieve it in its declaration
434 line and point it out. */
435 /* Should point out the one that don't fit. ASCII/unicode, going
436 backward. FIXME */
437
438 #define check_modifiers(__message, __value, __mask) do { \
439 if ((__value) & ~(__mask)) \
440 { \
441 size_t i, remainder = (__value) & ~(__mask); \
442 for (i = 0; i < ARRAY_SIZE (ctxp->modifier_ctx); i++) \
443 if ((1 << i) & remainder) \
444 parse_error_context (ctxp->modifier_ctx [i], (__message), \
445 java_accstring_lookup (1 << i)); \
446 } \
447 } while (0)
448
449 %}
450
451 %union {
452 tree node;
453 int sub_token;
454 struct {
455 int token;
456 #ifdef USE_MAPPED_LOCATION
457 source_location location;
458 #else
459 int location;
460 #endif
461 } operator;
462 int value;
463 }
464
465 %{
466 #ifdef USE_MAPPED_LOCATION
467 #define SET_EXPR_LOCATION_FROM_TOKEN(EXPR, TOKEN) \
468 SET_EXPR_LOCATION(EXPR, (TOKEN).location)
469 #else
470 #define SET_EXPR_LOCATION_FROM_TOKEN(EXPR, TOKEN) \
471 (EXPR_WFL_LINECOL (EXPR) = (TOKEN).location)
472 #endif
473
474 #include "lex.c"
475 %}
476
477 %pure_parser
478
479 /* Things defined here have to match the order of what's in the
480 binop_lookup table. */
481
482 %token PLUS_TK MINUS_TK MULT_TK DIV_TK REM_TK
483 %token LS_TK SRS_TK ZRS_TK
484 %token AND_TK XOR_TK OR_TK
485 %token BOOL_AND_TK BOOL_OR_TK
486 %token EQ_TK NEQ_TK GT_TK GTE_TK LT_TK LTE_TK
487
488 /* This maps to the same binop_lookup entry than the token above */
489
490 %token PLUS_ASSIGN_TK MINUS_ASSIGN_TK MULT_ASSIGN_TK DIV_ASSIGN_TK
491 %token REM_ASSIGN_TK
492 %token LS_ASSIGN_TK SRS_ASSIGN_TK ZRS_ASSIGN_TK
493 %token AND_ASSIGN_TK XOR_ASSIGN_TK OR_ASSIGN_TK
494
495
496 /* Modifier TOKEN have to be kept in this order. Don't scramble it */
497
498 %token PUBLIC_TK PRIVATE_TK PROTECTED_TK
499 %token STATIC_TK FINAL_TK SYNCHRONIZED_TK
500 %token VOLATILE_TK TRANSIENT_TK NATIVE_TK
501 %token PAD_TK ABSTRACT_TK STRICT_TK
502 %token MODIFIER_TK
503
504 /* Keep those two in order, too */
505 %token DECR_TK INCR_TK
506
507 /* From now one, things can be in any order */
508
509 %token DEFAULT_TK IF_TK THROW_TK
510 %token BOOLEAN_TK DO_TK IMPLEMENTS_TK
511 %token THROWS_TK BREAK_TK IMPORT_TK
512 %token ELSE_TK INSTANCEOF_TK RETURN_TK
513 %token VOID_TK CATCH_TK INTERFACE_TK
514 %token CASE_TK EXTENDS_TK FINALLY_TK
515 %token SUPER_TK WHILE_TK CLASS_TK
516 %token SWITCH_TK CONST_TK TRY_TK
517 %token FOR_TK NEW_TK CONTINUE_TK
518 %token GOTO_TK PACKAGE_TK THIS_TK
519 %token ASSERT_TK
520
521 %token BYTE_TK SHORT_TK INT_TK LONG_TK
522 %token CHAR_TK INTEGRAL_TK
523
524 %token FLOAT_TK DOUBLE_TK FP_TK
525
526 %token ID_TK
527
528 %token REL_QM_TK REL_CL_TK NOT_TK NEG_TK
529
530 %token ASSIGN_ANY_TK ASSIGN_TK
531 %token OP_TK CP_TK OCB_TK CCB_TK OSB_TK CSB_TK SC_TK C_TK DOT_TK
532
533 %token STRING_LIT_TK CHAR_LIT_TK INT_LIT_TK FP_LIT_TK
534 %token TRUE_TK FALSE_TK BOOL_LIT_TK NULL_TK
535
536 %type <value> modifiers MODIFIER_TK final synchronized
537
538 %type <node> super ID_TK identifier
539 %type <node> name simple_name qualified_name
540 %type <node> type_declaration compilation_unit
541 field_declaration method_declaration extends_interfaces
542 interfaces interface_type_list
543 import_declarations package_declaration
544 type_declarations interface_body
545 interface_member_declaration constant_declaration
546 interface_member_declarations interface_type
547 abstract_method_declaration
548 %type <node> class_body_declaration class_member_declaration
549 static_initializer constructor_declaration block
550 %type <node> class_body_declarations constructor_header
551 %type <node> class_or_interface_type class_type class_type_list
552 constructor_declarator explicit_constructor_invocation
553 %type <node> dim_expr dim_exprs this_or_super throws
554
555 %type <node> variable_declarator_id variable_declarator
556 variable_declarators variable_initializer
557 variable_initializers constructor_body
558 array_initializer
559
560 %type <node> class_body block_end constructor_block_end
561 %type <node> statement statement_without_trailing_substatement
562 labeled_statement if_then_statement label_decl
563 if_then_else_statement while_statement for_statement
564 statement_nsi labeled_statement_nsi do_statement
565 if_then_else_statement_nsi while_statement_nsi
566 for_statement_nsi statement_expression_list for_init
567 for_update statement_expression expression_statement
568 primary_no_new_array expression primary array_type
569 array_creation_initialized array_creation_uninitialized
570 class_instance_creation_expression field_access
571 method_invocation array_access something_dot_new
572 argument_list postfix_expression while_expression
573 post_increment_expression post_decrement_expression
574 unary_expression_not_plus_minus unary_expression
575 pre_increment_expression pre_decrement_expression
576 cast_expression
577 multiplicative_expression additive_expression
578 shift_expression relational_expression
579 equality_expression and_expression
580 exclusive_or_expression inclusive_or_expression
581 conditional_and_expression conditional_or_expression
582 conditional_expression assignment_expression
583 left_hand_side assignment for_header for_begin
584 constant_expression do_statement_begin empty_statement
585 switch_statement synchronized_statement throw_statement
586 try_statement assert_statement
587 switch_expression switch_block
588 catches catch_clause catch_clause_parameter finally
589 anonymous_class_creation trap_overflow_corner_case
590 %type <node> return_statement break_statement continue_statement
591
592 %type <operator> ASSIGN_TK MULT_ASSIGN_TK DIV_ASSIGN_TK
593 %type <operator> REM_ASSIGN_TK PLUS_ASSIGN_TK MINUS_ASSIGN_TK
594 %type <operator> LS_ASSIGN_TK SRS_ASSIGN_TK ZRS_ASSIGN_TK
595 %type <operator> AND_ASSIGN_TK XOR_ASSIGN_TK OR_ASSIGN_TK
596 %type <operator> ASSIGN_ANY_TK assignment_operator
597 %token <operator> EQ_TK GTE_TK ZRS_TK SRS_TK GT_TK LTE_TK LS_TK
598 %token <operator> BOOL_AND_TK AND_TK BOOL_OR_TK OR_TK INCR_TK PLUS_TK
599 %token <operator> DECR_TK MINUS_TK MULT_TK DIV_TK XOR_TK REM_TK NEQ_TK
600 %token <operator> NEG_TK REL_QM_TK REL_CL_TK NOT_TK LT_TK OCB_TK CCB_TK
601 %token <operator> OP_TK OSB_TK DOT_TK THROW_TK INSTANCEOF_TK
602 %type <operator> THIS_TK SUPER_TK RETURN_TK BREAK_TK CONTINUE_TK
603 %type <operator> CASE_TK DEFAULT_TK TRY_TK CATCH_TK SYNCHRONIZED_TK
604 %type <operator> NEW_TK ASSERT_TK
605
606 %type <node> method_body
607
608 %type <node> literal INT_LIT_TK FP_LIT_TK BOOL_LIT_TK CHAR_LIT_TK
609 STRING_LIT_TK NULL_TK VOID_TK
610
611 %type <node> IF_TK WHILE_TK FOR_TK
612
613 %type <node> formal_parameter_list formal_parameter
614 method_declarator method_header
615
616 %type <node> primitive_type reference_type type
617 BOOLEAN_TK INTEGRAL_TK FP_TK
618
619 /* Added or modified JDK 1.1 rule types */
620 %type <node> type_literals
621
622 %%
623 /* 19.2 Production from 2.3: The Syntactic Grammar */
624 goal: compilation_unit
625 {}
626 ;
627
628 /* 19.3 Productions from 3: Lexical structure */
629 literal:
630 INT_LIT_TK
631 | FP_LIT_TK
632 | BOOL_LIT_TK
633 | CHAR_LIT_TK
634 | STRING_LIT_TK
635 | NULL_TK
636 ;
637
638 /* 19.4 Productions from 4: Types, Values and Variables */
639 type:
640 primitive_type
641 | reference_type
642 ;
643
644 primitive_type:
645 INTEGRAL_TK
646 | FP_TK
647 | BOOLEAN_TK
648 ;
649
650 reference_type:
651 class_or_interface_type
652 | array_type
653 ;
654
655 class_or_interface_type:
656 name
657 ;
658
659 class_type:
660 class_or_interface_type /* Default rule */
661 ;
662
663 interface_type:
664 class_or_interface_type
665 ;
666
667 array_type:
668 primitive_type dims
669 {
670 int osb = pop_current_osb (ctxp);
671 tree t = build_java_array_type (($1), -1);
672 while (--osb)
673 t = build_unresolved_array_type (t);
674 $$ = t;
675 }
676 | name dims
677 {
678 int osb = pop_current_osb (ctxp);
679 tree t = $1;
680 while (osb--)
681 t = build_unresolved_array_type (t);
682 $$ = t;
683 }
684 ;
685
686 /* 19.5 Productions from 6: Names */
687 name:
688 simple_name /* Default rule */
689 | qualified_name /* Default rule */
690 ;
691
692 simple_name:
693 identifier /* Default rule */
694 ;
695
696 qualified_name:
697 name DOT_TK identifier
698 { $$ = make_qualified_name ($1, $3, $2.location); }
699 ;
700
701 identifier:
702 ID_TK
703 ;
704
705 /* 19.6: Production from 7: Packages */
706 compilation_unit:
707 {$$ = NULL;}
708 | package_declaration
709 | import_declarations
710 | type_declarations
711 | package_declaration import_declarations
712 | package_declaration type_declarations
713 | import_declarations type_declarations
714 | package_declaration import_declarations type_declarations
715 ;
716
717 import_declarations:
718 import_declaration
719 {
720 $$ = NULL;
721 }
722 | import_declarations import_declaration
723 {
724 $$ = NULL;
725 }
726 ;
727
728 type_declarations:
729 type_declaration
730 | type_declarations type_declaration
731 ;
732
733 package_declaration:
734 PACKAGE_TK name SC_TK
735 {
736 ctxp->package = EXPR_WFL_NODE ($2);
737 }
738 | PACKAGE_TK error
739 {yyerror ("Missing name"); RECOVER;}
740 | PACKAGE_TK name error
741 {yyerror ("';' expected"); RECOVER;}
742 ;
743
744 import_declaration:
745 single_type_import_declaration
746 | type_import_on_demand_declaration
747 ;
748
749 single_type_import_declaration:
750 IMPORT_TK name SC_TK
751 {
752 tree name = EXPR_WFL_NODE ($2), last_name;
753 int i = IDENTIFIER_LENGTH (name)-1;
754 const char *last = &IDENTIFIER_POINTER (name)[i];
755 while (last != IDENTIFIER_POINTER (name))
756 {
757 if (last [0] == '.')
758 break;
759 last--;
760 }
761 last_name = get_identifier (++last);
762 if (IS_A_SINGLE_IMPORT_CLASSFILE_NAME_P (last_name))
763 {
764 tree err = find_name_in_single_imports (last_name);
765 if (err && err != name)
766 parse_error_context
767 ($2, "Ambiguous class: %qs and %qs",
768 IDENTIFIER_POINTER (name),
769 IDENTIFIER_POINTER (err));
770 else
771 REGISTER_IMPORT ($2, last_name);
772 }
773 else
774 REGISTER_IMPORT ($2, last_name);
775 }
776 | IMPORT_TK error
777 {yyerror ("Missing name"); RECOVER;}
778 | IMPORT_TK name error
779 {yyerror ("';' expected"); RECOVER;}
780 ;
781
782 type_import_on_demand_declaration:
783 IMPORT_TK name DOT_TK MULT_TK SC_TK
784 {
785 tree name = EXPR_WFL_NODE ($2);
786 tree it;
787 /* Search for duplicates. */
788 for (it = ctxp->import_demand_list; it; it = TREE_CHAIN (it))
789 if (EXPR_WFL_NODE (TREE_PURPOSE (it)) == name)
790 break;
791 /* Don't import the same thing more than once, just ignore
792 duplicates (7.5.2) */
793 if (! it)
794 {
795 read_import_dir ($2);
796 ctxp->import_demand_list =
797 chainon (ctxp->import_demand_list,
798 build_tree_list ($2, NULL_TREE));
799 }
800 }
801 | IMPORT_TK name DOT_TK error
802 {yyerror ("'*' expected"); RECOVER;}
803 | IMPORT_TK name DOT_TK MULT_TK error
804 {yyerror ("';' expected"); RECOVER;}
805 ;
806
807 type_declaration:
808 class_declaration
809 { end_class_declaration (0); }
810 | interface_declaration
811 { end_class_declaration (0); }
812 | empty_statement
813 | error
814 {
815 YYERROR_NOW;
816 yyerror ("Class or interface declaration expected");
817 }
818 ;
819
820 /* 19.7 Shortened from the original:
821 modifiers: modifier | modifiers modifier
822 modifier: any of public... */
823 modifiers:
824 MODIFIER_TK
825 {
826 $$ = (1 << $1);
827 }
828 | modifiers MODIFIER_TK
829 {
830 int acc = (1 << $2);
831 if ($$ & acc)
832 parse_error_context
833 (ctxp->modifier_ctx [$2], "Modifier %qs declared twice",
834 java_accstring_lookup (acc));
835 else
836 {
837 $$ |= acc;
838 }
839 }
840 ;
841
842 /* 19.8.1 Production from $8.1: Class Declaration */
843 class_declaration:
844 modifiers CLASS_TK identifier super interfaces
845 { create_class ($1, $3, $4, $5); }
846 class_body
847 {;}
848 | CLASS_TK identifier super interfaces
849 { create_class (0, $2, $3, $4); }
850 class_body
851 {;}
852 | modifiers CLASS_TK error
853 { yyerror ("Missing class name"); RECOVER; }
854 | CLASS_TK error
855 { yyerror ("Missing class name"); RECOVER; }
856 | CLASS_TK identifier error
857 {
858 if (!ctxp->class_err) yyerror ("'{' expected");
859 DRECOVER(class1);
860 }
861 | modifiers CLASS_TK identifier error
862 { if (!ctxp->class_err) yyerror ("'{' expected"); RECOVER; }
863 ;
864
865 super:
866 { $$ = NULL; }
867 | EXTENDS_TK class_type
868 { $$ = $2; }
869 | EXTENDS_TK class_type error
870 {yyerror ("'{' expected"); ctxp->class_err=1;}
871 | EXTENDS_TK error
872 {yyerror ("Missing super class name"); ctxp->class_err=1;}
873 ;
874
875 interfaces:
876 { $$ = NULL_TREE; }
877 | IMPLEMENTS_TK interface_type_list
878 { $$ = $2; }
879 | IMPLEMENTS_TK error
880 {
881 ctxp->class_err=1;
882 yyerror ("Missing interface name");
883 }
884 ;
885
886 interface_type_list:
887 interface_type
888 {
889 ctxp->interface_number = 1;
890 $$ = build_tree_list ($1, NULL_TREE);
891 }
892 | interface_type_list C_TK interface_type
893 {
894 ctxp->interface_number++;
895 $$ = chainon ($1, build_tree_list ($3, NULL_TREE));
896 }
897 | interface_type_list C_TK error
898 {yyerror ("Missing interface name"); RECOVER;}
899 ;
900
901 class_body:
902 OCB_TK CCB_TK
903 {
904 $$ = GET_CPC ();
905 }
906 | OCB_TK class_body_declarations CCB_TK
907 {
908 $$ = GET_CPC ();
909 }
910 ;
911
912 class_body_declarations:
913 class_body_declaration
914 | class_body_declarations class_body_declaration
915 ;
916
917 class_body_declaration:
918 class_member_declaration
919 | static_initializer
920 | constructor_declaration
921 | block /* Added, JDK1.1, instance initializer */
922 {
923 if (!IS_EMPTY_STMT ($1))
924 {
925 TREE_CHAIN ($1) = CPC_INSTANCE_INITIALIZER_STMT (ctxp);
926 SET_CPC_INSTANCE_INITIALIZER_STMT (ctxp, $1);
927 }
928 }
929 ;
930
931 class_member_declaration:
932 field_declaration
933 | method_declaration
934 | class_declaration /* Added, JDK1.1 inner classes */
935 { end_class_declaration (1); }
936 | interface_declaration /* Added, JDK1.1 inner interfaces */
937 { end_class_declaration (1); }
938 | empty_statement
939 ;
940
941 /* 19.8.2 Productions from 8.3: Field Declarations */
942 field_declaration:
943 type variable_declarators SC_TK
944 { register_fields (0, $1, $2); }
945 | modifiers type variable_declarators SC_TK
946 {
947 check_modifiers
948 ("Illegal modifier %qs for field declaration",
949 $1, FIELD_MODIFIERS);
950 check_modifiers_consistency ($1);
951 register_fields ($1, $2, $3);
952 }
953 ;
954
955 variable_declarators:
956 /* Should we use build_decl_list () instead ? FIXME */
957 variable_declarator /* Default rule */
958 | variable_declarators C_TK variable_declarator
959 { $$ = chainon ($1, $3); }
960 | variable_declarators C_TK error
961 {yyerror ("Missing term"); RECOVER;}
962 ;
963
964 variable_declarator:
965 variable_declarator_id
966 { $$ = build_tree_list ($1, NULL_TREE); }
967 | variable_declarator_id ASSIGN_TK variable_initializer
968 {
969 if (java_error_count)
970 $3 = NULL_TREE;
971 $$ = build_tree_list
972 ($1, build_assignment ($2.token, $2.location, $1, $3));
973 }
974 | variable_declarator_id ASSIGN_TK error
975 {
976 yyerror ("Missing variable initializer");
977 $$ = build_tree_list ($1, NULL_TREE);
978 RECOVER;
979 }
980 | variable_declarator_id ASSIGN_TK variable_initializer error
981 {
982 yyerror ("';' expected");
983 $$ = build_tree_list ($1, NULL_TREE);
984 RECOVER;
985 }
986 ;
987
988 variable_declarator_id:
989 identifier
990 | variable_declarator_id OSB_TK CSB_TK
991 { $$ = build_unresolved_array_type ($1); }
992 | identifier error
993 {yyerror ("Invalid declaration"); DRECOVER(vdi);}
994 | variable_declarator_id OSB_TK error
995 {
996 yyerror ("']' expected");
997 DRECOVER(vdi);
998 }
999 | variable_declarator_id CSB_TK error
1000 {yyerror ("Unbalanced ']'"); DRECOVER(vdi);}
1001 ;
1002
1003 variable_initializer:
1004 expression
1005 | array_initializer
1006 ;
1007
1008 /* 19.8.3 Productions from 8.4: Method Declarations */
1009 method_declaration:
1010 method_header
1011 {
1012 current_function_decl = $1;
1013 if (current_function_decl
1014 && TREE_CODE (current_function_decl) == FUNCTION_DECL)
1015 source_start_java_method (current_function_decl);
1016 else
1017 current_function_decl = NULL_TREE;
1018 }
1019 method_body
1020 { finish_method_declaration ($3); }
1021 | method_header error
1022 {YYNOT_TWICE yyerror ("'{' expected"); RECOVER;}
1023 ;
1024
1025 method_header:
1026 type method_declarator throws
1027 { $$ = method_header (0, $1, $2, $3); }
1028 | VOID_TK method_declarator throws
1029 { $$ = method_header (0, void_type_node, $2, $3); }
1030 | modifiers type method_declarator throws
1031 { $$ = method_header ($1, $2, $3, $4); }
1032 | modifiers VOID_TK method_declarator throws
1033 { $$ = method_header ($1, void_type_node, $3, $4); }
1034 | type error
1035 {
1036 yyerror ("Invalid method declaration, method name required");
1037 $$ = NULL_TREE;
1038 RECOVER;
1039 }
1040 | modifiers type error
1041 {
1042 yyerror ("Identifier expected");
1043 $$ = NULL_TREE;
1044 RECOVER;
1045 }
1046 | VOID_TK error
1047 {
1048 yyerror ("Identifier expected");
1049 $$ = NULL_TREE;
1050 RECOVER;
1051 }
1052 | modifiers VOID_TK error
1053 {
1054 yyerror ("Identifier expected");
1055 $$ = NULL_TREE;
1056 RECOVER;
1057 }
1058 | modifiers error
1059 {
1060 yyerror ("Invalid method declaration, return type required");
1061 $$ = NULL_TREE;
1062 RECOVER;
1063 }
1064 ;
1065
1066 method_declarator:
1067 identifier OP_TK CP_TK
1068 {
1069 ctxp->formal_parameter_number = 0;
1070 $$ = method_declarator ($1, NULL_TREE);
1071 }
1072 | identifier OP_TK formal_parameter_list CP_TK
1073 { $$ = method_declarator ($1, $3); }
1074 | method_declarator OSB_TK CSB_TK
1075 {
1076 SET_EXPR_LOCATION_FROM_TOKEN (wfl_operator, $2);
1077 TREE_PURPOSE ($1) =
1078 build_unresolved_array_type (TREE_PURPOSE ($1));
1079 parse_warning_context
1080 (wfl_operator,
1081 "Discouraged form of returned type specification");
1082 }
1083 | identifier OP_TK error
1084 {yyerror ("')' expected"); DRECOVER(method_declarator);}
1085 | method_declarator OSB_TK error
1086 {yyerror ("']' expected"); RECOVER;}
1087 ;
1088
1089 formal_parameter_list:
1090 formal_parameter
1091 {
1092 ctxp->formal_parameter_number = 1;
1093 }
1094 | formal_parameter_list C_TK formal_parameter
1095 {
1096 ctxp->formal_parameter_number += 1;
1097 $$ = chainon ($1, $3);
1098 }
1099 | formal_parameter_list C_TK error
1100 { yyerror ("Missing formal parameter term"); RECOVER; }
1101 ;
1102
1103 formal_parameter:
1104 type variable_declarator_id
1105 {
1106 $$ = build_tree_list ($2, $1);
1107 }
1108 | final type variable_declarator_id /* Added, JDK1.1 final parms */
1109 {
1110 $$ = build_tree_list ($3, $2);
1111 ARG_FINAL_P ($$) = 1;
1112 }
1113 | type error
1114 {
1115 yyerror ("Missing identifier"); RECOVER;
1116 $$ = NULL_TREE;
1117 }
1118 | final type error
1119 {
1120 yyerror ("Missing identifier"); RECOVER;
1121 $$ = NULL_TREE;
1122 }
1123 ;
1124
1125 final:
1126 modifiers
1127 {
1128 check_modifiers ("Illegal modifier %qs. Only %<final%> was expected here",
1129 $1, ACC_FINAL);
1130 if ($1 != ACC_FINAL)
1131 MODIFIER_WFL (FINAL_TK) = build_wfl_node (NULL_TREE);
1132 }
1133 ;
1134
1135 throws:
1136 { $$ = NULL_TREE; }
1137 | THROWS_TK class_type_list
1138 { $$ = $2; }
1139 | THROWS_TK error
1140 {yyerror ("Missing class type term"); RECOVER;}
1141 ;
1142
1143 class_type_list:
1144 class_type
1145 { $$ = build_tree_list ($1, $1); }
1146 | class_type_list C_TK class_type
1147 { $$ = tree_cons ($3, $3, $1); }
1148 | class_type_list C_TK error
1149 {yyerror ("Missing class type term"); RECOVER;}
1150 ;
1151
1152 method_body:
1153 block
1154 | SC_TK { $$ = NULL_TREE; }
1155 ;
1156
1157 /* 19.8.4 Productions from 8.5: Static Initializers */
1158 static_initializer:
1159 static block
1160 {
1161 TREE_CHAIN ($2) = CPC_STATIC_INITIALIZER_STMT (ctxp);
1162 SET_CPC_STATIC_INITIALIZER_STMT (ctxp, $2);
1163 current_static_block = NULL_TREE;
1164 }
1165 ;
1166
1167 static: /* Test lval.sub_token here */
1168 modifiers
1169 {
1170 check_modifiers ("Illegal modifier %qs for static initializer", $1, ACC_STATIC);
1171 /* Can't have a static initializer in an innerclass */
1172 if ($1 | ACC_STATIC &&
1173 GET_CPC_LIST () && !TOPLEVEL_CLASS_DECL_P (GET_CPC ()))
1174 parse_error_context
1175 (MODIFIER_WFL (STATIC_TK),
1176 "Can't define static initializer in class %qs. Static initializer can only be defined in top-level classes",
1177 IDENTIFIER_POINTER (DECL_NAME (GET_CPC ())));
1178 SOURCE_FRONTEND_DEBUG (("Modifiers: %d", $1));
1179 }
1180 ;
1181
1182 /* 19.8.5 Productions from 8.6: Constructor Declarations */
1183 constructor_declaration:
1184 constructor_header
1185 {
1186 current_function_decl = $1;
1187 source_start_java_method (current_function_decl);
1188 }
1189 constructor_body
1190 { finish_method_declaration ($3); }
1191 ;
1192
1193 constructor_header:
1194 constructor_declarator throws
1195 { $$ = method_header (0, NULL_TREE, $1, $2); }
1196 | modifiers constructor_declarator throws
1197 { $$ = method_header ($1, NULL_TREE, $2, $3); }
1198 ;
1199
1200 constructor_declarator:
1201 simple_name OP_TK CP_TK
1202 {
1203 ctxp->formal_parameter_number = 0;
1204 $$ = method_declarator ($1, NULL_TREE);
1205 }
1206 | simple_name OP_TK formal_parameter_list CP_TK
1207 { $$ = method_declarator ($1, $3); }
1208 ;
1209
1210 constructor_body:
1211 /* Unlike regular method, we always need a complete (empty)
1212 body so we can safely perform all the required code
1213 addition (super invocation and field initialization) */
1214 block_begin constructor_block_end
1215 {
1216 BLOCK_EXPR_BODY ($2) = build_java_empty_stmt ();
1217 $$ = $2;
1218 }
1219 | block_begin explicit_constructor_invocation constructor_block_end
1220 { $$ = $3; }
1221 | block_begin block_statements constructor_block_end
1222 { $$ = $3; }
1223 | block_begin explicit_constructor_invocation block_statements constructor_block_end
1224 { $$ = $4; }
1225 ;
1226
1227 constructor_block_end:
1228 block_end
1229 ;
1230
1231 /* Error recovery for that rule moved down expression_statement: rule. */
1232 explicit_constructor_invocation:
1233 this_or_super OP_TK CP_TK SC_TK
1234 {
1235 $$ = build_method_invocation ($1, NULL_TREE);
1236 $$ = build_debugable_stmt (EXPR_WFL_LINECOL ($1), $$);
1237 $$ = java_method_add_stmt (current_function_decl, $$);
1238 }
1239 | this_or_super OP_TK argument_list CP_TK SC_TK
1240 {
1241 $$ = build_method_invocation ($1, $3);
1242 $$ = build_debugable_stmt (EXPR_WFL_LINECOL ($1), $$);
1243 $$ = java_method_add_stmt (current_function_decl, $$);
1244 }
1245 /* Added, JDK1.1 inner classes. Modified because the rule
1246 'primary' couldn't work. */
1247 | name DOT_TK SUPER_TK OP_TK argument_list CP_TK SC_TK
1248 {$$ = parse_jdk1_1_error ("explicit constructor invocation"); }
1249 | name DOT_TK SUPER_TK OP_TK CP_TK SC_TK
1250 {$$ = parse_jdk1_1_error ("explicit constructor invocation"); }
1251 ;
1252
1253 this_or_super: /* Added, simplifies error diagnostics */
1254 THIS_TK
1255 {
1256 tree wfl = build_wfl_node (this_identifier_node);
1257 SET_EXPR_LOCATION_FROM_TOKEN (wfl, $1);
1258 $$ = wfl;
1259 }
1260 | SUPER_TK
1261 {
1262 tree wfl = build_wfl_node (super_identifier_node);
1263 SET_EXPR_LOCATION_FROM_TOKEN (wfl, $1);
1264 $$ = wfl;
1265 }
1266 ;
1267
1268 /* 19.9 Productions from 9: Interfaces */
1269 /* 19.9.1 Productions from 9.1: Interfaces Declarations */
1270 interface_declaration:
1271 INTERFACE_TK identifier
1272 { create_interface (0, $2, NULL_TREE); }
1273 interface_body
1274 { ; }
1275 | modifiers INTERFACE_TK identifier
1276 { create_interface ($1, $3, NULL_TREE); }
1277 interface_body
1278 { ; }
1279 | INTERFACE_TK identifier extends_interfaces
1280 { create_interface (0, $2, $3); }
1281 interface_body
1282 { ; }
1283 | modifiers INTERFACE_TK identifier extends_interfaces
1284 { create_interface ($1, $3, $4); }
1285 interface_body
1286 { ; }
1287 | INTERFACE_TK identifier error
1288 { yyerror ("'{' expected"); RECOVER; }
1289 | modifiers INTERFACE_TK identifier error
1290 { yyerror ("'{' expected"); RECOVER; }
1291 ;
1292
1293 extends_interfaces:
1294 EXTENDS_TK interface_type
1295 {
1296 ctxp->interface_number = 1;
1297 $$ = build_tree_list ($2, NULL_TREE);
1298 }
1299 | extends_interfaces C_TK interface_type
1300 {
1301 ctxp->interface_number++;
1302 $$ = chainon ($1, build_tree_list ($3, NULL_TREE));
1303 }
1304 | EXTENDS_TK error
1305 {yyerror ("Invalid interface type"); RECOVER;}
1306 | extends_interfaces C_TK error
1307 {yyerror ("Missing term"); RECOVER;}
1308 ;
1309
1310 interface_body:
1311 OCB_TK CCB_TK
1312 { $$ = NULL_TREE; }
1313 | OCB_TK interface_member_declarations CCB_TK
1314 { $$ = NULL_TREE; }
1315 ;
1316
1317 interface_member_declarations:
1318 interface_member_declaration
1319 | interface_member_declarations interface_member_declaration
1320 ;
1321
1322 interface_member_declaration:
1323 constant_declaration
1324 | abstract_method_declaration
1325 | class_declaration /* Added, JDK1.1 inner classes */
1326 { end_class_declaration (1); }
1327 | interface_declaration /* Added, JDK1.1 inner interfaces */
1328 { end_class_declaration (1); }
1329 | empty_statement
1330 ;
1331
1332 constant_declaration:
1333 field_declaration
1334 ;
1335
1336 abstract_method_declaration:
1337 method_header SC_TK
1338 {
1339 check_abstract_method_header ($1);
1340 current_function_decl = NULL_TREE; /* FIXME ? */
1341 }
1342 | method_header error
1343 {yyerror ("';' expected"); RECOVER;}
1344 ;
1345
1346 /* 19.10 Productions from 10: Arrays */
1347 array_initializer:
1348 OCB_TK CCB_TK
1349 { $$ = build_new_array_init ($1.location, NULL_TREE); }
1350 | OCB_TK C_TK CCB_TK
1351 { $$ = build_new_array_init ($1.location, NULL_TREE); }
1352 | OCB_TK variable_initializers CCB_TK
1353 { $$ = build_new_array_init ($1.location, $2); }
1354 | OCB_TK variable_initializers C_TK CCB_TK
1355 { $$ = build_new_array_init ($1.location, $2); }
1356 ;
1357
1358 variable_initializers:
1359 variable_initializer
1360 {
1361 $$ = tree_cons (maybe_build_array_element_wfl ($1),
1362 $1, NULL_TREE);
1363 }
1364 | variable_initializers C_TK variable_initializer
1365 {
1366 $$ = tree_cons (maybe_build_array_element_wfl ($3), $3, $1);
1367 }
1368 | variable_initializers C_TK error
1369 {yyerror ("Missing term"); RECOVER;}
1370 ;
1371
1372 /* 19.11 Production from 14: Blocks and Statements */
1373 block:
1374 block_begin block_end
1375 { $$ = $2; }
1376 | block_begin block_statements block_end
1377 { $$ = $3; }
1378 ;
1379
1380 block_begin:
1381 OCB_TK
1382 { enter_block (); }
1383 ;
1384
1385 block_end:
1386 CCB_TK
1387 {
1388 maybe_absorb_scoping_blocks ();
1389 $$ = exit_block ();
1390 if (!BLOCK_SUBBLOCKS ($$))
1391 BLOCK_SUBBLOCKS ($$) = build_java_empty_stmt ();
1392 }
1393 ;
1394
1395 block_statements:
1396 block_statement
1397 | block_statements block_statement
1398 ;
1399
1400 block_statement:
1401 local_variable_declaration_statement
1402 | statement
1403 { java_method_add_stmt (current_function_decl, $1); }
1404 | class_declaration /* Added, JDK1.1 local classes */
1405 {
1406 LOCAL_CLASS_P (TREE_TYPE (GET_CPC ())) = 1;
1407 end_class_declaration (1);
1408 }
1409 ;
1410
1411 local_variable_declaration_statement:
1412 local_variable_declaration SC_TK /* Can't catch missing ';' here */
1413 ;
1414
1415 local_variable_declaration:
1416 type variable_declarators
1417 { declare_local_variables (0, $1, $2); }
1418 | final type variable_declarators /* Added, JDK1.1 final locals */
1419 { declare_local_variables ($1, $2, $3); }
1420 ;
1421
1422 statement:
1423 statement_without_trailing_substatement
1424 | labeled_statement
1425 | if_then_statement
1426 | if_then_else_statement
1427 | while_statement
1428 | for_statement
1429 { $$ = exit_block (); }
1430 ;
1431
1432 statement_nsi:
1433 statement_without_trailing_substatement
1434 | labeled_statement_nsi
1435 | if_then_else_statement_nsi
1436 | while_statement_nsi
1437 | for_statement_nsi
1438 { $$ = exit_block (); }
1439 ;
1440
1441 statement_without_trailing_substatement:
1442 block
1443 | empty_statement
1444 | expression_statement
1445 | switch_statement
1446 | do_statement
1447 | break_statement
1448 | continue_statement
1449 | return_statement
1450 | synchronized_statement
1451 | throw_statement
1452 | try_statement
1453 | assert_statement
1454 ;
1455
1456 empty_statement:
1457 SC_TK
1458 {
1459 if (flag_extraneous_semicolon
1460 && ! current_static_block
1461 && (! current_function_decl ||
1462 /* Verify we're not in a inner class declaration */
1463 (GET_CPC () != TYPE_NAME
1464 (DECL_CONTEXT (current_function_decl)))))
1465
1466 {
1467 #ifdef USE_MAPPED_LOCATION
1468 SET_EXPR_LOCATION (wfl_operator, input_location);
1469 #else
1470 EXPR_WFL_SET_LINECOL (wfl_operator, input_line, -1);
1471 #endif
1472 parse_warning_context (wfl_operator, "An empty declaration is a deprecated feature that should not be used");
1473 }
1474 $$ = build_java_empty_stmt ();
1475 }
1476 ;
1477
1478 label_decl:
1479 identifier REL_CL_TK
1480 {
1481 $$ = build_labeled_block (EXPR_WFL_LINECOL ($1),
1482 EXPR_WFL_NODE ($1));
1483 pushlevel (2);
1484 push_labeled_block ($$);
1485 PUSH_LABELED_BLOCK ($$);
1486 }
1487 ;
1488
1489 labeled_statement:
1490 label_decl statement
1491 { $$ = finish_labeled_statement ($1, $2); }
1492 | identifier error
1493 {yyerror ("':' expected"); RECOVER;}
1494 ;
1495
1496 labeled_statement_nsi:
1497 label_decl statement_nsi
1498 { $$ = finish_labeled_statement ($1, $2); }
1499 ;
1500
1501 /* We concentrate here a bunch of error handling rules that we couldn't write
1502 earlier, because expression_statement catches a missing ';'. */
1503 expression_statement:
1504 statement_expression SC_TK
1505 {
1506 /* We have a statement. Generate a WFL around it so
1507 we can debug it */
1508 #ifdef USE_MAPPED_LOCATION
1509 $$ = expr_add_location ($1, input_location, 1);
1510 #else
1511 $$ = build_expr_wfl ($1, input_filename, input_line, 0);
1512 JAVA_MAYBE_GENERATE_DEBUG_INFO ($$);
1513 #endif
1514 /* We know we have a statement, so set the debug
1515 info to be eventually generate here. */
1516 }
1517 | error SC_TK
1518 {
1519 YYNOT_TWICE yyerror ("Invalid expression statement");
1520 DRECOVER (expr_stmt);
1521 }
1522 | error OCB_TK
1523 {
1524 YYNOT_TWICE yyerror ("Invalid expression statement");
1525 DRECOVER (expr_stmt);
1526 }
1527 | error CCB_TK
1528 {
1529 YYNOT_TWICE yyerror ("Invalid expression statement");
1530 DRECOVER (expr_stmt);
1531 }
1532 | this_or_super OP_TK error
1533 {yyerror ("')' expected"); RECOVER;}
1534 | this_or_super OP_TK CP_TK error
1535 {
1536 parse_ctor_invocation_error ();
1537 RECOVER;
1538 }
1539 | this_or_super OP_TK argument_list error
1540 {yyerror ("')' expected"); RECOVER;}
1541 | this_or_super OP_TK argument_list CP_TK error
1542 {
1543 parse_ctor_invocation_error ();
1544 RECOVER;
1545 }
1546 | name DOT_TK SUPER_TK error
1547 {yyerror ("'(' expected"); RECOVER;}
1548 | name DOT_TK SUPER_TK OP_TK error
1549 {yyerror ("')' expected"); RECOVER;}
1550 | name DOT_TK SUPER_TK OP_TK argument_list error
1551 {yyerror ("')' expected"); RECOVER;}
1552 | name DOT_TK SUPER_TK OP_TK argument_list CP_TK error
1553 {yyerror ("';' expected"); RECOVER;}
1554 | name DOT_TK SUPER_TK OP_TK CP_TK error
1555 {yyerror ("';' expected"); RECOVER;}
1556 ;
1557
1558 statement_expression:
1559 assignment
1560 | pre_increment_expression
1561 | pre_decrement_expression
1562 | post_increment_expression
1563 | post_decrement_expression
1564 | method_invocation
1565 | class_instance_creation_expression
1566 ;
1567
1568 if_then_statement:
1569 IF_TK OP_TK expression CP_TK statement
1570 {
1571 $$ = build_if_else_statement ($2.location, $3,
1572 $5, NULL_TREE);
1573 }
1574 | IF_TK error
1575 {yyerror ("'(' expected"); RECOVER;}
1576 | IF_TK OP_TK error
1577 {yyerror ("Missing term"); RECOVER;}
1578 | IF_TK OP_TK expression error
1579 {yyerror ("')' expected"); RECOVER;}
1580 ;
1581
1582 if_then_else_statement:
1583 IF_TK OP_TK expression CP_TK statement_nsi ELSE_TK statement
1584 { $$ = build_if_else_statement ($2.location, $3, $5, $7); }
1585 ;
1586
1587 if_then_else_statement_nsi:
1588 IF_TK OP_TK expression CP_TK statement_nsi ELSE_TK statement_nsi
1589 { $$ = build_if_else_statement ($2.location, $3, $5, $7); }
1590 ;
1591
1592 switch_statement:
1593 switch_expression
1594 {
1595 enter_block ();
1596 }
1597 switch_block
1598 {
1599 /* Make into "proper list" of COMPOUND_EXPRs.
1600 I.e. make the last statement also have its own
1601 COMPOUND_EXPR. */
1602 maybe_absorb_scoping_blocks ();
1603 TREE_OPERAND ($1, 1) = exit_block ();
1604 $$ = build_debugable_stmt (EXPR_WFL_LINECOL ($1), $1);
1605 }
1606 ;
1607
1608 switch_expression:
1609 SWITCH_TK OP_TK expression CP_TK
1610 {
1611 $$ = build3 (SWITCH_EXPR, NULL_TREE, $3,
1612 NULL_TREE, NULL_TREE);
1613 SET_EXPR_LOCATION_FROM_TOKEN ($$, $2);
1614 }
1615 | SWITCH_TK error
1616 {yyerror ("'(' expected"); RECOVER;}
1617 | SWITCH_TK OP_TK error
1618 {yyerror ("Missing term or ')'"); DRECOVER(switch_statement);}
1619 | SWITCH_TK OP_TK expression CP_TK error
1620 {yyerror ("'{' expected"); RECOVER;}
1621 ;
1622
1623 /* Default assignment is there to avoid type node on switch_block
1624 node. */
1625
1626 switch_block:
1627 OCB_TK CCB_TK
1628 { $$ = NULL_TREE; }
1629 | OCB_TK switch_labels CCB_TK
1630 { $$ = NULL_TREE; }
1631 | OCB_TK switch_block_statement_groups CCB_TK
1632 { $$ = NULL_TREE; }
1633 | OCB_TK switch_block_statement_groups switch_labels CCB_TK
1634 { $$ = NULL_TREE; }
1635 ;
1636
1637 switch_block_statement_groups:
1638 switch_block_statement_group
1639 | switch_block_statement_groups switch_block_statement_group
1640 ;
1641
1642 switch_block_statement_group:
1643 switch_labels block_statements
1644 ;
1645
1646 switch_labels:
1647 switch_label
1648 | switch_labels switch_label
1649 ;
1650
1651 switch_label:
1652 CASE_TK constant_expression REL_CL_TK
1653 {
1654 tree lab = build1 (CASE_EXPR, NULL_TREE, $2);
1655 SET_EXPR_LOCATION_FROM_TOKEN (lab, $1);
1656 java_method_add_stmt (current_function_decl, lab);
1657 }
1658 | DEFAULT_TK REL_CL_TK
1659 {
1660 tree lab = make_node (DEFAULT_EXPR);
1661 SET_EXPR_LOCATION_FROM_TOKEN (lab, $1);
1662 java_method_add_stmt (current_function_decl, lab);
1663 }
1664 | CASE_TK error
1665 {yyerror ("Missing or invalid constant expression"); RECOVER;}
1666 | CASE_TK constant_expression error
1667 {yyerror ("':' expected"); RECOVER;}
1668 | DEFAULT_TK error
1669 {yyerror ("':' expected"); RECOVER;}
1670 ;
1671
1672 while_expression:
1673 WHILE_TK OP_TK expression CP_TK
1674 {
1675 tree body = build_loop_body ($2.location, $3, 0);
1676 $$ = build_new_loop (body);
1677 }
1678 ;
1679
1680 while_statement:
1681 while_expression statement
1682 { $$ = finish_loop_body (0, NULL_TREE, $2, 0); }
1683 | WHILE_TK error
1684 {YYERROR_NOW; yyerror ("'(' expected"); RECOVER;}
1685 | WHILE_TK OP_TK error
1686 {yyerror ("Missing term and ')' expected"); RECOVER;}
1687 | WHILE_TK OP_TK expression error
1688 {yyerror ("')' expected"); RECOVER;}
1689 ;
1690
1691 while_statement_nsi:
1692 while_expression statement_nsi
1693 { $$ = finish_loop_body (0, NULL_TREE, $2, 0); }
1694 ;
1695
1696 do_statement_begin:
1697 DO_TK
1698 {
1699 tree body = build_loop_body (0, NULL_TREE, 1);
1700 $$ = build_new_loop (body);
1701 }
1702 /* Need error handing here. FIXME */
1703 ;
1704
1705 do_statement:
1706 do_statement_begin statement WHILE_TK OP_TK expression CP_TK SC_TK
1707 { $$ = finish_loop_body ($4.location, $5, $2, 1); }
1708 ;
1709
1710 for_statement:
1711 for_begin SC_TK expression SC_TK for_update CP_TK statement
1712 {
1713 if (CONSTANT_CLASS_P ($3))
1714 $3 = build_wfl_node ($3);
1715 $$ = finish_for_loop (EXPR_WFL_LINECOL ($3), $3, $5, $7);
1716 }
1717 | for_begin SC_TK SC_TK for_update CP_TK statement
1718 {
1719 $$ = finish_for_loop (0, NULL_TREE, $4, $6);
1720 /* We have not condition, so we get rid of the EXIT_EXPR */
1721 LOOP_EXPR_BODY_CONDITION_EXPR (LOOP_EXPR_BODY ($$), 0) =
1722 build_java_empty_stmt ();
1723 }
1724 | for_begin SC_TK error
1725 {yyerror ("Invalid control expression"); RECOVER;}
1726 | for_begin SC_TK expression SC_TK error
1727 {yyerror ("Invalid update expression"); RECOVER;}
1728 | for_begin SC_TK SC_TK error
1729 {yyerror ("Invalid update expression"); RECOVER;}
1730 ;
1731
1732 for_statement_nsi:
1733 for_begin SC_TK expression SC_TK for_update CP_TK statement_nsi
1734 { $$ = finish_for_loop (EXPR_WFL_LINECOL ($3), $3, $5, $7);}
1735 | for_begin SC_TK SC_TK for_update CP_TK statement_nsi
1736 {
1737 $$ = finish_for_loop (0, NULL_TREE, $4, $6);
1738 /* We have not condition, so we get rid of the EXIT_EXPR */
1739 LOOP_EXPR_BODY_CONDITION_EXPR (LOOP_EXPR_BODY ($$), 0) =
1740 build_java_empty_stmt ();
1741 }
1742 ;
1743
1744 for_header:
1745 FOR_TK OP_TK
1746 {
1747 /* This scope defined for local variable that may be
1748 defined within the scope of the for loop */
1749 enter_block ();
1750 }
1751 | FOR_TK error
1752 {yyerror ("'(' expected"); DRECOVER(for_1);}
1753 | FOR_TK OP_TK error
1754 {yyerror ("Invalid init statement"); RECOVER;}
1755 ;
1756
1757 for_begin:
1758 for_header for_init
1759 {
1760 /* We now declare the loop body. The loop is
1761 declared as a for loop. */
1762 tree body = build_loop_body (0, NULL_TREE, 0);
1763 $$ = build_new_loop (body);
1764 FOR_LOOP_P ($$) = 1;
1765 /* The loop is added to the current block the for
1766 statement is defined within */
1767 java_method_add_stmt (current_function_decl, $$);
1768 }
1769 ;
1770 for_init: /* Can be empty */
1771 { $$ = build_java_empty_stmt (); }
1772 | statement_expression_list
1773 {
1774 /* Init statement recorded within the previously
1775 defined block scope */
1776 $$ = java_method_add_stmt (current_function_decl, $1);
1777 }
1778 | local_variable_declaration
1779 {
1780 /* Local variable are recorded within the previously
1781 defined block scope */
1782 $$ = NULL_TREE;
1783 }
1784 | statement_expression_list error
1785 {yyerror ("';' expected"); DRECOVER(for_init_1);}
1786 ;
1787
1788 for_update: /* Can be empty */
1789 {$$ = build_java_empty_stmt ();}
1790 | statement_expression_list
1791 { $$ = build_debugable_stmt (BUILD_LOCATION (), $1); }
1792 ;
1793
1794 statement_expression_list:
1795 statement_expression
1796 { $$ = add_stmt_to_compound (NULL_TREE, NULL_TREE, $1); }
1797 | statement_expression_list C_TK statement_expression
1798 { $$ = add_stmt_to_compound ($1, NULL_TREE, $3); }
1799 | statement_expression_list C_TK error
1800 {yyerror ("Missing term"); RECOVER;}
1801 ;
1802
1803 break_statement:
1804 BREAK_TK SC_TK
1805 { $$ = build_bc_statement ($1.location, 1, NULL_TREE); }
1806 | BREAK_TK identifier SC_TK
1807 { $$ = build_bc_statement ($1.location, 1, $2); }
1808 | BREAK_TK error
1809 {yyerror ("Missing term"); RECOVER;}
1810 | BREAK_TK identifier error
1811 {yyerror ("';' expected"); RECOVER;}
1812 ;
1813
1814 continue_statement:
1815 CONTINUE_TK SC_TK
1816 { $$ = build_bc_statement ($1.location, 0, NULL_TREE); }
1817 | CONTINUE_TK identifier SC_TK
1818 { $$ = build_bc_statement ($1.location, 0, $2); }
1819 | CONTINUE_TK error
1820 {yyerror ("Missing term"); RECOVER;}
1821 | CONTINUE_TK identifier error
1822 {yyerror ("';' expected"); RECOVER;}
1823 ;
1824
1825 return_statement:
1826 RETURN_TK SC_TK
1827 { $$ = build_return ($1.location, NULL_TREE); }
1828 | RETURN_TK expression SC_TK
1829 { $$ = build_return ($1.location, $2); }
1830 | RETURN_TK error
1831 {yyerror ("Missing term"); RECOVER;}
1832 | RETURN_TK expression error
1833 {yyerror ("';' expected"); RECOVER;}
1834 ;
1835
1836 throw_statement:
1837 THROW_TK expression SC_TK
1838 {
1839 $$ = build1 (THROW_EXPR, NULL_TREE, $2);
1840 SET_EXPR_LOCATION_FROM_TOKEN ($$, $1);
1841 }
1842 | THROW_TK error
1843 {yyerror ("Missing term"); RECOVER;}
1844 | THROW_TK expression error
1845 {yyerror ("';' expected"); RECOVER;}
1846 ;
1847
1848 assert_statement:
1849 ASSERT_TK expression REL_CL_TK expression SC_TK
1850 {
1851 $$ = build_assertion ($1.location, $2, $4);
1852 }
1853 | ASSERT_TK expression SC_TK
1854 {
1855 $$ = build_assertion ($1.location, $2, NULL_TREE);
1856 }
1857 | ASSERT_TK error
1858 {yyerror ("Missing term"); RECOVER;}
1859 | ASSERT_TK expression error
1860 {yyerror ("';' expected"); RECOVER;}
1861 ;
1862
1863 synchronized_statement:
1864 synchronized OP_TK expression CP_TK block
1865 {
1866 $$ = build2 (SYNCHRONIZED_EXPR, NULL_TREE, $3, $5);
1867 EXPR_WFL_LINECOL ($$) =
1868 EXPR_WFL_LINECOL (MODIFIER_WFL (SYNCHRONIZED_TK));
1869 }
1870 | synchronized OP_TK expression CP_TK error
1871 {yyerror ("'{' expected"); RECOVER;}
1872 | synchronized error
1873 {yyerror ("'(' expected"); RECOVER;}
1874 | synchronized OP_TK error CP_TK
1875 {yyerror ("Missing term"); RECOVER;}
1876 | synchronized OP_TK error
1877 {yyerror ("Missing term"); RECOVER;}
1878 ;
1879
1880 synchronized:
1881 modifiers
1882 {
1883 check_modifiers (
1884 "Illegal modifier %qs. Only %<synchronized%> was expected here",
1885 $1, ACC_SYNCHRONIZED);
1886 if ($1 != ACC_SYNCHRONIZED)
1887 MODIFIER_WFL (SYNCHRONIZED_TK) =
1888 build_wfl_node (NULL_TREE);
1889 }
1890 ;
1891
1892 try_statement:
1893 TRY_TK block catches
1894 { $$ = build_try_statement ($1.location, $2, $3); }
1895 | TRY_TK block finally
1896 { $$ = build_try_finally_statement ($1.location, $2, $3); }
1897 | TRY_TK block catches finally
1898 { $$ = build_try_finally_statement
1899 ($1.location, build_try_statement ($1.location,
1900 $2, $3), $4);
1901 }
1902 | TRY_TK error
1903 {yyerror ("'{' expected"); DRECOVER (try_statement);}
1904 ;
1905
1906 catches:
1907 catch_clause
1908 | catches catch_clause
1909 {
1910 TREE_CHAIN ($2) = $1;
1911 $$ = $2;
1912 }
1913 ;
1914
1915 catch_clause:
1916 catch_clause_parameter block
1917 {
1918 java_method_add_stmt (current_function_decl, $2);
1919 exit_block ();
1920 $$ = $1;
1921 }
1922 ;
1923
1924 catch_clause_parameter:
1925 CATCH_TK OP_TK formal_parameter CP_TK
1926 {
1927 /* We add a block to define a scope for
1928 formal_parameter (CCBP). The formal parameter is
1929 declared initialized by the appropriate function
1930 call */
1931 tree ccpb;
1932 tree init;
1933 if ($3)
1934 {
1935 ccpb = enter_block ();
1936 init = build_assignment
1937 (ASSIGN_TK, $2.location, TREE_PURPOSE ($3),
1938 build0 (JAVA_EXC_OBJ_EXPR, ptr_type_node));
1939 declare_local_variables (0, TREE_VALUE ($3),
1940 build_tree_list
1941 (TREE_PURPOSE ($3), init));
1942 $$ = build1 (JAVA_CATCH_EXPR, NULL_TREE, ccpb);
1943 SET_EXPR_LOCATION_FROM_TOKEN ($$, $1);
1944 }
1945 else
1946 {
1947 $$ = error_mark_node;
1948 }
1949 }
1950 | CATCH_TK error
1951 {yyerror ("'(' expected"); RECOVER; $$ = NULL_TREE;}
1952 | CATCH_TK OP_TK error
1953 {
1954 yyerror ("Missing term or ')' expected");
1955 RECOVER; $$ = NULL_TREE;
1956 }
1957 | CATCH_TK OP_TK error CP_TK /* That's for () */
1958 {yyerror ("Missing term"); RECOVER; $$ = NULL_TREE;}
1959 ;
1960
1961 finally:
1962 FINALLY_TK block
1963 { $$ = $2; }
1964 | FINALLY_TK error
1965 {yyerror ("'{' expected"); RECOVER; }
1966 ;
1967
1968 /* 19.12 Production from 15: Expressions */
1969 primary:
1970 primary_no_new_array
1971 | array_creation_uninitialized
1972 | array_creation_initialized
1973 ;
1974
1975 primary_no_new_array:
1976 literal
1977 | THIS_TK
1978 { $$ = build_this ($1.location); }
1979 | OP_TK expression CP_TK
1980 {$$ = $2;}
1981 | class_instance_creation_expression
1982 | field_access
1983 | method_invocation
1984 | array_access
1985 | type_literals
1986 /* Added, JDK1.1 inner classes. Documentation is wrong
1987 referring to a 'ClassName' (class_name) rule that doesn't
1988 exist. Used name: instead. */
1989 | name DOT_TK THIS_TK
1990 {
1991 tree wfl = build_wfl_node (this_identifier_node);
1992 $$ = make_qualified_primary ($1, wfl, EXPR_WFL_LINECOL ($1));
1993 }
1994 | OP_TK expression error
1995 {yyerror ("')' expected"); RECOVER;}
1996 | name DOT_TK error
1997 {yyerror ("'class' or 'this' expected" ); RECOVER;}
1998 | primitive_type DOT_TK error
1999 {yyerror ("'class' expected" ); RECOVER;}
2000 | VOID_TK DOT_TK error
2001 {yyerror ("'class' expected" ); RECOVER;}
2002 ;
2003
2004 type_literals:
2005 name DOT_TK CLASS_TK
2006 { $$ = build_incomplete_class_ref ($2.location, $1); }
2007 | array_type DOT_TK CLASS_TK
2008 { $$ = build_incomplete_class_ref ($2.location, $1); }
2009 | primitive_type DOT_TK CLASS_TK
2010 { $$ = build_incomplete_class_ref ($2.location, $1); }
2011 | VOID_TK DOT_TK CLASS_TK
2012 {
2013 $$ = build_incomplete_class_ref ($2.location,
2014 void_type_node);
2015 }
2016 ;
2017
2018 class_instance_creation_expression:
2019 NEW_TK class_type OP_TK argument_list CP_TK
2020 { $$ = build_new_invocation ($2, $4); }
2021 | NEW_TK class_type OP_TK CP_TK
2022 { $$ = build_new_invocation ($2, NULL_TREE); }
2023 | anonymous_class_creation
2024 /* Added, JDK1.1 inner classes, modified to use name or
2025 primary instead of primary solely which couldn't work in
2026 all situations. */
2027 | something_dot_new identifier OP_TK CP_TK
2028 {
2029 tree ctor = build_new_invocation ($2, NULL_TREE);
2030 $$ = make_qualified_primary ($1, ctor,
2031 EXPR_WFL_LINECOL ($1));
2032 }
2033 | something_dot_new identifier OP_TK CP_TK class_body
2034 | something_dot_new identifier OP_TK argument_list CP_TK
2035 {
2036 tree ctor = build_new_invocation ($2, $4);
2037 $$ = make_qualified_primary ($1, ctor,
2038 EXPR_WFL_LINECOL ($1));
2039 }
2040 | something_dot_new identifier OP_TK argument_list CP_TK class_body
2041 | NEW_TK error SC_TK
2042 {$$ = NULL_TREE; yyerror ("'(' expected"); DRECOVER(new_1);}
2043 | NEW_TK class_type error
2044 {$$ = NULL_TREE; yyerror ("'(' expected"); RECOVER;}
2045 | NEW_TK class_type OP_TK error
2046 {$$ = NULL_TREE; yyerror ("')' or term expected"); RECOVER;}
2047 | NEW_TK class_type OP_TK argument_list error
2048 {$$ = NULL_TREE; yyerror ("')' expected"); RECOVER;}
2049 | something_dot_new error
2050 {
2051 $$ = NULL_TREE;
2052 YYERROR_NOW;
2053 yyerror ("Identifier expected");
2054 RECOVER;
2055 }
2056 | something_dot_new identifier error
2057 {$$ = NULL_TREE; yyerror ("'(' expected"); RECOVER;}
2058 ;
2059
2060 /* Created after JDK1.1 rules originally added to
2061 class_instance_creation_expression, but modified to use
2062 'class_type' instead of 'TypeName' (type_name) which is mentioned
2063 in the documentation but doesn't exist. */
2064
2065 anonymous_class_creation:
2066 NEW_TK class_type OP_TK argument_list CP_TK
2067 { create_anonymous_class ($2); }
2068 class_body
2069 {
2070 tree id = build_wfl_node (DECL_NAME (GET_CPC ()));
2071 EXPR_WFL_LINECOL (id) = EXPR_WFL_LINECOL ($2);
2072
2073 end_class_declaration (1);
2074
2075 /* Now we can craft the new expression */
2076 $$ = build_new_invocation (id, $4);
2077
2078 /* Note that we can't possibly be here if
2079 `class_type' is an interface (in which case the
2080 anonymous class extends Object and implements
2081 `class_type', hence its constructor can't have
2082 arguments.) */
2083
2084 /* Otherwise, the innerclass must feature a
2085 constructor matching `argument_list'. Anonymous
2086 classes are a bit special: it's impossible to
2087 define constructor for them, hence constructors
2088 must be generated following the hints provided by
2089 the `new' expression. Whether a super constructor
2090 of that nature exists or not is to be verified
2091 later on in get_constructor_super.
2092
2093 It's during the expansion of a `new' statement
2094 referring to an anonymous class that a ctor will
2095 be generated for the anonymous class, with the
2096 right arguments. */
2097
2098 }
2099 | NEW_TK class_type OP_TK CP_TK
2100 { create_anonymous_class ($2); }
2101 class_body
2102 {
2103 tree id = build_wfl_node (DECL_NAME (GET_CPC ()));
2104 EXPR_WFL_LINECOL (id) = EXPR_WFL_LINECOL ($2);
2105
2106 end_class_declaration (1);
2107
2108 /* Now we can craft the new expression. The
2109 statement doesn't need to be remember so that a
2110 constructor can be generated, since its signature
2111 is already known. */
2112 $$ = build_new_invocation (id, NULL_TREE);
2113 }
2114 ;
2115
2116 something_dot_new: /* Added, not part of the specs. */
2117 name DOT_TK NEW_TK
2118 { $$ = $1; }
2119 | primary DOT_TK NEW_TK
2120 { $$ = $1; }
2121 ;
2122
2123 argument_list:
2124 expression
2125 {
2126 $$ = tree_cons (NULL_TREE, $1, NULL_TREE);
2127 ctxp->formal_parameter_number = 1;
2128 }
2129 | argument_list C_TK expression
2130 {
2131 ctxp->formal_parameter_number += 1;
2132 $$ = tree_cons (NULL_TREE, $3, $1);
2133 }
2134 | argument_list C_TK error
2135 {yyerror ("Missing term"); RECOVER;}
2136 ;
2137
2138 array_creation_uninitialized:
2139 NEW_TK primitive_type dim_exprs
2140 { $$ = build_newarray_node ($2, $3, 0); }
2141 | NEW_TK class_or_interface_type dim_exprs
2142 { $$ = build_newarray_node ($2, $3, 0); }
2143 | NEW_TK primitive_type dim_exprs dims
2144 { $$ = build_newarray_node ($2, $3, pop_current_osb (ctxp));}
2145 | NEW_TK class_or_interface_type dim_exprs dims
2146 { $$ = build_newarray_node ($2, $3, pop_current_osb (ctxp));}
2147 | NEW_TK error CSB_TK
2148 {yyerror ("'[' expected"); DRECOVER ("]");}
2149 | NEW_TK error OSB_TK
2150 {yyerror ("']' expected"); RECOVER;}
2151 ;
2152
2153 array_creation_initialized:
2154 /* Added, JDK1.1 anonymous array. Initial documentation rule
2155 modified */
2156 NEW_TK class_or_interface_type dims array_initializer
2157 {
2158 char *sig;
2159 int osb = pop_current_osb (ctxp);
2160 while (osb--)
2161 obstack_grow (&temporary_obstack, "[]", 2);
2162 obstack_1grow (&temporary_obstack, '\0');
2163 sig = obstack_finish (&temporary_obstack);
2164 $$ = build3 (NEW_ANONYMOUS_ARRAY_EXPR, NULL_TREE,
2165 $2, get_identifier (sig), $4);
2166 }
2167 | NEW_TK primitive_type dims array_initializer
2168 {
2169 int osb = pop_current_osb (ctxp);
2170 tree type = $2;
2171 while (osb--)
2172 type = build_java_array_type (type, -1);
2173 $$ = build3 (NEW_ANONYMOUS_ARRAY_EXPR, NULL_TREE,
2174 build_pointer_type (type), NULL_TREE, $4);
2175 }
2176 | NEW_TK error CSB_TK
2177 {yyerror ("'[' expected"); DRECOVER ("]");}
2178 | NEW_TK error OSB_TK
2179 {yyerror ("']' expected"); RECOVER;}
2180 ;
2181
2182 dim_exprs:
2183 dim_expr
2184 { $$ = build_tree_list (NULL_TREE, $1); }
2185 | dim_exprs dim_expr
2186 { $$ = tree_cons (NULL_TREE, $2, $$); }
2187 ;
2188
2189 dim_expr:
2190 OSB_TK expression CSB_TK
2191 {
2192 if (JNUMERIC_TYPE_P (TREE_TYPE ($2)))
2193 {
2194 $2 = build_wfl_node ($2);
2195 TREE_TYPE ($2) = NULL_TREE;
2196 }
2197 EXPR_WFL_LINECOL ($2) = $1.location;
2198 $$ = $2;
2199 }
2200 | OSB_TK expression error
2201 {yyerror ("']' expected"); RECOVER;}
2202 | OSB_TK error
2203 {
2204 yyerror ("Missing term");
2205 yyerror ("']' expected");
2206 RECOVER;
2207 }
2208 ;
2209
2210 dims:
2211 OSB_TK CSB_TK
2212 {
2213 int allocate = 0;
2214 /* If not initialized, allocate memory for the osb
2215 numbers stack */
2216 if (!ctxp->osb_limit)
2217 {
2218 allocate = ctxp->osb_limit = 32;
2219 ctxp->osb_depth = -1;
2220 }
2221 /* If capacity overflown, reallocate a bigger chunk */
2222 else if (ctxp->osb_depth+1 == ctxp->osb_limit)
2223 allocate = ctxp->osb_limit << 1;
2224
2225 if (allocate)
2226 {
2227 allocate *= sizeof (int);
2228 if (ctxp->osb_number)
2229 ctxp->osb_number = xrealloc (ctxp->osb_number,
2230 allocate);
2231 else
2232 ctxp->osb_number = xmalloc (allocate);
2233 }
2234 ctxp->osb_depth++;
2235 CURRENT_OSB (ctxp) = 1;
2236 }
2237 | dims OSB_TK CSB_TK
2238 { CURRENT_OSB (ctxp)++; }
2239 | dims OSB_TK error
2240 { yyerror ("']' expected"); RECOVER;}
2241 ;
2242
2243 field_access:
2244 primary DOT_TK identifier
2245 { $$ = make_qualified_primary ($1, $3, $2.location); }
2246 /* FIXME - REWRITE TO:
2247 { $$ = build_binop (COMPONENT_REF, $2.location, $1, $3); } */
2248 | SUPER_TK DOT_TK identifier
2249 {
2250 tree super_wfl = build_wfl_node (super_identifier_node);
2251 SET_EXPR_LOCATION_FROM_TOKEN (super_wfl, $1);
2252 $$ = make_qualified_name (super_wfl, $3, $2.location);
2253 }
2254 | SUPER_TK error
2255 {yyerror ("Field expected"); DRECOVER (super_field_acces);}
2256 ;
2257
2258 method_invocation:
2259 name OP_TK CP_TK
2260 { $$ = build_method_invocation ($1, NULL_TREE); }
2261 | name OP_TK argument_list CP_TK
2262 { $$ = build_method_invocation ($1, $3); }
2263 | primary DOT_TK identifier OP_TK CP_TK
2264 {
2265 if (TREE_CODE ($1) == THIS_EXPR)
2266 $$ = build_this_super_qualified_invocation
2267 (1, $3, NULL_TREE, 0, $2.location);
2268 else
2269 {
2270 tree invok = build_method_invocation ($3, NULL_TREE);
2271 $$ = make_qualified_primary ($1, invok, $2.location);
2272 }
2273 }
2274 | primary DOT_TK identifier OP_TK argument_list CP_TK
2275 {
2276 if (TREE_CODE ($1) == THIS_EXPR)
2277 $$ = build_this_super_qualified_invocation
2278 (1, $3, $5, 0, $2.location);
2279 else
2280 {
2281 tree invok = build_method_invocation ($3, $5);
2282 $$ = make_qualified_primary ($1, invok, $2.location);
2283 }
2284 }
2285 | SUPER_TK DOT_TK identifier OP_TK CP_TK
2286 {
2287 $$ = build_this_super_qualified_invocation
2288 (0, $3, NULL_TREE, $1.location, $2.location);
2289 }
2290 | SUPER_TK DOT_TK identifier OP_TK argument_list CP_TK
2291 {
2292 $$ = build_this_super_qualified_invocation
2293 (0, $3, $5, $1.location, $2.location);
2294 }
2295 /* Screws up thing. I let it here until I'm convinced it can
2296 be removed. FIXME
2297 | primary DOT_TK error
2298 {yyerror ("'(' expected"); DRECOVER(bad);} */
2299 | SUPER_TK DOT_TK error CP_TK
2300 { yyerror ("'(' expected"); DRECOVER (method_invocation); }
2301 | SUPER_TK DOT_TK error DOT_TK
2302 { yyerror ("'(' expected"); DRECOVER (method_invocation); }
2303 ;
2304
2305 array_access:
2306 name OSB_TK expression CSB_TK
2307 { $$ = build_array_ref ($2.location, $1, $3); }
2308 | primary_no_new_array OSB_TK expression CSB_TK
2309 { $$ = build_array_ref ($2.location, $1, $3); }
2310 | array_creation_initialized OSB_TK expression CSB_TK
2311 { $$ = build_array_ref ($2.location, $1, $3); }
2312 | name OSB_TK error
2313 {
2314 yyerror ("Missing term and ']' expected");
2315 DRECOVER(array_access);
2316 }
2317 | name OSB_TK expression error
2318 {
2319 yyerror ("']' expected");
2320 DRECOVER(array_access);
2321 }
2322 | primary_no_new_array OSB_TK error
2323 {
2324 yyerror ("Missing term and ']' expected");
2325 DRECOVER(array_access);
2326 }
2327 | primary_no_new_array OSB_TK expression error
2328 {
2329 yyerror ("']' expected");
2330 DRECOVER(array_access);
2331 }
2332 | array_creation_initialized OSB_TK error
2333 {
2334 yyerror ("Missing term and ']' expected");
2335 DRECOVER(array_access);
2336 }
2337 | array_creation_initialized OSB_TK expression error
2338 {
2339 yyerror ("']' expected");
2340 DRECOVER(array_access);
2341 }
2342 ;
2343
2344 postfix_expression:
2345 primary
2346 | name
2347 | post_increment_expression
2348 | post_decrement_expression
2349 ;
2350
2351 post_increment_expression:
2352 postfix_expression INCR_TK
2353 { $$ = build_incdec ($2.token, $2.location, $1, 1); }
2354 ;
2355
2356 post_decrement_expression:
2357 postfix_expression DECR_TK
2358 { $$ = build_incdec ($2.token, $2.location, $1, 1); }
2359 ;
2360
2361 trap_overflow_corner_case:
2362 pre_increment_expression
2363 | pre_decrement_expression
2364 | PLUS_TK unary_expression
2365 {$$ = build_unaryop ($1.token, $1.location, $2); }
2366 | unary_expression_not_plus_minus
2367 | PLUS_TK error
2368 {yyerror ("Missing term"); RECOVER}
2369 ;
2370
2371 unary_expression:
2372 trap_overflow_corner_case
2373 {
2374 if ($1)
2375 error_if_numeric_overflow ($1);
2376 $$ = $1;
2377 }
2378 | MINUS_TK trap_overflow_corner_case
2379 {$$ = build_unaryop ($1.token, $1.location, $2); }
2380 | MINUS_TK error
2381 {yyerror ("Missing term"); RECOVER}
2382 ;
2383
2384 pre_increment_expression:
2385 INCR_TK unary_expression
2386 {$$ = build_incdec ($1.token, $1.location, $2, 0); }
2387 | INCR_TK error
2388 {yyerror ("Missing term"); RECOVER}
2389 ;
2390
2391 pre_decrement_expression:
2392 DECR_TK unary_expression
2393 {$$ = build_incdec ($1.token, $1.location, $2, 0); }
2394 | DECR_TK error
2395 {yyerror ("Missing term"); RECOVER}
2396 ;
2397
2398 unary_expression_not_plus_minus:
2399 postfix_expression
2400 | NOT_TK unary_expression
2401 {$$ = build_unaryop ($1.token, $1.location, $2); }
2402 | NEG_TK unary_expression
2403 {$$ = build_unaryop ($1.token, $1.location, $2); }
2404 | cast_expression
2405 | NOT_TK error
2406 {yyerror ("Missing term"); RECOVER}
2407 | NEG_TK error
2408 {yyerror ("Missing term"); RECOVER}
2409 ;
2410
2411 cast_expression: /* Error handling here is potentially weak */
2412 OP_TK primitive_type dims CP_TK unary_expression
2413 {
2414 tree type = $2;
2415 int osb = pop_current_osb (ctxp);
2416 while (osb--)
2417 type = build_java_array_type (type, -1);
2418 $$ = build_cast ($1.location, type, $5);
2419 }
2420 | OP_TK primitive_type CP_TK unary_expression
2421 { $$ = build_cast ($1.location, $2, $4); }
2422 | OP_TK expression CP_TK unary_expression_not_plus_minus
2423 { $$ = build_cast ($1.location, $2, $4); }
2424 | OP_TK name dims CP_TK unary_expression_not_plus_minus
2425 {
2426 const char *ptr;
2427 int osb = pop_current_osb (ctxp);
2428 obstack_grow (&temporary_obstack,
2429 IDENTIFIER_POINTER (EXPR_WFL_NODE ($2)),
2430 IDENTIFIER_LENGTH (EXPR_WFL_NODE ($2)));
2431 while (osb--)
2432 obstack_grow (&temporary_obstack, "[]", 2);
2433 obstack_1grow (&temporary_obstack, '\0');
2434 ptr = obstack_finish (&temporary_obstack);
2435 EXPR_WFL_NODE ($2) = get_identifier (ptr);
2436 $$ = build_cast ($1.location, $2, $5);
2437 }
2438 | OP_TK primitive_type OSB_TK error
2439 {yyerror ("']' expected, invalid type expression");}
2440 | OP_TK error
2441 {
2442 YYNOT_TWICE yyerror ("Invalid type expression"); RECOVER;
2443 RECOVER;
2444 }
2445 | OP_TK primitive_type dims CP_TK error
2446 {yyerror ("Missing term"); RECOVER;}
2447 | OP_TK primitive_type CP_TK error
2448 {yyerror ("Missing term"); RECOVER;}
2449 | OP_TK name dims CP_TK error
2450 {yyerror ("Missing term"); RECOVER;}
2451 ;
2452
2453 multiplicative_expression:
2454 unary_expression
2455 | multiplicative_expression MULT_TK unary_expression
2456 {
2457 $$ = build_binop (BINOP_LOOKUP ($2.token),
2458 $2.location, $1, $3);
2459 }
2460 | multiplicative_expression DIV_TK unary_expression
2461 {
2462 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2463 $1, $3);
2464 }
2465 | multiplicative_expression REM_TK unary_expression
2466 {
2467 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2468 $1, $3);
2469 }
2470 | multiplicative_expression MULT_TK error
2471 {yyerror ("Missing term"); RECOVER;}
2472 | multiplicative_expression DIV_TK error
2473 {yyerror ("Missing term"); RECOVER;}
2474 | multiplicative_expression REM_TK error
2475 {yyerror ("Missing term"); RECOVER;}
2476 ;
2477
2478 additive_expression:
2479 multiplicative_expression
2480 | additive_expression PLUS_TK multiplicative_expression
2481 {
2482 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2483 $1, $3);
2484 }
2485 | additive_expression MINUS_TK multiplicative_expression
2486 {
2487 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2488 $1, $3);
2489 }
2490 | additive_expression PLUS_TK error
2491 {yyerror ("Missing term"); RECOVER;}
2492 | additive_expression MINUS_TK error
2493 {yyerror ("Missing term"); RECOVER;}
2494 ;
2495
2496 shift_expression:
2497 additive_expression
2498 | shift_expression LS_TK additive_expression
2499 {
2500 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2501 $1, $3);
2502 }
2503 | shift_expression SRS_TK additive_expression
2504 {
2505 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2506 $1, $3);
2507 }
2508 | shift_expression ZRS_TK additive_expression
2509 {
2510 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2511 $1, $3);
2512 }
2513 | shift_expression LS_TK error
2514 {yyerror ("Missing term"); RECOVER;}
2515 | shift_expression SRS_TK error
2516 {yyerror ("Missing term"); RECOVER;}
2517 | shift_expression ZRS_TK error
2518 {yyerror ("Missing term"); RECOVER;}
2519 ;
2520
2521 relational_expression:
2522 shift_expression
2523 | relational_expression LT_TK shift_expression
2524 {
2525 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2526 $1, $3);
2527 }
2528 | relational_expression GT_TK shift_expression
2529 {
2530 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2531 $1, $3);
2532 }
2533 | relational_expression LTE_TK shift_expression
2534 {
2535 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2536 $1, $3);
2537 }
2538 | relational_expression GTE_TK shift_expression
2539 {
2540 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2541 $1, $3);
2542 }
2543 | relational_expression INSTANCEOF_TK reference_type
2544 { $$ = build_binop (INSTANCEOF_EXPR, $2.location, $1, $3); }
2545 | relational_expression LT_TK error
2546 {yyerror ("Missing term"); RECOVER;}
2547 | relational_expression GT_TK error
2548 {yyerror ("Missing term"); RECOVER;}
2549 | relational_expression LTE_TK error
2550 {yyerror ("Missing term"); RECOVER;}
2551 | relational_expression GTE_TK error
2552 {yyerror ("Missing term"); RECOVER;}
2553 | relational_expression INSTANCEOF_TK error
2554 {yyerror ("Invalid reference type"); RECOVER;}
2555 ;
2556
2557 equality_expression:
2558 relational_expression
2559 | equality_expression EQ_TK relational_expression
2560 {
2561 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2562 $1, $3);
2563 }
2564 | equality_expression NEQ_TK relational_expression
2565 {
2566 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2567 $1, $3);
2568 }
2569 | equality_expression EQ_TK error
2570 {yyerror ("Missing term"); RECOVER;}
2571 | equality_expression NEQ_TK error
2572 {yyerror ("Missing term"); RECOVER;}
2573 ;
2574
2575 and_expression:
2576 equality_expression
2577 | and_expression AND_TK equality_expression
2578 {
2579 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2580 $1, $3);
2581 }
2582 | and_expression AND_TK error
2583 {yyerror ("Missing term"); RECOVER;}
2584 ;
2585
2586 exclusive_or_expression:
2587 and_expression
2588 | exclusive_or_expression XOR_TK and_expression
2589 {
2590 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2591 $1, $3);
2592 }
2593 | exclusive_or_expression XOR_TK error
2594 {yyerror ("Missing term"); RECOVER;}
2595 ;
2596
2597 inclusive_or_expression:
2598 exclusive_or_expression
2599 | inclusive_or_expression OR_TK exclusive_or_expression
2600 {
2601 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2602 $1, $3);
2603 }
2604 | inclusive_or_expression OR_TK error
2605 {yyerror ("Missing term"); RECOVER;}
2606 ;
2607
2608 conditional_and_expression:
2609 inclusive_or_expression
2610 | conditional_and_expression BOOL_AND_TK inclusive_or_expression
2611 {
2612 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2613 $1, $3);
2614 }
2615 | conditional_and_expression BOOL_AND_TK error
2616 {yyerror ("Missing term"); RECOVER;}
2617 ;
2618
2619 conditional_or_expression:
2620 conditional_and_expression
2621 | conditional_or_expression BOOL_OR_TK conditional_and_expression
2622 {
2623 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2624 $1, $3);
2625 }
2626 | conditional_or_expression BOOL_OR_TK error
2627 {yyerror ("Missing term"); RECOVER;}
2628 ;
2629
2630 conditional_expression: /* Error handling here is weak */
2631 conditional_or_expression
2632 | conditional_or_expression REL_QM_TK expression REL_CL_TK conditional_expression
2633 {
2634 $$ = build3 (CONDITIONAL_EXPR, NULL_TREE, $1, $3, $5);
2635 SET_EXPR_LOCATION_FROM_TOKEN ($$, $2);
2636 }
2637 | conditional_or_expression REL_QM_TK REL_CL_TK error
2638 {
2639 YYERROR_NOW;
2640 yyerror ("Missing term");
2641 DRECOVER (1);
2642 }
2643 | conditional_or_expression REL_QM_TK error
2644 {yyerror ("Missing term"); DRECOVER (2);}
2645 | conditional_or_expression REL_QM_TK expression REL_CL_TK error
2646 {yyerror ("Missing term"); DRECOVER (3);}
2647 ;
2648
2649 assignment_expression:
2650 conditional_expression
2651 | assignment
2652 ;
2653
2654 assignment:
2655 left_hand_side assignment_operator assignment_expression
2656 { $$ = build_assignment ($2.token, $2.location, $1, $3); }
2657 | left_hand_side assignment_operator error
2658 {
2659 YYNOT_TWICE yyerror ("Missing term");
2660 DRECOVER (assign);
2661 }
2662 ;
2663
2664 left_hand_side:
2665 name
2666 | field_access
2667 | array_access
2668 ;
2669
2670 assignment_operator:
2671 ASSIGN_ANY_TK
2672 | ASSIGN_TK
2673 ;
2674
2675 expression:
2676 assignment_expression
2677 ;
2678
2679 constant_expression:
2680 expression
2681 ;
2682
2683 %%
2684
2685 /* Helper function to retrieve an OSB count. Should be used when the
2686 `dims:' rule is being used. */
2687
2688 static int
2689 pop_current_osb (struct parser_ctxt *ctxp)
2690 {
2691 int to_return;
2692
2693 if (ctxp->osb_depth < 0)
2694 abort ();
2695
2696 to_return = CURRENT_OSB (ctxp);
2697 ctxp->osb_depth--;
2698
2699 return to_return;
2700 }
2701
2702 \f
2703
2704 /* This section of the code deal with save/restoring parser contexts.
2705 Add mode documentation here. FIXME */
2706
2707 /* Helper function. Create a new parser context. With
2708 COPY_FROM_PREVIOUS set to a nonzero value, content of the previous
2709 context is copied, otherwise, the new context is zeroed. The newly
2710 created context becomes the current one. */
2711
2712 static void
2713 create_new_parser_context (int copy_from_previous)
2714 {
2715 struct parser_ctxt *new;
2716
2717 new = ggc_alloc (sizeof (struct parser_ctxt));
2718 if (copy_from_previous)
2719 {
2720 memcpy (new, ctxp, sizeof (struct parser_ctxt));
2721 /* This flag, indicating the context saves global values,
2722 should only be set by java_parser_context_save_global. */
2723 new->saved_data_ctx = 0;
2724 }
2725 else
2726 memset (new, 0, sizeof (struct parser_ctxt));
2727
2728 new->next = ctxp;
2729 ctxp = new;
2730 }
2731
2732 /* Create a new parser context and make it the current one. */
2733
2734 void
2735 java_push_parser_context (void)
2736 {
2737 create_new_parser_context (0);
2738 }
2739
2740 void
2741 java_pop_parser_context (int generate)
2742 {
2743 tree current;
2744 struct parser_ctxt *next;
2745
2746 if (!ctxp)
2747 return;
2748
2749 next = ctxp->next;
2750 if (next)
2751 {
2752 input_location = ctxp->save_location;
2753 current_class = ctxp->class_type;
2754 }
2755
2756 /* If the old and new lexers differ, then free the old one. */
2757 if (ctxp->lexer && next && ctxp->lexer != next->lexer)
2758 java_destroy_lexer (ctxp->lexer);
2759
2760 /* Set the single import class file flag to 0 for the current list
2761 of imported things */
2762 for (current = ctxp->import_list; current; current = TREE_CHAIN (current))
2763 IS_A_SINGLE_IMPORT_CLASSFILE_NAME_P (TREE_VALUE (current)) = 0;
2764
2765 /* If we pushed a context to parse a class intended to be generated,
2766 we keep it so we can remember the class. What we could actually
2767 do is to just update a list of class names. */
2768 if (generate)
2769 {
2770 if (ctxp_for_generation_last == NULL)
2771 ctxp_for_generation = ctxp;
2772 else
2773 ctxp_for_generation_last->next = ctxp;
2774 ctxp->next = NULL;
2775 ctxp_for_generation_last = ctxp;
2776 }
2777
2778 /* And restore those of the previous context */
2779 if ((ctxp = next)) /* Assignment is really meant here */
2780 for (current = ctxp->import_list; current; current = TREE_CHAIN (current))
2781 IS_A_SINGLE_IMPORT_CLASSFILE_NAME_P (TREE_VALUE (current)) = 1;
2782 }
2783
2784 /* Create a parser context for the use of saving some global
2785 variables. */
2786
2787 void
2788 java_parser_context_save_global (void)
2789 {
2790 if (!ctxp)
2791 {
2792 java_push_parser_context ();
2793 ctxp->saved_data_ctx = 1;
2794 }
2795
2796 /* If this context already stores data, create a new one suitable
2797 for data storage. */
2798 else if (ctxp->saved_data)
2799 {
2800 create_new_parser_context (1);
2801 ctxp->saved_data_ctx = 1;
2802 }
2803
2804 ctxp->save_location = input_location;
2805 ctxp->class_type = current_class;
2806 ctxp->function_decl = current_function_decl;
2807 ctxp->saved_data = 1;
2808 }
2809
2810 /* Restore some global variables from the previous context. Make the
2811 previous context the current one. */
2812
2813 void
2814 java_parser_context_restore_global (void)
2815 {
2816 input_location = ctxp->save_location;
2817 current_class = ctxp->class_type;
2818 if (wfl_operator)
2819 #ifdef USE_MAPPED_LOCATION
2820 SET_EXPR_LOCATION (wfl_operator, ctxp->save_location);
2821 #else
2822 EXPR_WFL_FILENAME_NODE (wfl_operator) = get_identifier (input_filename);
2823 #endif
2824 current_function_decl = ctxp->function_decl;
2825 ctxp->saved_data = 0;
2826 if (ctxp->saved_data_ctx)
2827 java_pop_parser_context (0);
2828 }
2829
2830 /* Suspend vital data for the current class/function being parsed so
2831 that an other class can be parsed. Used to let local/anonymous
2832 classes be parsed. */
2833
2834 static void
2835 java_parser_context_suspend (void)
2836 {
2837 /* This makes debugging through java_debug_context easier */
2838 static const char *const name = "<inner buffer context>";
2839
2840 /* Duplicate the previous context, use it to save the globals we're
2841 interested in */
2842 create_new_parser_context (1);
2843 ctxp->function_decl = current_function_decl;
2844 ctxp->class_type = current_class;
2845
2846 /* Then create a new context which inherits all data from the
2847 previous one. This will be the new current context */
2848 create_new_parser_context (1);
2849
2850 /* Help debugging */
2851 ctxp->next->filename = name;
2852 }
2853
2854 /* Resume vital data for the current class/function being parsed so
2855 that an other class can be parsed. Used to let local/anonymous
2856 classes be parsed. The trick is the data storing file position
2857 informations must be restored to their current value, so parsing
2858 can resume as if no context was ever saved. */
2859
2860 static void
2861 java_parser_context_resume (void)
2862 {
2863 struct parser_ctxt *old = ctxp; /* This one is to be discarded */
2864 struct parser_ctxt *saver = old->next; /* This one contain saved info */
2865 struct parser_ctxt *restored = saver->next; /* This one is the old current */
2866
2867 /* We need to inherit the list of classes to complete/generate */
2868 restored->classd_list = old->classd_list;
2869 restored->class_list = old->class_list;
2870
2871 /* Restore the current class and function from the saver */
2872 current_class = saver->class_type;
2873 current_function_decl = saver->function_decl;
2874
2875 /* Retrieve the restored context */
2876 ctxp = restored;
2877
2878 /* Re-installed the data for the parsing to carry on */
2879 memcpy (&ctxp->marker_begining, &old->marker_begining,
2880 (size_t)(&ctxp->marker_end - &ctxp->marker_begining));
2881 }
2882
2883 /* Add a new anchor node to which all statement(s) initializing static
2884 and non static initialized upon declaration field(s) will be
2885 linked. */
2886
2887 static void
2888 java_parser_context_push_initialized_field (void)
2889 {
2890 tree node;
2891
2892 node = build_tree_list (NULL_TREE, NULL_TREE);
2893 TREE_CHAIN (node) = CPC_STATIC_INITIALIZER_LIST (ctxp);
2894 CPC_STATIC_INITIALIZER_LIST (ctxp) = node;
2895
2896 node = build_tree_list (NULL_TREE, NULL_TREE);
2897 TREE_CHAIN (node) = CPC_INITIALIZER_LIST (ctxp);
2898 CPC_INITIALIZER_LIST (ctxp) = node;
2899
2900 node = build_tree_list (NULL_TREE, NULL_TREE);
2901 TREE_CHAIN (node) = CPC_INSTANCE_INITIALIZER_LIST (ctxp);
2902 CPC_INSTANCE_INITIALIZER_LIST (ctxp) = node;
2903 }
2904
2905 /* Pop the lists of initialized field. If this lists aren't empty,
2906 remember them so we can use it to create and populate the finit$
2907 or <clinit> functions. */
2908
2909 static void
2910 java_parser_context_pop_initialized_field (void)
2911 {
2912 tree stmts;
2913 tree class_type = TREE_TYPE (GET_CPC ());
2914
2915 if (CPC_INITIALIZER_LIST (ctxp))
2916 {
2917 stmts = CPC_INITIALIZER_STMT (ctxp);
2918 CPC_INITIALIZER_LIST (ctxp) = TREE_CHAIN (CPC_INITIALIZER_LIST (ctxp));
2919 if (stmts && !java_error_count)
2920 TYPE_FINIT_STMT_LIST (class_type) = reorder_static_initialized (stmts);
2921 }
2922
2923 if (CPC_STATIC_INITIALIZER_LIST (ctxp))
2924 {
2925 stmts = CPC_STATIC_INITIALIZER_STMT (ctxp);
2926 CPC_STATIC_INITIALIZER_LIST (ctxp) =
2927 TREE_CHAIN (CPC_STATIC_INITIALIZER_LIST (ctxp));
2928 /* Keep initialization in order to enforce 8.5 */
2929 if (stmts && !java_error_count)
2930 TYPE_CLINIT_STMT_LIST (class_type) = nreverse (stmts);
2931 }
2932
2933 /* JDK 1.1 instance initializers */
2934 if (CPC_INSTANCE_INITIALIZER_LIST (ctxp))
2935 {
2936 stmts = CPC_INSTANCE_INITIALIZER_STMT (ctxp);
2937 CPC_INSTANCE_INITIALIZER_LIST (ctxp) =
2938 TREE_CHAIN (CPC_INSTANCE_INITIALIZER_LIST (ctxp));
2939 if (stmts && !java_error_count)
2940 TYPE_II_STMT_LIST (class_type) = nreverse (stmts);
2941 }
2942 }
2943
2944 static tree
2945 reorder_static_initialized (tree list)
2946 {
2947 /* We have to keep things in order. The alias initializer have to
2948 come first, then the initialized regular field, in reverse to
2949 keep them in lexical order. */
2950 tree marker, previous = NULL_TREE;
2951 for (marker = list; marker; previous = marker, marker = TREE_CHAIN (marker))
2952 if (TREE_CODE (marker) == TREE_LIST
2953 && !TREE_VALUE (marker) && !TREE_PURPOSE (marker))
2954 break;
2955
2956 /* No static initialized, the list is fine as is */
2957 if (!previous)
2958 list = TREE_CHAIN (marker);
2959
2960 /* No marker? reverse the whole list */
2961 else if (!marker)
2962 list = nreverse (list);
2963
2964 /* Otherwise, reverse what's after the marker and the new reordered
2965 sublist will replace the marker. */
2966 else
2967 {
2968 TREE_CHAIN (previous) = NULL_TREE;
2969 list = nreverse (list);
2970 list = chainon (TREE_CHAIN (marker), list);
2971 }
2972 return list;
2973 }
2974
2975 /* Helper functions to dump the parser context stack. */
2976
2977 #define TAB_CONTEXT(C) \
2978 {int i; for (i = 0; i < (C); i++) fputc (' ', stderr);}
2979
2980 static void
2981 java_debug_context_do (int tab)
2982 {
2983 struct parser_ctxt *copy = ctxp;
2984 while (copy)
2985 {
2986 TAB_CONTEXT (tab);
2987 fprintf (stderr, "ctxt: 0x%0lX\n", (unsigned long)copy);
2988 TAB_CONTEXT (tab);
2989 fprintf (stderr, "filename: %s\n", copy->filename);
2990 TAB_CONTEXT (tab);
2991 fprintf (stderr, "package: %s\n",
2992 (copy->package ?
2993 IDENTIFIER_POINTER (copy->package) : "<none>"));
2994 TAB_CONTEXT (tab);
2995 fprintf (stderr, "context for saving: %d\n", copy->saved_data_ctx);
2996 TAB_CONTEXT (tab);
2997 fprintf (stderr, "saved data: %d\n", copy->saved_data);
2998 copy = copy->next;
2999 tab += 2;
3000 }
3001 }
3002
3003 /* Dump the stacked up parser contexts. Intended to be called from a
3004 debugger. */
3005
3006 void
3007 java_debug_context (void)
3008 {
3009 java_debug_context_do (0);
3010 }
3011
3012 \f
3013
3014 /* Flag for the error report routine to issue the error the first time
3015 it's called (overriding the default behavior which is to drop the
3016 first invocation and honor the second one, taking advantage of a
3017 richer context. */
3018 static int force_error = 0;
3019
3020 /* Reporting an constructor invocation error. */
3021 static void
3022 parse_ctor_invocation_error (void)
3023 {
3024 if (DECL_CONSTRUCTOR_P (current_function_decl))
3025 yyerror ("Constructor invocation must be first thing in a constructor");
3026 else
3027 yyerror ("Only constructors can invoke constructors");
3028 }
3029
3030 /* Reporting JDK1.1 features not implemented. */
3031
3032 static tree
3033 parse_jdk1_1_error (const char *msg)
3034 {
3035 sorry (": %qs JDK1.1(TM) feature", msg);
3036 java_error_count++;
3037 return build_java_empty_stmt ();
3038 }
3039
3040 static int do_warning = 0;
3041
3042 void
3043 yyerror (const char *msgid)
3044 {
3045 #ifdef USE_MAPPED_LOCATION
3046 static source_location elc;
3047 expanded_location xloc = expand_location (input_location);
3048 int current_line = xloc.line;
3049 #else
3050 static java_lc elc;
3051 int save_lineno;
3052 int current_line = input_line;
3053 #endif
3054 static int prev_lineno;
3055 static const char *prev_msg;
3056
3057 char *remainder, *code_from_source;
3058
3059 if (!force_error && prev_lineno == current_line)
3060 return;
3061 #ifndef USE_MAPPED_LOCATION
3062 current_line = ctxp->lexer->token_start.line;
3063 #endif
3064
3065 /* Save current error location but report latter, when the context is
3066 richer. */
3067 if (ctxp->java_error_flag == 0)
3068 {
3069 ctxp->java_error_flag = 1;
3070 #ifdef USE_MAPPED_LOCATION
3071 elc = input_location;
3072 #else
3073 elc = ctxp->lexer->token_start;
3074 #endif
3075 /* Do something to use the previous line if we're reaching the
3076 end of the file... */
3077 #ifdef VERBOSE_SKELETON
3078 printf ("* Error detected (%s)\n", (msgid ? msgid : "(null)"));
3079 #endif
3080 return;
3081 }
3082
3083 /* Ignore duplicate message on the same line. BTW, this is dubious. FIXME */
3084 if (!force_error && msgid == prev_msg && prev_lineno == current_line)
3085 return;
3086
3087 ctxp->java_error_flag = 0;
3088 if (do_warning)
3089 java_warning_count++;
3090 else
3091 java_error_count++;
3092
3093 #if 0 /* FIXME */
3094 if (elc.col == 0 && msgid && msgid[1] == ';')
3095 elc = ctxp->prev_line_end;
3096 #endif
3097
3098 prev_msg = msgid;
3099
3100 #ifdef USE_MAPPED_LOCATION
3101 prev_lineno = current_line;
3102 code_from_source = java_get_line_col (xloc.file, current_line, xloc.column);
3103 #else
3104 save_lineno = input_line;
3105 prev_lineno = input_line = current_line;
3106 code_from_source = java_get_line_col (input_filename, current_line,
3107 ctxp->lexer->token_start.col);
3108 #endif
3109
3110
3111 obstack_grow0 (&temporary_obstack,
3112 code_from_source, strlen (code_from_source));
3113 remainder = obstack_finish (&temporary_obstack);
3114 if (do_warning)
3115 warning (0, "%s.\n%s", msgid, remainder);
3116 else
3117 error ("%s.\n%s", msgid, remainder);
3118
3119 /* This allow us to cheaply avoid an extra 'Invalid expression
3120 statement' error report when errors have been already reported on
3121 the same line. This occurs when we report an error but don't have
3122 a synchronization point other than ';', which
3123 expression_statement is the only one to take care of. */
3124 #ifndef USE_MAPPED_LOCATION
3125 input_line = save_lineno;
3126 #endif
3127 ctxp->prevent_ese = input_line;
3128 }
3129
3130 static void
3131 issue_warning_error_from_context (
3132 #ifdef USE_MAPPED_LOCATION
3133 source_location cl,
3134 #else
3135 tree cl,
3136 #endif
3137 const char *gmsgid, va_list *ap)
3138 {
3139 #ifdef USE_MAPPED_LOCATION
3140 source_location saved_location = input_location;
3141 expanded_location xloc = expand_location (cl);
3142 #else
3143 java_lc save_lc = ctxp->lexer->token_start;
3144 const char *saved = ctxp->filename, *saved_input_filename;
3145 #endif
3146 char buffer [4096];
3147 text_info text;
3148
3149 text.err_no = errno;
3150 text.args_ptr = ap;
3151 text.format_spec = gmsgid;
3152 pp_format (global_dc->printer, &text);
3153 pp_output_formatted_text (global_dc->printer);
3154 strncpy (buffer, pp_formatted_text (global_dc->printer), sizeof (buffer) - 1);
3155 buffer[sizeof (buffer) - 1] = '\0';
3156 pp_clear_output_area (global_dc->printer);
3157
3158 force_error = 1;
3159
3160 #ifdef USE_MAPPED_LOCATION
3161 if (xloc.file != NULL)
3162 {
3163 ctxp->filename = xloc.file;
3164 input_location = cl;
3165 }
3166 #else
3167 ctxp->lexer->token_start.line = EXPR_WFL_LINENO (cl);
3168 ctxp->lexer->token_start.col = (EXPR_WFL_COLNO (cl) == 0xfff ? -1
3169 : EXPR_WFL_COLNO (cl) == 0xffe ? -2
3170 : EXPR_WFL_COLNO (cl));
3171
3172 /* We have a CL, that's a good reason for using it if it contains data */
3173 if (TREE_CODE (cl) == EXPR_WITH_FILE_LOCATION && EXPR_WFL_FILENAME_NODE (cl))
3174 ctxp->filename = EXPR_WFL_FILENAME (cl);
3175 saved_input_filename = input_filename;
3176 input_filename = ctxp->filename;
3177 #endif
3178 java_error (NULL);
3179 java_error (buffer);
3180 #ifdef USE_MAPPED_LOCATION
3181 input_location = saved_location;
3182 #else
3183 ctxp->filename = saved;
3184 input_filename = saved_input_filename;
3185 ctxp->lexer->token_start = save_lc;
3186 #endif
3187 force_error = 0;
3188 }
3189
3190 /* Issue an error message at a current source line CL.
3191 FUTURE/FIXME: change cl to be a source_location. */
3192
3193 void
3194 parse_error_context (tree cl, const char *gmsgid, ...)
3195 {
3196 va_list ap;
3197 va_start (ap, gmsgid);
3198 #ifdef USE_MAPPED_LOCATION
3199 issue_warning_error_from_context (EXPR_LOCATION (cl), gmsgid, &ap);
3200 #else
3201 issue_warning_error_from_context (cl, gmsgid, &ap);
3202 #endif
3203 va_end (ap);
3204 }
3205
3206 /* Issue a warning at a current source line CL.
3207 FUTURE/FIXME: change cl to be a source_location. */
3208
3209 static void
3210 parse_warning_context (tree cl, const char *gmsgid, ...)
3211 {
3212 va_list ap;
3213 va_start (ap, gmsgid);
3214
3215 do_warning = 1;
3216 #ifdef USE_MAPPED_LOCATION
3217 issue_warning_error_from_context (EXPR_LOCATION (cl), gmsgid, &ap);
3218 #else
3219 issue_warning_error_from_context (cl, gmsgid, &ap);
3220 #endif
3221 do_warning = 0;
3222 va_end (ap);
3223 }
3224
3225 static tree
3226 find_expr_with_wfl (tree node)
3227 {
3228 while (node)
3229 {
3230 enum tree_code_class code;
3231 tree to_return;
3232
3233 switch (TREE_CODE (node))
3234 {
3235 case BLOCK:
3236 node = BLOCK_EXPR_BODY (node);
3237 continue;
3238
3239 case COMPOUND_EXPR:
3240 to_return = find_expr_with_wfl (TREE_OPERAND (node, 0));
3241 if (to_return)
3242 return to_return;
3243 node = TREE_OPERAND (node, 1);
3244 continue;
3245
3246 case LOOP_EXPR:
3247 node = TREE_OPERAND (node, 0);
3248 continue;
3249
3250 case LABELED_BLOCK_EXPR:
3251 node = LABELED_BLOCK_BODY (node);
3252 continue;
3253
3254 default:
3255 code = TREE_CODE_CLASS (TREE_CODE (node));
3256 if (((code == tcc_unary) || (code == tcc_binary)
3257 || (code == tcc_expression))
3258 && EXPR_WFL_LINECOL (node))
3259 return node;
3260 return NULL_TREE;
3261 }
3262 }
3263 return NULL_TREE;
3264 }
3265
3266 /* Issue a missing return statement error. Uses METHOD to figure the
3267 last line of the method the error occurs in. */
3268
3269 static void
3270 missing_return_error (tree method)
3271 {
3272 #ifdef USE_MAPPED_LOCATION
3273 SET_EXPR_LOCATION (wfl_operator, DECL_FUNCTION_LAST_LINE (method));
3274 #else
3275 EXPR_WFL_SET_LINECOL (wfl_operator, DECL_FUNCTION_LAST_LINE (method), -2);
3276 #endif
3277 parse_error_context (wfl_operator, "Missing return statement");
3278 }
3279
3280 /* Issue an unreachable statement error. From NODE, find the next
3281 statement to report appropriately. */
3282 static void
3283 unreachable_stmt_error (tree node)
3284 {
3285 /* Browse node to find the next expression node that has a WFL. Use
3286 the location to report the error */
3287 if (TREE_CODE (node) == COMPOUND_EXPR)
3288 node = find_expr_with_wfl (TREE_OPERAND (node, 1));
3289 else
3290 node = find_expr_with_wfl (node);
3291
3292 if (node)
3293 {
3294 #ifdef USE_MAPPED_LOCATION
3295 SET_EXPR_LOCATION (wfl_operator, EXPR_LOCATION (node));
3296 #else
3297 EXPR_WFL_SET_LINECOL (wfl_operator, EXPR_WFL_LINENO (node), -2);
3298 #endif
3299 parse_error_context (wfl_operator, "Unreachable statement");
3300 }
3301 else
3302 abort ();
3303 }
3304
3305 static int
3306 not_accessible_field_error (tree wfl, tree decl)
3307 {
3308 parse_error_context
3309 (wfl, "Can't access %s field %<%s.%s%> from %qs",
3310 accessibility_string (get_access_flags_from_decl (decl)),
3311 GET_TYPE_NAME (DECL_CONTEXT (decl)),
3312 IDENTIFIER_POINTER (DECL_NAME (decl)),
3313 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (current_class))));
3314 return 1;
3315 }
3316
3317 int
3318 java_report_errors (void)
3319 {
3320 if (java_error_count)
3321 fprintf (stderr, "%d error%s",
3322 java_error_count, (java_error_count == 1 ? "" : "s"));
3323 if (java_warning_count)
3324 fprintf (stderr, "%s%d warning%s", (java_error_count ? ", " : ""),
3325 java_warning_count, (java_warning_count == 1 ? "" : "s"));
3326 if (java_error_count || java_warning_count)
3327 putc ('\n', stderr);
3328 return java_error_count;
3329 }
3330
3331 static char *
3332 java_accstring_lookup (int flags)
3333 {
3334 static char buffer [80];
3335 #define COPY_RETURN(S) {strcpy (buffer, S); return buffer;}
3336
3337 /* Access modifier looked-up first for easier report on forbidden
3338 access. */
3339 if (flags & ACC_PUBLIC) COPY_RETURN ("public");
3340 if (flags & ACC_PRIVATE) COPY_RETURN ("private");
3341 if (flags & ACC_PROTECTED) COPY_RETURN ("protected");
3342 if (flags & ACC_STATIC) COPY_RETURN ("static");
3343 if (flags & ACC_FINAL) COPY_RETURN ("final");
3344 if (flags & ACC_SYNCHRONIZED) COPY_RETURN ("synchronized");
3345 if (flags & ACC_VOLATILE) COPY_RETURN ("volatile");
3346 if (flags & ACC_TRANSIENT) COPY_RETURN ("transient");
3347 if (flags & ACC_NATIVE) COPY_RETURN ("native");
3348 if (flags & ACC_INTERFACE) COPY_RETURN ("interface");
3349 if (flags & ACC_ABSTRACT) COPY_RETURN ("abstract");
3350
3351 buffer [0] = '\0';
3352 return buffer;
3353 #undef COPY_RETURN
3354 }
3355
3356 /* Returns a string denoting the accessibility of a class or a member as
3357 indicated by FLAGS. We need a separate function from
3358 java_accstring_lookup, as the latter can return spurious "static", etc.
3359 if package-private access is defined (in which case none of the
3360 relevant access control bits in FLAGS is set). */
3361
3362 static const char *
3363 accessibility_string (int flags)
3364 {
3365 if (flags & ACC_PRIVATE) return "private";
3366 if (flags & ACC_PROTECTED) return "protected";
3367 if (flags & ACC_PUBLIC) return "public";
3368
3369 return "package-private";
3370 }
3371
3372 /* Issuing error messages upon redefinition of classes, interfaces or
3373 variables. */
3374
3375 static void
3376 classitf_redefinition_error (const char *context, tree id, tree decl, tree cl)
3377 {
3378 parse_error_context (cl, "%s %qs already defined in %s:%d",
3379 context, IDENTIFIER_POINTER (id),
3380 DECL_SOURCE_FILE (decl), DECL_SOURCE_LINE (decl));
3381 /* Here we should point out where its redefined. It's a unicode. FIXME */
3382 }
3383
3384 static void
3385 variable_redefinition_error (tree context, tree name, tree type, int line)
3386 {
3387 const char *type_name;
3388
3389 /* Figure a proper name for type. We might haven't resolved it */
3390 if (TREE_CODE (type) == POINTER_TYPE && !TREE_TYPE (type))
3391 type_name = IDENTIFIER_POINTER (TYPE_NAME (type));
3392 else
3393 type_name = lang_printable_name (type, 0);
3394
3395 parse_error_context (context,
3396 "Variable %qs is already defined in this method and was declared %<%s %s%> at line %d",
3397 IDENTIFIER_POINTER (name),
3398 type_name, IDENTIFIER_POINTER (name), line);
3399 }
3400
3401 /* If ANAME is terminated with `[]', it indicates an array. This
3402 function returns the number of `[]' found and if this number is
3403 greater than zero, it extracts the array type name and places it in
3404 the node pointed to by TRIMMED unless TRIMMED is null. */
3405
3406 static int
3407 build_type_name_from_array_name (tree aname, tree *trimmed)
3408 {
3409 const char *name = IDENTIFIER_POINTER (aname);
3410 int len = IDENTIFIER_LENGTH (aname);
3411 int array_dims;
3412
3413 STRING_STRIP_BRACKETS (name, len, array_dims);
3414
3415 if (array_dims && trimmed)
3416 *trimmed = get_identifier_with_length (name, len);
3417
3418 return array_dims;
3419 }
3420
3421 static tree
3422 build_array_from_name (tree type, tree type_wfl, tree name, tree *ret_name)
3423 {
3424 int more_dims = 0;
3425
3426 /* Eventually get more dims */
3427 more_dims = build_type_name_from_array_name (name, &name);
3428
3429 /* If we have, then craft a new type for this variable */
3430 if (more_dims)
3431 {
3432 tree save = type;
3433
3434 /* If we have a pointer, use its type */
3435 if (TREE_CODE (type) == POINTER_TYPE)
3436 type = TREE_TYPE (type);
3437
3438 /* Building the first dimension of a primitive type uses this
3439 function */
3440 if (JPRIMITIVE_TYPE_P (type))
3441 {
3442 type = build_java_array_type (type, -1);
3443 more_dims--;
3444 }
3445 /* Otherwise, if we have a WFL for this type, use it (the type
3446 is already an array on an unresolved type, and we just keep
3447 on adding dimensions) */
3448 else if (type_wfl)
3449 {
3450 type = type_wfl;
3451 more_dims += build_type_name_from_array_name (TYPE_NAME (save),
3452 NULL);
3453 }
3454
3455 /* Add all the dimensions */
3456 while (more_dims--)
3457 type = build_unresolved_array_type (type);
3458
3459 /* The type may have been incomplete in the first place */
3460 if (type_wfl)
3461 type = obtain_incomplete_type (type);
3462 }
3463
3464 if (ret_name)
3465 *ret_name = name;
3466 return type;
3467 }
3468
3469 /* Build something that the type identifier resolver will identify as
3470 being an array to an unresolved type. TYPE_WFL is a WFL on a
3471 identifier. */
3472
3473 static tree
3474 build_unresolved_array_type (tree type_or_wfl)
3475 {
3476 const char *ptr;
3477 tree wfl;
3478
3479 /* TYPE_OR_WFL might be an array on a resolved type. In this case,
3480 just create a array type */
3481 if (TREE_CODE (type_or_wfl) == RECORD_TYPE)
3482 return build_java_array_type (type_or_wfl, -1);
3483
3484 obstack_grow (&temporary_obstack,
3485 IDENTIFIER_POINTER (EXPR_WFL_NODE (type_or_wfl)),
3486 IDENTIFIER_LENGTH (EXPR_WFL_NODE (type_or_wfl)));
3487 obstack_grow0 (&temporary_obstack, "[]", 2);
3488 ptr = obstack_finish (&temporary_obstack);
3489 #ifdef USE_MAPPED_LOCATION
3490 wfl = build_expr_wfl (get_identifier (ptr), EXPR_LOCATION (type_or_wfl));
3491 #else
3492 wfl = build_expr_wfl (get_identifier (ptr),
3493 EXPR_WFL_FILENAME (type_or_wfl),
3494 EXPR_WFL_LINENO (type_or_wfl),
3495 EXPR_WFL_COLNO (type_or_wfl));
3496 #endif
3497 /* Re-install the existing qualifications so that the type can be
3498 resolved properly. */
3499 EXPR_WFL_QUALIFICATION (wfl) = EXPR_WFL_QUALIFICATION (type_or_wfl);
3500 return wfl;
3501 }
3502
3503 static void
3504 parser_add_interface (tree class_decl, tree interface_decl, tree wfl)
3505 {
3506 if (maybe_add_interface (TREE_TYPE (class_decl), TREE_TYPE (interface_decl)))
3507 parse_error_context (wfl, "Interface %qs repeated",
3508 IDENTIFIER_POINTER (DECL_NAME (interface_decl)));
3509 }
3510
3511 /* Bulk of common class/interface checks. Return 1 if an error was
3512 encountered. TAG is 0 for a class, 1 for an interface. */
3513
3514 static int
3515 check_class_interface_creation (int is_interface, int flags, tree raw_name,
3516 tree qualified_name, tree decl, tree cl)
3517 {
3518 tree node;
3519 int sca = 0; /* Static class allowed */
3520 int icaf = 0; /* Inner class allowed flags */
3521 int uaaf = CLASS_MODIFIERS; /* Usually allowed access flags */
3522
3523 if (!quiet_flag)
3524 fprintf (stderr, " %s%s %s",
3525 (CPC_INNER_P () ? "inner" : ""),
3526 (is_interface ? "interface" : "class"),
3527 IDENTIFIER_POINTER (qualified_name));
3528
3529 /* Scope of an interface/class type name:
3530 - Can't be imported by a single type import
3531 - Can't already exists in the package */
3532 if (IS_A_SINGLE_IMPORT_CLASSFILE_NAME_P (raw_name)
3533 && (node = find_name_in_single_imports (raw_name))
3534 && !CPC_INNER_P ())
3535 {
3536 parse_error_context
3537 (cl, "%s name %qs clashes with imported type %qs",
3538 (is_interface ? "Interface" : "Class"),
3539 IDENTIFIER_POINTER (raw_name), IDENTIFIER_POINTER (node));
3540 return 1;
3541 }
3542 if (decl && CLASS_COMPLETE_P (decl))
3543 {
3544 classitf_redefinition_error ((is_interface ? "Interface" : "Class"),
3545 qualified_name, decl, cl);
3546 return 1;
3547 }
3548
3549 if (check_inner_class_redefinition (raw_name, cl))
3550 return 1;
3551
3552 /* If public, file name should match class/interface name, except
3553 when dealing with an inner class */
3554 if (!CPC_INNER_P () && (flags & ACC_PUBLIC ))
3555 {
3556 const char *fname = input_filename;
3557 const char *f;
3558
3559 for (f = fname + strlen (fname);
3560 f != fname && ! IS_DIR_SEPARATOR (*f);
3561 f--)
3562 ;
3563 if (IS_DIR_SEPARATOR (*f))
3564 f++;
3565 if (strncmp (IDENTIFIER_POINTER (raw_name),
3566 f , IDENTIFIER_LENGTH (raw_name)) ||
3567 f [IDENTIFIER_LENGTH (raw_name)] != '.')
3568 parse_error_context
3569 (cl, "Public %s %qs must be defined in a file called %<%s.java%>",
3570 (is_interface ? "interface" : "class"),
3571 IDENTIFIER_POINTER (qualified_name),
3572 IDENTIFIER_POINTER (raw_name));
3573 }
3574
3575 /* Static classes can be declared only in top level classes. Note:
3576 once static, a inner class is a top level class. */
3577 if (flags & ACC_STATIC)
3578 {
3579 /* Catch the specific error of declaring an class inner class
3580 with no toplevel enclosing class. Prevent check_modifiers from
3581 complaining a second time */
3582 if (CPC_INNER_P () && !TOPLEVEL_CLASS_DECL_P (GET_CPC()))
3583 {
3584 parse_error_context (cl, "Inner class %qs can't be static. Static classes can only occur in interfaces and top-level classes",
3585 IDENTIFIER_POINTER (qualified_name));
3586 sca = ACC_STATIC;
3587 }
3588 /* Else, in the context of a top-level class declaration, let
3589 `check_modifiers' do its job, otherwise, give it a go */
3590 else
3591 sca = (GET_CPC_LIST () ? ACC_STATIC : 0);
3592 }
3593
3594 /* Inner classes can be declared private or protected
3595 within their enclosing classes. */
3596 if (CPC_INNER_P ())
3597 {
3598 /* A class which is local to a block can't be public, private,
3599 protected or static. But it is created final, so allow this
3600 one. */
3601 if (current_function_decl)
3602 icaf = sca = uaaf = ACC_FINAL;
3603 else
3604 {
3605 check_modifiers_consistency (flags);
3606 icaf = ACC_PROTECTED;
3607 if (! CLASS_INTERFACE (GET_CPC ()))
3608 icaf |= ACC_PRIVATE;
3609 }
3610 }
3611
3612 if (is_interface)
3613 {
3614 if (CPC_INNER_P ())
3615 uaaf = INTERFACE_INNER_MODIFIERS;
3616 else
3617 uaaf = INTERFACE_MODIFIERS;
3618
3619 check_modifiers ("Illegal modifier %qs for interface declaration",
3620 flags, uaaf);
3621 }
3622 else
3623 check_modifiers ((current_function_decl ?
3624 "Illegal modifier %qs for local class declaration" :
3625 "Illegal modifier %qs for class declaration"),
3626 flags, uaaf|sca|icaf);
3627 return 0;
3628 }
3629
3630 /* Construct a nested class name. If the final component starts with
3631 a digit, return true. Otherwise return false. */
3632 static int
3633 make_nested_class_name (tree cpc_list)
3634 {
3635 tree name;
3636
3637 if (!cpc_list)
3638 return 0;
3639
3640 make_nested_class_name (TREE_CHAIN (cpc_list));
3641
3642 /* Pick the qualified name when dealing with the first upmost
3643 enclosing class */
3644 name = (TREE_CHAIN (cpc_list)
3645 ? TREE_PURPOSE (cpc_list) : DECL_NAME (TREE_VALUE (cpc_list)));
3646 obstack_grow (&temporary_obstack,
3647 IDENTIFIER_POINTER (name), IDENTIFIER_LENGTH (name));
3648 obstack_1grow (&temporary_obstack, '$');
3649
3650 return ISDIGIT (IDENTIFIER_POINTER (name)[0]);
3651 }
3652
3653 /* Can't redefine a class already defined in an earlier scope. */
3654
3655 static int
3656 check_inner_class_redefinition (tree raw_name, tree cl)
3657 {
3658 tree scope_list;
3659
3660 for (scope_list = GET_CPC_LIST (); scope_list;
3661 scope_list = GET_NEXT_ENCLOSING_CPC (scope_list))
3662 if (raw_name == GET_CPC_UN_NODE (scope_list))
3663 {
3664 parse_error_context
3665 (cl, "The class name %qs is already defined in this scope. An inner class may not have the same simple name as any of its enclosing classes",
3666 IDENTIFIER_POINTER (raw_name));
3667 return 1;
3668 }
3669 return 0;
3670 }
3671
3672 /* Tries to find a decl for CLASS_TYPE within ENCLOSING. May return an
3673 invisible/non-accessible matching decl when an accessible one could not be
3674 found, in order to give a better error message when accessibility is
3675 checked later. */
3676
3677 static tree
3678 resolve_inner_class (tree context, tree cl, tree enclosing, tree class_type)
3679 {
3680 tree local_super = NULL_TREE;
3681 tree candidate = NULL_TREE;
3682
3683 /* This hash table is used to register the classes we're going
3684 through when searching the current class as an inner class, in
3685 order to detect circular references. */
3686 htab_t circularity_hash = htab_create (20, htab_hash_pointer, htab_eq_pointer,
3687 NULL);
3688
3689 while (enclosing)
3690 {
3691 tree decl;
3692
3693 *htab_find_slot (circularity_hash, enclosing, INSERT) = enclosing;
3694
3695 if ((decl = find_as_inner_class (enclosing, class_type, cl)))
3696 {
3697 if (inner_class_accessible (decl, context))
3698 {
3699 candidate = decl;
3700 break;
3701 }
3702 else
3703 if (candidate == NULL_TREE)
3704 candidate = decl;
3705 }
3706
3707 /* Now go to the upper classes, bail out if necessary. We will
3708 analyze the returned SUPER and act accordingly (see
3709 do_resolve_class). */
3710 if (JPRIMITIVE_TYPE_P (TREE_TYPE (enclosing))
3711 || TREE_TYPE (enclosing) == void_type_node)
3712 {
3713 parse_error_context (cl, "Qualifier must be a reference");
3714 enclosing = NULL_TREE;
3715 break;
3716 }
3717 local_super = CLASSTYPE_SUPER (TREE_TYPE (enclosing));
3718 if (!local_super || local_super == object_type_node)
3719 break;
3720
3721 if (TREE_CODE (local_super) == POINTER_TYPE)
3722 local_super = do_resolve_class (NULL, NULL, local_super, NULL, NULL);
3723 else
3724 local_super = TYPE_NAME (local_super);
3725
3726 /* We may not have checked for circular inheritance yet, so do so
3727 here to prevent an infinite loop. */
3728 if (htab_find (circularity_hash, local_super) != NULL)
3729 {
3730 if (!cl)
3731 cl = lookup_cl (enclosing);
3732
3733 parse_error_context
3734 (cl, "Cyclic inheritance involving %s",
3735 IDENTIFIER_POINTER (DECL_NAME (enclosing)));
3736 enclosing = NULL_TREE;
3737 }
3738 else
3739 enclosing = local_super;
3740 }
3741
3742 htab_delete (circularity_hash);
3743
3744 /* We failed, but we might have found a matching class that wasn't
3745 accessible. Return that to get a better error message. */
3746 return candidate;
3747 }
3748
3749 /* Within ENCLOSING, find a decl for NAME and return it. NAME can be
3750 qualified. */
3751
3752 static tree
3753 find_as_inner_class (tree enclosing, tree name, tree cl)
3754 {
3755 tree qual, to_return;
3756 if (!enclosing)
3757 return NULL_TREE;
3758
3759 name = TYPE_NAME (name);
3760
3761 /* First search: within the scope of `enclosing', search for name */
3762 if (QUALIFIED_P (name) && cl && EXPR_WFL_NODE (cl) == name)
3763 qual = EXPR_WFL_QUALIFICATION (cl);
3764 else if (cl)
3765 qual = build_tree_list (cl, NULL_TREE);
3766 else
3767 qual = build_tree_list (build_unknown_wfl (name), NULL_TREE);
3768
3769 if ((to_return = find_as_inner_class_do (qual, enclosing)))
3770 return to_return;
3771
3772 /* We're dealing with a qualified name. Try to resolve thing until
3773 we get something that is an enclosing class. */
3774 if (QUALIFIED_P (name) && cl && EXPR_WFL_NODE (cl) == name)
3775 {
3776 tree acc = NULL_TREE, decl = NULL_TREE, ptr;
3777
3778 for (qual = EXPR_WFL_QUALIFICATION (cl); qual && !decl;
3779 qual = TREE_CHAIN (qual))
3780 {
3781 acc = merge_qualified_name (acc,
3782 EXPR_WFL_NODE (TREE_PURPOSE (qual)));
3783 BUILD_PTR_FROM_NAME (ptr, acc);
3784 decl = do_resolve_class (NULL_TREE, NULL_TREE, ptr, NULL_TREE, cl);
3785 }
3786
3787 /* A NULL qual and a decl means that the search ended
3788 successfully?!? We have to do something then. FIXME */
3789
3790 if (decl)
3791 enclosing = decl;
3792 else
3793 qual = EXPR_WFL_QUALIFICATION (cl);
3794 }
3795 /* Otherwise, create a qual for the other part of the resolution. */
3796 else
3797 qual = build_tree_list (build_unknown_wfl (name), NULL_TREE);
3798
3799 return find_as_inner_class_do (qual, enclosing);
3800 }
3801
3802 /* We go inside the list of sub classes and try to find a way
3803 through. */
3804
3805 static tree
3806 find_as_inner_class_do (tree qual, tree enclosing)
3807 {
3808 if (!qual)
3809 return NULL_TREE;
3810
3811 for (; qual && enclosing; qual = TREE_CHAIN (qual))
3812 {
3813 tree name_to_match = EXPR_WFL_NODE (TREE_PURPOSE (qual));
3814 tree next_enclosing = NULL_TREE;
3815 tree inner_list;
3816
3817 for (inner_list = DECL_INNER_CLASS_LIST (enclosing);
3818 inner_list; inner_list = TREE_CHAIN (inner_list))
3819 {
3820 if (TREE_VALUE (inner_list) == name_to_match)
3821 {
3822 next_enclosing = TREE_PURPOSE (inner_list);
3823 break;
3824 }
3825 }
3826 enclosing = next_enclosing;
3827 }
3828
3829 return (!qual && enclosing ? enclosing : NULL_TREE);
3830 }
3831
3832 static void
3833 link_nested_class_to_enclosing (void)
3834 {
3835 if (GET_ENCLOSING_CPC ())
3836 {
3837 tree enclosing = GET_ENCLOSING_CPC_CONTEXT ();
3838 DECL_INNER_CLASS_LIST (enclosing) =
3839 tree_cons (GET_CPC (), GET_CPC_UN (),
3840 DECL_INNER_CLASS_LIST (enclosing));
3841 }
3842 }
3843
3844 static tree
3845 maybe_make_nested_class_name (tree name)
3846 {
3847 tree id = NULL_TREE;
3848
3849 if (CPC_INNER_P ())
3850 {
3851 /* If we're in a function, we must append a number to create the
3852 nested class name. However, we don't do this if the class we
3853 are constructing is anonymous, because in that case we'll
3854 already have a number as the class name. */
3855 if (! make_nested_class_name (GET_CPC_LIST ())
3856 && current_function_decl != NULL_TREE
3857 && ! ISDIGIT (IDENTIFIER_POINTER (name)[0]))
3858 {
3859 char buf[10];
3860 sprintf (buf, "%d", anonymous_class_counter);
3861 ++anonymous_class_counter;
3862 obstack_grow (&temporary_obstack, buf, strlen (buf));
3863 obstack_1grow (&temporary_obstack, '$');
3864 }
3865 obstack_grow0 (&temporary_obstack,
3866 IDENTIFIER_POINTER (name),
3867 IDENTIFIER_LENGTH (name));
3868 id = get_identifier (obstack_finish (&temporary_obstack));
3869 if (ctxp->package)
3870 QUALIFIED_P (id) = 1;
3871 }
3872 return id;
3873 }
3874
3875 /* If DECL is NULL, create and push a new DECL, record the current
3876 line CL and do other maintenance things. */
3877
3878 static tree
3879 maybe_create_class_interface_decl (tree decl, tree raw_name,
3880 tree qualified_name, tree cl)
3881 {
3882 if (!decl)
3883 decl = push_class (make_class (), qualified_name);
3884
3885 /* Take care of the file and line business */
3886 #ifdef USE_MAPPED_LOCATION
3887 DECL_SOURCE_LOCATION (decl) = EXPR_LOCATION (cl);
3888 #else
3889 DECL_SOURCE_FILE (decl) = EXPR_WFL_FILENAME (cl);
3890 DECL_SOURCE_LINE (decl) = EXPR_WFL_LINENO (cl);
3891 #endif
3892 CLASS_FROM_SOURCE_P (TREE_TYPE (decl)) = 1;
3893 CLASS_PARSED_P (TREE_TYPE (decl)) = 1;
3894 #ifdef USE_MAPPED_LOCATION
3895 {
3896 tree tmp = maybe_get_identifier (EXPR_FILENAME (cl));
3897 CLASS_FROM_CURRENTLY_COMPILED_P (TREE_TYPE (decl)) =
3898 tmp && IS_A_COMMAND_LINE_FILENAME_P (tmp);
3899 }
3900 #else
3901 CLASS_FROM_CURRENTLY_COMPILED_P (TREE_TYPE (decl)) =
3902 IS_A_COMMAND_LINE_FILENAME_P (EXPR_WFL_FILENAME_NODE (cl));
3903 #endif
3904
3905 PUSH_CPC (decl, raw_name);
3906 DECL_CONTEXT (decl) = GET_ENCLOSING_CPC_CONTEXT ();
3907
3908 /* Link the declaration to the already seen ones */
3909 TREE_CHAIN (decl) = ctxp->class_list;
3910 ctxp->class_list = decl;
3911
3912 /* Create a new nodes in the global lists */
3913 gclass_list = tree_cons (NULL_TREE, decl, gclass_list);
3914 all_class_list = tree_cons (NULL_TREE, decl, all_class_list);
3915
3916 /* Install a new dependency list element */
3917 create_jdep_list (ctxp);
3918
3919 /* We keep the compilation unit imports in the class so that
3920 they can be used later to resolve type dependencies that
3921 aren't necessary to solve now. */
3922 TYPE_IMPORT_LIST (TREE_TYPE (decl)) = ctxp->import_list;
3923 TYPE_IMPORT_DEMAND_LIST (TREE_TYPE (decl)) = ctxp->import_demand_list;
3924
3925 TYPE_PACKAGE (TREE_TYPE (decl)) = ctxp->package;
3926
3927 SOURCE_FRONTEND_DEBUG (("Defining class/interface %s",
3928 IDENTIFIER_POINTER (qualified_name)));
3929 return decl;
3930 }
3931
3932 static void
3933 add_superinterfaces (tree decl, tree interface_list)
3934 {
3935 tree node;
3936 /* Superinterface(s): if present and defined, parser_check_super_interface ()
3937 takes care of ensuring that:
3938 - This is an accessible interface type,
3939 - Circularity detection.
3940 parser_add_interface is then called. If present but not defined,
3941 the check operation is delayed until the super interface gets
3942 defined. */
3943 for (node = interface_list; node; node = TREE_CHAIN (node))
3944 {
3945 tree current = TREE_PURPOSE (node);
3946 tree idecl = IDENTIFIER_CLASS_VALUE (EXPR_WFL_NODE (current));
3947 if (idecl && CLASS_LOADED_P (TREE_TYPE (idecl)))
3948 {
3949 if (!parser_check_super_interface (idecl, decl, current))
3950 parser_add_interface (decl, idecl, current);
3951 }
3952 else
3953 register_incomplete_type (JDEP_INTERFACE,
3954 current, decl, NULL_TREE);
3955 }
3956 }
3957
3958 /* Create an interface in pass1 and return its decl. Return the
3959 interface's decl in pass 2. */
3960
3961 static tree
3962 create_interface (int flags, tree id, tree super)
3963 {
3964 tree raw_name = EXPR_WFL_NODE (id);
3965 tree q_name = parser_qualified_classname (raw_name);
3966 tree decl = IDENTIFIER_CLASS_VALUE (q_name);
3967
3968 /* Certain syntax errors are making SUPER be like ID. Avoid this
3969 case. */
3970 if (ctxp->class_err && id == super)
3971 super = NULL;
3972
3973 EXPR_WFL_NODE (id) = q_name; /* Keep source location, even if refined. */
3974
3975 /* Basic checks: scope, redefinition, modifiers */
3976 if (check_class_interface_creation (1, flags, raw_name, q_name, decl, id))
3977 {
3978 PUSH_ERROR ();
3979 return NULL_TREE;
3980 }
3981
3982 /* Suspend the current parsing context if we're parsing an inner
3983 interface */
3984 if (CPC_INNER_P ())
3985 {
3986 java_parser_context_suspend ();
3987 /* Interface members are public. */
3988 if (CLASS_INTERFACE (GET_CPC ()))
3989 flags |= ACC_PUBLIC;
3990 }
3991
3992 /* Push a new context for (static) initialized upon declaration fields */
3993 java_parser_context_push_initialized_field ();
3994
3995 /* Interface modifiers check
3996 - public/abstract allowed (already done at that point)
3997 - abstract is obsolete (comes first, it's a warning, or should be)
3998 - Can't use twice the same (checked in the modifier rule) */
3999 if ((flags & ACC_ABSTRACT) && flag_redundant)
4000 parse_warning_context
4001 (MODIFIER_WFL (ABSTRACT_TK),
4002 "Redundant use of %<abstract%> modifier. Interface %qs is implicitly abstract", IDENTIFIER_POINTER (raw_name));
4003
4004 /* Create a new decl if DECL is NULL, otherwise fix it */
4005 decl = maybe_create_class_interface_decl (decl, raw_name, q_name, id);
4006
4007 /* Interfaces are always abstract. */
4008 flags |= ACC_ABSTRACT;
4009
4010 /* Inner interfaces are always static. */
4011 if (INNER_CLASS_DECL_P (decl))
4012 flags |= ACC_STATIC;
4013
4014 /* Set super info and mark the class a complete */
4015 set_super_info (ACC_INTERFACE | flags, TREE_TYPE (decl),
4016 object_type_node, ctxp->interface_number);
4017 ctxp->interface_number = 0;
4018 CLASS_COMPLETE_P (decl) = 1;
4019 add_superinterfaces (decl, super);
4020
4021 /* Eventually sets the @deprecated tag flag */
4022 CHECK_DEPRECATED (decl);
4023
4024 return decl;
4025 }
4026
4027 /* Patch anonymous class CLASS, by either extending or implementing
4028 DEP. */
4029
4030 static void
4031 patch_anonymous_class (tree type_decl, tree class_decl, tree wfl)
4032 {
4033 tree class = TREE_TYPE (class_decl);
4034 tree type = TREE_TYPE (type_decl);
4035 tree binfo = TYPE_BINFO (class);
4036
4037 /* If it's an interface, implement it */
4038 if (CLASS_INTERFACE (type_decl))
4039 {
4040 if (parser_check_super_interface (type_decl, class_decl, wfl))
4041 return;
4042
4043 if (!VEC_space (tree, BINFO_BASE_BINFOS (binfo), 1))
4044 {
4045 /* Extend the binfo - by reallocating and copying it. */
4046 tree new_binfo;
4047 tree base_binfo;
4048 int i;
4049
4050 new_binfo = make_tree_binfo ((BINFO_N_BASE_BINFOS (binfo) + 1) * 2);
4051 for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
4052 BINFO_BASE_APPEND (new_binfo, base_binfo);
4053 CLASS_HAS_SUPER_FLAG (new_binfo) = CLASS_HAS_SUPER_FLAG (binfo);
4054 BINFO_VTABLE (new_binfo) = BINFO_VTABLE (binfo);
4055 TYPE_BINFO (class) = new_binfo;
4056 }
4057
4058 /* And add the interface */
4059 parser_add_interface (class_decl, type_decl, wfl);
4060 }
4061 /* Otherwise, it's a type we want to extend */
4062 else
4063 {
4064 if (parser_check_super (type_decl, class_decl, wfl))
4065 return;
4066 BINFO_TYPE (BINFO_BASE_BINFO (binfo, 0)) = type;
4067 }
4068 }
4069
4070 /* Create an anonymous class which extends/implements TYPE_NAME, and return
4071 its decl. */
4072
4073 static tree
4074 create_anonymous_class (tree type_name)
4075 {
4076 char buffer [80];
4077 tree super = NULL_TREE, itf = NULL_TREE;
4078 tree id, type_decl, class;
4079
4080 /* The unqualified name of the anonymous class. It's just a number. */
4081 sprintf (buffer, "%d", anonymous_class_counter++);
4082 id = build_wfl_node (get_identifier (buffer));
4083 EXPR_WFL_LINECOL (id) = EXPR_WFL_LINECOL (type_name);
4084
4085 /* We know about the type to extend/implement. We go ahead */
4086 if ((type_decl = IDENTIFIER_CLASS_VALUE (EXPR_WFL_NODE (type_name))))
4087 {
4088 /* Create a class which either implements on extends the designated
4089 class. The class bears an inaccessible name. */
4090 if (CLASS_INTERFACE (type_decl))
4091 {
4092 /* It's OK to modify it here. It's been already used and
4093 shouldn't be reused */
4094 ctxp->interface_number = 1;
4095 /* Interfaces should presented as a list of WFLs */
4096 itf = build_tree_list (type_name, NULL_TREE);
4097 }
4098 else
4099 super = type_name;
4100 }
4101
4102 class = create_class (ACC_FINAL, id, super, itf);
4103
4104 /* We didn't know anything about the stuff. We register a dependence. */
4105 if (!type_decl)
4106 register_incomplete_type (JDEP_ANONYMOUS, type_name, class, NULL_TREE);
4107
4108 ANONYMOUS_CLASS_P (TREE_TYPE (class)) = 1;
4109 return class;
4110 }
4111
4112 /* Create a class in pass1 and return its decl. Return class
4113 interface's decl in pass 2. */
4114
4115 static tree
4116 create_class (int flags, tree id, tree super, tree interfaces)
4117 {
4118 tree raw_name = EXPR_WFL_NODE (id);
4119 tree class_id, decl;
4120 tree super_decl_type;
4121
4122 /* Certain syntax errors are making SUPER be like ID. Avoid this
4123 case. */
4124 if (ctxp->class_err && id == super)
4125 super = NULL;
4126
4127 class_id = parser_qualified_classname (raw_name);
4128 decl = IDENTIFIER_CLASS_VALUE (class_id);
4129 EXPR_WFL_NODE (id) = class_id;
4130
4131 /* Basic check: scope, redefinition, modifiers */
4132 if (check_class_interface_creation (0, flags, raw_name, class_id, decl, id))
4133 {
4134 PUSH_ERROR ();
4135 return NULL_TREE;
4136 }
4137
4138 /* Suspend the current parsing context if we're parsing an inner
4139 class or an anonymous class. */
4140 if (CPC_INNER_P ())
4141 {
4142 java_parser_context_suspend ();
4143 /* Interface members are public. */
4144 if (CLASS_INTERFACE (GET_CPC ()))
4145 flags |= ACC_PUBLIC;
4146 }
4147
4148 /* Push a new context for (static) initialized upon declaration fields */
4149 java_parser_context_push_initialized_field ();
4150
4151 /* Class modifier check:
4152 - Allowed modifier (already done at that point)
4153 - abstract AND final forbidden
4154 - Public classes defined in the correct file */
4155 if ((flags & ACC_ABSTRACT) && (flags & ACC_FINAL))
4156 parse_error_context
4157 (id, "Class %qs can't be declared both abstract and final",
4158 IDENTIFIER_POINTER (raw_name));
4159
4160 /* Create a new decl if DECL is NULL, otherwise fix it */
4161 decl = maybe_create_class_interface_decl (decl, raw_name, class_id, id);
4162
4163 /* If SUPER exists, use it, otherwise use Object */
4164 if (super)
4165 {
4166 /* java.lang.Object can't extend anything. */
4167 if (TREE_TYPE (IDENTIFIER_CLASS_VALUE (class_id)) == object_type_node)
4168 {
4169 parse_error_context (id, "%<java.lang.Object%> can't extend anything");
4170 return NULL_TREE;
4171 }
4172
4173 super_decl_type =
4174 register_incomplete_type (JDEP_SUPER, super, decl, NULL_TREE);
4175 }
4176 else if (TREE_TYPE (decl) != object_type_node)
4177 super_decl_type = object_type_node;
4178 /* We're defining java.lang.Object */
4179 else
4180 super_decl_type = NULL_TREE;
4181
4182 /* A class nested in an interface is implicitly static. */
4183 if (INNER_CLASS_DECL_P (decl)
4184 && CLASS_INTERFACE (TYPE_NAME (TREE_TYPE (DECL_CONTEXT (decl)))))
4185 {
4186 flags |= ACC_STATIC;
4187 }
4188
4189 /* Set super info and mark the class as complete. */
4190 set_super_info (flags, TREE_TYPE (decl), super_decl_type,
4191 ctxp->interface_number);
4192 ctxp->interface_number = 0;
4193 CLASS_COMPLETE_P (decl) = 1;
4194 add_superinterfaces (decl, interfaces);
4195
4196 /* TYPE_VFIELD' is a compiler-generated field used to point to
4197 virtual function tables. In gcj, every class has a common base
4198 virtual function table in java.lang.object. */
4199 TYPE_VFIELD (TREE_TYPE (decl)) = TYPE_VFIELD (object_type_node);
4200
4201 /* Add the private this$<n> field, Replicate final locals still in
4202 scope as private final fields mangled like val$<local_name>.
4203 This does not occur for top level (static) inner classes. */
4204 if (PURE_INNER_CLASS_DECL_P (decl))
4205 add_inner_class_fields (decl, current_function_decl);
4206
4207 /* Eventually sets the @deprecated tag flag */
4208 CHECK_DEPRECATED (decl);
4209
4210 /* Reset the anonymous class counter when declaring non inner classes */
4211 if (!INNER_CLASS_DECL_P (decl))
4212 anonymous_class_counter = 1;
4213
4214 return decl;
4215 }
4216
4217 /* End a class declaration: register the statements used to create
4218 finit$ and <clinit>, pop the current class and resume the prior
4219 parser context if necessary. */
4220
4221 static void
4222 end_class_declaration (int resume)
4223 {
4224 /* If an error occurred, context weren't pushed and won't need to be
4225 popped by a resume. */
4226 int no_error_occurred = ctxp->next && GET_CPC () != error_mark_node;
4227
4228 if (GET_CPC () != error_mark_node)
4229 dump_java_tree (TDI_class, GET_CPC ());
4230
4231 java_parser_context_pop_initialized_field ();
4232 POP_CPC ();
4233 if (resume && no_error_occurred)
4234 java_parser_context_resume ();
4235
4236 /* We're ending a class declaration, this is a good time to reset
4237 the interface cout. Note that might have been already done in
4238 create_interface, but if at that time an inner class was being
4239 dealt with, the interface count was reset in a context created
4240 for the sake of handling inner classes declaration. */
4241 ctxp->interface_number = 0;
4242 }
4243
4244 static void
4245 add_inner_class_fields (tree class_decl, tree fct_decl)
4246 {
4247 tree block, marker, f;
4248
4249 f = add_field (TREE_TYPE (class_decl),
4250 build_current_thisn (TREE_TYPE (class_decl)),
4251 build_pointer_type (TREE_TYPE (DECL_CONTEXT (class_decl))),
4252 ACC_PRIVATE);
4253 FIELD_THISN (f) = 1;
4254
4255 if (!fct_decl)
4256 return;
4257
4258 for (block = GET_CURRENT_BLOCK (fct_decl);
4259 block && TREE_CODE (block) == BLOCK; block = BLOCK_SUPERCONTEXT (block))
4260 {
4261 tree decl;
4262 for (decl = BLOCK_EXPR_DECLS (block); decl; decl = TREE_CHAIN (decl))
4263 {
4264 tree name, pname;
4265 tree wfl, init, list;
4266
4267 /* Avoid non final arguments. */
4268 if (!LOCAL_FINAL_P (decl))
4269 continue;
4270
4271 MANGLE_OUTER_LOCAL_VARIABLE_NAME (name, DECL_NAME (decl));
4272 MANGLE_ALIAS_INITIALIZER_PARAMETER_NAME_ID (pname, DECL_NAME (decl));
4273 wfl = build_wfl_node (name);
4274 init = build_wfl_node (pname);
4275 /* Build an initialization for the field: it will be
4276 initialized by a parameter added to finit$, bearing a
4277 mangled name of the field itself (param$<n>.) The
4278 parameter is provided to finit$ by the constructor
4279 invoking it (hence the constructor will also feature a
4280 hidden parameter, set to the value of the outer context
4281 local at the time the inner class is created.)
4282
4283 Note: we take into account all possible locals that can
4284 be accessed by the inner class. It's actually not trivial
4285 to minimize these aliases down to the ones really
4286 used. One way to do that would be to expand all regular
4287 methods first, then finit$ to get a picture of what's
4288 used. It works with the exception that we would have to
4289 go back on all constructor invoked in regular methods to
4290 have their invocation reworked (to include the right amount
4291 of alias initializer parameters.)
4292
4293 The only real way around, I think, is a first pass to
4294 identify locals really used in the inner class. We leave
4295 the flag FIELD_LOCAL_ALIAS_USED around for that future
4296 use.
4297
4298 On the other hand, it only affect local inner classes,
4299 whose constructors (and finit$ call) will be featuring
4300 unnecessary arguments. It's easy for a developer to keep
4301 this number of parameter down by using the `final'
4302 keyword only when necessary. For the time being, we can
4303 issue a warning on unnecessary finals. FIXME */
4304 init = build_assignment (ASSIGN_TK, EXPR_WFL_LINECOL (wfl),
4305 wfl, init);
4306
4307 /* Register the field. The TREE_LIST holding the part
4308 initialized/initializer will be marked ARG_FINAL_P so
4309 that the created field can be marked
4310 FIELD_LOCAL_ALIAS. */
4311 list = build_tree_list (wfl, init);
4312 ARG_FINAL_P (list) = 1;
4313 register_fields (ACC_PRIVATE | ACC_FINAL, TREE_TYPE (decl), list);
4314 }
4315 }
4316
4317 if (!CPC_INITIALIZER_STMT (ctxp))
4318 return;
4319
4320 /* If we ever registered an alias field, insert and marker to
4321 remember where the list ends. The second part of the list (the one
4322 featuring initialized fields) so it can be later reversed to
4323 enforce 8.5. The marker will be removed during that operation. */
4324 marker = build_tree_list (NULL_TREE, NULL_TREE);
4325 TREE_CHAIN (marker) = CPC_INITIALIZER_STMT (ctxp);
4326 SET_CPC_INITIALIZER_STMT (ctxp, marker);
4327 }
4328
4329 /* Can't use lookup_field () since we don't want to load the class and
4330 can't set the CLASS_LOADED_P flag */
4331
4332 static tree
4333 find_field (tree class, tree name)
4334 {
4335 tree decl;
4336 for (decl = TYPE_FIELDS (class); decl; decl = TREE_CHAIN (decl))
4337 {
4338 if (DECL_NAME (decl) == name)
4339 return decl;
4340 }
4341 return NULL_TREE;
4342 }
4343
4344 /* Wrap around lookup_field that doesn't potentially upset the value
4345 of CLASS */
4346
4347 static tree
4348 lookup_field_wrapper (tree class, tree name)
4349 {
4350 tree type = class;
4351 tree decl = NULL_TREE;
4352 java_parser_context_save_global ();
4353
4354 /* Last chance: if we're within the context of an inner class, we
4355 might be trying to access a local variable defined in an outer
4356 context. We try to look for it now. */
4357 if (INNER_CLASS_TYPE_P (class) && TREE_CODE (name) == IDENTIFIER_NODE)
4358 {
4359 tree new_name;
4360 MANGLE_OUTER_LOCAL_VARIABLE_NAME (new_name, name);
4361 decl = lookup_field (&type, new_name);
4362 if (decl && decl != error_mark_node)
4363 FIELD_LOCAL_ALIAS_USED (decl) = 1;
4364 }
4365 if (!decl || decl == error_mark_node)
4366 {
4367 type = class;
4368 decl = lookup_field (&type, name);
4369 }
4370
4371 /* If the field still hasn't been found, try the next enclosing context. */
4372 if (!decl && INNER_CLASS_TYPE_P (class))
4373 {
4374 tree outer_type = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (class)));
4375 decl = lookup_field_wrapper (outer_type, name);
4376 }
4377
4378 java_parser_context_restore_global ();
4379 return decl == error_mark_node ? NULL : decl;
4380 }
4381
4382 /* Find duplicate field within the same class declarations and report
4383 the error. Returns 1 if a duplicated field was found, 0
4384 otherwise. */
4385
4386 static int
4387 duplicate_declaration_error_p (tree new_field_name, tree new_type, tree cl)
4388 {
4389 /* This might be modified to work with method decl as well */
4390 tree decl = find_field (TREE_TYPE (GET_CPC ()), new_field_name);
4391 if (decl)
4392 {
4393 char *t1 = xstrdup (purify_type_name
4394 ((TREE_CODE (new_type) == POINTER_TYPE
4395 && TREE_TYPE (new_type) == NULL_TREE) ?
4396 IDENTIFIER_POINTER (TYPE_NAME (new_type)) :
4397 lang_printable_name (new_type, 1)));
4398 /* The type may not have been completed by the time we report
4399 the error */
4400 char *t2 = xstrdup (purify_type_name
4401 ((TREE_CODE (TREE_TYPE (decl)) == POINTER_TYPE
4402 && TREE_TYPE (TREE_TYPE (decl)) == NULL_TREE) ?
4403 IDENTIFIER_POINTER (TYPE_NAME (TREE_TYPE (decl))) :
4404 lang_printable_name (TREE_TYPE (decl), 1)));
4405 parse_error_context
4406 (cl, "Duplicate variable declaration: %<%s %s%> was %<%s %s%> (%s:%d)",
4407 t1, IDENTIFIER_POINTER (new_field_name),
4408 t2, IDENTIFIER_POINTER (DECL_NAME (decl)),
4409 DECL_SOURCE_FILE (decl), DECL_SOURCE_LINE (decl));
4410 free (t1);
4411 free (t2);
4412 return 1;
4413 }
4414 return 0;
4415 }
4416
4417 /* Field registration routine. If TYPE doesn't exist, field
4418 declarations are linked to the undefined TYPE dependency list, to
4419 be later resolved in java_complete_class () */
4420
4421 static void
4422 register_fields (int flags, tree type, tree variable_list)
4423 {
4424 tree current, saved_type;
4425 tree class_type = NULL_TREE;
4426 location_t saved_location = input_location;
4427 int must_chain = 0;
4428 tree wfl = NULL_TREE;
4429
4430 if (GET_CPC ())
4431 class_type = TREE_TYPE (GET_CPC ());
4432
4433 if (!class_type || class_type == error_mark_node)
4434 return;
4435
4436 /* If we're adding fields to interfaces, those fields are public,
4437 static, final */
4438 if (CLASS_INTERFACE (TYPE_NAME (class_type)))
4439 {
4440 OBSOLETE_MODIFIER_WARNING (MODIFIER_WFL (PUBLIC_TK),
4441 flags, ACC_PUBLIC, "interface field(s)");
4442 OBSOLETE_MODIFIER_WARNING (MODIFIER_WFL (STATIC_TK),
4443 flags, ACC_STATIC, "interface field(s)");
4444 OBSOLETE_MODIFIER_WARNING (MODIFIER_WFL (FINAL_TK),
4445 flags, ACC_FINAL, "interface field(s)");
4446 check_modifiers ("Illegal interface member modifier %qs", flags,
4447 INTERFACE_FIELD_MODIFIERS);
4448 flags |= (ACC_PUBLIC | ACC_STATIC | ACC_FINAL);
4449 }
4450
4451 /* Obtain a suitable type for resolution, if necessary */
4452 SET_TYPE_FOR_RESOLUTION (type, wfl, must_chain);
4453
4454 /* If TYPE is fully resolved and we don't have a reference, make one */
4455 PROMOTE_RECORD_IF_COMPLETE (type, must_chain);
4456
4457 for (current = variable_list, saved_type = type; current;
4458 current = TREE_CHAIN (current), type = saved_type)
4459 {
4460 tree real_type;
4461 tree field_decl;
4462 tree cl = TREE_PURPOSE (current);
4463 tree init = TREE_VALUE (current);
4464 tree current_name = EXPR_WFL_NODE (cl);
4465
4466 /* Can't declare non-final static fields in inner classes */
4467 if ((flags & ACC_STATIC) && !TOPLEVEL_CLASS_TYPE_P (class_type)
4468 && !(flags & ACC_FINAL))
4469 parse_error_context
4470 (cl, "Field %qs can't be static in inner class %qs unless it is final",
4471 IDENTIFIER_POINTER (EXPR_WFL_NODE (cl)),
4472 lang_printable_name (class_type, 0));
4473
4474 /* Process NAME, as it may specify extra dimension(s) for it */
4475 type = build_array_from_name (type, wfl, current_name, &current_name);
4476
4477 /* Type adjustment. We may have just readjusted TYPE because
4478 the variable specified more dimensions. Make sure we have
4479 a reference if we can and don't have one already. Also
4480 change the name if we have an init. */
4481 if (type != saved_type)
4482 {
4483 PROMOTE_RECORD_IF_COMPLETE (type, must_chain);
4484 if (init)
4485 EXPR_WFL_NODE (TREE_OPERAND (init, 0)) = current_name;
4486 }
4487
4488 real_type = GET_REAL_TYPE (type);
4489 /* Check for redeclarations */
4490 if (duplicate_declaration_error_p (current_name, real_type, cl))
4491 continue;
4492
4493 /* Set input_line to the line the field was found and create a
4494 declaration for it. Eventually sets the @deprecated tag flag. */
4495 #ifdef USE_MAPPED_LOCATION
4496 input_location = EXPR_LOCATION (cl);
4497 #else
4498 input_line = EXPR_WFL_LINENO (cl);
4499 #endif
4500 field_decl = add_field (class_type, current_name, real_type, flags);
4501 CHECK_DEPRECATED_NO_RESET (field_decl);
4502
4503 /* If the field denotes a final instance variable, then we
4504 allocate a LANG_DECL_SPECIFIC part to keep track of its
4505 initialization. We also mark whether the field was
4506 initialized upon its declaration. We don't do that if the
4507 created field is an alias to a final local. */
4508 if (!ARG_FINAL_P (current) && (flags & ACC_FINAL))
4509 {
4510 MAYBE_CREATE_VAR_LANG_DECL_SPECIFIC (field_decl);
4511 DECL_FIELD_FINAL_WFL (field_decl) = cl;
4512 }
4513
4514 /* If the couple initializer/initialized is marked ARG_FINAL_P,
4515 we mark the created field FIELD_LOCAL_ALIAS, so that we can
4516 hide parameters to this inner class finit$ and
4517 constructors. It also means that the field isn't final per
4518 say. */
4519 if (ARG_FINAL_P (current))
4520 {
4521 FIELD_LOCAL_ALIAS (field_decl) = 1;
4522 FIELD_FINAL (field_decl) = 0;
4523 }
4524
4525 /* Check if we must chain. */
4526 if (must_chain)
4527 register_incomplete_type (JDEP_FIELD, wfl, field_decl, type);
4528
4529 /* If we have an initialization value tied to the field */
4530 if (init)
4531 {
4532 /* The field is declared static */
4533 if (flags & ACC_STATIC)
4534 {
4535 /* We include the field and its initialization part into
4536 a list used to generate <clinit>. After <clinit> is
4537 walked, field initializations will be processed and
4538 fields initialized with known constants will be taken
4539 out of <clinit> and have their DECL_INITIAL set
4540 appropriately. */
4541 TREE_CHAIN (init) = CPC_STATIC_INITIALIZER_STMT (ctxp);
4542 SET_CPC_STATIC_INITIALIZER_STMT (ctxp, init);
4543 if (TREE_OPERAND (init, 1)
4544 && TREE_CODE (TREE_OPERAND (init, 1)) == NEW_ARRAY_INIT)
4545 TREE_STATIC (TREE_OPERAND (init, 1)) = 1;
4546 }
4547 /* A non-static field declared with an immediate initialization is
4548 to be initialized in <init>, if any. This field is remembered
4549 to be processed at the time of the generation of <init>. */
4550 else
4551 {
4552 TREE_CHAIN (init) = CPC_INITIALIZER_STMT (ctxp);
4553 SET_CPC_INITIALIZER_STMT (ctxp, init);
4554 }
4555 MODIFY_EXPR_FROM_INITIALIZATION_P (init) = 1;
4556 DECL_INITIAL (field_decl) = TREE_OPERAND (init, 1);
4557 }
4558 }
4559
4560 CLEAR_DEPRECATED;
4561 input_location = saved_location;
4562 }
4563
4564 /* Generate finit$, using the list of initialized fields to populate
4565 its body. finit$'s parameter(s) list is adjusted to include the
4566 one(s) used to initialized the field(s) caching outer context
4567 local(s). */
4568
4569 static tree
4570 generate_finit (tree class_type)
4571 {
4572 int count = 0;
4573 tree list = TYPE_FINIT_STMT_LIST (class_type);
4574 tree mdecl, current, parms;
4575
4576 parms = build_alias_initializer_parameter_list (AIPL_FUNCTION_CREATION,
4577 class_type, NULL_TREE,
4578 &count);
4579 CRAFTED_PARAM_LIST_FIXUP (parms);
4580 mdecl = create_artificial_method (class_type, ACC_PRIVATE, void_type_node,
4581 finit_identifier_node, parms);
4582 fix_method_argument_names (parms, mdecl);
4583 layout_class_method (class_type, CLASSTYPE_SUPER (class_type),
4584 mdecl, NULL_TREE);
4585 DECL_FUNCTION_NAP (mdecl) = count;
4586 start_artificial_method_body (mdecl);
4587
4588 for (current = list; current; current = TREE_CHAIN (current))
4589 java_method_add_stmt (mdecl,
4590 build_debugable_stmt (EXPR_WFL_LINECOL (current),
4591 current));
4592 end_artificial_method_body (mdecl);
4593 return mdecl;
4594 }
4595
4596 /* Generate a function to run the instance initialization code. The
4597 private method is called `instinit$'. Unless we're dealing with an
4598 anonymous class, we determine whether all ctors of CLASS_TYPE
4599 declare a checked exception in their `throws' clause in order to
4600 see whether it's necessary to encapsulate the instance initializer
4601 statements in a try/catch/rethrow sequence. */
4602
4603 static tree
4604 generate_instinit (tree class_type)
4605 {
4606 tree current;
4607 tree compound = NULL_TREE;
4608 tree parms = tree_cons (this_identifier_node,
4609 build_pointer_type (class_type), end_params_node);
4610 tree mdecl = create_artificial_method (class_type, ACC_PRIVATE,
4611 void_type_node,
4612 instinit_identifier_node, parms);
4613
4614 layout_class_method (class_type, CLASSTYPE_SUPER (class_type),
4615 mdecl, NULL_TREE);
4616
4617 /* Gather all the statements in a compound */
4618 for (current = TYPE_II_STMT_LIST (class_type);
4619 current; current = TREE_CHAIN (current))
4620 compound = add_stmt_to_compound (compound, NULL_TREE, current);
4621
4622 /* We need to encapsulate COMPOUND by a try/catch statement to
4623 rethrow exceptions that might occur in the instance initializer.
4624 We do that only if all ctors of CLASS_TYPE are set to catch a
4625 checked exception. This doesn't apply to anonymous classes (since
4626 they don't have declared ctors.) */
4627 if (!ANONYMOUS_CLASS_P (class_type) &&
4628 ctors_unchecked_throws_clause_p (class_type))
4629 {
4630 compound = encapsulate_with_try_catch (0, exception_type_node, compound,
4631 build1 (THROW_EXPR, NULL_TREE,
4632 build_wfl_node (wpv_id)));
4633 DECL_FUNCTION_THROWS (mdecl) = build_tree_list (NULL_TREE,
4634 exception_type_node);
4635 }
4636
4637 start_artificial_method_body (mdecl);
4638 java_method_add_stmt (mdecl, compound);
4639 end_artificial_method_body (mdecl);
4640
4641 return mdecl;
4642 }
4643
4644 /* FIXME */
4645 static tree
4646 build_instinit_invocation (tree class_type)
4647 {
4648 tree to_return = NULL_TREE;
4649
4650 if (TYPE_II_STMT_LIST (class_type))
4651 {
4652 tree parm = build_tree_list (NULL_TREE,
4653 build_wfl_node (this_identifier_node));
4654 to_return =
4655 build_method_invocation (build_wfl_node (instinit_identifier_node),
4656 parm);
4657 }
4658 return to_return;
4659 }
4660
4661 /* Shared across method_declarator and method_header to remember the
4662 patch stage that was reached during the declaration of the method.
4663 A method DECL is built differently is there is no patch
4664 (JDEP_NO_PATCH) or a patch (JDEP_METHOD or JDEP_METHOD_RETURN)
4665 pending on the currently defined method. */
4666
4667 static int patch_stage;
4668
4669 /* Check the method declaration and add the method to its current
4670 class. If the argument list is known to contain incomplete types,
4671 the method is partially added and the registration will be resume
4672 once the method arguments resolved. If TYPE is NULL, we're dealing
4673 with a constructor. */
4674
4675 static tree
4676 method_header (int flags, tree type, tree mdecl, tree throws)
4677 {
4678 tree type_wfl = NULL_TREE;
4679 tree meth_name = NULL_TREE;
4680 tree current, orig_arg, this_class = NULL;
4681 tree id, meth;
4682 location_t saved_location;
4683 int constructor_ok = 0, must_chain;
4684 int count;
4685
4686 if (mdecl == error_mark_node)
4687 return error_mark_node;
4688 meth = TREE_VALUE (mdecl);
4689 id = TREE_PURPOSE (mdecl);
4690
4691 check_modifiers_consistency (flags);
4692
4693 if (GET_CPC ())
4694 this_class = TREE_TYPE (GET_CPC ());
4695
4696 if (!this_class || this_class == error_mark_node)
4697 return NULL_TREE;
4698
4699 /* There are some forbidden modifiers for an abstract method and its
4700 class must be abstract as well. */
4701 if (type && (flags & ACC_ABSTRACT))
4702 {
4703 ABSTRACT_CHECK (flags, ACC_PRIVATE, id, "Private");
4704 ABSTRACT_CHECK (flags, ACC_STATIC, id, "Static");
4705 ABSTRACT_CHECK (flags, ACC_FINAL, id, "Final");
4706 ABSTRACT_CHECK (flags, ACC_NATIVE, id, "Native");
4707 ABSTRACT_CHECK (flags, ACC_SYNCHRONIZED, id, "Synchronized");
4708 ABSTRACT_CHECK (flags, ACC_STRICT, id, "Strictfp");
4709 if (!CLASS_ABSTRACT (TYPE_NAME (this_class))
4710 && !CLASS_INTERFACE (TYPE_NAME (this_class)))
4711 parse_error_context
4712 (id,
4713 "Class %qs must be declared abstract to define abstract method %qs",
4714 IDENTIFIER_POINTER (DECL_NAME (GET_CPC ())),
4715 IDENTIFIER_POINTER (EXPR_WFL_NODE (id)));
4716 }
4717
4718 /* A native method can't be strictfp. */
4719 if ((flags & ACC_NATIVE) && (flags & ACC_STRICT))
4720 parse_error_context (id, "native method %qs can't be strictfp",
4721 IDENTIFIER_POINTER (EXPR_WFL_NODE (id)));
4722 /* No such thing as a transient or volatile method. */
4723 if ((flags & ACC_TRANSIENT))
4724 parse_error_context (id, "method %qs can't be transient",
4725 IDENTIFIER_POINTER (EXPR_WFL_NODE (id)));
4726 if ((flags & ACC_VOLATILE))
4727 parse_error_context (id, "method %qs can't be volatile",
4728 IDENTIFIER_POINTER (EXPR_WFL_NODE (id)));
4729
4730 /* Things to be checked when declaring a constructor */
4731 if (!type)
4732 {
4733 int ec = java_error_count;
4734 /* 8.6: Constructor declarations: we might be trying to define a
4735 method without specifying a return type. */
4736 if (EXPR_WFL_NODE (id) != GET_CPC_UN ())
4737 parse_error_context
4738 (id, "Invalid method declaration, return type required");
4739 /* 8.6.3: Constructor modifiers */
4740 else
4741 {
4742 JCONSTRUCTOR_CHECK (flags, ACC_ABSTRACT, id, "abstract");
4743 JCONSTRUCTOR_CHECK (flags, ACC_STATIC, id, "static");
4744 JCONSTRUCTOR_CHECK (flags, ACC_FINAL, id, "final");
4745 JCONSTRUCTOR_CHECK (flags, ACC_NATIVE, id, "native");
4746 JCONSTRUCTOR_CHECK (flags, ACC_SYNCHRONIZED, id, "synchronized");
4747 JCONSTRUCTOR_CHECK (flags, ACC_STRICT, id, "strictfp");
4748 }
4749 /* If we found error here, we don't consider it's OK to tread
4750 the method definition as a constructor, for the rest of this
4751 function */
4752 if (ec == java_error_count)
4753 constructor_ok = 1;
4754 }
4755
4756 /* Method declared within the scope of an interface are implicitly
4757 abstract and public. Conflicts with other erroneously provided
4758 modifiers are checked right after. */
4759
4760 if (CLASS_INTERFACE (TYPE_NAME (this_class)))
4761 {
4762 /* If FLAGS isn't set because of a modifier, turn the
4763 corresponding modifier WFL to NULL so we issue a warning on
4764 the obsolete use of the modifier */
4765 if (!(flags & ACC_PUBLIC))
4766 MODIFIER_WFL (PUBLIC_TK) = NULL;
4767 if (!(flags & ACC_ABSTRACT))
4768 MODIFIER_WFL (ABSTRACT_TK) = NULL;
4769 flags |= ACC_PUBLIC;
4770 flags |= ACC_ABSTRACT;
4771 }
4772
4773 /* Inner class can't declare static methods */
4774 if ((flags & ACC_STATIC) && !TOPLEVEL_CLASS_TYPE_P (this_class))
4775 {
4776 parse_error_context
4777 (id, "Method %qs can't be static in inner class %qs. Only members of interfaces and top-level classes can be static",
4778 IDENTIFIER_POINTER (EXPR_WFL_NODE (id)),
4779 lang_printable_name (this_class, 0));
4780 }
4781
4782 /* Modifiers context reset moved up, so abstract method declaration
4783 modifiers can be later checked. */
4784
4785 /* Set constructor returned type to void and method name to <init>,
4786 unless we found an error identifier the constructor (in which
4787 case we retain the original name) */
4788 if (!type)
4789 {
4790 type = void_type_node;
4791 if (constructor_ok)
4792 meth_name = init_identifier_node;
4793 }
4794 else
4795 meth_name = EXPR_WFL_NODE (id);
4796
4797 /* Do the returned type resolution and registration if necessary */
4798 SET_TYPE_FOR_RESOLUTION (type, type_wfl, must_chain);
4799
4800 if (meth_name)
4801 type = build_array_from_name (type, type_wfl, meth_name, &meth_name);
4802 EXPR_WFL_NODE (id) = meth_name;
4803 PROMOTE_RECORD_IF_COMPLETE (type, must_chain);
4804
4805 if (must_chain)
4806 {
4807 patch_stage = JDEP_METHOD_RETURN;
4808 register_incomplete_type (patch_stage, type_wfl, id, type);
4809 TREE_TYPE (meth) = GET_REAL_TYPE (type);
4810 }
4811 else
4812 TREE_TYPE (meth) = type;
4813
4814 saved_location = input_location;
4815 /* When defining an abstract or interface method, the curly
4816 bracket at level 1 doesn't exist because there is no function
4817 body */
4818 #ifdef USE_MAPPED_LOCATION
4819 input_location = (ctxp->first_ccb_indent1 ? ctxp->first_ccb_indent1 :
4820 EXPR_LOCATION (id));
4821 #else
4822 input_line = (ctxp->first_ccb_indent1 ? (int) ctxp->first_ccb_indent1 :
4823 EXPR_WFL_LINENO (id));
4824 #endif
4825
4826 /* Remember the original argument list */
4827 orig_arg = TYPE_ARG_TYPES (meth);
4828
4829 if (patch_stage) /* includes ret type and/or all args */
4830 {
4831 jdep *jdep;
4832 meth = add_method_1 (this_class, flags, meth_name, meth);
4833 /* Patch for the return type */
4834 if (patch_stage == JDEP_METHOD_RETURN)
4835 {
4836 jdep = CLASSD_LAST (ctxp->classd_list);
4837 JDEP_GET_PATCH (jdep) = &TREE_TYPE (TREE_TYPE (meth));
4838 }
4839 /* This is the stop JDEP. METH allows the function's signature
4840 to be computed. */
4841 register_incomplete_type (JDEP_METHOD_END, NULL_TREE, meth, NULL_TREE);
4842 }
4843 else
4844 meth = add_method (this_class, flags, meth_name,
4845 build_java_signature (meth));
4846
4847 /* Remember final parameters */
4848 MARK_FINAL_PARMS (meth, orig_arg);
4849
4850 /* Fix the method argument list so we have the argument name
4851 information */
4852 fix_method_argument_names (orig_arg, meth);
4853
4854 /* Register the parameter number and re-install the current line
4855 number */
4856 DECL_MAX_LOCALS (meth) = ctxp->formal_parameter_number+1;
4857 input_location = saved_location;
4858
4859 /* Register exception specified by the `throws' keyword for
4860 resolution and set the method decl appropriate field to the list.
4861 Note: the grammar ensures that what we get here are class
4862 types. */
4863 if (throws)
4864 {
4865 throws = nreverse (throws);
4866 for (current = throws; current; current = TREE_CHAIN (current))
4867 {
4868 register_incomplete_type (JDEP_EXCEPTION, TREE_VALUE (current),
4869 NULL_TREE, NULL_TREE);
4870 JDEP_GET_PATCH (CLASSD_LAST (ctxp->classd_list)) =
4871 &TREE_VALUE (current);
4872 }
4873 DECL_FUNCTION_THROWS (meth) = throws;
4874 }
4875
4876 if (TREE_TYPE (GET_CPC ()) != object_type_node)
4877 DECL_FUNCTION_WFL (meth) = id;
4878
4879 /* Set the flag if we correctly processed a constructor */
4880 if (constructor_ok)
4881 {
4882 DECL_CONSTRUCTOR_P (meth) = 1;
4883 /* Compute and store the number of artificial parameters declared
4884 for this constructor */
4885 for (count = 0, current = TYPE_FIELDS (this_class); current;
4886 current = TREE_CHAIN (current))
4887 if (FIELD_LOCAL_ALIAS (current))
4888 count++;
4889 DECL_FUNCTION_NAP (meth) = count;
4890 }
4891
4892 /* Eventually set the @deprecated tag flag */
4893 CHECK_DEPRECATED (meth);
4894
4895 return meth;
4896 }
4897
4898 static void
4899 fix_method_argument_names (tree orig_arg, tree meth)
4900 {
4901 tree arg = TYPE_ARG_TYPES (TREE_TYPE (meth));
4902 if (TREE_CODE (TREE_TYPE (meth)) == METHOD_TYPE)
4903 {
4904 TREE_PURPOSE (arg) = this_identifier_node;
4905 arg = TREE_CHAIN (arg);
4906 }
4907 while (orig_arg != end_params_node)
4908 {
4909 TREE_PURPOSE (arg) = TREE_PURPOSE (orig_arg);
4910 orig_arg = TREE_CHAIN (orig_arg);
4911 arg = TREE_CHAIN (arg);
4912 }
4913 }
4914
4915 /* Complete the method declaration with METHOD_BODY. */
4916
4917 static void
4918 finish_method_declaration (tree method_body)
4919 {
4920 int flags;
4921
4922 if (!current_function_decl)
4923 return;
4924
4925 flags = get_access_flags_from_decl (current_function_decl);
4926
4927 /* 8.4.5 Method Body */
4928 if ((flags & ACC_ABSTRACT || flags & ACC_NATIVE) && method_body)
4929 {
4930 tree name = DECL_NAME (current_function_decl);
4931 parse_error_context (DECL_FUNCTION_WFL (current_function_decl),
4932 "%s method %qs can't have a body defined",
4933 (METHOD_NATIVE (current_function_decl) ?
4934 "Native" : "Abstract"),
4935 IDENTIFIER_POINTER (name));
4936 method_body = NULL_TREE;
4937 }
4938 else if (!(flags & ACC_ABSTRACT) && !(flags & ACC_NATIVE) && !method_body)
4939 {
4940 tree name = DECL_NAME (current_function_decl);
4941 parse_error_context
4942 (DECL_FUNCTION_WFL (current_function_decl),
4943 "Non native and non abstract method %qs must have a body defined",
4944 IDENTIFIER_POINTER (name));
4945 method_body = NULL_TREE;
4946 }
4947
4948 if (flag_emit_class_files && method_body
4949 && TREE_CODE (method_body) == NOP_EXPR
4950 && TREE_TYPE (current_function_decl)
4951 && TREE_TYPE (TREE_TYPE (current_function_decl)) == void_type_node)
4952 method_body = build1 (RETURN_EXPR, void_type_node, NULL);
4953
4954 BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (current_function_decl)) = method_body;
4955 maybe_absorb_scoping_blocks ();
4956 /* Exit function's body */
4957 exit_block ();
4958 /* Merge last line of the function with first line, directly in the
4959 function decl. It will be used to emit correct debug info. */
4960 DECL_FUNCTION_LAST_LINE (current_function_decl) = ctxp->last_ccb_indent1;
4961
4962 /* Since function's argument's list are shared, reset the
4963 ARG_FINAL_P parameter that might have been set on some of this
4964 function parameters. */
4965 UNMARK_FINAL_PARMS (current_function_decl);
4966
4967 /* So we don't have an irrelevant function declaration context for
4968 the next static block we'll see. */
4969 current_function_decl = NULL_TREE;
4970 }
4971
4972 /* Build a an error message for constructor circularity errors. */
4973
4974 static char *
4975 constructor_circularity_msg (tree from, tree to)
4976 {
4977 static char string [4096];
4978 char *t = xstrdup (lang_printable_name (from, 2));
4979 sprintf (string, "'%s' invokes '%s'", t, lang_printable_name (to, 2));
4980 free (t);
4981 return string;
4982 }
4983
4984 /* Verify a circular call to METH. Return 1 if an error is found, 0
4985 otherwise. */
4986
4987 static GTY(()) tree vcc_list;
4988 static int
4989 verify_constructor_circularity (tree meth, tree current)
4990 {
4991 tree c;
4992
4993 for (c = DECL_CONSTRUCTOR_CALLS (current); c; c = TREE_CHAIN (c))
4994 {
4995 if (TREE_VALUE (c) == meth)
4996 {
4997 char *t;
4998 if (vcc_list)
4999 {
5000 tree liste;
5001 vcc_list = nreverse (vcc_list);
5002 for (liste = vcc_list; liste; liste = TREE_CHAIN (liste))
5003 {
5004 parse_error_context
5005 (TREE_PURPOSE (TREE_PURPOSE (liste)), "%s",
5006 constructor_circularity_msg
5007 (TREE_VALUE (liste), TREE_VALUE (TREE_PURPOSE (liste))));
5008 java_error_count--;
5009 }
5010 }
5011 t = xstrdup (lang_printable_name (meth, 2));
5012 parse_error_context (TREE_PURPOSE (c),
5013 "%s: recursive invocation of constructor %qs",
5014 constructor_circularity_msg (current, meth), t);
5015 free (t);
5016 vcc_list = NULL_TREE;
5017 return 1;
5018 }
5019 }
5020 for (c = DECL_CONSTRUCTOR_CALLS (current); c; c = TREE_CHAIN (c))
5021 {
5022 vcc_list = tree_cons (c, current, vcc_list);
5023 if (verify_constructor_circularity (meth, TREE_VALUE (c)))
5024 return 1;
5025 vcc_list = TREE_CHAIN (vcc_list);
5026 }
5027 return 0;
5028 }
5029
5030 /* Check modifiers that can be declared but exclusively */
5031
5032 static void
5033 check_modifiers_consistency (int flags)
5034 {
5035 int acc_count = 0;
5036 tree cl = NULL_TREE;
5037
5038 THIS_MODIFIER_ONLY (flags, ACC_PUBLIC, PUBLIC_TK, acc_count, cl);
5039 THIS_MODIFIER_ONLY (flags, ACC_PRIVATE, PRIVATE_TK, acc_count, cl);
5040 THIS_MODIFIER_ONLY (flags, ACC_PROTECTED, PROTECTED_TK, acc_count, cl);
5041 if (acc_count > 1)
5042 parse_error_context
5043 (cl, "Inconsistent member declaration. At most one of %<public%>, %<private%>, or %<protected%> may be specified");
5044
5045 acc_count = 0;
5046 cl = NULL_TREE;
5047 THIS_MODIFIER_ONLY (flags, ACC_FINAL, FINAL_TK, acc_count, cl);
5048 THIS_MODIFIER_ONLY (flags, ACC_VOLATILE, VOLATILE_TK, acc_count, cl);
5049 if (acc_count > 1)
5050 parse_error_context (cl,
5051 "Inconsistent member declaration. At most one of %<final%> or %<volatile%> may be specified");
5052 }
5053
5054 /* Check the methode header METH for abstract specifics features */
5055
5056 static void
5057 check_abstract_method_header (tree meth)
5058 {
5059 int flags = get_access_flags_from_decl (meth);
5060
5061 OBSOLETE_MODIFIER_WARNING2 (MODIFIER_WFL (ABSTRACT_TK), flags,
5062 ACC_ABSTRACT, "abstract method",
5063 IDENTIFIER_POINTER (DECL_NAME (meth)));
5064 OBSOLETE_MODIFIER_WARNING2 (MODIFIER_WFL (PUBLIC_TK), flags,
5065 ACC_PUBLIC, "abstract method",
5066 IDENTIFIER_POINTER (DECL_NAME (meth)));
5067
5068 check_modifiers ("Illegal modifier %qs for interface method",
5069 flags, INTERFACE_METHOD_MODIFIERS);
5070 }
5071
5072 /* Create a FUNCTION_TYPE node and start augmenting it with the
5073 declared function arguments. Arguments type that can't be resolved
5074 are left as they are, but the returned node is marked as containing
5075 incomplete types. */
5076
5077 static tree
5078 method_declarator (tree id, tree list)
5079 {
5080 tree arg_types = NULL_TREE, current, node;
5081 tree meth = make_node (FUNCTION_TYPE);
5082 jdep *jdep;
5083
5084 patch_stage = JDEP_NO_PATCH;
5085
5086 if (GET_CPC () == error_mark_node)
5087 return error_mark_node;
5088
5089 /* If we're dealing with an inner class constructor, we hide the
5090 this$<n> decl in the name field of its parameter declaration. We
5091 also might have to hide the outer context local alias
5092 initializers. Not done when the class is a toplevel class. */
5093 if (PURE_INNER_CLASS_DECL_P (GET_CPC ())
5094 && EXPR_WFL_NODE (id) == GET_CPC_UN ())
5095 {
5096 tree aliases_list, type, thisn;
5097 /* First the aliases, linked to the regular parameters */
5098 aliases_list =
5099 build_alias_initializer_parameter_list (AIPL_FUNCTION_DECLARATION,
5100 TREE_TYPE (GET_CPC ()),
5101 NULL_TREE, NULL);
5102 list = chainon (nreverse (aliases_list), list);
5103
5104 /* Then this$<n> */
5105 type = TREE_TYPE (DECL_CONTEXT (GET_CPC ()));
5106 thisn = build_current_thisn (TREE_TYPE (GET_CPC ()));
5107 list = tree_cons (build_wfl_node (thisn), build_pointer_type (type),
5108 list);
5109 }
5110
5111 for (current = list; current; current = TREE_CHAIN (current))
5112 {
5113 int must_chain = 0;
5114 tree wfl_name = TREE_PURPOSE (current);
5115 tree type = TREE_VALUE (current);
5116 tree name = EXPR_WFL_NODE (wfl_name);
5117 tree already, arg_node;
5118 tree type_wfl = NULL_TREE;
5119 tree real_type;
5120
5121 /* Obtain a suitable type for resolution, if necessary */
5122 SET_TYPE_FOR_RESOLUTION (type, type_wfl, must_chain);
5123
5124 /* Process NAME, as it may specify extra dimension(s) for it */
5125 type = build_array_from_name (type, type_wfl, name, &name);
5126 EXPR_WFL_NODE (wfl_name) = name;
5127
5128 real_type = GET_REAL_TYPE (type);
5129 if (TREE_CODE (real_type) == RECORD_TYPE)
5130 {
5131 real_type = promote_type (real_type);
5132 if (TREE_CODE (type) == TREE_LIST)
5133 TREE_PURPOSE (type) = real_type;
5134 }
5135
5136 /* Check redefinition */
5137 for (already = arg_types; already; already = TREE_CHAIN (already))
5138 if (TREE_PURPOSE (already) == name)
5139 {
5140 parse_error_context
5141 (wfl_name, "Variable %qs is used more than once in the argument list of method %qs",
5142 IDENTIFIER_POINTER (name),
5143 IDENTIFIER_POINTER (EXPR_WFL_NODE (id)));
5144 break;
5145 }
5146
5147 /* If we've an incomplete argument type, we know there is a location
5148 to patch when the type get resolved, later. */
5149 jdep = NULL;
5150 if (must_chain)
5151 {
5152 patch_stage = JDEP_METHOD;
5153 type = register_incomplete_type (patch_stage,
5154 type_wfl, wfl_name, type);
5155 jdep = CLASSD_LAST (ctxp->classd_list);
5156 JDEP_MISC (jdep) = id;
5157 }
5158
5159 /* The argument node: a name and a (possibly) incomplete type. */
5160 arg_node = build_tree_list (name, real_type);
5161 /* Remember arguments declared final. */
5162 ARG_FINAL_P (arg_node) = ARG_FINAL_P (current);
5163
5164 if (jdep)
5165 JDEP_GET_PATCH (jdep) = &TREE_VALUE (arg_node);
5166 TREE_CHAIN (arg_node) = arg_types;
5167 arg_types = arg_node;
5168 }
5169 TYPE_ARG_TYPES (meth) = chainon (nreverse (arg_types), end_params_node);
5170 node = build_tree_list (id, meth);
5171 return node;
5172 }
5173
5174 static int
5175 unresolved_type_p (tree wfl, tree *returned)
5176 {
5177 if (TREE_CODE (wfl) == EXPR_WITH_FILE_LOCATION)
5178 {
5179 if (returned)
5180 {
5181 tree decl = IDENTIFIER_CLASS_VALUE (EXPR_WFL_NODE (wfl));
5182 if (decl && current_class && (decl == TYPE_NAME (current_class)))
5183 *returned = TREE_TYPE (decl);
5184 else if (GET_CPC_UN () == EXPR_WFL_NODE (wfl))
5185 *returned = TREE_TYPE (GET_CPC ());
5186 else
5187 *returned = NULL_TREE;
5188 }
5189 return 1;
5190 }
5191 if (returned)
5192 *returned = wfl;
5193 return 0;
5194 }
5195
5196 /* From NAME, build a qualified identifier node using the
5197 qualification from the current package definition. */
5198
5199 static tree
5200 parser_qualified_classname (tree name)
5201 {
5202 tree nested_class_name;
5203
5204 if ((nested_class_name = maybe_make_nested_class_name (name)))
5205 return nested_class_name;
5206
5207 if (ctxp->package)
5208 return merge_qualified_name (ctxp->package, name);
5209 else
5210 return name;
5211 }
5212
5213 /* Called once the type a interface extends is resolved. Returns 0 if
5214 everything is OK. */
5215
5216 static int
5217 parser_check_super_interface (tree super_decl, tree this_decl, tree this_wfl)
5218 {
5219 tree super_type = TREE_TYPE (super_decl);
5220
5221 /* Has to be an interface */
5222 if (!CLASS_INTERFACE (super_decl))
5223 {
5224 parse_error_context
5225 (this_wfl, "%s %qs can't implement/extend %s %qs",
5226 (CLASS_INTERFACE (TYPE_NAME (TREE_TYPE (this_decl))) ?
5227 "Interface" : "Class"),
5228 IDENTIFIER_POINTER (DECL_NAME (this_decl)),
5229 (TYPE_ARRAY_P (super_type) ? "array" : "class"),
5230 IDENTIFIER_POINTER (DECL_NAME (super_decl)));
5231 return 1;
5232 }
5233
5234 /* Check top-level interface access. Inner classes are subject to member
5235 access rules (6.6.1). */
5236 if (! INNER_CLASS_P (super_type)
5237 && check_pkg_class_access (DECL_NAME (super_decl),
5238 NULL_TREE, true, this_decl))
5239 return 1;
5240
5241 SOURCE_FRONTEND_DEBUG (("Completing interface %s with %s",
5242 IDENTIFIER_POINTER (DECL_NAME (this_decl)),
5243 IDENTIFIER_POINTER (DECL_NAME (super_decl))));
5244 return 0;
5245 }
5246
5247 /* Makes sure that SUPER_DECL is suitable to extend THIS_DECL. Returns
5248 0 if everything is OK. */
5249
5250 static int
5251 parser_check_super (tree super_decl, tree this_decl, tree wfl)
5252 {
5253 tree super_type = TREE_TYPE (super_decl);
5254
5255 /* SUPER should be a CLASS (neither an array nor an interface) */
5256 if (TYPE_ARRAY_P (super_type) || CLASS_INTERFACE (TYPE_NAME (super_type)))
5257 {
5258 parse_error_context
5259 (wfl, "Class %qs can't subclass %s %qs",
5260 IDENTIFIER_POINTER (DECL_NAME (this_decl)),
5261 (CLASS_INTERFACE (TYPE_NAME (super_type)) ? "interface" : "array"),
5262 IDENTIFIER_POINTER (DECL_NAME (super_decl)));
5263 return 1;
5264 }
5265
5266 if (CLASS_FINAL (TYPE_NAME (super_type)))
5267 {
5268 parse_error_context (wfl, "Can't subclass final classes: %s",
5269 IDENTIFIER_POINTER (DECL_NAME (super_decl)));
5270 return 1;
5271 }
5272
5273 /* Check top-level class scope. Inner classes are subject to member access
5274 rules (6.6.1). */
5275 if (! INNER_CLASS_P (super_type)
5276 && (check_pkg_class_access (DECL_NAME (super_decl), wfl, true, NULL_TREE)))
5277 return 1;
5278
5279 SOURCE_FRONTEND_DEBUG (("Completing class %s with %s",
5280 IDENTIFIER_POINTER (DECL_NAME (this_decl)),
5281 IDENTIFIER_POINTER (DECL_NAME (super_decl))));
5282 return 0;
5283 }
5284
5285 /* Create a new dependency list and link it (in a LIFO manner) to the
5286 CTXP list of type dependency list. */
5287
5288 static void
5289 create_jdep_list (struct parser_ctxt *ctxp)
5290 {
5291 jdeplist *new = xmalloc (sizeof (jdeplist));
5292 new->first = new->last = NULL;
5293 new->next = ctxp->classd_list;
5294 ctxp->classd_list = new;
5295 }
5296
5297 static jdeplist *
5298 reverse_jdep_list (struct parser_ctxt *ctxp)
5299 {
5300 jdeplist *prev = NULL, *current, *next;
5301 for (current = ctxp->classd_list; current; current = next)
5302 {
5303 next = current->next;
5304 current->next = prev;
5305 prev = current;
5306 }
5307 return prev;
5308 }
5309
5310 /* Create a fake pointer based on the ID stored in
5311 TYPE_NAME. TYPE_NAME can be a WFL or a incomplete type asking to be
5312 registered again. */
5313
5314 static tree
5315 obtain_incomplete_type (tree type_name)
5316 {
5317 tree ptr = NULL_TREE, name;
5318
5319 if (TREE_CODE (type_name) == EXPR_WITH_FILE_LOCATION)
5320 name = EXPR_WFL_NODE (type_name);
5321 else if (INCOMPLETE_TYPE_P (type_name))
5322 name = TYPE_NAME (type_name);
5323 else
5324 abort ();
5325
5326 /* Workaround from build_pointer_type for incomplete types. */
5327 BUILD_PTR_FROM_NAME (ptr, name);
5328 TYPE_MODE (ptr) = ptr_mode;
5329 layout_type (ptr);
5330
5331 return ptr;
5332 }
5333
5334 /* Register a incomplete type whose name is WFL. Reuse PTR if PTR is
5335 non NULL instead of computing a new fake type based on WFL. The new
5336 dependency is inserted in the current type dependency list, in FIFO
5337 manner. */
5338
5339 static tree
5340 register_incomplete_type (int kind, tree wfl, tree decl, tree ptr)
5341 {
5342 jdep *new = xmalloc (sizeof (jdep));
5343
5344 if (!ptr && kind != JDEP_METHOD_END) /* JDEP_METHOD_END is a mere marker */
5345 ptr = obtain_incomplete_type (wfl);
5346
5347 JDEP_KIND (new) = kind;
5348 JDEP_DECL (new) = decl;
5349 JDEP_TO_RESOLVE (new) = ptr;
5350 JDEP_WFL (new) = wfl;
5351 JDEP_CHAIN (new) = NULL;
5352 JDEP_MISC (new) = NULL_TREE;
5353 /* For some dependencies, set the enclosing class of the current
5354 class to be the enclosing context */
5355 if ((kind == JDEP_INTERFACE || kind == JDEP_ANONYMOUS || kind == JDEP_SUPER)
5356 && GET_ENCLOSING_CPC ())
5357 JDEP_ENCLOSING (new) = TREE_VALUE (GET_ENCLOSING_CPC ());
5358 else
5359 JDEP_ENCLOSING (new) = GET_CPC ();
5360 JDEP_GET_PATCH (new) = (tree *)NULL;
5361
5362 JDEP_INSERT (ctxp->classd_list, new);
5363
5364 return ptr;
5365 }
5366
5367 /* This checks for circular references with innerclasses. We start
5368 from SOURCE and should never reach TARGET. Extended/implemented
5369 types in SOURCE have their enclosing context checked not to reach
5370 TARGET. When the last enclosing context of SOURCE is reached, its
5371 extended/implemented types are also checked not to reach TARGET.
5372 In case of error, WFL of the offending type is returned; NULL_TREE
5373 otherwise. */
5374
5375 static tree
5376 check_inner_circular_reference (tree source, tree target)
5377 {
5378 tree base_binfo;
5379 tree ctx, cl;
5380 int i;
5381
5382 for (i = 0; BINFO_BASE_ITERATE (TYPE_BINFO (source), i, base_binfo); i++)
5383 {
5384 tree su;
5385
5386 /* We can end up with a NULL_TREE or an incomplete type here if
5387 we encountered previous type resolution errors. It's safe to
5388 simply ignore these cases. */
5389 su = BINFO_TYPE (base_binfo);
5390 if (INCOMPLETE_TYPE_P (su))
5391 continue;
5392
5393 if (inherits_from_p (su, target))
5394 return lookup_cl (TYPE_NAME (su));
5395
5396 for (ctx = DECL_CONTEXT (TYPE_NAME (su)); ctx; ctx = DECL_CONTEXT (ctx))
5397 {
5398 /* An enclosing context shouldn't be TARGET */
5399 if (ctx == TYPE_NAME (target))
5400 return lookup_cl (TYPE_NAME (su));
5401
5402 /* When we reach the enclosing last context, start a check
5403 on it, with the same target */
5404 if (! DECL_CONTEXT (ctx) &&
5405 (cl = check_inner_circular_reference (TREE_TYPE (ctx), target)))
5406 return cl;
5407 }
5408 }
5409 return NULL_TREE;
5410 }
5411
5412 /* Explore TYPE's `extends' clause member(s) and return the WFL of the
5413 offending type if a circularity is detected. NULL_TREE is returned
5414 otherwise. TYPE can be an interface or a class. */
5415
5416 static tree
5417 check_circular_reference (tree type)
5418 {
5419 tree base_binfo;
5420 int i;
5421
5422 if (!BINFO_N_BASE_BINFOS (TYPE_BINFO (type)))
5423 return NULL_TREE;
5424
5425 if (! CLASS_INTERFACE (TYPE_NAME (type)))
5426 {
5427 if (inherits_from_p (CLASSTYPE_SUPER (type), type))
5428 return lookup_cl (TYPE_NAME (type));
5429 return NULL_TREE;
5430 }
5431
5432 for (i = 0; BINFO_BASE_ITERATE (TYPE_BINFO (type), i, base_binfo); i++)
5433 {
5434 if (BINFO_TYPE (base_binfo) != object_type_node
5435 && interface_of_p (type, BINFO_TYPE (base_binfo)))
5436 return lookup_cl (TYPE_NAME (BINFO_TYPE (base_binfo)));
5437 }
5438 return NULL_TREE;
5439 }
5440
5441 void
5442 java_check_circular_reference (void)
5443 {
5444 tree current;
5445 for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
5446 {
5447 tree type = TREE_TYPE (current);
5448 tree cl;
5449
5450 cl = check_circular_reference (type);
5451 if (! cl)
5452 cl = check_inner_circular_reference (type, type);
5453 if (cl)
5454 parse_error_context (cl, "Cyclic class inheritance%s",
5455 (cyclic_inheritance_report ?
5456 cyclic_inheritance_report : ""));
5457 }
5458 }
5459
5460 /* Augment the parameter list PARM with parameters crafted to
5461 initialize outer context locals aliases. Through ARTIFICIAL, a
5462 count is kept of the number of crafted parameters. MODE governs
5463 what eventually gets created: something suitable for a function
5464 creation or a function invocation, either the constructor or
5465 finit$. */
5466
5467 static tree
5468 build_alias_initializer_parameter_list (int mode, tree class_type, tree parm,
5469 int *artificial)
5470 {
5471 tree field;
5472 tree additional_parms = NULL_TREE;
5473
5474 for (field = TYPE_FIELDS (class_type); field; field = TREE_CHAIN (field))
5475 if (FIELD_LOCAL_ALIAS (field))
5476 {
5477 const char *buffer = IDENTIFIER_POINTER (DECL_NAME (field));
5478 tree purpose = NULL_TREE, value = NULL_TREE, name = NULL_TREE;
5479 tree mangled_id;
5480
5481 switch (mode)
5482 {
5483 case AIPL_FUNCTION_DECLARATION:
5484 MANGLE_ALIAS_INITIALIZER_PARAMETER_NAME_STR (mangled_id,
5485 &buffer [4]);
5486 purpose = build_wfl_node (mangled_id);
5487 if (TREE_CODE (TREE_TYPE (field)) == POINTER_TYPE)
5488 value = build_wfl_node (TYPE_NAME (TREE_TYPE (field)));
5489 else
5490 value = TREE_TYPE (field);
5491 break;
5492
5493 case AIPL_FUNCTION_CREATION:
5494 MANGLE_ALIAS_INITIALIZER_PARAMETER_NAME_STR (purpose,
5495 &buffer [4]);
5496 value = TREE_TYPE (field);
5497 break;
5498
5499 case AIPL_FUNCTION_FINIT_INVOCATION:
5500 MANGLE_ALIAS_INITIALIZER_PARAMETER_NAME_STR (mangled_id,
5501 &buffer [4]);
5502 /* Now, this is wrong. purpose should always be the NAME
5503 of something and value its matching value (decl, type,
5504 etc...) FIXME -- but there is a lot to fix. */
5505
5506 /* When invoked for this kind of operation, we already
5507 know whether a field is used or not. */
5508 purpose = TREE_TYPE (field);
5509 value = build_wfl_node (mangled_id);
5510 break;
5511
5512 case AIPL_FUNCTION_CTOR_INVOCATION:
5513 /* There are two case: the constructor invocation happens
5514 outside the local inner, in which case, locales from the outer
5515 context are directly used.
5516
5517 Otherwise, we fold to using the alias directly. */
5518 if (class_type == current_class)
5519 value = field;
5520 else
5521 {
5522 name = get_identifier (&buffer[4]);
5523 value = IDENTIFIER_LOCAL_VALUE (name);
5524 }
5525 break;
5526 }
5527 additional_parms = tree_cons (purpose, value, additional_parms);
5528 if (artificial)
5529 *artificial +=1;
5530 }
5531 if (additional_parms)
5532 {
5533 if (ANONYMOUS_CLASS_P (class_type)
5534 && mode == AIPL_FUNCTION_CTOR_INVOCATION)
5535 additional_parms = nreverse (additional_parms);
5536 parm = chainon (additional_parms, parm);
5537 }
5538
5539 return parm;
5540 }
5541
5542 /* Craft a constructor for CLASS_DECL -- what we should do when none
5543 where found. ARGS is non NULL when a special signature must be
5544 enforced. This is the case for anonymous classes. */
5545
5546 static tree
5547 craft_constructor (tree class_decl, tree args)
5548 {
5549 tree class_type = TREE_TYPE (class_decl);
5550 tree parm = NULL_TREE;
5551 /* Inherit access flags for the constructor from its enclosing class. */
5552 int valid_ctor_flags = ACC_PUBLIC | ACC_PROTECTED | ACC_PRIVATE;
5553 int flags = (get_access_flags_from_decl (class_decl) & valid_ctor_flags);
5554 int i = 0, artificial = 0;
5555 tree decl, ctor_name;
5556 char buffer [80];
5557
5558 ctor_name = init_identifier_node;
5559
5560 /* If we're dealing with an inner class constructor, we hide the
5561 this$<n> decl in the name field of its parameter declaration. */
5562 if (PURE_INNER_CLASS_TYPE_P (class_type))
5563 {
5564 tree type = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (class_type)));
5565 parm = tree_cons (build_current_thisn (class_type),
5566 build_pointer_type (type), parm);
5567
5568 /* Some more arguments to be hidden here. The values of the local
5569 variables of the outer context that the inner class needs to see. */
5570 parm = build_alias_initializer_parameter_list (AIPL_FUNCTION_CREATION,
5571 class_type, parm,
5572 &artificial);
5573 }
5574
5575 /* Then if there are any args to be enforced, enforce them now */
5576 for (; args && args != end_params_node; args = TREE_CHAIN (args))
5577 {
5578 /* If we see a `void *', we need to change it to Object. */
5579 if (TREE_VALUE (args) == TREE_TYPE (null_pointer_node))
5580 TREE_VALUE (args) = object_ptr_type_node;
5581
5582 sprintf (buffer, "parm%d", i++);
5583 parm = tree_cons (get_identifier (buffer), TREE_VALUE (args), parm);
5584 }
5585
5586 CRAFTED_PARAM_LIST_FIXUP (parm);
5587 decl = create_artificial_method (class_type, flags, void_type_node,
5588 ctor_name, parm);
5589 fix_method_argument_names (parm, decl);
5590 /* Now, mark the artificial parameters. */
5591 DECL_FUNCTION_NAP (decl) = artificial;
5592 DECL_FUNCTION_SYNTHETIC_CTOR (decl) = DECL_CONSTRUCTOR_P (decl) = 1;
5593 DECL_INLINE (decl) = 1;
5594 return decl;
5595 }
5596
5597
5598 /* Fix the constructors. This will be called right after circular
5599 references have been checked. It is necessary to fix constructors
5600 early even if no code generation will take place for that class:
5601 some generated constructor might be required by the class whose
5602 compilation triggered this one to be simply loaded. */
5603
5604 void
5605 java_fix_constructors (void)
5606 {
5607 tree current;
5608
5609 for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
5610 {
5611 tree class_type = TREE_TYPE (current);
5612 int saw_ctor = 0;
5613 tree decl;
5614
5615 if (CLASS_INTERFACE (TYPE_NAME (class_type)))
5616 continue;
5617
5618 output_class = current_class = class_type;
5619 for (decl = TYPE_METHODS (class_type); decl; decl = TREE_CHAIN (decl))
5620 {
5621 if (DECL_CONSTRUCTOR_P (decl))
5622 {
5623 fix_constructors (decl);
5624 saw_ctor = 1;
5625 }
5626 }
5627
5628 /* Anonymous class constructor can't be generated that early. */
5629 if (!saw_ctor && !ANONYMOUS_CLASS_P (class_type))
5630 craft_constructor (current, NULL_TREE);
5631 }
5632 }
5633
5634 /* safe_layout_class just makes sure that we can load a class without
5635 disrupting the current_class, input_file, input_line, etc, information
5636 about the class processed currently. */
5637
5638 void
5639 safe_layout_class (tree class)
5640 {
5641 tree save_current_class = current_class;
5642 location_t save_location = input_location;
5643
5644 layout_class (class);
5645
5646 current_class = save_current_class;
5647 input_location = save_location;
5648 }
5649
5650 static tree
5651 jdep_resolve_class (jdep *dep)
5652 {
5653 tree decl;
5654
5655 /* Set the correct context for class resolution. */
5656 current_class = TREE_TYPE (JDEP_ENCLOSING (dep));
5657
5658 if (JDEP_RESOLVED_P (dep))
5659 decl = JDEP_RESOLVED_DECL (dep);
5660 else
5661 {
5662 decl = resolve_class (JDEP_ENCLOSING (dep), JDEP_TO_RESOLVE (dep),
5663 JDEP_DECL (dep), JDEP_WFL (dep));
5664 JDEP_RESOLVED (dep, decl);
5665 /* If there is no WFL, that's ok. We generate this warning
5666 elsewhere. */
5667 if (decl && JDEP_WFL (dep) != NULL_TREE)
5668 check_deprecation (JDEP_WFL (dep), decl);
5669 }
5670
5671 if (!decl)
5672 complete_class_report_errors (dep);
5673 else if (INNER_CLASS_DECL_P (decl))
5674 {
5675 tree inner = TREE_TYPE (decl);
5676 if (! CLASS_LOADED_P (inner))
5677 {
5678 safe_layout_class (inner);
5679 if (TYPE_SIZE (inner) == error_mark_node)
5680 TYPE_SIZE (inner) = NULL_TREE;
5681 }
5682 check_inner_class_access (decl, JDEP_ENCLOSING (dep), JDEP_WFL (dep));
5683 }
5684 return decl;
5685 }
5686
5687 /* Complete unsatisfied class declaration and their dependencies */
5688
5689 void
5690 java_complete_class (void)
5691 {
5692 tree cclass;
5693 jdeplist *cclassd;
5694 int error_found;
5695 tree type;
5696
5697 /* Process imports */
5698 process_imports ();
5699
5700 /* Reverse things so we have the right order */
5701 ctxp->class_list = nreverse (ctxp->class_list);
5702 ctxp->classd_list = reverse_jdep_list (ctxp);
5703
5704 for (cclassd = ctxp->classd_list, cclass = ctxp->class_list;
5705 cclass && cclassd;
5706 cclass = TREE_CHAIN (cclass), cclassd = CLASSD_CHAIN (cclassd))
5707 {
5708 jdep *dep;
5709
5710 for (dep = CLASSD_FIRST (cclassd); dep; dep = JDEP_CHAIN (dep))
5711 {
5712 tree decl;
5713 if (!(decl = jdep_resolve_class (dep)))
5714 continue;
5715
5716 /* Now it's time to patch */
5717 switch (JDEP_KIND (dep))
5718 {
5719 case JDEP_SUPER:
5720 /* Simply patch super */
5721 if (parser_check_super (decl, JDEP_DECL (dep), JDEP_WFL (dep)))
5722 continue;
5723 BINFO_TYPE (BINFO_BASE_BINFO
5724 (TYPE_BINFO (TREE_TYPE (JDEP_DECL (dep))), 0))
5725 = TREE_TYPE (decl);
5726 break;
5727
5728 case JDEP_FIELD:
5729 {
5730 /* We do part of the job done in add_field */
5731 tree field_decl = JDEP_DECL (dep);
5732 tree field_type = TREE_TYPE (decl);
5733 if (TREE_CODE (field_type) == RECORD_TYPE)
5734 field_type = promote_type (field_type);
5735 TREE_TYPE (field_decl) = field_type;
5736 DECL_ALIGN (field_decl) = 0;
5737 DECL_USER_ALIGN (field_decl) = 0;
5738 layout_decl (field_decl, 0);
5739 SOURCE_FRONTEND_DEBUG
5740 (("Completed field/var decl '%s' with '%s'",
5741 IDENTIFIER_POINTER (DECL_NAME (field_decl)),
5742 IDENTIFIER_POINTER (DECL_NAME (decl))));
5743 break;
5744 }
5745 case JDEP_METHOD: /* We start patching a method */
5746 case JDEP_METHOD_RETURN:
5747 error_found = 0;
5748 while (1)
5749 {
5750 if (decl)
5751 {
5752 type = TREE_TYPE(decl);
5753 if (TREE_CODE (type) == RECORD_TYPE)
5754 type = promote_type (type);
5755 JDEP_APPLY_PATCH (dep, type);
5756 SOURCE_FRONTEND_DEBUG
5757 (((JDEP_KIND (dep) == JDEP_METHOD_RETURN ?
5758 "Completing fct '%s' with ret type '%s'":
5759 "Completing arg '%s' with type '%s'"),
5760 IDENTIFIER_POINTER (EXPR_WFL_NODE
5761 (JDEP_DECL_WFL (dep))),
5762 IDENTIFIER_POINTER (DECL_NAME (decl))));
5763 }
5764 else
5765 error_found = 1;
5766 dep = JDEP_CHAIN (dep);
5767 if (JDEP_KIND (dep) == JDEP_METHOD_END)
5768 break;
5769 else
5770 decl = jdep_resolve_class (dep);
5771 }
5772 if (!error_found)
5773 {
5774 tree mdecl = JDEP_DECL (dep), signature;
5775 /* Recompute and reset the signature, check first that
5776 all types are now defined. If they're not,
5777 don't build the signature. */
5778 if (check_method_types_complete (mdecl))
5779 {
5780 signature = build_java_signature (TREE_TYPE (mdecl));
5781 set_java_signature (TREE_TYPE (mdecl), signature);
5782 }
5783 }
5784 else
5785 continue;
5786 break;
5787
5788 case JDEP_INTERFACE:
5789 if (parser_check_super_interface (decl, JDEP_DECL (dep),
5790 JDEP_WFL (dep)))
5791 continue;
5792 parser_add_interface (JDEP_DECL (dep), decl, JDEP_WFL (dep));
5793 break;
5794
5795 case JDEP_PARM:
5796 case JDEP_VARIABLE:
5797 type = TREE_TYPE(decl);
5798 if (TREE_CODE (type) == RECORD_TYPE)
5799 type = promote_type (type);
5800 JDEP_APPLY_PATCH (dep, type);
5801 break;
5802
5803 case JDEP_TYPE:
5804 JDEP_APPLY_PATCH (dep, TREE_TYPE (decl));
5805 SOURCE_FRONTEND_DEBUG
5806 (("Completing a random type dependency on a '%s' node",
5807 tree_code_name [TREE_CODE (JDEP_DECL (dep))]));
5808 break;
5809
5810 case JDEP_EXCEPTION:
5811 JDEP_APPLY_PATCH (dep, TREE_TYPE (decl));
5812 SOURCE_FRONTEND_DEBUG
5813 (("Completing '%s' 'throws' argument node",
5814 IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_WFL (dep)))));
5815 break;
5816
5817 case JDEP_ANONYMOUS:
5818 patch_anonymous_class (decl, JDEP_DECL (dep), JDEP_WFL (dep));
5819 break;
5820
5821 default:
5822 abort ();
5823 }
5824 }
5825 }
5826 return;
5827 }
5828
5829 /* Resolve class CLASS_TYPE. Handle the case of trying to resolve an
5830 array. */
5831
5832 static tree
5833 resolve_class (tree enclosing, tree class_type, tree decl, tree cl)
5834 {
5835 tree tname = TYPE_NAME (class_type);
5836 tree resolved_type = TREE_TYPE (class_type);
5837 int array_dims = 0;
5838 tree resolved_type_decl;
5839
5840 if (resolved_type != NULL_TREE)
5841 {
5842 tree resolved_type_decl = TYPE_NAME (resolved_type);
5843 if (resolved_type_decl == NULL_TREE
5844 || TREE_CODE (resolved_type_decl) == IDENTIFIER_NODE)
5845 {
5846 resolved_type_decl = build_decl (TYPE_DECL,
5847 TYPE_NAME (class_type),
5848 resolved_type);
5849 }
5850 return resolved_type_decl;
5851 }
5852
5853 /* 1- Check to see if we have an array. If true, find what we really
5854 want to resolve */
5855 if ((array_dims = build_type_name_from_array_name (tname,
5856 &TYPE_NAME (class_type))))
5857 WFL_STRIP_BRACKET (cl, cl);
5858
5859 /* 2- Resolve the bare type */
5860 if (!(resolved_type_decl = do_resolve_class (enclosing, NULL_TREE, class_type,
5861 decl, cl)))
5862 return NULL_TREE;
5863 resolved_type = TREE_TYPE (resolved_type_decl);
5864
5865 /* 3- If we have an array, reconstruct the array down to its nesting */
5866 if (array_dims)
5867 {
5868 for (; array_dims; array_dims--)
5869 resolved_type = build_java_array_type (resolved_type, -1);
5870 resolved_type_decl = TYPE_NAME (resolved_type);
5871 }
5872 TREE_TYPE (class_type) = resolved_type;
5873 return resolved_type_decl;
5874 }
5875
5876 /* Effectively perform the resolution of class CLASS_TYPE. DECL or CL
5877 are used to report error messages; CL must either be NULL_TREE or a
5878 WFL wrapping a class. Do not try to replace TYPE_NAME (class_type)
5879 by a variable, since it is changed by find_in_imports{_on_demand}
5880 and (but it doesn't really matter) qualify_and_find. */
5881
5882 tree
5883 do_resolve_class (tree enclosing, tree import_type, tree class_type, tree decl,
5884 tree cl)
5885 {
5886 tree new_class_decl = NULL_TREE;
5887 tree saved_enclosing_type = enclosing ? TREE_TYPE (enclosing) : NULL_TREE;
5888 tree candidate = NULL_TREE;
5889 tree decl_result;
5890
5891 if (QUALIFIED_P (TYPE_NAME (class_type)))
5892 {
5893 /* If the type name is of the form `Q . Id', then Q is either a
5894 package name or a class name. First we try to find Q as a
5895 class and then treat Id as a member type. If we can't find Q
5896 as a class then we fall through. */
5897 tree q, left, left_type, right;
5898 if (split_qualified_name (&left, &right, TYPE_NAME (class_type)) == 0)
5899 {
5900 BUILD_PTR_FROM_NAME (left_type, left);
5901 q = do_resolve_class (enclosing, import_type, left_type, decl, cl);
5902 if (q)
5903 {
5904 enclosing = q;
5905 saved_enclosing_type = TREE_TYPE (q);
5906 BUILD_PTR_FROM_NAME (class_type, right);
5907 }
5908 }
5909 }
5910
5911 if (enclosing)
5912 {
5913 tree context = enclosing;
5914
5915 /* 0- Search in the current class as an inner class.
5916 Maybe some code here should be added to load the class or
5917 something, at least if the class isn't an inner class and ended
5918 being loaded from class file. FIXME. */
5919 while (enclosing)
5920 {
5921 new_class_decl = resolve_inner_class (context, cl, enclosing, class_type);
5922
5923 if (new_class_decl)
5924 {
5925 if (inner_class_accessible (new_class_decl, context))
5926 break;
5927 else
5928 if (candidate == NULL_TREE)
5929 candidate = new_class_decl;
5930 new_class_decl = NULL_TREE;
5931 }
5932
5933 /* Now that we've looked through all superclasses, try the enclosing
5934 context. */
5935 enclosing = DECL_CONTEXT (enclosing);
5936 }
5937
5938 if (new_class_decl)
5939 return new_class_decl;
5940 }
5941
5942 /* 1- Check for the type in single imports. Look at enclosing classes and,
5943 if we're laying out a superclass, at the import list for the subclass.
5944 This will change TYPE_NAME() if something relevant is found. */
5945 if (import_type && TYPE_IMPORT_LIST (import_type))
5946 find_in_imports (import_type, class_type);
5947 find_in_imports (saved_enclosing_type, class_type);
5948
5949 /* 2- And check for the type in the current compilation unit */
5950 if ((new_class_decl = IDENTIFIER_CLASS_VALUE (TYPE_NAME (class_type))))
5951 {
5952 if (!CLASS_LOADED_P (TREE_TYPE (new_class_decl)))
5953 load_class (TYPE_NAME (class_type), 0);
5954 return IDENTIFIER_CLASS_VALUE (TYPE_NAME (class_type));
5955 }
5956
5957 /* 3- Search according to the current package definition */
5958 if (!QUALIFIED_P (TYPE_NAME (class_type)))
5959 {
5960 if ((new_class_decl = qualify_and_find (class_type,
5961 TYPE_PACKAGE (current_class), TYPE_NAME (class_type))))
5962 return new_class_decl;
5963 }
5964
5965 /* 4- Check the import on demands. Don't allow bar.baz to be
5966 imported from foo.* */
5967 if (!QUALIFIED_P (TYPE_NAME (class_type)))
5968 {
5969 if (import_type
5970 && TYPE_IMPORT_DEMAND_LIST (import_type)
5971 && find_in_imports_on_demand (import_type, class_type))
5972 return NULL_TREE;
5973 if (find_in_imports_on_demand (saved_enclosing_type, class_type))
5974 return NULL_TREE;
5975 }
5976
5977 /* If found in find_in_imports_on_demand, the type has already been
5978 loaded. */
5979 if ((new_class_decl = IDENTIFIER_CLASS_VALUE (TYPE_NAME (class_type))))
5980 return new_class_decl;
5981
5982 /* 5- Check another compilation unit that bears the name of type */
5983 load_class (TYPE_NAME (class_type), 0);
5984
5985 if (!cl)
5986 cl = lookup_cl (decl);
5987
5988 /* If we don't have a value for CL, then we're being called recursively.
5989 We can't check package access just yet, but it will be taken care of
5990 by the caller. */
5991 if (cl)
5992 {
5993 if (check_pkg_class_access (TYPE_NAME (class_type), cl, true, NULL_TREE))
5994 return NULL_TREE;
5995 }
5996
5997 /* 6- Last call for a resolution */
5998 decl_result = IDENTIFIER_CLASS_VALUE (TYPE_NAME (class_type));
5999
6000 /* The final lookup might have registered a.b.c into a.b$c If we
6001 failed at the first lookup, progressively change the name if
6002 applicable and use the matching DECL instead. */
6003 if (!decl_result && QUALIFIED_P (TYPE_NAME (class_type)))
6004 {
6005 char *separator;
6006 tree name = TYPE_NAME (class_type);
6007 char *namebuffer = alloca (IDENTIFIER_LENGTH (name) + 1);
6008
6009 strcpy (namebuffer, IDENTIFIER_POINTER (name));
6010
6011 do {
6012
6013 /* Reach the last '.', and if applicable, replace it by a `$' and
6014 see if this exists as a type. */
6015 if ((separator = strrchr (namebuffer, '.')))
6016 {
6017 *separator = '$';
6018 name = get_identifier (namebuffer);
6019 decl_result = IDENTIFIER_CLASS_VALUE (name);
6020 }
6021 } while (!decl_result && separator);
6022 }
6023 if (decl_result)
6024 return decl_result;
6025 else
6026 return candidate;
6027 }
6028
6029 static tree
6030 qualify_and_find (tree class_type, tree package, tree name)
6031 {
6032 tree new_qualified = merge_qualified_name (package, name);
6033 tree new_class_decl;
6034
6035 if (!IDENTIFIER_CLASS_VALUE (new_qualified))
6036 load_class (new_qualified, 0);
6037 if ((new_class_decl = IDENTIFIER_CLASS_VALUE (new_qualified)))
6038 {
6039 if (!CLASS_LOADED_P (TREE_TYPE (new_class_decl)))
6040 load_class (TREE_TYPE (new_class_decl), 0);
6041 TYPE_NAME (class_type) = new_qualified;
6042 return IDENTIFIER_CLASS_VALUE (new_qualified);
6043 }
6044 return NULL_TREE;
6045 }
6046
6047 /* Resolve NAME and lay it out (if not done and if not the current
6048 parsed class). Return a decl node. This function is meant to be
6049 called when type resolution is necessary during the walk pass. */
6050
6051 static tree
6052 resolve_and_layout (tree something, tree cl)
6053 {
6054 tree decl, decl_type;
6055
6056 /* Don't do that on the current class */
6057 if (something == current_class)
6058 return TYPE_NAME (current_class);
6059
6060 /* Don't do anything for void and other primitive types */
6061 if (JPRIMITIVE_TYPE_P (something) || something == void_type_node)
6062 return NULL_TREE;
6063
6064 /* Pointer types can be reall pointer types or fake pointers. When
6065 finding a real pointer, recheck for primitive types */
6066 if (TREE_CODE (something) == POINTER_TYPE)
6067 {
6068 if (TREE_TYPE (something))
6069 {
6070 something = TREE_TYPE (something);
6071 if (JPRIMITIVE_TYPE_P (something) || something == void_type_node)
6072 return NULL_TREE;
6073 }
6074 else
6075 something = TYPE_NAME (something);
6076 }
6077
6078 /* Don't do anything for arrays of primitive types */
6079 if (TREE_CODE (something) == RECORD_TYPE && TYPE_ARRAY_P (something)
6080 && JPRIMITIVE_TYPE_P (TYPE_ARRAY_ELEMENT (something)))
6081 return NULL_TREE;
6082
6083 /* Something might be a WFL */
6084 if (TREE_CODE (something) == EXPR_WITH_FILE_LOCATION)
6085 something = EXPR_WFL_NODE (something);
6086
6087 /* Otherwise, if something is not and IDENTIFIER_NODE, it can be a
6088 TYPE_DECL or a real TYPE. */
6089 else if (TREE_CODE (something) != IDENTIFIER_NODE)
6090 something = (TREE_CODE (TYPE_NAME (something)) == TYPE_DECL ?
6091 DECL_NAME (TYPE_NAME (something)) : TYPE_NAME (something));
6092
6093 if (!(decl = resolve_no_layout (something, cl)))
6094 return NULL_TREE;
6095
6096 /* Resolve and layout if necessary */
6097 decl_type = TREE_TYPE (decl);
6098 layout_class_methods (decl_type);
6099 /* Check methods */
6100 if (CLASS_FROM_SOURCE_P (decl_type))
6101 java_check_methods (decl);
6102 /* Layout the type if necessary */
6103 if (decl_type != current_class && !CLASS_LOADED_P (decl_type))
6104 safe_layout_class (decl_type);
6105
6106 return decl;
6107 }
6108
6109 /* Resolve a class, returns its decl but doesn't perform any
6110 layout. The current parsing context is saved and restored */
6111
6112 static tree
6113 resolve_no_layout (tree name, tree cl)
6114 {
6115 tree ptr, decl;
6116 BUILD_PTR_FROM_NAME (ptr, name);
6117 java_parser_context_save_global ();
6118 decl = resolve_class (TYPE_NAME (current_class), ptr, NULL_TREE, cl);
6119 java_parser_context_restore_global ();
6120
6121 return decl;
6122 }
6123
6124 /* Called when reporting errors. Skip the '[]'s in a complex array
6125 type description that failed to be resolved. purify_type_name can't
6126 use an identifier tree. */
6127
6128 static const char *
6129 purify_type_name (const char *name)
6130 {
6131 int len = strlen (name);
6132 int bracket_found;
6133
6134 STRING_STRIP_BRACKETS (name, len, bracket_found);
6135 if (bracket_found)
6136 {
6137 char *stripped_name = xmemdup (name, len, len+1);
6138 stripped_name [len] = '\0';
6139 return stripped_name;
6140 }
6141 return name;
6142 }
6143
6144 /* The type CURRENT refers to can't be found. We print error messages. */
6145
6146 static void
6147 complete_class_report_errors (jdep *dep)
6148 {
6149 const char *name;
6150
6151 if (!JDEP_WFL (dep))
6152 return;
6153
6154 name = IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_WFL (dep)));
6155 switch (JDEP_KIND (dep))
6156 {
6157 case JDEP_SUPER:
6158 parse_error_context
6159 (JDEP_WFL (dep), "Superclass %qs of class %qs not found",
6160 purify_type_name (name),
6161 IDENTIFIER_POINTER (DECL_NAME (JDEP_DECL (dep))));
6162 break;
6163 case JDEP_FIELD:
6164 parse_error_context
6165 (JDEP_WFL (dep), "Type %qs not found in declaration of field %qs",
6166 purify_type_name (name),
6167 IDENTIFIER_POINTER (DECL_NAME (JDEP_DECL (dep))));
6168 break;
6169 case JDEP_METHOD: /* Covers arguments */
6170 parse_error_context
6171 (JDEP_WFL (dep), "Type %qs not found in the declaration of the argument %qs of method %qs",
6172 purify_type_name (name),
6173 IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_DECL_WFL (dep))),
6174 IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_MISC (dep))));
6175 break;
6176 case JDEP_METHOD_RETURN: /* Covers return type */
6177 parse_error_context
6178 (JDEP_WFL (dep), "Type %qs not found in the declaration of the return type of method %qs",
6179 purify_type_name (name),
6180 IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_DECL_WFL (dep))));
6181 break;
6182 case JDEP_INTERFACE:
6183 parse_error_context
6184 (JDEP_WFL (dep), "Superinterface %qs of %s %qs not found",
6185 IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_WFL (dep))),
6186 (CLASS_OR_INTERFACE (JDEP_DECL (dep), "class", "interface")),
6187 IDENTIFIER_POINTER (DECL_NAME (JDEP_DECL (dep))));
6188 break;
6189 case JDEP_VARIABLE:
6190 parse_error_context
6191 (JDEP_WFL (dep), "Type %qs not found in the declaration of the local variable %qs",
6192 purify_type_name (IDENTIFIER_POINTER
6193 (EXPR_WFL_NODE (JDEP_WFL (dep)))),
6194 IDENTIFIER_POINTER (DECL_NAME (JDEP_DECL (dep))));
6195 break;
6196 case JDEP_EXCEPTION: /* As specified by `throws' */
6197 parse_error_context
6198 (JDEP_WFL (dep), "Class %qs not found in %<throws%>",
6199 IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_WFL (dep))));
6200 break;
6201 default:
6202 /* Fix for -Wall. Just break doing nothing. The error will be
6203 caught later */
6204 break;
6205 }
6206 }
6207
6208 /* Return a static string containing the DECL prototype string. If
6209 DECL is a constructor, use the class name instead of the form
6210 <init> */
6211
6212 static const char *
6213 get_printable_method_name (tree decl)
6214 {
6215 const char *to_return;
6216 tree name = NULL_TREE;
6217
6218 if (DECL_CONSTRUCTOR_P (decl))
6219 {
6220 name = DECL_NAME (decl);
6221 DECL_NAME (decl) = DECL_NAME (TYPE_NAME (DECL_CONTEXT (decl)));
6222 }
6223
6224 to_return = lang_printable_name (decl, 2);
6225 if (DECL_CONSTRUCTOR_P (decl))
6226 DECL_NAME (decl) = name;
6227
6228 return to_return;
6229 }
6230
6231 /* Track method being redefined inside the same class. As a side
6232 effect, set DECL_NAME to an IDENTIFIER (prior entering this
6233 function it's a FWL, so we can track errors more accurately.) */
6234
6235 static int
6236 check_method_redefinition (tree class, tree method)
6237 {
6238 tree redef, sig;
6239
6240 /* There's no need to verify <clinit> and finit$ and instinit$ */
6241 if (DECL_CLINIT_P (method)
6242 || DECL_FINIT_P (method) || DECL_INSTINIT_P (method))
6243 return 0;
6244
6245 sig = TYPE_ARGUMENT_SIGNATURE (TREE_TYPE (method));
6246 for (redef = TYPE_METHODS (class); redef; redef = TREE_CHAIN (redef))
6247 {
6248 if (redef == method)
6249 break;
6250 if (DECL_NAME (redef) == DECL_NAME (method)
6251 && sig == TYPE_ARGUMENT_SIGNATURE (TREE_TYPE (redef))
6252 && !DECL_ARTIFICIAL (method))
6253 {
6254 parse_error_context
6255 (DECL_FUNCTION_WFL (method), "Duplicate %s declaration %qs",
6256 (DECL_CONSTRUCTOR_P (redef) ? "constructor" : "method"),
6257 get_printable_method_name (redef));
6258 return 1;
6259 }
6260 }
6261 return 0;
6262 }
6263
6264 /* Return 1 if check went ok, 0 otherwise. */
6265 static int
6266 check_abstract_method_definitions (int do_interface, tree class_decl,
6267 tree type)
6268 {
6269 tree class = TREE_TYPE (class_decl);
6270 tree method, end_type;
6271 int ok = 1;
6272
6273 end_type = (do_interface ? object_type_node : type);
6274 for (method = TYPE_METHODS (type); method; method = TREE_CHAIN (method))
6275 {
6276 tree other_super, other_method, method_sig, method_name;
6277 int found = 0;
6278 int end_type_reached = 0;
6279
6280 if (!METHOD_ABSTRACT (method) || METHOD_FINAL (method))
6281 continue;
6282
6283 /* Now verify that somewhere in between TYPE and CLASS,
6284 abstract method METHOD gets a non abstract definition
6285 that is inherited by CLASS. */
6286
6287 method_sig = build_java_signature (TREE_TYPE (method));
6288 method_name = DECL_NAME (method);
6289 if (TREE_CODE (method_name) == EXPR_WITH_FILE_LOCATION)
6290 method_name = EXPR_WFL_NODE (method_name);
6291
6292 other_super = class;
6293 do {
6294 if (other_super == end_type)
6295 end_type_reached = 1;
6296
6297 /* Method search */
6298 for (other_method = TYPE_METHODS (other_super); other_method;
6299 other_method = TREE_CHAIN (other_method))
6300 {
6301 tree s = build_java_signature (TREE_TYPE (other_method));
6302 tree other_name = DECL_NAME (other_method);
6303
6304 if (TREE_CODE (other_name) == EXPR_WITH_FILE_LOCATION)
6305 other_name = EXPR_WFL_NODE (other_name);
6306 if (!DECL_CLINIT_P (other_method)
6307 && !DECL_CONSTRUCTOR_P (other_method)
6308 && method_name == other_name
6309 && method_sig == s
6310 && !METHOD_ABSTRACT (other_method))
6311 {
6312 found = 1;
6313 break;
6314 }
6315 }
6316 other_super = CLASSTYPE_SUPER (other_super);
6317 } while (!end_type_reached);
6318
6319 /* Report that abstract METHOD didn't find an implementation
6320 that CLASS can use. */
6321 if (!found)
6322 {
6323 char *t = xstrdup (lang_printable_name
6324 (TREE_TYPE (TREE_TYPE (method)), 0));
6325 tree ccn = DECL_NAME (TYPE_NAME (DECL_CONTEXT (method)));
6326
6327 parse_error_context
6328 (lookup_cl (class_decl),
6329 "Class %qs doesn't define the abstract method %<%s %s%> from %s %<%s%>. This method must be defined or %s %qs must be declared abstract",
6330 IDENTIFIER_POINTER (DECL_NAME (class_decl)),
6331 t, lang_printable_name (method, 2),
6332 (CLASS_INTERFACE (TYPE_NAME (DECL_CONTEXT (method))) ?
6333 "interface" : "class"),
6334 IDENTIFIER_POINTER (ccn),
6335 (CLASS_INTERFACE (class_decl) ? "interface" : "class"),
6336 IDENTIFIER_POINTER (DECL_NAME (class_decl)));
6337 ok = 0;
6338 free (t);
6339 }
6340 }
6341
6342 if (ok && do_interface)
6343 {
6344 /* Check for implemented interfaces. */
6345 int i;
6346 tree base_binfo;
6347
6348 for (i = 1;
6349 ok && BINFO_BASE_ITERATE (TYPE_BINFO (type), i, base_binfo);
6350 i++)
6351 ok = check_abstract_method_definitions (1, class_decl,
6352 BINFO_TYPE (base_binfo));
6353 }
6354
6355 return ok;
6356 }
6357
6358 /* Check that CLASS_DECL somehow implements all inherited abstract
6359 methods. */
6360
6361 static void
6362 java_check_abstract_method_definitions (tree class_decl)
6363 {
6364 tree class = TREE_TYPE (class_decl);
6365 tree super, base_binfo;
6366 int i;
6367
6368 if (CLASS_ABSTRACT (class_decl))
6369 return;
6370
6371 /* Check for inherited types */
6372 super = class;
6373 do {
6374 super = CLASSTYPE_SUPER (super);
6375 check_abstract_method_definitions (0, class_decl, super);
6376 } while (super != object_type_node);
6377
6378 /* Check for implemented interfaces. */
6379 for (i = 1; BINFO_BASE_ITERATE (TYPE_BINFO (class), i, base_binfo); i++)
6380 check_abstract_method_definitions (1, class_decl, BINFO_TYPE (base_binfo));
6381 }
6382
6383 /* Check all the types method DECL uses and return 1 if all of them
6384 are now complete, 0 otherwise. This is used to check whether its
6385 safe to build a method signature or not. */
6386
6387 static int
6388 check_method_types_complete (tree decl)
6389 {
6390 tree type = TREE_TYPE (decl);
6391 tree args;
6392
6393 if (!INCOMPLETE_TYPE_P (TREE_TYPE (type)))
6394 return 0;
6395
6396 args = TYPE_ARG_TYPES (type);
6397 if (TREE_CODE (type) == METHOD_TYPE)
6398 args = TREE_CHAIN (args);
6399 for (; args != end_params_node; args = TREE_CHAIN (args))
6400 if (INCOMPLETE_TYPE_P (TREE_VALUE (args)))
6401 return 0;
6402
6403 return 1;
6404 }
6405
6406 /* Visible interface to check methods contained in CLASS_DECL */
6407
6408 void
6409 java_check_methods (tree class_decl)
6410 {
6411 if (CLASS_METHOD_CHECKED_P (TREE_TYPE (class_decl)))
6412 return;
6413
6414 if (CLASS_INTERFACE (class_decl))
6415 java_check_abstract_methods (class_decl);
6416 else
6417 java_check_regular_methods (class_decl);
6418
6419 CLASS_METHOD_CHECKED_P (TREE_TYPE (class_decl)) = 1;
6420 }
6421
6422 /* Like not_accessible_p, but doesn't refer to the current class at
6423 all. */
6424 static bool
6425 hack_is_accessible_p (tree member, tree from_where)
6426 {
6427 int flags = get_access_flags_from_decl (member);
6428
6429 if (from_where == DECL_CONTEXT (member)
6430 || (flags & ACC_PUBLIC))
6431 return true;
6432
6433 if ((flags & ACC_PROTECTED))
6434 {
6435 if (inherits_from_p (from_where, DECL_CONTEXT (member)))
6436 return true;
6437 }
6438
6439 if ((flags & ACC_PRIVATE))
6440 return false;
6441
6442 /* Package private, or protected. */
6443 return in_same_package (TYPE_NAME (from_where),
6444 TYPE_NAME (DECL_CONTEXT (member)));
6445 }
6446
6447 /* Check all the methods of CLASS_DECL. Methods are first completed
6448 then checked according to regular method existence rules. If no
6449 constructor for CLASS_DECL were encountered, then build its
6450 declaration. */
6451 static void
6452 java_check_regular_methods (tree class_decl)
6453 {
6454 int saw_constructor = ANONYMOUS_CLASS_P (TREE_TYPE (class_decl));
6455 tree method;
6456 tree class = TREE_TYPE (class_decl);
6457 tree found = NULL_TREE;
6458 tree mthrows;
6459
6460 /* It is not necessary to check methods defined in java.lang.Object */
6461 if (class == object_type_node)
6462 return;
6463
6464 if (!TYPE_NVIRTUALS (class))
6465 TYPE_METHODS (class) = nreverse (TYPE_METHODS (class));
6466
6467 /* Should take interfaces into account. FIXME */
6468 for (method = TYPE_METHODS (class); method; method = TREE_CHAIN (method))
6469 {
6470 tree sig;
6471 tree method_wfl = DECL_FUNCTION_WFL (method);
6472 int aflags;
6473
6474 /* Check for redefinitions */
6475 if (check_method_redefinition (class, method))
6476 continue;
6477
6478 /* We verify things thrown by the method. They must inherit from
6479 java.lang.Throwable. */
6480 for (mthrows = DECL_FUNCTION_THROWS (method);
6481 mthrows; mthrows = TREE_CHAIN (mthrows))
6482 {
6483 if (!inherits_from_p (TREE_VALUE (mthrows), throwable_type_node))
6484 parse_error_context
6485 (TREE_PURPOSE (mthrows), "Class %qs in %<throws%> clause must be a subclass of class %<java.lang.Throwable%>",
6486 IDENTIFIER_POINTER
6487 (DECL_NAME (TYPE_NAME (TREE_VALUE (mthrows)))));
6488 }
6489
6490 /* If we see one constructor a mark so we don't generate the
6491 default one. Also skip other verifications: constructors
6492 can't be inherited hence hidden or overridden. */
6493 if (DECL_CONSTRUCTOR_P (method))
6494 {
6495 saw_constructor = 1;
6496 continue;
6497 }
6498
6499 sig = build_java_argument_signature (TREE_TYPE (method));
6500 found = lookup_argument_method_generic (class, DECL_NAME (method), sig,
6501 SEARCH_SUPER | SEARCH_INTERFACE);
6502
6503 /* Inner class can't declare static methods */
6504 if (METHOD_STATIC (method) && !TOPLEVEL_CLASS_DECL_P (class_decl))
6505 {
6506 char *t = xstrdup (lang_printable_name (class, 0));
6507 parse_error_context
6508 (method_wfl, "Method %qs can't be static in inner class %qs. Only members of interfaces and top-level classes can be static",
6509 lang_printable_name (method, 2), t);
6510 free (t);
6511 }
6512
6513 /* Nothing overrides or it's a private method. */
6514 if (!found)
6515 continue;
6516 if (METHOD_PRIVATE (found))
6517 {
6518 found = NULL_TREE;
6519 continue;
6520 }
6521
6522 /* If `found' is declared in an interface, make sure the
6523 modifier matches. */
6524 if (CLASS_INTERFACE (TYPE_NAME (DECL_CONTEXT (found)))
6525 && clinit_identifier_node != DECL_NAME (found)
6526 && !METHOD_PUBLIC (method))
6527 {
6528 tree found_decl = TYPE_NAME (DECL_CONTEXT (found));
6529 parse_error_context (method_wfl, "Class %qs must override %qs with a public method in order to implement interface %qs",
6530 IDENTIFIER_POINTER (DECL_NAME (class_decl)),
6531 lang_printable_name (found, 0),
6532 IDENTIFIER_POINTER (DECL_NAME (found_decl)));
6533 }
6534
6535 /* Can't override a method with the same name and different return
6536 types. */
6537 if (TREE_TYPE (TREE_TYPE (found)) != TREE_TYPE (TREE_TYPE (method)))
6538 {
6539 char *t = xstrdup
6540 (lang_printable_name (TREE_TYPE (TREE_TYPE (found)), 2));
6541 parse_error_context
6542 (method_wfl,
6543 "Method %qs was defined with return type %qs in class %qs",
6544 lang_printable_name (found, 2), t,
6545 IDENTIFIER_POINTER
6546 (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found)))));
6547 free (t);
6548 }
6549
6550 aflags = get_access_flags_from_decl (found);
6551
6552 /* Can't override final. Can't override static. */
6553 if (METHOD_FINAL (found) || METHOD_STATIC (found))
6554 {
6555 /* Static *can* override static */
6556 if (METHOD_STATIC (found) && METHOD_STATIC (method))
6557 continue;
6558 parse_error_context
6559 (method_wfl,
6560 "%s methods can't be overridden. Method %qs is %s in class %qs",
6561 (METHOD_FINAL (found) ? "Final" : "Static"),
6562 lang_printable_name (found, 2),
6563 (METHOD_FINAL (found) ? "final" : "static"),
6564 IDENTIFIER_POINTER
6565 (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found)))));
6566 continue;
6567 }
6568
6569 /* Static method can't override instance method. */
6570 if (METHOD_STATIC (method))
6571 {
6572 parse_error_context
6573 (method_wfl,
6574 "Instance methods can't be overridden by a static method. Method %qs is an instance method in class %qs",
6575 lang_printable_name (found, 2),
6576 IDENTIFIER_POINTER
6577 (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found)))));
6578 continue;
6579 }
6580
6581 /* - Overriding/hiding public must be public
6582 - Overriding/hiding protected must be protected or public
6583 - If the overridden or hidden method has default (package)
6584 access, then the overriding or hiding method must not be
6585 private; otherwise, a compile-time error occurs. If
6586 `found' belongs to an interface, things have been already
6587 taken care of. */
6588 if (!CLASS_INTERFACE (TYPE_NAME (DECL_CONTEXT (found)))
6589 && ((METHOD_PUBLIC (found) && !METHOD_PUBLIC (method))
6590 || (METHOD_PROTECTED (found)
6591 && !(METHOD_PUBLIC (method) || METHOD_PROTECTED (method)))
6592 || (!(aflags & (ACC_PUBLIC | ACC_PRIVATE | ACC_STATIC))
6593 && METHOD_PRIVATE (method))))
6594 {
6595 parse_error_context
6596 (method_wfl,
6597 "Methods can't be overridden to be more private. Method %qs is not %s in class %qs", lang_printable_name (method, 2),
6598 (METHOD_PUBLIC (method) ? "public" :
6599 (METHOD_PRIVATE (method) ? "private" : "protected")),
6600 IDENTIFIER_POINTER (DECL_NAME
6601 (TYPE_NAME (DECL_CONTEXT (found)))));
6602 continue;
6603 }
6604
6605 /* Check this method against all the other implementations it
6606 overrides. Here we only check the class hierarchy; the rest
6607 of the checking is done later. If this method is just a
6608 Miranda method, we can skip the check. */
6609 if (! METHOD_INVISIBLE (method))
6610 check_concrete_throws_clauses (class, method, DECL_NAME (method), sig);
6611 }
6612
6613 /* The above throws clause check only looked at superclasses. Now
6614 we must also make sure that all methods declared in interfaces
6615 have compatible throws clauses. FIXME: there are more efficient
6616 ways to organize this checking; we should implement one. */
6617 check_interface_throws_clauses (class, class);
6618
6619 if (!TYPE_NVIRTUALS (class))
6620 TYPE_METHODS (class) = nreverse (TYPE_METHODS (class));
6621
6622 /* Search for inherited abstract method not yet implemented in this
6623 class. */
6624 java_check_abstract_method_definitions (class_decl);
6625
6626 if (!saw_constructor)
6627 abort ();
6628 }
6629
6630 /* Check to make sure that all the methods in all the interfaces
6631 implemented by CLASS_DECL are compatible with the concrete
6632 implementations available in CHECK_CLASS_DECL. */
6633 static void
6634 check_interface_throws_clauses (tree check_class_decl, tree class_decl)
6635 {
6636 for (; class_decl != NULL_TREE; class_decl = CLASSTYPE_SUPER (class_decl))
6637 {
6638 int i;
6639
6640 if (! CLASS_LOADED_P (class_decl))
6641 {
6642 if (CLASS_FROM_SOURCE_P (class_decl))
6643 safe_layout_class (class_decl);
6644 else
6645 load_class (class_decl, 1);
6646 }
6647
6648 for (i = BINFO_N_BASE_BINFOS (TYPE_BINFO (class_decl)) - 1; i > 0; --i)
6649 {
6650 tree interface
6651 = BINFO_TYPE (BINFO_BASE_BINFO (TYPE_BINFO (class_decl), i));
6652 tree iface_method;
6653
6654 for (iface_method = TYPE_METHODS (interface);
6655 iface_method != NULL_TREE;
6656 iface_method = TREE_CHAIN (iface_method))
6657 {
6658 tree sig, method;
6659
6660 /* First look for a concrete method implemented or
6661 inherited by this class. No need to search
6662 interfaces here, since we're already looking through
6663 all of them. */
6664 sig = build_java_argument_signature (TREE_TYPE (iface_method));
6665 method
6666 = lookup_argument_method_generic (check_class_decl,
6667 DECL_NAME (iface_method),
6668 sig, SEARCH_VISIBLE);
6669 /* If we don't find an implementation, that is ok. Any
6670 potential errors from that are diagnosed elsewhere.
6671 Also, multiple inheritance with conflicting throws
6672 clauses is fine in the absence of a concrete
6673 implementation. */
6674 if (method != NULL_TREE && !METHOD_ABSTRACT (method)
6675 && !METHOD_INVISIBLE (iface_method))
6676 {
6677 tree method_wfl = DECL_FUNCTION_WFL (method);
6678 check_throws_clauses (method, method_wfl, iface_method);
6679 }
6680 }
6681
6682 /* Now check superinterfaces. */
6683 check_interface_throws_clauses (check_class_decl, interface);
6684 }
6685 }
6686 }
6687
6688 /* Check throws clauses of a method against the clauses of all the
6689 methods it overrides. We do this by searching up the class
6690 hierarchy, examining all matching accessible methods. */
6691 static void
6692 check_concrete_throws_clauses (tree class, tree self_method,
6693 tree name, tree signature)
6694 {
6695 tree method = lookup_argument_method_generic (class, name, signature,
6696 SEARCH_SUPER | SEARCH_VISIBLE);
6697 while (method != NULL_TREE)
6698 {
6699 if (! METHOD_INVISIBLE (method) && hack_is_accessible_p (method, class))
6700 check_throws_clauses (self_method, DECL_FUNCTION_WFL (self_method),
6701 method);
6702
6703 method = lookup_argument_method_generic (DECL_CONTEXT (method),
6704 name, signature,
6705 SEARCH_SUPER | SEARCH_VISIBLE);
6706 }
6707 }
6708
6709 /* Generate an error if the `throws' clause of METHOD (if any) is
6710 incompatible with the `throws' clause of FOUND (if any). */
6711 static void
6712 check_throws_clauses (tree method, tree method_wfl, tree found)
6713 {
6714 tree mthrows;
6715
6716 for (mthrows = DECL_FUNCTION_THROWS (method);
6717 mthrows; mthrows = TREE_CHAIN (mthrows))
6718 {
6719 tree fthrows;
6720
6721 /* We don't verify unchecked expressions */
6722 if (IS_UNCHECKED_EXCEPTION_P (TREE_VALUE (mthrows)))
6723 continue;
6724 /* Checked expression must be compatible */
6725 for (fthrows = DECL_FUNCTION_THROWS (found);
6726 fthrows; fthrows = TREE_CHAIN (fthrows))
6727 {
6728 if (inherits_from_p (TREE_VALUE (mthrows), TREE_VALUE (fthrows)))
6729 break;
6730 }
6731 if (!fthrows)
6732 {
6733 parse_error_context
6734 (method_wfl, "Invalid checked exception class %qs in %<throws%> clause. The exception must be a subclass of an exception thrown by %qs from class %qs",
6735 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (TREE_VALUE (mthrows)))),
6736 lang_printable_name (found, 2),
6737 IDENTIFIER_POINTER
6738 (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found)))));
6739 }
6740 }
6741 }
6742
6743 /* Check abstract method of interface INTERFACE */
6744 static void
6745 java_check_abstract_methods (tree interface_decl)
6746 {
6747 int i;
6748 tree method, found;
6749 tree interface = TREE_TYPE (interface_decl);
6750 tree base_binfo;
6751
6752 for (method = TYPE_METHODS (interface); method; method = TREE_CHAIN (method))
6753 {
6754 /* 2- Check for double definition inside the defining interface */
6755 if (check_method_redefinition (interface, method))
6756 continue;
6757
6758 /* 3- Overriding is OK as far as we preserve the return type. */
6759 found = lookup_java_interface_method2 (interface, method);
6760 if (found)
6761 {
6762 char *t;
6763 t = xstrdup (lang_printable_name (TREE_TYPE (TREE_TYPE (found)), 2));
6764 parse_error_context
6765 (DECL_FUNCTION_WFL (found),
6766 "Method %qs was defined with return type %qs in class %qs",
6767 lang_printable_name (found, 2), t,
6768 IDENTIFIER_POINTER
6769 (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found)))));
6770 free (t);
6771 continue;
6772 }
6773 }
6774
6775 /* 4- Inherited methods can't differ by their returned types */
6776 for (i = 0; BINFO_BASE_ITERATE (TYPE_BINFO (interface), i, base_binfo); i++)
6777 {
6778 tree sub_interface_method, sub_interface;
6779
6780 sub_interface = BINFO_TYPE (base_binfo);
6781 for (sub_interface_method = TYPE_METHODS (sub_interface);
6782 sub_interface_method;
6783 sub_interface_method = TREE_CHAIN (sub_interface_method))
6784 {
6785 found = lookup_java_interface_method2 (interface,
6786 sub_interface_method);
6787 if (found && (found != sub_interface_method))
6788 {
6789 parse_error_context
6790 (lookup_cl (sub_interface_method),
6791 "Interface %qs inherits method %qs from interface %qs. This method is redefined with a different return type in interface %qs",
6792 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (interface))),
6793 lang_printable_name (found, 2),
6794 IDENTIFIER_POINTER
6795 (DECL_NAME (TYPE_NAME
6796 (DECL_CONTEXT (sub_interface_method)))),
6797 IDENTIFIER_POINTER
6798 (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found)))));
6799 }
6800 }
6801 }
6802 }
6803
6804 /* Lookup methods in interfaces using their name and partial
6805 signature. Return a matching method only if their types differ. */
6806
6807 static tree
6808 lookup_java_interface_method2 (tree class, tree method_decl)
6809 {
6810 int i;
6811 tree base_binfo;
6812 tree to_return;
6813
6814 for (i = 0; BINFO_BASE_ITERATE (TYPE_BINFO (class), i, base_binfo); i++)
6815 {
6816 if ((BINFO_TYPE (base_binfo) != object_type_node)
6817 && (to_return =
6818 lookup_java_method2 (BINFO_TYPE (base_binfo), method_decl, 1)))
6819 return to_return;
6820 }
6821 for (i = 0; BINFO_BASE_ITERATE (TYPE_BINFO (class), i, base_binfo); i++)
6822 {
6823 to_return = lookup_java_interface_method2
6824 (BINFO_TYPE (base_binfo), method_decl);
6825 if (to_return)
6826 return to_return;
6827 }
6828
6829 return NULL_TREE;
6830 }
6831
6832 /* Lookup method using their name and partial signature. Return a
6833 matching method only if their types differ. */
6834
6835 static tree
6836 lookup_java_method2 (tree clas, tree method_decl, int do_interface)
6837 {
6838 tree method, method_signature, method_name, method_type, name;
6839
6840 method_signature = build_java_argument_signature (TREE_TYPE (method_decl));
6841 name = DECL_NAME (method_decl);
6842 method_name = (TREE_CODE (name) == EXPR_WITH_FILE_LOCATION ?
6843 EXPR_WFL_NODE (name) : name);
6844 method_type = TREE_TYPE (TREE_TYPE (method_decl));
6845
6846 while (clas != NULL_TREE)
6847 {
6848 for (method = TYPE_METHODS (clas);
6849 method != NULL_TREE; method = TREE_CHAIN (method))
6850 {
6851 tree method_sig = build_java_argument_signature (TREE_TYPE (method));
6852 tree name = DECL_NAME (method);
6853 if ((TREE_CODE (name) == EXPR_WITH_FILE_LOCATION ?
6854 EXPR_WFL_NODE (name) : name) == method_name
6855 && method_sig == method_signature
6856 && TREE_TYPE (TREE_TYPE (method)) != method_type)
6857 return method;
6858 }
6859 clas = (do_interface ? NULL_TREE : CLASSTYPE_SUPER (clas));
6860 }
6861 return NULL_TREE;
6862 }
6863
6864 /* Return the line that matches DECL line number, and try its best to
6865 position the column number. Used during error reports.
6866 FUTURE/FIXME: return source_location instead of node. */
6867
6868 static GTY(()) tree cl_v;
6869 static tree
6870 lookup_cl (tree decl)
6871 {
6872 #ifndef USE_MAPPED_LOCATION
6873 char *line, *found;
6874 #endif
6875
6876 if (!decl)
6877 return NULL_TREE;
6878
6879 if (cl_v == NULL_TREE)
6880 {
6881 cl_v = build_unknown_wfl (NULL_TREE);
6882 }
6883
6884 #ifdef USE_MAPPED_LOCATION
6885 SET_EXPR_LOCATION (cl_v, DECL_SOURCE_LOCATION (decl));
6886 #else
6887 EXPR_WFL_FILENAME_NODE (cl_v) = get_identifier (DECL_SOURCE_FILE (decl));
6888 EXPR_WFL_SET_LINECOL (cl_v, DECL_SOURCE_LINE (decl), -1);
6889
6890 line = java_get_line_col (EXPR_WFL_FILENAME (cl_v),
6891 EXPR_WFL_LINENO (cl_v), EXPR_WFL_COLNO (cl_v));
6892
6893 found = strstr ((const char *)line,
6894 (const char *)IDENTIFIER_POINTER (DECL_NAME (decl)));
6895 if (found)
6896 EXPR_WFL_SET_LINECOL (cl_v, EXPR_WFL_LINENO (cl_v), found - line);
6897 #endif
6898
6899 return cl_v;
6900 }
6901
6902 /* Look for a simple name in the single-type import list */
6903
6904 static tree
6905 find_name_in_single_imports (tree name)
6906 {
6907 tree node;
6908
6909 for (node = ctxp->import_list; node; node = TREE_CHAIN (node))
6910 if (TREE_VALUE (node) == name)
6911 return (EXPR_WFL_NODE (TREE_PURPOSE (node)));
6912
6913 return NULL_TREE;
6914 }
6915
6916 /* Process all single-type import. */
6917
6918 static int
6919 process_imports (void)
6920 {
6921 tree import;
6922 int error_found;
6923
6924 for (import = ctxp->import_list; import; import = TREE_CHAIN (import))
6925 {
6926 tree to_be_found = EXPR_WFL_NODE (TREE_PURPOSE (import));
6927 char *original_name;
6928
6929 /* Don't load twice something already defined. */
6930 if (IDENTIFIER_CLASS_VALUE (to_be_found))
6931 continue;
6932
6933 original_name = xmemdup (IDENTIFIER_POINTER (to_be_found),
6934 IDENTIFIER_LENGTH (to_be_found),
6935 IDENTIFIER_LENGTH (to_be_found) + 1);
6936
6937 while (1)
6938 {
6939 tree left;
6940
6941 QUALIFIED_P (to_be_found) = 1;
6942 load_class (to_be_found, 0);
6943 error_found =
6944 check_pkg_class_access (to_be_found, TREE_PURPOSE (import), true, NULL_TREE);
6945
6946 /* We found it, we can bail out */
6947 if (IDENTIFIER_CLASS_VALUE (to_be_found))
6948 {
6949 check_deprecation (TREE_PURPOSE (import),
6950 IDENTIFIER_CLASS_VALUE (to_be_found));
6951 break;
6952 }
6953
6954 /* We haven't found it. Maybe we're trying to access an
6955 inner class. The only way for us to know is to try again
6956 after having dropped a qualifier. If we can't break it further,
6957 we have an error. */
6958 if (split_qualified_name (&left, NULL, to_be_found))
6959 break;
6960
6961 to_be_found = left;
6962 }
6963 if (!IDENTIFIER_CLASS_VALUE (to_be_found))
6964 {
6965 parse_error_context (TREE_PURPOSE (import),
6966 "Class or interface %qs not found in import",
6967 original_name);
6968 error_found = 1;
6969 }
6970
6971 free (original_name);
6972 if (error_found)
6973 return 1;
6974 }
6975 return 0;
6976 }
6977
6978 /* Possibly find and mark a class imported by a single-type import
6979 statement. */
6980
6981 static void
6982 find_in_imports (tree enclosing_type, tree class_type)
6983 {
6984 tree import;
6985 if (enclosing_type && TYPE_IMPORT_LIST (enclosing_type))
6986 import = TYPE_IMPORT_LIST (enclosing_type);
6987 else
6988 import = ctxp->import_list;
6989
6990 while (import)
6991 {
6992 if (TREE_VALUE (import) == TYPE_NAME (class_type))
6993 {
6994 TYPE_NAME (class_type) = EXPR_WFL_NODE (TREE_PURPOSE (import));
6995 QUALIFIED_P (TYPE_NAME (class_type)) = 1;
6996 return;
6997 }
6998 import = TREE_CHAIN (import);
6999 }
7000 }
7001
7002 static int
7003 note_possible_classname (const char *name, int len)
7004 {
7005 tree node;
7006 if (len > 5 && strncmp (&name [len-5], ".java", 5) == 0)
7007 len = len - 5;
7008 else if (len > 6 && strncmp (&name [len-6], ".class", 6) == 0)
7009 len = len - 6;
7010 else
7011 return 0;
7012 node = ident_subst (name, len, "", '/', '.', "");
7013 IS_A_CLASSFILE_NAME (node) = 1; /* Or soon to be */
7014 QUALIFIED_P (node) = strchr (name, '/') ? 1 : 0;
7015 return 1;
7016 }
7017
7018 /* Read a import directory, gathering potential match for further type
7019 references. Indifferently reads a filesystem or a ZIP archive
7020 directory. */
7021
7022 static void
7023 read_import_dir (tree wfl)
7024 {
7025 tree package_id = EXPR_WFL_NODE (wfl);
7026 const char *package_name = IDENTIFIER_POINTER (package_id);
7027 int package_length = IDENTIFIER_LENGTH (package_id);
7028 DIR *dirp = NULL;
7029 JCF *saved_jcf = current_jcf;
7030
7031 int found = 0;
7032 int k;
7033 void *entry;
7034 struct buffer filename[1];
7035
7036 if (IS_AN_IMPORT_ON_DEMAND_P (package_id))
7037 return;
7038 IS_AN_IMPORT_ON_DEMAND_P (package_id) = 1;
7039
7040 BUFFER_INIT (filename);
7041 buffer_grow (filename, package_length + 100);
7042
7043 for (entry = jcf_path_start (); entry != NULL; entry = jcf_path_next (entry))
7044 {
7045 const char *entry_name = jcf_path_name (entry);
7046 int entry_length = strlen (entry_name);
7047 if (jcf_path_is_zipfile (entry))
7048 {
7049 ZipFile *zipf;
7050 buffer_grow (filename, entry_length);
7051 memcpy (filename->data, entry_name, entry_length - 1);
7052 filename->data[entry_length-1] = '\0';
7053 zipf = opendir_in_zip ((const char *) filename->data, jcf_path_is_system (entry));
7054 if (zipf == NULL)
7055 error ("malformed .zip archive in CLASSPATH: %s", entry_name);
7056 else
7057 {
7058 ZipDirectory *zipd = (ZipDirectory *) zipf->central_directory;
7059 BUFFER_RESET (filename);
7060 for (k = 0; k < package_length; k++)
7061 {
7062 char ch = package_name[k];
7063 *filename->ptr++ = ch == '.' ? '/' : ch;
7064 }
7065 *filename->ptr++ = '/';
7066
7067 for (k = 0; k < zipf->count; k++, zipd = ZIPDIR_NEXT (zipd))
7068 {
7069 const char *current_entry = ZIPDIR_FILENAME (zipd);
7070 int current_entry_len = zipd->filename_length;
7071
7072 if (current_entry_len >= BUFFER_LENGTH (filename)
7073 && strncmp ((const char *) filename->data, current_entry,
7074 BUFFER_LENGTH (filename)) != 0)
7075 continue;
7076 found |= note_possible_classname (current_entry,
7077 current_entry_len);
7078 }
7079 }
7080 }
7081 else
7082 {
7083 BUFFER_RESET (filename);
7084 buffer_grow (filename, entry_length + package_length + 4);
7085 strcpy ((char *) filename->data, entry_name);
7086 filename->ptr = filename->data + entry_length;
7087 for (k = 0; k < package_length; k++)
7088 {
7089 char ch = package_name[k];
7090 *filename->ptr++ = ch == '.' ? '/' : ch;
7091 }
7092 *filename->ptr = '\0';
7093
7094 dirp = opendir ((const char *) filename->data);
7095 if (dirp == NULL)
7096 continue;
7097 *filename->ptr++ = '/';
7098 for (;;)
7099 {
7100 int len;
7101 const char *d_name;
7102 struct dirent *direntp = readdir (dirp);
7103 if (!direntp)
7104 break;
7105 d_name = direntp->d_name;
7106 len = strlen (direntp->d_name);
7107 buffer_grow (filename, len+1);
7108 strcpy ((char *) filename->ptr, d_name);
7109 found |= note_possible_classname ((const char *) filename->data + entry_length,
7110 package_length+len+1);
7111 }
7112 if (dirp)
7113 closedir (dirp);
7114 }
7115 }
7116
7117 free (filename->data);
7118
7119 /* Here we should have a unified way of retrieving an entry, to be
7120 indexed. */
7121 if (!found)
7122 {
7123 static int first = 1;
7124 if (first)
7125 {
7126 error ("Can't find default package %qs. Check the CLASSPATH environment variable and the access to the archives", package_name);
7127 java_error_count++;
7128 first = 0;
7129 }
7130 else
7131 parse_error_context (wfl, "Package %qs not found in import",
7132 package_name);
7133 current_jcf = saved_jcf;
7134 return;
7135 }
7136 current_jcf = saved_jcf;
7137 }
7138
7139 /* Possibly find a type in the import on demands specified
7140 types. Returns 1 if an error occurred, 0 otherwise. Run through the
7141 entire list, to detected potential double definitions. */
7142
7143 static int
7144 find_in_imports_on_demand (tree enclosing_type, tree class_type)
7145 {
7146 tree class_type_name = TYPE_NAME (class_type);
7147 tree cl = NULL_TREE;
7148 int seen_once = -1; /* -1 when not set, 1 if seen once, >1 otherwise. */
7149 int to_return = -1; /* -1 when not set, 0 or 1 otherwise */
7150 tree node;
7151 tree import;
7152
7153 if (enclosing_type && TYPE_IMPORT_DEMAND_LIST (enclosing_type))
7154 import = TYPE_IMPORT_DEMAND_LIST (enclosing_type);
7155 else
7156 import = ctxp->import_demand_list;
7157
7158 for (; import; import = TREE_CHAIN (import))
7159 {
7160 location_t saved_location = input_location;
7161 int access_check;
7162 const char *id_name;
7163 tree decl, type_name_copy;
7164
7165 obstack_grow (&temporary_obstack,
7166 IDENTIFIER_POINTER (EXPR_WFL_NODE (TREE_PURPOSE (import))),
7167 IDENTIFIER_LENGTH (EXPR_WFL_NODE (TREE_PURPOSE (import))));
7168 obstack_1grow (&temporary_obstack, '.');
7169 obstack_grow0 (&temporary_obstack,
7170 IDENTIFIER_POINTER (class_type_name),
7171 IDENTIFIER_LENGTH (class_type_name));
7172 id_name = obstack_finish (&temporary_obstack);
7173
7174 if (! (node = maybe_get_identifier (id_name)))
7175 continue;
7176
7177 /* Setup input_line so that it refers to the line of the import (in
7178 case we parse a class file and encounter errors */
7179 #ifdef USE_MAPPED_LOCATION
7180 input_location = EXPR_LOCATION (TREE_PURPOSE (import));
7181 #else
7182 input_line = EXPR_WFL_LINENO (TREE_PURPOSE (import));
7183 #endif
7184
7185 type_name_copy = TYPE_NAME (class_type);
7186 TYPE_NAME (class_type) = node;
7187 QUALIFIED_P (node) = 1;
7188 decl = IDENTIFIER_CLASS_VALUE (node);
7189 access_check = -1;
7190 /* If there is no DECL set for the class or if the class isn't
7191 loaded and not seen in source yet, then load */
7192 if (!decl || ! CLASS_LOADED_P (TREE_TYPE (decl)))
7193 {
7194 load_class (node, 0);
7195 decl = IDENTIFIER_CLASS_VALUE (node);
7196 }
7197 if (decl && ! INNER_CLASS_P (TREE_TYPE (decl)))
7198 access_check = check_pkg_class_access (node, TREE_PURPOSE (import),
7199 false, NULL_TREE);
7200 else
7201 /* 6.6.1: Inner classes are subject to member access rules. */
7202 access_check = 0;
7203
7204 input_location = saved_location;
7205
7206 /* If the loaded class is not accessible or couldn't be loaded,
7207 we restore the original TYPE_NAME and process the next
7208 import. */
7209 if (access_check || !decl)
7210 {
7211 TYPE_NAME (class_type) = type_name_copy;
7212 continue;
7213 }
7214
7215 /* If the loaded class is accessible, we keep a tab on it to
7216 detect and report multiple inclusions. */
7217 if (IS_A_CLASSFILE_NAME (node))
7218 {
7219 if (seen_once < 0)
7220 {
7221 cl = TREE_PURPOSE (import);
7222 seen_once = 1;
7223 }
7224 else if (seen_once >= 0)
7225 {
7226 tree location = (cl ? cl : TREE_PURPOSE (import));
7227 tree package = (cl ? EXPR_WFL_NODE (cl) :
7228 EXPR_WFL_NODE (TREE_PURPOSE (import)));
7229 seen_once++;
7230 parse_error_context
7231 (location,
7232 "Type %qs also potentially defined in package %qs",
7233 IDENTIFIER_POINTER (TYPE_NAME (class_type)),
7234 IDENTIFIER_POINTER (package));
7235 }
7236 }
7237 to_return = access_check;
7238 }
7239
7240 if (seen_once == 1)
7241 return to_return;
7242 else
7243 return (seen_once < 0 ? 0 : seen_once); /* It's ok not to have found */
7244 }
7245
7246 static tree
7247 resolve_package (tree pkg, tree *next, tree *type_name)
7248 {
7249 tree current;
7250 tree decl = NULL_TREE;
7251 *type_name = NULL_TREE;
7252
7253 /* The trick is to determine when the package name stops and were
7254 the name of something contained in the package starts. Then we
7255 return a fully qualified name of what we want to get. */
7256
7257 *next = EXPR_WFL_QUALIFICATION (pkg);
7258
7259 /* Try to progressively construct a type name */
7260 if (TREE_CODE (pkg) == EXPR_WITH_FILE_LOCATION)
7261 for (current = EXPR_WFL_QUALIFICATION (pkg);
7262 current; current = TREE_CHAIN (current))
7263 {
7264 /* If we don't have what we're expecting, exit now. TYPE_NAME
7265 will be null and the error caught later. */
7266 if (TREE_CODE (QUAL_WFL (current)) != EXPR_WITH_FILE_LOCATION)
7267 break;
7268 *type_name =
7269 merge_qualified_name (*type_name, EXPR_WFL_NODE (QUAL_WFL (current)));
7270 if ((decl = resolve_no_layout (*type_name, NULL_TREE)))
7271 {
7272 /* resolve_package should be used in a loop, hence we
7273 point at this one to naturally process the next one at
7274 the next iteration. */
7275 *next = current;
7276 break;
7277 }
7278 }
7279 return decl;
7280 }
7281
7282 /* Check accessibility of inner class DECL, from the context ENCLOSING_DECL,
7283 according to member access rules. */
7284
7285 static bool
7286 inner_class_accessible (tree decl, tree enclosing_decl)
7287 {
7288 tree enclosing_decl_type;
7289
7290 enclosing_decl_type = TREE_TYPE (enclosing_decl);
7291
7292 if (CLASS_PRIVATE (decl))
7293 {
7294 /* Access is permitted only within the body of the top-level
7295 class in which DECL is declared. */
7296 tree top_level = decl;
7297 while (DECL_CONTEXT (top_level))
7298 top_level = DECL_CONTEXT (top_level);
7299 while (DECL_CONTEXT (enclosing_decl))
7300 enclosing_decl = DECL_CONTEXT (enclosing_decl);
7301 if (top_level == enclosing_decl)
7302 return true;
7303 }
7304 else if (CLASS_PROTECTED (decl))
7305 {
7306 tree decl_context;
7307 /* Access is permitted from within the same package... */
7308 if (in_same_package (decl, enclosing_decl))
7309 return true;
7310
7311 /* ... or from within the body of a subtype of the context in which
7312 DECL is declared. */
7313 decl_context = DECL_CONTEXT (decl);
7314 while (enclosing_decl)
7315 {
7316 if (CLASS_INTERFACE (decl))
7317 {
7318 if (interface_of_p (TREE_TYPE (decl_context),
7319 enclosing_decl_type))
7320 return true;
7321 }
7322 else
7323 {
7324 /* Eww. The order of the arguments is different!! */
7325 if (inherits_from_p (enclosing_decl_type,
7326 TREE_TYPE (decl_context)))
7327 return true;
7328 }
7329 enclosing_decl = DECL_CONTEXT (enclosing_decl);
7330 }
7331 }
7332 else if (! CLASS_PUBLIC (decl))
7333 {
7334 /* Access is permitted only from within the same package as DECL. */
7335 if (in_same_package (decl, enclosing_decl))
7336 return true;
7337 }
7338 else
7339 /* Class is public. */
7340 return true;
7341
7342 return false;
7343 }
7344
7345 /* Check accessibility of inner classes according to member access rules.
7346 DECL is the inner class, ENCLOSING_DECL is the class from which the
7347 access is being attempted. */
7348
7349 static void
7350 check_inner_class_access (tree decl, tree enclosing_decl, tree cl)
7351 {
7352 const char *access;
7353
7354 /* We don't issue an error message when CL is null. CL can be null
7355 as a result of processing a JDEP crafted by source_start_java_method
7356 for the purpose of patching its parm decl. But the error would
7357 have been already trapped when fixing the method's signature.
7358 DECL can also be NULL in case of earlier errors. */
7359 if (!decl || !cl)
7360 return;
7361
7362 if (inner_class_accessible (decl, enclosing_decl))
7363 return;
7364
7365 if (CLASS_PRIVATE (decl))
7366 access = "private";
7367 else if (CLASS_PROTECTED (decl))
7368 access = "protected";
7369 else
7370 access = "non-public";
7371
7372 parse_error_context (cl, "Nested %s %s is %s; cannot be accessed from here",
7373 (CLASS_INTERFACE (decl) ? "interface" : "class"),
7374 lang_printable_name (decl, 2), access);
7375 }
7376
7377 /* Accessibility check for top-level classes. If CLASS_NAME is in a
7378 foreign package, it must be PUBLIC. Return 0 if no access
7379 violations were found, 1 otherwise. If VERBOSE is true and an error
7380 was found, it is reported and accounted for. If CL is NULL then
7381 look it up with THIS_DECL. */
7382
7383 static int
7384 check_pkg_class_access (tree class_name, tree cl, bool verbose, tree this_decl)
7385 {
7386 tree type;
7387
7388 if (!IDENTIFIER_CLASS_VALUE (class_name))
7389 return 0;
7390
7391 if (!(type = TREE_TYPE (IDENTIFIER_CLASS_VALUE (class_name))))
7392 return 0;
7393
7394 if (!CLASS_PUBLIC (TYPE_NAME (type)))
7395 {
7396 /* Access to a private class within the same package is
7397 allowed. */
7398 tree l, r;
7399 split_qualified_name (&l, &r, class_name);
7400 if (!QUALIFIED_P (class_name) && !ctxp->package)
7401 /* Both in the empty package. */
7402 return 0;
7403 if (l == ctxp->package)
7404 /* Both in the same package. */
7405 return 0;
7406
7407 if (verbose)
7408 parse_error_context
7409 (cl == NULL ? lookup_cl (this_decl): cl,
7410 "Can't access %s %qs. Only public classes and interfaces in other packages can be accessed",
7411 (CLASS_INTERFACE (TYPE_NAME (type)) ? "interface" : "class"),
7412 IDENTIFIER_POINTER (class_name));
7413 return 1;
7414 }
7415 return 0;
7416 }
7417
7418 /* Local variable declaration. */
7419
7420 static void
7421 declare_local_variables (int modifier, tree type, tree vlist)
7422 {
7423 tree decl, current, saved_type;
7424 tree type_wfl = NULL_TREE;
7425 int must_chain = 0;
7426 int final_p = 0;
7427
7428 /* Push a new block if statements were seen between the last time we
7429 pushed a block and now. Keep a count of blocks to close */
7430 if (BLOCK_EXPR_BODY (GET_CURRENT_BLOCK (current_function_decl)))
7431 {
7432 tree b = enter_block ();
7433 BLOCK_IS_IMPLICIT (b) = 1;
7434 }
7435
7436 if (modifier)
7437 {
7438 size_t i;
7439 for (i = 0; i < ARRAY_SIZE (ctxp->modifier_ctx); i++)
7440 if (1 << i & modifier)
7441 break;
7442 if (modifier == ACC_FINAL)
7443 final_p = 1;
7444 else
7445 {
7446 parse_error_context
7447 (ctxp->modifier_ctx [i],
7448 "Only %<final%> is allowed as a local variables modifier");
7449 return;
7450 }
7451 }
7452
7453 /* Obtain an incomplete type if TYPE is not complete. TYPE_WFL will
7454 hold the TYPE value if a new incomplete has to be created (as
7455 opposed to being found already existing and reused). */
7456 SET_TYPE_FOR_RESOLUTION (type, type_wfl, must_chain);
7457
7458 /* If TYPE is fully resolved and we don't have a reference, make one */
7459 PROMOTE_RECORD_IF_COMPLETE (type, must_chain);
7460
7461 /* Go through all the declared variables */
7462 for (current = vlist, saved_type = type; current;
7463 current = TREE_CHAIN (current), type = saved_type)
7464 {
7465 tree other, real_type;
7466 tree wfl = TREE_PURPOSE (current);
7467 tree name = EXPR_WFL_NODE (wfl);
7468 tree init = TREE_VALUE (current);
7469
7470 /* Process NAME, as it may specify extra dimension(s) for it */
7471 type = build_array_from_name (type, type_wfl, name, &name);
7472
7473 /* Variable redefinition check */
7474 if ((other = lookup_name_in_blocks (name)))
7475 {
7476 variable_redefinition_error (wfl, name, TREE_TYPE (other),
7477 DECL_SOURCE_LINE (other));
7478 continue;
7479 }
7480
7481 /* Type adjustment. We may have just readjusted TYPE because
7482 the variable specified more dimensions. Make sure we have
7483 a reference if we can and don't have one already. */
7484 PROMOTE_RECORD_IF_COMPLETE (type, must_chain);
7485
7486 real_type = GET_REAL_TYPE (type);
7487 /* Never layout this decl. This will be done when its scope
7488 will be entered */
7489 decl = build_decl (VAR_DECL, name, real_type);
7490 MAYBE_CREATE_VAR_LANG_DECL_SPECIFIC (decl);
7491 DECL_FINAL (decl) = final_p;
7492 BLOCK_CHAIN_DECL (decl);
7493
7494 /* Don't try to use an INIT statement when an error was found */
7495 if (init && java_error_count)
7496 init = NULL_TREE;
7497
7498 /* Remember it if this is an initialized-upon-declaration final
7499 variable. */
7500 if (init && final_p)
7501 {
7502 DECL_LOCAL_FINAL_IUD (decl) = 1;
7503 }
7504
7505 /* Add the initialization function to the current function's code */
7506 if (init)
7507 {
7508 /* Name might have been readjusted */
7509 EXPR_WFL_NODE (TREE_OPERAND (init, 0)) = name;
7510 MODIFY_EXPR_FROM_INITIALIZATION_P (init) = 1;
7511 java_method_add_stmt (current_function_decl,
7512 build_debugable_stmt (EXPR_WFL_LINECOL (init),
7513 init));
7514 }
7515
7516 /* Setup dependency the type of the decl */
7517 if (must_chain)
7518 {
7519 jdep *dep;
7520 register_incomplete_type (JDEP_VARIABLE, type_wfl, decl, type);
7521 dep = CLASSD_LAST (ctxp->classd_list);
7522 JDEP_GET_PATCH (dep) = &TREE_TYPE (decl);
7523 }
7524 }
7525 SOURCE_FRONTEND_DEBUG (("Defined locals"));
7526 }
7527
7528 /* Called during parsing. Build decls from argument list. */
7529
7530 static void
7531 source_start_java_method (tree fndecl)
7532 {
7533 tree tem;
7534 tree parm_decl;
7535 int i;
7536
7537 if (!fndecl)
7538 return;
7539
7540 current_function_decl = fndecl;
7541
7542 /* New scope for the function */
7543 enter_block ();
7544 for (tem = TYPE_ARG_TYPES (TREE_TYPE (fndecl)), i = 0;
7545 tem != end_params_node; tem = TREE_CHAIN (tem), i++)
7546 {
7547 tree type = TREE_VALUE (tem);
7548 tree name = TREE_PURPOSE (tem);
7549
7550 /* If type is incomplete. Create an incomplete decl and ask for
7551 the decl to be patched later */
7552 if (INCOMPLETE_TYPE_P (type))
7553 {
7554 jdep *jdep;
7555 tree real_type = GET_REAL_TYPE (type);
7556 parm_decl = build_decl (PARM_DECL, name, real_type);
7557 type = obtain_incomplete_type (type);
7558 register_incomplete_type (JDEP_PARM, NULL_TREE, NULL_TREE, type);
7559 jdep = CLASSD_LAST (ctxp->classd_list);
7560 JDEP_MISC (jdep) = name;
7561 JDEP_GET_PATCH (jdep) = &TREE_TYPE (parm_decl);
7562 }
7563 else
7564 parm_decl = build_decl (PARM_DECL, name, type);
7565
7566 /* Remember if a local variable was declared final (via its
7567 TREE_LIST of type/name.) Set DECL_FINAL accordingly. */
7568 if (ARG_FINAL_P (tem))
7569 {
7570 MAYBE_CREATE_VAR_LANG_DECL_SPECIFIC (parm_decl);
7571 DECL_FINAL (parm_decl) = 1;
7572 }
7573
7574 BLOCK_CHAIN_DECL (parm_decl);
7575 }
7576 tem = BLOCK_EXPR_DECLS (DECL_FUNCTION_BODY (current_function_decl));
7577 BLOCK_EXPR_DECLS (DECL_FUNCTION_BODY (current_function_decl)) =
7578 nreverse (tem);
7579 DECL_ARG_SLOT_COUNT (current_function_decl) = i;
7580 DECL_MAX_LOCALS (current_function_decl) = i;
7581 }
7582
7583 /* Called during parsing. Creates an artificial method declaration. */
7584
7585 static tree
7586 create_artificial_method (tree class, int flags, tree type,
7587 tree name, tree args)
7588 {
7589 tree mdecl;
7590 location_t save_location = input_location;
7591
7592 input_location = DECL_SOURCE_LOCATION (TYPE_NAME (class));
7593 mdecl = make_node (FUNCTION_TYPE);
7594 TREE_TYPE (mdecl) = type;
7595 TYPE_ARG_TYPES (mdecl) = args;
7596 /* We used to compute the signature of MDECL here and then use
7597 add_method(), but that failed because our caller might modify
7598 the type of the returned method, which trashes the cache in
7599 get_type_from_signature(). */
7600 mdecl = add_method_1 (class, flags, name, mdecl);
7601 input_location = save_location;
7602 DECL_ARTIFICIAL (mdecl) = 1;
7603 return mdecl;
7604 }
7605
7606 /* Starts the body if an artificial method. */
7607
7608 static void
7609 start_artificial_method_body (tree mdecl)
7610 {
7611 #ifdef USE_MAPPED_LOCATION
7612 DECL_SOURCE_LOCATION (mdecl) = ctxp->file_start_location;
7613 DECL_FUNCTION_LAST_LINE (mdecl) = ctxp->file_start_location;
7614 #else
7615 DECL_SOURCE_LINE (mdecl) = 1;
7616 DECL_FUNCTION_LAST_LINE (mdecl) = 1;
7617 #endif
7618 source_start_java_method (mdecl);
7619 enter_block ();
7620 }
7621
7622 static void
7623 end_artificial_method_body (tree mdecl)
7624 {
7625 /* exit_block modifies DECL_FUNCTION_BODY (current_function_decl).
7626 It has to be evaluated first. (if mdecl is current_function_decl,
7627 we have an undefined behavior if no temporary variable is used.) */
7628 tree b = exit_block ();
7629 BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (mdecl)) = b;
7630 exit_block ();
7631 }
7632
7633 /* Dump a tree of some kind. This is a convenience wrapper for the
7634 dump_* functions in tree-dump.c. */
7635 static void
7636 dump_java_tree (enum tree_dump_index phase, tree t)
7637 {
7638 FILE *stream;
7639 int flags;
7640
7641 stream = dump_begin (phase, &flags);
7642 flags |= TDF_SLIM;
7643 if (stream)
7644 {
7645 dump_node (t, flags, stream);
7646 dump_end (phase, stream);
7647 }
7648 }
7649
7650 /* Terminate a function and expand its body. */
7651
7652 static void
7653 source_end_java_method (void)
7654 {
7655 tree fndecl = current_function_decl;
7656
7657 if (!fndecl)
7658 return;
7659
7660 java_parser_context_save_global ();
7661 #ifdef USE_MAPPED_LOCATION
7662 input_location = ctxp->last_ccb_indent1;
7663 #else
7664 input_line = ctxp->last_ccb_indent1;
7665 #endif
7666
7667 /* Turn function bodies with only a NOP expr null, so they don't get
7668 generated at all and we won't get warnings when using the -W
7669 -Wall flags. */
7670 if (IS_EMPTY_STMT (BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (fndecl))))
7671 BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (fndecl)) = NULL_TREE;
7672
7673 if (BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (fndecl))
7674 && ! flag_emit_class_files)
7675 finish_method (fndecl);
7676
7677 current_function_decl = NULL_TREE;
7678 java_parser_context_restore_global ();
7679 current_function_decl = NULL_TREE;
7680 }
7681
7682 /* Record EXPR in the current function block. Complements compound
7683 expression second operand if necessary. */
7684
7685 tree
7686 java_method_add_stmt (tree fndecl, tree expr)
7687 {
7688 if (!GET_CURRENT_BLOCK (fndecl))
7689 return NULL_TREE;
7690 return add_stmt_to_block (GET_CURRENT_BLOCK (fndecl), NULL_TREE, expr);
7691 }
7692
7693 static tree
7694 add_stmt_to_block (tree b, tree type, tree stmt)
7695 {
7696 tree body = BLOCK_EXPR_BODY (b), c;
7697
7698 if (java_error_count)
7699 return body;
7700
7701 if ((c = add_stmt_to_compound (body, type, stmt)) == body)
7702 return body;
7703
7704 BLOCK_EXPR_BODY (b) = c;
7705 TREE_SIDE_EFFECTS (c) = 1;
7706 return c;
7707 }
7708
7709 /* Lays out the methods for the classes seen so far. */
7710
7711 void
7712 java_layout_seen_class_methods (void)
7713 {
7714 tree previous_list = all_class_list;
7715 tree end = NULL_TREE;
7716 tree current;
7717
7718 while (1)
7719 {
7720 for (current = previous_list;
7721 current != end; current = TREE_CHAIN (current))
7722 {
7723 tree decl = TREE_VALUE (current);
7724 tree cls = TREE_TYPE (decl);
7725
7726 input_location = DECL_SOURCE_LOCATION (decl);
7727
7728 if (! CLASS_LOADED_P (cls))
7729 load_class (cls, 0);
7730
7731 layout_class_methods (cls);
7732 }
7733
7734 /* Note that new classes might have been added while laying out
7735 methods, changing the value of all_class_list. */
7736
7737 if (previous_list != all_class_list)
7738 {
7739 end = previous_list;
7740 previous_list = all_class_list;
7741 }
7742 else
7743 break;
7744 }
7745 }
7746
7747 static GTY(()) tree stop_reordering;
7748 void
7749 java_reorder_fields (void)
7750 {
7751 tree current;
7752
7753 for (current = gclass_list; current; current = TREE_CHAIN (current))
7754 {
7755 output_class = current_class = TREE_TYPE (TREE_VALUE (current));
7756
7757 if (current_class == stop_reordering)
7758 break;
7759
7760 /* Reverse the fields, but leave the dummy field in front.
7761 Fields are already ordered for Object and Class */
7762 if (TYPE_FIELDS (current_class) && current_class != object_type_node
7763 && current_class != class_type_node)
7764 {
7765 /* If the dummy field is there, reverse the right fields and
7766 just layout the type for proper fields offset */
7767 if (!DECL_NAME (TYPE_FIELDS (current_class)))
7768 {
7769 tree fields = TYPE_FIELDS (current_class);
7770 TREE_CHAIN (fields) = nreverse (TREE_CHAIN (fields));
7771 TYPE_SIZE (current_class) = NULL_TREE;
7772 }
7773 /* We don't have a dummy field, we need to layout the class,
7774 after having reversed the fields */
7775 else
7776 {
7777 TYPE_FIELDS (current_class) =
7778 nreverse (TYPE_FIELDS (current_class));
7779 TYPE_SIZE (current_class) = NULL_TREE;
7780 }
7781 }
7782 }
7783 /* There are cases were gclass_list will be empty. */
7784 if (gclass_list)
7785 stop_reordering = TREE_TYPE (TREE_VALUE (gclass_list));
7786 }
7787
7788 /* Layout the methods of all classes loaded in one way or another.
7789 Check methods of source parsed classes. Then reorder the
7790 fields and layout the classes or the type of all source parsed
7791 classes */
7792
7793 void
7794 java_layout_classes (void)
7795 {
7796 tree current;
7797 int save_error_count = java_error_count;
7798
7799 /* Layout the methods of all classes seen so far */
7800 java_layout_seen_class_methods ();
7801 java_parse_abort_on_error ();
7802 all_class_list = NULL_TREE;
7803
7804 /* Then check the methods of all parsed classes */
7805 for (current = gclass_list; current; current = TREE_CHAIN (current))
7806 if (CLASS_FROM_SOURCE_P (TREE_TYPE (TREE_VALUE (current))))
7807 java_check_methods (TREE_VALUE (current));
7808 java_parse_abort_on_error ();
7809
7810 for (current = gclass_list; current; current = TREE_CHAIN (current))
7811 {
7812 output_class = current_class = TREE_TYPE (TREE_VALUE (current));
7813 layout_class (current_class);
7814
7815 /* Error reported by the caller */
7816 if (java_error_count)
7817 return;
7818 }
7819
7820 /* We might have reloaded classes durign the process of laying out
7821 classes for code generation. We must layout the methods of those
7822 late additions, as constructor checks might use them */
7823 java_layout_seen_class_methods ();
7824 java_parse_abort_on_error ();
7825 }
7826
7827 /* Expand methods in the current set of classes remembered for
7828 generation. */
7829
7830 static void
7831 java_complete_expand_classes (void)
7832 {
7833 tree current;
7834
7835 for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
7836 if (!INNER_CLASS_DECL_P (current))
7837 java_complete_expand_class (current);
7838 }
7839
7840 /* Expand the methods found in OUTER, starting first by OUTER's inner
7841 classes, if any. */
7842
7843 static void
7844 java_complete_expand_class (tree outer)
7845 {
7846 tree inner_list;
7847
7848 /* We need to go after all inner classes and start expanding them,
7849 starting with most nested ones. We have to do that because nested
7850 classes might add functions to outer classes */
7851
7852 for (inner_list = DECL_INNER_CLASS_LIST (outer);
7853 inner_list; inner_list = TREE_CHAIN (inner_list))
7854 java_complete_expand_class (TREE_PURPOSE (inner_list));
7855
7856 java_complete_expand_methods (outer);
7857 }
7858
7859 /* Expand methods registered in CLASS_DECL. The general idea is that
7860 we expand regular methods first. This allows us get an estimate on
7861 how outer context local alias fields are really used so we can add
7862 to the constructor just enough code to initialize them properly (it
7863 also lets us generate finit$ correctly.) Then we expand the
7864 constructors and then <clinit>. */
7865
7866 static void
7867 java_complete_expand_methods (tree class_decl)
7868 {
7869 tree clinit, decl, first_decl;
7870
7871 output_class = current_class = TREE_TYPE (class_decl);
7872
7873 /* Pre-expand <clinit> to figure whether we really need it or
7874 not. If we do need it, we pre-expand the static fields so they're
7875 ready to be used somewhere else. <clinit> will be fully expanded
7876 after we processed the constructors. */
7877 first_decl = TYPE_METHODS (current_class);
7878 clinit = maybe_generate_pre_expand_clinit (current_class);
7879
7880 /* Then generate finit$ (if we need to) because constructors will
7881 try to use it.*/
7882 if (TYPE_FINIT_STMT_LIST (current_class))
7883 java_complete_expand_method (generate_finit (current_class));
7884
7885 /* Then generate instinit$ (if we need to) because constructors will
7886 try to use it. */
7887 if (TYPE_II_STMT_LIST (current_class))
7888 java_complete_expand_method (generate_instinit (current_class));
7889
7890 /* Now do the constructors */
7891 for (decl = first_decl ; !java_error_count && decl; decl = TREE_CHAIN (decl))
7892 {
7893 if (!DECL_CONSTRUCTOR_P (decl))
7894 continue;
7895 java_complete_expand_method (decl);
7896 }
7897
7898 /* First, do the ordinary methods. */
7899 for (decl = first_decl; decl; decl = TREE_CHAIN (decl))
7900 {
7901 /* Ctors aren't part of this batch. */
7902 if (DECL_CONSTRUCTOR_P (decl) || DECL_CLINIT_P (decl))
7903 continue;
7904
7905 /* Skip abstract or native methods -- but do handle native
7906 methods when generating JNI stubs. */
7907 if (METHOD_ABSTRACT (decl) || (! flag_jni && METHOD_NATIVE (decl)))
7908 {
7909 DECL_FUNCTION_BODY (decl) = NULL_TREE;
7910 continue;
7911 }
7912
7913 if (METHOD_NATIVE (decl))
7914 {
7915 tree body;
7916 current_function_decl = decl;
7917 body = build_jni_stub (decl);
7918 BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (decl)) = body;
7919 }
7920
7921 java_complete_expand_method (decl);
7922 }
7923
7924 /* If there is indeed a <clinit>, fully expand it now */
7925 if (clinit)
7926 {
7927 /* Prevent the use of `this' inside <clinit> */
7928 ctxp->explicit_constructor_p = 1;
7929 java_complete_expand_method (clinit);
7930 ctxp->explicit_constructor_p = 0;
7931 }
7932
7933 /* We might have generated a class$ that we now want to expand */
7934 if (TYPE_DOT_CLASS (current_class))
7935 java_complete_expand_method (TYPE_DOT_CLASS (current_class));
7936
7937 /* Now verify constructor circularity (stop after the first one we
7938 prove wrong.) */
7939 if (!CLASS_INTERFACE (class_decl))
7940 for (decl = TYPE_METHODS (current_class); decl; decl = TREE_CHAIN (decl))
7941 if (DECL_CONSTRUCTOR_P (decl)
7942 && verify_constructor_circularity (decl, decl))
7943 break;
7944 }
7945
7946 /* Attempt to create <clinit>. Pre-expand static fields so they can be
7947 safely used in some other methods/constructors. */
7948
7949 static tree
7950 maybe_generate_pre_expand_clinit (tree class_type)
7951 {
7952 tree current, mdecl;
7953
7954 if (!TYPE_CLINIT_STMT_LIST (class_type))
7955 return NULL_TREE;
7956
7957 /* Go through all static fields and pre expand them */
7958 for (current = TYPE_FIELDS (class_type); current;
7959 current = TREE_CHAIN (current))
7960 if (FIELD_STATIC (current))
7961 build_field_ref (NULL_TREE, class_type, DECL_NAME (current));
7962
7963 /* Then build the <clinit> method */
7964 mdecl = create_artificial_method (class_type, ACC_STATIC, void_type_node,
7965 clinit_identifier_node, end_params_node);
7966 layout_class_method (class_type, CLASSTYPE_SUPER (class_type),
7967 mdecl, NULL_TREE);
7968 start_artificial_method_body (mdecl);
7969
7970 /* We process the list of assignment we produced as the result of
7971 the declaration of initialized static field and add them as
7972 statement to the <clinit> method. */
7973 for (current = TYPE_CLINIT_STMT_LIST (class_type); current;
7974 current = TREE_CHAIN (current))
7975 {
7976 tree stmt = current;
7977 /* We build the assignment expression that will initialize the
7978 field to its value. There are strict rules on static
7979 initializers (8.5). FIXME */
7980 if (TREE_CODE (stmt) != BLOCK && !IS_EMPTY_STMT (stmt))
7981 stmt = build_debugable_stmt (EXPR_WFL_LINECOL (stmt), stmt);
7982 java_method_add_stmt (mdecl, stmt);
7983 }
7984
7985 end_artificial_method_body (mdecl);
7986
7987 /* Now we want to place <clinit> as the last method (because we need
7988 it at least for interface so that it doesn't interfere with the
7989 dispatch table based lookup. */
7990 if (TREE_CHAIN (TYPE_METHODS (class_type)))
7991 {
7992 current = TREE_CHAIN (TYPE_METHODS (class_type));
7993 TYPE_METHODS (class_type) = current;
7994
7995 while (TREE_CHAIN (current))
7996 current = TREE_CHAIN (current);
7997
7998 TREE_CHAIN (current) = mdecl;
7999 TREE_CHAIN (mdecl) = NULL_TREE;
8000 }
8001
8002 return mdecl;
8003 }
8004
8005 /* Analyzes a method body and look for something that isn't a
8006 MODIFY_EXPR with a constant value. */
8007
8008 static int
8009 analyze_clinit_body (tree this_class, tree bbody)
8010 {
8011 while (bbody)
8012 switch (TREE_CODE (bbody))
8013 {
8014 case BLOCK:
8015 bbody = BLOCK_EXPR_BODY (bbody);
8016 break;
8017
8018 case EXPR_WITH_FILE_LOCATION:
8019 bbody = EXPR_WFL_NODE (bbody);
8020 break;
8021
8022 case COMPOUND_EXPR:
8023 if (analyze_clinit_body (this_class, TREE_OPERAND (bbody, 0)))
8024 return 1;
8025 bbody = TREE_OPERAND (bbody, 1);
8026 break;
8027
8028 case MODIFY_EXPR:
8029 /* If we're generating to class file and we're dealing with an
8030 array initialization, we return 1 to keep <clinit> */
8031 if (TREE_CODE (TREE_OPERAND (bbody, 1)) == NEW_ARRAY_INIT
8032 && flag_emit_class_files)
8033 return 1;
8034
8035 /* There are a few cases where we're required to keep
8036 <clinit>:
8037 - If this is an assignment whose operand is not constant,
8038 - If this is an assignment to a non-initialized field,
8039 - If this field is not a member of the current class.
8040 */
8041 return (! TREE_CONSTANT (TREE_OPERAND (bbody, 1))
8042 || ! DECL_INITIAL (TREE_OPERAND (bbody, 0))
8043 || DECL_CONTEXT (TREE_OPERAND (bbody, 0)) != this_class);
8044
8045 default:
8046 return 1;
8047 }
8048 return 0;
8049 }
8050
8051
8052 /* See whether we could get rid of <clinit>. Criteria are: all static
8053 final fields have constant initial values and the body of <clinit>
8054 is empty. Return 1 if <clinit> was discarded, 0 otherwise. */
8055
8056 static int
8057 maybe_yank_clinit (tree mdecl)
8058 {
8059 tree type, current;
8060 tree fbody, bbody;
8061
8062 if (!DECL_CLINIT_P (mdecl))
8063 return 0;
8064
8065 /* If the body isn't empty, then we keep <clinit>. Note that if
8066 we're emitting classfiles, this isn't enough not to rule it
8067 out. */
8068 fbody = DECL_FUNCTION_BODY (mdecl);
8069 bbody = BLOCK_EXPR_BODY (fbody);
8070 if (bbody && bbody != error_mark_node)
8071 bbody = BLOCK_EXPR_BODY (bbody);
8072 else
8073 return 0;
8074 if (bbody && ! flag_emit_class_files && !IS_EMPTY_STMT (bbody))
8075 return 0;
8076
8077 type = DECL_CONTEXT (mdecl);
8078 current = TYPE_FIELDS (type);
8079
8080 for (current = (current ? TREE_CHAIN (current) : current);
8081 current; current = TREE_CHAIN (current))
8082 {
8083 tree f_init;
8084
8085 /* We're not interested in non-static fields. */
8086 if (!FIELD_STATIC (current))
8087 continue;
8088
8089 /* Nor in fields without initializers. */
8090 f_init = DECL_INITIAL (current);
8091 if (f_init == NULL_TREE)
8092 continue;
8093
8094 /* Anything that isn't String or a basic type is ruled out -- or
8095 if we know how to deal with it (when doing things natively) we
8096 should generated an empty <clinit> so that SUID are computed
8097 correctly. */
8098 if (! JSTRING_TYPE_P (TREE_TYPE (current))
8099 && ! JNUMERIC_TYPE_P (TREE_TYPE (current)))
8100 return 0;
8101
8102 if (! FIELD_FINAL (current) || ! TREE_CONSTANT (f_init))
8103 return 0;
8104 }
8105
8106 /* Now we analyze the method body and look for something that
8107 isn't a MODIFY_EXPR */
8108 if (bbody && !IS_EMPTY_STMT (bbody) && analyze_clinit_body (type, bbody))
8109 return 0;
8110
8111 /* Get rid of <clinit> in the class' list of methods */
8112 if (TYPE_METHODS (type) == mdecl)
8113 TYPE_METHODS (type) = TREE_CHAIN (mdecl);
8114 else
8115 for (current = TYPE_METHODS (type); current;
8116 current = TREE_CHAIN (current))
8117 if (TREE_CHAIN (current) == mdecl)
8118 {
8119 TREE_CHAIN (current) = TREE_CHAIN (mdecl);
8120 break;
8121 }
8122
8123 return 1;
8124 }
8125
8126 /* Install the argument from MDECL. Suitable to completion and
8127 expansion of mdecl's body. */
8128
8129 void
8130 start_complete_expand_method (tree mdecl)
8131 {
8132 tree tem;
8133
8134 pushlevel (1); /* Prepare for a parameter push */
8135 tem = BLOCK_EXPR_DECLS (DECL_FUNCTION_BODY (current_function_decl));
8136 DECL_ARGUMENTS (mdecl) = tem;
8137
8138 for (; tem; tem = TREE_CHAIN (tem))
8139 {
8140 /* TREE_CHAIN (tem) will change after pushdecl. */
8141 tree next = TREE_CHAIN (tem);
8142 tree type = TREE_TYPE (tem);
8143 if (targetm.calls.promote_prototypes (type)
8144 && TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node)
8145 && INTEGRAL_TYPE_P (type))
8146 type = integer_type_node;
8147 DECL_ARG_TYPE (tem) = type;
8148 layout_decl (tem, 0);
8149 pushdecl (tem);
8150 /* Re-install the next so that the list is kept and the loop
8151 advances. */
8152 TREE_CHAIN (tem) = next;
8153 }
8154 pushdecl_force_head (DECL_ARGUMENTS (mdecl));
8155 input_location = DECL_SOURCE_LOCATION (mdecl);
8156 build_result_decl (mdecl);
8157 }
8158
8159
8160 /* Complete and expand a method. */
8161
8162 static void
8163 java_complete_expand_method (tree mdecl)
8164 {
8165 tree fbody, block_body, exception_copy;
8166
8167 current_function_decl = mdecl;
8168 /* Fix constructors before expanding them */
8169 if (DECL_CONSTRUCTOR_P (mdecl))
8170 fix_constructors (mdecl);
8171
8172 /* Expand functions that have a body */
8173 if (!DECL_FUNCTION_BODY (mdecl))
8174 return;
8175
8176 fbody = DECL_FUNCTION_BODY (mdecl);
8177 block_body = BLOCK_EXPR_BODY (fbody);
8178 exception_copy = NULL_TREE;
8179
8180 current_function_decl = mdecl;
8181
8182 if (! quiet_flag)
8183 fprintf (stderr, " [%s.",
8184 lang_printable_name (DECL_CONTEXT (mdecl), 0));
8185 announce_function (mdecl);
8186 if (! quiet_flag)
8187 fprintf (stderr, "]");
8188
8189 /* Prepare the function for tree completion */
8190 start_complete_expand_method (mdecl);
8191
8192 /* Install the current this */
8193 current_this = (!METHOD_STATIC (mdecl) ?
8194 BLOCK_EXPR_DECLS (DECL_FUNCTION_BODY (mdecl)) : NULL_TREE);
8195
8196 /* Install exceptions thrown with `throws' */
8197 PUSH_EXCEPTIONS (DECL_FUNCTION_THROWS (mdecl));
8198
8199 if (block_body != NULL_TREE)
8200 {
8201 block_body = java_complete_tree (block_body);
8202
8203 /* Before we check initialization, attached all class initialization
8204 variable to the block_body */
8205 htab_traverse (DECL_FUNCTION_INIT_TEST_TABLE (mdecl),
8206 attach_init_test_initialization_flags, block_body);
8207
8208 if (! METHOD_NATIVE (mdecl))
8209 {
8210 check_for_initialization (block_body, mdecl);
8211
8212 /* Go through all the flags marking the initialization of
8213 static variables and see whether they're definitively
8214 assigned, in which case the type is remembered as
8215 definitively initialized in MDECL. */
8216 if (STATIC_CLASS_INIT_OPT_P ())
8217 {
8218 /* Always register the context as properly initialized in
8219 MDECL. This used with caution helps removing extra
8220 initialization of self. */
8221 if (METHOD_STATIC (mdecl))
8222 {
8223 *(htab_find_slot
8224 (DECL_FUNCTION_INITIALIZED_CLASS_TABLE (mdecl),
8225 DECL_CONTEXT (mdecl), INSERT)) = DECL_CONTEXT (mdecl);
8226 }
8227 }
8228 }
8229 ctxp->explicit_constructor_p = 0;
8230 }
8231
8232 BLOCK_EXPR_BODY (fbody) = block_body;
8233
8234 /* If we saw a return but couldn't evaluate it properly, we'll have
8235 an error_mark_node here. */
8236 if (block_body != error_mark_node
8237 && (block_body == NULL_TREE || CAN_COMPLETE_NORMALLY (block_body))
8238 && TREE_CODE (TREE_TYPE (TREE_TYPE (mdecl))) != VOID_TYPE)
8239 missing_return_error (current_function_decl);
8240
8241 /* See if we can get rid of <clinit> if MDECL happens to be <clinit> */
8242 maybe_yank_clinit (mdecl);
8243
8244 /* Pop the current level, with special measures if we found errors. */
8245 if (java_error_count)
8246 pushdecl_force_head (DECL_ARGUMENTS (mdecl));
8247 poplevel (1, 0, 1);
8248
8249 /* Pop the exceptions and sanity check */
8250 POP_EXCEPTIONS();
8251 if (currently_caught_type_list)
8252 abort ();
8253 }
8254
8255 /* For with each class for which there's code to generate. */
8256
8257 static void
8258 java_expand_method_bodies (tree class)
8259 {
8260 tree decl;
8261 for (decl = TYPE_METHODS (class); decl; decl = TREE_CHAIN (decl))
8262 {
8263 tree block;
8264
8265 if (! DECL_FUNCTION_BODY (decl))
8266 continue;
8267
8268 current_function_decl = decl;
8269
8270 block = BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (decl));
8271
8272 /* Save the function body for gimplify and inlining. */
8273 DECL_SAVED_TREE (decl) = block;
8274
8275 /* It's time to assign the variable flagging static class
8276 initialization based on which classes invoked static methods
8277 are definitely initializing. This should be flagged. */
8278 if (STATIC_CLASS_INIT_OPT_P ())
8279 {
8280 tree list = DECL_FUNCTION_STATIC_METHOD_INVOCATION_COMPOUND (decl);
8281 for (; list != NULL_TREE; list = TREE_CHAIN (list))
8282 {
8283 /* Executed for each statement calling a static function.
8284 LIST is a TREE_LIST whose PURPOSE is the called function
8285 and VALUE is a compound whose second operand can be patched
8286 with static class initialization flag assignments. */
8287
8288 tree called_method = TREE_PURPOSE (list);
8289 tree compound = TREE_VALUE (list);
8290 tree assignment_compound_list
8291 = build_tree_list (called_method, NULL);
8292
8293 /* For each class definitely initialized in
8294 CALLED_METHOD, fill ASSIGNMENT_COMPOUND with
8295 assignment to the class initialization flag. */
8296 htab_traverse (DECL_FUNCTION_INITIALIZED_CLASS_TABLE (called_method),
8297 emit_test_initialization,
8298 assignment_compound_list);
8299
8300 if (TREE_VALUE (assignment_compound_list))
8301 TREE_OPERAND (compound, 1)
8302 = TREE_VALUE (assignment_compound_list);
8303 }
8304 }
8305
8306 /* Expand the function body. */
8307 source_end_java_method ();
8308 }
8309 }
8310
8311 \f
8312
8313 /* This section of the code deals with accessing enclosing context
8314 fields either directly by using the relevant access to this$<n> or
8315 by invoking an access method crafted for that purpose. */
8316
8317 /* Build the necessary access across nested class boundaries.
8318 This routine could be optimized to cache previous result
8319 (decl, current_class and returned access). When an access method
8320 needs to be generated, it always takes the form of a read. It might
8321 be later turned into a write by calling nested_field_access_fix. */
8322
8323 static tree
8324 build_nested_field_access (tree id, tree decl)
8325 {
8326 tree access = NULL_TREE;
8327 tree ctx = NULL_TREE;
8328 tree decl_ctx = DECL_CONTEXT (decl);
8329 bool is_static = FIELD_STATIC (decl);
8330
8331 if (DECL_CONTEXT (TYPE_NAME (current_class)))
8332 ctx = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (current_class)));
8333
8334 /* For non-static fields, if the immediate enclosing context of the
8335 current class is the field decl's class or inherits from it,
8336 build the access as `this$<n>.<field>'. Note that we will break
8337 the `private' barrier if we're not emitting bytecodes. */
8338 if (!is_static
8339 && ctx
8340 && (ctx == decl_ctx || inherits_from_p (ctx, decl_ctx))
8341 && (!FIELD_PRIVATE (decl) || !flag_emit_class_files))
8342 {
8343 tree thisn = build_current_thisn (current_class);
8344 access = make_qualified_primary (build_wfl_node (thisn),
8345 id, EXPR_WFL_LINECOL (id));
8346 }
8347 /* Otherwise, generate and use accessor methods for the field as
8348 needed. */
8349 else
8350 {
8351 int lc = EXPR_WFL_LINECOL (id);
8352
8353 /* Now we chain the required number of calls to the access$0 to
8354 get a hold to the enclosing instance we need for a non-static
8355 field, and then we build the field access. */
8356 if (!is_static)
8357 access = build_access_to_thisn (current_class, decl_ctx, lc);
8358
8359 /* If the field is private and we're generating bytecode, then
8360 we generate an access method. */
8361 if (FIELD_PRIVATE (decl) && flag_emit_class_files)
8362 {
8363 tree name = build_nested_field_access_methods (decl);
8364 access = build_nested_field_access_expr (lc, decl_ctx,
8365 name, access, NULL_TREE);
8366 }
8367 /* Otherwise we use `access$(this$<j>). ... access$(this$<i>).<field>'
8368 for non-static fields.
8369 Once again we break the `private' access rule from a foreign
8370 class. */
8371 else if (is_static)
8372 {
8373 tree class_name = DECL_NAME (TYPE_NAME (decl_ctx));
8374 access
8375 = make_qualified_primary (build_wfl_node (class_name), id, lc);
8376 }
8377 else
8378 access = make_qualified_primary (access, id, lc);
8379 }
8380
8381 return resolve_expression_name (access, NULL);
8382 }
8383
8384 /* Return a nonzero value if DECL describes a member access across nested
8385 class boundaries. That is, DECL is in a class that either encloses,
8386 is enclosed by or shares a common enclosing class with the class
8387 TYPE. */
8388
8389 static int
8390 nested_member_access_p (tree type, tree decl)
8391 {
8392 bool is_static = false;
8393 tree decl_type = DECL_CONTEXT (decl);
8394 tree type_root, decl_type_root;
8395
8396 if (decl_type == type
8397 || (TREE_CODE (decl) != FIELD_DECL
8398 && TREE_CODE (decl) != VAR_DECL
8399 && TREE_CODE (decl) != FUNCTION_DECL))
8400 return 0;
8401
8402 if (!INNER_CLASS_TYPE_P (type)
8403 && !(TREE_CODE (decl_type) == RECORD_TYPE
8404 && INNER_CLASS_TYPE_P (decl_type)))
8405 return 0;
8406
8407 is_static = (TREE_CODE (decl) == FUNCTION_DECL)
8408 ? METHOD_STATIC (decl)
8409 : FIELD_STATIC (decl);
8410
8411 /* If TYPE extends the declaration context of the non-static
8412 member we're trying to access, then this isn't a nested member
8413 access we need to worry about. */
8414 if (!is_static && inherits_from_p (type, decl_type))
8415 return 0;
8416
8417 for (type_root = type;
8418 DECL_CONTEXT (TYPE_NAME (type_root));
8419 type_root = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (type_root))))
8420 {
8421 if (type_root == decl_type)
8422 return 1;
8423 }
8424
8425 if (TREE_CODE (decl_type) == RECORD_TYPE
8426 && INNER_CLASS_TYPE_P (decl_type))
8427 {
8428 for (decl_type_root = decl_type;
8429 DECL_CONTEXT (TYPE_NAME (decl_type_root));
8430 decl_type_root
8431 = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (decl_type_root))))
8432 {
8433 if (decl_type_root == type)
8434 return 1;
8435 }
8436 }
8437 else
8438 decl_type_root = decl_type;
8439
8440 if (type_root == decl_type_root)
8441 return 1;
8442
8443 /* Before we give up, see whether it is a non-static field
8444 inherited from the enclosing context we are considering. */
8445 if (!DECL_CONTEXT (TYPE_NAME (type_root))
8446 && !is_static
8447 && inherits_from_p (type_root, decl_type))
8448 return 1;
8449
8450 return 0;
8451 }
8452
8453 /* Return a nonzero value if NODE represents a cross-nested-class
8454 access that has already been expanded. As a side effect, it returns
8455 the name of the field being accessed and the argument passed to the
8456 access function, suitable for a regeneration of the access method
8457 call if necessary. */
8458
8459 static int
8460 nested_field_expanded_access_p (tree node, tree *name, tree *arg_type,
8461 tree *arg)
8462 {
8463 int identified = 0;
8464
8465 if (TREE_CODE (node) != CALL_EXPR)
8466 return 0;
8467
8468 /* Well, GCJ generates slightly different tree nodes when compiling
8469 to native or bytecodes. It's the case for function calls. */
8470
8471 if (flag_emit_class_files
8472 && TREE_CODE (node) == CALL_EXPR
8473 && NESTED_FIELD_ACCESS_IDENTIFIER_P (DECL_NAME (TREE_OPERAND (node, 0))))
8474 identified = 1;
8475 else if (!flag_emit_class_files)
8476 {
8477 node = TREE_OPERAND (node, 0);
8478
8479 if (node && TREE_OPERAND (node, 0)
8480 && TREE_CODE (TREE_OPERAND (node, 0)) == ADDR_EXPR)
8481 {
8482 node = TREE_OPERAND (node, 0);
8483 if (TREE_OPERAND (node, 0)
8484 && TREE_CODE (TREE_OPERAND (node, 0)) == FUNCTION_DECL
8485 && (NESTED_FIELD_ACCESS_IDENTIFIER_P
8486 (DECL_NAME (TREE_OPERAND (node, 0)))))
8487 identified = 1;
8488 }
8489 }
8490
8491 if (identified && name && arg_type && arg)
8492 {
8493 tree argument = TREE_OPERAND (node, 1);
8494 *name = DECL_NAME (TREE_OPERAND (node, 0));
8495
8496 /* The accessors for static fields do not take in a this$<n> argument,
8497 so we take the class name from the accessor's context instead. */
8498 if (argument)
8499 {
8500 *arg_type = TREE_TYPE (TREE_TYPE (TREE_VALUE (argument)));
8501 *arg = TREE_VALUE (argument);
8502 }
8503 else
8504 {
8505 *arg_type = DECL_CONTEXT (TREE_OPERAND (node, 0));
8506 *arg = NULL_TREE;
8507 }
8508 }
8509 return identified;
8510 }
8511
8512 /* Detect in NODE cross-nested-class field read access and
8513 transform it into a write with RHS as an argument. This function
8514 is called from the java_complete_lhs when an assignment to a LHS can
8515 be identified. */
8516
8517 static tree
8518 nested_field_access_fix (tree wfl, tree node, tree rhs)
8519 {
8520 tree name, arg_type, arg;
8521
8522 if (nested_field_expanded_access_p (node, &name, &arg_type, &arg))
8523 {
8524 node = build_nested_field_access_expr (EXPR_WFL_LINECOL (wfl),
8525 arg_type, name, arg, rhs);
8526 return java_complete_tree (node);
8527 }
8528 return NULL_TREE;
8529 }
8530
8531 /* Construct the expression that calls an access method:
8532 <type>.access$<n>(<arg1> [, <arg2>]);
8533
8534 ARG2 can be NULL and will be omitted in that case. It will denote a
8535 read access. */
8536
8537 static tree
8538 build_nested_field_access_expr (int lc, tree type, tree access_method_name,
8539 tree arg1, tree arg2)
8540 {
8541 tree args, cn, access;
8542
8543 if (arg1)
8544 args = build_tree_list (NULL_TREE, arg1);
8545 else
8546 args = NULL_TREE;
8547
8548 if (arg2)
8549 {
8550 if (args)
8551 args = tree_cons (NULL_TREE, arg2, args);
8552 else
8553 args = build_tree_list (NULL_TREE, arg2);
8554 }
8555
8556 access
8557 = build_method_invocation (build_wfl_node (access_method_name), args);
8558 cn = build_wfl_node (DECL_NAME (TYPE_NAME (type)));
8559
8560 return make_qualified_primary (cn, access, lc);
8561 }
8562
8563 /* Build the name of a synthetic accessor used to access class members
8564 across nested class boundaries. */
8565
8566 static tree
8567 build_new_access_id (void)
8568 {
8569 static int access_n_counter = 1;
8570 char buffer [128];
8571
8572 sprintf (buffer, "access$%d", access_n_counter++);
8573 return get_identifier (buffer);
8574 }
8575
8576 /* Create the static access functions for the cross-nested-class field DECL.
8577 We define a read:
8578 TREE_TYPE (<field>) access$<n> (DECL_CONTEXT (<field>) inst$) {
8579 return inst$.field;
8580 }
8581 and a write access:
8582 TREE_TYPE (<field>) access$<n> (DECL_CONTEXT (<field>) inst$,
8583 TREE_TYPE (<field>) value$) {
8584 return inst$.field = value$;
8585 }
8586 For static fields, these methods are generated without the instance
8587 parameter.
8588 We should have a usage flag on the DECL so we can lazily turn the ones
8589 we're using for code generation. FIXME.
8590 */
8591
8592 static tree
8593 build_nested_field_access_methods (tree decl)
8594 {
8595 tree id, args, stmt, mdecl, class_name = NULL_TREE;
8596 bool is_static = FIELD_STATIC (decl);
8597
8598 if (FIELD_NESTED_ACCESS_P (decl))
8599 return FIELD_NESTED_ACCESS (decl);
8600
8601 MAYBE_CREATE_VAR_LANG_DECL_SPECIFIC (decl);
8602
8603 /* Create the identifier and a function named after it. */
8604 id = build_new_access_id ();
8605
8606 /* The identifier is marked as bearing the name of a generated write
8607 access function for outer field accessed from inner classes. */
8608 NESTED_FIELD_ACCESS_IDENTIFIER_P (id) = 1;
8609
8610 /* Create the read access. */
8611 if (!is_static)
8612 {
8613 args = build_tree_list (inst_id,
8614 build_pointer_type (DECL_CONTEXT (decl)));
8615 TREE_CHAIN (args) = end_params_node;
8616 stmt = make_qualified_primary (build_wfl_node (inst_id),
8617 build_wfl_node (DECL_NAME (decl)), 0);
8618 }
8619 else
8620 {
8621 args = end_params_node;
8622 class_name = DECL_NAME (TYPE_NAME (DECL_CONTEXT (decl)));
8623 stmt = make_qualified_primary (build_wfl_node (class_name),
8624 build_wfl_node (DECL_NAME (decl)), 0);
8625 }
8626 stmt = build_return (0, stmt);
8627 mdecl = build_nested_field_access_method (DECL_CONTEXT (decl),
8628 TREE_TYPE (decl), id, args, stmt);
8629 DECL_FUNCTION_ACCESS_DECL (mdecl) = decl;
8630
8631 /* Create the write access method. No write access for final variable */
8632 if (!FIELD_FINAL (decl))
8633 {
8634 if (!is_static)
8635 {
8636 args = build_tree_list (inst_id,
8637 build_pointer_type (DECL_CONTEXT (decl)));
8638 TREE_CHAIN (args) = build_tree_list (wpv_id, TREE_TYPE (decl));
8639 TREE_CHAIN (TREE_CHAIN (args)) = end_params_node;
8640 stmt = make_qualified_primary (build_wfl_node (inst_id),
8641 build_wfl_node (DECL_NAME (decl)),
8642 0);
8643 }
8644 else
8645 {
8646 args = build_tree_list (wpv_id, TREE_TYPE (decl));
8647 TREE_CHAIN (args) = end_params_node;
8648 stmt = make_qualified_primary (build_wfl_node (class_name),
8649 build_wfl_node (DECL_NAME (decl)),
8650 0);
8651 }
8652 stmt = build_return (0, build_assignment (ASSIGN_TK, 0, stmt,
8653 build_wfl_node (wpv_id)));
8654 mdecl = build_nested_field_access_method (DECL_CONTEXT (decl),
8655 TREE_TYPE (decl), id,
8656 args, stmt);
8657 }
8658 DECL_FUNCTION_ACCESS_DECL (mdecl) = decl;
8659
8660 /* Return the access name */
8661 return FIELD_NESTED_ACCESS (decl) = id;
8662 }
8663
8664 /* Build a field access method NAME. */
8665
8666 static tree
8667 build_nested_field_access_method (tree class, tree type, tree name,
8668 tree args, tree body)
8669 {
8670 tree saved_current_function_decl, mdecl;
8671
8672 /* Create the method */
8673 mdecl = create_artificial_method (class, ACC_STATIC, type, name, args);
8674 fix_method_argument_names (args, mdecl);
8675 layout_class_method (class, NULL_TREE, mdecl, NULL_TREE);
8676
8677 /* Attach the method body. */
8678 saved_current_function_decl = current_function_decl;
8679 start_artificial_method_body (mdecl);
8680 java_method_add_stmt (mdecl, body);
8681 end_artificial_method_body (mdecl);
8682 current_function_decl = saved_current_function_decl;
8683
8684 return mdecl;
8685 }
8686
8687 \f
8688 /* This section deals with building access function necessary for
8689 certain kinds of method invocation across nested class boundaries. */
8690
8691 static tree
8692 build_nested_method_access_method (tree decl)
8693 {
8694 tree saved_current_function_decl, mdecl;
8695 tree args = NULL_TREE, call_args = NULL_TREE;
8696 tree carg, id, body, class;
8697 char buffer [80];
8698 int parm_id_count = 0;
8699
8700 /* Test this abort with an access to a private field */
8701 if (!strcmp (IDENTIFIER_POINTER (DECL_NAME (decl)), "access$"))
8702 abort ();
8703
8704 /* Check the cache first */
8705 if (DECL_FUNCTION_INNER_ACCESS (decl))
8706 return DECL_FUNCTION_INNER_ACCESS (decl);
8707
8708 class = DECL_CONTEXT (decl);
8709
8710 /* Obtain an access identifier and mark it */
8711 id = build_new_access_id ();
8712 NESTED_FIELD_ACCESS_IDENTIFIER_P (id) = 1;
8713
8714 carg = TYPE_ARG_TYPES (TREE_TYPE (decl));
8715 /* Create the arguments, as much as the original */
8716 for (; carg && carg != end_params_node;
8717 carg = TREE_CHAIN (carg))
8718 {
8719 sprintf (buffer, "write_parm_value$%d", parm_id_count++);
8720 args = chainon (args, build_tree_list (get_identifier (buffer),
8721 TREE_VALUE (carg)));
8722 }
8723 args = chainon (args, end_params_node);
8724
8725 /* Create the method */
8726 mdecl = create_artificial_method (class, ACC_STATIC,
8727 TREE_TYPE (TREE_TYPE (decl)), id, args);
8728 layout_class_method (class, NULL_TREE, mdecl, NULL_TREE);
8729 /* There is a potential bug here. We should be able to use
8730 fix_method_argument_names, but then arg names get mixed up and
8731 eventually a constructor will have its this$0 altered and the
8732 outer context won't be assignment properly. The testcase is
8733 stub.java FIXME */
8734 TYPE_ARG_TYPES (TREE_TYPE (mdecl)) = args;
8735
8736 /* Attach the method body. */
8737 saved_current_function_decl = current_function_decl;
8738 start_artificial_method_body (mdecl);
8739
8740 /* The actual method invocation uses the same args. When invoking a
8741 static methods that way, we don't want to skip the first argument. */
8742 carg = args;
8743 if (!METHOD_STATIC (decl))
8744 carg = TREE_CHAIN (carg);
8745 for (; carg && carg != end_params_node; carg = TREE_CHAIN (carg))
8746 call_args = tree_cons (NULL_TREE, build_wfl_node (TREE_PURPOSE (carg)),
8747 call_args);
8748
8749 body = build_method_invocation (build_wfl_node (DECL_NAME (decl)),
8750 call_args);
8751 if (!METHOD_STATIC (decl))
8752 body = make_qualified_primary (build_wfl_node (TREE_PURPOSE (args)),
8753 body, 0);
8754 if (TREE_TYPE (TREE_TYPE (decl)) != void_type_node)
8755 body = build_return (0, body);
8756 java_method_add_stmt (mdecl,body);
8757 end_artificial_method_body (mdecl);
8758 current_function_decl = saved_current_function_decl;
8759
8760 /* Back tag the access function so it know what it accesses. */
8761 DECL_FUNCTION_ACCESS_DECL (decl) = mdecl;
8762
8763 /* Tag the current method so it knows it has an access generated. */
8764 return DECL_FUNCTION_INNER_ACCESS (decl) = mdecl;
8765 }
8766
8767 \f
8768 /* This section of the code deals with building expressions to access
8769 the enclosing instance of an inner class. The enclosing instance is
8770 kept in a generated field called this$<n>, with <n> being the
8771 inner class nesting level (starting from 0.) */
8772
8773 /* Build an access to a given this$<n>, always chaining access call to
8774 others. Access methods to this$<n> are build on the fly if
8775 necessary. This CAN'T be used to solely access this$<n-1> from
8776 this$<n> (which alway yield to special cases and optimization, see
8777 for example build_nested_field_access). */
8778
8779 static tree
8780 build_access_to_thisn (tree from, tree to, int lc)
8781 {
8782 tree access = NULL_TREE;
8783
8784 while (from != to && PURE_INNER_CLASS_TYPE_P (from))
8785 {
8786 if (!access)
8787 {
8788 access = build_current_thisn (from);
8789 access = build_wfl_node (access);
8790 }
8791 else
8792 {
8793 tree access0_wfl, cn;
8794
8795 maybe_build_thisn_access_method (from);
8796 access0_wfl = build_wfl_node (access0_identifier_node);
8797 cn = build_wfl_node (DECL_NAME (TYPE_NAME (from)));
8798 EXPR_WFL_LINECOL (access0_wfl) = lc;
8799 access = build_tree_list (NULL_TREE, access);
8800 access = build_method_invocation (access0_wfl, access);
8801 access = make_qualified_primary (cn, access, lc);
8802 }
8803
8804 /* If FROM isn't an inner class, that's fine, we've done enough.
8805 What we're looking for can be accessed from there. */
8806 from = DECL_CONTEXT (TYPE_NAME (from));
8807 if (!from)
8808 break;
8809 from = TREE_TYPE (from);
8810 }
8811 return access;
8812 }
8813
8814 /* Build an access function to the this$<n> local to TYPE. NULL_TREE
8815 is returned if nothing needs to be generated. Otherwise, the method
8816 generated and a method decl is returned.
8817
8818 NOTE: These generated methods should be declared in a class file
8819 attribute so that they can't be referred to directly. */
8820
8821 static tree
8822 maybe_build_thisn_access_method (tree type)
8823 {
8824 tree mdecl, args, stmt, rtype;
8825 tree saved_current_function_decl;
8826
8827 /* If TYPE is a top-level class, no access method is required.
8828 If there already is such an access method, bail out. */
8829 if (CLASS_ACCESS0_GENERATED_P (type) || !PURE_INNER_CLASS_TYPE_P (type))
8830 return NULL_TREE;
8831
8832 /* We generate the method. The method looks like:
8833 static <outer_of_type> access$0 (<type> inst$) { return inst$.this$<n>; }
8834 */
8835 args = build_tree_list (inst_id, build_pointer_type (type));
8836 TREE_CHAIN (args) = end_params_node;
8837 rtype = build_pointer_type (TREE_TYPE (DECL_CONTEXT (TYPE_NAME (type))));
8838 mdecl = create_artificial_method (type, ACC_STATIC, rtype,
8839 access0_identifier_node, args);
8840 fix_method_argument_names (args, mdecl);
8841 layout_class_method (type, NULL_TREE, mdecl, NULL_TREE);
8842 stmt = build_current_thisn (type);
8843 stmt = make_qualified_primary (build_wfl_node (inst_id),
8844 build_wfl_node (stmt), 0);
8845 stmt = build_return (0, stmt);
8846
8847 saved_current_function_decl = current_function_decl;
8848 start_artificial_method_body (mdecl);
8849 java_method_add_stmt (mdecl, stmt);
8850 end_artificial_method_body (mdecl);
8851 current_function_decl = saved_current_function_decl;
8852
8853 CLASS_ACCESS0_GENERATED_P (type) = 1;
8854
8855 return mdecl;
8856 }
8857
8858 /* Craft an correctly numbered `this$<n>'string. this$0 is used for
8859 the first level of innerclassing. this$1 for the next one, etc...
8860 This function can be invoked with TYPE to NULL, available and then
8861 has to count the parser context. */
8862
8863 static GTY(()) tree saved_thisn;
8864 static GTY(()) tree saved_type;
8865
8866 static tree
8867 build_current_thisn (tree type)
8868 {
8869 static int saved_i = -1;
8870 static int saved_type_i = 0;
8871 tree decl;
8872 char buffer [24];
8873 int i = 0;
8874
8875 if (type)
8876 {
8877 if (type == saved_type)
8878 i = saved_type_i;
8879 else
8880 {
8881 for (i = -1, decl = DECL_CONTEXT (TYPE_NAME (type));
8882 decl; decl = DECL_CONTEXT (decl), i++)
8883 ;
8884
8885 saved_type = type;
8886 saved_type_i = i;
8887 }
8888 }
8889 else
8890 i = list_length (GET_CPC_LIST ())-2;
8891
8892 if (i == saved_i)
8893 return saved_thisn;
8894
8895 sprintf (buffer, "this$%d", i);
8896 saved_i = i;
8897 saved_thisn = get_identifier (buffer);
8898 return saved_thisn;
8899 }
8900
8901 /* Return the assignment to the hidden enclosing context `this$<n>'
8902 by the second incoming parameter to the innerclass constructor. The
8903 form used is `this.this$<n> = this$<n>;'. */
8904
8905 static tree
8906 build_thisn_assign (void)
8907 {
8908 if (current_class && PURE_INNER_CLASS_TYPE_P (current_class))
8909 {
8910 tree thisn = build_current_thisn (current_class);
8911 tree lhs = make_qualified_primary (build_wfl_node (this_identifier_node),
8912 build_wfl_node (thisn), 0);
8913 tree rhs = build_wfl_node (thisn);
8914 #ifdef USE_MAPPED_LOCATION
8915 SET_EXPR_LOCATION (lhs, input_location);
8916 #else
8917 EXPR_WFL_SET_LINECOL (lhs, input_line, 0);
8918 #endif
8919 return build_assignment (ASSIGN_TK, EXPR_WFL_LINECOL (lhs), lhs, rhs);
8920 }
8921 return NULL_TREE;
8922 }
8923
8924 \f
8925 /* Building the synthetic `class$' used to implement the `.class' 1.1
8926 extension for non primitive types. This method looks like:
8927
8928 static Class class$(String type) throws NoClassDefFoundError
8929 {
8930 try {return (java.lang.Class.forName (String));}
8931 catch (ClassNotFoundException e) {
8932 throw new NoClassDefFoundError(e.getMessage());}
8933 } */
8934
8935 static GTY(()) tree get_message_wfl;
8936 static GTY(()) tree type_parm_wfl;
8937
8938 static tree
8939 build_dot_class_method (tree class)
8940 {
8941 #define BWF(S) build_wfl_node (get_identifier ((S)))
8942 #ifdef USE_MAPPED_LOCATION
8943 #define MQN(X,Y) make_qualified_name ((X), (Y), UNKNOWN_LOCATION)
8944 #else
8945 #define MQN(X,Y) make_qualified_name ((X), (Y), 0)
8946 #endif
8947 tree args, tmp, saved_current_function_decl, mdecl, qual_name;
8948 tree stmt, throw_stmt;
8949
8950 if (!get_message_wfl)
8951 {
8952 get_message_wfl = build_wfl_node (get_identifier ("getMessage"));
8953 type_parm_wfl = build_wfl_node (get_identifier ("type$"));
8954 }
8955
8956 /* Build the arguments */
8957 args = build_tree_list (get_identifier ("type$"),
8958 build_pointer_type (string_type_node));
8959 TREE_CHAIN (args) = end_params_node;
8960
8961 /* Build the qualified name java.lang.Class.forName */
8962 tmp = MQN (MQN (MQN (BWF ("java"),
8963 BWF ("lang")), BWF ("Class")), BWF ("forName"));
8964
8965 /* Create the "class$" function */
8966 mdecl = create_artificial_method (class, ACC_STATIC,
8967 build_pointer_type (class_type_node),
8968 classdollar_identifier_node, args);
8969 qual_name = MQN (MQN (BWF ("java"), BWF ("lang")),
8970 BWF ("NoClassDefFoundError"));
8971 DECL_FUNCTION_THROWS (mdecl) = build_tree_list (NULL_TREE, qual_name);
8972 register_incomplete_type (JDEP_EXCEPTION, qual_name, NULL_TREE, NULL_TREE);
8973 JDEP_GET_PATCH (CLASSD_LAST (ctxp->classd_list)) =
8974 &TREE_VALUE (DECL_FUNCTION_THROWS (mdecl));
8975
8976 /* We start by building the try block. We need to build:
8977 return (java.lang.Class.forName (type)); */
8978 stmt = build_method_invocation (tmp,
8979 build_tree_list (NULL_TREE, type_parm_wfl));
8980 stmt = build_return (0, stmt);
8981
8982 /* Now onto the catch block. We start by building the expression
8983 throwing a new exception: throw new NoClassDefFoundError (_.getMessage) */
8984 #ifdef USE_MAPPED_LOCATION
8985 throw_stmt = make_qualified_name (build_wfl_node (wpv_id),
8986 get_message_wfl, UNKNOWN_LOCATION);
8987 #else
8988 throw_stmt = make_qualified_name (build_wfl_node (wpv_id),
8989 get_message_wfl, 0);
8990 #endif
8991 throw_stmt = build_method_invocation (throw_stmt, NULL_TREE);
8992
8993 /* Build new NoClassDefFoundError (_.getMessage) */
8994 throw_stmt = build_new_invocation
8995 (build_wfl_node (get_identifier ("NoClassDefFoundError")),
8996 build_tree_list (build_pointer_type (string_type_node), throw_stmt));
8997
8998 /* Build the throw, (it's too early to use BUILD_THROW) */
8999 throw_stmt = build1 (THROW_EXPR, NULL_TREE, throw_stmt);
9000
9001 /* Encapsulate STMT in a try block. The catch clause executes THROW_STMT */
9002 qual_name = MQN (MQN (BWF ("java"), BWF ("lang")),
9003 BWF ("ClassNotFoundException"));
9004 stmt = encapsulate_with_try_catch (0, qual_name, stmt, throw_stmt);
9005
9006 fix_method_argument_names (args, mdecl);
9007 layout_class_method (class, NULL_TREE, mdecl, NULL_TREE);
9008 saved_current_function_decl = current_function_decl;
9009 start_artificial_method_body (mdecl);
9010 java_method_add_stmt (mdecl, stmt);
9011 end_artificial_method_body (mdecl);
9012 current_function_decl = saved_current_function_decl;
9013 TYPE_DOT_CLASS (class) = mdecl;
9014
9015 return mdecl;
9016 }
9017
9018 static tree
9019 build_dot_class_method_invocation (tree this_class, tree type)
9020 {
9021 tree dot_class_method = TYPE_DOT_CLASS (this_class);
9022 tree sig_id, s, t;
9023
9024 if (TYPE_ARRAY_P (type))
9025 sig_id = build_java_signature (type);
9026 else
9027 sig_id = DECL_NAME (TYPE_NAME (type));
9028
9029 /* Ensure that the proper name separator is used */
9030 sig_id = unmangle_classname (IDENTIFIER_POINTER (sig_id),
9031 IDENTIFIER_LENGTH (sig_id));
9032
9033 s = build_string (IDENTIFIER_LENGTH (sig_id),
9034 IDENTIFIER_POINTER (sig_id));
9035 t = build_method_invocation (build_wfl_node (DECL_NAME (dot_class_method)),
9036 build_tree_list (NULL_TREE, s));
9037 if (DECL_CONTEXT (dot_class_method) != this_class)
9038 {
9039 tree class_name = DECL_NAME (TYPE_NAME (DECL_CONTEXT (dot_class_method)));
9040 t = make_qualified_primary (build_wfl_node (class_name), t, 0);
9041 }
9042 return t;
9043 }
9044
9045 /* This section of the code deals with constructor. */
9046
9047 /* Craft a body for default constructor. Patch existing constructor
9048 bodies with call to super() and field initialization statements if
9049 necessary. */
9050
9051 static void
9052 fix_constructors (tree mdecl)
9053 {
9054 tree iii; /* Instance Initializer Invocation */
9055 tree *bodyp = &DECL_FUNCTION_BODY (mdecl);
9056 tree thisn_assign, compound = NULL_TREE;
9057 tree class_type = DECL_CONTEXT (mdecl);
9058
9059 if (DECL_FIXED_CONSTRUCTOR_P (mdecl))
9060 return;
9061 DECL_FIXED_CONSTRUCTOR_P (mdecl) = 1;
9062
9063 if (!*bodyp)
9064 {
9065 /* It is an error for the compiler to generate a default
9066 constructor if the superclass doesn't have a constructor that
9067 takes no argument, or the same args for an anonymous class */
9068 tree sdecl = get_constructor_super (mdecl);
9069 if (sdecl == NULL_TREE)
9070 {
9071 tree sclass_decl = TYPE_NAME (CLASSTYPE_SUPER (class_type));
9072 tree save = DECL_NAME (mdecl);
9073 const char *n = IDENTIFIER_POINTER (DECL_NAME (sclass_decl));
9074 DECL_NAME (mdecl) = DECL_NAME (sclass_decl);
9075 parse_error_context
9076 (lookup_cl (TYPE_NAME (class_type)),
9077 "No constructor matching %qs found in class %qs",
9078 lang_printable_name (mdecl, 2), n);
9079 DECL_NAME (mdecl) = save;
9080 }
9081
9082 if (ANONYMOUS_CLASS_P (class_type))
9083 {
9084 /* Copy throws clause from the super constructor. */
9085 tree throws = DECL_FUNCTION_THROWS (sdecl);
9086 DECL_FUNCTION_THROWS (mdecl) = copy_list (throws);
9087 }
9088
9089 /* The constructor body must be crafted by hand. It's the
9090 constructor we defined when we realize we didn't have the
9091 CLASSNAME() constructor */
9092 start_artificial_method_body (mdecl);
9093
9094 /* Insert an assignment to the this$<n> hidden field, if
9095 necessary */
9096 if ((thisn_assign = build_thisn_assign ()))
9097 java_method_add_stmt (mdecl, thisn_assign);
9098
9099 /* We don't generate a super constructor invocation if we're
9100 compiling java.lang.Object. build_super_invocation takes care
9101 of that. */
9102 java_method_add_stmt (mdecl, build_super_invocation (mdecl));
9103
9104 /* FIXME */
9105 if ((iii = build_instinit_invocation (class_type)))
9106 java_method_add_stmt (mdecl, iii);
9107
9108 end_artificial_method_body (mdecl);
9109 }
9110 /* Search for an explicit constructor invocation */
9111 else
9112 {
9113 int found = 0;
9114 int invokes_this = 0;
9115 tree main_block = BLOCK_EXPR_BODY (*bodyp);
9116
9117 while (*bodyp)
9118 {
9119 tree body = *bodyp;
9120 switch (TREE_CODE (body))
9121 {
9122 case CALL_EXPR:
9123 found = CALL_EXPLICIT_CONSTRUCTOR_P (body);
9124 if (CALL_THIS_CONSTRUCTOR_P (body))
9125 invokes_this = 1;
9126 break;
9127 case COMPOUND_EXPR:
9128 case EXPR_WITH_FILE_LOCATION:
9129 bodyp = &TREE_OPERAND (body, 0);
9130 continue;
9131 case BLOCK:
9132 bodyp = &BLOCK_EXPR_BODY (body);
9133 continue;
9134 default:
9135 break;
9136 }
9137 break;
9138 }
9139
9140 /* Generate the assignment to this$<n>, if necessary */
9141 if ((thisn_assign = build_thisn_assign ()))
9142 compound = add_stmt_to_compound (compound, NULL_TREE, thisn_assign);
9143
9144 /* The constructor is missing an invocation of super() */
9145 if (!found)
9146 compound = add_stmt_to_compound (compound, NULL_TREE,
9147 build_super_invocation (mdecl));
9148 /* Explicit super() invocation should take place before the
9149 instance initializer blocks. */
9150 else
9151 {
9152 compound = add_stmt_to_compound (compound, NULL_TREE, *bodyp);
9153 *bodyp = build_java_empty_stmt ();
9154 }
9155
9156 DECL_INIT_CALLS_THIS (mdecl) = invokes_this;
9157
9158 /* Insert the instance initializer block right after. */
9159 if (!invokes_this && (iii = build_instinit_invocation (class_type)))
9160 compound = add_stmt_to_compound (compound, NULL_TREE, iii);
9161
9162 /* Fix the constructor main block if we're adding extra stmts */
9163 if (compound)
9164 {
9165 compound = add_stmt_to_compound (compound, NULL_TREE,
9166 BLOCK_EXPR_BODY (main_block));
9167 BLOCK_EXPR_BODY (main_block) = compound;
9168 }
9169 }
9170 }
9171
9172 /* Browse constructors in the super class, searching for a constructor
9173 that doesn't take any argument. Return the constructor if one is found,
9174 NULL_TREE otherwise. If the current class is an anonymous inner class,
9175 look for something that has the same signature. */
9176 static tree
9177 get_constructor_super (tree mdecl)
9178 {
9179 tree class = CLASSTYPE_SUPER (current_class);
9180 int super_inner = PURE_INNER_CLASS_TYPE_P (class);
9181 tree sdecl;
9182
9183 if (!class)
9184 return NULL_TREE;
9185
9186 if (ANONYMOUS_CLASS_P (current_class))
9187 {
9188 tree mdecl_arg_type;
9189 SKIP_THIS_AND_ARTIFICIAL_PARMS (mdecl_arg_type, mdecl);
9190 for (sdecl = TYPE_METHODS (class); sdecl; sdecl = TREE_CHAIN (sdecl))
9191 if (DECL_CONSTRUCTOR_P (sdecl))
9192 {
9193 tree m_arg_type;
9194 tree arg_type = TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (sdecl)));
9195 if (super_inner)
9196 arg_type = TREE_CHAIN (arg_type);
9197 for (m_arg_type = mdecl_arg_type;
9198 (arg_type != end_params_node
9199 && m_arg_type != end_params_node);
9200 arg_type = TREE_CHAIN (arg_type),
9201 m_arg_type = TREE_CHAIN (m_arg_type))
9202 if (!valid_method_invocation_conversion_p
9203 (TREE_VALUE (arg_type),
9204 TREE_VALUE (m_arg_type)))
9205 break;
9206
9207 if (arg_type == end_params_node && m_arg_type == end_params_node)
9208 return sdecl;
9209 }
9210 }
9211 else
9212 {
9213 for (sdecl = TYPE_METHODS (class); sdecl; sdecl = TREE_CHAIN (sdecl))
9214 {
9215 tree arg = TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (sdecl)));
9216 if (super_inner)
9217 arg = TREE_CHAIN (arg);
9218 if (DECL_CONSTRUCTOR_P (sdecl) && arg == end_params_node)
9219 return sdecl;
9220 }
9221 }
9222 return NULL_TREE;
9223 }
9224
9225 /* Generate code for all context remembered for code generation. */
9226
9227 static GTY(()) tree reversed_class_list;
9228 void
9229 java_expand_classes (void)
9230 {
9231 int save_error_count = 0;
9232 static struct parser_ctxt *cur_ctxp = NULL;
9233 location_t save_location;
9234
9235 java_parse_abort_on_error ();
9236 if (!(ctxp = ctxp_for_generation))
9237 return;
9238 java_layout_classes ();
9239 java_parse_abort_on_error ();
9240 save_location = input_location;
9241
9242 for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
9243 {
9244 tree current;
9245 for (current = cur_ctxp->class_list;
9246 current;
9247 current = TREE_CHAIN (current))
9248 gen_indirect_dispatch_tables (TREE_TYPE (current));
9249 }
9250
9251 for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
9252 {
9253 ctxp = cur_ctxp;
9254 input_location = ctxp->file_start_location;
9255 lang_init_source (2); /* Error msgs have method prototypes */
9256 java_complete_expand_classes (); /* Complete and expand classes */
9257 java_parse_abort_on_error ();
9258 }
9259 input_location = save_location;
9260
9261 /* Find anonymous classes and expand their constructor. This extra pass is
9262 necessary because the constructor itself is only generated when the
9263 method in which it is defined is expanded. */
9264 for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
9265 {
9266 tree current;
9267 ctxp = cur_ctxp;
9268 for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
9269 {
9270 output_class = current_class = TREE_TYPE (current);
9271 if (ANONYMOUS_CLASS_P (current_class))
9272 {
9273 tree d;
9274 for (d = TYPE_METHODS (current_class); d; d = TREE_CHAIN (d))
9275 {
9276 if (DECL_CONSTRUCTOR_P (d))
9277 {
9278 java_complete_expand_method (d);
9279 break; /* There is only one constructor. */
9280 }
9281 }
9282 }
9283 }
9284 }
9285
9286 /* Expanding the constructors of anonymous classes generates access
9287 methods. Scan all the methods looking for null DECL_RESULTs --
9288 this will be the case if a method hasn't been expanded. */
9289 for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
9290 {
9291 tree current;
9292 ctxp = cur_ctxp;
9293 for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
9294 {
9295 tree d;
9296 output_class = current_class = TREE_TYPE (current);
9297 for (d = TYPE_METHODS (current_class); d; d = TREE_CHAIN (d))
9298 {
9299 if (DECL_RESULT (d) == NULL_TREE)
9300 java_complete_expand_method (d);
9301 }
9302 }
9303 }
9304
9305 /* ??? Instead of all this we could iterate around the list of
9306 classes until there were no more un-expanded methods. It would
9307 take a little longer -- one pass over the whole list of methods
9308 -- but it would be simpler. Like this: */
9309 #if 0
9310 {
9311 int something_changed;
9312
9313 do
9314 {
9315 something_changed = 0;
9316 for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
9317 {
9318 tree current;
9319 ctxp = cur_ctxp;
9320 for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
9321 {
9322 tree d;
9323 output_class = current_class = TREE_TYPE (current);
9324 for (d = TYPE_METHODS (current_class); d; d = TREE_CHAIN (d))
9325 {
9326 if (DECL_RESULT (d) == NULL_TREE)
9327 {
9328 something_changed = 1;
9329 java_complete_expand_method (d);
9330 }
9331 }
9332 }
9333 }
9334 }
9335 while (something_changed);
9336 }
9337 #endif
9338
9339 /* If we've found error at that stage, don't try to generate
9340 anything, unless we're checking the syntax only
9341 (but not using -fsyntax-only for the purpose of generating
9342 bytecode). */
9343 if (java_error_count
9344 && (!flag_syntax_only && !flag_emit_class_files))
9345 return;
9346
9347 /* Now things are stable, go for generation of the class data. */
9348
9349 /* We pessimistically marked all methods and fields external until
9350 we knew what set of classes we were planning to compile. Now mark
9351 those that will be generated locally as not external. */
9352 for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
9353 {
9354 tree current;
9355 ctxp = cur_ctxp;
9356 for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
9357 java_mark_class_local (TREE_TYPE (current));
9358 }
9359
9360 /* Compile the classes. */
9361 for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
9362 {
9363 tree current;
9364 reversed_class_list = NULL;
9365
9366 ctxp = cur_ctxp;
9367
9368 /* We write out the classes in reverse order. This ensures that
9369 inner classes are written before their containing classes,
9370 which is important for parallel builds. Otherwise, the
9371 class file for the outer class may be found, but the class
9372 file for the inner class may not be present. In that
9373 situation, the compiler cannot fall back to the original
9374 source, having already read the outer class, so we must
9375 prevent that situation. */
9376 for (current = ctxp->class_list;
9377 current;
9378 current = TREE_CHAIN (current))
9379 reversed_class_list
9380 = tree_cons (NULL_TREE, current, reversed_class_list);
9381
9382 for (current = reversed_class_list;
9383 current;
9384 current = TREE_CHAIN (current))
9385 {
9386 output_class = current_class = TREE_TYPE (TREE_VALUE (current));
9387 if (flag_emit_class_files)
9388 write_classfile (current_class);
9389 else if (! flag_syntax_only)
9390 java_expand_method_bodies (current_class);
9391 }
9392 }
9393 }
9394
9395 void
9396 java_finish_classes (void)
9397 {
9398 static struct parser_ctxt *cur_ctxp = NULL;
9399 for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
9400 {
9401 tree current;
9402 ctxp = cur_ctxp;
9403 for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
9404 {
9405 output_class = current_class = TREE_TYPE (current);
9406 finish_class ();
9407 }
9408 }
9409 }
9410
9411 /* Wrap non WFL PRIMARY around a WFL and set EXPR_WFL_QUALIFICATION to
9412 a tree list node containing RIGHT. Fore coming RIGHTs will be
9413 chained to this hook. LOCATION contains the location of the
9414 separating `.' operator. */
9415
9416 static tree
9417 make_qualified_primary (tree primary, tree right, int location)
9418 {
9419 tree wfl;
9420
9421 if (TREE_CODE (primary) != EXPR_WITH_FILE_LOCATION)
9422 wfl = build_wfl_wrap (primary, location);
9423 else
9424 {
9425 wfl = primary;
9426 /* If wfl wasn't qualified, we build a first anchor */
9427 if (!EXPR_WFL_QUALIFICATION (wfl))
9428 EXPR_WFL_QUALIFICATION (wfl) = build_tree_list (wfl, NULL_TREE);
9429 }
9430
9431 /* And chain them */
9432 EXPR_WFL_LINECOL (right) = location;
9433 chainon (EXPR_WFL_QUALIFICATION (wfl), build_tree_list (right, NULL_TREE));
9434 PRIMARY_P (wfl) = 1;
9435 return wfl;
9436 }
9437
9438 /* Simple merge of two name separated by a `.' */
9439
9440 static tree
9441 merge_qualified_name (tree left, tree right)
9442 {
9443 tree node;
9444 if (!left && !right)
9445 return NULL_TREE;
9446
9447 if (!left)
9448 return right;
9449
9450 if (!right)
9451 return left;
9452
9453 obstack_grow (&temporary_obstack, IDENTIFIER_POINTER (left),
9454 IDENTIFIER_LENGTH (left));
9455 obstack_1grow (&temporary_obstack, '.');
9456 obstack_grow0 (&temporary_obstack, IDENTIFIER_POINTER (right),
9457 IDENTIFIER_LENGTH (right));
9458 node = get_identifier (obstack_base (&temporary_obstack));
9459 obstack_free (&temporary_obstack, obstack_base (&temporary_obstack));
9460 QUALIFIED_P (node) = 1;
9461 return node;
9462 }
9463
9464 /* Merge the two parts of a qualified name into LEFT. Set the
9465 location information of the resulting node to LOCATION, usually
9466 inherited from the location information of the `.' operator. */
9467
9468 static tree
9469 make_qualified_name (tree left, tree right,
9470 #ifdef USE_MAPPED_LOCATION
9471 source_location location
9472 #else
9473 int location
9474 #endif
9475 )
9476 {
9477 #ifdef USE_COMPONENT_REF
9478 tree node = build3 (COMPONENT_REF, NULL_TREE, left, right, NULL_TREE);
9479 SET_EXPR_LOCATION (node, location);
9480 return node;
9481 #else
9482 tree left_id = EXPR_WFL_NODE (left);
9483 tree right_id = EXPR_WFL_NODE (right);
9484 tree wfl, merge;
9485
9486 merge = merge_qualified_name (left_id, right_id);
9487
9488 /* Left wasn't qualified and is now qualified */
9489 #ifdef USE_MAPPED_LOCATION
9490 if (!QUALIFIED_P (left_id))
9491 {
9492 tree wfl = build_expr_wfl (left_id, EXPR_LOCATION (left));
9493 EXPR_WFL_QUALIFICATION (left) = build_tree_list (wfl, NULL_TREE);
9494 }
9495
9496 wfl = build_expr_wfl (right_id, location);
9497 #else
9498 if (!QUALIFIED_P (left_id))
9499 {
9500 tree wfl = build_expr_wfl (left_id, ctxp->filename, 0, 0);
9501 EXPR_WFL_LINECOL (wfl) = EXPR_WFL_LINECOL (left);
9502 EXPR_WFL_QUALIFICATION (left) = build_tree_list (wfl, NULL_TREE);
9503 }
9504
9505 wfl = build_expr_wfl (right_id, ctxp->filename, 0, 0);
9506 EXPR_WFL_LINECOL (wfl) = location;
9507 #endif
9508 chainon (EXPR_WFL_QUALIFICATION (left), build_tree_list (wfl, NULL_TREE));
9509 EXPR_WFL_NODE (left) = merge;
9510 return left;
9511 #endif
9512 }
9513
9514 /* Extract the last identifier component of the qualified in WFL. The
9515 last identifier is removed from the linked list */
9516
9517 static tree
9518 cut_identifier_in_qualified (tree wfl)
9519 {
9520 tree q;
9521 tree previous = NULL_TREE;
9522 for (q = EXPR_WFL_QUALIFICATION (wfl); ; previous = q, q = TREE_CHAIN (q))
9523 if (!TREE_CHAIN (q))
9524 {
9525 if (!previous)
9526 /* Operating on a non qualified qualified WFL. */
9527 abort ();
9528
9529 TREE_CHAIN (previous) = NULL_TREE;
9530 return TREE_PURPOSE (q);
9531 }
9532 }
9533
9534 /* Resolve the expression name NAME. Return its decl. */
9535
9536 static tree
9537 resolve_expression_name (tree id, tree *orig)
9538 {
9539 tree name = EXPR_WFL_NODE (id);
9540 tree decl;
9541
9542 /* 6.5.5.1: Simple expression names */
9543 if (!PRIMARY_P (id) && !QUALIFIED_P (name))
9544 {
9545 /* 15.13.1: NAME can appear within the scope of a local variable
9546 declaration */
9547 if ((decl = IDENTIFIER_LOCAL_VALUE (name)))
9548 return decl;
9549
9550 /* 15.13.1: NAME can appear within a class declaration */
9551 else
9552 {
9553 decl = lookup_field_wrapper (current_class, name);
9554 if (decl)
9555 {
9556 tree access = NULL_TREE;
9557 int fs = FIELD_STATIC (decl);
9558
9559 /* If we're accessing an outer scope local alias, make
9560 sure we change the name of the field we're going to
9561 build access to. */
9562 if (FIELD_LOCAL_ALIAS_USED (decl))
9563 name = DECL_NAME (decl);
9564
9565 check_deprecation (id, decl);
9566
9567 /* Instance variable (8.3.1.1) can't appear within
9568 static method, static initializer or initializer for
9569 a static variable. */
9570 if (!fs && METHOD_STATIC (current_function_decl))
9571 {
9572 static_ref_err (id, name, current_class);
9573 return error_mark_node;
9574 }
9575 /* Instance variables can't appear as an argument of
9576 an explicit constructor invocation */
9577 if (!fs && ctxp->explicit_constructor_p
9578 && !enclosing_context_p (DECL_CONTEXT (decl), current_class))
9579 {
9580 parse_error_context
9581 (id, "Can't reference %qs before the superclass constructor has been called", IDENTIFIER_POINTER (name));
9582 return error_mark_node;
9583 }
9584
9585 /* If we're processing an inner class and we're trying
9586 to access a field belonging to an outer class, build
9587 the access to the field. */
9588 if (nested_member_access_p (current_class, decl))
9589 {
9590 if (!fs && CLASS_STATIC (TYPE_NAME (current_class)))
9591 {
9592 static_ref_err (id, DECL_NAME (decl), current_class);
9593 return error_mark_node;
9594 }
9595 access = build_nested_field_access (id, decl);
9596 if (orig)
9597 *orig = access;
9598 return access;
9599 }
9600
9601 /* Otherwise build what it takes to access the field */
9602 access = build_field_ref ((fs ? NULL_TREE : current_this),
9603 DECL_CONTEXT (decl), name);
9604 if (fs)
9605 access = maybe_build_class_init_for_field (decl, access);
9606 /* We may be asked to save the real field access node */
9607 if (orig)
9608 *orig = access;
9609 /* Last check: can we access the field? */
9610 if (not_accessible_p (current_class, decl, NULL_TREE, 0))
9611 {
9612 not_accessible_field_error (id, decl);
9613 return error_mark_node;
9614 }
9615 /* And we return what we got */
9616 return access;
9617 }
9618 /* Fall down to error report on undefined variable */
9619 }
9620 }
9621 /* 6.5.5.2 Qualified Expression Names */
9622 else
9623 {
9624 if (orig)
9625 *orig = NULL_TREE;
9626 qualify_ambiguous_name (id);
9627 /* 15.10.1 Field Access Using a Primary and/or Expression Name */
9628 /* 15.10.2: Accessing Superclass Members using super */
9629 return resolve_field_access (id, orig, NULL);
9630 }
9631
9632 /* We've got an error here */
9633 if (INNER_CLASS_TYPE_P (current_class))
9634 parse_error_context (id,
9635 "Local variable %qs can't be accessed from within the inner class %qs unless it is declared final",
9636 IDENTIFIER_POINTER (name),
9637 IDENTIFIER_POINTER (DECL_NAME
9638 (TYPE_NAME (current_class))));
9639 else
9640 parse_error_context (id, "Undefined variable %qs",
9641 IDENTIFIER_POINTER (name));
9642
9643 return error_mark_node;
9644 }
9645
9646 static void
9647 static_ref_err (tree wfl, tree field_id, tree class_type)
9648 {
9649 parse_error_context
9650 (wfl,
9651 "Can't make a static reference to nonstatic variable %qs in class %qs",
9652 IDENTIFIER_POINTER (field_id),
9653 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (class_type))));
9654 }
9655
9656 /* 15.10.1 Field Access Using a Primary and/or Expression Name.
9657 We return something suitable to generate the field access. We also
9658 return the field decl in FIELD_DECL and its type in FIELD_TYPE. If
9659 recipient's address can be null. */
9660
9661 static tree
9662 resolve_field_access (tree qual_wfl, tree *field_decl, tree *field_type)
9663 {
9664 int is_static = 0;
9665 tree field_ref;
9666 tree decl = NULL_TREE, where_found, type_found;
9667
9668 if (resolve_qualified_expression_name (qual_wfl, &decl,
9669 &where_found, &type_found))
9670 return error_mark_node;
9671
9672 /* Resolve the LENGTH field of an array here */
9673 if (DECL_P (decl) && DECL_NAME (decl) == length_identifier_node
9674 && type_found && TYPE_ARRAY_P (type_found)
9675 && ! flag_emit_class_files)
9676 {
9677 tree length = build_java_array_length_access (where_found);
9678 field_ref = length;
9679
9680 /* In case we're dealing with a static array, we need to
9681 initialize its class before the array length can be fetched. */
9682 if (TREE_CODE (where_found) == VAR_DECL && FIELD_STATIC (where_found))
9683 {
9684 build_static_field_ref (where_found);
9685 field_ref = build_class_init (DECL_CONTEXT (where_found), field_ref);
9686 }
9687 }
9688 /* We might have been trying to resolve field.method(). In which
9689 case, the resolution is over and decl is the answer */
9690 else if (JDECL_P (decl) && IDENTIFIER_LOCAL_VALUE (DECL_NAME (decl)) == decl)
9691 field_ref = decl;
9692 else if (JDECL_P (decl))
9693 {
9694 if (!type_found)
9695 type_found = DECL_CONTEXT (decl);
9696 is_static = FIELD_STATIC (decl);
9697 field_ref = build_field_ref ((is_static ?
9698 NULL_TREE : where_found),
9699 type_found, DECL_NAME (decl));
9700 if (field_ref == error_mark_node)
9701 return error_mark_node;
9702 if (is_static)
9703 field_ref = maybe_build_class_init_for_field (decl, field_ref);
9704
9705 /* If we're looking at a static field, we may need to generate a
9706 class initialization for it. This can happen when the access
9707 looks like `field.ref', where `field' is a static field in an
9708 interface we implement. */
9709 if (!flag_emit_class_files
9710 && TREE_CODE (where_found) == VAR_DECL
9711 && FIELD_STATIC (where_found))
9712 {
9713 build_static_field_ref (where_found);
9714 field_ref = build_class_init (DECL_CONTEXT (where_found), field_ref);
9715 }
9716 }
9717 else
9718 field_ref = decl;
9719
9720 if (field_decl)
9721 *field_decl = decl;
9722 if (field_type)
9723 *field_type = (QUAL_DECL_TYPE (decl) ?
9724 QUAL_DECL_TYPE (decl) : TREE_TYPE (decl));
9725 return field_ref;
9726 }
9727
9728 /* If NODE is an access to a static field, strip out the class
9729 initialization part and return the field decl, otherwise, return
9730 NODE. */
9731
9732 tree
9733 extract_field_decl (tree node)
9734 {
9735 if (TREE_CODE (node) == COMPOUND_EXPR)
9736 {
9737 tree op1 = TREE_OPERAND (node, 1);
9738 if (TREE_CODE (op1) == COMPOUND_EXPR)
9739 {
9740 tree call = TREE_OPERAND (op1, 0);
9741 if (TREE_CODE (call) == CALL_EXPR
9742 && TREE_CODE (TREE_OPERAND (call, 0)) == ADDR_EXPR
9743 && (TREE_OPERAND (TREE_OPERAND (call, 0), 0)
9744 == soft_initclass_node))
9745 return TREE_OPERAND (op1, 1);
9746 }
9747 else if (JDECL_P (op1))
9748 return op1;
9749 }
9750 return node;
9751 }
9752
9753 /* 6.5.5.2: Qualified Expression Names */
9754
9755 static int
9756 resolve_qualified_expression_name (tree wfl, tree *found_decl,
9757 tree *where_found, tree *type_found)
9758 {
9759 int from_type = 0; /* Field search initiated from a type */
9760 int from_super = 0, from_cast = 0, from_qualified_this = 0;
9761 int previous_call_static = 0;
9762 int is_static;
9763 tree decl = NULL_TREE, type = NULL_TREE, q;
9764 /* For certain for of inner class instantiation */
9765 tree saved_current, saved_this;
9766 #define RESTORE_THIS_AND_CURRENT_CLASS \
9767 { current_class = saved_current; current_this = saved_this;}
9768
9769 *type_found = *where_found = NULL_TREE;
9770
9771 for (q = EXPR_WFL_QUALIFICATION (wfl); q; q = TREE_CHAIN (q))
9772 {
9773 tree qual_wfl = QUAL_WFL (q);
9774 tree ret_decl; /* for EH checking */
9775 #ifdef USE_MAPPED_LOCATION
9776 source_location location; /* for EH checking */
9777 #else
9778 int location; /* for EH checking */
9779 #endif
9780
9781 /* 15.10.1 Field Access Using a Primary */
9782 switch (TREE_CODE (qual_wfl))
9783 {
9784 case CALL_EXPR:
9785 case NEW_CLASS_EXPR:
9786 /* If the access to the function call is a non static field,
9787 build the code to access it. */
9788 if (JDECL_P (decl) && !FIELD_STATIC (decl))
9789 {
9790 decl = maybe_access_field (decl, *where_found,
9791 DECL_CONTEXT (decl));
9792 if (decl == error_mark_node)
9793 return 1;
9794 }
9795
9796 /* And code for the function call */
9797 if (complete_function_arguments (qual_wfl))
9798 return 1;
9799
9800 /* We might have to setup a new current class and a new this
9801 for the search of an inner class, relative to the type of
9802 a expression resolved as `decl'. The current values are
9803 saved and restored shortly after */
9804 saved_current = current_class;
9805 saved_this = current_this;
9806 if (decl
9807 && (TREE_CODE (qual_wfl) == NEW_CLASS_EXPR
9808 || from_qualified_this))
9809 {
9810 /* If we still have `from_qualified_this', we have the form
9811 <T>.this.f() and we need to build <T>.this */
9812 if (from_qualified_this)
9813 {
9814 decl = build_access_to_thisn (current_class, type, 0);
9815 decl = java_complete_tree (decl);
9816 type = TREE_TYPE (TREE_TYPE (decl));
9817 }
9818 current_class = type;
9819 current_this = decl;
9820 from_qualified_this = 0;
9821 }
9822
9823 if (from_super && TREE_CODE (qual_wfl) == CALL_EXPR)
9824 CALL_USING_SUPER (qual_wfl) = 1;
9825 #ifdef USE_MAPPED_LOCATION
9826 location = (TREE_CODE (qual_wfl) == CALL_EXPR
9827 ? EXPR_LOCATION (TREE_OPERAND (qual_wfl, 0))
9828 : UNKNOWN_LOCATION);
9829 #else
9830 location = (TREE_CODE (qual_wfl) == CALL_EXPR ?
9831 EXPR_WFL_LINECOL (TREE_OPERAND (qual_wfl, 0)) : 0);
9832 #endif
9833 *where_found = patch_method_invocation (qual_wfl, decl, type,
9834 from_super,
9835 &is_static, &ret_decl);
9836 from_super = 0;
9837 if (*where_found == error_mark_node)
9838 {
9839 RESTORE_THIS_AND_CURRENT_CLASS;
9840 return 1;
9841 }
9842 *type_found = type = QUAL_DECL_TYPE (*where_found);
9843
9844 *where_found = force_evaluation_order (*where_found);
9845
9846 /* If we're creating an inner class instance, check for that
9847 an enclosing instance is in scope */
9848 if (TREE_CODE (qual_wfl) == NEW_CLASS_EXPR
9849 && INNER_ENCLOSING_SCOPE_CHECK (type))
9850 {
9851 parse_error_context
9852 (qual_wfl, "No enclosing instance for inner class %qs is in scope%s",
9853 lang_printable_name (type, 0),
9854 (!current_this ? "" :
9855 "; an explicit one must be provided when creating this inner class"));
9856 RESTORE_THIS_AND_CURRENT_CLASS;
9857 return 1;
9858 }
9859
9860 /* In case we had to change then to resolve a inner class
9861 instantiation using a primary qualified by a `new' */
9862 RESTORE_THIS_AND_CURRENT_CLASS;
9863
9864 #ifdef USE_MAPPED_LOCATION
9865 if (location != UNKNOWN_LOCATION)
9866 #else
9867 if (location)
9868 #endif
9869 {
9870 tree arguments = NULL_TREE;
9871 if (TREE_CODE (qual_wfl) == CALL_EXPR
9872 && TREE_OPERAND (qual_wfl, 1) != NULL_TREE)
9873 arguments = TREE_VALUE (TREE_OPERAND (qual_wfl, 1));
9874 check_thrown_exceptions (location, ret_decl, arguments);
9875 }
9876
9877 /* If the previous call was static and this one is too,
9878 build a compound expression to hold the two (because in
9879 that case, previous function calls aren't transported as
9880 forcoming function's argument. */
9881 if (previous_call_static && is_static)
9882 {
9883 /* We must set CAN_COMPLETE_NORMALLY for the first call
9884 since it is done nowhere else. */
9885 CAN_COMPLETE_NORMALLY (decl) = 1;
9886 decl = build2 (COMPOUND_EXPR, TREE_TYPE (*where_found),
9887 decl, *where_found);
9888 TREE_SIDE_EFFECTS (decl) = 1;
9889 }
9890 else
9891 {
9892 previous_call_static = is_static;
9893 decl = *where_found;
9894 }
9895 from_type = 0;
9896 continue;
9897
9898 case NEW_ARRAY_EXPR:
9899 case NEW_ANONYMOUS_ARRAY_EXPR:
9900 *where_found = decl = java_complete_tree (qual_wfl);
9901 if (decl == error_mark_node)
9902 return 1;
9903 *type_found = type = QUAL_DECL_TYPE (decl);
9904 continue;
9905
9906 case CONVERT_EXPR:
9907 *where_found = decl = java_complete_tree (qual_wfl);
9908 if (decl == error_mark_node)
9909 return 1;
9910 *type_found = type = QUAL_DECL_TYPE (decl);
9911 from_cast = 1;
9912 continue;
9913
9914 case CONDITIONAL_EXPR:
9915 case STRING_CST:
9916 case MODIFY_EXPR:
9917 *where_found = decl = java_complete_tree (qual_wfl);
9918 if (decl == error_mark_node)
9919 return 1;
9920 *type_found = type = QUAL_DECL_TYPE (decl);
9921 continue;
9922
9923 case ARRAY_REF:
9924 /* If the access to the function call is a non static field,
9925 build the code to access it. */
9926 if (JDECL_P (decl) && !FIELD_STATIC (decl))
9927 {
9928 decl = maybe_access_field (decl, *where_found, type);
9929 if (decl == error_mark_node)
9930 return 1;
9931 }
9932 /* And code for the array reference expression */
9933 decl = java_complete_tree (qual_wfl);
9934 if (decl == error_mark_node)
9935 return 1;
9936 type = QUAL_DECL_TYPE (decl);
9937 continue;
9938
9939 case PLUS_EXPR:
9940 if ((decl = java_complete_tree (qual_wfl)) == error_mark_node)
9941 return 1;
9942 if ((type = patch_string (decl)))
9943 decl = type;
9944 *where_found = QUAL_RESOLUTION (q) = decl;
9945 *type_found = type = TREE_TYPE (decl);
9946 break;
9947
9948 case CLASS_LITERAL:
9949 if ((decl = java_complete_tree (qual_wfl)) == error_mark_node)
9950 return 1;
9951 *where_found = QUAL_RESOLUTION (q) = decl;
9952 *type_found = type = TREE_TYPE (decl);
9953 break;
9954
9955 default:
9956 /* Fix for -Wall Just go to the next statement. Don't
9957 continue */
9958 break;
9959 }
9960
9961 /* If we fall here, we weren't processing a (static) function call. */
9962 previous_call_static = 0;
9963
9964 /* It can be the keyword THIS */
9965 if (TREE_CODE (qual_wfl) == EXPR_WITH_FILE_LOCATION
9966 && EXPR_WFL_NODE (qual_wfl) == this_identifier_node)
9967 {
9968 if (!current_this)
9969 {
9970 parse_error_context
9971 (wfl, "Keyword %<this%> used outside allowed context");
9972 return 1;
9973 }
9974 if (ctxp->explicit_constructor_p
9975 && type == current_class)
9976 {
9977 parse_error_context (wfl, "Can't reference %<this%> before the superclass constructor has been called");
9978 return 1;
9979 }
9980 /* We have to generate code for intermediate access */
9981 if (!from_type || TREE_TYPE (TREE_TYPE (current_this)) == type)
9982 {
9983 *where_found = decl = current_this;
9984 *type_found = type = QUAL_DECL_TYPE (decl);
9985 }
9986 /* We're trying to access the this from somewhere else. Make sure
9987 it's allowed before doing so. */
9988 else
9989 {
9990 if (!enclosing_context_p (type, current_class))
9991 {
9992 char *p = xstrdup (lang_printable_name (type, 0));
9993 parse_error_context (qual_wfl, "Can't use variable %<%s.this%>: type %qs isn't an outer type of type %qs",
9994 p, p,
9995 lang_printable_name (current_class, 0));
9996 free (p);
9997 return 1;
9998 }
9999 from_qualified_this = 1;
10000 /* If there's nothing else after that, we need to
10001 produce something now, otherwise, the section of the
10002 code that needs to produce <T>.this will generate
10003 what is necessary. */
10004 if (!TREE_CHAIN (q))
10005 {
10006 decl = build_access_to_thisn (current_class, type, 0);
10007 *where_found = decl = java_complete_tree (decl);
10008 *type_found = type = TREE_TYPE (decl);
10009 }
10010 }
10011
10012 from_type = 0;
10013 continue;
10014 }
10015
10016 /* 15.10.2 Accessing Superclass Members using SUPER */
10017 if (TREE_CODE (qual_wfl) == EXPR_WITH_FILE_LOCATION
10018 && EXPR_WFL_NODE (qual_wfl) == super_identifier_node)
10019 {
10020 tree node;
10021 /* Check on the restricted use of SUPER */
10022 if (METHOD_STATIC (current_function_decl)
10023 || current_class == object_type_node)
10024 {
10025 parse_error_context
10026 (wfl, "Keyword %<super%> used outside allowed context");
10027 return 1;
10028 }
10029 /* Otherwise, treat SUPER as (SUPER_CLASS)THIS */
10030 node = build_cast (EXPR_WFL_LINECOL (qual_wfl),
10031 CLASSTYPE_SUPER (current_class),
10032 build_this (EXPR_WFL_LINECOL (qual_wfl)));
10033 *where_found = decl = java_complete_tree (node);
10034 if (decl == error_mark_node)
10035 return 1;
10036 *type_found = type = QUAL_DECL_TYPE (decl);
10037 from_super = from_type = 1;
10038 continue;
10039 }
10040
10041 /* 15.13.1: Can't search for field name in packages, so we
10042 assume a variable/class name was meant. */
10043 if (RESOLVE_PACKAGE_NAME_P (qual_wfl))
10044 {
10045 tree name;
10046 if ((decl = resolve_package (wfl, &q, &name)))
10047 {
10048 tree list;
10049 *where_found = decl;
10050
10051 check_pkg_class_access (DECL_NAME (decl), qual_wfl, true, NULL);
10052
10053 /* We want to be absolutely sure that the class is laid
10054 out. We're going to search something inside it. */
10055 *type_found = type = TREE_TYPE (decl);
10056 layout_class (type);
10057 from_type = 1;
10058
10059 /* Fix them all the way down, if any are left. */
10060 if (q)
10061 {
10062 list = TREE_CHAIN (q);
10063 while (list)
10064 {
10065 RESOLVE_PACKAGE_NAME_P (QUAL_WFL (list)) = 0;
10066 list = TREE_CHAIN (list);
10067 }
10068 }
10069 }
10070 else
10071 {
10072 if (from_super || from_cast)
10073 parse_error_context
10074 ((from_cast ? qual_wfl : wfl),
10075 "No variable %qs defined in class %qs",
10076 IDENTIFIER_POINTER (EXPR_WFL_NODE (qual_wfl)),
10077 lang_printable_name (type, 0));
10078 else
10079 parse_error_context
10080 (qual_wfl, "Undefined variable or class name: %qs",
10081 IDENTIFIER_POINTER (name));
10082 return 1;
10083 }
10084 }
10085
10086 /* We have a type name. It's been already resolved when the
10087 expression was qualified. */
10088 else if (RESOLVE_TYPE_NAME_P (qual_wfl) && QUAL_RESOLUTION (q))
10089 {
10090 decl = QUAL_RESOLUTION (q);
10091
10092 /* Sneak preview. If next we see a `new', we're facing a
10093 qualification which resulted in a type being selected
10094 instead of a field. Report the error. */
10095 if(TREE_CHAIN (q)
10096 && TREE_CODE (TREE_PURPOSE (TREE_CHAIN (q))) == NEW_CLASS_EXPR)
10097 {
10098 parse_error_context (qual_wfl, "Undefined variable %qs",
10099 IDENTIFIER_POINTER (EXPR_WFL_NODE (wfl)));
10100 return 1;
10101 }
10102
10103 check_pkg_class_access (DECL_NAME (decl), qual_wfl, true, NULL);
10104
10105 check_deprecation (qual_wfl, decl);
10106
10107 type = TREE_TYPE (decl);
10108 from_type = 1;
10109 }
10110 /* We resolve an expression name */
10111 else
10112 {
10113 tree field_decl = NULL_TREE;
10114
10115 /* If there exists an early resolution, use it. That occurs
10116 only once and we know that there are more things to
10117 come. Don't do that when processing something after SUPER
10118 (we need more thing to be put in place below */
10119 if (!from_super && QUAL_RESOLUTION (q))
10120 {
10121 decl = QUAL_RESOLUTION (q);
10122 if (!type)
10123 {
10124 if (TREE_CODE (decl) == FIELD_DECL
10125 || TREE_CODE (decl) == VAR_DECL)
10126 {
10127 if (TREE_CODE (decl) == FIELD_DECL
10128 && !FIELD_STATIC (decl))
10129 {
10130 if (current_this)
10131 *where_found = current_this;
10132 else
10133 {
10134 static_ref_err (qual_wfl, DECL_NAME (decl),
10135 current_class);
10136 return 1;
10137 }
10138 }
10139 else
10140 {
10141 *where_found = TREE_TYPE (decl);
10142 if (TREE_CODE (*where_found) == POINTER_TYPE)
10143 *where_found = TREE_TYPE (*where_found);
10144 }
10145 if (nested_member_access_p (current_class, decl))
10146 decl = build_nested_field_access (qual_wfl, decl);
10147 }
10148 else
10149 {
10150 *where_found = TREE_TYPE (decl);
10151 if (TREE_CODE (*where_found) == POINTER_TYPE)
10152 *where_found = TREE_TYPE (*where_found);
10153 }
10154 }
10155 }
10156
10157 /* Report and error if we're using a numerical literal as a
10158 qualifier. It can only be an INTEGER_CST. */
10159 else if (TREE_CODE (qual_wfl) == INTEGER_CST)
10160 {
10161 parse_error_context
10162 (wfl, "Can't use type %qs as a qualifier",
10163 lang_printable_name (TREE_TYPE (qual_wfl), 0));
10164 return 1;
10165 }
10166
10167 /* We have to search for a field, knowing the type of its
10168 container. The flag FROM_TYPE indicates that we resolved
10169 the last member of the expression as a type name, which
10170 means that for the resolution of this field, we'll look
10171 for other errors than if it was resolved as a member of
10172 an other field. */
10173 else
10174 {
10175 int is_static;
10176 tree field_decl_type; /* For layout */
10177
10178 if (!from_type && !JREFERENCE_TYPE_P (type))
10179 {
10180 parse_error_context
10181 (qual_wfl, "Attempt to reference field %qs in %<%s %s%>",
10182 IDENTIFIER_POINTER (EXPR_WFL_NODE (qual_wfl)),
10183 lang_printable_name (type, 0),
10184 IDENTIFIER_POINTER (DECL_NAME (decl)));
10185 return 1;
10186 }
10187
10188 field_decl = lookup_field_wrapper (type,
10189 EXPR_WFL_NODE (qual_wfl));
10190
10191 /* Maybe what we're trying to access to is an inner
10192 class, only if decl is a TYPE_DECL. */
10193 if (!field_decl && TREE_CODE (decl) == TYPE_DECL)
10194 {
10195 tree ptr, inner_decl;
10196
10197 BUILD_PTR_FROM_NAME (ptr, EXPR_WFL_NODE (qual_wfl));
10198 inner_decl = resolve_class (decl, ptr, NULL_TREE, qual_wfl);
10199 if (inner_decl)
10200 {
10201 check_inner_class_access (inner_decl, decl, qual_wfl);
10202 type = TREE_TYPE (inner_decl);
10203 decl = inner_decl;
10204 from_type = 1;
10205 continue;
10206 }
10207 }
10208
10209 if (field_decl == NULL_TREE)
10210 {
10211 parse_error_context
10212 (qual_wfl, "No variable %qs defined in type %qs",
10213 IDENTIFIER_POINTER (EXPR_WFL_NODE (qual_wfl)),
10214 GET_TYPE_NAME (type));
10215 return 1;
10216 }
10217 if (field_decl == error_mark_node)
10218 return 1;
10219
10220 /* Layout the type of field_decl, since we may need
10221 it. Don't do primitive types or loaded classes. The
10222 situation of non primitive arrays may not handled
10223 properly here. FIXME */
10224 if (TREE_CODE (TREE_TYPE (field_decl)) == POINTER_TYPE)
10225 field_decl_type = TREE_TYPE (TREE_TYPE (field_decl));
10226 else
10227 field_decl_type = TREE_TYPE (field_decl);
10228 if (!JPRIMITIVE_TYPE_P (field_decl_type)
10229 && !CLASS_LOADED_P (field_decl_type)
10230 && !TYPE_ARRAY_P (field_decl_type))
10231 resolve_and_layout (field_decl_type, NULL_TREE);
10232
10233 /* Check on accessibility here */
10234 if (not_accessible_p (current_class, field_decl,
10235 *type_found, from_super))
10236 return not_accessible_field_error (qual_wfl,field_decl);
10237 check_deprecation (qual_wfl, field_decl);
10238
10239 /* There are things to check when fields are accessed
10240 from type. There are no restrictions on a static
10241 declaration of the field when it is accessed from an
10242 interface */
10243 is_static = FIELD_STATIC (field_decl);
10244 if (!from_super && from_type
10245 && !TYPE_INTERFACE_P (type)
10246 && !is_static
10247 && (current_function_decl
10248 && METHOD_STATIC (current_function_decl)))
10249 {
10250 static_ref_err (qual_wfl, EXPR_WFL_NODE (qual_wfl), type);
10251 return 1;
10252 }
10253 from_cast = from_super = 0;
10254
10255 /* If it's an access from a type but isn't static, we
10256 make it relative to `this'. */
10257 if (!is_static && from_type)
10258 decl = current_this;
10259
10260 /* If we need to generate something to get a proper
10261 handle on what this field is accessed from, do it
10262 now. */
10263 if (!is_static)
10264 {
10265 decl = maybe_access_field (decl, *where_found, *type_found);
10266 if (decl == error_mark_node)
10267 return 1;
10268 }
10269
10270 /* We want to keep the location where we found it, and the
10271 type we found. */
10272 *where_found = decl;
10273 *type_found = type;
10274
10275 /* Generate the correct expression for field access from
10276 qualified this */
10277 if (from_qualified_this)
10278 {
10279 field_decl
10280 = build_nested_field_access (qual_wfl, field_decl);
10281 from_qualified_this = 0;
10282 }
10283
10284 /* If needed, generate accessors for static field access. */
10285 if (is_static
10286 && FIELD_PRIVATE (field_decl)
10287 && flag_emit_class_files
10288 && nested_member_access_p (current_class, field_decl))
10289 field_decl = build_nested_field_access (qual_wfl, field_decl);
10290
10291 /* This is the decl found and eventually the next one to
10292 search from */
10293 decl = field_decl;
10294 }
10295 from_type = 0;
10296 type = QUAL_DECL_TYPE (decl);
10297
10298 /* Sneak preview. If decl is qualified by a `new', report
10299 the error here to be accurate on the peculiar construct */
10300 if (TREE_CHAIN (q)
10301 && TREE_CODE (TREE_PURPOSE (TREE_CHAIN (q))) == NEW_CLASS_EXPR
10302 && !JREFERENCE_TYPE_P (type))
10303 {
10304 parse_error_context (qual_wfl, "Attempt to reference field %<new%> in a %qs",
10305 lang_printable_name (type, 0));
10306 return 1;
10307 }
10308 }
10309 /* `q' might have changed due to a after package resolution
10310 re-qualification */
10311 if (!q)
10312 break;
10313 }
10314 *found_decl = decl;
10315 return 0;
10316 }
10317
10318 /* 6.6 Qualified name and access control. Returns 1 if MEMBER (a decl)
10319 can't be accessed from REFERENCE (a record type). If MEMBER
10320 features a protected access, we then use WHERE which, if non null,
10321 holds the type of MEMBER's access that is checked against
10322 6.6.2.1. This function should be used when decl is a field or a
10323 method. */
10324
10325 static int
10326 not_accessible_p (tree reference, tree member, tree where, int from_super)
10327 {
10328 int access_flag = get_access_flags_from_decl (member);
10329 bool is_static = false;
10330
10331 if (TREE_CODE (member) == FIELD_DECL ||
10332 TREE_CODE (member) == VAR_DECL)
10333 is_static = FIELD_STATIC (member);
10334 else
10335 is_static = METHOD_STATIC (member);
10336
10337 /* Access always granted for members declared public */
10338 if (access_flag & ACC_PUBLIC)
10339 return 0;
10340
10341 /* Check access on protected members */
10342 if (access_flag & ACC_PROTECTED)
10343 {
10344 /* Access granted if it occurs from within the package
10345 containing the class in which the protected member is
10346 declared */
10347 if (class_in_current_package (DECL_CONTEXT (member)))
10348 return 0;
10349
10350 /* If accessed with the form `super.member', then access is granted */
10351 if (from_super)
10352 return 0;
10353
10354 /* If WHERE is active, access was made through a qualifier. For
10355 non-static members, access is granted if the type of the qualifier
10356 is or is a sublass of the type the access is made from (6.6.2.1.) */
10357 if (where && !is_static)
10358 {
10359 while (reference)
10360 {
10361 if (inherits_from_p (where, reference))
10362 return 0;
10363 if (INNER_CLASS_TYPE_P (reference))
10364 reference = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (reference)));
10365 else
10366 break;
10367 }
10368 return 1;
10369 }
10370
10371 /* Otherwise, access is granted if occurring from within the class
10372 where member is declared, or a subclass of it. */
10373 while (reference)
10374 {
10375 if (inherits_from_p (reference, DECL_CONTEXT (member)))
10376 return 0;
10377 if (INNER_CLASS_TYPE_P (reference))
10378 reference = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (reference)));
10379 else
10380 break;
10381 }
10382 return 1;
10383 }
10384
10385 /* Check access on private members. Access is granted only if it
10386 occurs from within the class in which it is declared -- that does
10387 it for innerclasses too. */
10388 if (access_flag & ACC_PRIVATE)
10389 {
10390 if (reference == DECL_CONTEXT (member) ||
10391 common_enclosing_context_p (DECL_CONTEXT (member), reference))
10392 return 0;
10393 return 1;
10394 }
10395
10396 /* Default access is permitted only when occurring from within the
10397 package in which the context (MEMBER) is declared. */
10398 return !class_in_current_package (DECL_CONTEXT (member));
10399 }
10400
10401 /* Test deprecated decl access. */
10402 static void
10403 check_deprecation (tree wfl, tree decl)
10404 {
10405 const char *file;
10406 tree elt;
10407
10408 if (! warn_deprecated)
10409 return;
10410
10411 /* We want to look at the element type of arrays here, so we strip
10412 all surrounding array types. */
10413 if (TYPE_ARRAY_P (TREE_TYPE (decl)))
10414 {
10415 elt = TREE_TYPE (decl);
10416 while (TYPE_ARRAY_P (elt))
10417 elt = TYPE_ARRAY_ELEMENT (elt);
10418 /* We'll end up with a pointer type, so we use TREE_TYPE to go
10419 to the record. */
10420 decl = TYPE_NAME (TREE_TYPE (elt));
10421 }
10422 file = DECL_SOURCE_FILE (decl);
10423
10424 /* Complain if the field is deprecated and the file it was defined
10425 in isn't compiled at the same time the file which contains its
10426 use is */
10427 if (DECL_DEPRECATED (decl)
10428 && !IS_A_COMMAND_LINE_FILENAME_P (get_identifier (file)))
10429 {
10430 const char *the;
10431 switch (TREE_CODE (decl))
10432 {
10433 case FUNCTION_DECL:
10434 the = "method";
10435 break;
10436 case FIELD_DECL:
10437 case VAR_DECL:
10438 the = "field";
10439 break;
10440 case TYPE_DECL:
10441 parse_warning_context (wfl, "The class %qs has been deprecated",
10442 IDENTIFIER_POINTER (DECL_NAME (decl)));
10443 return;
10444 default:
10445 abort ();
10446 }
10447 /* Don't issue a message if the context as been deprecated as a
10448 whole. */
10449 if (! CLASS_DEPRECATED (TYPE_NAME (DECL_CONTEXT (decl))))
10450 parse_warning_context
10451 (wfl, "The %s %qs in class %qs has been deprecated",
10452 the, lang_printable_name (decl, 0),
10453 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (DECL_CONTEXT (decl)))));
10454 }
10455 }
10456
10457 /* Returns 1 if class was declared in the current package, 0 otherwise */
10458
10459 static int
10460 class_in_current_package (tree class)
10461 {
10462 if (TYPE_PACKAGE (current_class) == TYPE_PACKAGE (class))
10463 return 1;
10464 return 0;
10465 }
10466
10467 /* This function may generate code to access DECL from WHERE. This is
10468 done only if certain conditions meet. */
10469
10470 static tree
10471 maybe_access_field (tree decl, tree where, tree type)
10472 {
10473 if (TREE_CODE (decl) == FIELD_DECL && decl != current_this
10474 && !FIELD_STATIC (decl))
10475 decl = build_field_ref (where ? where : current_this,
10476 (type ? type : DECL_CONTEXT (decl)),
10477 DECL_NAME (decl));
10478 return decl;
10479 }
10480
10481 /* Build a method invocation, by patching PATCH. If non NULL
10482 and according to the situation, PRIMARY and WHERE may be
10483 used. IS_STATIC is set to 1 if the invoked function is static. */
10484
10485 static tree
10486 patch_method_invocation (tree patch, tree primary, tree where, int from_super,
10487 int *is_static, tree *ret_decl)
10488 {
10489 tree wfl = TREE_OPERAND (patch, 0);
10490 tree args = TREE_OPERAND (patch, 1);
10491 tree name = EXPR_WFL_NODE (wfl);
10492 tree list;
10493 int is_static_flag = 0;
10494 int is_super_init = 0;
10495 tree this_arg = NULL_TREE;
10496 int is_array_clone_call = 0;
10497
10498 /* Should be overridden if everything goes well. Otherwise, if
10499 something fails, it should keep this value. It stop the
10500 evaluation of a bogus assignment. See java_complete_tree,
10501 MODIFY_EXPR: for the reasons why we sometimes want to keep on
10502 evaluating an assignment */
10503 TREE_TYPE (patch) = error_mark_node;
10504
10505 /* Since lookup functions are messing with line numbers, save the
10506 context now. */
10507 java_parser_context_save_global ();
10508
10509 /* 15.11.1: Compile-Time Step 1: Determine Class or Interface to Search */
10510
10511 /* Resolution of qualified name, excluding constructors */
10512 if (QUALIFIED_P (name) && !CALL_CONSTRUCTOR_P (patch))
10513 {
10514 tree identifier, identifier_wfl, type, resolved;
10515 /* Extract the last IDENTIFIER of the qualified
10516 expression. This is a wfl and we will use it's location
10517 data during error report. */
10518 identifier_wfl = cut_identifier_in_qualified (wfl);
10519 identifier = EXPR_WFL_NODE (identifier_wfl);
10520
10521 /* Given the context, IDENTIFIER is syntactically qualified
10522 as a MethodName. We need to qualify what's before */
10523 qualify_ambiguous_name (wfl);
10524 resolved = resolve_field_access (wfl, NULL, NULL);
10525
10526 if (TREE_CODE (resolved) == VAR_DECL && FIELD_STATIC (resolved)
10527 && FIELD_FINAL (resolved)
10528 && !inherits_from_p (DECL_CONTEXT (resolved), current_class)
10529 && !flag_emit_class_files)
10530 resolved = build_class_init (DECL_CONTEXT (resolved), resolved);
10531
10532 if (resolved == error_mark_node)
10533 PATCH_METHOD_RETURN_ERROR ();
10534
10535 type = GET_SKIP_TYPE (resolved);
10536 resolve_and_layout (type, NULL_TREE);
10537
10538 if (JPRIMITIVE_TYPE_P (type))
10539 {
10540 parse_error_context
10541 (identifier_wfl,
10542 "Can't invoke a method on primitive type %qs",
10543 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type))));
10544 PATCH_METHOD_RETURN_ERROR ();
10545 }
10546
10547 list = lookup_method_invoke (0, identifier_wfl, type, identifier, args);
10548 args = nreverse (args);
10549
10550 /* We're resolving a call from a type */
10551 if (TREE_CODE (resolved) == TYPE_DECL)
10552 {
10553 if (CLASS_INTERFACE (resolved))
10554 {
10555 parse_error_context
10556 (identifier_wfl,
10557 "Can't make static reference to method %qs in interface %qs",
10558 IDENTIFIER_POINTER (identifier),
10559 IDENTIFIER_POINTER (name));
10560 PATCH_METHOD_RETURN_ERROR ();
10561 }
10562 if (list)
10563 {
10564 if (METHOD_STATIC (list))
10565 maybe_use_access_method (0, &list, NULL);
10566 else
10567 {
10568 char *fct_name = xstrdup (lang_printable_name (list, 2));
10569 parse_error_context
10570 (identifier_wfl,
10571 "Can't make static reference to method %<%s %s%> in class %qs",
10572 lang_printable_name (TREE_TYPE (TREE_TYPE (list)), 0),
10573 fct_name,
10574 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type))));
10575 free (fct_name);
10576 PATCH_METHOD_RETURN_ERROR ();
10577 }
10578 }
10579 }
10580 else
10581 this_arg = primary = resolved;
10582
10583 if (TYPE_ARRAY_P (type) && identifier == get_identifier ("clone"))
10584 is_array_clone_call = 1;
10585
10586 /* IDENTIFIER_WFL will be used to report any problem further */
10587 wfl = identifier_wfl;
10588 }
10589 /* Resolution of simple names, names generated after a primary: or
10590 constructors */
10591 else
10592 {
10593 tree class_to_search = NULL_TREE;
10594 int lc; /* Looking for Constructor */
10595
10596 /* We search constructor in their target class */
10597 if (CALL_CONSTRUCTOR_P (patch))
10598 {
10599 if (TREE_CODE (patch) == NEW_CLASS_EXPR)
10600 class_to_search = EXPR_WFL_NODE (wfl);
10601 else if (EXPR_WFL_NODE (TREE_OPERAND (patch, 0)) ==
10602 this_identifier_node)
10603 class_to_search = NULL_TREE;
10604 else if (EXPR_WFL_NODE (TREE_OPERAND (patch, 0)) ==
10605 super_identifier_node)
10606 {
10607 is_super_init = 1;
10608 if (CLASSTYPE_SUPER (current_class))
10609 class_to_search =
10610 DECL_NAME (TYPE_NAME (CLASSTYPE_SUPER (current_class)));
10611 else
10612 {
10613 parse_error_context (wfl, "Can't invoke super constructor on java.lang.Object");
10614 PATCH_METHOD_RETURN_ERROR ();
10615 }
10616 }
10617
10618 /* Class to search is NULL if we're searching the current one */
10619 if (class_to_search)
10620 {
10621 class_to_search = resolve_and_layout (class_to_search, wfl);
10622
10623 if (!class_to_search)
10624 {
10625 parse_error_context
10626 (wfl, "Class %qs not found in type declaration",
10627 IDENTIFIER_POINTER (EXPR_WFL_NODE (wfl)));
10628 PATCH_METHOD_RETURN_ERROR ();
10629 }
10630
10631 /* Can't instantiate an abstract class, but we can
10632 invoke it's constructor. It's use within the `new'
10633 context is denied here. */
10634 if (CLASS_ABSTRACT (class_to_search)
10635 && TREE_CODE (patch) == NEW_CLASS_EXPR)
10636 {
10637 parse_error_context
10638 (wfl, "Class %qs is an abstract class. It can't be instantiated",
10639 IDENTIFIER_POINTER (EXPR_WFL_NODE (wfl)));
10640 PATCH_METHOD_RETURN_ERROR ();
10641 }
10642
10643 class_to_search = TREE_TYPE (class_to_search);
10644 }
10645 else
10646 class_to_search = current_class;
10647 lc = 1;
10648 }
10649 /* This is a regular search in the local class, unless an
10650 alternate class is specified. */
10651 else
10652 {
10653 if (where != NULL_TREE)
10654 class_to_search = where;
10655 else if (QUALIFIED_P (name))
10656 class_to_search = current_class;
10657 else
10658 {
10659 class_to_search = current_class;
10660
10661 for (;;)
10662 {
10663 if (has_method (class_to_search, name))
10664 break;
10665 if (! INNER_CLASS_TYPE_P (class_to_search))
10666 {
10667 parse_error_context (wfl,
10668 "No method named %qs in scope",
10669 IDENTIFIER_POINTER (name));
10670 PATCH_METHOD_RETURN_ERROR ();
10671 }
10672 class_to_search
10673 = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (class_to_search)));
10674 }
10675 }
10676 lc = 0;
10677 }
10678
10679 /* NAME is a simple identifier or comes from a primary. Search
10680 in the class whose declaration contain the method being
10681 invoked. */
10682 resolve_and_layout (class_to_search, NULL_TREE);
10683
10684 list = lookup_method_invoke (lc, wfl, class_to_search, name, args);
10685 /* Don't continue if no method were found, as the next statement
10686 can't be executed then. */
10687 if (!list)
10688 PATCH_METHOD_RETURN_ERROR ();
10689
10690 if (TYPE_ARRAY_P (class_to_search)
10691 && DECL_NAME (list) == get_identifier ("clone"))
10692 is_array_clone_call = 1;
10693
10694 /* Check for static reference of non static methods. */
10695 if (check_for_static_method_reference (wfl, patch, list,
10696 class_to_search, primary))
10697 PATCH_METHOD_RETURN_ERROR ();
10698
10699 /* Check for inner classes creation from illegal contexts */
10700 if (lc && (INNER_CLASS_TYPE_P (class_to_search)
10701 && !CLASS_STATIC (TYPE_NAME (class_to_search)))
10702 && INNER_ENCLOSING_SCOPE_CHECK (class_to_search)
10703 && !DECL_INIT_P (current_function_decl))
10704 {
10705 parse_error_context
10706 (wfl, "No enclosing instance for inner class %qs is in scope%s",
10707 lang_printable_name (class_to_search, 0),
10708 (!current_this ? "" :
10709 "; an explicit one must be provided when creating this inner class"));
10710 PATCH_METHOD_RETURN_ERROR ();
10711 }
10712
10713 /* Non static methods are called with the current object extra
10714 argument. If PATCH is a `new TYPE()', the argument is the value
10715 returned by the object allocator. If method is resolved as a
10716 primary, use the primary otherwise use the current THIS. */
10717 args = nreverse (args);
10718 if (TREE_CODE (patch) != NEW_CLASS_EXPR)
10719 {
10720 this_arg = primary ? primary : current_this;
10721
10722 /* If we're using an access method, things are different.
10723 There are two family of cases:
10724
10725 1) We're not generating bytecodes:
10726
10727 - LIST is non-static. Its invocation is transformed from
10728 x(a1,...,an) into this$<n>.x(a1,....an).
10729 - LIST is static. Its invocation is transformed from
10730 x(a1,...,an) into TYPE_OF(this$<n>).x(a1,....an)
10731
10732 2) We're generating bytecodes:
10733
10734 - LIST is non-static. Its invocation is transformed from
10735 x(a1,....,an) into access$<n>(this$<n>,a1,...,an).
10736 - LIST is static. Its invocation is transformed from
10737 x(a1,....,an) into TYPE_OF(this$<n>).x(a1,....an).
10738
10739 Of course, this$<n> can be arbitrarily complex, ranging from
10740 this$0 (the immediate outer context) to
10741 access$0(access$0(...(this$0))).
10742
10743 maybe_use_access_method returns a nonzero value if the
10744 this_arg has to be moved into the (then generated) stub
10745 argument list. In the meantime, the selected function
10746 might have been replaced by a generated stub. */
10747 if (METHOD_STATIC (list))
10748 maybe_use_access_method (0, &list, NULL);
10749 else if (!primary &&
10750 maybe_use_access_method (is_super_init, &list, &this_arg))
10751 {
10752 args = tree_cons (NULL_TREE, this_arg, args);
10753 this_arg = NULL_TREE; /* So it doesn't get chained twice */
10754 }
10755 }
10756 }
10757
10758 /* Merge point of all resolution schemes. If we have nothing, this
10759 is an error, already signaled */
10760 if (!list)
10761 PATCH_METHOD_RETURN_ERROR ();
10762
10763 /* Check accessibility, position the is_static flag, build and
10764 return the call */
10765 if (not_accessible_p (DECL_CONTEXT (current_function_decl), list,
10766 (primary ? TREE_TYPE (TREE_TYPE (primary)) :
10767 NULL_TREE), from_super)
10768 /* Calls to clone() on array types are permitted as a special-case. */
10769 && !is_array_clone_call)
10770 {
10771 const char *const fct_name = IDENTIFIER_POINTER (DECL_NAME (list));
10772 const char *const access =
10773 accessibility_string (get_access_flags_from_decl (list));
10774 const char *const klass =
10775 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (DECL_CONTEXT (list))));
10776 const char *const refklass =
10777 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (current_class)));
10778 const char *const what = (DECL_CONSTRUCTOR_P (list)
10779 ? "constructor" : "method");
10780 parse_error_context (wfl,
10781 "Can't access %s %s %<%s.%s%> from %qs",
10782 access, what, klass, fct_name, refklass);
10783 PATCH_METHOD_RETURN_ERROR ();
10784 }
10785
10786 /* Deprecation check: check whether the method being invoked or the
10787 instance-being-created's type are deprecated. */
10788 if (TREE_CODE (patch) == NEW_CLASS_EXPR)
10789 check_deprecation (wfl, TYPE_NAME (DECL_CONTEXT (list)));
10790 check_deprecation (wfl, list);
10791
10792 /* If invoking a innerclass constructor, there are hidden parameters
10793 to pass */
10794 if (TREE_CODE (patch) == NEW_CLASS_EXPR
10795 && PURE_INNER_CLASS_TYPE_P (DECL_CONTEXT (list)))
10796 {
10797 /* And make sure we add the accessed local variables to be saved
10798 in field aliases. */
10799 args = build_alias_initializer_parameter_list
10800 (AIPL_FUNCTION_CTOR_INVOCATION, DECL_CONTEXT (list), args, NULL);
10801
10802 /* Secretly pass the current_this/primary as a second argument */
10803 if (primary || current_this)
10804 {
10805 tree extra_arg;
10806 tree this_type = (current_this ?
10807 TREE_TYPE (TREE_TYPE (current_this)) : NULL_TREE);
10808 /* Method's (list) enclosing context */
10809 tree mec = DECL_CONTEXT (TYPE_NAME (DECL_CONTEXT (list)));
10810 /* If we have a primary, use it. */
10811 if (primary)
10812 extra_arg = primary;
10813 /* The current `this' is an inner class but isn't a direct
10814 enclosing context for the inner class we're trying to
10815 create. Build an access to the proper enclosing context
10816 and use it. */
10817 else if (current_this && PURE_INNER_CLASS_TYPE_P (this_type)
10818 && this_type != TREE_TYPE (mec))
10819 {
10820
10821 extra_arg = build_access_to_thisn (current_class,
10822 TREE_TYPE (mec), 0);
10823 extra_arg = java_complete_tree (extra_arg);
10824 }
10825 /* Otherwise, just use the current `this' as an enclosing
10826 context. */
10827 else
10828 extra_arg = current_this;
10829 args = tree_cons (NULL_TREE, extra_arg, args);
10830 }
10831 else
10832 args = tree_cons (NULL_TREE, integer_zero_node, args);
10833 }
10834
10835 /* This handles the situation where a constructor invocation needs
10836 to have an enclosing context passed as a second parameter (the
10837 constructor is one of an inner class). */
10838 if ((is_super_init ||
10839 (TREE_CODE (patch) == CALL_EXPR && name == this_identifier_node))
10840 && PURE_INNER_CLASS_TYPE_P (DECL_CONTEXT (list)))
10841 {
10842 tree dest = TYPE_NAME (DECL_CONTEXT (list));
10843 tree extra_arg =
10844 build_access_to_thisn (current_class, DECL_CONTEXT (dest), 0);
10845 extra_arg = java_complete_tree (extra_arg);
10846 args = tree_cons (NULL_TREE, extra_arg, args);
10847 }
10848
10849 is_static_flag = METHOD_STATIC (list);
10850 if (! is_static_flag && this_arg != NULL_TREE)
10851 args = tree_cons (NULL_TREE, this_arg, args);
10852
10853 /* In the context of an explicit constructor invocation, we can't
10854 invoke any method relying on `this'. Exceptions are: we're
10855 invoking a static function, primary exists and is not the current
10856 this, we're creating a new object. */
10857 if (ctxp->explicit_constructor_p
10858 && !is_static_flag
10859 && (!primary || primary == current_this)
10860 && (TREE_CODE (patch) != NEW_CLASS_EXPR))
10861 {
10862 parse_error_context (wfl, "Can't reference %<this%> before the superclass constructor has been called");
10863 PATCH_METHOD_RETURN_ERROR ();
10864 }
10865 java_parser_context_restore_global ();
10866 if (is_static)
10867 *is_static = is_static_flag;
10868 /* Sometimes, we want the decl of the selected method. Such as for
10869 EH checking */
10870 if (ret_decl)
10871 *ret_decl = list;
10872 patch = patch_invoke (patch, list, args);
10873
10874 /* Now is a good time to insert the call to finit$ */
10875 if (is_super_init && CLASS_HAS_FINIT_P (current_class))
10876 {
10877 tree finit_parms, finit_call;
10878
10879 /* Prepare to pass hidden parameters to finit$, if any. */
10880 finit_parms = build_alias_initializer_parameter_list
10881 (AIPL_FUNCTION_FINIT_INVOCATION, current_class, NULL_TREE, NULL);
10882
10883 finit_call =
10884 build_method_invocation (build_wfl_node (finit_identifier_node),
10885 finit_parms);
10886
10887 /* Generate the code used to initialize fields declared with an
10888 initialization statement and build a compound statement along
10889 with the super constructor invocation. */
10890 CAN_COMPLETE_NORMALLY (patch) = 1;
10891 patch = build2 (COMPOUND_EXPR, void_type_node, patch,
10892 java_complete_tree (finit_call));
10893 }
10894 return patch;
10895 }
10896
10897 /* Check that we're not trying to do a static reference to a method in
10898 non static method. Return 1 if it's the case, 0 otherwise. */
10899
10900 static int
10901 check_for_static_method_reference (tree wfl, tree node, tree method,
10902 tree where, tree primary)
10903 {
10904 if (METHOD_STATIC (current_function_decl)
10905 && !METHOD_STATIC (method) && !primary && !CALL_CONSTRUCTOR_P (node))
10906 {
10907 char *fct_name = xstrdup (lang_printable_name (method, 0));
10908 parse_error_context
10909 (wfl, "Can't make static reference to method %<%s %s%> in class %qs",
10910 lang_printable_name (TREE_TYPE (TREE_TYPE (method)), 0), fct_name,
10911 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (where))));
10912 free (fct_name);
10913 return 1;
10914 }
10915 return 0;
10916 }
10917
10918 /* Fix the invocation of *MDECL if necessary in the case of an
10919 invocation across a nested class. *THIS_ARG might be modified
10920 appropriately and an alternative access to *MDECL might be
10921 returned. */
10922
10923 static int
10924 maybe_use_access_method (int is_super_init, tree *mdecl, tree *this_arg)
10925 {
10926 tree ctx;
10927 tree md = *mdecl, ta = NULL_TREE;
10928 int to_return = 0;
10929 int non_static_context = !METHOD_STATIC (md);
10930
10931 if (is_super_init
10932 || DECL_FINIT_P (md)
10933 || DECL_INSTINIT_P (md)
10934 || !nested_member_access_p (current_class, md))
10935 return 0;
10936
10937 /* If we're calling a method found in an enclosing class, generate
10938 what it takes to retrieve the right `this'. Don't do that if we're
10939 invoking a static method. Note that if MD's type is unrelated to
10940 CURRENT_CLASS, then the current this can be used. */
10941
10942 if (non_static_context
10943 && !inherits_from_p (current_class, DECL_CONTEXT (md))
10944 && DECL_CONTEXT (TYPE_NAME (current_class)))
10945 {
10946 ta = *this_arg;
10947 ctx = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (current_class)));
10948 if (inherits_from_p (ctx, DECL_CONTEXT (md)))
10949 {
10950 ta = build_current_thisn (current_class);
10951 ta = build_wfl_node (ta);
10952 }
10953 else
10954 {
10955 tree type = ctx;
10956 while (type)
10957 {
10958 maybe_build_thisn_access_method (type);
10959 if (inherits_from_p (type, DECL_CONTEXT (md)))
10960 {
10961 ta = build_access_to_thisn (ctx, type, 0);
10962 break;
10963 }
10964 type = (DECL_CONTEXT (TYPE_NAME (type)) ?
10965 TREE_TYPE (DECL_CONTEXT (TYPE_NAME (type))) : NULL_TREE);
10966 }
10967 }
10968 ta = java_complete_tree (ta);
10969 }
10970
10971 /* We might have to use an access method to get to MD. We can
10972 break the method access rule as long as we're not generating
10973 bytecode. */
10974 if (METHOD_PRIVATE (md) && flag_emit_class_files)
10975 {
10976 md = build_nested_method_access_method (md);
10977 to_return = 1;
10978 }
10979
10980 *mdecl = md;
10981 if (this_arg)
10982 *this_arg = ta;
10983
10984 /* Returning a nonzero value indicates we were doing a non static
10985 method invocation that is now a static invocation. It will have
10986 callee displace `this' to insert it in the regular argument
10987 list. */
10988 return (non_static_context && to_return);
10989 }
10990
10991 /* Patch an invoke expression METHOD and ARGS, based on its invocation
10992 mode. */
10993
10994 static tree
10995 patch_invoke (tree patch, tree method, tree args)
10996 {
10997 tree dtable, func;
10998 tree original_call, t, ta;
10999 tree check = NULL_TREE;
11000
11001 /* Last step for args: convert build-in types. If we're dealing with
11002 a new TYPE() type call, the first argument to the constructor
11003 isn't found in the incoming argument list, but delivered by
11004 `new' */
11005 t = TYPE_ARG_TYPES (TREE_TYPE (method));
11006 if (TREE_CODE (patch) == NEW_CLASS_EXPR)
11007 t = TREE_CHAIN (t);
11008 for (ta = args; t != end_params_node && ta;
11009 t = TREE_CHAIN (t), ta = TREE_CHAIN (ta))
11010 if (JPRIMITIVE_TYPE_P (TREE_TYPE (TREE_VALUE (ta))) &&
11011 TREE_TYPE (TREE_VALUE (ta)) != TREE_VALUE (t))
11012 TREE_VALUE (ta) = convert (TREE_VALUE (t), TREE_VALUE (ta));
11013
11014 /* Resolve unresolved returned type issues */
11015 t = TREE_TYPE (TREE_TYPE (method));
11016 if (TREE_CODE (t) == POINTER_TYPE && !CLASS_LOADED_P (TREE_TYPE (t)))
11017 resolve_and_layout (TREE_TYPE (t), NULL);
11018
11019 if (flag_emit_class_files)
11020 func = method;
11021 else
11022 {
11023 switch (invocation_mode (method, CALL_USING_SUPER (patch)))
11024 {
11025 case INVOKE_VIRTUAL:
11026 dtable = invoke_build_dtable (0, args);
11027 func = build_invokevirtual (dtable, method);
11028 break;
11029
11030 case INVOKE_NONVIRTUAL:
11031 /* If the object for the method call is null, we throw an
11032 exception. We don't do this if the object is the current
11033 method's `this'. In other cases we just rely on an
11034 optimization pass to eliminate redundant checks. */
11035 if (TREE_VALUE (args) != current_this)
11036 {
11037 /* We use a save_expr here to make sure we only evaluate
11038 the new `self' expression once. */
11039 tree save_arg = save_expr (TREE_VALUE (args));
11040 TREE_VALUE (args) = save_arg;
11041 check = java_check_reference (save_arg, 1);
11042 }
11043 /* Fall through. */
11044
11045 case INVOKE_SUPER:
11046 case INVOKE_STATIC:
11047 {
11048 tree signature = build_java_signature (TREE_TYPE (method));
11049 func = build_known_method_ref (method, TREE_TYPE (method),
11050 DECL_CONTEXT (method),
11051 signature, args);
11052 }
11053 break;
11054
11055 case INVOKE_INTERFACE:
11056 dtable = invoke_build_dtable (1, args);
11057 func = build_invokeinterface (dtable, method);
11058 break;
11059
11060 default:
11061 abort ();
11062 }
11063
11064 /* Ensure self_type is initialized, (invokestatic). FIXME */
11065 func = build1 (NOP_EXPR, build_pointer_type (TREE_TYPE (method)), func);
11066 }
11067
11068 TREE_TYPE (patch) = TREE_TYPE (TREE_TYPE (method));
11069 TREE_OPERAND (patch, 0) = func;
11070 TREE_OPERAND (patch, 1) = args;
11071 patch = check_for_builtin (method, patch);
11072 original_call = patch;
11073
11074 /* We're processing a `new TYPE ()' form. New is called and its
11075 returned value is the first argument to the constructor. We build
11076 a COMPOUND_EXPR and use saved expression so that the overall NEW
11077 expression value is a pointer to a newly created and initialized
11078 class. */
11079 if (TREE_CODE (original_call) == NEW_CLASS_EXPR)
11080 {
11081 tree class = DECL_CONTEXT (method);
11082 tree c1, saved_new, new;
11083 tree alloc_node;
11084
11085 if (flag_emit_class_files)
11086 {
11087 TREE_TYPE (patch) = build_pointer_type (class);
11088 return patch;
11089 }
11090 if (!TYPE_SIZE (class))
11091 safe_layout_class (class);
11092 alloc_node =
11093 (class_has_finalize_method (class) ? alloc_object_node
11094 : alloc_no_finalizer_node);
11095 new = build3 (CALL_EXPR, promote_type (class),
11096 build_address_of (alloc_node),
11097 build_tree_list (NULL_TREE, build_class_ref (class)),
11098 NULL_TREE);
11099 saved_new = save_expr (new);
11100 c1 = build_tree_list (NULL_TREE, saved_new);
11101 TREE_CHAIN (c1) = TREE_OPERAND (original_call, 1);
11102 TREE_OPERAND (original_call, 1) = c1;
11103 TREE_SET_CODE (original_call, CALL_EXPR);
11104 patch = build2 (COMPOUND_EXPR, TREE_TYPE (new), patch, saved_new);
11105 }
11106
11107 /* If CHECK is set, then we are building a check to see if the object
11108 is NULL. */
11109 if (check != NULL_TREE)
11110 {
11111 /* We have to call force_evaluation_order now because creating a
11112 COMPOUND_EXPR wraps the arg list in a way that makes it
11113 unrecognizable by force_evaluation_order later. Yuk. */
11114 patch = build2 (COMPOUND_EXPR, TREE_TYPE (patch), check,
11115 force_evaluation_order (patch));
11116 TREE_SIDE_EFFECTS (patch) = 1;
11117 }
11118
11119 /* In order to be able to modify PATCH later, we SAVE_EXPR it and
11120 put it as the first expression of a COMPOUND_EXPR. The second
11121 expression being an empty statement to be later patched if
11122 necessary. We remember a TREE_LIST (the PURPOSE is the method,
11123 the VALUE is the compound) in a hashtable and return a
11124 COMPOUND_EXPR built so that the result of the evaluation of the
11125 original PATCH node is returned. */
11126 if (STATIC_CLASS_INIT_OPT_P ()
11127 && current_function_decl && METHOD_STATIC (method))
11128 {
11129 tree list;
11130 tree fndecl = current_function_decl;
11131 /* We have to call force_evaluation_order now because creating a
11132 COMPOUND_EXPR wraps the arg list in a way that makes it
11133 unrecognizable by force_evaluation_order later. Yuk. */
11134 tree save = force_evaluation_order (patch);
11135 tree type = TREE_TYPE (patch);
11136
11137 patch = build2 (COMPOUND_EXPR, type, save, build_java_empty_stmt ());
11138 list = tree_cons (method, patch,
11139 DECL_FUNCTION_STATIC_METHOD_INVOCATION_COMPOUND (fndecl));
11140
11141 DECL_FUNCTION_STATIC_METHOD_INVOCATION_COMPOUND (fndecl) = list;
11142
11143 patch = build2 (COMPOUND_EXPR, type, patch, save);
11144 }
11145
11146 return patch;
11147 }
11148
11149 static int
11150 invocation_mode (tree method, int super)
11151 {
11152 int access = get_access_flags_from_decl (method);
11153
11154 if (super)
11155 return INVOKE_SUPER;
11156
11157 if (access & ACC_STATIC)
11158 return INVOKE_STATIC;
11159
11160 /* We have to look for a constructor before we handle nonvirtual
11161 calls; otherwise the constructor will look nonvirtual. */
11162 if (DECL_CONSTRUCTOR_P (method))
11163 return INVOKE_STATIC;
11164
11165 if (access & ACC_PRIVATE)
11166 return INVOKE_NONVIRTUAL;
11167
11168 /* Binary compatibility: just because it's final today, that doesn't
11169 mean it'll be final tomorrow. */
11170 if (! flag_indirect_dispatch
11171 || DECL_CONTEXT (method) == object_type_node)
11172 {
11173 if (access & ACC_FINAL)
11174 return INVOKE_NONVIRTUAL;
11175
11176 if (CLASS_FINAL (TYPE_NAME (DECL_CONTEXT (method))))
11177 return INVOKE_NONVIRTUAL;
11178 }
11179
11180 if (CLASS_INTERFACE (TYPE_NAME (DECL_CONTEXT (method))))
11181 return INVOKE_INTERFACE;
11182
11183 return INVOKE_VIRTUAL;
11184 }
11185
11186 /* Retrieve a refined list of matching methods. It covers the step
11187 15.11.2 (Compile-Time Step 2) */
11188
11189 static tree
11190 lookup_method_invoke (int lc, tree cl, tree class, tree name, tree arg_list)
11191 {
11192 tree atl = end_params_node; /* Arg Type List */
11193 tree method, signature, list, node;
11194 const char *candidates; /* Used for error report */
11195 char *dup;
11196
11197 /* Fix the arguments */
11198 for (node = arg_list; node; node = TREE_CHAIN (node))
11199 {
11200 tree current_arg = TREE_TYPE (TREE_VALUE (node));
11201 /* Non primitive type may have to be resolved */
11202 if (!JPRIMITIVE_TYPE_P (current_arg))
11203 resolve_and_layout (current_arg, NULL_TREE);
11204 /* And promoted */
11205 if (TREE_CODE (current_arg) == RECORD_TYPE)
11206 current_arg = promote_type (current_arg);
11207 atl = tree_cons (NULL_TREE, current_arg, atl);
11208 }
11209
11210 /* Presto. If we're dealing with an anonymous class and a
11211 constructor call, generate the right constructor now, since we
11212 know the arguments' types. */
11213
11214 if (lc && ANONYMOUS_CLASS_P (class))
11215 {
11216 tree mdecl = craft_constructor (TYPE_NAME (class), atl);
11217 /* The anonymous class may have already been laid out, so make sure
11218 the new constructor is laid out here. */
11219 layout_class_method (class, CLASSTYPE_SUPER (class), mdecl, NULL_TREE);
11220 }
11221
11222 /* Find all candidates and then refine the list, searching for the
11223 most specific method. */
11224 list = find_applicable_accessible_methods_list (lc, class, name, atl);
11225 list = find_most_specific_methods_list (list);
11226 if (list && !TREE_CHAIN (list))
11227 return TREE_VALUE (list);
11228
11229 /* Issue an error. List candidates if any. Candidates are listed
11230 only if accessible (non accessible methods may end-up here for
11231 the sake of a better error report). */
11232 candidates = NULL;
11233 if (list)
11234 {
11235 tree current;
11236 obstack_grow (&temporary_obstack, ". Candidates are:\n", 18);
11237 for (current = list; current; current = TREE_CHAIN (current))
11238 {
11239 tree cm = TREE_VALUE (current);
11240 char string [4096];
11241 if (!cm || not_accessible_p (class, cm, NULL_TREE, 0))
11242 continue;
11243 sprintf
11244 (string, " '%s' in '%s'%s",
11245 get_printable_method_name (cm),
11246 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (DECL_CONTEXT (cm)))),
11247 (TREE_CHAIN (current) ? "\n" : ""));
11248 obstack_grow (&temporary_obstack, string, strlen (string));
11249 }
11250 obstack_1grow (&temporary_obstack, '\0');
11251 candidates = obstack_finish (&temporary_obstack);
11252 }
11253 /* Issue the error message */
11254 method = make_node (FUNCTION_TYPE);
11255 TYPE_ARG_TYPES (method) = atl;
11256 signature = build_java_argument_signature (method);
11257 dup = xstrdup (lang_printable_name (class, 0));
11258 parse_error_context (cl, "Can't find %s %<%s(%s)%> in type %qs%s",
11259 (lc ? "constructor" : "method"),
11260 (lc ? dup : IDENTIFIER_POINTER (name)),
11261 IDENTIFIER_POINTER (signature), dup,
11262 (candidates ? candidates : ""));
11263 free (dup);
11264 return NULL_TREE;
11265 }
11266
11267 /* 15.11.2.1: Find Methods that are Applicable and Accessible. LC is 1
11268 when we're looking for a constructor. */
11269
11270 static tree
11271 find_applicable_accessible_methods_list (int lc, tree class, tree name,
11272 tree arglist)
11273 {
11274 static htab_t searched_classes;
11275 static int search_not_done = 0;
11276 tree list = NULL_TREE, all_list = NULL_TREE;
11277 tree base_binfo;
11278 int i;
11279
11280 /* Check the hash table to determine if this class has been searched
11281 already. */
11282 if (searched_classes)
11283 {
11284 if (htab_find (searched_classes, class) != NULL)
11285 return NULL;
11286 }
11287 else
11288 {
11289 searched_classes = htab_create (10, htab_hash_pointer,
11290 htab_eq_pointer, NULL);
11291 }
11292
11293 search_not_done++;
11294 *htab_find_slot (searched_classes, class, INSERT) = class;
11295
11296 if (!CLASS_LOADED_P (class))
11297 {
11298 load_class (class, 1);
11299 safe_layout_class (class);
11300 }
11301
11302 /* Search interfaces */
11303 if (TREE_CODE (TYPE_NAME (class)) == TYPE_DECL
11304 && CLASS_INTERFACE (TYPE_NAME (class)))
11305 {
11306 search_applicable_methods_list (lc, TYPE_METHODS (class),
11307 name, arglist, &list, &all_list);
11308 for (i = 1; BINFO_BASE_ITERATE (TYPE_BINFO (class), i, base_binfo); i++)
11309 {
11310 tree t = BINFO_TYPE (base_binfo);
11311 tree rlist;
11312
11313 rlist = find_applicable_accessible_methods_list (lc, t, name,
11314 arglist);
11315 list = chainon (rlist, list);
11316 }
11317 }
11318 /* Search classes */
11319 else
11320 {
11321 search_applicable_methods_list (lc, TYPE_METHODS (class),
11322 name, arglist, &list, &all_list);
11323
11324 /* When looking finit$, class$ or instinit$, we turn LC to 1 so
11325 that we only search in class. Note that we should have found
11326 something at this point. */
11327 if (ID_FINIT_P (name) || ID_CLASSDOLLAR_P (name) || ID_INSTINIT_P (name))
11328 {
11329 lc = 1;
11330 if (!list)
11331 abort ();
11332 }
11333
11334 /* We must search all interfaces of this class */
11335 if (!lc)
11336 {
11337 for (i = 1;
11338 BINFO_BASE_ITERATE (TYPE_BINFO (class), i, base_binfo); i++)
11339 {
11340 tree t = BINFO_TYPE (base_binfo);
11341 if (t != object_type_node)
11342 {
11343 tree rlist
11344 = find_applicable_accessible_methods_list (lc, t,
11345 name, arglist);
11346 list = chainon (rlist, list);
11347 }
11348 }
11349 }
11350
11351 /* Search superclass */
11352 if (!lc && CLASSTYPE_SUPER (class) != NULL_TREE)
11353 {
11354 tree rlist;
11355 class = CLASSTYPE_SUPER (class);
11356 rlist = find_applicable_accessible_methods_list (lc, class,
11357 name, arglist);
11358 list = chainon (rlist, list);
11359 }
11360 }
11361
11362 search_not_done--;
11363
11364 /* We're done. Reset the searched classes list and finally search
11365 java.lang.Object if it wasn't searched already. */
11366 if (!search_not_done)
11367 {
11368 if (!lc
11369 && TYPE_METHODS (object_type_node)
11370 && htab_find (searched_classes, object_type_node) == NULL)
11371 {
11372 search_applicable_methods_list (lc,
11373 TYPE_METHODS (object_type_node),
11374 name, arglist, &list, &all_list);
11375 }
11376 htab_delete (searched_classes);
11377 searched_classes = NULL;
11378 }
11379
11380 /* Either return the list obtained or all selected (but
11381 inaccessible) methods for better error report. */
11382 return (!list ? all_list : list);
11383 }
11384
11385 /* Effectively search for the appropriate method in method */
11386
11387 static void
11388 search_applicable_methods_list (int lc, tree method, tree name, tree arglist,
11389 tree *list, tree *all_list)
11390 {
11391 for (; method; method = TREE_CHAIN (method))
11392 {
11393 /* When dealing with constructor, stop here, otherwise search
11394 other classes */
11395 if (lc && !DECL_CONSTRUCTOR_P (method))
11396 continue;
11397 else if (!lc && (DECL_CONSTRUCTOR_P (method)
11398 || (DECL_NAME (method) != name)))
11399 continue;
11400
11401 if (argument_types_convertible (method, arglist))
11402 {
11403 /* Retain accessible methods only */
11404 if (!not_accessible_p (DECL_CONTEXT (current_function_decl),
11405 method, NULL_TREE, 0))
11406 *list = tree_cons (NULL_TREE, method, *list);
11407 else
11408 /* Also retain all selected method here */
11409 *all_list = tree_cons (NULL_TREE, method, *list);
11410 }
11411 }
11412 }
11413
11414 /* 15.11.2.2 Choose the Most Specific Method */
11415
11416 static tree
11417 find_most_specific_methods_list (tree list)
11418 {
11419 int max = 0;
11420 int abstract, candidates;
11421 tree current, new_list = NULL_TREE;
11422 for (current = list; current; current = TREE_CHAIN (current))
11423 {
11424 tree method;
11425 DECL_SPECIFIC_COUNT (TREE_VALUE (current)) = 0;
11426
11427 for (method = list; method; method = TREE_CHAIN (method))
11428 {
11429 tree method_v, current_v;
11430 /* Don't test a method against itself */
11431 if (method == current)
11432 continue;
11433
11434 method_v = TREE_VALUE (method);
11435 current_v = TREE_VALUE (current);
11436
11437 /* Compare arguments and location where methods where declared */
11438 if (argument_types_convertible (method_v, current_v))
11439 {
11440 if (valid_method_invocation_conversion_p
11441 (DECL_CONTEXT (method_v), DECL_CONTEXT (current_v)))
11442 {
11443 int v = (DECL_SPECIFIC_COUNT (current_v) += 1);
11444 max = (v > max ? v : max);
11445 }
11446 }
11447 }
11448 }
11449
11450 /* Review the list and select the maximally specific methods */
11451 for (current = list, abstract = -1, candidates = -1;
11452 current; current = TREE_CHAIN (current))
11453 if (DECL_SPECIFIC_COUNT (TREE_VALUE (current)) == max)
11454 {
11455 new_list = tree_cons (NULL_TREE, TREE_VALUE (current), new_list);
11456 abstract += (METHOD_ABSTRACT (TREE_VALUE (current)) ? 1 : 0);
11457 candidates++;
11458 }
11459
11460 /* If we have several and they're all abstract, just pick the
11461 closest one. */
11462 if (candidates > 0 && candidates == abstract)
11463 {
11464 /* FIXME: merge the throws clauses. There is no convenient way
11465 to do this in gcj right now, since ideally we'd like to
11466 introduce a new METHOD_DECL here, but that is really not
11467 possible. */
11468 new_list = nreverse (new_list);
11469 TREE_CHAIN (new_list) = NULL_TREE;
11470 return new_list;
11471 }
11472
11473 /* We have several (we couldn't find a most specific), all but one
11474 are abstract, we pick the only non abstract one. */
11475 if (candidates > 0 && (candidates == abstract+1))
11476 {
11477 for (current = new_list; current; current = TREE_CHAIN (current))
11478 if (!METHOD_ABSTRACT (TREE_VALUE (current)))
11479 {
11480 TREE_CHAIN (current) = NULL_TREE;
11481 new_list = current;
11482 }
11483 }
11484
11485 /* If we can't find one, lower expectations and try to gather multiple
11486 maximally specific methods */
11487 while (!new_list && max)
11488 {
11489 while (--max > 0)
11490 {
11491 if (DECL_SPECIFIC_COUNT (TREE_VALUE (current)) == max)
11492 new_list = tree_cons (NULL_TREE, TREE_VALUE (current), new_list);
11493 }
11494 }
11495
11496 return new_list;
11497 }
11498
11499 /* Make sure that the type of each M2_OR_ARGLIST arguments can be
11500 converted by method invocation conversion (5.3) to the type of the
11501 corresponding parameter of M1. Implementation expects M2_OR_ARGLIST
11502 to change less often than M1. */
11503
11504 static GTY(()) tree m2_arg_value;
11505 static GTY(()) tree m2_arg_cache;
11506
11507 static int
11508 argument_types_convertible (tree m1, tree m2_or_arglist)
11509 {
11510 tree m1_arg, m2_arg;
11511
11512 SKIP_THIS_AND_ARTIFICIAL_PARMS (m1_arg, m1)
11513
11514 if (m2_arg_value == m2_or_arglist)
11515 m2_arg = m2_arg_cache;
11516 else
11517 {
11518 /* M2_OR_ARGLIST can be a function DECL or a raw list of
11519 argument types */
11520 if (m2_or_arglist && TREE_CODE (m2_or_arglist) == FUNCTION_DECL)
11521 {
11522 m2_arg = TYPE_ARG_TYPES (TREE_TYPE (m2_or_arglist));
11523 if (!METHOD_STATIC (m2_or_arglist))
11524 m2_arg = TREE_CHAIN (m2_arg);
11525 }
11526 else
11527 m2_arg = m2_or_arglist;
11528
11529 m2_arg_value = m2_or_arglist;
11530 m2_arg_cache = m2_arg;
11531 }
11532
11533 while (m1_arg != end_params_node && m2_arg != end_params_node)
11534 {
11535 resolve_and_layout (TREE_VALUE (m1_arg), NULL_TREE);
11536 if (!valid_method_invocation_conversion_p (TREE_VALUE (m1_arg),
11537 TREE_VALUE (m2_arg)))
11538 break;
11539 m1_arg = TREE_CHAIN (m1_arg);
11540 m2_arg = TREE_CHAIN (m2_arg);
11541 }
11542 return m1_arg == end_params_node && m2_arg == end_params_node;
11543 }
11544
11545 /* Qualification routines */
11546
11547 /* Given a name x.y.z, look up x locally. If it's found, save the
11548 decl. If it's not found, mark the name as RESOLVE_PACKAGE_NAME_P,
11549 so that we later try and load the appropriate classes. */
11550 static void
11551 qualify_ambiguous_name (tree id)
11552 {
11553 tree name, decl;
11554
11555 /* We inspect the first item of the qualification list. As a sanity
11556 check, make sure that it is an identfier node. */
11557 tree qual = EXPR_WFL_QUALIFICATION (id);
11558 tree qual_wfl = QUAL_WFL (qual);
11559
11560 if (TREE_CODE (qual_wfl) != EXPR_WITH_FILE_LOCATION)
11561 return;
11562
11563 name = EXPR_WFL_NODE (qual_wfl);
11564
11565 /* If we don't have an identifier, or we have a 'this' or 'super',
11566 then field access processing is all we need : there is nothing
11567 for us to do. */
11568 if (!name || TREE_CODE (name) != IDENTIFIER_NODE ||
11569 name == this_identifier_node ||
11570 name == super_identifier_node)
11571 return;
11572
11573 /* If name appears within the scope of a local variable declaration
11574 or parameter declaration, or is a field within an enclosing
11575 class, then it is an expression name. Save the decl and let
11576 resolve_field_access do it's work. */
11577 if ((decl = IDENTIFIER_LOCAL_VALUE (name)) ||
11578 (decl = lookup_field_wrapper (current_class, name)))
11579 {
11580 QUAL_RESOLUTION (qual) = decl;
11581 return;
11582 }
11583
11584 /* If name is a known class name (either declared or imported), mark
11585 us as a type name. */
11586 if ((decl = resolve_and_layout (name, NULL_TREE)))
11587 {
11588 RESOLVE_TYPE_NAME_P (qual_wfl) = 1;
11589 QUAL_RESOLUTION (qual) = decl;
11590 }
11591
11592 /* Check here that NAME isn't declared by more than one
11593 type-import-on-demand declaration of the compilation unit
11594 containing NAME. FIXME */
11595
11596 /* We couldn't find a declaration for the name. Assume for now that
11597 we have a qualified class name that needs to be loaded from an
11598 external class file. */
11599 else
11600 RESOLVE_PACKAGE_NAME_P (qual_wfl) = 1;
11601
11602 /* Propagate the qualification across other components of the
11603 qualified name */
11604 for (qual = TREE_CHAIN (qual); qual;
11605 qual_wfl = QUAL_WFL (qual), qual = TREE_CHAIN (qual))
11606 {
11607 if (RESOLVE_PACKAGE_NAME_P (qual_wfl))
11608 RESOLVE_PACKAGE_NAME_P (QUAL_WFL (qual)) = 1;
11609 }
11610
11611 /* Store the global qualification for the ambiguous part of ID back
11612 into ID fields */
11613 if (RESOLVE_TYPE_NAME_P (qual_wfl))
11614 RESOLVE_TYPE_NAME_P (id) = 1;
11615 else if (RESOLVE_PACKAGE_NAME_P (qual_wfl))
11616 RESOLVE_PACKAGE_NAME_P (id) = 1;
11617 }
11618
11619 /* Patch tree nodes in a function body. When a BLOCK is found, push
11620 local variable decls if present.
11621 Same as java_complete_lhs, but does resolve static finals to values. */
11622
11623 static tree
11624 java_complete_tree (tree node)
11625 {
11626 node = java_complete_lhs (node);
11627 if (JDECL_P (node) && CLASS_FINAL_VARIABLE_P (node)
11628 && DECL_INITIAL (node) != NULL_TREE)
11629 {
11630 tree value = fold_constant_for_init (node, node);
11631 if (value != NULL_TREE)
11632 return value;
11633 }
11634 return node;
11635 }
11636
11637 static tree
11638 java_stabilize_reference (tree node)
11639 {
11640 if (TREE_CODE (node) == COMPOUND_EXPR)
11641 {
11642 tree op0 = TREE_OPERAND (node, 0);
11643 tree op1 = TREE_OPERAND (node, 1);
11644 TREE_OPERAND (node, 0) = save_expr (op0);
11645 TREE_OPERAND (node, 1) = java_stabilize_reference (op1);
11646 return node;
11647 }
11648 return stabilize_reference (node);
11649 }
11650
11651 /* Patch tree nodes in a function body. When a BLOCK is found, push
11652 local variable decls if present.
11653 Same as java_complete_tree, but does not resolve static finals to values. */
11654
11655 static tree
11656 java_complete_lhs (tree node)
11657 {
11658 tree nn, cn, wfl_op1, wfl_op2, wfl_op3;
11659 int flag;
11660
11661 /* CONVERT_EXPR always has its type set, even though it needs to be
11662 worked out. */
11663 if (TREE_TYPE (node) && TREE_CODE (node) != CONVERT_EXPR)
11664 return node;
11665
11666 /* The switch block implements cases processing container nodes
11667 first. Contained nodes are always written back. Leaves come
11668 next and return a value. */
11669 switch (TREE_CODE (node))
11670 {
11671 case BLOCK:
11672
11673 /* 1- Block section.
11674 Set the local values on decl names so we can identify them
11675 faster when they're referenced. At that stage, identifiers
11676 are legal so we don't check for declaration errors. */
11677 for (cn = BLOCK_EXPR_DECLS (node); cn; cn = TREE_CHAIN (cn))
11678 {
11679 DECL_CONTEXT (cn) = current_function_decl;
11680 IDENTIFIER_LOCAL_VALUE (DECL_NAME (cn)) = cn;
11681 }
11682 if (BLOCK_EXPR_BODY (node) == NULL_TREE)
11683 CAN_COMPLETE_NORMALLY (node) = 1;
11684 else
11685 {
11686 tree stmt = BLOCK_EXPR_BODY (node);
11687 tree *ptr;
11688 int error_seen = 0;
11689 if (TREE_CODE (stmt) == COMPOUND_EXPR)
11690 {
11691 /* Re-order from (((A; B); C); ...; Z) to
11692 (A; (B; (C ; (...; Z)))).
11693 This makes it easier to scan the statements left-to-right
11694 without using recursion (which might overflow the stack
11695 if the block has many statements. */
11696 for (;;)
11697 {
11698 tree left = TREE_OPERAND (stmt, 0);
11699 if (TREE_CODE (left) != COMPOUND_EXPR)
11700 break;
11701 TREE_OPERAND (stmt, 0) = TREE_OPERAND (left, 1);
11702 TREE_OPERAND (left, 1) = stmt;
11703 stmt = left;
11704 }
11705 BLOCK_EXPR_BODY (node) = stmt;
11706 }
11707
11708 /* Now do the actual complete, without deep recursion for
11709 long blocks. */
11710 ptr = &BLOCK_EXPR_BODY (node);
11711 while (TREE_CODE (*ptr) == COMPOUND_EXPR
11712 && !IS_EMPTY_STMT (TREE_OPERAND (*ptr, 1)))
11713 {
11714 tree cur = java_complete_tree (TREE_OPERAND (*ptr, 0));
11715 tree *next = &TREE_OPERAND (*ptr, 1);
11716 TREE_OPERAND (*ptr, 0) = cur;
11717 if (IS_EMPTY_STMT (cur))
11718 {
11719 /* Optimization; makes it easier to detect empty bodies.
11720 Most useful for <clinit> with all-constant initializer. */
11721 *ptr = *next;
11722 continue;
11723 }
11724 if (TREE_CODE (cur) == ERROR_MARK)
11725 error_seen++;
11726 else if (! CAN_COMPLETE_NORMALLY (cur))
11727 {
11728 wfl_op2 = *next;
11729 for (;;)
11730 {
11731 if (TREE_CODE (wfl_op2) == BLOCK)
11732 wfl_op2 = BLOCK_EXPR_BODY (wfl_op2);
11733 else if (TREE_CODE (wfl_op2) == COMPOUND_EXPR)
11734 wfl_op2 = TREE_OPERAND (wfl_op2, 0);
11735 else
11736 break;
11737 }
11738 if (TREE_CODE (wfl_op2) != CASE_EXPR
11739 && TREE_CODE (wfl_op2) != DEFAULT_EXPR)
11740 unreachable_stmt_error (*ptr);
11741 }
11742 if (TREE_TYPE (*ptr) == NULL_TREE)
11743 TREE_TYPE (*ptr) = void_type_node;
11744 ptr = next;
11745 }
11746 *ptr = java_complete_tree (*ptr);
11747
11748 if (TREE_CODE (*ptr) == ERROR_MARK || error_seen > 0)
11749 return error_mark_node;
11750 CAN_COMPLETE_NORMALLY (node) = CAN_COMPLETE_NORMALLY (*ptr);
11751 }
11752 /* Turn local bindings to null */
11753 for (cn = BLOCK_EXPR_DECLS (node); cn; cn = TREE_CHAIN (cn))
11754 IDENTIFIER_LOCAL_VALUE (DECL_NAME (cn)) = NULL_TREE;
11755
11756 TREE_TYPE (node) = void_type_node;
11757 break;
11758
11759 /* 2- They are expressions but ultimately deal with statements */
11760
11761 case THROW_EXPR:
11762 wfl_op1 = TREE_OPERAND (node, 0);
11763 COMPLETE_CHECK_OP_0 (node);
11764 /* 14.19 A throw statement cannot complete normally. */
11765 CAN_COMPLETE_NORMALLY (node) = 0;
11766 return patch_throw_statement (node, wfl_op1);
11767
11768 case SYNCHRONIZED_EXPR:
11769 wfl_op1 = TREE_OPERAND (node, 0);
11770 return patch_synchronized_statement (node, wfl_op1);
11771
11772 case TRY_EXPR:
11773 return patch_try_statement (node);
11774
11775 case TRY_FINALLY_EXPR:
11776 COMPLETE_CHECK_OP_0 (node);
11777 COMPLETE_CHECK_OP_1 (node);
11778 if (IS_EMPTY_STMT (TREE_OPERAND (node, 0)))
11779 /* Reduce try/finally nodes with an empty try block. */
11780 return TREE_OPERAND (node, 1);
11781 if (IS_EMPTY_STMT (TREE_OPERAND (node, 1)))
11782 /* Likewise for an empty finally block. */
11783 return TREE_OPERAND (node, 0);
11784 CAN_COMPLETE_NORMALLY (node)
11785 = (CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 0))
11786 && CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 1)));
11787 TREE_TYPE (node) = TREE_TYPE (TREE_OPERAND (node, 0));
11788 return node;
11789
11790 case LABELED_BLOCK_EXPR:
11791 PUSH_LABELED_BLOCK (node);
11792 if (LABELED_BLOCK_BODY (node))
11793 COMPLETE_CHECK_OP_1 (node);
11794 TREE_TYPE (node) = void_type_node;
11795 POP_LABELED_BLOCK ();
11796
11797 if (IS_EMPTY_STMT (LABELED_BLOCK_BODY (node)))
11798 {
11799 LABELED_BLOCK_BODY (node) = NULL_TREE;
11800 CAN_COMPLETE_NORMALLY (node) = 1;
11801 }
11802 else if (CAN_COMPLETE_NORMALLY (LABELED_BLOCK_BODY (node)))
11803 CAN_COMPLETE_NORMALLY (node) = 1;
11804 return node;
11805
11806 case EXIT_BLOCK_EXPR:
11807 return patch_bc_statement (node);
11808
11809 case CASE_EXPR:
11810 cn = java_complete_tree (TREE_OPERAND (node, 0));
11811 if (cn == error_mark_node)
11812 return cn;
11813
11814 /* First, the case expression must be constant. Values of final
11815 fields are accepted. */
11816 nn = fold_constant_for_init (cn, NULL_TREE);
11817 if (nn != NULL_TREE)
11818 cn = nn;
11819
11820 cn = fold (cn);
11821 if ((TREE_CODE (cn) == COMPOUND_EXPR
11822 || TREE_CODE (cn) == COMPONENT_REF)
11823 && JDECL_P (TREE_OPERAND (cn, 1))
11824 && FIELD_FINAL (TREE_OPERAND (cn, 1))
11825 && DECL_INITIAL (TREE_OPERAND (cn, 1)))
11826 {
11827 cn = fold_constant_for_init (DECL_INITIAL (TREE_OPERAND (cn, 1)),
11828 TREE_OPERAND (cn, 1));
11829 }
11830 /* Accept final locals too. */
11831 else if (TREE_CODE (cn) == VAR_DECL && DECL_FINAL (cn)
11832 && DECL_INITIAL (cn))
11833 cn = fold_constant_for_init (DECL_INITIAL (cn), cn);
11834
11835 if (!TREE_CONSTANT (cn))
11836 {
11837 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
11838 parse_error_context (node, "Constant expression required");
11839 return error_mark_node;
11840 }
11841
11842 nn = ctxp->current_loop;
11843
11844 /* It must be assignable to the type of the switch expression. */
11845 if (!try_builtin_assignconv (NULL_TREE,
11846 TREE_TYPE (TREE_OPERAND (nn, 0)), cn))
11847 {
11848 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
11849 parse_error_context
11850 (wfl_operator,
11851 "Incompatible type for case. Can't convert %qs to %<int%>",
11852 lang_printable_name (TREE_TYPE (cn), 0));
11853 return error_mark_node;
11854 }
11855
11856 cn = fold (convert (int_type_node, cn));
11857 TREE_CONSTANT_OVERFLOW (cn) = 0;
11858 CAN_COMPLETE_NORMALLY (cn) = 1;
11859
11860 /* Save the label on a list so that we can later check for
11861 duplicates. */
11862 case_label_list = tree_cons (node, cn, case_label_list);
11863
11864 /* Multiple instance of a case label bearing the same value is
11865 checked later. The case expression is all right so far. */
11866 if (TREE_CODE (cn) == VAR_DECL)
11867 cn = DECL_INITIAL (cn);
11868 TREE_OPERAND (node, 0) = cn;
11869 TREE_TYPE (node) = void_type_node;
11870 CAN_COMPLETE_NORMALLY (node) = 1;
11871 TREE_SIDE_EFFECTS (node) = 1;
11872 break;
11873
11874 case DEFAULT_EXPR:
11875 nn = ctxp->current_loop;
11876 /* Only one default label is allowed per switch statement */
11877 if (SWITCH_HAS_DEFAULT (nn))
11878 {
11879 #ifdef USE_MAPPED_LOCATION
11880 SET_EXPR_LOCATION (wfl_operator, EXPR_LOCATION (node));
11881 #else
11882 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
11883 #endif
11884 parse_error_context (wfl_operator,
11885 "Duplicate case label: %<default%>");
11886 return error_mark_node;
11887 }
11888 else
11889 SWITCH_HAS_DEFAULT (nn) = 1;
11890 TREE_TYPE (node) = void_type_node;
11891 TREE_SIDE_EFFECTS (node) = 1;
11892 CAN_COMPLETE_NORMALLY (node) = 1;
11893 break;
11894
11895 case SWITCH_EXPR:
11896 case LOOP_EXPR:
11897 PUSH_LOOP (node);
11898 /* Check whether the loop was enclosed in a labeled
11899 statement. If not, create one, insert the loop in it and
11900 return the node */
11901 nn = patch_loop_statement (node);
11902
11903 /* Anyways, walk the body of the loop */
11904 if (TREE_CODE (node) == LOOP_EXPR)
11905 TREE_OPERAND (node, 0) = java_complete_tree (TREE_OPERAND (node, 0));
11906 /* Switch statement: walk the switch expression and the cases */
11907 else
11908 node = patch_switch_statement (node);
11909
11910 if (node == error_mark_node || TREE_OPERAND (node, 0) == error_mark_node)
11911 nn = error_mark_node;
11912 else
11913 {
11914 TREE_TYPE (nn) = TREE_TYPE (node) = void_type_node;
11915 /* If we returned something different, that's because we
11916 inserted a label. Pop the label too. */
11917 if (nn != node)
11918 {
11919 if (CAN_COMPLETE_NORMALLY (node))
11920 CAN_COMPLETE_NORMALLY (nn) = 1;
11921 POP_LABELED_BLOCK ();
11922 }
11923 }
11924 POP_LOOP ();
11925 return nn;
11926
11927 case EXIT_EXPR:
11928 TREE_OPERAND (node, 0) = java_complete_tree (TREE_OPERAND (node, 0));
11929 return patch_exit_expr (node);
11930
11931 case COND_EXPR:
11932 /* Condition */
11933 TREE_OPERAND (node, 0) = java_complete_tree (TREE_OPERAND (node, 0));
11934 if (TREE_OPERAND (node, 0) == error_mark_node)
11935 return error_mark_node;
11936 /* then-else branches */
11937 TREE_OPERAND (node, 1) = java_complete_tree (TREE_OPERAND (node, 1));
11938 if (TREE_OPERAND (node, 1) == error_mark_node)
11939 return error_mark_node;
11940 {
11941 /* This is a special case due to build_assertion(). When
11942 assertions are disabled we build a COND_EXPR in which
11943 Operand 1 is the body of the assertion. If that happens to
11944 be a string concatenation we'll need to patch it here. */
11945 tree patched = patch_string (TREE_OPERAND (node, 1));
11946 if (patched)
11947 TREE_OPERAND (node, 1) = patched;
11948 }
11949 TREE_OPERAND (node, 2) = java_complete_tree (TREE_OPERAND (node, 2));
11950 if (TREE_OPERAND (node, 2) == error_mark_node)
11951 return error_mark_node;
11952 return patch_if_else_statement (node);
11953 break;
11954
11955 case CONDITIONAL_EXPR:
11956 /* Condition */
11957 wfl_op1 = TREE_OPERAND (node, 0);
11958 COMPLETE_CHECK_OP_0 (node);
11959 wfl_op2 = TREE_OPERAND (node, 1);
11960 COMPLETE_CHECK_OP_1 (node);
11961 wfl_op3 = TREE_OPERAND (node, 2);
11962 COMPLETE_CHECK_OP_2 (node);
11963 return patch_conditional_expr (node, wfl_op1, wfl_op2);
11964
11965 /* 3- Expression section */
11966 case COMPOUND_EXPR:
11967 wfl_op2 = TREE_OPERAND (node, 1);
11968 TREE_OPERAND (node, 0) = nn =
11969 java_complete_tree (TREE_OPERAND (node, 0));
11970 if (IS_EMPTY_STMT (wfl_op2))
11971 CAN_COMPLETE_NORMALLY (node) = CAN_COMPLETE_NORMALLY (nn);
11972 else
11973 {
11974 if (! CAN_COMPLETE_NORMALLY (nn) && TREE_CODE (nn) != ERROR_MARK)
11975 {
11976 /* An unreachable condition in a do-while statement
11977 is *not* (technically) an unreachable statement. */
11978 nn = wfl_op2;
11979 if (TREE_CODE (nn) == EXPR_WITH_FILE_LOCATION)
11980 nn = EXPR_WFL_NODE (nn);
11981 /* NN can be NULL_TREE exactly when UPDATE is, in
11982 finish_for_loop. */
11983 if (nn != NULL_TREE && TREE_CODE (nn) != EXIT_EXPR)
11984 {
11985 SET_WFL_OPERATOR (wfl_operator, node, wfl_op2);
11986 if (SUPPRESS_UNREACHABLE_ERROR (nn))
11987 {
11988 /* Perhaps this warning should have an
11989 associated flag. The code being compiled is
11990 pedantically correct, but useless. */
11991 parse_warning_context (wfl_operator,
11992 "Unreachable statement");
11993 }
11994 else
11995 parse_error_context (wfl_operator,
11996 "Unreachable statement");
11997 }
11998 }
11999 TREE_OPERAND (node, 1) = java_complete_tree (TREE_OPERAND (node, 1));
12000 if (TREE_OPERAND (node, 1) == error_mark_node)
12001 return error_mark_node;
12002 /* Even though we might allow the case where the first
12003 operand doesn't return normally, we still should compute
12004 CAN_COMPLETE_NORMALLY correctly. */
12005 CAN_COMPLETE_NORMALLY (node)
12006 = (CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 0))
12007 && CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 1)));
12008 }
12009 TREE_TYPE (node) = TREE_TYPE (TREE_OPERAND (node, 1));
12010 break;
12011
12012 case RETURN_EXPR:
12013 /* CAN_COMPLETE_NORMALLY (node) = 0; */
12014 return patch_return (node);
12015
12016 case EXPR_WITH_FILE_LOCATION:
12017 if (!EXPR_WFL_NODE (node) /* Or a PRIMARY flag ? */
12018 || TREE_CODE (EXPR_WFL_NODE (node)) == IDENTIFIER_NODE)
12019 {
12020 node = resolve_expression_name (node, NULL);
12021 if (node == error_mark_node)
12022 return node;
12023 CAN_COMPLETE_NORMALLY (node) = 1;
12024 }
12025 else
12026 {
12027 tree body;
12028 location_t save_location = input_location;
12029 #ifdef USE_MAPPED_LOCATION
12030 input_location = EXPR_LOCATION (node);
12031 if (input_location == UNKNOWN_LOCATION)
12032 input_location = save_location;
12033 #else
12034 input_line = EXPR_WFL_LINENO (node);
12035 #endif
12036 body = java_complete_tree (EXPR_WFL_NODE (node));
12037 input_location = save_location;
12038 EXPR_WFL_NODE (node) = body;
12039 TREE_SIDE_EFFECTS (node) = TREE_SIDE_EFFECTS (body);
12040 CAN_COMPLETE_NORMALLY (node) = CAN_COMPLETE_NORMALLY (body);
12041 if (IS_EMPTY_STMT (body) || TREE_CONSTANT (body))
12042 {
12043 /* Makes it easier to constant fold, detect empty bodies. */
12044 return body;
12045 }
12046 if (body == error_mark_node)
12047 {
12048 /* Its important for the evaluation of assignment that
12049 this mark on the TREE_TYPE is propagated. */
12050 TREE_TYPE (node) = error_mark_node;
12051 return error_mark_node;
12052 }
12053 else
12054 TREE_TYPE (node) = TREE_TYPE (EXPR_WFL_NODE (node));
12055
12056 }
12057 break;
12058
12059 case NEW_ARRAY_EXPR:
12060 /* Patch all the dimensions */
12061 flag = 0;
12062 for (cn = TREE_OPERAND (node, 1); cn; cn = TREE_CHAIN (cn))
12063 {
12064 int location = EXPR_WFL_LINECOL (TREE_VALUE (cn));
12065 tree dim = convert (int_type_node,
12066 java_complete_tree (TREE_VALUE (cn)));
12067 if (dim == error_mark_node)
12068 {
12069 flag = 1;
12070 continue;
12071 }
12072 else
12073 {
12074 TREE_VALUE (cn) = dim;
12075 /* Setup the location of the current dimension, for
12076 later error report. */
12077 #ifdef USE_MAPPED_LOCATION
12078 TREE_PURPOSE (cn) = expr_add_location (NULL_TREE, location, 0);
12079 #else
12080 TREE_PURPOSE (cn) =
12081 build_expr_wfl (NULL_TREE, input_filename, 0, 0);
12082 EXPR_WFL_LINECOL (TREE_PURPOSE (cn)) = location;
12083 #endif
12084 }
12085 }
12086 /* They complete the array creation expression, if no errors
12087 were found. */
12088 CAN_COMPLETE_NORMALLY (node) = 1;
12089 return (flag ? error_mark_node
12090 : force_evaluation_order (patch_newarray (node)));
12091
12092 case NEW_ANONYMOUS_ARRAY_EXPR:
12093 /* Create the array type if necessary. */
12094 if (ANONYMOUS_ARRAY_DIMS_SIG (node))
12095 {
12096 tree type = ANONYMOUS_ARRAY_BASE_TYPE (node);
12097 if (!(type = resolve_type_during_patch (type)))
12098 return error_mark_node;
12099 type = build_array_from_name (type, NULL_TREE,
12100 ANONYMOUS_ARRAY_DIMS_SIG (node), NULL);
12101 ANONYMOUS_ARRAY_BASE_TYPE (node) = build_pointer_type (type);
12102 }
12103 node = patch_new_array_init (ANONYMOUS_ARRAY_BASE_TYPE (node),
12104 ANONYMOUS_ARRAY_INITIALIZER (node));
12105 if (node == error_mark_node)
12106 return error_mark_node;
12107 CAN_COMPLETE_NORMALLY (node) = 1;
12108 return node;
12109
12110 case NEW_CLASS_EXPR:
12111 case CALL_EXPR:
12112 /* Complete function's argument(s) first */
12113 if (complete_function_arguments (node))
12114 return error_mark_node;
12115 else
12116 {
12117 tree decl, wfl = TREE_OPERAND (node, 0);
12118 int in_this = CALL_THIS_CONSTRUCTOR_P (node);
12119 int from_super = (EXPR_WFL_NODE (TREE_OPERAND (node, 0)) ==
12120 super_identifier_node);
12121 tree arguments;
12122 #ifdef USE_MAPPED_LOCATION
12123 source_location location = EXPR_LOCATION (node);
12124 #else
12125 int location = EXPR_WFL_LINECOL (node);
12126 #endif
12127
12128 node = patch_method_invocation (node, NULL_TREE, NULL_TREE,
12129 from_super, 0, &decl);
12130 if (node == error_mark_node)
12131 return error_mark_node;
12132
12133 if (TREE_CODE (node) == CALL_EXPR
12134 && TREE_OPERAND (node, 1) != NULL_TREE)
12135 arguments = TREE_VALUE (TREE_OPERAND (node, 1));
12136 else
12137 arguments = NULL_TREE;
12138 check_thrown_exceptions (location, decl, arguments);
12139 /* If we call this(...), register signature and positions */
12140 if (in_this)
12141 DECL_CONSTRUCTOR_CALLS (current_function_decl) =
12142 tree_cons (wfl, decl,
12143 DECL_CONSTRUCTOR_CALLS (current_function_decl));
12144 CAN_COMPLETE_NORMALLY (node) = 1;
12145 return force_evaluation_order (node);
12146 }
12147
12148 case MODIFY_EXPR:
12149 /* Save potential wfls */
12150 wfl_op1 = TREE_OPERAND (node, 0);
12151 TREE_OPERAND (node, 0) = nn = java_complete_lhs (wfl_op1);
12152
12153 if (MODIFY_EXPR_FROM_INITIALIZATION_P (node)
12154 && TREE_CODE (nn) == VAR_DECL && TREE_STATIC (nn)
12155 && DECL_INITIAL (nn) != NULL_TREE)
12156 {
12157 tree value;
12158
12159 value = fold_constant_for_init (nn, nn);
12160
12161 /* When we have a primitype type, or a string and we're not
12162 emitting a class file, we actually don't want to generate
12163 anything for the assignment. */
12164 if (value != NULL_TREE &&
12165 (JPRIMITIVE_TYPE_P (TREE_TYPE (value)) ||
12166 (TREE_TYPE (value) == string_ptr_type_node &&
12167 ! flag_emit_class_files)))
12168 {
12169 /* Prepare node for patch_assignment */
12170 TREE_OPERAND (node, 1) = value;
12171 /* Call patch assignment to verify the assignment */
12172 if (patch_assignment (node, wfl_op1) == error_mark_node)
12173 return error_mark_node;
12174 /* Set DECL_INITIAL properly (a conversion might have
12175 been decided by patch_assignment) and return the
12176 empty statement. */
12177 else
12178 {
12179 tree patched = patch_string (TREE_OPERAND (node, 1));
12180 if (patched)
12181 DECL_INITIAL (nn) = patched;
12182 else
12183 DECL_INITIAL (nn) = TREE_OPERAND (node, 1);
12184 DECL_FIELD_FINAL_IUD (nn) = 1;
12185 return build_java_empty_stmt ();
12186 }
12187 }
12188 if (! flag_emit_class_files)
12189 DECL_INITIAL (nn) = NULL_TREE;
12190 }
12191 wfl_op2 = TREE_OPERAND (node, 1);
12192
12193 if (TREE_OPERAND (node, 0) == error_mark_node)
12194 return error_mark_node;
12195
12196 flag = COMPOUND_ASSIGN_P (wfl_op2);
12197 if (flag)
12198 {
12199 /* This might break when accessing outer field from inner
12200 class. TESTME, FIXME */
12201 tree lvalue = java_stabilize_reference (TREE_OPERAND (node, 0));
12202
12203 /* Hand stabilize the lhs on both places */
12204 TREE_OPERAND (node, 0) = lvalue;
12205 TREE_OPERAND (TREE_OPERAND (node, 1), 0) =
12206 (flag_emit_class_files ? lvalue : save_expr (lvalue));
12207
12208 /* 15.25.2.a: Left hand is not an array access. FIXME */
12209 /* Now complete the RHS. We write it back later on. */
12210 nn = java_complete_tree (TREE_OPERAND (node, 1));
12211
12212 if ((cn = patch_string (nn)))
12213 nn = cn;
12214
12215 /* The last part of the rewrite for E1 op= E2 is to have
12216 E1 = (T)(E1 op E2), with T being the type of E1. */
12217 nn = java_complete_tree (build_cast (EXPR_WFL_LINECOL (wfl_op2),
12218 TREE_TYPE (lvalue), nn));
12219
12220 /* If the assignment is compound and has reference type,
12221 then ensure the LHS has type String and nothing else. */
12222 if (JREFERENCE_TYPE_P (TREE_TYPE (lvalue))
12223 && ! JSTRING_TYPE_P (TREE_TYPE (lvalue)))
12224 parse_error_context (wfl_op2,
12225 "Incompatible type for %<+=%>. Can't convert %qs to %<java.lang.String%>",
12226 lang_printable_name (TREE_TYPE (lvalue), 0));
12227
12228 /* 15.25.2.b: Left hand is an array access. FIXME */
12229 }
12230
12231 /* If we're about to patch a NEW_ARRAY_INIT, we call a special
12232 function to complete this RHS. Note that a NEW_ARRAY_INIT
12233 might have been already fully expanded if created as a result
12234 of processing an anonymous array initializer. We avoid doing
12235 the operation twice by testing whether the node already bears
12236 a type. */
12237 else if (TREE_CODE (wfl_op2) == NEW_ARRAY_INIT && !TREE_TYPE (wfl_op2))
12238 nn = patch_new_array_init (TREE_TYPE (TREE_OPERAND (node, 0)),
12239 TREE_OPERAND (node, 1));
12240 /* Otherwise we simply complete the RHS */
12241 else
12242 nn = java_complete_tree (TREE_OPERAND (node, 1));
12243
12244 if (nn == error_mark_node)
12245 return error_mark_node;
12246
12247 /* Write back the RHS as we evaluated it. */
12248 TREE_OPERAND (node, 1) = nn;
12249
12250 /* In case we're handling = with a String as a RHS, we need to
12251 produce a String out of the RHS (it might still be a
12252 STRING_CST or a StringBuffer at this stage */
12253 if ((nn = patch_string (TREE_OPERAND (node, 1))))
12254 TREE_OPERAND (node, 1) = nn;
12255
12256 if ((nn = nested_field_access_fix (wfl_op1, TREE_OPERAND (node, 0),
12257 TREE_OPERAND (node, 1))))
12258 {
12259 /* We return error_mark_node if nested_field_access_fix
12260 detects we write into a final. */
12261 if (nn == error_mark_node)
12262 return error_mark_node;
12263 node = nn;
12264 }
12265 else
12266 {
12267 node = patch_assignment (node, wfl_op1);
12268 if (node == error_mark_node)
12269 return error_mark_node;
12270 /* Reorganize the tree if necessary. */
12271 if (flag && (!JREFERENCE_TYPE_P (TREE_TYPE (node))
12272 || JSTRING_P (TREE_TYPE (node))))
12273 node = java_refold (node);
12274 }
12275
12276 /* Seek to set DECL_INITIAL to a proper value, since it might have
12277 undergone a conversion in patch_assignment. We do that only when
12278 it's necessary to have DECL_INITIAL properly set. */
12279 nn = TREE_OPERAND (node, 0);
12280 if (TREE_CODE (nn) == VAR_DECL
12281 && DECL_INITIAL (nn) && CONSTANT_VALUE_P (DECL_INITIAL (nn))
12282 && FIELD_STATIC (nn) && FIELD_FINAL (nn)
12283 && (JPRIMITIVE_TYPE_P (TREE_TYPE (nn))
12284 || TREE_TYPE (nn) == string_ptr_type_node))
12285 DECL_INITIAL (nn) = TREE_OPERAND (node, 1);
12286
12287 CAN_COMPLETE_NORMALLY (node) = 1;
12288 return node;
12289
12290 case MULT_EXPR:
12291 case PLUS_EXPR:
12292 case MINUS_EXPR:
12293 case LSHIFT_EXPR:
12294 case RSHIFT_EXPR:
12295 case URSHIFT_EXPR:
12296 case BIT_AND_EXPR:
12297 case BIT_XOR_EXPR:
12298 case BIT_IOR_EXPR:
12299 case TRUNC_MOD_EXPR:
12300 case TRUNC_DIV_EXPR:
12301 case RDIV_EXPR:
12302 case TRUTH_ANDIF_EXPR:
12303 case TRUTH_ORIF_EXPR:
12304 case EQ_EXPR:
12305 case NE_EXPR:
12306 case GT_EXPR:
12307 case GE_EXPR:
12308 case LT_EXPR:
12309 case LE_EXPR:
12310 /* Operands 0 and 1 are WFL in certain cases only. patch_binop
12311 knows how to handle those cases. */
12312 wfl_op1 = TREE_OPERAND (node, 0);
12313 wfl_op2 = TREE_OPERAND (node, 1);
12314
12315 CAN_COMPLETE_NORMALLY (node) = 1;
12316 /* Don't complete string nodes if dealing with the PLUS operand. */
12317 if (TREE_CODE (node) != PLUS_EXPR || !JSTRING_P (wfl_op1))
12318 {
12319 nn = java_complete_tree (wfl_op1);
12320 if (nn == error_mark_node)
12321 return error_mark_node;
12322
12323 TREE_OPERAND (node, 0) = nn;
12324 }
12325 if (TREE_CODE (node) != PLUS_EXPR || !JSTRING_P (wfl_op2))
12326 {
12327 nn = java_complete_tree (wfl_op2);
12328 if (nn == error_mark_node)
12329 return error_mark_node;
12330
12331 TREE_OPERAND (node, 1) = nn;
12332 }
12333 return patch_binop (node, wfl_op1, wfl_op2, 0);
12334
12335 case INSTANCEOF_EXPR:
12336 wfl_op1 = TREE_OPERAND (node, 0);
12337 COMPLETE_CHECK_OP_0 (node);
12338 return patch_binop (node, wfl_op1, TREE_OPERAND (node, 1), 0);
12339
12340 case UNARY_PLUS_EXPR:
12341 case NEGATE_EXPR:
12342 case TRUTH_NOT_EXPR:
12343 case BIT_NOT_EXPR:
12344 case PREDECREMENT_EXPR:
12345 case PREINCREMENT_EXPR:
12346 case POSTDECREMENT_EXPR:
12347 case POSTINCREMENT_EXPR:
12348 case CONVERT_EXPR:
12349 /* There are cases were wfl_op1 is a WFL. patch_unaryop knows
12350 how to handle those cases. */
12351 wfl_op1 = TREE_OPERAND (node, 0);
12352 CAN_COMPLETE_NORMALLY (node) = 1;
12353 TREE_OPERAND (node, 0) = java_complete_tree (wfl_op1);
12354 if (TREE_OPERAND (node, 0) == error_mark_node)
12355 return error_mark_node;
12356 node = patch_unaryop (node, wfl_op1);
12357 CAN_COMPLETE_NORMALLY (node) = 1;
12358 break;
12359
12360 case ARRAY_REF:
12361 /* There are cases were wfl_op1 is a WFL. patch_array_ref knows
12362 how to handle those cases. */
12363 wfl_op1 = TREE_OPERAND (node, 0);
12364 TREE_OPERAND (node, 0) = java_complete_tree (wfl_op1);
12365 if (TREE_OPERAND (node, 0) == error_mark_node)
12366 return error_mark_node;
12367 if (!flag_emit_class_files)
12368 TREE_OPERAND (node, 0) = save_expr (TREE_OPERAND (node, 0));
12369 /* The same applies to wfl_op2 */
12370 wfl_op2 = TREE_OPERAND (node, 1);
12371 TREE_OPERAND (node, 1) = java_complete_tree (wfl_op2);
12372 if (TREE_OPERAND (node, 1) == error_mark_node)
12373 return error_mark_node;
12374 if (!flag_emit_class_files)
12375 TREE_OPERAND (node, 1) = save_expr (TREE_OPERAND (node, 1));
12376 return patch_array_ref (node);
12377
12378 case RECORD_TYPE:
12379 return node;;
12380
12381 case COMPONENT_REF:
12382 /* The first step in the re-write of qualified name handling. FIXME.
12383 So far, this is only to support PRIMTYPE.class ->
12384 PRIMCLASS.TYPE. */
12385 {
12386 tree prim_class = TREE_OPERAND (node, 0);
12387 tree name = TREE_OPERAND (node, 1);
12388 tree field;
12389
12390 gcc_assert (TREE_CODE (prim_class) == NOP_EXPR);
12391 prim_class = java_complete_tree (TREE_TYPE (prim_class));
12392 gcc_assert (TREE_CODE (prim_class) == RECORD_TYPE);
12393 field = lookup_field_wrapper (prim_class, name);
12394
12395 if (field == NULL_TREE)
12396 {
12397 error ("missing static field %qs", IDENTIFIER_POINTER (name));
12398 return error_mark_node;
12399 }
12400 if (! FIELD_STATIC (field))
12401 {
12402 error ("not a static field %qs", IDENTIFIER_POINTER (name));
12403 return error_mark_node;
12404 }
12405 return field;
12406 }
12407 break;
12408
12409 case THIS_EXPR:
12410 /* Can't use THIS in a static environment */
12411 if (!current_this)
12412 {
12413 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
12414 parse_error_context (wfl_operator,
12415 "Keyword %<this%> used outside allowed context");
12416 TREE_TYPE (node) = error_mark_node;
12417 return error_mark_node;
12418 }
12419 if (ctxp->explicit_constructor_p)
12420 {
12421 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
12422 parse_error_context
12423 (wfl_operator, "Can't reference %<this%> or %<super%> before the superclass constructor has been called");
12424 TREE_TYPE (node) = error_mark_node;
12425 return error_mark_node;
12426 }
12427 return current_this;
12428
12429 case CLASS_LITERAL:
12430 CAN_COMPLETE_NORMALLY (node) = 1;
12431 node = patch_incomplete_class_ref (node);
12432 if (node == error_mark_node)
12433 return error_mark_node;
12434 break;
12435
12436 default:
12437 CAN_COMPLETE_NORMALLY (node) = 1;
12438 /* Ok: may be we have a STRING_CST or a crafted `StringBuffer'
12439 and it's time to turn it into the appropriate String object */
12440 if ((nn = patch_string (node)))
12441 node = nn;
12442 else
12443 internal_error ("No case for %s", tree_code_name [TREE_CODE (node)]);
12444 }
12445 return node;
12446 }
12447
12448 /* Complete function call's argument. Return a nonzero value is an
12449 error was found. */
12450
12451 static int
12452 complete_function_arguments (tree node)
12453 {
12454 int flag = 0;
12455 tree cn;
12456
12457 ctxp->explicit_constructor_p += (CALL_EXPLICIT_CONSTRUCTOR_P (node) ? 1 : 0);
12458 for (cn = TREE_OPERAND (node, 1); cn; cn = TREE_CHAIN (cn))
12459 {
12460 tree wfl = TREE_VALUE (cn), parm, temp;
12461 parm = java_complete_tree (wfl);
12462
12463 if (parm == error_mark_node)
12464 {
12465 flag = 1;
12466 continue;
12467 }
12468 /* If we have a string literal that we haven't transformed yet or a
12469 crafted string buffer, as a result of the use of the String
12470 `+' operator. Build `parm.toString()' and expand it. */
12471 if ((temp = patch_string (parm)))
12472 parm = temp;
12473
12474 TREE_VALUE (cn) = parm;
12475 }
12476 ctxp->explicit_constructor_p -= (CALL_EXPLICIT_CONSTRUCTOR_P (node) ? 1 : 0);
12477 return flag;
12478 }
12479
12480 /* Sometimes (for loops and variable initialized during their
12481 declaration), we want to wrap a statement around a WFL and turn it
12482 debugable. */
12483
12484 static tree
12485 build_debugable_stmt (int location, tree stmt)
12486 {
12487 if (TREE_CODE (stmt) != EXPR_WITH_FILE_LOCATION)
12488 {
12489 #ifdef USE_MAPPED_LOCATION
12490 stmt = expr_add_location (stmt, location, 1);
12491 #else
12492 stmt = build_expr_wfl (stmt, input_filename, 0, 0);
12493 EXPR_WFL_LINECOL (stmt) = location;
12494 JAVA_MAYBE_GENERATE_DEBUG_INFO (stmt);
12495 #endif
12496 }
12497 return stmt;
12498 }
12499
12500 static tree
12501 build_expr_block (tree body, tree decls)
12502 {
12503 tree node = make_node (BLOCK);
12504 BLOCK_EXPR_DECLS (node) = decls;
12505 BLOCK_EXPR_BODY (node) = body;
12506 if (body)
12507 TREE_TYPE (node) = TREE_TYPE (body);
12508 TREE_SIDE_EFFECTS (node) = 1;
12509 return node;
12510 }
12511
12512 /* Create a new function block and link it appropriately to current
12513 function block chain */
12514
12515 static tree
12516 enter_block (void)
12517 {
12518 tree b = build_expr_block (NULL_TREE, NULL_TREE);
12519
12520 /* Link block B supercontext to the previous block. The current
12521 function DECL is used as supercontext when enter_a_block is called
12522 for the first time for a given function. The current function body
12523 (DECL_FUNCTION_BODY) is set to be block B. */
12524
12525 tree fndecl = current_function_decl;
12526
12527 if (!fndecl) {
12528 BLOCK_SUPERCONTEXT (b) = current_static_block;
12529 current_static_block = b;
12530 }
12531
12532 else if (!DECL_FUNCTION_BODY (fndecl))
12533 {
12534 BLOCK_SUPERCONTEXT (b) = fndecl;
12535 DECL_FUNCTION_BODY (fndecl) = b;
12536 }
12537 else
12538 {
12539 BLOCK_SUPERCONTEXT (b) = DECL_FUNCTION_BODY (fndecl);
12540 DECL_FUNCTION_BODY (fndecl) = b;
12541 }
12542 return b;
12543 }
12544
12545 /* Exit a block by changing the current function body
12546 (DECL_FUNCTION_BODY) to the current block super context, only if
12547 the block being exited isn't the method's top level one. */
12548
12549 static tree
12550 exit_block (void)
12551 {
12552 tree b;
12553 if (current_function_decl)
12554 {
12555 b = DECL_FUNCTION_BODY (current_function_decl);
12556 if (BLOCK_SUPERCONTEXT (b) != current_function_decl)
12557 DECL_FUNCTION_BODY (current_function_decl) = BLOCK_SUPERCONTEXT (b);
12558 }
12559 else
12560 {
12561 b = current_static_block;
12562
12563 if (BLOCK_SUPERCONTEXT (b))
12564 current_static_block = BLOCK_SUPERCONTEXT (b);
12565 }
12566 return b;
12567 }
12568
12569 /* Lookup for NAME in the nested function's blocks, all the way up to
12570 the current toplevel one. It complies with Java's local variable
12571 scoping rules. */
12572
12573 static tree
12574 lookup_name_in_blocks (tree name)
12575 {
12576 tree b = GET_CURRENT_BLOCK (current_function_decl);
12577
12578 while (b != current_function_decl)
12579 {
12580 tree current;
12581
12582 /* Paranoid sanity check. To be removed */
12583 if (TREE_CODE (b) != BLOCK)
12584 abort ();
12585
12586 for (current = BLOCK_EXPR_DECLS (b); current;
12587 current = TREE_CHAIN (current))
12588 if (DECL_NAME (current) == name)
12589 return current;
12590 b = BLOCK_SUPERCONTEXT (b);
12591 }
12592 return NULL_TREE;
12593 }
12594
12595 static void
12596 maybe_absorb_scoping_blocks (void)
12597 {
12598 while (BLOCK_IS_IMPLICIT (GET_CURRENT_BLOCK (current_function_decl)))
12599 {
12600 tree b = exit_block ();
12601 java_method_add_stmt (current_function_decl, b);
12602 SOURCE_FRONTEND_DEBUG (("Absorbing scoping block at line %d", input_line));
12603 }
12604 }
12605
12606 \f
12607 /* This section of the source is reserved to build_* functions that
12608 are building incomplete tree nodes and the patch_* functions that
12609 are completing them. */
12610
12611 /* Wrap a non WFL node around a WFL. */
12612
12613 static tree
12614 build_wfl_wrap (tree node, int location)
12615 {
12616 tree wfl, node_to_insert = node;
12617
12618 /* We want to process THIS . xxx symbolically, to keep it consistent
12619 with the way we're processing SUPER. A THIS from a primary as a
12620 different form than a SUPER. Turn THIS into something symbolic */
12621 if (TREE_CODE (node) == THIS_EXPR)
12622 node_to_insert = wfl = build_wfl_node (this_identifier_node);
12623 else
12624 #ifdef USE_MAPPED_LOCATION
12625 wfl = build_unknown_wfl (NULL_TREE);
12626
12627 SET_EXPR_LOCATION (wfl, location);
12628 #else
12629 wfl = build_expr_wfl (NULL_TREE, ctxp->filename, 0, 0);
12630
12631 EXPR_WFL_LINECOL (wfl) = location;
12632 #endif
12633 EXPR_WFL_QUALIFICATION (wfl) = build_tree_list (node_to_insert, NULL_TREE);
12634 return wfl;
12635 }
12636
12637 /* Build a super() constructor invocation. Returns an empty statement if
12638 we're currently dealing with the class java.lang.Object. */
12639
12640 static tree
12641 build_super_invocation (tree mdecl)
12642 {
12643 if (DECL_CONTEXT (mdecl) == object_type_node)
12644 return build_java_empty_stmt ();
12645 else
12646 {
12647 tree super_wfl = build_wfl_node (super_identifier_node);
12648 tree a = NULL_TREE, t;
12649
12650 /* This is called after parsing is done, so the parser context
12651 won't be accurate. Set location info from current_class decl. */
12652 tree class_wfl = lookup_cl (TYPE_NAME (current_class));
12653 EXPR_WFL_LINECOL (super_wfl) = EXPR_WFL_LINECOL (class_wfl);
12654
12655 /* If we're dealing with an anonymous class, pass the arguments
12656 of the crafted constructor along. */
12657 if (ANONYMOUS_CLASS_P (DECL_CONTEXT (mdecl)))
12658 {
12659 SKIP_THIS_AND_ARTIFICIAL_PARMS (t, mdecl);
12660 for (; t != end_params_node; t = TREE_CHAIN (t))
12661 a = tree_cons (NULL_TREE, build_wfl_node (TREE_PURPOSE (t)), a);
12662 }
12663 return build_method_invocation (super_wfl, a);
12664 }
12665 }
12666
12667 /* Build a SUPER/THIS qualified method invocation. */
12668
12669 static tree
12670 build_this_super_qualified_invocation (int use_this, tree name, tree args,
12671 int lloc, int rloc)
12672 {
12673 tree invok;
12674 tree wfl =
12675 build_wfl_node (use_this ? this_identifier_node : super_identifier_node);
12676 EXPR_WFL_LINECOL (wfl) = lloc;
12677 invok = build_method_invocation (name, args);
12678 return make_qualified_primary (wfl, invok, rloc);
12679 }
12680
12681 /* Build an incomplete CALL_EXPR node. */
12682
12683 static tree
12684 build_method_invocation (tree name, tree args)
12685 {
12686 tree call = build3 (CALL_EXPR, NULL_TREE, name, args, NULL_TREE);
12687 TREE_SIDE_EFFECTS (call) = 1;
12688 EXPR_WFL_LINECOL (call) = EXPR_WFL_LINECOL (name);
12689 return call;
12690 }
12691
12692 /* Build an incomplete new xxx(...) node. */
12693
12694 static tree
12695 build_new_invocation (tree name, tree args)
12696 {
12697 tree call = build3 (NEW_CLASS_EXPR, NULL_TREE, name, args, NULL_TREE);
12698 TREE_SIDE_EFFECTS (call) = 1;
12699 EXPR_WFL_LINECOL (call) = EXPR_WFL_LINECOL (name);
12700 return call;
12701 }
12702
12703 /* Build an incomplete assignment expression. */
12704
12705 static tree
12706 build_assignment (int op, int op_location, tree lhs, tree rhs)
12707 {
12708 tree assignment;
12709 /* Build the corresponding binop if we deal with a Compound
12710 Assignment operator. Mark the binop sub-tree as part of a
12711 Compound Assignment expression */
12712 if (op != ASSIGN_TK)
12713 {
12714 rhs = build_binop (BINOP_LOOKUP (op), op_location, lhs, rhs);
12715 COMPOUND_ASSIGN_P (rhs) = 1;
12716 }
12717 assignment = build2 (MODIFY_EXPR, NULL_TREE, lhs, rhs);
12718 TREE_SIDE_EFFECTS (assignment) = 1;
12719 EXPR_WFL_LINECOL (assignment) = op_location;
12720 return assignment;
12721 }
12722
12723 /* Print an INTEGER_CST node as decimal in a static buffer, and return
12724 the buffer. This is used only for string conversion. */
12725 static char *
12726 string_convert_int_cst (tree node)
12727 {
12728 /* Long.MIN_VALUE is -9223372036854775808, 20 characters. */
12729 static char buffer[21];
12730
12731 unsigned HOST_WIDE_INT lo = TREE_INT_CST_LOW (node);
12732 unsigned HOST_WIDE_INT hi = TREE_INT_CST_HIGH (node);
12733 char *p = buffer + sizeof (buffer);
12734 int neg = 0;
12735
12736 unsigned HOST_WIDE_INT hibit = (((unsigned HOST_WIDE_INT) 1)
12737 << (HOST_BITS_PER_WIDE_INT - 1));
12738
12739 *--p = '\0';
12740
12741 /* If negative, note the fact and negate the value. */
12742 if ((hi & hibit))
12743 {
12744 lo = ~lo;
12745 hi = ~hi;
12746 if (++lo == 0)
12747 ++hi;
12748 neg = 1;
12749 }
12750
12751 /* Divide by 10 until there are no bits left. */
12752 do
12753 {
12754 unsigned HOST_WIDE_INT acc = 0;
12755 unsigned HOST_WIDE_INT outhi = 0, outlo = 0;
12756 unsigned int i;
12757
12758 /* Use long division to compute the result and the remainder. */
12759 for (i = 0; i < 2 * HOST_BITS_PER_WIDE_INT; ++i)
12760 {
12761 /* Shift a bit into accumulator. */
12762 acc <<= 1;
12763 if ((hi & hibit))
12764 acc |= 1;
12765
12766 /* Shift the value. */
12767 hi <<= 1;
12768 if ((lo & hibit))
12769 hi |= 1;
12770 lo <<= 1;
12771
12772 /* Shift the correct bit into the result. */
12773 outhi <<= 1;
12774 if ((outlo & hibit))
12775 outhi |= 1;
12776 outlo <<= 1;
12777 if (acc >= 10)
12778 {
12779 acc -= 10;
12780 outlo |= 1;
12781 }
12782 }
12783
12784 /* '0' == 060 in Java, but might not be here (think EBCDIC). */
12785 *--p = '\060' + acc;
12786
12787 hi = outhi;
12788 lo = outlo;
12789 }
12790 while (hi || lo);
12791
12792 if (neg)
12793 *--p = '\055'; /* '-' == 055 in Java, but might not be here. */
12794
12795 return p;
12796 }
12797
12798 /* Print an INTEGER_CST node in a static buffer, and return the
12799 buffer. This is used only for error handling. */
12800 char *
12801 print_int_node (tree node)
12802 {
12803 static char buffer [80];
12804 if (TREE_CONSTANT_OVERFLOW (node))
12805 sprintf (buffer, "<overflow>");
12806
12807 if (TREE_INT_CST_HIGH (node) == 0)
12808 sprintf (buffer, HOST_WIDE_INT_PRINT_UNSIGNED,
12809 TREE_INT_CST_LOW (node));
12810 else if (TREE_INT_CST_HIGH (node) == -1
12811 && TREE_INT_CST_LOW (node) != 0)
12812 sprintf (buffer, "-" HOST_WIDE_INT_PRINT_UNSIGNED,
12813 -TREE_INT_CST_LOW (node));
12814 else
12815 sprintf (buffer, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
12816 TREE_INT_CST_HIGH (node), TREE_INT_CST_LOW (node));
12817
12818 return buffer;
12819 }
12820
12821 \f
12822 /* Return 1 if an assignment to a FINAL is attempted in a non suitable
12823 context. */
12824
12825 /* 15.25 Assignment operators. */
12826
12827 static tree
12828 patch_assignment (tree node, tree wfl_op1)
12829 {
12830 tree rhs = TREE_OPERAND (node, 1);
12831 tree lvalue = TREE_OPERAND (node, 0), llvalue;
12832 tree lhs_type = NULL_TREE, rhs_type, new_rhs = NULL_TREE;
12833 int error_found = 0;
12834 int lvalue_from_array = 0;
12835 int is_return = 0;
12836
12837 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
12838
12839 /* Lhs can be a named variable */
12840 if (JDECL_P (lvalue))
12841 {
12842 lhs_type = TREE_TYPE (lvalue);
12843 }
12844 /* Or Lhs can be an array access. */
12845 else if (TREE_CODE (lvalue) == ARRAY_REF)
12846 {
12847 lhs_type = TREE_TYPE (lvalue);
12848 lvalue_from_array = 1;
12849 }
12850 /* Or a field access */
12851 else if (TREE_CODE (lvalue) == COMPONENT_REF)
12852 lhs_type = TREE_TYPE (lvalue);
12853 /* Or a function return slot */
12854 else if (TREE_CODE (lvalue) == RESULT_DECL)
12855 {
12856 /* If the return type is an integral type, then we create the
12857 RESULT_DECL with a promoted type, but we need to do these
12858 checks against the unpromoted type to ensure type safety. So
12859 here we look at the real type, not the type of the decl we
12860 are modifying. */
12861 lhs_type = TREE_TYPE (TREE_TYPE (current_function_decl));
12862 is_return = 1;
12863 }
12864 /* Otherwise, we might want to try to write into an optimized static
12865 final, this is an of a different nature, reported further on. */
12866 else if (TREE_CODE (wfl_op1) == EXPR_WITH_FILE_LOCATION
12867 && resolve_expression_name (wfl_op1, &llvalue))
12868 {
12869 lhs_type = TREE_TYPE (lvalue);
12870 }
12871 else
12872 {
12873 parse_error_context (wfl_op1, "Invalid left hand side of assignment");
12874 error_found = 1;
12875 }
12876
12877 rhs_type = TREE_TYPE (rhs);
12878
12879 /* 5.1 Try the assignment conversion for builtin type. */
12880 new_rhs = try_builtin_assignconv (wfl_op1, lhs_type, rhs);
12881
12882 /* 5.2 If it failed, try a reference conversion */
12883 if (!new_rhs)
12884 new_rhs = try_reference_assignconv (lhs_type, rhs);
12885
12886 /* 15.25.2 If we have a compound assignment, convert RHS into the
12887 type of the LHS */
12888 else if (COMPOUND_ASSIGN_P (TREE_OPERAND (node, 1)))
12889 new_rhs = convert (lhs_type, rhs);
12890
12891 /* Explicit cast required. This is an error */
12892 if (!new_rhs)
12893 {
12894 char *t1 = xstrdup (lang_printable_name (TREE_TYPE (rhs), 0));
12895 char *t2 = xstrdup (lang_printable_name (lhs_type, 0));
12896 tree wfl;
12897 char operation [32]; /* Max size known */
12898
12899 /* If the assignment is part of a declaration, we use the WFL of
12900 the declared variable to point out the error and call it a
12901 declaration problem. If the assignment is a genuine =
12902 operator, we call is a operator `=' problem, otherwise we
12903 call it an assignment problem. In both of these last cases,
12904 we use the WFL of the operator to indicate the error. */
12905
12906 if (MODIFY_EXPR_FROM_INITIALIZATION_P (node))
12907 {
12908 wfl = wfl_op1;
12909 strcpy (operation, "declaration");
12910 }
12911 else
12912 {
12913 wfl = wfl_operator;
12914 if (COMPOUND_ASSIGN_P (TREE_OPERAND (node, 1)))
12915 strcpy (operation, "assignment");
12916 else if (is_return)
12917 strcpy (operation, "'return'");
12918 else
12919 strcpy (operation, "'='");
12920 }
12921
12922 if (!valid_cast_to_p (rhs_type, lhs_type))
12923 parse_error_context
12924 (wfl, "Incompatible type for %s. Can't convert %qs to %qs",
12925 operation, t1, t2);
12926 else
12927 parse_error_context (wfl, "Incompatible type for %s. Explicit cast needed to convert %qs to %qs",
12928 operation, t1, t2);
12929 free (t1); free (t2);
12930 error_found = 1;
12931 }
12932
12933 if (error_found)
12934 return error_mark_node;
12935
12936 /* If we're processing a `return' statement, promote the actual type
12937 to the promoted type. */
12938 if (is_return)
12939 new_rhs = convert (TREE_TYPE (lvalue), new_rhs);
12940
12941 /* 10.10: Array Store Exception runtime check */
12942 if (!flag_emit_class_files
12943 && lvalue_from_array
12944 && JREFERENCE_TYPE_P (TYPE_ARRAY_ELEMENT (lhs_type)))
12945 {
12946 tree array, store_check, base, index_expr;
12947
12948 /* Save RHS so that it doesn't get re-evaluated by the store check. */
12949 new_rhs = save_expr (new_rhs);
12950
12951 /* Get the INDIRECT_REF. */
12952 array = TREE_OPERAND (TREE_OPERAND (lvalue, 0), 0);
12953 /* Get the array pointer expr. */
12954 array = TREE_OPERAND (array, 0);
12955 store_check = build_java_arraystore_check (array, new_rhs);
12956
12957 index_expr = TREE_OPERAND (lvalue, 1);
12958
12959 if (TREE_CODE (index_expr) == COMPOUND_EXPR)
12960 {
12961 /* A COMPOUND_EXPR here is a bounds check. The bounds check must
12962 happen before the store check, so prepare to insert the store
12963 check within the second operand of the existing COMPOUND_EXPR. */
12964 base = index_expr;
12965 }
12966 else
12967 base = lvalue;
12968
12969 index_expr = TREE_OPERAND (base, 1);
12970 TREE_OPERAND (base, 1) = build2 (COMPOUND_EXPR, TREE_TYPE (index_expr),
12971 store_check, index_expr);
12972 }
12973
12974 /* Final locals can be used as case values in switch
12975 statement. Prepare them for this eventuality. */
12976 if (TREE_CODE (lvalue) == VAR_DECL
12977 && DECL_FINAL (lvalue)
12978 && TREE_CONSTANT (new_rhs)
12979 && IDENTIFIER_LOCAL_VALUE (DECL_NAME (lvalue))
12980 && JINTEGRAL_TYPE_P (TREE_TYPE (lvalue))
12981 )
12982 {
12983 TREE_CONSTANT (lvalue) = 1;
12984 TREE_INVARIANT (lvalue) = 1;
12985 DECL_INITIAL (lvalue) = new_rhs;
12986 }
12987
12988 /* Copy the rhs if it's a reference. */
12989 if (! flag_check_references && ! flag_emit_class_files && optimize > 0)
12990 {
12991 switch (TREE_CODE (new_rhs))
12992 {
12993 case ARRAY_REF:
12994 case INDIRECT_REF:
12995 case COMPONENT_REF:
12996 /* Transform a = foo.bar
12997 into a = ({int tmp; tmp = foo.bar;}).
12998 We need to ensure that if a read from memory fails
12999 because of a NullPointerException, a destination variable
13000 will remain unchanged. An explicit temporary does what
13001 we need.
13002
13003 If flag_check_references is set, this is unnecessary
13004 because we'll check each reference before doing any
13005 reads. If optimize is not set the result will never be
13006 written to a stack slot that contains the LHS. */
13007 {
13008 tree tmp = build_decl (VAR_DECL, get_identifier ("<tmp>"),
13009 TREE_TYPE (new_rhs));
13010 tree block = make_node (BLOCK);
13011 tree assignment
13012 = build2 (MODIFY_EXPR, TREE_TYPE (new_rhs), tmp, fold (new_rhs));
13013 DECL_CONTEXT (tmp) = current_function_decl;
13014 TREE_TYPE (block) = TREE_TYPE (new_rhs);
13015 BLOCK_VARS (block) = tmp;
13016 BLOCK_EXPR_BODY (block) = assignment;
13017 TREE_SIDE_EFFECTS (block) = 1;
13018 new_rhs = block;
13019 }
13020 break;
13021 default:
13022 break;
13023 }
13024 }
13025
13026 TREE_OPERAND (node, 0) = lvalue;
13027 TREE_OPERAND (node, 1) = new_rhs;
13028 TREE_TYPE (node) = lhs_type;
13029 return node;
13030 }
13031
13032 /* Check that type SOURCE can be cast into type DEST. If the cast
13033 can't occur at all, return NULL; otherwise, return a possibly
13034 modified rhs. */
13035
13036 static tree
13037 try_reference_assignconv (tree lhs_type, tree rhs)
13038 {
13039 tree new_rhs = NULL_TREE;
13040 tree rhs_type = TREE_TYPE (rhs);
13041
13042 if (!JPRIMITIVE_TYPE_P (rhs_type) && JREFERENCE_TYPE_P (lhs_type))
13043 {
13044 /* `null' may be assigned to any reference type */
13045 if (rhs == null_pointer_node)
13046 new_rhs = null_pointer_node;
13047 /* Try the reference assignment conversion */
13048 else if (valid_ref_assignconv_cast_p (rhs_type, lhs_type, 0))
13049 new_rhs = rhs;
13050 /* This is a magic assignment that we process differently */
13051 else if (TREE_CODE (rhs) == JAVA_EXC_OBJ_EXPR)
13052 new_rhs = rhs;
13053 }
13054 return new_rhs;
13055 }
13056
13057 /* Check that RHS can be converted into LHS_TYPE by the assignment
13058 conversion (5.2), for the cases of RHS being a builtin type. Return
13059 NULL_TREE if the conversion fails or if because RHS isn't of a
13060 builtin type. Return a converted RHS if the conversion is possible. */
13061
13062 static tree
13063 try_builtin_assignconv (tree wfl_op1, tree lhs_type, tree rhs)
13064 {
13065 tree new_rhs = NULL_TREE;
13066 tree rhs_type = TREE_TYPE (rhs);
13067
13068 /* Handle boolean specially. */
13069 if (TREE_CODE (rhs_type) == BOOLEAN_TYPE
13070 || TREE_CODE (lhs_type) == BOOLEAN_TYPE)
13071 {
13072 if (TREE_CODE (rhs_type) == BOOLEAN_TYPE
13073 && TREE_CODE (lhs_type) == BOOLEAN_TYPE)
13074 new_rhs = rhs;
13075 }
13076
13077 /* 5.1.1 Try Identity Conversion,
13078 5.1.2 Try Widening Primitive Conversion */
13079 else if (valid_builtin_assignconv_identity_widening_p (lhs_type, rhs_type))
13080 new_rhs = convert (lhs_type, rhs);
13081
13082 /* Try a narrowing primitive conversion (5.1.3):
13083 - expression is a constant expression of type byte, short, char,
13084 or int, AND
13085 - variable is byte, short or char AND
13086 - The value of the expression is representable in the type of the
13087 variable */
13088 else if ((rhs_type == byte_type_node || rhs_type == short_type_node
13089 || rhs_type == char_type_node || rhs_type == int_type_node)
13090 && TREE_CONSTANT (rhs)
13091 && (lhs_type == byte_type_node || lhs_type == char_type_node
13092 || lhs_type == short_type_node))
13093 {
13094 if (int_fits_type_p (rhs, lhs_type))
13095 new_rhs = convert (lhs_type, rhs);
13096 else if (wfl_op1) /* Might be called with a NULL */
13097 parse_warning_context
13098 (wfl_op1,
13099 "Constant expression %qs too wide for narrowing primitive conversion to %qs",
13100 print_int_node (rhs), lang_printable_name (lhs_type, 0));
13101 /* Reported a warning that will turn into an error further
13102 down, so we don't return */
13103 }
13104
13105 return new_rhs;
13106 }
13107
13108 /* Return 1 if RHS_TYPE can be converted to LHS_TYPE by identity
13109 conversion (5.1.1) or widening primitive conversion (5.1.2). Return
13110 0 is the conversion test fails. This implements parts the method
13111 invocation conversion (5.3). */
13112
13113 static int
13114 valid_builtin_assignconv_identity_widening_p (tree lhs_type, tree rhs_type)
13115 {
13116 /* 5.1.1: This is the identity conversion part. */
13117 if (lhs_type == rhs_type)
13118 return 1;
13119
13120 /* Reject non primitive types and boolean conversions. */
13121 if (!JNUMERIC_TYPE_P (lhs_type) || !JNUMERIC_TYPE_P (rhs_type))
13122 return 0;
13123
13124 /* 5.1.2: widening primitive conversion. byte, even if it's smaller
13125 than a char can't be converted into a char. Short can't too, but
13126 the < test below takes care of that */
13127 if (lhs_type == char_type_node && rhs_type == byte_type_node)
13128 return 0;
13129
13130 /* Accept all promoted type here. Note, we can't use <= in the test
13131 below, because we still need to bounce out assignments of short
13132 to char and the likes */
13133 if (lhs_type == int_type_node
13134 && (rhs_type == promoted_byte_type_node
13135 || rhs_type == promoted_short_type_node
13136 || rhs_type == promoted_char_type_node
13137 || rhs_type == promoted_boolean_type_node))
13138 return 1;
13139
13140 /* From here, an integral is widened if its precision is smaller
13141 than the precision of the LHS or if the LHS is a floating point
13142 type, or the RHS is a float and the RHS a double. */
13143 if ((JINTEGRAL_TYPE_P (rhs_type) && JINTEGRAL_TYPE_P (lhs_type)
13144 && (TYPE_PRECISION (rhs_type) < TYPE_PRECISION (lhs_type)))
13145 || (JINTEGRAL_TYPE_P (rhs_type) && JFLOAT_TYPE_P (lhs_type))
13146 || (rhs_type == float_type_node && lhs_type == double_type_node))
13147 return 1;
13148
13149 return 0;
13150 }
13151
13152 /* Check that something of SOURCE type can be assigned or cast to
13153 something of DEST type at runtime. Return 1 if the operation is
13154 valid, 0 otherwise. If CAST is set to 1, we're treating the case
13155 were SOURCE is cast into DEST, which borrows a lot of the
13156 assignment check. */
13157
13158 static int
13159 valid_ref_assignconv_cast_p (tree source, tree dest, int cast)
13160 {
13161 /* SOURCE or DEST might be null if not from a declared entity. */
13162 if (!source || !dest)
13163 return 0;
13164 if (JNULLP_TYPE_P (source))
13165 return 1;
13166 if (TREE_CODE (source) == POINTER_TYPE)
13167 source = TREE_TYPE (source);
13168 if (TREE_CODE (dest) == POINTER_TYPE)
13169 dest = TREE_TYPE (dest);
13170
13171 /* If source and dest are being compiled from bytecode, they may need to
13172 be loaded. */
13173 if (CLASS_P (source) && !CLASS_LOADED_P (source))
13174 {
13175 load_class (source, 1);
13176 safe_layout_class (source);
13177 }
13178 if (CLASS_P (dest) && !CLASS_LOADED_P (dest))
13179 {
13180 load_class (dest, 1);
13181 safe_layout_class (dest);
13182 }
13183
13184 /* Case where SOURCE is a class type */
13185 if (TYPE_CLASS_P (source))
13186 {
13187 if (TYPE_CLASS_P (dest))
13188 return (source == dest
13189 || inherits_from_p (source, dest)
13190 || (cast && inherits_from_p (dest, source)));
13191 if (TYPE_INTERFACE_P (dest))
13192 {
13193 /* If doing a cast and SOURCE is final, the operation is
13194 always correct a compile time (because even if SOURCE
13195 does not implement DEST, a subclass of SOURCE might). */
13196 if (cast && !CLASS_FINAL (TYPE_NAME (source)))
13197 return 1;
13198 /* Otherwise, SOURCE must implement DEST */
13199 return interface_of_p (dest, source);
13200 }
13201 /* DEST is an array, cast permitted if SOURCE is of Object type */
13202 return (cast && source == object_type_node ? 1 : 0);
13203 }
13204 if (TYPE_INTERFACE_P (source))
13205 {
13206 if (TYPE_CLASS_P (dest))
13207 {
13208 /* If not casting, DEST must be the Object type */
13209 if (!cast)
13210 return dest == object_type_node;
13211 /* We're doing a cast. The cast is always valid is class
13212 DEST is not final, otherwise, DEST must implement SOURCE */
13213 else if (!CLASS_FINAL (TYPE_NAME (dest)))
13214 return 1;
13215 else
13216 return interface_of_p (source, dest);
13217 }
13218 if (TYPE_INTERFACE_P (dest))
13219 {
13220 /* If doing a cast, then if SOURCE and DEST contain method
13221 with the same signature but different return type, then
13222 this is a (compile time) error */
13223 if (cast)
13224 {
13225 tree method_source, method_dest;
13226 tree source_type;
13227 tree source_sig;
13228 tree source_name;
13229 for (method_source = TYPE_METHODS (source); method_source;
13230 method_source = TREE_CHAIN (method_source))
13231 {
13232 source_sig =
13233 build_java_argument_signature (TREE_TYPE (method_source));
13234 source_type = TREE_TYPE (TREE_TYPE (method_source));
13235 source_name = DECL_NAME (method_source);
13236 for (method_dest = TYPE_METHODS (dest);
13237 method_dest; method_dest = TREE_CHAIN (method_dest))
13238 if (source_sig ==
13239 build_java_argument_signature (TREE_TYPE (method_dest))
13240 && source_name == DECL_NAME (method_dest)
13241 && source_type != TREE_TYPE (TREE_TYPE (method_dest)))
13242 return 0;
13243 }
13244 return 1;
13245 }
13246 else
13247 return source == dest || interface_of_p (dest, source);
13248 }
13249 else
13250 {
13251 /* Array */
13252 return (cast
13253 && (DECL_NAME (TYPE_NAME (source))
13254 == java_lang_cloneable_identifier_node
13255 || (DECL_NAME (TYPE_NAME (source))
13256 == java_io_serializable_identifier_node)));
13257 }
13258 }
13259 if (TYPE_ARRAY_P (source))
13260 {
13261 if (TYPE_CLASS_P (dest))
13262 return dest == object_type_node;
13263 /* Can't cast an array to an interface unless the interface is
13264 java.lang.Cloneable or java.io.Serializable. */
13265 if (TYPE_INTERFACE_P (dest))
13266 return (DECL_NAME (TYPE_NAME (dest))
13267 == java_lang_cloneable_identifier_node
13268 || (DECL_NAME (TYPE_NAME (dest))
13269 == java_io_serializable_identifier_node));
13270 else /* Arrays */
13271 {
13272 tree source_element_type = TYPE_ARRAY_ELEMENT (source);
13273 tree dest_element_type = TYPE_ARRAY_ELEMENT (dest);
13274
13275 /* In case of severe errors, they turn out null */
13276 if (!dest_element_type || !source_element_type)
13277 return 0;
13278 if (source_element_type == dest_element_type)
13279 return 1;
13280 return valid_ref_assignconv_cast_p (source_element_type,
13281 dest_element_type, cast);
13282 }
13283 return 0;
13284 }
13285 return 0;
13286 }
13287
13288 static int
13289 valid_cast_to_p (tree source, tree dest)
13290 {
13291 if (TREE_CODE (source) == POINTER_TYPE)
13292 source = TREE_TYPE (source);
13293 if (TREE_CODE (dest) == POINTER_TYPE)
13294 dest = TREE_TYPE (dest);
13295
13296 if (TREE_CODE (source) == RECORD_TYPE && TREE_CODE (dest) == RECORD_TYPE)
13297 return valid_ref_assignconv_cast_p (source, dest, 1);
13298
13299 else if (JNUMERIC_TYPE_P (source) && JNUMERIC_TYPE_P (dest))
13300 return 1;
13301
13302 else if (TREE_CODE (source) == BOOLEAN_TYPE
13303 && TREE_CODE (dest) == BOOLEAN_TYPE)
13304 return 1;
13305
13306 return 0;
13307 }
13308
13309 static tree
13310 do_unary_numeric_promotion (tree arg)
13311 {
13312 tree type = TREE_TYPE (arg);
13313 if ((TREE_CODE (type) == INTEGER_TYPE && TYPE_PRECISION (type) < 32)
13314 || TREE_CODE (type) == CHAR_TYPE)
13315 arg = convert (int_type_node, arg);
13316 return arg;
13317 }
13318
13319 /* Return a nonzero value if SOURCE can be converted into DEST using
13320 the method invocation conversion rule (5.3). */
13321 static int
13322 valid_method_invocation_conversion_p (tree dest, tree source)
13323 {
13324 return ((JPRIMITIVE_TYPE_P (source) && JPRIMITIVE_TYPE_P (dest)
13325 && valid_builtin_assignconv_identity_widening_p (dest, source))
13326 || ((JREFERENCE_TYPE_P (source) || JNULLP_TYPE_P (source))
13327 && (JREFERENCE_TYPE_P (dest) || JNULLP_TYPE_P (dest))
13328 && valid_ref_assignconv_cast_p (source, dest, 0)));
13329 }
13330
13331 /* Build an incomplete binop expression. */
13332
13333 static tree
13334 build_binop (enum tree_code op, int op_location, tree op1, tree op2)
13335 {
13336 tree binop = build2 (op, NULL_TREE, op1, op2);
13337 TREE_SIDE_EFFECTS (binop) = 1;
13338 /* Store the location of the operator, for better error report. The
13339 string of the operator will be rebuild based on the OP value. */
13340 EXPR_WFL_LINECOL (binop) = op_location;
13341 return binop;
13342 }
13343
13344 /* Build the string of the operator retained by NODE. If NODE is part
13345 of a compound expression, add an '=' at the end of the string. This
13346 function is called when an error needs to be reported on an
13347 operator. The string is returned as a pointer to a static character
13348 buffer. */
13349
13350 static char *
13351 operator_string (tree node)
13352 {
13353 #define BUILD_OPERATOR_STRING(S) \
13354 { \
13355 sprintf (buffer, "%s%s", S, (COMPOUND_ASSIGN_P (node) ? "=" : "")); \
13356 return buffer; \
13357 }
13358
13359 static char buffer [10];
13360 switch (TREE_CODE (node))
13361 {
13362 case MULT_EXPR: BUILD_OPERATOR_STRING ("*");
13363 case RDIV_EXPR: BUILD_OPERATOR_STRING ("/");
13364 case TRUNC_MOD_EXPR: BUILD_OPERATOR_STRING ("%");
13365 case PLUS_EXPR: BUILD_OPERATOR_STRING ("+");
13366 case MINUS_EXPR: BUILD_OPERATOR_STRING ("-");
13367 case LSHIFT_EXPR: BUILD_OPERATOR_STRING ("<<");
13368 case RSHIFT_EXPR: BUILD_OPERATOR_STRING (">>");
13369 case URSHIFT_EXPR: BUILD_OPERATOR_STRING (">>>");
13370 case BIT_AND_EXPR: BUILD_OPERATOR_STRING ("&");
13371 case BIT_XOR_EXPR: BUILD_OPERATOR_STRING ("^");
13372 case BIT_IOR_EXPR: BUILD_OPERATOR_STRING ("|");
13373 case TRUTH_ANDIF_EXPR: BUILD_OPERATOR_STRING ("&&");
13374 case TRUTH_ORIF_EXPR: BUILD_OPERATOR_STRING ("||");
13375 case EQ_EXPR: BUILD_OPERATOR_STRING ("==");
13376 case NE_EXPR: BUILD_OPERATOR_STRING ("!=");
13377 case GT_EXPR: BUILD_OPERATOR_STRING (">");
13378 case GE_EXPR: BUILD_OPERATOR_STRING (">=");
13379 case LT_EXPR: BUILD_OPERATOR_STRING ("<");
13380 case LE_EXPR: BUILD_OPERATOR_STRING ("<=");
13381 case UNARY_PLUS_EXPR: BUILD_OPERATOR_STRING ("+");
13382 case NEGATE_EXPR: BUILD_OPERATOR_STRING ("-");
13383 case TRUTH_NOT_EXPR: BUILD_OPERATOR_STRING ("!");
13384 case BIT_NOT_EXPR: BUILD_OPERATOR_STRING ("~");
13385 case PREINCREMENT_EXPR: /* Fall through */
13386 case POSTINCREMENT_EXPR: BUILD_OPERATOR_STRING ("++");
13387 case PREDECREMENT_EXPR: /* Fall through */
13388 case POSTDECREMENT_EXPR: BUILD_OPERATOR_STRING ("--");
13389 default:
13390 internal_error ("unregistered operator %s",
13391 tree_code_name [TREE_CODE (node)]);
13392 }
13393 return NULL;
13394 #undef BUILD_OPERATOR_STRING
13395 }
13396
13397 /* Return 1 if VAR_ACCESS1 is equivalent to VAR_ACCESS2. */
13398
13399 static int
13400 java_decl_equiv (tree var_acc1, tree var_acc2)
13401 {
13402 if (JDECL_P (var_acc1))
13403 return (var_acc1 == var_acc2);
13404
13405 return (TREE_CODE (var_acc1) == COMPONENT_REF
13406 && TREE_CODE (var_acc2) == COMPONENT_REF
13407 && TREE_OPERAND (TREE_OPERAND (var_acc1, 0), 0)
13408 == TREE_OPERAND (TREE_OPERAND (var_acc2, 0), 0)
13409 && TREE_OPERAND (var_acc1, 1) == TREE_OPERAND (var_acc2, 1));
13410 }
13411
13412 /* Return a nonzero value if CODE is one of the operators that can be
13413 used in conjunction with the `=' operator in a compound assignment. */
13414
13415 static int
13416 binop_compound_p (enum tree_code code)
13417 {
13418 int i;
13419 for (i = 0; i < BINOP_COMPOUND_CANDIDATES; i++)
13420 if (binop_lookup [i] == code)
13421 break;
13422
13423 return i < BINOP_COMPOUND_CANDIDATES;
13424 }
13425
13426 /* Reorganize after a fold to get SAVE_EXPR to generate what we want. */
13427
13428 static tree
13429 java_refold (tree t)
13430 {
13431 tree c, b, ns, decl;
13432
13433 if (TREE_CODE (t) != MODIFY_EXPR)
13434 return t;
13435
13436 c = TREE_OPERAND (t, 1);
13437 if (! (c && TREE_CODE (c) == COMPOUND_EXPR
13438 && TREE_CODE (TREE_OPERAND (c, 0)) == MODIFY_EXPR
13439 && binop_compound_p (TREE_CODE (TREE_OPERAND (c, 1)))))
13440 return t;
13441
13442 /* Now the left branch of the binary operator. */
13443 b = TREE_OPERAND (TREE_OPERAND (c, 1), 0);
13444 if (! (b && TREE_CODE (b) == NOP_EXPR
13445 && TREE_CODE (TREE_OPERAND (b, 0)) == SAVE_EXPR))
13446 return t;
13447
13448 ns = TREE_OPERAND (TREE_OPERAND (b, 0), 0);
13449 if (! (ns && TREE_CODE (ns) == NOP_EXPR
13450 && TREE_CODE (TREE_OPERAND (ns, 0)) == SAVE_EXPR))
13451 return t;
13452
13453 decl = TREE_OPERAND (TREE_OPERAND (ns, 0), 0);
13454 if ((JDECL_P (decl) || TREE_CODE (decl) == COMPONENT_REF)
13455 /* It's got to be the an equivalent decl */
13456 && java_decl_equiv (decl, TREE_OPERAND (TREE_OPERAND (c, 0), 0)))
13457 {
13458 /* Shorten the NOP_EXPR/SAVE_EXPR path. */
13459 TREE_OPERAND (TREE_OPERAND (c, 1), 0) = TREE_OPERAND (ns, 0);
13460 /* Substitute the COMPOUND_EXPR by the BINOP_EXPR */
13461 TREE_OPERAND (t, 1) = TREE_OPERAND (c, 1);
13462 /* Change the right part of the BINOP_EXPR */
13463 TREE_OPERAND (TREE_OPERAND (t, 1), 1) = TREE_OPERAND (c, 0);
13464 }
13465
13466 return t;
13467 }
13468
13469 /* Binary operators (15.16 up to 15.18). We return error_mark_node on
13470 errors but we modify NODE so that it contains the type computed
13471 according to the expression, when it's fixed. Otherwise, we write
13472 error_mark_node as the type. It allows us to further the analysis
13473 of remaining nodes and detects more errors in certain cases. */
13474
13475 static tree
13476 patch_binop (tree node, tree wfl_op1, tree wfl_op2, int folding)
13477 {
13478 tree op1 = TREE_OPERAND (node, 0);
13479 tree op2 = TREE_OPERAND (node, 1);
13480 tree op1_type = TREE_TYPE (op1);
13481 tree op2_type = TREE_TYPE (op2);
13482 tree prom_type = NULL_TREE, cn;
13483 enum tree_code code = TREE_CODE (node);
13484
13485 /* If 1, tell the routine that we have to return error_mark_node
13486 after checking for the initialization of the RHS */
13487 int error_found = 0;
13488
13489 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
13490
13491 /* If either op<n>_type are NULL, this might be early signs of an
13492 error situation, unless it's too early to tell (in case we're
13493 handling a `+', `==', `!=' or `instanceof'.) We want to set op<n>_type
13494 correctly so the error can be later on reported accurately. */
13495 if (! (code == PLUS_EXPR || code == NE_EXPR
13496 || code == EQ_EXPR || code == INSTANCEOF_EXPR))
13497 {
13498 tree n;
13499 if (! op1_type)
13500 {
13501 n = java_complete_tree (op1);
13502 op1_type = TREE_TYPE (n);
13503 }
13504 if (! op2_type)
13505 {
13506 n = java_complete_tree (op2);
13507 op2_type = TREE_TYPE (n);
13508 }
13509 }
13510
13511 switch (code)
13512 {
13513 /* 15.16 Multiplicative operators */
13514 case MULT_EXPR: /* 15.16.1 Multiplication Operator * */
13515 case RDIV_EXPR: /* 15.16.2 Division Operator / */
13516 case TRUNC_DIV_EXPR: /* 15.16.2 Integral type Division Operator / */
13517 case TRUNC_MOD_EXPR: /* 15.16.3 Remainder operator % */
13518 if (!JNUMERIC_TYPE_P (op1_type) || !JNUMERIC_TYPE_P (op2_type))
13519 {
13520 if (!JNUMERIC_TYPE_P (op1_type))
13521 ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op1_type);
13522 if (!JNUMERIC_TYPE_P (op2_type) && (op1_type != op2_type))
13523 ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op2_type);
13524 TREE_TYPE (node) = error_mark_node;
13525 error_found = 1;
13526 break;
13527 }
13528 prom_type = binary_numeric_promotion (op1_type, op2_type, &op1, &op2);
13529
13530 /* Detect integral division by zero */
13531 if ((code == RDIV_EXPR || code == TRUNC_MOD_EXPR)
13532 && TREE_CODE (prom_type) == INTEGER_TYPE
13533 && (op2 == integer_zero_node || op2 == long_zero_node ||
13534 (TREE_CODE (op2) == INTEGER_CST &&
13535 ! TREE_INT_CST_LOW (op2) && ! TREE_INT_CST_HIGH (op2))))
13536 {
13537 parse_warning_context
13538 (wfl_operator,
13539 "Evaluating this expression will result in an arithmetic exception being thrown");
13540 TREE_CONSTANT (node) = 0;
13541 TREE_INVARIANT (node) = 0;
13542 }
13543
13544 /* Change the division operator if necessary */
13545 if (code == RDIV_EXPR && TREE_CODE (prom_type) == INTEGER_TYPE)
13546 TREE_SET_CODE (node, TRUNC_DIV_EXPR);
13547
13548 /* Before divisions as is disappear, try to simplify and bail if
13549 applicable, otherwise we won't perform even simple
13550 simplifications like (1-1)/3. We can't do that with floating
13551 point number, folds can't handle them at this stage. */
13552 if (code == RDIV_EXPR && TREE_CONSTANT (op1) && TREE_CONSTANT (op2)
13553 && JINTEGRAL_TYPE_P (op1) && JINTEGRAL_TYPE_P (op2))
13554 {
13555 TREE_TYPE (node) = prom_type;
13556 node = fold (node);
13557 if (TREE_CODE (node) != code)
13558 return node;
13559 }
13560
13561 if (TREE_CODE (prom_type) == INTEGER_TYPE
13562 && flag_use_divide_subroutine
13563 && ! flag_emit_class_files
13564 && (code == RDIV_EXPR || code == TRUNC_MOD_EXPR))
13565 return build_java_soft_divmod (TREE_CODE (node), prom_type, op1, op2);
13566
13567 /* This one is more complicated. FLOATs are processed by a
13568 function call to soft_fmod. Duplicate the value of the
13569 COMPOUND_ASSIGN_P flag. */
13570 if (code == TRUNC_MOD_EXPR)
13571 {
13572 tree mod = build_java_binop (TRUNC_MOD_EXPR, prom_type, op1, op2);
13573 COMPOUND_ASSIGN_P (mod) = COMPOUND_ASSIGN_P (node);
13574 return mod;
13575 }
13576 break;
13577
13578 /* 15.17 Additive Operators */
13579 case PLUS_EXPR: /* 15.17.1 String Concatenation Operator + */
13580
13581 /* Operation is valid if either one argument is a string
13582 constant, a String object or a StringBuffer crafted for the
13583 purpose of the a previous usage of the String concatenation
13584 operator */
13585
13586 if (TREE_CODE (op1) == STRING_CST
13587 || TREE_CODE (op2) == STRING_CST
13588 || JSTRING_TYPE_P (op1_type)
13589 || JSTRING_TYPE_P (op2_type)
13590 || IS_CRAFTED_STRING_BUFFER_P (op1)
13591 || IS_CRAFTED_STRING_BUFFER_P (op2))
13592 return build_string_concatenation (op1, op2);
13593
13594 case MINUS_EXPR: /* 15.17.2 Additive Operators (+ and -) for
13595 Numeric Types */
13596 if (!JNUMERIC_TYPE_P (op1_type) || !JNUMERIC_TYPE_P (op2_type))
13597 {
13598 if (!JNUMERIC_TYPE_P (op1_type))
13599 ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op1_type);
13600 if (!JNUMERIC_TYPE_P (op2_type) && (op1_type != op2_type))
13601 ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op2_type);
13602 TREE_TYPE (node) = error_mark_node;
13603 error_found = 1;
13604 break;
13605 }
13606 prom_type = binary_numeric_promotion (op1_type, op2_type, &op1, &op2);
13607 break;
13608
13609 /* 15.18 Shift Operators */
13610 case LSHIFT_EXPR:
13611 case RSHIFT_EXPR:
13612 case URSHIFT_EXPR:
13613 if (!JINTEGRAL_TYPE_P (op1_type) || !JINTEGRAL_TYPE_P (op2_type))
13614 {
13615 if (!JINTEGRAL_TYPE_P (op1_type))
13616 ERROR_CAST_NEEDED_TO_INTEGRAL (wfl_operator, node, op1_type);
13617 else
13618 {
13619 if (JNUMERIC_TYPE_P (op2_type))
13620 parse_error_context (wfl_operator,
13621 "Incompatible type for %qs. Explicit cast needed to convert shift distance from %qs to integral",
13622 operator_string (node),
13623 lang_printable_name (op2_type, 0));
13624 else
13625 parse_error_context (wfl_operator,
13626 "Incompatible type for %qs. Can't convert shift distance from %qs to integral",
13627 operator_string (node),
13628 lang_printable_name (op2_type, 0));
13629 }
13630 TREE_TYPE (node) = error_mark_node;
13631 error_found = 1;
13632 break;
13633 }
13634
13635 /* Unary numeric promotion (5.6.1) is performed on each operand
13636 separately */
13637 op1 = do_unary_numeric_promotion (op1);
13638 op2 = do_unary_numeric_promotion (op2);
13639
13640 /* If the right hand side is of type `long', first cast it to
13641 `int'. */
13642 if (TREE_TYPE (op2) == long_type_node)
13643 op2 = build1 (CONVERT_EXPR, int_type_node, op2);
13644
13645 /* The type of the shift expression is the type of the promoted
13646 type of the left-hand operand */
13647 prom_type = TREE_TYPE (op1);
13648
13649 /* Shift int only up to 0x1f and long up to 0x3f */
13650 if (prom_type == int_type_node)
13651 op2 = fold_build2 (BIT_AND_EXPR, int_type_node, op2,
13652 build_int_cst (NULL_TREE, 0x1f));
13653 else
13654 op2 = fold_build2 (BIT_AND_EXPR, int_type_node, op2,
13655 build_int_cst (NULL_TREE, 0x3f));
13656
13657 /* The >>> operator is a >> operating on unsigned quantities */
13658 if (code == URSHIFT_EXPR && (folding || ! flag_emit_class_files))
13659 {
13660 tree to_return;
13661 tree utype = java_unsigned_type (prom_type);
13662 op1 = convert (utype, op1);
13663
13664 to_return = fold_build2 (RSHIFT_EXPR, utype, op1, op2);
13665 to_return = convert (prom_type, to_return);
13666 /* Copy the original value of the COMPOUND_ASSIGN_P flag */
13667 COMPOUND_ASSIGN_P (to_return) = COMPOUND_ASSIGN_P (node);
13668 TREE_SIDE_EFFECTS (to_return)
13669 = TREE_SIDE_EFFECTS (op1) | TREE_SIDE_EFFECTS (op2);
13670 return to_return;
13671 }
13672 break;
13673
13674 /* 15.19.1 Type Comparison Operator instanceof */
13675 case INSTANCEOF_EXPR:
13676
13677 TREE_TYPE (node) = boolean_type_node;
13678
13679 /* OP1_TYPE might be NULL when OP1 is a string constant. */
13680 if ((cn = patch_string (op1)))
13681 {
13682 op1 = cn;
13683 op1_type = TREE_TYPE (op1);
13684 }
13685 if (op1_type == NULL_TREE)
13686 abort ();
13687
13688 if (!(op2_type = resolve_type_during_patch (op2)))
13689 return error_mark_node;
13690
13691 /* The first operand must be a reference type or the null type */
13692 if (!JREFERENCE_TYPE_P (op1_type) && op1 != null_pointer_node)
13693 error_found = 1; /* Error reported further below */
13694
13695 /* The second operand must be a reference type */
13696 if (!JREFERENCE_TYPE_P (op2_type))
13697 {
13698 SET_WFL_OPERATOR (wfl_operator, node, wfl_op2);
13699 parse_error_context
13700 (wfl_operator, "Invalid argument %qs for %<instanceof%>",
13701 lang_printable_name (op2_type, 0));
13702 error_found = 1;
13703 }
13704
13705 if (!error_found && valid_ref_assignconv_cast_p (op1_type, op2_type, 1))
13706 {
13707 /* If the first operand is null, the result is always false */
13708 if (op1 == null_pointer_node)
13709 return boolean_false_node;
13710 else if (flag_emit_class_files)
13711 {
13712 TREE_OPERAND (node, 1) = op2_type;
13713 TREE_SIDE_EFFECTS (node) = TREE_SIDE_EFFECTS (op1);
13714 return node;
13715 }
13716 /* Otherwise we have to invoke instance of to figure it out */
13717 else
13718 return build_instanceof (op1, op2_type);
13719 }
13720 /* There is no way the expression operand can be an instance of
13721 the type operand. This is a compile time error. */
13722 else
13723 {
13724 char *t1 = xstrdup (lang_printable_name (op1_type, 0));
13725 SET_WFL_OPERATOR (wfl_operator, node, wfl_op1);
13726 parse_error_context
13727 (wfl_operator, "Impossible for %qs to be instance of %qs",
13728 t1, lang_printable_name (op2_type, 0));
13729 free (t1);
13730 error_found = 1;
13731 }
13732
13733 break;
13734
13735 /* 15.21 Bitwise and Logical Operators */
13736 case BIT_AND_EXPR:
13737 case BIT_XOR_EXPR:
13738 case BIT_IOR_EXPR:
13739 if (JINTEGRAL_TYPE_P (op1_type) && JINTEGRAL_TYPE_P (op2_type))
13740 /* Binary numeric promotion is performed on both operand and the
13741 expression retain that type */
13742 prom_type = binary_numeric_promotion (op1_type, op2_type, &op1, &op2);
13743
13744 else if (TREE_CODE (op1_type) == BOOLEAN_TYPE
13745 && TREE_CODE (op1_type) == BOOLEAN_TYPE)
13746 /* The type of the bitwise operator expression is BOOLEAN */
13747 prom_type = boolean_type_node;
13748 else
13749 {
13750 if (!JINTEGRAL_TYPE_P (op1_type))
13751 ERROR_CAST_NEEDED_TO_INTEGRAL (wfl_operator, node, op1_type);
13752 if (!JINTEGRAL_TYPE_P (op2_type) && (op1_type != op2_type))
13753 ERROR_CAST_NEEDED_TO_INTEGRAL (wfl_operator, node, op2_type);
13754 TREE_TYPE (node) = error_mark_node;
13755 error_found = 1;
13756 /* Insert a break here if adding thing before the switch's
13757 break for this case */
13758 }
13759 break;
13760
13761 /* 15.22 Conditional-And Operator */
13762 case TRUTH_ANDIF_EXPR:
13763 /* 15.23 Conditional-Or Operator */
13764 case TRUTH_ORIF_EXPR:
13765 /* Operands must be of BOOLEAN type */
13766 if (TREE_CODE (op1_type) != BOOLEAN_TYPE ||
13767 TREE_CODE (op2_type) != BOOLEAN_TYPE)
13768 {
13769 if (TREE_CODE (op1_type) != BOOLEAN_TYPE)
13770 ERROR_CANT_CONVERT_TO_BOOLEAN (wfl_operator, node, op1_type);
13771 if (TREE_CODE (op2_type) != BOOLEAN_TYPE && (op1_type != op2_type))
13772 ERROR_CANT_CONVERT_TO_BOOLEAN (wfl_operator, node, op2_type);
13773 TREE_TYPE (node) = boolean_type_node;
13774 error_found = 1;
13775 break;
13776 }
13777 else if (integer_zerop (op1))
13778 {
13779 return code == TRUTH_ANDIF_EXPR ? op1 : op2;
13780 }
13781 else if (integer_onep (op1))
13782 {
13783 return code == TRUTH_ANDIF_EXPR ? op2 : op1;
13784 }
13785 /* The type of the conditional operators is BOOLEAN */
13786 prom_type = boolean_type_node;
13787 break;
13788
13789 /* 15.19.1 Numerical Comparison Operators <, <=, >, >= */
13790 case LT_EXPR:
13791 case GT_EXPR:
13792 case LE_EXPR:
13793 case GE_EXPR:
13794 /* The type of each of the operands must be a primitive numeric
13795 type */
13796 if (!JNUMERIC_TYPE_P (op1_type) || ! JNUMERIC_TYPE_P (op2_type))
13797 {
13798 if (!JNUMERIC_TYPE_P (op1_type))
13799 ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op1_type);
13800 if (!JNUMERIC_TYPE_P (op2_type) && (op1_type != op2_type))
13801 ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op2_type);
13802 TREE_TYPE (node) = boolean_type_node;
13803 error_found = 1;
13804 break;
13805 }
13806 /* Binary numeric promotion is performed on the operands */
13807 binary_numeric_promotion (op1_type, op2_type, &op1, &op2);
13808 /* The type of the relation expression is always BOOLEAN */
13809 prom_type = boolean_type_node;
13810 break;
13811
13812 /* 15.20 Equality Operator */
13813 case EQ_EXPR:
13814 case NE_EXPR:
13815 /* It's time for us to patch the strings. */
13816 if ((cn = patch_string (op1)))
13817 {
13818 op1 = cn;
13819 op1_type = TREE_TYPE (op1);
13820 }
13821 if ((cn = patch_string (op2)))
13822 {
13823 op2 = cn;
13824 op2_type = TREE_TYPE (op2);
13825 }
13826
13827 /* 15.20.1 Numerical Equality Operators == and != */
13828 /* Binary numeric promotion is performed on the operands */
13829 if (JNUMERIC_TYPE_P (op1_type) && JNUMERIC_TYPE_P (op2_type))
13830 binary_numeric_promotion (op1_type, op2_type, &op1, &op2);
13831
13832 /* 15.20.2 Boolean Equality Operators == and != */
13833 else if (TREE_CODE (op1_type) == BOOLEAN_TYPE &&
13834 TREE_CODE (op2_type) == BOOLEAN_TYPE)
13835 ; /* Nothing to do here */
13836
13837 /* 15.20.3 Reference Equality Operators == and != */
13838 /* Types have to be either references or the null type. If
13839 they're references, it must be possible to convert either
13840 type to the other by casting conversion. */
13841 else if ((op1 == null_pointer_node && op2 == null_pointer_node)
13842 || (op1 == null_pointer_node && JREFERENCE_TYPE_P (op2_type))
13843 || (JREFERENCE_TYPE_P (op1_type) && op2 == null_pointer_node)
13844 || (JREFERENCE_TYPE_P (op1_type) && JREFERENCE_TYPE_P (op2_type)
13845 && (valid_ref_assignconv_cast_p (op1_type, op2_type, 1)
13846 || valid_ref_assignconv_cast_p (op2_type,
13847 op1_type, 1))))
13848 ; /* Nothing to do here */
13849
13850 /* Else we have an error figure what can't be converted into
13851 what and report the error */
13852 else
13853 {
13854 char *t1;
13855 t1 = xstrdup (lang_printable_name (op1_type, 0));
13856 parse_error_context
13857 (wfl_operator,
13858 "Incompatible type for %qs. Can't convert %qs to %qs",
13859 operator_string (node), t1,
13860 lang_printable_name (op2_type, 0));
13861 free (t1);
13862 TREE_TYPE (node) = boolean_type_node;
13863 error_found = 1;
13864 break;
13865 }
13866 prom_type = boolean_type_node;
13867 break;
13868 default:
13869 abort ();
13870 }
13871
13872 if (error_found)
13873 return error_mark_node;
13874
13875 TREE_OPERAND (node, 0) = op1;
13876 TREE_OPERAND (node, 1) = op2;
13877 TREE_TYPE (node) = prom_type;
13878 TREE_SIDE_EFFECTS (node) = TREE_SIDE_EFFECTS (op1) | TREE_SIDE_EFFECTS (op2);
13879
13880 /* fold does not respect side-effect order as required for Java but not C.
13881 * Also, it sometimes create SAVE_EXPRs which are bad when emitting
13882 * bytecode.
13883 */
13884 if (flag_emit_class_files ? (TREE_CONSTANT (op1) && TREE_CONSTANT (op2))
13885 : ! TREE_SIDE_EFFECTS (node))
13886 node = fold (node);
13887 return node;
13888 }
13889
13890 /* Concatenate the STRING_CST CSTE and STRING. When AFTER is a non
13891 zero value, the value of CSTE comes after the valude of STRING */
13892
13893 static tree
13894 do_merge_string_cste (tree cste, const char *string, int string_len, int after)
13895 {
13896 const char *old = TREE_STRING_POINTER (cste);
13897 int old_len = TREE_STRING_LENGTH (cste);
13898 int len = old_len + string_len;
13899 char *new = alloca (len+1);
13900
13901 if (after)
13902 {
13903 memcpy (new, string, string_len);
13904 memcpy (&new [string_len], old, old_len);
13905 }
13906 else
13907 {
13908 memcpy (new, old, old_len);
13909 memcpy (&new [old_len], string, string_len);
13910 }
13911 new [len] = '\0';
13912 return build_string (len, new);
13913 }
13914
13915 /* Tries to merge OP1 (a STRING_CST) and OP2 (if suitable). Return a
13916 new STRING_CST on success, NULL_TREE on failure. */
13917
13918 static tree
13919 merge_string_cste (tree op1, tree op2, int after)
13920 {
13921 /* Handle two string constants right away. */
13922 if (TREE_CODE (op2) == STRING_CST)
13923 return do_merge_string_cste (op1, TREE_STRING_POINTER (op2),
13924 TREE_STRING_LENGTH (op2), after);
13925
13926 /* Reasonable integer constant can be treated right away. */
13927 if (TREE_CODE (op2) == INTEGER_CST && !TREE_CONSTANT_OVERFLOW (op2))
13928 {
13929 static const char *const boolean_true = "true";
13930 static const char *const boolean_false = "false";
13931 static const char *const null_pointer = "null";
13932 char ch[4];
13933 const char *string;
13934
13935 if (op2 == boolean_true_node)
13936 string = boolean_true;
13937 else if (op2 == boolean_false_node)
13938 string = boolean_false;
13939 else if (op2 == null_pointer_node
13940 || (integer_zerop (op2)
13941 && TREE_CODE (TREE_TYPE (op2)) == POINTER_TYPE))
13942 /* FIXME: null is not a compile-time constant, so it is only safe to
13943 merge if the overall expression is non-constant. However, this
13944 code always merges without checking the overall expression. */
13945 string = null_pointer;
13946 else if (TREE_TYPE (op2) == char_type_node)
13947 {
13948 /* Convert the character into UTF-8. */
13949 unsigned int c = (unsigned int) TREE_INT_CST_LOW (op2);
13950 unsigned char *p = (unsigned char *) ch;
13951 if (0x01 <= c && c <= 0x7f)
13952 *p++ = (unsigned char) c;
13953 else if (c < 0x7ff)
13954 {
13955 *p++ = (unsigned char) (c >> 6 | 0xc0);
13956 *p++ = (unsigned char) ((c & 0x3f) | 0x80);
13957 }
13958 else
13959 {
13960 *p++ = (unsigned char) (c >> 12 | 0xe0);
13961 *p++ = (unsigned char) (((c >> 6) & 0x3f) | 0x80);
13962 *p++ = (unsigned char) ((c & 0x3f) | 0x80);
13963 }
13964 *p = '\0';
13965
13966 string = ch;
13967 }
13968 else
13969 string = string_convert_int_cst (op2);
13970
13971 return do_merge_string_cste (op1, string, strlen (string), after);
13972 }
13973 return NULL_TREE;
13974 }
13975
13976 /* Tries to statically concatenate OP1 and OP2 if possible. Either one
13977 has to be a STRING_CST and the other part must be a STRING_CST or a
13978 INTEGRAL constant. Return a new STRING_CST if the operation
13979 succeed, NULL_TREE otherwise.
13980
13981 If the case we want to optimize for space, we might want to return
13982 NULL_TREE for each invocation of this routine. FIXME */
13983
13984 static tree
13985 string_constant_concatenation (tree op1, tree op2)
13986 {
13987 if (TREE_CODE (op1) == STRING_CST || (TREE_CODE (op2) == STRING_CST))
13988 {
13989 tree string, rest;
13990 int invert;
13991
13992 string = (TREE_CODE (op1) == STRING_CST ? op1 : op2);
13993 rest = (string == op1 ? op2 : op1);
13994 invert = (string == op1 ? 0 : 1 );
13995
13996 /* Walk REST, only if it looks reasonable */
13997 if (TREE_CODE (rest) != STRING_CST
13998 && !IS_CRAFTED_STRING_BUFFER_P (rest)
13999 && !JSTRING_TYPE_P (TREE_TYPE (rest))
14000 && TREE_CODE (rest) == EXPR_WITH_FILE_LOCATION)
14001 {
14002 rest = java_complete_tree (rest);
14003 if (rest == error_mark_node)
14004 return error_mark_node;
14005 rest = fold (rest);
14006 }
14007 return merge_string_cste (string, rest, invert);
14008 }
14009 return NULL_TREE;
14010 }
14011
14012 /* Implement the `+' operator. Does static optimization if possible,
14013 otherwise create (if necessary) and append elements to a
14014 StringBuffer. The StringBuffer will be carried around until it is
14015 used for a function call or an assignment. Then toString() will be
14016 called on it to turn it into a String object. */
14017
14018 static tree
14019 build_string_concatenation (tree op1, tree op2)
14020 {
14021 tree result;
14022 int side_effects = TREE_SIDE_EFFECTS (op1) | TREE_SIDE_EFFECTS (op2);
14023
14024 /* Try to do some static optimization */
14025 if ((result = string_constant_concatenation (op1, op2)))
14026 return result;
14027
14028 /* Discard empty strings on either side of the expression */
14029 if (TREE_CODE (op1) == STRING_CST && TREE_STRING_LENGTH (op1) == 0)
14030 {
14031 op1 = op2;
14032 op2 = NULL_TREE;
14033 }
14034 else if (TREE_CODE (op2) == STRING_CST && TREE_STRING_LENGTH (op2) == 0)
14035 op2 = NULL_TREE;
14036
14037 /* If operands are string constant, turn then into object references */
14038 if (TREE_CODE (op1) == STRING_CST)
14039 op1 = patch_string_cst (op1);
14040 if (op2 && TREE_CODE (op2) == STRING_CST)
14041 op2 = patch_string_cst (op2);
14042
14043 /* If either one of the constant is null and the other non null
14044 operand is a String constant, return it. */
14045 if ((TREE_CODE (op1) == STRING_CST) && !op2)
14046 return op1;
14047
14048 /* If OP1 isn't already a StringBuffer, create and
14049 initialize a new one */
14050 if (!IS_CRAFTED_STRING_BUFFER_P (op1))
14051 {
14052 /* Two solutions here:
14053 1) OP1 is a constant string reference, we call new StringBuffer(OP1)
14054 2) OP1 is something else, we call new StringBuffer().append(OP1). */
14055 if (TREE_CONSTANT (op1) && JSTRING_TYPE_P (TREE_TYPE (op1)))
14056 op1 = BUILD_STRING_BUFFER (op1);
14057 else
14058 {
14059 tree aNew = BUILD_STRING_BUFFER (NULL_TREE);
14060 op1 = make_qualified_primary (aNew, BUILD_APPEND (op1), 0);
14061 }
14062 }
14063
14064 if (op2)
14065 {
14066 /* OP1 is no longer the last node holding a crafted StringBuffer */
14067 IS_CRAFTED_STRING_BUFFER_P (op1) = 0;
14068 /* Create a node for `{new...,xxx}.append (op2)' */
14069 op1 = make_qualified_primary (op1, BUILD_APPEND (op2), 0);
14070 }
14071
14072 /* Mark the last node holding a crafted StringBuffer */
14073 IS_CRAFTED_STRING_BUFFER_P (op1) = 1;
14074
14075 TREE_SIDE_EFFECTS (op1) = side_effects;
14076 return op1;
14077 }
14078
14079 /* Patch the string node NODE. NODE can be a STRING_CST of a crafted
14080 StringBuffer. If no string were found to be patched, return
14081 NULL. */
14082
14083 static tree
14084 patch_string (tree node)
14085 {
14086 if (node == error_mark_node)
14087 return error_mark_node;
14088 if (TREE_CODE (node) == STRING_CST)
14089 return patch_string_cst (node);
14090 else if (IS_CRAFTED_STRING_BUFFER_P (node))
14091 {
14092 int saved = ctxp->explicit_constructor_p;
14093 tree invoke = build_method_invocation (wfl_to_string, NULL_TREE);
14094 tree ret;
14095 /* Temporary disable forbid the use of `this'. */
14096 ctxp->explicit_constructor_p = 0;
14097 ret = java_complete_tree (make_qualified_primary (node, invoke, 0));
14098 /* String concatenation arguments must be evaluated in order too. */
14099 ret = force_evaluation_order (ret);
14100 /* Restore it at its previous value */
14101 ctxp->explicit_constructor_p = saved;
14102 return ret;
14103 }
14104 return NULL_TREE;
14105 }
14106
14107 /* Build the internal representation of a string constant. */
14108
14109 static tree
14110 patch_string_cst (tree node)
14111 {
14112 int location;
14113 if (! flag_emit_class_files)
14114 {
14115 node = get_identifier (TREE_STRING_POINTER (node));
14116 location = alloc_name_constant (CONSTANT_String, node);
14117 node = build_ref_from_constant_pool (location);
14118 }
14119 TREE_CONSTANT (node) = 1;
14120 TREE_INVARIANT (node) = 1;
14121
14122 /* ??? Guessing that the class file code can't handle casts. */
14123 if (! flag_emit_class_files)
14124 node = convert (string_ptr_type_node, node);
14125 else
14126 TREE_TYPE (node) = string_ptr_type_node;
14127
14128 return node;
14129 }
14130
14131 /* Build an incomplete unary operator expression. */
14132
14133 static tree
14134 build_unaryop (int op_token, int op_location, tree op1)
14135 {
14136 enum tree_code op;
14137 tree unaryop;
14138 switch (op_token)
14139 {
14140 case PLUS_TK: op = UNARY_PLUS_EXPR; break;
14141 case MINUS_TK: op = NEGATE_EXPR; break;
14142 case NEG_TK: op = TRUTH_NOT_EXPR; break;
14143 case NOT_TK: op = BIT_NOT_EXPR; break;
14144 default: abort ();
14145 }
14146
14147 unaryop = build1 (op, NULL_TREE, op1);
14148 TREE_SIDE_EFFECTS (unaryop) = 1;
14149 /* Store the location of the operator, for better error report. The
14150 string of the operator will be rebuild based on the OP value. */
14151 EXPR_WFL_LINECOL (unaryop) = op_location;
14152 return unaryop;
14153 }
14154
14155 /* Special case for the ++/-- operators, since they require an extra
14156 argument to build, which is set to NULL and patched
14157 later. IS_POST_P is 1 if the operator, 0 otherwise. */
14158
14159 static tree
14160 build_incdec (int op_token, int op_location, tree op1, int is_post_p)
14161 {
14162 static const enum tree_code lookup [2][2] =
14163 {
14164 { PREDECREMENT_EXPR, PREINCREMENT_EXPR, },
14165 { POSTDECREMENT_EXPR, POSTINCREMENT_EXPR, },
14166 };
14167 tree node = build2 (lookup [is_post_p][(op_token - DECR_TK)],
14168 NULL_TREE, op1, NULL_TREE);
14169 TREE_SIDE_EFFECTS (node) = 1;
14170 /* Store the location of the operator, for better error report. The
14171 string of the operator will be rebuild based on the OP value. */
14172 EXPR_WFL_LINECOL (node) = op_location;
14173 return node;
14174 }
14175
14176 /* Build an incomplete cast operator, based on the use of the
14177 CONVERT_EXPR. Note that TREE_TYPE of the constructed node is
14178 set. java_complete_tree is trained to walk a CONVERT_EXPR even
14179 though its type is already set. */
14180
14181 static tree
14182 build_cast (int location, tree type, tree exp)
14183 {
14184 tree node = build1 (CONVERT_EXPR, type, exp);
14185 EXPR_WFL_LINECOL (node) = location;
14186 return node;
14187 }
14188
14189 /* Build an incomplete class reference operator. */
14190 static tree
14191 build_incomplete_class_ref (int location, tree class_name)
14192 {
14193 tree node = build1 (CLASS_LITERAL, NULL_TREE, class_name);
14194 tree class_decl = GET_CPC ();
14195 tree this_class = TREE_TYPE (class_decl);
14196
14197 /* Generate the synthetic static method `class$'. (Previously we
14198 deferred this, causing different method tables to be emitted
14199 for native code and bytecode.) */
14200 if (!TYPE_DOT_CLASS (this_class)
14201 && !JPRIMITIVE_TYPE_P (class_name)
14202 && !(TREE_CODE (class_name) == VOID_TYPE))
14203 {
14204 tree cpc_list = GET_CPC_LIST();
14205 tree cpc = cpc_list;
14206 tree target_class;
14207
14208 /* For inner classes, add a 'class$' method to their outermost
14209 context, creating it if necessary. */
14210
14211 while (GET_NEXT_ENCLOSING_CPC(cpc))
14212 cpc = GET_NEXT_ENCLOSING_CPC(cpc);
14213 class_decl = TREE_VALUE (cpc);
14214
14215 target_class = TREE_TYPE (class_decl);
14216
14217 if (CLASS_INTERFACE (TYPE_NAME (target_class)))
14218 {
14219 /* For interfaces, adding a static 'class$' method directly
14220 is illegal. So create an inner class to contain the new
14221 method. Empirically this matches the behavior of javac. */
14222 tree t, inner;
14223 /* We want the generated inner class inside the outermost class. */
14224 GET_CPC_LIST() = cpc;
14225 t = build_wfl_node (DECL_NAME (TYPE_NAME (object_type_node)));
14226 inner = create_anonymous_class (t);
14227 target_class = TREE_TYPE (inner);
14228 end_class_declaration (1);
14229 GET_CPC_LIST() = cpc_list;
14230 }
14231
14232 if (TYPE_DOT_CLASS (target_class) == NULL_TREE)
14233 build_dot_class_method (target_class);
14234
14235 if (this_class != target_class)
14236 TYPE_DOT_CLASS (this_class) = TYPE_DOT_CLASS (target_class);
14237 }
14238
14239 EXPR_WFL_LINECOL (node) = location;
14240 return node;
14241 }
14242
14243 /* Complete an incomplete class reference operator. */
14244 static tree
14245 patch_incomplete_class_ref (tree node)
14246 {
14247 tree type = TREE_OPERAND (node, 0);
14248 tree ref_type;
14249
14250 if (!(ref_type = resolve_type_during_patch (type)))
14251 return error_mark_node;
14252
14253 /* If we're not emitting class files and we know ref_type is a
14254 compiled class, build a direct reference. */
14255 if ((! flag_emit_class_files && is_compiled_class (ref_type))
14256 || JPRIMITIVE_TYPE_P (ref_type)
14257 || TREE_CODE (ref_type) == VOID_TYPE)
14258 {
14259 tree dot = build_class_ref (ref_type);
14260 /* A class referenced by `foo.class' is initialized. */
14261 if (!flag_emit_class_files)
14262 dot = build_class_init (ref_type, dot);
14263 return java_complete_tree (dot);
14264 }
14265
14266 /* If we're emitting class files and we have to deal with non
14267 primitive types, we invoke the synthetic static method `class$'. */
14268 ref_type = build_dot_class_method_invocation (current_class, ref_type);
14269 return java_complete_tree (ref_type);
14270 }
14271
14272 /* 15.14 Unary operators. We return error_mark_node in case of error,
14273 but preserve the type of NODE if the type is fixed. */
14274
14275 static tree
14276 patch_unaryop (tree node, tree wfl_op)
14277 {
14278 tree op = TREE_OPERAND (node, 0);
14279 tree op_type = TREE_TYPE (op);
14280 tree prom_type = NULL_TREE, value, decl;
14281 int nested_field_flag = 0;
14282 int code = TREE_CODE (node);
14283 int error_found = 0;
14284
14285 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
14286
14287 switch (code)
14288 {
14289 /* 15.13.2 Postfix Increment Operator ++ */
14290 case POSTINCREMENT_EXPR:
14291 /* 15.13.3 Postfix Increment Operator -- */
14292 case POSTDECREMENT_EXPR:
14293 /* 15.14.1 Prefix Increment Operator ++ */
14294 case PREINCREMENT_EXPR:
14295 /* 15.14.2 Prefix Decrement Operator -- */
14296 case PREDECREMENT_EXPR:
14297 op = decl = extract_field_decl (op);
14298 nested_field_flag
14299 = nested_field_expanded_access_p (op, NULL, NULL, NULL);
14300 /* We might be trying to change an outer field accessed using
14301 access method. */
14302 if (nested_field_flag)
14303 {
14304 /* Retrieve the decl of the field we're trying to access. We
14305 do that by first retrieving the function we would call to
14306 access the field. It has been already verified that this
14307 field isn't final */
14308 if (flag_emit_class_files)
14309 decl = TREE_OPERAND (op, 0);
14310 else
14311 decl = TREE_OPERAND (TREE_OPERAND (TREE_OPERAND (op, 0), 0), 0);
14312 decl = DECL_FUNCTION_ACCESS_DECL (decl);
14313 }
14314 /* We really should have a JAVA_ARRAY_EXPR to avoid this */
14315 else if (!JDECL_P (decl)
14316 && TREE_CODE (decl) != COMPONENT_REF
14317 && !(flag_emit_class_files && TREE_CODE (decl) == ARRAY_REF)
14318 && TREE_CODE (decl) != INDIRECT_REF
14319 && !(TREE_CODE (decl) == COMPOUND_EXPR
14320 && TREE_OPERAND (decl, 1)
14321 && (TREE_CODE (TREE_OPERAND (decl, 1)) == INDIRECT_REF)))
14322 {
14323 TREE_TYPE (node) = error_mark_node;
14324 error_found = 1;
14325 }
14326
14327 /* From now on, we know that op if a variable and that it has a
14328 valid wfl. We use wfl_op to locate errors related to the
14329 ++/-- operand. */
14330 if (!JNUMERIC_TYPE_P (op_type))
14331 {
14332 parse_error_context
14333 (wfl_op, "Invalid argument type %qs to %qs",
14334 lang_printable_name (op_type, 0), operator_string (node));
14335 TREE_TYPE (node) = error_mark_node;
14336 error_found = 1;
14337 }
14338 else
14339 {
14340 /* Before the addition, binary numeric promotion is performed on
14341 both operands, if really necessary */
14342 if (JINTEGRAL_TYPE_P (op_type))
14343 {
14344 value = build_int_cst (op_type, 1);
14345 TREE_TYPE (node) = op_type;
14346 }
14347 else
14348 {
14349 value = build_int_cst (NULL_TREE, 1);
14350 TREE_TYPE (node) =
14351 binary_numeric_promotion (op_type,
14352 TREE_TYPE (value), &op, &value);
14353 }
14354
14355 /* We remember we might be accessing an outer field */
14356 if (nested_field_flag)
14357 {
14358 /* We re-generate an access to the field */
14359 value = build2 (PLUS_EXPR, TREE_TYPE (op),
14360 build_nested_field_access (wfl_op, decl), value);
14361
14362 /* And we patch the original access$() into a write
14363 with plus_op as a rhs */
14364 return nested_field_access_fix (node, op, value);
14365 }
14366
14367 /* And write back into the node. */
14368 TREE_OPERAND (node, 0) = op;
14369 TREE_OPERAND (node, 1) = value;
14370 /* Convert the overall back into its original type, if
14371 necessary, and return */
14372 if (JINTEGRAL_TYPE_P (op_type))
14373 return fold (node);
14374 else
14375 return fold (convert (op_type, node));
14376 }
14377 break;
14378
14379 /* 15.14.3 Unary Plus Operator + */
14380 case UNARY_PLUS_EXPR:
14381 /* 15.14.4 Unary Minus Operator - */
14382 case NEGATE_EXPR:
14383 if (!JNUMERIC_TYPE_P (op_type))
14384 {
14385 ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op_type);
14386 TREE_TYPE (node) = error_mark_node;
14387 error_found = 1;
14388 }
14389 /* Unary numeric promotion is performed on operand */
14390 else
14391 {
14392 op = do_unary_numeric_promotion (op);
14393 prom_type = TREE_TYPE (op);
14394 if (code == UNARY_PLUS_EXPR)
14395 return fold (op);
14396 }
14397 break;
14398
14399 /* 15.14.5 Bitwise Complement Operator ~ */
14400 case BIT_NOT_EXPR:
14401 if (!JINTEGRAL_TYPE_P (op_type))
14402 {
14403 ERROR_CAST_NEEDED_TO_INTEGRAL (wfl_operator, node, op_type);
14404 TREE_TYPE (node) = error_mark_node;
14405 error_found = 1;
14406 }
14407 else
14408 {
14409 op = do_unary_numeric_promotion (op);
14410 prom_type = TREE_TYPE (op);
14411 }
14412 break;
14413
14414 /* 15.14.6 Logical Complement Operator ! */
14415 case TRUTH_NOT_EXPR:
14416 if (TREE_CODE (op_type) != BOOLEAN_TYPE)
14417 {
14418 ERROR_CANT_CONVERT_TO_BOOLEAN (wfl_operator, node, op_type);
14419 /* But the type is known. We will report an error if further
14420 attempt of a assignment is made with this rhs */
14421 TREE_TYPE (node) = boolean_type_node;
14422 error_found = 1;
14423 }
14424 else
14425 prom_type = boolean_type_node;
14426 break;
14427
14428 /* 15.15 Cast Expression */
14429 case CONVERT_EXPR:
14430 value = patch_cast (node, wfl_operator);
14431 if (value == error_mark_node)
14432 {
14433 /* If this cast is part of an assignment, we tell the code
14434 that deals with it not to complain about a mismatch,
14435 because things have been cast, anyways */
14436 TREE_TYPE (node) = error_mark_node;
14437 error_found = 1;
14438 }
14439 else
14440 {
14441 value = fold (value);
14442 return value;
14443 }
14444 break;
14445
14446 case NOP_EXPR:
14447 /* This can only happen when the type is already known. */
14448 gcc_assert (TREE_TYPE (node) != NULL_TREE);
14449 prom_type = TREE_TYPE (node);
14450 break;
14451 }
14452
14453 if (error_found)
14454 return error_mark_node;
14455
14456 /* There are cases where node has been replaced by something else
14457 and we don't end up returning here: UNARY_PLUS_EXPR,
14458 CONVERT_EXPR, {POST,PRE}{INCR,DECR}EMENT_EXPR. */
14459 TREE_OPERAND (node, 0) = fold (op);
14460 TREE_TYPE (node) = prom_type;
14461 TREE_SIDE_EFFECTS (node) = TREE_SIDE_EFFECTS (op);
14462 return fold (node);
14463 }
14464
14465 /* Generic type resolution that sometimes takes place during node
14466 patching. Returned the resolved type or generate an error
14467 message. Return the resolved type or NULL_TREE. */
14468
14469 static tree
14470 resolve_type_during_patch (tree type)
14471 {
14472 if (unresolved_type_p (type, NULL))
14473 {
14474 tree type_decl = resolve_and_layout (EXPR_WFL_NODE (type), type);
14475 if (!type_decl)
14476 {
14477 parse_error_context (type,
14478 "Class %qs not found in type declaration",
14479 IDENTIFIER_POINTER (EXPR_WFL_NODE (type)));
14480 return NULL_TREE;
14481 }
14482
14483 check_deprecation (type, type_decl);
14484
14485 return TREE_TYPE (type_decl);
14486 }
14487 return type;
14488 }
14489
14490 /* 5.5 Casting Conversion. error_mark_node is returned if an error is
14491 found. Otherwise NODE or something meant to replace it is returned. */
14492
14493 static tree
14494 patch_cast (tree node, tree wfl_op)
14495 {
14496 tree op = TREE_OPERAND (node, 0);
14497 tree cast_type = TREE_TYPE (node);
14498 tree patched, op_type;
14499 char *t1;
14500
14501 /* Some string patching might be necessary at this stage */
14502 if ((patched = patch_string (op)))
14503 TREE_OPERAND (node, 0) = op = patched;
14504 op_type = TREE_TYPE (op);
14505
14506 /* First resolve OP_TYPE if unresolved */
14507 if (!(cast_type = resolve_type_during_patch (cast_type)))
14508 return error_mark_node;
14509
14510 /* Check on cast that are proven correct at compile time */
14511 if (JNUMERIC_TYPE_P (cast_type) && JNUMERIC_TYPE_P (op_type))
14512 {
14513 /* Same type */
14514 if (cast_type == op_type)
14515 return node;
14516
14517 /* A narrowing conversion from a floating-point number to an
14518 integral type requires special handling (5.1.3). */
14519 if (JFLOAT_TYPE_P (op_type) && JINTEGRAL_TYPE_P (cast_type))
14520 if (cast_type != long_type_node)
14521 op = convert (integer_type_node, op);
14522
14523 /* Try widening/narrowing conversion. Potentially, things need
14524 to be worked out in gcc so we implement the extreme cases
14525 correctly. fold_convert() needs to be fixed. */
14526 return convert (cast_type, op);
14527 }
14528
14529 /* It's also valid to cast a boolean into a boolean */
14530 if (op_type == boolean_type_node && cast_type == boolean_type_node)
14531 return node;
14532
14533 /* null can be casted to references */
14534 if (op == null_pointer_node && JREFERENCE_TYPE_P (cast_type))
14535 return build_null_of_type (cast_type);
14536
14537 /* The remaining legal casts involve conversion between reference
14538 types. Check for their compile time correctness. */
14539 if (JREFERENCE_TYPE_P (op_type) && JREFERENCE_TYPE_P (cast_type)
14540 && valid_ref_assignconv_cast_p (op_type, cast_type, 1))
14541 {
14542 TREE_TYPE (node) = promote_type (cast_type);
14543 /* Now, the case can be determined correct at compile time if
14544 OP_TYPE can be converted into CAST_TYPE by assignment
14545 conversion (5.2) */
14546
14547 if (valid_ref_assignconv_cast_p (op_type, cast_type, 0))
14548 {
14549 TREE_SET_CODE (node, NOP_EXPR);
14550 return node;
14551 }
14552
14553 if (flag_emit_class_files)
14554 {
14555 TREE_SET_CODE (node, CONVERT_EXPR);
14556 return node;
14557 }
14558
14559 /* The cast requires a run-time check */
14560 return build3 (CALL_EXPR, promote_type (cast_type),
14561 build_address_of (soft_checkcast_node),
14562 tree_cons (NULL_TREE, build_class_ref (cast_type),
14563 build_tree_list (NULL_TREE, op)),
14564 NULL_TREE);
14565 }
14566
14567 /* Any other casts are proven incorrect at compile time */
14568 t1 = xstrdup (lang_printable_name (op_type, 0));
14569 parse_error_context (wfl_op, "Invalid cast from %qs to %qs",
14570 t1, lang_printable_name (cast_type, 0));
14571 free (t1);
14572 return error_mark_node;
14573 }
14574
14575 /* Build a null constant and give it the type TYPE. */
14576
14577 static tree
14578 build_null_of_type (tree type)
14579 {
14580 tree node = build_int_cst (promote_type (type), 0);
14581 return node;
14582 }
14583
14584 /* Build an ARRAY_REF incomplete tree node. Note that operand 1 isn't
14585 a list of indices. */
14586 static tree
14587 build_array_ref (int location, tree array, tree index)
14588 {
14589 tree node = build4 (ARRAY_REF, NULL_TREE, array, index,
14590 NULL_TREE, NULL_TREE);
14591 EXPR_WFL_LINECOL (node) = location;
14592 return node;
14593 }
14594
14595 /* 15.12 Array Access Expression */
14596
14597 static tree
14598 patch_array_ref (tree node)
14599 {
14600 tree array = TREE_OPERAND (node, 0);
14601 tree array_type = TREE_TYPE (array);
14602 tree index = TREE_OPERAND (node, 1);
14603 tree index_type = TREE_TYPE (index);
14604 int error_found = 0;
14605
14606 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
14607
14608 if (TREE_CODE (array_type) == POINTER_TYPE)
14609 array_type = TREE_TYPE (array_type);
14610
14611 /* The array reference must be an array */
14612 if (!TYPE_ARRAY_P (array_type))
14613 {
14614 parse_error_context
14615 (wfl_operator,
14616 "%<[]%> can only be applied to arrays. It can't be applied to %qs",
14617 lang_printable_name (array_type, 0));
14618 TREE_TYPE (node) = error_mark_node;
14619 error_found = 1;
14620 }
14621
14622 /* The array index undergoes unary numeric promotion. The promoted
14623 type must be int */
14624 index = do_unary_numeric_promotion (index);
14625 if (TREE_TYPE (index) != int_type_node)
14626 {
14627 if (valid_cast_to_p (index_type, int_type_node))
14628 parse_error_context (wfl_operator,
14629 "Incompatible type for %<[]%>. Explicit cast needed to convert %qs to %<int%>",
14630 lang_printable_name (index_type, 0));
14631 else
14632 parse_error_context (wfl_operator,
14633 "Incompatible type for %<[]%>. Can't convert %qs to %<int%>",
14634 lang_printable_name (index_type, 0));
14635 TREE_TYPE (node) = error_mark_node;
14636 error_found = 1;
14637 }
14638
14639 if (error_found)
14640 return error_mark_node;
14641
14642 array_type = TYPE_ARRAY_ELEMENT (array_type);
14643
14644 if (flag_emit_class_files)
14645 {
14646 TREE_OPERAND (node, 0) = array;
14647 TREE_OPERAND (node, 1) = index;
14648 }
14649 else
14650 node = build_java_arrayaccess (array, array_type, index);
14651 TREE_TYPE (node) = array_type;
14652 return node;
14653 }
14654
14655 /* 15.9 Array Creation Expressions */
14656
14657 static tree
14658 build_newarray_node (tree type, tree dims, int extra_dims)
14659 {
14660 tree node = build3 (NEW_ARRAY_EXPR, NULL_TREE, type,
14661 nreverse (dims),
14662 build_int_cst (NULL_TREE, extra_dims));
14663 return node;
14664 }
14665
14666 static tree
14667 patch_newarray (tree node)
14668 {
14669 tree type = TREE_OPERAND (node, 0);
14670 tree dims = TREE_OPERAND (node, 1);
14671 tree cdim, array_type;
14672 int error_found = 0;
14673 int ndims = 0;
14674 int xdims = TREE_INT_CST_LOW (TREE_OPERAND (node, 2));
14675
14676 /* Dimension types are verified. It's better for the types to be
14677 verified in order. */
14678 for (cdim = dims, ndims = 0; cdim; cdim = TREE_CHAIN (cdim), ndims++ )
14679 {
14680 int dim_error = 0;
14681 tree dim = TREE_VALUE (cdim);
14682
14683 /* Dim might have been saved during its evaluation */
14684 dim = (TREE_CODE (dim) == SAVE_EXPR ? TREE_OPERAND (dim, 0) : dim);
14685
14686 /* The type of each specified dimension must be an integral type. */
14687 if (!JINTEGRAL_TYPE_P (TREE_TYPE (dim)))
14688 dim_error = 1;
14689
14690 /* Each expression undergoes an unary numeric promotion (5.6.1) and the
14691 promoted type must be int. */
14692 else
14693 {
14694 dim = do_unary_numeric_promotion (dim);
14695 if (TREE_TYPE (dim) != int_type_node)
14696 dim_error = 1;
14697 }
14698
14699 /* Report errors on types here */
14700 if (dim_error)
14701 {
14702 parse_error_context
14703 (TREE_PURPOSE (cdim),
14704 "Incompatible type for dimension in array creation expression. %s convert %qs to %<int%>",
14705 (valid_cast_to_p (TREE_TYPE (dim), int_type_node) ?
14706 "Explicit cast needed to" : "Can't"),
14707 lang_printable_name (TREE_TYPE (dim), 0));
14708 error_found = 1;
14709 }
14710
14711 TREE_PURPOSE (cdim) = NULL_TREE;
14712 }
14713
14714 /* Resolve array base type if unresolved */
14715 if (!(type = resolve_type_during_patch (type)))
14716 error_found = 1;
14717
14718 if (error_found)
14719 {
14720 /* We don't want further evaluation of this bogus array creation
14721 operation */
14722 TREE_TYPE (node) = error_mark_node;
14723 return error_mark_node;
14724 }
14725
14726 /* Set array_type to the actual (promoted) array type of the result. */
14727 if (TREE_CODE (type) == RECORD_TYPE)
14728 type = build_pointer_type (type);
14729 while (--xdims >= 0)
14730 {
14731 type = promote_type (build_java_array_type (type, -1));
14732 }
14733 dims = nreverse (dims);
14734 array_type = type;
14735 for (cdim = dims; cdim; cdim = TREE_CHAIN (cdim))
14736 {
14737 type = array_type;
14738 array_type
14739 = build_java_array_type (type,
14740 TREE_CODE (cdim) == INTEGER_CST
14741 ? (HOST_WIDE_INT) TREE_INT_CST_LOW (cdim)
14742 : -1);
14743 array_type = promote_type (array_type);
14744 }
14745 dims = nreverse (dims);
14746
14747 /* The node is transformed into a function call. Things are done
14748 differently according to the number of dimensions. If the number
14749 of dimension is equal to 1, then the nature of the base type
14750 (primitive or not) matters. */
14751 if (ndims == 1)
14752 return build_new_array (type, TREE_VALUE (dims));
14753
14754 /* Can't reuse what's already written in expr.c because it uses the
14755 JVM stack representation. Provide a build_multianewarray. FIXME */
14756 return build3 (CALL_EXPR, array_type,
14757 build_address_of (soft_multianewarray_node),
14758 tree_cons (NULL_TREE,
14759 build_class_ref (TREE_TYPE (array_type)),
14760 tree_cons (NULL_TREE,
14761 build_int_cst (NULL_TREE, ndims),
14762 dims)),
14763 NULL_TREE);
14764 }
14765
14766 /* 10.6 Array initializer. */
14767
14768 /* Build a wfl for array element that don't have one, so we can
14769 pin-point errors. */
14770
14771 static tree
14772 maybe_build_array_element_wfl (tree node)
14773 {
14774 if (TREE_CODE (node) != EXPR_WITH_FILE_LOCATION)
14775 {
14776 /* FIXME - old code used "prev_lc.line" and "elc.prev_col */
14777 return build_expr_wfl (NULL_TREE,
14778 #ifdef USE_MAPPED_LOCATION
14779 input_location
14780 #else
14781 ctxp->filename,
14782 ctxp->lexer->token_start.line,
14783 ctxp->lexer->token_start.col
14784 #endif
14785 );
14786 }
14787 else
14788 return NULL_TREE;
14789 }
14790
14791 /* Build a NEW_ARRAY_INIT that features a CONSTRUCTOR node. This makes
14792 identification of initialized arrays easier to detect during walk
14793 and expansion. */
14794
14795 static tree
14796 build_new_array_init (int location, tree values)
14797 {
14798 tree constructor = build_constructor_from_list (NULL_TREE,
14799 nreverse (values));
14800 tree to_return = build1 (NEW_ARRAY_INIT, NULL_TREE, constructor);
14801 EXPR_WFL_LINECOL (to_return) = location;
14802 return to_return;
14803 }
14804
14805 /* Expand a NEW_ARRAY_INIT node. Return error_mark_node if an error
14806 occurred. Otherwise return NODE after having set its type
14807 appropriately. */
14808
14809 static tree
14810 patch_new_array_init (tree type, tree node)
14811 {
14812 int error_seen = 0;
14813 tree element_type;
14814 unsigned HOST_WIDE_INT length;
14815 constructor_elt *current;
14816 int all_constant = 1;
14817 tree init = TREE_OPERAND (node, 0);
14818
14819 if (TREE_CODE (type) != POINTER_TYPE || ! TYPE_ARRAY_P (TREE_TYPE (type)))
14820 {
14821 parse_error_context (node,
14822 "Invalid array initializer for non-array type %qs",
14823 lang_printable_name (type, 1));
14824 return error_mark_node;
14825 }
14826 type = TREE_TYPE (type);
14827 element_type = TYPE_ARRAY_ELEMENT (type);
14828
14829 for (length = 0;
14830 VEC_iterate (constructor_elt, CONSTRUCTOR_ELTS (init),
14831 length, current);
14832 length++)
14833 {
14834 tree elt = current->value;
14835 if (elt == NULL_TREE || TREE_CODE (elt) != NEW_ARRAY_INIT)
14836 {
14837 error_seen |= array_constructor_check_entry (element_type, current);
14838 elt = current->value;
14839 /* When compiling to native code, STRING_CST is converted to
14840 INDIRECT_REF, but still with a TREE_CONSTANT flag. */
14841 if (! TREE_CONSTANT (elt) || TREE_CODE (elt) == INDIRECT_REF)
14842 all_constant = 0;
14843 }
14844 else
14845 {
14846 current->value = patch_new_array_init (element_type, elt);
14847 current->index = NULL_TREE;
14848 all_constant = 0;
14849 }
14850 if (elt && TREE_CODE (elt) == TREE_LIST
14851 && TREE_VALUE (elt) == error_mark_node)
14852 error_seen = 1;
14853 }
14854
14855 if (error_seen)
14856 return error_mark_node;
14857
14858 /* Create a new type. We can't reuse the one we have here by
14859 patching its dimension because it originally is of dimension -1
14860 hence reused by gcc. This would prevent triangular arrays. */
14861 type = build_java_array_type (element_type, length);
14862 TREE_TYPE (init) = TREE_TYPE (TREE_CHAIN (TREE_CHAIN (TYPE_FIELDS (type))));
14863 TREE_TYPE (node) = promote_type (type);
14864 TREE_CONSTANT (init) = all_constant;
14865 TREE_INVARIANT (init) = all_constant;
14866 TREE_CONSTANT (node) = all_constant;
14867 TREE_INVARIANT (node) = all_constant;
14868 return node;
14869 }
14870
14871 /* Verify that one entry of the initializer element list can be
14872 assigned to the array base type. Report 1 if an error occurred, 0
14873 otherwise. */
14874
14875 static int
14876 array_constructor_check_entry (tree type, constructor_elt *entry)
14877 {
14878 char *array_type_string = NULL; /* For error reports */
14879 tree value, type_value, new_value, wfl_value, patched;
14880 int error_seen = 0;
14881
14882 new_value = NULL_TREE;
14883 wfl_value = entry->value;
14884
14885 value = java_complete_tree (entry->value);
14886 /* patch_string return error_mark_node if arg is error_mark_node */
14887 if ((patched = patch_string (value)))
14888 value = patched;
14889 if (value == error_mark_node)
14890 return 1;
14891
14892 type_value = TREE_TYPE (value);
14893
14894 /* At anytime, try_builtin_assignconv can report a warning on
14895 constant overflow during narrowing. */
14896 SET_WFL_OPERATOR (wfl_operator, entry->index, wfl_value);
14897 new_value = try_builtin_assignconv (wfl_operator, type, value);
14898 if (!new_value && (new_value = try_reference_assignconv (type, value)))
14899 type_value = promote_type (type);
14900
14901 /* Check and report errors */
14902 if (!new_value)
14903 {
14904 const char *const msg = (!valid_cast_to_p (type_value, type) ?
14905 "Can't" : "Explicit cast needed to");
14906 if (!array_type_string)
14907 array_type_string = xstrdup (lang_printable_name (type, 1));
14908 parse_error_context
14909 (wfl_operator, "Incompatible type for array. %s convert %qs to %qs",
14910 msg, lang_printable_name (type_value, 1), array_type_string);
14911 error_seen = 1;
14912 }
14913
14914 if (new_value)
14915 entry->value = new_value;
14916
14917 if (array_type_string)
14918 free (array_type_string);
14919
14920 entry->index = NULL_TREE;
14921 return error_seen;
14922 }
14923
14924 static tree
14925 build_this (int location)
14926 {
14927 tree node = build_wfl_node (this_identifier_node);
14928 TREE_SET_CODE (node, THIS_EXPR);
14929 EXPR_WFL_LINECOL (node) = location;
14930 return node;
14931 }
14932
14933 /* 14.15 The return statement. It builds a modify expression that
14934 assigns the returned value to the RESULT_DECL that hold the value
14935 to be returned. */
14936
14937 static tree
14938 build_return (int location, tree op)
14939 {
14940 tree node = build1 (RETURN_EXPR, NULL_TREE, op);
14941 EXPR_WFL_LINECOL (node) = location;
14942 node = build_debugable_stmt (location, node);
14943 return node;
14944 }
14945
14946 static tree
14947 patch_return (tree node)
14948 {
14949 tree return_exp = TREE_OPERAND (node, 0);
14950 tree meth = current_function_decl;
14951 tree mtype = TREE_TYPE (TREE_TYPE (current_function_decl));
14952 int error_found = 0;
14953
14954 TREE_TYPE (node) = error_mark_node;
14955 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
14956
14957 /* It's invalid to have a return value within a function that is
14958 declared with the keyword void or that is a constructor */
14959 if (return_exp && (mtype == void_type_node || DECL_CONSTRUCTOR_P (meth)))
14960 error_found = 1;
14961
14962 /* It's invalid to use a return statement in a static block */
14963 if (DECL_CLINIT_P (current_function_decl))
14964 error_found = 1;
14965
14966 /* It's invalid to have a no return value within a function that
14967 isn't declared with the keyword `void' */
14968 if (!return_exp && (mtype != void_type_node && !DECL_CONSTRUCTOR_P (meth)))
14969 error_found = 2;
14970
14971 if (DECL_INSTINIT_P (current_function_decl))
14972 error_found = 1;
14973
14974 if (error_found)
14975 {
14976 if (DECL_INSTINIT_P (current_function_decl))
14977 parse_error_context (wfl_operator,
14978 "%<return%> inside instance initializer");
14979
14980 else if (DECL_CLINIT_P (current_function_decl))
14981 parse_error_context (wfl_operator,
14982 "%<return%> inside static initializer");
14983
14984 else if (!DECL_CONSTRUCTOR_P (meth))
14985 {
14986 char *t = xstrdup (lang_printable_name (mtype, 0));
14987 parse_error_context (wfl_operator,
14988 "%<return%> with%s value from %<%s %s%>",
14989 (error_found == 1 ? "" : "out"),
14990 t, lang_printable_name (meth, 2));
14991 free (t);
14992 }
14993 else
14994 parse_error_context (wfl_operator,
14995 "%<return%> with value from constructor %qs",
14996 lang_printable_name (meth, 2));
14997 return error_mark_node;
14998 }
14999
15000 /* If we have a return_exp, build a modify expression and expand
15001 it. Note: at that point, the assignment is declared valid, but we
15002 may want to carry some more hacks */
15003 if (return_exp)
15004 {
15005 tree exp = java_complete_tree (return_exp);
15006 tree modify, patched;
15007
15008 if ((patched = patch_string (exp)))
15009 exp = patched;
15010
15011 modify = build2 (MODIFY_EXPR, NULL_TREE, DECL_RESULT (meth), exp);
15012 EXPR_WFL_LINECOL (modify) = EXPR_WFL_LINECOL (node);
15013 modify = java_complete_tree (modify);
15014
15015 if (modify != error_mark_node)
15016 {
15017 TREE_SIDE_EFFECTS (modify) = 1;
15018 TREE_OPERAND (node, 0) = modify;
15019 }
15020 else
15021 return error_mark_node;
15022 }
15023 TREE_TYPE (node) = void_type_node;
15024 TREE_SIDE_EFFECTS (node) = 1;
15025 return node;
15026 }
15027
15028 /* 14.8 The if Statement */
15029
15030 static tree
15031 build_if_else_statement (int location, tree expression, tree if_body,
15032 tree else_body)
15033 {
15034 tree node;
15035 if (!else_body)
15036 else_body = build_java_empty_stmt ();
15037 node = build3 (COND_EXPR, NULL_TREE, expression, if_body, else_body);
15038 EXPR_WFL_LINECOL (node) = location;
15039 node = build_debugable_stmt (location, node);
15040 return node;
15041 }
15042
15043 static tree
15044 patch_if_else_statement (tree node)
15045 {
15046 tree expression = TREE_OPERAND (node, 0);
15047 int can_complete_normally
15048 = (CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 1))
15049 | CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 2)));
15050
15051 TREE_TYPE (node) = error_mark_node;
15052 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
15053
15054 /* The type of expression must be boolean */
15055 if (TREE_TYPE (expression) != boolean_type_node
15056 && TREE_TYPE (expression) != promoted_boolean_type_node)
15057 {
15058 parse_error_context
15059 (wfl_operator,
15060 "Incompatible type for %<if%>. Can't convert %qs to %<boolean%>",
15061 lang_printable_name (TREE_TYPE (expression), 0));
15062 return error_mark_node;
15063 }
15064
15065 TREE_TYPE (node) = void_type_node;
15066 TREE_SIDE_EFFECTS (node) = 1;
15067 CAN_COMPLETE_NORMALLY (node) = can_complete_normally;
15068 return node;
15069 }
15070
15071 /* 14.6 Labeled Statements */
15072
15073 /* Action taken when a labeled statement is parsed. a new
15074 LABELED_BLOCK_EXPR is created. No statement is attached to the
15075 label, yet. LABEL can be NULL_TREE for artificially-generated blocks. */
15076
15077 static tree
15078 build_labeled_block (int location, tree label)
15079 {
15080 tree label_name ;
15081 tree label_decl, node;
15082 if (label == NULL_TREE || label == continue_identifier_node)
15083 label_name = label;
15084 else
15085 {
15086 label_name = merge_qualified_name (label_id, label);
15087 /* Issue an error if we try to reuse a label that was previously
15088 declared */
15089 if (IDENTIFIER_LOCAL_VALUE (label_name))
15090 {
15091 EXPR_WFL_LINECOL (wfl_operator) = location;
15092 parse_error_context (wfl_operator,
15093 "Declaration of %qs shadows a previous label declaration",
15094 IDENTIFIER_POINTER (label));
15095 EXPR_WFL_LINECOL (wfl_operator) =
15096 EXPR_WFL_LINECOL (IDENTIFIER_LOCAL_VALUE (label_name));
15097 parse_error_context (wfl_operator,
15098 "This is the location of the previous declaration of label %qs",
15099 IDENTIFIER_POINTER (label));
15100 java_error_count--;
15101 }
15102 }
15103
15104 label_decl = create_label_decl (label_name);
15105 node = build2 (LABELED_BLOCK_EXPR, NULL_TREE, label_decl, NULL_TREE);
15106 EXPR_WFL_LINECOL (node) = location;
15107 TREE_SIDE_EFFECTS (node) = 1;
15108 return node;
15109 }
15110
15111 /* A labeled statement LBE is attached a statement. */
15112
15113 static tree
15114 finish_labeled_statement (tree lbe, /* Labeled block expr */
15115 tree statement)
15116 {
15117 /* In anyways, tie the loop to its statement */
15118 LABELED_BLOCK_BODY (lbe) = statement;
15119 pop_labeled_block ();
15120 POP_LABELED_BLOCK ();
15121 return lbe;
15122 }
15123
15124 /* 14.10, 14.11, 14.12 Loop Statements */
15125
15126 /* Create an empty LOOP_EXPR and make it the last in the nested loop
15127 list. */
15128
15129 static tree
15130 build_new_loop (tree loop_body)
15131 {
15132 tree loop = build1 (LOOP_EXPR, NULL_TREE, loop_body);
15133 TREE_SIDE_EFFECTS (loop) = 1;
15134 PUSH_LOOP (loop);
15135 return loop;
15136 }
15137
15138 /* Create a loop body according to the following structure:
15139 COMPOUND_EXPR
15140 COMPOUND_EXPR (loop main body)
15141 EXIT_EXPR (this order is for while/for loops.
15142 LABELED_BLOCK_EXPR the order is reversed for do loops)
15143 LABEL_DECL (a continue occurring here branches at the
15144 BODY end of this labeled block)
15145 INCREMENT (if any)
15146
15147 REVERSED, if nonzero, tells that the loop condition expr comes
15148 after the body, like in the do-while loop.
15149
15150 To obtain a loop, the loop body structure described above is
15151 encapsulated within a LOOP_EXPR surrounded by a LABELED_BLOCK_EXPR:
15152
15153 LABELED_BLOCK_EXPR
15154 LABEL_DECL (use this label to exit the loop)
15155 LOOP_EXPR
15156 <structure described above> */
15157
15158 static tree
15159 build_loop_body (int location, tree condition, int reversed)
15160 {
15161 tree first, second, body;
15162
15163 condition = build1 (EXIT_EXPR, NULL_TREE, condition); /* Force walk */
15164 EXPR_WFL_LINECOL (condition) = location; /* For accurate error report */
15165 condition = build_debugable_stmt (location, condition);
15166 TREE_SIDE_EFFECTS (condition) = 1;
15167
15168 body = build_labeled_block (0, continue_identifier_node);
15169 first = (reversed ? body : condition);
15170 second = (reversed ? condition : body);
15171 return build2 (COMPOUND_EXPR, NULL_TREE,
15172 build2 (COMPOUND_EXPR, NULL_TREE, first, second),
15173 build_java_empty_stmt ());
15174 }
15175
15176 /* Install CONDITION (if any) and loop BODY (using REVERSED to tell
15177 their order) on the current loop. Unlink the current loop from the
15178 loop list. */
15179
15180 static tree
15181 finish_loop_body (int location, tree condition, tree body, int reversed)
15182 {
15183 tree to_return = ctxp->current_loop;
15184 tree loop_body = LOOP_EXPR_BODY (to_return);
15185 if (condition)
15186 {
15187 tree cnode = LOOP_EXPR_BODY_CONDITION_EXPR (loop_body, reversed);
15188 /* We wrapped the EXIT_EXPR around a WFL so we can debug it.
15189 The real EXIT_EXPR is one operand further. */
15190 EXPR_WFL_LINECOL (cnode) = location;
15191 if (TREE_CODE (cnode) == EXPR_WITH_FILE_LOCATION)
15192 {
15193 cnode = EXPR_WFL_NODE (cnode);
15194 /* This one is for accurate error reports */
15195 EXPR_WFL_LINECOL (cnode) = location;
15196 }
15197 TREE_OPERAND (cnode, 0) = condition;
15198 }
15199 LOOP_EXPR_BODY_BODY_EXPR (loop_body, reversed) = body;
15200 POP_LOOP ();
15201 return to_return;
15202 }
15203
15204 /* Tailored version of finish_loop_body for FOR loops, when FOR
15205 loops feature the condition part */
15206
15207 static tree
15208 finish_for_loop (int location, tree condition, tree update, tree body)
15209 {
15210 /* Put the condition and the loop body in place */
15211 tree loop = finish_loop_body (location, condition, body, 0);
15212 /* LOOP is the current loop which has been now popped of the loop
15213 stack. Mark the update block as reachable and install it. We do
15214 this because the (current interpretation of the) JLS requires
15215 that the update expression be considered reachable even if the
15216 for loop's body doesn't complete normally. */
15217 if (update != NULL_TREE && !IS_EMPTY_STMT (update))
15218 {
15219 tree up2 = update;
15220 if (TREE_CODE (up2) == EXPR_WITH_FILE_LOCATION)
15221 up2 = EXPR_WFL_NODE (up2);
15222 /* It is possible for the update expression to be an
15223 EXPR_WFL_NODE wrapping nothing. */
15224 if (up2 != NULL_TREE && !IS_EMPTY_STMT (up2))
15225 {
15226 /* Try to detect constraint violations. These would be
15227 programming errors somewhere. */
15228 if (! EXPR_P (up2) || TREE_CODE (up2) == LOOP_EXPR)
15229 abort ();
15230 SUPPRESS_UNREACHABLE_ERROR (up2) = 1;
15231 }
15232 }
15233 LOOP_EXPR_BODY_UPDATE_BLOCK (LOOP_EXPR_BODY (loop)) = update;
15234 return loop;
15235 }
15236
15237 /* Try to find the loop a block might be related to. This comprises
15238 the case where the LOOP_EXPR is found as the second operand of a
15239 COMPOUND_EXPR, because the loop happens to have an initialization
15240 part, then expressed as the first operand of the COMPOUND_EXPR. If
15241 the search finds something, 1 is returned. Otherwise, 0 is
15242 returned. The search is assumed to start from a
15243 LABELED_BLOCK_EXPR's block. */
15244
15245 static tree
15246 search_loop (tree statement)
15247 {
15248 if (TREE_CODE (statement) == LOOP_EXPR)
15249 return statement;
15250
15251 if (TREE_CODE (statement) == BLOCK)
15252 statement = BLOCK_SUBBLOCKS (statement);
15253 else
15254 return NULL_TREE;
15255
15256 if (statement && TREE_CODE (statement) == COMPOUND_EXPR)
15257 while (statement && TREE_CODE (statement) == COMPOUND_EXPR)
15258 statement = TREE_OPERAND (statement, 1);
15259
15260 return (TREE_CODE (statement) == LOOP_EXPR
15261 && FOR_LOOP_P (statement) ? statement : NULL_TREE);
15262 }
15263
15264 /* Return 1 if LOOP can be found in the labeled block BLOCK. 0 is
15265 returned otherwise. */
15266
15267 static int
15268 labeled_block_contains_loop_p (tree block, tree loop)
15269 {
15270 if (!block)
15271 return 0;
15272
15273 if (LABELED_BLOCK_BODY (block) == loop)
15274 return 1;
15275
15276 if (FOR_LOOP_P (loop) && search_loop (LABELED_BLOCK_BODY (block)) == loop)
15277 return 1;
15278
15279 return 0;
15280 }
15281
15282 /* If the loop isn't surrounded by a labeled statement, create one and
15283 insert LOOP as its body. */
15284
15285 static tree
15286 patch_loop_statement (tree loop)
15287 {
15288 tree loop_label;
15289
15290 TREE_TYPE (loop) = void_type_node;
15291 if (labeled_block_contains_loop_p (ctxp->current_labeled_block, loop))
15292 return loop;
15293
15294 loop_label = build_labeled_block (0, NULL_TREE);
15295 /* LOOP is an EXPR node, so it should have a valid EXPR_WFL_LINECOL
15296 that LOOP_LABEL could enquire about, for a better accuracy. FIXME */
15297 LABELED_BLOCK_BODY (loop_label) = loop;
15298 PUSH_LABELED_BLOCK (loop_label);
15299 return loop_label;
15300 }
15301
15302 /* 14.13, 14.14: break and continue Statements */
15303
15304 /* Build a break or a continue statement. a null NAME indicates an
15305 unlabeled break/continue statement. */
15306
15307 static tree
15308 build_bc_statement (int location, int is_break, tree name)
15309 {
15310 tree break_continue, label_block_expr = NULL_TREE;
15311
15312 if (name)
15313 {
15314 if (!(label_block_expr = IDENTIFIER_LOCAL_VALUE
15315 (merge_qualified_name (label_id, EXPR_WFL_NODE (name)))))
15316 /* Null means that we don't have a target for this named
15317 break/continue. In this case, we make the target to be the
15318 label name, so that the error can be reported accurately in
15319 patch_bc_statement. */
15320 label_block_expr = EXPR_WFL_NODE (name);
15321 }
15322 /* Unlabeled break/continue will be handled during the
15323 break/continue patch operation */
15324 break_continue = build1 (EXIT_BLOCK_EXPR, NULL_TREE, label_block_expr);
15325
15326 IS_BREAK_STMT_P (break_continue) = is_break;
15327 TREE_SIDE_EFFECTS (break_continue) = 1;
15328 EXPR_WFL_LINECOL (break_continue) = location;
15329 break_continue = build_debugable_stmt (location, break_continue);
15330 return break_continue;
15331 }
15332
15333 /* Verification of a break/continue statement. */
15334
15335 static tree
15336 patch_bc_statement (tree node)
15337 {
15338 tree bc_label = EXIT_BLOCK_LABELED_BLOCK (node), target_stmt;
15339 tree labeled_block = ctxp->current_labeled_block;
15340 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
15341
15342 /* Having an identifier here means that the target is unknown. */
15343 if (bc_label != NULL_TREE && TREE_CODE (bc_label) == IDENTIFIER_NODE)
15344 {
15345 parse_error_context (wfl_operator, "No label definition found for %qs",
15346 IDENTIFIER_POINTER (bc_label));
15347 return error_mark_node;
15348 }
15349 if (! IS_BREAK_STMT_P (node))
15350 {
15351 /* It's a continue statement. */
15352 for (;; labeled_block = TREE_CHAIN (labeled_block))
15353 {
15354 if (labeled_block == NULL_TREE)
15355 {
15356 if (bc_label == NULL_TREE)
15357 parse_error_context (wfl_operator,
15358 "%<continue%> must be in loop");
15359 else
15360 parse_error_context
15361 (wfl_operator, "continue label %qs does not name a loop",
15362 IDENTIFIER_POINTER (bc_label));
15363 return error_mark_node;
15364 }
15365 if ((DECL_NAME (LABELED_BLOCK_LABEL (labeled_block))
15366 == continue_identifier_node)
15367 && (bc_label == NULL_TREE
15368 || TREE_CHAIN (labeled_block) == bc_label))
15369 {
15370 bc_label = labeled_block;
15371 break;
15372 }
15373 }
15374 }
15375 else if (!bc_label)
15376 {
15377 for (;; labeled_block = TREE_CHAIN (labeled_block))
15378 {
15379 if (labeled_block == NULL_TREE)
15380 {
15381 parse_error_context (wfl_operator,
15382 "%<break%> must be in loop or switch");
15383 return error_mark_node;
15384 }
15385 target_stmt = LABELED_BLOCK_BODY (labeled_block);
15386 if (TREE_CODE (target_stmt) == SWITCH_EXPR
15387 || search_loop (target_stmt))
15388 {
15389 bc_label = labeled_block;
15390 break;
15391 }
15392 }
15393 }
15394
15395 EXIT_BLOCK_LABELED_BLOCK (node) = bc_label;
15396 CAN_COMPLETE_NORMALLY (bc_label) = 1;
15397
15398 /* Our break/continue don't return values. */
15399 TREE_TYPE (node) = void_type_node;
15400 /* Encapsulate the break within a compound statement so that it's
15401 expanded all the times by expand_expr (and not clobbered
15402 sometimes, like after a if statement) */
15403 node = add_stmt_to_compound (NULL_TREE, void_type_node, node);
15404 TREE_SIDE_EFFECTS (node) = 1;
15405 return node;
15406 }
15407
15408 /* Process the exit expression belonging to a loop. Its type must be
15409 boolean. */
15410
15411 static tree
15412 patch_exit_expr (tree node)
15413 {
15414 tree expression = TREE_OPERAND (node, 0);
15415 TREE_TYPE (node) = error_mark_node;
15416 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
15417
15418 /* The type of expression must be boolean */
15419 if (TREE_TYPE (expression) != boolean_type_node)
15420 {
15421 parse_error_context
15422 (wfl_operator,
15423 "Incompatible type for loop conditional. Can't convert %qs to %<boolean%>",
15424 lang_printable_name (TREE_TYPE (expression), 0));
15425 return error_mark_node;
15426 }
15427 /* Now we know things are allright, invert the condition, fold and
15428 return */
15429 TREE_OPERAND (node, 0) =
15430 fold_build1 (TRUTH_NOT_EXPR, boolean_type_node, expression);
15431
15432 if (! integer_zerop (TREE_OPERAND (node, 0))
15433 && ctxp->current_loop != NULL_TREE
15434 && TREE_CODE (ctxp->current_loop) == LOOP_EXPR)
15435 CAN_COMPLETE_NORMALLY (ctxp->current_loop) = 1;
15436 if (! integer_onep (TREE_OPERAND (node, 0)))
15437 CAN_COMPLETE_NORMALLY (node) = 1;
15438
15439
15440 TREE_TYPE (node) = void_type_node;
15441 return node;
15442 }
15443
15444 /* 14.9 Switch statement */
15445
15446 static tree
15447 patch_switch_statement (tree node)
15448 {
15449 tree se = TREE_OPERAND (node, 0), se_type;
15450 tree save, iter;
15451
15452 /* Complete the switch expression */
15453 se = TREE_OPERAND (node, 0) = java_complete_tree (se);
15454 se_type = TREE_TYPE (se);
15455 /* The type of the switch expression must be char, byte, short or
15456 int */
15457 if (! JINTEGRAL_TYPE_P (se_type) || se_type == long_type_node)
15458 {
15459 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
15460 parse_error_context (wfl_operator,
15461 "Incompatible type for %<switch%>. Can't convert %qs to %<int%>",
15462 lang_printable_name (se_type, 0));
15463 /* This is what java_complete_tree will check */
15464 TREE_OPERAND (node, 0) = error_mark_node;
15465 return error_mark_node;
15466 }
15467
15468 /* Save and restore the outer case label list. */
15469 save = case_label_list;
15470 case_label_list = NULL_TREE;
15471
15472 TREE_OPERAND (node, 1) = java_complete_tree (TREE_OPERAND (node, 1));
15473
15474 /* See if we've found a duplicate label. We can't leave this until
15475 code generation, because in `--syntax-only' and `-C' modes we
15476 don't do ordinary code generation. */
15477 for (iter = case_label_list; iter != NULL_TREE; iter = TREE_CHAIN (iter))
15478 {
15479 HOST_WIDE_INT val = TREE_INT_CST_LOW (TREE_VALUE (iter));
15480 tree subiter;
15481 for (subiter = TREE_CHAIN (iter);
15482 subiter != NULL_TREE;
15483 subiter = TREE_CHAIN (subiter))
15484 {
15485 HOST_WIDE_INT subval = TREE_INT_CST_LOW (TREE_VALUE (subiter));
15486 if (val == subval)
15487 {
15488 EXPR_WFL_LINECOL (wfl_operator)
15489 = EXPR_WFL_LINECOL (TREE_PURPOSE (iter));
15490 /* The case_label_list is in reverse order, so print the
15491 outer label first. */
15492 parse_error_context (wfl_operator, "duplicate case label: %<"
15493 HOST_WIDE_INT_PRINT_DEC "%>", subval);
15494 EXPR_WFL_LINECOL (wfl_operator)
15495 = EXPR_WFL_LINECOL (TREE_PURPOSE (subiter));
15496 parse_error_context (wfl_operator, "original label is here");
15497
15498 break;
15499 }
15500 }
15501 }
15502
15503 case_label_list = save;
15504
15505 /* Ready to return */
15506 if (TREE_CODE (TREE_OPERAND (node, 1)) == ERROR_MARK)
15507 {
15508 TREE_TYPE (node) = error_mark_node;
15509 return error_mark_node;
15510 }
15511 TREE_TYPE (node) = void_type_node;
15512 TREE_SIDE_EFFECTS (node) = 1;
15513 CAN_COMPLETE_NORMALLY (node)
15514 = CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 1))
15515 || ! SWITCH_HAS_DEFAULT (node);
15516 return node;
15517 }
15518
15519 /* Assertions. */
15520
15521 /* Build an assertion expression for `assert CONDITION : VALUE'; VALUE
15522 might be NULL_TREE. */
15523 static tree
15524 build_assertion (
15525 #ifdef USE_MAPPED_LOCATION
15526 source_location location,
15527 #else
15528 int location,
15529 #endif
15530 tree condition, tree value)
15531 {
15532 tree node;
15533 tree klass = GET_CPC ();
15534
15535 if (! enable_assertions (klass))
15536 {
15537 condition = build2 (TRUTH_ANDIF_EXPR, NULL_TREE,
15538 boolean_false_node, condition);
15539 if (value == NULL_TREE)
15540 value = build_java_empty_stmt ();
15541 return build_if_else_statement (location, condition,
15542 value, NULL_TREE);
15543 }
15544
15545 if (! CLASS_USES_ASSERTIONS (klass))
15546 {
15547 tree field, classdollar, id, call;
15548 tree class_type = TREE_TYPE (klass);
15549
15550 field = add_field (class_type,
15551 get_identifier ("$assertionsDisabled"),
15552 boolean_type_node,
15553 ACC_PRIVATE | ACC_STATIC | ACC_FINAL);
15554 MAYBE_CREATE_VAR_LANG_DECL_SPECIFIC (field);
15555 FIELD_SYNTHETIC (field) = 1;
15556
15557 classdollar = build_incomplete_class_ref (location, class_type);
15558
15559 /* Call CLASS.desiredAssertionStatus(). */
15560 id = build_wfl_node (get_identifier ("desiredAssertionStatus"));
15561 call = build3 (CALL_EXPR, NULL_TREE, id, NULL_TREE, NULL_TREE);
15562 call = make_qualified_primary (classdollar, call, location);
15563 TREE_SIDE_EFFECTS (call) = 1;
15564
15565 /* Invert to obtain !CLASS.desiredAssertionStatus(). This may
15566 seem odd, but we do it to generate code identical to that of
15567 the JDK. */
15568 call = build1 (TRUTH_NOT_EXPR, NULL_TREE, call);
15569 TREE_SIDE_EFFECTS (call) = 1;
15570 DECL_INITIAL (field) = call;
15571
15572 /* Record the initializer in the initializer statement list. */
15573 call = build2 (MODIFY_EXPR, NULL_TREE, field, call);
15574 TREE_CHAIN (call) = CPC_STATIC_INITIALIZER_STMT (ctxp);
15575 SET_CPC_STATIC_INITIALIZER_STMT (ctxp, call);
15576 MODIFY_EXPR_FROM_INITIALIZATION_P (call) = 1;
15577
15578 CLASS_USES_ASSERTIONS (klass) = 1;
15579 }
15580
15581 if (value != NULL_TREE)
15582 value = tree_cons (NULL_TREE, value, NULL_TREE);
15583
15584 node = build_wfl_node (get_identifier ("java"));
15585 node = make_qualified_name (node, build_wfl_node (get_identifier ("lang")),
15586 location);
15587 node = make_qualified_name (node, build_wfl_node (get_identifier ("AssertionError")),
15588 location);
15589
15590 node = build3 (NEW_CLASS_EXPR, NULL_TREE, node, value, NULL_TREE);
15591 TREE_SIDE_EFFECTS (node) = 1;
15592 /* It is too early to use BUILD_THROW. */
15593 node = build1 (THROW_EXPR, NULL_TREE, node);
15594 TREE_SIDE_EFFECTS (node) = 1;
15595
15596 /* We invert the condition; if we just put NODE as the `else' part
15597 then we generate weird-looking bytecode. */
15598 condition = build1 (TRUTH_NOT_EXPR, NULL_TREE, condition);
15599 /* Check $assertionsDisabled. */
15600 condition
15601 = build2 (TRUTH_ANDIF_EXPR, NULL_TREE,
15602 build1 (TRUTH_NOT_EXPR, NULL_TREE,
15603 build_wfl_node (get_identifier ("$assertionsDisabled"))),
15604 condition);
15605 node = build_if_else_statement (location, condition, node, NULL_TREE);
15606 return node;
15607 }
15608
15609 /* 14.18 The try/catch statements */
15610
15611 /* Encapsulate TRY_STMTS' in a try catch sequence. The catch clause
15612 catches TYPE and executes CATCH_STMTS. */
15613
15614 static tree
15615 encapsulate_with_try_catch (int location, tree type_or_name, tree try_stmts,
15616 tree catch_stmts)
15617 {
15618 tree try_block, catch_clause_param, catch_block, catch;
15619
15620 /* First build a try block */
15621 try_block = build_expr_block (try_stmts, NULL_TREE);
15622
15623 /* Build a catch block: we need a catch clause parameter */
15624 if (TREE_CODE (type_or_name) == EXPR_WITH_FILE_LOCATION)
15625 {
15626 tree catch_type = obtain_incomplete_type (type_or_name);
15627 jdep *dep;
15628 catch_clause_param = build_decl (VAR_DECL, wpv_id, catch_type);
15629 register_incomplete_type (JDEP_VARIABLE, type_or_name,
15630 catch_clause_param, catch_type);
15631 dep = CLASSD_LAST (ctxp->classd_list);
15632 JDEP_GET_PATCH (dep) = &TREE_TYPE (catch_clause_param);
15633 }
15634 else
15635 catch_clause_param = build_decl (VAR_DECL, wpv_id,
15636 build_pointer_type (type_or_name));
15637
15638 /* And a block */
15639 catch_block = build_expr_block (NULL_TREE, catch_clause_param);
15640
15641 /* Initialize the variable and store in the block */
15642 catch = build2 (MODIFY_EXPR, NULL_TREE, catch_clause_param,
15643 build0 (JAVA_EXC_OBJ_EXPR, ptr_type_node));
15644 add_stmt_to_block (catch_block, NULL_TREE, catch);
15645
15646 /* Add the catch statements */
15647 add_stmt_to_block (catch_block, NULL_TREE, catch_stmts);
15648
15649 /* Now we can build a JAVA_CATCH_EXPR */
15650 catch_block = build1 (JAVA_CATCH_EXPR, NULL_TREE, catch_block);
15651
15652 return build_try_statement (location, try_block, catch_block);
15653 }
15654
15655 static tree
15656 build_try_statement (int location, tree try_block, tree catches)
15657 {
15658 tree node = build2 (TRY_EXPR, NULL_TREE, try_block, catches);
15659 EXPR_WFL_LINECOL (node) = location;
15660 return node;
15661 }
15662
15663 static tree
15664 build_try_finally_statement (int location, tree try_block, tree finally)
15665 {
15666 tree node = build2 (TRY_FINALLY_EXPR, NULL_TREE, try_block, finally);
15667 EXPR_WFL_LINECOL (node) = location;
15668 return node;
15669 }
15670
15671 static tree
15672 patch_try_statement (tree node)
15673 {
15674 int error_found = 0;
15675 tree try = TREE_OPERAND (node, 0);
15676 /* Exception handlers are considered in left to right order */
15677 tree catch = nreverse (TREE_OPERAND (node, 1));
15678 tree current, caught_type_list = NULL_TREE;
15679
15680 /* Check catch clauses, if any. Every time we find an error, we try
15681 to process the next catch clause. We process the catch clause before
15682 the try block so that when processing the try block we can check thrown
15683 exceptions against the caught type list. */
15684 for (current = catch; current; current = TREE_CHAIN (current))
15685 {
15686 tree carg_decl, carg_type;
15687 tree sub_current, catch_block, catch_clause;
15688 int unreachable;
15689
15690 /* At this point, the structure of the catch clause is
15691 JAVA_CATCH_EXPR (catch node)
15692 BLOCK (with the decl of the parameter)
15693 COMPOUND_EXPR
15694 MODIFY_EXPR (assignment of the catch parameter)
15695 BLOCK (catch clause block)
15696 */
15697 catch_clause = TREE_OPERAND (current, 0);
15698 carg_decl = BLOCK_EXPR_DECLS (catch_clause);
15699 carg_type = TREE_TYPE (TREE_TYPE (carg_decl));
15700
15701 /* Catch clauses can't have more than one parameter declared,
15702 but it's already enforced by the grammar. Make sure that the
15703 only parameter of the clause statement in of class Throwable
15704 or a subclass of Throwable, but that was done earlier. The
15705 catch clause parameter type has also been resolved. */
15706
15707 /* Just make sure that the catch clause parameter type inherits
15708 from java.lang.Throwable */
15709 if (!inherits_from_p (carg_type, throwable_type_node))
15710 {
15711 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (current);
15712 parse_error_context (wfl_operator,
15713 "Can't catch class %qs. Catch clause parameter type must be a subclass of class %<java.lang.Throwable%>",
15714 lang_printable_name (carg_type, 0));
15715 error_found = 1;
15716 continue;
15717 }
15718
15719 /* Partial check for unreachable catch statement: The catch
15720 clause is reachable iff is no earlier catch block A in
15721 the try statement such that the type of the catch
15722 clause's parameter is the same as or a subclass of the
15723 type of A's parameter */
15724 unreachable = 0;
15725 for (sub_current = catch;
15726 sub_current != current; sub_current = TREE_CHAIN (sub_current))
15727 {
15728 tree sub_catch_clause, decl;
15729 sub_catch_clause = TREE_OPERAND (sub_current, 0);
15730 decl = BLOCK_EXPR_DECLS (sub_catch_clause);
15731
15732 if (inherits_from_p (carg_type, TREE_TYPE (TREE_TYPE (decl))))
15733 {
15734 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (current);
15735 parse_error_context
15736 (wfl_operator,
15737 "%<catch%> not reached because of the catch clause at line %d",
15738 EXPR_WFL_LINENO (sub_current));
15739 unreachable = error_found = 1;
15740 break;
15741 }
15742 }
15743 /* Complete the catch clause block */
15744 catch_block = java_complete_tree (TREE_OPERAND (current, 0));
15745 if (catch_block == error_mark_node)
15746 {
15747 error_found = 1;
15748 continue;
15749 }
15750 if (CAN_COMPLETE_NORMALLY (catch_block))
15751 CAN_COMPLETE_NORMALLY (node) = 1;
15752 TREE_OPERAND (current, 0) = catch_block;
15753
15754 if (unreachable)
15755 continue;
15756
15757 /* Things to do here: the exception must be thrown */
15758
15759 /* Link this type to the caught type list */
15760 caught_type_list = tree_cons (NULL_TREE, carg_type, caught_type_list);
15761 }
15762
15763 PUSH_EXCEPTIONS (caught_type_list);
15764 if ((try = java_complete_tree (try)) == error_mark_node)
15765 error_found = 1;
15766 if (CAN_COMPLETE_NORMALLY (try))
15767 CAN_COMPLETE_NORMALLY (node) = 1;
15768 POP_EXCEPTIONS ();
15769
15770 /* Verification ends here */
15771 if (error_found)
15772 return error_mark_node;
15773
15774 TREE_OPERAND (node, 0) = try;
15775 TREE_OPERAND (node, 1) = catch;
15776 TREE_TYPE (node) = void_type_node;
15777 return node;
15778 }
15779
15780 /* 14.17 The synchronized Statement */
15781
15782 static tree
15783 patch_synchronized_statement (tree node, tree wfl_op1)
15784 {
15785 tree expr = java_complete_tree (TREE_OPERAND (node, 0));
15786 tree block = TREE_OPERAND (node, 1);
15787
15788 tree tmp, enter, exit, expr_decl, assignment;
15789
15790 if (expr == error_mark_node)
15791 {
15792 block = java_complete_tree (block);
15793 return expr;
15794 }
15795
15796 /* We might be trying to synchronize on a STRING_CST */
15797 if ((tmp = patch_string (expr)))
15798 expr = tmp;
15799
15800 /* The TYPE of expr must be a reference type */
15801 if (!JREFERENCE_TYPE_P (TREE_TYPE (expr)))
15802 {
15803 SET_WFL_OPERATOR (wfl_operator, node, wfl_op1);
15804 parse_error_context (wfl_operator, "Incompatible type for %<synchronized%>. Can't convert %qs to %<java.lang.Object%>",
15805 lang_printable_name (TREE_TYPE (expr), 0));
15806 return error_mark_node;
15807 }
15808
15809 /* Generate a try-finally for the synchronized statement, except
15810 that the handler that catches all throw exception calls
15811 _Jv_MonitorExit and then rethrow the exception.
15812 The synchronized statement is then implemented as:
15813 TRY
15814 {
15815 _Jv_MonitorEnter (expression)
15816 synchronized_block
15817 _Jv_MonitorExit (expression)
15818 }
15819 CATCH_ALL
15820 {
15821 e = _Jv_exception_info ();
15822 _Jv_MonitorExit (expression)
15823 Throw (e);
15824 } */
15825
15826 expr_decl = build_decl (VAR_DECL, generate_name (), TREE_TYPE (expr));
15827 BUILD_MONITOR_ENTER (enter, expr_decl);
15828 BUILD_MONITOR_EXIT (exit, expr_decl);
15829 CAN_COMPLETE_NORMALLY (enter) = 1;
15830 CAN_COMPLETE_NORMALLY (exit) = 1;
15831 assignment = build2 (MODIFY_EXPR, NULL_TREE, expr_decl, expr);
15832 TREE_SIDE_EFFECTS (assignment) = 1;
15833 node = build2 (COMPOUND_EXPR, NULL_TREE,
15834 build2 (COMPOUND_EXPR, NULL_TREE, assignment, enter),
15835 build2 (TRY_FINALLY_EXPR, NULL_TREE, block, exit));
15836 node = build_expr_block (node, expr_decl);
15837
15838 return java_complete_tree (node);
15839 }
15840
15841 /* 14.16 The throw Statement */
15842
15843 static tree
15844 patch_throw_statement (tree node, tree wfl_op1)
15845 {
15846 tree expr = TREE_OPERAND (node, 0);
15847 tree type = TREE_TYPE (expr);
15848 int unchecked_ok = 0, tryblock_throws_ok = 0;
15849
15850 /* Thrown expression must be assignable to java.lang.Throwable */
15851 if (!try_reference_assignconv (throwable_type_node, expr))
15852 {
15853 SET_WFL_OPERATOR (wfl_operator, node, wfl_op1);
15854 parse_error_context (wfl_operator,
15855 "Can't throw %qs; it must be a subclass of class %<java.lang.Throwable%>",
15856 lang_printable_name (type, 0));
15857 /* If the thrown expression was a reference, we further the
15858 compile-time check. */
15859 if (!JREFERENCE_TYPE_P (type))
15860 return error_mark_node;
15861 }
15862
15863 /* At least one of the following must be true */
15864
15865 /* The type of the throw expression is a not checked exception,
15866 i.e. is a unchecked expression. */
15867 unchecked_ok = IS_UNCHECKED_EXCEPTION_P (TREE_TYPE (type));
15868
15869 SET_WFL_OPERATOR (wfl_operator, node, wfl_op1);
15870 /* An instance can't throw a checked exception unless that exception
15871 is explicitly declared in the `throws' clause of each
15872 constructor. This doesn't apply to anonymous classes, since they
15873 don't have declared constructors. */
15874 if (!unchecked_ok
15875 && DECL_INSTINIT_P (current_function_decl)
15876 && !ANONYMOUS_CLASS_P (current_class))
15877 {
15878 tree current;
15879 for (current = TYPE_METHODS (current_class); current;
15880 current = TREE_CHAIN (current))
15881 if (DECL_CONSTRUCTOR_P (current)
15882 && !check_thrown_exceptions_do (TREE_TYPE (expr)))
15883 {
15884 parse_error_context (wfl_operator, "Checked exception %qs can't be thrown in instance initializer (not all declared constructor are declaring it in their %<throws%> clause)",
15885 lang_printable_name (TREE_TYPE (expr), 0));
15886 return error_mark_node;
15887 }
15888 }
15889
15890 /* Throw is contained in a try statement and at least one catch
15891 clause can receive the thrown expression or the current method is
15892 declared to throw such an exception. Or, the throw statement is
15893 contained in a method or constructor declaration and the type of
15894 the Expression is assignable to at least one type listed in the
15895 throws clause the declaration. */
15896 if (!unchecked_ok)
15897 tryblock_throws_ok = check_thrown_exceptions_do (TREE_TYPE (expr));
15898 if (!(unchecked_ok || tryblock_throws_ok))
15899 {
15900 /* If there is a surrounding try block that has no matching
15901 clatch clause, report it first. A surrounding try block exits
15902 only if there is something after the list of checked
15903 exception thrown by the current function (if any). */
15904 if (IN_TRY_BLOCK_P ())
15905 parse_error_context (wfl_operator, "Checked exception %qs can't be caught by any of the catch clause(s) of the surrounding %<try%> block",
15906 lang_printable_name (type, 0));
15907 /* If we have no surrounding try statement and the method doesn't have
15908 any throws, report it now. FIXME */
15909
15910 /* We report that the exception can't be throw from a try block
15911 in all circumstances but when the `throw' is inside a static
15912 block. */
15913 else if (!EXCEPTIONS_P (currently_caught_type_list)
15914 && !tryblock_throws_ok)
15915 {
15916 if (DECL_CLINIT_P (current_function_decl))
15917 parse_error_context (wfl_operator,
15918 "Checked exception %qs can't be thrown in initializer",
15919 lang_printable_name (type, 0));
15920 else
15921 parse_error_context (wfl_operator,
15922 "Checked exception %qs isn't thrown from a %<try%> block",
15923 lang_printable_name (type, 0));
15924 }
15925 /* Otherwise, the current method doesn't have the appropriate
15926 throws declaration */
15927 else
15928 parse_error_context (wfl_operator, "Checked exception %qs doesn't match any of current method's %<throws%> declaration(s)",
15929 lang_printable_name (type, 0));
15930 return error_mark_node;
15931 }
15932
15933 if (! flag_emit_class_files)
15934 BUILD_THROW (node, expr);
15935
15936 return node;
15937 }
15938
15939 /* Add EXCEPTION to the throws clause of MDECL. If MDECL already throws
15940 a super-class of EXCEPTION, keep the superclass instead. If MDECL already
15941 throws a sub-class of EXCEPTION, replace the sub-class with EXCEPTION. */
15942 static void
15943 add_exception_to_throws (tree mdecl, tree exception)
15944 {
15945 tree mthrows;
15946
15947 /* Ignore unchecked exceptions. */
15948 if (IS_UNCHECKED_EXCEPTION_P (exception))
15949 return;
15950
15951 for (mthrows = DECL_FUNCTION_THROWS (mdecl);
15952 mthrows; mthrows = TREE_CHAIN (mthrows))
15953 {
15954 if (inherits_from_p (exception, TREE_VALUE (mthrows)))
15955 return;
15956 if (inherits_from_p (TREE_VALUE (mthrows), exception))
15957 {
15958 TREE_VALUE (mthrows) = exception;
15959 return;
15960 }
15961 }
15962
15963 mthrows = DECL_FUNCTION_THROWS (mdecl);
15964 DECL_FUNCTION_THROWS (mdecl) = build_tree_list (mthrows, exception);
15965 }
15966
15967 /* Check that exception said to be thrown by method DECL can be
15968 effectively caught from where DECL is invoked. THIS_EXPR is the
15969 expression that computes `this' for the method call. */
15970 static void
15971 check_thrown_exceptions (
15972 #ifdef USE_MAPPED_LOCATION
15973 source_location location,
15974 #else
15975
15976 int location,
15977 #endif
15978 tree decl, tree this_expr)
15979 {
15980 tree throws;
15981 int is_array_call = 0;
15982
15983 /* Skip check within generated methods, such as access$<n>. */
15984 if (NESTED_FIELD_ACCESS_IDENTIFIER_P (DECL_NAME (current_function_decl)))
15985 return;
15986
15987 if (this_expr != NULL_TREE
15988 && TREE_CODE (TREE_TYPE (this_expr)) == POINTER_TYPE
15989 && TYPE_ARRAY_P (TREE_TYPE (TREE_TYPE (this_expr))))
15990 is_array_call = 1;
15991
15992 /* For all the unchecked exceptions thrown by DECL. */
15993 for (throws = DECL_FUNCTION_THROWS (decl); throws;
15994 throws = TREE_CHAIN (throws))
15995 if (!check_thrown_exceptions_do (TREE_VALUE (throws)))
15996 {
15997 /* Suppress errors about cloning arrays. */
15998 if (is_array_call && DECL_NAME (decl) == get_identifier ("clone"))
15999 continue;
16000
16001 #ifdef USE_MAPPED_LOCATION
16002 SET_EXPR_LOCATION (wfl_operator, location);
16003 #else
16004 EXPR_WFL_LINECOL (wfl_operator) = location;
16005 #endif
16006 if (ANONYMOUS_CLASS_P (DECL_CONTEXT (current_function_decl))
16007 && (DECL_FINIT_P (current_function_decl)
16008 || DECL_INIT_P (current_function_decl)
16009 || DECL_CONSTRUCTOR_P (current_function_decl)))
16010 {
16011 /* Add "throws" to the initializer's exception list */
16012 tree exception = TREE_VALUE (throws);
16013 add_exception_to_throws (current_function_decl, exception);
16014 }
16015 else if (DECL_FINIT_P (current_function_decl))
16016 {
16017 parse_error_context
16018 (wfl_operator, "Exception %qs can't be thrown in initializer",
16019 lang_printable_name (TREE_VALUE (throws), 0));
16020 }
16021 else
16022 {
16023 parse_error_context
16024 (wfl_operator, "Exception %qs must be caught, or it must be declared in the %<throws%> clause of %qs",
16025 lang_printable_name (TREE_VALUE (throws), 0),
16026 (DECL_INIT_P (current_function_decl) ?
16027 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (current_class))) :
16028 IDENTIFIER_POINTER (DECL_NAME (current_function_decl))));
16029 }
16030 }
16031 }
16032
16033 /* Return 1 if checked EXCEPTION is caught at the current nesting level of
16034 try-catch blocks, OR is listed in the `throws' clause of the
16035 current method. */
16036
16037 static int
16038 check_thrown_exceptions_do (tree exception)
16039 {
16040 tree list = currently_caught_type_list;
16041 resolve_and_layout (exception, NULL_TREE);
16042 /* First, all the nested try-catch-finally at that stage. The
16043 last element contains `throws' clause exceptions, if any. */
16044 if (IS_UNCHECKED_EXCEPTION_P (exception))
16045 return 1;
16046 while (list)
16047 {
16048 tree caught;
16049 for (caught = TREE_VALUE (list); caught; caught = TREE_CHAIN (caught))
16050 if (valid_ref_assignconv_cast_p (exception, TREE_VALUE (caught), 0))
16051 return 1;
16052 list = TREE_CHAIN (list);
16053 }
16054 return 0;
16055 }
16056
16057 /* This function goes over all of CLASS_TYPE ctors and checks whether
16058 each of them features at least one unchecked exception in its
16059 `throws' clause. If it's the case, it returns `true', `false'
16060 otherwise. */
16061
16062 static bool
16063 ctors_unchecked_throws_clause_p (tree class_type)
16064 {
16065 tree current;
16066
16067 for (current = TYPE_METHODS (class_type); current;
16068 current = TREE_CHAIN (current))
16069 {
16070 bool ctu = false; /* Ctor Throws Unchecked */
16071 if (DECL_CONSTRUCTOR_P (current))
16072 {
16073 tree throws;
16074 for (throws = DECL_FUNCTION_THROWS (current); throws && !ctu;
16075 throws = TREE_CHAIN (throws))
16076 if (inherits_from_p (TREE_VALUE (throws), exception_type_node))
16077 ctu = true;
16078 }
16079 /* We return false as we found one ctor that is unfit. */
16080 if (!ctu && DECL_CONSTRUCTOR_P (current))
16081 return false;
16082 }
16083 /* All ctors feature at least one unchecked exception in their
16084 `throws' clause. */
16085 return true;
16086 }
16087
16088 /* 15.24 Conditional Operator ?: */
16089
16090 static tree
16091 patch_conditional_expr (tree node, tree wfl_cond, tree wfl_op1)
16092 {
16093 tree cond = TREE_OPERAND (node, 0);
16094 tree op1 = TREE_OPERAND (node, 1);
16095 tree op2 = TREE_OPERAND (node, 2);
16096 tree resulting_type = NULL_TREE;
16097 tree t1, t2, patched;
16098 int error_found = 0;
16099
16100 /* The condition and operands of ?: might be StringBuffers crafted
16101 as a result of a string concatenation. Obtain decent ones here. */
16102 if ((patched = patch_string (cond)))
16103 TREE_OPERAND (node, 0) = cond = patched;
16104 if ((patched = patch_string (op1)))
16105 TREE_OPERAND (node, 1) = op1 = patched;
16106 if ((patched = patch_string (op2)))
16107 TREE_OPERAND (node, 2) = op2 = patched;
16108
16109 t1 = TREE_TYPE (op1);
16110 t2 = TREE_TYPE (op2);
16111
16112 /* The first expression must be a boolean */
16113 if (TREE_TYPE (cond) != boolean_type_node)
16114 {
16115 SET_WFL_OPERATOR (wfl_operator, node, wfl_cond);
16116 parse_error_context (wfl_operator,
16117 "Incompatible type for %<?:%>. Can't convert %qs to %<boolean%>",
16118 lang_printable_name (TREE_TYPE (cond), 0));
16119 error_found = 1;
16120 }
16121
16122 /* Second and third can be numeric, boolean (i.e. primitive),
16123 references or null. Anything else results in an error */
16124 if (!((JNUMERIC_TYPE_P (t1) && JNUMERIC_TYPE_P (t2))
16125 || ((JREFERENCE_TYPE_P (t1) || op1 == null_pointer_node)
16126 && (JREFERENCE_TYPE_P (t2) || op2 == null_pointer_node))
16127 || (t1 == boolean_type_node && t2 == boolean_type_node)))
16128 error_found = 1;
16129
16130 /* Determine the type of the conditional expression. Same types are
16131 easy to deal with */
16132 else if (t1 == t2)
16133 resulting_type = t1;
16134
16135 /* There are different rules for numeric types */
16136 else if (JNUMERIC_TYPE_P (t1))
16137 {
16138 /* if byte/short found, the resulting type is short */
16139 if ((t1 == byte_type_node && t2 == short_type_node)
16140 || (t1 == short_type_node && t2 == byte_type_node))
16141 resulting_type = short_type_node;
16142
16143 /* If t1 is a constant int and t2 is of type byte, short or char
16144 and t1's value fits in t2, then the resulting type is t2 */
16145 else if ((t1 == int_type_node && TREE_CONSTANT (TREE_OPERAND (node, 1)))
16146 && JBSC_TYPE_P (t2) && int_fits_type_p (TREE_OPERAND (node, 1), t2))
16147 resulting_type = t2;
16148
16149 /* If t2 is a constant int and t1 is of type byte, short or char
16150 and t2's value fits in t1, then the resulting type is t1 */
16151 else if ((t2 == int_type_node && TREE_CONSTANT (TREE_OPERAND (node, 2)))
16152 && JBSC_TYPE_P (t1) && int_fits_type_p (TREE_OPERAND (node, 2), t1))
16153 resulting_type = t1;
16154
16155 /* Otherwise, binary numeric promotion is applied and the
16156 resulting type is the promoted type of operand 1 and 2 */
16157 else
16158 resulting_type = binary_numeric_promotion (t1, t2,
16159 &TREE_OPERAND (node, 1),
16160 &TREE_OPERAND (node, 2));
16161 }
16162
16163 /* Cases of a reference and a null type */
16164 else if (JREFERENCE_TYPE_P (t1) && op2 == null_pointer_node)
16165 resulting_type = t1;
16166
16167 else if (JREFERENCE_TYPE_P (t2) && op1 == null_pointer_node)
16168 resulting_type = t2;
16169
16170 /* Last case: different reference types. If a type can be converted
16171 into the other one by assignment conversion, the latter
16172 determines the type of the expression */
16173 else if ((resulting_type = try_reference_assignconv (t1, op2)))
16174 resulting_type = promote_type (t1);
16175
16176 else if ((resulting_type = try_reference_assignconv (t2, op1)))
16177 resulting_type = promote_type (t2);
16178
16179 /* If we don't have any resulting type, we're in trouble */
16180 if (!resulting_type)
16181 {
16182 char *t = xstrdup (lang_printable_name (t1, 0));
16183 SET_WFL_OPERATOR (wfl_operator, node, wfl_op1);
16184 parse_error_context (wfl_operator,
16185 "Incompatible type for %<?:%>. Can't convert %qs to %qs",
16186 t, lang_printable_name (t2, 0));
16187 free (t);
16188 error_found = 1;
16189 }
16190
16191 if (error_found)
16192 {
16193 TREE_TYPE (node) = error_mark_node;
16194 return error_mark_node;
16195 }
16196
16197 TREE_TYPE (node) = resulting_type;
16198 TREE_SET_CODE (node, COND_EXPR);
16199 CAN_COMPLETE_NORMALLY (node) = 1;
16200 return node;
16201 }
16202
16203 /* Wrap EXPR with code to initialize DECL's class, if appropriate. */
16204
16205 static tree
16206 maybe_build_class_init_for_field (tree decl, tree expr)
16207 {
16208 tree clas = DECL_CONTEXT (decl);
16209 if (flag_emit_class_files)
16210 return expr;
16211
16212 if (TREE_CODE (decl) == VAR_DECL && FIELD_STATIC (decl)
16213 && FIELD_FINAL (decl))
16214 {
16215 tree init = DECL_INITIAL (decl);
16216 if (init != NULL_TREE)
16217 init = fold_constant_for_init (init, decl);
16218 if (init != NULL_TREE && CONSTANT_VALUE_P (init))
16219 return expr;
16220 }
16221
16222 return build_class_init (clas, expr);
16223 }
16224
16225 /* Try to constant fold NODE.
16226 If NODE is not a constant expression, return NULL_EXPR.
16227 CONTEXT is a static final VAR_DECL whose initializer we are folding. */
16228
16229 static tree
16230 fold_constant_for_init (tree node, tree context)
16231 {
16232 tree op0, op1, val;
16233 enum tree_code code = TREE_CODE (node);
16234
16235 switch (code)
16236 {
16237 case INTEGER_CST:
16238 if (node == null_pointer_node)
16239 return NULL_TREE;
16240 case STRING_CST:
16241 case REAL_CST:
16242 return node;
16243
16244 case PLUS_EXPR:
16245 case MINUS_EXPR:
16246 case MULT_EXPR:
16247 case TRUNC_MOD_EXPR:
16248 case RDIV_EXPR:
16249 case LSHIFT_EXPR:
16250 case RSHIFT_EXPR:
16251 case URSHIFT_EXPR:
16252 case BIT_AND_EXPR:
16253 case BIT_XOR_EXPR:
16254 case BIT_IOR_EXPR:
16255 case TRUTH_ANDIF_EXPR:
16256 case TRUTH_ORIF_EXPR:
16257 case EQ_EXPR:
16258 case NE_EXPR:
16259 case GT_EXPR:
16260 case GE_EXPR:
16261 case LT_EXPR:
16262 case LE_EXPR:
16263 op0 = TREE_OPERAND (node, 0);
16264 op1 = TREE_OPERAND (node, 1);
16265 val = fold_constant_for_init (op0, context);
16266 if (val == NULL_TREE || ! TREE_CONSTANT (val))
16267 return NULL_TREE;
16268 TREE_OPERAND (node, 0) = val;
16269 val = fold_constant_for_init (op1, context);
16270 if (val == NULL_TREE || ! TREE_CONSTANT (val))
16271 return NULL_TREE;
16272 TREE_OPERAND (node, 1) = val;
16273 return patch_binop (node, op0, op1, 1);
16274
16275 case UNARY_PLUS_EXPR:
16276 case NEGATE_EXPR:
16277 case TRUTH_NOT_EXPR:
16278 case BIT_NOT_EXPR:
16279 case CONVERT_EXPR:
16280 case NOP_EXPR:
16281 op0 = TREE_OPERAND (node, 0);
16282 val = fold_constant_for_init (op0, context);
16283 if (val == NULL_TREE || ! TREE_CONSTANT (val))
16284 return NULL_TREE;
16285 TREE_OPERAND (node, 0) = val;
16286 val = patch_unaryop (node, op0);
16287 if (! TREE_CONSTANT (val))
16288 return NULL_TREE;
16289 return val;
16290
16291 break;
16292
16293 case COND_EXPR:
16294 val = fold_constant_for_init (TREE_OPERAND (node, 0), context);
16295 if (val == NULL_TREE || ! TREE_CONSTANT (val))
16296 return NULL_TREE;
16297 TREE_OPERAND (node, 0) = val;
16298 val = fold_constant_for_init (TREE_OPERAND (node, 1), context);
16299 if (val == NULL_TREE || ! TREE_CONSTANT (val))
16300 return NULL_TREE;
16301 TREE_OPERAND (node, 1) = val;
16302 val = fold_constant_for_init (TREE_OPERAND (node, 2), context);
16303 if (val == NULL_TREE || ! TREE_CONSTANT (val))
16304 return NULL_TREE;
16305 TREE_OPERAND (node, 2) = val;
16306 return integer_zerop (TREE_OPERAND (node, 0)) ? TREE_OPERAND (node, 2)
16307 : TREE_OPERAND (node, 1);
16308
16309 case VAR_DECL:
16310 case FIELD_DECL:
16311 if (! FIELD_FINAL (node)
16312 || DECL_INITIAL (node) == NULL_TREE)
16313 return NULL_TREE;
16314 val = DECL_INITIAL (node);
16315 /* Guard against infinite recursion. */
16316 DECL_INITIAL (node) = NULL_TREE;
16317 val = fold_constant_for_init (val, node);
16318 if (val != NULL_TREE && TREE_CODE (val) != STRING_CST)
16319 val = try_builtin_assignconv (NULL_TREE, TREE_TYPE (node), val);
16320 DECL_INITIAL (node) = val;
16321 return val;
16322
16323 case EXPR_WITH_FILE_LOCATION:
16324 /* Compare java_complete_tree and resolve_expression_name. */
16325 if (!EXPR_WFL_NODE (node) /* Or a PRIMARY flag ? */
16326 || TREE_CODE (EXPR_WFL_NODE (node)) == IDENTIFIER_NODE)
16327 {
16328 tree name = EXPR_WFL_NODE (node);
16329 tree decl;
16330 if (PRIMARY_P (node))
16331 return NULL_TREE;
16332 else if (! QUALIFIED_P (name))
16333 {
16334 decl = lookup_field_wrapper (DECL_CONTEXT (context), name);
16335 if (decl == NULL_TREE
16336 || (! FIELD_STATIC (decl) && ! FIELD_FINAL (decl)))
16337 return NULL_TREE;
16338 return fold_constant_for_init (decl, decl);
16339 }
16340 else
16341 {
16342 tree r = NULL_TREE;
16343 /* Install the proper context for the field resolution. */
16344 tree saved_current_class = current_class;
16345 /* Wait until the USE_COMPONENT_REF re-write. FIXME. */
16346 current_class = DECL_CONTEXT (context);
16347 qualify_ambiguous_name (node);
16348 r = resolve_field_access (node, &decl, NULL);
16349 /* Restore prior context. */
16350 current_class = saved_current_class;
16351 if (r != error_mark_node && decl != NULL_TREE)
16352 return fold_constant_for_init (decl, decl);
16353 return NULL_TREE;
16354 }
16355 }
16356 else
16357 {
16358 op0 = TREE_OPERAND (node, 0);
16359 val = fold_constant_for_init (op0, context);
16360 if (val == NULL_TREE || ! TREE_CONSTANT (val))
16361 return NULL_TREE;
16362 TREE_OPERAND (node, 0) = val;
16363 return val;
16364 }
16365
16366 #ifdef USE_COMPONENT_REF
16367 case IDENTIFIER:
16368 case COMPONENT_REF:
16369 ?;
16370 #endif
16371
16372 default:
16373 return NULL_TREE;
16374 }
16375 }
16376
16377 #ifdef USE_COMPONENT_REF
16378 /* Context is 'T' for TypeName, 'P' for PackageName,
16379 'M' for MethodName, 'E' for ExpressionName, and 'A' for AmbiguousName. */
16380
16381 tree
16382 resolve_simple_name (tree name, int context)
16383 {
16384 }
16385
16386 tree
16387 resolve_qualified_name (tree name, int context)
16388 {
16389 }
16390 #endif
16391
16392 void
16393 init_src_parse (void)
16394 {
16395 /* Sanity check; we've been bit by this before. */
16396 if (ARRAY_SIZE (ctxp->modifier_ctx) != MODIFIER_TK - PUBLIC_TK)
16397 abort ();
16398 }
16399
16400 \f
16401
16402 /* This section deals with the functions that are called when tables
16403 recording class initialization information are traversed. */
16404
16405 /* This function is called for each class that is known definitely
16406 initialized when a given static method was called. This function
16407 augments a compound expression (INFO) storing all assignment to
16408 initialized static class flags if a flag already existed, otherwise
16409 a new one is created. */
16410
16411 static int
16412 emit_test_initialization (void **entry_p, void *info)
16413 {
16414 tree l = (tree) info;
16415 tree decl, init;
16416 tree key = (tree) *entry_p;
16417 tree *ite;
16418 htab_t cf_ht = DECL_FUNCTION_INIT_TEST_TABLE (current_function_decl);
16419
16420 /* If we haven't found a flag and we're dealing with self registered
16421 with current_function_decl, then don't do anything. Self is
16422 always added as definitely initialized but this information is
16423 valid only if used outside the current function. */
16424 if (current_function_decl == TREE_PURPOSE (l)
16425 && java_treetreehash_find (cf_ht, key) == NULL)
16426 return true;
16427
16428 ite = java_treetreehash_new (cf_ht, key);
16429
16430 /* If we don't have a variable, create one and install it. */
16431 if (*ite == NULL)
16432 {
16433 tree block;
16434
16435 decl = build_decl (VAR_DECL, NULL_TREE, boolean_type_node);
16436 MAYBE_CREATE_VAR_LANG_DECL_SPECIFIC (decl);
16437 LOCAL_CLASS_INITIALIZATION_FLAG (decl) = 1;
16438 DECL_CONTEXT (decl) = current_function_decl;
16439 DECL_INITIAL (decl) = boolean_true_node;
16440 /* Don't emit any symbolic debugging info for this decl. */
16441 DECL_IGNORED_P (decl) = 1;
16442
16443 /* The trick is to find the right context for it. */
16444 block = BLOCK_SUBBLOCKS (GET_CURRENT_BLOCK (current_function_decl));
16445 TREE_CHAIN (decl) = BLOCK_EXPR_DECLS (block);
16446 BLOCK_EXPR_DECLS (block) = decl;
16447 *ite = decl;
16448 }
16449 else
16450 decl = *ite;
16451
16452 /* Now simply augment the compound that holds all the assignments
16453 pertaining to this method invocation. */
16454 init = build2 (MODIFY_EXPR, boolean_type_node, decl, boolean_true_node);
16455 TREE_SIDE_EFFECTS (init) = 1;
16456 TREE_VALUE (l) = add_stmt_to_compound (TREE_VALUE (l), void_type_node, init);
16457 TREE_SIDE_EFFECTS (TREE_VALUE (l)) = 1;
16458
16459 return true;
16460 }
16461
16462 #ifdef __XGETTEXT__
16463 /* Depending on the version of Bison used to compile this grammar,
16464 it may issue generic diagnostics spelled "syntax error" or
16465 "parse error". To prevent this from changing the translation
16466 template randomly, we list all the variants of this particular
16467 diagnostic here. Translators: there is no fine distinction
16468 between diagnostics with "syntax error" in them, and diagnostics
16469 with "parse error" in them. It's okay to give them both the same
16470 translation. */
16471 const char d1[] = N_("syntax error");
16472 const char d2[] = N_("parse error");
16473 const char d3[] = N_("syntax error; also virtual memory exhausted");
16474 const char d4[] = N_("parse error; also virtual memory exhausted");
16475 const char d5[] = N_("syntax error: cannot back up");
16476 const char d6[] = N_("parse error: cannot back up");
16477 #endif
16478
16479 #include "gt-java-parse.h"
16480 #include "gtype-java.h"
Mirror of the offical gcc git repository hosted at gcc.gnu.org