]> gcc.gnu.org Git - gcc.git/blame - gcc/java/parse.y
git://gcc.gnu.org / gcc.git / blame
? search:
summary | shortlog | log | commit | commitdiff | tree
blob | blame (incremental) | history | HEAD
pretty-print.c: Include tree.h.
[gcc.git] / gcc / java / parse.y
CommitLineData
e04a16fb
AG		 1/* Source code parsing and tree node generation for the GNU compiler
2 for the Java(TM) language.
85194ee9 3 Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004
f309ff0a 4 Free Software Foundation, Inc.
e04a16fb
AG		 5 Contributed by Alexandre Petit-Bianco (apbianco@cygnus.com)
6
f309ff0a 7This file is part of GCC.
e04a16fb 8
f309ff0a 9GCC is free software; you can redistribute it and/or modify
e04a16fb
AG		 10it under the terms of the GNU General Public License as published by
11the Free Software Foundation; either version 2, or (at your option)
12any later version.
13
f309ff0a 14GCC is distributed in the hope that it will be useful,
e04a16fb
AG		 15but WITHOUT ANY WARRANTY; without even the implied warranty of
16MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17GNU General Public License for more details.
18
19You should have received a copy of the GNU General Public License
f309ff0a 20along with GCC; see the file COPYING. If not, write to
e04a16fb
AG		 21the Free Software Foundation, 59 Temple Place - Suite 330,
22Boston, MA 02111-1307, USA.
23
24Java and all Java-based marks are trademarks or registered trademarks
25of Sun Microsystems, Inc. in the United States and other countries.
26The Free Software Foundation is independent of Sun Microsystems, Inc. */
27
28/* This file parses java source code and issues a tree node image
29suitable for code generation (byte code and targeted CPU assembly
30language).
31
32The grammar conforms to the Java grammar described in "The Java(TM)
33Language Specification. J. Gosling, B. Joy, G. Steele. Addison Wesley
341996, ISBN 0-201-63451-1"
35
36The following modifications were brought to the original grammar:
37
38method_body: added the rule '| block SC_TK'
e35b68b0 39static_initializer: added the rule 'static block SC_TK'.
e04a16fb
AG		 40
41Note: All the extra rules described above should go away when the
42 empty_statement rule will work.
43
44statement_nsi: 'nsi' should be read no_short_if.
45
46Some rules have been modified to support JDK1.1 inner classes
47definitions and other extensions. */
48
49%{
e04a16fb 50#include "config.h"
36635152 51#include "system.h"
4977bab6
ZW		 52#include "coretypes.h"
53#include "tm.h"
36635152 54#include <dirent.h>
e04a16fb
AG		 55#include "tree.h"
56#include "rtl.h"
11ad4784 57#include "real.h"
e04a16fb 58#include "obstack.h"
0a2138e2 59#include "toplev.h"
5544148e
RM		 60#include "pretty-print.h"
61#include "diagnostic.h"
e04a16fb
AG		 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"
5e942c50 68#include "convert.h"
63a212ed 69#include "buffer.h"
f099f336 70#include "xref.h"
b384405b 71#include "function.h"
138657ec 72#include "except.h"
19e223db 73#include "ggc.h"
e2500fed 74#include "debug.h"
7149627b 75#include "tree-inline.h"
916b57ce 76#include "cgraph.h"
136e64db 77#include "target.h"
e04a16fb 78
82371d41 79/* Local function prototypes */
d2097937 80static char *java_accstring_lookup (int);
8ae6595c 81static const char *accessibility_string (int);
d2097937
KG		 82static void classitf_redefinition_error (const char *,tree, tree, tree);
83static void variable_redefinition_error (tree, tree, tree, int);
84static tree create_class (int, tree, tree, tree);
85static tree create_interface (int, tree, tree);
86static void end_class_declaration (int);
87static tree find_field (tree, tree);
88static tree lookup_field_wrapper (tree, tree);
89static int duplicate_declaration_error_p (tree, tree, tree);
90static void register_fields (int, tree, tree);
91static tree parser_qualified_classname (tree);
92static int parser_check_super (tree, tree, tree);
93static int parser_check_super_interface (tree, tree, tree);
94static void check_modifiers_consistency (int);
95static tree lookup_cl (tree);
96static tree lookup_java_method2 (tree, tree, int);
97static tree method_header (int, tree, tree, tree);
98static void fix_method_argument_names (tree ,tree);
99static tree method_declarator (tree, tree);
100static void parse_warning_context (tree cl, const char *msg, ...)
d4476be2 101 ATTRIBUTE_PRINTF_2;
9ec819d4
PB		 102#ifdef USE_MAPPED_LOCATION
103static void issue_warning_error_from_context
104 (source_location, const char *msg, va_list) ATTRIBUTE_PRINTF (2, 0);
105#else
d2097937 106static void issue_warning_error_from_context (tree, const char *msg, va_list)
88f3c477 107 ATTRIBUTE_PRINTF (2, 0);
9ec819d4 108#endif
d2097937
KG		 109static void parse_ctor_invocation_error (void);
110static tree parse_jdk1_1_error (const char *);
111static void complete_class_report_errors (jdep *);
112static int process_imports (void);
113static void read_import_dir (tree);
114static int find_in_imports_on_demand (tree, tree);
115static void find_in_imports (tree, tree);
116static void check_inner_class_access (tree, tree, tree);
7cef5027 117static int check_pkg_class_access (tree, tree, bool, tree);
d2097937
KG		 118static void register_package (tree);
119static tree resolve_package (tree, tree *, tree *);
120static tree resolve_class (tree, tree, tree, tree);
121static void declare_local_variables (int, tree, tree);
122static void dump_java_tree (enum tree_dump_index, tree);
123static void source_start_java_method (tree);
124static void source_end_java_method (void);
125static tree find_name_in_single_imports (tree);
126static void check_abstract_method_header (tree);
127static tree lookup_java_interface_method2 (tree, tree);
128static tree resolve_expression_name (tree, tree *);
129static tree maybe_create_class_interface_decl (tree, tree, tree, tree);
130static int check_class_interface_creation (int, int, tree, tree, tree, tree);
131static tree patch_method_invocation (tree, tree, tree, int, int *, tree *);
d2097937
KG		 132static tree resolve_and_layout (tree, tree);
133static tree qualify_and_find (tree, tree, tree);
134static tree resolve_no_layout (tree, tree);
135static int invocation_mode (tree, int);
136static tree find_applicable_accessible_methods_list (int, tree, tree, tree);
137static void search_applicable_methods_list (int, tree, tree, tree, tree *, tree *);
138static tree find_most_specific_methods_list (tree);
139static int argument_types_convertible (tree, tree);
140static tree patch_invoke (tree, tree, tree);
141static int maybe_use_access_method (int, tree *, tree *);
142static tree lookup_method_invoke (int, tree, tree, tree, tree);
143static tree register_incomplete_type (int, tree, tree, tree);
144static tree check_inner_circular_reference (tree, tree);
145static tree check_circular_reference (tree);
146static tree obtain_incomplete_type (tree);
147static tree java_complete_lhs (tree);
148static tree java_complete_tree (tree);
149static tree maybe_generate_pre_expand_clinit (tree);
150static int analyze_clinit_body (tree, tree);
151static int maybe_yank_clinit (tree);
6de9cd9a 152static void start_complete_expand_method (tree);
d2097937
KG		 153static void java_complete_expand_method (tree);
154static void java_expand_method_bodies (tree);
155static int unresolved_type_p (tree, tree *);
156static void create_jdep_list (struct parser_ctxt *);
157static tree build_expr_block (tree, tree);
158static tree enter_block (void);
159static tree exit_block (void);
160static tree lookup_name_in_blocks (tree);
161static void maybe_absorb_scoping_blocks (void);
162static tree build_method_invocation (tree, tree);
163static tree build_new_invocation (tree, tree);
164static tree build_assignment (int, int, tree, tree);
165static tree build_binop (enum tree_code, int, tree, tree);
166static tree patch_assignment (tree, tree);
167static tree patch_binop (tree, tree, tree);
168static tree build_unaryop (int, int, tree);
169static tree build_incdec (int, int, tree, int);
170static tree patch_unaryop (tree, tree);
171static tree build_cast (int, tree, tree);
172static tree build_null_of_type (tree);
173static tree patch_cast (tree, tree);
174static int valid_ref_assignconv_cast_p (tree, tree, int);
175static int valid_builtin_assignconv_identity_widening_p (tree, tree);
176static int valid_cast_to_p (tree, tree);
177static int valid_method_invocation_conversion_p (tree, tree);
178static tree try_builtin_assignconv (tree, tree, tree);
179static tree try_reference_assignconv (tree, tree);
180static tree build_unresolved_array_type (tree);
181static int build_type_name_from_array_name (tree, tree *);
182static tree build_array_from_name (tree, tree, tree, tree *);
183static tree build_array_ref (int, tree, tree);
184static tree patch_array_ref (tree);
9ec819d4
PB		 185#ifdef USE_MAPPED_LOCATION
186static tree make_qualified_name (tree, tree, source_location);
187#else
d2097937 188static tree make_qualified_name (tree, tree, int);
9ec819d4 189#endif
d2097937
KG		 190static tree merge_qualified_name (tree, tree);
191static tree make_qualified_primary (tree, tree, int);
192static int resolve_qualified_expression_name (tree, tree *, tree *, tree *);
193static void qualify_ambiguous_name (tree);
194static tree resolve_field_access (tree, tree *, tree *);
195static tree build_newarray_node (tree, tree, int);
196static tree patch_newarray (tree);
197static tree resolve_type_during_patch (tree);
198static tree build_this (int);
199static tree build_wfl_wrap (tree, int);
200static tree build_return (int, tree);
201static tree patch_return (tree);
202static tree maybe_access_field (tree, tree, tree);
203static int complete_function_arguments (tree);
204static int check_for_static_method_reference (tree, tree, tree, tree, tree);
205static int not_accessible_p (tree, tree, tree, int);
206static void check_deprecation (tree, tree);
207static int class_in_current_package (tree);
208static tree build_if_else_statement (int, tree, tree, tree);
209static tree patch_if_else_statement (tree);
d2097937
KG		 210static tree add_stmt_to_block (tree, tree, tree);
211static tree patch_exit_expr (tree);
212static tree build_labeled_block (int, tree);
213static tree finish_labeled_statement (tree, tree);
214static tree build_bc_statement (int, int, tree);
215static tree patch_bc_statement (tree);
216static tree patch_loop_statement (tree);
217static tree build_new_loop (tree);
218static tree build_loop_body (int, tree, int);
219static tree finish_loop_body (int, tree, tree, int);
220static tree build_debugable_stmt (int, tree);
221static tree finish_for_loop (int, tree, tree, tree);
222static tree patch_switch_statement (tree);
223static tree string_constant_concatenation (tree, tree);
224static tree build_string_concatenation (tree, tree);
225static tree patch_string_cst (tree);
226static tree patch_string (tree);
227static tree encapsulate_with_try_catch (int, tree, tree, tree);
9ec819d4
PB		 228#ifdef USE_MAPPED_LOCATION
229static tree build_assertion (source_location, tree, tree);
230#else
d2097937 231static tree build_assertion (int, tree, tree);
9ec819d4 232#endif
d2097937
KG		 233static tree build_try_statement (int, tree, tree);
234static tree build_try_finally_statement (int, tree, tree);
235static tree patch_try_statement (tree);
236static tree patch_synchronized_statement (tree, tree);
237static tree patch_throw_statement (tree, tree);
9ec819d4
PB		 238#ifdef USE_MAPPED_LOCATION
239static void check_thrown_exceptions (source_location, tree, tree);
240#else
90281aec 241static void check_thrown_exceptions (int, tree, tree);
9ec819d4 242#endif
d2097937
KG		 243static int check_thrown_exceptions_do (tree);
244static void purge_unchecked_exceptions (tree);
245static bool ctors_unchecked_throws_clause_p (tree);
aecf4109 246static void check_concrete_throws_clauses (tree, tree, tree, tree);
d2097937
KG		 247static void check_throws_clauses (tree, tree, tree);
248static void finish_method_declaration (tree);
249static tree build_super_invocation (tree);
250static int verify_constructor_circularity (tree, tree);
251static char *constructor_circularity_msg (tree, tree);
252static tree build_this_super_qualified_invocation (int, tree, tree, int, int);
253static const char *get_printable_method_name (tree);
254static tree patch_conditional_expr (tree, tree, tree);
255static tree generate_finit (tree);
256static tree generate_instinit (tree);
257static tree build_instinit_invocation (tree);
258static void fix_constructors (tree);
259static tree build_alias_initializer_parameter_list (int, tree, tree, int *);
260static tree craft_constructor (tree, tree);
261static int verify_constructor_super (tree);
262static tree create_artificial_method (tree, int, tree, tree, tree);
263static void start_artificial_method_body (tree);
264static void end_artificial_method_body (tree);
265static int check_method_redefinition (tree, tree);
266static int check_method_types_complete (tree);
aecf4109 267static bool hack_is_accessible_p (tree, tree);
d2097937 268static void java_check_regular_methods (tree);
aecf4109 269static void check_interface_throws_clauses (tree, tree);
d2097937
KG		 270static void java_check_abstract_methods (tree);
271static void unreachable_stmt_error (tree);
cd11bdcc 272static int not_accessible_field_error (tree, tree);
d2097937
KG		 273static tree find_expr_with_wfl (tree);
274static void missing_return_error (tree);
275static tree build_new_array_init (int, tree);
276static tree patch_new_array_init (tree, tree);
277static tree maybe_build_array_element_wfl (tree);
278static int array_constructor_check_entry (tree, tree);
279static const char *purify_type_name (const char *);
280static tree fold_constant_for_init (tree, tree);
281static tree strip_out_static_field_access_decl (tree);
282static jdeplist *reverse_jdep_list (struct parser_ctxt *);
283static void static_ref_err (tree, tree, tree);
284static void parser_add_interface (tree, tree, tree);
285static void add_superinterfaces (tree, tree);
286static tree jdep_resolve_class (jdep *);
287static int note_possible_classname (const char *, int);
288static void java_complete_expand_classes (void);
289static void java_complete_expand_class (tree);
290static void java_complete_expand_methods (tree);
291static tree cut_identifier_in_qualified (tree);
292static tree java_stabilize_reference (tree);
293static tree do_unary_numeric_promotion (tree);
294static char * operator_string (tree);
295static tree do_merge_string_cste (tree, const char *, int, int);
296static tree merge_string_cste (tree, tree, int);
297static tree java_refold (tree);
298static int java_decl_equiv (tree, tree);
299static int binop_compound_p (enum tree_code);
300static tree search_loop (tree);
301static int labeled_block_contains_loop_p (tree, tree);
302static int check_abstract_method_definitions (int, tree, tree);
303static void java_check_abstract_method_definitions (tree);
304static void java_debug_context_do (int);
305static void java_parser_context_push_initialized_field (void);
306static void java_parser_context_pop_initialized_field (void);
307static tree reorder_static_initialized (tree);
308static void java_parser_context_suspend (void);
309static void java_parser_context_resume (void);
310static int pop_current_osb (struct parser_ctxt *);
c2952b01
APB		 311
312/* JDK 1.1 work. FIXME */
313
d2097937
KG		 314static tree maybe_make_nested_class_name (tree);
315static int make_nested_class_name (tree);
d2097937
KG		 316static void link_nested_class_to_enclosing (void);
317static tree resolve_inner_class (htab_t, tree, tree *, tree *, tree);
318static tree find_as_inner_class (tree, tree, tree);
319static tree find_as_inner_class_do (tree, tree);
320static int check_inner_class_redefinition (tree, tree);
c2952b01 321
d2097937
KG		 322static tree build_thisn_assign (void);
323static tree build_current_thisn (tree);
324static tree build_access_to_thisn (tree, tree, int);
325static tree maybe_build_thisn_access_method (tree);
c2952b01 326
d2097937
KG		 327static tree build_outer_field_access (tree, tree);
328static tree build_outer_field_access_methods (tree);
17211ab5
GK		 329static tree build_outer_field_access_expr (int, tree, tree,
330 tree, tree);
d2097937
KG		 331static tree build_outer_method_access_method (tree);
332static tree build_new_access_id (void);
17211ab5
GK		 333static tree build_outer_field_access_method (tree, tree, tree,
334 tree, tree);
c2952b01 335
d2097937 336static int outer_field_access_p (tree, tree);
17211ab5
GK		 337static int outer_field_expanded_access_p (tree, tree *,
338 tree *, tree *);
d2097937
KG		 339static tree outer_field_access_fix (tree, tree, tree);
340static tree build_incomplete_class_ref (int, tree);
341static tree patch_incomplete_class_ref (tree);
d3ecb597 342static tree create_anonymous_class (tree);
d2097937
KG		 343static void patch_anonymous_class (tree, tree, tree);
344static void add_inner_class_fields (tree, tree);
82371d41 345
d2097937 346static tree build_dot_class_method (tree);
b8ca854a 347static tree build_dot_class_method_invocation (tree, tree);
d2097937 348static void create_new_parser_context (int);
d2097937 349static tree maybe_build_class_init_for_field (tree, tree);
165f37bc 350
77d3109b
KG		 351static int attach_init_test_initialization_flags (void **, void *);
352static int emit_test_initialization (void **, void *);
4009bb7d 353
d2097937 354static char *string_convert_int_cst (tree);
0a32c5ea 355
e04a16fb 356/* Number of error found so far. */
e35b68b0 357int java_error_count;
e04a16fb
AG		 358/* Number of warning found so far. */
359int java_warning_count;
ce6e9147
APB		 360/* Tell when not to fold, when doing xrefs */
361int do_not_fold;
c2952b01 362/* Cyclic inheritance report, as it can be set by layout_class */
7e9355c6 363const char *cyclic_inheritance_report;
e35b68b0 364
e04a16fb 365/* The current parser context */
d4370213 366struct parser_ctxt *ctxp;
e04a16fb 367
d4370213 368/* List of things that were analyzed for which code will be generated */
fea2d5da 369struct parser_ctxt *ctxp_for_generation = NULL;
b351b287 370
e04a16fb
AG		 371/* binop_lookup maps token to tree_code. It is used where binary
372 operations are involved and required by the parser. RDIV_EXPR
373 covers both integral/floating point division. The code is changed
374 once the type of both operator is worked out. */
375
e35b68b0
AD		 376static const enum tree_code binop_lookup[19] =
377 {
e04a16fb 378 PLUS_EXPR, MINUS_EXPR, MULT_EXPR, RDIV_EXPR, TRUNC_MOD_EXPR,
e35b68b0 379 LSHIFT_EXPR, RSHIFT_EXPR, URSHIFT_EXPR,
e04a16fb
AG		 380 BIT_AND_EXPR, BIT_XOR_EXPR, BIT_IOR_EXPR,
381 TRUTH_ANDIF_EXPR, TRUTH_ORIF_EXPR,
382 EQ_EXPR, NE_EXPR, GT_EXPR, GE_EXPR, LT_EXPR, LE_EXPR,
383 };
384#define BINOP_LOOKUP(VALUE) \
6e2aa220 385 binop_lookup [((VALUE) - PLUS_TK) % ARRAY_SIZE (binop_lookup)]
e04a16fb 386
5cbdba64 387/* This is the end index for binary operators that can also be used
67264b4f 388 in compound assignments. */
5cbdba64
APB		 389#define BINOP_COMPOUND_CANDIDATES 11
390
e04a16fb 391/* The "$L" identifier we use to create labels. */
e2500fed 392static GTY(()) tree label_id;
b67d701b
PB		 393
394/* The "StringBuffer" identifier used for the String `+' operator. */
e35b68b0 395static GTY(()) tree wfl_string_buffer;
b67d701b
PB		 396
397/* The "append" identifier used for String `+' operator. */
e2500fed 398static GTY(()) tree wfl_append;
b67d701b
PB		 399
400/* The "toString" identifier used for String `+' operator. */
e2500fed 401static GTY(()) tree wfl_to_string;
ba179f9f
APB		 402
403/* The "java.lang" import qualified name. */
e2500fed 404static GTY(()) tree java_lang_id;
09ed0f70 405
c2952b01
APB		 406/* The generated `inst$' identifier used for generated enclosing
407 instance/field access functions. */
e2500fed 408static GTY(()) tree inst_id;
c2952b01 409
f099f336 410/* Context and flag for static blocks */
e2500fed 411static GTY(()) tree current_static_block;
f099f336 412
c2952b01 413/* The generated `write_parm_value$' identifier. */
e2500fed 414static GTY(()) tree wpv_id;
c2952b01 415
ee07f4f4 416/* The list of all packages we've seen so far */
e2500fed 417static GTY(()) tree package_list;
e35b68b0 418
4f88ccda 419/* Hold THIS for the scope of the current method decl. */
e2500fed 420static GTY(()) tree current_this;
19e223db
MM		 421
422/* Hold a list of catch clauses list. The first element of this list is
ed2f11fa 423 the list of the catch clauses of the currently analyzed try block. */
e2500fed 424static GTY(()) tree currently_caught_type_list;
19e223db 425
5a21a051
TT		 426/* This holds a linked list of all the case labels for the current
427 switch statement. It is only used when checking to see if there
428 are duplicate labels. FIXME: probably this should just be attached
429 to the switch itself; then it could be referenced via
430 `ctxp->current_loop'. */
e35b68b0 431static GTY(()) tree case_label_list;
5a21a051 432
48711f4d
TT		 433/* Anonymous class counter. Will be reset to 1 every time a non
434 anonymous class gets created. */
435static int anonymous_class_counter = 1;
436
e2500fed 437static GTY(()) tree src_parse_roots[1];
fea2d5da
PB		 438
439/* All classes seen from source code */
440#define gclass_list src_parse_roots[0]
441
2884c41e
KG		 442/* Check modifiers. If one doesn't fit, retrieve it in its declaration
443 line and point it out. */
444/* Should point out the one that don't fit. ASCII/unicode, going
445 backward. FIXME */
446
447#define check_modifiers(__message, __value, __mask) do { \
448 if ((__value) & ~(__mask)) \
449 { \
33780b45
KG		 450 size_t i, remainder = (__value) & ~(__mask); \
451 for (i = 0; i < ARRAY_SIZE (ctxp->modifier_ctx); i++) \
2884c41e
KG		 452 if ((1 << i) & remainder) \
453 parse_error_context (ctxp->modifier_ctx [i], (__message), \
454 java_accstring_lookup (1 << i)); \
455 } \
456} while (0)
ee07f4f4 457
e04a16fb
AG		 458%}
459
460%union {
461 tree node;
462 int sub_token;
463 struct {
464 int token;
9ec819d4
PB		 465#ifdef USE_MAPPED_LOCATION
466 source_location location;
467#else
e04a16fb 468 int location;
9ec819d4 469#endif
e04a16fb
AG		 470 } operator;
471 int value;
472}
473
9ee9b555 474%{
9ec819d4
PB		 475#ifdef USE_MAPPED_LOCATION
476#define SET_EXPR_LOCATION_FROM_TOKEN(EXPR, TOKEN) \
477 SET_EXPR_LOCATION(EXPR, (TOKEN).location)
478#else
479#define SET_EXPR_LOCATION_FROM_TOKEN(EXPR, TOKEN) \
480 (EXPR_WFL_LINECOL (EXPR) = (TOKEN).location)
481#endif
482
9ee9b555
KG		 483#include "lex.c"
484%}
485
e04a16fb
AG		 486%pure_parser
487
488/* Things defined here have to match the order of what's in the
489 binop_lookup table. */
490
491%token PLUS_TK MINUS_TK MULT_TK DIV_TK REM_TK
492%token LS_TK SRS_TK ZRS_TK
493%token AND_TK XOR_TK OR_TK
e35b68b0 494%token BOOL_AND_TK BOOL_OR_TK
e04a16fb
AG		 495%token EQ_TK NEQ_TK GT_TK GTE_TK LT_TK LTE_TK
496
497/* This maps to the same binop_lookup entry than the token above */
498
499%token PLUS_ASSIGN_TK MINUS_ASSIGN_TK MULT_ASSIGN_TK DIV_ASSIGN_TK
e35b68b0 500%token REM_ASSIGN_TK
e04a16fb
AG		 501%token LS_ASSIGN_TK SRS_ASSIGN_TK ZRS_ASSIGN_TK
502%token AND_ASSIGN_TK XOR_ASSIGN_TK OR_ASSIGN_TK
503
504
505/* Modifier TOKEN have to be kept in this order. Don't scramble it */
506
507%token PUBLIC_TK PRIVATE_TK PROTECTED_TK
508%token STATIC_TK FINAL_TK SYNCHRONIZED_TK
509%token VOLATILE_TK TRANSIENT_TK NATIVE_TK
6b6294f1
TT		 510%token PAD_TK ABSTRACT_TK STRICT_TK
511%token MODIFIER_TK
e04a16fb
AG		 512
513/* Keep those two in order, too */
514%token DECR_TK INCR_TK
515
516/* From now one, things can be in any order */
517
518%token DEFAULT_TK IF_TK THROW_TK
519%token BOOLEAN_TK DO_TK IMPLEMENTS_TK
e35b68b0 520%token THROWS_TK BREAK_TK IMPORT_TK
e04a16fb
AG		 521%token ELSE_TK INSTANCEOF_TK RETURN_TK
522%token VOID_TK CATCH_TK INTERFACE_TK
523%token CASE_TK EXTENDS_TK FINALLY_TK
524%token SUPER_TK WHILE_TK CLASS_TK
525%token SWITCH_TK CONST_TK TRY_TK
526%token FOR_TK NEW_TK CONTINUE_TK
527%token GOTO_TK PACKAGE_TK THIS_TK
c6226a7e 528%token ASSERT_TK
e04a16fb
AG		 529
530%token BYTE_TK SHORT_TK INT_TK LONG_TK
531%token CHAR_TK INTEGRAL_TK
532
533%token FLOAT_TK DOUBLE_TK FP_TK
534
535%token ID_TK
536
537%token REL_QM_TK REL_CL_TK NOT_TK NEG_TK
538
539%token ASSIGN_ANY_TK ASSIGN_TK
540%token OP_TK CP_TK OCB_TK CCB_TK OSB_TK CSB_TK SC_TK C_TK DOT_TK
541
542%token STRING_LIT_TK CHAR_LIT_TK INT_LIT_TK FP_LIT_TK
543%token TRUE_TK FALSE_TK BOOL_LIT_TK NULL_TK
544
c2952b01 545%type <value> modifiers MODIFIER_TK final synchronized
e04a16fb
AG		 546
547%type <node> super ID_TK identifier
548%type <node> name simple_name qualified_name
c2952b01 549%type <node> type_declaration compilation_unit
e04a16fb
AG		 550 field_declaration method_declaration extends_interfaces
551 interfaces interface_type_list
e35b68b0 552 import_declarations package_declaration
e04a16fb
AG		 553 type_declarations interface_body
554 interface_member_declaration constant_declaration
555 interface_member_declarations interface_type
e35b68b0 556 abstract_method_declaration
e04a16fb
AG		 557%type <node> class_body_declaration class_member_declaration
558 static_initializer constructor_declaration block
22eed1e6 559%type <node> class_body_declarations constructor_header
e04a16fb
AG		 560%type <node> class_or_interface_type class_type class_type_list
561 constructor_declarator explicit_constructor_invocation
b9f7e36c 562%type <node> dim_expr dim_exprs this_or_super throws
e04a16fb
AG		 563
564%type <node> variable_declarator_id variable_declarator
565 variable_declarators variable_initializer
22eed1e6 566 variable_initializers constructor_body
ac825856 567 array_initializer
e04a16fb 568
2e5eb5c5 569%type <node> class_body block_end constructor_block_end
e04a16fb
AG		 570%type <node> statement statement_without_trailing_substatement
571 labeled_statement if_then_statement label_decl
572 if_then_else_statement while_statement for_statement
573 statement_nsi labeled_statement_nsi do_statement
574 if_then_else_statement_nsi while_statement_nsi
575 for_statement_nsi statement_expression_list for_init
576 for_update statement_expression expression_statement
16d85b63
TT		 577 primary_no_new_array expression primary array_type
578 array_creation_initialized array_creation_uninitialized
e04a16fb
AG		 579 class_instance_creation_expression field_access
580 method_invocation array_access something_dot_new
e35b68b0 581 argument_list postfix_expression while_expression
e04a16fb
AG		 582 post_increment_expression post_decrement_expression
583 unary_expression_not_plus_minus unary_expression
584 pre_increment_expression pre_decrement_expression
e35b68b0 585 cast_expression
e04a16fb 586 multiplicative_expression additive_expression
e35b68b0
AD		 587 shift_expression relational_expression
588 equality_expression and_expression
e04a16fb
AG		 589 exclusive_or_expression inclusive_or_expression
590 conditional_and_expression conditional_or_expression
591 conditional_expression assignment_expression
592 left_hand_side assignment for_header for_begin
593 constant_expression do_statement_begin empty_statement
b67d701b 594 switch_statement synchronized_statement throw_statement
c6226a7e
TT		 595 try_statement assert_statement
596 switch_expression switch_block
15fdcfe9 597 catches catch_clause catch_clause_parameter finally
1fa73144 598 anonymous_class_creation trap_overflow_corner_case
e04a16fb
AG		 599%type <node> return_statement break_statement continue_statement
600
6d61f1bd 601%type <operator> ASSIGN_TK MULT_ASSIGN_TK DIV_ASSIGN_TK
e04a16fb
AG		 602%type <operator> REM_ASSIGN_TK PLUS_ASSIGN_TK MINUS_ASSIGN_TK
603%type <operator> LS_ASSIGN_TK SRS_ASSIGN_TK ZRS_ASSIGN_TK
604%type <operator> AND_ASSIGN_TK XOR_ASSIGN_TK OR_ASSIGN_TK
605%type <operator> ASSIGN_ANY_TK assignment_operator
e35b68b0 606%token <operator> EQ_TK GTE_TK ZRS_TK SRS_TK GT_TK LTE_TK LS_TK
e04a16fb
AG		 607%token <operator> BOOL_AND_TK AND_TK BOOL_OR_TK OR_TK INCR_TK PLUS_TK
608%token <operator> DECR_TK MINUS_TK MULT_TK DIV_TK XOR_TK REM_TK NEQ_TK
7f10c2e2 609%token <operator> NEG_TK REL_QM_TK REL_CL_TK NOT_TK LT_TK OCB_TK CCB_TK
5e942c50 610%token <operator> OP_TK OSB_TK DOT_TK THROW_TK INSTANCEOF_TK
e35b68b0 611%type <operator> THIS_TK SUPER_TK RETURN_TK BREAK_TK CONTINUE_TK
b9f7e36c 612%type <operator> CASE_TK DEFAULT_TK TRY_TK CATCH_TK SYNCHRONIZED_TK
c6226a7e 613%type <operator> NEW_TK ASSERT_TK
e04a16fb 614
e35b68b0
AD		 615%type <node> method_body
616
e04a16fb
AG		 617%type <node> literal INT_LIT_TK FP_LIT_TK BOOL_LIT_TK CHAR_LIT_TK
618 STRING_LIT_TK NULL_TK VOID_TK
619
620%type <node> IF_TK WHILE_TK FOR_TK
621
622%type <node> formal_parameter_list formal_parameter
623 method_declarator method_header
624
e35b68b0 625%type <node> primitive_type reference_type type
e04a16fb
AG		 626 BOOLEAN_TK INTEGRAL_TK FP_TK
627
c2952b01 628/* Added or modified JDK 1.1 rule types */
c7303e41 629%type <node> type_literals
c2952b01 630
e04a16fb
AG		 631%%
632/* 19.2 Production from 2.3: The Syntactic Grammar */
17211ab5 633goal: compilation_unit
e04a16fb
AG		 634 {}
635;
636
637/* 19.3 Productions from 3: Lexical structure */
638literal:
639 INT_LIT_TK
640| FP_LIT_TK
641| BOOL_LIT_TK
642| CHAR_LIT_TK
643| STRING_LIT_TK
644| NULL_TK
645;
646
647/* 19.4 Productions from 4: Types, Values and Variables */
648type:
649 primitive_type
650| reference_type
651;
652
653primitive_type:
654 INTEGRAL_TK
655| FP_TK
656| BOOLEAN_TK
657;
658
659reference_type:
660 class_or_interface_type
661| array_type
662;
663
664class_or_interface_type:
665 name
666;
667
668class_type:
669 class_or_interface_type /* Default rule */
670;
671
672interface_type:
673 class_or_interface_type
674;
675
676array_type:
c7303e41 677 primitive_type dims
e35b68b0 678 {
c7303e41
APB		 679 int osb = pop_current_osb (ctxp);
680 tree t = build_java_array_type (($1), -1);
c7303e41
APB		 681 while (--osb)
682 t = build_unresolved_array_type (t);
683 $$ = t;
684 }
685| name dims
e35b68b0 686 {
c7303e41
APB		 687 int osb = pop_current_osb (ctxp);
688 tree t = $1;
689 while (osb--)
690 t = build_unresolved_array_type (t);
691 $$ = t;
e04a16fb 692 }
e04a16fb
AG		 693;
694
695/* 19.5 Productions from 6: Names */
696name:
697 simple_name /* Default rule */
698| qualified_name /* Default rule */
699;
700
701simple_name:
702 identifier /* Default rule */
703;
704
705qualified_name:
706 name DOT_TK identifier
707 { $$ = make_qualified_name ($1, $3, $2.location); }
708;
709
710identifier:
711 ID_TK
712;
713
714/* 19.6: Production from 7: Packages */
715compilation_unit:
716 {$$ = NULL;}
717| package_declaration
718| import_declarations
719| type_declarations
720| package_declaration import_declarations
721| package_declaration type_declarations
722| import_declarations type_declarations
723| package_declaration import_declarations type_declarations
724;
725
726import_declarations:
727 import_declaration
728 {
729 $$ = NULL;
730 }
731| import_declarations import_declaration
732 {
733 $$ = NULL;
734 }
735;
736
737type_declarations:
738 type_declaration
739| type_declarations type_declaration
740;
741
742package_declaration:
743 PACKAGE_TK name SC_TK
e35b68b0 744 {
ee07f4f4 745 ctxp->package = EXPR_WFL_NODE ($2);
9a7ab4b3 746 register_package (ctxp->package);
ee07f4f4 747 }
e04a16fb
AG		 748| PACKAGE_TK error
749 {yyerror ("Missing name"); RECOVER;}
750| PACKAGE_TK name error
751 {yyerror ("';' expected"); RECOVER;}
752;
753
754import_declaration:
755 single_type_import_declaration
756| type_import_on_demand_declaration
757;
758
759single_type_import_declaration:
760 IMPORT_TK name SC_TK
761 {
9a7ab4b3 762 tree name = EXPR_WFL_NODE ($2), last_name;
e04a16fb 763 int i = IDENTIFIER_LENGTH (name)-1;
49f48c71 764 const char *last = &IDENTIFIER_POINTER (name)[i];
e04a16fb
AG		 765 while (last != IDENTIFIER_POINTER (name))
766 {
767 if (last [0] == '.')
768 break;
769 last--;
770 }
771 last_name = get_identifier (++last);
772 if (IS_A_SINGLE_IMPORT_CLASSFILE_NAME_P (last_name))
773 {
774 tree err = find_name_in_single_imports (last_name);
775 if (err && err != name)
776 parse_error_context
777 ($2, "Ambiguous class: `%s' and `%s'",
e35b68b0 778 IDENTIFIER_POINTER (name),
e04a16fb 779 IDENTIFIER_POINTER (err));
5e942c50 780 else
9a7ab4b3 781 REGISTER_IMPORT ($2, last_name);
e04a16fb
AG		 782 }
783 else
5e942c50 784 REGISTER_IMPORT ($2, last_name);
e04a16fb
AG		 785 }
786| IMPORT_TK error
787 {yyerror ("Missing name"); RECOVER;}
788| IMPORT_TK name error
789 {yyerror ("';' expected"); RECOVER;}
790;
791
792type_import_on_demand_declaration:
793 IMPORT_TK name DOT_TK MULT_TK SC_TK
794 {
795 tree name = EXPR_WFL_NODE ($2);
4a70e37e
APB		 796 tree it;
797 /* Search for duplicates. */
798 for (it = ctxp->import_demand_list; it; it = TREE_CHAIN (it))
799 if (EXPR_WFL_NODE (TREE_PURPOSE (it)) == name)
800 break;
801 /* Don't import the same thing more than once, just ignore
802 duplicates (7.5.2) */
803 if (! it)
ba179f9f 804 {
ba179f9f 805 read_import_dir ($2);
e35b68b0 806 ctxp->import_demand_list =
9a7ab4b3
APB		 807 chainon (ctxp->import_demand_list,
808 build_tree_list ($2, NULL_TREE));
ba179f9f 809 }
e04a16fb
AG		 810 }
811| IMPORT_TK name DOT_TK error
812 {yyerror ("'*' expected"); RECOVER;}
813| IMPORT_TK name DOT_TK MULT_TK error
814 {yyerror ("';' expected"); RECOVER;}
815;
816
817type_declaration:
818 class_declaration
c2952b01 819 { end_class_declaration (0); }
e04a16fb 820| interface_declaration
c2952b01 821 { end_class_declaration (0); }
5f1c312a 822| empty_statement
e04a16fb
AG		 823| error
824 {
825 YYERROR_NOW;
826 yyerror ("Class or interface declaration expected");
827 }
828;
829
830/* 19.7 Shortened from the original:
831 modifiers: modifier | modifiers modifier
832 modifier: any of public... */
833modifiers:
834 MODIFIER_TK
835 {
836 $$ = (1 << $1);
837 }
838| modifiers MODIFIER_TK
839 {
840 int acc = (1 << $2);
841 if ($$ & acc)
e35b68b0 842 parse_error_context
e04a16fb
AG		 843 (ctxp->modifier_ctx [$2], "Modifier `%s' declared twice",
844 java_accstring_lookup (acc));
845 else
846 {
847 $$ |= acc;
848 }
849 }
850;
851
852/* 19.8.1 Production from $8.1: Class Declaration */
853class_declaration:
854 modifiers CLASS_TK identifier super interfaces
855 { create_class ($1, $3, $4, $5); }
856 class_body
6d61f1bd 857 {;}
e35b68b0 858| CLASS_TK identifier super interfaces
e04a16fb
AG		 859 { create_class (0, $2, $3, $4); }
860 class_body
6d61f1bd 861 {;}
e04a16fb 862| modifiers CLASS_TK error
6d61f1bd 863 { yyerror ("Missing class name"); RECOVER; }
e04a16fb 864| CLASS_TK error
6d61f1bd 865 { yyerror ("Missing class name"); RECOVER; }
e04a16fb 866| CLASS_TK identifier error
0b4d333e 867 {
e35b68b0 868 if (!ctxp->class_err) yyerror ("'{' expected");
0b4d333e
APB		 869 DRECOVER(class1);
870 }
e04a16fb 871| modifiers CLASS_TK identifier error
6d61f1bd 872 { if (!ctxp->class_err) yyerror ("'{' expected"); RECOVER; }
e04a16fb
AG		 873;
874
875super:
876 { $$ = NULL; }
877| EXTENDS_TK class_type
878 { $$ = $2; }
879| EXTENDS_TK class_type error
880 {yyerror ("'{' expected"); ctxp->class_err=1;}
881| EXTENDS_TK error
882 {yyerror ("Missing super class name"); ctxp->class_err=1;}
883;
884
885interfaces:
886 { $$ = NULL_TREE; }
887| IMPLEMENTS_TK interface_type_list
888 { $$ = $2; }
889| IMPLEMENTS_TK error
890 {
891 ctxp->class_err=1;
e35b68b0 892 yyerror ("Missing interface name");
e04a16fb
AG		 893 }
894;
895
896interface_type_list:
897 interface_type
e35b68b0 898 {
e04a16fb
AG		 899 ctxp->interface_number = 1;
900 $$ = build_tree_list ($1, NULL_TREE);
901 }
902| interface_type_list C_TK interface_type
e35b68b0 903 {
e04a16fb
AG		 904 ctxp->interface_number++;
905 $$ = chainon ($1, build_tree_list ($3, NULL_TREE));
906 }
907| interface_type_list C_TK error
908 {yyerror ("Missing interface name"); RECOVER;}
909;
910
911class_body:
912 OCB_TK CCB_TK
e35b68b0 913 {
7f10c2e2
APB		 914 /* Store the location of the `}' when doing xrefs */
915 if (flag_emit_xref)
9ec819d4 916 DECL_END_SOURCE_LINE (GET_CPC ()) = $2.location;
c2952b01 917 $$ = GET_CPC ();
7f10c2e2 918 }
e04a16fb 919| OCB_TK class_body_declarations CCB_TK
e35b68b0 920 {
7f10c2e2
APB		 921 /* Store the location of the `}' when doing xrefs */
922 if (flag_emit_xref)
9ec819d4 923 DECL_END_SOURCE_LINE (GET_CPC ()) = $3.location;
c2952b01 924 $$ = GET_CPC ();
7f10c2e2 925 }
e04a16fb
AG		 926;
927
928class_body_declarations:
929 class_body_declaration
930| class_body_declarations class_body_declaration
931;
932
933class_body_declaration:
934 class_member_declaration
935| static_initializer
936| constructor_declaration
937| block /* Added, JDK1.1, instance initializer */
c2952b01 938 {
6de9cd9a 939 if (!IS_EMPTY_STMT ($1))
51e23701
APB		 940 {
941 TREE_CHAIN ($1) = CPC_INSTANCE_INITIALIZER_STMT (ctxp);
942 SET_CPC_INSTANCE_INITIALIZER_STMT (ctxp, $1);
943 }
c2952b01 944 }
e04a16fb
AG		 945;
946
947class_member_declaration:
948 field_declaration
949| method_declaration
950| class_declaration /* Added, JDK1.1 inner classes */
c2952b01
APB		 951 { end_class_declaration (1); }
952| interface_declaration /* Added, JDK1.1 inner interfaces */
953 { end_class_declaration (1); }
5f1c312a 954| empty_statement
e04a16fb
AG		 955;
956
957/* 19.8.2 Productions from 8.3: Field Declarations */
958field_declaration:
959 type variable_declarators SC_TK
960 { register_fields (0, $1, $2); }
961| modifiers type variable_declarators SC_TK
962 {
e35b68b0 963 check_modifiers
e04a16fb
AG		 964 ("Illegal modifier `%s' for field declaration",
965 $1, FIELD_MODIFIERS);
966 check_modifiers_consistency ($1);
967 register_fields ($1, $2, $3);
968 }
969;
970
971variable_declarators:
972 /* Should we use build_decl_list () instead ? FIXME */
973 variable_declarator /* Default rule */
974| variable_declarators C_TK variable_declarator
975 { $$ = chainon ($1, $3); }
976| variable_declarators C_TK error
977 {yyerror ("Missing term"); RECOVER;}
978;
979
980variable_declarator:
981 variable_declarator_id
982 { $$ = build_tree_list ($1, NULL_TREE); }
983| variable_declarator_id ASSIGN_TK variable_initializer
e35b68b0 984 {
e04a16fb
AG		 985 if (java_error_count)
986 $3 = NULL_TREE;
e35b68b0 987 $$ = build_tree_list
e04a16fb
AG		 988 ($1, build_assignment ($2.token, $2.location, $1, $3));
989 }
990| variable_declarator_id ASSIGN_TK error
991 {
992 yyerror ("Missing variable initializer");
993 $$ = build_tree_list ($1, NULL_TREE);
994 RECOVER;
995 }
996| variable_declarator_id ASSIGN_TK variable_initializer error
997 {
998 yyerror ("';' expected");
999 $$ = build_tree_list ($1, NULL_TREE);
1000 RECOVER;
1001 }
1002;
1003
1004variable_declarator_id:
1005 identifier
1006| variable_declarator_id OSB_TK CSB_TK
c583dd46 1007 { $$ = build_unresolved_array_type ($1); }
e04a16fb
AG		 1008| identifier error
1009 {yyerror ("Invalid declaration"); DRECOVER(vdi);}
1010| variable_declarator_id OSB_TK error
e35b68b0 1011 {
8f6d2e96 1012 yyerror ("']' expected");
29f8b718
APB		 1013 DRECOVER(vdi);
1014 }
e04a16fb
AG		 1015| variable_declarator_id CSB_TK error
1016 {yyerror ("Unbalanced ']'"); DRECOVER(vdi);}
1017;
1018
1019variable_initializer:
1020 expression
1021| array_initializer
e04a16fb
AG		 1022;
1023
1024/* 19.8.3 Productions from 8.4: Method Declarations */
1025method_declaration:
e35b68b0 1026 method_header
e04a16fb
AG		 1027 {
1028 current_function_decl = $1;
c2952b01
APB		 1029 if (current_function_decl
1030 && TREE_CODE (current_function_decl) == FUNCTION_DECL)
1031 source_start_java_method (current_function_decl);
1032 else
1033 current_function_decl = NULL_TREE;
e04a16fb
AG		 1034 }
1035 method_body
b635eb2f 1036 { finish_method_declaration ($3); }
e04a16fb
AG		 1037| method_header error
1038 {YYNOT_TWICE yyerror ("'{' expected"); RECOVER;}
1039;
1040
e35b68b0 1041method_header:
e04a16fb 1042 type method_declarator throws
b9f7e36c 1043 { $$ = method_header (0, $1, $2, $3); }
e04a16fb 1044| VOID_TK method_declarator throws
b9f7e36c 1045 { $$ = method_header (0, void_type_node, $2, $3); }
e04a16fb 1046| modifiers type method_declarator throws
b9f7e36c 1047 { $$ = method_header ($1, $2, $3, $4); }
e04a16fb 1048| modifiers VOID_TK method_declarator throws
b9f7e36c 1049 { $$ = method_header ($1, void_type_node, $3, $4); }
e04a16fb 1050| type error
efa0a23f
APB		 1051 {
1052 yyerror ("Invalid method declaration, method name required");
1053 RECOVER;
1054 }
e04a16fb 1055| modifiers type error
950ac1d3
TT		 1056 {
1057 yyerror ("Identifier expected");
1058 RECOVER;
1059 }
e04a16fb 1060| VOID_TK error
950ac1d3
TT		 1061 {
1062 yyerror ("Identifier expected");
1063 RECOVER;
1064 }
e04a16fb 1065| modifiers VOID_TK error
950ac1d3
TT		 1066 {
1067 yyerror ("Identifier expected");
1068 RECOVER;
1069 }
e04a16fb
AG		 1070| modifiers error
1071 {
1072 yyerror ("Invalid method declaration, return type required");
1073 RECOVER;
1074 }
1075;
1076
1077method_declarator:
1078 identifier OP_TK CP_TK
e35b68b0 1079 {
c2952b01
APB		 1080 ctxp->formal_parameter_number = 0;
1081 $$ = method_declarator ($1, NULL_TREE);
1082 }
e04a16fb
AG		 1083| identifier OP_TK formal_parameter_list CP_TK
1084 { $$ = method_declarator ($1, $3); }
1085| method_declarator OSB_TK CSB_TK
1086 {
9ec819d4 1087 SET_EXPR_LOCATION_FROM_TOKEN (wfl_operator, $2);
e35b68b0 1088 TREE_PURPOSE ($1) =
1886c9d8 1089 build_unresolved_array_type (TREE_PURPOSE ($1));
e35b68b0
AD		 1090 parse_warning_context
1091 (wfl_operator,
1886c9d8 1092 "Discouraged form of returned type specification");
e04a16fb
AG		 1093 }
1094| identifier OP_TK error
1095 {yyerror ("')' expected"); DRECOVER(method_declarator);}
1096| method_declarator OSB_TK error
1097 {yyerror ("']' expected"); RECOVER;}
1098;
1099
1100formal_parameter_list:
1101 formal_parameter
1102 {
1103 ctxp->formal_parameter_number = 1;
1104 }
1105| formal_parameter_list C_TK formal_parameter
1106 {
1107 ctxp->formal_parameter_number += 1;
1108 $$ = chainon ($1, $3);
1109 }
1110| formal_parameter_list C_TK error
c2952b01 1111 { yyerror ("Missing formal parameter term"); RECOVER; }
e04a16fb
AG		 1112;
1113
1114formal_parameter:
1115 type variable_declarator_id
1116 {
1117 $$ = build_tree_list ($2, $1);
1118 }
18990de5 1119| final type variable_declarator_id /* Added, JDK1.1 final parms */
e35b68b0 1120 {
5256aa37 1121 $$ = build_tree_list ($3, $2);
c2952b01 1122 ARG_FINAL_P ($$) = 1;
5256aa37 1123 }
e04a16fb 1124| type error
f8989a66
APB		 1125 {
1126 yyerror ("Missing identifier"); RECOVER;
1127 $$ = NULL_TREE;
1128 }
18990de5 1129| final type error
e04a16fb 1130 {
e04a16fb 1131 yyerror ("Missing identifier"); RECOVER;
f8989a66 1132 $$ = NULL_TREE;
e04a16fb
AG		 1133 }
1134;
1135
18990de5
JB		 1136final:
1137 modifiers
1138 {
1139 check_modifiers ("Illegal modifier `%s'. Only `final' was expected here",
1140 $1, ACC_FINAL);
1141 if ($1 != ACC_FINAL)
1142 MODIFIER_WFL (FINAL_TK) = build_wfl_node (NULL_TREE);
1143 }
1144;
1145
e04a16fb 1146throws:
b9f7e36c 1147 { $$ = NULL_TREE; }
e04a16fb 1148| THROWS_TK class_type_list
b9f7e36c 1149 { $$ = $2; }
e04a16fb
AG		 1150| THROWS_TK error
1151 {yyerror ("Missing class type term"); RECOVER;}
1152;
1153
1154class_type_list:
1155 class_type
c877974e 1156 { $$ = build_tree_list ($1, $1); }
e04a16fb 1157| class_type_list C_TK class_type
c877974e 1158 { $$ = tree_cons ($3, $3, $1); }
e04a16fb
AG		 1159| class_type_list C_TK error
1160 {yyerror ("Missing class type term"); RECOVER;}
1161;
1162
1163method_body:
1164 block
5f1c312a 1165| SC_TK { $$ = NULL_TREE; }
e04a16fb
AG		 1166;
1167
1168/* 19.8.4 Productions from 8.5: Static Initializers */
1169static_initializer:
1170 static block
1171 {
c2952b01
APB		 1172 TREE_CHAIN ($2) = CPC_STATIC_INITIALIZER_STMT (ctxp);
1173 SET_CPC_STATIC_INITIALIZER_STMT (ctxp, $2);
dba41d30 1174 current_static_block = NULL_TREE;
e04a16fb 1175 }
e04a16fb
AG		 1176;
1177
1178static: /* Test lval.sub_token here */
c2952b01 1179 modifiers
e04a16fb 1180 {
c2952b01
APB		 1181 check_modifiers ("Illegal modifier `%s' for static initializer", $1, ACC_STATIC);
1182 /* Can't have a static initializer in an innerclass */
1183 if ($1 | ACC_STATIC &&
1184 GET_CPC_LIST () && !TOPLEVEL_CLASS_DECL_P (GET_CPC ()))
e35b68b0 1185 parse_error_context
c2952b01
APB		 1186 (MODIFIER_WFL (STATIC_TK),
1187 "Can't define static initializer in class `%s'. Static initializer can only be defined in top-level classes",
1188 IDENTIFIER_POINTER (DECL_NAME (GET_CPC ())));
e04a16fb
AG		 1189 SOURCE_FRONTEND_DEBUG (("Modifiers: %d", $1));
1190 }
1191;
1192
1193/* 19.8.5 Productions from 8.6: Constructor Declarations */
e04a16fb 1194constructor_declaration:
22eed1e6 1195 constructor_header
e04a16fb 1196 {
22eed1e6
APB		 1197 current_function_decl = $1;
1198 source_start_java_method (current_function_decl);
e04a16fb 1199 }
22eed1e6 1200 constructor_body
b635eb2f 1201 { finish_method_declaration ($3); }
22eed1e6
APB		 1202;
1203
1204constructor_header:
1205 constructor_declarator throws
1206 { $$ = method_header (0, NULL_TREE, $1, $2); }
1207| modifiers constructor_declarator throws
1208 { $$ = method_header ($1, NULL_TREE, $2, $3); }
e04a16fb
AG		 1209;
1210
1211constructor_declarator:
1212 simple_name OP_TK CP_TK
e35b68b0
AD		 1213 {
1214 ctxp->formal_parameter_number = 0;
c2952b01
APB		 1215 $$ = method_declarator ($1, NULL_TREE);
1216 }
e04a16fb 1217| simple_name OP_TK formal_parameter_list CP_TK
22eed1e6 1218 { $$ = method_declarator ($1, $3); }
e04a16fb
AG		 1219;
1220
1221constructor_body:
22eed1e6
APB		 1222 /* Unlike regular method, we always need a complete (empty)
1223 body so we can safely perform all the required code
1224 addition (super invocation and field initialization) */
2e5eb5c5 1225 block_begin constructor_block_end
e35b68b0 1226 {
6de9cd9a 1227 BLOCK_EXPR_BODY ($2) = build_java_empty_stmt ();
22eed1e6
APB		 1228 $$ = $2;
1229 }
2e5eb5c5 1230| block_begin explicit_constructor_invocation constructor_block_end
22eed1e6 1231 { $$ = $3; }
2e5eb5c5 1232| block_begin block_statements constructor_block_end
22eed1e6 1233 { $$ = $3; }
2e5eb5c5 1234| block_begin explicit_constructor_invocation block_statements constructor_block_end
22eed1e6 1235 { $$ = $4; }
e04a16fb
AG		 1236;
1237
2e5eb5c5
APB		 1238constructor_block_end:
1239 block_end
5f1c312a 1240;
2e5eb5c5 1241
e04a16fb
AG		 1242/* Error recovery for that rule moved down expression_statement: rule. */
1243explicit_constructor_invocation:
1244 this_or_super OP_TK CP_TK SC_TK
e35b68b0
AD		 1245 {
1246 $$ = build_method_invocation ($1, NULL_TREE);
22eed1e6
APB		 1247 $$ = build_debugable_stmt (EXPR_WFL_LINECOL ($1), $$);
1248 $$ = java_method_add_stmt (current_function_decl, $$);
1249 }
e04a16fb 1250| this_or_super OP_TK argument_list CP_TK SC_TK
e35b68b0
AD		 1251 {
1252 $$ = build_method_invocation ($1, $3);
22eed1e6
APB		 1253 $$ = build_debugable_stmt (EXPR_WFL_LINECOL ($1), $$);
1254 $$ = java_method_add_stmt (current_function_decl, $$);
1255 }
e04a16fb
AG		 1256 /* Added, JDK1.1 inner classes. Modified because the rule
1257 'primary' couldn't work. */
1258| name DOT_TK SUPER_TK OP_TK argument_list CP_TK SC_TK
b67d701b 1259 {$$ = parse_jdk1_1_error ("explicit constructor invocation"); }
e04a16fb 1260| name DOT_TK SUPER_TK OP_TK CP_TK SC_TK
b67d701b 1261 {$$ = parse_jdk1_1_error ("explicit constructor invocation"); }
e04a16fb
AG		 1262;
1263
1264this_or_super: /* Added, simplifies error diagnostics */
1265 THIS_TK
1266 {
9ee9b555 1267 tree wfl = build_wfl_node (this_identifier_node);
9ec819d4 1268 SET_EXPR_LOCATION_FROM_TOKEN (wfl, $1);
e04a16fb
AG		 1269 $$ = wfl;
1270 }
1271| SUPER_TK
1272 {
9ee9b555 1273 tree wfl = build_wfl_node (super_identifier_node);
9ec819d4 1274 SET_EXPR_LOCATION_FROM_TOKEN (wfl, $1);
e04a16fb
AG		 1275 $$ = wfl;
1276 }
1277;
1278
1279/* 19.9 Productions from 9: Interfaces */
1280/* 19.9.1 Productions from 9.1: Interfaces Declarations */
1281interface_declaration:
1282 INTERFACE_TK identifier
1283 { create_interface (0, $2, NULL_TREE); }
1284 interface_body
6d61f1bd 1285 { ; }
e04a16fb
AG		 1286| modifiers INTERFACE_TK identifier
1287 { create_interface ($1, $3, NULL_TREE); }
1288 interface_body
6d61f1bd 1289 { ; }
e04a16fb
AG		 1290| INTERFACE_TK identifier extends_interfaces
1291 { create_interface (0, $2, $3); }
1292 interface_body
6d61f1bd 1293 { ; }
e04a16fb
AG		 1294| modifiers INTERFACE_TK identifier extends_interfaces
1295 { create_interface ($1, $3, $4); }
1296 interface_body
6d61f1bd 1297 { ; }
e04a16fb 1298| INTERFACE_TK identifier error
6d61f1bd 1299 { yyerror ("'{' expected"); RECOVER; }
e04a16fb 1300| modifiers INTERFACE_TK identifier error
6d61f1bd 1301 { yyerror ("'{' expected"); RECOVER; }
e04a16fb
AG		 1302;
1303
1304extends_interfaces:
1305 EXTENDS_TK interface_type
e35b68b0 1306 {
e04a16fb
AG		 1307 ctxp->interface_number = 1;
1308 $$ = build_tree_list ($2, NULL_TREE);
1309 }
1310| extends_interfaces C_TK interface_type
e35b68b0 1311 {
e04a16fb
AG		 1312 ctxp->interface_number++;
1313 $$ = chainon ($1, build_tree_list ($3, NULL_TREE));
1314 }
1315| EXTENDS_TK error
1316 {yyerror ("Invalid interface type"); RECOVER;}
1317| extends_interfaces C_TK error
1318 {yyerror ("Missing term"); RECOVER;}
1319;
1320
1321interface_body:
1322 OCB_TK CCB_TK
1323 { $$ = NULL_TREE; }
1324| OCB_TK interface_member_declarations CCB_TK
1325 { $$ = NULL_TREE; }
1326;
1327
1328interface_member_declarations:
1329 interface_member_declaration
1330| interface_member_declarations interface_member_declaration
1331;
1332
1333interface_member_declaration:
1334 constant_declaration
1335| abstract_method_declaration
1336| class_declaration /* Added, JDK1.1 inner classes */
c2952b01
APB		 1337 { end_class_declaration (1); }
1338| interface_declaration /* Added, JDK1.1 inner interfaces */
1339 { end_class_declaration (1); }
e04a16fb
AG		 1340;
1341
1342constant_declaration:
1343 field_declaration
1344;
1345
1346abstract_method_declaration:
1347 method_header SC_TK
e35b68b0 1348 {
e04a16fb
AG		 1349 check_abstract_method_header ($1);
1350 current_function_decl = NULL_TREE; /* FIXME ? */
1351 }
1352| method_header error
1353 {yyerror ("';' expected"); RECOVER;}
1354;
1355
1356/* 19.10 Productions from 10: Arrays */
1357array_initializer:
1358 OCB_TK CCB_TK
1179ebc2 1359 { $$ = build_new_array_init ($1.location, NULL_TREE); }
496849ba
APB		 1360| OCB_TK C_TK CCB_TK
1361 { $$ = build_new_array_init ($1.location, NULL_TREE); }
e04a16fb 1362| OCB_TK variable_initializers CCB_TK
f8976021 1363 { $$ = build_new_array_init ($1.location, $2); }
e04a16fb 1364| OCB_TK variable_initializers C_TK CCB_TK
f8976021 1365 { $$ = build_new_array_init ($1.location, $2); }
e04a16fb
AG		 1366;
1367
1368variable_initializers:
1369 variable_initializer
e35b68b0
AD		 1370 {
1371 $$ = tree_cons (maybe_build_array_element_wfl ($1),
f8976021
APB		 1372 $1, NULL_TREE);
1373 }
e04a16fb 1374| variable_initializers C_TK variable_initializer
1179ebc2
APB		 1375 {
1376 $$ = tree_cons (maybe_build_array_element_wfl ($3), $3, $1);
1377 }
e04a16fb
AG		 1378| variable_initializers C_TK error
1379 {yyerror ("Missing term"); RECOVER;}
1380;
1381
1382/* 19.11 Production from 14: Blocks and Statements */
1383block:
916b57ce
JS		 1384 block_begin block_end
1385 { $$ = $2; }
22eed1e6
APB		 1386| block_begin block_statements block_end
1387 { $$ = $3; }
1388;
1389
1390block_begin:
1391 OCB_TK
e04a16fb 1392 { enter_block (); }
22eed1e6
APB		 1393;
1394
1395block_end:
e04a16fb 1396 CCB_TK
e35b68b0 1397 {
e04a16fb 1398 maybe_absorb_scoping_blocks ();
7f10c2e2
APB		 1399 /* Store the location of the `}' when doing xrefs */
1400 if (current_function_decl && flag_emit_xref)
9ec819d4 1401 DECL_END_SOURCE_LINE (current_function_decl) = $1.location;
e04a16fb 1402 $$ = exit_block ();
c280e37a 1403 if (!BLOCK_SUBBLOCKS ($$))
6de9cd9a 1404 BLOCK_SUBBLOCKS ($$) = build_java_empty_stmt ();
e04a16fb
AG		 1405 }
1406;
1407
1408block_statements:
1409 block_statement
1410| block_statements block_statement
1411;
1412
1413block_statement:
1414 local_variable_declaration_statement
1415| statement
15fdcfe9 1416 { java_method_add_stmt (current_function_decl, $1); }
c2952b01 1417| class_declaration /* Added, JDK1.1 local classes */
e35b68b0 1418 {
c2952b01
APB		 1419 LOCAL_CLASS_P (TREE_TYPE (GET_CPC ())) = 1;
1420 end_class_declaration (1);
1421 }
e04a16fb
AG		 1422;
1423
1424local_variable_declaration_statement:
1425 local_variable_declaration SC_TK /* Can't catch missing ';' here */
1426;
1427
1428local_variable_declaration:
1429 type variable_declarators
1430 { declare_local_variables (0, $1, $2); }
a003f638 1431| final type variable_declarators /* Added, JDK1.1 final locals */
e04a16fb
AG		 1432 { declare_local_variables ($1, $2, $3); }
1433;
1434
1435statement:
1436 statement_without_trailing_substatement
1437| labeled_statement
e04a16fb 1438| if_then_statement
e04a16fb 1439| if_then_else_statement
e04a16fb 1440| while_statement
e04a16fb 1441| for_statement
cd9643f7 1442 { $$ = exit_block (); }
e04a16fb
AG		 1443;
1444
1445statement_nsi:
1446 statement_without_trailing_substatement
1447| labeled_statement_nsi
e04a16fb 1448| if_then_else_statement_nsi
e04a16fb 1449| while_statement_nsi
e04a16fb 1450| for_statement_nsi
9dd939b2 1451 { $$ = exit_block (); }
e04a16fb
AG		 1452;
1453
1454statement_without_trailing_substatement:
1455 block
e04a16fb 1456| empty_statement
e04a16fb 1457| expression_statement
e04a16fb 1458| switch_statement
e04a16fb 1459| do_statement
e04a16fb 1460| break_statement
e04a16fb 1461| continue_statement
e04a16fb
AG		 1462| return_statement
1463| synchronized_statement
e04a16fb 1464| throw_statement
e04a16fb 1465| try_statement
c6226a7e 1466| assert_statement
e04a16fb
AG		 1467;
1468
1469empty_statement:
1470 SC_TK
e35b68b0
AD		 1471 {
1472 if (flag_extraneous_semicolon
1473 && ! current_static_block
1474 && (! current_function_decl ||
b6e3e1ff
APB		 1475 /* Verify we're not in a inner class declaration */
1476 (GET_CPC () != TYPE_NAME
1477 (DECL_CONTEXT (current_function_decl)))))
e35b68b0 1478
5f1c312a 1479 {
9ec819d4
PB		 1480#ifdef USE_MAPPED_LOCATION
1481 SET_EXPR_LOCATION (wfl_operator, input_location);
1482#else
d479d37f 1483 EXPR_WFL_SET_LINECOL (wfl_operator, input_line, -1);
9ec819d4 1484#endif
5f1c312a
APB		 1485 parse_warning_context (wfl_operator, "An empty declaration is a deprecated feature that should not be used");
1486 }
6de9cd9a 1487 $$ = build_java_empty_stmt ();
5f1c312a 1488 }
e04a16fb
AG		 1489;
1490
1491label_decl:
1492 identifier REL_CL_TK
1493 {
e35b68b0 1494 $$ = build_labeled_block (EXPR_WFL_LINECOL ($1),
0a2138e2 1495 EXPR_WFL_NODE ($1));
e04a16fb
AG		 1496 pushlevel (2);
1497 push_labeled_block ($$);
1498 PUSH_LABELED_BLOCK ($$);
1499 }
1500;
1501
1502labeled_statement:
1503 label_decl statement
b635eb2f 1504 { $$ = finish_labeled_statement ($1, $2); }
e04a16fb
AG		 1505| identifier error
1506 {yyerror ("':' expected"); RECOVER;}
1507;
1508
1509labeled_statement_nsi:
1510 label_decl statement_nsi
b635eb2f 1511 { $$ = finish_labeled_statement ($1, $2); }
e04a16fb
AG		 1512;
1513
1514/* We concentrate here a bunch of error handling rules that we couldn't write
1515 earlier, because expression_statement catches a missing ';'. */
1516expression_statement:
1517 statement_expression SC_TK
1518 {
1519 /* We have a statement. Generate a WFL around it so
1520 we can debug it */
9ec819d4
PB		 1521#ifdef USE_MAPPED_LOCATION
1522 $$ = expr_add_location ($1, input_location, 1);
1523#else
d479d37f 1524 $$ = build_expr_wfl ($1, input_filename, input_line, 0);
9ec819d4
PB		 1525 JAVA_MAYBE_GENERATE_DEBUG_INFO ($$);
1526#endif
e04a16fb
AG		 1527 /* We know we have a statement, so set the debug
1528 info to be eventually generate here. */
e04a16fb 1529 }
e35b68b0 1530| error SC_TK
e04a16fb 1531 {
29f8b718 1532 YYNOT_TWICE yyerror ("Invalid expression statement");
e04a16fb
AG		 1533 DRECOVER (expr_stmt);
1534 }
1535| error OCB_TK
1536 {
29f8b718 1537 YYNOT_TWICE yyerror ("Invalid expression statement");
e04a16fb
AG		 1538 DRECOVER (expr_stmt);
1539 }
1540| error CCB_TK
1541 {
29f8b718 1542 YYNOT_TWICE yyerror ("Invalid expression statement");
e04a16fb
AG		 1543 DRECOVER (expr_stmt);
1544 }
1545| this_or_super OP_TK error
1546 {yyerror ("')' expected"); RECOVER;}
1547| this_or_super OP_TK CP_TK error
22eed1e6 1548 {
8119c720 1549 parse_ctor_invocation_error ();
22eed1e6
APB		 1550 RECOVER;
1551 }
e04a16fb
AG		 1552| this_or_super OP_TK argument_list error
1553 {yyerror ("')' expected"); RECOVER;}
1554| this_or_super OP_TK argument_list CP_TK error
22eed1e6 1555 {
8119c720 1556 parse_ctor_invocation_error ();
22eed1e6
APB		 1557 RECOVER;
1558 }
e04a16fb
AG		 1559| name DOT_TK SUPER_TK error
1560 {yyerror ("'(' expected"); RECOVER;}
1561| name DOT_TK SUPER_TK OP_TK error
1562 {yyerror ("')' expected"); RECOVER;}
1563| name DOT_TK SUPER_TK OP_TK argument_list error
1564 {yyerror ("')' expected"); RECOVER;}
1565| name DOT_TK SUPER_TK OP_TK argument_list CP_TK error
1566 {yyerror ("';' expected"); RECOVER;}
1567| name DOT_TK SUPER_TK OP_TK CP_TK error
1568 {yyerror ("';' expected"); RECOVER;}
1569;
1570
e35b68b0 1571statement_expression:
e04a16fb
AG		 1572 assignment
1573| pre_increment_expression
e04a16fb 1574| pre_decrement_expression
e04a16fb 1575| post_increment_expression
e04a16fb 1576| post_decrement_expression
e04a16fb
AG		 1577| method_invocation
1578| class_instance_creation_expression
e04a16fb
AG		 1579;
1580
1581if_then_statement:
1582 IF_TK OP_TK expression CP_TK statement
e35b68b0
AD		 1583 {
1584 $$ = build_if_else_statement ($2.location, $3,
2aa11e97
APB		 1585 $5, NULL_TREE);
1586 }
e04a16fb
AG		 1587| IF_TK error
1588 {yyerror ("'(' expected"); RECOVER;}
1589| IF_TK OP_TK error
1590 {yyerror ("Missing term"); RECOVER;}
1591| IF_TK OP_TK expression error
1592 {yyerror ("')' expected"); RECOVER;}
1593;
1594
1595if_then_else_statement:
1596 IF_TK OP_TK expression CP_TK statement_nsi ELSE_TK statement
2aa11e97 1597 { $$ = build_if_else_statement ($2.location, $3, $5, $7); }
e04a16fb
AG		 1598;
1599
1600if_then_else_statement_nsi:
1601 IF_TK OP_TK expression CP_TK statement_nsi ELSE_TK statement_nsi
2aa11e97 1602 { $$ = build_if_else_statement ($2.location, $3, $5, $7); }
e04a16fb
AG		 1603;
1604
1605switch_statement:
15fdcfe9
PB		 1606 switch_expression
1607 {
1608 enter_block ();
1609 }
1610 switch_block
e35b68b0 1611 {
15fdcfe9 1612 /* Make into "proper list" of COMPOUND_EXPRs.
a83f01f0 1613 I.e. make the last statement also have its own
f8976021 1614 COMPOUND_EXPR. */
15fdcfe9
PB		 1615 maybe_absorb_scoping_blocks ();
1616 TREE_OPERAND ($1, 1) = exit_block ();
b67d701b
PB		 1617 $$ = build_debugable_stmt (EXPR_WFL_LINECOL ($1), $1);
1618 }
1619;
1620
1621switch_expression:
1622 SWITCH_TK OP_TK expression CP_TK
e35b68b0 1623 {
dc6d7095
RS		 1624 $$ = build3 (SWITCH_EXPR, NULL_TREE, $3,
1625 NULL_TREE, NULL_TREE);
9ec819d4 1626 SET_EXPR_LOCATION_FROM_TOKEN ($$, $2);
b67d701b 1627 }
e04a16fb
AG		 1628| SWITCH_TK error
1629 {yyerror ("'(' expected"); RECOVER;}
1630| SWITCH_TK OP_TK error
1631 {yyerror ("Missing term or ')'"); DRECOVER(switch_statement);}
1632| SWITCH_TK OP_TK expression CP_TK error
1633 {yyerror ("'{' expected"); RECOVER;}
1634;
1635
f8976021
APB		 1636/* Default assignment is there to avoid type node on switch_block
1637 node. */
1638
e04a16fb
AG		 1639switch_block:
1640 OCB_TK CCB_TK
f8976021 1641 { $$ = NULL_TREE; }
e04a16fb 1642| OCB_TK switch_labels CCB_TK
f8976021 1643 { $$ = NULL_TREE; }
e04a16fb 1644| OCB_TK switch_block_statement_groups CCB_TK
f8976021 1645 { $$ = NULL_TREE; }
e04a16fb 1646| OCB_TK switch_block_statement_groups switch_labels CCB_TK
f8976021 1647 { $$ = NULL_TREE; }
e04a16fb
AG		 1648;
1649
e35b68b0 1650switch_block_statement_groups:
e04a16fb
AG		 1651 switch_block_statement_group
1652| switch_block_statement_groups switch_block_statement_group
1653;
1654
1655switch_block_statement_group:
15fdcfe9 1656 switch_labels block_statements
e04a16fb
AG		 1657;
1658
e04a16fb
AG		 1659switch_labels:
1660 switch_label
1661| switch_labels switch_label
1662;
1663
1664switch_label:
1665 CASE_TK constant_expression REL_CL_TK
e35b68b0 1666 {
15fdcfe9 1667 tree lab = build1 (CASE_EXPR, NULL_TREE, $2);
9ec819d4 1668 SET_EXPR_LOCATION_FROM_TOKEN (lab, $1);
15fdcfe9 1669 java_method_add_stmt (current_function_decl, lab);
b67d701b 1670 }
e04a16fb 1671| DEFAULT_TK REL_CL_TK
e35b68b0 1672 {
4221057e 1673 tree lab = make_node (DEFAULT_EXPR);
9ec819d4 1674 SET_EXPR_LOCATION_FROM_TOKEN (lab, $1);
15fdcfe9 1675 java_method_add_stmt (current_function_decl, lab);
b67d701b 1676 }
e04a16fb
AG		 1677| CASE_TK error
1678 {yyerror ("Missing or invalid constant expression"); RECOVER;}
1679| CASE_TK constant_expression error
1680 {yyerror ("':' expected"); RECOVER;}
1681| DEFAULT_TK error
1682 {yyerror ("':' expected"); RECOVER;}
1683;
1684
1685while_expression:
1686 WHILE_TK OP_TK expression CP_TK
e35b68b0 1687 {
e04a16fb
AG		 1688 tree body = build_loop_body ($2.location, $3, 0);
1689 $$ = build_new_loop (body);
1690 }
1691;
1692
1693while_statement:
1694 while_expression statement
b635eb2f 1695 { $$ = finish_loop_body (0, NULL_TREE, $2, 0); }
e04a16fb
AG		 1696| WHILE_TK error
1697 {YYERROR_NOW; yyerror ("'(' expected"); RECOVER;}
1698| WHILE_TK OP_TK error
1699 {yyerror ("Missing term and ')' expected"); RECOVER;}
1700| WHILE_TK OP_TK expression error
1701 {yyerror ("')' expected"); RECOVER;}
1702;
1703
1704while_statement_nsi:
1705 while_expression statement_nsi
b635eb2f 1706 { $$ = finish_loop_body (0, NULL_TREE, $2, 0); }
e04a16fb
AG		 1707;
1708
1709do_statement_begin:
1710 DO_TK
e35b68b0 1711 {
e04a16fb
AG		 1712 tree body = build_loop_body (0, NULL_TREE, 1);
1713 $$ = build_new_loop (body);
1714 }
1715 /* Need error handing here. FIXME */
1716;
1717
e35b68b0 1718do_statement:
e04a16fb 1719 do_statement_begin statement WHILE_TK OP_TK expression CP_TK SC_TK
b635eb2f 1720 { $$ = finish_loop_body ($4.location, $5, $2, 1); }
e04a16fb
AG		 1721;
1722
1723for_statement:
1724 for_begin SC_TK expression SC_TK for_update CP_TK statement
774d2baf 1725 {
6615c446 1726 if (CONSTANT_CLASS_P ($3))
774d2baf
TT		 1727 $3 = build_wfl_node ($3);
1728 $$ = finish_for_loop (EXPR_WFL_LINECOL ($3), $3, $5, $7);
1729 }
e04a16fb 1730| for_begin SC_TK SC_TK for_update CP_TK statement
e35b68b0 1731 {
b635eb2f 1732 $$ = finish_for_loop (0, NULL_TREE, $4, $6);
e04a16fb 1733 /* We have not condition, so we get rid of the EXIT_EXPR */
e35b68b0 1734 LOOP_EXPR_BODY_CONDITION_EXPR (LOOP_EXPR_BODY ($$), 0) =
6de9cd9a 1735 build_java_empty_stmt ();
e04a16fb
AG		 1736 }
1737| for_begin SC_TK error
1738 {yyerror ("Invalid control expression"); RECOVER;}
1739| for_begin SC_TK expression SC_TK error
1740 {yyerror ("Invalid update expression"); RECOVER;}
1741| for_begin SC_TK SC_TK error
1742 {yyerror ("Invalid update expression"); RECOVER;}
1743;
1744
1745for_statement_nsi:
1746 for_begin SC_TK expression SC_TK for_update CP_TK statement_nsi
b635eb2f 1747 { $$ = finish_for_loop (EXPR_WFL_LINECOL ($3), $3, $5, $7);}
e04a16fb 1748| for_begin SC_TK SC_TK for_update CP_TK statement_nsi
e35b68b0 1749 {
b635eb2f 1750 $$ = finish_for_loop (0, NULL_TREE, $4, $6);
e04a16fb 1751 /* We have not condition, so we get rid of the EXIT_EXPR */
e35b68b0 1752 LOOP_EXPR_BODY_CONDITION_EXPR (LOOP_EXPR_BODY ($$), 0) =
6de9cd9a 1753 build_java_empty_stmt ();
e04a16fb
AG		 1754 }
1755;
1756
1757for_header:
1758 FOR_TK OP_TK
e35b68b0 1759 {
e04a16fb
AG		 1760 /* This scope defined for local variable that may be
1761 defined within the scope of the for loop */
e35b68b0 1762 enter_block ();
e04a16fb
AG		 1763 }
1764| FOR_TK error
1765 {yyerror ("'(' expected"); DRECOVER(for_1);}
1766| FOR_TK OP_TK error
1767 {yyerror ("Invalid init statement"); RECOVER;}
1768;
1769
1770for_begin:
1771 for_header for_init
e35b68b0 1772 {
e04a16fb
AG		 1773 /* We now declare the loop body. The loop is
1774 declared as a for loop. */
1775 tree body = build_loop_body (0, NULL_TREE, 0);
1776 $$ = build_new_loop (body);
c2952b01 1777 FOR_LOOP_P ($$) = 1;
e04a16fb
AG		 1778 /* The loop is added to the current block the for
1779 statement is defined within */
1780 java_method_add_stmt (current_function_decl, $$);
1781 }
1782;
1783for_init: /* Can be empty */
6de9cd9a 1784 { $$ = build_java_empty_stmt (); }
e04a16fb 1785| statement_expression_list
e35b68b0 1786 {
e04a16fb
AG		 1787 /* Init statement recorded within the previously
1788 defined block scope */
1789 $$ = java_method_add_stmt (current_function_decl, $1);
1790 }
1791| local_variable_declaration
e35b68b0 1792 {
e04a16fb
AG		 1793 /* Local variable are recorded within the previously
1794 defined block scope */
1795 $$ = NULL_TREE;
1796 }
1797| statement_expression_list error
1798 {yyerror ("';' expected"); DRECOVER(for_init_1);}
1799;
1800
1801for_update: /* Can be empty */
6de9cd9a 1802 {$$ = build_java_empty_stmt ();}
e04a16fb
AG		 1803| statement_expression_list
1804 { $$ = build_debugable_stmt (BUILD_LOCATION (), $1); }
1805;
1806
1807statement_expression_list:
1808 statement_expression
1809 { $$ = add_stmt_to_compound (NULL_TREE, NULL_TREE, $1); }
1810| statement_expression_list C_TK statement_expression
1811 { $$ = add_stmt_to_compound ($1, NULL_TREE, $3); }
1812| statement_expression_list C_TK error
1813 {yyerror ("Missing term"); RECOVER;}
1814;
1815
1816break_statement:
1817 BREAK_TK SC_TK
1818 { $$ = build_bc_statement ($1.location, 1, NULL_TREE); }
1819| BREAK_TK identifier SC_TK
1820 { $$ = build_bc_statement ($1.location, 1, $2); }
1821| BREAK_TK error
1822 {yyerror ("Missing term"); RECOVER;}
1823| BREAK_TK identifier error
1824 {yyerror ("';' expected"); RECOVER;}
1825;
1826
1827continue_statement:
1828 CONTINUE_TK SC_TK
1829 { $$ = build_bc_statement ($1.location, 0, NULL_TREE); }
1830| CONTINUE_TK identifier SC_TK
1831 { $$ = build_bc_statement ($1.location, 0, $2); }
1832| CONTINUE_TK error
1833 {yyerror ("Missing term"); RECOVER;}
1834| CONTINUE_TK identifier error
1835 {yyerror ("';' expected"); RECOVER;}
1836;
1837
1838return_statement:
1839 RETURN_TK SC_TK
1840 { $$ = build_return ($1.location, NULL_TREE); }
1841| RETURN_TK expression SC_TK
1842 { $$ = build_return ($1.location, $2); }
1843| RETURN_TK error
1844 {yyerror ("Missing term"); RECOVER;}
1845| RETURN_TK expression error
1846 {yyerror ("';' expected"); RECOVER;}
1847;
1848
1849throw_statement:
1850 THROW_TK expression SC_TK
e35b68b0 1851 {
b9f7e36c 1852 $$ = build1 (THROW_EXPR, NULL_TREE, $2);
9ec819d4 1853 SET_EXPR_LOCATION_FROM_TOKEN ($$, $1);
b9f7e36c 1854 }
e04a16fb
AG		 1855| THROW_TK error
1856 {yyerror ("Missing term"); RECOVER;}
1857| THROW_TK expression error
1858 {yyerror ("';' expected"); RECOVER;}
1859;
1860
c6226a7e
TT		 1861assert_statement:
1862 ASSERT_TK expression REL_CL_TK expression SC_TK
1863 {
1864 $$ = build_assertion ($1.location, $2, $4);
1865 }
1866| ASSERT_TK expression SC_TK
1867 {
1868 $$ = build_assertion ($1.location, $2, NULL_TREE);
1869 }
1870| ASSERT_TK error
1871 {yyerror ("Missing term"); RECOVER;}
1872| ASSERT_TK expression error
1873 {yyerror ("';' expected"); RECOVER;}
1874;
1875
e04a16fb
AG		 1876synchronized_statement:
1877 synchronized OP_TK expression CP_TK block
e35b68b0 1878 {
dc6d7095 1879 $$ = build2 (SYNCHRONIZED_EXPR, NULL_TREE, $3, $5);
e35b68b0 1880 EXPR_WFL_LINECOL ($$) =
b9f7e36c
APB		 1881 EXPR_WFL_LINECOL (MODIFIER_WFL (SYNCHRONIZED_TK));
1882 }
e04a16fb
AG		 1883| synchronized OP_TK expression CP_TK error
1884 {yyerror ("'{' expected"); RECOVER;}
1885| synchronized error
1886 {yyerror ("'(' expected"); RECOVER;}
1887| synchronized OP_TK error CP_TK
1888 {yyerror ("Missing term"); RECOVER;}
1889| synchronized OP_TK error
1890 {yyerror ("Missing term"); RECOVER;}
1891;
1892
b9f7e36c 1893synchronized:
efa0a23f 1894 modifiers
e04a16fb 1895 {
781b0558
KG		 1896 check_modifiers (
1897 "Illegal modifier `%s'. Only `synchronized' was expected here",
efa0a23f
APB		 1898 $1, ACC_SYNCHRONIZED);
1899 if ($1 != ACC_SYNCHRONIZED)
e35b68b0 1900 MODIFIER_WFL (SYNCHRONIZED_TK) =
efa0a23f 1901 build_wfl_node (NULL_TREE);
e04a16fb
AG		 1902 }
1903;
1904
1905try_statement:
1906 TRY_TK block catches
a7d8d81f 1907 { $$ = build_try_statement ($1.location, $2, $3); }
e04a16fb 1908| TRY_TK block finally
a7d8d81f 1909 { $$ = build_try_finally_statement ($1.location, $2, $3); }
e04a16fb 1910| TRY_TK block catches finally
e35b68b0 1911 { $$ = build_try_finally_statement
2aa11e97
APB		 1912 ($1.location, build_try_statement ($1.location,
1913 $2, $3), $4);
1914 }
e04a16fb
AG		 1915| TRY_TK error
1916 {yyerror ("'{' expected"); DRECOVER (try_statement);}
1917;
1918
1919catches:
1920 catch_clause
1921| catches catch_clause
e35b68b0 1922 {
b67d701b
PB		 1923 TREE_CHAIN ($2) = $1;
1924 $$ = $2;
1925 }
e04a16fb
AG		 1926;
1927
1928catch_clause:
b67d701b 1929 catch_clause_parameter block
e35b68b0 1930 {
b67d701b
PB		 1931 java_method_add_stmt (current_function_decl, $2);
1932 exit_block ();
1933 $$ = $1;
1934 }
c02ebb18 1935;
b67d701b
PB		 1936
1937catch_clause_parameter:
1938 CATCH_TK OP_TK formal_parameter CP_TK
e35b68b0 1939 {
b67d701b
PB		 1940 /* We add a block to define a scope for
1941 formal_parameter (CCBP). The formal parameter is
1942 declared initialized by the appropriate function
1943 call */
df9fe6e5
AP		 1944 tree ccpb;
1945 tree init;
1946 if ($3)
1947 {
19a4e5b7 1948 ccpb = enter_block ();
df9fe6e5
AP		 1949 init = build_assignment
1950 (ASSIGN_TK, $2.location, TREE_PURPOSE ($3),
dc6d7095 1951 build0 (JAVA_EXC_OBJ_EXPR, ptr_type_node));
df9fe6e5
AP		 1952 declare_local_variables (0, TREE_VALUE ($3),
1953 build_tree_list
1954 (TREE_PURPOSE ($3), init));
6de9cd9a 1955 $$ = build1 (JAVA_CATCH_EXPR, NULL_TREE, ccpb);
9ec819d4 1956 SET_EXPR_LOCATION_FROM_TOKEN ($$, $1);
df9fe6e5
AP		 1957 }
1958 else
1959 {
1960 $$ = error_mark_node;
1961 }
b67d701b 1962 }
e04a16fb 1963| CATCH_TK error
97f30284 1964 {yyerror ("'(' expected"); RECOVER; $$ = NULL_TREE;}
e35b68b0 1965| CATCH_TK OP_TK error
97f30284 1966 {
e35b68b0 1967 yyerror ("Missing term or ')' expected");
97f30284
APB		 1968 RECOVER; $$ = NULL_TREE;
1969 }
b67d701b 1970| CATCH_TK OP_TK error CP_TK /* That's for () */
97f30284 1971 {yyerror ("Missing term"); RECOVER; $$ = NULL_TREE;}
e04a16fb
AG		 1972;
1973
1974finally:
1975 FINALLY_TK block
a7d8d81f 1976 { $$ = $2; }
e04a16fb
AG		 1977| FINALLY_TK error
1978 {yyerror ("'{' expected"); RECOVER; }
1979;
1980
1981/* 19.12 Production from 15: Expressions */
1982primary:
1983 primary_no_new_array
16d85b63
TT		 1984| array_creation_uninitialized
1985| array_creation_initialized
e04a16fb
AG		 1986;
1987
1988primary_no_new_array:
1989 literal
1990| THIS_TK
1991 { $$ = build_this ($1.location); }
1992| OP_TK expression CP_TK
1993 {$$ = $2;}
1994| class_instance_creation_expression
1995| field_access
1996| method_invocation
1997| array_access
c2952b01 1998| type_literals
e04a16fb 1999 /* Added, JDK1.1 inner classes. Documentation is wrong
4dd4c751 2000 referring to a 'ClassName' (class_name) rule that doesn't
c2952b01 2001 exist. Used name: instead. */
e04a16fb 2002| name DOT_TK THIS_TK
e35b68b0 2003 {
c2952b01
APB		 2004 tree wfl = build_wfl_node (this_identifier_node);
2005 $$ = make_qualified_primary ($1, wfl, EXPR_WFL_LINECOL ($1));
2006 }
e35b68b0 2007| OP_TK expression error
e04a16fb
AG		 2008 {yyerror ("')' expected"); RECOVER;}
2009| name DOT_TK error
2010 {yyerror ("'class' or 'this' expected" ); RECOVER;}
2011| primitive_type DOT_TK error
2012 {yyerror ("'class' expected" ); RECOVER;}
2013| VOID_TK DOT_TK error
2014 {yyerror ("'class' expected" ); RECOVER;}
2015;
2016
c2952b01
APB		 2017type_literals:
2018 name DOT_TK CLASS_TK
2019 { $$ = build_incomplete_class_ref ($2.location, $1); }
c7303e41 2020| array_type DOT_TK CLASS_TK
c2952b01
APB		 2021 { $$ = build_incomplete_class_ref ($2.location, $1); }
2022| primitive_type DOT_TK CLASS_TK
12e248d6 2023 { $$ = build_incomplete_class_ref ($2.location, $1); }
c2952b01 2024| VOID_TK DOT_TK CLASS_TK
e35b68b0 2025 {
12e248d6
APB		 2026 $$ = build_incomplete_class_ref ($2.location,
2027 void_type_node);
2028 }
c2952b01
APB		 2029;
2030
e04a16fb
AG		 2031class_instance_creation_expression:
2032 NEW_TK class_type OP_TK argument_list CP_TK
b67d701b 2033 { $$ = build_new_invocation ($2, $4); }
e04a16fb 2034| NEW_TK class_type OP_TK CP_TK
b67d701b 2035 { $$ = build_new_invocation ($2, NULL_TREE); }
c2952b01 2036| anonymous_class_creation
e04a16fb
AG		 2037 /* Added, JDK1.1 inner classes, modified to use name or
2038 primary instead of primary solely which couldn't work in
2039 all situations. */
2040| something_dot_new identifier OP_TK CP_TK
e35b68b0 2041 {
c2952b01 2042 tree ctor = build_new_invocation ($2, NULL_TREE);
e35b68b0 2043 $$ = make_qualified_primary ($1, ctor,
c2952b01
APB		 2044 EXPR_WFL_LINECOL ($1));
2045 }
e04a16fb
AG		 2046| something_dot_new identifier OP_TK CP_TK class_body
2047| something_dot_new identifier OP_TK argument_list CP_TK
e35b68b0 2048 {
c2952b01 2049 tree ctor = build_new_invocation ($2, $4);
e35b68b0 2050 $$ = make_qualified_primary ($1, ctor,
c2952b01
APB		 2051 EXPR_WFL_LINECOL ($1));
2052 }
e04a16fb 2053| something_dot_new identifier OP_TK argument_list CP_TK class_body
e35b68b0 2054| NEW_TK error SC_TK
8d481c2e 2055 {$$ = NULL_TREE; yyerror ("'(' expected"); DRECOVER(new_1);}
e04a16fb 2056| NEW_TK class_type error
8d481c2e 2057 {$$ = NULL_TREE; yyerror ("'(' expected"); RECOVER;}
e04a16fb 2058| NEW_TK class_type OP_TK error
8d481c2e 2059 {$$ = NULL_TREE; yyerror ("')' or term expected"); RECOVER;}
e04a16fb 2060| NEW_TK class_type OP_TK argument_list error
8d481c2e 2061 {$$ = NULL_TREE; yyerror ("')' expected"); RECOVER;}
e04a16fb 2062| something_dot_new error
8d481c2e
TT		 2063 {
2064 $$ = NULL_TREE;
2065 YYERROR_NOW;
2066 yyerror ("Identifier expected");
2067 RECOVER;
2068 }
e04a16fb 2069| something_dot_new identifier error
8d481c2e 2070 {$$ = NULL_TREE; yyerror ("'(' expected"); RECOVER;}
e04a16fb
AG		 2071;
2072
c2952b01
APB		 2073/* Created after JDK1.1 rules originally added to
2074 class_instance_creation_expression, but modified to use
67264b4f 2075 'class_type' instead of 'TypeName' (type_name) which is mentioned
c2952b01
APB		 2076 in the documentation but doesn't exist. */
2077
2078anonymous_class_creation:
e35b68b0 2079 NEW_TK class_type OP_TK argument_list CP_TK
d3ecb597 2080 { create_anonymous_class ($2); }
c2952b01 2081 class_body
e35b68b0 2082 {
c2952b01
APB		 2083 tree id = build_wfl_node (DECL_NAME (GET_CPC ()));
2084 EXPR_WFL_LINECOL (id) = EXPR_WFL_LINECOL ($2);
2085
2086 end_class_declaration (1);
2087
2088 /* Now we can craft the new expression */
2089 $$ = build_new_invocation (id, $4);
2090
2091 /* Note that we can't possibly be here if
2092 `class_type' is an interface (in which case the
2093 anonymous class extends Object and implements
2094 `class_type', hence its constructor can't have
2095 arguments.) */
2096
2097 /* Otherwise, the innerclass must feature a
2098 constructor matching `argument_list'. Anonymous
2099 classes are a bit special: it's impossible to
2100 define constructor for them, hence constructors
2101 must be generated following the hints provided by
2102 the `new' expression. Whether a super constructor
2103 of that nature exists or not is to be verified
e35b68b0 2104 later on in verify_constructor_super.
c2952b01
APB		 2105
2106 It's during the expansion of a `new' statement
4dd4c751 2107 referring to an anonymous class that a ctor will
c2952b01
APB		 2108 be generated for the anonymous class, with the
2109 right arguments. */
2110
2111 }
e35b68b0 2112| NEW_TK class_type OP_TK CP_TK
d3ecb597 2113 { create_anonymous_class ($2); }
e35b68b0
AD		 2114 class_body
2115 {
c2952b01
APB		 2116 tree id = build_wfl_node (DECL_NAME (GET_CPC ()));
2117 EXPR_WFL_LINECOL (id) = EXPR_WFL_LINECOL ($2);
2118
2119 end_class_declaration (1);
2120
2121 /* Now we can craft the new expression. The
2122 statement doesn't need to be remember so that a
2123 constructor can be generated, since its signature
2124 is already known. */
2125 $$ = build_new_invocation (id, NULL_TREE);
2126 }
2127;
2128
e04a16fb
AG		 2129something_dot_new: /* Added, not part of the specs. */
2130 name DOT_TK NEW_TK
c2952b01 2131 { $$ = $1; }
e04a16fb 2132| primary DOT_TK NEW_TK
c2952b01 2133 { $$ = $1; }
e04a16fb
AG		 2134;
2135
2136argument_list:
2137 expression
e35b68b0 2138 {
e04a16fb 2139 $$ = tree_cons (NULL_TREE, $1, NULL_TREE);
e35b68b0 2140 ctxp->formal_parameter_number = 1;
e04a16fb
AG		 2141 }
2142| argument_list C_TK expression
2143 {
2144 ctxp->formal_parameter_number += 1;
2145 $$ = tree_cons (NULL_TREE, $3, $1);
2146 }
2147| argument_list C_TK error
2148 {yyerror ("Missing term"); RECOVER;}
2149;
2150
16d85b63 2151array_creation_uninitialized:
e04a16fb
AG		 2152 NEW_TK primitive_type dim_exprs
2153 { $$ = build_newarray_node ($2, $3, 0); }
2154| NEW_TK class_or_interface_type dim_exprs
2155 { $$ = build_newarray_node ($2, $3, 0); }
2156| NEW_TK primitive_type dim_exprs dims
c7303e41 2157 { $$ = build_newarray_node ($2, $3, pop_current_osb (ctxp));}
e04a16fb 2158| NEW_TK class_or_interface_type dim_exprs dims
c7303e41 2159 { $$ = build_newarray_node ($2, $3, pop_current_osb (ctxp));}
16d85b63
TT		 2160| NEW_TK error CSB_TK
2161 {yyerror ("'[' expected"); DRECOVER ("]");}
2162| NEW_TK error OSB_TK
2163 {yyerror ("']' expected"); RECOVER;}
2164;
2165
2166array_creation_initialized:
e04a16fb
AG		 2167 /* Added, JDK1.1 anonymous array. Initial documentation rule
2168 modified */
16d85b63 2169 NEW_TK class_or_interface_type dims array_initializer
c2952b01
APB		 2170 {
2171 char *sig;
c7303e41
APB		 2172 int osb = pop_current_osb (ctxp);
2173 while (osb--)
2e3b2d2c
APB		 2174 obstack_grow (&temporary_obstack, "[]", 2);
2175 obstack_1grow (&temporary_obstack, '\0');
c2952b01 2176 sig = obstack_finish (&temporary_obstack);
dc6d7095
RS		 2177 $$ = build3 (NEW_ANONYMOUS_ARRAY_EXPR, NULL_TREE,
2178 $2, get_identifier (sig), $4);
c2952b01 2179 }
e04a16fb 2180| NEW_TK primitive_type dims array_initializer
e35b68b0 2181 {
c7303e41 2182 int osb = pop_current_osb (ctxp);
c2952b01 2183 tree type = $2;
c7303e41 2184 while (osb--)
c2952b01 2185 type = build_java_array_type (type, -1);
dc6d7095
RS		 2186 $$ = build3 (NEW_ANONYMOUS_ARRAY_EXPR, NULL_TREE,
2187 build_pointer_type (type), NULL_TREE, $4);
c2952b01 2188 }
e04a16fb
AG		 2189| NEW_TK error CSB_TK
2190 {yyerror ("'[' expected"); DRECOVER ("]");}
2191| NEW_TK error OSB_TK
2192 {yyerror ("']' expected"); RECOVER;}
2193;
2194
2195dim_exprs:
2196 dim_expr
2197 { $$ = build_tree_list (NULL_TREE, $1); }
2198| dim_exprs dim_expr
2199 { $$ = tree_cons (NULL_TREE, $2, $$); }
2200;
2201
2202dim_expr:
2203 OSB_TK expression CSB_TK
e35b68b0 2204 {
9a7ab4b3
APB		 2205 if (JNUMERIC_TYPE_P (TREE_TYPE ($2)))
2206 {
2207 $2 = build_wfl_node ($2);
2208 TREE_TYPE ($2) = NULL_TREE;
2209 }
e04a16fb
AG		 2210 EXPR_WFL_LINECOL ($2) = $1.location;
2211 $$ = $2;
2212 }
2213| OSB_TK expression error
2214 {yyerror ("']' expected"); RECOVER;}
2215| OSB_TK error
2216 {
2217 yyerror ("Missing term");
2218 yyerror ("']' expected");
2219 RECOVER;
2220 }
2221;
2222
e35b68b0 2223dims:
e04a16fb 2224 OSB_TK CSB_TK
e35b68b0 2225 {
ba179f9f
APB		 2226 int allocate = 0;
2227 /* If not initialized, allocate memory for the osb
2228 numbers stack */
2229 if (!ctxp->osb_limit)
2230 {
2231 allocate = ctxp->osb_limit = 32;
2232 ctxp->osb_depth = -1;
2233 }
c2952b01 2234 /* If capacity overflown, reallocate a bigger chunk */
ba179f9f
APB		 2235 else if (ctxp->osb_depth+1 == ctxp->osb_limit)
2236 allocate = ctxp->osb_limit << 1;
e35b68b0 2237
ba179f9f
APB		 2238 if (allocate)
2239 {
2240 allocate *= sizeof (int);
2241 if (ctxp->osb_number)
7048110f
KG		 2242 ctxp->osb_number = xrealloc (ctxp->osb_number,
2243 allocate);
ba179f9f 2244 else
7048110f 2245 ctxp->osb_number = xmalloc (allocate);
ba179f9f
APB		 2246 }
2247 ctxp->osb_depth++;
2248 CURRENT_OSB (ctxp) = 1;
2249 }
e04a16fb 2250| dims OSB_TK CSB_TK
ba179f9f 2251 { CURRENT_OSB (ctxp)++; }
e04a16fb
AG		 2252| dims OSB_TK error
2253 { yyerror ("']' expected"); RECOVER;}
2254;
2255
2256field_access:
2257 primary DOT_TK identifier
2258 { $$ = make_qualified_primary ($1, $3, $2.location); }
e35b68b0 2259 /* FIXME - REWRITE TO:
9bbc7d9f 2260 { $$ = build_binop (COMPONENT_REF, $2.location, $1, $3); } */
e04a16fb
AG		 2261| SUPER_TK DOT_TK identifier
2262 {
6e22695a 2263 tree super_wfl = build_wfl_node (super_identifier_node);
9ec819d4 2264 SET_EXPR_LOCATION_FROM_TOKEN (super_wfl, $1);
e04a16fb
AG		 2265 $$ = make_qualified_name (super_wfl, $3, $2.location);
2266 }
2267| SUPER_TK error
2268 {yyerror ("Field expected"); DRECOVER (super_field_acces);}
2269;
2270
2271method_invocation:
2272 name OP_TK CP_TK
2273 { $$ = build_method_invocation ($1, NULL_TREE); }
2274| name OP_TK argument_list CP_TK
2275 { $$ = build_method_invocation ($1, $3); }
2276| primary DOT_TK identifier OP_TK CP_TK
e35b68b0 2277 {
22eed1e6 2278 if (TREE_CODE ($1) == THIS_EXPR)
e35b68b0 2279 $$ = build_this_super_qualified_invocation
22eed1e6
APB		 2280 (1, $3, NULL_TREE, 0, $2.location);
2281 else
2282 {
2283 tree invok = build_method_invocation ($3, NULL_TREE);
2284 $$ = make_qualified_primary ($1, invok, $2.location);
2285 }
e04a16fb
AG		 2286 }
2287| primary DOT_TK identifier OP_TK argument_list CP_TK
e35b68b0 2288 {
22eed1e6 2289 if (TREE_CODE ($1) == THIS_EXPR)
e35b68b0 2290 $$ = build_this_super_qualified_invocation
22eed1e6
APB		 2291 (1, $3, $5, 0, $2.location);
2292 else
2293 {
2294 tree invok = build_method_invocation ($3, $5);
2295 $$ = make_qualified_primary ($1, invok, $2.location);
2296 }
e04a16fb
AG		 2297 }
2298| SUPER_TK DOT_TK identifier OP_TK CP_TK
e35b68b0
AD		 2299 {
2300 $$ = build_this_super_qualified_invocation
22eed1e6 2301 (0, $3, NULL_TREE, $1.location, $2.location);
e04a16fb
AG		 2302 }
2303| SUPER_TK DOT_TK identifier OP_TK argument_list CP_TK
2304 {
e35b68b0 2305 $$ = build_this_super_qualified_invocation
22eed1e6 2306 (0, $3, $5, $1.location, $2.location);
e04a16fb
AG		 2307 }
2308 /* Screws up thing. I let it here until I'm convinced it can
2309 be removed. FIXME
2310| primary DOT_TK error
2311 {yyerror ("'(' expected"); DRECOVER(bad);} */
2312| SUPER_TK DOT_TK error CP_TK
2313 { yyerror ("'(' expected"); DRECOVER (method_invocation); }
2314| SUPER_TK DOT_TK error DOT_TK
2315 { yyerror ("'(' expected"); DRECOVER (method_invocation); }
2316;
2317
2318array_access:
2319 name OSB_TK expression CSB_TK
2320 { $$ = build_array_ref ($2.location, $1, $3); }
2321| primary_no_new_array OSB_TK expression CSB_TK
2322 { $$ = build_array_ref ($2.location, $1, $3); }
16d85b63
TT		 2323| array_creation_initialized OSB_TK expression CSB_TK
2324 { $$ = build_array_ref ($2.location, $1, $3); }
e04a16fb
AG		 2325| name OSB_TK error
2326 {
2327 yyerror ("Missing term and ']' expected");
2328 DRECOVER(array_access);
2329 }
2330| name OSB_TK expression error
2331 {
2332 yyerror ("']' expected");
2333 DRECOVER(array_access);
2334 }
2335| primary_no_new_array OSB_TK error
2336 {
2337 yyerror ("Missing term and ']' expected");
2338 DRECOVER(array_access);
2339 }
2340| primary_no_new_array OSB_TK expression error
2341 {
2342 yyerror ("']' expected");
2343 DRECOVER(array_access);
2344 }
16d85b63
TT		 2345| array_creation_initialized OSB_TK error
2346 {
2347 yyerror ("Missing term and ']' expected");
2348 DRECOVER(array_access);
2349 }
2350| array_creation_initialized OSB_TK expression error
2351 {
2352 yyerror ("']' expected");
2353 DRECOVER(array_access);
2354 }
e04a16fb
AG		 2355;
2356
2357postfix_expression:
2358 primary
2359| name
2360| post_increment_expression
2361| post_decrement_expression
2362;
2363
2364post_increment_expression:
2365 postfix_expression INCR_TK
2366 { $$ = build_incdec ($2.token, $2.location, $1, 1); }
2367;
2368
2369post_decrement_expression:
2370 postfix_expression DECR_TK
2371 { $$ = build_incdec ($2.token, $2.location, $1, 1); }
2372;
2373
1fa73144 2374trap_overflow_corner_case:
e04a16fb
AG		 2375 pre_increment_expression
2376| pre_decrement_expression
2377| PLUS_TK unary_expression
2378 {$$ = build_unaryop ($1.token, $1.location, $2); }
e04a16fb
AG		 2379| unary_expression_not_plus_minus
2380| PLUS_TK error
2381 {yyerror ("Missing term"); RECOVER}
1fa73144
TT		 2382;
2383
2384unary_expression:
2385 trap_overflow_corner_case
2386 {
8d481c2e
TT		 2387 if ($1)
2388 error_if_numeric_overflow ($1);
1fa73144
TT		 2389 $$ = $1;
2390 }
2391| MINUS_TK trap_overflow_corner_case
2392 {$$ = build_unaryop ($1.token, $1.location, $2); }
e04a16fb
AG		 2393| MINUS_TK error
2394 {yyerror ("Missing term"); RECOVER}
2395;
2396
2397pre_increment_expression:
2398 INCR_TK unary_expression
2399 {$$ = build_incdec ($1.token, $1.location, $2, 0); }
2400| INCR_TK error
2401 {yyerror ("Missing term"); RECOVER}
2402;
2403
2404pre_decrement_expression:
2405 DECR_TK unary_expression
2406 {$$ = build_incdec ($1.token, $1.location, $2, 0); }
2407| DECR_TK error
2408 {yyerror ("Missing term"); RECOVER}
2409;
2410
2411unary_expression_not_plus_minus:
2412 postfix_expression
2413| NOT_TK unary_expression
2414 {$$ = build_unaryop ($1.token, $1.location, $2); }
2415| NEG_TK unary_expression
2416 {$$ = build_unaryop ($1.token, $1.location, $2); }
2417| cast_expression
2418| NOT_TK error
2419 {yyerror ("Missing term"); RECOVER}
2420| NEG_TK error
2421 {yyerror ("Missing term"); RECOVER}
2422;
2423
2424cast_expression: /* Error handling here is potentially weak */
2425 OP_TK primitive_type dims CP_TK unary_expression
e35b68b0 2426 {
e04a16fb 2427 tree type = $2;
c7303e41
APB		 2428 int osb = pop_current_osb (ctxp);
2429 while (osb--)
e04a16fb 2430 type = build_java_array_type (type, -1);
e35b68b0 2431 $$ = build_cast ($1.location, type, $5);
e04a16fb
AG		 2432 }
2433| OP_TK primitive_type CP_TK unary_expression
2434 { $$ = build_cast ($1.location, $2, $4); }
2435| OP_TK expression CP_TK unary_expression_not_plus_minus
2436 { $$ = build_cast ($1.location, $2, $4); }
2437| OP_TK name dims CP_TK unary_expression_not_plus_minus
e35b68b0 2438 {
49f48c71 2439 const char *ptr;
e35b68b0
AD		 2440 int osb = pop_current_osb (ctxp);
2441 obstack_grow (&temporary_obstack,
2e3b2d2c
APB		 2442 IDENTIFIER_POINTER (EXPR_WFL_NODE ($2)),
2443 IDENTIFIER_LENGTH (EXPR_WFL_NODE ($2)));
c7303e41 2444 while (osb--)
2e3b2d2c
APB		 2445 obstack_grow (&temporary_obstack, "[]", 2);
2446 obstack_1grow (&temporary_obstack, '\0');
e04a16fb
AG		 2447 ptr = obstack_finish (&temporary_obstack);
2448 EXPR_WFL_NODE ($2) = get_identifier (ptr);
2449 $$ = build_cast ($1.location, $2, $5);
2450 }
2451| OP_TK primitive_type OSB_TK error
2452 {yyerror ("']' expected, invalid type expression");}
2453| OP_TK error
2454 {
29f8b718 2455 YYNOT_TWICE yyerror ("Invalid type expression"); RECOVER;
e04a16fb
AG		 2456 RECOVER;
2457 }
2458| OP_TK primitive_type dims CP_TK error
2459 {yyerror ("Missing term"); RECOVER;}
2460| OP_TK primitive_type CP_TK error
2461 {yyerror ("Missing term"); RECOVER;}
2462| OP_TK name dims CP_TK error
2463 {yyerror ("Missing term"); RECOVER;}
2464;
2465
2466multiplicative_expression:
2467 unary_expression
2468| multiplicative_expression MULT_TK unary_expression
e35b68b0
AD		 2469 {
2470 $$ = build_binop (BINOP_LOOKUP ($2.token),
e04a16fb
AG		 2471 $2.location, $1, $3);
2472 }
2473| multiplicative_expression DIV_TK unary_expression
2474 {
2475 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
e35b68b0 2476 $1, $3);
e04a16fb
AG		 2477 }
2478| multiplicative_expression REM_TK unary_expression
2479 {
2480 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
e35b68b0 2481 $1, $3);
e04a16fb
AG		 2482 }
2483| multiplicative_expression MULT_TK error
2484 {yyerror ("Missing term"); RECOVER;}
2485| multiplicative_expression DIV_TK error
2486 {yyerror ("Missing term"); RECOVER;}
2487| multiplicative_expression REM_TK error
2488 {yyerror ("Missing term"); RECOVER;}
2489;
2490
2491additive_expression:
2492 multiplicative_expression
2493| additive_expression PLUS_TK multiplicative_expression
2494 {
2495 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
e35b68b0 2496 $1, $3);
e04a16fb
AG		 2497 }
2498| additive_expression MINUS_TK multiplicative_expression
2499 {
2500 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
e35b68b0 2501 $1, $3);
e04a16fb
AG		 2502 }
2503| additive_expression PLUS_TK error
2504 {yyerror ("Missing term"); RECOVER;}
2505| additive_expression MINUS_TK error
2506 {yyerror ("Missing term"); RECOVER;}
2507;
2508
2509shift_expression:
2510 additive_expression
2511| shift_expression LS_TK additive_expression
2512 {
2513 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
e35b68b0 2514 $1, $3);
e04a16fb
AG		 2515 }
2516| shift_expression SRS_TK additive_expression
2517 {
2518 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
e35b68b0 2519 $1, $3);
e04a16fb
AG		 2520 }
2521| shift_expression ZRS_TK additive_expression
2522 {
2523 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
e35b68b0 2524 $1, $3);
e04a16fb
AG		 2525 }
2526| shift_expression LS_TK error
2527 {yyerror ("Missing term"); RECOVER;}
2528| shift_expression SRS_TK error
2529 {yyerror ("Missing term"); RECOVER;}
2530| shift_expression ZRS_TK error
2531 {yyerror ("Missing term"); RECOVER;}
2532;
2533
2534relational_expression:
2535 shift_expression
2536| relational_expression LT_TK shift_expression
2537 {
2538 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
e35b68b0 2539 $1, $3);
e04a16fb
AG		 2540 }
2541| relational_expression GT_TK shift_expression
2542 {
2543 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
e35b68b0 2544 $1, $3);
e04a16fb
AG		 2545 }
2546| relational_expression LTE_TK shift_expression
2547 {
2548 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
e35b68b0 2549 $1, $3);
e04a16fb
AG		 2550 }
2551| relational_expression GTE_TK shift_expression
2552 {
2553 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
e35b68b0 2554 $1, $3);
e04a16fb
AG		 2555 }
2556| relational_expression INSTANCEOF_TK reference_type
5e942c50 2557 { $$ = build_binop (INSTANCEOF_EXPR, $2.location, $1, $3); }
e04a16fb
AG		 2558| relational_expression LT_TK error
2559 {yyerror ("Missing term"); RECOVER;}
2560| relational_expression GT_TK error
2561 {yyerror ("Missing term"); RECOVER;}
2562| relational_expression LTE_TK error
2563 {yyerror ("Missing term"); RECOVER;}
2564| relational_expression GTE_TK error
2565 {yyerror ("Missing term"); RECOVER;}
2566| relational_expression INSTANCEOF_TK error
2567 {yyerror ("Invalid reference type"); RECOVER;}
2568;
2569
2570equality_expression:
2571 relational_expression
2572| equality_expression EQ_TK relational_expression
2573 {
2574 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
e35b68b0 2575 $1, $3);
e04a16fb
AG		 2576 }
2577| equality_expression NEQ_TK relational_expression
2578 {
2579 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
e35b68b0 2580 $1, $3);
e04a16fb
AG		 2581 }
2582| equality_expression EQ_TK error
2583 {yyerror ("Missing term"); RECOVER;}
2584| equality_expression NEQ_TK error
2585 {yyerror ("Missing term"); RECOVER;}
2586;
2587
2588and_expression:
2589 equality_expression
2590| and_expression AND_TK equality_expression
2591 {
2592 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
e35b68b0 2593 $1, $3);
e04a16fb
AG		 2594 }
2595| and_expression AND_TK error
2596 {yyerror ("Missing term"); RECOVER;}
2597;
2598
2599exclusive_or_expression:
2600 and_expression
2601| exclusive_or_expression XOR_TK and_expression
2602 {
2603 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
e35b68b0 2604 $1, $3);
e04a16fb
AG		 2605 }
2606| exclusive_or_expression XOR_TK error
2607 {yyerror ("Missing term"); RECOVER;}
2608;
2609
2610inclusive_or_expression:
2611 exclusive_or_expression
2612| inclusive_or_expression OR_TK exclusive_or_expression
2613 {
2614 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
e35b68b0 2615 $1, $3);
e04a16fb
AG		 2616 }
2617| inclusive_or_expression OR_TK error
2618 {yyerror ("Missing term"); RECOVER;}
2619;
2620
2621conditional_and_expression:
2622 inclusive_or_expression
2623| conditional_and_expression BOOL_AND_TK inclusive_or_expression
2624 {
2625 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
e35b68b0 2626 $1, $3);
e04a16fb
AG		 2627 }
2628| conditional_and_expression BOOL_AND_TK error
2629 {yyerror ("Missing term"); RECOVER;}
2630;
2631
2632conditional_or_expression:
2633 conditional_and_expression
2634| conditional_or_expression BOOL_OR_TK conditional_and_expression
2635 {
2636 $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
e35b68b0 2637 $1, $3);
e04a16fb
AG		 2638 }
2639| conditional_or_expression BOOL_OR_TK error
2640 {yyerror ("Missing term"); RECOVER;}
2641;
2642
2643conditional_expression: /* Error handling here is weak */
2644 conditional_or_expression
2645| conditional_or_expression REL_QM_TK expression REL_CL_TK conditional_expression
22eed1e6 2646 {
dc6d7095 2647 $$ = build3 (CONDITIONAL_EXPR, NULL_TREE, $1, $3, $5);
9ec819d4 2648 SET_EXPR_LOCATION_FROM_TOKEN ($$, $2);
22eed1e6 2649 }
e04a16fb
AG		 2650| conditional_or_expression REL_QM_TK REL_CL_TK error
2651 {
2652 YYERROR_NOW;
2653 yyerror ("Missing term");
2654 DRECOVER (1);
2655 }
2656| conditional_or_expression REL_QM_TK error
2657 {yyerror ("Missing term"); DRECOVER (2);}
2658| conditional_or_expression REL_QM_TK expression REL_CL_TK error
2659 {yyerror ("Missing term"); DRECOVER (3);}
2660;
2661
2662assignment_expression:
2663 conditional_expression
2664| assignment
2665;
2666
2667assignment:
2668 left_hand_side assignment_operator assignment_expression
2669 { $$ = build_assignment ($2.token, $2.location, $1, $3); }
2670| left_hand_side assignment_operator error
2671 {
29f8b718 2672 YYNOT_TWICE yyerror ("Missing term");
e04a16fb
AG		 2673 DRECOVER (assign);
2674 }
2675;
2676
2677left_hand_side:
2678 name
2679| field_access
2680| array_access
2681;
2682
2683assignment_operator:
2684 ASSIGN_ANY_TK
2685| ASSIGN_TK
2686;
2687
2688expression:
2689 assignment_expression
2690;
2691
2692constant_expression:
2693 expression
2694;
2695
2696%%
c7303e41
APB		 2697
2698/* Helper function to retrieve an OSB count. Should be used when the
2699 `dims:' rule is being used. */
2700
2701static int
0a2f0c54 2702pop_current_osb (struct parser_ctxt *ctxp)
c7303e41
APB		 2703{
2704 int to_return;
2705
2706 if (ctxp->osb_depth < 0)
400500c4 2707 abort ();
e35b68b0 2708
c7303e41
APB		 2709 to_return = CURRENT_OSB (ctxp);
2710 ctxp->osb_depth--;
e35b68b0 2711
c7303e41
APB		 2712 return to_return;
2713}
2714
e04a16fb
AG		 2715\f
2716
c2952b01
APB		 2717/* This section of the code deal with save/restoring parser contexts.
2718 Add mode documentation here. FIXME */
e04a16fb 2719
c2952b01 2720/* Helper function. Create a new parser context. With
ee142fe7 2721 COPY_FROM_PREVIOUS set to a nonzero value, content of the previous
c2952b01
APB		 2722 context is copied, otherwise, the new context is zeroed. The newly
2723 created context becomes the current one. */
e04a16fb 2724
c2952b01 2725static void
0a2f0c54 2726create_new_parser_context (int copy_from_previous)
e04a16fb 2727{
c2952b01 2728 struct parser_ctxt *new;
e04a16fb 2729
7048110f 2730 new = ggc_alloc (sizeof (struct parser_ctxt));
c2952b01
APB		 2731 if (copy_from_previous)
2732 {
77d3109b 2733 memcpy (new, ctxp, sizeof (struct parser_ctxt));
b8ca854a
JS		 2734 /* This flag, indicating the context saves global values,
2735 should only be set by java_parser_context_save_global. */
2736 new->saved_data_ctx = 0;
c2952b01
APB		 2737 }
2738 else
77d3109b 2739 memset (new, 0, sizeof (struct parser_ctxt));
e35b68b0 2740
e04a16fb
AG		 2741 new->next = ctxp;
2742 ctxp = new;
c2952b01
APB		 2743}
2744
2745/* Create a new parser context and make it the current one. */
2746
2747void
0a2f0c54 2748java_push_parser_context (void)
c2952b01
APB		 2749{
2750 create_new_parser_context (0);
e35b68b0 2751}
e04a16fb 2752
e35b68b0 2753void
0a2f0c54 2754java_pop_parser_context (int generate)
c2952b01
APB		 2755{
2756 tree current;
9ec819d4 2757 struct parser_ctxt *next;
c2952b01
APB		 2758
2759 if (!ctxp)
2760 return;
2761
c2952b01
APB		 2762 next = ctxp->next;
2763 if (next)
2764 {
9ec819d4 2765 input_location = ctxp->save_location;
19e223db 2766 current_class = ctxp->class_type;
c2952b01
APB		 2767 }
2768
d19cbcb5
TT		 2769 /* If the old and new lexers differ, then free the old one. */
2770 if (ctxp->lexer && next && ctxp->lexer != next->lexer)
2771 java_destroy_lexer (ctxp->lexer);
2772
c2952b01
APB		 2773 /* Set the single import class file flag to 0 for the current list
2774 of imported things */
2775 for (current = ctxp->import_list; current; current = TREE_CHAIN (current))
063df563 2776 IS_A_SINGLE_IMPORT_CLASSFILE_NAME_P (TREE_VALUE (current)) = 0;
c2952b01 2777
c2952b01
APB		 2778 /* If we pushed a context to parse a class intended to be generated,
2779 we keep it so we can remember the class. What we could actually
2780 do is to just update a list of class names. */
2781 if (generate)
2782 {
9ec819d4
PB		 2783 ctxp->next = ctxp_for_generation;
2784 ctxp_for_generation = ctxp;
c2952b01 2785 }
9ec819d4
PB		 2786
2787 /* And restore those of the previous context */
2788 if ((ctxp = next)) /* Assignment is really meant here */
2789 for (current = ctxp->import_list; current; current = TREE_CHAIN (current))
2790 IS_A_SINGLE_IMPORT_CLASSFILE_NAME_P (TREE_VALUE (current)) = 1;
c2952b01
APB		 2791}
2792
2793/* Create a parser context for the use of saving some global
2794 variables. */
2795
e04a16fb 2796void
0a2f0c54 2797java_parser_context_save_global (void)
e04a16fb 2798{
22eed1e6
APB		 2799 if (!ctxp)
2800 {
2801 java_push_parser_context ();
ee07f4f4
APB		 2802 ctxp->saved_data_ctx = 1;
2803 }
c2952b01
APB		 2804
2805 /* If this context already stores data, create a new one suitable
2806 for data storage. */
ee07f4f4 2807 else if (ctxp->saved_data)
b8ca854a
JS		 2808 {
2809 create_new_parser_context (1);
2810 ctxp->saved_data_ctx = 1;
2811 }
c2952b01 2812
9ec819d4 2813 ctxp->save_location = input_location;
19e223db 2814 ctxp->class_type = current_class;
19e223db 2815 ctxp->function_decl = current_function_decl;
ee07f4f4 2816 ctxp->saved_data = 1;
e04a16fb
AG		 2817}
2818
c2952b01
APB		 2819/* Restore some global variables from the previous context. Make the
2820 previous context the current one. */
2821
e04a16fb 2822void
0a2f0c54 2823java_parser_context_restore_global (void)
e04a16fb 2824{
9ec819d4 2825 input_location = ctxp->save_location;
19e223db 2826 current_class = ctxp->class_type;
dba41d30 2827 if (wfl_operator)
9ec819d4
PB		 2828#ifdef USE_MAPPED_LOCATION
2829 SET_EXPR_LOCATION (wfl_operator, ctxp->save_location);
2830#else
1cb6d0da 2831 EXPR_WFL_FILENAME_NODE (wfl_operator) = get_identifier (input_filename);
9ec819d4 2832#endif
19e223db 2833 current_function_decl = ctxp->function_decl;
c2952b01 2834 ctxp->saved_data = 0;
ee07f4f4
APB		 2835 if (ctxp->saved_data_ctx)
2836 java_pop_parser_context (0);
e04a16fb
AG		 2837}
2838
c2952b01
APB		 2839/* Suspend vital data for the current class/function being parsed so
2840 that an other class can be parsed. Used to let local/anonymous
2841 classes be parsed. */
2842
2843static void
0a2f0c54 2844java_parser_context_suspend (void)
e04a16fb 2845{
c2952b01 2846 /* This makes debugging through java_debug_context easier */
fd033052 2847 static const char *const name = "<inner buffer context>";
e04a16fb 2848
c2952b01
APB		 2849 /* Duplicate the previous context, use it to save the globals we're
2850 interested in */
2851 create_new_parser_context (1);
19e223db
MM		 2852 ctxp->function_decl = current_function_decl;
2853 ctxp->class_type = current_class;
5e942c50 2854
c2952b01
APB		 2855 /* Then create a new context which inherits all data from the
2856 previous one. This will be the new current context */
2857 create_new_parser_context (1);
2858
2859 /* Help debugging */
2860 ctxp->next->filename = name;
2861}
2862
2863/* Resume vital data for the current class/function being parsed so
2864 that an other class can be parsed. Used to let local/anonymous
2865 classes be parsed. The trick is the data storing file position
2866 informations must be restored to their current value, so parsing
2867 can resume as if no context was ever saved. */
2868
2869static void
0a2f0c54 2870java_parser_context_resume (void)
c2952b01
APB		 2871{
2872 struct parser_ctxt *old = ctxp; /* This one is to be discarded */
2873 struct parser_ctxt *saver = old->next; /* This one contain saved info */
2874 struct parser_ctxt *restored = saver->next; /* This one is the old current */
2875
2876 /* We need to inherit the list of classes to complete/generate */
c2952b01
APB		 2877 restored->classd_list = old->classd_list;
2878 restored->class_list = old->class_list;
2879
2880 /* Restore the current class and function from the saver */
19e223db
MM		 2881 current_class = saver->class_type;
2882 current_function_decl = saver->function_decl;
c2952b01 2883
67264b4f 2884 /* Retrieve the restored context */
c2952b01
APB		 2885 ctxp = restored;
2886
2887 /* Re-installed the data for the parsing to carry on */
e35b68b0 2888 memcpy (&ctxp->marker_begining, &old->marker_begining,
cb9b7a8c 2889 (size_t)(&ctxp->marker_end - &ctxp->marker_begining));
c2952b01
APB		 2890}
2891
2892/* Add a new anchor node to which all statement(s) initializing static
2893 and non static initialized upon declaration field(s) will be
2894 linked. */
2895
2896static void
0a2f0c54 2897java_parser_context_push_initialized_field (void)
c2952b01
APB		 2898{
2899 tree node;
2900
2901 node = build_tree_list (NULL_TREE, NULL_TREE);
2902 TREE_CHAIN (node) = CPC_STATIC_INITIALIZER_LIST (ctxp);
2903 CPC_STATIC_INITIALIZER_LIST (ctxp) = node;
2904
2905 node = build_tree_list (NULL_TREE, NULL_TREE);
2906 TREE_CHAIN (node) = CPC_INITIALIZER_LIST (ctxp);
2907 CPC_INITIALIZER_LIST (ctxp) = node;
2908
2909 node = build_tree_list (NULL_TREE, NULL_TREE);
2910 TREE_CHAIN (node) = CPC_INSTANCE_INITIALIZER_LIST (ctxp);
2911 CPC_INSTANCE_INITIALIZER_LIST (ctxp) = node;
2912}
2913
2914/* Pop the lists of initialized field. If this lists aren't empty,
c00f0fb2 2915 remember them so we can use it to create and populate the finit$
c2952b01
APB		 2916 or <clinit> functions. */
2917
2918static void
0a2f0c54 2919java_parser_context_pop_initialized_field (void)
c2952b01
APB		 2920{
2921 tree stmts;
2922 tree class_type = TREE_TYPE (GET_CPC ());
2923
2924 if (CPC_INITIALIZER_LIST (ctxp))
e04a16fb 2925 {
c2952b01
APB		 2926 stmts = CPC_INITIALIZER_STMT (ctxp);
2927 CPC_INITIALIZER_LIST (ctxp) = TREE_CHAIN (CPC_INITIALIZER_LIST (ctxp));
2928 if (stmts && !java_error_count)
2929 TYPE_FINIT_STMT_LIST (class_type) = reorder_static_initialized (stmts);
e04a16fb
AG		 2930 }
2931
c2952b01
APB		 2932 if (CPC_STATIC_INITIALIZER_LIST (ctxp))
2933 {
2934 stmts = CPC_STATIC_INITIALIZER_STMT (ctxp);
e35b68b0 2935 CPC_STATIC_INITIALIZER_LIST (ctxp) =
c2952b01
APB		 2936 TREE_CHAIN (CPC_STATIC_INITIALIZER_LIST (ctxp));
2937 /* Keep initialization in order to enforce 8.5 */
2938 if (stmts && !java_error_count)
2939 TYPE_CLINIT_STMT_LIST (class_type) = nreverse (stmts);
2940 }
e04a16fb 2941
c2952b01
APB		 2942 /* JDK 1.1 instance initializers */
2943 if (CPC_INSTANCE_INITIALIZER_LIST (ctxp))
b351b287 2944 {
c2952b01 2945 stmts = CPC_INSTANCE_INITIALIZER_STMT (ctxp);
e35b68b0 2946 CPC_INSTANCE_INITIALIZER_LIST (ctxp) =
c2952b01
APB		 2947 TREE_CHAIN (CPC_INSTANCE_INITIALIZER_LIST (ctxp));
2948 if (stmts && !java_error_count)
2949 TYPE_II_STMT_LIST (class_type) = nreverse (stmts);
b351b287 2950 }
c2952b01
APB		 2951}
2952
2953static tree
0a2f0c54 2954reorder_static_initialized (tree list)
c2952b01
APB		 2955{
2956 /* We have to keep things in order. The alias initializer have to
2957 come first, then the initialized regular field, in reverse to
2958 keep them in lexical order. */
2959 tree marker, previous = NULL_TREE;
2960 for (marker = list; marker; previous = marker, marker = TREE_CHAIN (marker))
e35b68b0 2961 if (TREE_CODE (marker) == TREE_LIST
c2952b01
APB		 2962 && !TREE_VALUE (marker) && !TREE_PURPOSE (marker))
2963 break;
e35b68b0 2964
c2952b01
APB		 2965 /* No static initialized, the list is fine as is */
2966 if (!previous)
2967 list = TREE_CHAIN (marker);
2968
2969 /* No marker? reverse the whole list */
2970 else if (!marker)
2971 list = nreverse (list);
2972
2973 /* Otherwise, reverse what's after the marker and the new reordered
2974 sublist will replace the marker. */
b351b287 2975 else
c2952b01
APB		 2976 {
2977 TREE_CHAIN (previous) = NULL_TREE;
2978 list = nreverse (list);
2979 list = chainon (TREE_CHAIN (marker), list);
2980 }
2981 return list;
e04a16fb
AG		 2982}
2983
c2952b01
APB		 2984/* Helper functions to dump the parser context stack. */
2985
2986#define TAB_CONTEXT(C) \
2987 {int i; for (i = 0; i < (C); i++) fputc (' ', stderr);}
ee07f4f4
APB		 2988
2989static void
0a2f0c54 2990java_debug_context_do (int tab)
ee07f4f4 2991{
ee07f4f4
APB		 2992 struct parser_ctxt *copy = ctxp;
2993 while (copy)
2994 {
c2952b01 2995 TAB_CONTEXT (tab);
ee07f4f4 2996 fprintf (stderr, "ctxt: 0x%0lX\n", (unsigned long)copy);
c2952b01 2997 TAB_CONTEXT (tab);
ee07f4f4 2998 fprintf (stderr, "filename: %s\n", copy->filename);
c2952b01 2999 TAB_CONTEXT (tab);
ee07f4f4 3000 fprintf (stderr, "package: %s\n",
e35b68b0 3001 (copy->package ?
ee07f4f4 3002 IDENTIFIER_POINTER (copy->package) : "<none>"));
c2952b01 3003 TAB_CONTEXT (tab);
ee07f4f4 3004 fprintf (stderr, "context for saving: %d\n", copy->saved_data_ctx);
c2952b01 3005 TAB_CONTEXT (tab);
ee07f4f4
APB		 3006 fprintf (stderr, "saved data: %d\n", copy->saved_data);
3007 copy = copy->next;
3008 tab += 2;
3009 }
ee07f4f4
APB		 3010}
3011
c2952b01
APB		 3012/* Dump the stacked up parser contexts. Intended to be called from a
3013 debugger. */
3014
ee07f4f4 3015void
0a2f0c54 3016java_debug_context (void)
ee07f4f4
APB		 3017{
3018 java_debug_context_do (0);
3019}
3020
c2952b01
APB		 3021\f
3022
3023/* Flag for the error report routine to issue the error the first time
3024 it's called (overriding the default behavior which is to drop the
3025 first invocation and honor the second one, taking advantage of a
3026 richer context. */
3027static int force_error = 0;
ee07f4f4 3028
8119c720
APB		 3029/* Reporting an constructor invocation error. */
3030static void
0a2f0c54 3031parse_ctor_invocation_error (void)
8119c720
APB		 3032{
3033 if (DECL_CONSTRUCTOR_P (current_function_decl))
e35b68b0 3034 yyerror ("Constructor invocation must be first thing in a constructor");
8119c720
APB		 3035 else
3036 yyerror ("Only constructors can invoke constructors");
3037}
3038
3039/* Reporting JDK1.1 features not implemented. */
b67d701b
PB		 3040
3041static tree
0a2f0c54 3042parse_jdk1_1_error (const char *msg)
b67d701b
PB		 3043{
3044 sorry (": `%s' JDK1.1(TM) feature", msg);
3045 java_error_count++;
6de9cd9a 3046 return build_java_empty_stmt ();
b67d701b
PB		 3047}
3048
e04a16fb
AG		 3049static int do_warning = 0;
3050
3051void
0a2f0c54 3052yyerror (const char *msg)
e04a16fb 3053{
9ec819d4
PB		 3054#ifdef USE_MAPPED_LOCATION
3055 static source_location elc;
3056 expanded_location xloc = expand_location (input_location);
3057 int current_line = xloc.line;
3058#else
e04a16fb 3059 static java_lc elc;
9ec819d4
PB		 3060 int save_lineno;
3061 int current_line = input_line;
3062#endif
3063 static int prev_lineno;
49f48c71 3064 static const char *prev_msg;
e04a16fb 3065
e04a16fb 3066 char *remainder, *code_from_source;
e35b68b0 3067
9ec819d4 3068 if (!force_error && prev_lineno == current_line)
e04a16fb 3069 return;
9ec819d4
PB		 3070#ifndef USE_MAPPED_LOCATION
3071 current_line = ctxp->lexer->token_start.line;
3072#endif
e04a16fb
AG		 3073
3074 /* Save current error location but report latter, when the context is
3075 richer. */
3076 if (ctxp->java_error_flag == 0)
3077 {
3078 ctxp->java_error_flag = 1;
9ec819d4
PB		 3079#ifdef USE_MAPPED_LOCATION
3080 elc = input_location;
3081#else
3082 elc = ctxp->lexer->token_start;
3083#endif
e04a16fb
AG		 3084 /* Do something to use the previous line if we're reaching the
3085 end of the file... */
3086#ifdef VERBOSE_SKELETON
3087 printf ("* Error detected (%s)\n", (msg ? msg : "(null)"));
3088#endif
3089 return;
3090 }
3091
3092 /* Ignore duplicate message on the same line. BTW, this is dubious. FIXME */
9ec819d4 3093 if (!force_error && msg == prev_msg && prev_lineno == current_line)
e04a16fb
AG		 3094 return;
3095
3096 ctxp->java_error_flag = 0;
3097 if (do_warning)
3098 java_warning_count++;
3099 else
3100 java_error_count++;
e35b68b0 3101
9ec819d4 3102#if 0 /* FIXME */
807bc1db 3103 if (elc.col == 0 && msg && msg[1] == ';')
9ec819d4
PB		 3104 elc = ctxp->prev_line_end;
3105#endif
e04a16fb 3106
e04a16fb
AG		 3107 prev_msg = msg;
3108
9ec819d4
PB		 3109#ifdef USE_MAPPED_LOCATION
3110 prev_lineno = current_line;
3111 code_from_source = java_get_line_col (xloc.file, current_line, xloc.column);
3112#else
3113 save_lineno = input_line;
3114 prev_lineno = input_line = current_line;
3115 code_from_source = java_get_line_col (input_filename, current_line,
3116 ctxp->lexer->token_start.col);
3117#endif
3118
3119
e35b68b0 3120 obstack_grow0 (&temporary_obstack,
e04a16fb
AG		 3121 code_from_source, strlen (code_from_source));
3122 remainder = obstack_finish (&temporary_obstack);
3123 if (do_warning)
3124 warning ("%s.\n%s", msg, remainder);
3125 else
3126 error ("%s.\n%s", msg, remainder);
3127
3128 /* This allow us to cheaply avoid an extra 'Invalid expression
3129 statement' error report when errors have been already reported on
3130 the same line. This occurs when we report an error but don't have
3131 a synchronization point other than ';', which
3132 expression_statement is the only one to take care of. */
9ec819d4
PB		 3133#ifndef USE_MAPPED_LOCATION
3134 input_line = save_lineno;
3135#endif
3136 ctxp->prevent_ese = input_line;
e04a16fb
AG		 3137}
3138
3139static void
9ec819d4
PB		 3140issue_warning_error_from_context (
3141#ifdef USE_MAPPED_LOCATION
3142 source_location cl,
3143#else
3144 tree cl,
3145#endif
5544148e 3146 const char *msgid, va_list ap)
5e942c50 3147{
9ec819d4
PB		 3148#ifdef USE_MAPPED_LOCATION
3149 source_location saved_location = input_location;
3150 expanded_location xloc = expand_location (cl);
3151#else
3152 java_lc save_lc = ctxp->lexer->token_start;
3153 const char *saved = ctxp->filename, *saved_input_filename;
3154#endif
15fdcfe9 3155 char buffer [4096];
5544148e
RM		 3156 text_info text;
3157
3158 text.err_no = errno;
3159 text.args_ptr = &ap;
3160 text.format_spec = msgid;
3161 pp_format_text (global_dc->printer, &text);
3162 strncpy (buffer, pp_formatted_text (global_dc->printer), sizeof (buffer) - 1);
3163 buffer[sizeof (buffer) - 1] = '\0';
3164 pp_clear_output_area (global_dc->printer);
3165
15fdcfe9 3166 force_error = 1;
5e942c50 3167
9ec819d4
PB		 3168#ifdef USE_MAPPED_LOCATION
3169 if (xloc.file != NULL)
3170 {
3171 ctxp->filename = xloc.file;
3172 input_location = cl;
3173 }
3174#else
3175 ctxp->lexer->token_start.line = EXPR_WFL_LINENO (cl);
3176 ctxp->lexer->token_start.col = (EXPR_WFL_COLNO (cl) == 0xfff ? -1
3177 : EXPR_WFL_COLNO (cl) == 0xffe ? -2
3178 : EXPR_WFL_COLNO (cl));
5e942c50
APB		 3179
3180 /* We have a CL, that's a good reason for using it if it contains data */
5e942c50
APB		 3181 if (TREE_CODE (cl) == EXPR_WITH_FILE_LOCATION && EXPR_WFL_FILENAME_NODE (cl))
3182 ctxp->filename = EXPR_WFL_FILENAME (cl);
1886c9d8
APB		 3183 saved_input_filename = input_filename;
3184 input_filename = ctxp->filename;
9ec819d4 3185#endif
15fdcfe9
PB		 3186 java_error (NULL);
3187 java_error (buffer);
9ec819d4
PB		 3188#ifdef USE_MAPPED_LOCATION
3189 input_location = saved_location;
3190#else
5e942c50 3191 ctxp->filename = saved;
1886c9d8 3192 input_filename = saved_input_filename;
9ec819d4
PB		 3193 ctxp->lexer->token_start = save_lc;
3194#endif
15fdcfe9 3195 force_error = 0;
5e942c50
APB		 3196}
3197
9ec819d4
PB		 3198/* Issue an error message at a current source line CL.
3199 FUTURE/FIXME: change cl to be a source_location. */
e04a16fb 3200
15fdcfe9 3201void
5544148e 3202parse_error_context (tree cl, const char *msgid, ...)
e04a16fb 3203{
b3339cf7 3204 va_list ap;
5544148e 3205 va_start (ap, msgid);
9ec819d4 3206#ifdef USE_MAPPED_LOCATION
5544148e 3207 issue_warning_error_from_context (EXPR_LOCATION (cl), msgid, ap);
9ec819d4 3208#else
5544148e 3209 issue_warning_error_from_context (cl, msgid, ap);
9ec819d4 3210#endif
b3339cf7 3211 va_end (ap);
e04a16fb
AG		 3212}
3213
9ec819d4
PB		 3214/* Issue a warning at a current source line CL.
3215 FUTURE/FIXME: change cl to be a source_location. */
e04a16fb
AG		 3216
3217static void
5544148e 3218parse_warning_context (tree cl, const char *msgid, ...)
e04a16fb 3219{
b3339cf7 3220 va_list ap;
5544148e 3221 va_start (ap, msgid);
e04a16fb 3222
9ec819d4
PB		 3223 do_warning = 1;
3224#ifdef USE_MAPPED_LOCATION
5544148e 3225 issue_warning_error_from_context (EXPR_LOCATION (cl), msgid, ap);
9ec819d4 3226#else
5544148e 3227 issue_warning_error_from_context (cl, msgid, ap);
9ec819d4
PB		 3228#endif
3229 do_warning = 0;
b3339cf7 3230 va_end (ap);
e04a16fb
AG		 3231}
3232
82371d41 3233static tree
0a2f0c54 3234find_expr_with_wfl (tree node)
82371d41
APB		 3235{
3236 while (node)
3237 {
6615c446 3238 enum tree_code_class code;
82371d41
APB		 3239 tree to_return;
3240
3241 switch (TREE_CODE (node))
3242 {
3243 case BLOCK:
c0d87ff6
PB		 3244 node = BLOCK_EXPR_BODY (node);
3245 continue;
82371d41
APB		 3246
3247 case COMPOUND_EXPR:
3248 to_return = find_expr_with_wfl (TREE_OPERAND (node, 0));
3249 if (to_return)
3250 return to_return;
c0d87ff6
PB		 3251 node = TREE_OPERAND (node, 1);
3252 continue;
82371d41
APB		 3253
3254 case LOOP_EXPR:
c0d87ff6
PB		 3255 node = TREE_OPERAND (node, 0);
3256 continue;
e35b68b0 3257
82371d41 3258 case LABELED_BLOCK_EXPR:
c0d87ff6
PB		 3259 node = TREE_OPERAND (node, 1);
3260 continue;
3261
82371d41
APB		 3262 default:
3263 code = TREE_CODE_CLASS (TREE_CODE (node));
6615c446
JO		 3264 if (((code == tcc_unary) || (code == tcc_binary)
3265 || (code == tcc_expression))
82371d41
APB		 3266 && EXPR_WFL_LINECOL (node))
3267 return node;
ba179f9f 3268 return NULL_TREE;
82371d41
APB		 3269 }
3270 }
3271 return NULL_TREE;
3272}
3273
3274/* Issue a missing return statement error. Uses METHOD to figure the
3275 last line of the method the error occurs in. */
3276
3277static void
0a2f0c54 3278missing_return_error (tree method)
82371d41 3279{
9ec819d4
PB		 3280#ifdef USE_MAPPED_LOCATION
3281 SET_EXPR_LOCATION (wfl_operator, DECL_FUNCTION_LAST_LINE (method));
3282#else
36f04556 3283 EXPR_WFL_SET_LINECOL (wfl_operator, DECL_FUNCTION_LAST_LINE (method), -2);
9ec819d4 3284#endif
82371d41
APB		 3285 parse_error_context (wfl_operator, "Missing return statement");
3286}
3287
3288/* Issue an unreachable statement error. From NODE, find the next
3289 statement to report appropriately. */
3290static void
0a2f0c54 3291unreachable_stmt_error (tree node)
82371d41
APB		 3292{
3293 /* Browse node to find the next expression node that has a WFL. Use
3294 the location to report the error */
3295 if (TREE_CODE (node) == COMPOUND_EXPR)
3296 node = find_expr_with_wfl (TREE_OPERAND (node, 1));
3297 else
3298 node = find_expr_with_wfl (node);
3299
3300 if (node)
3301 {
9ec819d4
PB		 3302#ifdef USE_MAPPED_LOCATION
3303 SET_EXPR_LOCATION (wfl_operator, EXPR_LOCATION (node));
3304#else
82371d41 3305 EXPR_WFL_SET_LINECOL (wfl_operator, EXPR_WFL_LINENO (node), -2);
9ec819d4 3306#endif
82371d41
APB		 3307 parse_error_context (wfl_operator, "Unreachable statement");
3308 }
3309 else
400500c4 3310 abort ();
82371d41
APB		 3311}
3312
cd11bdcc
APB		 3313static int
3314not_accessible_field_error (tree wfl, tree decl)
3315{
3316 parse_error_context
3317 (wfl, "Can't access %s field `%s.%s' from `%s'",
8ae6595c 3318 accessibility_string (get_access_flags_from_decl (decl)),
cd11bdcc
APB		 3319 GET_TYPE_NAME (DECL_CONTEXT (decl)),
3320 IDENTIFIER_POINTER (DECL_NAME (decl)),
3321 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (current_class))));
3322 return 1;
3323}
3324
c877974e 3325int
0a2f0c54 3326java_report_errors (void)
e04a16fb
AG		 3327{
3328 if (java_error_count)
e35b68b0 3329 fprintf (stderr, "%d error%s",
e04a16fb
AG		 3330 java_error_count, (java_error_count == 1 ? "" : "s"));
3331 if (java_warning_count)
3332 fprintf (stderr, "%s%d warning%s", (java_error_count ? ", " : ""),
3333 java_warning_count, (java_warning_count == 1 ? "" : "s"));
3334 if (java_error_count || java_warning_count)
3335 putc ('\n', stderr);
c877974e 3336 return java_error_count;
e04a16fb
AG		 3337}
3338
3339static char *
0a2f0c54 3340java_accstring_lookup (int flags)
e04a16fb
AG		 3341{
3342 static char buffer [80];
3343#define COPY_RETURN(S) {strcpy (buffer, S); return buffer;}
3344
3345 /* Access modifier looked-up first for easier report on forbidden
3346 access. */
3347 if (flags & ACC_PUBLIC) COPY_RETURN ("public");
3348 if (flags & ACC_PRIVATE) COPY_RETURN ("private");
3349 if (flags & ACC_PROTECTED) COPY_RETURN ("protected");
3350 if (flags & ACC_STATIC) COPY_RETURN ("static");
3351 if (flags & ACC_FINAL) COPY_RETURN ("final");
3352 if (flags & ACC_SYNCHRONIZED) COPY_RETURN ("synchronized");
3353 if (flags & ACC_VOLATILE) COPY_RETURN ("volatile");
3354 if (flags & ACC_TRANSIENT) COPY_RETURN ("transient");
3355 if (flags & ACC_NATIVE) COPY_RETURN ("native");
3356 if (flags & ACC_INTERFACE) COPY_RETURN ("interface");
3357 if (flags & ACC_ABSTRACT) COPY_RETURN ("abstract");
3358
3359 buffer [0] = '\0';
3360 return buffer;
3361#undef COPY_RETURN
3362}
3363
8ae6595c
RM		 3364/* Returns a string denoting the accessibility of a class or a member as
3365 indicated by FLAGS. We need a separate function from
3366 java_accstring_lookup, as the latter can return spurious "static", etc.
3367 if package-private access is defined (in which case none of the
3368 relevant access control bits in FLAGS is set). */
3369
3370static const char *
3371accessibility_string (int flags)
3372{
3373 if (flags & ACC_PRIVATE) return "private";
3374 if (flags & ACC_PROTECTED) return "protected";
3375 if (flags & ACC_PUBLIC) return "public";
3376
3377 return "package-private";
3378}
3379
b67d701b
PB		 3380/* Issuing error messages upon redefinition of classes, interfaces or
3381 variables. */
3382
e04a16fb 3383static void
0a2f0c54 3384classitf_redefinition_error (const char *context, tree id, tree decl, tree cl)
e04a16fb 3385{
e35b68b0
AD		 3386 parse_error_context (cl, "%s `%s' already defined in %s:%d",
3387 context, IDENTIFIER_POINTER (id),
f31686a3 3388 DECL_SOURCE_FILE (decl), DECL_SOURCE_LINE (decl));
e04a16fb
AG		 3389 /* Here we should point out where its redefined. It's a unicode. FIXME */
3390}
3391
b67d701b 3392static void
0a2f0c54 3393variable_redefinition_error (tree context, tree name, tree type, int line)
b67d701b 3394{
49f48c71 3395 const char *type_name;
b67d701b
PB		 3396
3397 /* Figure a proper name for type. We might haven't resolved it */
c877974e
APB		 3398 if (TREE_CODE (type) == POINTER_TYPE && !TREE_TYPE (type))
3399 type_name = IDENTIFIER_POINTER (TYPE_NAME (type));
b67d701b 3400 else
0a2138e2 3401 type_name = lang_printable_name (type, 0);
b67d701b
PB		 3402
3403 parse_error_context (context,
e35b68b0 3404 "Variable `%s' is already defined in this method and was declared `%s %s' at line %d",
b67d701b
PB		 3405 IDENTIFIER_POINTER (name),
3406 type_name, IDENTIFIER_POINTER (name), line);
3407}
3408
2e3b2d2c
APB		 3409/* If ANAME is terminated with `[]', it indicates an array. This
3410 function returns the number of `[]' found and if this number is
3411 greater than zero, it extracts the array type name and places it in
3412 the node pointed to by TRIMMED unless TRIMMED is null. */
3413
3414static int
0a2f0c54 3415build_type_name_from_array_name (tree aname, tree *trimmed)
2e3b2d2c
APB		 3416{
3417 const char *name = IDENTIFIER_POINTER (aname);
3418 int len = IDENTIFIER_LENGTH (aname);
3419 int array_dims;
3420
3421 STRING_STRIP_BRACKETS (name, len, array_dims);
3422
3423 if (array_dims && trimmed)
3424 *trimmed = get_identifier_with_length (name, len);
3425
3426 return array_dims;
3427}
3428
c583dd46 3429static tree
0a2f0c54 3430build_array_from_name (tree type, tree type_wfl, tree name, tree *ret_name)
c583dd46
APB		 3431{
3432 int more_dims = 0;
c583dd46
APB		 3433
3434 /* Eventually get more dims */
2e3b2d2c 3435 more_dims = build_type_name_from_array_name (name, &name);
e35b68b0 3436
c583dd46
APB		 3437 /* If we have, then craft a new type for this variable */
3438 if (more_dims)
3439 {
10e2af38
TT		 3440 tree save = type;
3441
34f4db93
APB		 3442 /* If we have a pointer, use its type */
3443 if (TREE_CODE (type) == POINTER_TYPE)
3444 type = TREE_TYPE (type);
c583dd46
APB		 3445
3446 /* Building the first dimension of a primitive type uses this
3447 function */
3448 if (JPRIMITIVE_TYPE_P (type))
3449 {
3450 type = build_java_array_type (type, -1);
3451 more_dims--;
3452 }
3453 /* Otherwise, if we have a WFL for this type, use it (the type
3454 is already an array on an unresolved type, and we just keep
3455 on adding dimensions) */
3456 else if (type_wfl)
10e2af38 3457 {
10e2af38 3458 type = type_wfl;
2e3b2d2c
APB		 3459 more_dims += build_type_name_from_array_name (TYPE_NAME (save),
3460 NULL);
10e2af38 3461 }
c583dd46
APB		 3462
3463 /* Add all the dimensions */
3464 while (more_dims--)
3465 type = build_unresolved_array_type (type);
3466
3467 /* The type may have been incomplete in the first place */
3468 if (type_wfl)
3469 type = obtain_incomplete_type (type);
3470 }
3471
c2952b01
APB		 3472 if (ret_name)
3473 *ret_name = name;
c583dd46
APB		 3474 return type;
3475}
3476
e04a16fb
AG		 3477/* Build something that the type identifier resolver will identify as
3478 being an array to an unresolved type. TYPE_WFL is a WFL on a
3479 identifier. */
3480
3481static tree
0a2f0c54 3482build_unresolved_array_type (tree type_or_wfl)
e04a16fb 3483{
49f48c71 3484 const char *ptr;
352b3f3f 3485 tree wfl;
e04a16fb 3486
1886c9d8 3487 /* TYPE_OR_WFL might be an array on a resolved type. In this case,
e04a16fb
AG		 3488 just create a array type */
3489 if (TREE_CODE (type_or_wfl) == RECORD_TYPE)
3c0ce750 3490 return build_java_array_type (type_or_wfl, -1);
e04a16fb 3491
2e3b2d2c 3492 obstack_grow (&temporary_obstack,
e04a16fb
AG		 3493 IDENTIFIER_POINTER (EXPR_WFL_NODE (type_or_wfl)),
3494 IDENTIFIER_LENGTH (EXPR_WFL_NODE (type_or_wfl)));
2e3b2d2c 3495 obstack_grow0 (&temporary_obstack, "[]", 2);
e04a16fb 3496 ptr = obstack_finish (&temporary_obstack);
9ec819d4
PB		 3497#ifdef USE_MAPPED_LOCATION
3498 wfl = build_expr_wfl (get_identifier (ptr), EXPR_LOCATION (type_or_wfl));
3499#else
352b3f3f
APB		 3500 wfl = build_expr_wfl (get_identifier (ptr),
3501 EXPR_WFL_FILENAME (type_or_wfl),
3502 EXPR_WFL_LINENO (type_or_wfl),
3503 EXPR_WFL_COLNO (type_or_wfl));
9ec819d4 3504#endif
352b3f3f
APB		 3505 /* Re-install the existing qualifications so that the type can be
3506 resolved properly. */
3507 EXPR_WFL_QUALIFICATION (wfl) = EXPR_WFL_QUALIFICATION (type_or_wfl);
3508 return wfl;
e04a16fb
AG		 3509}
3510
e04a16fb 3511static void
0a2f0c54 3512parser_add_interface (tree class_decl, tree interface_decl, tree wfl)
e04a16fb
AG		 3513{
3514 if (maybe_add_interface (TREE_TYPE (class_decl), TREE_TYPE (interface_decl)))
3515 parse_error_context (wfl, "Interface `%s' repeated",
3516 IDENTIFIER_POINTER (DECL_NAME (interface_decl)));
3517}
3518
3519/* Bulk of common class/interface checks. Return 1 if an error was
3520 encountered. TAG is 0 for a class, 1 for an interface. */
3521
3522static int
0a2f0c54
KG		 3523check_class_interface_creation (int is_interface, int flags, tree raw_name,
3524 tree qualified_name, tree decl, tree cl)
e04a16fb
AG		 3525{
3526 tree node;
c2952b01
APB		 3527 int sca = 0; /* Static class allowed */
3528 int icaf = 0; /* Inner class allowed flags */
3529 int uaaf = CLASS_MODIFIERS; /* Usually allowed access flags */
e04a16fb
AG		 3530
3531 if (!quiet_flag)
e35b68b0 3532 fprintf (stderr, " %s%s %s",
c2952b01 3533 (CPC_INNER_P () ? "inner" : ""),
e35b68b0 3534 (is_interface ? "interface" : "class"),
e04a16fb
AG		 3535 IDENTIFIER_POINTER (qualified_name));
3536
3537 /* Scope of an interface/class type name:
3538 - Can't be imported by a single type import
3539 - Can't already exists in the package */
3540 if (IS_A_SINGLE_IMPORT_CLASSFILE_NAME_P (raw_name)
34d4df06
APB		 3541 && (node = find_name_in_single_imports (raw_name))
3542 && !CPC_INNER_P ())
e04a16fb 3543 {
e35b68b0 3544 parse_error_context
e04a16fb
AG		 3545 (cl, "%s name `%s' clashes with imported type `%s'",
3546 (is_interface ? "Interface" : "Class"),
3547 IDENTIFIER_POINTER (raw_name), IDENTIFIER_POINTER (node));
3548 return 1;
3549 }
3550 if (decl && CLASS_COMPLETE_P (decl))
3551 {
e35b68b0 3552 classitf_redefinition_error ((is_interface ? "Interface" : "Class"),
b67d701b 3553 qualified_name, decl, cl);
e04a16fb
AG		 3554 return 1;
3555 }
3556
c2952b01
APB		 3557 if (check_inner_class_redefinition (raw_name, cl))
3558 return 1;
3559
3560 /* If public, file name should match class/interface name, except
3561 when dealing with an inner class */
3562 if (!CPC_INNER_P () && (flags & ACC_PUBLIC ))
e04a16fb 3563 {
9ec819d4 3564 const char *fname = input_filename;
49f48c71 3565 const char *f;
e04a16fb 3566
9ec819d4
PB		 3567 for (f = fname + strlen (fname);
3568 f != fname && ! IS_DIR_SEPARATOR (*f);
fa322ab5
TT		 3569 f--)
3570 ;
9ec819d4 3571 if (IS_DIR_SEPARATOR (*f))
e04a16fb 3572 f++;
e35b68b0 3573 if (strncmp (IDENTIFIER_POINTER (raw_name),
e04a16fb
AG		 3574 f , IDENTIFIER_LENGTH (raw_name)) ||
3575 f [IDENTIFIER_LENGTH (raw_name)] != '.')
781b0558 3576 parse_error_context
e35b68b0 3577 (cl, "Public %s `%s' must be defined in a file called `%s.java'",
e04a16fb
AG		 3578 (is_interface ? "interface" : "class"),
3579 IDENTIFIER_POINTER (qualified_name),
3580 IDENTIFIER_POINTER (raw_name));
3581 }
3582
c2952b01
APB		 3583 /* Static classes can be declared only in top level classes. Note:
3584 once static, a inner class is a top level class. */
3585 if (flags & ACC_STATIC)
3586 {
3587 /* Catch the specific error of declaring an class inner class
3588 with no toplevel enclosing class. Prevent check_modifiers from
3589 complaining a second time */
3590 if (CPC_INNER_P () && !TOPLEVEL_CLASS_DECL_P (GET_CPC()))
3591 {
e35b68b0 3592 parse_error_context (cl, "Inner class `%s' can't be static. Static classes can only occur in interfaces and top-level classes",
c2952b01
APB		 3593 IDENTIFIER_POINTER (qualified_name));
3594 sca = ACC_STATIC;
3595 }
3596 /* Else, in the context of a top-level class declaration, let
3597 `check_modifiers' do its job, otherwise, give it a go */
3598 else
3599 sca = (GET_CPC_LIST () ? ACC_STATIC : 0);
3600 }
3601
a40d21da 3602 /* Inner classes can be declared private or protected
c2952b01
APB		 3603 within their enclosing classes. */
3604 if (CPC_INNER_P ())
3605 {
3606 /* A class which is local to a block can't be public, private,
3607 protected or static. But it is created final, so allow this
3608 one. */
3609 if (current_function_decl)
3610 icaf = sca = uaaf = ACC_FINAL;
3611 else
3612 {
3613 check_modifiers_consistency (flags);
9d7d8362
APB		 3614 icaf = ACC_PROTECTED;
3615 if (! CLASS_INTERFACE (GET_CPC ()))
3616 icaf |= ACC_PRIVATE;
c2952b01
APB		 3617 }
3618 }
3619
e35b68b0 3620 if (is_interface)
a40d21da
APB		 3621 {
3622 if (CPC_INNER_P ())
3623 uaaf = INTERFACE_INNER_MODIFIERS;
3624 else
3625 uaaf = INTERFACE_MODIFIERS;
e35b68b0
AD		 3626
3627 check_modifiers ("Illegal modifier `%s' for interface declaration",
a40d21da
APB		 3628 flags, uaaf);
3629 }
2884c41e 3630 else
a40d21da
APB		 3631 check_modifiers ((current_function_decl ?
3632 "Illegal modifier `%s' for local class declaration" :
3633 "Illegal modifier `%s' for class declaration"),
c2952b01 3634 flags, uaaf|sca|icaf);
e04a16fb
AG		 3635 return 0;
3636}
3637
48711f4d
TT		 3638/* Construct a nested class name. If the final component starts with
3639 a digit, return true. Otherwise return false. */
3640static int
0a2f0c54 3641make_nested_class_name (tree cpc_list)
c2952b01
APB		 3642{
3643 tree name;
3644
3645 if (!cpc_list)
48711f4d
TT		 3646 return 0;
3647
3648 make_nested_class_name (TREE_CHAIN (cpc_list));
c2952b01
APB		 3649
3650 /* Pick the qualified name when dealing with the first upmost
3651 enclosing class */
48711f4d
TT		 3652 name = (TREE_CHAIN (cpc_list)
3653 ? TREE_PURPOSE (cpc_list) : DECL_NAME (TREE_VALUE (cpc_list)));
c2952b01
APB		 3654 obstack_grow (&temporary_obstack,
3655 IDENTIFIER_POINTER (name), IDENTIFIER_LENGTH (name));
c2952b01 3656 obstack_1grow (&temporary_obstack, '$');
48711f4d
TT		 3657
3658 return ISDIGIT (IDENTIFIER_POINTER (name)[0]);
c2952b01
APB		 3659}
3660
3661/* Can't redefine a class already defined in an earlier scope. */
3662
3663static int
0a2f0c54 3664check_inner_class_redefinition (tree raw_name, tree cl)
c2952b01
APB		 3665{
3666 tree scope_list;
3667
e35b68b0 3668 for (scope_list = GET_CPC_LIST (); scope_list;
c2952b01
APB		 3669 scope_list = GET_NEXT_ENCLOSING_CPC (scope_list))
3670 if (raw_name == GET_CPC_UN_NODE (scope_list))
3671 {
e35b68b0 3672 parse_error_context
c2952b01
APB		 3673 (cl, "The class name `%s' is already defined in this scope. An inner class may not have the same simple name as any of its enclosing classes",
3674 IDENTIFIER_POINTER (raw_name));
3675 return 1;
3676 }
3677 return 0;
3678}
3679
17126208
APB		 3680/* Tries to find a decl for CLASS_TYPE within ENCLOSING. If we fail,
3681 we remember ENCLOSING and SUPER. */
3682
3683static tree
0a2f0c54
KG		 3684resolve_inner_class (htab_t circularity_hash, tree cl, tree *enclosing,
3685 tree *super, tree class_type)
17126208
APB		 3686{
3687 tree local_enclosing = *enclosing;
3688 tree local_super = NULL_TREE;
3689
3690 while (local_enclosing)
3691 {
3692 tree intermediate, decl;
3693
e2500fed
GK		 3694 *htab_find_slot (circularity_hash, local_enclosing, INSERT) =
3695 local_enclosing;
17126208
APB		 3696
3697 if ((decl = find_as_inner_class (local_enclosing, class_type, cl)))
3698 return decl;
3699
3700 intermediate = local_enclosing;
3701 /* Explore enclosing contexts. */
3702 while (INNER_CLASS_DECL_P (intermediate))
3703 {
3704 intermediate = DECL_CONTEXT (intermediate);
3705 if ((decl = find_as_inner_class (intermediate, class_type, cl)))
3706 return decl;
3707 }
3708
2f29e5e8 3709 /* Now go to the upper classes, bail out if necessary. We will
17126208 3710 analyze the returned SUPER and act accordingly (see
2f29e5e8
TT		 3711 do_resolve_class). */
3712 if (JPRIMITIVE_TYPE_P (TREE_TYPE (local_enclosing))
3713 || TREE_TYPE (local_enclosing) == void_type_node)
3714 {
3715 parse_error_context (cl, "Qualifier must be a reference");
3716 local_enclosing = NULL_TREE;
3717 break;
3718 }
17126208
APB		 3719 local_super = CLASSTYPE_SUPER (TREE_TYPE (local_enclosing));
3720 if (!local_super || local_super == object_type_node)
3721 break;
3722
3723 if (TREE_CODE (local_super) == POINTER_TYPE)
3724 local_super = do_resolve_class (NULL, local_super, NULL, NULL);
3725 else
3726 local_super = TYPE_NAME (local_super);
3727
3728 /* We may not have checked for circular inheritance yet, so do so
3729 here to prevent an infinite loop. */
e2500fed 3730 if (htab_find (circularity_hash, local_super) != NULL)
17126208
APB		 3731 {
3732 if (!cl)
3733 cl = lookup_cl (local_enclosing);
e35b68b0 3734
17126208
APB		 3735 parse_error_context
3736 (cl, "Cyclic inheritance involving %s",
3737 IDENTIFIER_POINTER (DECL_NAME (local_enclosing)));
3738 local_enclosing = NULL_TREE;
3739 }
df1c5346
APB		 3740 else
3741 local_enclosing = local_super;
17126208
APB		 3742 }
3743
3744 /* We failed. Return LOCAL_SUPER and LOCAL_ENCLOSING. */
3745 *super = local_super;
3746 *enclosing = local_enclosing;
3747
3748 return NULL_TREE;
3749}
3750
3751/* Within ENCLOSING, find a decl for NAME and return it. NAME can be
3752 qualified. */
3753
c2952b01 3754static tree
0a2f0c54 3755find_as_inner_class (tree enclosing, tree name, tree cl)
c2952b01
APB		 3756{
3757 tree qual, to_return;
3758 if (!enclosing)
3759 return NULL_TREE;
3760
3761 name = TYPE_NAME (name);
3762
3763 /* First search: within the scope of `enclosing', search for name */
3764 if (QUALIFIED_P (name) && cl && EXPR_WFL_NODE (cl) == name)
3765 qual = EXPR_WFL_QUALIFICATION (cl);
3766 else if (cl)
3767 qual = build_tree_list (cl, NULL_TREE);
3768 else
9ec819d4 3769 qual = build_tree_list (build_unknown_wfl (name), NULL_TREE);
e35b68b0 3770
c2952b01
APB		 3771 if ((to_return = find_as_inner_class_do (qual, enclosing)))
3772 return to_return;
3773
3774 /* We're dealing with a qualified name. Try to resolve thing until
3775 we get something that is an enclosing class. */
3776 if (QUALIFIED_P (name) && cl && EXPR_WFL_NODE (cl) == name)
3777 {
3778 tree acc = NULL_TREE, decl = NULL_TREE, ptr;
3779
e35b68b0 3780 for (qual = EXPR_WFL_QUALIFICATION (cl); qual && !decl;
0c2b8145 3781 qual = TREE_CHAIN (qual))
c2952b01 3782 {
e35b68b0 3783 acc = merge_qualified_name (acc,
c2952b01
APB		 3784 EXPR_WFL_NODE (TREE_PURPOSE (qual)));
3785 BUILD_PTR_FROM_NAME (ptr, acc);
908fecca 3786 decl = do_resolve_class (NULL_TREE, ptr, NULL_TREE, cl);
c2952b01
APB		 3787 }
3788
3789 /* A NULL qual and a decl means that the search ended
3790 successfully?!? We have to do something then. FIXME */
e35b68b0 3791
c2952b01
APB		 3792 if (decl)
3793 enclosing = decl;
3794 else
3795 qual = EXPR_WFL_QUALIFICATION (cl);
3796 }
3797 /* Otherwise, create a qual for the other part of the resolution. */
3798 else
9ec819d4 3799 qual = build_tree_list (build_unknown_wfl (name), NULL_TREE);
e35b68b0 3800
1e12ab9b 3801 return find_as_inner_class_do (qual, enclosing);
c2952b01
APB		 3802}
3803
3804/* We go inside the list of sub classes and try to find a way
3805 through. */
3806
3807static tree
0a2f0c54 3808find_as_inner_class_do (tree qual, tree enclosing)
c2952b01
APB		 3809{
3810 if (!qual)
3811 return NULL_TREE;
3812
3813 for (; qual && enclosing; qual = TREE_CHAIN (qual))
3814 {
3815 tree name_to_match = EXPR_WFL_NODE (TREE_PURPOSE (qual));
3816 tree next_enclosing = NULL_TREE;
3817 tree inner_list;
3818
3819 for (inner_list = DECL_INNER_CLASS_LIST (enclosing);
3820 inner_list; inner_list = TREE_CHAIN (inner_list))
3821 {
3822 if (TREE_VALUE (inner_list) == name_to_match)
3823 {
3824 next_enclosing = TREE_PURPOSE (inner_list);
3825 break;
3826 }
3827 }
3828 enclosing = next_enclosing;
3829 }
3830
3831 return (!qual && enclosing ? enclosing : NULL_TREE);
3832}
3833
c2952b01 3834static void
0a2f0c54 3835link_nested_class_to_enclosing (void)
c2952b01
APB		 3836{
3837 if (GET_ENCLOSING_CPC ())
3838 {
3839 tree enclosing = GET_ENCLOSING_CPC_CONTEXT ();
e35b68b0 3840 DECL_INNER_CLASS_LIST (enclosing) =
c2952b01
APB		 3841 tree_cons (GET_CPC (), GET_CPC_UN (),
3842 DECL_INNER_CLASS_LIST (enclosing));
c2952b01
APB		 3843 }
3844}
3845
3846static tree
0a2f0c54 3847maybe_make_nested_class_name (tree name)
c2952b01
APB		 3848{
3849 tree id = NULL_TREE;
3850
3851 if (CPC_INNER_P ())
3852 {
48711f4d
TT		 3853 /* If we're in a function, we must append a number to create the
3854 nested class name. However, we don't do this if the class we
3855 are constructing is anonymous, because in that case we'll
3856 already have a number as the class name. */
3857 if (! make_nested_class_name (GET_CPC_LIST ())
3858 && current_function_decl != NULL_TREE
3859 && ! ISDIGIT (IDENTIFIER_POINTER (name)[0]))
3860 {
3861 char buf[10];
3862 sprintf (buf, "%d", anonymous_class_counter);
3863 ++anonymous_class_counter;
3864 obstack_grow (&temporary_obstack, buf, strlen (buf));
3865 obstack_1grow (&temporary_obstack, '$');
3866 }
48a840d9 3867 obstack_grow0 (&temporary_obstack,
e35b68b0 3868 IDENTIFIER_POINTER (name),
48a840d9 3869 IDENTIFIER_LENGTH (name));
c2952b01
APB		 3870 id = get_identifier (obstack_finish (&temporary_obstack));
3871 if (ctxp->package)
3872 QUALIFIED_P (id) = 1;
3873 }
3874 return id;
3875}
3876
3877/* If DECL is NULL, create and push a new DECL, record the current
3878 line CL and do other maintenance things. */
3879
e04a16fb 3880static tree
0a2f0c54
KG		 3881maybe_create_class_interface_decl (tree decl, tree raw_name,
3882 tree qualified_name, tree cl)
e04a16fb 3883{
5e942c50 3884 if (!decl)
e04a16fb 3885 decl = push_class (make_class (), qualified_name);
c2952b01 3886
e04a16fb 3887 /* Take care of the file and line business */
9ec819d4
PB		 3888#ifdef USE_MAPPED_LOCATION
3889 DECL_SOURCE_LOCATION (decl) = EXPR_LOCATION (cl);
3890#else
f31686a3 3891 DECL_SOURCE_FILE (decl) = EXPR_WFL_FILENAME (cl);
67264b4f 3892 /* If we're emitting xrefs, store the line/col number information */
f31686a3
RH		 3893 if (flag_emit_xref)
3894 DECL_SOURCE_LINE (decl) = EXPR_WFL_LINECOL (cl);
3895 else
3896 DECL_SOURCE_LINE (decl) = EXPR_WFL_LINENO (cl);
9ec819d4 3897#endif
e04a16fb 3898 CLASS_FROM_SOURCE_P (TREE_TYPE (decl)) = 1;
3c0ce750 3899 CLASS_PARSED_P (TREE_TYPE (decl)) = 1;
9ec819d4
PB		 3900#ifdef USE_MAPPED_LOCATION
3901 {
3902 tree tmp = maybe_get_identifier (EXPR_FILENAME (cl));
3903 CLASS_FROM_CURRENTLY_COMPILED_P (TREE_TYPE (decl)) =
3904 tmp && IS_A_COMMAND_LINE_FILENAME_P (tmp);
3905 }
3906#else
54646811 3907 CLASS_FROM_CURRENTLY_COMPILED_P (TREE_TYPE (decl)) =
b351b287 3908 IS_A_COMMAND_LINE_FILENAME_P (EXPR_WFL_FILENAME_NODE (cl));
9ec819d4 3909#endif
e04a16fb 3910
c2952b01
APB		 3911 PUSH_CPC (decl, raw_name);
3912 DECL_CONTEXT (decl) = GET_ENCLOSING_CPC_CONTEXT ();
3913
e04a16fb
AG		 3914 /* Link the declaration to the already seen ones */
3915 TREE_CHAIN (decl) = ctxp->class_list;
3916 ctxp->class_list = decl;
5e942c50 3917
23a79c61 3918 /* Create a new nodes in the global lists */
fea2d5da 3919 gclass_list = tree_cons (NULL_TREE, decl, gclass_list);
23a79c61 3920 all_class_list = tree_cons (NULL_TREE, decl, all_class_list);
5e942c50 3921
e04a16fb
AG		 3922 /* Install a new dependency list element */
3923 create_jdep_list (ctxp);
3924
e35b68b0 3925 SOURCE_FRONTEND_DEBUG (("Defining class/interface %s",
e04a16fb
AG		 3926 IDENTIFIER_POINTER (qualified_name)));
3927 return decl;
3928}
3929
3930static void
0a2f0c54 3931add_superinterfaces (tree decl, tree interface_list)
e04a16fb
AG		 3932{
3933 tree node;
3934 /* Superinterface(s): if present and defined, parser_check_super_interface ()
3935 takes care of ensuring that:
3936 - This is an accessible interface type,
3937 - Circularity detection.
3938 parser_add_interface is then called. If present but not defined,
3939 the check operation is delayed until the super interface gets
3940 defined. */
3941 for (node = interface_list; node; node = TREE_CHAIN (node))
3942 {
15fdcfe9 3943 tree current = TREE_PURPOSE (node);
5e942c50
APB		 3944 tree idecl = IDENTIFIER_CLASS_VALUE (EXPR_WFL_NODE (current));
3945 if (idecl && CLASS_LOADED_P (TREE_TYPE (idecl)))
e04a16fb 3946 {
5e942c50
APB		 3947 if (!parser_check_super_interface (idecl, decl, current))
3948 parser_add_interface (decl, idecl, current);
e04a16fb
AG		 3949 }
3950 else
3951 register_incomplete_type (JDEP_INTERFACE,
3952 current, decl, NULL_TREE);
3953 }
3954}
3955
3956/* Create an interface in pass1 and return its decl. Return the
3957 interface's decl in pass 2. */
3958
3959static tree
0a2f0c54 3960create_interface (int flags, tree id, tree super)
e04a16fb 3961{
e04a16fb 3962 tree raw_name = EXPR_WFL_NODE (id);
98a52c2c 3963 tree q_name = parser_qualified_classname (raw_name);
e04a16fb
AG		 3964 tree decl = IDENTIFIER_CLASS_VALUE (q_name);
3965
9d7d8362
APB		 3966 /* Certain syntax errors are making SUPER be like ID. Avoid this
3967 case. */
3968 if (ctxp->class_err && id == super)
3969 super = NULL;
3970
e04a16fb
AG		 3971 EXPR_WFL_NODE (id) = q_name; /* Keep source location, even if refined. */
3972
e35b68b0 3973 /* Basic checks: scope, redefinition, modifiers */
e04a16fb 3974 if (check_class_interface_creation (1, flags, raw_name, q_name, decl, id))
c2952b01
APB		 3975 {
3976 PUSH_ERROR ();
3977 return NULL_TREE;
3978 }
3979
3980 /* Suspend the current parsing context if we're parsing an inner
3981 interface */
3982 if (CPC_INNER_P ())
9d7d8362
APB		 3983 {
3984 java_parser_context_suspend ();
3985 /* Interface members are public. */
3986 if (CLASS_INTERFACE (GET_CPC ()))
3987 flags |= ACC_PUBLIC;
3988 }
c2952b01
APB		 3989
3990 /* Push a new context for (static) initialized upon declaration fields */
3991 java_parser_context_push_initialized_field ();
e04a16fb
AG		 3992
3993 /* Interface modifiers check
3994 - public/abstract allowed (already done at that point)
3995 - abstract is obsolete (comes first, it's a warning, or should be)
3996 - Can't use twice the same (checked in the modifier rule) */
c877974e 3997 if ((flags & ACC_ABSTRACT) && flag_redundant)
e35b68b0 3998 parse_warning_context
e04a16fb 3999 (MODIFIER_WFL (ABSTRACT_TK),
a83f01f0 4000 "Redundant use of `abstract' modifier. Interface `%s' is implicitly abstract", IDENTIFIER_POINTER (raw_name));
e04a16fb
AG		 4001
4002 /* Create a new decl if DECL is NULL, otherwise fix it */
c2952b01 4003 decl = maybe_create_class_interface_decl (decl, raw_name, q_name, id);
e04a16fb 4004
0f6cd83f
BM		 4005 /* Interfaces are always abstract. */
4006 flags |= ACC_ABSTRACT;
4007
4008 /* Inner interfaces are always static. */
4009 if (INNER_CLASS_DECL_P (decl))
4010 flags |= ACC_STATIC;
4011
e04a16fb 4012 /* Set super info and mark the class a complete */
e35b68b0 4013 set_super_info (ACC_INTERFACE | flags, TREE_TYPE (decl),
e04a16fb
AG		 4014 object_type_node, ctxp->interface_number);
4015 ctxp->interface_number = 0;
4016 CLASS_COMPLETE_P (decl) = 1;
4017 add_superinterfaces (decl, super);
4018
dcb0eee2
TT		 4019 /* Eventually sets the @deprecated tag flag */
4020 CHECK_DEPRECATED (decl);
4021
e04a16fb
AG		 4022 return decl;
4023}
4024
c2952b01
APB		 4025/* Patch anonymous class CLASS, by either extending or implementing
4026 DEP. */
4027
4028static void
0a2f0c54 4029patch_anonymous_class (tree type_decl, tree class_decl, tree wfl)
c2952b01
APB		 4030{
4031 tree class = TREE_TYPE (class_decl);
4032 tree type = TREE_TYPE (type_decl);
4033 tree binfo = TYPE_BINFO (class);
4034
4035 /* If it's an interface, implement it */
4036 if (CLASS_INTERFACE (type_decl))
4037 {
c2952b01
APB		 4038 if (parser_check_super_interface (type_decl, class_decl, wfl))
4039 return;
4040
0e64e323 4041 if (!VEC_space (tree, BINFO_BASE_BINFOS (binfo), 1))
fa743e8c
NS		 4042 {
4043 /* Extend the binfo - by reallocating and copying it. */
4044 tree new_binfo;
4045 tree base_binfo;
4046 int i;
4047
4048 new_binfo = make_tree_binfo ((BINFO_N_BASE_BINFOS (binfo) + 1) * 2);
4049 for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
4050 BINFO_BASE_APPEND (new_binfo, base_binfo);
4051 CLASS_HAS_SUPER_FLAG (new_binfo) = CLASS_HAS_SUPER_FLAG (binfo);
4052 BINFO_VTABLE (new_binfo) = BINFO_VTABLE (binfo);
4053 TYPE_BINFO (class) = new_binfo;
4054 }
4055
c2952b01
APB		 4056 /* And add the interface */
4057 parser_add_interface (class_decl, type_decl, wfl);
4058 }
4059 /* Otherwise, it's a type we want to extend */
4060 else
4061 {
4062 if (parser_check_super (type_decl, class_decl, wfl))
4063 return;
fa743e8c 4064 BINFO_TYPE (BINFO_BASE_BINFO (binfo, 0)) = type;
c2952b01
APB		 4065 }
4066}
4067
d3ecb597
BM		 4068/* Create an anonymous class which extends/implements TYPE_NAME, and return
4069 its decl. */
4070
c2952b01 4071static tree
d3ecb597 4072create_anonymous_class (tree type_name)
c2952b01
APB		 4073{
4074 char buffer [80];
4075 tree super = NULL_TREE, itf = NULL_TREE;
4076 tree id, type_decl, class;
4077
4078 /* The unqualified name of the anonymous class. It's just a number. */
4079 sprintf (buffer, "%d", anonymous_class_counter++);
4080 id = build_wfl_node (get_identifier (buffer));
d3ecb597 4081 EXPR_WFL_LINECOL (id) = EXPR_WFL_LINECOL (type_name);
c2952b01
APB		 4082
4083 /* We know about the type to extend/implement. We go ahead */
4084 if ((type_decl = IDENTIFIER_CLASS_VALUE (EXPR_WFL_NODE (type_name))))
4085 {
4086 /* Create a class which either implements on extends the designated
67264b4f 4087 class. The class bears an inaccessible name. */
c2952b01
APB		 4088 if (CLASS_INTERFACE (type_decl))
4089 {
4090 /* It's OK to modify it here. It's been already used and
4091 shouldn't be reused */
4092 ctxp->interface_number = 1;
4093 /* Interfaces should presented as a list of WFLs */
4094 itf = build_tree_list (type_name, NULL_TREE);
4095 }
4096 else
4097 super = type_name;
4098 }
4099
4100 class = create_class (ACC_FINAL, id, super, itf);
4101
4102 /* We didn't know anything about the stuff. We register a dependence. */
4103 if (!type_decl)
4104 register_incomplete_type (JDEP_ANONYMOUS, type_name, class, NULL_TREE);
4105
4106 ANONYMOUS_CLASS_P (TREE_TYPE (class)) = 1;
4107 return class;
4108}
4109
a40d21da 4110/* Create a class in pass1 and return its decl. Return class
e04a16fb
AG		 4111 interface's decl in pass 2. */
4112
4113static tree
0a2f0c54 4114create_class (int flags, tree id, tree super, tree interfaces)
e04a16fb 4115{
e04a16fb
AG		 4116 tree raw_name = EXPR_WFL_NODE (id);
4117 tree class_id, decl;
9ee9b555 4118 tree super_decl_type;
e04a16fb 4119
9d7d8362
APB		 4120 /* Certain syntax errors are making SUPER be like ID. Avoid this
4121 case. */
4122 if (ctxp->class_err && id == super)
4123 super = NULL;
4124
98a52c2c 4125 class_id = parser_qualified_classname (raw_name);
e04a16fb
AG		 4126 decl = IDENTIFIER_CLASS_VALUE (class_id);
4127 EXPR_WFL_NODE (id) = class_id;
4128
4129 /* Basic check: scope, redefinition, modifiers */
4130 if (check_class_interface_creation (0, flags, raw_name, class_id, decl, id))
c2952b01
APB		 4131 {
4132 PUSH_ERROR ();
4133 return NULL_TREE;
4134 }
e35b68b0 4135
c2952b01
APB		 4136 /* Suspend the current parsing context if we're parsing an inner
4137 class or an anonymous class. */
4138 if (CPC_INNER_P ())
9d7d8362
APB		 4139 {
4140 java_parser_context_suspend ();
4141 /* Interface members are public. */
4142 if (CLASS_INTERFACE (GET_CPC ()))
4143 flags |= ACC_PUBLIC;
4144 }
e35b68b0 4145
c2952b01
APB		 4146 /* Push a new context for (static) initialized upon declaration fields */
4147 java_parser_context_push_initialized_field ();
e04a16fb 4148
e35b68b0 4149 /* Class modifier check:
e04a16fb 4150 - Allowed modifier (already done at that point)
e35b68b0 4151 - abstract AND final forbidden
e04a16fb
AG		 4152 - Public classes defined in the correct file */
4153 if ((flags & ACC_ABSTRACT) && (flags & ACC_FINAL))
781b0558
KG		 4154 parse_error_context
4155 (id, "Class `%s' can't be declared both abstract and final",
4156 IDENTIFIER_POINTER (raw_name));
e04a16fb
AG		 4157
4158 /* Create a new decl if DECL is NULL, otherwise fix it */
c2952b01 4159 decl = maybe_create_class_interface_decl (decl, raw_name, class_id, id);
e04a16fb
AG		 4160
4161 /* If SUPER exists, use it, otherwise use Object */
4162 if (super)
4163 {
815c5191 4164 /* java.lang.Object can't extend anything. */
e04a16fb
AG		 4165 if (TREE_TYPE (IDENTIFIER_CLASS_VALUE (class_id)) == object_type_node)
4166 {
815c5191 4167 parse_error_context (id, "`java.lang.Object' can't extend anything");
e04a16fb
AG		 4168 return NULL_TREE;
4169 }
4170
e35b68b0 4171 super_decl_type =
2c3199bc 4172 register_incomplete_type (JDEP_SUPER, super, decl, NULL_TREE);
e04a16fb
AG		 4173 }
4174 else if (TREE_TYPE (decl) != object_type_node)
4175 super_decl_type = object_type_node;
4176 /* We're defining java.lang.Object */
4177 else
4178 super_decl_type = NULL_TREE;
4179
6d003d5c
BM		 4180 /* A class nested in an interface is implicitly static. */
4181 if (INNER_CLASS_DECL_P (decl)
4182 && CLASS_INTERFACE (TYPE_NAME (TREE_TYPE (DECL_CONTEXT (decl)))))
4183 {
4184 flags |= ACC_STATIC;
4185 }
4186
4187 /* Set super info and mark the class as complete. */
e35b68b0 4188 set_super_info (flags, TREE_TYPE (decl), super_decl_type,
e04a16fb
AG		 4189 ctxp->interface_number);
4190 ctxp->interface_number = 0;
4191 CLASS_COMPLETE_P (decl) = 1;
4192 add_superinterfaces (decl, interfaces);
4193
af434fa7
AH		 4194 /* TYPE_VFIELD' is a compiler-generated field used to point to
4195 virtual function tables. In gcj, every class has a common base
4196 virtual function table in java.lang.object. */
4197 TYPE_VFIELD (TREE_TYPE (decl)) = TYPE_VFIELD (object_type_node);
4198
c2952b01
APB		 4199 /* Add the private this$<n> field, Replicate final locals still in
4200 scope as private final fields mangled like val$<local_name>.
d3ecb597 4201 This does not occur for top level (static) inner classes. */
c2952b01
APB		 4202 if (PURE_INNER_CLASS_DECL_P (decl))
4203 add_inner_class_fields (decl, current_function_decl);
4204
7f10c2e2
APB		 4205 /* If doing xref, store the location at which the inherited class
4206 (if any) was seen. */
4207 if (flag_emit_xref && super)
4208 DECL_INHERITED_SOURCE_LINE (decl) = EXPR_WFL_LINECOL (super);
4209
5e942c50
APB		 4210 /* Eventually sets the @deprecated tag flag */
4211 CHECK_DEPRECATED (decl);
4212
165f37bc
APB		 4213 /* Reset the anonymous class counter when declaring non inner classes */
4214 if (!INNER_CLASS_DECL_P (decl))
c2952b01
APB		 4215 anonymous_class_counter = 1;
4216
e04a16fb
AG		 4217 return decl;
4218}
4219
c2952b01 4220/* End a class declaration: register the statements used to create
c00f0fb2 4221 finit$ and <clinit>, pop the current class and resume the prior
c2952b01
APB		 4222 parser context if necessary. */
4223
4224static void
0a2f0c54 4225end_class_declaration (int resume)
c2952b01 4226{
a83f01f0 4227 /* If an error occurred, context weren't pushed and won't need to be
c2952b01 4228 popped by a resume. */
a83f01f0 4229 int no_error_occurred = ctxp->next && GET_CPC () != error_mark_node;
c2952b01 4230
12cfb4fc
TT		 4231 if (GET_CPC () != error_mark_node)
4232 dump_java_tree (TDI_class, GET_CPC ());
4233
c2952b01
APB		 4234 java_parser_context_pop_initialized_field ();
4235 POP_CPC ();
a83f01f0 4236 if (resume && no_error_occurred)
c2952b01 4237 java_parser_context_resume ();
93220702
APB		 4238
4239 /* We're ending a class declaration, this is a good time to reset
4240 the interface cout. Note that might have been already done in
4241 create_interface, but if at that time an inner class was being
4242 dealt with, the interface count was reset in a context created
4243 for the sake of handling inner classes declaration. */
4244 ctxp->interface_number = 0;
c2952b01
APB		 4245}
4246
4247static void
0a2f0c54 4248add_inner_class_fields (tree class_decl, tree fct_decl)
c2952b01
APB		 4249{
4250 tree block, marker, f;
4251
4252 f = add_field (TREE_TYPE (class_decl),
4253 build_current_thisn (TREE_TYPE (class_decl)),
e35b68b0 4254 build_pointer_type (TREE_TYPE (DECL_CONTEXT (class_decl))),
c2952b01
APB		 4255 ACC_PRIVATE);
4256 FIELD_THISN (f) = 1;
4257
4258 if (!fct_decl)
4259 return;
e35b68b0
AD		 4260
4261 for (block = GET_CURRENT_BLOCK (fct_decl);
c2952b01
APB		 4262 block && TREE_CODE (block) == BLOCK; block = BLOCK_SUPERCONTEXT (block))
4263 {
4264 tree decl;
4265 for (decl = BLOCK_EXPR_DECLS (block); decl; decl = TREE_CHAIN (decl))
4266 {
1f8f4a0b 4267 tree name, pname;
c2952b01 4268 tree wfl, init, list;
e35b68b0 4269
c2952b01 4270 /* Avoid non final arguments. */
c7303e41 4271 if (!LOCAL_FINAL_P (decl))
c2952b01 4272 continue;
e35b68b0 4273
c2952b01
APB		 4274 MANGLE_OUTER_LOCAL_VARIABLE_NAME (name, DECL_NAME (decl));
4275 MANGLE_ALIAS_INITIALIZER_PARAMETER_NAME_ID (pname, DECL_NAME (decl));
1f8f4a0b
MM		 4276 wfl = build_wfl_node (name);
4277 init = build_wfl_node (pname);
c2952b01 4278 /* Build an initialization for the field: it will be
c00f0fb2 4279 initialized by a parameter added to finit$, bearing a
c2952b01 4280 mangled name of the field itself (param$<n>.) The
c00f0fb2 4281 parameter is provided to finit$ by the constructor
c2952b01
APB		 4282 invoking it (hence the constructor will also feature a
4283 hidden parameter, set to the value of the outer context
4284 local at the time the inner class is created.)
e35b68b0 4285
c2952b01
APB		 4286 Note: we take into account all possible locals that can
4287 be accessed by the inner class. It's actually not trivial
4288 to minimize these aliases down to the ones really
4289 used. One way to do that would be to expand all regular
c00f0fb2 4290 methods first, then finit$ to get a picture of what's
c2952b01
APB		 4291 used. It works with the exception that we would have to
4292 go back on all constructor invoked in regular methods to
67264b4f 4293 have their invocation reworked (to include the right amount
c2952b01
APB		 4294 of alias initializer parameters.)
4295
4296 The only real way around, I think, is a first pass to
4297 identify locals really used in the inner class. We leave
4298 the flag FIELD_LOCAL_ALIAS_USED around for that future
4299 use.
e35b68b0 4300
c2952b01 4301 On the other hand, it only affect local inner classes,
c00f0fb2 4302 whose constructors (and finit$ call) will be featuring
67264b4f 4303 unnecessary arguments. It's easy for a developer to keep
c2952b01
APB		 4304 this number of parameter down by using the `final'
4305 keyword only when necessary. For the time being, we can
67264b4f 4306 issue a warning on unnecessary finals. FIXME */
e35b68b0 4307 init = build_assignment (ASSIGN_TK, EXPR_WFL_LINECOL (wfl),
c2952b01
APB		 4308 wfl, init);
4309
4310 /* Register the field. The TREE_LIST holding the part
4311 initialized/initializer will be marked ARG_FINAL_P so
4312 that the created field can be marked
4313 FIELD_LOCAL_ALIAS. */
4314 list = build_tree_list (wfl, init);
4315 ARG_FINAL_P (list) = 1;
4316 register_fields (ACC_PRIVATE | ACC_FINAL, TREE_TYPE (decl), list);
4317 }
4318 }
4319
4320 if (!CPC_INITIALIZER_STMT (ctxp))
4321 return;
4322
4323 /* If we ever registered an alias field, insert and marker to
67264b4f 4324 remember where the list ends. The second part of the list (the one
c2952b01
APB		 4325 featuring initialized fields) so it can be later reversed to
4326 enforce 8.5. The marker will be removed during that operation. */
4327 marker = build_tree_list (NULL_TREE, NULL_TREE);
4328 TREE_CHAIN (marker) = CPC_INITIALIZER_STMT (ctxp);
4329 SET_CPC_INITIALIZER_STMT (ctxp, marker);
4330}
4331
e04a16fb
AG		 4332/* Can't use lookup_field () since we don't want to load the class and
4333 can't set the CLASS_LOADED_P flag */
4334
4335static tree
0a2f0c54 4336find_field (tree class, tree name)
e04a16fb
AG		 4337{
4338 tree decl;
4339 for (decl = TYPE_FIELDS (class); decl; decl = TREE_CHAIN (decl))
4340 {
4341 if (DECL_NAME (decl) == name)
4342 return decl;
4343 }
4344 return NULL_TREE;
4345}
4346
4347/* Wrap around lookup_field that doesn't potentially upset the value
4348 of CLASS */
4349
4350static tree
0a2f0c54 4351lookup_field_wrapper (tree class, tree name)
e04a16fb
AG		 4352{
4353 tree type = class;
9a7ab4b3 4354 tree decl = NULL_TREE;
c877974e 4355 java_parser_context_save_global ();
f2760b27
APB		 4356
4357 /* Last chance: if we're within the context of an inner class, we
4358 might be trying to access a local variable defined in an outer
4359 context. We try to look for it now. */
19559012 4360 if (INNER_CLASS_TYPE_P (class) && TREE_CODE (name) == IDENTIFIER_NODE)
f2760b27 4361 {
9a7ab4b3 4362 tree new_name;
1f8f4a0b 4363 MANGLE_OUTER_LOCAL_VARIABLE_NAME (new_name, name);
9a7ab4b3 4364 decl = lookup_field (&type, new_name);
f2760b27
APB		 4365 if (decl && decl != error_mark_node)
4366 FIELD_LOCAL_ALIAS_USED (decl) = 1;
4367 }
9a7ab4b3
APB		 4368 if (!decl || decl == error_mark_node)
4369 {
4370 type = class;
4371 decl = lookup_field (&type, name);
4372 }
f2760b27 4373
05833095
BM		 4374 /* If the field still hasn't been found, try the next enclosing context. */
4375 if (!decl && INNER_CLASS_TYPE_P (class))
4376 {
4377 tree outer_type = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (class)));
4378 decl = lookup_field_wrapper (outer_type, name);
4379 }
4380
c877974e 4381 java_parser_context_restore_global ();
93024893 4382 return decl == error_mark_node ? NULL : decl;
e04a16fb
AG		 4383}
4384
4385/* Find duplicate field within the same class declarations and report
c583dd46
APB		 4386 the error. Returns 1 if a duplicated field was found, 0
4387 otherwise. */
e04a16fb
AG		 4388
4389static int
0a2f0c54 4390duplicate_declaration_error_p (tree new_field_name, tree new_type, tree cl)
e04a16fb
AG		 4391{
4392 /* This might be modified to work with method decl as well */
c2952b01 4393 tree decl = find_field (TREE_TYPE (GET_CPC ()), new_field_name);
e04a16fb
AG		 4394 if (decl)
4395 {
c2e3db92 4396 char *t1 = xstrdup (purify_type_name
e35b68b0 4397 ((TREE_CODE (new_type) == POINTER_TYPE
4a5f66c3
APB		 4398 && TREE_TYPE (new_type) == NULL_TREE) ?
4399 IDENTIFIER_POINTER (TYPE_NAME (new_type)) :
4400 lang_printable_name (new_type, 1)));
c877974e
APB		 4401 /* The type may not have been completed by the time we report
4402 the error */
c2e3db92 4403 char *t2 = xstrdup (purify_type_name
e35b68b0 4404 ((TREE_CODE (TREE_TYPE (decl)) == POINTER_TYPE
c877974e
APB		 4405 && TREE_TYPE (TREE_TYPE (decl)) == NULL_TREE) ?
4406 IDENTIFIER_POINTER (TYPE_NAME (TREE_TYPE (decl))) :
4407 lang_printable_name (TREE_TYPE (decl), 1)));
e35b68b0
AD		 4408 parse_error_context
4409 (cl , "Duplicate variable declaration: `%s %s' was `%s %s' (%s:%d)",
e04a16fb
AG		 4410 t1, IDENTIFIER_POINTER (new_field_name),
4411 t2, IDENTIFIER_POINTER (DECL_NAME (decl)),
f31686a3 4412 DECL_SOURCE_FILE (decl), DECL_SOURCE_LINE (decl));
e04a16fb
AG		 4413 free (t1);
4414 free (t2);
c583dd46 4415 return 1;
e04a16fb 4416 }
c583dd46 4417 return 0;
e04a16fb
AG		 4418}
4419
4420/* Field registration routine. If TYPE doesn't exist, field
4421 declarations are linked to the undefined TYPE dependency list, to
4422 be later resolved in java_complete_class () */
4423
4424static void
0a2f0c54 4425register_fields (int flags, tree type, tree variable_list)
e04a16fb 4426{
c583dd46 4427 tree current, saved_type;
c2952b01 4428 tree class_type = NULL_TREE;
9ec819d4 4429 location_t saved_location = input_location;
e04a16fb
AG		 4430 int must_chain = 0;
4431 tree wfl = NULL_TREE;
4432
c2952b01
APB		 4433 if (GET_CPC ())
4434 class_type = TREE_TYPE (GET_CPC ());
4435
4436 if (!class_type || class_type == error_mark_node)
4437 return;
4438
e04a16fb
AG		 4439 /* If we're adding fields to interfaces, those fields are public,
4440 static, final */
4441 if (CLASS_INTERFACE (TYPE_NAME (class_type)))
4442 {
4443 OBSOLETE_MODIFIER_WARNING (MODIFIER_WFL (PUBLIC_TK),
2884c41e 4444 flags, ACC_PUBLIC, "interface field(s)");
e04a16fb 4445 OBSOLETE_MODIFIER_WARNING (MODIFIER_WFL (STATIC_TK),
2884c41e 4446 flags, ACC_STATIC, "interface field(s)");
e04a16fb 4447 OBSOLETE_MODIFIER_WARNING (MODIFIER_WFL (FINAL_TK),
2884c41e 4448 flags, ACC_FINAL, "interface field(s)");
e04a16fb
AG		 4449 check_modifiers ("Illegal interface member modifier `%s'", flags,
4450 INTERFACE_FIELD_MODIFIERS);
4451 flags |= (ACC_PUBLIC | ACC_STATIC | ACC_FINAL);
4452 }
4453
c583dd46
APB		 4454 /* Obtain a suitable type for resolution, if necessary */
4455 SET_TYPE_FOR_RESOLUTION (type, wfl, must_chain);
4456
4457 /* If TYPE is fully resolved and we don't have a reference, make one */
1886c9d8 4458 PROMOTE_RECORD_IF_COMPLETE (type, must_chain);
e04a16fb 4459
e35b68b0 4460 for (current = variable_list, saved_type = type; current;
c583dd46 4461 current = TREE_CHAIN (current), type = saved_type)
e04a16fb 4462 {
c877974e 4463 tree real_type;
c583dd46 4464 tree field_decl;
e04a16fb
AG		 4465 tree cl = TREE_PURPOSE (current);
4466 tree init = TREE_VALUE (current);
4467 tree current_name = EXPR_WFL_NODE (cl);
4468
cf1748bf 4469 /* Can't declare non-final static fields in inner classes */
c2952b01 4470 if ((flags & ACC_STATIC) && !TOPLEVEL_CLASS_TYPE_P (class_type)
cf1748bf 4471 && !(flags & ACC_FINAL))
e35b68b0 4472 parse_error_context
cf1748bf 4473 (cl, "Field `%s' can't be static in inner class `%s' unless it is final",
c2952b01
APB		 4474 IDENTIFIER_POINTER (EXPR_WFL_NODE (cl)),
4475 lang_printable_name (class_type, 0));
4476
c583dd46
APB		 4477 /* Process NAME, as it may specify extra dimension(s) for it */
4478 type = build_array_from_name (type, wfl, current_name, &current_name);
4479
c583dd46
APB		 4480 /* Type adjustment. We may have just readjusted TYPE because
4481 the variable specified more dimensions. Make sure we have
22eed1e6
APB		 4482 a reference if we can and don't have one already. Also
4483 change the name if we have an init. */
4484 if (type != saved_type)
4485 {
1886c9d8 4486 PROMOTE_RECORD_IF_COMPLETE (type, must_chain);
22eed1e6
APB		 4487 if (init)
4488 EXPR_WFL_NODE (TREE_OPERAND (init, 0)) = current_name;
4489 }
e04a16fb 4490
c877974e
APB		 4491 real_type = GET_REAL_TYPE (type);
4492 /* Check for redeclarations */
4493 if (duplicate_declaration_error_p (current_name, real_type, cl))
4494 continue;
4495
6de9cd9a 4496 /* Set input_line to the line the field was found and create a
5e942c50 4497 declaration for it. Eventually sets the @deprecated tag flag. */
9ec819d4
PB		 4498#ifdef USE_MAPPED_LOCATION
4499 input_location = EXPR_LOCATION (cl);
4500#else
f099f336 4501 if (flag_emit_xref)
d479d37f 4502 input_line = EXPR_WFL_LINECOL (cl);
f099f336 4503 else
d479d37f 4504 input_line = EXPR_WFL_LINENO (cl);
9ec819d4 4505#endif
c877974e 4506 field_decl = add_field (class_type, current_name, real_type, flags);
f94ae540 4507 CHECK_DEPRECATED_NO_RESET (field_decl);
c2952b01 4508
c7303e41
APB		 4509 /* If the field denotes a final instance variable, then we
4510 allocate a LANG_DECL_SPECIFIC part to keep track of its
4511 initialization. We also mark whether the field was
4f88ccda 4512 initialized upon its declaration. We don't do that if the
c7303e41
APB		 4513 created field is an alias to a final local. */
4514 if (!ARG_FINAL_P (current) && (flags & ACC_FINAL))
4515 {
4516 MAYBE_CREATE_VAR_LANG_DECL_SPECIFIC (field_decl);
4517 DECL_FIELD_FINAL_WFL (field_decl) = cl;
c7303e41
APB		 4518 }
4519
4520 /* If the couple initializer/initialized is marked ARG_FINAL_P,
4521 we mark the created field FIELD_LOCAL_ALIAS, so that we can
4522 hide parameters to this inner class finit$ and
4523 constructors. It also means that the field isn't final per
4524 say. */
c2952b01 4525 if (ARG_FINAL_P (current))
c7303e41
APB		 4526 {
4527 FIELD_LOCAL_ALIAS (field_decl) = 1;
4528 FIELD_FINAL (field_decl) = 0;
4529 }
e35b68b0 4530
c583dd46
APB		 4531 /* Check if we must chain. */
4532 if (must_chain)
4533 register_incomplete_type (JDEP_FIELD, wfl, field_decl, type);
e35b68b0 4534
c583dd46
APB		 4535 /* If we have an initialization value tied to the field */
4536 if (init)
4537 {
4538 /* The field is declared static */
e04a16fb 4539 if (flags & ACC_STATIC)
e04a16fb 4540 {
7525cc04
APB		 4541 /* We include the field and its initialization part into
4542 a list used to generate <clinit>. After <clinit> is
ba179f9f
APB		 4543 walked, field initializations will be processed and
4544 fields initialized with known constants will be taken
4545 out of <clinit> and have their DECL_INITIAL set
7525cc04 4546 appropriately. */
c2952b01
APB		 4547 TREE_CHAIN (init) = CPC_STATIC_INITIALIZER_STMT (ctxp);
4548 SET_CPC_STATIC_INITIALIZER_STMT (ctxp, init);
e35b68b0 4549 if (TREE_OPERAND (init, 1)
7f10c2e2 4550 && TREE_CODE (TREE_OPERAND (init, 1)) == NEW_ARRAY_INIT)
5bba4807 4551 TREE_STATIC (TREE_OPERAND (init, 1)) = 1;
e04a16fb 4552 }
5e942c50
APB		 4553 /* A non-static field declared with an immediate initialization is
4554 to be initialized in <init>, if any. This field is remembered
4555 to be processed at the time of the generation of <init>. */
c583dd46
APB		 4556 else
4557 {
c2952b01
APB		 4558 TREE_CHAIN (init) = CPC_INITIALIZER_STMT (ctxp);
4559 SET_CPC_INITIALIZER_STMT (ctxp, init);
c583dd46 4560 }
5b09b33e 4561 MODIFY_EXPR_FROM_INITIALIZATION_P (init) = 1;
8576f094 4562 DECL_INITIAL (field_decl) = TREE_OPERAND (init, 1);
e04a16fb
AG		 4563 }
4564 }
f94ae540
TT		 4565
4566 CLEAR_DEPRECATED;
9ec819d4 4567 input_location = saved_location;
e04a16fb
AG		 4568}
4569
c00f0fb2
APB		 4570/* Generate finit$, using the list of initialized fields to populate
4571 its body. finit$'s parameter(s) list is adjusted to include the
c2952b01 4572 one(s) used to initialized the field(s) caching outer context
2e3b2d2c 4573 local(s). */
22eed1e6 4574
c2952b01 4575static tree
0a2f0c54 4576generate_finit (tree class_type)
22eed1e6 4577{
c2952b01
APB		 4578 int count = 0;
4579 tree list = TYPE_FINIT_STMT_LIST (class_type);
4580 tree mdecl, current, parms;
4581
e35b68b0
AD		 4582 parms = build_alias_initializer_parameter_list (AIPL_FUNCTION_CREATION,
4583 class_type, NULL_TREE,
c2952b01
APB		 4584 &count);
4585 CRAFTED_PARAM_LIST_FIXUP (parms);
4586 mdecl = create_artificial_method (class_type, ACC_PRIVATE, void_type_node,
4587 finit_identifier_node, parms);
4588 fix_method_argument_names (parms, mdecl);
4589 layout_class_method (class_type, CLASSTYPE_SUPER (class_type),
4590 mdecl, NULL_TREE);
4591 DECL_FUNCTION_NAP (mdecl) = count;
22eed1e6
APB		 4592 start_artificial_method_body (mdecl);
4593
c2952b01 4594 for (current = list; current; current = TREE_CHAIN (current))
e35b68b0
AD		 4595 java_method_add_stmt (mdecl,
4596 build_debugable_stmt (EXPR_WFL_LINECOL (current),
22eed1e6 4597 current));
22eed1e6 4598 end_artificial_method_body (mdecl);
c2952b01 4599 return mdecl;
22eed1e6
APB		 4600}
4601
17126208
APB		 4602/* Generate a function to run the instance initialization code. The
4603 private method is called `instinit$'. Unless we're dealing with an
4604 anonymous class, we determine whether all ctors of CLASS_TYPE
4605 declare a checked exception in their `throws' clause in order to
4606 see whether it's necessary to encapsulate the instance initializer
4607 statements in a try/catch/rethrow sequence. */
4608
73c299fc 4609static tree
0a2f0c54 4610generate_instinit (tree class_type)
e04a16fb 4611{
73c299fc 4612 tree current;
17126208
APB		 4613 tree compound = NULL_TREE;
4614 tree parms = tree_cons (this_identifier_node,
4615 build_pointer_type (class_type), end_params_node);
4616 tree mdecl = create_artificial_method (class_type, ACC_PRIVATE,
4617 void_type_node,
4618 instinit_identifier_node, parms);
4619
4620 layout_class_method (class_type, CLASSTYPE_SUPER (class_type),
4621 mdecl, NULL_TREE);
e04a16fb 4622
17126208 4623 /* Gather all the statements in a compound */
e35b68b0 4624 for (current = TYPE_II_STMT_LIST (class_type);
17126208 4625 current; current = TREE_CHAIN (current))
73c299fc 4626 compound = add_stmt_to_compound (compound, NULL_TREE, current);
e04a16fb 4627
17126208
APB		 4628 /* We need to encapsulate COMPOUND by a try/catch statement to
4629 rethrow exceptions that might occur in the instance initializer.
4630 We do that only if all ctors of CLASS_TYPE are set to catch a
4631 checked exception. This doesn't apply to anonymous classes (since
4632 they don't have declared ctors.) */
e35b68b0 4633 if (!ANONYMOUS_CLASS_P (class_type) &&
17126208
APB		 4634 ctors_unchecked_throws_clause_p (class_type))
4635 {
e35b68b0 4636 compound = encapsulate_with_try_catch (0, exception_type_node, compound,
17126208
APB		 4637 build1 (THROW_EXPR, NULL_TREE,
4638 build_wfl_node (wpv_id)));
4639 DECL_FUNCTION_THROWS (mdecl) = build_tree_list (NULL_TREE,
4640 exception_type_node);
4641 }
4642
4643 start_artificial_method_body (mdecl);
4644 java_method_add_stmt (mdecl, compound);
4645 end_artificial_method_body (mdecl);
4646
4647 return mdecl;
73c299fc
APB		 4648}
4649
17126208
APB		 4650/* FIXME */
4651static tree
0a2f0c54 4652build_instinit_invocation (tree class_type)
73c299fc 4653{
17126208 4654 tree to_return = NULL_TREE;
73c299fc 4655
17126208
APB		 4656 if (TYPE_II_STMT_LIST (class_type))
4657 {
4658 tree parm = build_tree_list (NULL_TREE,
4659 build_wfl_node (this_identifier_node));
4660 to_return =
4661 build_method_invocation (build_wfl_node (instinit_identifier_node),
4662 parm);
4663 }
4664 return to_return;
e04a16fb
AG		 4665}
4666
67264b4f 4667/* Shared across method_declarator and method_header to remember the
e04a16fb
AG		 4668 patch stage that was reached during the declaration of the method.
4669 A method DECL is built differently is there is no patch
4670 (JDEP_NO_PATCH) or a patch (JDEP_METHOD or JDEP_METHOD_RETURN)
4671 pending on the currently defined method. */
4672
4673static int patch_stage;
4674
4675/* Check the method declaration and add the method to its current
4676 class. If the argument list is known to contain incomplete types,
4677 the method is partially added and the registration will be resume
22eed1e6
APB		 4678 once the method arguments resolved. If TYPE is NULL, we're dealing
4679 with a constructor. */
e04a16fb
AG		 4680
4681static tree
0a2f0c54 4682method_header (int flags, tree type, tree mdecl, tree throws)
e04a16fb 4683{
1886c9d8 4684 tree type_wfl = NULL_TREE;
79d13333 4685 tree meth_name = NULL_TREE;
c2952b01 4686 tree current, orig_arg, this_class = NULL;
34d4df06 4687 tree id, meth;
9ec819d4 4688 location_t saved_location;
1886c9d8 4689 int constructor_ok = 0, must_chain;
c2952b01 4690 int count;
34d4df06
APB		 4691
4692 if (mdecl == error_mark_node)
4693 return error_mark_node;
4694 meth = TREE_VALUE (mdecl);
4695 id = TREE_PURPOSE (mdecl);
e35b68b0 4696
e04a16fb 4697 check_modifiers_consistency (flags);
79d13333 4698
c2952b01
APB		 4699 if (GET_CPC ())
4700 this_class = TREE_TYPE (GET_CPC ());
4701
4702 if (!this_class || this_class == error_mark_node)
79d13333 4703 return NULL_TREE;
e35b68b0 4704
e04a16fb
AG		 4705 /* There are some forbidden modifiers for an abstract method and its
4706 class must be abstract as well. */
22eed1e6 4707 if (type && (flags & ACC_ABSTRACT))
e04a16fb
AG		 4708 {
4709 ABSTRACT_CHECK (flags, ACC_PRIVATE, id, "Private");
4710 ABSTRACT_CHECK (flags, ACC_STATIC, id, "Static");
4711 ABSTRACT_CHECK (flags, ACC_FINAL, id, "Final");
4712 ABSTRACT_CHECK (flags, ACC_NATIVE, id, "Native");
6b6294f1
TT		 4713 ABSTRACT_CHECK (flags, ACC_SYNCHRONIZED, id, "Synchronized");
4714 ABSTRACT_CHECK (flags, ACC_STRICT, id, "Strictfp");
2aa11e97
APB		 4715 if (!CLASS_ABSTRACT (TYPE_NAME (this_class))
4716 && !CLASS_INTERFACE (TYPE_NAME (this_class)))
e35b68b0
AD		 4717 parse_error_context
4718 (id, "Class `%s' must be declared abstract to define abstract method `%s'",
e7c7bcef 4719 IDENTIFIER_POINTER (DECL_NAME (GET_CPC ())),
e04a16fb
AG		 4720 IDENTIFIER_POINTER (EXPR_WFL_NODE (id)));
4721 }
c2952b01 4722
9179646e
TT		 4723 /* A native method can't be strictfp. */
4724 if ((flags & ACC_NATIVE) && (flags & ACC_STRICT))
4725 parse_error_context (id, "native method `%s' can't be strictfp",
4726 IDENTIFIER_POINTER (EXPR_WFL_NODE (id)));
4727 /* No such thing as a transient or volatile method. */
4728 if ((flags & ACC_TRANSIENT))
4729 parse_error_context (id, "method `%s' can't be transient",
4730 IDENTIFIER_POINTER (EXPR_WFL_NODE (id)));
4731 if ((flags & ACC_VOLATILE))
4732 parse_error_context (id, "method `%s' can't be volatile",
4733 IDENTIFIER_POINTER (EXPR_WFL_NODE (id)));
4734
22eed1e6
APB		 4735 /* Things to be checked when declaring a constructor */
4736 if (!type)
4737 {
4738 int ec = java_error_count;
4739 /* 8.6: Constructor declarations: we might be trying to define a
4740 method without specifying a return type. */
c2952b01 4741 if (EXPR_WFL_NODE (id) != GET_CPC_UN ())
e35b68b0 4742 parse_error_context
22eed1e6
APB		 4743 (id, "Invalid method declaration, return type required");
4744 /* 8.6.3: Constructor modifiers */
4745 else
4746 {
4747 JCONSTRUCTOR_CHECK (flags, ACC_ABSTRACT, id, "abstract");
4748 JCONSTRUCTOR_CHECK (flags, ACC_STATIC, id, "static");
4749 JCONSTRUCTOR_CHECK (flags, ACC_FINAL, id, "final");
4750 JCONSTRUCTOR_CHECK (flags, ACC_NATIVE, id, "native");
4751 JCONSTRUCTOR_CHECK (flags, ACC_SYNCHRONIZED, id, "synchronized");
6b6294f1 4752 JCONSTRUCTOR_CHECK (flags, ACC_STRICT, id, "strictfp");
22eed1e6
APB		 4753 }
4754 /* If we found error here, we don't consider it's OK to tread
4755 the method definition as a constructor, for the rest of this
4756 function */
4757 if (ec == java_error_count)
4758 constructor_ok = 1;
4759 }
e04a16fb
AG		 4760
4761 /* Method declared within the scope of an interface are implicitly
4762 abstract and public. Conflicts with other erroneously provided
c0d87ff6 4763 modifiers are checked right after. */
e04a16fb
AG		 4764
4765 if (CLASS_INTERFACE (TYPE_NAME (this_class)))
4766 {
4767 /* If FLAGS isn't set because of a modifier, turn the
4768 corresponding modifier WFL to NULL so we issue a warning on
4769 the obsolete use of the modifier */
4770 if (!(flags & ACC_PUBLIC))
4771 MODIFIER_WFL (PUBLIC_TK) = NULL;
4772 if (!(flags & ACC_ABSTRACT))
4773 MODIFIER_WFL (ABSTRACT_TK) = NULL;
4774 flags |= ACC_PUBLIC;
4775 flags |= ACC_ABSTRACT;
4776 }
4777
c2952b01
APB		 4778 /* Inner class can't declare static methods */
4779 if ((flags & ACC_STATIC) && !TOPLEVEL_CLASS_TYPE_P (this_class))
4780 {
e35b68b0 4781 parse_error_context
c2952b01
APB		 4782 (id, "Method `%s' can't be static in inner class `%s'. Only members of interfaces and top-level classes can be static",
4783 IDENTIFIER_POINTER (EXPR_WFL_NODE (id)),
4784 lang_printable_name (this_class, 0));
4785 }
4786
e04a16fb
AG		 4787 /* Modifiers context reset moved up, so abstract method declaration
4788 modifiers can be later checked. */
4789
22eed1e6
APB		 4790 /* Set constructor returned type to void and method name to <init>,
4791 unless we found an error identifier the constructor (in which
4792 case we retain the original name) */
4793 if (!type)
4794 {
4795 type = void_type_node;
4796 if (constructor_ok)
4797 meth_name = init_identifier_node;
4798 }
4799 else
4800 meth_name = EXPR_WFL_NODE (id);
e04a16fb 4801
1886c9d8
APB		 4802 /* Do the returned type resolution and registration if necessary */
4803 SET_TYPE_FOR_RESOLUTION (type, type_wfl, must_chain);
4804
4a5f66c3
APB		 4805 if (meth_name)
4806 type = build_array_from_name (type, type_wfl, meth_name, &meth_name);
1886c9d8
APB		 4807 EXPR_WFL_NODE (id) = meth_name;
4808 PROMOTE_RECORD_IF_COMPLETE (type, must_chain);
4809
4810 if (must_chain)
e04a16fb 4811 {
1886c9d8
APB		 4812 patch_stage = JDEP_METHOD_RETURN;
4813 register_incomplete_type (patch_stage, type_wfl, id, type);
4814 TREE_TYPE (meth) = GET_REAL_TYPE (type);
e04a16fb
AG		 4815 }
4816 else
1886c9d8 4817 TREE_TYPE (meth) = type;
e04a16fb 4818
9ec819d4 4819 saved_location = input_location;
e04a16fb
AG		 4820 /* When defining an abstract or interface method, the curly
4821 bracket at level 1 doesn't exist because there is no function
4822 body */
9ec819d4
PB		 4823#ifdef USE_MAPPED_LOCATION
4824 input_location = (ctxp->first_ccb_indent1 ? ctxp->first_ccb_indent1 :
4825 EXPR_LOCATION (id));
4826#else
4827 input_line = (ctxp->first_ccb_indent1 ? (int) ctxp->first_ccb_indent1 :
4828 EXPR_WFL_LINENO (id));
4829#endif
e04a16fb 4830
5e942c50
APB		 4831 /* Remember the original argument list */
4832 orig_arg = TYPE_ARG_TYPES (meth);
4833
e04a16fb
AG		 4834 if (patch_stage) /* includes ret type and/or all args */
4835 {
4836 jdep *jdep;
4837 meth = add_method_1 (this_class, flags, meth_name, meth);
4838 /* Patch for the return type */
4839 if (patch_stage == JDEP_METHOD_RETURN)
4840 {
4841 jdep = CLASSD_LAST (ctxp->classd_list);
4842 JDEP_GET_PATCH (jdep) = &TREE_TYPE (TREE_TYPE (meth));
4843 }
4844 /* This is the stop JDEP. METH allows the function's signature
4845 to be computed. */
4846 register_incomplete_type (JDEP_METHOD_END, NULL_TREE, meth, NULL_TREE);
4847 }
4848 else
e35b68b0 4849 meth = add_method (this_class, flags, meth_name,
5e942c50
APB		 4850 build_java_signature (meth));
4851
c2952b01
APB		 4852 /* Remember final parameters */
4853 MARK_FINAL_PARMS (meth, orig_arg);
4854
5e942c50
APB		 4855 /* Fix the method argument list so we have the argument name
4856 information */
4857 fix_method_argument_names (orig_arg, meth);
4858
4859 /* Register the parameter number and re-install the current line
4860 number */
e04a16fb 4861 DECL_MAX_LOCALS (meth) = ctxp->formal_parameter_number+1;
9ec819d4 4862 input_location = saved_location;
b9f7e36c
APB		 4863
4864 /* Register exception specified by the `throws' keyword for
4865 resolution and set the method decl appropriate field to the list.
4866 Note: the grammar ensures that what we get here are class
4867 types. */
4868 if (throws)
4869 {
4870 throws = nreverse (throws);
4871 for (current = throws; current; current = TREE_CHAIN (current))
4872 {
4873 register_incomplete_type (JDEP_EXCEPTION, TREE_VALUE (current),
4874 NULL_TREE, NULL_TREE);
e35b68b0 4875 JDEP_GET_PATCH (CLASSD_LAST (ctxp->classd_list)) =
b9f7e36c
APB		 4876 &TREE_VALUE (current);
4877 }
4878 DECL_FUNCTION_THROWS (meth) = throws;
4879 }
4880
c4faeb92
APB		 4881 if (TREE_TYPE (GET_CPC ()) != object_type_node)
4882 DECL_FUNCTION_WFL (meth) = id;
4883
22eed1e6
APB		 4884 /* Set the flag if we correctly processed a constructor */
4885 if (constructor_ok)
c2952b01
APB		 4886 {
4887 DECL_CONSTRUCTOR_P (meth) = 1;
4888 /* Compute and store the number of artificial parameters declared
4889 for this constructor */
e35b68b0 4890 for (count = 0, current = TYPE_FIELDS (this_class); current;
c2952b01
APB		 4891 current = TREE_CHAIN (current))
4892 if (FIELD_LOCAL_ALIAS (current))
4893 count++;
4894 DECL_FUNCTION_NAP (meth) = count;
4895 }
22eed1e6 4896
5e942c50
APB		 4897 /* Eventually set the @deprecated tag flag */
4898 CHECK_DEPRECATED (meth);
4899
7f10c2e2
APB		 4900 /* If doing xref, store column and line number information instead
4901 of the line number only. */
4902 if (flag_emit_xref)
9ec819d4
PB		 4903 {
4904#ifdef USE_MAPPED_LOCATION
4905 DECL_SOURCE_LOCATION (meth) = EXPR_LOCATION (id);
4906#else
4907 DECL_SOURCE_LINE (meth) = EXPR_WFL_LINECOL (id);
4908#endif
4909 }
7f10c2e2 4910
e04a16fb
AG		 4911 return meth;
4912}
4913
5e942c50 4914static void
0a2f0c54 4915fix_method_argument_names (tree orig_arg, tree meth)
5e942c50
APB		 4916{
4917 tree arg = TYPE_ARG_TYPES (TREE_TYPE (meth));
4918 if (TREE_CODE (TREE_TYPE (meth)) == METHOD_TYPE)
4919 {
4920 TREE_PURPOSE (arg) = this_identifier_node;
4921 arg = TREE_CHAIN (arg);
4922 }
de4c7b02 4923 while (orig_arg != end_params_node)
5e942c50
APB		 4924 {
4925 TREE_PURPOSE (arg) = TREE_PURPOSE (orig_arg);
4926 orig_arg = TREE_CHAIN (orig_arg);
4927 arg = TREE_CHAIN (arg);
4928 }
4929}
4930
22eed1e6
APB		 4931/* Complete the method declaration with METHOD_BODY. */
4932
4933static void
0a2f0c54 4934finish_method_declaration (tree method_body)
22eed1e6 4935{
79d13333
APB		 4936 int flags;
4937
4938 if (!current_function_decl)
4939 return;
4940
4941 flags = get_access_flags_from_decl (current_function_decl);
5256aa37
APB		 4942
4943 /* 8.4.5 Method Body */
4944 if ((flags & ACC_ABSTRACT || flags & ACC_NATIVE) && method_body)
4945 {
c0b00d37 4946 tree name = DECL_NAME (current_function_decl);
e35b68b0 4947 parse_error_context (DECL_FUNCTION_WFL (current_function_decl),
5256aa37
APB		 4948 "%s method `%s' can't have a body defined",
4949 (METHOD_NATIVE (current_function_decl) ?
4950 "Native" : "Abstract"),
c0b00d37 4951 IDENTIFIER_POINTER (name));
5256aa37
APB		 4952 method_body = NULL_TREE;
4953 }
4954 else if (!(flags & ACC_ABSTRACT) && !(flags & ACC_NATIVE) && !method_body)
4955 {
c0b00d37 4956 tree name = DECL_NAME (current_function_decl);
781b0558 4957 parse_error_context
e35b68b0 4958 (DECL_FUNCTION_WFL (current_function_decl),
781b0558 4959 "Non native and non abstract method `%s' must have a body defined",
c0b00d37 4960 IDENTIFIER_POINTER (name));
5256aa37
APB		 4961 method_body = NULL_TREE;
4962 }
4963
e35b68b0
AD		 4964 if (flag_emit_class_files && method_body
4965 && TREE_CODE (method_body) == NOP_EXPR
4966 && TREE_TYPE (current_function_decl)
2c56429a
APB		 4967 && TREE_TYPE (TREE_TYPE (current_function_decl)) == void_type_node)
4968 method_body = build1 (RETURN_EXPR, void_type_node, NULL);
e803d3b2 4969
22eed1e6
APB		 4970 BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (current_function_decl)) = method_body;
4971 maybe_absorb_scoping_blocks ();
4972 /* Exit function's body */
4973 exit_block ();
4974 /* Merge last line of the function with first line, directly in the
4975 function decl. It will be used to emit correct debug info. */
7f10c2e2 4976 if (!flag_emit_xref)
36f04556 4977 DECL_FUNCTION_LAST_LINE (current_function_decl) = ctxp->last_ccb_indent1;
c2952b01
APB		 4978
4979 /* Since function's argument's list are shared, reset the
4980 ARG_FINAL_P parameter that might have been set on some of this
4981 function parameters. */
4982 UNMARK_FINAL_PARMS (current_function_decl);
e35b68b0 4983
f099f336
APB		 4984 /* So we don't have an irrelevant function declaration context for
4985 the next static block we'll see. */
4986 current_function_decl = NULL_TREE;
22eed1e6
APB		 4987}
4988
4989/* Build a an error message for constructor circularity errors. */
4990
4991static char *
0a2f0c54 4992constructor_circularity_msg (tree from, tree to)
22eed1e6
APB		 4993{
4994 static char string [4096];
1b9deeb4
AH		 4995 char *t = xstrdup (lang_printable_name (from, 2));
4996 sprintf (string, "`%s' invokes `%s'", t, lang_printable_name (to, 2));
22eed1e6
APB		 4997 free (t);
4998 return string;
4999}
5000
5001/* Verify a circular call to METH. Return 1 if an error is found, 0
5002 otherwise. */
5003
e2500fed 5004static GTY(()) tree vcc_list;
22eed1e6 5005static int
0a2f0c54 5006verify_constructor_circularity (tree meth, tree current)
22eed1e6 5007{
22eed1e6 5008 tree c;
19e223db 5009
22eed1e6
APB		 5010 for (c = DECL_CONSTRUCTOR_CALLS (current); c; c = TREE_CHAIN (c))
5011 {
5012 if (TREE_VALUE (c) == meth)
5013 {
5014 char *t;
e2500fed 5015 if (vcc_list)
22eed1e6
APB		 5016 {
5017 tree liste;
e2500fed
GK		 5018 vcc_list = nreverse (vcc_list);
5019 for (liste = vcc_list; liste; liste = TREE_CHAIN (liste))
22eed1e6 5020 {
e35b68b0 5021 parse_error_context
c63b98cd 5022 (TREE_PURPOSE (TREE_PURPOSE (liste)), "%s",
22eed1e6 5023 constructor_circularity_msg
e35b68b0 5024 (TREE_VALUE (liste), TREE_VALUE (TREE_PURPOSE (liste))));
22eed1e6
APB		 5025 java_error_count--;
5026 }
5027 }
1b9deeb4 5028 t = xstrdup (lang_printable_name (meth, 2));
e35b68b0 5029 parse_error_context (TREE_PURPOSE (c),
22eed1e6
APB		 5030 "%s: recursive invocation of constructor `%s'",
5031 constructor_circularity_msg (current, meth), t);
5032 free (t);
e2500fed 5033 vcc_list = NULL_TREE;
22eed1e6
APB		 5034 return 1;
5035 }
5036 }
5037 for (c = DECL_CONSTRUCTOR_CALLS (current); c; c = TREE_CHAIN (c))
5038 {
e2500fed 5039 vcc_list = tree_cons (c, current, vcc_list);
22eed1e6
APB		 5040 if (verify_constructor_circularity (meth, TREE_VALUE (c)))
5041 return 1;
e2500fed 5042 vcc_list = TREE_CHAIN (vcc_list);
22eed1e6
APB		 5043 }
5044 return 0;
5045}
5046
e04a16fb
AG		 5047/* Check modifiers that can be declared but exclusively */
5048
5049static void
0a2f0c54 5050check_modifiers_consistency (int flags)
e04a16fb
AG		 5051{
5052 int acc_count = 0;
5053 tree cl = NULL_TREE;
5054
e0fc4118
TT		 5055 THIS_MODIFIER_ONLY (flags, ACC_PUBLIC, PUBLIC_TK, acc_count, cl);
5056 THIS_MODIFIER_ONLY (flags, ACC_PRIVATE, PRIVATE_TK, acc_count, cl);
5057 THIS_MODIFIER_ONLY (flags, ACC_PROTECTED, PROTECTED_TK, acc_count, cl);
e04a16fb
AG		 5058 if (acc_count > 1)
5059 parse_error_context
e0fc4118
TT		 5060 (cl, "Inconsistent member declaration. At most one of `public', `private', or `protected' may be specified");
5061
5062 acc_count = 0;
5063 cl = NULL_TREE;
14d075d8
TT		 5064 THIS_MODIFIER_ONLY (flags, ACC_FINAL, FINAL_TK, acc_count, cl);
5065 THIS_MODIFIER_ONLY (flags, ACC_VOLATILE, VOLATILE_TK, acc_count, cl);
e0fc4118
TT		 5066 if (acc_count > 1)
5067 parse_error_context (cl,
5068 "Inconsistent member declaration. At most one of `final' or `volatile' may be specified");
e04a16fb
AG		 5069}
5070
5071/* Check the methode header METH for abstract specifics features */
5072
5073static void
0a2f0c54 5074check_abstract_method_header (tree meth)
e04a16fb
AG		 5075{
5076 int flags = get_access_flags_from_decl (meth);
e04a16fb 5077
2884c41e
KG		 5078 OBSOLETE_MODIFIER_WARNING2 (MODIFIER_WFL (ABSTRACT_TK), flags,
5079 ACC_ABSTRACT, "abstract method",
c4faeb92 5080 IDENTIFIER_POINTER (DECL_NAME (meth)));
e35b68b0 5081 OBSOLETE_MODIFIER_WARNING2 (MODIFIER_WFL (PUBLIC_TK), flags,
2884c41e 5082 ACC_PUBLIC, "abstract method",
c4faeb92 5083 IDENTIFIER_POINTER (DECL_NAME (meth)));
e04a16fb
AG		 5084
5085 check_modifiers ("Illegal modifier `%s' for interface method",
5086 flags, INTERFACE_METHOD_MODIFIERS);
5087}
5088
5089/* Create a FUNCTION_TYPE node and start augmenting it with the
5090 declared function arguments. Arguments type that can't be resolved
5091 are left as they are, but the returned node is marked as containing
5092 incomplete types. */
5093
5094static tree
0a2f0c54 5095method_declarator (tree id, tree list)
e04a16fb
AG		 5096{
5097 tree arg_types = NULL_TREE, current, node;
5098 tree meth = make_node (FUNCTION_TYPE);
5099 jdep *jdep;
e04a16fb
AG		 5100
5101 patch_stage = JDEP_NO_PATCH;
c2952b01 5102
34d4df06
APB		 5103 if (GET_CPC () == error_mark_node)
5104 return error_mark_node;
5105
c2952b01
APB		 5106 /* If we're dealing with an inner class constructor, we hide the
5107 this$<n> decl in the name field of its parameter declaration. We
5108 also might have to hide the outer context local alias
5109 initializers. Not done when the class is a toplevel class. */
e35b68b0 5110 if (PURE_INNER_CLASS_DECL_P (GET_CPC ())
c2952b01
APB		 5111 && EXPR_WFL_NODE (id) == GET_CPC_UN ())
5112 {
5113 tree aliases_list, type, thisn;
5114 /* First the aliases, linked to the regular parameters */
5115 aliases_list =
e35b68b0 5116 build_alias_initializer_parameter_list (AIPL_FUNCTION_DECLARATION,
c2952b01
APB		 5117 TREE_TYPE (GET_CPC ()),
5118 NULL_TREE, NULL);
5119 list = chainon (nreverse (aliases_list), list);
5120
5121 /* Then this$<n> */
5122 type = TREE_TYPE (DECL_CONTEXT (GET_CPC ()));
9a7ab4b3 5123 thisn = build_current_thisn (TREE_TYPE (GET_CPC ()));
c2952b01
APB		 5124 list = tree_cons (build_wfl_node (thisn), build_pointer_type (type),
5125 list);
5126 }
e35b68b0 5127
e04a16fb
AG		 5128 for (current = list; current; current = TREE_CHAIN (current))
5129 {
c583dd46 5130 int must_chain = 0;
e04a16fb
AG		 5131 tree wfl_name = TREE_PURPOSE (current);
5132 tree type = TREE_VALUE (current);
5133 tree name = EXPR_WFL_NODE (wfl_name);
c583dd46
APB		 5134 tree already, arg_node;
5135 tree type_wfl = NULL_TREE;
23a79c61 5136 tree real_type;
c583dd46
APB		 5137
5138 /* Obtain a suitable type for resolution, if necessary */
5139 SET_TYPE_FOR_RESOLUTION (type, type_wfl, must_chain);
5140
5141 /* Process NAME, as it may specify extra dimension(s) for it */
5142 type = build_array_from_name (type, type_wfl, name, &name);
5143 EXPR_WFL_NODE (wfl_name) = name;
e04a16fb 5144
23a79c61
APB		 5145 real_type = GET_REAL_TYPE (type);
5146 if (TREE_CODE (real_type) == RECORD_TYPE)
5147 {
5148 real_type = promote_type (real_type);
5149 if (TREE_CODE (type) == TREE_LIST)
5150 TREE_PURPOSE (type) = real_type;
5151 }
5e942c50 5152
e04a16fb
AG		 5153 /* Check redefinition */
5154 for (already = arg_types; already; already = TREE_CHAIN (already))
5155 if (TREE_PURPOSE (already) == name)
5156 {
781b0558
KG		 5157 parse_error_context
5158 (wfl_name, "Variable `%s' is used more than once in the argument list of method `%s'",
5159 IDENTIFIER_POINTER (name),
e04a16fb
AG		 5160 IDENTIFIER_POINTER (EXPR_WFL_NODE (id)));
5161 break;
5162 }
5163
5164 /* If we've an incomplete argument type, we know there is a location
5165 to patch when the type get resolved, later. */
5166 jdep = NULL;
c583dd46 5167 if (must_chain)
e04a16fb 5168 {
c583dd46 5169 patch_stage = JDEP_METHOD;
e35b68b0 5170 type = register_incomplete_type (patch_stage,
c583dd46
APB		 5171 type_wfl, wfl_name, type);
5172 jdep = CLASSD_LAST (ctxp->classd_list);
5173 JDEP_MISC (jdep) = id;
e04a16fb 5174 }
c583dd46 5175
c2952b01 5176 /* The argument node: a name and a (possibly) incomplete type. */
23a79c61 5177 arg_node = build_tree_list (name, real_type);
67264b4f 5178 /* Remember arguments declared final. */
c2952b01 5179 ARG_FINAL_P (arg_node) = ARG_FINAL_P (current);
e35b68b0 5180
e04a16fb
AG		 5181 if (jdep)
5182 JDEP_GET_PATCH (jdep) = &TREE_VALUE (arg_node);
5183 TREE_CHAIN (arg_node) = arg_types;
5184 arg_types = arg_node;
5185 }
de4c7b02 5186 TYPE_ARG_TYPES (meth) = chainon (nreverse (arg_types), end_params_node);
e04a16fb
AG		 5187 node = build_tree_list (id, meth);
5188 return node;
5189}
5190
5191static int
0a2f0c54 5192unresolved_type_p (tree wfl, tree *returned)
e04a16fb
AG		 5193{
5194 if (TREE_CODE (wfl) == EXPR_WITH_FILE_LOCATION)
5195 {
e04a16fb 5196 if (returned)
165f37bc
APB		 5197 {
5198 tree decl = IDENTIFIER_CLASS_VALUE (EXPR_WFL_NODE (wfl));
5199 if (decl && current_class && (decl == TYPE_NAME (current_class)))
5200 *returned = TREE_TYPE (decl);
5201 else if (GET_CPC_UN () == EXPR_WFL_NODE (wfl))
5202 *returned = TREE_TYPE (GET_CPC ());
5203 else
5204 *returned = NULL_TREE;
5205 }
e04a16fb
AG		 5206 return 1;
5207 }
5208 if (returned)
5209 *returned = wfl;
5210 return 0;
5211}
5212
5213/* From NAME, build a qualified identifier node using the
5214 qualification from the current package definition. */
5215
5216static tree
0a2f0c54 5217parser_qualified_classname (tree name)
e04a16fb 5218{
c2952b01
APB		 5219 tree nested_class_name;
5220
98a52c2c 5221 if ((nested_class_name = maybe_make_nested_class_name (name)))
c2952b01
APB		 5222 return nested_class_name;
5223
e04a16fb 5224 if (ctxp->package)
c2952b01 5225 return merge_qualified_name (ctxp->package, name);
e35b68b0 5226 else
c2952b01 5227 return name;
e04a16fb
AG		 5228}
5229
5230/* Called once the type a interface extends is resolved. Returns 0 if
5231 everything is OK. */
5232
5233static int
0a2f0c54 5234parser_check_super_interface (tree super_decl, tree this_decl, tree this_wfl)
e04a16fb
AG		 5235{
5236 tree super_type = TREE_TYPE (super_decl);
5237
5238 /* Has to be an interface */
c2952b01 5239 if (!CLASS_INTERFACE (super_decl))
e04a16fb 5240 {
e35b68b0 5241 parse_error_context
6befbee5 5242 (this_wfl, "%s `%s' can't implement/extend %s `%s'",
e35b68b0 5243 (CLASS_INTERFACE (TYPE_NAME (TREE_TYPE (this_decl))) ?
6befbee5
BM		 5244 "Interface" : "Class"),
5245 IDENTIFIER_POINTER (DECL_NAME (this_decl)),
5246 (TYPE_ARRAY_P (super_type) ? "array" : "class"),
5247 IDENTIFIER_POINTER (DECL_NAME (super_decl)));
e04a16fb
AG		 5248 return 1;
5249 }
5250
e35b68b0 5251 /* Check top-level interface access. Inner classes are subject to member
a648f4e4
BM		 5252 access rules (6.6.1). */
5253 if (! INNER_CLASS_P (super_type)
98f705b9 5254 && check_pkg_class_access (DECL_NAME (super_decl),
7cef5027 5255 NULL_TREE, true, this_decl))
e04a16fb
AG		 5256 return 1;
5257
5258 SOURCE_FRONTEND_DEBUG (("Completing interface %s with %s",
5259 IDENTIFIER_POINTER (DECL_NAME (this_decl)),
5260 IDENTIFIER_POINTER (DECL_NAME (super_decl))));
5261 return 0;
5262}
5263
5264/* Makes sure that SUPER_DECL is suitable to extend THIS_DECL. Returns
67264b4f 5265 0 if everything is OK. */
e04a16fb
AG		 5266
5267static int
0a2f0c54 5268parser_check_super (tree super_decl, tree this_decl, tree wfl)
e04a16fb 5269{
e04a16fb
AG		 5270 tree super_type = TREE_TYPE (super_decl);
5271
5272 /* SUPER should be a CLASS (neither an array nor an interface) */
5273 if (TYPE_ARRAY_P (super_type) || CLASS_INTERFACE (TYPE_NAME (super_type)))
5274 {
e35b68b0 5275 parse_error_context
e04a16fb
AG		 5276 (wfl, "Class `%s' can't subclass %s `%s'",
5277 IDENTIFIER_POINTER (DECL_NAME (this_decl)),
5278 (CLASS_INTERFACE (TYPE_NAME (super_type)) ? "interface" : "array"),
5279 IDENTIFIER_POINTER (DECL_NAME (super_decl)));
5280 return 1;
5281 }
5282
5283 if (CLASS_FINAL (TYPE_NAME (super_type)))
5284 {
5285 parse_error_context (wfl, "Can't subclass final classes: %s",
5286 IDENTIFIER_POINTER (DECL_NAME (super_decl)));
5287 return 1;
5288 }
5289
a648f4e4
BM		 5290 /* Check top-level class scope. Inner classes are subject to member access
5291 rules (6.6.1). */
5292 if (! INNER_CLASS_P (super_type)
7cef5027 5293 && (check_pkg_class_access (DECL_NAME (super_decl), wfl, true, NULL_TREE)))
e04a16fb 5294 return 1;
e35b68b0 5295
e04a16fb
AG		 5296 SOURCE_FRONTEND_DEBUG (("Completing class %s with %s",
5297 IDENTIFIER_POINTER (DECL_NAME (this_decl)),
5298 IDENTIFIER_POINTER (DECL_NAME (super_decl))));
5299 return 0;
5300}
5301
5302/* Create a new dependency list and link it (in a LIFO manner) to the
5303 CTXP list of type dependency list. */
5304
5305static void
0a2f0c54 5306create_jdep_list (struct parser_ctxt *ctxp)
e04a16fb 5307{
7048110f 5308 jdeplist *new = xmalloc (sizeof (jdeplist));
e04a16fb
AG		 5309 new->first = new->last = NULL;
5310 new->next = ctxp->classd_list;
5311 ctxp->classd_list = new;
5312}
5313
5314static jdeplist *
0a2f0c54 5315reverse_jdep_list (struct parser_ctxt *ctxp)
e04a16fb 5316{
3a976c72 5317 jdeplist *prev = NULL, *current, *next;
e04a16fb
AG		 5318 for (current = ctxp->classd_list; current; current = next)
5319 {
5320 next = current->next;
5321 current->next = prev;
5322 prev = current;
5323 }
5324 return prev;
5325}
5326
23a79c61
APB		 5327/* Create a fake pointer based on the ID stored in
5328 TYPE_NAME. TYPE_NAME can be a WFL or a incomplete type asking to be
5329 registered again. */
e04a16fb
AG		 5330
5331static tree
0a2f0c54 5332obtain_incomplete_type (tree type_name)
e04a16fb 5333{
daaaf29f 5334 tree ptr = NULL_TREE, name;
23a79c61
APB		 5335
5336 if (TREE_CODE (type_name) == EXPR_WITH_FILE_LOCATION)
5337 name = EXPR_WFL_NODE (type_name);
5338 else if (INCOMPLETE_TYPE_P (type_name))
5339 name = TYPE_NAME (type_name);
5340 else
400500c4 5341 abort ();
e04a16fb 5342
4977bab6 5343 /* Workaround from build_pointer_type for incomplete types. */
daaaf29f 5344 BUILD_PTR_FROM_NAME (ptr, name);
4977bab6 5345 TYPE_MODE (ptr) = ptr_mode;
daaaf29f 5346 layout_type (ptr);
e04a16fb
AG		 5347
5348 return ptr;
5349}
5350
5351/* Register a incomplete type whose name is WFL. Reuse PTR if PTR is
5352 non NULL instead of computing a new fake type based on WFL. The new
5353 dependency is inserted in the current type dependency list, in FIFO
5354 manner. */
5355
5356static tree
0a2f0c54 5357register_incomplete_type (int kind, tree wfl, tree decl, tree ptr)
e04a16fb 5358{
7048110f 5359 jdep *new = xmalloc (sizeof (jdep));
e04a16fb 5360
e04a16fb
AG		 5361 if (!ptr && kind != JDEP_METHOD_END) /* JDEP_METHOD_END is a mere marker */
5362 ptr = obtain_incomplete_type (wfl);
5363
5364 JDEP_KIND (new) = kind;
5365 JDEP_DECL (new) = decl;
daaaf29f 5366 JDEP_TO_RESOLVE (new) = ptr;
e04a16fb
AG		 5367 JDEP_WFL (new) = wfl;
5368 JDEP_CHAIN (new) = NULL;
5369 JDEP_MISC (new) = NULL_TREE;
e803d3b2
APB		 5370 /* For some dependencies, set the enclosing class of the current
5371 class to be the enclosing context */
0f6cd83f 5372 if ((kind == JDEP_INTERFACE || kind == JDEP_ANONYMOUS || kind == JDEP_SUPER)
165f37bc
APB		 5373 && GET_ENCLOSING_CPC ())
5374 JDEP_ENCLOSING (new) = TREE_VALUE (GET_ENCLOSING_CPC ());
5375 else
324ed8fd 5376 JDEP_ENCLOSING (new) = GET_CPC ();
e04a16fb
AG		 5377 JDEP_GET_PATCH (new) = (tree *)NULL;
5378
5379 JDEP_INSERT (ctxp->classd_list, new);
5380
5381 return ptr;
5382}
5383
496849ba
APB		 5384/* This checks for circular references with innerclasses. We start
5385 from SOURCE and should never reach TARGET. Extended/implemented
5386 types in SOURCE have their enclosing context checked not to reach
5387 TARGET. When the last enclosing context of SOURCE is reached, its
5388 extended/implemented types are also checked not to reach TARGET.
5389 In case of error, WFL of the offending type is returned; NULL_TREE
5390 otherwise. */
5391
5392static tree
0a2f0c54 5393check_inner_circular_reference (tree source, tree target)
496849ba 5394{
fa743e8c 5395 tree base_binfo;
496849ba
APB		 5396 tree ctx, cl;
5397 int i;
5398
fa743e8c 5399 for (i = 0; BINFO_BASE_ITERATE (TYPE_BINFO (source), i, base_binfo); i++)
496849ba 5400 {
bce54832
TT		 5401 tree su;
5402
5403 /* We can end up with a NULL_TREE or an incomplete type here if
5404 we encountered previous type resolution errors. It's safe to
5405 simply ignore these cases. */
fa743e8c 5406 su = BINFO_TYPE (base_binfo);
bce54832
TT		 5407 if (INCOMPLETE_TYPE_P (su))
5408 continue;
496849ba
APB		 5409
5410 if (inherits_from_p (su, target))
5411 return lookup_cl (TYPE_NAME (su));
bce54832 5412
496849ba
APB		 5413 for (ctx = DECL_CONTEXT (TYPE_NAME (su)); ctx; ctx = DECL_CONTEXT (ctx))
5414 {
5415 /* An enclosing context shouldn't be TARGET */
5416 if (ctx == TYPE_NAME (target))
5417 return lookup_cl (TYPE_NAME (su));
5418
5419 /* When we reach the enclosing last context, start a check
5420 on it, with the same target */
5421 if (! DECL_CONTEXT (ctx) &&
5422 (cl = check_inner_circular_reference (TREE_TYPE (ctx), target)))
5423 return cl;
5424 }
5425 }
5426 return NULL_TREE;
5427}
5428
5429/* Explore TYPE's `extends' clause member(s) and return the WFL of the
5430 offending type if a circularity is detected. NULL_TREE is returned
5431 otherwise. TYPE can be an interface or a class. */
5432
5433static tree
0a2f0c54 5434check_circular_reference (tree type)
496849ba 5435{
fa743e8c 5436 tree base_binfo;
496849ba
APB		 5437 int i;
5438
fa743e8c 5439 if (!BINFO_N_BASE_BINFOS (TYPE_BINFO (type)))
496849ba
APB		 5440 return NULL_TREE;
5441
5442 if (! CLASS_INTERFACE (TYPE_NAME (type)))
5443 {
5444 if (inherits_from_p (CLASSTYPE_SUPER (type), type))
5445 return lookup_cl (TYPE_NAME (type));
5446 return NULL_TREE;
5447 }
e35b68b0 5448
fa743e8c 5449 for (i = 0; BINFO_BASE_ITERATE (TYPE_BINFO (type), i, base_binfo); i++)
496849ba 5450 {
fa743e8c
NS		 5451 if (BINFO_TYPE (base_binfo) != object_type_node
5452 && interface_of_p (type, BINFO_TYPE (base_binfo)))
5453 return lookup_cl (TYPE_NAME (BINFO_TYPE (base_binfo)));
496849ba
APB		 5454 }
5455 return NULL_TREE;
5456}
5457
e04a16fb 5458void
0a2f0c54 5459java_check_circular_reference (void)
e04a16fb
AG		 5460{
5461 tree current;
5462 for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
5463 {
5464 tree type = TREE_TYPE (current);
496849ba
APB		 5465 tree cl;
5466
5467 cl = check_circular_reference (type);
5468 if (! cl)
5469 cl = check_inner_circular_reference (type, type);
5470 if (cl)
5471 parse_error_context (cl, "Cyclic class inheritance%s",
5472 (cyclic_inheritance_report ?
5473 cyclic_inheritance_report : ""));
c2952b01
APB		 5474 }
5475}
5476
5477/* Augment the parameter list PARM with parameters crafted to
5478 initialize outer context locals aliases. Through ARTIFICIAL, a
5479 count is kept of the number of crafted parameters. MODE governs
5480 what eventually gets created: something suitable for a function
5481 creation or a function invocation, either the constructor or
c00f0fb2 5482 finit$. */
c2952b01
APB		 5483
5484static tree
0a2f0c54
KG		 5485build_alias_initializer_parameter_list (int mode, tree class_type, tree parm,
5486 int *artificial)
c2952b01
APB		 5487{
5488 tree field;
da632f2c
APB		 5489 tree additional_parms = NULL_TREE;
5490
c2952b01
APB		 5491 for (field = TYPE_FIELDS (class_type); field; field = TREE_CHAIN (field))
5492 if (FIELD_LOCAL_ALIAS (field))
5493 {
63ad61ed 5494 const char *buffer = IDENTIFIER_POINTER (DECL_NAME (field));
c2952b01 5495 tree purpose = NULL_TREE, value = NULL_TREE, name = NULL_TREE;
1f8f4a0b 5496 tree mangled_id;
c2952b01
APB		 5497
5498 switch (mode)
5499 {
5500 case AIPL_FUNCTION_DECLARATION:
e35b68b0 5501 MANGLE_ALIAS_INITIALIZER_PARAMETER_NAME_STR (mangled_id,
1f8f4a0b
MM		 5502 &buffer [4]);
5503 purpose = build_wfl_node (mangled_id);
c2952b01
APB		 5504 if (TREE_CODE (TREE_TYPE (field)) == POINTER_TYPE)
5505 value = build_wfl_node (TYPE_NAME (TREE_TYPE (field)));
5506 else
5507 value = TREE_TYPE (field);
5508 break;
5509
5510 case AIPL_FUNCTION_CREATION:
1f8f4a0b
MM		 5511 MANGLE_ALIAS_INITIALIZER_PARAMETER_NAME_STR (purpose,
5512 &buffer [4]);
c2952b01
APB		 5513 value = TREE_TYPE (field);
5514 break;
5515
5516 case AIPL_FUNCTION_FINIT_INVOCATION:
e35b68b0 5517 MANGLE_ALIAS_INITIALIZER_PARAMETER_NAME_STR (mangled_id,
1f8f4a0b 5518 &buffer [4]);
c2952b01
APB		 5519 /* Now, this is wrong. purpose should always be the NAME
5520 of something and value its matching value (decl, type,
5521 etc...) FIXME -- but there is a lot to fix. */
5522
5523 /* When invoked for this kind of operation, we already
5524 know whether a field is used or not. */
5525 purpose = TREE_TYPE (field);
1f8f4a0b 5526 value = build_wfl_node (mangled_id);
c2952b01
APB		 5527 break;
5528
5529 case AIPL_FUNCTION_CTOR_INVOCATION:
67264b4f 5530 /* There are two case: the constructor invocation happens
c2952b01
APB		 5531 outside the local inner, in which case, locales from the outer
5532 context are directly used.
5533
5534 Otherwise, we fold to using the alias directly. */
5535 if (class_type == current_class)
5536 value = field;
5537 else
5538 {
5539 name = get_identifier (&buffer[4]);
5540 value = IDENTIFIER_LOCAL_VALUE (name);
5541 }
5542 break;
5543 }
da632f2c 5544 additional_parms = tree_cons (purpose, value, additional_parms);
c2952b01
APB		 5545 if (artificial)
5546 *artificial +=1;
5547 }
da632f2c
APB		 5548 if (additional_parms)
5549 {
e35b68b0 5550 if (ANONYMOUS_CLASS_P (class_type)
da632f2c
APB		 5551 && mode == AIPL_FUNCTION_CTOR_INVOCATION)
5552 additional_parms = nreverse (additional_parms);
5553 parm = chainon (additional_parms, parm);
5554 }
5555
5556 return parm;
c2952b01
APB		 5557}
5558
5559/* Craft a constructor for CLASS_DECL -- what we should do when none
5560 where found. ARGS is non NULL when a special signature must be
5561 enforced. This is the case for anonymous classes. */
5562
568d1435 5563static tree
0a2f0c54 5564craft_constructor (tree class_decl, tree args)
c2952b01
APB		 5565{
5566 tree class_type = TREE_TYPE (class_decl);
5567 tree parm = NULL_TREE;
d3ecb597
BM		 5568 /* Inherit access flags for the constructor from its enclosing class. */
5569 int valid_ctor_flags = ACC_PUBLIC | ACC_PROTECTED | ACC_PRIVATE;
5570 int flags = (get_access_flags_from_decl (class_decl) & valid_ctor_flags);
c2952b01
APB		 5571 int i = 0, artificial = 0;
5572 tree decl, ctor_name;
5573 char buffer [80];
e35b68b0 5574
260ba9ce 5575 ctor_name = init_identifier_node;
c2952b01
APB		 5576
5577 /* If we're dealing with an inner class constructor, we hide the
5578 this$<n> decl in the name field of its parameter declaration. */
5579 if (PURE_INNER_CLASS_TYPE_P (class_type))
5580 {
5581 tree type = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (class_type)));
5582 parm = tree_cons (build_current_thisn (class_type),
5583 build_pointer_type (type), parm);
5584
5585 /* Some more arguments to be hidden here. The values of the local
5586 variables of the outer context that the inner class needs to see. */
5587 parm = build_alias_initializer_parameter_list (AIPL_FUNCTION_CREATION,
e35b68b0 5588 class_type, parm,
c2952b01
APB		 5589 &artificial);
5590 }
5591
5592 /* Then if there are any args to be enforced, enforce them now */
5593 for (; args && args != end_params_node; args = TREE_CHAIN (args))
5594 {
5595 sprintf (buffer, "parm%d", i++);
5596 parm = tree_cons (get_identifier (buffer), TREE_VALUE (args), parm);
e04a16fb 5597 }
c2952b01
APB		 5598
5599 CRAFTED_PARAM_LIST_FIXUP (parm);
e35b68b0 5600 decl = create_artificial_method (class_type, flags, void_type_node,
c2952b01
APB		 5601 ctor_name, parm);
5602 fix_method_argument_names (parm, decl);
5603 /* Now, mark the artificial parameters. */
5604 DECL_FUNCTION_NAP (decl) = artificial;
c7303e41 5605 DECL_FUNCTION_SYNTHETIC_CTOR (decl) = DECL_CONSTRUCTOR_P (decl) = 1;
916b57ce 5606 DECL_INLINE (decl) = 1;
568d1435 5607 return decl;
e04a16fb
AG		 5608}
5609
c2952b01 5610
e920ebc9
APB		 5611/* Fix the constructors. This will be called right after circular
5612 references have been checked. It is necessary to fix constructors
5613 early even if no code generation will take place for that class:
5614 some generated constructor might be required by the class whose
5615 compilation triggered this one to be simply loaded. */
5616
5617void
0a2f0c54 5618java_fix_constructors (void)
e920ebc9
APB		 5619{
5620 tree current;
5621
5622 for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
5623 {
e920ebc9
APB		 5624 tree class_type = TREE_TYPE (current);
5625 int saw_ctor = 0;
c2952b01
APB		 5626 tree decl;
5627
5628 if (CLASS_INTERFACE (TYPE_NAME (class_type)))
5629 continue;
e920ebc9 5630
85194ee9 5631 output_class = current_class = class_type;
e920ebc9
APB		 5632 for (decl = TYPE_METHODS (class_type); decl; decl = TREE_CHAIN (decl))
5633 {
5634 if (DECL_CONSTRUCTOR_P (decl))
5635 {
5636 fix_constructors (decl);
5637 saw_ctor = 1;
5638 }
5639 }
5640
c2952b01
APB		 5641 /* Anonymous class constructor can't be generated that early. */
5642 if (!saw_ctor && !ANONYMOUS_CLASS_P (class_type))
5643 craft_constructor (current, NULL_TREE);
e920ebc9
APB		 5644 }
5645}
5646
23a79c61 5647/* safe_layout_class just makes sure that we can load a class without
6de9cd9a 5648 disrupting the current_class, input_file, input_line, etc, information
23a79c61
APB		 5649 about the class processed currently. */
5650
e04a16fb 5651void
0a2f0c54 5652safe_layout_class (tree class)
e04a16fb
AG		 5653{
5654 tree save_current_class = current_class;
436fac17 5655 location_t save_location = input_location;
5e942c50 5656
e04a16fb 5657 layout_class (class);
5e942c50 5658
e04a16fb 5659 current_class = save_current_class;
436fac17 5660 input_location = save_location;
e04a16fb
AG		 5661}
5662
5663static tree
0a2f0c54 5664jdep_resolve_class (jdep *dep)
e04a16fb
AG		 5665{
5666 tree decl;
5667
23a79c61
APB		 5668 if (JDEP_RESOLVED_P (dep))
5669 decl = JDEP_RESOLVED_DECL (dep);
5670 else
e04a16fb 5671 {
c2952b01 5672 decl = resolve_class (JDEP_ENCLOSING (dep), JDEP_TO_RESOLVE (dep),
23a79c61 5673 JDEP_DECL (dep), JDEP_WFL (dep));
e04a16fb 5674 JDEP_RESOLVED (dep, decl);
f94ae540
TT		 5675 /* If there is no WFL, that's ok. We generate this warning
5676 elsewhere. */
11522327 5677 if (decl && JDEP_WFL (dep) != NULL_TREE)
f94ae540 5678 check_deprecation (JDEP_WFL (dep), decl);
e04a16fb 5679 }
e35b68b0 5680
e04a16fb 5681 if (!decl)
23a79c61 5682 complete_class_report_errors (dep);
0f6cd83f 5683 else if (INNER_CLASS_DECL_P (decl))
54646811
PB		 5684 {
5685 tree inner = TREE_TYPE (decl);
5686 if (! CLASS_LOADED_P (inner))
96c6f628
APB		 5687 {
5688 safe_layout_class (inner);
5689 if (TYPE_SIZE (inner) == error_mark_node)
5690 TYPE_SIZE (inner) = NULL_TREE;
5691 }
54646811
PB		 5692 check_inner_class_access (decl, JDEP_ENCLOSING (dep), JDEP_WFL (dep));
5693 }
e04a16fb
AG		 5694 return decl;
5695}
5696
5697/* Complete unsatisfied class declaration and their dependencies */
5698
5699void
0a2f0c54 5700java_complete_class (void)
e04a16fb 5701{
e04a16fb
AG		 5702 tree cclass;
5703 jdeplist *cclassd;
5704 int error_found;
b67d701b 5705 tree type;
e04a16fb 5706
9a7ab4b3 5707 /* Process imports */
e04a16fb 5708 process_imports ();
e04a16fb 5709
6b55b27f 5710 /* Reverse things so we have the right order */
e04a16fb
AG		 5711 ctxp->class_list = nreverse (ctxp->class_list);
5712 ctxp->classd_list = reverse_jdep_list (ctxp);
c877974e 5713
e35b68b0
AD		 5714 for (cclassd = ctxp->classd_list, cclass = ctxp->class_list;
5715 cclass && cclassd;
e04a16fb
AG		 5716 cclass = TREE_CHAIN (cclass), cclassd = CLASSD_CHAIN (cclassd))
5717 {
5718 jdep *dep;
653d5d95
APB		 5719
5720 /* We keep the compilation unit imports in the class so that
5721 they can be used later to resolve type dependencies that
5722 aren't necessary to solve now. */
5723 TYPE_IMPORT_LIST (TREE_TYPE (cclass)) = ctxp->import_list;
5724 TYPE_IMPORT_DEMAND_LIST (TREE_TYPE (cclass)) = ctxp->import_demand_list;
5725
e04a16fb
AG		 5726 for (dep = CLASSD_FIRST (cclassd); dep; dep = JDEP_CHAIN (dep))
5727 {
5728 tree decl;
e04a16fb
AG		 5729 if (!(decl = jdep_resolve_class (dep)))
5730 continue;
5731
5732 /* Now it's time to patch */
5733 switch (JDEP_KIND (dep))
5734 {
5735 case JDEP_SUPER:
5736 /* Simply patch super */
5737 if (parser_check_super (decl, JDEP_DECL (dep), JDEP_WFL (dep)))
5738 continue;
fa743e8c
NS		 5739 BINFO_TYPE (BINFO_BASE_BINFO
5740 (TYPE_BINFO (TREE_TYPE (JDEP_DECL (dep))), 0))
5741 = TREE_TYPE (decl);
e04a16fb
AG		 5742 break;
5743
5744 case JDEP_FIELD:
5745 {
5746 /* We do part of the job done in add_field */
5747 tree field_decl = JDEP_DECL (dep);
5748 tree field_type = TREE_TYPE (decl);
e04a16fb 5749 if (TREE_CODE (field_type) == RECORD_TYPE)
e04a16fb 5750 field_type = promote_type (field_type);
e04a16fb 5751 TREE_TYPE (field_decl) = field_type;
5e942c50 5752 DECL_ALIGN (field_decl) = 0;
11cf4d18 5753 DECL_USER_ALIGN (field_decl) = 0;
5e942c50 5754 layout_decl (field_decl, 0);
e35b68b0 5755 SOURCE_FRONTEND_DEBUG
e04a16fb
AG		 5756 (("Completed field/var decl `%s' with `%s'",
5757 IDENTIFIER_POINTER (DECL_NAME (field_decl)),
5758 IDENTIFIER_POINTER (DECL_NAME (decl))));
5759 break;
5760 }
5761 case JDEP_METHOD: /* We start patching a method */
5762 case JDEP_METHOD_RETURN:
5763 error_found = 0;
5764 while (1)
5765 {
5766 if (decl)
5767 {
b67d701b
PB		 5768 type = TREE_TYPE(decl);
5769 if (TREE_CODE (type) == RECORD_TYPE)
5770 type = promote_type (type);
e04a16fb 5771 JDEP_APPLY_PATCH (dep, type);
e35b68b0 5772 SOURCE_FRONTEND_DEBUG
e04a16fb
AG		 5773 (((JDEP_KIND (dep) == JDEP_METHOD_RETURN ?
5774 "Completing fct `%s' with ret type `%s'":
5775 "Completing arg `%s' with type `%s'"),
e35b68b0 5776 IDENTIFIER_POINTER (EXPR_WFL_NODE
e04a16fb
AG		 5777 (JDEP_DECL_WFL (dep))),
5778 IDENTIFIER_POINTER (DECL_NAME (decl))));
5779 }
5780 else
5781 error_found = 1;
5782 dep = JDEP_CHAIN (dep);
5783 if (JDEP_KIND (dep) == JDEP_METHOD_END)
5784 break;
5785 else
5786 decl = jdep_resolve_class (dep);
5787 }
5788 if (!error_found)
5789 {
5790 tree mdecl = JDEP_DECL (dep), signature;
165f37bc
APB		 5791 /* Recompute and reset the signature, check first that
5792 all types are now defined. If they're not,
a83f01f0 5793 don't build the signature. */
165f37bc
APB		 5794 if (check_method_types_complete (mdecl))
5795 {
5796 signature = build_java_signature (TREE_TYPE (mdecl));
5797 set_java_signature (TREE_TYPE (mdecl), signature);
5798 }
e04a16fb
AG		 5799 }
5800 else
5801 continue;
5802 break;
5803
5804 case JDEP_INTERFACE:
5805 if (parser_check_super_interface (decl, JDEP_DECL (dep),
5806 JDEP_WFL (dep)))
5807 continue;
5808 parser_add_interface (JDEP_DECL (dep), decl, JDEP_WFL (dep));
5809 break;
5810
b67d701b 5811 case JDEP_PARM:
e04a16fb 5812 case JDEP_VARIABLE:
b67d701b
PB		 5813 type = TREE_TYPE(decl);
5814 if (TREE_CODE (type) == RECORD_TYPE)
5815 type = promote_type (type);
5816 JDEP_APPLY_PATCH (dep, type);
e04a16fb
AG		 5817 break;
5818
5819 case JDEP_TYPE:
5820 JDEP_APPLY_PATCH (dep, TREE_TYPE (decl));
e35b68b0 5821 SOURCE_FRONTEND_DEBUG
e04a16fb
AG		 5822 (("Completing a random type dependency on a '%s' node",
5823 tree_code_name [TREE_CODE (JDEP_DECL (dep))]));
5824 break;
5825
b9f7e36c 5826 case JDEP_EXCEPTION:
c877974e 5827 JDEP_APPLY_PATCH (dep, TREE_TYPE (decl));
e35b68b0 5828 SOURCE_FRONTEND_DEBUG
c877974e
APB		 5829 (("Completing `%s' `throws' argument node",
5830 IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_WFL (dep)))));
b9f7e36c
APB		 5831 break;
5832
c2952b01
APB		 5833 case JDEP_ANONYMOUS:
5834 patch_anonymous_class (decl, JDEP_DECL (dep), JDEP_WFL (dep));
5835 break;
5836
e04a16fb 5837 default:
400500c4 5838 abort ();
e04a16fb
AG		 5839 }
5840 }
5841 }
e04a16fb
AG		 5842 return;
5843}
5844
5845/* Resolve class CLASS_TYPE. Handle the case of trying to resolve an
5846 array. */
5847
5848static tree
0a2f0c54 5849resolve_class (tree enclosing, tree class_type, tree decl, tree cl)
e04a16fb 5850{
2e3b2d2c 5851 tree tname = TYPE_NAME (class_type);
78d21f92 5852 tree resolved_type = TREE_TYPE (class_type);
2e3b2d2c 5853 int array_dims = 0;
78d21f92 5854 tree resolved_type_decl;
e35b68b0 5855
78d21f92
PB		 5856 if (resolved_type != NULL_TREE)
5857 {
5858 tree resolved_type_decl = TYPE_NAME (resolved_type);
5859 if (resolved_type_decl == NULL_TREE
5860 || TREE_CODE (resolved_type_decl) == IDENTIFIER_NODE)
5861 {
5862 resolved_type_decl = build_decl (TYPE_DECL,
5863 TYPE_NAME (class_type),
5864 resolved_type);
5865 }
5866 return resolved_type_decl;
5867 }
5868
e04a16fb
AG		 5869 /* 1- Check to see if we have an array. If true, find what we really
5870 want to resolve */
2e3b2d2c
APB		 5871 if ((array_dims = build_type_name_from_array_name (tname,
5872 &TYPE_NAME (class_type))))
5873 WFL_STRIP_BRACKET (cl, cl);
e04a16fb
AG		 5874
5875 /* 2- Resolve the bare type */
e35b68b0 5876 if (!(resolved_type_decl = do_resolve_class (enclosing, class_type,
c2952b01 5877 decl, cl)))
e04a16fb
AG		 5878 return NULL_TREE;
5879 resolved_type = TREE_TYPE (resolved_type_decl);
5880
6b55b27f 5881 /* 3- If we have an array, reconstruct the array down to its nesting */
2e3b2d2c 5882 if (array_dims)
e04a16fb 5883 {
2e3b2d2c
APB		 5884 for (; array_dims; array_dims--)
5885 resolved_type = build_java_array_type (resolved_type, -1);
e101152f 5886 resolved_type_decl = TYPE_NAME (resolved_type);
e04a16fb 5887 }
78d21f92 5888 TREE_TYPE (class_type) = resolved_type;
e04a16fb
AG		 5889 return resolved_type_decl;
5890}
5891
0ea05c0d
TT		 5892/* Effectively perform the resolution of class CLASS_TYPE. DECL or CL
5893 are used to report error messages; CL must either be NULL_TREE or a
5894 WFL wrapping a class. Do not try to replace TYPE_NAME (class_type)
5895 by a variable, since it is changed by find_in_imports{_on_demand}
5896 and (but it doesn't really matter) qualify_and_find. */
e04a16fb 5897
78d21f92 5898tree
0a2f0c54 5899do_resolve_class (tree enclosing, tree class_type, tree decl, tree cl)
e04a16fb 5900{
17126208 5901 tree new_class_decl = NULL_TREE, super = NULL_TREE;
653d5d95 5902 tree saved_enclosing_type = enclosing ? TREE_TYPE (enclosing) : NULL_TREE;
4f647d52 5903 tree decl_result;
e2500fed 5904 htab_t circularity_hash;
8e41c4f3 5905
6b55b27f
TT		 5906 if (QUALIFIED_P (TYPE_NAME (class_type)))
5907 {
5908 /* If the type name is of the form `Q . Id', then Q is either a
5909 package name or a class name. First we try to find Q as a
5910 class and then treat Id as a member type. If we can't find Q
5911 as a class then we fall through. */
5912 tree q, left, left_type, right;
9c5fdae6 5913 if (split_qualified_name (&left, &right, TYPE_NAME (class_type)) == 0)
6b55b27f 5914 {
7304c6cf
AH		 5915 BUILD_PTR_FROM_NAME (left_type, left);
5916 q = do_resolve_class (enclosing, left_type, decl, cl);
5917 if (q)
5918 {
5919 enclosing = q;
5920 saved_enclosing_type = TREE_TYPE (q);
5921 BUILD_PTR_FROM_NAME (class_type, right);
5922 }
6b55b27f 5923 }
a40d21da 5924 }
c2952b01 5925
6b55b27f
TT		 5926 if (enclosing)
5927 {
5928 /* This hash table is used to register the classes we're going
5929 through when searching the current class as an inner class, in
5930 order to detect circular references. Remember to free it before
5931 returning the section 0- of this function. */
5932 circularity_hash = htab_create (20, htab_hash_pointer, htab_eq_pointer,
5933 NULL);
8e41c4f3 5934
6b55b27f
TT		 5935 /* 0- Search in the current class as an inner class.
5936 Maybe some code here should be added to load the class or
5937 something, at least if the class isn't an inner class and ended
5938 being loaded from class file. FIXME. */
5939 while (enclosing)
5940 {
5941 new_class_decl = resolve_inner_class (circularity_hash, cl, &enclosing,
5942 &super, class_type);
5943 if (new_class_decl)
5944 break;
5945
5946 /* If we haven't found anything because SUPER reached Object and
5947 ENCLOSING happens to be an innerclass, try the enclosing context. */
5948 if ((!super || super == object_type_node) &&
5949 enclosing && INNER_CLASS_DECL_P (enclosing))
5950 enclosing = DECL_CONTEXT (enclosing);
5951 else
5952 enclosing = NULL_TREE;
5953 }
5954
5955 htab_delete (circularity_hash);
5956
5957 if (new_class_decl)
5958 return new_class_decl;
5959 }
17126208 5960
9a7ab4b3
APB		 5961 /* 1- Check for the type in single imports. This will change
5962 TYPE_NAME() if something relevant is found */
653d5d95 5963 find_in_imports (saved_enclosing_type, class_type);
e04a16fb 5964
9a7ab4b3 5965 /* 2- And check for the type in the current compilation unit */
e04a16fb
AG		 5966 if ((new_class_decl = IDENTIFIER_CLASS_VALUE (TYPE_NAME (class_type))))
5967 {
ed7f2369 5968 if (!CLASS_LOADED_P (TREE_TYPE (new_class_decl)))
e04a16fb
AG		 5969 load_class (TYPE_NAME (class_type), 0);
5970 return IDENTIFIER_CLASS_VALUE (TYPE_NAME (class_type));
5971 }
5972
9a7ab4b3
APB		 5973 /* 3- Search according to the current package definition */
5974 if (!QUALIFIED_P (TYPE_NAME (class_type)))
5975 {
5976 if ((new_class_decl = qualify_and_find (class_type, ctxp->package,
5977 TYPE_NAME (class_type))))
5978 return new_class_decl;
5979 }
5980
5981 /* 4- Check the import on demands. Don't allow bar.baz to be
5982 imported from foo.* */
5983 if (!QUALIFIED_P (TYPE_NAME (class_type)))
653d5d95 5984 if (find_in_imports_on_demand (saved_enclosing_type, class_type))
9a7ab4b3
APB		 5985 return NULL_TREE;
5986
6b55b27f 5987 /* If found in find_in_imports_on_demand, the type has already been
9a7ab4b3
APB		 5988 loaded. */
5989 if ((new_class_decl = IDENTIFIER_CLASS_VALUE (TYPE_NAME (class_type))))
5990 return new_class_decl;
5991
5992 /* 5- Try with a name qualified with the package name we've seen so far */
ee07f4f4 5993 if (!QUALIFIED_P (TYPE_NAME (class_type)))
bc3ca41b 5994 {
ee07f4f4 5995 tree package;
d6baf6f5
APB		 5996
5997 /* If there is a current package (ctxp->package), it's the first
5998 element of package_list and we can skip it. */
e35b68b0 5999 for (package = (ctxp->package ?
d6baf6f5
APB		 6000 TREE_CHAIN (package_list) : package_list);
6001 package; package = TREE_CHAIN (package))
9a7ab4b3 6002 if ((new_class_decl = qualify_and_find (class_type,
e35b68b0 6003 TREE_PURPOSE (package),
9a7ab4b3
APB		 6004 TYPE_NAME (class_type))))
6005 return new_class_decl;
6006 }
6007
6b55b27f 6008 /* 5- Check another compilation unit that bears the name of type */
e04a16fb 6009 load_class (TYPE_NAME (class_type), 0);
e35b68b0 6010
a648f4e4
BM		 6011 if (!cl)
6012 cl = lookup_cl (decl);
e35b68b0
AD		 6013
6014 /* If we don't have a value for CL, then we're being called recursively.
a648f4e4
BM		 6015 We can't check package access just yet, but it will be taken care of
6016 by the caller. */
6017 if (cl)
6018 {
7cef5027 6019 if (check_pkg_class_access (TYPE_NAME (class_type), cl, true, NULL_TREE))
a648f4e4
BM		 6020 return NULL_TREE;
6021 }
4f647d52 6022
9a7ab4b3 6023 /* 6- Last call for a resolution */
4f647d52
APB		 6024 decl_result = IDENTIFIER_CLASS_VALUE (TYPE_NAME (class_type));
6025
6026 /* The final lookup might have registered a.b.c into a.b$c If we
6027 failed at the first lookup, progressively change the name if
6028 applicable and use the matching DECL instead. */
6029 if (!decl_result && QUALIFIED_P (TYPE_NAME (class_type)))
6030 {
4f647d52 6031 char *separator;
5bebbee7
MK		 6032 tree name = TYPE_NAME (class_type);
6033 char *namebuffer = alloca (IDENTIFIER_LENGTH (name) + 1);
6034
6035 strcpy (namebuffer, IDENTIFIER_POINTER (name));
6036
4f647d52
APB		 6037 do {
6038
6039 /* Reach the last '.', and if applicable, replace it by a `$' and
6040 see if this exists as a type. */
5bebbee7 6041 if ((separator = strrchr (namebuffer, '.')))
4f647d52 6042 {
4f647d52 6043 *separator = '$';
5bebbee7 6044 name = get_identifier (namebuffer);
4f647d52
APB		 6045 decl_result = IDENTIFIER_CLASS_VALUE (name);
6046 }
6047 } while (!decl_result && separator);
6048 }
6049 return decl_result;
e04a16fb
AG		 6050}
6051
9a7ab4b3 6052static tree
0a2f0c54 6053qualify_and_find (tree class_type, tree package, tree name)
9a7ab4b3
APB		 6054{
6055 tree new_qualified = merge_qualified_name (package, name);
6056 tree new_class_decl;
6057
6058 if (!IDENTIFIER_CLASS_VALUE (new_qualified))
6059 load_class (new_qualified, 0);
6060 if ((new_class_decl = IDENTIFIER_CLASS_VALUE (new_qualified)))
6061 {
ed7f2369 6062 if (!CLASS_LOADED_P (TREE_TYPE (new_class_decl)))
808fd801 6063 load_class (TREE_TYPE (new_class_decl), 0);
9a7ab4b3
APB		 6064 TYPE_NAME (class_type) = new_qualified;
6065 return IDENTIFIER_CLASS_VALUE (new_qualified);
6066 }
6067 return NULL_TREE;
6068}
6069
e04a16fb 6070/* Resolve NAME and lay it out (if not done and if not the current
23a79c61
APB		 6071 parsed class). Return a decl node. This function is meant to be
6072 called when type resolution is necessary during the walk pass. */
e04a16fb
AG		 6073
6074static tree
0a2f0c54 6075resolve_and_layout (tree something, tree cl)
e04a16fb 6076{
34d4df06 6077 tree decl, decl_type;
c877974e 6078
23a79c61
APB		 6079 /* Don't do that on the current class */
6080 if (something == current_class)
6081 return TYPE_NAME (current_class);
c877974e 6082
23a79c61 6083 /* Don't do anything for void and other primitive types */
c877974e
APB		 6084 if (JPRIMITIVE_TYPE_P (something) || something == void_type_node)
6085 return NULL_TREE;
6086
23a79c61
APB		 6087 /* Pointer types can be reall pointer types or fake pointers. When
6088 finding a real pointer, recheck for primitive types */
6089 if (TREE_CODE (something) == POINTER_TYPE)
6090 {
6091 if (TREE_TYPE (something))
6092 {
6093 something = TREE_TYPE (something);
6094 if (JPRIMITIVE_TYPE_P (something) || something == void_type_node)
6095 return NULL_TREE;
6096 }
6097 else
6098 something = TYPE_NAME (something);
6099 }
6100
6101 /* Don't do anything for arrays of primitive types */
6102 if (TREE_CODE (something) == RECORD_TYPE && TYPE_ARRAY_P (something)
6103 && JPRIMITIVE_TYPE_P (TYPE_ARRAY_ELEMENT (something)))
6104 return NULL_TREE;
6105
c2952b01
APB		 6106 /* Something might be a WFL */
6107 if (TREE_CODE (something) == EXPR_WITH_FILE_LOCATION)
6108 something = EXPR_WFL_NODE (something);
6109
6110 /* Otherwise, if something is not and IDENTIFIER_NODE, it can be a a
6111 TYPE_DECL or a real TYPE */
6112 else if (TREE_CODE (something) != IDENTIFIER_NODE)
c877974e
APB		 6113 something = (TREE_CODE (TYPE_NAME (something)) == TYPE_DECL ?
6114 DECL_NAME (TYPE_NAME (something)) : TYPE_NAME (something));
6115
23a79c61
APB		 6116 if (!(decl = resolve_no_layout (something, cl)))
6117 return NULL_TREE;
6118
6119 /* Resolve and layout if necessary */
34d4df06
APB		 6120 decl_type = TREE_TYPE (decl);
6121 layout_class_methods (decl_type);
6122 /* Check methods */
6123 if (CLASS_FROM_SOURCE_P (decl_type))
6124 java_check_methods (decl);
e35b68b0 6125 /* Layout the type if necessary */
34d4df06
APB		 6126 if (decl_type != current_class && !CLASS_LOADED_P (decl_type))
6127 safe_layout_class (decl_type);
23a79c61 6128
e04a16fb
AG		 6129 return decl;
6130}
6131
6132/* Resolve a class, returns its decl but doesn't perform any
6133 layout. The current parsing context is saved and restored */
6134
6135static tree
0a2f0c54 6136resolve_no_layout (tree name, tree cl)
e04a16fb
AG		 6137{
6138 tree ptr, decl;
6139 BUILD_PTR_FROM_NAME (ptr, name);
6140 java_parser_context_save_global ();
c2952b01 6141 decl = resolve_class (TYPE_NAME (current_class), ptr, NULL_TREE, cl);
e04a16fb 6142 java_parser_context_restore_global ();
e35b68b0 6143
e04a16fb
AG		 6144 return decl;
6145}
6146
2e3b2d2c
APB		 6147/* Called when reporting errors. Skip the '[]'s in a complex array
6148 type description that failed to be resolved. purify_type_name can't
6149 use an identifier tree. */
e04a16fb 6150
49f48c71 6151static const char *
0a2f0c54 6152purify_type_name (const char *name)
e04a16fb 6153{
2e3b2d2c
APB		 6154 int len = strlen (name);
6155 int bracket_found;
6156
6157 STRING_STRIP_BRACKETS (name, len, bracket_found);
6158 if (bracket_found)
6159 {
6160 char *stripped_name = xmemdup (name, len, len+1);
6161 stripped_name [len] = '\0';
6162 return stripped_name;
6163 }
e04a16fb
AG		 6164 return name;
6165}
6166
6167/* The type CURRENT refers to can't be found. We print error messages. */
6168
6169static void
0a2f0c54 6170complete_class_report_errors (jdep *dep)
e04a16fb 6171{
49f48c71 6172 const char *name;
23a79c61
APB		 6173
6174 if (!JDEP_WFL (dep))
6175 return;
6176
6177 name = IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_WFL (dep)));
e04a16fb
AG		 6178 switch (JDEP_KIND (dep))
6179 {
6180 case JDEP_SUPER:
e35b68b0 6181 parse_error_context
e04a16fb 6182 (JDEP_WFL (dep), "Superclass `%s' of class `%s' not found",
23a79c61 6183 purify_type_name (name),
e04a16fb
AG		 6184 IDENTIFIER_POINTER (DECL_NAME (JDEP_DECL (dep))));
6185 break;
6186 case JDEP_FIELD:
6187 parse_error_context
6188 (JDEP_WFL (dep), "Type `%s' not found in declaration of field `%s'",
23a79c61 6189 purify_type_name (name),
e04a16fb
AG		 6190 IDENTIFIER_POINTER (DECL_NAME (JDEP_DECL (dep))));
6191 break;
6192 case JDEP_METHOD: /* Covers arguments */
6193 parse_error_context
781b0558 6194 (JDEP_WFL (dep), "Type `%s' not found in the declaration of the argument `%s' of method `%s'",
23a79c61 6195 purify_type_name (name),
e04a16fb
AG		 6196 IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_DECL_WFL (dep))),
6197 IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_MISC (dep))));
6198 break;
6199 case JDEP_METHOD_RETURN: /* Covers return type */
6200 parse_error_context
e35b68b0 6201 (JDEP_WFL (dep), "Type `%s' not found in the declaration of the return type of method `%s'",
23a79c61 6202 purify_type_name (name),
e04a16fb
AG		 6203 IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_DECL_WFL (dep))));
6204 break;
6205 case JDEP_INTERFACE:
6206 parse_error_context
6207 (JDEP_WFL (dep), "Superinterface `%s' of %s `%s' not found",
6208 IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_WFL (dep))),
6209 (CLASS_OR_INTERFACE (JDEP_DECL (dep), "class", "interface")),
6210 IDENTIFIER_POINTER (DECL_NAME (JDEP_DECL (dep))));
6211 break;
6212 case JDEP_VARIABLE:
6213 parse_error_context
e35b68b0
AD		 6214 (JDEP_WFL (dep), "Type `%s' not found in the declaration of the local variable `%s'",
6215 purify_type_name (IDENTIFIER_POINTER
b67d701b 6216 (EXPR_WFL_NODE (JDEP_WFL (dep)))),
e04a16fb
AG		 6217 IDENTIFIER_POINTER (DECL_NAME (JDEP_DECL (dep))));
6218 break;
b9f7e36c 6219 case JDEP_EXCEPTION: /* As specified by `throws' */
e35b68b0 6220 parse_error_context
b9f7e36c
APB		 6221 (JDEP_WFL (dep), "Class `%s' not found in `throws'",
6222 IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_WFL (dep))));
6223 break;
0a2138e2
APB		 6224 default:
6225 /* Fix for -Wall. Just break doing nothing. The error will be
6226 caught later */
6227 break;
e04a16fb
AG		 6228 }
6229}
6230
22eed1e6
APB		 6231/* Return a static string containing the DECL prototype string. If
6232 DECL is a constructor, use the class name instead of the form
6233 <init> */
6234
49f48c71 6235static const char *
0a2f0c54 6236get_printable_method_name (tree decl)
22eed1e6 6237{
49f48c71 6238 const char *to_return;
9ee9b555 6239 tree name = NULL_TREE;
22eed1e6
APB		 6240
6241 if (DECL_CONSTRUCTOR_P (decl))
6242 {
6243 name = DECL_NAME (decl);
5e942c50 6244 DECL_NAME (decl) = DECL_NAME (TYPE_NAME (DECL_CONTEXT (decl)));
22eed1e6 6245 }
e35b68b0 6246
1b9deeb4 6247 to_return = lang_printable_name (decl, 2);
22eed1e6
APB		 6248 if (DECL_CONSTRUCTOR_P (decl))
6249 DECL_NAME (decl) = name;
e35b68b0 6250
22eed1e6
APB		 6251 return to_return;
6252}
6253
6254/* Track method being redefined inside the same class. As a side
6255 effect, set DECL_NAME to an IDENTIFIER (prior entering this
d77613be 6256 function it's a FWL, so we can track errors more accurately.) */
22eed1e6 6257
e04a16fb 6258static int
0a2f0c54 6259check_method_redefinition (tree class, tree method)
e04a16fb 6260{
c4faeb92 6261 tree redef, sig;
5e942c50 6262
17126208
APB		 6263 /* There's no need to verify <clinit> and finit$ and instinit$ */
6264 if (DECL_CLINIT_P (method)
6265 || DECL_FINIT_P (method) || DECL_INSTINIT_P (method))
e04a16fb 6266 return 0;
5e942c50 6267
c4faeb92 6268 sig = TYPE_ARGUMENT_SIGNATURE (TREE_TYPE (method));
e04a16fb
AG		 6269 for (redef = TYPE_METHODS (class); redef; redef = TREE_CHAIN (redef))
6270 {
c3f2a476 6271 if (redef == method)
e04a16fb 6272 break;
c4faeb92
APB		 6273 if (DECL_NAME (redef) == DECL_NAME (method)
6274 && sig == TYPE_ARGUMENT_SIGNATURE (TREE_TYPE (redef))
6275 && !DECL_ARTIFICIAL (method))
e04a16fb 6276 {
e35b68b0 6277 parse_error_context
c4faeb92 6278 (DECL_FUNCTION_WFL (method), "Duplicate %s declaration `%s'",
22eed1e6
APB		 6279 (DECL_CONSTRUCTOR_P (redef) ? "constructor" : "method"),
6280 get_printable_method_name (redef));
e04a16fb
AG		 6281 return 1;
6282 }
6283 }
6284 return 0;
6285}
6286
1175b9b4
TT		 6287/* Return 1 if check went ok, 0 otherwise. */
6288static int
0a2f0c54
KG		 6289check_abstract_method_definitions (int do_interface, tree class_decl,
6290 tree type)
d77613be
APB		 6291{
6292 tree class = TREE_TYPE (class_decl);
6293 tree method, end_type;
1175b9b4 6294 int ok = 1;
d77613be
APB		 6295
6296 end_type = (do_interface ? object_type_node : type);
6297 for (method = TYPE_METHODS (type); method; method = TREE_CHAIN (method))
6298 {
6299 tree other_super, other_method, method_sig, method_name;
6300 int found = 0;
165f37bc 6301 int end_type_reached = 0;
e35b68b0 6302
d77613be
APB		 6303 if (!METHOD_ABSTRACT (method) || METHOD_FINAL (method))
6304 continue;
e35b68b0 6305
d77613be
APB		 6306 /* Now verify that somewhere in between TYPE and CLASS,
6307 abstract method METHOD gets a non abstract definition
6308 that is inherited by CLASS. */
e35b68b0 6309
d77613be
APB		 6310 method_sig = build_java_signature (TREE_TYPE (method));
6311 method_name = DECL_NAME (method);
6312 if (TREE_CODE (method_name) == EXPR_WITH_FILE_LOCATION)
6313 method_name = EXPR_WFL_NODE (method_name);
6314
165f37bc
APB		 6315 other_super = class;
6316 do {
6317 if (other_super == end_type)
6318 end_type_reached = 1;
e35b68b0 6319
165f37bc
APB		 6320 /* Method search */
6321 for (other_method = TYPE_METHODS (other_super); other_method;
6322 other_method = TREE_CHAIN (other_method))
6323 {
6324 tree s = build_java_signature (TREE_TYPE (other_method));
6325 tree other_name = DECL_NAME (other_method);
e35b68b0 6326
165f37bc
APB		 6327 if (TREE_CODE (other_name) == EXPR_WITH_FILE_LOCATION)
6328 other_name = EXPR_WFL_NODE (other_name);
6329 if (!DECL_CLINIT_P (other_method)
6330 && !DECL_CONSTRUCTOR_P (other_method)
120f0c10
TT		 6331 && method_name == other_name
6332 && method_sig == s
6333 && !METHOD_ABSTRACT (other_method))
165f37bc
APB		 6334 {
6335 found = 1;
6336 break;
6337 }
6338 }
6339 other_super = CLASSTYPE_SUPER (other_super);
6340 } while (!end_type_reached);
e35b68b0 6341
d77613be
APB		 6342 /* Report that abstract METHOD didn't find an implementation
6343 that CLASS can use. */
6344 if (!found)
6345 {
e35b68b0 6346 char *t = xstrdup (lang_printable_name
d77613be
APB		 6347 (TREE_TYPE (TREE_TYPE (method)), 0));
6348 tree ccn = DECL_NAME (TYPE_NAME (DECL_CONTEXT (method)));
e35b68b0
AD		 6349
6350 parse_error_context
d77613be 6351 (lookup_cl (class_decl),
781b0558 6352 "Class `%s' doesn't define the abstract method `%s %s' from %s `%s'. This method must be defined or %s `%s' must be declared abstract",
d77613be 6353 IDENTIFIER_POINTER (DECL_NAME (class_decl)),
1b9deeb4 6354 t, lang_printable_name (method, 2),
e35b68b0 6355 (CLASS_INTERFACE (TYPE_NAME (DECL_CONTEXT (method))) ?
d77613be
APB		 6356 "interface" : "class"),
6357 IDENTIFIER_POINTER (ccn),
6358 (CLASS_INTERFACE (class_decl) ? "interface" : "class"),
6359 IDENTIFIER_POINTER (DECL_NAME (class_decl)));
1175b9b4 6360 ok = 0;
d77613be 6361 free (t);
d77613be
APB		 6362 }
6363 }
1175b9b4
TT		 6364
6365 if (ok && do_interface)
6366 {
6367 /* Check for implemented interfaces. */
6368 int i;
fa743e8c
NS		 6369 tree base_binfo;
6370
6371 for (i = 1;
6372 ok && BINFO_BASE_ITERATE (TYPE_BINFO (type), i, base_binfo);
6373 i++)
6374 ok = check_abstract_method_definitions (1, class_decl,
6375 BINFO_TYPE (base_binfo));
1175b9b4
TT		 6376 }
6377
6378 return ok;
d77613be
APB		 6379}
6380
614eaae0 6381/* Check that CLASS_DECL somehow implements all inherited abstract
d77613be
APB		 6382 methods. */
6383
6384static void
0a2f0c54 6385java_check_abstract_method_definitions (tree class_decl)
d77613be
APB		 6386{
6387 tree class = TREE_TYPE (class_decl);
fa743e8c 6388 tree super, base_binfo;
d77613be
APB		 6389 int i;
6390
6391 if (CLASS_ABSTRACT (class_decl))
6392 return;
6393
6394 /* Check for inherited types */
165f37bc
APB		 6395 super = class;
6396 do {
6397 super = CLASSTYPE_SUPER (super);
6398 check_abstract_method_definitions (0, class_decl, super);
6399 } while (super != object_type_node);
d77613be
APB		 6400
6401 /* Check for implemented interfaces. */
fa743e8c
NS		 6402 for (i = 1; BINFO_BASE_ITERATE (TYPE_BINFO (class), i, base_binfo); i++)
6403 check_abstract_method_definitions (1, class_decl, BINFO_TYPE (base_binfo));
d77613be
APB		 6404}
6405
165f37bc
APB		 6406/* Check all the types method DECL uses and return 1 if all of them
6407 are now complete, 0 otherwise. This is used to check whether its
6408 safe to build a method signature or not. */
6409
6410static int
0a2f0c54 6411check_method_types_complete (tree decl)
165f37bc
APB		 6412{
6413 tree type = TREE_TYPE (decl);
6414 tree args;
6415
6416 if (!INCOMPLETE_TYPE_P (TREE_TYPE (type)))
6417 return 0;
e35b68b0 6418
165f37bc
APB		 6419 args = TYPE_ARG_TYPES (type);
6420 if (TREE_CODE (type) == METHOD_TYPE)
6421 args = TREE_CHAIN (args);
6422 for (; args != end_params_node; args = TREE_CHAIN (args))
6423 if (INCOMPLETE_TYPE_P (TREE_VALUE (args)))
6424 return 0;
6425
6426 return 1;
6427}
6428
34d4df06
APB		 6429/* Visible interface to check methods contained in CLASS_DECL */
6430
6431void
0a2f0c54 6432java_check_methods (tree class_decl)
34d4df06
APB		 6433{
6434 if (CLASS_METHOD_CHECKED_P (TREE_TYPE (class_decl)))
6435 return;
6436
6437 if (CLASS_INTERFACE (class_decl))
6438 java_check_abstract_methods (class_decl);
6439 else
6440 java_check_regular_methods (class_decl);
e35b68b0 6441
34d4df06
APB		 6442 CLASS_METHOD_CHECKED_P (TREE_TYPE (class_decl)) = 1;
6443}
6444
aecf4109
TT		 6445/* Like not_accessible_p, but doesn't refer to the current class at
6446 all. */
6447static bool
6448hack_is_accessible_p (tree member, tree from_where)
6449{
6450 int flags = get_access_flags_from_decl (member);
6451
6452 if (from_where == DECL_CONTEXT (member)
6453 || (flags & ACC_PUBLIC))
6454 return true;
6455
6456 if ((flags & ACC_PROTECTED))
6457 {
6458 if (inherits_from_p (from_where, DECL_CONTEXT (member)))
6459 return true;
6460 }
6461
6462 if ((flags & ACC_PRIVATE))
6463 return false;
6464
6465 /* Package private, or protected. */
6466 return in_same_package (TYPE_NAME (from_where),
6467 TYPE_NAME (DECL_CONTEXT (member)));
6468}
6469
d77613be 6470/* Check all the methods of CLASS_DECL. Methods are first completed
a83f01f0 6471 then checked according to regular method existence rules. If no
d77613be
APB		 6472 constructor for CLASS_DECL were encountered, then build its
6473 declaration. */
e04a16fb 6474static void
0a2f0c54 6475java_check_regular_methods (tree class_decl)
e04a16fb 6476{
c2952b01 6477 int saw_constructor = ANONYMOUS_CLASS_P (TREE_TYPE (class_decl));
e04a16fb 6478 tree method;
c02ebb18 6479 tree class = TREE_TYPE (class_decl);
c4faeb92 6480 tree found = NULL_TREE;
c877974e
APB		 6481 tree mthrows;
6482
6483 /* It is not necessary to check methods defined in java.lang.Object */
6484 if (class == object_type_node)
6485 return;
e04a16fb 6486
23a79c61
APB		 6487 if (!TYPE_NVIRTUALS (class))
6488 TYPE_METHODS (class) = nreverse (TYPE_METHODS (class));
e04a16fb
AG		 6489
6490 /* Should take interfaces into account. FIXME */
6491 for (method = TYPE_METHODS (class); method; method = TREE_CHAIN (method))
6492 {
5e942c50 6493 tree sig;
c4faeb92 6494 tree method_wfl = DECL_FUNCTION_WFL (method);
e04a16fb
AG		 6495 int aflags;
6496
e04a16fb
AG		 6497 /* Check for redefinitions */
6498 if (check_method_redefinition (class, method))
6499 continue;
6500
6a807d35
TT		 6501 /* We verify things thrown by the method. They must inherit from
6502 java.lang.Throwable. */
c877974e
APB		 6503 for (mthrows = DECL_FUNCTION_THROWS (method);
6504 mthrows; mthrows = TREE_CHAIN (mthrows))
6505 {
6506 if (!inherits_from_p (TREE_VALUE (mthrows), throwable_type_node))
e35b68b0 6507 parse_error_context
781b0558 6508 (TREE_PURPOSE (mthrows), "Class `%s' in `throws' clause must be a subclass of class `java.lang.Throwable'",
e35b68b0 6509 IDENTIFIER_POINTER
c877974e
APB		 6510 (DECL_NAME (TYPE_NAME (TREE_VALUE (mthrows)))));
6511 }
6512
6a807d35
TT		 6513 /* If we see one constructor a mark so we don't generate the
6514 default one. Also skip other verifications: constructors
6515 can't be inherited hence hidden or overridden. */
6516 if (DECL_CONSTRUCTOR_P (method))
6517 {
6518 saw_constructor = 1;
6519 continue;
6520 }
6521
e04a16fb 6522 sig = build_java_argument_signature (TREE_TYPE (method));
aecf4109
TT		 6523 found = lookup_argument_method_generic (class, DECL_NAME (method), sig,
6524 SEARCH_SUPER | SEARCH_INTERFACE);
b9f7e36c 6525
c2952b01
APB		 6526 /* Inner class can't declare static methods */
6527 if (METHOD_STATIC (method) && !TOPLEVEL_CLASS_DECL_P (class_decl))
6528 {
6529 char *t = xstrdup (lang_printable_name (class, 0));
e35b68b0 6530 parse_error_context
c2952b01 6531 (method_wfl, "Method `%s' can't be static in inner class `%s'. Only members of interfaces and top-level classes can be static",
1b9deeb4 6532 lang_printable_name (method, 2), t);
c2952b01
APB		 6533 free (t);
6534 }
6535
5e942c50 6536 /* Nothing overrides or it's a private method. */
aabd7048 6537 if (!found)
5e942c50 6538 continue;
aabd7048
PB		 6539 if (METHOD_PRIVATE (found))
6540 {
6541 found = NULL_TREE;
6542 continue;
6543 }
5e942c50 6544
614eaae0
APB		 6545 /* If `found' is declared in an interface, make sure the
6546 modifier matches. */
e35b68b0 6547 if (CLASS_INTERFACE (TYPE_NAME (DECL_CONTEXT (found)))
614eaae0
APB		 6548 && clinit_identifier_node != DECL_NAME (found)
6549 && !METHOD_PUBLIC (method))
6550 {
6551 tree found_decl = TYPE_NAME (DECL_CONTEXT (found));
6552 parse_error_context (method_wfl, "Class `%s' must override `%s' with a public method in order to implement interface `%s'",
6553 IDENTIFIER_POINTER (DECL_NAME (class_decl)),
1b9deeb4 6554 lang_printable_name (method, 2),
614eaae0
APB		 6555 IDENTIFIER_POINTER (DECL_NAME (found_decl)));
6556 }
6557
e04a16fb
AG		 6558 /* Can't override a method with the same name and different return
6559 types. */
6560 if (TREE_TYPE (TREE_TYPE (found)) != TREE_TYPE (TREE_TYPE (method)))
b9f7e36c 6561 {
e35b68b0 6562 char *t = xstrdup
1b9deeb4 6563 (lang_printable_name (TREE_TYPE (TREE_TYPE (found)), 2));
e35b68b0 6564 parse_error_context
7f10c2e2 6565 (method_wfl,
e35b68b0 6566 "Method `%s' was defined with return type `%s' in class `%s'",
1b9deeb4 6567 lang_printable_name (found, 2), t,
e35b68b0 6568 IDENTIFIER_POINTER
b9f7e36c
APB		 6569 (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found)))));
6570 free (t);
6571 }
e04a16fb 6572
7f10c2e2 6573 aflags = get_access_flags_from_decl (found);
7f10c2e2 6574
e04a16fb
AG		 6575 /* Can't override final. Can't override static. */
6576 if (METHOD_FINAL (found) || METHOD_STATIC (found))
6577 {
6578 /* Static *can* override static */
6579 if (METHOD_STATIC (found) && METHOD_STATIC (method))
6580 continue;
e35b68b0 6581 parse_error_context
e04a16fb 6582 (method_wfl,
aecf4109 6583 "%s methods can't be overridden. Method `%s' is %s in class `%s'",
e04a16fb 6584 (METHOD_FINAL (found) ? "Final" : "Static"),
1b9deeb4 6585 lang_printable_name (found, 2),
e04a16fb
AG		 6586 (METHOD_FINAL (found) ? "final" : "static"),
6587 IDENTIFIER_POINTER
6588 (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found)))));
6589 continue;
6590 }
7f10c2e2 6591
e04a16fb
AG		 6592 /* Static method can't override instance method. */
6593 if (METHOD_STATIC (method))
6594 {
e35b68b0 6595 parse_error_context
e04a16fb 6596 (method_wfl,
aecf4109 6597 "Instance methods can't be overridden by a static method. Method `%s' is an instance method in class `%s'",
1b9deeb4 6598 lang_printable_name (found, 2),
e04a16fb
AG		 6599 IDENTIFIER_POINTER
6600 (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found)))));
6601 continue;
6602 }
5e942c50 6603
5e942c50
APB		 6604 /* - Overriding/hiding public must be public
6605 - Overriding/hiding protected must be protected or public
aecf4109 6606 - If the overridden or hidden method has default (package)
5e942c50 6607 access, then the overriding or hiding method must not be
614eaae0
APB		 6608 private; otherwise, a compile-time error occurs. If
6609 `found' belongs to an interface, things have been already
6610 taken care of. */
6611 if (!CLASS_INTERFACE (TYPE_NAME (DECL_CONTEXT (found)))
6612 && ((METHOD_PUBLIC (found) && !METHOD_PUBLIC (method))
e35b68b0 6613 || (METHOD_PROTECTED (found)
614eaae0
APB		 6614 && !(METHOD_PUBLIC (method) || METHOD_PROTECTED (method)))
6615 || (!(aflags & (ACC_PUBLIC | ACC_PRIVATE | ACC_STATIC))
6616 && METHOD_PRIVATE (method))))
e04a16fb 6617 {
e35b68b0 6618 parse_error_context
e04a16fb 6619 (method_wfl,
1b9deeb4 6620 "Methods can't be overridden to be more private. Method `%s' is not %s in class `%s'", lang_printable_name (method, 2),
e35b68b0 6621 (METHOD_PUBLIC (method) ? "public" :
5e942c50 6622 (METHOD_PRIVATE (method) ? "private" : "protected")),
e35b68b0 6623 IDENTIFIER_POINTER (DECL_NAME
5e942c50 6624 (TYPE_NAME (DECL_CONTEXT (found)))));
e04a16fb
AG		 6625 continue;
6626 }
6627
aecf4109
TT		 6628 /* Check this method against all the other implementations it
6629 overrides. Here we only check the class hierarchy; the rest
6630 of the checking is done later. If this method is just a
6631 Miranda method, we can skip the check. */
6632 if (! METHOD_INVISIBLE (method))
6633 check_concrete_throws_clauses (class, method, DECL_NAME (method), sig);
e04a16fb 6634 }
e35b68b0 6635
aecf4109
TT		 6636 /* The above throws clause check only looked at superclasses. Now
6637 we must also make sure that all methods declared in interfaces
6638 have compatible throws clauses. FIXME: there are more efficient
6639 ways to organize this checking; we should implement one. */
6640 check_interface_throws_clauses (class, class);
6641
23a79c61
APB		 6642 if (!TYPE_NVIRTUALS (class))
6643 TYPE_METHODS (class) = nreverse (TYPE_METHODS (class));
e04a16fb 6644
d77613be
APB		 6645 /* Search for inherited abstract method not yet implemented in this
6646 class. */
6647 java_check_abstract_method_definitions (class_decl);
6648
22eed1e6 6649 if (!saw_constructor)
400500c4 6650 abort ();
e04a16fb
AG		 6651}
6652
aecf4109
TT		 6653/* Check to make sure that all the methods in all the interfaces
6654 implemented by CLASS_DECL are compatible with the concrete
6655 implementations available in CHECK_CLASS_DECL. */
6656static void
6657check_interface_throws_clauses (tree check_class_decl, tree class_decl)
6658{
6659 for (; class_decl != NULL_TREE; class_decl = CLASSTYPE_SUPER (class_decl))
6660 {
aecf4109
TT		 6661 int i;
6662
ea095e9a
AH		 6663 if (! CLASS_LOADED_P (class_decl))
6664 {
6665 if (CLASS_FROM_SOURCE_P (class_decl))
6666 safe_layout_class (class_decl);
6667 else
6668 load_class (class_decl, 1);
6669 }
6670
fa743e8c 6671 for (i = BINFO_N_BASE_BINFOS (TYPE_BINFO (class_decl)) - 1; i > 0; --i)
aecf4109 6672 {
fa743e8c
NS		 6673 tree interface
6674 = BINFO_TYPE (BINFO_BASE_BINFO (TYPE_BINFO (class_decl), i));
aecf4109 6675 tree iface_method;
b9f7e36c 6676
aecf4109
TT		 6677 for (iface_method = TYPE_METHODS (interface);
6678 iface_method != NULL_TREE;
6679 iface_method = TREE_CHAIN (iface_method))
6680 {
6681 tree sig, method;
6682
6683 /* First look for a concrete method implemented or
6684 inherited by this class. No need to search
6685 interfaces here, since we're already looking through
6686 all of them. */
6687 sig = build_java_argument_signature (TREE_TYPE (iface_method));
6688 method
6689 = lookup_argument_method_generic (check_class_decl,
6690 DECL_NAME (iface_method),
6691 sig, SEARCH_VISIBLE);
6692 /* If we don't find an implementation, that is ok. Any
6693 potential errors from that are diagnosed elsewhere.
6694 Also, multiple inheritance with conflicting throws
6695 clauses is fine in the absence of a concrete
6696 implementation. */
bddefd4f
AH		 6697 if (method != NULL_TREE && !METHOD_ABSTRACT (method)
6698 && !METHOD_INVISIBLE (iface_method))
aecf4109
TT		 6699 {
6700 tree method_wfl = DECL_FUNCTION_WFL (method);
6701 check_throws_clauses (method, method_wfl, iface_method);
6702 }
6703 }
6704
6705 /* Now check superinterfaces. */
6706 check_interface_throws_clauses (check_class_decl, interface);
6707 }
6708 }
6709}
6710
6711/* Check throws clauses of a method against the clauses of all the
6712 methods it overrides. We do this by searching up the class
6713 hierarchy, examining all matching accessible methods. */
6714static void
6715check_concrete_throws_clauses (tree class, tree self_method,
6716 tree name, tree signature)
6717{
6718 tree method = lookup_argument_method_generic (class, name, signature,
6719 SEARCH_SUPER | SEARCH_VISIBLE);
6720 while (method != NULL_TREE)
6721 {
6722 if (! METHOD_INVISIBLE (method) && hack_is_accessible_p (method, class))
6723 check_throws_clauses (self_method, DECL_FUNCTION_WFL (self_method),
6724 method);
6725
6726 method = lookup_argument_method_generic (DECL_CONTEXT (method),
6727 name, signature,
6728 SEARCH_SUPER | SEARCH_VISIBLE);
6729 }
6730}
6731
6732/* Generate an error if the `throws' clause of METHOD (if any) is
6733 incompatible with the `throws' clause of FOUND (if any). */
b9f7e36c 6734static void
0a2f0c54 6735check_throws_clauses (tree method, tree method_wfl, tree found)
b9f7e36c 6736{
aecf4109 6737 tree mthrows;
b9f7e36c 6738
c877974e
APB		 6739 /* Can't check these things with class loaded from bytecode. FIXME */
6740 if (!CLASS_FROM_SOURCE_P (DECL_CONTEXT (found)))
6741 return;
6742
b9f7e36c
APB		 6743 for (mthrows = DECL_FUNCTION_THROWS (method);
6744 mthrows; mthrows = TREE_CHAIN (mthrows))
6745 {
aecf4109
TT		 6746 tree fthrows;
6747
b9f7e36c 6748 /* We don't verify unchecked expressions */
c877974e 6749 if (IS_UNCHECKED_EXCEPTION_P (TREE_VALUE (mthrows)))
b9f7e36c
APB		 6750 continue;
6751 /* Checked expression must be compatible */
e35b68b0 6752 for (fthrows = DECL_FUNCTION_THROWS (found);
b9f7e36c 6753 fthrows; fthrows = TREE_CHAIN (fthrows))
aecf4109
TT		 6754 {
6755 if (inherits_from_p (TREE_VALUE (mthrows), TREE_VALUE (fthrows)))
6756 break;
6757 }
b9f7e36c
APB		 6758 if (!fthrows)
6759 {
e35b68b0 6760 parse_error_context
aecf4109 6761 (method_wfl, "Invalid checked exception class `%s' in `throws' clause. The exception must be a subclass of an exception thrown by `%s' from class `%s'",
b9f7e36c 6762 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (TREE_VALUE (mthrows)))),
1b9deeb4 6763 lang_printable_name (found, 2),
e35b68b0 6764 IDENTIFIER_POINTER
aecf4109 6765 (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found)))));
b9f7e36c
APB		 6766 }
6767 }
6768}
6769
e04a16fb 6770/* Check abstract method of interface INTERFACE */
e04a16fb 6771static void
0a2f0c54 6772java_check_abstract_methods (tree interface_decl)
e04a16fb 6773{
fa743e8c
NS		 6774 int i;
6775 tree method, found;
5e942c50 6776 tree interface = TREE_TYPE (interface_decl);
fa743e8c 6777 tree base_binfo;
e04a16fb
AG		 6778
6779 for (method = TYPE_METHODS (interface); method; method = TREE_CHAIN (method))
6780 {
e04a16fb
AG		 6781 /* 2- Check for double definition inside the defining interface */
6782 if (check_method_redefinition (interface, method))
6783 continue;
6784
aecf4109 6785 /* 3- Overriding is OK as far as we preserve the return type. */
e04a16fb
AG		 6786 found = lookup_java_interface_method2 (interface, method);
6787 if (found)
6788 {
5e942c50 6789 char *t;
1b9deeb4 6790 t = xstrdup (lang_printable_name (TREE_TYPE (TREE_TYPE (found)), 2));
e35b68b0 6791 parse_error_context
c4faeb92 6792 (DECL_FUNCTION_WFL (found),
5e942c50 6793 "Method `%s' was defined with return type `%s' in class `%s'",
1b9deeb4 6794 lang_printable_name (found, 2), t,
e35b68b0 6795 IDENTIFIER_POINTER
b9f7e36c
APB		 6796 (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found)))));
6797 free (t);
c63b98cd 6798 continue;
e04a16fb
AG		 6799 }
6800 }
6801
6802 /* 4- Inherited methods can't differ by their returned types */
fa743e8c 6803 for (i = 0; BINFO_BASE_ITERATE (TYPE_BINFO (interface), i, base_binfo); i++)
e04a16fb
AG		 6804 {
6805 tree sub_interface_method, sub_interface;
fa743e8c
NS		 6806
6807 sub_interface = BINFO_TYPE (base_binfo);
e35b68b0 6808 for (sub_interface_method = TYPE_METHODS (sub_interface);
e04a16fb
AG		 6809 sub_interface_method;
6810 sub_interface_method = TREE_CHAIN (sub_interface_method))
6811 {
e35b68b0 6812 found = lookup_java_interface_method2 (interface,
e04a16fb
AG		 6813 sub_interface_method);
6814 if (found && (found != sub_interface_method))
5e942c50 6815 {
e35b68b0 6816 parse_error_context
5e942c50 6817 (lookup_cl (sub_interface_method),
781b0558 6818 "Interface `%s' inherits method `%s' from interface `%s'. This method is redefined with a different return type in interface `%s'",
5e942c50 6819 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (interface))),
1b9deeb4 6820 lang_printable_name (found, 2),
e35b68b0
AD		 6821 IDENTIFIER_POINTER
6822 (DECL_NAME (TYPE_NAME
5e942c50 6823 (DECL_CONTEXT (sub_interface_method)))),
e35b68b0 6824 IDENTIFIER_POINTER
5e942c50 6825 (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found)))));
5e942c50 6826 }
e04a16fb
AG		 6827 }
6828 }
6829}
6830
e04a16fb
AG		 6831/* Lookup methods in interfaces using their name and partial
6832 signature. Return a matching method only if their types differ. */
6833
6834static tree
0a2f0c54 6835lookup_java_interface_method2 (tree class, tree method_decl)
e04a16fb 6836{
fa743e8c
NS		 6837 int i;
6838 tree base_binfo;
604a3205 6839 tree to_return;
e04a16fb 6840
fa743e8c 6841 for (i = 0; BINFO_BASE_ITERATE (TYPE_BINFO (class), i, base_binfo); i++)
e04a16fb 6842 {
fa743e8c 6843 if ((BINFO_TYPE (base_binfo) != object_type_node)
e35b68b0 6844 && (to_return =
fa743e8c 6845 lookup_java_method2 (BINFO_TYPE (base_binfo), method_decl, 1)))
e04a16fb
AG		 6846 return to_return;
6847 }
fa743e8c 6848 for (i = 0; BINFO_BASE_ITERATE (TYPE_BINFO (class), i, base_binfo); i++)
e04a16fb 6849 {
e35b68b0 6850 to_return = lookup_java_interface_method2
fa743e8c 6851 (BINFO_TYPE (base_binfo), method_decl);
e04a16fb
AG		 6852 if (to_return)
6853 return to_return;
6854 }
6855
6856 return NULL_TREE;
6857}
6858
6859/* Lookup method using their name and partial signature. Return a
6860 matching method only if their types differ. */
6861
6862static tree
0a2f0c54 6863lookup_java_method2 (tree clas, tree method_decl, int do_interface)
e04a16fb 6864{
5e942c50
APB		 6865 tree method, method_signature, method_name, method_type, name;
6866
e04a16fb 6867 method_signature = build_java_argument_signature (TREE_TYPE (method_decl));
5e942c50 6868 name = DECL_NAME (method_decl);
e35b68b0 6869 method_name = (TREE_CODE (name) == EXPR_WITH_FILE_LOCATION ?
5e942c50 6870 EXPR_WFL_NODE (name) : name);
e04a16fb
AG		 6871 method_type = TREE_TYPE (TREE_TYPE (method_decl));
6872
6873 while (clas != NULL_TREE)
6874 {
6875 for (method = TYPE_METHODS (clas);
6876 method != NULL_TREE; method = TREE_CHAIN (method))
6877 {
6878 tree method_sig = build_java_argument_signature (TREE_TYPE (method));
5e942c50
APB		 6879 tree name = DECL_NAME (method);
6880 if ((TREE_CODE (name) == EXPR_WITH_FILE_LOCATION ?
6881 EXPR_WFL_NODE (name) : name) == method_name
e35b68b0 6882 && method_sig == method_signature
e04a16fb 6883 && TREE_TYPE (TREE_TYPE (method)) != method_type)
5e942c50 6884 return method;
e04a16fb
AG		 6885 }
6886 clas = (do_interface ? NULL_TREE : CLASSTYPE_SUPER (clas));
6887 }
6888 return NULL_TREE;
6889}
6890
f441f671 6891/* Return the line that matches DECL line number, and try its best to
9ec819d4
PB		 6892 position the column number. Used during error reports.
6893 FUTURE/FIXME: return source_location instead of node. */
e04a16fb 6894
e2500fed 6895static GTY(()) tree cl_v;
e04a16fb 6896static tree
0a2f0c54 6897lookup_cl (tree decl)
e04a16fb 6898{
9ec819d4 6899#ifndef USE_MAPPED_LOCATION
f441f671 6900 char *line, *found;
9ec819d4 6901#endif
e35b68b0 6902
e04a16fb
AG		 6903 if (!decl)
6904 return NULL_TREE;
6905
e2500fed 6906 if (cl_v == NULL_TREE)
19e223db 6907 {
9ec819d4 6908 cl_v = build_unknown_wfl (NULL_TREE);
19e223db 6909 }
e04a16fb 6910
9ec819d4
PB		 6911#ifdef USE_MAPPED_LOCATION
6912 SET_EXPR_LOCATION (cl_v, DECL_SOURCE_LOCATION (decl));
6913#else
f31686a3
RH		 6914 EXPR_WFL_FILENAME_NODE (cl_v) = get_identifier (DECL_SOURCE_FILE (decl));
6915 EXPR_WFL_SET_LINECOL (cl_v, DECL_SOURCE_LINE (decl), -1);
e04a16fb 6916
e35b68b0 6917 line = java_get_line_col (EXPR_WFL_FILENAME (cl_v),
e2500fed 6918 EXPR_WFL_LINENO (cl_v), EXPR_WFL_COLNO (cl_v));
f441f671 6919
e35b68b0 6920 found = strstr ((const char *)line,
f441f671
APB		 6921 (const char *)IDENTIFIER_POINTER (DECL_NAME (decl)));
6922 if (found)
e2500fed 6923 EXPR_WFL_SET_LINECOL (cl_v, EXPR_WFL_LINENO (cl_v), found - line);
9ec819d4 6924#endif
f441f671 6925
e2500fed 6926 return cl_v;
e04a16fb
AG		 6927}
6928
6929/* Look for a simple name in the single-type import list */
6930
6931static tree
0a2f0c54 6932find_name_in_single_imports (tree name)
e04a16fb
AG		 6933{
6934 tree node;
6935
6936 for (node = ctxp->import_list; node; node = TREE_CHAIN (node))
6937 if (TREE_VALUE (node) == name)
6938 return (EXPR_WFL_NODE (TREE_PURPOSE (node)));
6939
6940 return NULL_TREE;
6941}
6942
6943/* Process all single-type import. */
6944
6945static int
0a2f0c54 6946process_imports (void)
e04a16fb
AG		 6947{
6948 tree import;
6949 int error_found;
6950
6951 for (import = ctxp->import_list; import; import = TREE_CHAIN (import))
6952 {
6953 tree to_be_found = EXPR_WFL_NODE (TREE_PURPOSE (import));
1ebb5e73
APB		 6954 char *original_name;
6955
17211ab5
GK		 6956 original_name = xmemdup (IDENTIFIER_POINTER (to_be_found),
6957 IDENTIFIER_LENGTH (to_be_found),
6958 IDENTIFIER_LENGTH (to_be_found) + 1);
e04a16fb
AG		 6959
6960 /* Don't load twice something already defined. */
6961 if (IDENTIFIER_CLASS_VALUE (to_be_found))
6962 continue;
e35b68b0 6963
02ae6e2e
APB		 6964 while (1)
6965 {
6966 tree left;
6967
6968 QUALIFIED_P (to_be_found) = 1;
6969 load_class (to_be_found, 0);
6970 error_found =
7cef5027 6971 check_pkg_class_access (to_be_found, TREE_PURPOSE (import), true, NULL_TREE);
e35b68b0 6972
02ae6e2e
APB		 6973 /* We found it, we can bail out */
6974 if (IDENTIFIER_CLASS_VALUE (to_be_found))
f94ae540
TT		 6975 {
6976 check_deprecation (TREE_PURPOSE (import),
6977 IDENTIFIER_CLASS_VALUE (to_be_found));
6978 break;
6979 }
02ae6e2e
APB		 6980
6981 /* We haven't found it. Maybe we're trying to access an
6982 inner class. The only way for us to know is to try again
6983 after having dropped a qualifier. If we can't break it further,
6984 we have an error. */
9c5fdae6 6985 if (split_qualified_name (&left, NULL, to_be_found))
02ae6e2e
APB		 6986 break;
6987
6988 to_be_found = left;
6989 }
e04a16fb
AG		 6990 if (!IDENTIFIER_CLASS_VALUE (to_be_found))
6991 {
6992 parse_error_context (TREE_PURPOSE (import),
6993 "Class or interface `%s' not found in import",
1ebb5e73
APB		 6994 original_name);
6995 error_found = 1;
e04a16fb 6996 }
1ebb5e73 6997
17211ab5 6998 free (original_name);
e04a16fb
AG		 6999 if (error_found)
7000 return 1;
7001 }
7002 return 0;
7003}
7004
9a7ab4b3
APB		 7005/* Possibly find and mark a class imported by a single-type import
7006 statement. */
e04a16fb 7007
9a7ab4b3 7008static void
0a2f0c54 7009find_in_imports (tree enclosing_type, tree class_type)
e04a16fb 7010{
e35b68b0 7011 tree import = (enclosing_type ? TYPE_IMPORT_LIST (enclosing_type) :
653d5d95
APB		 7012 ctxp->import_list);
7013 while (import)
7014 {
7015 if (TREE_VALUE (import) == TYPE_NAME (class_type))
7016 {
7017 TYPE_NAME (class_type) = EXPR_WFL_NODE (TREE_PURPOSE (import));
7018 QUALIFIED_P (TYPE_NAME (class_type)) = 1;
7019 return;
7020 }
7021 import = TREE_CHAIN (import);
7022 }
e04a16fb
AG		 7023}
7024
e04a16fb 7025static int
0a2f0c54 7026note_possible_classname (const char *name, int len)
e04a16fb 7027{
63a212ed
PB		 7028 tree node;
7029 if (len > 5 && strncmp (&name [len-5], ".java", 5) == 0)
7030 len = len - 5;
7031 else if (len > 6 && strncmp (&name [len-6], ".class", 6) == 0)
7032 len = len - 6;
e04a16fb 7033 else
63a212ed
PB		 7034 return 0;
7035 node = ident_subst (name, len, "", '/', '.', "");
7036 IS_A_CLASSFILE_NAME (node) = 1; /* Or soon to be */
fe0e4d76 7037 QUALIFIED_P (node) = strchr (name, '/') ? 1 : 0;
63a212ed 7038 return 1;
e04a16fb
AG		 7039}
7040
7041/* Read a import directory, gathering potential match for further type
7042 references. Indifferently reads a filesystem or a ZIP archive
7043 directory. */
7044
7045static void
0a2f0c54 7046read_import_dir (tree wfl)
e04a16fb 7047{
63a212ed 7048 tree package_id = EXPR_WFL_NODE (wfl);
49f48c71 7049 const char *package_name = IDENTIFIER_POINTER (package_id);
63a212ed 7050 int package_length = IDENTIFIER_LENGTH (package_id);
e04a16fb 7051 DIR *dirp = NULL;
d8fccff5 7052 JCF *saved_jcf = current_jcf;
e04a16fb 7053
63a212ed
PB		 7054 int found = 0;
7055 int k;
7056 void *entry;
7057 struct buffer filename[1];
7058
63a212ed
PB		 7059 if (IS_AN_IMPORT_ON_DEMAND_P (package_id))
7060 return;
7061 IS_AN_IMPORT_ON_DEMAND_P (package_id) = 1;
7062
7063 BUFFER_INIT (filename);
7064 buffer_grow (filename, package_length + 100);
7065
7066 for (entry = jcf_path_start (); entry != NULL; entry = jcf_path_next (entry))
7067 {
49f48c71 7068 const char *entry_name = jcf_path_name (entry);
63a212ed
PB		 7069 int entry_length = strlen (entry_name);
7070 if (jcf_path_is_zipfile (entry))
7071 {
7072 ZipFile *zipf;
7073 buffer_grow (filename, entry_length);
7074 memcpy (filename->data, entry_name, entry_length - 1);
7075 filename->data[entry_length-1] = '\0';
0e7d217a 7076 zipf = opendir_in_zip ((const char *) filename->data, jcf_path_is_system (entry));
63a212ed
PB		 7077 if (zipf == NULL)
7078 error ("malformed .zip archive in CLASSPATH: %s", entry_name);
7079 else
7080 {
7081 ZipDirectory *zipd = (ZipDirectory *) zipf->central_directory;
7082 BUFFER_RESET (filename);
7083 for (k = 0; k < package_length; k++)
7084 {
7085 char ch = package_name[k];
7086 *filename->ptr++ = ch == '.' ? '/' : ch;
7087 }
7088 *filename->ptr++ = '/';
7089
345137c7 7090 for (k = 0; k < zipf->count; k++, zipd = ZIPDIR_NEXT (zipd))
63a212ed 7091 {
49f48c71 7092 const char *current_entry = ZIPDIR_FILENAME (zipd);
63a212ed
PB		 7093 int current_entry_len = zipd->filename_length;
7094
345137c7 7095 if (current_entry_len >= BUFFER_LENGTH (filename)
0e7d217a 7096 && strncmp ((const char *) filename->data, current_entry,
345137c7 7097 BUFFER_LENGTH (filename)) != 0)
63a212ed 7098 continue;
345137c7 7099 found |= note_possible_classname (current_entry,
63a212ed
PB		 7100 current_entry_len);
7101 }
7102 }
7103 }
7104 else
7105 {
7106 BUFFER_RESET (filename);
7107 buffer_grow (filename, entry_length + package_length + 4);
0e7d217a 7108 strcpy ((char *) filename->data, entry_name);
63a212ed
PB		 7109 filename->ptr = filename->data + entry_length;
7110 for (k = 0; k < package_length; k++)
7111 {
7112 char ch = package_name[k];
7113 *filename->ptr++ = ch == '.' ? '/' : ch;
7114 }
7115 *filename->ptr = '\0';
7116
0e7d217a 7117 dirp = opendir ((const char *) filename->data);
63a212ed
PB		 7118 if (dirp == NULL)
7119 continue;
7120 *filename->ptr++ = '/';
7121 for (;;)
7122 {
e35b68b0 7123 int len;
49f48c71 7124 const char *d_name;
63a212ed
PB		 7125 struct dirent *direntp = readdir (dirp);
7126 if (!direntp)
7127 break;
7128 d_name = direntp->d_name;
7129 len = strlen (direntp->d_name);
7130 buffer_grow (filename, len+1);
0e7d217a
MS		 7131 strcpy ((char *) filename->ptr, d_name);
7132 found |= note_possible_classname ((const char *) filename->data + entry_length,
63a212ed
PB		 7133 package_length+len+1);
7134 }
7135 if (dirp)
7136 closedir (dirp);
7137 }
7138 }
e04a16fb 7139
63a212ed 7140 free (filename->data);
e04a16fb 7141
63a212ed
PB		 7142 /* Here we should have a unified way of retrieving an entry, to be
7143 indexed. */
7144 if (!found)
e04a16fb
AG		 7145 {
7146 static int first = 1;
7147 if (first)
7148 {
c725bd79 7149 error ("Can't find default package `%s'. Check the CLASSPATH environment variable and the access to the archives", package_name);
e04a16fb
AG		 7150 java_error_count++;
7151 first = 0;
7152 }
7153 else
63a212ed
PB		 7154 parse_error_context (wfl, "Package `%s' not found in import",
7155 package_name);
e04a16fb
AG		 7156 current_jcf = saved_jcf;
7157 return;
7158 }
e04a16fb
AG		 7159 current_jcf = saved_jcf;
7160}
7161
7162/* Possibly find a type in the import on demands specified
a83f01f0 7163 types. Returns 1 if an error occurred, 0 otherwise. Run through the
e04a16fb 7164 entire list, to detected potential double definitions. */
e35b68b0 7165
e04a16fb 7166static int
0a2f0c54 7167find_in_imports_on_demand (tree enclosing_type, tree class_type)
e04a16fb 7168{
98f705b9 7169 tree class_type_name = TYPE_NAME (class_type);
653d5d95
APB		 7170 tree import = (enclosing_type ? TYPE_IMPORT_DEMAND_LIST (enclosing_type) :
7171 ctxp->import_demand_list);
98f705b9
APB		 7172 tree cl = NULL_TREE;
7173 int seen_once = -1; /* -1 when not set, 1 if seen once, >1 otherwise. */
7174 int to_return = -1; /* -1 when not set, 0 or 1 otherwise */
653d5d95 7175 tree node;
e04a16fb 7176
98f705b9 7177 for (; import; import = TREE_CHAIN (import))
e04a16fb 7178 {
9ec819d4 7179 location_t saved_location = input_location;
98f705b9 7180 int access_check;
49f48c71 7181 const char *id_name;
98f705b9
APB		 7182 tree decl, type_name_copy;
7183
e35b68b0 7184 obstack_grow (&temporary_obstack,
e04a16fb
AG		 7185 IDENTIFIER_POINTER (EXPR_WFL_NODE (TREE_PURPOSE (import))),
7186 IDENTIFIER_LENGTH (EXPR_WFL_NODE (TREE_PURPOSE (import))));
63a212ed 7187 obstack_1grow (&temporary_obstack, '.');
e35b68b0 7188 obstack_grow0 (&temporary_obstack,
98f705b9
APB		 7189 IDENTIFIER_POINTER (class_type_name),
7190 IDENTIFIER_LENGTH (class_type_name));
e04a16fb 7191 id_name = obstack_finish (&temporary_obstack);
e35b68b0 7192
98f705b9
APB		 7193 if (! (node = maybe_get_identifier (id_name)))
7194 continue;
7195
6de9cd9a 7196 /* Setup input_line so that it refers to the line of the import (in
98f705b9 7197 case we parse a class file and encounter errors */
9ec819d4
PB		 7198#ifdef USE_MAPPED_LOCATION
7199 input_location = EXPR_LOCATION (TREE_PURPOSE (import));
7200#else
d479d37f 7201 input_line = EXPR_WFL_LINENO (TREE_PURPOSE (import));
9ec819d4 7202#endif
98f705b9
APB		 7203
7204 type_name_copy = TYPE_NAME (class_type);
7205 TYPE_NAME (class_type) = node;
7206 QUALIFIED_P (node) = 1;
7207 decl = IDENTIFIER_CLASS_VALUE (node);
7208 access_check = -1;
7209 /* If there is no DECL set for the class or if the class isn't
7210 loaded and not seen in source yet, then load */
ed7f2369 7211 if (!decl || ! CLASS_LOADED_P (TREE_TYPE (decl)))
98f705b9
APB		 7212 {
7213 load_class (node, 0);
7214 decl = IDENTIFIER_CLASS_VALUE (node);
7215 }
7216 if (decl && ! INNER_CLASS_P (TREE_TYPE (decl)))
7217 access_check = check_pkg_class_access (node, TREE_PURPOSE (import),
7cef5027 7218 false, NULL_TREE);
98f705b9
APB		 7219 else
7220 /* 6.6.1: Inner classes are subject to member access rules. */
7221 access_check = 0;
7222
9ec819d4 7223 input_location = saved_location;
98f705b9
APB		 7224
7225 /* If the loaded class is not accessible or couldn't be loaded,
7226 we restore the original TYPE_NAME and process the next
7227 import. */
7228 if (access_check || !decl)
7229 {
7230 TYPE_NAME (class_type) = type_name_copy;
7231 continue;
7232 }
e35b68b0 7233
98f705b9
APB		 7234 /* If the loaded class is accessible, we keep a tab on it to
7235 detect and report multiple inclusions. */
7236 if (IS_A_CLASSFILE_NAME (node))
e04a16fb
AG		 7237 {
7238 if (seen_once < 0)
7239 {
7240 cl = TREE_PURPOSE (import);
7241 seen_once = 1;
e04a16fb 7242 }
98f705b9 7243 else if (seen_once >= 0)
e04a16fb 7244 {
98f705b9 7245 tree location = (cl ? cl : TREE_PURPOSE (import));
e35b68b0 7246 tree package = (cl ? EXPR_WFL_NODE (cl) :
98f705b9 7247 EXPR_WFL_NODE (TREE_PURPOSE (import)));
e04a16fb 7248 seen_once++;
e35b68b0 7249 parse_error_context
98f705b9 7250 (location,
1e12ab9b 7251 "Type `%s' also potentially defined in package `%s'",
e35b68b0 7252 IDENTIFIER_POINTER (TYPE_NAME (class_type)),
98f705b9 7253 IDENTIFIER_POINTER (package));
e04a16fb
AG		 7254 }
7255 }
98f705b9 7256 to_return = access_check;
e04a16fb
AG		 7257 }
7258
7259 if (seen_once == 1)
98f705b9 7260 return to_return;
e04a16fb
AG		 7261 else
7262 return (seen_once < 0 ? 0 : seen_once); /* It's ok not to have found */
7263}
7264
6b55b27f 7265/* Add package NAME to the list of packages encountered so far. To
9a7ab4b3
APB		 7266 speed up class lookup in do_resolve_class, we make sure a
7267 particular package is added only once. */
7268
7269static void
0a2f0c54 7270register_package (tree name)
9a7ab4b3 7271{
e2500fed 7272 static htab_t pht;
77d3109b 7273 void **e;
9a7ab4b3 7274
e2500fed
GK		 7275 if (pht == NULL)
7276 pht = htab_create (50, htab_hash_pointer, htab_eq_pointer, NULL);
7277
7278 e = htab_find_slot (pht, name, INSERT);
7279 if (*e == NULL)
9a7ab4b3
APB		 7280 {
7281 package_list = chainon (package_list, build_tree_list (name, NULL));
e2500fed 7282 *e = name;
9a7ab4b3
APB		 7283 }
7284}
7285
5e942c50 7286static tree
0a2f0c54 7287resolve_package (tree pkg, tree *next, tree *type_name)
5e942c50 7288{
c187b20e
BM		 7289 tree current;
7290 tree decl = NULL_TREE;
2f418289 7291 *type_name = NULL_TREE;
5e942c50
APB		 7292
7293 /* The trick is to determine when the package name stops and were
7294 the name of something contained in the package starts. Then we
7295 return a fully qualified name of what we want to get. */
7296
2c56429a
APB		 7297 *next = EXPR_WFL_QUALIFICATION (pkg);
7298
c2952b01
APB		 7299 /* Try to progressively construct a type name */
7300 if (TREE_CODE (pkg) == EXPR_WITH_FILE_LOCATION)
e35b68b0 7301 for (current = EXPR_WFL_QUALIFICATION (pkg);
c2952b01
APB		 7302 current; current = TREE_CHAIN (current))
7303 {
2df37a59
APB		 7304 /* If we don't have what we're expecting, exit now. TYPE_NAME
7305 will be null and the error caught later. */
7306 if (TREE_CODE (QUAL_WFL (current)) != EXPR_WITH_FILE_LOCATION)
7307 break;
e35b68b0 7308 *type_name =
2f418289
BM		 7309 merge_qualified_name (*type_name, EXPR_WFL_NODE (QUAL_WFL (current)));
7310 if ((decl = resolve_no_layout (*type_name, NULL_TREE)))
c2952b01 7311 {
6b48deee
APB		 7312 /* resolve_package should be used in a loop, hence we
7313 point at this one to naturally process the next one at
7314 the next iteration. */
7315 *next = current;
c2952b01
APB		 7316 break;
7317 }
7318 }
2f418289 7319 return decl;
2c56429a
APB		 7320}
7321
5e942c50 7322
e35b68b0 7323/* Check accessibility of inner classes according to member access rules.
a648f4e4
BM		 7324 DECL is the inner class, ENCLOSING_DECL is the class from which the
7325 access is being attempted. */
7326
cf1748bf 7327static void
0a2f0c54 7328check_inner_class_access (tree decl, tree enclosing_decl, tree cl)
cf1748bf 7329{
a648f4e4 7330 const char *access;
064a552c 7331 tree enclosing_decl_type;
4dbf4496 7332
cf1748bf 7333 /* We don't issue an error message when CL is null. CL can be null
4dbf4496
APB		 7334 as a result of processing a JDEP crafted by source_start_java_method
7335 for the purpose of patching its parm decl. But the error would
7336 have been already trapped when fixing the method's signature.
7337 DECL can also be NULL in case of earlier errors. */
7338 if (!decl || !cl)
cf1748bf
APB		 7339 return;
7340
064a552c 7341 enclosing_decl_type = TREE_TYPE (enclosing_decl);
a648f4e4 7342
4dbf4496 7343 if (CLASS_PRIVATE (decl))
a648f4e4
BM		 7344 {
7345 /* Access is permitted only within the body of the top-level
7346 class in which DECL is declared. */
7347 tree top_level = decl;
7348 while (DECL_CONTEXT (top_level))
e35b68b0 7349 top_level = DECL_CONTEXT (top_level);
a648f4e4
BM		 7350 while (DECL_CONTEXT (enclosing_decl))
7351 enclosing_decl = DECL_CONTEXT (enclosing_decl);
7352 if (top_level == enclosing_decl)
e35b68b0 7353 return;
a648f4e4
BM		 7354 access = "private";
7355 }
7356 else if (CLASS_PROTECTED (decl))
7357 {
7358 tree decl_context;
7359 /* Access is permitted from within the same package... */
7360 if (in_same_package (decl, enclosing_decl))
7361 return;
e35b68b0 7362
a648f4e4
BM		 7363 /* ... or from within the body of a subtype of the context in which
7364 DECL is declared. */
7365 decl_context = DECL_CONTEXT (decl);
7366 while (enclosing_decl)
7367 {
7368 if (CLASS_INTERFACE (decl))
7369 {
e35b68b0 7370 if (interface_of_p (TREE_TYPE (decl_context),
a648f4e4
BM		 7371 enclosing_decl_type))
7372 return;
7373 }
7374 else
7375 {
7376 /* Eww. The order of the arguments is different!! */
e35b68b0 7377 if (inherits_from_p (enclosing_decl_type,
a648f4e4
BM		 7378 TREE_TYPE (decl_context)))
7379 return;
7380 }
7381 enclosing_decl = DECL_CONTEXT (enclosing_decl);
e35b68b0 7382 }
a648f4e4
BM		 7383 access = "protected";
7384 }
7385 else if (! CLASS_PUBLIC (decl))
7386 {
7387 /* Access is permitted only from within the same package as DECL. */
7388 if (in_same_package (decl, enclosing_decl))
7389 return;
7390 access = "non-public";
7391 }
7392 else
7393 /* Class is public. */
4dbf4496
APB		 7394 return;
7395
a648f4e4 7396 parse_error_context (cl, "Nested %s %s is %s; cannot be accessed from here",
cf1748bf 7397 (CLASS_INTERFACE (decl) ? "interface" : "class"),
1b9deeb4 7398 lang_printable_name (decl, 2), access);
cf1748bf
APB		 7399}
7400
98f705b9
APB		 7401/* Accessibility check for top-level classes. If CLASS_NAME is in a
7402 foreign package, it must be PUBLIC. Return 0 if no access
7403 violations were found, 1 otherwise. If VERBOSE is true and an error
7cef5027
AP		 7404 was found, it is reported and accounted for. If CL is NULL then
7405 look it up with THIS_DECL. */
e04a16fb
AG		 7406
7407static int
7cef5027 7408check_pkg_class_access (tree class_name, tree cl, bool verbose, tree this_decl)
e04a16fb
AG		 7409{
7410 tree type;
e04a16fb 7411
a648f4e4 7412 if (!IDENTIFIER_CLASS_VALUE (class_name))
e04a16fb
AG		 7413 return 0;
7414
7415 if (!(type = TREE_TYPE (IDENTIFIER_CLASS_VALUE (class_name))))
7416 return 0;
7417
7418 if (!CLASS_PUBLIC (TYPE_NAME (type)))
7419 {
e28cd97b
APB		 7420 /* Access to a private class within the same package is
7421 allowed. */
7422 tree l, r;
9c5fdae6 7423 split_qualified_name (&l, &r, class_name);
a648f4e4
BM		 7424 if (!QUALIFIED_P (class_name) && !ctxp->package)
7425 /* Both in the empty package. */
7426 return 0;
e28cd97b 7427 if (l == ctxp->package)
a648f4e4 7428 /* Both in the same package. */
e28cd97b
APB		 7429 return 0;
7430
98f705b9 7431 if (verbose)
e35b68b0 7432 parse_error_context
7cef5027
AP		 7433 (cl == NULL ? lookup_cl (this_decl): cl,
7434 "Can't access %s `%s'. Only public classes and interfaces in other packages can be accessed",
98f705b9
APB		 7435 (CLASS_INTERFACE (TYPE_NAME (type)) ? "interface" : "class"),
7436 IDENTIFIER_POINTER (class_name));
e04a16fb
AG		 7437 return 1;
7438 }
7439 return 0;
7440}
7441
7442/* Local variable declaration. */
7443
7444static void
0a2f0c54 7445declare_local_variables (int modifier, tree type, tree vlist)
e04a16fb 7446{
c583dd46
APB		 7447 tree decl, current, saved_type;
7448 tree type_wfl = NULL_TREE;
e04a16fb 7449 int must_chain = 0;
c2952b01 7450 int final_p = 0;
e04a16fb 7451
2aa11e97 7452 /* Push a new block if statements were seen between the last time we
b16e8f08 7453 pushed a block and now. Keep a count of blocks to close */
f099f336 7454 if (BLOCK_EXPR_BODY (GET_CURRENT_BLOCK (current_function_decl)))
e04a16fb 7455 {
e04a16fb 7456 tree b = enter_block ();
b16e8f08 7457 BLOCK_IS_IMPLICIT (b) = 1;
e04a16fb
AG		 7458 }
7459
7460 if (modifier)
7461 {
33780b45
KG		 7462 size_t i;
7463 for (i = 0; i < ARRAY_SIZE (ctxp->modifier_ctx); i++)
7464 if (1 << i & modifier)
7465 break;
c877974e 7466 if (modifier == ACC_FINAL)
c2952b01 7467 final_p = 1;
e35b68b0 7468 else
c877974e 7469 {
e35b68b0
AD		 7470 parse_error_context
7471 (ctxp->modifier_ctx [i],
c877974e
APB		 7472 "Only `final' is allowed as a local variables modifier");
7473 return;
7474 }
e04a16fb
AG		 7475 }
7476
c583dd46
APB		 7477 /* Obtain an incomplete type if TYPE is not complete. TYPE_WFL will
7478 hold the TYPE value if a new incomplete has to be created (as
7479 opposed to being found already existing and reused). */
7480 SET_TYPE_FOR_RESOLUTION (type, type_wfl, must_chain);
7481
7482 /* If TYPE is fully resolved and we don't have a reference, make one */
1886c9d8 7483 PROMOTE_RECORD_IF_COMPLETE (type, must_chain);
c583dd46
APB		 7484
7485 /* Go through all the declared variables */
7486 for (current = vlist, saved_type = type; current;
7487 current = TREE_CHAIN (current), type = saved_type)
e04a16fb 7488 {
c877974e 7489 tree other, real_type;
e04a16fb
AG		 7490 tree wfl = TREE_PURPOSE (current);
7491 tree name = EXPR_WFL_NODE (wfl);
7492 tree init = TREE_VALUE (current);
e04a16fb 7493
c583dd46
APB		 7494 /* Process NAME, as it may specify extra dimension(s) for it */
7495 type = build_array_from_name (type, type_wfl, name, &name);
7496
7497 /* Variable redefinition check */
7498 if ((other = lookup_name_in_blocks (name)))
7499 {
7500 variable_redefinition_error (wfl, name, TREE_TYPE (other),
f31686a3 7501 DECL_SOURCE_LINE (other));
c583dd46
APB		 7502 continue;
7503 }
7504
7505 /* Type adjustment. We may have just readjusted TYPE because
7506 the variable specified more dimensions. Make sure we have
7507 a reference if we can and don't have one already. */
1886c9d8 7508 PROMOTE_RECORD_IF_COMPLETE (type, must_chain);
c877974e
APB		 7509
7510 real_type = GET_REAL_TYPE (type);
c583dd46
APB		 7511 /* Never layout this decl. This will be done when its scope
7512 will be entered */
c877974e 7513 decl = build_decl (VAR_DECL, name, real_type);
c7303e41 7514 MAYBE_CREATE_VAR_LANG_DECL_SPECIFIC (decl);
4f88ccda 7515 DECL_FINAL (decl) = final_p;
c583dd46 7516 BLOCK_CHAIN_DECL (decl);
e35b68b0 7517
d4370213
APB		 7518 /* If doing xreferencing, replace the line number with the WFL
7519 compound value */
9ec819d4
PB		 7520#ifdef USE_MAPPED_LOCATION
7521 if (flag_emit_xref)
7522 DECL_SOURCE_LOCATION (decl) = EXPR_LOCATION (wfl);
7523#else
d4370213 7524 if (flag_emit_xref)
f31686a3 7525 DECL_SOURCE_LINE (decl) = EXPR_WFL_LINECOL (wfl);
9ec819d4 7526#endif
e35b68b0 7527
e04a16fb
AG		 7528 /* Don't try to use an INIT statement when an error was found */
7529 if (init && java_error_count)
7530 init = NULL_TREE;
e35b68b0 7531
edf74484
RM		 7532 /* Remember it if this is an initialized-upon-declaration final
7533 variable. */
7534 if (init && final_p)
7535 {
7536 DECL_LOCAL_FINAL_IUD (decl) = 1;
7537 }
7538
c583dd46
APB		 7539 /* Add the initialization function to the current function's code */
7540 if (init)
e04a16fb 7541 {
c583dd46
APB		 7542 /* Name might have been readjusted */
7543 EXPR_WFL_NODE (TREE_OPERAND (init, 0)) = name;
7544 MODIFY_EXPR_FROM_INITIALIZATION_P (init) = 1;
7545 java_method_add_stmt (current_function_decl,
7546 build_debugable_stmt (EXPR_WFL_LINECOL (init),
7547 init));
7548 }
e35b68b0 7549
c583dd46
APB		 7550 /* Setup dependency the type of the decl */
7551 if (must_chain)
7552 {
7553 jdep *dep;
7554 register_incomplete_type (JDEP_VARIABLE, type_wfl, decl, type);
7555 dep = CLASSD_LAST (ctxp->classd_list);
7556 JDEP_GET_PATCH (dep) = &TREE_TYPE (decl);
e04a16fb
AG		 7557 }
7558 }
7559 SOURCE_FRONTEND_DEBUG (("Defined locals"));
7560}
7561
7562/* Called during parsing. Build decls from argument list. */
7563
7564static void
0a2f0c54 7565source_start_java_method (tree fndecl)
e04a16fb
AG		 7566{
7567 tree tem;
7568 tree parm_decl;
7569 int i;
7570
79d13333
APB		 7571 if (!fndecl)
7572 return;
7573
e04a16fb
AG		 7574 current_function_decl = fndecl;
7575
7576 /* New scope for the function */
7577 enter_block ();
7578 for (tem = TYPE_ARG_TYPES (TREE_TYPE (fndecl)), i = 0;
de4c7b02 7579 tem != end_params_node; tem = TREE_CHAIN (tem), i++)
e04a16fb
AG		 7580 {
7581 tree type = TREE_VALUE (tem);
7582 tree name = TREE_PURPOSE (tem);
e35b68b0 7583
23a79c61
APB		 7584 /* If type is incomplete. Create an incomplete decl and ask for
7585 the decl to be patched later */
e04a16fb
AG		 7586 if (INCOMPLETE_TYPE_P (type))
7587 {
7588 jdep *jdep;
c877974e
APB		 7589 tree real_type = GET_REAL_TYPE (type);
7590 parm_decl = build_decl (PARM_DECL, name, real_type);
23a79c61 7591 type = obtain_incomplete_type (type);
e04a16fb
AG		 7592 register_incomplete_type (JDEP_PARM, NULL_TREE, NULL_TREE, type);
7593 jdep = CLASSD_LAST (ctxp->classd_list);
7594 JDEP_MISC (jdep) = name;
7595 JDEP_GET_PATCH (jdep) = &TREE_TYPE (parm_decl);
7596 }
7597 else
7598 parm_decl = build_decl (PARM_DECL, name, type);
7599
c2952b01 7600 /* Remember if a local variable was declared final (via its
4f88ccda 7601 TREE_LIST of type/name.) Set DECL_FINAL accordingly. */
c2952b01 7602 if (ARG_FINAL_P (tem))
c7303e41
APB		 7603 {
7604 MAYBE_CREATE_VAR_LANG_DECL_SPECIFIC (parm_decl);
4f88ccda 7605 DECL_FINAL (parm_decl) = 1;
c7303e41 7606 }
c2952b01 7607
e04a16fb
AG		 7608 BLOCK_CHAIN_DECL (parm_decl);
7609 }
7610 tem = BLOCK_EXPR_DECLS (DECL_FUNCTION_BODY (current_function_decl));
7611 BLOCK_EXPR_DECLS (DECL_FUNCTION_BODY (current_function_decl)) =
7612 nreverse (tem);
7613 DECL_ARG_SLOT_COUNT (current_function_decl) = i;
c2952b01 7614 DECL_MAX_LOCALS (current_function_decl) = i;
e04a16fb
AG		 7615}
7616
22eed1e6
APB		 7617/* Called during parsing. Creates an artificial method declaration. */
7618
7619static tree
0a2f0c54
KG		 7620create_artificial_method (tree class, int flags, tree type,
7621 tree name, tree args)
22eed1e6 7622{
22eed1e6 7623 tree mdecl;
9ec819d4 7624 location_t save_location = input_location;
22eed1e6 7625
9ec819d4 7626 input_location = DECL_SOURCE_LOCATION (TYPE_NAME (class));
e35b68b0 7627 mdecl = make_node (FUNCTION_TYPE);
22eed1e6
APB		 7628 TREE_TYPE (mdecl) = type;
7629 TYPE_ARG_TYPES (mdecl) = args;
c1f042f8
TT		 7630 /* We used to compute the signature of MDECL here and then use
7631 add_method(), but that failed because our caller might modify
7632 the type of the returned method, which trashes the cache in
7633 get_type_from_signature(). */
7634 mdecl = add_method_1 (class, flags, name, mdecl);
9ec819d4 7635 input_location = save_location;
e35b68b0 7636 DECL_ARTIFICIAL (mdecl) = 1;
22eed1e6
APB		 7637 return mdecl;
7638}
7639
a83f01f0 7640/* Starts the body if an artificial method. */
22eed1e6
APB		 7641
7642static void
0a2f0c54 7643start_artificial_method_body (tree mdecl)
22eed1e6 7644{
9ec819d4
PB		 7645#ifdef USE_MAPPED_LOCATION
7646 DECL_SOURCE_LOCATION (mdecl) = ctxp->file_start_location;
7647 DECL_FUNCTION_LAST_LINE (mdecl) = ctxp->file_start_location;
7648#else
f31686a3 7649 DECL_SOURCE_LINE (mdecl) = 1;
36f04556 7650 DECL_FUNCTION_LAST_LINE (mdecl) = 1;
9ec819d4 7651#endif
22eed1e6
APB		 7652 source_start_java_method (mdecl);
7653 enter_block ();
7654}
7655
7656static void
0a2f0c54 7657end_artificial_method_body (tree mdecl)
22eed1e6 7658{
1e0cdc10
APB		 7659 /* exit_block modifies DECL_FUNCTION_BODY (current_function_decl).
7660 It has to be evaluated first. (if mdecl is current_function_decl,
7661 we have an undefined behavior if no temporary variable is used.) */
7662 tree b = exit_block ();
7663 BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (mdecl)) = b;
22eed1e6
APB		 7664 exit_block ();
7665}
7666
12cfb4fc
TT		 7667/* Dump a tree of some kind. This is a convenience wrapper for the
7668 dump_* functions in tree-dump.c. */
7669static void
0a2f0c54 7670dump_java_tree (enum tree_dump_index phase, tree t)
12cfb4fc
TT		 7671{
7672 FILE *stream;
7673 int flags;
7674
7675 stream = dump_begin (phase, &flags);
c1ddb5c8 7676 flags |= TDF_SLIM;
12cfb4fc
TT		 7677 if (stream)
7678 {
7679 dump_node (t, flags, stream);
7680 dump_end (phase, stream);
7681 }
7682}
7683
e04a16fb
AG		 7684/* Terminate a function and expand its body. */
7685
7686static void
0a2f0c54 7687source_end_java_method (void)
e04a16fb
AG		 7688{
7689 tree fndecl = current_function_decl;
7690
79d13333
APB		 7691 if (!fndecl)
7692 return;
7693
e04a16fb 7694 java_parser_context_save_global ();
9ec819d4
PB		 7695#ifdef USE_MAPPED_LOCATION
7696 input_location = ctxp->last_ccb_indent1;
7697#else
d479d37f 7698 input_line = ctxp->last_ccb_indent1;
9ec819d4 7699#endif
e04a16fb 7700
5423609c
APB		 7701 /* Turn function bodies with only a NOP expr null, so they don't get
7702 generated at all and we won't get warnings when using the -W
7703 -Wall flags. */
6de9cd9a 7704 if (IS_EMPTY_STMT (BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (fndecl))))
5423609c
APB		 7705 BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (fndecl)) = NULL_TREE;
7706
6de9cd9a
DN		 7707 if (BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (fndecl))
7708 && ! flag_emit_class_files
7709 && ! flag_emit_xref)
7710 finish_method (fndecl);
916b57ce 7711
9220b1ba 7712 current_function_decl = NULL_TREE;
e04a16fb 7713 java_parser_context_restore_global ();
6de9cd9a 7714 current_function_decl = NULL_TREE;
e04a16fb
AG		 7715}
7716
7717/* Record EXPR in the current function block. Complements compound
7718 expression second operand if necessary. */
7719
7720tree
0a2f0c54 7721java_method_add_stmt (tree fndecl, tree expr)
e04a16fb 7722{
b771925e
APB		 7723 if (!GET_CURRENT_BLOCK (fndecl))
7724 return NULL_TREE;
f099f336 7725 return add_stmt_to_block (GET_CURRENT_BLOCK (fndecl), NULL_TREE, expr);
b67d701b 7726}
e04a16fb 7727
b67d701b 7728static tree
0a2f0c54 7729add_stmt_to_block (tree b, tree type, tree stmt)
b67d701b
PB		 7730{
7731 tree body = BLOCK_EXPR_BODY (b), c;
e35b68b0 7732
e04a16fb
AG		 7733 if (java_error_count)
7734 return body;
e35b68b0 7735
b67d701b 7736 if ((c = add_stmt_to_compound (body, type, stmt)) == body)
e04a16fb
AG		 7737 return body;
7738
b67d701b
PB		 7739 BLOCK_EXPR_BODY (b) = c;
7740 TREE_SIDE_EFFECTS (c) = 1;
7741 return c;
e04a16fb
AG		 7742}
7743
cfb6b4b8
RM		 7744/* Lays out the methods for the classes seen so far. */
7745
7746void
7747java_layout_seen_class_methods (void)
1886c9d8
APB		 7748{
7749 tree previous_list = all_class_list;
7750 tree end = NULL_TREE;
7751 tree current;
7752
7753 while (1)
7754 {
e35b68b0 7755 for (current = previous_list;
1886c9d8 7756 current != end; current = TREE_CHAIN (current))
cfb6b4b8 7757 {
9ec819d4
PB		 7758 tree decl = TREE_VALUE (current);
7759 tree cls = TREE_TYPE (decl);
7760
7761 input_location = DECL_SOURCE_LOCATION (decl);
cfb6b4b8
RM		 7762
7763 if (! CLASS_LOADED_P (cls))
7764 load_class (cls, 0);
7765
7766 layout_class_methods (cls);
7767 }
7768
7769 /* Note that new classes might have been added while laying out
7770 methods, changing the value of all_class_list. */
e35b68b0 7771
1886c9d8
APB		 7772 if (previous_list != all_class_list)
7773 {
7774 end = previous_list;
7775 previous_list = all_class_list;
7776 }
7777 else
7778 break;
7779 }
7780}
7781
e2500fed 7782static GTY(()) tree stop_reordering;
e04a16fb 7783void
0a2f0c54 7784java_reorder_fields (void)
e04a16fb 7785{
c2952b01 7786 tree current;
19e223db 7787
fea2d5da 7788 for (current = gclass_list; current; current = TREE_CHAIN (current))
e04a16fb 7789 {
85194ee9 7790 output_class = current_class = TREE_TYPE (TREE_VALUE (current));
22eed1e6 7791
c2952b01
APB		 7792 if (current_class == stop_reordering)
7793 break;
7794
c877974e
APB		 7795 /* Reverse the fields, but leave the dummy field in front.
7796 Fields are already ordered for Object and Class */
7797 if (TYPE_FIELDS (current_class) && current_class != object_type_node
7798 && current_class != class_type_node)
7799 {
23a79c61
APB		 7800 /* If the dummy field is there, reverse the right fields and
7801 just layout the type for proper fields offset */
c877974e
APB		 7802 if (!DECL_NAME (TYPE_FIELDS (current_class)))
7803 {
7804 tree fields = TYPE_FIELDS (current_class);
7805 TREE_CHAIN (fields) = nreverse (TREE_CHAIN (fields));
7806 TYPE_SIZE (current_class) = NULL_TREE;
c877974e 7807 }
23a79c61
APB		 7808 /* We don't have a dummy field, we need to layout the class,
7809 after having reversed the fields */
c877974e
APB		 7810 else
7811 {
e35b68b0 7812 TYPE_FIELDS (current_class) =
c877974e
APB		 7813 nreverse (TYPE_FIELDS (current_class));
7814 TYPE_SIZE (current_class) = NULL_TREE;
c877974e
APB		 7815 }
7816 }
c2952b01 7817 }
9d7d8362
APB		 7818 /* There are cases were gclass_list will be empty. */
7819 if (gclass_list)
7820 stop_reordering = TREE_TYPE (TREE_VALUE (gclass_list));
c2952b01
APB		 7821}
7822
fea2d5da
PB		 7823/* Layout the methods of all classes loaded in one way or another.
7824 Check methods of source parsed classes. Then reorder the
c2952b01
APB		 7825 fields and layout the classes or the type of all source parsed
7826 classes */
7827
7828void
0a2f0c54 7829java_layout_classes (void)
c2952b01
APB		 7830{
7831 tree current;
7832 int save_error_count = java_error_count;
7833
7834 /* Layout the methods of all classes seen so far */
7835 java_layout_seen_class_methods ();
7836 java_parse_abort_on_error ();
7837 all_class_list = NULL_TREE;
7838
7839 /* Then check the methods of all parsed classes */
fea2d5da 7840 for (current = gclass_list; current; current = TREE_CHAIN (current))
c2952b01 7841 if (CLASS_FROM_SOURCE_P (TREE_TYPE (TREE_VALUE (current))))
34d4df06 7842 java_check_methods (TREE_VALUE (current));
c2952b01
APB		 7843 java_parse_abort_on_error ();
7844
fea2d5da 7845 for (current = gclass_list; current; current = TREE_CHAIN (current))
c2952b01 7846 {
85194ee9 7847 output_class = current_class = TREE_TYPE (TREE_VALUE (current));
c2952b01 7848 layout_class (current_class);
5e942c50
APB		 7849
7850 /* Error reported by the caller */
7851 if (java_error_count)
7852 return;
e04a16fb 7853 }
23a79c61
APB		 7854
7855 /* We might have reloaded classes durign the process of laying out
7856 classes for code generation. We must layout the methods of those
7857 late additions, as constructor checks might use them */
1886c9d8 7858 java_layout_seen_class_methods ();
23a79c61 7859 java_parse_abort_on_error ();
e04a16fb
AG		 7860}
7861
67264b4f 7862/* Expand methods in the current set of classes remembered for
c2952b01 7863 generation. */
e04a16fb 7864
49f48c71 7865static void
0a2f0c54 7866java_complete_expand_classes (void)
e04a16fb
AG		 7867{
7868 tree current;
ce6e9147
APB		 7869
7870 do_not_fold = flag_emit_xref;
c2952b01 7871
e04a16fb 7872 for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
c2952b01
APB		 7873 if (!INNER_CLASS_DECL_P (current))
7874 java_complete_expand_class (current);
7875}
e04a16fb 7876
c2952b01
APB		 7877/* Expand the methods found in OUTER, starting first by OUTER's inner
7878 classes, if any. */
e04a16fb 7879
c2952b01 7880static void
0a2f0c54 7881java_complete_expand_class (tree outer)
c2952b01
APB		 7882{
7883 tree inner_list;
e04a16fb 7884
c2952b01
APB		 7885 /* We need to go after all inner classes and start expanding them,
7886 starting with most nested ones. We have to do that because nested
7887 classes might add functions to outer classes */
e04a16fb 7888
c2952b01
APB		 7889 for (inner_list = DECL_INNER_CLASS_LIST (outer);
7890 inner_list; inner_list = TREE_CHAIN (inner_list))
7891 java_complete_expand_class (TREE_PURPOSE (inner_list));
22eed1e6 7892
c2952b01 7893 java_complete_expand_methods (outer);
c2952b01
APB		 7894}
7895
7896/* Expand methods registered in CLASS_DECL. The general idea is that
7897 we expand regular methods first. This allows us get an estimate on
7898 how outer context local alias fields are really used so we can add
7899 to the constructor just enough code to initialize them properly (it
c00f0fb2 7900 also lets us generate finit$ correctly.) Then we expand the
c2952b01
APB		 7901 constructors and then <clinit>. */
7902
7903static void
0a2f0c54 7904java_complete_expand_methods (tree class_decl)
c2952b01 7905{
17126208 7906 tree clinit, decl, first_decl;
c2952b01 7907
85194ee9 7908 output_class = current_class = TREE_TYPE (class_decl);
c2952b01 7909
c2952b01
APB		 7910 /* Pre-expand <clinit> to figure whether we really need it or
7911 not. If we do need it, we pre-expand the static fields so they're
7912 ready to be used somewhere else. <clinit> will be fully expanded
7913 after we processed the constructors. */
7914 first_decl = TYPE_METHODS (current_class);
7915 clinit = maybe_generate_pre_expand_clinit (current_class);
7916
17126208 7917 /* Then generate finit$ (if we need to) because constructors will
c2952b01
APB		 7918 try to use it.*/
7919 if (TYPE_FINIT_STMT_LIST (current_class))
17126208
APB		 7920 java_complete_expand_method (generate_finit (current_class));
7921
7922 /* Then generate instinit$ (if we need to) because constructors will
7923 try to use it. */
7924 if (TYPE_II_STMT_LIST (current_class))
7925 java_complete_expand_method (generate_instinit (current_class));
c2952b01
APB		 7926
7927 /* Now do the constructors */
7928 for (decl = first_decl ; !java_error_count && decl; decl = TREE_CHAIN (decl))
7929 {
c2952b01
APB		 7930 if (!DECL_CONSTRUCTOR_P (decl))
7931 continue;
c2952b01 7932 java_complete_expand_method (decl);
c2952b01
APB		 7933 }
7934
7935 /* First, do the ordinary methods. */
7936 for (decl = first_decl; decl; decl = TREE_CHAIN (decl))
7937 {
4009bb7d
APB		 7938 /* Ctors aren't part of this batch. */
7939 if (DECL_CONSTRUCTOR_P (decl) || DECL_CLINIT_P (decl))
7940 continue;
e35b68b0 7941
7145d9fe
TT		 7942 /* Skip abstract or native methods -- but do handle native
7943 methods when generating JNI stubs. */
4009bb7d
APB		 7944 if (METHOD_ABSTRACT (decl) || (! flag_jni && METHOD_NATIVE (decl)))
7945 {
7946 DECL_FUNCTION_BODY (decl) = NULL_TREE;
7947 continue;
7948 }
7145d9fe
TT		 7949
7950 if (METHOD_NATIVE (decl))
7951 {
adc8cb5d
TT		 7952 tree body;
7953 current_function_decl = decl;
7954 body = build_jni_stub (decl);
7145d9fe
TT		 7955 BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (decl)) = body;
7956 }
7957
c2952b01
APB		 7958 java_complete_expand_method (decl);
7959 }
7960
7961 /* If there is indeed a <clinit>, fully expand it now */
7962 if (clinit)
7963 {
7964 /* Prevent the use of `this' inside <clinit> */
7965 ctxp->explicit_constructor_p = 1;
7966 java_complete_expand_method (clinit);
7967 ctxp->explicit_constructor_p = 0;
e04a16fb 7968 }
e35b68b0 7969
165f37bc
APB		 7970 /* We might have generated a class$ that we now want to expand */
7971 if (TYPE_DOT_CLASS (current_class))
7972 java_complete_expand_method (TYPE_DOT_CLASS (current_class));
7973
c2952b01
APB		 7974 /* Now verify constructor circularity (stop after the first one we
7975 prove wrong.) */
7976 if (!CLASS_INTERFACE (class_decl))
7977 for (decl = TYPE_METHODS (current_class); decl; decl = TREE_CHAIN (decl))
e35b68b0 7978 if (DECL_CONSTRUCTOR_P (decl)
c2952b01
APB		 7979 && verify_constructor_circularity (decl, decl))
7980 break;
e04a16fb
AG		 7981}
7982
c2952b01
APB		 7983/* Attempt to create <clinit>. Pre-expand static fields so they can be
7984 safely used in some other methods/constructors. */
e920ebc9 7985
c2952b01 7986static tree
0a2f0c54 7987maybe_generate_pre_expand_clinit (tree class_type)
e920ebc9 7988{
c2952b01
APB		 7989 tree current, mdecl;
7990
7991 if (!TYPE_CLINIT_STMT_LIST (class_type))
7992 return NULL_TREE;
e920ebc9 7993
c2952b01 7994 /* Go through all static fields and pre expand them */
e35b68b0 7995 for (current = TYPE_FIELDS (class_type); current;
c2952b01
APB		 7996 current = TREE_CHAIN (current))
7997 if (FIELD_STATIC (current))
7998 build_field_ref (NULL_TREE, class_type, DECL_NAME (current));
7999
8000 /* Then build the <clinit> method */
8001 mdecl = create_artificial_method (class_type, ACC_STATIC, void_type_node,
8002 clinit_identifier_node, end_params_node);
8003 layout_class_method (class_type, CLASSTYPE_SUPER (class_type),
8004 mdecl, NULL_TREE);
8005 start_artificial_method_body (mdecl);
8006
8007 /* We process the list of assignment we produced as the result of
8008 the declaration of initialized static field and add them as
8009 statement to the <clinit> method. */
8010 for (current = TYPE_CLINIT_STMT_LIST (class_type); current;
8011 current = TREE_CHAIN (current))
e920ebc9 8012 {
9a7ab4b3 8013 tree stmt = current;
c2952b01
APB		 8014 /* We build the assignment expression that will initialize the
8015 field to its value. There are strict rules on static
8016 initializers (8.5). FIXME */
6de9cd9a 8017 if (TREE_CODE (stmt) != BLOCK && !IS_EMPTY_STMT (stmt))
9a7ab4b3 8018 stmt = build_debugable_stmt (EXPR_WFL_LINECOL (stmt), stmt);
c2952b01
APB		 8019 java_method_add_stmt (mdecl, stmt);
8020 }
e920ebc9 8021
c2952b01
APB		 8022 end_artificial_method_body (mdecl);
8023
92d83515
APB		 8024 /* Now we want to place <clinit> as the last method (because we need
8025 it at least for interface so that it doesn't interfere with the
8026 dispatch table based lookup. */
8027 if (TREE_CHAIN (TYPE_METHODS (class_type)))
c2952b01 8028 {
92d83515
APB		 8029 current = TREE_CHAIN (TYPE_METHODS (class_type));
8030 TYPE_METHODS (class_type) = current;
c2952b01
APB		 8031
8032 while (TREE_CHAIN (current))
8033 current = TREE_CHAIN (current);
92d83515 8034
c2952b01
APB		 8035 TREE_CHAIN (current) = mdecl;
8036 TREE_CHAIN (mdecl) = NULL_TREE;
e920ebc9 8037 }
c2952b01
APB		 8038
8039 return mdecl;
e920ebc9
APB		 8040}
8041
dba41d30 8042/* Analyzes a method body and look for something that isn't a
2d9fea5d 8043 MODIFY_EXPR with a constant value. */
dba41d30
APB		 8044
8045static int
0a2f0c54 8046analyze_clinit_body (tree this_class, tree bbody)
dba41d30
APB		 8047{
8048 while (bbody)
8049 switch (TREE_CODE (bbody))
8050 {
8051 case BLOCK:
8052 bbody = BLOCK_EXPR_BODY (bbody);
8053 break;
e35b68b0 8054
dba41d30
APB		 8055 case EXPR_WITH_FILE_LOCATION:
8056 bbody = EXPR_WFL_NODE (bbody);
8057 break;
e35b68b0 8058
dba41d30 8059 case COMPOUND_EXPR:
f2af50db 8060 if (analyze_clinit_body (this_class, TREE_OPERAND (bbody, 0)))
dba41d30
APB		 8061 return 1;
8062 bbody = TREE_OPERAND (bbody, 1);
8063 break;
e35b68b0 8064
dba41d30 8065 case MODIFY_EXPR:
731866ba
APB		 8066 /* If we're generating to class file and we're dealing with an
8067 array initialization, we return 1 to keep <clinit> */
8068 if (TREE_CODE (TREE_OPERAND (bbody, 1)) == NEW_ARRAY_INIT
8069 && flag_emit_class_files)
8070 return 1;
f2af50db
TT		 8071
8072 /* There are a few cases where we're required to keep
8073 <clinit>:
8074 - If this is an assignment whose operand is not constant,
8075 - If this is an assignment to a non-initialized field,
8076 - If this field is not a member of the current class.
8077 */
8078 return (! TREE_CONSTANT (TREE_OPERAND (bbody, 1))
8079 || ! DECL_INITIAL (TREE_OPERAND (bbody, 0))
8080 || DECL_CONTEXT (TREE_OPERAND (bbody, 0)) != this_class);
dba41d30
APB		 8081
8082 default:
dba41d30
APB		 8083 return 1;
8084 }
8085 return 0;
8086}
8087
8088
92d83515
APB		 8089/* See whether we could get rid of <clinit>. Criteria are: all static
8090 final fields have constant initial values and the body of <clinit>
8091 is empty. Return 1 if <clinit> was discarded, 0 otherwise. */
8092
8093static int
0a2f0c54 8094maybe_yank_clinit (tree mdecl)
92d83515
APB		 8095{
8096 tree type, current;
8097 tree fbody, bbody;
e35b68b0 8098
92d83515
APB		 8099 if (!DECL_CLINIT_P (mdecl))
8100 return 0;
f0f3a777
APB		 8101
8102 /* If the body isn't empty, then we keep <clinit>. Note that if
8103 we're emitting classfiles, this isn't enough not to rule it
8104 out. */
92d83515 8105 fbody = DECL_FUNCTION_BODY (mdecl);
dba41d30
APB		 8106 bbody = BLOCK_EXPR_BODY (fbody);
8107 if (bbody && bbody != error_mark_node)
92d83515 8108 bbody = BLOCK_EXPR_BODY (bbody);
dba41d30
APB		 8109 else
8110 return 0;
6de9cd9a 8111 if (bbody && ! flag_emit_class_files && !IS_EMPTY_STMT (bbody))
92d83515 8112 return 0;
f2af50db 8113
92d83515
APB		 8114 type = DECL_CONTEXT (mdecl);
8115 current = TYPE_FIELDS (type);
8116
e35b68b0 8117 for (current = (current ? TREE_CHAIN (current) : current);
92d83515 8118 current; current = TREE_CHAIN (current))
f0f3a777
APB		 8119 {
8120 tree f_init;
8121
f2af50db 8122 /* We're not interested in non-static fields. */
f0f3a777
APB		 8123 if (!FIELD_STATIC (current))
8124 continue;
8125
f2af50db 8126 /* Nor in fields without initializers. */
0286a91d 8127 f_init = DECL_INITIAL (current);
0286a91d
PB		 8128 if (f_init == NULL_TREE)
8129 continue;
8130
f0f3a777 8131 /* Anything that isn't String or a basic type is ruled out -- or
c7303e41 8132 if we know how to deal with it (when doing things natively) we
f0f3a777
APB		 8133 should generated an empty <clinit> so that SUID are computed
8134 correctly. */
8135 if (! JSTRING_TYPE_P (TREE_TYPE (current))
8136 && ! JNUMERIC_TYPE_P (TREE_TYPE (current)))
f2af50db 8137 return 0;
0286a91d
PB		 8138
8139 if (! FIELD_FINAL (current) || ! TREE_CONSTANT (f_init))
f2af50db 8140 return 0;
f0f3a777 8141 }
92d83515 8142
99eaf8d4
APB		 8143 /* Now we analyze the method body and look for something that
8144 isn't a MODIFY_EXPR */
6de9cd9a 8145 if (!IS_EMPTY_STMT (bbody) && analyze_clinit_body (type, bbody))
92d83515
APB		 8146 return 0;
8147
8148 /* Get rid of <clinit> in the class' list of methods */
8149 if (TYPE_METHODS (type) == mdecl)
8150 TYPE_METHODS (type) = TREE_CHAIN (mdecl);
8151 else
e35b68b0 8152 for (current = TYPE_METHODS (type); current;
92d83515
APB		 8153 current = TREE_CHAIN (current))
8154 if (TREE_CHAIN (current) == mdecl)
8155 {
8156 TREE_CHAIN (current) = TREE_CHAIN (mdecl);
8157 break;
8158 }
8159
8160 return 1;
8161}
8162
4009bb7d
APB		 8163/* Install the argument from MDECL. Suitable to completion and
8164 expansion of mdecl's body. */
8165
916b57ce 8166void
0a2f0c54 8167start_complete_expand_method (tree mdecl)
4009bb7d 8168{
98f705b9 8169 tree tem;
4009bb7d
APB		 8170
8171 pushlevel (1); /* Prepare for a parameter push */
98f705b9
APB		 8172 tem = BLOCK_EXPR_DECLS (DECL_FUNCTION_BODY (current_function_decl));
8173 DECL_ARGUMENTS (mdecl) = tem;
4009bb7d 8174
98f705b9 8175 for (; tem; tem = TREE_CHAIN (tem))
4009bb7d 8176 {
e35b68b0 8177 /* TREE_CHAIN (tem) will change after pushdecl. */
4009bb7d
APB		 8178 tree next = TREE_CHAIN (tem);
8179 tree type = TREE_TYPE (tem);
136e64db 8180 if (targetm.calls.promote_prototypes (type)
4009bb7d
APB		 8181 && TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node)
8182 && INTEGRAL_TYPE_P (type))
8183 type = integer_type_node;
8184 DECL_ARG_TYPE (tem) = type;
8185 layout_decl (tem, 0);
8186 pushdecl (tem);
98f705b9
APB		 8187 /* Re-install the next so that the list is kept and the loop
8188 advances. */
8189 TREE_CHAIN (tem) = next;
4009bb7d 8190 }
4009bb7d 8191 pushdecl_force_head (DECL_ARGUMENTS (mdecl));
9ec819d4 8192 input_location = DECL_SOURCE_LOCATION (mdecl);
4009bb7d
APB		 8193 build_result_decl (mdecl);
8194}
8195
92d83515 8196
e04a16fb
AG		 8197/* Complete and expand a method. */
8198
8199static void
0a2f0c54 8200java_complete_expand_method (tree mdecl)
e04a16fb 8201{
4009bb7d 8202 tree fbody, block_body, exception_copy;
92d83515 8203
c2952b01 8204 current_function_decl = mdecl;
22eed1e6
APB		 8205 /* Fix constructors before expanding them */
8206 if (DECL_CONSTRUCTOR_P (mdecl))
8207 fix_constructors (mdecl);
e35b68b0 8208
22eed1e6 8209 /* Expand functions that have a body */
4009bb7d
APB		 8210 if (!DECL_FUNCTION_BODY (mdecl))
8211 return;
b9f7e36c 8212
4009bb7d
APB		 8213 fbody = DECL_FUNCTION_BODY (mdecl);
8214 block_body = BLOCK_EXPR_BODY (fbody);
8215 exception_copy = NULL_TREE;
c2952b01 8216
4009bb7d 8217 current_function_decl = mdecl;
e803d3b2 8218
4009bb7d
APB		 8219 if (! quiet_flag)
8220 fprintf (stderr, " [%s.",
8221 lang_printable_name (DECL_CONTEXT (mdecl), 0));
8222 announce_function (mdecl);
8223 if (! quiet_flag)
8224 fprintf (stderr, "]");
e35b68b0 8225
4009bb7d
APB		 8226 /* Prepare the function for tree completion */
8227 start_complete_expand_method (mdecl);
5e942c50 8228
4009bb7d 8229 /* Install the current this */
e35b68b0 8230 current_this = (!METHOD_STATIC (mdecl) ?
4009bb7d 8231 BLOCK_EXPR_DECLS (DECL_FUNCTION_BODY (mdecl)) : NULL_TREE);
7525cc04 8232
496849ba
APB		 8233 /* Purge the `throws' list of unchecked exceptions (we save a copy
8234 of the list and re-install it later.) */
8235 exception_copy = copy_list (DECL_FUNCTION_THROWS (mdecl));
4009bb7d 8236 purge_unchecked_exceptions (mdecl);
e35b68b0 8237
4009bb7d
APB		 8238 /* Install exceptions thrown with `throws' */
8239 PUSH_EXCEPTIONS (DECL_FUNCTION_THROWS (mdecl));
e35b68b0 8240
4009bb7d
APB		 8241 if (block_body != NULL_TREE)
8242 {
8243 block_body = java_complete_tree (block_body);
e35b68b0 8244
4009bb7d
APB		 8245 /* Before we check initialization, attached all class initialization
8246 variable to the block_body */
e2500fed 8247 htab_traverse (DECL_FUNCTION_INIT_TEST_TABLE (mdecl),
4009bb7d 8248 attach_init_test_initialization_flags, block_body);
e35b68b0 8249
4009bb7d 8250 if (! flag_emit_xref && ! METHOD_NATIVE (mdecl))
22eed1e6 8251 {
4f88ccda 8252 check_for_initialization (block_body, mdecl);
e35b68b0 8253
4009bb7d
APB		 8254 /* Go through all the flags marking the initialization of
8255 static variables and see whether they're definitively
8256 assigned, in which case the type is remembered as
8257 definitively initialized in MDECL. */
8258 if (STATIC_CLASS_INIT_OPT_P ())
8259 {
5412ef6b 8260 /* Always register the context as properly initialized in
4009bb7d 8261 MDECL. This used with caution helps removing extra
5412ef6b 8262 initialization of self. */
4009bb7d 8263 if (METHOD_STATIC (mdecl))
e2500fed 8264 {
e35b68b0 8265 *(htab_find_slot
e2500fed
GK		 8266 (DECL_FUNCTION_INITIALIZED_CLASS_TABLE (mdecl),
8267 DECL_CONTEXT (mdecl), INSERT)) = DECL_CONTEXT (mdecl);
8268 }
4009bb7d 8269 }
22eed1e6 8270 }
4009bb7d
APB		 8271 ctxp->explicit_constructor_p = 0;
8272 }
e35b68b0 8273
4009bb7d 8274 BLOCK_EXPR_BODY (fbody) = block_body;
e35b68b0 8275
4009bb7d
APB		 8276 /* If we saw a return but couldn't evaluate it properly, we'll have
8277 an error_mark_node here. */
8278 if (block_body != error_mark_node
8279 && (block_body == NULL_TREE || CAN_COMPLETE_NORMALLY (block_body))
8280 && TREE_CODE (TREE_TYPE (TREE_TYPE (mdecl))) != VOID_TYPE
8281 && !flag_emit_xref)
8282 missing_return_error (current_function_decl);
b9f7e36c 8283
4009bb7d
APB		 8284 /* See if we can get rid of <clinit> if MDECL happens to be <clinit> */
8285 maybe_yank_clinit (mdecl);
ce6e9147 8286
4009bb7d
APB		 8287 /* Pop the current level, with special measures if we found errors. */
8288 if (java_error_count)
8289 pushdecl_force_head (DECL_ARGUMENTS (mdecl));
8290 poplevel (1, 0, 1);
8291
8292 /* Pop the exceptions and sanity check */
8293 POP_EXCEPTIONS();
8294 if (currently_caught_type_list)
8295 abort ();
8296
8297 /* Restore the copy of the list of exceptions if emitting xrefs. */
496849ba 8298 DECL_FUNCTION_THROWS (mdecl) = exception_copy;
4009bb7d
APB		 8299}
8300
8301/* For with each class for which there's code to generate. */
8302
8303static void
0a2f0c54 8304java_expand_method_bodies (tree class)
4009bb7d
APB		 8305{
8306 tree decl;
8307 for (decl = TYPE_METHODS (class); decl; decl = TREE_CHAIN (decl))
8308 {
916b57ce 8309 tree block;
916b57ce
JS		 8310
8311 if (! DECL_FUNCTION_BODY (decl))
4009bb7d
APB		 8312 continue;
8313
8314 current_function_decl = decl;
8315
916b57ce
JS		 8316 block = BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (decl));
8317
6de9cd9a 8318 /* Save the function body for gimplify and inlining. */
916b57ce
JS		 8319 DECL_SAVED_TREE (decl) = block;
8320
4009bb7d
APB		 8321 /* It's time to assign the variable flagging static class
8322 initialization based on which classes invoked static methods
8323 are definitely initializing. This should be flagged. */
8324 if (STATIC_CLASS_INIT_OPT_P ())
5412ef6b
PB		 8325 {
8326 tree list = DECL_FUNCTION_STATIC_METHOD_INVOCATION_COMPOUND (decl);
8327 for (; list != NULL_TREE; list = TREE_CHAIN (list))
8328 {
8329 /* Executed for each statement calling a static function.
8330 LIST is a TREE_LIST whose PURPOSE is the called function
8331 and VALUE is a compound whose second operand can be patched
8332 with static class initialization flag assignments. */
8333
8334 tree called_method = TREE_PURPOSE (list);
8335 tree compound = TREE_VALUE (list);
8336 tree assignment_compound_list
8337 = build_tree_list (called_method, NULL);
8338
8339 /* For each class definitely initialized in
8340 CALLED_METHOD, fill ASSIGNMENT_COMPOUND with
8341 assignment to the class initialization flag. */
e2500fed 8342 htab_traverse (DECL_FUNCTION_INITIALIZED_CLASS_TABLE (called_method),
5412ef6b
PB		 8343 emit_test_initialization,
8344 assignment_compound_list);
8345
8346 if (TREE_VALUE (assignment_compound_list))
8347 TREE_OPERAND (compound, 1)
8348 = TREE_VALUE (assignment_compound_list);
8349 }
8350 }
4009bb7d 8351
6de9cd9a 8352 /* Expand the function body. */
4009bb7d 8353 source_end_java_method ();
e04a16fb
AG		 8354 }
8355}
8356
c2952b01
APB		 8357\f
8358
8359/* This section of the code deals with accessing enclosing context
8360 fields either directly by using the relevant access to this$<n> or
8361 by invoking an access method crafted for that purpose. */
8362
8363/* Build the necessary access from an inner class to an outer
8364 class. This routine could be optimized to cache previous result
8365 (decl, current_class and returned access). When an access method
8366 needs to be generated, it always takes the form of a read. It might
8367 be later turned into a write by calling outer_field_access_fix. */
8368
8369static tree
0a2f0c54 8370build_outer_field_access (tree id, tree decl)
c2952b01
APB		 8371{
8372 tree access = NULL_TREE;
8373 tree ctx = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (current_class)));
5e18f6d6 8374 tree decl_ctx = DECL_CONTEXT (decl);
c2952b01 8375
5e18f6d6
APB		 8376 /* If the immediate enclosing context of the current class is the
8377 field decl's class or inherits from it; build the access as
8378 `this$<n>.<field>'. Note that we will break the `private' barrier
8379 if we're not emitting bytecodes. */
8380 if ((ctx == decl_ctx || inherits_from_p (ctx, decl_ctx))
c2952b01
APB		 8381 && (!FIELD_PRIVATE (decl) || !flag_emit_class_files ))
8382 {
8383 tree thisn = build_current_thisn (current_class);
e35b68b0 8384 access = make_qualified_primary (build_wfl_node (thisn),
c2952b01
APB		 8385 id, EXPR_WFL_LINECOL (id));
8386 }
8387 /* Otherwise, generate access methods to outer this and access the
8388 field (either using an access method or by direct access.) */
8389 else
8390 {
8391 int lc = EXPR_WFL_LINECOL (id);
8392
8393 /* Now we chain the required number of calls to the access$0 to
f0f3a777 8394 get a hold to the enclosing instance we need, and then we
c2952b01 8395 build the field access. */
5e18f6d6 8396 access = build_access_to_thisn (current_class, decl_ctx, lc);
c2952b01
APB		 8397
8398 /* If the field is private and we're generating bytecode, then
8399 we generate an access method */
8400 if (FIELD_PRIVATE (decl) && flag_emit_class_files )
8401 {
8402 tree name = build_outer_field_access_methods (decl);
5e18f6d6 8403 access = build_outer_field_access_expr (lc, decl_ctx,
c2952b01
APB		 8404 name, access, NULL_TREE);
8405 }
8406 /* Otherwise we use `access$(this$<j>). ... access$(this$<i>).<field>'.
8407 Once again we break the `private' access rule from a foreign
8408 class. */
8409 else
8410 access = make_qualified_primary (access, id, lc);
8411 }
8412 return resolve_expression_name (access, NULL);
8413}
8414
ee142fe7 8415/* Return a nonzero value if NODE describes an outer field inner
c2952b01
APB		 8416 access. */
8417
8418static int
0a2f0c54 8419outer_field_access_p (tree type, tree decl)
c2952b01 8420{
e35b68b0 8421 if (!INNER_CLASS_TYPE_P (type)
c2952b01
APB		 8422 || TREE_CODE (decl) != FIELD_DECL
8423 || DECL_CONTEXT (decl) == type)
8424 return 0;
e35b68b0 8425
ee5f86dc 8426 /* If the inner class extends the declaration context of the field
67264b4f 8427 we're trying to access, then this isn't an outer field access */
ee5f86dc
APB		 8428 if (inherits_from_p (type, DECL_CONTEXT (decl)))
8429 return 0;
c2952b01
APB		 8430
8431 for (type = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (type))); ;
8432 type = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (type))))
8433 {
8434 if (type == DECL_CONTEXT (decl))
8435 return 1;
5e18f6d6 8436
c2952b01 8437 if (!DECL_CONTEXT (TYPE_NAME (type)))
5e18f6d6
APB		 8438 {
8439 /* Before we give up, see whether the field is inherited from
8440 the enclosing context we're considering. */
8441 if (inherits_from_p (type, DECL_CONTEXT (decl)))
8442 return 1;
8443 break;
8444 }
c2952b01
APB		 8445 }
8446
8447 return 0;
8448}
8449
ee142fe7 8450/* Return a nonzero value if NODE represents an outer field inner
c2952b01
APB		 8451 access that was been already expanded. As a side effect, it returns
8452 the name of the field being accessed and the argument passed to the
8453 access function, suitable for a regeneration of the access method
8454 call if necessary. */
8455
8456static int
0a2f0c54
KG		 8457outer_field_expanded_access_p (tree node, tree *name, tree *arg_type,
8458 tree *arg)
c2952b01
APB		 8459{
8460 int identified = 0;
8461
8462 if (TREE_CODE (node) != CALL_EXPR)
8463 return 0;
8464
8465 /* Well, gcj generates slightly different tree nodes when compiling
8466 to native or bytecodes. It's the case for function calls. */
8467
e35b68b0 8468 if (flag_emit_class_files
c2952b01
APB		 8469 && TREE_CODE (node) == CALL_EXPR
8470 && OUTER_FIELD_ACCESS_IDENTIFIER_P (DECL_NAME (TREE_OPERAND (node, 0))))
8471 identified = 1;
8472 else if (!flag_emit_class_files)
8473 {
8474 node = TREE_OPERAND (node, 0);
e35b68b0 8475
c2952b01
APB		 8476 if (node && TREE_OPERAND (node, 0)
8477 && TREE_CODE (TREE_OPERAND (node, 0)) == ADDR_EXPR)
8478 {
8479 node = TREE_OPERAND (node, 0);
8480 if (TREE_OPERAND (node, 0)
8481 && TREE_CODE (TREE_OPERAND (node, 0)) == FUNCTION_DECL
e35b68b0 8482 && (OUTER_FIELD_ACCESS_IDENTIFIER_P
c2952b01
APB		 8483 (DECL_NAME (TREE_OPERAND (node, 0)))))
8484 identified = 1;
8485 }
8486 }
8487
8488 if (identified && name && arg_type && arg)
8489 {
8490 tree argument = TREE_OPERAND (node, 1);
8491 *name = DECL_NAME (TREE_OPERAND (node, 0));
8492 *arg_type = TREE_TYPE (TREE_TYPE (TREE_VALUE (argument)));
8493 *arg = TREE_VALUE (argument);
8494 }
8495 return identified;
8496}
8497
8498/* Detect in NODE an outer field read access from an inner class and
8499 transform it into a write with RHS as an argument. This function is
8500 called from the java_complete_lhs when an assignment to a LHS can
8501 be identified. */
8502
8503static tree
0a2f0c54 8504outer_field_access_fix (tree wfl, tree node, tree rhs)
c2952b01
APB		 8505{
8506 tree name, arg_type, arg;
e35b68b0 8507
c2952b01
APB		 8508 if (outer_field_expanded_access_p (node, &name, &arg_type, &arg))
8509 {
e35b68b0 8510 node = build_outer_field_access_expr (EXPR_WFL_LINECOL (wfl),
c2952b01
APB		 8511 arg_type, name, arg, rhs);
8512 return java_complete_tree (node);
8513 }
8514 return NULL_TREE;
8515}
8516
8517/* Construct the expression that calls an access method:
e35b68b0 8518 <type>.access$<n>(<arg1> [, <arg2>]);
c2952b01
APB		 8519
8520 ARG2 can be NULL and will be omitted in that case. It will denote a
8521 read access. */
8522
8523static tree
0a2f0c54
KG		 8524build_outer_field_access_expr (int lc, tree type, tree access_method_name,
8525 tree arg1, tree arg2)
c2952b01
APB		 8526{
8527 tree args, cn, access;
8528
e35b68b0 8529 args = arg1 ? arg1 :
c2952b01
APB		 8530 build_wfl_node (build_current_thisn (current_class));
8531 args = build_tree_list (NULL_TREE, args);
8532
8533 if (arg2)
8534 args = tree_cons (NULL_TREE, arg2, args);
8535
8536 access = build_method_invocation (build_wfl_node (access_method_name), args);
8537 cn = build_wfl_node (DECL_NAME (TYPE_NAME (type)));
8538 return make_qualified_primary (cn, access, lc);
8539}
8540
8541static tree
0a2f0c54 8542build_new_access_id (void)
c2952b01
APB		 8543{
8544 static int access_n_counter = 1;
8545 char buffer [128];
8546
8547 sprintf (buffer, "access$%d", access_n_counter++);
8548 return get_identifier (buffer);
8549}
8550
8551/* Create the static access functions for the outer field DECL. We define a
8552 read:
8553 TREE_TYPE (<field>) access$<n> (DECL_CONTEXT (<field>) inst$) {
8554 return inst$.field;
8555 }
8556 and a write access:
8557 TREE_TYPE (<field>) access$<n> (DECL_CONTEXT (<field>) inst$,
8558 TREE_TYPE (<field>) value$) {
8559 return inst$.field = value$;
8560 }
8561 We should have a usage flags on the DECL so we can lazily turn the ones
8562 we're using for code generation. FIXME.
8563*/
8564
8565static tree
0a2f0c54 8566build_outer_field_access_methods (tree decl)
c2952b01
APB		 8567{
8568 tree id, args, stmt, mdecl;
e35b68b0 8569
c7303e41 8570 if (FIELD_INNER_ACCESS_P (decl))
c2952b01
APB		 8571 return FIELD_INNER_ACCESS (decl);
8572
c7303e41 8573 MAYBE_CREATE_VAR_LANG_DECL_SPECIFIC (decl);
e35b68b0 8574
c2952b01
APB		 8575 /* Create the identifier and a function named after it. */
8576 id = build_new_access_id ();
8577
8578 /* The identifier is marked as bearing the name of a generated write
8579 access function for outer field accessed from inner classes. */
8580 OUTER_FIELD_ACCESS_IDENTIFIER_P (id) = 1;
8581
8582 /* Create the read access */
8583 args = build_tree_list (inst_id, build_pointer_type (DECL_CONTEXT (decl)));
8584 TREE_CHAIN (args) = end_params_node;
8585 stmt = make_qualified_primary (build_wfl_node (inst_id),
8586 build_wfl_node (DECL_NAME (decl)), 0);
8587 stmt = build_return (0, stmt);
e35b68b0 8588 mdecl = build_outer_field_access_method (DECL_CONTEXT (decl),
c2952b01
APB		 8589 TREE_TYPE (decl), id, args, stmt);
8590 DECL_FUNCTION_ACCESS_DECL (mdecl) = decl;
8591
c7303e41
APB		 8592 /* Create the write access method. No write access for final variable */
8593 if (!FIELD_FINAL (decl))
8594 {
e35b68b0 8595 args = build_tree_list (inst_id,
c7303e41
APB		 8596 build_pointer_type (DECL_CONTEXT (decl)));
8597 TREE_CHAIN (args) = build_tree_list (wpv_id, TREE_TYPE (decl));
8598 TREE_CHAIN (TREE_CHAIN (args)) = end_params_node;
8599 stmt = make_qualified_primary (build_wfl_node (inst_id),
8600 build_wfl_node (DECL_NAME (decl)), 0);
8601 stmt = build_return (0, build_assignment (ASSIGN_TK, 0, stmt,
8602 build_wfl_node (wpv_id)));
e35b68b0
AD		 8603 mdecl = build_outer_field_access_method (DECL_CONTEXT (decl),
8604 TREE_TYPE (decl), id,
c7303e41
APB		 8605 args, stmt);
8606 }
c2952b01 8607 DECL_FUNCTION_ACCESS_DECL (mdecl) = decl;
c2952b01
APB		 8608
8609 /* Return the access name */
8610 return FIELD_INNER_ACCESS (decl) = id;
8611}
8612
8613/* Build an field access method NAME. */
8614
e35b68b0 8615static tree
0a2f0c54
KG		 8616build_outer_field_access_method (tree class, tree type, tree name,
8617 tree args, tree body)
c2952b01
APB		 8618{
8619 tree saved_current_function_decl, mdecl;
8620
8621 /* Create the method */
8622 mdecl = create_artificial_method (class, ACC_STATIC, type, name, args);
8623 fix_method_argument_names (args, mdecl);
8624 layout_class_method (class, NULL_TREE, mdecl, NULL_TREE);
8625
8626 /* Attach the method body. */
8627 saved_current_function_decl = current_function_decl;
8628 start_artificial_method_body (mdecl);
8629 java_method_add_stmt (mdecl, body);
8630 end_artificial_method_body (mdecl);
8631 current_function_decl = saved_current_function_decl;
8632
8633 return mdecl;
8634}
8635
8636\f
8637/* This section deals with building access function necessary for
8638 certain kinds of method invocation from inner classes. */
8639
8640static tree
0a2f0c54 8641build_outer_method_access_method (tree decl)
c2952b01
APB		 8642{
8643 tree saved_current_function_decl, mdecl;
8644 tree args = NULL_TREE, call_args = NULL_TREE;
8645 tree carg, id, body, class;
8646 char buffer [80];
8647 int parm_id_count = 0;
8648
8649 /* Test this abort with an access to a private field */
8650 if (!strcmp (IDENTIFIER_POINTER (DECL_NAME (decl)), "access$"))
8651 abort ();
8652
8653 /* Check the cache first */
8654 if (DECL_FUNCTION_INNER_ACCESS (decl))
8655 return DECL_FUNCTION_INNER_ACCESS (decl);
8656
8657 class = DECL_CONTEXT (decl);
8658
8659 /* Obtain an access identifier and mark it */
8660 id = build_new_access_id ();
8661 OUTER_FIELD_ACCESS_IDENTIFIER_P (id) = 1;
8662
c2952b01
APB		 8663 carg = TYPE_ARG_TYPES (TREE_TYPE (decl));
8664 /* Create the arguments, as much as the original */
e35b68b0 8665 for (; carg && carg != end_params_node;
c2952b01
APB		 8666 carg = TREE_CHAIN (carg))
8667 {
8668 sprintf (buffer, "write_parm_value$%d", parm_id_count++);
e35b68b0 8669 args = chainon (args, build_tree_list (get_identifier (buffer),
c2952b01
APB		 8670 TREE_VALUE (carg)));
8671 }
8672 args = chainon (args, end_params_node);
8673
8674 /* Create the method */
e35b68b0 8675 mdecl = create_artificial_method (class, ACC_STATIC,
c2952b01
APB		 8676 TREE_TYPE (TREE_TYPE (decl)), id, args);
8677 layout_class_method (class, NULL_TREE, mdecl, NULL_TREE);
8678 /* There is a potential bug here. We should be able to use
8679 fix_method_argument_names, but then arg names get mixed up and
8680 eventually a constructor will have its this$0 altered and the
ed2f11fa 8681 outer context won't be assignment properly. The testcase is
c2952b01
APB		 8682 stub.java FIXME */
8683 TYPE_ARG_TYPES (TREE_TYPE (mdecl)) = args;
8684
8685 /* Attach the method body. */
8686 saved_current_function_decl = current_function_decl;
8687 start_artificial_method_body (mdecl);
8688
8689 /* The actual method invocation uses the same args. When invoking a
8690 static methods that way, we don't want to skip the first
8691 argument. */
8692 carg = args;
8693 if (!METHOD_STATIC (decl))
8694 carg = TREE_CHAIN (carg);
8695 for (; carg && carg != end_params_node; carg = TREE_CHAIN (carg))
8696 call_args = tree_cons (NULL_TREE, build_wfl_node (TREE_PURPOSE (carg)),
8697 call_args);
8698
e35b68b0 8699 body = build_method_invocation (build_wfl_node (DECL_NAME (decl)),
c2952b01
APB		 8700 call_args);
8701 if (!METHOD_STATIC (decl))
e35b68b0 8702 body = make_qualified_primary (build_wfl_node (TREE_PURPOSE (args)),
c2952b01
APB		 8703 body, 0);
8704 if (TREE_TYPE (TREE_TYPE (decl)) != void_type_node)
8705 body = build_return (0, body);
8706 java_method_add_stmt (mdecl,body);
8707 end_artificial_method_body (mdecl);
8708 current_function_decl = saved_current_function_decl;
c2952b01
APB		 8709
8710 /* Back tag the access function so it know what it accesses */
8711 DECL_FUNCTION_ACCESS_DECL (decl) = mdecl;
8712
8713 /* Tag the current method so it knows it has an access generated */
8714 return DECL_FUNCTION_INNER_ACCESS (decl) = mdecl;
8715}
8716
8717\f
8718/* This section of the code deals with building expressions to access
8719 the enclosing instance of an inner class. The enclosing instance is
8720 kept in a generated field called this$<n>, with <n> being the
8721 inner class nesting level (starting from 0.) */
e35b68b0 8722
dba41d30
APB		 8723/* Build an access to a given this$<n>, always chaining access call to
8724 others. Access methods to this$<n> are build on the fly if
8725 necessary. This CAN'T be used to solely access this$<n-1> from
8726 this$<n> (which alway yield to special cases and optimization, see
8727 for example build_outer_field_access). */
c2952b01
APB		 8728
8729static tree
0a2f0c54 8730build_access_to_thisn (tree from, tree to, int lc)
c2952b01
APB		 8731{
8732 tree access = NULL_TREE;
8733
a5778545 8734 while (from != to && PURE_INNER_CLASS_TYPE_P (from))
c2952b01 8735 {
c2952b01 8736 if (!access)
dba41d30
APB		 8737 {
8738 access = build_current_thisn (from);
8739 access = build_wfl_node (access);
8740 }
8741 else
c2952b01 8742 {
dba41d30
APB		 8743 tree access0_wfl, cn;
8744
8745 maybe_build_thisn_access_method (from);
8746 access0_wfl = build_wfl_node (access0_identifier_node);
8747 cn = build_wfl_node (DECL_NAME (TYPE_NAME (from)));
8748 EXPR_WFL_LINECOL (access0_wfl) = lc;
8749 access = build_tree_list (NULL_TREE, access);
8750 access = build_method_invocation (access0_wfl, access);
8751 access = make_qualified_primary (cn, access, lc);
c2952b01 8752 }
5e18f6d6 8753
a5778545
TT		 8754 /* If FROM isn't an inner class, that's fine, we've done enough.
8755 What we're looking for can be accessed from there. */
5e18f6d6
APB		 8756 from = DECL_CONTEXT (TYPE_NAME (from));
8757 if (!from)
8758 break;
8759 from = TREE_TYPE (from);
c2952b01
APB		 8760 }
8761 return access;
8762}
8763
8764/* Build an access function to the this$<n> local to TYPE. NULL_TREE
8765 is returned if nothing needs to be generated. Otherwise, the method
e35b68b0 8766 generated and a method decl is returned.
c2952b01
APB		 8767
8768 NOTE: These generated methods should be declared in a class file
8769 attribute so that they can't be referred to directly. */
8770
8771static tree
0a2f0c54 8772maybe_build_thisn_access_method (tree type)
c2952b01
APB		 8773{
8774 tree mdecl, args, stmt, rtype;
8775 tree saved_current_function_decl;
8776
8777 /* If TYPE is a top-level class, no access method is required.
8778 If there already is such an access method, bail out. */
ee5f86dc 8779 if (CLASS_ACCESS0_GENERATED_P (type) || !PURE_INNER_CLASS_TYPE_P (type))
c2952b01
APB		 8780 return NULL_TREE;
8781
8782 /* We generate the method. The method looks like:
8783 static <outer_of_type> access$0 (<type> inst$) { return inst$.this$<n>; }
8784 */
c2952b01
APB		 8785 args = build_tree_list (inst_id, build_pointer_type (type));
8786 TREE_CHAIN (args) = end_params_node;
8787 rtype = build_pointer_type (TREE_TYPE (DECL_CONTEXT (TYPE_NAME (type))));
8788 mdecl = create_artificial_method (type, ACC_STATIC, rtype,
8789 access0_identifier_node, args);
8790 fix_method_argument_names (args, mdecl);
8791 layout_class_method (type, NULL_TREE, mdecl, NULL_TREE);
8792 stmt = build_current_thisn (type);
e35b68b0 8793 stmt = make_qualified_primary (build_wfl_node (inst_id),
c2952b01
APB		 8794 build_wfl_node (stmt), 0);
8795 stmt = build_return (0, stmt);
8796
8797 saved_current_function_decl = current_function_decl;
8798 start_artificial_method_body (mdecl);
8799 java_method_add_stmt (mdecl, stmt);
8800 end_artificial_method_body (mdecl);
8801 current_function_decl = saved_current_function_decl;
c2952b01
APB		 8802
8803 CLASS_ACCESS0_GENERATED_P (type) = 1;
8804
8805 return mdecl;
8806}
8807
8808/* Craft an correctly numbered `this$<n>'string. this$0 is used for
8809 the first level of innerclassing. this$1 for the next one, etc...
8810 This function can be invoked with TYPE to NULL, available and then
8811 has to count the parser context. */
8812
e2500fed
GK		 8813static GTY(()) tree saved_thisn;
8814static GTY(()) tree saved_type;
8815
c2952b01 8816static tree
0a2f0c54 8817build_current_thisn (tree type)
c2952b01
APB		 8818{
8819 static int saved_i = -1;
19e223db 8820 static int saved_type_i = 0;
c2952b01 8821 tree decl;
87d4ad08 8822 char buffer [24];
c2952b01
APB		 8823 int i = 0;
8824
19e223db
MM		 8825 if (type)
8826 {
c2952b01
APB		 8827 if (type == saved_type)
8828 i = saved_type_i;
8829 else
8830 {
e35b68b0 8831 for (i = -1, decl = DECL_CONTEXT (TYPE_NAME (type));
c2952b01
APB		 8832 decl; decl = DECL_CONTEXT (decl), i++)
8833 ;
e35b68b0 8834
c2952b01
APB		 8835 saved_type = type;
8836 saved_type_i = i;
8837 }
8838 }
8839 else
8840 i = list_length (GET_CPC_LIST ())-2;
8841
8842 if (i == saved_i)
8843 return saved_thisn;
e35b68b0 8844
c2952b01
APB		 8845 sprintf (buffer, "this$%d", i);
8846 saved_i = i;
8847 saved_thisn = get_identifier (buffer);
8848 return saved_thisn;
8849}
8850
67264b4f 8851/* Return the assignment to the hidden enclosing context `this$<n>'
c2952b01
APB		 8852 by the second incoming parameter to the innerclass constructor. The
8853 form used is `this.this$<n> = this$<n>;'. */
8854
8855static tree
0a2f0c54 8856build_thisn_assign (void)
c2952b01
APB		 8857{
8858 if (current_class && PURE_INNER_CLASS_TYPE_P (current_class))
8859 {
8860 tree thisn = build_current_thisn (current_class);
8861 tree lhs = make_qualified_primary (build_wfl_node (this_identifier_node),
8862 build_wfl_node (thisn), 0);
8863 tree rhs = build_wfl_node (thisn);
9ec819d4
PB		 8864#ifdef USE_MAPPED_LOCATION
8865 SET_EXPR_LOCATION (lhs, input_location);
8866#else
d479d37f 8867 EXPR_WFL_SET_LINECOL (lhs, input_line, 0);
9ec819d4 8868#endif
c2952b01
APB		 8869 return build_assignment (ASSIGN_TK, EXPR_WFL_LINECOL (lhs), lhs, rhs);
8870 }
8871 return NULL_TREE;
8872}
8873
8874\f
165f37bc
APB		 8875/* Building the synthetic `class$' used to implement the `.class' 1.1
8876 extension for non primitive types. This method looks like:
8877
8878 static Class class$(String type) throws NoClassDefFoundError
8879 {
8880 try {return (java.lang.Class.forName (String));}
8881 catch (ClassNotFoundException e) {
8882 throw new NoClassDefFoundError(e.getMessage());}
8883 } */
8884
e2500fed
GK		 8885static GTY(()) tree get_message_wfl;
8886static GTY(()) tree type_parm_wfl;
8887
165f37bc 8888static tree
0a2f0c54 8889build_dot_class_method (tree class)
165f37bc
APB		 8890{
8891#define BWF(S) build_wfl_node (get_identifier ((S)))
9ec819d4
PB		 8892#ifdef USE_MAPPED_LOCATION
8893#define MQN(X,Y) make_qualified_name ((X), (Y), UNKNOWN_LOCATION)
8894#else
165f37bc 8895#define MQN(X,Y) make_qualified_name ((X), (Y), 0)
9ec819d4 8896#endif
b8ca854a 8897 tree args, tmp, saved_current_function_decl, mdecl, qual_name;
17126208 8898 tree stmt, throw_stmt;
165f37bc 8899
165f37bc
APB		 8900 if (!get_message_wfl)
8901 {
8902 get_message_wfl = build_wfl_node (get_identifier ("getMessage"));
8903 type_parm_wfl = build_wfl_node (get_identifier ("type$"));
8904 }
8905
8906 /* Build the arguments */
8907 args = build_tree_list (get_identifier ("type$"),
8908 build_pointer_type (string_type_node));
8909 TREE_CHAIN (args) = end_params_node;
8910
8911 /* Build the qualified name java.lang.Class.forName */
e35b68b0 8912 tmp = MQN (MQN (MQN (BWF ("java"),
165f37bc 8913 BWF ("lang")), BWF ("Class")), BWF ("forName"));
e35b68b0 8914
165f37bc 8915 /* Create the "class$" function */
e35b68b0 8916 mdecl = create_artificial_method (class, ACC_STATIC,
165f37bc 8917 build_pointer_type (class_type_node),
94807d33 8918 classdollar_identifier_node, args);
b8ca854a
JS		 8919 qual_name = MQN (MQN (BWF ("java"), BWF ("lang")),
8920 BWF ("NoClassDefFoundError"));
8921 DECL_FUNCTION_THROWS (mdecl) = build_tree_list (NULL_TREE, qual_name);
8922 register_incomplete_type (JDEP_EXCEPTION, qual_name, NULL_TREE, NULL_TREE);
8923 JDEP_GET_PATCH (CLASSD_LAST (ctxp->classd_list)) =
8924 &TREE_VALUE (DECL_FUNCTION_THROWS (mdecl));
17126208 8925
165f37bc
APB		 8926 /* We start by building the try block. We need to build:
8927 return (java.lang.Class.forName (type)); */
e35b68b0 8928 stmt = build_method_invocation (tmp,
165f37bc
APB		 8929 build_tree_list (NULL_TREE, type_parm_wfl));
8930 stmt = build_return (0, stmt);
165f37bc
APB		 8931
8932 /* Now onto the catch block. We start by building the expression
17126208 8933 throwing a new exception: throw new NoClassDefFoundError (_.getMessage) */
9ec819d4
PB		 8934#ifdef USE_MAPPED_LOCATION
8935 throw_stmt = make_qualified_name (build_wfl_node (wpv_id),
8936 get_message_wfl, UNKNOWN_LOCATION);
8937#else
e35b68b0 8938 throw_stmt = make_qualified_name (build_wfl_node (wpv_id),
165f37bc 8939 get_message_wfl, 0);
9ec819d4 8940#endif
165f37bc 8941 throw_stmt = build_method_invocation (throw_stmt, NULL_TREE);
e35b68b0 8942
165f37bc 8943 /* Build new NoClassDefFoundError (_.getMessage) */
e35b68b0 8944 throw_stmt = build_new_invocation
165f37bc
APB		 8945 (build_wfl_node (get_identifier ("NoClassDefFoundError")),
8946 build_tree_list (build_pointer_type (string_type_node), throw_stmt));
8947
8948 /* Build the throw, (it's too early to use BUILD_THROW) */
8949 throw_stmt = build1 (THROW_EXPR, NULL_TREE, throw_stmt);
8950
17126208 8951 /* Encapsulate STMT in a try block. The catch clause executes THROW_STMT */
b8ca854a
JS		 8952 qual_name = MQN (MQN (BWF ("java"), BWF ("lang")),
8953 BWF ("ClassNotFoundException"));
8954 stmt = encapsulate_with_try_catch (0, qual_name, stmt, throw_stmt);
165f37bc
APB		 8955
8956 fix_method_argument_names (args, mdecl);
8957 layout_class_method (class, NULL_TREE, mdecl, NULL_TREE);
8958 saved_current_function_decl = current_function_decl;
8959 start_artificial_method_body (mdecl);
8960 java_method_add_stmt (mdecl, stmt);
8961 end_artificial_method_body (mdecl);
8962 current_function_decl = saved_current_function_decl;
8963 TYPE_DOT_CLASS (class) = mdecl;
8964
8965 return mdecl;
8966}
8967
8968static tree
b8ca854a 8969build_dot_class_method_invocation (tree this_class, tree type)
165f37bc 8970{
b8ca854a
JS		 8971 tree dot_class_method = TYPE_DOT_CLASS (this_class);
8972 tree sig_id, s, t;
f0f3a777
APB		 8973
8974 if (TYPE_ARRAY_P (type))
8975 sig_id = build_java_signature (type);
8976 else
8977 sig_id = DECL_NAME (TYPE_NAME (type));
8978
496849ba
APB		 8979 /* Ensure that the proper name separator is used */
8980 sig_id = unmangle_classname (IDENTIFIER_POINTER (sig_id),
8981 IDENTIFIER_LENGTH (sig_id));
8982
e35b68b0 8983 s = build_string (IDENTIFIER_LENGTH (sig_id),
1f8f4a0b 8984 IDENTIFIER_POINTER (sig_id));
b8ca854a
JS		 8985 t = build_method_invocation (build_wfl_node (DECL_NAME (dot_class_method)),
8986 build_tree_list (NULL_TREE, s));
8987 if (DECL_CONTEXT (dot_class_method) != this_class)
8988 {
8989 tree class_name = DECL_NAME (TYPE_NAME (DECL_CONTEXT (dot_class_method)));
8990 t = make_qualified_primary (build_wfl_node (class_name), t, 0);
8991 }
8992 return t;
165f37bc
APB		 8993}
8994
c2952b01
APB		 8995/* This section of the code deals with constructor. */
8996
22eed1e6
APB		 8997/* Craft a body for default constructor. Patch existing constructor
8998 bodies with call to super() and field initialization statements if
8999 necessary. */
9000
9001static void
0a2f0c54 9002fix_constructors (tree mdecl)
22eed1e6 9003{
17126208 9004 tree iii; /* Instance Initializer Invocation */
9ec819d4 9005 tree *bodyp = &DECL_FUNCTION_BODY (mdecl);
c2952b01
APB		 9006 tree thisn_assign, compound = NULL_TREE;
9007 tree class_type = DECL_CONTEXT (mdecl);
22eed1e6 9008
73c299fc
APB		 9009 if (DECL_FIXED_CONSTRUCTOR_P (mdecl))
9010 return;
9011 DECL_FIXED_CONSTRUCTOR_P (mdecl) = 1;
9012
9ec819d4 9013 if (!*bodyp)
22eed1e6 9014 {
22eed1e6
APB		 9015 /* It is an error for the compiler to generate a default
9016 constructor if the superclass doesn't have a constructor that
c2952b01
APB		 9017 takes no argument, or the same args for an anonymous class */
9018 if (verify_constructor_super (mdecl))
22eed1e6 9019 {
c2952b01
APB		 9020 tree sclass_decl = TYPE_NAME (CLASSTYPE_SUPER (class_type));
9021 tree save = DECL_NAME (mdecl);
49f48c71 9022 const char *n = IDENTIFIER_POINTER (DECL_NAME (sclass_decl));
c2952b01 9023 DECL_NAME (mdecl) = DECL_NAME (sclass_decl);
781b0558 9024 parse_error_context
e35b68b0 9025 (lookup_cl (TYPE_NAME (class_type)),
c2952b01 9026 "No constructor matching `%s' found in class `%s'",
1b9deeb4 9027 lang_printable_name (mdecl, 2), n);
c2952b01 9028 DECL_NAME (mdecl) = save;
22eed1e6 9029 }
e35b68b0 9030
c2952b01
APB		 9031 /* The constructor body must be crafted by hand. It's the
9032 constructor we defined when we realize we didn't have the
9033 CLASSNAME() constructor */
22eed1e6 9034 start_artificial_method_body (mdecl);
e35b68b0 9035
f0f3a777
APB		 9036 /* Insert an assignment to the this$<n> hidden field, if
9037 necessary */
9038 if ((thisn_assign = build_thisn_assign ()))
9039 java_method_add_stmt (mdecl, thisn_assign);
9040
22eed1e6
APB		 9041 /* We don't generate a super constructor invocation if we're
9042 compiling java.lang.Object. build_super_invocation takes care
9043 of that. */
41ee0877 9044 java_method_add_stmt (mdecl, build_super_invocation (mdecl));
22eed1e6 9045
17126208
APB		 9046 /* FIXME */
9047 if ((iii = build_instinit_invocation (class_type)))
9048 java_method_add_stmt (mdecl, iii);
c2952b01 9049
22eed1e6
APB		 9050 end_artificial_method_body (mdecl);
9051 }
9052 /* Search for an explicit constructor invocation */
e35b68b0 9053 else
22eed1e6
APB		 9054 {
9055 int found = 0;
9be7529d 9056 int invokes_this = 0;
9ec819d4 9057 tree main_block = BLOCK_EXPR_BODY (*bodyp);
e35b68b0 9058
9ec819d4
PB		 9059 while (*bodyp)
9060 {
9061 tree body = *bodyp;
9062 switch (TREE_CODE (body))
9063 {
9064 case CALL_EXPR:
9065 found = CALL_EXPLICIT_CONSTRUCTOR_P (body);
9066 if (CALL_THIS_CONSTRUCTOR_P (body))
9067 invokes_this = 1;
9068 break;
9069 case COMPOUND_EXPR:
9070 case EXPR_WITH_FILE_LOCATION:
9071 bodyp = &TREE_OPERAND (body, 0);
9072 continue;
9073 case BLOCK:
9074 bodyp = &BLOCK_EXPR_BODY (body);
9075 continue;
9076 default:
9077 break;
9078 }
9079 break;
9080 }
41ee0877
APB		 9081
9082 /* Generate the assignment to this$<n>, if necessary */
9083 if ((thisn_assign = build_thisn_assign ()))
9084 compound = add_stmt_to_compound (compound, NULL_TREE, thisn_assign);
9085
22eed1e6
APB		 9086 /* The constructor is missing an invocation of super() */
9087 if (!found)
9088 compound = add_stmt_to_compound (compound, NULL_TREE,
c2952b01 9089 build_super_invocation (mdecl));
67264b4f 9090 /* Explicit super() invocation should take place before the
41ee0877 9091 instance initializer blocks. */
73c299fc
APB		 9092 else
9093 {
9ec819d4
PB		 9094 compound = add_stmt_to_compound (compound, NULL_TREE, *bodyp);
9095 *bodyp = build_java_empty_stmt ();
73c299fc 9096 }
e35b68b0 9097
4f88ccda
PB		 9098 DECL_INIT_CALLS_THIS (mdecl) = invokes_this;
9099
73c299fc 9100 /* Insert the instance initializer block right after. */
17126208
APB		 9101 if (!invokes_this && (iii = build_instinit_invocation (class_type)))
9102 compound = add_stmt_to_compound (compound, NULL_TREE, iii);
f0f3a777 9103
22eed1e6
APB		 9104 /* Fix the constructor main block if we're adding extra stmts */
9105 if (compound)
9106 {
9107 compound = add_stmt_to_compound (compound, NULL_TREE,
9108 BLOCK_EXPR_BODY (main_block));
9109 BLOCK_EXPR_BODY (main_block) = compound;
9110 }
9111 }
9112}
9113
9114/* Browse constructors in the super class, searching for a constructor
9115 that doesn't take any argument. Return 0 if one is found, 1
c2952b01
APB		 9116 otherwise. If the current class is an anonymous inner class, look
9117 for something that has the same signature. */
22eed1e6
APB		 9118
9119static int
0a2f0c54 9120verify_constructor_super (tree mdecl)
22eed1e6
APB		 9121{
9122 tree class = CLASSTYPE_SUPER (current_class);
152de068 9123 int super_inner = PURE_INNER_CLASS_TYPE_P (class);
c2952b01
APB		 9124 tree sdecl;
9125
22eed1e6
APB		 9126 if (!class)
9127 return 0;
9128
c2952b01 9129 if (ANONYMOUS_CLASS_P (current_class))
22eed1e6 9130 {
c2952b01
APB		 9131 tree mdecl_arg_type;
9132 SKIP_THIS_AND_ARTIFICIAL_PARMS (mdecl_arg_type, mdecl);
9133 for (sdecl = TYPE_METHODS (class); sdecl; sdecl = TREE_CHAIN (sdecl))
9134 if (DECL_CONSTRUCTOR_P (sdecl))
9135 {
cf1b2274 9136 tree m_arg_type;
152de068
APB		 9137 tree arg_type = TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (sdecl)));
9138 if (super_inner)
9139 arg_type = TREE_CHAIN (arg_type);
e35b68b0
AD		 9140 for (m_arg_type = mdecl_arg_type;
9141 (arg_type != end_params_node
cf1b2274 9142 && m_arg_type != end_params_node);
e35b68b0 9143 arg_type = TREE_CHAIN (arg_type),
cf1b2274 9144 m_arg_type = TREE_CHAIN (m_arg_type))
e35b68b0 9145 if (!valid_method_invocation_conversion_p
29fcdaae
APB		 9146 (TREE_VALUE (arg_type),
9147 TREE_VALUE (m_arg_type)))
c2952b01
APB		 9148 break;
9149
cf1b2274 9150 if (arg_type == end_params_node && m_arg_type == end_params_node)
c2952b01
APB		 9151 return 0;
9152 }
9153 }
9154 else
9155 {
9156 for (sdecl = TYPE_METHODS (class); sdecl; sdecl = TREE_CHAIN (sdecl))
22eed1e6 9157 {
152de068
APB		 9158 tree arg = TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (sdecl)));
9159 if (super_inner)
9160 arg = TREE_CHAIN (arg);
9161 if (DECL_CONSTRUCTOR_P (sdecl) && arg == end_params_node)
22eed1e6
APB		 9162 return 0;
9163 }
9164 }
9165 return 1;
9166}
9167
22eed1e6 9168/* Generate code for all context remembered for code generation. */
b351b287 9169
e2500fed 9170static GTY(()) tree reversed_class_list;
b351b287 9171void
0a2f0c54 9172java_expand_classes (void)
b351b287 9173{
5423609c 9174 int save_error_count = 0;
9c491eb8 9175 static struct parser_ctxt *cur_ctxp = NULL;
c2952b01 9176
23a79c61
APB		 9177 java_parse_abort_on_error ();
9178 if (!(ctxp = ctxp_for_generation))
5e942c50
APB		 9179 return;
9180 java_layout_classes ();
9181 java_parse_abort_on_error ();
9ec819d4 9182 location_t save_location = input_location;
5e942c50 9183
85194ee9
AH		 9184 for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
9185 {
9186 tree current;
9187 for (current = cur_ctxp->class_list;
9188 current;
9189 current = TREE_CHAIN (current))
9190 gen_indirect_dispatch_tables (TREE_TYPE (current));
9191 }
9192
f0c75752 9193 for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
b351b287 9194 {
9c491eb8 9195 ctxp = cur_ctxp;
9ec819d4 9196 input_location = ctxp->file_start_location;
b351b287 9197 lang_init_source (2); /* Error msgs have method prototypes */
c2952b01 9198 java_complete_expand_classes (); /* Complete and expand classes */
b351b287
APB		 9199 java_parse_abort_on_error ();
9200 }
9ec819d4 9201 input_location = save_location;
c2952b01 9202
568d1435 9203 /* Find anonymous classes and expand their constructor. This extra pass is
67264b4f 9204 necessary because the constructor itself is only generated when the
568d1435 9205 method in which it is defined is expanded. */
f0c75752 9206 for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
c2952b01
APB		 9207 {
9208 tree current;
9c491eb8 9209 ctxp = cur_ctxp;
c2952b01
APB		 9210 for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
9211 {
85194ee9 9212 output_class = current_class = TREE_TYPE (current);
c2952b01
APB		 9213 if (ANONYMOUS_CLASS_P (current_class))
9214 {
9215 tree d;
9216 for (d = TYPE_METHODS (current_class); d; d = TREE_CHAIN (d))
9217 {
9218 if (DECL_CONSTRUCTOR_P (d))
9219 {
c2952b01 9220 java_complete_expand_method (d);
568d1435 9221 break; /* There is only one constructor. */
c2952b01
APB		 9222 }
9223 }
9224 }
9225 }
9226 }
9227
2d7b3505
AH		 9228 /* Expanding the constructors of anonymous classes generates access
9229 methods. Scan all the methods looking for null DECL_RESULTs --
9230 this will be the case if a method hasn't been expanded. */
9231 for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
9232 {
9233 tree current;
9234 ctxp = cur_ctxp;
9235 for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
9236 {
9237 tree d;
85194ee9 9238 output_class = current_class = TREE_TYPE (current);
2d7b3505
AH		 9239 for (d = TYPE_METHODS (current_class); d; d = TREE_CHAIN (d))
9240 {
9241 if (DECL_RESULT (d) == NULL_TREE)
165b54c3 9242 java_complete_expand_method (d);
2d7b3505
AH		 9243 }
9244 }
9245 }
9246
9247 /* ??? Instead of all this we could iterate around the list of
9248 classes until there were no more un-expanded methods. It would
9249 take a little longer -- one pass over the whole list of methods
9250 -- but it would be simpler. Like this: */
9251#if 0
9252 {
9253 int something_changed;
9254
9255 do
9256 {
9257 something_changed = 0;
9258 for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
9259 {
9260 tree current;
9261 ctxp = cur_ctxp;
9262 for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
9263 {
9264 tree d;
85194ee9 9265 output_class = current_class = TREE_TYPE (current);
2d7b3505
AH		 9266 for (d = TYPE_METHODS (current_class); d; d = TREE_CHAIN (d))
9267 {
9268 if (DECL_RESULT (d) == NULL_TREE)
9269 {
9270 something_changed = 1;
2d7b3505 9271 java_complete_expand_method (d);
2d7b3505
AH		 9272 }
9273 }
9274 }
9275 }
9276 }
9277 while (something_changed);
9278 }
9279#endif
9280
c2952b01
APB		 9281 /* If we've found error at that stage, don't try to generate
9282 anything, unless we're emitting xrefs or checking the syntax only
9283 (but not using -fsyntax-only for the purpose of generating
9284 bytecode. */
e35b68b0 9285 if (java_error_count && !flag_emit_xref
c2952b01
APB		 9286 && (!flag_syntax_only && !flag_emit_class_files))
9287 return;
9288
9289 /* Now things are stable, go for generation of the class data. */
f0c75752 9290
3bec3c0c
RH		 9291 /* We pessimistically marked all methods and fields external until
9292 we knew what set of classes we were planning to compile. Now mark
f0c75752
RH		 9293 those that will be generated locally as not external. */
9294 for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
9295 {
9296 tree current;
14b71055 9297 ctxp = cur_ctxp;
f0c75752 9298 for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
3bec3c0c 9299 java_mark_class_local (TREE_TYPE (current));
f0c75752
RH		 9300 }
9301
9302 /* Compile the classes. */
9303 for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
c2952b01
APB		 9304 {
9305 tree current;
e2500fed 9306 reversed_class_list = NULL;
a15135c9 9307
9c491eb8 9308 ctxp = cur_ctxp;
a15135c9
MM		 9309
9310 /* We write out the classes in reverse order. This ensures that
9311 inner classes are written before their containing classes,
9312 which is important for parallel builds. Otherwise, the
9313 class file for the outer class may be found, but the class
9314 file for the inner class may not be present. In that
9315 situation, the compiler cannot fall back to the original
9316 source, having already read the outer class, so we must
9317 prevent that situation. */
e35b68b0
AD		 9318 for (current = ctxp->class_list;
9319 current;
a15135c9
MM		 9320 current = TREE_CHAIN (current))
9321 reversed_class_list
9322 = tree_cons (NULL_TREE, current, reversed_class_list);
a15135c9 9323
e35b68b0
AD		 9324 for (current = reversed_class_list;
9325 current;
a15135c9 9326 current = TREE_CHAIN (current))
c2952b01 9327 {
85194ee9 9328 output_class = current_class = TREE_TYPE (TREE_VALUE (current));
c2952b01
APB		 9329 if (flag_emit_class_files)
9330 write_classfile (current_class);
9331 if (flag_emit_xref)
9332 expand_xref (current_class);
9333 else if (! flag_syntax_only)
9220b1ba 9334 java_expand_method_bodies (current_class);
c2952b01
APB		 9335 }
9336 }
b351b287
APB		 9337}
9338
916b57ce
JS		 9339void
9340java_finish_classes (void)
9341{
9342 static struct parser_ctxt *cur_ctxp = NULL;
9343 for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
9344 {
9345 tree current;
9346 ctxp = cur_ctxp;
9347 for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
9348 {
85194ee9 9349 output_class = current_class = TREE_TYPE (current);
916b57ce
JS		 9350 finish_class ();
9351 }
9352 }
9353}
9354
e04a16fb
AG		 9355/* Wrap non WFL PRIMARY around a WFL and set EXPR_WFL_QUALIFICATION to
9356 a tree list node containing RIGHT. Fore coming RIGHTs will be
9357 chained to this hook. LOCATION contains the location of the
9358 separating `.' operator. */
9359
9360static tree
0a2f0c54 9361make_qualified_primary (tree primary, tree right, int location)
e04a16fb
AG		 9362{
9363 tree wfl;
9364
c2952b01 9365 if (TREE_CODE (primary) != EXPR_WITH_FILE_LOCATION)
9a7ab4b3 9366 wfl = build_wfl_wrap (primary, location);
e04a16fb
AG		 9367 else
9368 {
9369 wfl = primary;
c2952b01
APB		 9370 /* If wfl wasn't qualified, we build a first anchor */
9371 if (!EXPR_WFL_QUALIFICATION (wfl))
9372 EXPR_WFL_QUALIFICATION (wfl) = build_tree_list (wfl, NULL_TREE);
e04a16fb
AG		 9373 }
9374
c2952b01 9375 /* And chain them */
e04a16fb
AG		 9376 EXPR_WFL_LINECOL (right) = location;
9377 chainon (EXPR_WFL_QUALIFICATION (wfl), build_tree_list (right, NULL_TREE));
9378 PRIMARY_P (wfl) = 1;
9379 return wfl;
9380}
9381
9382/* Simple merge of two name separated by a `.' */
9383
9384static tree
0a2f0c54 9385merge_qualified_name (tree left, tree right)
e04a16fb
AG		 9386{
9387 tree node;
c2952b01
APB		 9388 if (!left && !right)
9389 return NULL_TREE;
9390
9391 if (!left)
9392 return right;
9393
9394 if (!right)
9395 return left;
9396
e04a16fb
AG		 9397 obstack_grow (&temporary_obstack, IDENTIFIER_POINTER (left),
9398 IDENTIFIER_LENGTH (left));
9399 obstack_1grow (&temporary_obstack, '.');
9400 obstack_grow0 (&temporary_obstack, IDENTIFIER_POINTER (right),
9401 IDENTIFIER_LENGTH (right));
9402 node = get_identifier (obstack_base (&temporary_obstack));
9403 obstack_free (&temporary_obstack, obstack_base (&temporary_obstack));
9404 QUALIFIED_P (node) = 1;
9405 return node;
9406}
9407
9408/* Merge the two parts of a qualified name into LEFT. Set the
9409 location information of the resulting node to LOCATION, usually
9410 inherited from the location information of the `.' operator. */
9411
9412static tree
9ec819d4
PB		 9413make_qualified_name (tree left, tree right,
9414#ifdef USE_MAPPED_LOCATION
9415 source_location location
9416#else
9417 int location
9418#endif
9419 )
e04a16fb 9420{
bc3ca41b 9421#ifdef USE_COMPONENT_REF
dc6d7095 9422 tree node = build3 (COMPONENT_REF, NULL_TREE, left, right, NULL_TREE);
9ec819d4 9423 SET_EXPR_LOCATION (node, location);
bc3ca41b
PB		 9424 return node;
9425#else
e04a16fb
AG		 9426 tree left_id = EXPR_WFL_NODE (left);
9427 tree right_id = EXPR_WFL_NODE (right);
9428 tree wfl, merge;
9429
9430 merge = merge_qualified_name (left_id, right_id);
9431
9432 /* Left wasn't qualified and is now qualified */
9ec819d4
PB		 9433#ifdef USE_MAPPED_LOCATION
9434 if (!QUALIFIED_P (left_id))
9435 {
9436 tree wfl = build_expr_wfl (left_id, EXPR_LOCATION (left));
9437 EXPR_WFL_QUALIFICATION (left) = build_tree_list (wfl, NULL_TREE);
9438 }
9439
9440 wfl = build_expr_wfl (right_id, location);
9441#else
e04a16fb
AG		 9442 if (!QUALIFIED_P (left_id))
9443 {
9444 tree wfl = build_expr_wfl (left_id, ctxp->filename, 0, 0);
9445 EXPR_WFL_LINECOL (wfl) = EXPR_WFL_LINECOL (left);
9446 EXPR_WFL_QUALIFICATION (left) = build_tree_list (wfl, NULL_TREE);
9447 }
e35b68b0 9448
e04a16fb
AG		 9449 wfl = build_expr_wfl (right_id, ctxp->filename, 0, 0);
9450 EXPR_WFL_LINECOL (wfl) = location;
9ec819d4 9451#endif
e04a16fb 9452 chainon (EXPR_WFL_QUALIFICATION (left), build_tree_list (wfl, NULL_TREE));
e04a16fb
AG		 9453 EXPR_WFL_NODE (left) = merge;
9454 return left;
bc3ca41b 9455#endif
e04a16fb
AG		 9456}
9457
9458/* Extract the last identifier component of the qualified in WFL. The
9459 last identifier is removed from the linked list */
9460
9461static tree
0a2f0c54 9462cut_identifier_in_qualified (tree wfl)
e04a16fb
AG		 9463{
9464 tree q;
9465 tree previous = NULL_TREE;
9466 for (q = EXPR_WFL_QUALIFICATION (wfl); ; previous = q, q = TREE_CHAIN (q))
9467 if (!TREE_CHAIN (q))
9468 {
9469 if (!previous)
400500c4
RK		 9470 /* Operating on a non qualified qualified WFL. */
9471 abort ();
9472
e04a16fb
AG		 9473 TREE_CHAIN (previous) = NULL_TREE;
9474 return TREE_PURPOSE (q);
9475 }
9476}
9477
9478/* Resolve the expression name NAME. Return its decl. */
9479
9480static tree
0a2f0c54 9481resolve_expression_name (tree id, tree *orig)
e04a16fb
AG		 9482{
9483 tree name = EXPR_WFL_NODE (id);
9484 tree decl;
9485
9486 /* 6.5.5.1: Simple expression names */
9487 if (!PRIMARY_P (id) && !QUALIFIED_P (name))
9488 {
9489 /* 15.13.1: NAME can appear within the scope of a local variable
9490 declaration */
9491 if ((decl = IDENTIFIER_LOCAL_VALUE (name)))
9492 return decl;
9493
9494 /* 15.13.1: NAME can appear within a class declaration */
e35b68b0 9495 else
e04a16fb
AG		 9496 {
9497 decl = lookup_field_wrapper (current_class, name);
9498 if (decl)
9499 {
c2952b01 9500 tree access = NULL_TREE;
e04a16fb 9501 int fs = FIELD_STATIC (decl);
f2760b27
APB		 9502
9503 /* If we're accessing an outer scope local alias, make
9504 sure we change the name of the field we're going to
9505 build access to. */
9506 if (FIELD_LOCAL_ALIAS_USED (decl))
9507 name = DECL_NAME (decl);
9508
f94ae540
TT		 9509 check_deprecation (id, decl);
9510
e04a16fb
AG		 9511 /* Instance variable (8.3.1.1) can't appear within
9512 static method, static initializer or initializer for
9513 a static variable. */
9514 if (!fs && METHOD_STATIC (current_function_decl))
9515 {
7f10c2e2 9516 static_ref_err (id, name, current_class);
e04a16fb
AG		 9517 return error_mark_node;
9518 }
22eed1e6
APB		 9519 /* Instance variables can't appear as an argument of
9520 an explicit constructor invocation */
7e1376a1
BM		 9521 if (!fs && ctxp->explicit_constructor_p
9522 && !enclosing_context_p (DECL_CONTEXT (decl), current_class))
22eed1e6
APB		 9523 {
9524 parse_error_context
781b0558 9525 (id, "Can't reference `%s' before the superclass constructor has been called", IDENTIFIER_POINTER (name));
22eed1e6
APB		 9526 return error_mark_node;
9527 }
5e942c50 9528
c2952b01
APB		 9529 /* If we're processing an inner class and we're trying
9530 to access a field belonging to an outer class, build
9531 the access to the field */
9532 if (!fs && outer_field_access_p (current_class, decl))
ee5f86dc
APB		 9533 {
9534 if (CLASS_STATIC (TYPE_NAME (current_class)))
9535 {
9536 static_ref_err (id, DECL_NAME (decl), current_class);
9537 return error_mark_node;
9538 }
4009bb7d
APB		 9539 access = build_outer_field_access (id, decl);
9540 if (orig)
9541 *orig = access;
9542 return access;
ee5f86dc 9543 }
c2952b01 9544
5e942c50 9545 /* Otherwise build what it takes to access the field */
c2952b01
APB		 9546 access = build_field_ref ((fs ? NULL_TREE : current_this),
9547 DECL_CONTEXT (decl), name);
3cc48399
PB		 9548 if (fs)
9549 access = maybe_build_class_init_for_field (decl, access);
5e942c50
APB		 9550 /* We may be asked to save the real field access node */
9551 if (orig)
c2952b01 9552 *orig = access;
cd11bdcc
APB		 9553 /* Last check: can we access the field? */
9554 if (not_accessible_p (current_class, decl, NULL_TREE, 0))
9555 {
9556 not_accessible_field_error (id, decl);
9557 return error_mark_node;
9558 }
5e942c50 9559 /* And we return what we got */
c2952b01 9560 return access;
e04a16fb
AG		 9561 }
9562 /* Fall down to error report on undefined variable */
9563 }
9564 }
9565 /* 6.5.5.2 Qualified Expression Names */
9566 else
9567 {
5e942c50
APB		 9568 if (orig)
9569 *orig = NULL_TREE;
e04a16fb
AG		 9570 qualify_ambiguous_name (id);
9571 /* 15.10.1 Field Access Using a Primary and/or Expression Name */
9572 /* 15.10.2: Accessing Superclass Members using super */
98f3c1db 9573 return resolve_field_access (id, orig, NULL);
e04a16fb
AG		 9574 }
9575
9576 /* We've got an error here */
51e23701 9577 if (INNER_CLASS_TYPE_P (current_class))
e35b68b0 9578 parse_error_context (id,
51e23701
APB		 9579 "Local variable `%s' can't be accessed from within the inner class `%s' unless it is declared final",
9580 IDENTIFIER_POINTER (name),
9581 IDENTIFIER_POINTER (DECL_NAME
9582 (TYPE_NAME (current_class))));
9583 else
e35b68b0 9584 parse_error_context (id, "Undefined variable `%s'",
51e23701 9585 IDENTIFIER_POINTER (name));
e04a16fb
AG		 9586
9587 return error_mark_node;
9588}
9589
7f10c2e2 9590static void
0a2f0c54 9591static_ref_err (tree wfl, tree field_id, tree class_type)
7f10c2e2 9592{
e35b68b0
AD		 9593 parse_error_context
9594 (wfl,
7f10c2e2 9595 "Can't make a static reference to nonstatic variable `%s' in class `%s'",
e35b68b0 9596 IDENTIFIER_POINTER (field_id),
7f10c2e2
APB		 9597 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (class_type))));
9598}
9599
a83f01f0 9600/* 15.10.1 Field Access Using a Primary and/or Expression Name.
e04a16fb
AG		 9601 We return something suitable to generate the field access. We also
9602 return the field decl in FIELD_DECL and its type in FIELD_TYPE. If
9603 recipient's address can be null. */
9604
9605static tree
0a2f0c54 9606resolve_field_access (tree qual_wfl, tree *field_decl, tree *field_type)
e04a16fb
AG		 9607{
9608 int is_static = 0;
9609 tree field_ref;
6de9cd9a 9610 tree decl = NULL_TREE, where_found, type_found;
e04a16fb
AG		 9611
9612 if (resolve_qualified_expression_name (qual_wfl, &decl,
9613 &where_found, &type_found))
9614 return error_mark_node;
9615
9616 /* Resolve the LENGTH field of an array here */
e35b68b0
AD		 9617 if (DECL_P (decl) && DECL_NAME (decl) == length_identifier_node
9618 && type_found && TYPE_ARRAY_P (type_found)
e8fc7396 9619 && ! flag_emit_class_files && ! flag_emit_xref)
e04a16fb
AG		 9620 {
9621 tree length = build_java_array_length_access (where_found);
3e02b1c3 9622 field_ref = length;
611a4b87
APB		 9623
9624 /* In case we're dealing with a static array, we need to
9625 initialize its class before the array length can be fetched.
9626 It's also a good time to create a DECL_RTL for the field if
9627 none already exists, otherwise if the field was declared in a
9628 class found in an external file and hasn't been (and won't
9629 be) accessed for its value, none will be created. */
9630 if (TREE_CODE (where_found) == VAR_DECL && FIELD_STATIC (where_found))
9631 {
9632 build_static_field_ref (where_found);
9633 field_ref = build_class_init (DECL_CONTEXT (where_found), field_ref);
9634 }
e04a16fb
AG		 9635 }
9636 /* We might have been trying to resolve field.method(). In which
9637 case, the resolution is over and decl is the answer */
34f4db93 9638 else if (JDECL_P (decl) && IDENTIFIER_LOCAL_VALUE (DECL_NAME (decl)) == decl)
e04a16fb 9639 field_ref = decl;
34f4db93 9640 else if (JDECL_P (decl))
e04a16fb 9641 {
5e942c50
APB		 9642 if (!type_found)
9643 type_found = DECL_CONTEXT (decl);
3cc48399 9644 is_static = FIELD_STATIC (decl);
e35b68b0
AD		 9645 field_ref = build_field_ref ((is_static && !flag_emit_xref?
9646 NULL_TREE : where_found),
3cc48399 9647 type_found, DECL_NAME (decl));
e04a16fb
AG		 9648 if (field_ref == error_mark_node)
9649 return error_mark_node;
3cc48399
PB		 9650 if (is_static)
9651 field_ref = maybe_build_class_init_for_field (decl, field_ref);
8b8e6c64
TT		 9652
9653 /* If we're looking at a static field, we may need to generate a
9654 class initialization for it. This can happen when the access
9655 looks like `field.ref', where `field' is a static field in an
9656 interface we implement. */
9657 if (!flag_emit_class_files
9658 && !flag_emit_xref
9659 && TREE_CODE (where_found) == VAR_DECL
9660 && FIELD_STATIC (where_found))
9661 {
9662 build_static_field_ref (where_found);
9663 field_ref = build_class_init (DECL_CONTEXT (where_found), field_ref);
9664 }
e04a16fb
AG		 9665 }
9666 else
9667 field_ref = decl;
9668
9669 if (field_decl)
9670 *field_decl = decl;
9671 if (field_type)
e35b68b0 9672 *field_type = (QUAL_DECL_TYPE (decl) ?
c877974e 9673 QUAL_DECL_TYPE (decl) : TREE_TYPE (decl));
e04a16fb
AG		 9674 return field_ref;
9675}
9676
e28cd97b
APB		 9677/* If NODE is an access to f static field, strip out the class
9678 initialization part and return the field decl, otherwise, return
9679 NODE. */
9680
9681static tree
0a2f0c54 9682strip_out_static_field_access_decl (tree node)
e28cd97b
APB		 9683{
9684 if (TREE_CODE (node) == COMPOUND_EXPR)
9685 {
9686 tree op1 = TREE_OPERAND (node, 1);
9687 if (TREE_CODE (op1) == COMPOUND_EXPR)
9688 {
9689 tree call = TREE_OPERAND (op1, 0);
9690 if (TREE_CODE (call) == CALL_EXPR
9691 && TREE_CODE (TREE_OPERAND (call, 0)) == ADDR_EXPR
9692 && TREE_OPERAND (TREE_OPERAND (call, 0), 0)
9693 == soft_initclass_node)
9694 return TREE_OPERAND (op1, 1);
9695 }
2f11d407
TT		 9696 else if (JDECL_P (op1))
9697 return op1;
e28cd97b
APB		 9698 }
9699 return node;
9700}
9701
e04a16fb
AG		 9702/* 6.5.5.2: Qualified Expression Names */
9703
9704static int
0a2f0c54
KG		 9705resolve_qualified_expression_name (tree wfl, tree *found_decl,
9706 tree *where_found, tree *type_found)
e04a16fb
AG		 9707{
9708 int from_type = 0; /* Field search initiated from a type */
c2952b01 9709 int from_super = 0, from_cast = 0, from_qualified_this = 0;
e04a16fb
AG		 9710 int previous_call_static = 0;
9711 int is_static;
9712 tree decl = NULL_TREE, type = NULL_TREE, q;
c2952b01 9713 /* For certain for of inner class instantiation */
e35b68b0 9714 tree saved_current, saved_this;
c2952b01
APB		 9715#define RESTORE_THIS_AND_CURRENT_CLASS \
9716 { current_class = saved_current; current_this = saved_this;}
9717
c877974e 9718 *type_found = *where_found = NULL_TREE;
e04a16fb
AG		 9719
9720 for (q = EXPR_WFL_QUALIFICATION (wfl); q; q = TREE_CHAIN (q))
9721 {
9722 tree qual_wfl = QUAL_WFL (q);
7705e9db 9723 tree ret_decl; /* for EH checking */
9ec819d4
PB		 9724#ifdef USE_MAPPED_LOCATION
9725 source_location location; /* for EH checking */
9726#else
7705e9db 9727 int location; /* for EH checking */
9ec819d4 9728#endif
e04a16fb
AG		 9729
9730 /* 15.10.1 Field Access Using a Primary */
e04a16fb
AG		 9731 switch (TREE_CODE (qual_wfl))
9732 {
9733 case CALL_EXPR:
b67d701b 9734 case NEW_CLASS_EXPR:
e04a16fb
AG		 9735 /* If the access to the function call is a non static field,
9736 build the code to access it. */
34f4db93 9737 if (JDECL_P (decl) && !FIELD_STATIC (decl))
e04a16fb 9738 {
e35b68b0 9739 decl = maybe_access_field (decl, *where_found,
ac825856 9740 DECL_CONTEXT (decl));
e04a16fb
AG		 9741 if (decl == error_mark_node)
9742 return 1;
9743 }
c2952b01 9744
e04a16fb
AG		 9745 /* And code for the function call */
9746 if (complete_function_arguments (qual_wfl))
9747 return 1;
c2952b01
APB		 9748
9749 /* We might have to setup a new current class and a new this
9750 for the search of an inner class, relative to the type of
9751 a expression resolved as `decl'. The current values are
9752 saved and restored shortly after */
9753 saved_current = current_class;
9754 saved_this = current_this;
e35b68b0 9755 if (decl
dba41d30
APB		 9756 && (TREE_CODE (qual_wfl) == NEW_CLASS_EXPR
9757 || from_qualified_this))
c2952b01 9758 {
dba41d30
APB		 9759 /* If we still have `from_qualified_this', we have the form
9760 <T>.this.f() and we need to build <T>.this */
9761 if (from_qualified_this)
9762 {
9763 decl = build_access_to_thisn (current_class, type, 0);
9764 decl = java_complete_tree (decl);
9765 type = TREE_TYPE (TREE_TYPE (decl));
9766 }
c2952b01
APB		 9767 current_class = type;
9768 current_this = decl;
dba41d30 9769 from_qualified_this = 0;
c2952b01
APB		 9770 }
9771
89e09b9a
PB		 9772 if (from_super && TREE_CODE (qual_wfl) == CALL_EXPR)
9773 CALL_USING_SUPER (qual_wfl) = 1;
9ec819d4
PB		 9774#ifdef USE_MAPPED_LOCATION
9775 location = (TREE_CODE (qual_wfl) == CALL_EXPR
9776 ? EXPR_LOCATION (TREE_OPERAND (qual_wfl, 0))
9777 : UNKNOWN_LOCATION);
9778#else
7705e9db
APB		 9779 location = (TREE_CODE (qual_wfl) == CALL_EXPR ?
9780 EXPR_WFL_LINECOL (TREE_OPERAND (qual_wfl, 0)) : 0);
9ec819d4 9781#endif
e101152f
APB		 9782 *where_found = patch_method_invocation (qual_wfl, decl, type,
9783 from_super,
7705e9db 9784 &is_static, &ret_decl);
0b055ea1 9785 from_super = 0;
e04a16fb 9786 if (*where_found == error_mark_node)
c2952b01
APB		 9787 {
9788 RESTORE_THIS_AND_CURRENT_CLASS;
9789 return 1;
9790 }
e04a16fb
AG		 9791 *type_found = type = QUAL_DECL_TYPE (*where_found);
9792
c1ddb5c8
AH		 9793 *where_found = force_evaluation_order (*where_found);
9794
c2952b01
APB		 9795 /* If we're creating an inner class instance, check for that
9796 an enclosing instance is in scope */
9797 if (TREE_CODE (qual_wfl) == NEW_CLASS_EXPR
165f37bc 9798 && INNER_ENCLOSING_SCOPE_CHECK (type))
c2952b01 9799 {
e35b68b0 9800 parse_error_context
165f37bc
APB		 9801 (qual_wfl, "No enclosing instance for inner class `%s' is in scope%s",
9802 lang_printable_name (type, 0),
9803 (!current_this ? "" :
9804 "; an explicit one must be provided when creating this inner class"));
c2952b01
APB		 9805 RESTORE_THIS_AND_CURRENT_CLASS;
9806 return 1;
9807 }
9808
9809 /* In case we had to change then to resolve a inner class
9810 instantiation using a primary qualified by a `new' */
9811 RESTORE_THIS_AND_CURRENT_CLASS;
9812
9ec819d4
PB		 9813#ifdef USE_MAPPED_LOCATION
9814 if (location != UNKNOWN_LOCATION)
9815#else
9bcdf735 9816 if (location)
9ec819d4 9817#endif
90281aec
TT		 9818 {
9819 tree arguments = NULL_TREE;
9820 if (TREE_CODE (qual_wfl) == CALL_EXPR
9821 && TREE_OPERAND (qual_wfl, 1) != NULL_TREE)
9822 arguments = TREE_VALUE (TREE_OPERAND (qual_wfl, 1));
9823 check_thrown_exceptions (location, ret_decl, arguments);
9824 }
7705e9db 9825
e04a16fb
AG		 9826 /* If the previous call was static and this one is too,
9827 build a compound expression to hold the two (because in
9828 that case, previous function calls aren't transported as
9829 forcoming function's argument. */
9830 if (previous_call_static && is_static)
9831 {
90424847
TT		 9832 /* We must set CAN_COMPLETE_NORMALLY for the first call
9833 since it is done nowhere else. */
9834 CAN_COMPLETE_NORMALLY (decl) = 1;
dc6d7095
RS		 9835 decl = build2 (COMPOUND_EXPR, TREE_TYPE (*where_found),
9836 decl, *where_found);
e04a16fb
AG		 9837 TREE_SIDE_EFFECTS (decl) = 1;
9838 }
9839 else
9840 {
9841 previous_call_static = is_static;
9842 decl = *where_found;
9843 }
c2952b01 9844 from_type = 0;
e04a16fb
AG		 9845 continue;
9846
d8fccff5 9847 case NEW_ARRAY_EXPR:
c2952b01 9848 case NEW_ANONYMOUS_ARRAY_EXPR:
d8fccff5
APB		 9849 *where_found = decl = java_complete_tree (qual_wfl);
9850 if (decl == error_mark_node)
9851 return 1;
9852 *type_found = type = QUAL_DECL_TYPE (decl);
d8fccff5
APB		 9853 continue;
9854
e04a16fb
AG		 9855 case CONVERT_EXPR:
9856 *where_found = decl = java_complete_tree (qual_wfl);
9857 if (decl == error_mark_node)
9858 return 1;
9859 *type_found = type = QUAL_DECL_TYPE (decl);
9860 from_cast = 1;
9861 continue;
9862
22eed1e6 9863 case CONDITIONAL_EXPR:
5e942c50 9864 case STRING_CST:
ac22f9cb 9865 case MODIFY_EXPR:
22eed1e6
APB		 9866 *where_found = decl = java_complete_tree (qual_wfl);
9867 if (decl == error_mark_node)
9868 return 1;
9869 *type_found = type = QUAL_DECL_TYPE (decl);
9870 continue;
9871
e04a16fb
AG		 9872 case ARRAY_REF:
9873 /* If the access to the function call is a non static field,
9874 build the code to access it. */
34f4db93 9875 if (JDECL_P (decl) && !FIELD_STATIC (decl))
e04a16fb
AG		 9876 {
9877 decl = maybe_access_field (decl, *where_found, type);
9878 if (decl == error_mark_node)
9879 return 1;
9880 }
9881 /* And code for the array reference expression */
9882 decl = java_complete_tree (qual_wfl);
9883 if (decl == error_mark_node)
9884 return 1;
9885 type = QUAL_DECL_TYPE (decl);
9886 continue;
0a2138e2 9887
37feda7d
APB		 9888 case PLUS_EXPR:
9889 if ((decl = java_complete_tree (qual_wfl)) == error_mark_node)
9890 return 1;
9891 if ((type = patch_string (decl)))
9892 decl = type;
9893 *where_found = QUAL_RESOLUTION (q) = decl;
9894 *type_found = type = TREE_TYPE (decl);
9895 break;
9896
165f37bc
APB		 9897 case CLASS_LITERAL:
9898 if ((decl = java_complete_tree (qual_wfl)) == error_mark_node)
9899 return 1;
9900 *where_found = QUAL_RESOLUTION (q) = decl;
9901 *type_found = type = TREE_TYPE (decl);
9902 break;
9903
0a2138e2
APB		 9904 default:
9905 /* Fix for -Wall Just go to the next statement. Don't
9906 continue */
a3f406ce 9907 break;
e04a16fb
AG		 9908 }
9909
9910 /* If we fall here, we weren't processing a (static) function call. */
9911 previous_call_static = 0;
9912
9913 /* It can be the keyword THIS */
19559012
APB		 9914 if (TREE_CODE (qual_wfl) == EXPR_WITH_FILE_LOCATION
9915 && EXPR_WFL_NODE (qual_wfl) == this_identifier_node)
e04a16fb
AG		 9916 {
9917 if (!current_this)
9918 {
e35b68b0 9919 parse_error_context
e04a16fb
AG		 9920 (wfl, "Keyword `this' used outside allowed context");
9921 return 1;
9922 }
7e1376a1
BM		 9923 if (ctxp->explicit_constructor_p
9924 && type == current_class)
f63991a8 9925 {
781b0558 9926 parse_error_context (wfl, "Can't reference `this' before the superclass constructor has been called");
f63991a8
APB		 9927 return 1;
9928 }
a83f01f0 9929 /* We have to generate code for intermediate access */
c2952b01
APB		 9930 if (!from_type || TREE_TYPE (TREE_TYPE (current_this)) == type)
9931 {
9932 *where_found = decl = current_this;
9933 *type_found = type = QUAL_DECL_TYPE (decl);
9934 }
4dbf4496
APB		 9935 /* We're trying to access the this from somewhere else. Make sure
9936 it's allowed before doing so. */
c2952b01
APB		 9937 else
9938 {
4dbf4496
APB		 9939 if (!enclosing_context_p (type, current_class))
9940 {
9941 char *p = xstrdup (lang_printable_name (type, 0));
e35b68b0
AD		 9942 parse_error_context (qual_wfl, "Can't use variable `%s.this': type `%s' isn't an outer type of type `%s'",
9943 p, p,
4dbf4496
APB		 9944 lang_printable_name (current_class, 0));
9945 free (p);
9946 return 1;
9947 }
c2952b01 9948 from_qualified_this = 1;
dba41d30
APB		 9949 /* If there's nothing else after that, we need to
9950 produce something now, otherwise, the section of the
9951 code that needs to produce <T>.this will generate
9952 what is necessary. */
9953 if (!TREE_CHAIN (q))
9954 {
9955 decl = build_access_to_thisn (current_class, type, 0);
9956 *where_found = decl = java_complete_tree (decl);
9957 *type_found = type = TREE_TYPE (decl);
9958 }
c2952b01
APB		 9959 }
9960
9961 from_type = 0;
e04a16fb
AG		 9962 continue;
9963 }
9964
9965 /* 15.10.2 Accessing Superclass Members using SUPER */
19559012
APB		 9966 if (TREE_CODE (qual_wfl) == EXPR_WITH_FILE_LOCATION
9967 && EXPR_WFL_NODE (qual_wfl) == super_identifier_node)
e04a16fb
AG		 9968 {
9969 tree node;
9970 /* Check on the restricted use of SUPER */
9971 if (METHOD_STATIC (current_function_decl)
9972 || current_class == object_type_node)
9973 {
e35b68b0 9974 parse_error_context
e04a16fb
AG		 9975 (wfl, "Keyword `super' used outside allowed context");
9976 return 1;
9977 }
9978 /* Otherwise, treat SUPER as (SUPER_CLASS)THIS */
e35b68b0 9979 node = build_cast (EXPR_WFL_LINECOL (qual_wfl),
e04a16fb
AG		 9980 CLASSTYPE_SUPER (current_class),
9981 build_this (EXPR_WFL_LINECOL (qual_wfl)));
9982 *where_found = decl = java_complete_tree (node);
22eed1e6
APB		 9983 if (decl == error_mark_node)
9984 return 1;
e04a16fb
AG		 9985 *type_found = type = QUAL_DECL_TYPE (decl);
9986 from_super = from_type = 1;
9987 continue;
9988 }
9989
9990 /* 15.13.1: Can't search for field name in packages, so we
9991 assume a variable/class name was meant. */
9992 if (RESOLVE_PACKAGE_NAME_P (qual_wfl))
9993 {
2f418289
BM		 9994 tree name;
9995 if ((decl = resolve_package (wfl, &q, &name)))
5e942c50 9996 {
c2952b01 9997 tree list;
2f418289
BM		 9998 *where_found = decl;
9999
7cef5027 10000 check_pkg_class_access (DECL_NAME (decl), qual_wfl, true, NULL);
8ae6595c 10001
6b48deee 10002 /* We want to be absolutely sure that the class is laid
5e942c50
APB		 10003 out. We're going to search something inside it. */
10004 *type_found = type = TREE_TYPE (decl);
10005 layout_class (type);
10006 from_type = 1;
c2952b01 10007
dde1da72
APB		 10008 /* Fix them all the way down, if any are left. */
10009 if (q)
c2952b01 10010 {
dde1da72
APB		 10011 list = TREE_CHAIN (q);
10012 while (list)
10013 {
dde1da72
APB		 10014 RESOLVE_PACKAGE_NAME_P (QUAL_WFL (list)) = 0;
10015 list = TREE_CHAIN (list);
10016 }
c2952b01 10017 }
5e942c50 10018 }
e04a16fb 10019 else
5e942c50
APB		 10020 {
10021 if (from_super || from_cast)
e35b68b0 10022 parse_error_context
5e942c50
APB		 10023 ((from_cast ? qual_wfl : wfl),
10024 "No variable `%s' defined in class `%s'",
10025 IDENTIFIER_POINTER (EXPR_WFL_NODE (qual_wfl)),
10026 lang_printable_name (type, 0));
10027 else
10028 parse_error_context
10029 (qual_wfl, "Undefined variable or class name: `%s'",
2f418289 10030 IDENTIFIER_POINTER (name));
5e942c50
APB		 10031 return 1;
10032 }
e04a16fb
AG		 10033 }
10034
10035 /* We have a type name. It's been already resolved when the
10036 expression was qualified. */
1ca09b48 10037 else if (RESOLVE_TYPE_NAME_P (qual_wfl) && QUAL_RESOLUTION (q))
e04a16fb 10038 {
1ca09b48 10039 decl = QUAL_RESOLUTION (q);
e04a16fb 10040
c2952b01 10041 /* Sneak preview. If next we see a `new', we're facing a
8ae6595c
RM		 10042 qualification which resulted in a type being selected
10043 instead of a field. Report the error. */
e35b68b0 10044 if(TREE_CHAIN (q)
c2952b01
APB		 10045 && TREE_CODE (TREE_PURPOSE (TREE_CHAIN (q))) == NEW_CLASS_EXPR)
10046 {
10047 parse_error_context (qual_wfl, "Undefined variable `%s'",
10048 IDENTIFIER_POINTER (EXPR_WFL_NODE (wfl)));
10049 return 1;
10050 }
10051
7cef5027 10052 check_pkg_class_access (DECL_NAME (decl), qual_wfl, true, NULL);
8ae6595c 10053
5e942c50 10054 check_deprecation (qual_wfl, decl);
c2952b01 10055
e04a16fb
AG		 10056 type = TREE_TYPE (decl);
10057 from_type = 1;
10058 }
1ca09b48 10059 /* We resolve an expression name */
e35b68b0 10060 else
e04a16fb 10061 {
cd531a2e 10062 tree field_decl = NULL_TREE;
e04a16fb
AG		 10063
10064 /* If there exists an early resolution, use it. That occurs
10065 only once and we know that there are more things to
10066 come. Don't do that when processing something after SUPER
10067 (we need more thing to be put in place below */
10068 if (!from_super && QUAL_RESOLUTION (q))
b67d701b
PB		 10069 {
10070 decl = QUAL_RESOLUTION (q);
c877974e 10071 if (!type)
5e942c50 10072 {
7f10c2e2
APB		 10073 if (TREE_CODE (decl) == FIELD_DECL && !FIELD_STATIC (decl))
10074 {
10075 if (current_this)
10076 *where_found = current_this;
10077 else
10078 {
10079 static_ref_err (qual_wfl, DECL_NAME (decl),
10080 current_class);
10081 return 1;
10082 }
f0f3a777
APB		 10083 if (outer_field_access_p (current_class, decl))
10084 decl = build_outer_field_access (qual_wfl, decl);
7f10c2e2 10085 }
c877974e
APB		 10086 else
10087 {
10088 *where_found = TREE_TYPE (decl);
10089 if (TREE_CODE (*where_found) == POINTER_TYPE)
10090 *where_found = TREE_TYPE (*where_found);
10091 }
5e942c50 10092 }
b67d701b 10093 }
e04a16fb 10094
67264b4f 10095 /* Report and error if we're using a numerical literal as a
1ca09b48
APB		 10096 qualifier. It can only be an INTEGER_CST. */
10097 else if (TREE_CODE (qual_wfl) == INTEGER_CST)
10098 {
10099 parse_error_context
10100 (wfl, "Can't use type `%s' as a qualifier",
10101 lang_printable_name (TREE_TYPE (qual_wfl), 0));
10102 return 1;
10103 }
10104
e04a16fb
AG		 10105 /* We have to search for a field, knowing the type of its
10106 container. The flag FROM_TYPE indicates that we resolved
10107 the last member of the expression as a type name, which
5e942c50
APB		 10108 means that for the resolution of this field, we'll look
10109 for other errors than if it was resolved as a member of
10110 an other field. */
e04a16fb
AG		 10111 else
10112 {
10113 int is_static;
5e942c50
APB		 10114 tree field_decl_type; /* For layout */
10115
e04a16fb
AG		 10116 if (!from_type && !JREFERENCE_TYPE_P (type))
10117 {
e35b68b0 10118 parse_error_context
e04a16fb
AG		 10119 (qual_wfl, "Attempt to reference field `%s' in `%s %s'",
10120 IDENTIFIER_POINTER (EXPR_WFL_NODE (qual_wfl)),
0a2138e2 10121 lang_printable_name (type, 0),
caaabaa1 10122 IDENTIFIER_POINTER (DECL_NAME (decl)));
e04a16fb
AG		 10123 return 1;
10124 }
e35b68b0 10125
dc0b3eff
PB		 10126 field_decl = lookup_field_wrapper (type,
10127 EXPR_WFL_NODE (qual_wfl));
4dbf4496 10128
863cd85a
APB		 10129 /* Maybe what we're trying to access to is an inner
10130 class, only if decl is a TYPE_DECL. */
10131 if (!field_decl && TREE_CODE (decl) == TYPE_DECL)
4dbf4496
APB		 10132 {
10133 tree ptr, inner_decl;
10134
10135 BUILD_PTR_FROM_NAME (ptr, EXPR_WFL_NODE (qual_wfl));
10136 inner_decl = resolve_class (decl, ptr, NULL_TREE, qual_wfl);
10137 if (inner_decl)
10138 {
e35b68b0 10139 check_inner_class_access (inner_decl, decl, qual_wfl);
4dbf4496
APB		 10140 type = TREE_TYPE (inner_decl);
10141 decl = inner_decl;
10142 from_type = 1;
10143 continue;
10144 }
10145 }
10146
dc0b3eff 10147 if (field_decl == NULL_TREE)
e04a16fb 10148 {
e35b68b0 10149 parse_error_context
2aa11e97 10150 (qual_wfl, "No variable `%s' defined in type `%s'",
e35b68b0 10151 IDENTIFIER_POINTER (EXPR_WFL_NODE (qual_wfl)),
2aa11e97 10152 GET_TYPE_NAME (type));
e04a16fb
AG		 10153 return 1;
10154 }
dc0b3eff
PB		 10155 if (field_decl == error_mark_node)
10156 return 1;
5e942c50
APB		 10157
10158 /* Layout the type of field_decl, since we may need
c877974e
APB		 10159 it. Don't do primitive types or loaded classes. The
10160 situation of non primitive arrays may not handled
10161 properly here. FIXME */
5e942c50
APB		 10162 if (TREE_CODE (TREE_TYPE (field_decl)) == POINTER_TYPE)
10163 field_decl_type = TREE_TYPE (TREE_TYPE (field_decl));
10164 else
10165 field_decl_type = TREE_TYPE (field_decl);
e35b68b0 10166 if (!JPRIMITIVE_TYPE_P (field_decl_type)
c877974e
APB		 10167 && !CLASS_LOADED_P (field_decl_type)
10168 && !TYPE_ARRAY_P (field_decl_type))
10169 resolve_and_layout (field_decl_type, NULL_TREE);
e35b68b0 10170
e04a16fb 10171 /* Check on accessibility here */
e101152f 10172 if (not_accessible_p (current_class, field_decl,
d3ecb597 10173 *type_found, from_super))
cd11bdcc 10174 return not_accessible_field_error (qual_wfl,field_decl);
5e942c50 10175 check_deprecation (qual_wfl, field_decl);
e35b68b0 10176
e04a16fb
AG		 10177 /* There are things to check when fields are accessed
10178 from type. There are no restrictions on a static
10179 declaration of the field when it is accessed from an
10180 interface */
10181 is_static = FIELD_STATIC (field_decl);
e35b68b0
AD		 10182 if (!from_super && from_type
10183 && !TYPE_INTERFACE_P (type)
10184 && !is_static
10185 && (current_function_decl
c2952b01 10186 && METHOD_STATIC (current_function_decl)))
e04a16fb 10187 {
7f10c2e2 10188 static_ref_err (qual_wfl, EXPR_WFL_NODE (qual_wfl), type);
e04a16fb
AG		 10189 return 1;
10190 }
10191 from_cast = from_super = 0;
10192
c2952b01
APB		 10193 /* It's an access from a type but it isn't static, we
10194 make it relative to `this'. */
10195 if (!is_static && from_type)
10196 decl = current_this;
10197
5e942c50
APB		 10198 /* If we need to generate something to get a proper
10199 handle on what this field is accessed from, do it
10200 now. */
e04a16fb
AG		 10201 if (!is_static)
10202 {
c583dd46 10203 decl = maybe_access_field (decl, *where_found, *type_found);
e04a16fb
AG		 10204 if (decl == error_mark_node)
10205 return 1;
10206 }
10207
10208 /* We want to keep the location were found it, and the type
10209 we found. */
10210 *where_found = decl;
10211 *type_found = type;
10212
c2952b01
APB		 10213 /* Generate the correct expression for field access from
10214 qualified this */
10215 if (from_qualified_this)
10216 {
10217 field_decl = build_outer_field_access (qual_wfl, field_decl);
10218 from_qualified_this = 0;
10219 }
10220
e04a16fb
AG		 10221 /* This is the decl found and eventually the next one to
10222 search from */
10223 decl = field_decl;
10224 }
e04a16fb
AG		 10225 from_type = 0;
10226 type = QUAL_DECL_TYPE (decl);
c2952b01
APB		 10227
10228 /* Sneak preview. If decl is qualified by a `new', report
10229 the error here to be accurate on the peculiar construct */
e35b68b0 10230 if (TREE_CHAIN (q)
c2952b01
APB		 10231 && TREE_CODE (TREE_PURPOSE (TREE_CHAIN (q))) == NEW_CLASS_EXPR
10232 && !JREFERENCE_TYPE_P (type))
10233 {
e35b68b0 10234 parse_error_context (qual_wfl, "Attempt to reference field `new' in a `%s'",
c2952b01
APB		 10235 lang_printable_name (type, 0));
10236 return 1;
10237 }
e04a16fb 10238 }
dde1da72
APB		 10239 /* `q' might have changed due to a after package resolution
10240 re-qualification */
10241 if (!q)
10242 break;
e04a16fb
AG		 10243 }
10244 *found_decl = decl;
10245 return 0;
10246}
10247
10248/* 6.6 Qualified name and access control. Returns 1 if MEMBER (a decl)
e101152f
APB		 10249 can't be accessed from REFERENCE (a record type). If MEMBER
10250 features a protected access, we then use WHERE which, if non null,
10251 holds the type of MEMBER's access that is checked against
10252 6.6.2.1. This function should be used when decl is a field or a
10253 method. */
e04a16fb 10254
be245ac0 10255static int
0a2f0c54 10256not_accessible_p (tree reference, tree member, tree where, int from_super)
e04a16fb
AG		 10257{
10258 int access_flag = get_access_flags_from_decl (member);
d3ecb597
BM		 10259 bool is_static = false;
10260
10261 if (TREE_CODE (member) == FIELD_DECL ||
10262 TREE_CODE (member) == VAR_DECL)
10263 is_static = FIELD_STATIC (member);
10264 else
10265 is_static = METHOD_STATIC (member);
4dbf4496 10266
e04a16fb
AG		 10267 /* Access always granted for members declared public */
10268 if (access_flag & ACC_PUBLIC)
10269 return 0;
e35b68b0 10270
e04a16fb
AG		 10271 /* Check access on protected members */
10272 if (access_flag & ACC_PROTECTED)
10273 {
10274 /* Access granted if it occurs from within the package
10275 containing the class in which the protected member is
10276 declared */
10277 if (class_in_current_package (DECL_CONTEXT (member)))
10278 return 0;
10279
9bbc7d9f
PB		 10280 /* If accessed with the form `super.member', then access is granted */
10281 if (from_super)
10282 return 0;
e04a16fb 10283
d3ecb597
BM		 10284 /* If WHERE is active, access was made through a qualifier. For
10285 non-static members, access is granted if the type of the qualifier
10286 is or is a sublass of the type the access is made from (6.6.2.1.) */
10287 if (where && !is_static)
4dbf4496 10288 {
d3ecb597 10289 while (reference)
4dbf4496 10290 {
d3ecb597
BM		 10291 if (inherits_from_p (where, reference))
10292 return 0;
2fc8ee77 10293 if (INNER_CLASS_TYPE_P (reference))
d3ecb597
BM		 10294 reference = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (reference)));
10295 else
10296 break;
10297 }
10298 return 1;
10299 }
10300
10301 /* Otherwise, access is granted if occurring from within the class
10302 where member is declared, or a subclass of it. */
10303 while (reference)
10304 {
10305 if (inherits_from_p (reference, DECL_CONTEXT (member)))
10306 return 0;
2fc8ee77 10307 if (INNER_CLASS_TYPE_P (reference))
d3ecb597
BM		 10308 reference = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (reference)));
10309 else
10310 break;
4dbf4496 10311 }
e04a16fb
AG		 10312 return 1;
10313 }
10314
10315 /* Check access on private members. Access is granted only if it
761491c8
APB		 10316 occurs from within the class in which it is declared -- that does
10317 it for innerclasses too. */
e04a16fb 10318 if (access_flag & ACC_PRIVATE)
761491c8 10319 {
d3ecb597
BM		 10320 if (reference == DECL_CONTEXT (member) ||
10321 common_enclosing_context_p (DECL_CONTEXT (member), reference))
761491c8
APB		 10322 return 0;
10323 return 1;
10324 }
e04a16fb 10325
8ae6595c
RM		 10326 /* Default access is permitted only when occurring from within the
10327 package in which the context (MEMBER) is declared. */
10328 return !class_in_current_package (DECL_CONTEXT (member));
e04a16fb
AG		 10329}
10330
5e942c50
APB		 10331/* Test deprecated decl access. */
10332static void
0a2f0c54 10333check_deprecation (tree wfl, tree decl)
5e942c50 10334{
f94ae540
TT		 10335 const char *file;
10336 tree elt;
10337
bbefea96 10338 if (! warn_deprecated)
f94ae540
TT		 10339 return;
10340
10341 /* We want to look at the element type of arrays here, so we strip
10342 all surrounding array types. */
10343 if (TYPE_ARRAY_P (TREE_TYPE (decl)))
10344 {
10345 elt = TREE_TYPE (decl);
10346 while (TYPE_ARRAY_P (elt))
10347 elt = TYPE_ARRAY_ELEMENT (elt);
10348 /* We'll end up with a pointer type, so we use TREE_TYPE to go
10349 to the record. */
10350 decl = TYPE_NAME (TREE_TYPE (elt));
10351 }
f31686a3 10352 file = DECL_SOURCE_FILE (decl);
f94ae540 10353
5e942c50
APB		 10354 /* Complain if the field is deprecated and the file it was defined
10355 in isn't compiled at the same time the file which contains its
10356 use is */
e35b68b0 10357 if (DECL_DEPRECATED (decl)
5e942c50
APB		 10358 && !IS_A_COMMAND_LINE_FILENAME_P (get_identifier (file)))
10359 {
f94ae540 10360 const char *the;
5e942c50
APB		 10361 switch (TREE_CODE (decl))
10362 {
10363 case FUNCTION_DECL:
f94ae540 10364 the = "method";
5e942c50
APB		 10365 break;
10366 case FIELD_DECL:
7b02957e 10367 case VAR_DECL:
f94ae540 10368 the = "field";
5e942c50
APB		 10369 break;
10370 case TYPE_DECL:
7b02957e
APB		 10371 parse_warning_context (wfl, "The class `%s' has been deprecated",
10372 IDENTIFIER_POINTER (DECL_NAME (decl)));
10373 return;
15fdcfe9 10374 default:
400500c4 10375 abort ();
5e942c50 10376 }
7b02957e
APB		 10377 /* Don't issue a message if the context as been deprecated as a
10378 whole. */
10379 if (! CLASS_DEPRECATED (TYPE_NAME (DECL_CONTEXT (decl))))
e35b68b0
AD		 10380 parse_warning_context
10381 (wfl, "The %s `%s' in class `%s' has been deprecated",
7b02957e
APB		 10382 the, lang_printable_name (decl, 0),
10383 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (DECL_CONTEXT (decl)))));
5e942c50
APB		 10384 }
10385}
10386
e04a16fb
AG		 10387/* Returns 1 if class was declared in the current package, 0 otherwise */
10388
e2500fed 10389static GTY(()) tree cicp_cache;
e04a16fb 10390static int
0a2f0c54 10391class_in_current_package (tree class)
e04a16fb 10392{
e04a16fb
AG		 10393 int qualified_flag;
10394 tree left;
10395
e2500fed 10396 if (cicp_cache == class)
e04a16fb
AG		 10397 return 1;
10398
10399 qualified_flag = QUALIFIED_P (DECL_NAME (TYPE_NAME (class)));
10400
10401 /* If the current package is empty and the name of CLASS is
10402 qualified, class isn't in the current package. If there is a
10403 current package and the name of the CLASS is not qualified, class
10404 isn't in the current package */
0a2138e2 10405 if ((!ctxp->package && qualified_flag) || (ctxp->package && !qualified_flag))
e04a16fb
AG		 10406 return 0;
10407
10408 /* If there is not package and the name of CLASS isn't qualified,
10409 they belong to the same unnamed package */
10410 if (!ctxp->package && !qualified_flag)
10411 return 1;
10412
10413 /* Compare the left part of the name of CLASS with the package name */
9c5fdae6 10414 split_qualified_name (&left, NULL, DECL_NAME (TYPE_NAME (class)));
e04a16fb
AG		 10415 if (ctxp->package == left)
10416 {
e2500fed 10417 cicp_cache = class;
e04a16fb
AG		 10418 return 1;
10419 }
10420 return 0;
10421}
10422
10423/* This function may generate code to access DECL from WHERE. This is
10424 done only if certain conditions meet. */
10425
10426static tree
0a2f0c54 10427maybe_access_field (tree decl, tree where, tree type)
e04a16fb 10428{
5e942c50
APB		 10429 if (TREE_CODE (decl) == FIELD_DECL && decl != current_this
10430 && !FIELD_STATIC (decl))
e35b68b0 10431 decl = build_field_ref (where ? where : current_this,
c583dd46
APB		 10432 (type ? type : DECL_CONTEXT (decl)),
10433 DECL_NAME (decl));
e04a16fb
AG		 10434 return decl;
10435}
10436
15fdcfe9 10437/* Build a method invocation, by patching PATCH. If non NULL
e04a16fb
AG		 10438 and according to the situation, PRIMARY and WHERE may be
10439 used. IS_STATIC is set to 1 if the invoked function is static. */
10440
10441static tree
0a2f0c54
KG		 10442patch_method_invocation (tree patch, tree primary, tree where, int from_super,
10443 int *is_static, tree *ret_decl)
e04a16fb
AG		 10444{
10445 tree wfl = TREE_OPERAND (patch, 0);
10446 tree args = TREE_OPERAND (patch, 1);
10447 tree name = EXPR_WFL_NODE (wfl);
5e942c50 10448 tree list;
22eed1e6 10449 int is_static_flag = 0;
89e09b9a 10450 int is_super_init = 0;
bccaf73a 10451 tree this_arg = NULL_TREE;
35ab11f0 10452 int is_array_clone_call = 0;
e35b68b0 10453
aecf4109 10454 /* Should be overridden if everything goes well. Otherwise, if
e04a16fb
AG		 10455 something fails, it should keep this value. It stop the
10456 evaluation of a bogus assignment. See java_complete_tree,
10457 MODIFY_EXPR: for the reasons why we sometimes want to keep on
10458 evaluating an assignment */
10459 TREE_TYPE (patch) = error_mark_node;
10460
10461 /* Since lookup functions are messing with line numbers, save the
10462 context now. */
10463 java_parser_context_save_global ();
10464
10465 /* 15.11.1: Compile-Time Step 1: Determine Class or Interface to Search */
10466
10467 /* Resolution of qualified name, excluding constructors */
10468 if (QUALIFIED_P (name) && !CALL_CONSTRUCTOR_P (patch))
10469 {
dde1da72 10470 tree identifier, identifier_wfl, type, resolved;
e04a16fb
AG		 10471 /* Extract the last IDENTIFIER of the qualified
10472 expression. This is a wfl and we will use it's location
10473 data during error report. */
10474 identifier_wfl = cut_identifier_in_qualified (wfl);
10475 identifier = EXPR_WFL_NODE (identifier_wfl);
e35b68b0 10476
e04a16fb
AG		 10477 /* Given the context, IDENTIFIER is syntactically qualified
10478 as a MethodName. We need to qualify what's before */
10479 qualify_ambiguous_name (wfl);
dde1da72 10480 resolved = resolve_field_access (wfl, NULL, NULL);
e04a16fb 10481
870a5b8a 10482 if (TREE_CODE (resolved) == VAR_DECL && FIELD_STATIC (resolved)
e35b68b0 10483 && FIELD_FINAL (resolved)
870a5b8a
APB		 10484 && !inherits_from_p (DECL_CONTEXT (resolved), current_class)
10485 && !flag_emit_class_files && !flag_emit_xref)
10486 resolved = build_class_init (DECL_CONTEXT (resolved), resolved);
10487
dde1da72
APB		 10488 if (resolved == error_mark_node)
10489 PATCH_METHOD_RETURN_ERROR ();
10490
10491 type = GET_SKIP_TYPE (resolved);
10492 resolve_and_layout (type, NULL_TREE);
e35b68b0 10493
6518c7b5
BM		 10494 if (JPRIMITIVE_TYPE_P (type))
10495 {
7e51098e
TT		 10496 parse_error_context
10497 (identifier_wfl,
10498 "Can't invoke a method on primitive type `%s'",
10499 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type))));
e35b68b0 10500 PATCH_METHOD_RETURN_ERROR ();
7e51098e
TT		 10501 }
10502
dde1da72
APB		 10503 list = lookup_method_invoke (0, identifier_wfl, type, identifier, args);
10504 args = nreverse (args);
2c56429a 10505
e04a16fb 10506 /* We're resolving a call from a type */
dde1da72 10507 if (TREE_CODE (resolved) == TYPE_DECL)
e04a16fb 10508 {
dde1da72 10509 if (CLASS_INTERFACE (resolved))
e04a16fb
AG		 10510 {
10511 parse_error_context
781b0558
KG		 10512 (identifier_wfl,
10513 "Can't make static reference to method `%s' in interface `%s'",
e35b68b0 10514 IDENTIFIER_POINTER (identifier),
e04a16fb 10515 IDENTIFIER_POINTER (name));
b9f7e36c 10516 PATCH_METHOD_RETURN_ERROR ();
e04a16fb 10517 }
e04a16fb
AG		 10518 if (list && !METHOD_STATIC (list))
10519 {
1b9deeb4 10520 char *fct_name = xstrdup (lang_printable_name (list, 2));
e35b68b0 10521 parse_error_context
e04a16fb
AG		 10522 (identifier_wfl,
10523 "Can't make static reference to method `%s %s' in class `%s'",
e35b68b0 10524 lang_printable_name (TREE_TYPE (TREE_TYPE (list)), 0),
0a2138e2 10525 fct_name, IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type))));
e04a16fb 10526 free (fct_name);
b9f7e36c 10527 PATCH_METHOD_RETURN_ERROR ();
e04a16fb
AG		 10528 }
10529 }
e04a16fb 10530 else
dde1da72 10531 this_arg = primary = resolved;
e35b68b0 10532
35ab11f0
BM		 10533 if (TYPE_ARRAY_P (type) && identifier == get_identifier ("clone"))
10534 is_array_clone_call = 1;
e35b68b0 10535
5e942c50 10536 /* IDENTIFIER_WFL will be used to report any problem further */
e04a16fb
AG		 10537 wfl = identifier_wfl;
10538 }
10539 /* Resolution of simple names, names generated after a primary: or
10540 constructors */
10541 else
10542 {
cd531a2e 10543 tree class_to_search = NULL_TREE;
c2952b01 10544 int lc; /* Looking for Constructor */
e35b68b0 10545
e04a16fb
AG		 10546 /* We search constructor in their target class */
10547 if (CALL_CONSTRUCTOR_P (patch))
10548 {
22eed1e6
APB		 10549 if (TREE_CODE (patch) == NEW_CLASS_EXPR)
10550 class_to_search = EXPR_WFL_NODE (wfl);
e35b68b0 10551 else if (EXPR_WFL_NODE (TREE_OPERAND (patch, 0)) ==
22eed1e6
APB		 10552 this_identifier_node)
10553 class_to_search = NULL_TREE;
10554 else if (EXPR_WFL_NODE (TREE_OPERAND (patch, 0)) ==
10555 super_identifier_node)
e04a16fb 10556 {
89e09b9a 10557 is_super_init = 1;
22eed1e6 10558 if (CLASSTYPE_SUPER (current_class))
e35b68b0 10559 class_to_search =
22eed1e6
APB		 10560 DECL_NAME (TYPE_NAME (CLASSTYPE_SUPER (current_class)));
10561 else
10562 {
781b0558 10563 parse_error_context (wfl, "Can't invoke super constructor on java.lang.Object");
22eed1e6
APB		 10564 PATCH_METHOD_RETURN_ERROR ();
10565 }
e04a16fb 10566 }
22eed1e6
APB		 10567
10568 /* Class to search is NULL if we're searching the current one */
10569 if (class_to_search)
e04a16fb 10570 {
c2952b01
APB		 10571 class_to_search = resolve_and_layout (class_to_search, wfl);
10572
22eed1e6
APB		 10573 if (!class_to_search)
10574 {
e35b68b0 10575 parse_error_context
22eed1e6
APB		 10576 (wfl, "Class `%s' not found in type declaration",
10577 IDENTIFIER_POINTER (EXPR_WFL_NODE (wfl)));
10578 PATCH_METHOD_RETURN_ERROR ();
10579 }
e35b68b0 10580
5e942c50
APB		 10581 /* Can't instantiate an abstract class, but we can
10582 invoke it's constructor. It's use within the `new'
10583 context is denied here. */
e35b68b0 10584 if (CLASS_ABSTRACT (class_to_search)
5e942c50 10585 && TREE_CODE (patch) == NEW_CLASS_EXPR)
22eed1e6 10586 {
e35b68b0 10587 parse_error_context
781b0558
KG		 10588 (wfl, "Class `%s' is an abstract class. It can't be instantiated",
10589 IDENTIFIER_POINTER (EXPR_WFL_NODE (wfl)));
22eed1e6
APB		 10590 PATCH_METHOD_RETURN_ERROR ();
10591 }
c2952b01 10592
22eed1e6 10593 class_to_search = TREE_TYPE (class_to_search);
e04a16fb 10594 }
22eed1e6
APB		 10595 else
10596 class_to_search = current_class;
e04a16fb
AG		 10597 lc = 1;
10598 }
10599 /* This is a regular search in the local class, unless an
10600 alternate class is specified. */
10601 else
10602 {
56fe39c8
PB		 10603 if (where != NULL_TREE)
10604 class_to_search = where;
10605 else if (QUALIFIED_P (name))
10606 class_to_search = current_class;
10607 else
10608 {
10609 class_to_search = current_class;
10610
10611 for (;;)
10612 {
10613 if (has_method (class_to_search, name))
10614 break;
10615 if (! INNER_CLASS_TYPE_P (class_to_search))
10616 {
10617 parse_error_context (wfl,
10618 "No method named `%s' in scope",
10619 IDENTIFIER_POINTER (name));
10620 PATCH_METHOD_RETURN_ERROR ();
10621 }
10622 class_to_search
10623 = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (class_to_search)));
10624 }
10625 }
e04a16fb
AG		 10626 lc = 0;
10627 }
c2952b01 10628
e04a16fb
AG		 10629 /* NAME is a simple identifier or comes from a primary. Search
10630 in the class whose declaration contain the method being
10631 invoked. */
c877974e 10632 resolve_and_layout (class_to_search, NULL_TREE);
e04a16fb 10633
c2952b01 10634 list = lookup_method_invoke (lc, wfl, class_to_search, name, args);
e04a16fb
AG		 10635 /* Don't continue if no method were found, as the next statement
10636 can't be executed then. */
b9f7e36c
APB		 10637 if (!list)
10638 PATCH_METHOD_RETURN_ERROR ();
e35b68b0 10639
35ab11f0
BM		 10640 if (TYPE_ARRAY_P (class_to_search)
10641 && DECL_NAME (list) == get_identifier ("clone"))
10642 is_array_clone_call = 1;
e04a16fb
AG		 10643
10644 /* Check for static reference if non static methods */
e35b68b0 10645 if (check_for_static_method_reference (wfl, patch, list,
e04a16fb 10646 class_to_search, primary))
b9f7e36c 10647 PATCH_METHOD_RETURN_ERROR ();
e04a16fb 10648
165f37bc
APB		 10649 /* Check for inner classes creation from illegal contexts */
10650 if (lc && (INNER_CLASS_TYPE_P (class_to_search)
10651 && !CLASS_STATIC (TYPE_NAME (class_to_search)))
3fb5c0eb
APB		 10652 && INNER_ENCLOSING_SCOPE_CHECK (class_to_search)
10653 && !DECL_INIT_P (current_function_decl))
165f37bc 10654 {
e35b68b0 10655 parse_error_context
165f37bc
APB		 10656 (wfl, "No enclosing instance for inner class `%s' is in scope%s",
10657 lang_printable_name (class_to_search, 0),
10658 (!current_this ? "" :
10659 "; an explicit one must be provided when creating this inner class"));
10660 PATCH_METHOD_RETURN_ERROR ();
10661 }
10662
22eed1e6
APB		 10663 /* Non static methods are called with the current object extra
10664 argument. If patch a `new TYPE()', the argument is the value
10665 returned by the object allocator. If method is resolved as a
10666 primary, use the primary otherwise use the current THIS. */
b9f7e36c 10667 args = nreverse (args);
bccaf73a 10668 if (TREE_CODE (patch) != NEW_CLASS_EXPR)
c2952b01
APB		 10669 {
10670 this_arg = primary ? primary : current_this;
10671
10672 /* If we're using an access method, things are different.
67264b4f 10673 There are two family of cases:
c2952b01
APB		 10674
10675 1) We're not generating bytecodes:
10676
10677 - LIST is non static. It's invocation is transformed from
10678 x(a1,...,an) into this$<n>.x(a1,....an).
10679 - LIST is static. It's invocation is transformed from
10680 x(a1,...,an) into TYPE_OF(this$<n>).x(a1,....an)
10681
10682 2) We're generating bytecodes:
e35b68b0 10683
c2952b01
APB		 10684 - LIST is non static. It's invocation is transformed from
10685 x(a1,....,an) into access$<n>(this$<n>,a1,...,an).
10686 - LIST is static. It's invocation is transformed from
b6e3e1ff 10687 x(a1,....,an) into TYPE_OF(this$<n>).x(a1,....an).
c2952b01 10688
67264b4f 10689 Of course, this$<n> can be arbitrarily complex, ranging from
e35b68b0
AD		 10690 this$0 (the immediate outer context) to
10691 access$0(access$0(...(this$0))).
10692
ee142fe7 10693 maybe_use_access_method returns a nonzero value if the
dfb99c83 10694 this_arg has to be moved into the (then generated) stub
4dbf4496 10695 argument list. In the meantime, the selected function
dfb99c83 10696 might have be replaced by a generated stub. */
b6e3e1ff
APB		 10697 if (!primary &&
10698 maybe_use_access_method (is_super_init, &list, &this_arg))
2cb3951d
APB		 10699 {
10700 args = tree_cons (NULL_TREE, this_arg, args);
10701 this_arg = NULL_TREE; /* So it doesn't get chained twice */
10702 }
c2952b01 10703 }
e04a16fb 10704 }
b67d701b 10705
e04a16fb
AG		 10706 /* Merge point of all resolution schemes. If we have nothing, this
10707 is an error, already signaled */
e35b68b0 10708 if (!list)
b9f7e36c 10709 PATCH_METHOD_RETURN_ERROR ();
b67d701b 10710
e04a16fb
AG		 10711 /* Check accessibility, position the is_static flag, build and
10712 return the call */
e101152f 10713 if (not_accessible_p (DECL_CONTEXT (current_function_decl), list,
e35b68b0 10714 (primary ? TREE_TYPE (TREE_TYPE (primary)) :
35ab11f0
BM		 10715 NULL_TREE), from_super)
10716 /* Calls to clone() on array types are permitted as a special-case. */
10717 && !is_array_clone_call)
e101152f 10718 {
83182544
KG		 10719 const char *const fct_name = IDENTIFIER_POINTER (DECL_NAME (list));
10720 const char *const access =
8ae6595c 10721 accessibility_string (get_access_flags_from_decl (list));
83182544 10722 const char *const klass =
80122075 10723 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (DECL_CONTEXT (list))));
83182544 10724 const char *const refklass =
80122075 10725 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (current_class)));
83182544
KG		 10726 const char *const what = (DECL_CONSTRUCTOR_P (list)
10727 ? "constructor" : "method");
e101152f
APB		 10728 parse_error_context (wfl,
10729 "Can't access %s %s `%s.%s' from `%s'",
10730 access, what, klass, fct_name, refklass);
b9f7e36c 10731 PATCH_METHOD_RETURN_ERROR ();
e04a16fb 10732 }
7b02957e
APB		 10733
10734 /* Deprecation check: check whether the method being invoked or the
f94ae540 10735 instance-being-created's type are deprecated. */
7b02957e
APB		 10736 if (TREE_CODE (patch) == NEW_CLASS_EXPR)
10737 check_deprecation (wfl, TYPE_NAME (DECL_CONTEXT (list)));
f94ae540 10738 check_deprecation (wfl, list);
22eed1e6 10739
c2952b01
APB		 10740 /* If invoking a innerclass constructor, there are hidden parameters
10741 to pass */
e35b68b0 10742 if (TREE_CODE (patch) == NEW_CLASS_EXPR
c2952b01
APB		 10743 && PURE_INNER_CLASS_TYPE_P (DECL_CONTEXT (list)))
10744 {
10745 /* And make sure we add the accessed local variables to be saved
10746 in field aliases. */
10747 args = build_alias_initializer_parameter_list
10748 (AIPL_FUNCTION_CTOR_INVOCATION, DECL_CONTEXT (list), args, NULL);
10749
da632f2c 10750 /* Secretly pass the current_this/primary as a second argument */
165f37bc 10751 if (primary || current_this)
f8b93ea7
APB		 10752 {
10753 tree extra_arg;
10754 tree this_type = (current_this ?
10755 TREE_TYPE (TREE_TYPE (current_this)) : NULL_TREE);
10756 /* Method's (list) enclosing context */
10757 tree mec = DECL_CONTEXT (TYPE_NAME (DECL_CONTEXT (list)));
10758 /* If we have a primary, use it. */
10759 if (primary)
10760 extra_arg = primary;
10761 /* The current `this' is an inner class but isn't a direct
10762 enclosing context for the inner class we're trying to
10763 create. Build an access to the proper enclosing context
10764 and use it. */
10765 else if (current_this && PURE_INNER_CLASS_TYPE_P (this_type)
10766 && this_type != TREE_TYPE (mec))
10767 {
10768
10769 extra_arg = build_access_to_thisn (current_class,
10770 TREE_TYPE (mec), 0);
10771 extra_arg = java_complete_tree (extra_arg);
10772 }
10773 /* Otherwise, just use the current `this' as an enclosing
10774 context. */
10775 else
10776 extra_arg = current_this;
10777 args = tree_cons (NULL_TREE, extra_arg, args);
10778 }
165f37bc
APB		 10779 else
10780 args = tree_cons (NULL_TREE, integer_zero_node, args);
c2952b01
APB		 10781 }
10782
152de068
APB		 10783 /* This handles the situation where a constructor invocation needs
10784 to have an enclosing context passed as a second parameter (the
10aa83c7 10785 constructor is one of an inner class). */
e35b68b0 10786 if ((is_super_init ||
2df37a59
APB		 10787 (TREE_CODE (patch) == CALL_EXPR && name == this_identifier_node))
10788 && PURE_INNER_CLASS_TYPE_P (DECL_CONTEXT (list)))
152de068 10789 {
10aa83c7 10790 tree dest = TYPE_NAME (DECL_CONTEXT (list));
e35b68b0 10791 tree extra_arg =
10aa83c7
BM		 10792 build_access_to_thisn (current_class, DECL_CONTEXT (dest), 0);
10793 extra_arg = java_complete_tree (extra_arg);
152de068
APB		 10794 args = tree_cons (NULL_TREE, extra_arg, args);
10795 }
10796
22eed1e6 10797 is_static_flag = METHOD_STATIC (list);
dba41d30 10798 if (! is_static_flag && this_arg != NULL_TREE)
bccaf73a 10799 args = tree_cons (NULL_TREE, this_arg, args);
22eed1e6 10800
c3f2a476
APB		 10801 /* In the context of an explicit constructor invocation, we can't
10802 invoke any method relying on `this'. Exceptions are: we're
10803 invoking a static function, primary exists and is not the current
10804 this, we're creating a new object. */
e35b68b0
AD		 10805 if (ctxp->explicit_constructor_p
10806 && !is_static_flag
c3f2a476
APB		 10807 && (!primary || primary == current_this)
10808 && (TREE_CODE (patch) != NEW_CLASS_EXPR))
22eed1e6 10809 {
781b0558 10810 parse_error_context (wfl, "Can't reference `this' before the superclass constructor has been called");
22eed1e6
APB		 10811 PATCH_METHOD_RETURN_ERROR ();
10812 }
e04a16fb 10813 java_parser_context_restore_global ();
e35b68b0 10814 if (is_static)
22eed1e6 10815 *is_static = is_static_flag;
b9f7e36c
APB		 10816 /* Sometimes, we want the decl of the selected method. Such as for
10817 EH checking */
10818 if (ret_decl)
10819 *ret_decl = list;
89e09b9a 10820 patch = patch_invoke (patch, list, args);
17126208
APB		 10821
10822 /* Now is a good time to insert the call to finit$ */
89e09b9a
PB		 10823 if (is_super_init && CLASS_HAS_FINIT_P (current_class))
10824 {
c2952b01 10825 tree finit_parms, finit_call;
e35b68b0 10826
c00f0fb2 10827 /* Prepare to pass hidden parameters to finit$, if any. */
e35b68b0 10828 finit_parms = build_alias_initializer_parameter_list
c2952b01 10829 (AIPL_FUNCTION_FINIT_INVOCATION, current_class, NULL_TREE, NULL);
e35b68b0
AD		 10830
10831 finit_call =
c2952b01
APB		 10832 build_method_invocation (build_wfl_node (finit_identifier_node),
10833 finit_parms);
10834
10835 /* Generate the code used to initialize fields declared with an
10836 initialization statement and build a compound statement along
10837 with the super constructor invocation. */
453c182f 10838 CAN_COMPLETE_NORMALLY (patch) = 1;
dc6d7095
RS		 10839 patch = build2 (COMPOUND_EXPR, void_type_node, patch,
10840 java_complete_tree (finit_call));
89e09b9a
PB		 10841 }
10842 return patch;
e04a16fb
AG		 10843}
10844
10845/* Check that we're not trying to do a static reference to a method in
10846 non static method. Return 1 if it's the case, 0 otherwise. */
10847
10848static int
0a2f0c54
KG		 10849check_for_static_method_reference (tree wfl, tree node, tree method,
10850 tree where, tree primary)
e04a16fb 10851{
e35b68b0 10852 if (METHOD_STATIC (current_function_decl)
e04a16fb
AG		 10853 && !METHOD_STATIC (method) && !primary && !CALL_CONSTRUCTOR_P (node))
10854 {
c2e3db92 10855 char *fct_name = xstrdup (lang_printable_name (method, 0));
e35b68b0
AD		 10856 parse_error_context
10857 (wfl, "Can't make static reference to method `%s %s' in class `%s'",
0a2138e2 10858 lang_printable_name (TREE_TYPE (TREE_TYPE (method)), 0), fct_name,
e04a16fb
AG		 10859 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (where))));
10860 free (fct_name);
10861 return 1;
10862 }
10863 return 0;
10864}
10865
c2952b01
APB		 10866/* Fix the invocation of *MDECL if necessary in the case of a
10867 invocation from an inner class. *THIS_ARG might be modified
10868 appropriately and an alternative access to *MDECL might be
10869 returned. */
10870
10871static int
0a2f0c54 10872maybe_use_access_method (int is_super_init, tree *mdecl, tree *this_arg)
c2952b01
APB		 10873{
10874 tree ctx;
10875 tree md = *mdecl, ta = *this_arg;
10876 int to_return = 0;
10877 int non_static_context = !METHOD_STATIC (md);
10878
e35b68b0 10879 if (is_super_init
165f37bc 10880 || DECL_CONTEXT (md) == current_class
e35b68b0 10881 || !PURE_INNER_CLASS_TYPE_P (current_class)
17126208
APB		 10882 || DECL_FINIT_P (md)
10883 || DECL_INSTINIT_P (md))
c2952b01 10884 return 0;
e35b68b0 10885
c2952b01
APB		 10886 /* If we're calling a method found in an enclosing class, generate
10887 what it takes to retrieve the right this. Don't do that if we're
2cb3951d
APB		 10888 invoking a static method. Note that if MD's type is unrelated to
10889 CURRENT_CLASS, then the current this can be used. */
c2952b01 10890
2cb3951d 10891 if (non_static_context && DECL_CONTEXT (md) != object_type_node)
c2952b01
APB		 10892 {
10893 ctx = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (current_class)));
4dbf4496 10894 if (inherits_from_p (ctx, DECL_CONTEXT (md)))
c2952b01
APB		 10895 {
10896 ta = build_current_thisn (current_class);
10897 ta = build_wfl_node (ta);
10898 }
10899 else
10900 {
10901 tree type = ctx;
10902 while (type)
10903 {
10904 maybe_build_thisn_access_method (type);
4dbf4496 10905 if (inherits_from_p (type, DECL_CONTEXT (md)))
c2952b01
APB		 10906 {
10907 ta = build_access_to_thisn (ctx, type, 0);
10908 break;
10909 }
e35b68b0 10910 type = (DECL_CONTEXT (TYPE_NAME (type)) ?
c2952b01
APB		 10911 TREE_TYPE (DECL_CONTEXT (TYPE_NAME (type))) : NULL_TREE);
10912 }
10913 }
10914 ta = java_complete_tree (ta);
10915 }
10916
10917 /* We might have to use an access method to get to MD. We can
10918 break the method access rule as far as we're not generating
10919 bytecode */
10920 if (METHOD_PRIVATE (md) && flag_emit_class_files)
10921 {
10922 md = build_outer_method_access_method (md);
10923 to_return = 1;
10924 }
10925
10926 *mdecl = md;
10927 *this_arg = ta;
10928
67264b4f
KH		 10929 /* Returning a nonzero value indicates we were doing a non static
10930 method invocation that is now a static invocation. It will have
c2952b01
APB		 10931 callee displace `this' to insert it in the regular argument
10932 list. */
10933 return (non_static_context && to_return);
10934}
10935
e04a16fb
AG		 10936/* Patch an invoke expression METHOD and ARGS, based on its invocation
10937 mode. */
10938
10939static tree
0a2f0c54 10940patch_invoke (tree patch, tree method, tree args)
e04a16fb
AG		 10941{
10942 tree dtable, func;
0a2138e2 10943 tree original_call, t, ta;
3e02b1c3 10944 tree check = NULL_TREE;
e04a16fb 10945
5e942c50
APB		 10946 /* Last step for args: convert build-in types. If we're dealing with
10947 a new TYPE() type call, the first argument to the constructor
e815887f 10948 isn't found in the incoming argument list, but delivered by
5e942c50
APB		 10949 `new' */
10950 t = TYPE_ARG_TYPES (TREE_TYPE (method));
10951 if (TREE_CODE (patch) == NEW_CLASS_EXPR)
10952 t = TREE_CHAIN (t);
e35b68b0 10953 for (ta = args; t != end_params_node && ta;
ac825856 10954 t = TREE_CHAIN (t), ta = TREE_CHAIN (ta))
b9f7e36c
APB		 10955 if (JPRIMITIVE_TYPE_P (TREE_TYPE (TREE_VALUE (ta))) &&
10956 TREE_TYPE (TREE_VALUE (ta)) != TREE_VALUE (t))
10957 TREE_VALUE (ta) = convert (TREE_VALUE (t), TREE_VALUE (ta));
1a6d4fb7 10958
67264b4f 10959 /* Resolve unresolved returned type issues */
1a6d4fb7
APB		 10960 t = TREE_TYPE (TREE_TYPE (method));
10961 if (TREE_CODE (t) == POINTER_TYPE && !CLASS_LOADED_P (TREE_TYPE (t)))
10962 resolve_and_layout (TREE_TYPE (t), NULL);
c2952b01 10963
e8fc7396 10964 if (flag_emit_class_files || flag_emit_xref)
15fdcfe9
PB		 10965 func = method;
10966 else
e04a16fb 10967 {
89e09b9a 10968 switch (invocation_mode (method, CALL_USING_SUPER (patch)))
15fdcfe9
PB		 10969 {
10970 case INVOKE_VIRTUAL:
10971 dtable = invoke_build_dtable (0, args);
10972 func = build_invokevirtual (dtable, method);
10973 break;
b9f7e36c 10974
e815887f
TT		 10975 case INVOKE_NONVIRTUAL:
10976 /* If the object for the method call is null, we throw an
10977 exception. We don't do this if the object is the current
10978 method's `this'. In other cases we just rely on an
10979 optimization pass to eliminate redundant checks. */
10980 if (TREE_VALUE (args) != current_this)
10981 {
3e02b1c3 10982 /* We use a save_expr here to make sure we only evaluate
e815887f
TT		 10983 the new `self' expression once. */
10984 tree save_arg = save_expr (TREE_VALUE (args));
10985 TREE_VALUE (args) = save_arg;
3e02b1c3 10986 check = java_check_reference (save_arg, 1);
e815887f
TT		 10987 }
10988 /* Fall through. */
10989
15fdcfe9
PB		 10990 case INVOKE_SUPER:
10991 case INVOKE_STATIC:
fec763fc
TT		 10992 {
10993 tree signature = build_java_signature (TREE_TYPE (method));
10994 func = build_known_method_ref (method, TREE_TYPE (method),
10995 DECL_CONTEXT (method),
10996 signature, args);
10997 }
15fdcfe9 10998 break;
e04a16fb 10999
15fdcfe9
PB		 11000 case INVOKE_INTERFACE:
11001 dtable = invoke_build_dtable (1, args);
173f556c 11002 func = build_invokeinterface (dtable, method);
15fdcfe9 11003 break;
5e942c50 11004
15fdcfe9 11005 default:
400500c4 11006 abort ();
15fdcfe9
PB		 11007 }
11008
11009 /* Ensure self_type is initialized, (invokestatic). FIXME */
11010 func = build1 (NOP_EXPR, build_pointer_type (TREE_TYPE (method)), func);
e04a16fb
AG		 11011 }
11012
9fe2cc05
PB		 11013 TREE_TYPE (patch) = TREE_TYPE (TREE_TYPE (method));
11014 TREE_OPERAND (patch, 0) = func;
11015 TREE_OPERAND (patch, 1) = args;
11016 patch = check_for_builtin (method, patch);
e04a16fb
AG		 11017 original_call = patch;
11018
e815887f 11019 /* We're processing a `new TYPE ()' form. New is called and its
22eed1e6
APB		 11020 returned value is the first argument to the constructor. We build
11021 a COMPOUND_EXPR and use saved expression so that the overall NEW
11022 expression value is a pointer to a newly created and initialized
11023 class. */
11024 if (TREE_CODE (original_call) == NEW_CLASS_EXPR)
e04a16fb
AG		 11025 {
11026 tree class = DECL_CONTEXT (method);
11027 tree c1, saved_new, size, new;
eec87542
HB		 11028 tree alloc_node;
11029
e8fc7396 11030 if (flag_emit_class_files || flag_emit_xref)
15fdcfe9
PB		 11031 {
11032 TREE_TYPE (patch) = build_pointer_type (class);
11033 return patch;
11034 }
e04a16fb
AG		 11035 if (!TYPE_SIZE (class))
11036 safe_layout_class (class);
11037 size = size_in_bytes (class);
eec87542
HB		 11038 alloc_node =
11039 (class_has_finalize_method (class) ? alloc_object_node
11040 : alloc_no_finalizer_node);
dc6d7095
RS		 11041 new = build3 (CALL_EXPR, promote_type (class),
11042 build_address_of (alloc_node),
11043 build_tree_list (NULL_TREE, build_class_ref (class)),
11044 NULL_TREE);
e04a16fb
AG		 11045 saved_new = save_expr (new);
11046 c1 = build_tree_list (NULL_TREE, saved_new);
11047 TREE_CHAIN (c1) = TREE_OPERAND (original_call, 1);
11048 TREE_OPERAND (original_call, 1) = c1;
11049 TREE_SET_CODE (original_call, CALL_EXPR);
dc6d7095 11050 patch = build2 (COMPOUND_EXPR, TREE_TYPE (new), patch, saved_new);
e04a16fb 11051 }
e815887f 11052
3e02b1c3 11053 /* If CHECK is set, then we are building a check to see if the object
e815887f 11054 is NULL. */
3e02b1c3
AH		 11055 if (check != NULL_TREE)
11056 {
71d082af
AH		 11057 /* We have to call force_evaluation_order now because creating a
11058 COMPOUND_EXPR wraps the arg list in a way that makes it
11059 unrecognizable by force_evaluation_order later. Yuk. */
dc6d7095
RS		 11060 patch = build2 (COMPOUND_EXPR, TREE_TYPE (patch), check,
11061 force_evaluation_order (patch));
e815887f
TT		 11062 TREE_SIDE_EFFECTS (patch) = 1;
11063 }
11064
4009bb7d
APB		 11065 /* In order to be able to modify PATCH later, we SAVE_EXPR it and
11066 put it as the first expression of a COMPOUND_EXPR. The second
11067 expression being an empty statement to be later patched if
11068 necessary. We remember a TREE_LIST (the PURPOSE is the method,
11069 the VALUE is the compound) in a hashtable and return a
11070 COMPOUND_EXPR built so that the result of the evaluation of the
11071 original PATCH node is returned. */
11072 if (STATIC_CLASS_INIT_OPT_P ()
11073 && current_function_decl && METHOD_STATIC (method))
11074 {
11075 tree list;
11076 tree fndecl = current_function_decl;
c1ddb5c8
AH		 11077 /* We have to call force_evaluation_order now because creating a
11078 COMPOUND_EXPR wraps the arg list in a way that makes it
11079 unrecognizable by force_evaluation_order later. Yuk. */
6de9cd9a 11080 tree save = force_evaluation_order (patch);
4009bb7d
APB		 11081 tree type = TREE_TYPE (patch);
11082
dc6d7095 11083 patch = build2 (COMPOUND_EXPR, type, save, build_java_empty_stmt ());
5412ef6b
PB		 11084 list = tree_cons (method, patch,
11085 DECL_FUNCTION_STATIC_METHOD_INVOCATION_COMPOUND (fndecl));
4009bb7d 11086
5412ef6b 11087 DECL_FUNCTION_STATIC_METHOD_INVOCATION_COMPOUND (fndecl) = list;
4009bb7d 11088
dc6d7095 11089 patch = build2 (COMPOUND_EXPR, type, patch, save);
4009bb7d
APB		 11090 }
11091
e04a16fb
AG		 11092 return patch;
11093}
11094
11095static int
0a2f0c54 11096invocation_mode (tree method, int super)
e04a16fb
AG		 11097{
11098 int access = get_access_flags_from_decl (method);
11099
22eed1e6
APB		 11100 if (super)
11101 return INVOKE_SUPER;
11102
e815887f 11103 if (access & ACC_STATIC)
e04a16fb
AG		 11104 return INVOKE_STATIC;
11105
e815887f
TT		 11106 /* We have to look for a constructor before we handle nonvirtual
11107 calls; otherwise the constructor will look nonvirtual. */
11108 if (DECL_CONSTRUCTOR_P (method))
e04a16fb 11109 return INVOKE_STATIC;
e815887f
TT		 11110
11111 if (access & ACC_FINAL || access & ACC_PRIVATE)
11112 return INVOKE_NONVIRTUAL;
11113
11114 if (CLASS_FINAL (TYPE_NAME (DECL_CONTEXT (method))))
11115 return INVOKE_NONVIRTUAL;
11116
e04a16fb
AG		 11117 if (CLASS_INTERFACE (TYPE_NAME (DECL_CONTEXT (method))))
11118 return INVOKE_INTERFACE;
22eed1e6 11119
e04a16fb
AG		 11120 return INVOKE_VIRTUAL;
11121}
11122
b67d701b
PB		 11123/* Retrieve a refined list of matching methods. It covers the step
11124 15.11.2 (Compile-Time Step 2) */
e04a16fb
AG		 11125
11126static tree
0a2f0c54 11127lookup_method_invoke (int lc, tree cl, tree class, tree name, tree arg_list)
e04a16fb 11128{
de4c7b02 11129 tree atl = end_params_node; /* Arg Type List */
c877974e 11130 tree method, signature, list, node;
49f48c71 11131 const char *candidates; /* Used for error report */
b5b8a0e7 11132 char *dup;
e04a16fb 11133
5e942c50 11134 /* Fix the arguments */
e04a16fb
AG		 11135 for (node = arg_list; node; node = TREE_CHAIN (node))
11136 {
e3884b71 11137 tree current_arg = TREE_TYPE (TREE_VALUE (node));
c877974e 11138 /* Non primitive type may have to be resolved */
e3884b71 11139 if (!JPRIMITIVE_TYPE_P (current_arg))
c877974e
APB		 11140 resolve_and_layout (current_arg, NULL_TREE);
11141 /* And promoted */
b67d701b 11142 if (TREE_CODE (current_arg) == RECORD_TYPE)
c877974e 11143 current_arg = promote_type (current_arg);
5e942c50 11144 atl = tree_cons (NULL_TREE, current_arg, atl);
e04a16fb 11145 }
e04a16fb 11146
c2952b01
APB		 11147 /* Presto. If we're dealing with an anonymous class and a
11148 constructor call, generate the right constructor now, since we
11149 know the arguments' types. */
11150
11151 if (lc && ANONYMOUS_CLASS_P (class))
568d1435 11152 {
568d1435 11153 tree mdecl = craft_constructor (TYPE_NAME (class), atl);
260ba9ce
BM		 11154 /* The anonymous class may have already been laid out, so make sure
11155 the new constructor is laid out here. */
11156 layout_class_method (class, CLASSTYPE_SUPER (class), mdecl, NULL_TREE);
568d1435 11157 }
c2952b01 11158
5e942c50
APB		 11159 /* Find all candidates and then refine the list, searching for the
11160 most specific method. */
11161 list = find_applicable_accessible_methods_list (lc, class, name, atl);
11162 list = find_most_specific_methods_list (list);
b67d701b
PB		 11163 if (list && !TREE_CHAIN (list))
11164 return TREE_VALUE (list);
e04a16fb 11165
b67d701b
PB		 11166 /* Issue an error. List candidates if any. Candidates are listed
11167 only if accessible (non accessible methods may end-up here for
11168 the sake of a better error report). */
11169 candidates = NULL;
11170 if (list)
e04a16fb 11171 {
e04a16fb 11172 tree current;
b67d701b 11173 obstack_grow (&temporary_obstack, ". Candidates are:\n", 18);
e04a16fb
AG		 11174 for (current = list; current; current = TREE_CHAIN (current))
11175 {
b67d701b
PB		 11176 tree cm = TREE_VALUE (current);
11177 char string [4096];
e101152f 11178 if (!cm || not_accessible_p (class, cm, NULL_TREE, 0))
b67d701b 11179 continue;
e35b68b0 11180 sprintf
22eed1e6
APB		 11181 (string, " `%s' in `%s'%s",
11182 get_printable_method_name (cm),
b67d701b
PB		 11183 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (DECL_CONTEXT (cm)))),
11184 (TREE_CHAIN (current) ? "\n" : ""));
11185 obstack_grow (&temporary_obstack, string, strlen (string));
11186 }
11187 obstack_1grow (&temporary_obstack, '\0');
11188 candidates = obstack_finish (&temporary_obstack);
11189 }
11190 /* Issue the error message */
c877974e
APB		 11191 method = make_node (FUNCTION_TYPE);
11192 TYPE_ARG_TYPES (method) = atl;
b67d701b 11193 signature = build_java_argument_signature (method);
c63b98cd 11194 dup = xstrdup (lang_printable_name (class, 0));
b5b8a0e7 11195 parse_error_context (cl, "Can't find %s `%s(%s)' in type `%s'%s",
22eed1e6 11196 (lc ? "constructor" : "method"),
b5b8a0e7
APB		 11197 (lc ? dup : IDENTIFIER_POINTER (name)),
11198 IDENTIFIER_POINTER (signature), dup,
b67d701b 11199 (candidates ? candidates : ""));
b5b8a0e7 11200 free (dup);
b67d701b
PB		 11201 return NULL_TREE;
11202}
11203
5e942c50
APB		 11204/* 15.11.2.1: Find Methods that are Applicable and Accessible. LC is 1
11205 when we're looking for a constructor. */
b67d701b
PB		 11206
11207static tree
0a2f0c54
KG		 11208find_applicable_accessible_methods_list (int lc, tree class, tree name,
11209 tree arglist)
b67d701b 11210{
e2500fed 11211 static htab_t searched_classes;
ad69b5b6 11212 static int search_not_done = 0;
b67d701b 11213 tree list = NULL_TREE, all_list = NULL_TREE;
fa743e8c
NS		 11214 tree base_binfo;
11215 int i;
b67d701b 11216
e35b68b0 11217 /* Check the hash table to determine if this class has been searched
ad69b5b6
BM		 11218 already. */
11219 if (searched_classes)
11220 {
e2500fed
GK		 11221 if (htab_find (searched_classes, class) != NULL)
11222 return NULL;
ad69b5b6
BM		 11223 }
11224 else
11225 {
e2500fed
GK		 11226 searched_classes = htab_create (10, htab_hash_pointer,
11227 htab_eq_pointer, NULL);
ad69b5b6 11228 }
e35b68b0 11229
ad69b5b6 11230 search_not_done++;
e2500fed 11231 *htab_find_slot (searched_classes, class, INSERT) = class;
ad69b5b6 11232
ed7f2369 11233 if (!CLASS_LOADED_P (class))
c2952b01
APB		 11234 {
11235 load_class (class, 1);
11236 safe_layout_class (class);
11237 }
11238
1982388a 11239 /* Search interfaces */
e35b68b0 11240 if (TREE_CODE (TYPE_NAME (class)) == TYPE_DECL
9a7ab4b3 11241 && CLASS_INTERFACE (TYPE_NAME (class)))
b67d701b 11242 {
e35b68b0 11243 search_applicable_methods_list (lc, TYPE_METHODS (class),
165f37bc 11244 name, arglist, &list, &all_list);
fa743e8c 11245 for (i = 1; BINFO_BASE_ITERATE (TYPE_BINFO (class), i, base_binfo); i++)
b67d701b 11246 {
fa743e8c 11247 tree t = BINFO_TYPE (base_binfo);
de0b553f 11248 tree rlist;
fa743e8c 11249
e35b68b0 11250 rlist = find_applicable_accessible_methods_list (lc, t, name,
de0b553f 11251 arglist);
165f37bc 11252 list = chainon (rlist, list);
e04a16fb 11253 }
e04a16fb 11254 }
1982388a
APB		 11255 /* Search classes */
11256 else
c2952b01 11257 {
e35b68b0 11258 search_applicable_methods_list (lc, TYPE_METHODS (class),
c2952b01
APB		 11259 name, arglist, &list, &all_list);
11260
17126208
APB		 11261 /* When looking finit$, class$ or instinit$, we turn LC to 1 so
11262 that we only search in class. Note that we should have found
94807d33 11263 something at this point. */
17126208 11264 if (ID_FINIT_P (name) || ID_CLASSDOLLAR_P (name) || ID_INSTINIT_P (name))
493d561d
APB		 11265 {
11266 lc = 1;
11267 if (!list)
400500c4 11268 abort ();
493d561d
APB		 11269 }
11270
165f37bc
APB		 11271 /* We must search all interfaces of this class */
11272 if (!lc)
fa743e8c
NS		 11273 {
11274 for (i = 1;
11275 BINFO_BASE_ITERATE (TYPE_BINFO (class), i, base_binfo); i++)
11276 {
11277 tree t = BINFO_TYPE (base_binfo);
11278 if (t != object_type_node)
11279 {
11280 tree rlist
11281 = find_applicable_accessible_methods_list (lc, t,
11282 name, arglist);
11283 list = chainon (rlist, list);
11284 }
11285 }
11286 }
165f37bc 11287
ad69b5b6
BM		 11288 /* Search superclass */
11289 if (!lc && CLASSTYPE_SUPER (class) != NULL_TREE)
11290 {
11291 tree rlist;
11292 class = CLASSTYPE_SUPER (class);
e35b68b0 11293 rlist = find_applicable_accessible_methods_list (lc, class,
ad69b5b6
BM		 11294 name, arglist);
11295 list = chainon (rlist, list);
11296 }
11297 }
11298
11299 search_not_done--;
11300
11301 /* We're done. Reset the searched classes list and finally search
11302 java.lang.Object if it wasn't searched already. */
11303 if (!search_not_done)
11304 {
11305 if (!lc
11306 && TYPE_METHODS (object_type_node)
e2500fed 11307 && htab_find (searched_classes, object_type_node) == NULL)
ad69b5b6 11308 {
e35b68b0 11309 search_applicable_methods_list (lc,
ad69b5b6
BM		 11310 TYPE_METHODS (object_type_node),
11311 name, arglist, &list, &all_list);
11312 }
e2500fed 11313 htab_delete (searched_classes);
ad69b5b6 11314 searched_classes = NULL;
c2952b01 11315 }
1982388a 11316
b67d701b
PB		 11317 /* Either return the list obtained or all selected (but
11318 inaccessible) methods for better error report. */
11319 return (!list ? all_list : list);
11320}
e04a16fb 11321
ad69b5b6 11322/* Effectively search for the appropriate method in method */
1982388a 11323
e35b68b0 11324static void
0a2f0c54
KG		 11325search_applicable_methods_list (int lc, tree method, tree name, tree arglist,
11326 tree *list, tree *all_list)
1982388a
APB		 11327{
11328 for (; method; method = TREE_CHAIN (method))
11329 {
11330 /* When dealing with constructor, stop here, otherwise search
11331 other classes */
11332 if (lc && !DECL_CONSTRUCTOR_P (method))
11333 continue;
e35b68b0 11334 else if (!lc && (DECL_CONSTRUCTOR_P (method)
c4faeb92 11335 || (DECL_NAME (method) != name)))
1982388a 11336 continue;
c7303e41 11337
1982388a
APB		 11338 if (argument_types_convertible (method, arglist))
11339 {
11340 /* Retain accessible methods only */
e35b68b0 11341 if (!not_accessible_p (DECL_CONTEXT (current_function_decl),
e101152f 11342 method, NULL_TREE, 0))
1982388a
APB		 11343 *list = tree_cons (NULL_TREE, method, *list);
11344 else
11345 /* Also retain all selected method here */
11346 *all_list = tree_cons (NULL_TREE, method, *list);
11347 }
11348 }
ad69b5b6 11349}
1982388a 11350
b67d701b
PB		 11351/* 15.11.2.2 Choose the Most Specific Method */
11352
11353static tree
0a2f0c54 11354find_most_specific_methods_list (tree list)
b67d701b
PB		 11355{
11356 int max = 0;
9a7ab4b3 11357 int abstract, candidates;
b67d701b
PB		 11358 tree current, new_list = NULL_TREE;
11359 for (current = list; current; current = TREE_CHAIN (current))
e04a16fb 11360 {
b67d701b
PB		 11361 tree method;
11362 DECL_SPECIFIC_COUNT (TREE_VALUE (current)) = 0;
11363
11364 for (method = list; method; method = TREE_CHAIN (method))
11365 {
0c2b8145 11366 tree method_v, current_v;
b67d701b
PB		 11367 /* Don't test a method against itself */
11368 if (method == current)
11369 continue;
11370
0c2b8145
APB		 11371 method_v = TREE_VALUE (method);
11372 current_v = TREE_VALUE (current);
11373
11374 /* Compare arguments and location where methods where declared */
11375 if (argument_types_convertible (method_v, current_v))
b67d701b 11376 {
e35b68b0 11377 if (valid_method_invocation_conversion_p
0c2b8145
APB		 11378 (DECL_CONTEXT (method_v), DECL_CONTEXT (current_v))
11379 || (INNER_CLASS_TYPE_P (DECL_CONTEXT (current_v))
11380 && enclosing_context_p (DECL_CONTEXT (method_v),
11381 DECL_CONTEXT (current_v))))
11382 {
e35b68b0 11383 int v = (DECL_SPECIFIC_COUNT (current_v) +=
0c2b8145
APB		 11384 (INNER_CLASS_TYPE_P (DECL_CONTEXT (current_v)) ? 2 : 1));
11385 max = (v > max ? v : max);
11386 }
b67d701b
PB		 11387 }
11388 }
e04a16fb
AG		 11389 }
11390
b67d701b 11391 /* Review the list and select the maximally specific methods */
9a7ab4b3
APB		 11392 for (current = list, abstract = -1, candidates = -1;
11393 current; current = TREE_CHAIN (current))
b67d701b 11394 if (DECL_SPECIFIC_COUNT (TREE_VALUE (current)) == max)
9a7ab4b3
APB		 11395 {
11396 new_list = tree_cons (NULL_TREE, TREE_VALUE (current), new_list);
11397 abstract += (METHOD_ABSTRACT (TREE_VALUE (current)) ? 1 : 0);
11398 candidates++;
11399 }
b67d701b 11400
165f37bc
APB		 11401 /* If we have several and they're all abstract, just pick the
11402 closest one. */
aecf4109 11403 if (candidates > 0 && candidates == abstract)
9a7ab4b3 11404 {
aecf4109
TT		 11405 /* FIXME: merge the throws clauses. There is no convenient way
11406 to do this in gcj right now, since ideally we'd like to
11407 introduce a new METHOD_DECL here, but that is really not
11408 possible. */
9a7ab4b3
APB		 11409 new_list = nreverse (new_list);
11410 TREE_CHAIN (new_list) = NULL_TREE;
aecf4109 11411 return new_list;
9a7ab4b3 11412 }
165f37bc 11413
cab8e2bd
BM		 11414 /* We have several (we couldn't find a most specific), all but one
11415 are abstract, we pick the only non abstract one. */
11416 if (candidates > 0 && (candidates == abstract+1))
165f37bc 11417 {
9a7ab4b3
APB		 11418 for (current = new_list; current; current = TREE_CHAIN (current))
11419 if (!METHOD_ABSTRACT (TREE_VALUE (current)))
11420 {
11421 TREE_CHAIN (current) = NULL_TREE;
11422 new_list = current;
11423 }
165f37bc
APB		 11424 }
11425
b67d701b
PB		 11426 /* If we can't find one, lower expectations and try to gather multiple
11427 maximally specific methods */
165f37bc 11428 while (!new_list && max)
b67d701b
PB		 11429 {
11430 while (--max > 0)
11431 {
11432 if (DECL_SPECIFIC_COUNT (TREE_VALUE (current)) == max)
11433 new_list = tree_cons (NULL_TREE, TREE_VALUE (current), new_list);
11434 }
b67d701b
PB		 11435 }
11436
11437 return new_list;
e04a16fb
AG		 11438}
11439
b67d701b
PB		 11440/* Make sure that the type of each M2_OR_ARGLIST arguments can be
11441 converted by method invocation conversion (5.3) to the type of the
11442 corresponding parameter of M1. Implementation expects M2_OR_ARGLIST
11443 to change less often than M1. */
e04a16fb 11444
e2500fed
GK		 11445static GTY(()) tree m2_arg_value;
11446static GTY(()) tree m2_arg_cache;
11447
b67d701b 11448static int
0a2f0c54 11449argument_types_convertible (tree m1, tree m2_or_arglist)
e04a16fb 11450{
3a976c72 11451 tree m1_arg, m2_arg;
e04a16fb 11452
c2952b01 11453 SKIP_THIS_AND_ARTIFICIAL_PARMS (m1_arg, m1)
e04a16fb 11454
b67d701b
PB		 11455 if (m2_arg_value == m2_or_arglist)
11456 m2_arg = m2_arg_cache;
11457 else
11458 {
11459 /* M2_OR_ARGLIST can be a function DECL or a raw list of
11460 argument types */
11461 if (m2_or_arglist && TREE_CODE (m2_or_arglist) == FUNCTION_DECL)
11462 {
11463 m2_arg = TYPE_ARG_TYPES (TREE_TYPE (m2_or_arglist));
11464 if (!METHOD_STATIC (m2_or_arglist))
11465 m2_arg = TREE_CHAIN (m2_arg);
11466 }
11467 else
11468 m2_arg = m2_or_arglist;
e04a16fb 11469
b67d701b
PB		 11470 m2_arg_value = m2_or_arglist;
11471 m2_arg_cache = m2_arg;
11472 }
e04a16fb 11473
de4c7b02 11474 while (m1_arg != end_params_node && m2_arg != end_params_node)
b67d701b 11475 {
c877974e 11476 resolve_and_layout (TREE_VALUE (m1_arg), NULL_TREE);
b67d701b
PB		 11477 if (!valid_method_invocation_conversion_p (TREE_VALUE (m1_arg),
11478 TREE_VALUE (m2_arg)))
11479 break;
11480 m1_arg = TREE_CHAIN (m1_arg);
11481 m2_arg = TREE_CHAIN (m2_arg);
e04a16fb 11482 }
de4c7b02 11483 return m1_arg == end_params_node && m2_arg == end_params_node;
e04a16fb
AG		 11484}
11485
11486/* Qualification routines */
11487
c6a25d3a
RL		 11488/* Given a name x.y.z, look up x locally. If it's found, save the
11489 decl. If it's not found, mark the name as RESOLVE_PACKAGE_NAME_P,
11490 so that we later try and load the appropriate classes. */
e04a16fb 11491static void
0a2f0c54 11492qualify_ambiguous_name (tree id)
e04a16fb 11493{
c6a25d3a 11494 tree name, decl;
e04a16fb 11495
c6a25d3a
RL		 11496 /* We inspect the first item of the qualification list. As a sanity
11497 check, make sure that it is an identfier node. */
11498 tree qual = EXPR_WFL_QUALIFICATION (id);
11499 tree qual_wfl = QUAL_WFL (qual);
8576f094 11500
c6a25d3a
RL		 11501 if (TREE_CODE (qual_wfl) != EXPR_WITH_FILE_LOCATION)
11502 return;
8576f094 11503
c6a25d3a 11504 name = EXPR_WFL_NODE (qual_wfl);
c2952b01 11505
c6a25d3a
RL		 11506 /* If we don't have an identifier, or we have a 'this' or 'super',
11507 then field access processing is all we need : there is nothing
11508 for us to do. */
11509 if (!name || TREE_CODE (name) != IDENTIFIER_NODE ||
11510 name == this_identifier_node ||
11511 name == super_identifier_node)
11512 return;
e35b68b0 11513
f2760b27 11514 /* If name appears within the scope of a local variable declaration
c6a25d3a
RL		 11515 or parameter declaration, or is a field within an enclosing
11516 class, then it is an expression name. Save the decl and let
11517 resolve_field_access do it's work. */
11518 if ((decl = IDENTIFIER_LOCAL_VALUE (name)) ||
11519 (decl = lookup_field_wrapper (current_class, name)))
11520 {
e04a16fb 11521 QUAL_RESOLUTION (qual) = decl;
c6a25d3a 11522 return;
e04a16fb
AG		 11523 }
11524
c6a25d3a
RL		 11525 /* If name is a known class name (either declared or imported), mark
11526 us as a type name. */
11527 if ((decl = resolve_and_layout (name, NULL_TREE)))
e04a16fb
AG		 11528 {
11529 RESOLVE_TYPE_NAME_P (qual_wfl) = 1;
11530 QUAL_RESOLUTION (qual) = decl;
11531 }
11532
e04a16fb
AG		 11533 /* Check here that NAME isn't declared by more than one
11534 type-import-on-demand declaration of the compilation unit
11535 containing NAME. FIXME */
11536
c6a25d3a
RL		 11537 /* We couldn't find a declaration for the name. Assume for now that
11538 we have a qualified class name that needs to be loaded from an
11539 external class file. */
e35b68b0 11540 else
e04a16fb
AG		 11541 RESOLVE_PACKAGE_NAME_P (qual_wfl) = 1;
11542
67264b4f 11543 /* Propagate the qualification across other components of the
e04a16fb
AG		 11544 qualified name */
11545 for (qual = TREE_CHAIN (qual); qual;
11546 qual_wfl = QUAL_WFL (qual), qual = TREE_CHAIN (qual))
11547 {
11548 if (RESOLVE_PACKAGE_NAME_P (qual_wfl))
11549 RESOLVE_PACKAGE_NAME_P (QUAL_WFL (qual)) = 1;
e04a16fb
AG		 11550 }
11551
11552 /* Store the global qualification for the ambiguous part of ID back
11553 into ID fields */
c6a25d3a 11554 if (RESOLVE_TYPE_NAME_P (qual_wfl))
e04a16fb
AG		 11555 RESOLVE_TYPE_NAME_P (id) = 1;
11556 else if (RESOLVE_PACKAGE_NAME_P (qual_wfl))
11557 RESOLVE_PACKAGE_NAME_P (id) = 1;
e04a16fb
AG		 11558}
11559
e04a16fb 11560/* Patch tree nodes in a function body. When a BLOCK is found, push
5b09b33e
PB		 11561 local variable decls if present.
11562 Same as java_complete_lhs, but does resolve static finals to values. */
e04a16fb
AG		 11563
11564static tree
0a2f0c54 11565java_complete_tree (tree node)
5b09b33e
PB		 11566{
11567 node = java_complete_lhs (node);
c7303e41 11568 if (JDECL_P (node) && CLASS_FINAL_VARIABLE_P (node)
0c2b8145 11569 && DECL_INITIAL (node) != NULL_TREE
7f10c2e2 11570 && !flag_emit_xref)
5b09b33e 11571 {
6e471ea7 11572 tree value = fold_constant_for_init (node, node);
5b09b33e 11573 if (value != NULL_TREE)
6e471ea7 11574 return value;
5b09b33e
PB		 11575 }
11576 return node;
11577}
11578
2aa11e97 11579static tree
0a2f0c54 11580java_stabilize_reference (tree node)
2aa11e97
APB		 11581{
11582 if (TREE_CODE (node) == COMPOUND_EXPR)
11583 {
11584 tree op0 = TREE_OPERAND (node, 0);
11585 tree op1 = TREE_OPERAND (node, 1);
642f15d1 11586 TREE_OPERAND (node, 0) = save_expr (op0);
2aa11e97
APB		 11587 TREE_OPERAND (node, 1) = java_stabilize_reference (op1);
11588 return node;
11589 }
5cbdba64 11590 return stabilize_reference (node);
2aa11e97
APB		 11591}
11592
5b09b33e
PB		 11593/* Patch tree nodes in a function body. When a BLOCK is found, push
11594 local variable decls if present.
11595 Same as java_complete_tree, but does not resolve static finals to values. */
11596
11597static tree
0a2f0c54 11598java_complete_lhs (tree node)
e04a16fb 11599{
22eed1e6 11600 tree nn, cn, wfl_op1, wfl_op2, wfl_op3;
b67d701b 11601 int flag;
e04a16fb
AG		 11602
11603 /* CONVERT_EXPR always has its type set, even though it needs to be
b67d701b 11604 worked out. */
e04a16fb
AG		 11605 if (TREE_TYPE (node) && TREE_CODE (node) != CONVERT_EXPR)
11606 return node;
11607
11608 /* The switch block implements cases processing container nodes
11609 first. Contained nodes are always written back. Leaves come
11610 next and return a value. */
11611 switch (TREE_CODE (node))
11612 {
11613 case BLOCK:
11614
11615 /* 1- Block section.
11616 Set the local values on decl names so we can identify them
11617 faster when they're referenced. At that stage, identifiers
11618 are legal so we don't check for declaration errors. */
11619 for (cn = BLOCK_EXPR_DECLS (node); cn; cn = TREE_CHAIN (cn))
11620 {
11621 DECL_CONTEXT (cn) = current_function_decl;
11622 IDENTIFIER_LOCAL_VALUE (DECL_NAME (cn)) = cn;
e04a16fb 11623 }
15fdcfe9
PB		 11624 if (BLOCK_EXPR_BODY (node) == NULL_TREE)
11625 CAN_COMPLETE_NORMALLY (node) = 1;
11626 else
e04a16fb 11627 {
15fdcfe9
PB		 11628 tree stmt = BLOCK_EXPR_BODY (node);
11629 tree *ptr;
11630 int error_seen = 0;
11631 if (TREE_CODE (stmt) == COMPOUND_EXPR)
11632 {
e35b68b0 11633 /* Re-order from (((A; B); C); ...; Z) to
c877974e 11634 (A; (B; (C ; (...; Z)))).
15fdcfe9
PB		 11635 This makes it easier to scan the statements left-to-right
11636 without using recursion (which might overflow the stack
11637 if the block has many statements. */
11638 for (;;)
11639 {
11640 tree left = TREE_OPERAND (stmt, 0);
11641 if (TREE_CODE (left) != COMPOUND_EXPR)
11642 break;
11643 TREE_OPERAND (stmt, 0) = TREE_OPERAND (left, 1);
11644 TREE_OPERAND (left, 1) = stmt;
11645 stmt = left;
11646 }
11647 BLOCK_EXPR_BODY (node) = stmt;
11648 }
11649
c877974e
APB		 11650 /* Now do the actual complete, without deep recursion for
11651 long blocks. */
15fdcfe9 11652 ptr = &BLOCK_EXPR_BODY (node);
dc0b3eff 11653 while (TREE_CODE (*ptr) == COMPOUND_EXPR
6de9cd9a 11654 && !IS_EMPTY_STMT (TREE_OPERAND (*ptr, 1)))
15fdcfe9
PB		 11655 {
11656 tree cur = java_complete_tree (TREE_OPERAND (*ptr, 0));
11657 tree *next = &TREE_OPERAND (*ptr, 1);
11658 TREE_OPERAND (*ptr, 0) = cur;
6de9cd9a 11659 if (IS_EMPTY_STMT (cur))
cd9643f7
PB		 11660 {
11661 /* Optimization; makes it easier to detect empty bodies.
11662 Most useful for <clinit> with all-constant initializer. */
11663 *ptr = *next;
11664 continue;
11665 }
15fdcfe9
PB		 11666 if (TREE_CODE (cur) == ERROR_MARK)
11667 error_seen++;
11668 else if (! CAN_COMPLETE_NORMALLY (cur))
11669 {
11670 wfl_op2 = *next;
11671 for (;;)
11672 {
11673 if (TREE_CODE (wfl_op2) == BLOCK)
11674 wfl_op2 = BLOCK_EXPR_BODY (wfl_op2);
11675 else if (TREE_CODE (wfl_op2) == COMPOUND_EXPR)
11676 wfl_op2 = TREE_OPERAND (wfl_op2, 0);
11677 else
11678 break;
11679 }
11680 if (TREE_CODE (wfl_op2) != CASE_EXPR
dc0b3eff 11681 && TREE_CODE (wfl_op2) != DEFAULT_EXPR)
82371d41 11682 unreachable_stmt_error (*ptr);
15fdcfe9 11683 }
916b57ce
JS		 11684 if (TREE_TYPE (*ptr) == NULL_TREE)
11685 TREE_TYPE (*ptr) = void_type_node;
15fdcfe9
PB		 11686 ptr = next;
11687 }
11688 *ptr = java_complete_tree (*ptr);
11689
11690 if (TREE_CODE (*ptr) == ERROR_MARK || error_seen > 0)
e04a16fb 11691 return error_mark_node;
15fdcfe9 11692 CAN_COMPLETE_NORMALLY (node) = CAN_COMPLETE_NORMALLY (*ptr);
e04a16fb
AG		 11693 }
11694 /* Turn local bindings to null */
11695 for (cn = BLOCK_EXPR_DECLS (node); cn; cn = TREE_CHAIN (cn))
11696 IDENTIFIER_LOCAL_VALUE (DECL_NAME (cn)) = NULL_TREE;
11697
11698 TREE_TYPE (node) = void_type_node;
11699 break;
11700
11701 /* 2- They are expressions but ultimately deal with statements */
b67d701b 11702
b9f7e36c
APB		 11703 case THROW_EXPR:
11704 wfl_op1 = TREE_OPERAND (node, 0);
11705 COMPLETE_CHECK_OP_0 (node);
c2952b01
APB		 11706 /* 14.19 A throw statement cannot complete normally. */
11707 CAN_COMPLETE_NORMALLY (node) = 0;
b9f7e36c
APB		 11708 return patch_throw_statement (node, wfl_op1);
11709
11710 case SYNCHRONIZED_EXPR:
11711 wfl_op1 = TREE_OPERAND (node, 0);
b9f7e36c
APB		 11712 return patch_synchronized_statement (node, wfl_op1);
11713
b67d701b
PB		 11714 case TRY_EXPR:
11715 return patch_try_statement (node);
11716
a7d8d81f
PB		 11717 case TRY_FINALLY_EXPR:
11718 COMPLETE_CHECK_OP_0 (node);
11719 COMPLETE_CHECK_OP_1 (node);
6de9cd9a
DN		 11720 if (IS_EMPTY_STMT (TREE_OPERAND (node, 0)))
11721 /* Reduce try/finally nodes with an empty try block. */
fa029f45 11722 return TREE_OPERAND (node, 1);
6de9cd9a
DN		 11723 if (IS_EMPTY_STMT (TREE_OPERAND (node, 1)))
11724 /* Likewise for an empty finally block. */
fa029f45 11725 return TREE_OPERAND (node, 0);
a7d8d81f
PB		 11726 CAN_COMPLETE_NORMALLY (node)
11727 = (CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 0))
11728 && CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 1)));
11729 TREE_TYPE (node) = TREE_TYPE (TREE_OPERAND (node, 0));
11730 return node;
11731
e04a16fb
AG		 11732 case LABELED_BLOCK_EXPR:
11733 PUSH_LABELED_BLOCK (node);
11734 if (LABELED_BLOCK_BODY (node))
11735 COMPLETE_CHECK_OP_1 (node);
11736 TREE_TYPE (node) = void_type_node;
11737 POP_LABELED_BLOCK ();
1fb89a4d 11738
6de9cd9a 11739 if (IS_EMPTY_STMT (LABELED_BLOCK_BODY (node)))
9dd939b2
APB		 11740 {
11741 LABELED_BLOCK_BODY (node) = NULL_TREE;
11742 CAN_COMPLETE_NORMALLY (node) = 1;
11743 }
1fb89a4d 11744 else if (CAN_COMPLETE_NORMALLY (LABELED_BLOCK_BODY (node)))
15fdcfe9 11745 CAN_COMPLETE_NORMALLY (node) = 1;
e04a16fb
AG		 11746 return node;
11747
11748 case EXIT_BLOCK_EXPR:
11749 /* We don't complete operand 1, because it's the return value of
11750 the EXIT_BLOCK_EXPR which doesn't exist it Java */
11751 return patch_bc_statement (node);
11752
15fdcfe9
PB		 11753 case CASE_EXPR:
11754 cn = java_complete_tree (TREE_OPERAND (node, 0));
11755 if (cn == error_mark_node)
11756 return cn;
11757
8576f094
APB		 11758 /* First, the case expression must be constant. Values of final
11759 fields are accepted. */
15fdcfe9 11760 cn = fold (cn);
8576f094
APB		 11761 if ((TREE_CODE (cn) == COMPOUND_EXPR || TREE_CODE (cn) == COMPONENT_REF)
11762 && JDECL_P (TREE_OPERAND (cn, 1))
11763 && FIELD_FINAL (TREE_OPERAND (cn, 1))
11764 && DECL_INITIAL (TREE_OPERAND (cn, 1)))
100f7cd8 11765 {
100f7cd8
APB		 11766 cn = fold_constant_for_init (DECL_INITIAL (TREE_OPERAND (cn, 1)),
11767 TREE_OPERAND (cn, 1));
100f7cd8 11768 }
3ed218d4 11769 /* Accept final locals too. */
bfb7b172
AH		 11770 else if (TREE_CODE (cn) == VAR_DECL && DECL_FINAL (cn)
11771 && DECL_INITIAL (cn))
3ed218d4 11772 cn = fold_constant_for_init (DECL_INITIAL (cn), cn);
15fdcfe9 11773
ce6e9147 11774 if (!TREE_CONSTANT (cn) && !flag_emit_xref)
15fdcfe9
PB		 11775 {
11776 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
11777 parse_error_context (node, "Constant expression required");
11778 return error_mark_node;
11779 }
11780
11781 nn = ctxp->current_loop;
11782
11783 /* It must be assignable to the type of the switch expression. */
e35b68b0 11784 if (!try_builtin_assignconv (NULL_TREE,
c877974e 11785 TREE_TYPE (TREE_OPERAND (nn, 0)), cn))
15fdcfe9
PB		 11786 {
11787 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
e35b68b0 11788 parse_error_context
15fdcfe9
PB		 11789 (wfl_operator,
11790 "Incompatible type for case. Can't convert `%s' to `int'",
11791 lang_printable_name (TREE_TYPE (cn), 0));
11792 return error_mark_node;
11793 }
11794
11795 cn = fold (convert (int_type_node, cn));
9d7d8362
APB		 11796 TREE_CONSTANT_OVERFLOW (cn) = 0;
11797 CAN_COMPLETE_NORMALLY (cn) = 1;
15fdcfe9 11798
5a21a051
TT		 11799 /* Save the label on a list so that we can later check for
11800 duplicates. */
11801 case_label_list = tree_cons (node, cn, case_label_list);
11802
11803 /* Multiple instance of a case label bearing the same value is
11804 checked later. The case expression is all right so far. */
34d4df06
APB		 11805 if (TREE_CODE (cn) == VAR_DECL)
11806 cn = DECL_INITIAL (cn);
15fdcfe9 11807 TREE_OPERAND (node, 0) = cn;
9bbc7d9f 11808 TREE_TYPE (node) = void_type_node;
15fdcfe9 11809 CAN_COMPLETE_NORMALLY (node) = 1;
10100cc7 11810 TREE_SIDE_EFFECTS (node) = 1;
15fdcfe9
PB		 11811 break;
11812
11813 case DEFAULT_EXPR:
11814 nn = ctxp->current_loop;
11815 /* Only one default label is allowed per switch statement */
11816 if (SWITCH_HAS_DEFAULT (nn))
11817 {
9ec819d4
PB		 11818#ifdef USE_MAPPED_LOCATION
11819 SET_EXPR_LOCATION (wfl_operator, EXPR_LOCATION (node));
11820#else
15fdcfe9 11821 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
9ec819d4 11822#endif
e35b68b0 11823 parse_error_context (wfl_operator,
15fdcfe9
PB		 11824 "Duplicate case label: `default'");
11825 return error_mark_node;
11826 }
11827 else
11828 SWITCH_HAS_DEFAULT (nn) = 1;
9bbc7d9f 11829 TREE_TYPE (node) = void_type_node;
10100cc7 11830 TREE_SIDE_EFFECTS (node) = 1;
15fdcfe9
PB		 11831 CAN_COMPLETE_NORMALLY (node) = 1;
11832 break;
11833
b67d701b 11834 case SWITCH_EXPR:
e04a16fb
AG		 11835 case LOOP_EXPR:
11836 PUSH_LOOP (node);
11837 /* Check whether the loop was enclosed in a labeled
11838 statement. If not, create one, insert the loop in it and
11839 return the node */
11840 nn = patch_loop_statement (node);
b67d701b 11841
e04a16fb 11842 /* Anyways, walk the body of the loop */
b67d701b
PB		 11843 if (TREE_CODE (node) == LOOP_EXPR)
11844 TREE_OPERAND (node, 0) = java_complete_tree (TREE_OPERAND (node, 0));
11845 /* Switch statement: walk the switch expression and the cases */
11846 else
11847 node = patch_switch_statement (node);
11848
e7c7bcef 11849 if (node == error_mark_node || TREE_OPERAND (node, 0) == error_mark_node)
b635eb2f
PB		 11850 nn = error_mark_node;
11851 else
15fdcfe9 11852 {
b635eb2f
PB		 11853 TREE_TYPE (nn) = TREE_TYPE (node) = void_type_node;
11854 /* If we returned something different, that's because we
11855 inserted a label. Pop the label too. */
11856 if (nn != node)
11857 {
11858 if (CAN_COMPLETE_NORMALLY (node))
11859 CAN_COMPLETE_NORMALLY (nn) = 1;
11860 POP_LABELED_BLOCK ();
11861 }
15fdcfe9 11862 }
e04a16fb
AG		 11863 POP_LOOP ();
11864 return nn;
11865
11866 case EXIT_EXPR:
11867 TREE_OPERAND (node, 0) = java_complete_tree (TREE_OPERAND (node, 0));
11868 return patch_exit_expr (node);
11869
11870 case COND_EXPR:
11871 /* Condition */
11872 TREE_OPERAND (node, 0) = java_complete_tree (TREE_OPERAND (node, 0));
11873 if (TREE_OPERAND (node, 0) == error_mark_node)
11874 return error_mark_node;
11875 /* then-else branches */
11876 TREE_OPERAND (node, 1) = java_complete_tree (TREE_OPERAND (node, 1));
11877 if (TREE_OPERAND (node, 1) == error_mark_node)
11878 return error_mark_node;
c5466b25
AH		 11879 {
11880 /* This is a special case due to build_assertion(). When
11881 assertions are disabled we build a COND_EXPR in which
11882 Operand 1 is the body of the assertion. If that happens to
11883 be a string concatenation we'll need to patch it here. */
11884 tree patched = patch_string (TREE_OPERAND (node, 1));
11885 if (patched)
11886 TREE_OPERAND (node, 1) = patched;
11887 }
11888 TREE_OPERAND (node, 2) = java_complete_tree (TREE_OPERAND (node, 2));
e04a16fb
AG		 11889 if (TREE_OPERAND (node, 2) == error_mark_node)
11890 return error_mark_node;
11891 return patch_if_else_statement (node);
11892 break;
11893
22eed1e6
APB		 11894 case CONDITIONAL_EXPR:
11895 /* Condition */
11896 wfl_op1 = TREE_OPERAND (node, 0);
11897 COMPLETE_CHECK_OP_0 (node);
11898 wfl_op2 = TREE_OPERAND (node, 1);
11899 COMPLETE_CHECK_OP_1 (node);
11900 wfl_op3 = TREE_OPERAND (node, 2);
11901 COMPLETE_CHECK_OP_2 (node);
11902 return patch_conditional_expr (node, wfl_op1, wfl_op2);
11903
e04a16fb
AG		 11904 /* 3- Expression section */
11905 case COMPOUND_EXPR:
15fdcfe9 11906 wfl_op2 = TREE_OPERAND (node, 1);
e35b68b0 11907 TREE_OPERAND (node, 0) = nn =
ac825856 11908 java_complete_tree (TREE_OPERAND (node, 0));
6de9cd9a 11909 if (IS_EMPTY_STMT (wfl_op2))
dc0b3eff
PB		 11910 CAN_COMPLETE_NORMALLY (node) = CAN_COMPLETE_NORMALLY (nn);
11911 else
15fdcfe9 11912 {
dc0b3eff 11913 if (! CAN_COMPLETE_NORMALLY (nn) && TREE_CODE (nn) != ERROR_MARK)
bccaf73a 11914 {
dc0b3eff
PB		 11915 /* An unreachable condition in a do-while statement
11916 is *not* (technically) an unreachable statement. */
11917 nn = wfl_op2;
11918 if (TREE_CODE (nn) == EXPR_WITH_FILE_LOCATION)
11919 nn = EXPR_WFL_NODE (nn);
fcc8cecb
TT		 11920 /* NN can be NULL_TREE exactly when UPDATE is, in
11921 finish_for_loop. */
11922 if (nn != NULL_TREE && TREE_CODE (nn) != EXIT_EXPR)
dc0b3eff
PB		 11923 {
11924 SET_WFL_OPERATOR (wfl_operator, node, wfl_op2);
486e8c0c
TT		 11925 if (SUPPRESS_UNREACHABLE_ERROR (nn))
11926 {
11927 /* Perhaps this warning should have an
11928 associated flag. The code being compiled is
11929 pedantically correct, but useless. */
11930 parse_warning_context (wfl_operator,
11931 "Unreachable statement");
11932 }
11933 else
11934 parse_error_context (wfl_operator,
11935 "Unreachable statement");
dc0b3eff 11936 }
bccaf73a 11937 }
dc0b3eff
PB		 11938 TREE_OPERAND (node, 1) = java_complete_tree (TREE_OPERAND (node, 1));
11939 if (TREE_OPERAND (node, 1) == error_mark_node)
11940 return error_mark_node;
84a944b3
TT		 11941 /* Even though we might allow the case where the first
11942 operand doesn't return normally, we still should compute
11943 CAN_COMPLETE_NORMALLY correctly. */
dc0b3eff 11944 CAN_COMPLETE_NORMALLY (node)
84a944b3
TT		 11945 = (CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 0))
11946 && CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 1)));
15fdcfe9 11947 }
e04a16fb
AG		 11948 TREE_TYPE (node) = TREE_TYPE (TREE_OPERAND (node, 1));
11949 break;
11950
11951 case RETURN_EXPR:
15fdcfe9 11952 /* CAN_COMPLETE_NORMALLY (node) = 0; */
e04a16fb
AG		 11953 return patch_return (node);
11954
11955 case EXPR_WITH_FILE_LOCATION:
11956 if (!EXPR_WFL_NODE (node) /* Or a PRIMARY flag ? */
11957 || TREE_CODE (EXPR_WFL_NODE (node)) == IDENTIFIER_NODE)
15fdcfe9 11958 {
5423609c 11959 tree wfl = node;
15fdcfe9 11960 node = resolve_expression_name (node, NULL);
dc0b3eff
PB		 11961 if (node == error_mark_node)
11962 return node;
5423609c
APB		 11963 /* Keep line number information somewhere were it doesn't
11964 disrupt the completion process. */
2c56429a 11965 if (flag_emit_xref && TREE_CODE (node) != CALL_EXPR)
5423609c
APB		 11966 {
11967 EXPR_WFL_NODE (wfl) = TREE_OPERAND (node, 1);
11968 TREE_OPERAND (node, 1) = wfl;
11969 }
15fdcfe9
PB		 11970 CAN_COMPLETE_NORMALLY (node) = 1;
11971 }
e04a16fb
AG		 11972 else
11973 {
5b09b33e 11974 tree body;
9ec819d4
PB		 11975 location_t save_location = input_location;
11976#ifdef USE_MAPPED_LOCATION
11977 input_location = EXPR_LOCATION (node);
11978 if (input_location == UNKNOWN_LOCATION)
11979 input_location = save_location;
11980#else
d479d37f 11981 input_line = EXPR_WFL_LINENO (node);
9ec819d4 11982#endif
5b09b33e 11983 body = java_complete_tree (EXPR_WFL_NODE (node));
9ec819d4 11984 input_location = save_location;
15fdcfe9 11985 EXPR_WFL_NODE (node) = body;
dc0b3eff 11986 TREE_SIDE_EFFECTS (node) = TREE_SIDE_EFFECTS (body);
15fdcfe9 11987 CAN_COMPLETE_NORMALLY (node) = CAN_COMPLETE_NORMALLY (body);
6de9cd9a 11988 if (IS_EMPTY_STMT (body) || TREE_CONSTANT (body))
cd9643f7 11989 {
00b4575d 11990 /* Makes it easier to constant fold, detect empty bodies. */
cd9643f7
PB		 11991 return body;
11992 }
dc0b3eff 11993 if (body == error_mark_node)
e04a16fb
AG		 11994 {
11995 /* Its important for the evaluation of assignment that
11996 this mark on the TREE_TYPE is propagated. */
11997 TREE_TYPE (node) = error_mark_node;
11998 return error_mark_node;
11999 }
12000 else
12001 TREE_TYPE (node) = TREE_TYPE (EXPR_WFL_NODE (node));
e35b68b0 12002
e04a16fb
AG		 12003 }
12004 break;
12005
b67d701b 12006 case NEW_ARRAY_EXPR:
e04a16fb
AG		 12007 /* Patch all the dimensions */
12008 flag = 0;
12009 for (cn = TREE_OPERAND (node, 1); cn; cn = TREE_CHAIN (cn))
12010 {
12011 int location = EXPR_WFL_LINECOL (TREE_VALUE (cn));
e35b68b0 12012 tree dim = convert (int_type_node,
3a1760ac 12013 java_complete_tree (TREE_VALUE (cn)));
e04a16fb
AG		 12014 if (dim == error_mark_node)
12015 {
12016 flag = 1;
12017 continue;
12018 }
12019 else
12020 {
b9f7e36c 12021 TREE_VALUE (cn) = dim;
e04a16fb
AG		 12022 /* Setup the location of the current dimension, for
12023 later error report. */
9ec819d4
PB		 12024#ifdef USE_MAPPED_LOCATION
12025 TREE_PURPOSE (cn) = expr_add_location (NULL_TREE, location, 0);
12026#else
e35b68b0 12027 TREE_PURPOSE (cn) =
e04a16fb
AG		 12028 build_expr_wfl (NULL_TREE, input_filename, 0, 0);
12029 EXPR_WFL_LINECOL (TREE_PURPOSE (cn)) = location;
9ec819d4 12030#endif
e04a16fb
AG		 12031 }
12032 }
12033 /* They complete the array creation expression, if no errors
12034 were found. */
15fdcfe9 12035 CAN_COMPLETE_NORMALLY (node) = 1;
aee48ef8
PB		 12036 return (flag ? error_mark_node
12037 : force_evaluation_order (patch_newarray (node)));
e04a16fb 12038
c2952b01
APB		 12039 case NEW_ANONYMOUS_ARRAY_EXPR:
12040 /* Create the array type if necessary. */
12041 if (ANONYMOUS_ARRAY_DIMS_SIG (node))
12042 {
12043 tree type = ANONYMOUS_ARRAY_BASE_TYPE (node);
12044 if (!(type = resolve_type_during_patch (type)))
12045 return error_mark_node;
12046 type = build_array_from_name (type, NULL_TREE,
12047 ANONYMOUS_ARRAY_DIMS_SIG (node), NULL);
12048 ANONYMOUS_ARRAY_BASE_TYPE (node) = build_pointer_type (type);
12049 }
12050 node = patch_new_array_init (ANONYMOUS_ARRAY_BASE_TYPE (node),
12051 ANONYMOUS_ARRAY_INITIALIZER (node));
12052 if (node == error_mark_node)
12053 return error_mark_node;
12054 CAN_COMPLETE_NORMALLY (node) = 1;
12055 return node;
12056
b67d701b 12057 case NEW_CLASS_EXPR:
e04a16fb 12058 case CALL_EXPR:
b67d701b 12059 /* Complete function's argument(s) first */
e04a16fb
AG		 12060 if (complete_function_arguments (node))
12061 return error_mark_node;
12062 else
b9f7e36c 12063 {
22eed1e6
APB		 12064 tree decl, wfl = TREE_OPERAND (node, 0);
12065 int in_this = CALL_THIS_CONSTRUCTOR_P (node);
e101152f
APB		 12066 int from_super = (EXPR_WFL_NODE (TREE_OPERAND (node, 0)) ==
12067 super_identifier_node);
90281aec 12068 tree arguments;
9ec819d4
PB		 12069#ifdef USE_MAPPED_LOCATION
12070 source_location location = EXPR_LOCATION (node);
12071#else
50abb28b 12072 int location = EXPR_WFL_LINECOL (node);
9ec819d4 12073#endif
22eed1e6 12074
e101152f
APB		 12075 node = patch_method_invocation (node, NULL_TREE, NULL_TREE,
12076 from_super, 0, &decl);
c877974e
APB		 12077 if (node == error_mark_node)
12078 return error_mark_node;
12079
90281aec
TT		 12080 if (TREE_CODE (node) == CALL_EXPR
12081 && TREE_OPERAND (node, 1) != NULL_TREE)
12082 arguments = TREE_VALUE (TREE_OPERAND (node, 1));
12083 else
12084 arguments = NULL_TREE;
50abb28b 12085 check_thrown_exceptions (location, decl, arguments);
c877974e
APB		 12086 /* If we call this(...), register signature and positions */
12087 if (in_this)
e35b68b0
AD		 12088 DECL_CONSTRUCTOR_CALLS (current_function_decl) =
12089 tree_cons (wfl, decl,
c877974e 12090 DECL_CONSTRUCTOR_CALLS (current_function_decl));
de4c7b02 12091 CAN_COMPLETE_NORMALLY (node) = 1;
dc0b3eff 12092 return force_evaluation_order (node);
b9f7e36c 12093 }
e04a16fb
AG		 12094
12095 case MODIFY_EXPR:
12096 /* Save potential wfls */
12097 wfl_op1 = TREE_OPERAND (node, 0);
cd9643f7 12098 TREE_OPERAND (node, 0) = nn = java_complete_lhs (wfl_op1);
e35b68b0 12099
cd9643f7
PB		 12100 if (MODIFY_EXPR_FROM_INITIALIZATION_P (node)
12101 && TREE_CODE (nn) == VAR_DECL && TREE_STATIC (nn)
12102 && DECL_INITIAL (nn) != NULL_TREE)
12103 {
100f7cd8 12104 tree value;
e35b68b0 12105
100f7cd8 12106 value = fold_constant_for_init (nn, nn);
c2952b01 12107
731866ba
APB		 12108 /* When we have a primitype type, or a string and we're not
12109 emitting a class file, we actually don't want to generate
12110 anything for the assignment. */
0adaa7e4
AH		 12111 if (value != NULL_TREE &&
12112 (JPRIMITIVE_TYPE_P (TREE_TYPE (value)) ||
3ed218d4
APB		 12113 (TREE_TYPE (value) == string_ptr_type_node &&
12114 ! flag_emit_class_files)))
cd9643f7 12115 {
731866ba 12116 /* Prepare node for patch_assignment */
3ed218d4 12117 TREE_OPERAND (node, 1) = value;
731866ba 12118 /* Call patch assignment to verify the assignment */
5573cb39 12119 if (patch_assignment (node, wfl_op1) == error_mark_node)
3ed218d4 12120 return error_mark_node;
731866ba
APB		 12121 /* Set DECL_INITIAL properly (a conversion might have
12122 been decided by patch_assignment) and return the
12123 empty statement. */
3ed218d4 12124 else
731866ba
APB		 12125 {
12126 tree patched = patch_string (TREE_OPERAND (node, 1));
12127 if (patched)
12128 DECL_INITIAL (nn) = patched;
12129 else
12130 DECL_INITIAL (nn) = TREE_OPERAND (node, 1);
4f88ccda 12131 DECL_FIELD_FINAL_IUD (nn) = 1;
6de9cd9a 12132 return build_java_empty_stmt ();
731866ba 12133 }
cd9643f7 12134 }
629d4b4d
APB		 12135 if (! flag_emit_class_files)
12136 DECL_INITIAL (nn) = NULL_TREE;
cd9643f7 12137 }
e04a16fb 12138 wfl_op2 = TREE_OPERAND (node, 1);
cd9643f7 12139
e04a16fb
AG		 12140 if (TREE_OPERAND (node, 0) == error_mark_node)
12141 return error_mark_node;
12142
5cbdba64
APB		 12143 flag = COMPOUND_ASSIGN_P (wfl_op2);
12144 if (flag)
e04a16fb 12145 {
c2952b01
APB		 12146 /* This might break when accessing outer field from inner
12147 class. TESTME, FIXME */
e35b68b0 12148 tree lvalue = java_stabilize_reference (TREE_OPERAND (node, 0));
e04a16fb 12149
e101152f 12150 /* Hand stabilize the lhs on both places */
e04a16fb 12151 TREE_OPERAND (node, 0) = lvalue;
e35b68b0 12152 TREE_OPERAND (TREE_OPERAND (node, 1), 0) =
5cbdba64 12153 (flag_emit_class_files ? lvalue : save_expr (lvalue));
2aa11e97 12154
5cbdba64 12155 /* 15.25.2.a: Left hand is not an array access. FIXME */
2aa11e97
APB		 12156 /* Now complete the RHS. We write it back later on. */
12157 nn = java_complete_tree (TREE_OPERAND (node, 1));
12158
642f15d1
APB		 12159 if ((cn = patch_string (nn)))
12160 nn = cn;
12161
e35b68b0 12162 /* The last part of the rewrite for E1 op= E2 is to have
2aa11e97 12163 E1 = (T)(E1 op E2), with T being the type of E1. */
e35b68b0 12164 nn = java_complete_tree (build_cast (EXPR_WFL_LINECOL (wfl_op2),
642f15d1 12165 TREE_TYPE (lvalue), nn));
5cbdba64 12166
568aac9c
TT		 12167 /* If the assignment is compound and has reference type,
12168 then ensure the LHS has type String and nothing else. */
12169 if (JREFERENCE_TYPE_P (TREE_TYPE (lvalue))
12170 && ! JSTRING_TYPE_P (TREE_TYPE (lvalue)))
12171 parse_error_context (wfl_op2,
12172 "Incompatible type for `+='. Can't convert `%s' to `java.lang.String'",
12173 lang_printable_name (TREE_TYPE (lvalue), 0));
12174
5cbdba64 12175 /* 15.25.2.b: Left hand is an array access. FIXME */
e04a16fb
AG		 12176 }
12177
f8976021 12178 /* If we're about to patch a NEW_ARRAY_INIT, we call a special
c2952b01
APB		 12179 function to complete this RHS. Note that a NEW_ARRAY_INIT
12180 might have been already fully expanded if created as a result
12181 of processing an anonymous array initializer. We avoid doing
12182 the operation twice by testing whether the node already bears
12183 a type. */
12184 else if (TREE_CODE (wfl_op2) == NEW_ARRAY_INIT && !TREE_TYPE (wfl_op2))
fdec99c6 12185 nn = patch_new_array_init (TREE_TYPE (TREE_OPERAND (node, 0)),
f8976021 12186 TREE_OPERAND (node, 1));
2aa11e97 12187 /* Otherwise we simply complete the RHS */
f8976021
APB		 12188 else
12189 nn = java_complete_tree (TREE_OPERAND (node, 1));
12190
e04a16fb 12191 if (nn == error_mark_node)
c0d87ff6 12192 return error_mark_node;
2aa11e97
APB		 12193
12194 /* Write back the RHS as we evaluated it. */
e04a16fb 12195 TREE_OPERAND (node, 1) = nn;
b67d701b
PB		 12196
12197 /* In case we're handling = with a String as a RHS, we need to
12198 produce a String out of the RHS (it might still be a
12199 STRING_CST or a StringBuffer at this stage */
12200 if ((nn = patch_string (TREE_OPERAND (node, 1))))
12201 TREE_OPERAND (node, 1) = nn;
c2952b01
APB		 12202
12203 if ((nn = outer_field_access_fix (wfl_op1, TREE_OPERAND (node, 0),
12204 TREE_OPERAND (node, 1))))
12205 {
12206 /* We return error_mark_node if outer_field_access_fix
12207 detects we write into a final. */
12208 if (nn == error_mark_node)
12209 return error_mark_node;
12210 node = nn;
12211 }
12212 else
12213 {
5573cb39 12214 node = patch_assignment (node, wfl_op1);
edcc88c1
PB		 12215 if (node == error_mark_node)
12216 return error_mark_node;
c2952b01 12217 /* Reorganize the tree if necessary. */
e35b68b0 12218 if (flag && (!JREFERENCE_TYPE_P (TREE_TYPE (node))
c2952b01
APB		 12219 || JSTRING_P (TREE_TYPE (node))))
12220 node = java_refold (node);
12221 }
731866ba
APB		 12222
12223 /* Seek to set DECL_INITIAL to a proper value, since it might have
12224 undergone a conversion in patch_assignment. We do that only when
12225 it's necessary to have DECL_INITIAL properly set. */
12226 nn = TREE_OPERAND (node, 0);
e35b68b0 12227 if (TREE_CODE (nn) == VAR_DECL
731866ba 12228 && DECL_INITIAL (nn) && CONSTANT_VALUE_P (DECL_INITIAL (nn))
e35b68b0 12229 && FIELD_STATIC (nn) && FIELD_FINAL (nn)
731866ba
APB		 12230 && (JPRIMITIVE_TYPE_P (TREE_TYPE (nn))
12231 || TREE_TYPE (nn) == string_ptr_type_node))
12232 DECL_INITIAL (nn) = TREE_OPERAND (node, 1);
12233
15fdcfe9
PB		 12234 CAN_COMPLETE_NORMALLY (node) = 1;
12235 return node;
e04a16fb
AG		 12236
12237 case MULT_EXPR:
12238 case PLUS_EXPR:
12239 case MINUS_EXPR:
12240 case LSHIFT_EXPR:
12241 case RSHIFT_EXPR:
12242 case URSHIFT_EXPR:
12243 case BIT_AND_EXPR:
12244 case BIT_XOR_EXPR:
12245 case BIT_IOR_EXPR:
12246 case TRUNC_MOD_EXPR:
c2952b01 12247 case TRUNC_DIV_EXPR:
e04a16fb
AG		 12248 case RDIV_EXPR:
12249 case TRUTH_ANDIF_EXPR:
12250 case TRUTH_ORIF_EXPR:
e35b68b0 12251 case EQ_EXPR:
e04a16fb
AG		 12252 case NE_EXPR:
12253 case GT_EXPR:
12254 case GE_EXPR:
12255 case LT_EXPR:
12256 case LE_EXPR:
12257 /* Operands 0 and 1 are WFL in certain cases only. patch_binop
12258 knows how to handle those cases. */
12259 wfl_op1 = TREE_OPERAND (node, 0);
12260 wfl_op2 = TREE_OPERAND (node, 1);
b67d701b 12261
15fdcfe9 12262 CAN_COMPLETE_NORMALLY (node) = 1;
b67d701b
PB		 12263 /* Don't complete string nodes if dealing with the PLUS operand. */
12264 if (TREE_CODE (node) != PLUS_EXPR || !JSTRING_P (wfl_op1))
2aa11e97
APB		 12265 {
12266 nn = java_complete_tree (wfl_op1);
12267 if (nn == error_mark_node)
12268 return error_mark_node;
48a840d9 12269
2aa11e97
APB		 12270 TREE_OPERAND (node, 0) = nn;
12271 }
b67d701b 12272 if (TREE_CODE (node) != PLUS_EXPR || !JSTRING_P (wfl_op2))
2aa11e97
APB		 12273 {
12274 nn = java_complete_tree (wfl_op2);
12275 if (nn == error_mark_node)
12276 return error_mark_node;
48a840d9 12277
2aa11e97
APB		 12278 TREE_OPERAND (node, 1) = nn;
12279 }
c67e6e14 12280 return patch_binop (node, wfl_op1, wfl_op2);
e04a16fb 12281
5e942c50
APB		 12282 case INSTANCEOF_EXPR:
12283 wfl_op1 = TREE_OPERAND (node, 0);
12284 COMPLETE_CHECK_OP_0 (node);
ce6e9147
APB		 12285 if (flag_emit_xref)
12286 {
12287 TREE_TYPE (node) = boolean_type_node;
12288 return node;
12289 }
5e942c50
APB		 12290 return patch_binop (node, wfl_op1, TREE_OPERAND (node, 1));
12291
b67d701b 12292 case UNARY_PLUS_EXPR:
e04a16fb
AG		 12293 case NEGATE_EXPR:
12294 case TRUTH_NOT_EXPR:
12295 case BIT_NOT_EXPR:
12296 case PREDECREMENT_EXPR:
12297 case PREINCREMENT_EXPR:
12298 case POSTDECREMENT_EXPR:
12299 case POSTINCREMENT_EXPR:
12300 case CONVERT_EXPR:
12301 /* There are cases were wfl_op1 is a WFL. patch_unaryop knows
12302 how to handle those cases. */
12303 wfl_op1 = TREE_OPERAND (node, 0);
15fdcfe9 12304 CAN_COMPLETE_NORMALLY (node) = 1;
e04a16fb
AG		 12305 TREE_OPERAND (node, 0) = java_complete_tree (wfl_op1);
12306 if (TREE_OPERAND (node, 0) == error_mark_node)
12307 return error_mark_node;
4a5f66c3
APB		 12308 node = patch_unaryop (node, wfl_op1);
12309 CAN_COMPLETE_NORMALLY (node) = 1;
12310 break;
e04a16fb
AG		 12311
12312 case ARRAY_REF:
12313 /* There are cases were wfl_op1 is a WFL. patch_array_ref knows
12314 how to handle those cases. */
12315 wfl_op1 = TREE_OPERAND (node, 0);
12316 TREE_OPERAND (node, 0) = java_complete_tree (wfl_op1);
12317 if (TREE_OPERAND (node, 0) == error_mark_node)
12318 return error_mark_node;
7f1d4866 12319 if (!flag_emit_class_files && !flag_emit_xref)
b67d701b 12320 TREE_OPERAND (node, 0) = save_expr (TREE_OPERAND (node, 0));
e04a16fb
AG		 12321 /* The same applies to wfl_op2 */
12322 wfl_op2 = TREE_OPERAND (node, 1);
12323 TREE_OPERAND (node, 1) = java_complete_tree (wfl_op2);
12324 if (TREE_OPERAND (node, 1) == error_mark_node)
12325 return error_mark_node;
7f1d4866 12326 if (!flag_emit_class_files && !flag_emit_xref)
22eed1e6 12327 TREE_OPERAND (node, 1) = save_expr (TREE_OPERAND (node, 1));
939d7216 12328 return patch_array_ref (node);
e04a16fb 12329
63a212ed
PB		 12330 case RECORD_TYPE:
12331 return node;;
12332
12333 case COMPONENT_REF:
12334 /* The first step in the re-write of qualified name handling. FIXME.
12335 So far, this is only to support PRIMTYPE.class -> PRIMCLASS.TYPE. */
9bbc7d9f 12336 TREE_OPERAND (node, 0) = java_complete_tree (TREE_OPERAND (node, 0));
63a212ed
PB		 12337 if (TREE_CODE (TREE_OPERAND (node, 0)) == RECORD_TYPE)
12338 {
12339 tree name = TREE_OPERAND (node, 1);
12340 tree field = lookup_field_wrapper (TREE_OPERAND (node, 0), name);
12341 if (field == NULL_TREE)
12342 {
12343 error ("missing static field `%s'", IDENTIFIER_POINTER (name));
12344 return error_mark_node;
12345 }
12346 if (! FIELD_STATIC (field))
12347 {
12348 error ("not a static field `%s'", IDENTIFIER_POINTER (name));
12349 return error_mark_node;
12350 }
12351 return field;
12352 }
12353 else
400500c4 12354 abort ();
9bbc7d9f 12355 break;
9bbc7d9f 12356
b67d701b 12357 case THIS_EXPR:
e04a16fb
AG		 12358 /* Can't use THIS in a static environment */
12359 if (!current_this)
12360 {
12361 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
781b0558
KG		 12362 parse_error_context (wfl_operator,
12363 "Keyword `this' used outside allowed context");
e04a16fb
AG		 12364 TREE_TYPE (node) = error_mark_node;
12365 return error_mark_node;
12366 }
22eed1e6
APB		 12367 if (ctxp->explicit_constructor_p)
12368 {
12369 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
e35b68b0 12370 parse_error_context
781b0558 12371 (wfl_operator, "Can't reference `this' or `super' before the superclass constructor has been called");
22eed1e6
APB		 12372 TREE_TYPE (node) = error_mark_node;
12373 return error_mark_node;
12374 }
e04a16fb 12375 return current_this;
e35b68b0 12376
c2952b01
APB		 12377 case CLASS_LITERAL:
12378 CAN_COMPLETE_NORMALLY (node) = 1;
12379 node = patch_incomplete_class_ref (node);
12380 if (node == error_mark_node)
12381 return error_mark_node;
12382 break;
12383
e04a16fb 12384 default:
15fdcfe9 12385 CAN_COMPLETE_NORMALLY (node) = 1;
b67d701b 12386 /* Ok: may be we have a STRING_CST or a crafted `StringBuffer'
c2952b01
APB		 12387 and it's time to turn it into the appropriate String object */
12388 if ((nn = patch_string (node)))
12389 node = nn;
12390 else
400500c4 12391 internal_error ("No case for %s", tree_code_name [TREE_CODE (node)]);
e04a16fb
AG		 12392 }
12393 return node;
12394}
12395
ee142fe7 12396/* Complete function call's argument. Return a nonzero value is an
e04a16fb
AG		 12397 error was found. */
12398
12399static int
0a2f0c54 12400complete_function_arguments (tree node)
e04a16fb
AG		 12401{
12402 int flag = 0;
12403 tree cn;
12404
f63991a8 12405 ctxp->explicit_constructor_p += (CALL_EXPLICIT_CONSTRUCTOR_P (node) ? 1 : 0);
e04a16fb
AG		 12406 for (cn = TREE_OPERAND (node, 1); cn; cn = TREE_CHAIN (cn))
12407 {
b67d701b 12408 tree wfl = TREE_VALUE (cn), parm, temp;
e04a16fb 12409 parm = java_complete_tree (wfl);
c2952b01 12410
e04a16fb
AG		 12411 if (parm == error_mark_node)
12412 {
12413 flag = 1;
12414 continue;
12415 }
fe0b9fb5
RM		 12416 /* If we have a string literal that we haven't transformed yet or a
12417 crafted string buffer, as a result of the use of the String
b67d701b
PB		 12418 `+' operator. Build `parm.toString()' and expand it. */
12419 if ((temp = patch_string (parm)))
b9f7e36c 12420 parm = temp;
b9f7e36c 12421
5e942c50 12422 TREE_VALUE (cn) = parm;
e04a16fb 12423 }
f63991a8 12424 ctxp->explicit_constructor_p -= (CALL_EXPLICIT_CONSTRUCTOR_P (node) ? 1 : 0);
e04a16fb
AG		 12425 return flag;
12426}
12427
12428/* Sometimes (for loops and variable initialized during their
12429 declaration), we want to wrap a statement around a WFL and turn it
12430 debugable. */
12431
12432static tree
0a2f0c54 12433build_debugable_stmt (int location, tree stmt)
e04a16fb
AG		 12434{
12435 if (TREE_CODE (stmt) != EXPR_WITH_FILE_LOCATION)
12436 {
9ec819d4
PB		 12437#ifdef USE_MAPPED_LOCATION
12438 stmt = expr_add_location (stmt, location, 1);
12439#else
e04a16fb
AG		 12440 stmt = build_expr_wfl (stmt, input_filename, 0, 0);
12441 EXPR_WFL_LINECOL (stmt) = location;
9ec819d4
PB		 12442 JAVA_MAYBE_GENERATE_DEBUG_INFO (stmt);
12443#endif
e04a16fb 12444 }
e04a16fb
AG		 12445 return stmt;
12446}
12447
12448static tree
0a2f0c54 12449build_expr_block (tree body, tree decls)
e04a16fb
AG		 12450{
12451 tree node = make_node (BLOCK);
12452 BLOCK_EXPR_DECLS (node) = decls;
b67d701b 12453 BLOCK_EXPR_BODY (node) = body;
e04a16fb
AG		 12454 if (body)
12455 TREE_TYPE (node) = TREE_TYPE (body);
12456 TREE_SIDE_EFFECTS (node) = 1;
12457 return node;
12458}
12459
a83f01f0 12460/* Create a new function block and link it appropriately to current
b67d701b 12461 function block chain */
e04a16fb
AG		 12462
12463static tree
0a2f0c54 12464enter_block (void)
e04a16fb 12465{
47a50de9 12466 tree b = build_expr_block (NULL_TREE, NULL_TREE);
b67d701b 12467
47a50de9
PB		 12468 /* Link block B supercontext to the previous block. The current
12469 function DECL is used as supercontext when enter_a_block is called
12470 for the first time for a given function. The current function body
12471 (DECL_FUNCTION_BODY) is set to be block B. */
b67d701b 12472
e35b68b0 12473 tree fndecl = current_function_decl;
e04a16fb 12474
f099f336
APB		 12475 if (!fndecl) {
12476 BLOCK_SUPERCONTEXT (b) = current_static_block;
12477 current_static_block = b;
12478 }
12479
12480 else if (!DECL_FUNCTION_BODY (fndecl))
e04a16fb
AG		 12481 {
12482 BLOCK_SUPERCONTEXT (b) = fndecl;
12483 DECL_FUNCTION_BODY (fndecl) = b;
12484 }
12485 else
12486 {
12487 BLOCK_SUPERCONTEXT (b) = DECL_FUNCTION_BODY (fndecl);
12488 DECL_FUNCTION_BODY (fndecl) = b;
12489 }
12490 return b;
12491}
12492
12493/* Exit a block by changing the current function body
12494 (DECL_FUNCTION_BODY) to the current block super context, only if
12495 the block being exited isn't the method's top level one. */
12496
12497static tree
0a2f0c54 12498exit_block (void)
e04a16fb 12499{
f099f336
APB		 12500 tree b;
12501 if (current_function_decl)
12502 {
12503 b = DECL_FUNCTION_BODY (current_function_decl);
12504 if (BLOCK_SUPERCONTEXT (b) != current_function_decl)
12505 DECL_FUNCTION_BODY (current_function_decl) = BLOCK_SUPERCONTEXT (b);
12506 }
12507 else
12508 {
12509 b = current_static_block;
e04a16fb 12510
f099f336
APB		 12511 if (BLOCK_SUPERCONTEXT (b))
12512 current_static_block = BLOCK_SUPERCONTEXT (b);
12513 }
e04a16fb
AG		 12514 return b;
12515}
12516
12517/* Lookup for NAME in the nested function's blocks, all the way up to
12518 the current toplevel one. It complies with Java's local variable
12519 scoping rules. */
12520
12521static tree
0a2f0c54 12522lookup_name_in_blocks (tree name)
e04a16fb 12523{
f099f336 12524 tree b = GET_CURRENT_BLOCK (current_function_decl);
e04a16fb
AG		 12525
12526 while (b != current_function_decl)
12527 {
12528 tree current;
12529
12530 /* Paranoid sanity check. To be removed */
12531 if (TREE_CODE (b) != BLOCK)
400500c4 12532 abort ();
e04a16fb 12533
e35b68b0 12534 for (current = BLOCK_EXPR_DECLS (b); current;
e04a16fb
AG		 12535 current = TREE_CHAIN (current))
12536 if (DECL_NAME (current) == name)
12537 return current;
12538 b = BLOCK_SUPERCONTEXT (b);
12539 }
12540 return NULL_TREE;
12541}
12542
12543static void
0a2f0c54 12544maybe_absorb_scoping_blocks (void)
e04a16fb 12545{
b16e8f08 12546 while (BLOCK_IS_IMPLICIT (GET_CURRENT_BLOCK (current_function_decl)))
e04a16fb
AG		 12547 {
12548 tree b = exit_block ();
12549 java_method_add_stmt (current_function_decl, b);
d479d37f 12550 SOURCE_FRONTEND_DEBUG (("Absorbing scoping block at line %d", input_line));
e04a16fb
AG		 12551 }
12552}
12553
12554\f
12555/* This section of the source is reserved to build_* functions that
12556 are building incomplete tree nodes and the patch_* functions that
12557 are completing them. */
12558
c2952b01 12559/* Wrap a non WFL node around a WFL. */
41ee0877 12560
c2952b01 12561static tree
0a2f0c54 12562build_wfl_wrap (tree node, int location)
c2952b01
APB		 12563{
12564 tree wfl, node_to_insert = node;
e35b68b0 12565
67264b4f 12566 /* We want to process THIS . xxx symbolically, to keep it consistent
c2952b01
APB		 12567 with the way we're processing SUPER. A THIS from a primary as a
12568 different form than a SUPER. Turn THIS into something symbolic */
12569 if (TREE_CODE (node) == THIS_EXPR)
12570 node_to_insert = wfl = build_wfl_node (this_identifier_node);
12571 else
9ec819d4
PB		 12572#ifdef USE_MAPPED_LOCATION
12573 wfl = build_unknown_wfl (NULL_TREE);
12574
12575 SET_EXPR_LOCATION (wfl, location);
12576#else
c2952b01
APB		 12577 wfl = build_expr_wfl (NULL_TREE, ctxp->filename, 0, 0);
12578
9a7ab4b3 12579 EXPR_WFL_LINECOL (wfl) = location;
9ec819d4 12580#endif
c2952b01
APB		 12581 EXPR_WFL_QUALIFICATION (wfl) = build_tree_list (node_to_insert, NULL_TREE);
12582 return wfl;
12583}
12584
6de9cd9a 12585/* Build a super() constructor invocation. Returns an empty statement if
22eed1e6
APB		 12586 we're currently dealing with the class java.lang.Object. */
12587
12588static tree
0a2f0c54 12589build_super_invocation (tree mdecl)
22eed1e6 12590{
e920ebc9 12591 if (DECL_CONTEXT (mdecl) == object_type_node)
6de9cd9a 12592 return build_java_empty_stmt ();
22eed1e6
APB		 12593 else
12594 {
9ee9b555 12595 tree super_wfl = build_wfl_node (super_identifier_node);
6fd876ac
HPN		 12596 tree a = NULL_TREE, t;
12597
d3ecb597
BM		 12598 /* This is called after parsing is done, so the parser context
12599 won't be accurate. Set location info from current_class decl. */
12600 tree class_wfl = lookup_cl (TYPE_NAME (current_class));
12601 EXPR_WFL_LINECOL (super_wfl) = EXPR_WFL_LINECOL (class_wfl);
6fd876ac 12602
c2952b01
APB		 12603 /* If we're dealing with an anonymous class, pass the arguments
12604 of the crafted constructor along. */
12605 if (ANONYMOUS_CLASS_P (DECL_CONTEXT (mdecl)))
12606 {
12607 SKIP_THIS_AND_ARTIFICIAL_PARMS (t, mdecl);
12608 for (; t != end_params_node; t = TREE_CHAIN (t))
12609 a = tree_cons (NULL_TREE, build_wfl_node (TREE_PURPOSE (t)), a);
12610 }
12611 return build_method_invocation (super_wfl, a);
22eed1e6
APB		 12612 }
12613}
12614
12615/* Build a SUPER/THIS qualified method invocation. */
12616
12617static tree
0a2f0c54
KG		 12618build_this_super_qualified_invocation (int use_this, tree name, tree args,
12619 int lloc, int rloc)
22eed1e6
APB		 12620{
12621 tree invok;
e35b68b0 12622 tree wfl =
9ee9b555 12623 build_wfl_node (use_this ? this_identifier_node : super_identifier_node);
22eed1e6
APB		 12624 EXPR_WFL_LINECOL (wfl) = lloc;
12625 invok = build_method_invocation (name, args);
12626 return make_qualified_primary (wfl, invok, rloc);
12627}
12628
b67d701b 12629/* Build an incomplete CALL_EXPR node. */
e04a16fb
AG		 12630
12631static tree
0a2f0c54 12632build_method_invocation (tree name, tree args)
e04a16fb 12633{
dc6d7095 12634 tree call = build3 (CALL_EXPR, NULL_TREE, name, args, NULL_TREE);
e04a16fb 12635 TREE_SIDE_EFFECTS (call) = 1;
b67d701b
PB		 12636 EXPR_WFL_LINECOL (call) = EXPR_WFL_LINECOL (name);
12637 return call;
12638}
12639
12640/* Build an incomplete new xxx(...) node. */
12641
12642static tree
0a2f0c54 12643build_new_invocation (tree name, tree args)
b67d701b 12644{
dc6d7095 12645 tree call = build3 (NEW_CLASS_EXPR, NULL_TREE, name, args, NULL_TREE);
b67d701b 12646 TREE_SIDE_EFFECTS (call) = 1;
e04a16fb
AG		 12647 EXPR_WFL_LINECOL (call) = EXPR_WFL_LINECOL (name);
12648 return call;
12649}
12650
12651/* Build an incomplete assignment expression. */
12652
12653static tree
0a2f0c54 12654build_assignment (int op, int op_location, tree lhs, tree rhs)
e04a16fb
AG		 12655{
12656 tree assignment;
12657 /* Build the corresponding binop if we deal with a Compound
12658 Assignment operator. Mark the binop sub-tree as part of a
12659 Compound Assignment expression */
12660 if (op != ASSIGN_TK)
12661 {
12662 rhs = build_binop (BINOP_LOOKUP (op), op_location, lhs, rhs);
12663 COMPOUND_ASSIGN_P (rhs) = 1;
12664 }
dc6d7095 12665 assignment = build2 (MODIFY_EXPR, NULL_TREE, lhs, rhs);
e04a16fb
AG		 12666 TREE_SIDE_EFFECTS (assignment) = 1;
12667 EXPR_WFL_LINECOL (assignment) = op_location;
12668 return assignment;
12669}
12670
0a32c5ea
TT		 12671/* Print an INTEGER_CST node as decimal in a static buffer, and return
12672 the buffer. This is used only for string conversion. */
12673static char *
0a2f0c54 12674string_convert_int_cst (tree node)
0a32c5ea 12675{
04a0be36
EB		 12676 /* Long.MIN_VALUE is -9223372036854775808, 20 characters. */
12677 static char buffer[21];
0a32c5ea
TT		 12678
12679 unsigned HOST_WIDE_INT lo = TREE_INT_CST_LOW (node);
12680 unsigned HOST_WIDE_INT hi = TREE_INT_CST_HIGH (node);
04a0be36 12681 char *p = buffer + sizeof (buffer);
0a32c5ea
TT		 12682 int neg = 0;
12683
12684 unsigned HOST_WIDE_INT hibit = (((unsigned HOST_WIDE_INT) 1)
12685 << (HOST_BITS_PER_WIDE_INT - 1));
12686
04a0be36 12687 *--p = '\0';
0a32c5ea
TT		 12688
12689 /* If negative, note the fact and negate the value. */
12690 if ((hi & hibit))
12691 {
12692 lo = ~lo;
12693 hi = ~hi;
12694 if (++lo == 0)
12695 ++hi;
12696 neg = 1;
12697 }
12698
12699 /* Divide by 10 until there are no bits left. */
04a0be36 12700 do
0a32c5ea
TT		 12701 {
12702 unsigned HOST_WIDE_INT acc = 0;
12703 unsigned HOST_WIDE_INT outhi = 0, outlo = 0;
12704 unsigned int i;
12705
12706 /* Use long division to compute the result and the remainder. */
12707 for (i = 0; i < 2 * HOST_BITS_PER_WIDE_INT; ++i)
12708 {
12709 /* Shift a bit into accumulator. */
12710 acc <<= 1;
12711 if ((hi & hibit))
12712 acc |= 1;
e04a16fb 12713
0a32c5ea
TT		 12714 /* Shift the value. */
12715 hi <<= 1;
12716 if ((lo & hibit))
12717 hi |= 1;
12718 lo <<= 1;
12719
12720 /* Shift the correct bit into the result. */
12721 outhi <<= 1;
12722 if ((outlo & hibit))
12723 outhi |= 1;
12724 outlo <<= 1;
12725 if (acc >= 10)
12726 {
12727 acc -= 10;
12728 outlo |= 1;
12729 }
12730 }
12731
04a0be36
EB		 12732 /* '0' == 060 in Java, but might not be here (think EBCDIC). */
12733 *--p = '\060' + acc;
0a32c5ea
TT		 12734
12735 hi = outhi;
12736 lo = outlo;
12737 }
04a0be36 12738 while (hi || lo);
0a32c5ea
TT		 12739
12740 if (neg)
04a0be36 12741 *--p = '\055'; /* '-' == 055 in Java, but might not be here. */
0a32c5ea 12742
04a0be36 12743 return p;
0a32c5ea
TT		 12744}
12745
12746/* Print an INTEGER_CST node in a static buffer, and return the
12747 buffer. This is used only for error handling. */
15fdcfe9 12748char *
0a2f0c54 12749print_int_node (tree node)
e04a16fb
AG		 12750{
12751 static char buffer [80];
12752 if (TREE_CONSTANT_OVERFLOW (node))
12753 sprintf (buffer, "<overflow>");
e35b68b0 12754
e04a16fb
AG		 12755 if (TREE_INT_CST_HIGH (node) == 0)
12756 sprintf (buffer, HOST_WIDE_INT_PRINT_UNSIGNED,
12757 TREE_INT_CST_LOW (node));
12758 else if (TREE_INT_CST_HIGH (node) == -1
12759 && TREE_INT_CST_LOW (node) != 0)
90ff44cf
KG		 12760 sprintf (buffer, "-" HOST_WIDE_INT_PRINT_UNSIGNED,
12761 -TREE_INT_CST_LOW (node));
e04a16fb
AG		 12762 else
12763 sprintf (buffer, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
12764 TREE_INT_CST_HIGH (node), TREE_INT_CST_LOW (node));
12765
12766 return buffer;
12767}
12768
c7303e41 12769\f
7f1d4866
APB		 12770/* Return 1 if an assignment to a FINAL is attempted in a non suitable
12771 context. */
5e942c50 12772
e04a16fb
AG		 12773/* 15.25 Assignment operators. */
12774
12775static tree
0a2f0c54 12776patch_assignment (tree node, tree wfl_op1)
e04a16fb 12777{
0a2138e2 12778 tree rhs = TREE_OPERAND (node, 1);
5e942c50 12779 tree lvalue = TREE_OPERAND (node, 0), llvalue;
cd531a2e 12780 tree lhs_type = NULL_TREE, rhs_type, new_rhs = NULL_TREE;
e04a16fb
AG		 12781 int error_found = 0;
12782 int lvalue_from_array = 0;
56b8325e 12783 int is_return = 0;
e04a16fb 12784
e04a16fb
AG		 12785 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
12786
12787 /* Lhs can be a named variable */
34f4db93 12788 if (JDECL_P (lvalue))
e04a16fb 12789 {
e04a16fb
AG		 12790 lhs_type = TREE_TYPE (lvalue);
12791 }
022dcc46
BM		 12792 /* Or Lhs can be an array access. */
12793 else if (TREE_CODE (lvalue) == ARRAY_REF)
e04a16fb
AG		 12794 {
12795 lhs_type = TREE_TYPE (lvalue);
12796 lvalue_from_array = 1;
12797 }
12798 /* Or a field access */
12799 else if (TREE_CODE (lvalue) == COMPONENT_REF)
12800 lhs_type = TREE_TYPE (lvalue);
12801 /* Or a function return slot */
12802 else if (TREE_CODE (lvalue) == RESULT_DECL)
56b8325e
TT		 12803 {
12804 /* If the return type is an integral type, then we create the
12805 RESULT_DECL with a promoted type, but we need to do these
12806 checks against the unpromoted type to ensure type safety. So
12807 here we look at the real type, not the type of the decl we
12808 are modifying. */
12809 lhs_type = TREE_TYPE (TREE_TYPE (current_function_decl));
12810 is_return = 1;
12811 }
5e942c50
APB		 12812 /* Otherwise, we might want to try to write into an optimized static
12813 final, this is an of a different nature, reported further on. */
12814 else if (TREE_CODE (wfl_op1) == EXPR_WITH_FILE_LOCATION
1504b2b4 12815 && resolve_expression_name (wfl_op1, &llvalue))
5e942c50 12816 {
4f88ccda 12817 lhs_type = TREE_TYPE (lvalue);
5e942c50 12818 }
e35b68b0 12819 else
e04a16fb
AG		 12820 {
12821 parse_error_context (wfl_op1, "Invalid left hand side of assignment");
12822 error_found = 1;
12823 }
12824
12825 rhs_type = TREE_TYPE (rhs);
56b8325e 12826
b67d701b 12827 /* 5.1 Try the assignment conversion for builtin type. */
0a2138e2 12828 new_rhs = try_builtin_assignconv (wfl_op1, lhs_type, rhs);
e04a16fb 12829
b67d701b 12830 /* 5.2 If it failed, try a reference conversion */
5238574f
JS		 12831 if (!new_rhs)
12832 new_rhs = try_reference_assignconv (lhs_type, rhs);
e04a16fb
AG		 12833
12834 /* 15.25.2 If we have a compound assignment, convert RHS into the
12835 type of the LHS */
12836 else if (COMPOUND_ASSIGN_P (TREE_OPERAND (node, 1)))
12837 new_rhs = convert (lhs_type, rhs);
12838
12839 /* Explicit cast required. This is an error */
12840 if (!new_rhs)
12841 {
c2e3db92
KG		 12842 char *t1 = xstrdup (lang_printable_name (TREE_TYPE (rhs), 0));
12843 char *t2 = xstrdup (lang_printable_name (lhs_type, 0));
e04a16fb
AG		 12844 tree wfl;
12845 char operation [32]; /* Max size known */
12846
12847 /* If the assignment is part of a declaration, we use the WFL of
12848 the declared variable to point out the error and call it a
12849 declaration problem. If the assignment is a genuine =
12850 operator, we call is a operator `=' problem, otherwise we
12851 call it an assignment problem. In both of these last cases,
12852 we use the WFL of the operator to indicate the error. */
12853
12854 if (MODIFY_EXPR_FROM_INITIALIZATION_P (node))
12855 {
12856 wfl = wfl_op1;
12857 strcpy (operation, "declaration");
12858 }
12859 else
12860 {
12861 wfl = wfl_operator;
12862 if (COMPOUND_ASSIGN_P (TREE_OPERAND (node, 1)))
12863 strcpy (operation, "assignment");
56b8325e 12864 else if (is_return)
e04a16fb
AG		 12865 strcpy (operation, "`return'");
12866 else
12867 strcpy (operation, "`='");
12868 }
12869
1ebadc60 12870 if (!valid_cast_to_p (rhs_type, lhs_type))
781b0558
KG		 12871 parse_error_context
12872 (wfl, "Incompatible type for %s. Can't convert `%s' to `%s'",
12873 operation, t1, t2);
1ebadc60 12874 else
781b0558 12875 parse_error_context (wfl, "Incompatible type for %s. Explicit cast needed to convert `%s' to `%s'",
1ebadc60 12876 operation, t1, t2);
e04a16fb
AG		 12877 free (t1); free (t2);
12878 error_found = 1;
12879 }
12880
e04a16fb
AG		 12881 if (error_found)
12882 return error_mark_node;
12883
56b8325e
TT		 12884 /* If we're processing a `return' statement, promote the actual type
12885 to the promoted type. */
12886 if (is_return)
12887 new_rhs = convert (TREE_TYPE (lvalue), new_rhs);
12888
2622b947
APB		 12889 /* 10.10: Array Store Exception runtime check */
12890 if (!flag_emit_class_files
e8fc7396 12891 && !flag_emit_xref
e35b68b0 12892 && lvalue_from_array
afc390b1 12893 && JREFERENCE_TYPE_P (TYPE_ARRAY_ELEMENT (lhs_type)))
2622b947 12894 {
022dcc46 12895 tree array, store_check, base, index_expr;
e35b68b0
AD		 12896
12897 /* Save RHS so that it doesn't get re-evaluated by the store check. */
884523df 12898 new_rhs = save_expr (new_rhs);
2622b947 12899
022dcc46
BM		 12900 /* Get the INDIRECT_REF. */
12901 array = TREE_OPERAND (TREE_OPERAND (lvalue, 0), 0);
12902 /* Get the array pointer expr. */
12903 array = TREE_OPERAND (array, 0);
12904 store_check = build_java_arraystore_check (array, new_rhs);
e35b68b0 12905
022dcc46 12906 index_expr = TREE_OPERAND (lvalue, 1);
e35b68b0 12907
022dcc46 12908 if (TREE_CODE (index_expr) == COMPOUND_EXPR)
2622b947 12909 {
e35b68b0 12910 /* A COMPOUND_EXPR here is a bounds check. The bounds check must
022dcc46
BM		 12911 happen before the store check, so prepare to insert the store
12912 check within the second operand of the existing COMPOUND_EXPR. */
12913 base = index_expr;
2622b947 12914 }
7abecd65 12915 else
022dcc46 12916 base = lvalue;
e35b68b0 12917
022dcc46 12918 index_expr = TREE_OPERAND (base, 1);
dc6d7095
RS		 12919 TREE_OPERAND (base, 1) = build2 (COMPOUND_EXPR, TREE_TYPE (index_expr),
12920 store_check, index_expr);
2622b947 12921 }
22eed1e6 12922
34d4df06
APB		 12923 /* Final locals can be used as case values in switch
12924 statement. Prepare them for this eventuality. */
e35b68b0 12925 if (TREE_CODE (lvalue) == VAR_DECL
4f88ccda 12926 && DECL_FINAL (lvalue)
34d4df06
APB		 12927 && TREE_CONSTANT (new_rhs)
12928 && IDENTIFIER_LOCAL_VALUE (DECL_NAME (lvalue))
12929 && JINTEGRAL_TYPE_P (TREE_TYPE (lvalue))
12930 )
12931 {
12932 TREE_CONSTANT (lvalue) = 1;
6de9cd9a 12933 TREE_INVARIANT (lvalue) = 1;
34d4df06
APB		 12934 DECL_INITIAL (lvalue) = new_rhs;
12935 }
12936
50cbc605 12937 /* Copy the rhs if it's a reference. */
c78f2b91 12938 if (! flag_check_references && ! flag_emit_class_files && optimize > 0)
50cbc605
AH		 12939 {
12940 switch (TREE_CODE (new_rhs))
12941 {
12942 case ARRAY_REF:
12943 case INDIRECT_REF:
12944 case COMPONENT_REF:
12945 /* Transform a = foo.bar
6de9cd9a 12946 into a = ({int tmp; tmp = foo.bar;}).
50cbc605
AH		 12947 We need to ensure that if a read from memory fails
12948 because of a NullPointerException, a destination variable
12949 will remain unchanged. An explicit temporary does what
12950 we need.
12951
12952 If flag_check_references is set, this is unnecessary
12953 because we'll check each reference before doing any
12954 reads. If optimize is not set the result will never be
12955 written to a stack slot that contains the LHS. */
12956 {
12957 tree tmp = build_decl (VAR_DECL, get_identifier ("<tmp>"),
12958 TREE_TYPE (new_rhs));
1456deaf 12959 tree block = make_node (BLOCK);
50cbc605 12960 tree assignment
dc6d7095 12961 = build2 (MODIFY_EXPR, TREE_TYPE (new_rhs), tmp, fold (new_rhs));
916b57ce 12962 DECL_CONTEXT (tmp) = current_function_decl;
1456deaf 12963 TREE_TYPE (block) = TREE_TYPE (new_rhs);
50cbc605 12964 BLOCK_VARS (block) = tmp;
6de9cd9a 12965 BLOCK_EXPR_BODY (block) = assignment;
50cbc605
AH		 12966 TREE_SIDE_EFFECTS (block) = 1;
12967 new_rhs = block;
12968 }
12969 break;
12970 default:
12971 break;
12972 }
12973 }
12974
e04a16fb
AG		 12975 TREE_OPERAND (node, 0) = lvalue;
12976 TREE_OPERAND (node, 1) = new_rhs;
12977 TREE_TYPE (node) = lhs_type;
12978 return node;
12979}
12980
b67d701b 12981/* Check that type SOURCE can be cast into type DEST. If the cast
7754e0a9
APB		 12982 can't occur at all, return NULL; otherwise, return a possibly
12983 modified rhs. */
e04a16fb 12984
b67d701b 12985static tree
0a2f0c54 12986try_reference_assignconv (tree lhs_type, tree rhs)
e04a16fb 12987{
b67d701b
PB		 12988 tree new_rhs = NULL_TREE;
12989 tree rhs_type = TREE_TYPE (rhs);
e04a16fb 12990
b67d701b
PB		 12991 if (!JPRIMITIVE_TYPE_P (rhs_type) && JREFERENCE_TYPE_P (lhs_type))
12992 {
12993 /* `null' may be assigned to any reference type */
12994 if (rhs == null_pointer_node)
12995 new_rhs = null_pointer_node;
12996 /* Try the reference assignment conversion */
12997 else if (valid_ref_assignconv_cast_p (rhs_type, lhs_type, 0))
12998 new_rhs = rhs;
12999 /* This is a magic assignment that we process differently */
f17f1898 13000 else if (TREE_CODE (rhs) == JAVA_EXC_OBJ_EXPR)
b67d701b
PB		 13001 new_rhs = rhs;
13002 }
13003 return new_rhs;
13004}
13005
13006/* Check that RHS can be converted into LHS_TYPE by the assignment
13007 conversion (5.2), for the cases of RHS being a builtin type. Return
13008 NULL_TREE if the conversion fails or if because RHS isn't of a
13009 builtin type. Return a converted RHS if the conversion is possible. */
13010
13011static tree
0a2f0c54 13012try_builtin_assignconv (tree wfl_op1, tree lhs_type, tree rhs)
b67d701b
PB		 13013{
13014 tree new_rhs = NULL_TREE;
13015 tree rhs_type = TREE_TYPE (rhs);
13016
7e51098e
TT		 13017 /* Handle boolean specially. */
13018 if (TREE_CODE (rhs_type) == BOOLEAN_TYPE
13019 || TREE_CODE (lhs_type) == BOOLEAN_TYPE)
13020 {
13021 if (TREE_CODE (rhs_type) == BOOLEAN_TYPE
13022 && TREE_CODE (lhs_type) == BOOLEAN_TYPE)
13023 new_rhs = rhs;
13024 }
13025
b67d701b
PB		 13026 /* 5.1.1 Try Identity Conversion,
13027 5.1.2 Try Widening Primitive Conversion */
5e942c50 13028 else if (valid_builtin_assignconv_identity_widening_p (lhs_type, rhs_type))
b67d701b
PB		 13029 new_rhs = convert (lhs_type, rhs);
13030
e35b68b0 13031 /* Try a narrowing primitive conversion (5.1.3):
83dd5fae 13032 - expression is a constant expression of type byte, short, char,
f724acb8 13033 or int, AND
b67d701b 13034 - variable is byte, short or char AND
e35b68b0 13035 - The value of the expression is representable in the type of the
b67d701b 13036 variable */
83dd5fae
TT		 13037 else if ((rhs_type == byte_type_node || rhs_type == short_type_node
13038 || rhs_type == char_type_node || rhs_type == int_type_node)
13039 && TREE_CONSTANT (rhs)
b67d701b
PB		 13040 && (lhs_type == byte_type_node || lhs_type == char_type_node
13041 || lhs_type == short_type_node))
13042 {
13043 if (int_fits_type_p (rhs, lhs_type))
13044 new_rhs = convert (lhs_type, rhs);
13045 else if (wfl_op1) /* Might be called with a NULL */
e35b68b0
AD		 13046 parse_warning_context
13047 (wfl_op1, "Constant expression `%s' too wide for narrowing primitive conversion to `%s'",
0a2138e2 13048 print_int_node (rhs), lang_printable_name (lhs_type, 0));
b67d701b
PB		 13049 /* Reported a warning that will turn into an error further
13050 down, so we don't return */
13051 }
13052
13053 return new_rhs;
13054}
13055
13056/* Return 1 if RHS_TYPE can be converted to LHS_TYPE by identity
c00f0fb2 13057 conversion (5.1.1) or widening primitive conversion (5.1.2). Return
b67d701b 13058 0 is the conversion test fails. This implements parts the method
67264b4f 13059 invocation conversion (5.3). */
b67d701b
PB		 13060
13061static int
0a2f0c54 13062valid_builtin_assignconv_identity_widening_p (tree lhs_type, tree rhs_type)
b67d701b 13063{
acd663ee 13064 /* 5.1.1: This is the identity conversion part. */
5e942c50
APB		 13065 if (lhs_type == rhs_type)
13066 return 1;
13067
7e51098e
TT		 13068 /* Reject non primitive types and boolean conversions. */
13069 if (!JNUMERIC_TYPE_P (lhs_type) || !JNUMERIC_TYPE_P (rhs_type))
b67d701b
PB		 13070 return 0;
13071
acd663ee
APB		 13072 /* 5.1.2: widening primitive conversion. byte, even if it's smaller
13073 than a char can't be converted into a char. Short can't too, but
13074 the < test below takes care of that */
b67d701b
PB		 13075 if (lhs_type == char_type_node && rhs_type == byte_type_node)
13076 return 0;
13077
5e942c50
APB		 13078 /* Accept all promoted type here. Note, we can't use <= in the test
13079 below, because we still need to bounce out assignments of short
13080 to char and the likes */
13081 if (lhs_type == int_type_node
13082 && (rhs_type == promoted_byte_type_node
13083 || rhs_type == promoted_short_type_node
13084 || rhs_type == promoted_char_type_node
13085 || rhs_type == promoted_boolean_type_node))
13086 return 1;
13087
acd663ee
APB		 13088 /* From here, an integral is widened if its precision is smaller
13089 than the precision of the LHS or if the LHS is a floating point
13090 type, or the RHS is a float and the RHS a double. */
e35b68b0 13091 if ((JINTEGRAL_TYPE_P (rhs_type) && JINTEGRAL_TYPE_P (lhs_type)
acd663ee
APB		 13092 && (TYPE_PRECISION (rhs_type) < TYPE_PRECISION (lhs_type)))
13093 || (JINTEGRAL_TYPE_P (rhs_type) && JFLOAT_TYPE_P (lhs_type))
13094 || (rhs_type == float_type_node && lhs_type == double_type_node))
b67d701b
PB		 13095 return 1;
13096
13097 return 0;
e04a16fb
AG		 13098}
13099
13100/* Check that something of SOURCE type can be assigned or cast to
13101 something of DEST type at runtime. Return 1 if the operation is
13102 valid, 0 otherwise. If CAST is set to 1, we're treating the case
13103 were SOURCE is cast into DEST, which borrows a lot of the
13104 assignment check. */
13105
13106static int
0a2f0c54 13107valid_ref_assignconv_cast_p (tree source, tree dest, int cast)
e04a16fb 13108{
09ed0f70
APB		 13109 /* SOURCE or DEST might be null if not from a declared entity. */
13110 if (!source || !dest)
13111 return 0;
5e942c50
APB		 13112 if (JNULLP_TYPE_P (source))
13113 return 1;
e04a16fb
AG		 13114 if (TREE_CODE (source) == POINTER_TYPE)
13115 source = TREE_TYPE (source);
13116 if (TREE_CODE (dest) == POINTER_TYPE)
13117 dest = TREE_TYPE (dest);
c1eacb70
BM		 13118
13119 /* If source and dest are being compiled from bytecode, they may need to
13120 be loaded. */
13121 if (CLASS_P (source) && !CLASS_LOADED_P (source))
13122 {
13123 load_class (source, 1);
13124 safe_layout_class (source);
13125 }
13126 if (CLASS_P (dest) && !CLASS_LOADED_P (dest))
13127 {
13128 load_class (dest, 1);
13129 safe_layout_class (dest);
13130 }
13131
e04a16fb
AG		 13132 /* Case where SOURCE is a class type */
13133 if (TYPE_CLASS_P (source))
13134 {
13135 if (TYPE_CLASS_P (dest))
e35b68b0 13136 return (source == dest
c2952b01 13137 || inherits_from_p (source, dest)
c2952b01 13138 || (cast && inherits_from_p (dest, source)));
e04a16fb
AG		 13139 if (TYPE_INTERFACE_P (dest))
13140 {
13141 /* If doing a cast and SOURCE is final, the operation is
13142 always correct a compile time (because even if SOURCE
13143 does not implement DEST, a subclass of SOURCE might). */
13144 if (cast && !CLASS_FINAL (TYPE_NAME (source)))
13145 return 1;
13146 /* Otherwise, SOURCE must implement DEST */
13147 return interface_of_p (dest, source);
13148 }
67264b4f 13149 /* DEST is an array, cast permitted if SOURCE is of Object type */
e04a16fb
AG		 13150 return (cast && source == object_type_node ? 1 : 0);
13151 }
13152 if (TYPE_INTERFACE_P (source))
13153 {
13154 if (TYPE_CLASS_P (dest))
13155 {
13156 /* If not casting, DEST must be the Object type */
13157 if (!cast)
13158 return dest == object_type_node;
13159 /* We're doing a cast. The cast is always valid is class
13160 DEST is not final, otherwise, DEST must implement SOURCE */
b67d701b 13161 else if (!CLASS_FINAL (TYPE_NAME (dest)))
e04a16fb
AG		 13162 return 1;
13163 else
13164 return interface_of_p (source, dest);
13165 }
13166 if (TYPE_INTERFACE_P (dest))
13167 {
13168 /* If doing a cast, then if SOURCE and DEST contain method
13169 with the same signature but different return type, then
13170 this is a (compile time) error */
13171 if (cast)
13172 {
13173 tree method_source, method_dest;
13174 tree source_type;
0a2138e2 13175 tree source_sig;
e04a16fb 13176 tree source_name;
e35b68b0 13177 for (method_source = TYPE_METHODS (source); method_source;
e04a16fb
AG		 13178 method_source = TREE_CHAIN (method_source))
13179 {
e35b68b0 13180 source_sig =
e04a16fb
AG		 13181 build_java_argument_signature (TREE_TYPE (method_source));
13182 source_type = TREE_TYPE (TREE_TYPE (method_source));
13183 source_name = DECL_NAME (method_source);
13184 for (method_dest = TYPE_METHODS (dest);
13185 method_dest; method_dest = TREE_CHAIN (method_dest))
e35b68b0 13186 if (source_sig ==
e04a16fb
AG		 13187 build_java_argument_signature (TREE_TYPE (method_dest))
13188 && source_name == DECL_NAME (method_dest)
13189 && source_type != TREE_TYPE (TREE_TYPE (method_dest)))
13190 return 0;
13191 }
13192 return 1;
13193 }
13194 else
13195 return source == dest || interface_of_p (dest, source);
13196 }
ee17a290
TT		 13197 else
13198 {
13199 /* Array */
13200 return (cast
5602b49d
TT		 13201 && (DECL_NAME (TYPE_NAME (source))
13202 == java_lang_cloneable_identifier_node
ee17a290 13203 || (DECL_NAME (TYPE_NAME (source))
5602b49d 13204 == java_io_serializable_identifier_node)));
ee17a290 13205 }
e04a16fb
AG		 13206 }
13207 if (TYPE_ARRAY_P (source))
13208 {
13209 if (TYPE_CLASS_P (dest))
13210 return dest == object_type_node;
09ed0f70 13211 /* Can't cast an array to an interface unless the interface is
ee17a290 13212 java.lang.Cloneable or java.io.Serializable. */
e04a16fb 13213 if (TYPE_INTERFACE_P (dest))
5602b49d
TT		 13214 return (DECL_NAME (TYPE_NAME (dest))
13215 == java_lang_cloneable_identifier_node
13216 || (DECL_NAME (TYPE_NAME (dest))
13217 == java_io_serializable_identifier_node));
e04a16fb
AG		 13218 else /* Arrays */
13219 {
13220 tree source_element_type = TYPE_ARRAY_ELEMENT (source);
13221 tree dest_element_type = TYPE_ARRAY_ELEMENT (dest);
e35b68b0 13222
b9f7e36c
APB		 13223 /* In case of severe errors, they turn out null */
13224 if (!dest_element_type || !source_element_type)
13225 return 0;
e04a16fb
AG		 13226 if (source_element_type == dest_element_type)
13227 return 1;
13228 return valid_ref_assignconv_cast_p (source_element_type,
13229 dest_element_type, cast);
13230 }
13231 return 0;
13232 }
13233 return 0;
13234}
13235
b67d701b 13236static int
0a2f0c54 13237valid_cast_to_p (tree source, tree dest)
b67d701b
PB		 13238{
13239 if (TREE_CODE (source) == POINTER_TYPE)
13240 source = TREE_TYPE (source);
13241 if (TREE_CODE (dest) == POINTER_TYPE)
13242 dest = TREE_TYPE (dest);
13243
13244 if (TREE_CODE (source) == RECORD_TYPE && TREE_CODE (dest) == RECORD_TYPE)
13245 return valid_ref_assignconv_cast_p (source, dest, 1);
13246
13247 else if (JNUMERIC_TYPE_P (source) && JNUMERIC_TYPE_P (dest))
13248 return 1;
13249
7e51098e
TT		 13250 else if (TREE_CODE (source) == BOOLEAN_TYPE
13251 && TREE_CODE (dest) == BOOLEAN_TYPE)
13252 return 1;
13253
b67d701b
PB		 13254 return 0;
13255}
13256
15fdcfe9 13257static tree
0a2f0c54 13258do_unary_numeric_promotion (tree arg)
15fdcfe9
PB		 13259{
13260 tree type = TREE_TYPE (arg);
7e51098e
TT		 13261 if ((TREE_CODE (type) == INTEGER_TYPE && TYPE_PRECISION (type) < 32)
13262 || TREE_CODE (type) == CHAR_TYPE)
15fdcfe9
PB		 13263 arg = convert (int_type_node, arg);
13264 return arg;
13265}
13266
ee142fe7 13267/* Return a nonzero value if SOURCE can be converted into DEST using
acd663ee 13268 the method invocation conversion rule (5.3). */
b67d701b 13269static int
0a2f0c54 13270valid_method_invocation_conversion_p (tree dest, tree source)
b67d701b 13271{
e3884b71 13272 return ((JPRIMITIVE_TYPE_P (source) && JPRIMITIVE_TYPE_P (dest)
acd663ee
APB		 13273 && valid_builtin_assignconv_identity_widening_p (dest, source))
13274 || ((JREFERENCE_TYPE_P (source) || JNULLP_TYPE_P (source))
13275 && (JREFERENCE_TYPE_P (dest) || JNULLP_TYPE_P (dest))
13276 && valid_ref_assignconv_cast_p (source, dest, 0)));
b67d701b
PB		 13277}
13278
e04a16fb
AG		 13279/* Build an incomplete binop expression. */
13280
13281static tree
0a2f0c54 13282build_binop (enum tree_code op, int op_location, tree op1, tree op2)
e04a16fb 13283{
dc6d7095 13284 tree binop = build2 (op, NULL_TREE, op1, op2);
e04a16fb
AG		 13285 TREE_SIDE_EFFECTS (binop) = 1;
13286 /* Store the location of the operator, for better error report. The
13287 string of the operator will be rebuild based on the OP value. */
13288 EXPR_WFL_LINECOL (binop) = op_location;
13289 return binop;
13290}
13291
13292/* Build the string of the operator retained by NODE. If NODE is part
13293 of a compound expression, add an '=' at the end of the string. This
13294 function is called when an error needs to be reported on an
13295 operator. The string is returned as a pointer to a static character
13296 buffer. */
13297
13298static char *
0a2f0c54 13299operator_string (tree node)
e04a16fb
AG		 13300{
13301#define BUILD_OPERATOR_STRING(S) \
13302 { \
13303 sprintf (buffer, "%s%s", S, (COMPOUND_ASSIGN_P (node) ? "=" : "")); \
13304 return buffer; \
13305 }
e35b68b0 13306
e04a16fb
AG		 13307 static char buffer [10];
13308 switch (TREE_CODE (node))
13309 {
13310 case MULT_EXPR: BUILD_OPERATOR_STRING ("*");
13311 case RDIV_EXPR: BUILD_OPERATOR_STRING ("/");
13312 case TRUNC_MOD_EXPR: BUILD_OPERATOR_STRING ("%");
13313 case PLUS_EXPR: BUILD_OPERATOR_STRING ("+");
13314 case MINUS_EXPR: BUILD_OPERATOR_STRING ("-");
13315 case LSHIFT_EXPR: BUILD_OPERATOR_STRING ("<<");
13316 case RSHIFT_EXPR: BUILD_OPERATOR_STRING (">>");
13317 case URSHIFT_EXPR: BUILD_OPERATOR_STRING (">>>");
13318 case BIT_AND_EXPR: BUILD_OPERATOR_STRING ("&");
13319 case BIT_XOR_EXPR: BUILD_OPERATOR_STRING ("^");
13320 case BIT_IOR_EXPR: BUILD_OPERATOR_STRING ("|");
13321 case TRUTH_ANDIF_EXPR: BUILD_OPERATOR_STRING ("&&");
13322 case TRUTH_ORIF_EXPR: BUILD_OPERATOR_STRING ("||");
13323 case EQ_EXPR: BUILD_OPERATOR_STRING ("==");
13324 case NE_EXPR: BUILD_OPERATOR_STRING ("!=");
13325 case GT_EXPR: BUILD_OPERATOR_STRING (">");
13326 case GE_EXPR: BUILD_OPERATOR_STRING (">=");
13327 case LT_EXPR: BUILD_OPERATOR_STRING ("<");
13328 case LE_EXPR: BUILD_OPERATOR_STRING ("<=");
b67d701b 13329 case UNARY_PLUS_EXPR: BUILD_OPERATOR_STRING ("+");
e04a16fb
AG		 13330 case NEGATE_EXPR: BUILD_OPERATOR_STRING ("-");
13331 case TRUTH_NOT_EXPR: BUILD_OPERATOR_STRING ("!");
13332 case BIT_NOT_EXPR: BUILD_OPERATOR_STRING ("~");
13333 case PREINCREMENT_EXPR: /* Fall through */
13334 case POSTINCREMENT_EXPR: BUILD_OPERATOR_STRING ("++");
13335 case PREDECREMENT_EXPR: /* Fall through */
13336 case POSTDECREMENT_EXPR: BUILD_OPERATOR_STRING ("--");
13337 default:
400500c4
RK		 13338 internal_error ("unregistered operator %s",
13339 tree_code_name [TREE_CODE (node)]);
e04a16fb
AG		 13340 }
13341 return NULL;
13342#undef BUILD_OPERATOR_STRING
13343}
13344
5cbdba64
APB		 13345/* Return 1 if VAR_ACCESS1 is equivalent to VAR_ACCESS2. */
13346
13347static int
0a2f0c54 13348java_decl_equiv (tree var_acc1, tree var_acc2)
5cbdba64
APB		 13349{
13350 if (JDECL_P (var_acc1))
13351 return (var_acc1 == var_acc2);
e35b68b0 13352
5cbdba64
APB		 13353 return (TREE_CODE (var_acc1) == COMPONENT_REF
13354 && TREE_CODE (var_acc2) == COMPONENT_REF
13355 && TREE_OPERAND (TREE_OPERAND (var_acc1, 0), 0)
13356 == TREE_OPERAND (TREE_OPERAND (var_acc2, 0), 0)
13357 && TREE_OPERAND (var_acc1, 1) == TREE_OPERAND (var_acc2, 1));
13358}
13359
ee142fe7 13360/* Return a nonzero value if CODE is one of the operators that can be
5cbdba64
APB		 13361 used in conjunction with the `=' operator in a compound assignment. */
13362
13363static int
0a2f0c54 13364binop_compound_p (enum tree_code code)
5cbdba64
APB		 13365{
13366 int i;
13367 for (i = 0; i < BINOP_COMPOUND_CANDIDATES; i++)
13368 if (binop_lookup [i] == code)
13369 break;
13370
13371 return i < BINOP_COMPOUND_CANDIDATES;
13372}
13373
13374/* Reorganize after a fold to get SAVE_EXPR to generate what we want. */
13375
13376static tree
0a2f0c54 13377java_refold (tree t)
5cbdba64
APB		 13378{
13379 tree c, b, ns, decl;
13380
13381 if (TREE_CODE (t) != MODIFY_EXPR)
13382 return t;
13383
13384 c = TREE_OPERAND (t, 1);
13385 if (! (c && TREE_CODE (c) == COMPOUND_EXPR
13386 && TREE_CODE (TREE_OPERAND (c, 0)) == MODIFY_EXPR
13387 && binop_compound_p (TREE_CODE (TREE_OPERAND (c, 1)))))
13388 return t;
13389
13390 /* Now the left branch of the binary operator. */
13391 b = TREE_OPERAND (TREE_OPERAND (c, 1), 0);
e35b68b0 13392 if (! (b && TREE_CODE (b) == NOP_EXPR
5cbdba64
APB		 13393 && TREE_CODE (TREE_OPERAND (b, 0)) == SAVE_EXPR))
13394 return t;
13395
13396 ns = TREE_OPERAND (TREE_OPERAND (b, 0), 0);
13397 if (! (ns && TREE_CODE (ns) == NOP_EXPR
13398 && TREE_CODE (TREE_OPERAND (ns, 0)) == SAVE_EXPR))
13399 return t;
13400
13401 decl = TREE_OPERAND (TREE_OPERAND (ns, 0), 0);
13402 if ((JDECL_P (decl) || TREE_CODE (decl) == COMPONENT_REF)
13403 /* It's got to be the an equivalent decl */
13404 && java_decl_equiv (decl, TREE_OPERAND (TREE_OPERAND (c, 0), 0)))
13405 {
13406 /* Shorten the NOP_EXPR/SAVE_EXPR path. */
13407 TREE_OPERAND (TREE_OPERAND (c, 1), 0) = TREE_OPERAND (ns, 0);
13408 /* Substitute the COMPOUND_EXPR by the BINOP_EXPR */
13409 TREE_OPERAND (t, 1) = TREE_OPERAND (c, 1);
13410 /* Change the right part of the BINOP_EXPR */
13411 TREE_OPERAND (TREE_OPERAND (t, 1), 1) = TREE_OPERAND (c, 0);
13412 }
13413
13414 return t;
13415}
13416
e04a16fb
AG		 13417/* Binary operators (15.16 up to 15.18). We return error_mark_node on
13418 errors but we modify NODE so that it contains the type computed
13419 according to the expression, when it's fixed. Otherwise, we write
13420 error_mark_node as the type. It allows us to further the analysis
13421 of remaining nodes and detects more errors in certain cases. */
13422
13423static tree
0a2f0c54 13424patch_binop (tree node, tree wfl_op1, tree wfl_op2)
e04a16fb
AG		 13425{
13426 tree op1 = TREE_OPERAND (node, 0);
13427 tree op2 = TREE_OPERAND (node, 1);
13428 tree op1_type = TREE_TYPE (op1);
13429 tree op2_type = TREE_TYPE (op2);
48a840d9 13430 tree prom_type = NULL_TREE, cn;
7b02957e 13431 enum tree_code code = TREE_CODE (node);
b67d701b 13432
e04a16fb
AG		 13433 /* If 1, tell the routine that we have to return error_mark_node
13434 after checking for the initialization of the RHS */
13435 int error_found = 0;
13436
e04a16fb
AG		 13437 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
13438
761491c8
APB		 13439 /* If either op<n>_type are NULL, this might be early signs of an
13440 error situation, unless it's too early to tell (in case we're
13441 handling a `+', `==', `!=' or `instanceof'.) We want to set op<n>_type
13442 correctly so the error can be later on reported accurately. */
e35b68b0 13443 if (! (code == PLUS_EXPR || code == NE_EXPR
761491c8
APB		 13444 || code == EQ_EXPR || code == INSTANCEOF_EXPR))
13445 {
13446 tree n;
13447 if (! op1_type)
13448 {
13449 n = java_complete_tree (op1);
13450 op1_type = TREE_TYPE (n);
13451 }
13452 if (! op2_type)
13453 {
13454 n = java_complete_tree (op2);
13455 op2_type = TREE_TYPE (n);
13456 }
13457 }
13458
e04a16fb
AG		 13459 switch (code)
13460 {
13461 /* 15.16 Multiplicative operators */
13462 case MULT_EXPR: /* 15.16.1 Multiplication Operator * */
13463 case RDIV_EXPR: /* 15.16.2 Division Operator / */
c2952b01 13464 case TRUNC_DIV_EXPR: /* 15.16.2 Integral type Division Operator / */
e04a16fb 13465 case TRUNC_MOD_EXPR: /* 15.16.3 Remainder operator % */
7e51098e 13466 if (!JNUMERIC_TYPE_P (op1_type) || !JNUMERIC_TYPE_P (op2_type))
e04a16fb 13467 {
7e51098e 13468 if (!JNUMERIC_TYPE_P (op1_type))
e04a16fb 13469 ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op1_type);
7e51098e 13470 if (!JNUMERIC_TYPE_P (op2_type) && (op1_type != op2_type))
e04a16fb
AG		 13471 ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op2_type);
13472 TREE_TYPE (node) = error_mark_node;
13473 error_found = 1;
13474 break;
13475 }
13476 prom_type = binary_numeric_promotion (op1_type, op2_type, &op1, &op2);
7b02957e
APB		 13477
13478 /* Detect integral division by zero */
13479 if ((code == RDIV_EXPR || code == TRUNC_MOD_EXPR)
13480 && TREE_CODE (prom_type) == INTEGER_TYPE
13481 && (op2 == integer_zero_node || op2 == long_zero_node ||
13482 (TREE_CODE (op2) == INTEGER_CST &&
13483 ! TREE_INT_CST_LOW (op2) && ! TREE_INT_CST_HIGH (op2))))
13484 {
c725bd79 13485 parse_warning_context (wfl_operator, "Evaluating this expression will result in an arithmetic exception being thrown");
3ed218d4 13486 TREE_CONSTANT (node) = 0;
6de9cd9a 13487 TREE_INVARIANT (node) = 0;
7b02957e 13488 }
e35b68b0 13489
e04a16fb
AG		 13490 /* Change the division operator if necessary */
13491 if (code == RDIV_EXPR && TREE_CODE (prom_type) == INTEGER_TYPE)
13492 TREE_SET_CODE (node, TRUNC_DIV_EXPR);
0b4d333e 13493
67264b4f 13494 /* Before divisions as is disappear, try to simplify and bail if
3ed218d4
APB		 13495 applicable, otherwise we won't perform even simple
13496 simplifications like (1-1)/3. We can't do that with floating
13497 point number, folds can't handle them at this stage. */
13498 if (code == RDIV_EXPR && TREE_CONSTANT (op1) && TREE_CONSTANT (op2)
13499 && JINTEGRAL_TYPE_P (op1) && JINTEGRAL_TYPE_P (op2))
7b02957e
APB		 13500 {
13501 TREE_TYPE (node) = prom_type;
13502 node = fold (node);
13503 if (TREE_CODE (node) != code)
13504 return node;
13505 }
13506
aa4759c1
AH		 13507 if (TREE_CODE (prom_type) == INTEGER_TYPE
13508 && flag_use_divide_subroutine
13509 && ! flag_emit_class_files
13510 && (code == RDIV_EXPR || code == TRUNC_MOD_EXPR))
13511 return build_java_soft_divmod (TREE_CODE (node), prom_type, op1, op2);
e35b68b0 13512
0b4d333e
APB		 13513 /* This one is more complicated. FLOATs are processed by a
13514 function call to soft_fmod. Duplicate the value of the
13515 COMPOUND_ASSIGN_P flag. */
e04a16fb 13516 if (code == TRUNC_MOD_EXPR)
0b4d333e
APB		 13517 {
13518 tree mod = build_java_binop (TRUNC_MOD_EXPR, prom_type, op1, op2);
13519 COMPOUND_ASSIGN_P (mod) = COMPOUND_ASSIGN_P (node);
13520 return mod;
13521 }
e04a16fb
AG		 13522 break;
13523
13524 /* 15.17 Additive Operators */
13525 case PLUS_EXPR: /* 15.17.1 String Concatenation Operator + */
b67d701b
PB		 13526
13527 /* Operation is valid if either one argument is a string
13528 constant, a String object or a StringBuffer crafted for the
13529 purpose of the a previous usage of the String concatenation
13530 operator */
13531
e35b68b0 13532 if (TREE_CODE (op1) == STRING_CST
b67d701b
PB		 13533 || TREE_CODE (op2) == STRING_CST
13534 || JSTRING_TYPE_P (op1_type)
13535 || JSTRING_TYPE_P (op2_type)
13536 || IS_CRAFTED_STRING_BUFFER_P (op1)
13537 || IS_CRAFTED_STRING_BUFFER_P (op2))
13538 return build_string_concatenation (op1, op2);
13539
e04a16fb
AG		 13540 case MINUS_EXPR: /* 15.17.2 Additive Operators (+ and -) for
13541 Numeric Types */
7e51098e 13542 if (!JNUMERIC_TYPE_P (op1_type) || !JNUMERIC_TYPE_P (op2_type))
e04a16fb 13543 {
7e51098e 13544 if (!JNUMERIC_TYPE_P (op1_type))
e04a16fb 13545 ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op1_type);
7e51098e 13546 if (!JNUMERIC_TYPE_P (op2_type) && (op1_type != op2_type))
e04a16fb
AG		 13547 ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op2_type);
13548 TREE_TYPE (node) = error_mark_node;
13549 error_found = 1;
13550 break;
13551 }
13552 prom_type = binary_numeric_promotion (op1_type, op2_type, &op1, &op2);
13553 break;
13554
13555 /* 15.18 Shift Operators */
13556 case LSHIFT_EXPR:
13557 case RSHIFT_EXPR:
13558 case URSHIFT_EXPR:
13559 if (!JINTEGRAL_TYPE_P (op1_type) || !JINTEGRAL_TYPE_P (op2_type))
13560 {
13561 if (!JINTEGRAL_TYPE_P (op1_type))
13562 ERROR_CAST_NEEDED_TO_INTEGRAL (wfl_operator, node, op1_type);
13563 else
1ebadc60 13564 {
7e51098e 13565 if (JNUMERIC_TYPE_P (op2_type))
1ebadc60 13566 parse_error_context (wfl_operator,
781b0558 13567 "Incompatible type for `%s'. Explicit cast needed to convert shift distance from `%s' to integral",
1ebadc60
KG		 13568 operator_string (node),
13569 lang_printable_name (op2_type, 0));
13570 else
781b0558 13571 parse_error_context (wfl_operator,
e35b68b0 13572 "Incompatible type for `%s'. Can't convert shift distance from `%s' to integral",
1ebadc60
KG		 13573 operator_string (node),
13574 lang_printable_name (op2_type, 0));
13575 }
e04a16fb
AG		 13576 TREE_TYPE (node) = error_mark_node;
13577 error_found = 1;
13578 break;
13579 }
13580
13581 /* Unary numeric promotion (5.6.1) is performed on each operand
a83f01f0 13582 separately */
15fdcfe9
PB		 13583 op1 = do_unary_numeric_promotion (op1);
13584 op2 = do_unary_numeric_promotion (op2);
e04a16fb 13585
dd06be9e
TT		 13586 /* If the right hand side is of type `long', first cast it to
13587 `int'. */
13588 if (TREE_TYPE (op2) == long_type_node)
13589 op2 = build1 (CONVERT_EXPR, int_type_node, op2);
13590
e04a16fb
AG		 13591 /* The type of the shift expression is the type of the promoted
13592 type of the left-hand operand */
13593 prom_type = TREE_TYPE (op1);
13594
c2952b01
APB		 13595 /* Shift int only up to 0x1f and long up to 0x3f */
13596 if (prom_type == int_type_node)
dc6d7095 13597 op2 = fold (build2 (BIT_AND_EXPR, int_type_node, op2,
7d60be94 13598 build_int_cst (NULL_TREE, 0x1f)));
c2952b01 13599 else
dc6d7095 13600 op2 = fold (build2 (BIT_AND_EXPR, int_type_node, op2,
7d60be94 13601 build_int_cst (NULL_TREE, 0x3f)));
e04a16fb
AG		 13602
13603 /* The >>> operator is a >> operating on unsigned quantities */
15fdcfe9 13604 if (code == URSHIFT_EXPR && ! flag_emit_class_files)
e04a16fb 13605 {
0b4d333e 13606 tree to_return;
ceef8ce4 13607 tree utype = java_unsigned_type (prom_type);
73333a87 13608 op1 = convert (utype, op1);
e04a16fb 13609 TREE_SET_CODE (node, RSHIFT_EXPR);
73333a87
AH		 13610 TREE_OPERAND (node, 0) = op1;
13611 TREE_OPERAND (node, 1) = op2;
13612 TREE_TYPE (node) = utype;
0b4d333e
APB		 13613 to_return = convert (prom_type, node);
13614 /* Copy the original value of the COMPOUND_ASSIGN_P flag */
13615 COMPOUND_ASSIGN_P (to_return) = COMPOUND_ASSIGN_P (node);
dc0b3eff
PB		 13616 TREE_SIDE_EFFECTS (to_return)
13617 = TREE_SIDE_EFFECTS (op1) | TREE_SIDE_EFFECTS (op2);
0b4d333e 13618 return to_return;
e04a16fb
AG		 13619 }
13620 break;
5e942c50 13621
f94ae540 13622 /* 15.19.1 Type Comparison Operator instanceof */
5e942c50
APB		 13623 case INSTANCEOF_EXPR:
13624
13625 TREE_TYPE (node) = boolean_type_node;
13626
c442c002 13627 /* OP1_TYPE might be NULL when OP1 is a string constant. */
e35b68b0 13628 if ((cn = patch_string (op1)))
c442c002
TT		 13629 {
13630 op1 = cn;
13631 op1_type = TREE_TYPE (op1);
13632 }
13633 if (op1_type == NULL_TREE)
13634 abort ();
13635
5e942c50
APB		 13636 if (!(op2_type = resolve_type_during_patch (op2)))
13637 return error_mark_node;
13638
13639 /* The first operand must be a reference type or the null type */
13640 if (!JREFERENCE_TYPE_P (op1_type) && op1 != null_pointer_node)
13641 error_found = 1; /* Error reported further below */
13642
13643 /* The second operand must be a reference type */
13644 if (!JREFERENCE_TYPE_P (op2_type))
13645 {
13646 SET_WFL_OPERATOR (wfl_operator, node, wfl_op2);
13647 parse_error_context
13648 (wfl_operator, "Invalid argument `%s' for `instanceof'",
13649 lang_printable_name (op2_type, 0));
13650 error_found = 1;
13651 }
13652
13653 if (!error_found && valid_ref_assignconv_cast_p (op1_type, op2_type, 1))
13654 {
13655 /* If the first operand is null, the result is always false */
13656 if (op1 == null_pointer_node)
13657 return boolean_false_node;
15fdcfe9
PB		 13658 else if (flag_emit_class_files)
13659 {
13660 TREE_OPERAND (node, 1) = op2_type;
dc0b3eff 13661 TREE_SIDE_EFFECTS (node) = TREE_SIDE_EFFECTS (op1);
15fdcfe9
PB		 13662 return node;
13663 }
5e942c50
APB		 13664 /* Otherwise we have to invoke instance of to figure it out */
13665 else
67db0ce7 13666 return build_instanceof (op1, op2_type);
5e942c50
APB		 13667 }
13668 /* There is no way the expression operand can be an instance of
13669 the type operand. This is a compile time error. */
13670 else
13671 {
c2e3db92 13672 char *t1 = xstrdup (lang_printable_name (op1_type, 0));
5e942c50 13673 SET_WFL_OPERATOR (wfl_operator, node, wfl_op1);
e35b68b0 13674 parse_error_context
5e942c50
APB		 13675 (wfl_operator, "Impossible for `%s' to be instance of `%s'",
13676 t1, lang_printable_name (op2_type, 0));
13677 free (t1);
13678 error_found = 1;
13679 }
e35b68b0 13680
5e942c50 13681 break;
e04a16fb
AG		 13682
13683 /* 15.21 Bitwise and Logical Operators */
13684 case BIT_AND_EXPR:
13685 case BIT_XOR_EXPR:
13686 case BIT_IOR_EXPR:
13687 if (JINTEGRAL_TYPE_P (op1_type) && JINTEGRAL_TYPE_P (op2_type))
13688 /* Binary numeric promotion is performed on both operand and the
13689 expression retain that type */
13690 prom_type = binary_numeric_promotion (op1_type, op2_type, &op1, &op2);
13691
e35b68b0 13692 else if (TREE_CODE (op1_type) == BOOLEAN_TYPE
e04a16fb
AG		 13693 && TREE_CODE (op1_type) == BOOLEAN_TYPE)
13694 /* The type of the bitwise operator expression is BOOLEAN */
13695 prom_type = boolean_type_node;
13696 else
13697 {
13698 if (!JINTEGRAL_TYPE_P (op1_type))
13699 ERROR_CAST_NEEDED_TO_INTEGRAL (wfl_operator, node, op1_type);
13700 if (!JINTEGRAL_TYPE_P (op2_type) && (op1_type != op2_type))
13701 ERROR_CAST_NEEDED_TO_INTEGRAL (wfl_operator, node, op2_type);
13702 TREE_TYPE (node) = error_mark_node;
13703 error_found = 1;
13704 /* Insert a break here if adding thing before the switch's
13705 break for this case */
13706 }
13707 break;
13708
13709 /* 15.22 Conditional-And Operator */
13710 case TRUTH_ANDIF_EXPR:
13711 /* 15.23 Conditional-Or Operator */
13712 case TRUTH_ORIF_EXPR:
13713 /* Operands must be of BOOLEAN type */
e35b68b0 13714 if (TREE_CODE (op1_type) != BOOLEAN_TYPE ||
e04a16fb
AG		 13715 TREE_CODE (op2_type) != BOOLEAN_TYPE)
13716 {
13717 if (TREE_CODE (op1_type) != BOOLEAN_TYPE)
13718 ERROR_CANT_CONVERT_TO_BOOLEAN (wfl_operator, node, op1_type);
13719 if (TREE_CODE (op2_type) != BOOLEAN_TYPE && (op1_type != op2_type))
13720 ERROR_CANT_CONVERT_TO_BOOLEAN (wfl_operator, node, op2_type);
13721 TREE_TYPE (node) = boolean_type_node;
13722 error_found = 1;
13723 break;
13724 }
87d4ad08
PB		 13725 else if (integer_zerop (op1))
13726 {
13727 return code == TRUTH_ANDIF_EXPR ? op1 : op2;
13728 }
13729 else if (integer_onep (op1))
13730 {
13731 return code == TRUTH_ANDIF_EXPR ? op2 : op1;
13732 }
e04a16fb
AG		 13733 /* The type of the conditional operators is BOOLEAN */
13734 prom_type = boolean_type_node;
13735 break;
13736
13737 /* 15.19.1 Numerical Comparison Operators <, <=, >, >= */
13738 case LT_EXPR:
13739 case GT_EXPR:
13740 case LE_EXPR:
13741 case GE_EXPR:
13742 /* The type of each of the operands must be a primitive numeric
13743 type */
13744 if (!JNUMERIC_TYPE_P (op1_type) || ! JNUMERIC_TYPE_P (op2_type))
13745 {
13746 if (!JNUMERIC_TYPE_P (op1_type))
13747 ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op1_type);
13748 if (!JNUMERIC_TYPE_P (op2_type) && (op1_type != op2_type))
13749 ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op2_type);
13750 TREE_TYPE (node) = boolean_type_node;
13751 error_found = 1;
13752 break;
13753 }
13754 /* Binary numeric promotion is performed on the operands */
13755 binary_numeric_promotion (op1_type, op2_type, &op1, &op2);
13756 /* The type of the relation expression is always BOOLEAN */
13757 prom_type = boolean_type_node;
13758 break;
13759
13760 /* 15.20 Equality Operator */
13761 case EQ_EXPR:
13762 case NE_EXPR:
48a840d9 13763 /* It's time for us to patch the strings. */
e35b68b0 13764 if ((cn = patch_string (op1)))
48a840d9
APB		 13765 {
13766 op1 = cn;
13767 op1_type = TREE_TYPE (op1);
13768 }
e35b68b0 13769 if ((cn = patch_string (op2)))
48a840d9
APB		 13770 {
13771 op2 = cn;
13772 op2_type = TREE_TYPE (op2);
13773 }
e35b68b0 13774
e04a16fb
AG		 13775 /* 15.20.1 Numerical Equality Operators == and != */
13776 /* Binary numeric promotion is performed on the operands */
5e942c50 13777 if (JNUMERIC_TYPE_P (op1_type) && JNUMERIC_TYPE_P (op2_type))
e04a16fb 13778 binary_numeric_promotion (op1_type, op2_type, &op1, &op2);
e35b68b0 13779
e04a16fb
AG		 13780 /* 15.20.2 Boolean Equality Operators == and != */
13781 else if (TREE_CODE (op1_type) == BOOLEAN_TYPE &&
13782 TREE_CODE (op2_type) == BOOLEAN_TYPE)
13783 ; /* Nothing to do here */
e35b68b0 13784
e04a16fb 13785 /* 15.20.3 Reference Equality Operators == and != */
5e942c50
APB		 13786 /* Types have to be either references or the null type. If
13787 they're references, it must be possible to convert either
13788 type to the other by casting conversion. */
e35b68b0 13789 else if (op1 == null_pointer_node || op2 == null_pointer_node
b9f7e36c 13790 || (JREFERENCE_TYPE_P (op1_type) && JREFERENCE_TYPE_P (op2_type)
5e942c50 13791 && (valid_ref_assignconv_cast_p (op1_type, op2_type, 1)
e35b68b0 13792 || valid_ref_assignconv_cast_p (op2_type,
5e942c50 13793 op1_type, 1))))
e04a16fb 13794 ; /* Nothing to do here */
e35b68b0 13795
e04a16fb
AG		 13796 /* Else we have an error figure what can't be converted into
13797 what and report the error */
13798 else
13799 {
13800 char *t1;
c2e3db92 13801 t1 = xstrdup (lang_printable_name (op1_type, 0));
e35b68b0 13802 parse_error_context
781b0558
KG		 13803 (wfl_operator,
13804 "Incompatible type for `%s'. Can't convert `%s' to `%s'",
e35b68b0 13805 operator_string (node), t1,
0a2138e2 13806 lang_printable_name (op2_type, 0));
e04a16fb
AG		 13807 free (t1);
13808 TREE_TYPE (node) = boolean_type_node;
13809 error_found = 1;
13810 break;
13811 }
13812 prom_type = boolean_type_node;
13813 break;
7b02957e
APB		 13814 default:
13815 abort ();
e04a16fb
AG		 13816 }
13817
e04a16fb
AG		 13818 if (error_found)
13819 return error_mark_node;
13820
13821 TREE_OPERAND (node, 0) = op1;
13822 TREE_OPERAND (node, 1) = op2;
13823 TREE_TYPE (node) = prom_type;
dc0b3eff 13824 TREE_SIDE_EFFECTS (node) = TREE_SIDE_EFFECTS (op1) | TREE_SIDE_EFFECTS (op2);
e35b68b0 13825
ce6e9147
APB		 13826 if (flag_emit_xref)
13827 return node;
13828
d1472141
PB		 13829 /* fold does not respect side-effect order as required for Java but not C.
13830 * Also, it sometimes create SAVE_EXPRs which are bad when emitting
13831 * bytecode.
13832 */
13833 if (flag_emit_class_files ? (TREE_CONSTANT (op1) && TREE_CONSTANT (op2))
13834 : ! TREE_SIDE_EFFECTS (node))
aee48ef8
PB		 13835 node = fold (node);
13836 return node;
e04a16fb
AG		 13837}
13838
b67d701b
PB		 13839/* Concatenate the STRING_CST CSTE and STRING. When AFTER is a non
13840 zero value, the value of CSTE comes after the valude of STRING */
13841
13842static tree
0a2f0c54 13843do_merge_string_cste (tree cste, const char *string, int string_len, int after)
b67d701b 13844{
49f48c71 13845 const char *old = TREE_STRING_POINTER (cste);
354e99ce
APB		 13846 int old_len = TREE_STRING_LENGTH (cste);
13847 int len = old_len + string_len;
520a57c8 13848 char *new = alloca (len+1);
354e99ce 13849
b67d701b
PB		 13850 if (after)
13851 {
354e99ce
APB		 13852 memcpy (new, string, string_len);
13853 memcpy (&new [string_len], old, old_len);
b67d701b
PB		 13854 }
13855 else
13856 {
354e99ce
APB		 13857 memcpy (new, old, old_len);
13858 memcpy (&new [old_len], string, string_len);
b67d701b 13859 }
354e99ce 13860 new [len] = '\0';
520a57c8 13861 return build_string (len, new);
b67d701b
PB		 13862}
13863
13864/* Tries to merge OP1 (a STRING_CST) and OP2 (if suitable). Return a
04a0be36 13865 new STRING_CST on success, NULL_TREE on failure. */
b67d701b
PB		 13866
13867static tree
0a2f0c54 13868merge_string_cste (tree op1, tree op2, int after)
b67d701b 13869{
04a0be36 13870 /* Handle two string constants right away. */
b67d701b 13871 if (TREE_CODE (op2) == STRING_CST)
e35b68b0 13872 return do_merge_string_cste (op1, TREE_STRING_POINTER (op2),
b67d701b 13873 TREE_STRING_LENGTH (op2), after);
e35b68b0 13874
04a0be36 13875 /* Reasonable integer constant can be treated right away. */
b67d701b
PB		 13876 if (TREE_CODE (op2) == INTEGER_CST && !TREE_CONSTANT_OVERFLOW (op2))
13877 {
fd033052
KG		 13878 static const char *const boolean_true = "true";
13879 static const char *const boolean_false = "false";
13880 static const char *const null_pointer = "null";
04a0be36 13881 char ch[4];
49f48c71 13882 const char *string;
e35b68b0 13883
b67d701b
PB		 13884 if (op2 == boolean_true_node)
13885 string = boolean_true;
13886 else if (op2 == boolean_false_node)
13887 string = boolean_false;
5b84be73
TT		 13888 else if (op2 == null_pointer_node
13889 || (integer_zerop (op2)
13890 && TREE_CODE (TREE_TYPE (op2)) == POINTER_TYPE))
04a0be36
EB		 13891 /* FIXME: null is not a compile-time constant, so it is only safe to
13892 merge if the overall expression is non-constant. However, this
13893 code always merges without checking the overall expression. */
b67d701b
PB		 13894 string = null_pointer;
13895 else if (TREE_TYPE (op2) == char_type_node)
13896 {
6a921942 13897 /* Convert the character into UTF-8. */
04a0be36 13898 unsigned int c = (unsigned int) TREE_INT_CST_LOW (op2);
6a921942 13899 unsigned char *p = (unsigned char *) ch;
04a0be36
EB		 13900 if (0x01 <= c && c <= 0x7f)
13901 *p++ = (unsigned char) c;
13902 else if (c < 0x7ff)
13903 {
13904 *p++ = (unsigned char) (c >> 6 | 0xc0);
13905 *p++ = (unsigned char) ((c & 0x3f) | 0x80);
13906 }
6a921942
AG		 13907 else
13908 {
04a0be36
EB		 13909 *p++ = (unsigned char) (c >> 12 | 0xe0);
13910 *p++ = (unsigned char) (((c >> 6) & 0x3f) | 0x80);
13911 *p++ = (unsigned char) ((c & 0x3f) | 0x80);
6a921942
AG		 13912 }
13913 *p = '\0';
04a0be36 13914
b67d701b
PB		 13915 string = ch;
13916 }
13917 else
0a32c5ea
TT		 13918 string = string_convert_int_cst (op2);
13919
b67d701b
PB		 13920 return do_merge_string_cste (op1, string, strlen (string), after);
13921 }
13922 return NULL_TREE;
13923}
13924
13925/* Tries to statically concatenate OP1 and OP2 if possible. Either one
13926 has to be a STRING_CST and the other part must be a STRING_CST or a
13927 INTEGRAL constant. Return a new STRING_CST if the operation
13928 succeed, NULL_TREE otherwise.
13929
13930 If the case we want to optimize for space, we might want to return
13931 NULL_TREE for each invocation of this routine. FIXME */
13932
13933static tree
0a2f0c54 13934string_constant_concatenation (tree op1, tree op2)
b67d701b
PB		 13935{
13936 if (TREE_CODE (op1) == STRING_CST || (TREE_CODE (op2) == STRING_CST))
13937 {
0a2138e2 13938 tree string, rest;
b67d701b 13939 int invert;
e35b68b0 13940
b67d701b
PB		 13941 string = (TREE_CODE (op1) == STRING_CST ? op1 : op2);
13942 rest = (string == op1 ? op2 : op1);
13943 invert = (string == op1 ? 0 : 1 );
e35b68b0 13944
b67d701b
PB		 13945 /* Walk REST, only if it looks reasonable */
13946 if (TREE_CODE (rest) != STRING_CST
13947 && !IS_CRAFTED_STRING_BUFFER_P (rest)
13948 && !JSTRING_TYPE_P (TREE_TYPE (rest))
13949 && TREE_CODE (rest) == EXPR_WITH_FILE_LOCATION)
13950 {
13951 rest = java_complete_tree (rest);
13952 if (rest == error_mark_node)
13953 return error_mark_node;
13954 rest = fold (rest);
13955 }
13956 return merge_string_cste (string, rest, invert);
13957 }
13958 return NULL_TREE;
13959}
13960
13961/* Implement the `+' operator. Does static optimization if possible,
13962 otherwise create (if necessary) and append elements to a
13963 StringBuffer. The StringBuffer will be carried around until it is
13964 used for a function call or an assignment. Then toString() will be
13965 called on it to turn it into a String object. */
13966
13967static tree
0a2f0c54 13968build_string_concatenation (tree op1, tree op2)
b67d701b
PB		 13969{
13970 tree result;
dc0b3eff 13971 int side_effects = TREE_SIDE_EFFECTS (op1) | TREE_SIDE_EFFECTS (op2);
ce6e9147
APB		 13972
13973 if (flag_emit_xref)
dc6d7095 13974 return build2 (PLUS_EXPR, string_type_node, op1, op2);
e35b68b0 13975
b67d701b
PB		 13976 /* Try to do some static optimization */
13977 if ((result = string_constant_concatenation (op1, op2)))
13978 return result;
13979
c0d87ff6
PB		 13980 /* Discard empty strings on either side of the expression */
13981 if (TREE_CODE (op1) == STRING_CST && TREE_STRING_LENGTH (op1) == 0)
acd663ee
APB		 13982 {
13983 op1 = op2;
13984 op2 = NULL_TREE;
13985 }
c0d87ff6 13986 else if (TREE_CODE (op2) == STRING_CST && TREE_STRING_LENGTH (op2) == 0)
acd663ee 13987 op2 = NULL_TREE;
b67d701b 13988
acd663ee 13989 /* If operands are string constant, turn then into object references */
b67d701b
PB		 13990 if (TREE_CODE (op1) == STRING_CST)
13991 op1 = patch_string_cst (op1);
acd663ee 13992 if (op2 && TREE_CODE (op2) == STRING_CST)
b67d701b
PB		 13993 op2 = patch_string_cst (op2);
13994
acd663ee 13995 /* If either one of the constant is null and the other non null
30b50f90
MW		 13996 operand is a String constant, return it. */
13997 if ((TREE_CODE (op1) == STRING_CST) && !op2)
acd663ee
APB		 13998 return op1;
13999
b67d701b
PB		 14000 /* If OP1 isn't already a StringBuffer, create and
14001 initialize a new one */
14002 if (!IS_CRAFTED_STRING_BUFFER_P (op1))
14003 {
e35b68b0 14004 /* Two solutions here:
c52b5771
AG		 14005 1) OP1 is a constant string reference, we call new StringBuffer(OP1)
14006 2) OP1 is something else, we call new StringBuffer().append(OP1). */
14007 if (TREE_CONSTANT (op1) && JSTRING_TYPE_P (TREE_TYPE (op1)))
b67d701b
PB		 14008 op1 = BUILD_STRING_BUFFER (op1);
14009 else
14010 {
14011 tree aNew = BUILD_STRING_BUFFER (NULL_TREE);
14012 op1 = make_qualified_primary (aNew, BUILD_APPEND (op1), 0);
14013 }
14014 }
14015
acd663ee
APB		 14016 if (op2)
14017 {
14018 /* OP1 is no longer the last node holding a crafted StringBuffer */
14019 IS_CRAFTED_STRING_BUFFER_P (op1) = 0;
14020 /* Create a node for `{new...,xxx}.append (op2)' */
14021 if (op2)
14022 op1 = make_qualified_primary (op1, BUILD_APPEND (op2), 0);
14023 }
14024
b67d701b
PB		 14025 /* Mark the last node holding a crafted StringBuffer */
14026 IS_CRAFTED_STRING_BUFFER_P (op1) = 1;
dc0b3eff
PB		 14027
14028 TREE_SIDE_EFFECTS (op1) = side_effects;
b67d701b
PB		 14029 return op1;
14030}
14031
14032/* Patch the string node NODE. NODE can be a STRING_CST of a crafted
14033 StringBuffer. If no string were found to be patched, return
14034 NULL. */
14035
14036static tree
0a2f0c54 14037patch_string (tree node)
b67d701b 14038{
1179ebc2
APB		 14039 if (node == error_mark_node)
14040 return error_mark_node;
b67d701b
PB		 14041 if (TREE_CODE (node) == STRING_CST)
14042 return patch_string_cst (node);
14043 else if (IS_CRAFTED_STRING_BUFFER_P (node))
14044 {
c877974e 14045 int saved = ctxp->explicit_constructor_p;
b67d701b 14046 tree invoke = build_method_invocation (wfl_to_string, NULL_TREE);
c877974e
APB		 14047 tree ret;
14048 /* Temporary disable forbid the use of `this'. */
14049 ctxp->explicit_constructor_p = 0;
14050 ret = java_complete_tree (make_qualified_primary (node, invoke, 0));
1729c265
APB		 14051 /* String concatenation arguments must be evaluated in order too. */
14052 ret = force_evaluation_order (ret);
c877974e
APB		 14053 /* Restore it at its previous value */
14054 ctxp->explicit_constructor_p = saved;
14055 return ret;
b67d701b
PB		 14056 }
14057 return NULL_TREE;
14058}
14059
14060/* Build the internal representation of a string constant. */
14061
14062static tree
0a2f0c54 14063patch_string_cst (tree node)
b67d701b
PB		 14064{
14065 int location;
15fdcfe9
PB		 14066 if (! flag_emit_class_files)
14067 {
15fdcfe9
PB		 14068 node = get_identifier (TREE_STRING_POINTER (node));
14069 location = alloc_name_constant (CONSTANT_String, node);
14070 node = build_ref_from_constant_pool (location);
14071 }
b67d701b 14072 TREE_CONSTANT (node) = 1;
6de9cd9a
DN		 14073 TREE_INVARIANT (node) = 1;
14074
14075 /* ??? Guessing that the class file code can't handle casts. */
14076 if (! flag_emit_class_files)
14077 node = convert (string_ptr_type_node, node);
14078 else
14079 TREE_TYPE (node) = string_ptr_type_node;
14080
b67d701b
PB		 14081 return node;
14082}
14083
14084/* Build an incomplete unary operator expression. */
e04a16fb
AG		 14085
14086static tree
0a2f0c54 14087build_unaryop (int op_token, int op_location, tree op1)
e04a16fb
AG		 14088{
14089 enum tree_code op;
14090 tree unaryop;
14091 switch (op_token)
14092 {
b67d701b 14093 case PLUS_TK: op = UNARY_PLUS_EXPR; break;
e04a16fb
AG		 14094 case MINUS_TK: op = NEGATE_EXPR; break;
14095 case NEG_TK: op = TRUTH_NOT_EXPR; break;
14096 case NOT_TK: op = BIT_NOT_EXPR; break;
400500c4 14097 default: abort ();
e04a16fb
AG		 14098 }
14099
14100 unaryop = build1 (op, NULL_TREE, op1);
e04a16fb
AG		 14101 TREE_SIDE_EFFECTS (unaryop) = 1;
14102 /* Store the location of the operator, for better error report. The
14103 string of the operator will be rebuild based on the OP value. */
14104 EXPR_WFL_LINECOL (unaryop) = op_location;
14105 return unaryop;
14106}
14107
14108/* Special case for the ++/-- operators, since they require an extra
14109 argument to build, which is set to NULL and patched
14110 later. IS_POST_P is 1 if the operator, 0 otherwise. */
14111
14112static tree
0a2f0c54 14113build_incdec (int op_token, int op_location, tree op1, int is_post_p)
e04a16fb 14114{
e35b68b0 14115 static const enum tree_code lookup [2][2] =
e04a16fb
AG		 14116 {
14117 { PREDECREMENT_EXPR, PREINCREMENT_EXPR, },
14118 { POSTDECREMENT_EXPR, POSTINCREMENT_EXPR, },
14119 };
dc6d7095
RS		 14120 tree node = build2 (lookup [is_post_p][(op_token - DECR_TK)],
14121 NULL_TREE, op1, NULL_TREE);
e04a16fb
AG		 14122 TREE_SIDE_EFFECTS (node) = 1;
14123 /* Store the location of the operator, for better error report. The
14124 string of the operator will be rebuild based on the OP value. */
14125 EXPR_WFL_LINECOL (node) = op_location;
14126 return node;
e35b68b0 14127}
e04a16fb
AG		 14128
14129/* Build an incomplete cast operator, based on the use of the
14130 CONVERT_EXPR. Note that TREE_TYPE of the constructed node is
14131 set. java_complete_tree is trained to walk a CONVERT_EXPR even
14132 though its type is already set. */
14133
14134static tree
0a2f0c54 14135build_cast (int location, tree type, tree exp)
e04a16fb
AG		 14136{
14137 tree node = build1 (CONVERT_EXPR, type, exp);
14138 EXPR_WFL_LINECOL (node) = location;
14139 return node;
14140}
14141
c2952b01
APB		 14142/* Build an incomplete class reference operator. */
14143static tree
0a2f0c54 14144build_incomplete_class_ref (int location, tree class_name)
c2952b01
APB		 14145{
14146 tree node = build1 (CLASS_LITERAL, NULL_TREE, class_name);
b8ca854a
JS		 14147 tree class_decl = GET_CPC ();
14148 tree this_class = TREE_TYPE (class_decl);
14149
14150 /* Generate the synthetic static method `class$'. (Previously we
14151 deferred this, causing different method tables to be emitted
14152 for native code and bytecode.) */
14153 if (!TYPE_DOT_CLASS (this_class)
14154 && !JPRIMITIVE_TYPE_P (class_name)
14155 && !(TREE_CODE (class_name) == VOID_TYPE))
14156 {
24d82bce
PB		 14157 tree cpc_list = GET_CPC_LIST();
14158 tree cpc = cpc_list;
b8ca854a
JS		 14159 tree target_class;
14160
24d82bce
PB		 14161 /* For inner classes, add a 'class$' method to their outermost
14162 context, creating it if necessary. */
14163
14164 while (GET_NEXT_ENCLOSING_CPC(cpc))
14165 cpc = GET_NEXT_ENCLOSING_CPC(cpc);
14166 class_decl = TREE_VALUE (cpc);
14167
14168 target_class = TREE_TYPE (class_decl);
14169
14170 if (CLASS_INTERFACE (TYPE_NAME (target_class)))
b8ca854a
JS		 14171 {
14172 /* For interfaces, adding a static 'class$' method directly
14173 is illegal. So create an inner class to contain the new
14174 method. Empirically this matches the behavior of javac. */
24d82bce
PB		 14175 tree t, inner;
14176 /* We want the generated inner class inside the outermost class. */
14177 GET_CPC_LIST() = cpc;
14178 t = build_wfl_node (DECL_NAME (TYPE_NAME (object_type_node)));
d3ecb597 14179 inner = create_anonymous_class (t);
b8ca854a
JS		 14180 target_class = TREE_TYPE (inner);
14181 end_class_declaration (1);
24d82bce 14182 GET_CPC_LIST() = cpc_list;
b8ca854a
JS		 14183 }
14184
14185 if (TYPE_DOT_CLASS (target_class) == NULL_TREE)
14186 build_dot_class_method (target_class);
14187
14188 if (this_class != target_class)
14189 TYPE_DOT_CLASS (this_class) = TYPE_DOT_CLASS (target_class);
14190 }
14191
c2952b01
APB		 14192 EXPR_WFL_LINECOL (node) = location;
14193 return node;
14194}
14195
14196/* Complete an incomplete class reference operator. */
14197static tree
0a2f0c54 14198patch_incomplete_class_ref (tree node)
c2952b01
APB		 14199{
14200 tree type = TREE_OPERAND (node, 0);
14201 tree ref_type;
14202
14203 if (!(ref_type = resolve_type_during_patch (type)))
14204 return error_mark_node;
14205
d3ab697b
JS		 14206 /* If we're not emitting class files and we know ref_type is a
14207 compiled class, build a direct reference. */
14208 if ((! flag_emit_class_files && is_compiled_class (ref_type))
14209 || JPRIMITIVE_TYPE_P (ref_type)
68a830fe 14210 || TREE_CODE (ref_type) == VOID_TYPE)
f1ff439a 14211 {
12e248d6 14212 tree dot = build_class_ref (ref_type);
f1ff439a 14213 /* A class referenced by `foo.class' is initialized. */
12e248d6
APB		 14214 if (!flag_emit_class_files)
14215 dot = build_class_init (ref_type, dot);
14216 return java_complete_tree (dot);
f1ff439a 14217 }
165f37bc
APB		 14218
14219 /* If we're emitting class files and we have to deal with non
d3ab697b 14220 primitive types, we invoke the synthetic static method `class$'. */
b8ca854a 14221 ref_type = build_dot_class_method_invocation (current_class, ref_type);
165f37bc 14222 return java_complete_tree (ref_type);
c2952b01
APB		 14223}
14224
e04a16fb
AG		 14225/* 15.14 Unary operators. We return error_mark_node in case of error,
14226 but preserve the type of NODE if the type is fixed. */
14227
14228static tree
0a2f0c54 14229patch_unaryop (tree node, tree wfl_op)
e04a16fb
AG		 14230{
14231 tree op = TREE_OPERAND (node, 0);
14232 tree op_type = TREE_TYPE (op);
ab3a6dd6 14233 tree prom_type = NULL_TREE, value, decl;
c2952b01 14234 int outer_field_flag = 0;
e04a16fb
AG		 14235 int code = TREE_CODE (node);
14236 int error_found = 0;
14237
14238 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
14239
14240 switch (code)
14241 {
14242 /* 15.13.2 Postfix Increment Operator ++ */
14243 case POSTINCREMENT_EXPR:
14244 /* 15.13.3 Postfix Increment Operator -- */
14245 case POSTDECREMENT_EXPR:
14246 /* 15.14.1 Prefix Increment Operator ++ */
14247 case PREINCREMENT_EXPR:
14248 /* 15.14.2 Prefix Decrement Operator -- */
14249 case PREDECREMENT_EXPR:
5cbdba64 14250 op = decl = strip_out_static_field_access_decl (op);
c2952b01
APB		 14251 outer_field_flag = outer_field_expanded_access_p (op, NULL, NULL, NULL);
14252 /* We might be trying to change an outer field accessed using
14253 access method. */
14254 if (outer_field_flag)
14255 {
14256 /* Retrieve the decl of the field we're trying to access. We
14257 do that by first retrieving the function we would call to
14258 access the field. It has been already verified that this
14259 field isn't final */
14260 if (flag_emit_class_files)
14261 decl = TREE_OPERAND (op, 0);
14262 else
14263 decl = TREE_OPERAND (TREE_OPERAND (TREE_OPERAND (op, 0), 0), 0);
14264 decl = DECL_FUNCTION_ACCESS_DECL (decl);
14265 }
b3edebcf 14266 /* We really should have a JAVA_ARRAY_EXPR to avoid this */
e35b68b0 14267 else if (!JDECL_P (decl)
b3edebcf
APB		 14268 && TREE_CODE (decl) != COMPONENT_REF
14269 && !(flag_emit_class_files && TREE_CODE (decl) == ARRAY_REF)
14270 && TREE_CODE (decl) != INDIRECT_REF
14271 && !(TREE_CODE (decl) == COMPOUND_EXPR
14272 && TREE_OPERAND (decl, 1)
14273 && (TREE_CODE (TREE_OPERAND (decl, 1)) == INDIRECT_REF)))
e04a16fb 14274 {
e04a16fb
AG		 14275 TREE_TYPE (node) = error_mark_node;
14276 error_found = 1;
14277 }
e35b68b0 14278
e04a16fb
AG		 14279 /* From now on, we know that op if a variable and that it has a
14280 valid wfl. We use wfl_op to locate errors related to the
14281 ++/-- operand. */
4f88ccda 14282 if (!JNUMERIC_TYPE_P (op_type))
e04a16fb
AG		 14283 {
14284 parse_error_context
14285 (wfl_op, "Invalid argument type `%s' to `%s'",
0a2138e2 14286 lang_printable_name (op_type, 0), operator_string (node));
e04a16fb
AG		 14287 TREE_TYPE (node) = error_mark_node;
14288 error_found = 1;
14289 }
14290 else
14291 {
4a5f66c3 14292 /* Before the addition, binary numeric promotion is performed on
5cbdba64
APB		 14293 both operands, if really necessary */
14294 if (JINTEGRAL_TYPE_P (op_type))
14295 {
7d60be94 14296 value = build_int_cst (op_type, 1);
4a90aeeb 14297 TREE_TYPE (node) = op_type;
5cbdba64
APB		 14298 }
14299 else
14300 {
7d60be94 14301 value = build_int_cst (NULL_TREE, 1);
e35b68b0
AD		 14302 TREE_TYPE (node) =
14303 binary_numeric_promotion (op_type,
5cbdba64
APB		 14304 TREE_TYPE (value), &op, &value);
14305 }
c2952b01
APB		 14306
14307 /* We remember we might be accessing an outer field */
14308 if (outer_field_flag)
14309 {
14310 /* We re-generate an access to the field */
dc6d7095
RS		 14311 value = build2 (PLUS_EXPR, TREE_TYPE (op),
14312 build_outer_field_access (wfl_op, decl), value);
e35b68b0
AD		 14313
14314 /* And we patch the original access$() into a write
c2952b01
APB		 14315 with plus_op as a rhs */
14316 return outer_field_access_fix (node, op, value);
14317 }
14318
5cbdba64 14319 /* And write back into the node. */
4a5f66c3 14320 TREE_OPERAND (node, 0) = op;
e04a16fb 14321 TREE_OPERAND (node, 1) = value;
5cbdba64
APB		 14322 /* Convert the overall back into its original type, if
14323 necessary, and return */
14324 if (JINTEGRAL_TYPE_P (op_type))
14325 return fold (node);
14326 else
14327 return fold (convert (op_type, node));
e04a16fb
AG		 14328 }
14329 break;
14330
14331 /* 15.14.3 Unary Plus Operator + */
b67d701b 14332 case UNARY_PLUS_EXPR:
e04a16fb
AG		 14333 /* 15.14.4 Unary Minus Operator - */
14334 case NEGATE_EXPR:
14335 if (!JNUMERIC_TYPE_P (op_type))
14336 {
14337 ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op_type);
14338 TREE_TYPE (node) = error_mark_node;
14339 error_found = 1;
14340 }
14341 /* Unary numeric promotion is performed on operand */
14342 else
14343 {
15fdcfe9
PB		 14344 op = do_unary_numeric_promotion (op);
14345 prom_type = TREE_TYPE (op);
b67d701b 14346 if (code == UNARY_PLUS_EXPR)
4a5f66c3 14347 return fold (op);
e04a16fb
AG		 14348 }
14349 break;
14350
14351 /* 15.14.5 Bitwise Complement Operator ~ */
14352 case BIT_NOT_EXPR:
14353 if (!JINTEGRAL_TYPE_P (op_type))
14354 {
14355 ERROR_CAST_NEEDED_TO_INTEGRAL (wfl_operator, node, op_type);
14356 TREE_TYPE (node) = error_mark_node;
14357 error_found = 1;
14358 }
14359 else
14360 {
15fdcfe9
PB		 14361 op = do_unary_numeric_promotion (op);
14362 prom_type = TREE_TYPE (op);
e04a16fb
AG		 14363 }
14364 break;
14365
14366 /* 15.14.6 Logical Complement Operator ! */
14367 case TRUTH_NOT_EXPR:
14368 if (TREE_CODE (op_type) != BOOLEAN_TYPE)
14369 {
14370 ERROR_CANT_CONVERT_TO_BOOLEAN (wfl_operator, node, op_type);
c877974e
APB		 14371 /* But the type is known. We will report an error if further
14372 attempt of a assignment is made with this rhs */
e04a16fb
AG		 14373 TREE_TYPE (node) = boolean_type_node;
14374 error_found = 1;
14375 }
14376 else
14377 prom_type = boolean_type_node;
14378 break;
14379
14380 /* 15.15 Cast Expression */
14381 case CONVERT_EXPR:
0a2138e2 14382 value = patch_cast (node, wfl_operator);
e04a16fb 14383 if (value == error_mark_node)
c877974e
APB		 14384 {
14385 /* If this cast is part of an assignment, we tell the code
14386 that deals with it not to complain about a mismatch,
14387 because things have been cast, anyways */
14388 TREE_TYPE (node) = error_mark_node;
14389 error_found = 1;
14390 }
14391 else
dc0b3eff
PB		 14392 {
14393 value = fold (value);
dc0b3eff
PB		 14394 return value;
14395 }
e04a16fb
AG		 14396 break;
14397 }
e35b68b0 14398
e04a16fb
AG		 14399 if (error_found)
14400 return error_mark_node;
4a5f66c3
APB		 14401
14402 /* There are cases where node has been replaced by something else
14403 and we don't end up returning here: UNARY_PLUS_EXPR,
14404 CONVERT_EXPR, {POST,PRE}{INCR,DECR}EMENT_EXPR. */
7525cc04 14405 TREE_OPERAND (node, 0) = fold (op);
4a5f66c3 14406 TREE_TYPE (node) = prom_type;
dc0b3eff 14407 TREE_SIDE_EFFECTS (node) = TREE_SIDE_EFFECTS (op);
e04a16fb
AG		 14408 return fold (node);
14409}
14410
14411/* Generic type resolution that sometimes takes place during node
14412 patching. Returned the resolved type or generate an error
14413 message. Return the resolved type or NULL_TREE. */
14414
14415static tree
0a2f0c54 14416resolve_type_during_patch (tree type)
e04a16fb
AG		 14417{
14418 if (unresolved_type_p (type, NULL))
14419 {
c0b00d37 14420 tree type_decl = resolve_and_layout (EXPR_WFL_NODE (type), type);
e04a16fb
AG		 14421 if (!type_decl)
14422 {
e35b68b0 14423 parse_error_context (type,
e04a16fb
AG		 14424 "Class `%s' not found in type declaration",
14425 IDENTIFIER_POINTER (EXPR_WFL_NODE (type)));
14426 return NULL_TREE;
14427 }
f94ae540
TT		 14428
14429 check_deprecation (type, type_decl);
14430
3c0ce750 14431 return TREE_TYPE (type_decl);
e04a16fb
AG		 14432 }
14433 return type;
14434}
f94ae540 14435
e04a16fb
AG		 14436/* 5.5 Casting Conversion. error_mark_node is returned if an error is
14437 found. Otherwise NODE or something meant to replace it is returned. */
14438
14439static tree
0a2f0c54 14440patch_cast (tree node, tree wfl_op)
e04a16fb
AG		 14441{
14442 tree op = TREE_OPERAND (node, 0);
e04a16fb 14443 tree cast_type = TREE_TYPE (node);
3fb5c0eb 14444 tree patched, op_type;
e04a16fb
AG		 14445 char *t1;
14446
3fb5c0eb
APB		 14447 /* Some string patching might be necessary at this stage */
14448 if ((patched = patch_string (op)))
14449 TREE_OPERAND (node, 0) = op = patched;
14450 op_type = TREE_TYPE (op);
14451
e04a16fb
AG		 14452 /* First resolve OP_TYPE if unresolved */
14453 if (!(cast_type = resolve_type_during_patch (cast_type)))
14454 return error_mark_node;
14455
14456 /* Check on cast that are proven correct at compile time */
14457 if (JNUMERIC_TYPE_P (cast_type) && JNUMERIC_TYPE_P (op_type))
14458 {
e04a16fb
AG		 14459 /* Same type */
14460 if (cast_type == op_type)
14461 return node;
14462
f32c53c2
AG		 14463 /* A narrowing conversion from a floating-point number to an
14464 integral type requires special handling (5.1.3). */
14465 if (JFLOAT_TYPE_P (op_type) && JINTEGRAL_TYPE_P (cast_type))
14466 if (cast_type != long_type_node)
14467 op = convert (integer_type_node, op);
0b4d333e 14468
67264b4f 14469 /* Try widening/narrowing conversion. Potentially, things need
e04a16fb 14470 to be worked out in gcc so we implement the extreme cases
f32c53c2 14471 correctly. fold_convert() needs to be fixed. */
e04a16fb
AG		 14472 return convert (cast_type, op);
14473 }
14474
0b4d333e
APB		 14475 /* It's also valid to cast a boolean into a boolean */
14476 if (op_type == boolean_type_node && cast_type == boolean_type_node)
14477 return node;
14478
5e942c50
APB		 14479 /* null can be casted to references */
14480 if (op == null_pointer_node && JREFERENCE_TYPE_P (cast_type))
14481 return build_null_of_type (cast_type);
14482
e04a16fb
AG		 14483 /* The remaining legal casts involve conversion between reference
14484 types. Check for their compile time correctness. */
e35b68b0 14485 if (JREFERENCE_TYPE_P (op_type) && JREFERENCE_TYPE_P (cast_type)
09ed0f70 14486 && valid_ref_assignconv_cast_p (op_type, cast_type, 1))
e04a16fb
AG		 14487 {
14488 TREE_TYPE (node) = promote_type (cast_type);
14489 /* Now, the case can be determined correct at compile time if
14490 OP_TYPE can be converted into CAST_TYPE by assignment
14491 conversion (5.2) */
14492
14493 if (valid_ref_assignconv_cast_p (op_type, cast_type, 0))
15fdcfe9
PB		 14494 {
14495 TREE_SET_CODE (node, NOP_EXPR);
14496 return node;
14497 }
14498
14499 if (flag_emit_class_files)
14500 {
14501 TREE_SET_CODE (node, CONVERT_EXPR);
14502 return node;
14503 }
e04a16fb
AG		 14504
14505 /* The cast requires a run-time check */
dc6d7095
RS		 14506 return build3 (CALL_EXPR, promote_type (cast_type),
14507 build_address_of (soft_checkcast_node),
14508 tree_cons (NULL_TREE, build_class_ref (cast_type),
14509 build_tree_list (NULL_TREE, op)),
14510 NULL_TREE);
e04a16fb
AG		 14511 }
14512
14513 /* Any other casts are proven incorrect at compile time */
c2e3db92 14514 t1 = xstrdup (lang_printable_name (op_type, 0));
19e223db 14515 parse_error_context (wfl_op, "Invalid cast from `%s' to `%s'",
0a2138e2 14516 t1, lang_printable_name (cast_type, 0));
e04a16fb
AG		 14517 free (t1);
14518 return error_mark_node;
14519}
14520
5e942c50
APB		 14521/* Build a null constant and give it the type TYPE. */
14522
14523static tree
0a2f0c54 14524build_null_of_type (tree type)
5e942c50 14525{
7d60be94 14526 tree node = build_int_cst (promote_type (type), 0);
5e942c50
APB		 14527 return node;
14528}
14529
e04a16fb
AG		 14530/* Build an ARRAY_REF incomplete tree node. Note that operand 1 isn't
14531 a list of indices. */
14532static tree
0a2f0c54 14533build_array_ref (int location, tree array, tree index)
e04a16fb 14534{
dc6d7095
RS		 14535 tree node = build4 (ARRAY_REF, NULL_TREE, array, index,
14536 NULL_TREE, NULL_TREE);
e04a16fb
AG		 14537 EXPR_WFL_LINECOL (node) = location;
14538 return node;
14539}
14540
14541/* 15.12 Array Access Expression */
14542
14543static tree
0a2f0c54 14544patch_array_ref (tree node)
e04a16fb
AG		 14545{
14546 tree array = TREE_OPERAND (node, 0);
14547 tree array_type = TREE_TYPE (array);
14548 tree index = TREE_OPERAND (node, 1);
14549 tree index_type = TREE_TYPE (index);
e04a16fb
AG		 14550 int error_found = 0;
14551
14552 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
14553
e04a16fb
AG		 14554 if (TREE_CODE (array_type) == POINTER_TYPE)
14555 array_type = TREE_TYPE (array_type);
14556
14557 /* The array reference must be an array */
14558 if (!TYPE_ARRAY_P (array_type))
14559 {
e35b68b0 14560 parse_error_context
781b0558
KG		 14561 (wfl_operator,
14562 "`[]' can only be applied to arrays. It can't be applied to `%s'",
14563 lang_printable_name (array_type, 0));
e04a16fb
AG		 14564 TREE_TYPE (node) = error_mark_node;
14565 error_found = 1;
14566 }
14567
c2952b01 14568 /* The array index undergoes unary numeric promotion. The promoted
e04a16fb 14569 type must be int */
15fdcfe9
PB		 14570 index = do_unary_numeric_promotion (index);
14571 if (TREE_TYPE (index) != int_type_node)
e04a16fb 14572 {
1ebadc60 14573 if (valid_cast_to_p (index_type, int_type_node))
781b0558
KG		 14574 parse_error_context (wfl_operator,
14575 "Incompatible type for `[]'. Explicit cast needed to convert `%s' to `int'",
1ebadc60
KG		 14576 lang_printable_name (index_type, 0));
14577 else
781b0558
KG		 14578 parse_error_context (wfl_operator,
14579 "Incompatible type for `[]'. Can't convert `%s' to `int'",
1ebadc60 14580 lang_printable_name (index_type, 0));
e04a16fb
AG		 14581 TREE_TYPE (node) = error_mark_node;
14582 error_found = 1;
14583 }
14584
e04a16fb
AG		 14585 if (error_found)
14586 return error_mark_node;
e04a16fb 14587
5e942c50 14588 array_type = TYPE_ARRAY_ELEMENT (array_type);
5e942c50 14589
7f1d4866 14590 if (flag_emit_class_files || flag_emit_xref)
e04a16fb 14591 {
15fdcfe9
PB		 14592 TREE_OPERAND (node, 0) = array;
14593 TREE_OPERAND (node, 1) = index;
e04a16fb
AG		 14594 }
14595 else
b736dee6 14596 node = build_java_arrayaccess (array, array_type, index);
e04a16fb
AG		 14597 TREE_TYPE (node) = array_type;
14598 return node;
14599}
14600
14601/* 15.9 Array Creation Expressions */
14602
14603static tree
0a2f0c54 14604build_newarray_node (tree type, tree dims, int extra_dims)
e04a16fb 14605{
dc6d7095 14606 tree node = build3 (NEW_ARRAY_EXPR, NULL_TREE, type,
4a90aeeb 14607 nreverse (dims),
7d60be94 14608 build_int_cst (NULL_TREE, extra_dims));
e04a16fb
AG		 14609 return node;
14610}
14611
14612static tree
0a2f0c54 14613patch_newarray (tree node)
e04a16fb
AG		 14614{
14615 tree type = TREE_OPERAND (node, 0);
14616 tree dims = TREE_OPERAND (node, 1);
14617 tree cdim, array_type;
14618 int error_found = 0;
14619 int ndims = 0;
14620 int xdims = TREE_INT_CST_LOW (TREE_OPERAND (node, 2));
e04a16fb
AG		 14621
14622 /* Dimension types are verified. It's better for the types to be
14623 verified in order. */
14624 for (cdim = dims, ndims = 0; cdim; cdim = TREE_CHAIN (cdim), ndims++ )
14625 {
14626 int dim_error = 0;
14627 tree dim = TREE_VALUE (cdim);
14628
14629 /* Dim might have been saved during its evaluation */
dba41d30 14630 dim = (TREE_CODE (dim) == SAVE_EXPR ? TREE_OPERAND (dim, 0) : dim);
e04a16fb
AG		 14631
14632 /* The type of each specified dimension must be an integral type. */
14633 if (!JINTEGRAL_TYPE_P (TREE_TYPE (dim)))
14634 dim_error = 1;
14635
14636 /* Each expression undergoes an unary numeric promotion (5.6.1) and the
14637 promoted type must be int. */
14638 else
14639 {
15fdcfe9 14640 dim = do_unary_numeric_promotion (dim);
e04a16fb
AG		 14641 if (TREE_TYPE (dim) != int_type_node)
14642 dim_error = 1;
14643 }
14644
14645 /* Report errors on types here */
14646 if (dim_error)
14647 {
e35b68b0
AD		 14648 parse_error_context
14649 (TREE_PURPOSE (cdim),
14650 "Incompatible type for dimension in array creation expression. %s convert `%s' to `int'",
b67d701b 14651 (valid_cast_to_p (TREE_TYPE (dim), int_type_node) ?
e04a16fb 14652 "Explicit cast needed to" : "Can't"),
0a2138e2 14653 lang_printable_name (TREE_TYPE (dim), 0));
e04a16fb
AG		 14654 error_found = 1;
14655 }
14656
e04a16fb
AG		 14657 TREE_PURPOSE (cdim) = NULL_TREE;
14658 }
14659
14660 /* Resolve array base type if unresolved */
14661 if (!(type = resolve_type_during_patch (type)))
14662 error_found = 1;
14663
14664 if (error_found)
14665 {
14666 /* We don't want further evaluation of this bogus array creation
14667 operation */
14668 TREE_TYPE (node) = error_mark_node;
14669 return error_mark_node;
14670 }
14671
15fdcfe9
PB		 14672 /* Set array_type to the actual (promoted) array type of the result. */
14673 if (TREE_CODE (type) == RECORD_TYPE)
14674 type = build_pointer_type (type);
14675 while (--xdims >= 0)
14676 {
14677 type = promote_type (build_java_array_type (type, -1));
14678 }
14679 dims = nreverse (dims);
14680 array_type = type;
14681 for (cdim = dims; cdim; cdim = TREE_CHAIN (cdim))
14682 {
14683 type = array_type;
05bccae2
RK		 14684 array_type
14685 = build_java_array_type (type,
14686 TREE_CODE (cdim) == INTEGER_CST
14687 ? (HOST_WIDE_INT) TREE_INT_CST_LOW (cdim)
14688 : -1);
15fdcfe9
PB		 14689 array_type = promote_type (array_type);
14690 }
14691 dims = nreverse (dims);
14692
e04a16fb
AG		 14693 /* The node is transformed into a function call. Things are done
14694 differently according to the number of dimensions. If the number
14695 of dimension is equal to 1, then the nature of the base type
14696 (primitive or not) matters. */
15fdcfe9 14697 if (ndims == 1)
fdec99c6 14698 return build_new_array (type, TREE_VALUE (dims));
e35b68b0 14699
e04a16fb
AG		 14700 /* Can't reuse what's already written in expr.c because it uses the
14701 JVM stack representation. Provide a build_multianewarray. FIXME */
dc6d7095
RS		 14702 return build3 (CALL_EXPR, array_type,
14703 build_address_of (soft_multianewarray_node),
14704 tree_cons (NULL_TREE,
14705 build_class_ref (TREE_TYPE (array_type)),
14706 tree_cons (NULL_TREE,
7d60be94
NS		 14707 build_int_cst (NULL_TREE, ndims),
14708 dims)),
dc6d7095 14709 NULL_TREE);
e04a16fb
AG		 14710}
14711
f8976021
APB		 14712/* 10.6 Array initializer. */
14713
14714/* Build a wfl for array element that don't have one, so we can
14715 pin-point errors. */
14716
14717static tree
0a2f0c54 14718maybe_build_array_element_wfl (tree node)
f8976021
APB		 14719{
14720 if (TREE_CODE (node) != EXPR_WITH_FILE_LOCATION)
9ec819d4
PB		 14721 {
14722 /* FIXME - old code used "prev_lc.line" and "elc.prev_col */
14723 return build_expr_wfl (NULL_TREE,
14724#ifdef USE_MAPPED_LOCATION
14725 input_location
14726#else
14727 ctxp->filename,
14728 ctxp->lexer->token_start.line,
14729 ctxp->lexer->token_start.col
14730#endif
14731 );
14732 }
f8976021
APB		 14733 else
14734 return NULL_TREE;
14735}
14736
14737/* Build a NEW_ARRAY_INIT that features a CONSTRUCTOR node. This makes
14738 identification of initialized arrays easier to detect during walk
14739 and expansion. */
14740
14741static tree
0a2f0c54 14742build_new_array_init (int location, tree values)
f8976021 14743{
dcf92453 14744 tree constructor = build_constructor (NULL_TREE, values);
f8976021 14745 tree to_return = build1 (NEW_ARRAY_INIT, NULL_TREE, constructor);
5bba4807 14746 EXPR_WFL_LINECOL (to_return) = location;
f8976021
APB		 14747 return to_return;
14748}
14749
14750/* Expand a NEW_ARRAY_INIT node. Return error_mark_node if an error
14751 occurred. Otherwise return NODE after having set its type
14752 appropriately. */
14753
14754static tree
0a2f0c54 14755patch_new_array_init (tree type, tree node)
f8976021
APB		 14756{
14757 int error_seen = 0;
fdec99c6 14758 tree current, element_type;
f8976021 14759 HOST_WIDE_INT length;
fdec99c6
PB		 14760 int all_constant = 1;
14761 tree init = TREE_OPERAND (node, 0);
f8976021 14762
fdec99c6
PB		 14763 if (TREE_CODE (type) != POINTER_TYPE || ! TYPE_ARRAY_P (TREE_TYPE (type)))
14764 {
14765 parse_error_context (node,
14766 "Invalid array initializer for non-array type `%s'",
14767 lang_printable_name (type, 1));
14768 return error_mark_node;
14769 }
14770 type = TREE_TYPE (type);
14771 element_type = TYPE_ARRAY_ELEMENT (type);
f8976021 14772
fdec99c6
PB		 14773 CONSTRUCTOR_ELTS (init) = nreverse (CONSTRUCTOR_ELTS (init));
14774
14775 for (length = 0, current = CONSTRUCTOR_ELTS (init);
14776 current; length++, current = TREE_CHAIN (current))
f8976021 14777 {
fdec99c6
PB		 14778 tree elt = TREE_VALUE (current);
14779 if (elt == NULL_TREE || TREE_CODE (elt) != NEW_ARRAY_INIT)
f8976021 14780 {
fdec99c6 14781 error_seen |= array_constructor_check_entry (element_type, current);
5bba4807
PB		 14782 elt = TREE_VALUE (current);
14783 /* When compiling to native code, STRING_CST is converted to
14784 INDIRECT_REF, but still with a TREE_CONSTANT flag. */
14785 if (! TREE_CONSTANT (elt) || TREE_CODE (elt) == INDIRECT_REF)
fdec99c6 14786 all_constant = 0;
f8976021 14787 }
fdec99c6
PB		 14788 else
14789 {
14790 TREE_VALUE (current) = patch_new_array_init (element_type, elt);
14791 TREE_PURPOSE (current) = NULL_TREE;
14792 all_constant = 0;
14793 }
e35b68b0 14794 if (elt && TREE_CODE (elt) == TREE_LIST
9a7ab4b3 14795 && TREE_VALUE (elt) == error_mark_node)
fdec99c6 14796 error_seen = 1;
f8976021
APB		 14797 }
14798
14799 if (error_seen)
14800 return error_mark_node;
14801
14802 /* Create a new type. We can't reuse the one we have here by
14803 patching its dimension because it originally is of dimension -1
14804 hence reused by gcc. This would prevent triangular arrays. */
fdec99c6
PB		 14805 type = build_java_array_type (element_type, length);
14806 TREE_TYPE (init) = TREE_TYPE (TREE_CHAIN (TREE_CHAIN (TYPE_FIELDS (type))));
14807 TREE_TYPE (node) = promote_type (type);
14808 TREE_CONSTANT (init) = all_constant;
6de9cd9a 14809 TREE_INVARIANT (init) = all_constant;
bc3ca41b 14810 TREE_CONSTANT (node) = all_constant;
6de9cd9a 14811 TREE_INVARIANT (node) = all_constant;
f8976021
APB		 14812 return node;
14813}
14814
14815/* Verify that one entry of the initializer element list can be
14816 assigned to the array base type. Report 1 if an error occurred, 0
14817 otherwise. */
14818
14819static int
0a2f0c54 14820array_constructor_check_entry (tree type, tree entry)
f8976021
APB		 14821{
14822 char *array_type_string = NULL; /* For error reports */
14823 tree value, type_value, new_value, wfl_value, patched;
14824 int error_seen = 0;
14825
14826 new_value = NULL_TREE;
14827 wfl_value = TREE_VALUE (entry);
14828
f8976021 14829 value = java_complete_tree (TREE_VALUE (entry));
1179ebc2 14830 /* patch_string return error_mark_node if arg is error_mark_node */
f8976021
APB		 14831 if ((patched = patch_string (value)))
14832 value = patched;
1179ebc2
APB		 14833 if (value == error_mark_node)
14834 return 1;
e35b68b0 14835
f8976021 14836 type_value = TREE_TYPE (value);
e35b68b0 14837
1179ebc2 14838 /* At anytime, try_builtin_assignconv can report a warning on
f8976021
APB		 14839 constant overflow during narrowing. */
14840 SET_WFL_OPERATOR (wfl_operator, TREE_PURPOSE (entry), wfl_value);
14841 new_value = try_builtin_assignconv (wfl_operator, type, value);
14842 if (!new_value && (new_value = try_reference_assignconv (type, value)))
14843 type_value = promote_type (type);
100f7cd8 14844
f8976021
APB		 14845 /* Check and report errors */
14846 if (!new_value)
14847 {
83182544 14848 const char *const msg = (!valid_cast_to_p (type_value, type) ?
f8976021
APB		 14849 "Can't" : "Explicit cast needed to");
14850 if (!array_type_string)
c2e3db92 14851 array_type_string = xstrdup (lang_printable_name (type, 1));
e35b68b0 14852 parse_error_context
f8976021
APB		 14853 (wfl_operator, "Incompatible type for array. %s convert `%s' to `%s'",
14854 msg, lang_printable_name (type_value, 1), array_type_string);
14855 error_seen = 1;
14856 }
e35b68b0 14857
f8976021 14858 if (new_value)
961b8e70 14859 TREE_VALUE (entry) = new_value;
f8976021
APB		 14860
14861 if (array_type_string)
14862 free (array_type_string);
14863
14864 TREE_PURPOSE (entry) = NULL_TREE;
14865 return error_seen;
14866}
14867
e04a16fb 14868static tree
0a2f0c54 14869build_this (int location)
e04a16fb 14870{
9ee9b555 14871 tree node = build_wfl_node (this_identifier_node);
b67d701b 14872 TREE_SET_CODE (node, THIS_EXPR);
e04a16fb
AG		 14873 EXPR_WFL_LINECOL (node) = location;
14874 return node;
14875}
14876
14877/* 14.15 The return statement. It builds a modify expression that
14878 assigns the returned value to the RESULT_DECL that hold the value
14879 to be returned. */
14880
14881static tree
0a2f0c54 14882build_return (int location, tree op)
e04a16fb
AG		 14883{
14884 tree node = build1 (RETURN_EXPR, NULL_TREE, op);
14885 EXPR_WFL_LINECOL (node) = location;
b67d701b 14886 node = build_debugable_stmt (location, node);
e04a16fb
AG		 14887 return node;
14888}
14889
14890static tree
0a2f0c54 14891patch_return (tree node)
e04a16fb
AG		 14892{
14893 tree return_exp = TREE_OPERAND (node, 0);
14894 tree meth = current_function_decl;
14895 tree mtype = TREE_TYPE (TREE_TYPE (current_function_decl));
e04a16fb
AG		 14896 int error_found = 0;
14897
14898 TREE_TYPE (node) = error_mark_node;
14899 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
14900
14901 /* It's invalid to have a return value within a function that is
14902 declared with the keyword void or that is a constructor */
14903 if (return_exp && (mtype == void_type_node || DECL_CONSTRUCTOR_P (meth)))
14904 error_found = 1;
14905
f099f336 14906 /* It's invalid to use a return statement in a static block */
c2952b01 14907 if (DECL_CLINIT_P (current_function_decl))
f099f336
APB		 14908 error_found = 1;
14909
e04a16fb
AG		 14910 /* It's invalid to have a no return value within a function that
14911 isn't declared with the keyword `void' */
14912 if (!return_exp && (mtype != void_type_node && !DECL_CONSTRUCTOR_P (meth)))
14913 error_found = 2;
e35b68b0 14914
17126208 14915 if (DECL_INSTINIT_P (current_function_decl))
c2952b01 14916 error_found = 1;
e04a16fb
AG		 14917
14918 if (error_found)
14919 {
17126208 14920 if (DECL_INSTINIT_P (current_function_decl))
f099f336 14921 parse_error_context (wfl_operator,
c2952b01 14922 "`return' inside instance initializer");
e35b68b0 14923
c2952b01
APB		 14924 else if (DECL_CLINIT_P (current_function_decl))
14925 parse_error_context (wfl_operator,
14926 "`return' inside static initializer");
f099f336
APB		 14927
14928 else if (!DECL_CONSTRUCTOR_P (meth))
22eed1e6 14929 {
c2e3db92 14930 char *t = xstrdup (lang_printable_name (mtype, 0));
e35b68b0 14931 parse_error_context (wfl_operator,
22eed1e6 14932 "`return' with%s value from `%s %s'",
e35b68b0 14933 (error_found == 1 ? "" : "out"),
1b9deeb4 14934 t, lang_printable_name (meth, 2));
22eed1e6
APB		 14935 free (t);
14936 }
14937 else
e35b68b0 14938 parse_error_context (wfl_operator,
22eed1e6 14939 "`return' with value from constructor `%s'",
1b9deeb4 14940 lang_printable_name (meth, 2));
e04a16fb
AG		 14941 return error_mark_node;
14942 }
14943
5e942c50
APB		 14944 /* If we have a return_exp, build a modify expression and expand
14945 it. Note: at that point, the assignment is declared valid, but we
14946 may want to carry some more hacks */
e04a16fb
AG		 14947 if (return_exp)
14948 {
5e942c50
APB		 14949 tree exp = java_complete_tree (return_exp);
14950 tree modify, patched;
14951
5e942c50
APB		 14952 if ((patched = patch_string (exp)))
14953 exp = patched;
e35b68b0 14954
dc6d7095 14955 modify = build2 (MODIFY_EXPR, NULL_TREE, DECL_RESULT (meth), exp);
e04a16fb
AG		 14956 EXPR_WFL_LINECOL (modify) = EXPR_WFL_LINECOL (node);
14957 modify = java_complete_tree (modify);
5e942c50 14958
e04a16fb
AG		 14959 if (modify != error_mark_node)
14960 {
14961 TREE_SIDE_EFFECTS (modify) = 1;
14962 TREE_OPERAND (node, 0) = modify;
14963 }
14964 else
14965 return error_mark_node;
14966 }
14967 TREE_TYPE (node) = void_type_node;
14968 TREE_SIDE_EFFECTS (node) = 1;
14969 return node;
14970}
14971
14972/* 14.8 The if Statement */
14973
14974static tree
0a2f0c54
KG		 14975build_if_else_statement (int location, tree expression, tree if_body,
14976 tree else_body)
e04a16fb
AG		 14977{
14978 tree node;
e04a16fb 14979 if (!else_body)
6de9cd9a 14980 else_body = build_java_empty_stmt ();
dc6d7095 14981 node = build3 (COND_EXPR, NULL_TREE, expression, if_body, else_body);
e04a16fb 14982 EXPR_WFL_LINECOL (node) = location;
b67d701b 14983 node = build_debugable_stmt (location, node);
e04a16fb
AG		 14984 return node;
14985}
14986
14987static tree
0a2f0c54 14988patch_if_else_statement (tree node)
e04a16fb
AG		 14989{
14990 tree expression = TREE_OPERAND (node, 0);
be98560f
PB		 14991 int can_complete_normally
14992 = (CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 1))
14993 | CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 2)));
e04a16fb
AG		 14994
14995 TREE_TYPE (node) = error_mark_node;
14996 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
14997
14998 /* The type of expression must be boolean */
b67d701b
PB		 14999 if (TREE_TYPE (expression) != boolean_type_node
15000 && TREE_TYPE (expression) != promoted_boolean_type_node)
e04a16fb 15001 {
e35b68b0
AD		 15002 parse_error_context
15003 (wfl_operator,
15004 "Incompatible type for `if'. Can't convert `%s' to `boolean'",
0a2138e2 15005 lang_printable_name (TREE_TYPE (expression), 0));
e04a16fb
AG		 15006 return error_mark_node;
15007 }
e35b68b0 15008
e04a16fb
AG		 15009 TREE_TYPE (node) = void_type_node;
15010 TREE_SIDE_EFFECTS (node) = 1;
be98560f 15011 CAN_COMPLETE_NORMALLY (node) = can_complete_normally;
e04a16fb
AG		 15012 return node;
15013}
15014
15015/* 14.6 Labeled Statements */
15016
67264b4f 15017/* Action taken when a labeled statement is parsed. a new
e04a16fb 15018 LABELED_BLOCK_EXPR is created. No statement is attached to the
b635eb2f 15019 label, yet. LABEL can be NULL_TREE for artificially-generated blocks. */
e04a16fb
AG		 15020
15021static tree
0a2f0c54 15022build_labeled_block (int location, tree label)
e04a16fb 15023{
b635eb2f 15024 tree label_name ;
e04a16fb 15025 tree label_decl, node;
b635eb2f
PB		 15026 if (label == NULL_TREE || label == continue_identifier_node)
15027 label_name = label;
15028 else
e04a16fb 15029 {
b635eb2f
PB		 15030 label_name = merge_qualified_name (label_id, label);
15031 /* Issue an error if we try to reuse a label that was previously
15032 declared */
15033 if (IDENTIFIER_LOCAL_VALUE (label_name))
15034 {
15035 EXPR_WFL_LINECOL (wfl_operator) = location;
781b0558
KG		 15036 parse_error_context (wfl_operator,
15037 "Declaration of `%s' shadows a previous label declaration",
b635eb2f 15038 IDENTIFIER_POINTER (label));
e35b68b0 15039 EXPR_WFL_LINECOL (wfl_operator) =
b635eb2f 15040 EXPR_WFL_LINECOL (IDENTIFIER_LOCAL_VALUE (label_name));
781b0558
KG		 15041 parse_error_context (wfl_operator,
15042 "This is the location of the previous declaration of label `%s'",
b635eb2f
PB		 15043 IDENTIFIER_POINTER (label));
15044 java_error_count--;
15045 }
e04a16fb
AG		 15046 }
15047
15048 label_decl = create_label_decl (label_name);
dc6d7095 15049 node = build2 (LABELED_BLOCK_EXPR, NULL_TREE, label_decl, NULL_TREE);
e04a16fb
AG		 15050 EXPR_WFL_LINECOL (node) = location;
15051 TREE_SIDE_EFFECTS (node) = 1;
15052 return node;
15053}
15054
b67d701b 15055/* A labeled statement LBE is attached a statement. */
e04a16fb
AG		 15056
15057static tree
0a2f0c54
KG		 15058finish_labeled_statement (tree lbe, /* Labeled block expr */
15059 tree statement)
e04a16fb
AG		 15060{
15061 /* In anyways, tie the loop to its statement */
15062 LABELED_BLOCK_BODY (lbe) = statement;
b635eb2f
PB		 15063 pop_labeled_block ();
15064 POP_LABELED_BLOCK ();
e04a16fb
AG		 15065 return lbe;
15066}
15067
15068/* 14.10, 14.11, 14.12 Loop Statements */
15069
15070/* Create an empty LOOP_EXPR and make it the last in the nested loop
15071 list. */
15072
15073static tree
0a2f0c54 15074build_new_loop (tree loop_body)
e04a16fb 15075{
dc6d7095 15076 tree loop = build1 (LOOP_EXPR, NULL_TREE, loop_body);
e04a16fb
AG		 15077 TREE_SIDE_EFFECTS (loop) = 1;
15078 PUSH_LOOP (loop);
15079 return loop;
15080}
15081
15082/* Create a loop body according to the following structure:
15083 COMPOUND_EXPR
15084 COMPOUND_EXPR (loop main body)
15085 EXIT_EXPR (this order is for while/for loops.
15086 LABELED_BLOCK_EXPR the order is reversed for do loops)
e35b68b0 15087 LABEL_DECL (a continue occurring here branches at the
e04a16fb
AG		 15088 BODY end of this labeled block)
15089 INCREMENT (if any)
15090
ee142fe7 15091 REVERSED, if nonzero, tells that the loop condition expr comes
b67d701b
PB		 15092 after the body, like in the do-while loop.
15093
15094 To obtain a loop, the loop body structure described above is
15095 encapsulated within a LOOP_EXPR surrounded by a LABELED_BLOCK_EXPR:
15096
15097 LABELED_BLOCK_EXPR
15098 LABEL_DECL (use this label to exit the loop)
15099 LOOP_EXPR
15100 <structure described above> */
e04a16fb
AG		 15101
15102static tree
0a2f0c54 15103build_loop_body (int location, tree condition, int reversed)
e04a16fb 15104{
0a2138e2 15105 tree first, second, body;
e04a16fb 15106
dc6d7095 15107 condition = build1 (EXIT_EXPR, NULL_TREE, condition); /* Force walk */
e04a16fb
AG		 15108 EXPR_WFL_LINECOL (condition) = location; /* For accurate error report */
15109 condition = build_debugable_stmt (location, condition);
15110 TREE_SIDE_EFFECTS (condition) = 1;
15111
b635eb2f 15112 body = build_labeled_block (0, continue_identifier_node);
e04a16fb
AG		 15113 first = (reversed ? body : condition);
15114 second = (reversed ? condition : body);
dc6d7095
RS		 15115 return build2 (COMPOUND_EXPR, NULL_TREE,
15116 build2 (COMPOUND_EXPR, NULL_TREE, first, second),
15117 build_java_empty_stmt ());
e04a16fb
AG		 15118}
15119
15120/* Install CONDITION (if any) and loop BODY (using REVERSED to tell
15121 their order) on the current loop. Unlink the current loop from the
15122 loop list. */
15123
15124static tree
0a2f0c54 15125finish_loop_body (int location, tree condition, tree body, int reversed)
e04a16fb
AG		 15126{
15127 tree to_return = ctxp->current_loop;
15128 tree loop_body = LOOP_EXPR_BODY (to_return);
15129 if (condition)
15130 {
15131 tree cnode = LOOP_EXPR_BODY_CONDITION_EXPR (loop_body, reversed);
15132 /* We wrapped the EXIT_EXPR around a WFL so we can debug it.
15133 The real EXIT_EXPR is one operand further. */
15134 EXPR_WFL_LINECOL (cnode) = location;
9ec819d4
PB		 15135 if (TREE_CODE (cnode) == EXPR_WITH_FILE_LOCATION)
15136 {
15137 cnode = EXPR_WFL_NODE (cnode);
15138 /* This one is for accurate error reports */
15139 EXPR_WFL_LINECOL (cnode) = location;
15140 }
15141 TREE_OPERAND (cnode, 0) = condition;
e04a16fb
AG		 15142 }
15143 LOOP_EXPR_BODY_BODY_EXPR (loop_body, reversed) = body;
15144 POP_LOOP ();
15145 return to_return;
15146}
15147
b635eb2f 15148/* Tailored version of finish_loop_body for FOR loops, when FOR
e04a16fb
AG		 15149 loops feature the condition part */
15150
15151static tree
0a2f0c54 15152finish_for_loop (int location, tree condition, tree update, tree body)
e04a16fb
AG		 15153{
15154 /* Put the condition and the loop body in place */
b635eb2f 15155 tree loop = finish_loop_body (location, condition, body, 0);
e04a16fb 15156 /* LOOP is the current loop which has been now popped of the loop
486e8c0c
TT		 15157 stack. Mark the update block as reachable and install it. We do
15158 this because the (current interpretation of the) JLS requires
15159 that the update expression be considered reachable even if the
15160 for loop's body doesn't complete normally. */
6de9cd9a 15161 if (update != NULL_TREE && !IS_EMPTY_STMT (update))
486e8c0c
TT		 15162 {
15163 tree up2 = update;
15164 if (TREE_CODE (up2) == EXPR_WITH_FILE_LOCATION)
15165 up2 = EXPR_WFL_NODE (up2);
fcc8cecb
TT		 15166 /* It is possible for the update expression to be an
15167 EXPR_WFL_NODE wrapping nothing. */
6de9cd9a 15168 if (up2 != NULL_TREE && !IS_EMPTY_STMT (up2))
fcc8cecb
TT		 15169 {
15170 /* Try to detect constraint violations. These would be
15171 programming errors somewhere. */
6615c446 15172 if (! EXPR_P (up2) || TREE_CODE (up2) == LOOP_EXPR)
fcc8cecb
TT		 15173 abort ();
15174 SUPPRESS_UNREACHABLE_ERROR (up2) = 1;
15175 }
486e8c0c 15176 }
e04a16fb
AG		 15177 LOOP_EXPR_BODY_UPDATE_BLOCK (LOOP_EXPR_BODY (loop)) = update;
15178 return loop;
15179}
15180
5cbdba64
APB		 15181/* Try to find the loop a block might be related to. This comprises
15182 the case where the LOOP_EXPR is found as the second operand of a
15183 COMPOUND_EXPR, because the loop happens to have an initialization
15184 part, then expressed as the first operand of the COMPOUND_EXPR. If
15185 the search finds something, 1 is returned. Otherwise, 0 is
15186 returned. The search is assumed to start from a
15187 LABELED_BLOCK_EXPR's block. */
15188
15189static tree
0a2f0c54 15190search_loop (tree statement)
5cbdba64
APB		 15191{
15192 if (TREE_CODE (statement) == LOOP_EXPR)
15193 return statement;
15194
15195 if (TREE_CODE (statement) == BLOCK)
15196 statement = BLOCK_SUBBLOCKS (statement);
15197 else
15198 return NULL_TREE;
15199
15200 if (statement && TREE_CODE (statement) == COMPOUND_EXPR)
15201 while (statement && TREE_CODE (statement) == COMPOUND_EXPR)
15202 statement = TREE_OPERAND (statement, 1);
15203
15204 return (TREE_CODE (statement) == LOOP_EXPR
c2952b01 15205 && FOR_LOOP_P (statement) ? statement : NULL_TREE);
5cbdba64
APB		 15206}
15207
15208/* Return 1 if LOOP can be found in the labeled block BLOCK. 0 is
15209 returned otherwise. */
15210
15211static int
0a2f0c54 15212labeled_block_contains_loop_p (tree block, tree loop)
5cbdba64
APB		 15213{
15214 if (!block)
15215 return 0;
15216
15217 if (LABELED_BLOCK_BODY (block) == loop)
15218 return 1;
15219
c2952b01 15220 if (FOR_LOOP_P (loop) && search_loop (LABELED_BLOCK_BODY (block)) == loop)
5cbdba64
APB		 15221 return 1;
15222
15223 return 0;
15224}
15225
e04a16fb 15226/* If the loop isn't surrounded by a labeled statement, create one and
b635eb2f 15227 insert LOOP as its body. */
e04a16fb
AG		 15228
15229static tree
0a2f0c54 15230patch_loop_statement (tree loop)
e04a16fb 15231{
cd9643f7 15232 tree loop_label;
5cbdba64 15233
cd9643f7 15234 TREE_TYPE (loop) = void_type_node;
5cbdba64
APB		 15235 if (labeled_block_contains_loop_p (ctxp->current_labeled_block, loop))
15236 return loop;
15237
cd9643f7 15238 loop_label = build_labeled_block (0, NULL_TREE);
5cbdba64
APB		 15239 /* LOOP is an EXPR node, so it should have a valid EXPR_WFL_LINECOL
15240 that LOOP_LABEL could enquire about, for a better accuracy. FIXME */
cd9643f7
PB		 15241 LABELED_BLOCK_BODY (loop_label) = loop;
15242 PUSH_LABELED_BLOCK (loop_label);
5cbdba64 15243 return loop_label;
e04a16fb
AG		 15244}
15245
15246/* 14.13, 14.14: break and continue Statements */
15247
15248/* Build a break or a continue statement. a null NAME indicates an
15249 unlabeled break/continue statement. */
15250
15251static tree
0a2f0c54 15252build_bc_statement (int location, int is_break, tree name)
e04a16fb
AG		 15253{
15254 tree break_continue, label_block_expr = NULL_TREE;
15255
15256 if (name)
15257 {
e35b68b0 15258 if (!(label_block_expr = IDENTIFIER_LOCAL_VALUE
e04a16fb
AG		 15259 (merge_qualified_name (label_id, EXPR_WFL_NODE (name)))))
15260 /* Null means that we don't have a target for this named
15261 break/continue. In this case, we make the target to be the
67264b4f 15262 label name, so that the error can be reported accurately in
e04a16fb
AG		 15263 patch_bc_statement. */
15264 label_block_expr = EXPR_WFL_NODE (name);
15265 }
15266 /* Unlabeled break/continue will be handled during the
15267 break/continue patch operation */
dc6d7095
RS		 15268 break_continue = build2 (EXIT_BLOCK_EXPR, NULL_TREE,
15269 label_block_expr, NULL_TREE);
e04a16fb
AG		 15270
15271 IS_BREAK_STMT_P (break_continue) = is_break;
15272 TREE_SIDE_EFFECTS (break_continue) = 1;
15273 EXPR_WFL_LINECOL (break_continue) = location;
b67d701b 15274 break_continue = build_debugable_stmt (location, break_continue);
e04a16fb
AG		 15275 return break_continue;
15276}
15277
15278/* Verification of a break/continue statement. */
15279
15280static tree
0a2f0c54 15281patch_bc_statement (tree node)
e04a16fb
AG		 15282{
15283 tree bc_label = EXIT_BLOCK_LABELED_BLOCK (node), target_stmt;
b635eb2f 15284 tree labeled_block = ctxp->current_labeled_block;
b67d701b 15285 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
e35b68b0 15286
e04a16fb 15287 /* Having an identifier here means that the target is unknown. */
b635eb2f 15288 if (bc_label != NULL_TREE && TREE_CODE (bc_label) == IDENTIFIER_NODE)
e04a16fb
AG		 15289 {
15290 parse_error_context (wfl_operator, "No label definition found for `%s'",
15291 IDENTIFIER_POINTER (bc_label));
15292 return error_mark_node;
15293 }
b635eb2f 15294 if (! IS_BREAK_STMT_P (node))
e04a16fb 15295 {
b635eb2f
PB		 15296 /* It's a continue statement. */
15297 for (;; labeled_block = TREE_CHAIN (labeled_block))
e04a16fb 15298 {
b635eb2f
PB		 15299 if (labeled_block == NULL_TREE)
15300 {
15301 if (bc_label == NULL_TREE)
15302 parse_error_context (wfl_operator,
15303 "`continue' must be in loop");
15304 else
e35b68b0 15305 parse_error_context
1504b2b4
APB		 15306 (wfl_operator, "continue label `%s' does not name a loop",
15307 IDENTIFIER_POINTER (bc_label));
b635eb2f
PB		 15308 return error_mark_node;
15309 }
15310 if ((DECL_NAME (LABELED_BLOCK_LABEL (labeled_block))
15311 == continue_identifier_node)
15312 && (bc_label == NULL_TREE
15313 || TREE_CHAIN (labeled_block) == bc_label))
15314 {
15315 bc_label = labeled_block;
15316 break;
15317 }
e04a16fb 15318 }
e04a16fb 15319 }
b635eb2f 15320 else if (!bc_label)
e35b68b0 15321 {
b635eb2f 15322 for (;; labeled_block = TREE_CHAIN (labeled_block))
e04a16fb 15323 {
b635eb2f
PB		 15324 if (labeled_block == NULL_TREE)
15325 {
15326 parse_error_context (wfl_operator,
15327 "`break' must be in loop or switch");
15328 return error_mark_node;
15329 }
15330 target_stmt = LABELED_BLOCK_BODY (labeled_block);
15331 if (TREE_CODE (target_stmt) == SWITCH_EXPR
5cbdba64 15332 || search_loop (target_stmt))
b635eb2f
PB		 15333 {
15334 bc_label = labeled_block;
15335 break;
15336 }
e04a16fb 15337 }
e04a16fb
AG		 15338 }
15339
b635eb2f 15340 EXIT_BLOCK_LABELED_BLOCK (node) = bc_label;
15fdcfe9
PB		 15341 CAN_COMPLETE_NORMALLY (bc_label) = 1;
15342
e04a16fb
AG		 15343 /* Our break/continue don't return values. */
15344 TREE_TYPE (node) = void_type_node;
15345 /* Encapsulate the break within a compound statement so that it's
5cbdba64 15346 expanded all the times by expand_expr (and not clobbered
e04a16fb
AG		 15347 sometimes, like after a if statement) */
15348 node = add_stmt_to_compound (NULL_TREE, void_type_node, node);
15349 TREE_SIDE_EFFECTS (node) = 1;
15350 return node;
15351}
15352
15353/* Process the exit expression belonging to a loop. Its type must be
15354 boolean. */
15355
15356static tree
0a2f0c54 15357patch_exit_expr (tree node)
e04a16fb
AG		 15358{
15359 tree expression = TREE_OPERAND (node, 0);
15360 TREE_TYPE (node) = error_mark_node;
15361 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
15362
15363 /* The type of expression must be boolean */
15364 if (TREE_TYPE (expression) != boolean_type_node)
15365 {
e35b68b0
AD		 15366 parse_error_context
15367 (wfl_operator,
15368 "Incompatible type for loop conditional. Can't convert `%s' to `boolean'",
0a2138e2 15369 lang_printable_name (TREE_TYPE (expression), 0));
e04a16fb
AG		 15370 return error_mark_node;
15371 }
15372 /* Now we know things are allright, invert the condition, fold and
15373 return */
e35b68b0 15374 TREE_OPERAND (node, 0) =
e04a16fb 15375 fold (build1 (TRUTH_NOT_EXPR, boolean_type_node, expression));
15fdcfe9
PB		 15376
15377 if (! integer_zerop (TREE_OPERAND (node, 0))
15378 && ctxp->current_loop != NULL_TREE
15379 && TREE_CODE (ctxp->current_loop) == LOOP_EXPR)
15380 CAN_COMPLETE_NORMALLY (ctxp->current_loop) = 1;
15381 if (! integer_onep (TREE_OPERAND (node, 0)))
15382 CAN_COMPLETE_NORMALLY (node) = 1;
15383
15384
e04a16fb
AG		 15385 TREE_TYPE (node) = void_type_node;
15386 return node;
15387}
b67d701b
PB		 15388
15389/* 14.9 Switch statement */
15390
15391static tree
0a2f0c54 15392patch_switch_statement (tree node)
b67d701b 15393{
c877974e 15394 tree se = TREE_OPERAND (node, 0), se_type;
5a21a051 15395 tree save, iter;
b67d701b
PB		 15396
15397 /* Complete the switch expression */
15398 se = TREE_OPERAND (node, 0) = java_complete_tree (se);
15399 se_type = TREE_TYPE (se);
15400 /* The type of the switch expression must be char, byte, short or
15401 int */
2e0f0aff 15402 if (! JINTEGRAL_TYPE_P (se_type) || se_type == long_type_node)
b67d701b
PB		 15403 {
15404 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
781b0558
KG		 15405 parse_error_context (wfl_operator,
15406 "Incompatible type for `switch'. Can't convert `%s' to `int'",
0a2138e2 15407 lang_printable_name (se_type, 0));
b67d701b
PB		 15408 /* This is what java_complete_tree will check */
15409 TREE_OPERAND (node, 0) = error_mark_node;
15410 return error_mark_node;
15411 }
15412
5a21a051
TT		 15413 /* Save and restore the outer case label list. */
15414 save = case_label_list;
15415 case_label_list = NULL_TREE;
15416
15fdcfe9 15417 TREE_OPERAND (node, 1) = java_complete_tree (TREE_OPERAND (node, 1));
b67d701b 15418
5a21a051
TT		 15419 /* See if we've found a duplicate label. We can't leave this until
15420 code generation, because in `--syntax-only' and `-C' modes we
15421 don't do ordinary code generation. */
15422 for (iter = case_label_list; iter != NULL_TREE; iter = TREE_CHAIN (iter))
15423 {
15424 HOST_WIDE_INT val = TREE_INT_CST_LOW (TREE_VALUE (iter));
15425 tree subiter;
15426 for (subiter = TREE_CHAIN (iter);
15427 subiter != NULL_TREE;
15428 subiter = TREE_CHAIN (subiter))
15429 {
15430 HOST_WIDE_INT subval = TREE_INT_CST_LOW (TREE_VALUE (subiter));
15431 if (val == subval)
15432 {
15433 EXPR_WFL_LINECOL (wfl_operator)
15434 = EXPR_WFL_LINECOL (TREE_PURPOSE (iter));
15435 /* The case_label_list is in reverse order, so print the
15436 outer label first. */
cc586d70
KG		 15437 parse_error_context (wfl_operator, "duplicate case label: `"
15438 HOST_WIDE_INT_PRINT_DEC "'", subval);
5a21a051
TT		 15439 EXPR_WFL_LINECOL (wfl_operator)
15440 = EXPR_WFL_LINECOL (TREE_PURPOSE (subiter));
15441 parse_error_context (wfl_operator, "original label is here");
15442
15443 break;
15444 }
15445 }
15446 }
15447
15448 case_label_list = save;
15449
b67d701b 15450 /* Ready to return */
15fdcfe9 15451 if (TREE_CODE (TREE_OPERAND (node, 1)) == ERROR_MARK)
b67d701b
PB		 15452 {
15453 TREE_TYPE (node) = error_mark_node;
15454 return error_mark_node;
15455 }
15456 TREE_TYPE (node) = void_type_node;
15457 TREE_SIDE_EFFECTS (node) = 1;
15fdcfe9 15458 CAN_COMPLETE_NORMALLY (node)
e35b68b0 15459 = CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 1))
c877974e 15460 || ! SWITCH_HAS_DEFAULT (node);
b67d701b
PB		 15461 return node;
15462}
15463
c6226a7e
TT		 15464/* Assertions. */
15465
15466/* Build an assertion expression for `assert CONDITION : VALUE'; VALUE
15467 might be NULL_TREE. */
15468static tree
9ec819d4
PB		 15469build_assertion (
15470#ifdef USE_MAPPED_LOCATION
15471 source_location location,
15472#else
15473 int location,
15474#endif
15475 tree condition, tree value)
c6226a7e
TT		 15476{
15477 tree node;
15478 tree klass = GET_CPC ();
15479
24d82bce
PB		 15480 if (! enable_assertions (klass))
15481 {
dc6d7095
RS		 15482 condition = build2 (TRUTH_ANDIF_EXPR, NULL_TREE,
15483 boolean_false_node, condition);
24d82bce 15484 if (value == NULL_TREE)
6de9cd9a 15485 value = build_java_empty_stmt ();
24d82bce
PB		 15486 return build_if_else_statement (location, condition,
15487 value, NULL_TREE);
15488 }
15489
c6226a7e
TT		 15490 if (! CLASS_USES_ASSERTIONS (klass))
15491 {
15492 tree field, classdollar, id, call;
15493 tree class_type = TREE_TYPE (klass);
15494
15495 field = add_field (class_type,
15496 get_identifier ("$assertionsDisabled"),
15497 boolean_type_node,
15498 ACC_PRIVATE | ACC_STATIC | ACC_FINAL);
15499 MAYBE_CREATE_VAR_LANG_DECL_SPECIFIC (field);
15500 FIELD_SYNTHETIC (field) = 1;
15501
202167e7 15502 classdollar = build_incomplete_class_ref (location, class_type);
c6226a7e
TT		 15503
15504 /* Call CLASS.desiredAssertionStatus(). */
15505 id = build_wfl_node (get_identifier ("desiredAssertionStatus"));
dc6d7095 15506 call = build3 (CALL_EXPR, NULL_TREE, id, NULL_TREE, NULL_TREE);
c6226a7e
TT		 15507 call = make_qualified_primary (classdollar, call, location);
15508 TREE_SIDE_EFFECTS (call) = 1;
ee1884cb
JR		 15509
15510 /* Invert to obtain !CLASS.desiredAssertionStatus(). This may
15511 seem odd, but we do it to generate code identical to that of
15512 the JDK. */
15513 call = build1 (TRUTH_NOT_EXPR, NULL_TREE, call);
15514 TREE_SIDE_EFFECTS (call) = 1;
c6226a7e
TT		 15515 DECL_INITIAL (field) = call;
15516
15517 /* Record the initializer in the initializer statement list. */
dc6d7095 15518 call = build2 (MODIFY_EXPR, NULL_TREE, field, call);
c6226a7e
TT		 15519 TREE_CHAIN (call) = CPC_STATIC_INITIALIZER_STMT (ctxp);
15520 SET_CPC_STATIC_INITIALIZER_STMT (ctxp, call);
15521 MODIFY_EXPR_FROM_INITIALIZATION_P (call) = 1;
15522
15523 CLASS_USES_ASSERTIONS (klass) = 1;
15524 }
15525
15526 if (value != NULL_TREE)
15527 value = tree_cons (NULL_TREE, value, NULL_TREE);
15528
15529 node = build_wfl_node (get_identifier ("java"));
15530 node = make_qualified_name (node, build_wfl_node (get_identifier ("lang")),
15531 location);
15532 node = make_qualified_name (node, build_wfl_node (get_identifier ("AssertionError")),
15533 location);
15534
dc6d7095 15535 node = build3 (NEW_CLASS_EXPR, NULL_TREE, node, value, NULL_TREE);
c6226a7e
TT		 15536 TREE_SIDE_EFFECTS (node) = 1;
15537 /* It is too early to use BUILD_THROW. */
15538 node = build1 (THROW_EXPR, NULL_TREE, node);
15539 TREE_SIDE_EFFECTS (node) = 1;
15540
15541 /* We invert the condition; if we just put NODE as the `else' part
15542 then we generate weird-looking bytecode. */
15543 condition = build1 (TRUTH_NOT_EXPR, NULL_TREE, condition);
15544 /* Check $assertionsDisabled. */
15545 condition
dc6d7095
RS		 15546 = build2 (TRUTH_ANDIF_EXPR, NULL_TREE,
15547 build1 (TRUTH_NOT_EXPR, NULL_TREE,
15548 build_wfl_node (get_identifier ("$assertionsDisabled"))),
15549 condition);
c6226a7e
TT		 15550 node = build_if_else_statement (location, condition, node, NULL_TREE);
15551 return node;
15552}
15553
165f37bc 15554/* 14.18 The try/catch statements */
b67d701b 15555
17126208
APB		 15556/* Encapsulate TRY_STMTS' in a try catch sequence. The catch clause
15557 catches TYPE and executes CATCH_STMTS. */
15558
15559static tree
b8ca854a 15560encapsulate_with_try_catch (int location, tree type_or_name, tree try_stmts,
0a2f0c54 15561 tree catch_stmts)
17126208
APB		 15562{
15563 tree try_block, catch_clause_param, catch_block, catch;
15564
15565 /* First build a try block */
15566 try_block = build_expr_block (try_stmts, NULL_TREE);
15567
15568 /* Build a catch block: we need a catch clause parameter */
b8ca854a
JS		 15569 if (TREE_CODE (type_or_name) == EXPR_WITH_FILE_LOCATION)
15570 {
15571 tree catch_type = obtain_incomplete_type (type_or_name);
15572 jdep *dep;
15573 catch_clause_param = build_decl (VAR_DECL, wpv_id, catch_type);
15574 register_incomplete_type (JDEP_VARIABLE, type_or_name,
15575 catch_clause_param, catch_type);
15576 dep = CLASSD_LAST (ctxp->classd_list);
15577 JDEP_GET_PATCH (dep) = &TREE_TYPE (catch_clause_param);
15578 }
15579 else
15580 catch_clause_param = build_decl (VAR_DECL, wpv_id,
15581 build_pointer_type (type_or_name));
15582
17126208
APB		 15583 /* And a block */
15584 catch_block = build_expr_block (NULL_TREE, catch_clause_param);
e35b68b0 15585
17126208 15586 /* Initialize the variable and store in the block */
dc6d7095
RS		 15587 catch = build2 (MODIFY_EXPR, NULL_TREE, catch_clause_param,
15588 build0 (JAVA_EXC_OBJ_EXPR, ptr_type_node));
17126208
APB		 15589 add_stmt_to_block (catch_block, NULL_TREE, catch);
15590
15591 /* Add the catch statements */
15592 add_stmt_to_block (catch_block, NULL_TREE, catch_stmts);
15593
6de9cd9a
DN		 15594 /* Now we can build a JAVA_CATCH_EXPR */
15595 catch_block = build1 (JAVA_CATCH_EXPR, NULL_TREE, catch_block);
17126208
APB		 15596
15597 return build_try_statement (location, try_block, catch_block);
15598}
15599
b67d701b 15600static tree
0a2f0c54 15601build_try_statement (int location, tree try_block, tree catches)
a7d8d81f 15602{
dc6d7095 15603 tree node = build2 (TRY_EXPR, NULL_TREE, try_block, catches);
b67d701b 15604 EXPR_WFL_LINECOL (node) = location;
a7d8d81f 15605 return node;
b67d701b
PB		 15606}
15607
a7d8d81f 15608static tree
0a2f0c54 15609build_try_finally_statement (int location, tree try_block, tree finally)
b67d701b 15610{
dc6d7095 15611 tree node = build2 (TRY_FINALLY_EXPR, NULL_TREE, try_block, finally);
a7d8d81f
PB		 15612 EXPR_WFL_LINECOL (node) = location;
15613 return node;
b67d701b
PB		 15614}
15615
15616static tree
0a2f0c54 15617patch_try_statement (tree node)
b67d701b
PB		 15618{
15619 int error_found = 0;
15620 tree try = TREE_OPERAND (node, 0);
15621 /* Exception handlers are considered in left to right order */
15622 tree catch = nreverse (TREE_OPERAND (node, 1));
b9f7e36c 15623 tree current, caught_type_list = NULL_TREE;
b67d701b
PB		 15624
15625 /* Check catch clauses, if any. Every time we find an error, we try
b9f7e36c
APB		 15626 to process the next catch clause. We process the catch clause before
15627 the try block so that when processing the try block we can check thrown
4dd4c751 15628 exceptions against the caught type list. */
b67d701b
PB		 15629 for (current = catch; current; current = TREE_CHAIN (current))
15630 {
15631 tree carg_decl, carg_type;
15632 tree sub_current, catch_block, catch_clause;
15633 int unreachable;
15634
b67d701b 15635 /* At this point, the structure of the catch clause is
6de9cd9a 15636 JAVA_CATCH_EXPR (catch node)
b67d701b
PB		 15637 BLOCK (with the decl of the parameter)
15638 COMPOUND_EXPR
7525cc04 15639 MODIFY_EXPR (assignment of the catch parameter)
b67d701b 15640 BLOCK (catch clause block)
a7d8d81f
PB		 15641 */
15642 catch_clause = TREE_OPERAND (current, 0);
b67d701b
PB		 15643 carg_decl = BLOCK_EXPR_DECLS (catch_clause);
15644 carg_type = TREE_TYPE (TREE_TYPE (carg_decl));
15645
15646 /* Catch clauses can't have more than one parameter declared,
15647 but it's already enforced by the grammar. Make sure that the
15648 only parameter of the clause statement in of class Throwable
15649 or a subclass of Throwable, but that was done earlier. The
15650 catch clause parameter type has also been resolved. */
e35b68b0 15651
b67d701b
PB		 15652 /* Just make sure that the catch clause parameter type inherits
15653 from java.lang.Throwable */
15654 if (!inherits_from_p (carg_type, throwable_type_node))
15655 {
15656 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (current);
15657 parse_error_context (wfl_operator,
781b0558 15658 "Can't catch class `%s'. Catch clause parameter type must be a subclass of class `java.lang.Throwable'",
0a2138e2 15659 lang_printable_name (carg_type, 0));
b67d701b
PB		 15660 error_found = 1;
15661 continue;
15662 }
e35b68b0 15663
b67d701b
PB		 15664 /* Partial check for unreachable catch statement: The catch
15665 clause is reachable iff is no earlier catch block A in
15666 the try statement such that the type of the catch
15667 clause's parameter is the same as or a subclass of the
15668 type of A's parameter */
15669 unreachable = 0;
15670 for (sub_current = catch;
15671 sub_current != current; sub_current = TREE_CHAIN (sub_current))
15672 {
15673 tree sub_catch_clause, decl;
a7d8d81f 15674 sub_catch_clause = TREE_OPERAND (sub_current, 0);
b67d701b
PB		 15675 decl = BLOCK_EXPR_DECLS (sub_catch_clause);
15676
15677 if (inherits_from_p (carg_type, TREE_TYPE (TREE_TYPE (decl))))
15678 {
15679 EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (current);
e35b68b0 15680 parse_error_context
781b0558
KG		 15681 (wfl_operator,
15682 "`catch' not reached because of the catch clause at line %d",
15683 EXPR_WFL_LINENO (sub_current));
b67d701b
PB		 15684 unreachable = error_found = 1;
15685 break;
15686 }
15687 }
b67d701b
PB		 15688 /* Complete the catch clause block */
15689 catch_block = java_complete_tree (TREE_OPERAND (current, 0));
15690 if (catch_block == error_mark_node)
15691 {
15692 error_found = 1;
15693 continue;
15694 }
15fdcfe9
PB		 15695 if (CAN_COMPLETE_NORMALLY (catch_block))
15696 CAN_COMPLETE_NORMALLY (node) = 1;
b67d701b 15697 TREE_OPERAND (current, 0) = catch_block;
15fdcfe9
PB		 15698
15699 if (unreachable)
15700 continue;
15701
15702 /* Things to do here: the exception must be thrown */
15703
15704 /* Link this type to the caught type list */
15705 caught_type_list = tree_cons (NULL_TREE, carg_type, caught_type_list);
b67d701b
PB		 15706 }
15707
b9f7e36c
APB		 15708 PUSH_EXCEPTIONS (caught_type_list);
15709 if ((try = java_complete_tree (try)) == error_mark_node)
15710 error_found = 1;
15fdcfe9
PB		 15711 if (CAN_COMPLETE_NORMALLY (try))
15712 CAN_COMPLETE_NORMALLY (node) = 1;
b9f7e36c
APB		 15713 POP_EXCEPTIONS ();
15714
b67d701b 15715 /* Verification ends here */
e35b68b0 15716 if (error_found)
b67d701b
PB		 15717 return error_mark_node;
15718
15719 TREE_OPERAND (node, 0) = try;
15720 TREE_OPERAND (node, 1) = catch;
b67d701b
PB		 15721 TREE_TYPE (node) = void_type_node;
15722 return node;
15723}
b9f7e36c
APB		 15724
15725/* 14.17 The synchronized Statement */
15726
15727static tree
0a2f0c54 15728patch_synchronized_statement (tree node, tree wfl_op1)
b9f7e36c 15729{
5a005d9e 15730 tree expr = java_complete_tree (TREE_OPERAND (node, 0));
b9f7e36c 15731 tree block = TREE_OPERAND (node, 1);
5a005d9e 15732
c7303e41 15733 tree tmp, enter, exit, expr_decl, assignment;
5a005d9e
PB		 15734
15735 if (expr == error_mark_node)
15736 {
15737 block = java_complete_tree (block);
15738 return expr;
15739 }
b9f7e36c 15740
c7303e41
APB		 15741 /* We might be trying to synchronize on a STRING_CST */
15742 if ((tmp = patch_string (expr)))
15743 expr = tmp;
15744
b9f7e36c 15745 /* The TYPE of expr must be a reference type */
5a005d9e 15746 if (!JREFERENCE_TYPE_P (TREE_TYPE (expr)))
b9f7e36c
APB		 15747 {
15748 SET_WFL_OPERATOR (wfl_operator, node, wfl_op1);
781b0558 15749 parse_error_context (wfl_operator, "Incompatible type for `synchronized'. Can't convert `%s' to `java.lang.Object'",
0a2138e2 15750 lang_printable_name (TREE_TYPE (expr), 0));
b9f7e36c
APB		 15751 return error_mark_node;
15752 }
15753
ce6e9147
APB		 15754 if (flag_emit_xref)
15755 {
15756 TREE_OPERAND (node, 0) = expr;
15757 TREE_OPERAND (node, 1) = java_complete_tree (block);
15758 CAN_COMPLETE_NORMALLY (node) = 1;
15759 return node;
15760 }
15761
b9f7e36c
APB		 15762 /* Generate a try-finally for the synchronized statement, except
15763 that the handler that catches all throw exception calls
15764 _Jv_MonitorExit and then rethrow the exception.
15765 The synchronized statement is then implemented as:
e35b68b0 15766 TRY
b9f7e36c
APB		 15767 {
15768 _Jv_MonitorEnter (expression)
15769 synchronized_block
15770 _Jv_MonitorExit (expression)
15771 }
15772 CATCH_ALL
15773 {
15774 e = _Jv_exception_info ();
15775 _Jv_MonitorExit (expression)
15776 Throw (e);
15777 } */
15778
5a005d9e
PB		 15779 expr_decl = build_decl (VAR_DECL, generate_name (), TREE_TYPE (expr));
15780 BUILD_MONITOR_ENTER (enter, expr_decl);
15781 BUILD_MONITOR_EXIT (exit, expr_decl);
15782 CAN_COMPLETE_NORMALLY (enter) = 1;
15783 CAN_COMPLETE_NORMALLY (exit) = 1;
dc6d7095 15784 assignment = build2 (MODIFY_EXPR, NULL_TREE, expr_decl, expr);
96847892 15785 TREE_SIDE_EFFECTS (assignment) = 1;
dc6d7095
RS		 15786 node = build2 (COMPOUND_EXPR, NULL_TREE,
15787 build2 (COMPOUND_EXPR, NULL_TREE, assignment, enter),
15788 build2 (TRY_FINALLY_EXPR, NULL_TREE, block, exit));
5a005d9e
PB		 15789 node = build_expr_block (node, expr_decl);
15790
15791 return java_complete_tree (node);
b9f7e36c
APB		 15792}
15793
15794/* 14.16 The throw Statement */
15795
15796static tree
0a2f0c54 15797patch_throw_statement (tree node, tree wfl_op1)
b9f7e36c
APB		 15798{
15799 tree expr = TREE_OPERAND (node, 0);
15800 tree type = TREE_TYPE (expr);
15801 int unchecked_ok = 0, tryblock_throws_ok = 0;
15802
15803 /* Thrown expression must be assignable to java.lang.Throwable */
15804 if (!try_reference_assignconv (throwable_type_node, expr))
15805 {
15806 SET_WFL_OPERATOR (wfl_operator, node, wfl_op1);
781b0558
KG		 15807 parse_error_context (wfl_operator,
15808 "Can't throw `%s'; it must be a subclass of class `java.lang.Throwable'",
0a2138e2 15809 lang_printable_name (type, 0));
b9f7e36c
APB		 15810 /* If the thrown expression was a reference, we further the
15811 compile-time check. */
15812 if (!JREFERENCE_TYPE_P (type))
15813 return error_mark_node;
15814 }
15815
15816 /* At least one of the following must be true */
15817
15818 /* The type of the throw expression is a not checked exception,
15819 i.e. is a unchecked expression. */
c877974e 15820 unchecked_ok = IS_UNCHECKED_EXCEPTION_P (TREE_TYPE (type));
b9f7e36c 15821
c2952b01 15822 SET_WFL_OPERATOR (wfl_operator, node, wfl_op1);
17126208 15823 /* An instance can't throw a checked exception unless that exception
a83f01f0 15824 is explicitly declared in the `throws' clause of each
c2952b01
APB		 15825 constructor. This doesn't apply to anonymous classes, since they
15826 don't have declared constructors. */
e35b68b0 15827 if (!unchecked_ok
17126208
APB		 15828 && DECL_INSTINIT_P (current_function_decl)
15829 && !ANONYMOUS_CLASS_P (current_class))
c2952b01
APB		 15830 {
15831 tree current;
e35b68b0 15832 for (current = TYPE_METHODS (current_class); current;
c2952b01 15833 current = TREE_CHAIN (current))
e35b68b0 15834 if (DECL_CONSTRUCTOR_P (current)
c2952b01
APB		 15835 && !check_thrown_exceptions_do (TREE_TYPE (expr)))
15836 {
e35b68b0 15837 parse_error_context (wfl_operator, "Checked exception `%s' can't be thrown in instance initializer (not all declared constructor are declaring it in their `throws' clause)",
c2952b01
APB		 15838 lang_printable_name (TREE_TYPE (expr), 0));
15839 return error_mark_node;
15840 }
15841 }
15842
b9f7e36c
APB		 15843 /* Throw is contained in a try statement and at least one catch
15844 clause can receive the thrown expression or the current method is
15845 declared to throw such an exception. Or, the throw statement is
15846 contained in a method or constructor declaration and the type of
15847 the Expression is assignable to at least one type listed in the
15848 throws clause the declaration. */
b9f7e36c 15849 if (!unchecked_ok)
f099f336 15850 tryblock_throws_ok = check_thrown_exceptions_do (TREE_TYPE (expr));
b9f7e36c
APB		 15851 if (!(unchecked_ok || tryblock_throws_ok))
15852 {
15853 /* If there is a surrounding try block that has no matching
15854 clatch clause, report it first. A surrounding try block exits
15855 only if there is something after the list of checked
15856 exception thrown by the current function (if any). */
15857 if (IN_TRY_BLOCK_P ())
781b0558 15858 parse_error_context (wfl_operator, "Checked exception `%s' can't be caught by any of the catch clause(s) of the surrounding `try' block",
0a2138e2 15859 lang_printable_name (type, 0));
b9f7e36c
APB		 15860 /* If we have no surrounding try statement and the method doesn't have
15861 any throws, report it now. FIXME */
f099f336
APB		 15862
15863 /* We report that the exception can't be throw from a try block
15864 in all circumstances but when the `throw' is inside a static
15865 block. */
e35b68b0 15866 else if (!EXCEPTIONS_P (currently_caught_type_list)
b9f7e36c 15867 && !tryblock_throws_ok)
f099f336 15868 {
c2952b01 15869 if (DECL_CLINIT_P (current_function_decl))
781b0558
KG		 15870 parse_error_context (wfl_operator,
15871 "Checked exception `%s' can't be thrown in initializer",
f099f336
APB		 15872 lang_printable_name (type, 0));
15873 else
781b0558 15874 parse_error_context (wfl_operator,
e35b68b0 15875 "Checked exception `%s' isn't thrown from a `try' block",
f099f336
APB		 15876 lang_printable_name (type, 0));
15877 }
b9f7e36c
APB		 15878 /* Otherwise, the current method doesn't have the appropriate
15879 throws declaration */
15880 else
e35b68b0 15881 parse_error_context (wfl_operator, "Checked exception `%s' doesn't match any of current method's `throws' declaration(s)",
0a2138e2 15882 lang_printable_name (type, 0));
b9f7e36c
APB		 15883 return error_mark_node;
15884 }
15885
ce6e9147 15886 if (! flag_emit_class_files && ! flag_emit_xref)
15fdcfe9 15887 BUILD_THROW (node, expr);
ce6e9147
APB		 15888
15889 /* If doing xrefs, keep the location where the `throw' was seen. */
15890 if (flag_emit_xref)
15891 EXPR_WFL_LINECOL (node) = EXPR_WFL_LINECOL (wfl_op1);
b9f7e36c
APB		 15892 return node;
15893}
15894
15895/* Check that exception said to be thrown by method DECL can be
90281aec
TT		 15896 effectively caught from where DECL is invoked. THIS_EXPR is the
15897 expression that computes `this' for the method call. */
b9f7e36c 15898static void
9ec819d4
PB		 15899check_thrown_exceptions (
15900#ifdef USE_MAPPED_LOCATION
15901 source_location location,
15902#else
15903
15904 int location,
15905#endif
15906 tree decl, tree this_expr)
b9f7e36c
APB		 15907{
15908 tree throws;
90281aec
TT		 15909 int is_array_call = 0;
15910
9bcdf735
JS		 15911 /* Skip check within generated methods, such as access$<n>. */
15912 if (OUTER_FIELD_ACCESS_IDENTIFIER_P (DECL_NAME (current_function_decl)))
15913 return;
15914
90281aec
TT		 15915 if (this_expr != NULL_TREE
15916 && TREE_CODE (TREE_TYPE (this_expr)) == POINTER_TYPE
15917 && TYPE_ARRAY_P (TREE_TYPE (TREE_TYPE (this_expr))))
15918 is_array_call = 1;
15919
15920 /* For all the unchecked exceptions thrown by DECL. */
e35b68b0
AD		 15921 for (throws = DECL_FUNCTION_THROWS (decl); throws;
15922 throws = TREE_CHAIN (throws))
0a2138e2 15923 if (!check_thrown_exceptions_do (TREE_VALUE (throws)))
b9f7e36c 15924 {
90281aec
TT		 15925 /* Suppress errors about cloning arrays. */
15926 if (is_array_call && DECL_NAME (decl) == get_identifier ("clone"))
3e78f871 15927 continue;
90281aec 15928
9ec819d4
PB		 15929#ifdef USE_MAPPED_LOCATION
15930 SET_EXPR_LOCATION (wfl_operator, location);
15931#else
b9f7e36c 15932 EXPR_WFL_LINECOL (wfl_operator) = location;
9ec819d4 15933#endif
c2952b01 15934 if (DECL_FINIT_P (current_function_decl))
7705e9db
APB		 15935 parse_error_context
15936 (wfl_operator, "Exception `%s' can't be thrown in initializer",
15937 lang_printable_name (TREE_VALUE (throws), 0));
e35b68b0 15938 else
7705e9db 15939 {
e35b68b0
AD		 15940 parse_error_context
15941 (wfl_operator, "Exception `%s' must be caught, or it must be declared in the `throws' clause of `%s'",
7705e9db 15942 lang_printable_name (TREE_VALUE (throws), 0),
c2952b01 15943 (DECL_INIT_P (current_function_decl) ?
7705e9db
APB		 15944 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (current_class))) :
15945 IDENTIFIER_POINTER (DECL_NAME (current_function_decl))));
15946 }
b9f7e36c
APB		 15947 }
15948}
15949
c877974e 15950/* Return 1 if checked EXCEPTION is caught at the current nesting level of
b9f7e36c
APB		 15951 try-catch blocks, OR is listed in the `throws' clause of the
15952 current method. */
15953
15954static int
0a2f0c54 15955check_thrown_exceptions_do (tree exception)
b9f7e36c
APB		 15956{
15957 tree list = currently_caught_type_list;
c877974e 15958 resolve_and_layout (exception, NULL_TREE);
b9f7e36c
APB		 15959 /* First, all the nested try-catch-finally at that stage. The
15960 last element contains `throws' clause exceptions, if any. */
c877974e
APB		 15961 if (IS_UNCHECKED_EXCEPTION_P (exception))
15962 return 1;
b9f7e36c
APB		 15963 while (list)
15964 {
15965 tree caught;
15966 for (caught = TREE_VALUE (list); caught; caught = TREE_CHAIN (caught))
15967 if (valid_ref_assignconv_cast_p (exception, TREE_VALUE (caught), 0))
15968 return 1;
15969 list = TREE_CHAIN (list);
15970 }
15971 return 0;
15972}
15973
15974static void
0a2f0c54 15975purge_unchecked_exceptions (tree mdecl)
b9f7e36c
APB		 15976{
15977 tree throws = DECL_FUNCTION_THROWS (mdecl);
15978 tree new = NULL_TREE;
15979
15980 while (throws)
15981 {
15982 tree next = TREE_CHAIN (throws);
c877974e 15983 if (!IS_UNCHECKED_EXCEPTION_P (TREE_VALUE (throws)))
b9f7e36c
APB		 15984 {
15985 TREE_CHAIN (throws) = new;
15986 new = throws;
15987 }
15988 throws = next;
15989 }
15990 /* List is inverted here, but it doesn't matter */
15991 DECL_FUNCTION_THROWS (mdecl) = new;
15992}
22eed1e6 15993
17126208 15994/* This function goes over all of CLASS_TYPE ctors and checks whether
df1c5346 15995 each of them features at least one unchecked exception in its
17126208
APB		 15996 `throws' clause. If it's the case, it returns `true', `false'
15997 otherwise. */
15998
15999static bool
0a2f0c54 16000ctors_unchecked_throws_clause_p (tree class_type)
17126208
APB		 16001{
16002 tree current;
16003
16004 for (current = TYPE_METHODS (class_type); current;
16005 current = TREE_CHAIN (current))
16006 {
16007 bool ctu = false; /* Ctor Throws Unchecked */
16008 if (DECL_CONSTRUCTOR_P (current))
16009 {
16010 tree throws;
16011 for (throws = DECL_FUNCTION_THROWS (current); throws && !ctu;
16012 throws = TREE_CHAIN (throws))
16013 if (inherits_from_p (TREE_VALUE (throws), exception_type_node))
16014 ctu = true;
16015 }
16016 /* We return false as we found one ctor that is unfit. */
16017 if (!ctu && DECL_CONSTRUCTOR_P (current))
16018 return false;
16019 }
16020 /* All ctors feature at least one unchecked exception in their
16021 `throws' clause. */
16022 return true;
16023}
16024
22eed1e6
APB		 16025/* 15.24 Conditional Operator ?: */
16026
16027static tree
0a2f0c54 16028patch_conditional_expr (tree node, tree wfl_cond, tree wfl_op1)
22eed1e6
APB		 16029{
16030 tree cond = TREE_OPERAND (node, 0);
16031 tree op1 = TREE_OPERAND (node, 1);
16032 tree op2 = TREE_OPERAND (node, 2);
22eed1e6 16033 tree resulting_type = NULL_TREE;
ac825856 16034 tree t1, t2, patched;
22eed1e6
APB		 16035 int error_found = 0;
16036
ac825856
APB		 16037 /* Operands of ?: might be StringBuffers crafted as a result of a
16038 string concatenation. Obtain a descent operand here. */
16039 if ((patched = patch_string (op1)))
16040 TREE_OPERAND (node, 1) = op1 = patched;
16041 if ((patched = patch_string (op2)))
16042 TREE_OPERAND (node, 2) = op2 = patched;
16043
16044 t1 = TREE_TYPE (op1);
16045 t2 = TREE_TYPE (op2);
16046
22eed1e6
APB		 16047 /* The first expression must be a boolean */
16048 if (TREE_TYPE (cond) != boolean_type_node)
16049 {
16050 SET_WFL_OPERATOR (wfl_operator, node, wfl_cond);
781b0558
KG		 16051 parse_error_context (wfl_operator,
16052 "Incompatible type for `?:'. Can't convert `%s' to `boolean'",
22eed1e6
APB		 16053 lang_printable_name (TREE_TYPE (cond), 0));
16054 error_found = 1;
16055 }
16056
16057 /* Second and third can be numeric, boolean (i.e. primitive),
16058 references or null. Anything else results in an error */
16059 if (!((JNUMERIC_TYPE_P (t1) && JNUMERIC_TYPE_P (t2))
e35b68b0 16060 || ((JREFERENCE_TYPE_P (t1) || op1 == null_pointer_node)
22eed1e6
APB		 16061 && (JREFERENCE_TYPE_P (t2) || op2 == null_pointer_node))
16062 || (t1 == boolean_type_node && t2 == boolean_type_node)))
16063 error_found = 1;
16064
16065 /* Determine the type of the conditional expression. Same types are
16066 easy to deal with */
16067 else if (t1 == t2)
16068 resulting_type = t1;
16069
16070 /* There are different rules for numeric types */
16071 else if (JNUMERIC_TYPE_P (t1))
16072 {
16073 /* if byte/short found, the resulting type is short */
16074 if ((t1 == byte_type_node && t2 == short_type_node)
16075 || (t1 == short_type_node && t2 == byte_type_node))
16076 resulting_type = short_type_node;
16077
16078 /* If t1 is a constant int and t2 is of type byte, short or char
16079 and t1's value fits in t2, then the resulting type is t2 */
16080 else if ((t1 == int_type_node && TREE_CONSTANT (TREE_OPERAND (node, 1)))
16081 && JBSC_TYPE_P (t2) && int_fits_type_p (TREE_OPERAND (node, 1), t2))
16082 resulting_type = t2;
16083
16084 /* If t2 is a constant int and t1 is of type byte, short or char
16085 and t2's value fits in t1, then the resulting type is t1 */
16086 else if ((t2 == int_type_node && TREE_CONSTANT (TREE_OPERAND (node, 2)))
16087 && JBSC_TYPE_P (t1) && int_fits_type_p (TREE_OPERAND (node, 2), t1))
16088 resulting_type = t1;
16089
16090 /* Otherwise, binary numeric promotion is applied and the
16091 resulting type is the promoted type of operand 1 and 2 */
e35b68b0
AD		 16092 else
16093 resulting_type = binary_numeric_promotion (t1, t2,
16094 &TREE_OPERAND (node, 1),
22eed1e6
APB		 16095 &TREE_OPERAND (node, 2));
16096 }
16097
16098 /* Cases of a reference and a null type */
16099 else if (JREFERENCE_TYPE_P (t1) && op2 == null_pointer_node)
16100 resulting_type = t1;
16101
16102 else if (JREFERENCE_TYPE_P (t2) && op1 == null_pointer_node)
16103 resulting_type = t2;
16104
16105 /* Last case: different reference types. If a type can be converted
16106 into the other one by assignment conversion, the latter
16107 determines the type of the expression */
16108 else if ((resulting_type = try_reference_assignconv (t1, op2)))
16109 resulting_type = promote_type (t1);
16110
16111 else if ((resulting_type = try_reference_assignconv (t2, op1)))
16112 resulting_type = promote_type (t2);
16113
16114 /* If we don't have any resulting type, we're in trouble */
16115 if (!resulting_type)
16116 {
c2e3db92 16117 char *t = xstrdup (lang_printable_name (t1, 0));
22eed1e6 16118 SET_WFL_OPERATOR (wfl_operator, node, wfl_op1);
781b0558
KG		 16119 parse_error_context (wfl_operator,
16120 "Incompatible type for `?:'. Can't convert `%s' to `%s'",
16121 t, lang_printable_name (t2, 0));
22eed1e6
APB		 16122 free (t);
16123 error_found = 1;
16124 }
16125
16126 if (error_found)
16127 {
16128 TREE_TYPE (node) = error_mark_node;
16129 return error_mark_node;
16130 }
16131
16132 TREE_TYPE (node) = resulting_type;
16133 TREE_SET_CODE (node, COND_EXPR);
15fdcfe9 16134 CAN_COMPLETE_NORMALLY (node) = 1;
22eed1e6
APB		 16135 return node;
16136}
ac825856 16137
3cc48399
PB		 16138/* Wrap EXPR with code to initialize DECL's class, if appropriate. */
16139
16140static tree
0a2f0c54 16141maybe_build_class_init_for_field (tree decl, tree expr)
3cc48399
PB		 16142{
16143 tree clas = DECL_CONTEXT (decl);
16144 if (flag_emit_class_files || flag_emit_xref)
16145 return expr;
16146
16147 if (TREE_CODE (decl) == VAR_DECL && FIELD_STATIC (decl)
16148 && FIELD_FINAL (decl))
16149 {
16150 tree init = DECL_INITIAL (decl);
16151 if (init != NULL_TREE)
16152 init = fold_constant_for_init (init, decl);
16153 if (init != NULL_TREE && CONSTANT_VALUE_P (init))
16154 return expr;
16155 }
16156
16157 return build_class_init (clas, expr);
16158}
16159
5b09b33e
PB		 16160/* Try to constant fold NODE.
16161 If NODE is not a constant expression, return NULL_EXPR.
16162 CONTEXT is a static final VAR_DECL whose initializer we are folding. */
16163
16164static tree
0a2f0c54 16165fold_constant_for_init (tree node, tree context)
5b09b33e
PB		 16166{
16167 tree op0, op1, val;
16168 enum tree_code code = TREE_CODE (node);
16169
5b09b33e
PB		 16170 switch (code)
16171 {
3cc48399 16172 case INTEGER_CST:
6e471ea7
PB		 16173 if (node == null_pointer_node)
16174 return NULL_TREE;
16175 case STRING_CST:
3cc48399
PB		 16176 case REAL_CST:
16177 return node;
16178
5b09b33e
PB		 16179 case PLUS_EXPR:
16180 case MINUS_EXPR:
bc3ca41b
PB		 16181 case MULT_EXPR:
16182 case TRUNC_MOD_EXPR:
16183 case RDIV_EXPR:
5b09b33e
PB		 16184 case LSHIFT_EXPR:
16185 case RSHIFT_EXPR:
16186 case URSHIFT_EXPR:
16187 case BIT_AND_EXPR:
16188 case BIT_XOR_EXPR:
16189 case BIT_IOR_EXPR:
5b09b33e
PB		 16190 case TRUTH_ANDIF_EXPR:
16191 case TRUTH_ORIF_EXPR:
e35b68b0 16192 case EQ_EXPR:
5b09b33e
PB		 16193 case NE_EXPR:
16194 case GT_EXPR:
16195 case GE_EXPR:
16196 case LT_EXPR:
16197 case LE_EXPR:
16198 op0 = TREE_OPERAND (node, 0);
16199 op1 = TREE_OPERAND (node, 1);
16200 val = fold_constant_for_init (op0, context);
16201 if (val == NULL_TREE || ! TREE_CONSTANT (val))
16202 return NULL_TREE;
16203 TREE_OPERAND (node, 0) = val;
16204 val = fold_constant_for_init (op1, context);
16205 if (val == NULL_TREE || ! TREE_CONSTANT (val))
16206 return NULL_TREE;
16207 TREE_OPERAND (node, 1) = val;
16208 return patch_binop (node, op0, op1);
16209
16210 case UNARY_PLUS_EXPR:
16211 case NEGATE_EXPR:
16212 case TRUTH_NOT_EXPR:
16213 case BIT_NOT_EXPR:
16214 case CONVERT_EXPR:
16215 op0 = TREE_OPERAND (node, 0);
16216 val = fold_constant_for_init (op0, context);
16217 if (val == NULL_TREE || ! TREE_CONSTANT (val))
16218 return NULL_TREE;
16219 TREE_OPERAND (node, 0) = val;
0adaa7e4
AH		 16220 val = patch_unaryop (node, op0);
16221 if (! TREE_CONSTANT (val))
16222 return NULL_TREE;
16223 return val;
16224
5b09b33e
PB		 16225 break;
16226
16227 case COND_EXPR:
16228 val = fold_constant_for_init (TREE_OPERAND (node, 0), context);
16229 if (val == NULL_TREE || ! TREE_CONSTANT (val))
16230 return NULL_TREE;
16231 TREE_OPERAND (node, 0) = val;
16232 val = fold_constant_for_init (TREE_OPERAND (node, 1), context);
16233 if (val == NULL_TREE || ! TREE_CONSTANT (val))
16234 return NULL_TREE;
16235 TREE_OPERAND (node, 1) = val;
16236 val = fold_constant_for_init (TREE_OPERAND (node, 2), context);
16237 if (val == NULL_TREE || ! TREE_CONSTANT (val))
16238 return NULL_TREE;
16239 TREE_OPERAND (node, 2) = val;
16240 return integer_zerop (TREE_OPERAND (node, 0)) ? TREE_OPERAND (node, 1)
16241 : TREE_OPERAND (node, 2);
16242
16243 case VAR_DECL:
8576f094
APB		 16244 case FIELD_DECL:
16245 if (! FIELD_FINAL (node)
5b09b33e
PB		 16246 || DECL_INITIAL (node) == NULL_TREE)
16247 return NULL_TREE;
16248 val = DECL_INITIAL (node);
16249 /* Guard against infinite recursion. */
16250 DECL_INITIAL (node) = NULL_TREE;
cd9643f7 16251 val = fold_constant_for_init (val, node);
6e471ea7
PB		 16252 if (val != NULL_TREE && TREE_CODE (val) != STRING_CST)
16253 val = try_builtin_assignconv (NULL_TREE, TREE_TYPE (node), val);
5b09b33e
PB		 16254 DECL_INITIAL (node) = val;
16255 return val;
16256
16257 case EXPR_WITH_FILE_LOCATION:
16258 /* Compare java_complete_tree and resolve_expression_name. */
16259 if (!EXPR_WFL_NODE (node) /* Or a PRIMARY flag ? */
16260 || TREE_CODE (EXPR_WFL_NODE (node)) == IDENTIFIER_NODE)
16261 {
16262 tree name = EXPR_WFL_NODE (node);
16263 tree decl;
16264 if (PRIMARY_P (node))
16265 return NULL_TREE;
16266 else if (! QUALIFIED_P (name))
16267 {
16268 decl = lookup_field_wrapper (DECL_CONTEXT (context), name);
e35b68b0 16269 if (decl == NULL_TREE
8576f094 16270 || (! FIELD_STATIC (decl) && ! FIELD_FINAL (decl)))
5b09b33e
PB		 16271 return NULL_TREE;
16272 return fold_constant_for_init (decl, decl);
16273 }
16274 else
16275 {
899deeca
BM		 16276 tree r = NULL_TREE;
16277 /* Install the proper context for the field resolution. */
653d5d95 16278 tree saved_current_class = current_class;
5b09b33e 16279 /* Wait until the USE_COMPONENT_REF re-write. FIXME. */
653d5d95 16280 current_class = DECL_CONTEXT (context);
5b09b33e 16281 qualify_ambiguous_name (node);
899deeca
BM		 16282 r = resolve_field_access (node, &decl, NULL);
16283 /* Restore prior context. */
653d5d95 16284 current_class = saved_current_class;
899deeca 16285 if (r != error_mark_node && decl != NULL_TREE)
5b09b33e 16286 return fold_constant_for_init (decl, decl);
5b09b33e
PB		 16287 return NULL_TREE;
16288 }
16289 }
16290 else
16291 {
16292 op0 = TREE_OPERAND (node, 0);
16293 val = fold_constant_for_init (op0, context);
16294 if (val == NULL_TREE || ! TREE_CONSTANT (val))
16295 return NULL_TREE;
16296 TREE_OPERAND (node, 0) = val;
16297 return val;
16298 }
16299
bc3ca41b
PB		 16300#ifdef USE_COMPONENT_REF
16301 case IDENTIFIER:
16302 case COMPONENT_REF:
16303 ?;
16304#endif
16305
5b09b33e
PB		 16306 default:
16307 return NULL_TREE;
16308 }
16309}
bc3ca41b
PB		 16310
16311#ifdef USE_COMPONENT_REF
16312/* Context is 'T' for TypeName, 'P' for PackageName,
16313 'M' for MethodName, 'E' for ExpressionName, and 'A' for AmbiguousName. */
16314
16315tree
0a2f0c54 16316resolve_simple_name (tree name, int context)
bc3ca41b
PB		 16317{
16318}
16319
16320tree
0a2f0c54 16321resolve_qualified_name (tree name, int context)
bc3ca41b
PB		 16322{
16323}
16324#endif
f15b9af9 16325
fea2d5da 16326void
0a2f0c54 16327init_src_parse (void)
fea2d5da 16328{
c8c21a8c
TT		 16329 /* Sanity check; we've been bit by this before. */
16330 if (ARRAY_SIZE (ctxp->modifier_ctx) != MODIFIER_TK - PUBLIC_TK)
16331 abort ();
fea2d5da 16332}
4009bb7d
APB		 16333
16334\f
16335
16336/* This section deals with the functions that are called when tables
16337 recording class initialization information are traversed. */
16338
16339/* Attach to PTR (a block) the declaration found in ENTRY. */
16340
e2500fed 16341static int
0a2f0c54 16342attach_init_test_initialization_flags (void **entry, void *ptr)
4009bb7d
APB		 16343{
16344 tree block = (tree)ptr;
e2500fed 16345 struct treetreehash_entry *ite = (struct treetreehash_entry *) *entry;
e35b68b0 16346
ce5bb293
AH		 16347 if (block != error_mark_node)
16348 {
16349 TREE_CHAIN (ite->value) = BLOCK_EXPR_DECLS (block);
16350 BLOCK_EXPR_DECLS (block) = ite->value;
16351 }
4009bb7d
APB		 16352 return true;
16353}
16354
7304c6cf
AH		 16355/* This function is called for each class that is known definitely
16356 initialized when a given static method was called. This function
4009bb7d
APB		 16357 augments a compound expression (INFO) storing all assignment to
16358 initialized static class flags if a flag already existed, otherwise
16359 a new one is created. */
16360
e2500fed 16361static int
0a2f0c54 16362emit_test_initialization (void **entry_p, void *info)
4009bb7d
APB		 16363{
16364 tree l = (tree) info;
16365 tree decl, init;
e2500fed
GK		 16366 tree key = (tree) *entry_p;
16367 tree *ite;
16368 htab_t cf_ht = DECL_FUNCTION_INIT_TEST_TABLE (current_function_decl);
4009bb7d
APB		 16369
16370 /* If we haven't found a flag and we're dealing with self registered
16371 with current_function_decl, then don't do anything. Self is
16372 always added as definitely initialized but this information is
16373 valid only if used outside the current function. */
e2500fed
GK		 16374 if (current_function_decl == TREE_PURPOSE (l)
16375 && java_treetreehash_find (cf_ht, key) == NULL)
5412ef6b 16376 return true;
e35b68b0 16377
e2500fed 16378 ite = java_treetreehash_new (cf_ht, key);
4009bb7d
APB		 16379
16380 /* If we don't have a variable, create one and install it. */
e2500fed 16381 if (*ite == NULL)
4009bb7d
APB		 16382 {
16383 tree block;
e35b68b0 16384
4009bb7d
APB		 16385 decl = build_decl (VAR_DECL, NULL_TREE, boolean_type_node);
16386 MAYBE_CREATE_VAR_LANG_DECL_SPECIFIC (decl);
16387 LOCAL_CLASS_INITIALIZATION_FLAG (decl) = 1;
16388 DECL_CONTEXT (decl) = current_function_decl;
16389 DECL_INITIAL (decl) = boolean_true_node;
916b57ce
JS		 16390 /* Don't emit any symbolic debugging info for this decl. */
16391 DECL_IGNORED_P (decl) = 1;
4009bb7d
APB		 16392
16393 /* The trick is to find the right context for it. */
16394 block = BLOCK_SUBBLOCKS (GET_CURRENT_BLOCK (current_function_decl));
16395 TREE_CHAIN (decl) = BLOCK_EXPR_DECLS (block);
16396 BLOCK_EXPR_DECLS (block) = decl;
e2500fed 16397 *ite = decl;
4009bb7d
APB		 16398 }
16399 else
e2500fed 16400 decl = *ite;
4009bb7d
APB		 16401
16402 /* Now simply augment the compound that holds all the assignments
16403 pertaining to this method invocation. */
dc6d7095 16404 init = build2 (MODIFY_EXPR, boolean_type_node, decl, boolean_true_node);
4009bb7d
APB		 16405 TREE_SIDE_EFFECTS (init) = 1;
16406 TREE_VALUE (l) = add_stmt_to_compound (TREE_VALUE (l), void_type_node, init);
16407 TREE_SIDE_EFFECTS (TREE_VALUE (l)) = 1;
16408
16409 return true;
16410}
e2500fed 16411
d5706a1e
ZW		 16412#ifdef __XGETTEXT__
16413/* Depending on the version of Bison used to compile this grammar,
16414 it may issue generic diagnostics spelled "syntax error" or
16415 "parse error". To prevent this from changing the translation
16416 template randomly, we list all the variants of this particular
16417 diagnostic here. Translators: there is no fine distinction
16418 between diagnostics with "syntax error" in them, and diagnostics
16419 with "parse error" in them. It's okay to give them both the same
16420 translation. */
16421const char d1[] = N_("syntax error");
16422const char d2[] = N_("parse error");
16423const char d3[] = N_("syntax error; also virtual memory exhausted");
16424const char d4[] = N_("parse error; also virtual memory exhausted");
16425const char d5[] = N_("syntax error: cannot back up");
16426const char d6[] = N_("parse error: cannot back up");
16427#endif
16428
e2500fed
GK		 16429#include "gt-java-parse.h"
16430#include "gtype-java.h"
GNU Compiler Collection
This page took 6.124516 seconds and 5 git commands to generate.