gcc/java/parse.y

   1 /* Source code parsing and tree node generation for the GNU compiler
   2    for the Java(TM) language.
   3    Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004
   4    Free Software Foundation, Inc.
   5    Contributed by Alexandre Petit-Bianco (apbianco@cygnus.com)
   6
   7 This file is part of GCC.
   8
   9 GCC is free software; you can redistribute it and/or modify
  10 it under the terms of the GNU General Public License as published by
  11 the Free Software Foundation; either version 2, or (at your option)
  12 any later version.
  13
  14 GCC is distributed in the hope that it will be useful,
  15 but WITHOUT ANY WARRANTY; without even the implied warranty of
  16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  17 GNU General Public License for more details.
  18
  19 You should have received a copy of the GNU General Public License
  20 along with GCC; see the file COPYING.  If not, write to
  21 the Free Software Foundation, 59 Temple Place - Suite 330,
  22 Boston, MA 02111-1307, USA.
  23
  24 Java and all Java-based marks are trademarks or registered trademarks
  25 of Sun Microsystems, Inc. in the United States and other countries.
  26 The Free Software Foundation is independent of Sun Microsystems, Inc.  */
  27
  28 /* This file parses java source code and issues a tree node image
  29 suitable for code generation (byte code and targeted CPU assembly
  30 language).
  31
  32 The grammar conforms to the Java grammar described in "The Java(TM)
  33 Language Specification. J. Gosling, B. Joy, G. Steele. Addison Wesley
  34 1996, ISBN 0-201-63451-1"
  35
  36 The following modifications were brought to the original grammar:
  37
  38 method_body: added the rule '| block SC_TK'
  39 static_initializer: added the rule 'static block SC_TK'.
  40
  41 Note: All the extra rules described above should go away when the
  42       empty_statement rule will work.
  43
  44 statement_nsi: 'nsi' should be read no_short_if.
  45
  46 Some rules have been modified to support JDK1.1 inner classes
  47 definitions and other extensions.  */
  48
  49 %{
  50 #include "config.h"
  51 #include "system.h"
  52 #include "coretypes.h"
  53 #include "tm.h"
  54 #include <dirent.h>
  55 #include "tree.h"
  56 #include "rtl.h"
  57 #include "real.h"
  58 #include "obstack.h"
  59 #include "toplev.h"
  60 #include "flags.h"
  61 #include "java-tree.h"
  62 #include "jcf.h"
  63 #include "lex.h"
  64 #include "parse.h"
  65 #include "zipfile.h"
  66 #include "convert.h"
  67 #include "buffer.h"
  68 #include "xref.h"
  69 #include "function.h"
  70 #include "except.h"
  71 #include "ggc.h"
  72 #include "debug.h"
  73 #include "tree-inline.h"
  74 #include "cgraph.h"
  75 #include "target.h"
  76
  77 /* Local function prototypes */
  78 static char *java_accstring_lookup (int);
  79 static const char *accessibility_string (int);
  80 static void  classitf_redefinition_error (const char *,tree, tree, tree);
  81 static void  variable_redefinition_error (tree, tree, tree, int);
  82 static tree  create_class (int, tree, tree, tree);
  83 static tree  create_interface (int, tree, tree);
  84 static void  end_class_declaration (int);
  85 static tree  find_field (tree, tree);
  86 static tree lookup_field_wrapper (tree, tree);
  87 static int   duplicate_declaration_error_p (tree, tree, tree);
  88 static void  register_fields (int, tree, tree);
  89 static tree parser_qualified_classname (tree);
  90 static int  parser_check_super (tree, tree, tree);
  91 static int  parser_check_super_interface (tree, tree, tree);
  92 static void check_modifiers_consistency (int);
  93 static tree lookup_cl (tree);
  94 static tree lookup_java_method2 (tree, tree, int);
  95 static tree method_header (int, tree, tree, tree);
  96 static void fix_method_argument_names (tree ,tree);
  97 static tree method_declarator (tree, tree);
  98 static void parse_warning_context (tree cl, const char *msg, ...)
  99   ATTRIBUTE_PRINTF_2;
 100 static void issue_warning_error_from_context (tree, const char *msg, va_list)
 101   ATTRIBUTE_PRINTF (2, 0);
 102 static void parse_ctor_invocation_error (void);
 103 static tree parse_jdk1_1_error (const char *);
 104 static void complete_class_report_errors (jdep *);
 105 static int process_imports (void);
 106 static void read_import_dir (tree);
 107 static int find_in_imports_on_demand (tree, tree);
 108 static void find_in_imports (tree, tree);
 109 static void check_inner_class_access (tree, tree, tree);
 110 static int check_pkg_class_access (tree, tree, bool, tree);
 111 static void register_package (tree);
 112 static tree resolve_package (tree, tree *, tree *);
 113 static tree resolve_class (tree, tree, tree, tree);
 114 static void declare_local_variables (int, tree, tree);
 115 static void dump_java_tree (enum tree_dump_index, tree);
 116 static void source_start_java_method (tree);
 117 static void source_end_java_method (void);
 118 static tree find_name_in_single_imports (tree);
 119 static void check_abstract_method_header (tree);
 120 static tree lookup_java_interface_method2 (tree, tree);
 121 static tree resolve_expression_name (tree, tree *);
 122 static tree maybe_create_class_interface_decl (tree, tree, tree, tree);
 123 static int check_class_interface_creation (int, int, tree, tree, tree, tree);
 124 static tree patch_method_invocation (tree, tree, tree, int, int *, tree *);
 125 static tree resolve_and_layout (tree, tree);
 126 static tree qualify_and_find (tree, tree, tree);
 127 static tree resolve_no_layout (tree, tree);
 128 static int invocation_mode (tree, int);
 129 static tree find_applicable_accessible_methods_list (int, tree, tree, tree);
 130 static void search_applicable_methods_list (int, tree, tree, tree, tree *, tree *);
 131 static tree find_most_specific_methods_list (tree);
 132 static int argument_types_convertible (tree, tree);
 133 static tree patch_invoke (tree, tree, tree);
 134 static int maybe_use_access_method (int, tree *, tree *);
 135 static tree lookup_method_invoke (int, tree, tree, tree, tree);
 136 static tree register_incomplete_type (int, tree, tree, tree);
 137 static tree check_inner_circular_reference (tree, tree);
 138 static tree check_circular_reference (tree);
 139 static tree obtain_incomplete_type (tree);
 140 static tree java_complete_lhs (tree);
 141 static tree java_complete_tree (tree);
 142 static tree maybe_generate_pre_expand_clinit (tree);
 143 static int analyze_clinit_body (tree, tree);
 144 static int maybe_yank_clinit (tree);
 145 static void start_complete_expand_method (tree);
 146 static void java_complete_expand_method (tree);
 147 static void java_expand_method_bodies (tree);
 148 static int  unresolved_type_p (tree, tree *);
 149 static void create_jdep_list (struct parser_ctxt *);
 150 static tree build_expr_block (tree, tree);
 151 static tree enter_block (void);
 152 static tree exit_block (void);
 153 static tree lookup_name_in_blocks (tree);
 154 static void maybe_absorb_scoping_blocks (void);
 155 static tree build_method_invocation (tree, tree);
 156 static tree build_new_invocation (tree, tree);
 157 static tree build_assignment (int, int, tree, tree);
 158 static tree build_binop (enum tree_code, int, tree, tree);
 159 static tree patch_assignment (tree, tree);
 160 static tree patch_binop (tree, tree, tree);
 161 static tree build_unaryop (int, int, tree);
 162 static tree build_incdec (int, int, tree, int);
 163 static tree patch_unaryop (tree, tree);
 164 static tree build_cast (int, tree, tree);
 165 static tree build_null_of_type (tree);
 166 static tree patch_cast (tree, tree);
 167 static int valid_ref_assignconv_cast_p (tree, tree, int);
 168 static int valid_builtin_assignconv_identity_widening_p (tree, tree);
 169 static int valid_cast_to_p (tree, tree);
 170 static int valid_method_invocation_conversion_p (tree, tree);
 171 static tree try_builtin_assignconv (tree, tree, tree);
 172 static tree try_reference_assignconv (tree, tree);
 173 static tree build_unresolved_array_type (tree);
 174 static int build_type_name_from_array_name (tree, tree *);
 175 static tree build_array_from_name (tree, tree, tree, tree *);
 176 static tree build_array_ref (int, tree, tree);
 177 static tree patch_array_ref (tree);
 178 static tree make_qualified_name (tree, tree, int);
 179 static tree merge_qualified_name (tree, tree);
 180 static tree make_qualified_primary (tree, tree, int);
 181 static int resolve_qualified_expression_name (tree, tree *, tree *, tree *);
 182 static void qualify_ambiguous_name (tree);
 183 static tree resolve_field_access (tree, tree *, tree *);
 184 static tree build_newarray_node (tree, tree, int);
 185 static tree patch_newarray (tree);
 186 static tree resolve_type_during_patch (tree);
 187 static tree build_this (int);
 188 static tree build_wfl_wrap (tree, int);
 189 static tree build_return (int, tree);
 190 static tree patch_return (tree);
 191 static tree maybe_access_field (tree, tree, tree);
 192 static int complete_function_arguments (tree);
 193 static int check_for_static_method_reference (tree, tree, tree, tree, tree);
 194 static int not_accessible_p (tree, tree, tree, int);
 195 static void check_deprecation (tree, tree);
 196 static int class_in_current_package (tree);
 197 static tree build_if_else_statement (int, tree, tree, tree);
 198 static tree patch_if_else_statement (tree);
 199 static tree add_stmt_to_block (tree, tree, tree);
 200 static tree patch_exit_expr (tree);
 201 static tree build_labeled_block (int, tree);
 202 static tree finish_labeled_statement (tree, tree);
 203 static tree build_bc_statement (int, int, tree);
 204 static tree patch_bc_statement (tree);
 205 static tree patch_loop_statement (tree);
 206 static tree build_new_loop (tree);
 207 static tree build_loop_body (int, tree, int);
 208 static tree finish_loop_body (int, tree, tree, int);
 209 static tree build_debugable_stmt (int, tree);
 210 static tree finish_for_loop (int, tree, tree, tree);
 211 static tree patch_switch_statement (tree);
 212 static tree string_constant_concatenation (tree, tree);
 213 static tree build_string_concatenation (tree, tree);
 214 static tree patch_string_cst (tree);
 215 static tree patch_string (tree);
 216 static tree encapsulate_with_try_catch (int, tree, tree, tree);
 217 static tree build_assertion (int, tree, tree);
 218 static tree build_try_statement (int, tree, tree);
 219 static tree build_try_finally_statement (int, tree, tree);
 220 static tree patch_try_statement (tree);
 221 static tree patch_synchronized_statement (tree, tree);
 222 static tree patch_throw_statement (tree, tree);
 223 static void check_thrown_exceptions (int, tree, tree);
 224 static int check_thrown_exceptions_do (tree);
 225 static void purge_unchecked_exceptions (tree);
 226 static bool ctors_unchecked_throws_clause_p (tree);
 227 static void check_concrete_throws_clauses (tree, tree, tree, tree);
 228 static void check_throws_clauses (tree, tree, tree);
 229 static void finish_method_declaration (tree);
 230 static tree build_super_invocation (tree);
 231 static int verify_constructor_circularity (tree, tree);
 232 static char *constructor_circularity_msg (tree, tree);
 233 static tree build_this_super_qualified_invocation (int, tree, tree, int, int);
 234 static const char *get_printable_method_name (tree);
 235 static tree patch_conditional_expr (tree, tree, tree);
 236 static tree generate_finit (tree);
 237 static tree generate_instinit (tree);
 238 static tree build_instinit_invocation (tree);
 239 static void fix_constructors (tree);
 240 static tree build_alias_initializer_parameter_list (int, tree, tree, int *);
 241 static tree craft_constructor (tree, tree);
 242 static int verify_constructor_super (tree);
 243 static tree create_artificial_method (tree, int, tree, tree, tree);
 244 static void start_artificial_method_body (tree);
 245 static void end_artificial_method_body (tree);
 246 static int check_method_redefinition (tree, tree);
 247 static int check_method_types_complete (tree);
 248 static bool hack_is_accessible_p (tree, tree);
 249 static void java_check_regular_methods (tree);
 250 static void check_interface_throws_clauses (tree, tree);
 251 static void java_check_abstract_methods (tree);
 252 static void unreachable_stmt_error (tree);
 253 static int not_accessible_field_error (tree, tree);
 254 static tree find_expr_with_wfl (tree);
 255 static void missing_return_error (tree);
 256 static tree build_new_array_init (int, tree);
 257 static tree patch_new_array_init (tree, tree);
 258 static tree maybe_build_array_element_wfl (tree);
 259 static int array_constructor_check_entry (tree, tree);
 260 static const char *purify_type_name (const char *);
 261 static tree fold_constant_for_init (tree, tree);
 262 static tree strip_out_static_field_access_decl (tree);
 263 static jdeplist *reverse_jdep_list (struct parser_ctxt *);
 264 static void static_ref_err (tree, tree, tree);
 265 static void parser_add_interface (tree, tree, tree);
 266 static void add_superinterfaces (tree, tree);
 267 static tree jdep_resolve_class (jdep *);
 268 static int note_possible_classname (const char *, int);
 269 static void java_complete_expand_classes (void);
 270 static void java_complete_expand_class (tree);
 271 static void java_complete_expand_methods (tree);
 272 static tree cut_identifier_in_qualified (tree);
 273 static tree java_stabilize_reference (tree);
 274 static tree do_unary_numeric_promotion (tree);
 275 static char * operator_string (tree);
 276 static tree do_merge_string_cste (tree, const char *, int, int);
 277 static tree merge_string_cste (tree, tree, int);
 278 static tree java_refold (tree);
 279 static int java_decl_equiv (tree, tree);
 280 static int binop_compound_p (enum tree_code);
 281 static tree search_loop (tree);
 282 static int labeled_block_contains_loop_p (tree, tree);
 283 static int check_abstract_method_definitions (int, tree, tree);
 284 static void java_check_abstract_method_definitions (tree);
 285 static void java_debug_context_do (int);
 286 static void java_parser_context_push_initialized_field (void);
 287 static void java_parser_context_pop_initialized_field (void);
 288 static tree reorder_static_initialized (tree);
 289 static void java_parser_context_suspend (void);
 290 static void java_parser_context_resume (void);
 291 static int pop_current_osb (struct parser_ctxt *);
 292
 293 /* JDK 1.1 work. FIXME */
 294
 295 static tree maybe_make_nested_class_name (tree);
 296 static int make_nested_class_name (tree);
 297 static void link_nested_class_to_enclosing (void);
 298 static tree resolve_inner_class (htab_t, tree, tree *, tree *, tree);
 299 static tree find_as_inner_class (tree, tree, tree);
 300 static tree find_as_inner_class_do (tree, tree);
 301 static int check_inner_class_redefinition (tree, tree);
 302
 303 static tree build_thisn_assign (void);
 304 static tree build_current_thisn (tree);
 305 static tree build_access_to_thisn (tree, tree, int);
 306 static tree maybe_build_thisn_access_method (tree);
 307
 308 static tree build_outer_field_access (tree, tree);
 309 static tree build_outer_field_access_methods (tree);
 310 static tree build_outer_field_access_expr (int, tree, tree,
 311                                                   tree, tree);
 312 static tree build_outer_method_access_method (tree);
 313 static tree build_new_access_id (void);
 314 static tree build_outer_field_access_method (tree, tree, tree,
 315                                                     tree, tree);
 316
 317 static int outer_field_access_p (tree, tree);
 318 static int outer_field_expanded_access_p (tree, tree *,
 319                                                  tree *, tree *);
 320 static tree outer_field_access_fix (tree, tree, tree);
 321 static tree build_incomplete_class_ref (int, tree);
 322 static tree patch_incomplete_class_ref (tree);
 323 static tree create_anonymous_class (int, tree);
 324 static void patch_anonymous_class (tree, tree, tree);
 325 static void add_inner_class_fields (tree, tree);
 326
 327 static tree build_dot_class_method (tree);
 328 static tree build_dot_class_method_invocation (tree, tree);
 329 static void create_new_parser_context (int);
 330 static tree maybe_build_class_init_for_field (tree, tree);
 331
 332 static int attach_init_test_initialization_flags (void **, void *);
 333 static int emit_test_initialization (void **, void *);
 334
 335 static char *string_convert_int_cst (tree);
 336
 337 /* Number of error found so far. */
 338 int java_error_count;
 339 /* Number of warning found so far. */
 340 int java_warning_count;
 341 /* Tell when not to fold, when doing xrefs */
 342 int do_not_fold;
 343 /* Cyclic inheritance report, as it can be set by layout_class */
 344 const char *cyclic_inheritance_report;
 345
 346 /* The current parser context */
 347 struct parser_ctxt *ctxp;
 348
 349 /* List of things that were analyzed for which code will be generated */
 350 struct parser_ctxt *ctxp_for_generation = NULL;
 351
 352 /* binop_lookup maps token to tree_code. It is used where binary
 353    operations are involved and required by the parser. RDIV_EXPR
 354    covers both integral/floating point division. The code is changed
 355    once the type of both operator is worked out.  */
 356
 357 static const enum tree_code binop_lookup[19] =
 358   {
 359     PLUS_EXPR, MINUS_EXPR, MULT_EXPR, RDIV_EXPR, TRUNC_MOD_EXPR,
 360     LSHIFT_EXPR, RSHIFT_EXPR, URSHIFT_EXPR,
 361     BIT_AND_EXPR, BIT_XOR_EXPR, BIT_IOR_EXPR,
 362     TRUTH_ANDIF_EXPR, TRUTH_ORIF_EXPR,
 363     EQ_EXPR, NE_EXPR, GT_EXPR, GE_EXPR, LT_EXPR, LE_EXPR,
 364    };
 365 #define BINOP_LOOKUP(VALUE)                                             \
 366   binop_lookup [((VALUE) - PLUS_TK) % ARRAY_SIZE (binop_lookup)]
 367
 368 /* This is the end index for binary operators that can also be used
 369    in compound assignments. */
 370 #define BINOP_COMPOUND_CANDIDATES 11
 371
 372 /* The "$L" identifier we use to create labels.  */
 373 static GTY(()) tree label_id;
 374
 375 /* The "StringBuffer" identifier used for the String `+' operator. */
 376 static GTY(()) tree wfl_string_buffer;
 377
 378 /* The "append" identifier used for String `+' operator.  */
 379 static GTY(()) tree wfl_append;
 380
 381 /* The "toString" identifier used for String `+' operator. */
 382 static GTY(()) tree wfl_to_string;
 383
 384 /* The "java.lang" import qualified name.  */
 385 static GTY(()) tree java_lang_id;
 386
 387 /* The generated `inst$' identifier used for generated enclosing
 388    instance/field access functions.  */
 389 static GTY(()) tree inst_id;
 390
 391 /* Context and flag for static blocks */
 392 static GTY(()) tree current_static_block;
 393
 394 /* The generated `write_parm_value$' identifier.  */
 395 static GTY(()) tree wpv_id;
 396
 397 /* The list of all packages we've seen so far */
 398 static GTY(()) tree package_list;
 399
 400 /* Hold THIS for the scope of the current method decl.  */
 401 static GTY(()) tree current_this;
 402
 403 /* Hold a list of catch clauses list. The first element of this list is
 404    the list of the catch clauses of the currently analyzed try block. */
 405 static GTY(()) tree currently_caught_type_list;
 406
 407 /* This holds a linked list of all the case labels for the current
 408    switch statement.  It is only used when checking to see if there
 409    are duplicate labels.  FIXME: probably this should just be attached
 410    to the switch itself; then it could be referenced via
 411    `ctxp->current_loop'.  */
 412 static GTY(()) tree case_label_list;
 413
 414 /* Anonymous class counter. Will be reset to 1 every time a non
 415    anonymous class gets created. */
 416 static int anonymous_class_counter = 1;
 417
 418 static GTY(()) tree src_parse_roots[1];
 419
 420 /* All classes seen from source code */
 421 #define gclass_list src_parse_roots[0]
 422
 423 /* Check modifiers. If one doesn't fit, retrieve it in its declaration
 424    line and point it out.  */
 425 /* Should point out the one that don't fit. ASCII/unicode, going
 426    backward. FIXME */
 427
 428 #define check_modifiers(__message, __value, __mask) do {        \
 429   if ((__value) & ~(__mask))                                    \
 430     {                                                           \
 431       size_t i, remainder = (__value) & ~(__mask);              \
 432       for (i = 0; i < ARRAY_SIZE (ctxp->modifier_ctx); i++)     \
 433         if ((1 << i) & remainder)                               \
 434           parse_error_context (ctxp->modifier_ctx [i], (__message), \
 435                                java_accstring_lookup (1 << i)); \
 436     }                                                           \
 437 } while (0)
 438
 439 %}
 440
 441 %union {
 442   tree node;
 443   int sub_token;
 444   struct {
 445     int token;
 446     int location;
 447   } operator;
 448   int value;
 449 }
 450
 451 %{
 452 #include "lex.c"
 453 %}
 454
 455 %pure_parser
 456
 457 /* Things defined here have to match the order of what's in the
 458    binop_lookup table.  */
 459
 460 %token   PLUS_TK         MINUS_TK        MULT_TK         DIV_TK    REM_TK
 461 %token   LS_TK           SRS_TK          ZRS_TK
 462 %token   AND_TK          XOR_TK          OR_TK
 463 %token   BOOL_AND_TK BOOL_OR_TK
 464 %token   EQ_TK NEQ_TK GT_TK GTE_TK LT_TK LTE_TK
 465
 466 /* This maps to the same binop_lookup entry than the token above */
 467
 468 %token   PLUS_ASSIGN_TK  MINUS_ASSIGN_TK MULT_ASSIGN_TK DIV_ASSIGN_TK
 469 %token   REM_ASSIGN_TK
 470 %token   LS_ASSIGN_TK    SRS_ASSIGN_TK   ZRS_ASSIGN_TK
 471 %token   AND_ASSIGN_TK   XOR_ASSIGN_TK   OR_ASSIGN_TK
 472
 473
 474 /* Modifier TOKEN have to be kept in this order. Don't scramble it */
 475
 476 %token   PUBLIC_TK       PRIVATE_TK         PROTECTED_TK
 477 %token   STATIC_TK       FINAL_TK           SYNCHRONIZED_TK
 478 %token   VOLATILE_TK     TRANSIENT_TK       NATIVE_TK
 479 %token   PAD_TK          ABSTRACT_TK        STRICT_TK
 480 %token   MODIFIER_TK
 481
 482 /* Keep those two in order, too */
 483 %token   DECR_TK INCR_TK
 484
 485 /* From now one, things can be in any order */
 486
 487 %token   DEFAULT_TK      IF_TK              THROW_TK
 488 %token   BOOLEAN_TK      DO_TK              IMPLEMENTS_TK
 489 %token   THROWS_TK       BREAK_TK           IMPORT_TK
 490 %token   ELSE_TK         INSTANCEOF_TK      RETURN_TK
 491 %token   VOID_TK         CATCH_TK           INTERFACE_TK
 492 %token   CASE_TK         EXTENDS_TK         FINALLY_TK
 493 %token   SUPER_TK        WHILE_TK           CLASS_TK
 494 %token   SWITCH_TK       CONST_TK           TRY_TK
 495 %token   FOR_TK          NEW_TK             CONTINUE_TK
 496 %token   GOTO_TK         PACKAGE_TK         THIS_TK
 497 %token   ASSERT_TK
 498
 499 %token   BYTE_TK         SHORT_TK           INT_TK            LONG_TK
 500 %token   CHAR_TK         INTEGRAL_TK
 501
 502 %token   FLOAT_TK        DOUBLE_TK          FP_TK
 503
 504 %token   ID_TK
 505
 506 %token   REL_QM_TK         REL_CL_TK NOT_TK  NEG_TK
 507
 508 %token   ASSIGN_ANY_TK   ASSIGN_TK
 509 %token   OP_TK  CP_TK  OCB_TK  CCB_TK  OSB_TK  CSB_TK  SC_TK  C_TK DOT_TK
 510
 511 %token   STRING_LIT_TK   CHAR_LIT_TK        INT_LIT_TK        FP_LIT_TK
 512 %token   TRUE_TK         FALSE_TK           BOOL_LIT_TK       NULL_TK
 513
 514 %type    <value>        modifiers MODIFIER_TK final synchronized
 515
 516 %type    <node>         super ID_TK identifier
 517 %type    <node>         name simple_name qualified_name
 518 %type    <node>         type_declaration compilation_unit
 519                         field_declaration method_declaration extends_interfaces
 520                         interfaces interface_type_list
 521                         import_declarations package_declaration
 522                         type_declarations interface_body
 523                         interface_member_declaration constant_declaration
 524                         interface_member_declarations interface_type
 525                         abstract_method_declaration
 526 %type    <node>         class_body_declaration class_member_declaration
 527                         static_initializer constructor_declaration block
 528 %type    <node>         class_body_declarations constructor_header
 529 %type    <node>         class_or_interface_type class_type class_type_list
 530                         constructor_declarator explicit_constructor_invocation
 531 %type    <node>         dim_expr dim_exprs this_or_super throws
 532
 533 %type    <node>         variable_declarator_id variable_declarator
 534                         variable_declarators variable_initializer
 535                         variable_initializers constructor_body
 536                         array_initializer
 537
 538 %type    <node>         class_body block_end constructor_block_end
 539 %type    <node>         statement statement_without_trailing_substatement
 540                         labeled_statement if_then_statement label_decl
 541                         if_then_else_statement while_statement for_statement
 542                         statement_nsi labeled_statement_nsi do_statement
 543                         if_then_else_statement_nsi while_statement_nsi
 544                         for_statement_nsi statement_expression_list for_init
 545                         for_update statement_expression expression_statement
 546                         primary_no_new_array expression primary
 547                         array_creation_expression array_type
 548                         class_instance_creation_expression field_access
 549                         method_invocation array_access something_dot_new
 550                         argument_list postfix_expression while_expression
 551                         post_increment_expression post_decrement_expression
 552                         unary_expression_not_plus_minus unary_expression
 553                         pre_increment_expression pre_decrement_expression
 554                         cast_expression
 555                         multiplicative_expression additive_expression
 556                         shift_expression relational_expression
 557                         equality_expression and_expression
 558                         exclusive_or_expression inclusive_or_expression
 559                         conditional_and_expression conditional_or_expression
 560                         conditional_expression assignment_expression
 561                         left_hand_side assignment for_header for_begin
 562                         constant_expression do_statement_begin empty_statement
 563                         switch_statement synchronized_statement throw_statement
 564                         try_statement assert_statement
 565                         switch_expression switch_block
 566                         catches catch_clause catch_clause_parameter finally
 567                         anonymous_class_creation trap_overflow_corner_case
 568 %type    <node>         return_statement break_statement continue_statement
 569
 570 %type    <operator>     ASSIGN_TK      MULT_ASSIGN_TK  DIV_ASSIGN_TK
 571 %type    <operator>     REM_ASSIGN_TK  PLUS_ASSIGN_TK  MINUS_ASSIGN_TK
 572 %type    <operator>     LS_ASSIGN_TK   SRS_ASSIGN_TK   ZRS_ASSIGN_TK
 573 %type    <operator>     AND_ASSIGN_TK  XOR_ASSIGN_TK   OR_ASSIGN_TK
 574 %type    <operator>     ASSIGN_ANY_TK  assignment_operator
 575 %token   <operator>     EQ_TK GTE_TK ZRS_TK SRS_TK GT_TK LTE_TK LS_TK
 576 %token   <operator>     BOOL_AND_TK AND_TK BOOL_OR_TK OR_TK INCR_TK PLUS_TK
 577 %token   <operator>     DECR_TK MINUS_TK MULT_TK DIV_TK XOR_TK REM_TK NEQ_TK
 578 %token   <operator>     NEG_TK REL_QM_TK REL_CL_TK NOT_TK LT_TK OCB_TK CCB_TK
 579 %token   <operator>     OP_TK OSB_TK DOT_TK THROW_TK INSTANCEOF_TK
 580 %type    <operator>     THIS_TK SUPER_TK RETURN_TK BREAK_TK CONTINUE_TK
 581 %type    <operator>     CASE_TK DEFAULT_TK TRY_TK CATCH_TK SYNCHRONIZED_TK
 582 %type    <operator>     NEW_TK ASSERT_TK
 583
 584 %type    <node>         method_body
 585
 586 %type    <node>         literal INT_LIT_TK FP_LIT_TK BOOL_LIT_TK CHAR_LIT_TK
 587                         STRING_LIT_TK NULL_TK VOID_TK
 588
 589 %type    <node>         IF_TK WHILE_TK FOR_TK
 590
 591 %type    <node>         formal_parameter_list formal_parameter
 592                         method_declarator method_header
 593
 594 %type    <node>         primitive_type reference_type type
 595                         BOOLEAN_TK INTEGRAL_TK FP_TK
 596
 597 /* Added or modified JDK 1.1 rule types  */
 598 %type    <node>         type_literals
 599
 600 %%
 601 /* 19.2 Production from 2.3: The Syntactic Grammar  */
 602 goal:  compilation_unit
 603                 {}
 604 ;
 605
 606 /* 19.3 Productions from 3: Lexical structure  */
 607 literal:
 608         INT_LIT_TK
 609 |       FP_LIT_TK
 610 |       BOOL_LIT_TK
 611 |       CHAR_LIT_TK
 612 |       STRING_LIT_TK
 613 |       NULL_TK
 614 ;
 615
 616 /* 19.4 Productions from 4: Types, Values and Variables  */
 617 type:
 618         primitive_type
 619 |       reference_type
 620 ;
 621
 622 primitive_type:
 623         INTEGRAL_TK
 624 |       FP_TK
 625 |       BOOLEAN_TK
 626 ;
 627
 628 reference_type:
 629         class_or_interface_type
 630 |       array_type
 631 ;
 632
 633 class_or_interface_type:
 634         name
 635 ;
 636
 637 class_type:
 638         class_or_interface_type /* Default rule */
 639 ;
 640
 641 interface_type:
 642          class_or_interface_type
 643 ;
 644
 645 array_type:
 646         primitive_type dims
 647                 {
 648                   int osb = pop_current_osb (ctxp);
 649                   tree t = build_java_array_type (($1), -1);
 650                   while (--osb)
 651                     t = build_unresolved_array_type (t);
 652                   $$ = t;
 653                 }
 654 |       name dims
 655                 {
 656                   int osb = pop_current_osb (ctxp);
 657                   tree t = $1;
 658                   while (osb--)
 659                     t = build_unresolved_array_type (t);
 660                   $$ = t;
 661                 }
 662 ;
 663
 664 /* 19.5 Productions from 6: Names  */
 665 name:
 666         simple_name             /* Default rule */
 667 |       qualified_name          /* Default rule */
 668 ;
 669
 670 simple_name:
 671         identifier              /* Default rule */
 672 ;
 673
 674 qualified_name:
 675         name DOT_TK identifier
 676                 { $$ = make_qualified_name ($1, $3, $2.location); }
 677 ;
 678
 679 identifier:
 680         ID_TK
 681 ;
 682
 683 /* 19.6: Production from 7: Packages  */
 684 compilation_unit:
 685                 {$$ = NULL;}
 686 |       package_declaration
 687 |       import_declarations
 688 |       type_declarations
 689 |       package_declaration import_declarations
 690 |       package_declaration type_declarations
 691 |       import_declarations type_declarations
 692 |       package_declaration import_declarations type_declarations
 693 ;
 694
 695 import_declarations:
 696         import_declaration
 697                 {
 698                   $$ = NULL;
 699                 }
 700 |       import_declarations import_declaration
 701                 {
 702                   $$ = NULL;
 703                 }
 704 ;
 705
 706 type_declarations:
 707         type_declaration
 708 |       type_declarations type_declaration
 709 ;
 710
 711 package_declaration:
 712         PACKAGE_TK name SC_TK
 713                 {
 714                   ctxp->package = EXPR_WFL_NODE ($2);
 715                   register_package (ctxp->package);
 716                 }
 717 |       PACKAGE_TK error
 718                 {yyerror ("Missing name"); RECOVER;}
 719 |       PACKAGE_TK name error
 720                 {yyerror ("';' expected"); RECOVER;}
 721 ;
 722
 723 import_declaration:
 724         single_type_import_declaration
 725 |       type_import_on_demand_declaration
 726 ;
 727
 728 single_type_import_declaration:
 729         IMPORT_TK name SC_TK
 730                 {
 731                   tree name = EXPR_WFL_NODE ($2), last_name;
 732                   int   i = IDENTIFIER_LENGTH (name)-1;
 733                   const char *last = &IDENTIFIER_POINTER (name)[i];
 734                   while (last != IDENTIFIER_POINTER (name))
 735                     {
 736                       if (last [0] == '.')
 737                         break;
 738                       last--;
 739                     }
 740                   last_name = get_identifier (++last);
 741                   if (IS_A_SINGLE_IMPORT_CLASSFILE_NAME_P (last_name))
 742                     {
 743                       tree err = find_name_in_single_imports (last_name);
 744                       if (err && err != name)
 745                         parse_error_context
 746                           ($2, "Ambiguous class: `%s' and `%s'",
 747                            IDENTIFIER_POINTER (name),
 748                            IDENTIFIER_POINTER (err));
 749                       else
 750                         REGISTER_IMPORT ($2, last_name);
 751                     }
 752                   else
 753                     REGISTER_IMPORT ($2, last_name);
 754                 }
 755 |       IMPORT_TK error
 756                 {yyerror ("Missing name"); RECOVER;}
 757 |       IMPORT_TK name error
 758                 {yyerror ("';' expected"); RECOVER;}
 759 ;
 760
 761 type_import_on_demand_declaration:
 762         IMPORT_TK name DOT_TK MULT_TK SC_TK
 763                 {
 764                   tree name = EXPR_WFL_NODE ($2);
 765                   tree it;
 766                   /* Search for duplicates. */
 767                   for (it = ctxp->import_demand_list; it; it = TREE_CHAIN (it))
 768                     if (EXPR_WFL_NODE (TREE_PURPOSE (it)) == name)
 769                       break;
 770                   /* Don't import the same thing more than once, just ignore
 771                      duplicates (7.5.2) */
 772                   if (! it)
 773                     {
 774                       read_import_dir ($2);
 775                       ctxp->import_demand_list =
 776                         chainon (ctxp->import_demand_list,
 777                                  build_tree_list ($2, NULL_TREE));
 778                     }
 779                 }
 780 |       IMPORT_TK name DOT_TK error
 781                 {yyerror ("'*' expected"); RECOVER;}
 782 |       IMPORT_TK name DOT_TK MULT_TK error
 783                 {yyerror ("';' expected"); RECOVER;}
 784 ;
 785
 786 type_declaration:
 787         class_declaration
 788                 { end_class_declaration (0); }
 789 |       interface_declaration
 790                 { end_class_declaration (0); }
 791 |       empty_statement
 792 |       error
 793                 {
 794                   YYERROR_NOW;
 795                   yyerror ("Class or interface declaration expected");
 796                 }
 797 ;
 798
 799 /* 19.7 Shortened from the original:
 800    modifiers: modifier | modifiers modifier
 801    modifier: any of public...  */
 802 modifiers:
 803         MODIFIER_TK
 804                 {
 805                   $$ = (1 << $1);
 806                 }
 807 |       modifiers MODIFIER_TK
 808                 {
 809                   int acc = (1 << $2);
 810                   if ($$ & acc)
 811                     parse_error_context
 812                       (ctxp->modifier_ctx [$2], "Modifier `%s' declared twice",
 813                        java_accstring_lookup (acc));
 814                   else
 815                     {
 816                       $$ |= acc;
 817                     }
 818                 }
 819 ;
 820
 821 /* 19.8.1 Production from $8.1: Class Declaration */
 822 class_declaration:
 823         modifiers CLASS_TK identifier super interfaces
 824                 { create_class ($1, $3, $4, $5); }
 825         class_body
 826                 {;}
 827 |       CLASS_TK identifier super interfaces
 828                 { create_class (0, $2, $3, $4); }
 829         class_body
 830                 {;}
 831 |       modifiers CLASS_TK error
 832                 { yyerror ("Missing class name"); RECOVER; }
 833 |       CLASS_TK error
 834                 { yyerror ("Missing class name"); RECOVER; }
 835 |       CLASS_TK identifier error
 836                 {
 837                   if (!ctxp->class_err) yyerror ("'{' expected");
 838                   DRECOVER(class1);
 839                 }
 840 |       modifiers CLASS_TK identifier error
 841                 { if (!ctxp->class_err) yyerror ("'{' expected"); RECOVER; }
 842 ;
 843
 844 super:
 845                 { $$ = NULL; }
 846 |       EXTENDS_TK class_type
 847                 { $$ = $2; }
 848 |       EXTENDS_TK class_type error
 849                 {yyerror ("'{' expected"); ctxp->class_err=1;}
 850 |       EXTENDS_TK error
 851                 {yyerror ("Missing super class name"); ctxp->class_err=1;}
 852 ;
 853
 854 interfaces:
 855                 { $$ = NULL_TREE; }
 856 |       IMPLEMENTS_TK interface_type_list
 857                 { $$ = $2; }
 858 |       IMPLEMENTS_TK error
 859                 {
 860                   ctxp->class_err=1;
 861                   yyerror ("Missing interface name");
 862                 }
 863 ;
 864
 865 interface_type_list:
 866         interface_type
 867                 {
 868                   ctxp->interface_number = 1;
 869                   $$ = build_tree_list ($1, NULL_TREE);
 870                 }
 871 |       interface_type_list C_TK interface_type
 872                 {
 873                   ctxp->interface_number++;
 874                   $$ = chainon ($1, build_tree_list ($3, NULL_TREE));
 875                 }
 876 |       interface_type_list C_TK error
 877                 {yyerror ("Missing interface name"); RECOVER;}
 878 ;
 879
 880 class_body:
 881         OCB_TK CCB_TK
 882                 {
 883                   /* Store the location of the `}' when doing xrefs */
 884                   if (flag_emit_xref)
 885                     DECL_END_SOURCE_LINE (GET_CPC ()) =
 886                       EXPR_WFL_ADD_COL ($2.location, 1);
 887                   $$ = GET_CPC ();
 888                 }
 889 |       OCB_TK class_body_declarations CCB_TK
 890                 {
 891                   /* Store the location of the `}' when doing xrefs */
 892                   if (flag_emit_xref)
 893                     DECL_END_SOURCE_LINE (GET_CPC ()) =
 894                       EXPR_WFL_ADD_COL ($3.location, 1);
 895                   $$ = GET_CPC ();
 896                 }
 897 ;
 898
 899 class_body_declarations:
 900         class_body_declaration
 901 |       class_body_declarations class_body_declaration
 902 ;
 903
 904 class_body_declaration:
 905         class_member_declaration
 906 |       static_initializer
 907 |       constructor_declaration
 908 |       block                   /* Added, JDK1.1, instance initializer */
 909                 {
 910                   if (!IS_EMPTY_STMT ($1))
 911                     {
 912                       TREE_CHAIN ($1) = CPC_INSTANCE_INITIALIZER_STMT (ctxp);
 913                       SET_CPC_INSTANCE_INITIALIZER_STMT (ctxp, $1);
 914                     }
 915                 }
 916 ;
 917
 918 class_member_declaration:
 919         field_declaration
 920 |       method_declaration
 921 |       class_declaration       /* Added, JDK1.1 inner classes */
 922                 { end_class_declaration (1); }
 923 |       interface_declaration   /* Added, JDK1.1 inner interfaces */
 924                 { end_class_declaration (1); }
 925 |       empty_statement
 926 ;
 927
 928 /* 19.8.2 Productions from 8.3: Field Declarations  */
 929 field_declaration:
 930         type variable_declarators SC_TK
 931                 { register_fields (0, $1, $2); }
 932 |       modifiers type variable_declarators SC_TK
 933                 {
 934                   check_modifiers
 935                     ("Illegal modifier `%s' for field declaration",
 936                      $1, FIELD_MODIFIERS);
 937                   check_modifiers_consistency ($1);
 938                   register_fields ($1, $2, $3);
 939                 }
 940 ;
 941
 942 variable_declarators:
 943         /* Should we use build_decl_list () instead ? FIXME */
 944         variable_declarator     /* Default rule */
 945 |       variable_declarators C_TK variable_declarator
 946                 { $$ = chainon ($1, $3); }
 947 |       variable_declarators C_TK error
 948                 {yyerror ("Missing term"); RECOVER;}
 949 ;
 950
 951 variable_declarator:
 952         variable_declarator_id
 953                 { $$ = build_tree_list ($1, NULL_TREE); }
 954 |       variable_declarator_id ASSIGN_TK variable_initializer
 955                 {
 956                   if (java_error_count)
 957                     $3 = NULL_TREE;
 958                   $$ = build_tree_list
 959                     ($1, build_assignment ($2.token, $2.location, $1, $3));
 960                 }
 961 |       variable_declarator_id ASSIGN_TK error
 962                 {
 963                   yyerror ("Missing variable initializer");
 964                   $$ = build_tree_list ($1, NULL_TREE);
 965                   RECOVER;
 966                 }
 967 |       variable_declarator_id ASSIGN_TK variable_initializer error
 968                 {
 969                   yyerror ("';' expected");
 970                   $$ = build_tree_list ($1, NULL_TREE);
 971                   RECOVER;
 972                 }
 973 ;
 974
 975 variable_declarator_id:
 976         identifier
 977 |       variable_declarator_id OSB_TK CSB_TK
 978                 { $$ = build_unresolved_array_type ($1); }
 979 |       identifier error
 980                 {yyerror ("Invalid declaration"); DRECOVER(vdi);}
 981 |       variable_declarator_id OSB_TK error
 982                 {
 983                   yyerror ("']' expected");
 984                   DRECOVER(vdi);
 985                 }
 986 |       variable_declarator_id CSB_TK error
 987                 {yyerror ("Unbalanced ']'"); DRECOVER(vdi);}
 988 ;
 989
 990 variable_initializer:
 991         expression
 992 |       array_initializer
 993 ;
 994
 995 /* 19.8.3 Productions from 8.4: Method Declarations  */
 996 method_declaration:
 997         method_header
 998                 {
 999                   current_function_decl = $1;
1000                   if (current_function_decl
1001                       && TREE_CODE (current_function_decl) == FUNCTION_DECL)
1002                     source_start_java_method (current_function_decl);
1003                   else
1004                     current_function_decl = NULL_TREE;
1005                 }
1006         method_body
1007                 { finish_method_declaration ($3); }
1008 |       method_header error
1009                 {YYNOT_TWICE yyerror ("'{' expected"); RECOVER;}
1010 ;
1011
1012 method_header:
1013         type method_declarator throws
1014                 { $$ = method_header (0, $1, $2, $3); }
1015 |       VOID_TK method_declarator throws
1016                 { $$ = method_header (0, void_type_node, $2, $3); }
1017 |       modifiers type method_declarator throws
1018                 { $$ = method_header ($1, $2, $3, $4); }
1019 |       modifiers VOID_TK method_declarator throws
1020                 { $$ = method_header ($1, void_type_node, $3, $4); }
1021 |       type error
1022                 {
1023                   yyerror ("Invalid method declaration, method name required");
1024                   RECOVER;
1025                 }
1026 |       modifiers type error
1027                 {
1028                   yyerror ("Identifier expected");
1029                   RECOVER;
1030                 }
1031 |       VOID_TK error
1032                 {
1033                   yyerror ("Identifier expected");
1034                   RECOVER;
1035                 }
1036 |       modifiers VOID_TK error
1037                 {
1038                   yyerror ("Identifier expected");
1039                   RECOVER;
1040                 }
1041 |       modifiers error
1042                 {
1043                   yyerror ("Invalid method declaration, return type required");
1044                   RECOVER;
1045                 }
1046 ;
1047
1048 method_declarator:
1049         identifier OP_TK CP_TK
1050                 {
1051                   ctxp->formal_parameter_number = 0;
1052                   $$ = method_declarator ($1, NULL_TREE);
1053                 }
1054 |       identifier OP_TK formal_parameter_list CP_TK
1055                 { $$ = method_declarator ($1, $3); }
1056 |       method_declarator OSB_TK CSB_TK
1057                 {
1058                   EXPR_WFL_LINECOL (wfl_operator) = $2.location;
1059                   TREE_PURPOSE ($1) =
1060                     build_unresolved_array_type (TREE_PURPOSE ($1));
1061                   parse_warning_context
1062                     (wfl_operator,
1063                      "Discouraged form of returned type specification");
1064                 }
1065 |       identifier OP_TK error
1066                 {yyerror ("')' expected"); DRECOVER(method_declarator);}
1067 |       method_declarator OSB_TK error
1068                 {yyerror ("']' expected"); RECOVER;}
1069 ;
1070
1071 formal_parameter_list:
1072         formal_parameter
1073                 {
1074                   ctxp->formal_parameter_number = 1;
1075                 }
1076 |       formal_parameter_list C_TK formal_parameter
1077                 {
1078                   ctxp->formal_parameter_number += 1;
1079                   $$ = chainon ($1, $3);
1080                 }
1081 |       formal_parameter_list C_TK error
1082                 { yyerror ("Missing formal parameter term"); RECOVER; }
1083 ;
1084
1085 formal_parameter:
1086         type variable_declarator_id
1087                 {
1088                   $$ = build_tree_list ($2, $1);
1089                 }
1090 |       final type variable_declarator_id /* Added, JDK1.1 final parms */
1091                 {
1092                   $$ = build_tree_list ($3, $2);
1093                   ARG_FINAL_P ($$) = 1;
1094                 }
1095 |       type error
1096                 {
1097                   yyerror ("Missing identifier"); RECOVER;
1098                   $$ = NULL_TREE;
1099                 }
1100 |       final type error
1101                 {
1102                   yyerror ("Missing identifier"); RECOVER;
1103                   $$ = NULL_TREE;
1104                 }
1105 ;
1106
1107 final:
1108         modifiers
1109                 {
1110                   check_modifiers ("Illegal modifier `%s'. Only `final' was expected here",
1111                                    $1, ACC_FINAL);
1112                   if ($1 != ACC_FINAL)
1113                     MODIFIER_WFL (FINAL_TK) = build_wfl_node (NULL_TREE);
1114                 }
1115 ;
1116
1117 throws:
1118                 { $$ = NULL_TREE; }
1119 |       THROWS_TK class_type_list
1120                 { $$ = $2; }
1121 |       THROWS_TK error
1122                 {yyerror ("Missing class type term"); RECOVER;}
1123 ;
1124
1125 class_type_list:
1126         class_type
1127                 { $$ = build_tree_list ($1, $1); }
1128 |       class_type_list C_TK class_type
1129                 { $$ = tree_cons ($3, $3, $1); }
1130 |       class_type_list C_TK error
1131                 {yyerror ("Missing class type term"); RECOVER;}
1132 ;
1133
1134 method_body:
1135         block
1136 |       SC_TK { $$ = NULL_TREE; }
1137 ;
1138
1139 /* 19.8.4 Productions from 8.5: Static Initializers  */
1140 static_initializer:
1141         static block
1142                 {
1143                   TREE_CHAIN ($2) = CPC_STATIC_INITIALIZER_STMT (ctxp);
1144                   SET_CPC_STATIC_INITIALIZER_STMT (ctxp, $2);
1145                   current_static_block = NULL_TREE;
1146                 }
1147 ;
1148
1149 static:                         /* Test lval.sub_token here */
1150         modifiers
1151                 {
1152                   check_modifiers ("Illegal modifier `%s' for static initializer", $1, ACC_STATIC);
1153                   /* Can't have a static initializer in an innerclass */
1154                   if ($1 | ACC_STATIC &&
1155                       GET_CPC_LIST () && !TOPLEVEL_CLASS_DECL_P (GET_CPC ()))
1156                     parse_error_context
1157                       (MODIFIER_WFL (STATIC_TK),
1158                        "Can't define static initializer in class `%s'. Static initializer can only be defined in top-level classes",
1159                        IDENTIFIER_POINTER (DECL_NAME (GET_CPC ())));
1160                   SOURCE_FRONTEND_DEBUG (("Modifiers: %d", $1));
1161                 }
1162 ;
1163
1164 /* 19.8.5 Productions from 8.6: Constructor Declarations  */
1165 constructor_declaration:
1166         constructor_header
1167                 {
1168                   current_function_decl = $1;
1169                   source_start_java_method (current_function_decl);
1170                 }
1171         constructor_body
1172                 { finish_method_declaration ($3); }
1173 ;
1174
1175 constructor_header:
1176         constructor_declarator throws
1177                 { $$ = method_header (0, NULL_TREE, $1, $2); }
1178 |       modifiers constructor_declarator throws
1179                 { $$ = method_header ($1, NULL_TREE, $2, $3); }
1180 ;
1181
1182 constructor_declarator:
1183         simple_name OP_TK CP_TK
1184                 {
1185                   ctxp->formal_parameter_number = 0;
1186                   $$ = method_declarator ($1, NULL_TREE);
1187                 }
1188 |       simple_name OP_TK formal_parameter_list CP_TK
1189                 { $$ = method_declarator ($1, $3); }
1190 ;
1191
1192 constructor_body:
1193         /* Unlike regular method, we always need a complete (empty)
1194            body so we can safely perform all the required code
1195            addition (super invocation and field initialization) */
1196         block_begin constructor_block_end
1197                 {
1198                   BLOCK_EXPR_BODY ($2) = build_java_empty_stmt ();
1199                   $$ = $2;
1200                 }
1201 |       block_begin explicit_constructor_invocation constructor_block_end
1202                 { $$ = $3; }
1203 |       block_begin block_statements constructor_block_end
1204                 { $$ = $3; }
1205 |       block_begin explicit_constructor_invocation block_statements constructor_block_end
1206                 { $$ = $4; }
1207 ;
1208
1209 constructor_block_end:
1210         block_end
1211 ;
1212
1213 /* Error recovery for that rule moved down expression_statement: rule.  */
1214 explicit_constructor_invocation:
1215         this_or_super OP_TK CP_TK SC_TK
1216                 {
1217                   $$ = build_method_invocation ($1, NULL_TREE);
1218                   $$ = build_debugable_stmt (EXPR_WFL_LINECOL ($1), $$);
1219                   $$ = java_method_add_stmt (current_function_decl, $$);
1220                 }
1221 |       this_or_super OP_TK argument_list CP_TK SC_TK
1222                 {
1223                   $$ = build_method_invocation ($1, $3);
1224                   $$ = build_debugable_stmt (EXPR_WFL_LINECOL ($1), $$);
1225                   $$ = java_method_add_stmt (current_function_decl, $$);
1226                 }
1227         /* Added, JDK1.1 inner classes. Modified because the rule
1228            'primary' couldn't work.  */
1229 |       name DOT_TK SUPER_TK OP_TK argument_list CP_TK SC_TK
1230                 {$$ = parse_jdk1_1_error ("explicit constructor invocation"); }
1231 |       name DOT_TK SUPER_TK OP_TK CP_TK SC_TK
1232                 {$$ = parse_jdk1_1_error ("explicit constructor invocation"); }
1233 ;
1234
1235 this_or_super:                  /* Added, simplifies error diagnostics */
1236         THIS_TK
1237                 {
1238                   tree wfl = build_wfl_node (this_identifier_node);
1239                   EXPR_WFL_LINECOL (wfl) = $1.location;
1240                   $$ = wfl;
1241                 }
1242 |       SUPER_TK
1243                 {
1244                   tree wfl = build_wfl_node (super_identifier_node);
1245                   EXPR_WFL_LINECOL (wfl) = $1.location;
1246                   $$ = wfl;
1247                 }
1248 ;
1249
1250 /* 19.9 Productions from 9: Interfaces  */
1251 /* 19.9.1 Productions from 9.1: Interfaces Declarations  */
1252 interface_declaration:
1253         INTERFACE_TK identifier
1254                 { create_interface (0, $2, NULL_TREE); }
1255         interface_body
1256                 { ; }
1257 |       modifiers INTERFACE_TK identifier
1258                 { create_interface ($1, $3, NULL_TREE); }
1259         interface_body
1260                 { ; }
1261 |       INTERFACE_TK identifier extends_interfaces
1262                 { create_interface (0, $2, $3); }
1263         interface_body
1264                 { ; }
1265 |       modifiers INTERFACE_TK identifier extends_interfaces
1266                 { create_interface ($1, $3, $4); }
1267         interface_body
1268                 { ; }
1269 |       INTERFACE_TK identifier error
1270                 { yyerror ("'{' expected"); RECOVER; }
1271 |       modifiers INTERFACE_TK identifier error
1272                 { yyerror ("'{' expected"); RECOVER; }
1273 ;
1274
1275 extends_interfaces:
1276         EXTENDS_TK interface_type
1277                 {
1278                   ctxp->interface_number = 1;
1279                   $$ = build_tree_list ($2, NULL_TREE);
1280                 }
1281 |       extends_interfaces C_TK interface_type
1282                 {
1283                   ctxp->interface_number++;
1284                   $$ = chainon ($1, build_tree_list ($3, NULL_TREE));
1285                 }
1286 |       EXTENDS_TK error
1287                 {yyerror ("Invalid interface type"); RECOVER;}
1288 |       extends_interfaces C_TK error
1289                 {yyerror ("Missing term"); RECOVER;}
1290 ;
1291
1292 interface_body:
1293         OCB_TK CCB_TK
1294                 { $$ = NULL_TREE; }
1295 |       OCB_TK interface_member_declarations CCB_TK
1296                 { $$ = NULL_TREE; }
1297 ;
1298
1299 interface_member_declarations:
1300         interface_member_declaration
1301 |       interface_member_declarations interface_member_declaration
1302 ;
1303
1304 interface_member_declaration:
1305         constant_declaration
1306 |       abstract_method_declaration
1307 |       class_declaration       /* Added, JDK1.1 inner classes */
1308                 { end_class_declaration (1); }
1309 |       interface_declaration   /* Added, JDK1.1 inner interfaces */
1310                 { end_class_declaration (1); }
1311 ;
1312
1313 constant_declaration:
1314         field_declaration
1315 ;
1316
1317 abstract_method_declaration:
1318         method_header SC_TK
1319                 {
1320                   check_abstract_method_header ($1);
1321                   current_function_decl = NULL_TREE; /* FIXME ? */
1322                 }
1323 |       method_header error
1324                 {yyerror ("';' expected"); RECOVER;}
1325 ;
1326
1327 /* 19.10 Productions from 10: Arrays  */
1328 array_initializer:
1329         OCB_TK CCB_TK
1330                 { $$ = build_new_array_init ($1.location, NULL_TREE); }
1331 |       OCB_TK C_TK CCB_TK
1332                 { $$ = build_new_array_init ($1.location, NULL_TREE); }
1333 |       OCB_TK variable_initializers CCB_TK
1334                 { $$ = build_new_array_init ($1.location, $2); }
1335 |       OCB_TK variable_initializers C_TK CCB_TK
1336                 { $$ = build_new_array_init ($1.location, $2); }
1337 ;
1338
1339 variable_initializers:
1340         variable_initializer
1341                 {
1342                   $$ = tree_cons (maybe_build_array_element_wfl ($1),
1343                                   $1, NULL_TREE);
1344                 }
1345 |       variable_initializers C_TK variable_initializer
1346                 {
1347                   $$ = tree_cons (maybe_build_array_element_wfl ($3), $3, $1);
1348                 }
1349 |       variable_initializers C_TK error
1350                 {yyerror ("Missing term"); RECOVER;}
1351 ;
1352
1353 /* 19.11 Production from 14: Blocks and Statements  */
1354 block:
1355         block_begin block_end
1356                 { $$ = $2; }
1357 |       block_begin block_statements block_end
1358                 { $$ = $3; }
1359 ;
1360
1361 block_begin:
1362         OCB_TK
1363                 { enter_block (); }
1364 ;
1365
1366 block_end:
1367         CCB_TK
1368                 {
1369                   maybe_absorb_scoping_blocks ();
1370                   /* Store the location of the `}' when doing xrefs */
1371                   if (current_function_decl && flag_emit_xref)
1372                     DECL_END_SOURCE_LINE (current_function_decl) =
1373                       EXPR_WFL_ADD_COL ($1.location, 1);
1374                   $$ = exit_block ();
1375                   if (!BLOCK_SUBBLOCKS ($$))
1376                     BLOCK_SUBBLOCKS ($$) = build_java_empty_stmt ();
1377                 }
1378 ;
1379
1380 block_statements:
1381         block_statement
1382 |       block_statements block_statement
1383 ;
1384
1385 block_statement:
1386         local_variable_declaration_statement
1387 |       statement
1388                 { java_method_add_stmt (current_function_decl, $1); }
1389 |       class_declaration       /* Added, JDK1.1 local classes */
1390                 {
1391                   LOCAL_CLASS_P (TREE_TYPE (GET_CPC ())) = 1;
1392                   end_class_declaration (1);
1393                 }
1394 ;
1395
1396 local_variable_declaration_statement:
1397         local_variable_declaration SC_TK /* Can't catch missing ';' here */
1398 ;
1399
1400 local_variable_declaration:
1401         type variable_declarators
1402                 { declare_local_variables (0, $1, $2); }
1403 |       final type variable_declarators /* Added, JDK1.1 final locals */
1404                 { declare_local_variables ($1, $2, $3); }
1405 ;
1406
1407 statement:
1408         statement_without_trailing_substatement
1409 |       labeled_statement
1410 |       if_then_statement
1411 |       if_then_else_statement
1412 |       while_statement
1413 |       for_statement
1414                 { $$ = exit_block (); }
1415 ;
1416
1417 statement_nsi:
1418         statement_without_trailing_substatement
1419 |       labeled_statement_nsi
1420 |       if_then_else_statement_nsi
1421 |       while_statement_nsi
1422 |       for_statement_nsi
1423                 { $$ = exit_block (); }
1424 ;
1425
1426 statement_without_trailing_substatement:
1427         block
1428 |       empty_statement
1429 |       expression_statement
1430 |       switch_statement
1431 |       do_statement
1432 |       break_statement
1433 |       continue_statement
1434 |       return_statement
1435 |       synchronized_statement
1436 |       throw_statement
1437 |       try_statement
1438 |       assert_statement
1439 ;
1440
1441 empty_statement:
1442         SC_TK
1443                 {
1444                   if (flag_extraneous_semicolon
1445                       && ! current_static_block
1446                       && (! current_function_decl ||
1447                           /* Verify we're not in a inner class declaration */
1448                           (GET_CPC () != TYPE_NAME
1449                            (DECL_CONTEXT (current_function_decl)))))
1450
1451                     {
1452                       EXPR_WFL_SET_LINECOL (wfl_operator, input_line, -1);
1453                       parse_warning_context (wfl_operator, "An empty declaration is a deprecated feature that should not be used");
1454                     }
1455                   $$ = build_java_empty_stmt ();
1456                 }
1457 ;
1458
1459 label_decl:
1460         identifier REL_CL_TK
1461                 {
1462                   $$ = build_labeled_block (EXPR_WFL_LINECOL ($1),
1463                                             EXPR_WFL_NODE ($1));
1464                   pushlevel (2);
1465                   push_labeled_block ($$);
1466                   PUSH_LABELED_BLOCK ($$);
1467                 }
1468 ;
1469
1470 labeled_statement:
1471         label_decl statement
1472                 { $$ = finish_labeled_statement ($1, $2); }
1473 |       identifier error
1474                 {yyerror ("':' expected"); RECOVER;}
1475 ;
1476
1477 labeled_statement_nsi:
1478         label_decl statement_nsi
1479                 { $$ = finish_labeled_statement ($1, $2); }
1480 ;
1481
1482 /* We concentrate here a bunch of error handling rules that we couldn't write
1483    earlier, because expression_statement catches a missing ';'.  */
1484 expression_statement:
1485         statement_expression SC_TK
1486                 {
1487                   /* We have a statement. Generate a WFL around it so
1488                      we can debug it */
1489                   $$ = build_expr_wfl ($1, input_filename, input_line, 0);
1490                   /* We know we have a statement, so set the debug
1491                      info to be eventually generate here. */
1492                   $$ = JAVA_MAYBE_GENERATE_DEBUG_INFO ($$);
1493                 }
1494 |       error SC_TK
1495                 {
1496                   YYNOT_TWICE yyerror ("Invalid expression statement");
1497                   DRECOVER (expr_stmt);
1498                 }
1499 |       error OCB_TK
1500                 {
1501                   YYNOT_TWICE yyerror ("Invalid expression statement");
1502                   DRECOVER (expr_stmt);
1503                 }
1504 |       error CCB_TK
1505                 {
1506                   YYNOT_TWICE yyerror ("Invalid expression statement");
1507                   DRECOVER (expr_stmt);
1508                 }
1509 |       this_or_super OP_TK error
1510                 {yyerror ("')' expected"); RECOVER;}
1511 |       this_or_super OP_TK CP_TK error
1512                 {
1513                   parse_ctor_invocation_error ();
1514                   RECOVER;
1515                 }
1516 |       this_or_super OP_TK argument_list error
1517                 {yyerror ("')' expected"); RECOVER;}
1518 |       this_or_super OP_TK argument_list CP_TK error
1519                 {
1520                   parse_ctor_invocation_error ();
1521                   RECOVER;
1522                 }
1523 |       name DOT_TK SUPER_TK error
1524                 {yyerror ("'(' expected"); RECOVER;}
1525 |       name DOT_TK SUPER_TK OP_TK error
1526                 {yyerror ("')' expected"); RECOVER;}
1527 |       name DOT_TK SUPER_TK OP_TK argument_list error
1528                 {yyerror ("')' expected"); RECOVER;}
1529 |       name DOT_TK SUPER_TK OP_TK argument_list CP_TK error
1530                 {yyerror ("';' expected"); RECOVER;}
1531 |       name DOT_TK SUPER_TK OP_TK CP_TK error
1532                 {yyerror ("';' expected"); RECOVER;}
1533 ;
1534
1535 statement_expression:
1536         assignment
1537 |       pre_increment_expression
1538 |       pre_decrement_expression
1539 |       post_increment_expression
1540 |       post_decrement_expression
1541 |       method_invocation
1542 |       class_instance_creation_expression
1543 ;
1544
1545 if_then_statement:
1546         IF_TK OP_TK expression CP_TK statement
1547                 {
1548                   $$ = build_if_else_statement ($2.location, $3,
1549                                                 $5, NULL_TREE);
1550                 }
1551 |       IF_TK error
1552                 {yyerror ("'(' expected"); RECOVER;}
1553 |       IF_TK OP_TK error
1554                 {yyerror ("Missing term"); RECOVER;}
1555 |       IF_TK OP_TK expression error
1556                 {yyerror ("')' expected"); RECOVER;}
1557 ;
1558
1559 if_then_else_statement:
1560         IF_TK OP_TK expression CP_TK statement_nsi ELSE_TK statement
1561                 { $$ = build_if_else_statement ($2.location, $3, $5, $7); }
1562 ;
1563
1564 if_then_else_statement_nsi:
1565         IF_TK OP_TK expression CP_TK statement_nsi ELSE_TK statement_nsi
1566                 { $$ = build_if_else_statement ($2.location, $3, $5, $7); }
1567 ;
1568
1569 switch_statement:
1570         switch_expression
1571                 {
1572                   enter_block ();
1573                 }
1574         switch_block
1575                 {
1576                   /* Make into "proper list" of COMPOUND_EXPRs.
1577                      I.e. make the last statement also have its own
1578                      COMPOUND_EXPR. */
1579                   maybe_absorb_scoping_blocks ();
1580                   TREE_OPERAND ($1, 1) = exit_block ();
1581                   $$ = build_debugable_stmt (EXPR_WFL_LINECOL ($1), $1);
1582                 }
1583 ;
1584
1585 switch_expression:
1586         SWITCH_TK OP_TK expression CP_TK
1587                 {
1588                   $$ = build (SWITCH_EXPR, NULL_TREE, $3, NULL_TREE, NULL_TREE);
1589                   EXPR_WFL_LINECOL ($$) = $2.location;
1590                 }
1591 |       SWITCH_TK error
1592                 {yyerror ("'(' expected"); RECOVER;}
1593 |       SWITCH_TK OP_TK error
1594                 {yyerror ("Missing term or ')'"); DRECOVER(switch_statement);}
1595 |       SWITCH_TK OP_TK expression CP_TK error
1596                 {yyerror ("'{' expected"); RECOVER;}
1597 ;
1598
1599 /* Default assignment is there to avoid type node on switch_block
1600    node. */
1601
1602 switch_block:
1603         OCB_TK CCB_TK
1604                 { $$ = NULL_TREE; }
1605 |       OCB_TK switch_labels CCB_TK
1606                 { $$ = NULL_TREE; }
1607 |       OCB_TK switch_block_statement_groups CCB_TK
1608                 { $$ = NULL_TREE; }
1609 |       OCB_TK switch_block_statement_groups switch_labels CCB_TK
1610                 { $$ = NULL_TREE; }
1611 ;
1612
1613 switch_block_statement_groups:
1614         switch_block_statement_group
1615 |       switch_block_statement_groups switch_block_statement_group
1616 ;
1617
1618 switch_block_statement_group:
1619         switch_labels block_statements
1620 ;
1621
1622 switch_labels:
1623         switch_label
1624 |       switch_labels switch_label
1625 ;
1626
1627 switch_label:
1628         CASE_TK constant_expression REL_CL_TK
1629                 {
1630                   tree lab = build1 (CASE_EXPR, NULL_TREE, $2);
1631                   EXPR_WFL_LINECOL (lab) = $1.location;
1632                   java_method_add_stmt (current_function_decl, lab);
1633                 }
1634 |       DEFAULT_TK REL_CL_TK
1635                 {
1636                   tree lab = make_node (DEFAULT_EXPR);
1637                   EXPR_WFL_LINECOL (lab) = $1.location;
1638                   java_method_add_stmt (current_function_decl, lab);
1639                 }
1640 |       CASE_TK error
1641                 {yyerror ("Missing or invalid constant expression"); RECOVER;}
1642 |       CASE_TK constant_expression error
1643                 {yyerror ("':' expected"); RECOVER;}
1644 |       DEFAULT_TK error
1645                 {yyerror ("':' expected"); RECOVER;}
1646 ;
1647
1648 while_expression:
1649         WHILE_TK OP_TK expression CP_TK
1650                 {
1651                   tree body = build_loop_body ($2.location, $3, 0);
1652                   $$ = build_new_loop (body);
1653                 }
1654 ;
1655
1656 while_statement:
1657         while_expression statement
1658                 { $$ = finish_loop_body (0, NULL_TREE, $2, 0); }
1659 |       WHILE_TK error
1660                 {YYERROR_NOW; yyerror ("'(' expected"); RECOVER;}
1661 |       WHILE_TK OP_TK error
1662                 {yyerror ("Missing term and ')' expected"); RECOVER;}
1663 |       WHILE_TK OP_TK expression error
1664                 {yyerror ("')' expected"); RECOVER;}
1665 ;
1666
1667 while_statement_nsi:
1668         while_expression statement_nsi
1669                 { $$ = finish_loop_body (0, NULL_TREE, $2, 0); }
1670 ;
1671
1672 do_statement_begin:
1673         DO_TK
1674                 {
1675                   tree body = build_loop_body (0, NULL_TREE, 1);
1676                   $$ = build_new_loop (body);
1677                 }
1678         /* Need error handing here. FIXME */
1679 ;
1680
1681 do_statement:
1682         do_statement_begin statement WHILE_TK OP_TK expression CP_TK SC_TK
1683                 { $$ = finish_loop_body ($4.location, $5, $2, 1); }
1684 ;
1685
1686 for_statement:
1687         for_begin SC_TK expression SC_TK for_update CP_TK statement
1688                 {
1689                   if (TREE_CODE_CLASS (TREE_CODE ($3)) == 'c')
1690                     $3 = build_wfl_node ($3);
1691                   $$ = finish_for_loop (EXPR_WFL_LINECOL ($3), $3, $5, $7);
1692                 }
1693 |       for_begin SC_TK SC_TK for_update CP_TK statement
1694                 {
1695                   $$ = finish_for_loop (0, NULL_TREE, $4, $6);
1696                   /* We have not condition, so we get rid of the EXIT_EXPR */
1697                   LOOP_EXPR_BODY_CONDITION_EXPR (LOOP_EXPR_BODY ($$), 0) =
1698                     build_java_empty_stmt ();
1699                 }
1700 |       for_begin SC_TK error
1701                 {yyerror ("Invalid control expression"); RECOVER;}
1702 |       for_begin SC_TK expression SC_TK error
1703                 {yyerror ("Invalid update expression"); RECOVER;}
1704 |       for_begin SC_TK SC_TK error
1705                 {yyerror ("Invalid update expression"); RECOVER;}
1706 ;
1707
1708 for_statement_nsi:
1709         for_begin SC_TK expression SC_TK for_update CP_TK statement_nsi
1710                 { $$ = finish_for_loop (EXPR_WFL_LINECOL ($3), $3, $5, $7);}
1711 |       for_begin SC_TK SC_TK for_update CP_TK statement_nsi
1712                 {
1713                   $$ = finish_for_loop (0, NULL_TREE, $4, $6);
1714                   /* We have not condition, so we get rid of the EXIT_EXPR */
1715                   LOOP_EXPR_BODY_CONDITION_EXPR (LOOP_EXPR_BODY ($$), 0) =
1716                     build_java_empty_stmt ();
1717                 }
1718 ;
1719
1720 for_header:
1721         FOR_TK OP_TK
1722                 {
1723                   /* This scope defined for local variable that may be
1724                      defined within the scope of the for loop */
1725                   enter_block ();
1726                 }
1727 |       FOR_TK error
1728                 {yyerror ("'(' expected"); DRECOVER(for_1);}
1729 |       FOR_TK OP_TK error
1730                 {yyerror ("Invalid init statement"); RECOVER;}
1731 ;
1732
1733 for_begin:
1734         for_header for_init
1735                 {
1736                   /* We now declare the loop body. The loop is
1737                      declared as a for loop. */
1738                   tree body = build_loop_body (0, NULL_TREE, 0);
1739                   $$ =  build_new_loop (body);
1740                   FOR_LOOP_P ($$) = 1;
1741                   /* The loop is added to the current block the for
1742                      statement is defined within */
1743                   java_method_add_stmt (current_function_decl, $$);
1744                 }
1745 ;
1746 for_init:                       /* Can be empty */
1747                 { $$ = build_java_empty_stmt (); }
1748 |       statement_expression_list
1749                 {
1750                   /* Init statement recorded within the previously
1751                      defined block scope */
1752                   $$ = java_method_add_stmt (current_function_decl, $1);
1753                 }
1754 |       local_variable_declaration
1755                 {
1756                   /* Local variable are recorded within the previously
1757                      defined block scope */
1758                   $$ = NULL_TREE;
1759                 }
1760 |       statement_expression_list error
1761                 {yyerror ("';' expected"); DRECOVER(for_init_1);}
1762 ;
1763
1764 for_update:                     /* Can be empty */
1765                 {$$ = build_java_empty_stmt ();}
1766 |       statement_expression_list
1767                 { $$ = build_debugable_stmt (BUILD_LOCATION (), $1); }
1768 ;
1769
1770 statement_expression_list:
1771         statement_expression
1772                 { $$ = add_stmt_to_compound (NULL_TREE, NULL_TREE, $1); }
1773 |       statement_expression_list C_TK statement_expression
1774                 { $$ = add_stmt_to_compound ($1, NULL_TREE, $3); }
1775 |       statement_expression_list C_TK error
1776                 {yyerror ("Missing term"); RECOVER;}
1777 ;
1778
1779 break_statement:
1780         BREAK_TK SC_TK
1781                 { $$ = build_bc_statement ($1.location, 1, NULL_TREE); }
1782 |       BREAK_TK identifier SC_TK
1783                 { $$ = build_bc_statement ($1.location, 1, $2); }
1784 |       BREAK_TK error
1785                 {yyerror ("Missing term"); RECOVER;}
1786 |       BREAK_TK identifier error
1787                 {yyerror ("';' expected"); RECOVER;}
1788 ;
1789
1790 continue_statement:
1791         CONTINUE_TK SC_TK
1792                 { $$ = build_bc_statement ($1.location, 0, NULL_TREE); }
1793 |       CONTINUE_TK identifier SC_TK
1794                 { $$ = build_bc_statement ($1.location, 0, $2); }
1795 |       CONTINUE_TK error
1796                 {yyerror ("Missing term"); RECOVER;}
1797 |       CONTINUE_TK identifier error
1798                 {yyerror ("';' expected"); RECOVER;}
1799 ;
1800
1801 return_statement:
1802         RETURN_TK SC_TK
1803                 { $$ = build_return ($1.location, NULL_TREE); }
1804 |       RETURN_TK expression SC_TK
1805                 { $$ = build_return ($1.location, $2); }
1806 |       RETURN_TK error
1807                 {yyerror ("Missing term"); RECOVER;}
1808 |       RETURN_TK expression error
1809                 {yyerror ("';' expected"); RECOVER;}
1810 ;
1811
1812 throw_statement:
1813         THROW_TK expression SC_TK
1814                 {
1815                   $$ = build1 (THROW_EXPR, NULL_TREE, $2);
1816                   EXPR_WFL_LINECOL ($$) = $1.location;
1817                 }
1818 |       THROW_TK error
1819                 {yyerror ("Missing term"); RECOVER;}
1820 |       THROW_TK expression error
1821                 {yyerror ("';' expected"); RECOVER;}
1822 ;
1823
1824 assert_statement:
1825         ASSERT_TK expression REL_CL_TK expression SC_TK
1826                 {
1827                   $$ = build_assertion ($1.location, $2, $4);
1828                 }
1829 |       ASSERT_TK expression SC_TK
1830                 {
1831                   $$ = build_assertion ($1.location, $2, NULL_TREE);
1832                 }
1833 |       ASSERT_TK error
1834                 {yyerror ("Missing term"); RECOVER;}
1835 |       ASSERT_TK expression error
1836                 {yyerror ("';' expected"); RECOVER;}
1837 ;
1838
1839 synchronized_statement:
1840         synchronized OP_TK expression CP_TK block
1841                 {
1842                   $$ = build (SYNCHRONIZED_EXPR, NULL_TREE, $3, $5);
1843                   EXPR_WFL_LINECOL ($$) =
1844                     EXPR_WFL_LINECOL (MODIFIER_WFL (SYNCHRONIZED_TK));
1845                 }
1846 |       synchronized OP_TK expression CP_TK error
1847                 {yyerror ("'{' expected"); RECOVER;}
1848 |       synchronized error
1849                 {yyerror ("'(' expected"); RECOVER;}
1850 |       synchronized OP_TK error CP_TK
1851                 {yyerror ("Missing term"); RECOVER;}
1852 |       synchronized OP_TK error
1853                 {yyerror ("Missing term"); RECOVER;}
1854 ;
1855
1856 synchronized:
1857         modifiers
1858                 {
1859                   check_modifiers (
1860              "Illegal modifier `%s'. Only `synchronized' was expected here",
1861                                    $1, ACC_SYNCHRONIZED);
1862                   if ($1 != ACC_SYNCHRONIZED)
1863                     MODIFIER_WFL (SYNCHRONIZED_TK) =
1864                       build_wfl_node (NULL_TREE);
1865                 }
1866 ;
1867
1868 try_statement:
1869         TRY_TK block catches
1870                 { $$ = build_try_statement ($1.location, $2, $3); }
1871 |       TRY_TK block finally
1872                 { $$ = build_try_finally_statement ($1.location, $2, $3); }
1873 |       TRY_TK block catches finally
1874                 { $$ = build_try_finally_statement
1875                     ($1.location, build_try_statement ($1.location,
1876                                                        $2, $3), $4);
1877                 }
1878 |       TRY_TK error
1879                 {yyerror ("'{' expected"); DRECOVER (try_statement);}
1880 ;
1881
1882 catches:
1883         catch_clause
1884 |       catches catch_clause
1885                 {
1886                   TREE_CHAIN ($2) = $1;
1887                   $$ = $2;
1888                 }
1889 ;
1890
1891 catch_clause:
1892         catch_clause_parameter block
1893                 {
1894                   java_method_add_stmt (current_function_decl, $2);
1895                   exit_block ();
1896                   $$ = $1;
1897                 }
1898 ;
1899
1900 catch_clause_parameter:
1901         CATCH_TK OP_TK formal_parameter CP_TK
1902                 {
1903                   /* We add a block to define a scope for
1904                      formal_parameter (CCBP). The formal parameter is
1905                      declared initialized by the appropriate function
1906                      call */
1907                   tree ccpb;
1908                   tree init;
1909                   if ($3)
1910                     {
1911                       ccpb = enter_block ();
1912                       init = build_assignment
1913                         (ASSIGN_TK, $2.location, TREE_PURPOSE ($3),
1914                          build (JAVA_EXC_OBJ_EXPR, ptr_type_node));
1915                       declare_local_variables (0, TREE_VALUE ($3),
1916                                                build_tree_list
1917                                                (TREE_PURPOSE ($3), init));
1918                       $$ = build1 (JAVA_CATCH_EXPR, NULL_TREE, ccpb);
1919                       EXPR_WFL_LINECOL ($$) = $1.location;
1920                     }
1921                   else
1922                     {
1923                       $$ = error_mark_node;
1924                     }
1925                 }
1926 |       CATCH_TK error
1927                 {yyerror ("'(' expected"); RECOVER; $$ = NULL_TREE;}
1928 |       CATCH_TK OP_TK error
1929                 {
1930                   yyerror ("Missing term or ')' expected");
1931                   RECOVER; $$ = NULL_TREE;
1932                 }
1933 |       CATCH_TK OP_TK error CP_TK /* That's for () */
1934                 {yyerror ("Missing term"); RECOVER; $$ = NULL_TREE;}
1935 ;
1936
1937 finally:
1938         FINALLY_TK block
1939                 { $$ = $2; }
1940 |       FINALLY_TK error
1941                 {yyerror ("'{' expected"); RECOVER; }
1942 ;
1943
1944 /* 19.12 Production from 15: Expressions  */
1945 primary:
1946         primary_no_new_array
1947 |       array_creation_expression
1948 ;
1949
1950 primary_no_new_array:
1951         literal
1952 |       THIS_TK
1953                 { $$ = build_this ($1.location); }
1954 |       OP_TK expression CP_TK
1955                 {$$ = $2;}
1956 |       class_instance_creation_expression
1957 |       field_access
1958 |       method_invocation
1959 |       array_access
1960 |       type_literals
1961         /* Added, JDK1.1 inner classes. Documentation is wrong
1962            refering to a 'ClassName' (class_name) rule that doesn't
1963            exist. Used name: instead.  */
1964 |       name DOT_TK THIS_TK
1965                 {
1966                   tree wfl = build_wfl_node (this_identifier_node);
1967                   $$ = make_qualified_primary ($1, wfl, EXPR_WFL_LINECOL ($1));
1968                 }
1969 |       OP_TK expression error
1970                 {yyerror ("')' expected"); RECOVER;}
1971 |       name DOT_TK error
1972                 {yyerror ("'class' or 'this' expected" ); RECOVER;}
1973 |       primitive_type DOT_TK error
1974                 {yyerror ("'class' expected" ); RECOVER;}
1975 |       VOID_TK DOT_TK error
1976                 {yyerror ("'class' expected" ); RECOVER;}
1977 ;
1978
1979 type_literals:
1980         name DOT_TK CLASS_TK
1981                 { $$ = build_incomplete_class_ref ($2.location, $1); }
1982 |       array_type DOT_TK CLASS_TK
1983                 { $$ = build_incomplete_class_ref ($2.location, $1); }
1984 |       primitive_type DOT_TK CLASS_TK
1985                 { $$ = build_incomplete_class_ref ($2.location, $1); }
1986 |       VOID_TK DOT_TK CLASS_TK
1987                 {
1988                    $$ = build_incomplete_class_ref ($2.location,
1989                                                    void_type_node);
1990                 }
1991 ;
1992
1993 class_instance_creation_expression:
1994         NEW_TK class_type OP_TK argument_list CP_TK
1995                 { $$ = build_new_invocation ($2, $4); }
1996 |       NEW_TK class_type OP_TK CP_TK
1997                 { $$ = build_new_invocation ($2, NULL_TREE); }
1998 |       anonymous_class_creation
1999         /* Added, JDK1.1 inner classes, modified to use name or
2000            primary instead of primary solely which couldn't work in
2001            all situations.  */
2002 |       something_dot_new identifier OP_TK CP_TK
2003                 {
2004                   tree ctor = build_new_invocation ($2, NULL_TREE);
2005                   $$ = make_qualified_primary ($1, ctor,
2006                                                EXPR_WFL_LINECOL ($1));
2007                 }
2008 |       something_dot_new identifier OP_TK CP_TK class_body
2009 |       something_dot_new identifier OP_TK argument_list CP_TK
2010                 {
2011                   tree ctor = build_new_invocation ($2, $4);
2012                   $$ = make_qualified_primary ($1, ctor,
2013                                                EXPR_WFL_LINECOL ($1));
2014                 }
2015 |       something_dot_new identifier OP_TK argument_list CP_TK class_body
2016 |       NEW_TK error SC_TK
2017                 {yyerror ("'(' expected"); DRECOVER(new_1);}
2018 |       NEW_TK class_type error
2019                 {yyerror ("'(' expected"); RECOVER;}
2020 |       NEW_TK class_type OP_TK error
2021                 {yyerror ("')' or term expected"); RECOVER;}
2022 |       NEW_TK class_type OP_TK argument_list error
2023                 {yyerror ("')' expected"); RECOVER;}
2024 |       something_dot_new error
2025                 {YYERROR_NOW; yyerror ("Identifier expected"); RECOVER;}
2026 |       something_dot_new identifier error
2027                 {yyerror ("'(' expected"); RECOVER;}
2028 ;
2029
2030 /* Created after JDK1.1 rules originally added to
2031    class_instance_creation_expression, but modified to use
2032    'class_type' instead of 'TypeName' (type_name) which is mentioned
2033    in the documentation but doesn't exist. */
2034
2035 anonymous_class_creation:
2036         NEW_TK class_type OP_TK argument_list CP_TK
2037                 { create_anonymous_class ($1.location, $2); }
2038         class_body
2039                 {
2040                   tree id = build_wfl_node (DECL_NAME (GET_CPC ()));
2041                   EXPR_WFL_LINECOL (id) = EXPR_WFL_LINECOL ($2);
2042
2043                   end_class_declaration (1);
2044
2045                   /* Now we can craft the new expression */
2046                   $$ = build_new_invocation (id, $4);
2047
2048                   /* Note that we can't possibly be here if
2049                      `class_type' is an interface (in which case the
2050                      anonymous class extends Object and implements
2051                      `class_type', hence its constructor can't have
2052                      arguments.) */
2053
2054                   /* Otherwise, the innerclass must feature a
2055                      constructor matching `argument_list'. Anonymous
2056                      classes are a bit special: it's impossible to
2057                      define constructor for them, hence constructors
2058                      must be generated following the hints provided by
2059                      the `new' expression. Whether a super constructor
2060                      of that nature exists or not is to be verified
2061                      later on in verify_constructor_super.
2062
2063                      It's during the expansion of a `new' statement
2064                      refering to an anonymous class that a ctor will
2065                      be generated for the anonymous class, with the
2066                      right arguments. */
2067
2068                 }
2069 |       NEW_TK class_type OP_TK CP_TK
2070                 { create_anonymous_class ($1.location, $2); }
2071         class_body
2072                 {
2073                   tree id = build_wfl_node (DECL_NAME (GET_CPC ()));
2074                   EXPR_WFL_LINECOL (id) = EXPR_WFL_LINECOL ($2);
2075
2076                   end_class_declaration (1);
2077
2078                   /* Now we can craft the new expression. The
2079                      statement doesn't need to be remember so that a
2080                      constructor can be generated, since its signature
2081                      is already known. */
2082                   $$ = build_new_invocation (id, NULL_TREE);
2083                 }
2084 ;
2085
2086 something_dot_new:              /* Added, not part of the specs. */
2087         name DOT_TK NEW_TK
2088                 { $$ = $1; }
2089 |       primary DOT_TK NEW_TK
2090                 { $$ = $1; }
2091 ;
2092
2093 argument_list:
2094         expression
2095                 {
2096                   $$ = tree_cons (NULL_TREE, $1, NULL_TREE);
2097                   ctxp->formal_parameter_number = 1;
2098                 }
2099 |       argument_list C_TK expression
2100                 {
2101                   ctxp->formal_parameter_number += 1;
2102                   $$ = tree_cons (NULL_TREE, $3, $1);
2103                 }
2104 |       argument_list C_TK error
2105                 {yyerror ("Missing term"); RECOVER;}
2106 ;
2107
2108 array_creation_expression:
2109         NEW_TK primitive_type dim_exprs
2110                 { $$ = build_newarray_node ($2, $3, 0); }
2111 |       NEW_TK class_or_interface_type dim_exprs
2112                 { $$ = build_newarray_node ($2, $3, 0); }
2113 |       NEW_TK primitive_type dim_exprs dims
2114                 { $$ = build_newarray_node ($2, $3, pop_current_osb (ctxp));}
2115 |       NEW_TK class_or_interface_type dim_exprs dims
2116                 { $$ = build_newarray_node ($2, $3, pop_current_osb (ctxp));}
2117         /* Added, JDK1.1 anonymous array. Initial documentation rule
2118            modified */
2119 |       NEW_TK class_or_interface_type dims array_initializer
2120                 {
2121                   char *sig;
2122                   int osb = pop_current_osb (ctxp);
2123                   while (osb--)
2124                     obstack_grow (&temporary_obstack, "[]", 2);
2125                   obstack_1grow (&temporary_obstack, '\0');
2126                   sig = obstack_finish (&temporary_obstack);
2127                   $$ = build (NEW_ANONYMOUS_ARRAY_EXPR, NULL_TREE,
2128                               $2, get_identifier (sig), $4);
2129                 }
2130 |       NEW_TK primitive_type dims array_initializer
2131                 {
2132                   int osb = pop_current_osb (ctxp);
2133                   tree type = $2;
2134                   while (osb--)
2135                     type = build_java_array_type (type, -1);
2136                   $$ = build (NEW_ANONYMOUS_ARRAY_EXPR, NULL_TREE,
2137                               build_pointer_type (type), NULL_TREE, $4);
2138                 }
2139 |       NEW_TK error CSB_TK
2140                 {yyerror ("'[' expected"); DRECOVER ("]");}
2141 |       NEW_TK error OSB_TK
2142                 {yyerror ("']' expected"); RECOVER;}
2143 ;
2144
2145 dim_exprs:
2146         dim_expr
2147                 { $$ = build_tree_list (NULL_TREE, $1); }
2148 |       dim_exprs dim_expr
2149                 { $$ = tree_cons (NULL_TREE, $2, $$); }
2150 ;
2151
2152 dim_expr:
2153         OSB_TK expression CSB_TK
2154                 {
2155                   if (JNUMERIC_TYPE_P (TREE_TYPE ($2)))
2156                     {
2157                       $2 = build_wfl_node ($2);
2158                       TREE_TYPE ($2) = NULL_TREE;
2159                     }
2160                   EXPR_WFL_LINECOL ($2) = $1.location;
2161                   $$ = $2;
2162                 }
2163 |       OSB_TK expression error
2164                 {yyerror ("']' expected"); RECOVER;}
2165 |       OSB_TK error
2166                 {
2167                   yyerror ("Missing term");
2168                   yyerror ("']' expected");
2169                   RECOVER;
2170                 }
2171 ;
2172
2173 dims:
2174         OSB_TK CSB_TK
2175                 {
2176                   int allocate = 0;
2177                   /* If not initialized, allocate memory for the osb
2178                      numbers stack */
2179                   if (!ctxp->osb_limit)
2180                     {
2181                       allocate = ctxp->osb_limit = 32;
2182                       ctxp->osb_depth = -1;
2183                     }
2184                   /* If capacity overflown, reallocate a bigger chunk */
2185                   else if (ctxp->osb_depth+1 == ctxp->osb_limit)
2186                     allocate = ctxp->osb_limit << 1;
2187
2188                   if (allocate)
2189                     {
2190                       allocate *= sizeof (int);
2191                       if (ctxp->osb_number)
2192                         ctxp->osb_number = xrealloc (ctxp->osb_number,
2193                                                      allocate);
2194                       else
2195                         ctxp->osb_number = xmalloc (allocate);
2196                     }
2197                   ctxp->osb_depth++;
2198                   CURRENT_OSB (ctxp) = 1;
2199                 }
2200 |       dims OSB_TK CSB_TK
2201                 { CURRENT_OSB (ctxp)++; }
2202 |       dims OSB_TK error
2203                 { yyerror ("']' expected"); RECOVER;}
2204 ;
2205
2206 field_access:
2207         primary DOT_TK identifier
2208                 { $$ = make_qualified_primary ($1, $3, $2.location); }
2209                 /*  FIXME - REWRITE TO:
2210                 { $$ = build_binop (COMPONENT_REF, $2.location, $1, $3); } */
2211 |       SUPER_TK DOT_TK identifier
2212                 {
2213                   tree super_wfl = build_wfl_node (super_identifier_node);
2214                   EXPR_WFL_LINECOL (super_wfl) = $1.location;
2215                   $$ = make_qualified_name (super_wfl, $3, $2.location);
2216                 }
2217 |       SUPER_TK error
2218                 {yyerror ("Field expected"); DRECOVER (super_field_acces);}
2219 ;
2220
2221 method_invocation:
2222         name OP_TK CP_TK
2223                 { $$ = build_method_invocation ($1, NULL_TREE); }
2224 |       name OP_TK argument_list CP_TK
2225                 { $$ = build_method_invocation ($1, $3); }
2226 |       primary DOT_TK identifier OP_TK CP_TK
2227                 {
2228                   if (TREE_CODE ($1) == THIS_EXPR)
2229                     $$ = build_this_super_qualified_invocation
2230                       (1, $3, NULL_TREE, 0, $2.location);
2231                   else
2232                     {
2233                       tree invok = build_method_invocation ($3, NULL_TREE);
2234                       $$ = make_qualified_primary ($1, invok, $2.location);
2235                     }
2236                 }
2237 |       primary DOT_TK identifier OP_TK argument_list CP_TK
2238                 {
2239                   if (TREE_CODE ($1) == THIS_EXPR)
2240                     $$ = build_this_super_qualified_invocation
2241                       (1, $3, $5, 0, $2.location);
2242                   else
2243                     {
2244                       tree invok = build_method_invocation ($3, $5);
2245                       $$ = make_qualified_primary ($1, invok, $2.location);
2246                     }
2247                 }
2248 |       SUPER_TK DOT_TK identifier OP_TK CP_TK
2249                 {
2250                   $$ = build_this_super_qualified_invocation
2251                     (0, $3, NULL_TREE, $1.location, $2.location);
2252                 }
2253 |       SUPER_TK DOT_TK identifier OP_TK argument_list CP_TK
2254                 {
2255                   $$ = build_this_super_qualified_invocation
2256                     (0, $3, $5, $1.location, $2.location);
2257                 }
2258         /* Screws up thing. I let it here until I'm convinced it can
2259            be removed. FIXME
2260 |       primary DOT_TK error
2261                 {yyerror ("'(' expected"); DRECOVER(bad);} */
2262 |       SUPER_TK DOT_TK error CP_TK
2263                 { yyerror ("'(' expected"); DRECOVER (method_invocation); }
2264 |       SUPER_TK DOT_TK error DOT_TK
2265                 { yyerror ("'(' expected"); DRECOVER (method_invocation); }
2266 ;
2267
2268 array_access:
2269         name OSB_TK expression CSB_TK
2270                 { $$ = build_array_ref ($2.location, $1, $3); }
2271 |       primary_no_new_array OSB_TK expression CSB_TK
2272                 { $$ = build_array_ref ($2.location, $1, $3); }
2273 |       name OSB_TK error
2274                 {
2275                   yyerror ("Missing term and ']' expected");
2276                   DRECOVER(array_access);
2277                 }
2278 |       name OSB_TK expression error
2279                 {
2280                   yyerror ("']' expected");
2281                   DRECOVER(array_access);
2282                 }
2283 |       primary_no_new_array OSB_TK error
2284                 {
2285                   yyerror ("Missing term and ']' expected");
2286                   DRECOVER(array_access);
2287                 }
2288 |       primary_no_new_array OSB_TK expression error
2289                 {
2290                   yyerror ("']' expected");
2291                   DRECOVER(array_access);
2292                 }
2293 ;
2294
2295 postfix_expression:
2296         primary
2297 |       name
2298 |       post_increment_expression
2299 |       post_decrement_expression
2300 ;
2301
2302 post_increment_expression:
2303         postfix_expression INCR_TK
2304                 { $$ = build_incdec ($2.token, $2.location, $1, 1); }
2305 ;
2306
2307 post_decrement_expression:
2308         postfix_expression DECR_TK
2309                 { $$ = build_incdec ($2.token, $2.location, $1, 1); }
2310 ;
2311
2312 trap_overflow_corner_case:
2313         pre_increment_expression
2314 |       pre_decrement_expression
2315 |       PLUS_TK unary_expression
2316                 {$$ = build_unaryop ($1.token, $1.location, $2); }
2317 |       unary_expression_not_plus_minus
2318 |       PLUS_TK error
2319                 {yyerror ("Missing term"); RECOVER}
2320 ;
2321
2322 unary_expression:
2323         trap_overflow_corner_case
2324                 {
2325                   error_if_numeric_overflow ($1);
2326                   $$ = $1;
2327                 }
2328 |       MINUS_TK trap_overflow_corner_case
2329                 {$$ = build_unaryop ($1.token, $1.location, $2); }
2330 |       MINUS_TK error
2331                 {yyerror ("Missing term"); RECOVER}
2332 ;
2333
2334 pre_increment_expression:
2335         INCR_TK unary_expression
2336                 {$$ = build_incdec ($1.token, $1.location, $2, 0); }
2337 |       INCR_TK error
2338                 {yyerror ("Missing term"); RECOVER}
2339 ;
2340
2341 pre_decrement_expression:
2342         DECR_TK unary_expression
2343                 {$$ = build_incdec ($1.token, $1.location, $2, 0); }
2344 |       DECR_TK error
2345                 {yyerror ("Missing term"); RECOVER}
2346 ;
2347
2348 unary_expression_not_plus_minus:
2349         postfix_expression
2350 |       NOT_TK unary_expression
2351                 {$$ = build_unaryop ($1.token, $1.location, $2); }
2352 |       NEG_TK unary_expression
2353                 {$$ = build_unaryop ($1.token, $1.location, $2); }
2354 |       cast_expression
2355 |       NOT_TK error
2356                 {yyerror ("Missing term"); RECOVER}
2357 |       NEG_TK error
2358                 {yyerror ("Missing term"); RECOVER}
2359 ;
2360
2361 cast_expression:                /* Error handling here is potentially weak */
2362         OP_TK primitive_type dims CP_TK unary_expression
2363                 {
2364                   tree type = $2;
2365                   int osb = pop_current_osb (ctxp);
2366                   while (osb--)
2367                     type = build_java_array_type (type, -1);
2368                   $$ = build_cast ($1.location, type, $5);
2369                 }
2370 |       OP_TK primitive_type CP_TK unary_expression
2371                 { $$ = build_cast ($1.location, $2, $4); }
2372 |       OP_TK expression CP_TK unary_expression_not_plus_minus
2373                 { $$ = build_cast ($1.location, $2, $4); }
2374 |       OP_TK name dims CP_TK unary_expression_not_plus_minus
2375                 {
2376                   const char *ptr;
2377                   int osb = pop_current_osb (ctxp);
2378                   obstack_grow (&temporary_obstack,
2379                                 IDENTIFIER_POINTER (EXPR_WFL_NODE ($2)),
2380                                 IDENTIFIER_LENGTH (EXPR_WFL_NODE ($2)));
2381                   while (osb--)
2382                     obstack_grow (&temporary_obstack, "[]", 2);
2383                   obstack_1grow (&temporary_obstack, '\0');
2384                   ptr = obstack_finish (&temporary_obstack);
2385                   EXPR_WFL_NODE ($2) = get_identifier (ptr);
2386                   $$ = build_cast ($1.location, $2, $5);
2387                 }
2388 |       OP_TK primitive_type OSB_TK error
2389                 {yyerror ("']' expected, invalid type expression");}
2390 |       OP_TK error
2391                 {
2392                   YYNOT_TWICE yyerror ("Invalid type expression"); RECOVER;
2393                   RECOVER;
2394                 }
2395 |       OP_TK primitive_type dims CP_TK error
2396                 {yyerror ("Missing term"); RECOVER;}
2397 |       OP_TK primitive_type CP_TK error
2398                 {yyerror ("Missing term"); RECOVER;}
2399 |       OP_TK name dims CP_TK error
2400                 {yyerror ("Missing term"); RECOVER;}
2401 ;
2402
2403 multiplicative_expression:
2404         unary_expression
2405 |       multiplicative_expression MULT_TK unary_expression
2406                 {
2407                   $$ = build_binop (BINOP_LOOKUP ($2.token),
2408                                     $2.location, $1, $3);
2409                 }
2410 |       multiplicative_expression DIV_TK unary_expression
2411                 {
2412                   $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2413                                     $1, $3);
2414                 }
2415 |       multiplicative_expression REM_TK unary_expression
2416                 {
2417                   $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2418                                     $1, $3);
2419                 }
2420 |       multiplicative_expression MULT_TK error
2421                 {yyerror ("Missing term"); RECOVER;}
2422 |       multiplicative_expression DIV_TK error
2423                 {yyerror ("Missing term"); RECOVER;}
2424 |       multiplicative_expression REM_TK error
2425                 {yyerror ("Missing term"); RECOVER;}
2426 ;
2427
2428 additive_expression:
2429         multiplicative_expression
2430 |       additive_expression PLUS_TK multiplicative_expression
2431                 {
2432                   $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2433                                     $1, $3);
2434                 }
2435 |       additive_expression MINUS_TK multiplicative_expression
2436                 {
2437                   $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2438                                     $1, $3);
2439                 }
2440 |       additive_expression PLUS_TK error
2441                 {yyerror ("Missing term"); RECOVER;}
2442 |       additive_expression MINUS_TK error
2443                 {yyerror ("Missing term"); RECOVER;}
2444 ;
2445
2446 shift_expression:
2447         additive_expression
2448 |       shift_expression LS_TK additive_expression
2449                 {
2450                   $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2451                                     $1, $3);
2452                 }
2453 |       shift_expression SRS_TK additive_expression
2454                 {
2455                   $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2456                                     $1, $3);
2457                 }
2458 |       shift_expression ZRS_TK additive_expression
2459                 {
2460                   $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2461                                     $1, $3);
2462                 }
2463 |       shift_expression LS_TK error
2464                 {yyerror ("Missing term"); RECOVER;}
2465 |       shift_expression SRS_TK error
2466                 {yyerror ("Missing term"); RECOVER;}
2467 |       shift_expression ZRS_TK error
2468                 {yyerror ("Missing term"); RECOVER;}
2469 ;
2470
2471 relational_expression:
2472         shift_expression
2473 |       relational_expression LT_TK shift_expression
2474                 {
2475                   $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2476                                     $1, $3);
2477                 }
2478 |       relational_expression GT_TK shift_expression
2479                 {
2480                   $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2481                                     $1, $3);
2482                 }
2483 |       relational_expression LTE_TK shift_expression
2484                 {
2485                   $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2486                                     $1, $3);
2487                 }
2488 |       relational_expression GTE_TK shift_expression
2489                 {
2490                   $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2491                                     $1, $3);
2492                 }
2493 |       relational_expression INSTANCEOF_TK reference_type
2494                 { $$ = build_binop (INSTANCEOF_EXPR, $2.location, $1, $3); }
2495 |       relational_expression LT_TK error
2496                 {yyerror ("Missing term"); RECOVER;}
2497 |       relational_expression GT_TK error
2498                 {yyerror ("Missing term"); RECOVER;}
2499 |       relational_expression LTE_TK error
2500                 {yyerror ("Missing term"); RECOVER;}
2501 |       relational_expression GTE_TK error
2502                 {yyerror ("Missing term"); RECOVER;}
2503 |       relational_expression INSTANCEOF_TK error
2504                 {yyerror ("Invalid reference type"); RECOVER;}
2505 ;
2506
2507 equality_expression:
2508         relational_expression
2509 |       equality_expression EQ_TK relational_expression
2510                 {
2511                   $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2512                                     $1, $3);
2513                 }
2514 |       equality_expression NEQ_TK relational_expression
2515                 {
2516                   $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2517                                     $1, $3);
2518                 }
2519 |       equality_expression EQ_TK error
2520                 {yyerror ("Missing term"); RECOVER;}
2521 |       equality_expression NEQ_TK error
2522                 {yyerror ("Missing term"); RECOVER;}
2523 ;
2524
2525 and_expression:
2526         equality_expression
2527 |       and_expression AND_TK equality_expression
2528                 {
2529                   $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2530                                     $1, $3);
2531                 }
2532 |       and_expression AND_TK error
2533                 {yyerror ("Missing term"); RECOVER;}
2534 ;
2535
2536 exclusive_or_expression:
2537         and_expression
2538 |       exclusive_or_expression XOR_TK and_expression
2539                 {
2540                   $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2541                                     $1, $3);
2542                 }
2543 |       exclusive_or_expression XOR_TK error
2544                 {yyerror ("Missing term"); RECOVER;}
2545 ;
2546
2547 inclusive_or_expression:
2548         exclusive_or_expression
2549 |       inclusive_or_expression OR_TK exclusive_or_expression
2550                 {
2551                   $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2552                                     $1, $3);
2553                 }
2554 |       inclusive_or_expression OR_TK error
2555                 {yyerror ("Missing term"); RECOVER;}
2556 ;
2557
2558 conditional_and_expression:
2559         inclusive_or_expression
2560 |       conditional_and_expression BOOL_AND_TK inclusive_or_expression
2561                 {
2562                   $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2563                                     $1, $3);
2564                 }
2565 |       conditional_and_expression BOOL_AND_TK error
2566                 {yyerror ("Missing term"); RECOVER;}
2567 ;
2568
2569 conditional_or_expression:
2570         conditional_and_expression
2571 |       conditional_or_expression BOOL_OR_TK conditional_and_expression
2572                 {
2573                   $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2574                                     $1, $3);
2575                 }
2576 |       conditional_or_expression BOOL_OR_TK error
2577                 {yyerror ("Missing term"); RECOVER;}
2578 ;
2579
2580 conditional_expression:         /* Error handling here is weak */
2581         conditional_or_expression
2582 |       conditional_or_expression REL_QM_TK expression REL_CL_TK conditional_expression
2583                 {
2584                   $$ = build (CONDITIONAL_EXPR, NULL_TREE, $1, $3, $5);
2585                   EXPR_WFL_LINECOL ($$) = $2.location;
2586                 }
2587 |       conditional_or_expression REL_QM_TK REL_CL_TK error
2588                 {
2589                   YYERROR_NOW;
2590                   yyerror ("Missing term");
2591                   DRECOVER (1);
2592                 }
2593 |       conditional_or_expression REL_QM_TK error
2594                 {yyerror ("Missing term"); DRECOVER (2);}
2595 |       conditional_or_expression REL_QM_TK expression REL_CL_TK error
2596                 {yyerror ("Missing term"); DRECOVER (3);}
2597 ;
2598
2599 assignment_expression:
2600         conditional_expression
2601 |       assignment
2602 ;
2603
2604 assignment:
2605         left_hand_side assignment_operator assignment_expression
2606                 { $$ = build_assignment ($2.token, $2.location, $1, $3); }
2607 |       left_hand_side assignment_operator error
2608                 {
2609                   YYNOT_TWICE yyerror ("Missing term");
2610                   DRECOVER (assign);
2611                 }
2612 ;
2613
2614 left_hand_side:
2615         name
2616 |       field_access
2617 |       array_access
2618 ;
2619
2620 assignment_operator:
2621         ASSIGN_ANY_TK
2622 |       ASSIGN_TK
2623 ;
2624
2625 expression:
2626         assignment_expression
2627 ;
2628
2629 constant_expression:
2630         expression
2631 ;
2632
2633 %%
2634
2635 /* Helper function to retrieve an OSB count. Should be used when the
2636    `dims:' rule is being used.  */
2637
2638 static int
2639 pop_current_osb (struct parser_ctxt *ctxp)
2640 {
2641   int to_return;
2642
2643   if (ctxp->osb_depth < 0)
2644     abort ();
2645
2646   to_return = CURRENT_OSB (ctxp);
2647   ctxp->osb_depth--;
2648
2649   return to_return;
2650 }
2651
2652 \f
2653
2654 /* This section of the code deal with save/restoring parser contexts.
2655    Add mode documentation here. FIXME */
2656
2657 /* Helper function. Create a new parser context. With
2658    COPY_FROM_PREVIOUS set to a nonzero value, content of the previous
2659    context is copied, otherwise, the new context is zeroed. The newly
2660    created context becomes the current one.  */
2661
2662 static void
2663 create_new_parser_context (int copy_from_previous)
2664 {
2665   struct parser_ctxt *new;
2666
2667   new = ggc_alloc (sizeof (struct parser_ctxt));
2668   if (copy_from_previous)
2669     {
2670       memcpy (new, ctxp, sizeof (struct parser_ctxt));
2671       /* This flag, indicating the context saves global values,
2672          should only be set by java_parser_context_save_global.  */
2673       new->saved_data_ctx = 0;
2674     }
2675   else
2676     memset (new, 0, sizeof (struct parser_ctxt));
2677
2678   new->next = ctxp;
2679   ctxp = new;
2680 }
2681
2682 /* Create a new parser context and make it the current one. */
2683
2684 void
2685 java_push_parser_context (void)
2686 {
2687   create_new_parser_context (0);
2688 }
2689
2690 void
2691 java_pop_parser_context (int generate)
2692 {
2693   tree current;
2694   struct parser_ctxt *toFree, *next;
2695
2696   if (!ctxp)
2697     return;
2698
2699   toFree = ctxp;
2700   next = ctxp->next;
2701   if (next)
2702     {
2703       input_line = ctxp->lineno;
2704       current_class = ctxp->class_type;
2705     }
2706
2707   /* If the old and new lexers differ, then free the old one.  */
2708   if (ctxp->lexer && next && ctxp->lexer != next->lexer)
2709     java_destroy_lexer (ctxp->lexer);
2710
2711   /* Set the single import class file flag to 0 for the current list
2712      of imported things */
2713   for (current = ctxp->import_list; current; current = TREE_CHAIN (current))
2714     IS_A_SINGLE_IMPORT_CLASSFILE_NAME_P (TREE_VALUE (current)) = 0;
2715
2716   /* And restore those of the previous context */
2717   if ((ctxp = next))            /* Assignment is really meant here */
2718     for (current = ctxp->import_list; current; current = TREE_CHAIN (current))
2719       IS_A_SINGLE_IMPORT_CLASSFILE_NAME_P (TREE_VALUE (current)) = 1;
2720
2721   /* If we pushed a context to parse a class intended to be generated,
2722      we keep it so we can remember the class. What we could actually
2723      do is to just update a list of class names.  */
2724   if (generate)
2725     {
2726       toFree->next = ctxp_for_generation;
2727       ctxp_for_generation = toFree;
2728     }
2729 }
2730
2731 /* Create a parser context for the use of saving some global
2732    variables.  */
2733
2734 void
2735 java_parser_context_save_global (void)
2736 {
2737   if (!ctxp)
2738     {
2739       java_push_parser_context ();
2740       ctxp->saved_data_ctx = 1;
2741     }
2742
2743   /* If this context already stores data, create a new one suitable
2744      for data storage. */
2745   else if (ctxp->saved_data)
2746     {
2747       create_new_parser_context (1);
2748       ctxp->saved_data_ctx = 1;
2749     }
2750
2751   ctxp->lineno = input_line;
2752   ctxp->class_type = current_class;
2753   ctxp->filename = input_filename;
2754   ctxp->function_decl = current_function_decl;
2755   ctxp->saved_data = 1;
2756 }
2757
2758 /* Restore some global variables from the previous context. Make the
2759    previous context the current one.  */
2760
2761 void
2762 java_parser_context_restore_global (void)
2763 {
2764   input_line = ctxp->lineno;
2765   current_class = ctxp->class_type;
2766   input_filename = ctxp->filename;
2767   if (wfl_operator)
2768     {
2769       tree s;
2770       BUILD_FILENAME_IDENTIFIER_NODE (s, input_filename);
2771       EXPR_WFL_FILENAME_NODE (wfl_operator) = s;
2772     }
2773   current_function_decl = ctxp->function_decl;
2774   ctxp->saved_data = 0;
2775   if (ctxp->saved_data_ctx)
2776     java_pop_parser_context (0);
2777 }
2778
2779 /* Suspend vital data for the current class/function being parsed so
2780    that an other class can be parsed. Used to let local/anonymous
2781    classes be parsed.  */
2782
2783 static void
2784 java_parser_context_suspend (void)
2785 {
2786   /* This makes debugging through java_debug_context easier */
2787   static const char *const name = "<inner buffer context>";
2788
2789   /* Duplicate the previous context, use it to save the globals we're
2790      interested in */
2791   create_new_parser_context (1);
2792   ctxp->function_decl = current_function_decl;
2793   ctxp->class_type = current_class;
2794
2795   /* Then create a new context which inherits all data from the
2796      previous one. This will be the new current context  */
2797   create_new_parser_context (1);
2798
2799   /* Help debugging */
2800   ctxp->next->filename = name;
2801 }
2802
2803 /* Resume vital data for the current class/function being parsed so
2804    that an other class can be parsed. Used to let local/anonymous
2805    classes be parsed.  The trick is the data storing file position
2806    informations must be restored to their current value, so parsing
2807    can resume as if no context was ever saved. */
2808
2809 static void
2810 java_parser_context_resume (void)
2811 {
2812   struct parser_ctxt *old = ctxp;             /* This one is to be discarded */
2813   struct parser_ctxt *saver = old->next;      /* This one contain saved info */
2814   struct parser_ctxt *restored = saver->next; /* This one is the old current */
2815
2816   /* We need to inherit the list of classes to complete/generate */
2817   restored->classd_list = old->classd_list;
2818   restored->class_list = old->class_list;
2819
2820   /* Restore the current class and function from the saver */
2821   current_class = saver->class_type;
2822   current_function_decl = saver->function_decl;
2823
2824   /* Retrieve the restored context */
2825   ctxp = restored;
2826
2827   /* Re-installed the data for the parsing to carry on */
2828   memcpy (&ctxp->marker_begining, &old->marker_begining,
2829           (size_t)(&ctxp->marker_end - &ctxp->marker_begining));
2830 }
2831
2832 /* Add a new anchor node to which all statement(s) initializing static
2833    and non static initialized upon declaration field(s) will be
2834    linked.  */
2835
2836 static void
2837 java_parser_context_push_initialized_field (void)
2838 {
2839   tree node;
2840
2841   node = build_tree_list (NULL_TREE, NULL_TREE);
2842   TREE_CHAIN (node) = CPC_STATIC_INITIALIZER_LIST (ctxp);
2843   CPC_STATIC_INITIALIZER_LIST (ctxp) = node;
2844
2845   node = build_tree_list (NULL_TREE, NULL_TREE);
2846   TREE_CHAIN (node) = CPC_INITIALIZER_LIST (ctxp);
2847   CPC_INITIALIZER_LIST (ctxp) = node;
2848
2849   node = build_tree_list (NULL_TREE, NULL_TREE);
2850   TREE_CHAIN (node) = CPC_INSTANCE_INITIALIZER_LIST (ctxp);
2851   CPC_INSTANCE_INITIALIZER_LIST (ctxp) = node;
2852 }
2853
2854 /* Pop the lists of initialized field. If this lists aren't empty,
2855    remember them so we can use it to create and populate the finit$
2856    or <clinit> functions. */
2857
2858 static void
2859 java_parser_context_pop_initialized_field (void)
2860 {
2861   tree stmts;
2862   tree class_type = TREE_TYPE (GET_CPC ());
2863
2864   if (CPC_INITIALIZER_LIST (ctxp))
2865     {
2866       stmts = CPC_INITIALIZER_STMT (ctxp);
2867       CPC_INITIALIZER_LIST (ctxp) = TREE_CHAIN (CPC_INITIALIZER_LIST (ctxp));
2868       if (stmts && !java_error_count)
2869         TYPE_FINIT_STMT_LIST (class_type) = reorder_static_initialized (stmts);
2870     }
2871
2872   if (CPC_STATIC_INITIALIZER_LIST (ctxp))
2873     {
2874       stmts = CPC_STATIC_INITIALIZER_STMT (ctxp);
2875       CPC_STATIC_INITIALIZER_LIST (ctxp) =
2876         TREE_CHAIN (CPC_STATIC_INITIALIZER_LIST (ctxp));
2877       /* Keep initialization in order to enforce 8.5 */
2878       if (stmts && !java_error_count)
2879         TYPE_CLINIT_STMT_LIST (class_type) = nreverse (stmts);
2880     }
2881
2882   /* JDK 1.1 instance initializers */
2883   if (CPC_INSTANCE_INITIALIZER_LIST (ctxp))
2884     {
2885       stmts = CPC_INSTANCE_INITIALIZER_STMT (ctxp);
2886       CPC_INSTANCE_INITIALIZER_LIST (ctxp) =
2887         TREE_CHAIN (CPC_INSTANCE_INITIALIZER_LIST (ctxp));
2888       if (stmts && !java_error_count)
2889         TYPE_II_STMT_LIST (class_type) = nreverse (stmts);
2890     }
2891 }
2892
2893 static tree
2894 reorder_static_initialized (tree list)
2895 {
2896   /* We have to keep things in order. The alias initializer have to
2897      come first, then the initialized regular field, in reverse to
2898      keep them in lexical order. */
2899   tree marker, previous = NULL_TREE;
2900   for (marker = list; marker; previous = marker, marker = TREE_CHAIN (marker))
2901     if (TREE_CODE (marker) == TREE_LIST
2902         && !TREE_VALUE (marker) && !TREE_PURPOSE (marker))
2903       break;
2904
2905   /* No static initialized, the list is fine as is */
2906   if (!previous)
2907     list = TREE_CHAIN (marker);
2908
2909   /* No marker? reverse the whole list */
2910   else if (!marker)
2911     list = nreverse (list);
2912
2913   /* Otherwise, reverse what's after the marker and the new reordered
2914      sublist will replace the marker. */
2915   else
2916     {
2917       TREE_CHAIN (previous) = NULL_TREE;
2918       list = nreverse (list);
2919       list = chainon (TREE_CHAIN (marker), list);
2920     }
2921   return list;
2922 }
2923
2924 /* Helper functions to dump the parser context stack.  */
2925
2926 #define TAB_CONTEXT(C) \
2927   {int i; for (i = 0; i < (C); i++) fputc (' ', stderr);}
2928
2929 static void
2930 java_debug_context_do (int tab)
2931 {
2932   struct parser_ctxt *copy = ctxp;
2933   while (copy)
2934     {
2935       TAB_CONTEXT (tab);
2936       fprintf (stderr, "ctxt: 0x%0lX\n", (unsigned long)copy);
2937       TAB_CONTEXT (tab);
2938       fprintf (stderr, "filename: %s\n", copy->filename);
2939       TAB_CONTEXT (tab);
2940       fprintf (stderr, "lineno: %d\n", copy->lineno);
2941       TAB_CONTEXT (tab);
2942       fprintf (stderr, "package: %s\n",
2943                (copy->package ?
2944                 IDENTIFIER_POINTER (copy->package) : "<none>"));
2945       TAB_CONTEXT (tab);
2946       fprintf (stderr, "context for saving: %d\n", copy->saved_data_ctx);
2947       TAB_CONTEXT (tab);
2948       fprintf (stderr, "saved data: %d\n", copy->saved_data);
2949       copy = copy->next;
2950       tab += 2;
2951     }
2952 }
2953
2954 /* Dump the stacked up parser contexts. Intended to be called from a
2955    debugger.  */
2956
2957 void
2958 java_debug_context (void)
2959 {
2960   java_debug_context_do (0);
2961 }
2962
2963 \f
2964
2965 /* Flag for the error report routine to issue the error the first time
2966    it's called (overriding the default behavior which is to drop the
2967    first invocation and honor the second one, taking advantage of a
2968    richer context.  */
2969 static int force_error = 0;
2970
2971 /* Reporting an constructor invocation error.  */
2972 static void
2973 parse_ctor_invocation_error (void)
2974 {
2975   if (DECL_CONSTRUCTOR_P (current_function_decl))
2976     yyerror ("Constructor invocation must be first thing in a constructor");
2977   else
2978     yyerror ("Only constructors can invoke constructors");
2979 }
2980
2981 /* Reporting JDK1.1 features not implemented.  */
2982
2983 static tree
2984 parse_jdk1_1_error (const char *msg)
2985 {
2986   sorry (": `%s' JDK1.1(TM) feature", msg);
2987   java_error_count++;
2988   return build_java_empty_stmt ();
2989 }
2990
2991 static int do_warning = 0;
2992
2993 void
2994 yyerror (const char *msg)
2995 {
2996   static java_lc elc;
2997   static int  prev_lineno;
2998   static const char *prev_msg;
2999
3000   int save_lineno;
3001   char *remainder, *code_from_source;
3002
3003   if (!force_error && prev_lineno == input_line)
3004     return;
3005
3006   /* Save current error location but report latter, when the context is
3007      richer.  */
3008   if (ctxp->java_error_flag == 0)
3009     {
3010       ctxp->java_error_flag = 1;
3011       elc = ctxp->elc;
3012       /* Do something to use the previous line if we're reaching the
3013          end of the file... */
3014 #ifdef VERBOSE_SKELETON
3015       printf ("* Error detected (%s)\n", (msg ? msg : "(null)"));
3016 #endif
3017       return;
3018     }
3019
3020   /* Ignore duplicate message on the same line. BTW, this is dubious. FIXME */
3021   if (!force_error && msg == prev_msg && prev_lineno == elc.line)
3022     return;
3023
3024   ctxp->java_error_flag = 0;
3025   if (do_warning)
3026     java_warning_count++;
3027   else
3028     java_error_count++;
3029
3030   if (elc.col == 0 && msg && msg[1] == ';')
3031     {
3032       elc.col  = ctxp->p_line->char_col-1;
3033       elc.line = ctxp->p_line->lineno;
3034     }
3035
3036   save_lineno = input_line;
3037   prev_lineno = input_line = elc.line;
3038   prev_msg = msg;
3039
3040   code_from_source = java_get_line_col (ctxp->filename, elc.line, elc.col);
3041   obstack_grow0 (&temporary_obstack,
3042                  code_from_source, strlen (code_from_source));
3043   remainder = obstack_finish (&temporary_obstack);
3044   if (do_warning)
3045     warning ("%s.\n%s", msg, remainder);
3046   else
3047     error ("%s.\n%s", msg, remainder);
3048
3049   /* This allow us to cheaply avoid an extra 'Invalid expression
3050      statement' error report when errors have been already reported on
3051      the same line. This occurs when we report an error but don't have
3052      a synchronization point other than ';', which
3053      expression_statement is the only one to take care of.  */
3054   ctxp->prevent_ese = input_line = save_lineno;
3055 }
3056
3057 static void
3058 issue_warning_error_from_context (tree cl, const char *msg, va_list ap)
3059 {
3060   const char *saved, *saved_input_filename;
3061   char buffer [4096];
3062   vsprintf (buffer, msg, ap);
3063   force_error = 1;
3064
3065   ctxp->elc.line = EXPR_WFL_LINENO (cl);
3066   ctxp->elc.col  = (EXPR_WFL_COLNO (cl) == 0xfff ? -1 :
3067                     (EXPR_WFL_COLNO (cl) == 0xffe ? -2 : EXPR_WFL_COLNO (cl)));
3068
3069   /* We have a CL, that's a good reason for using it if it contains data */
3070   saved = ctxp->filename;
3071   if (TREE_CODE (cl) == EXPR_WITH_FILE_LOCATION && EXPR_WFL_FILENAME_NODE (cl))
3072     ctxp->filename = EXPR_WFL_FILENAME (cl);
3073   saved_input_filename = input_filename;
3074   input_filename = ctxp->filename;
3075   java_error (NULL);
3076   java_error (buffer);
3077   ctxp->filename = saved;
3078   input_filename = saved_input_filename;
3079   force_error = 0;
3080 }
3081
3082 /* Issue an error message at a current source line CL */
3083
3084 void
3085 parse_error_context (tree cl, const char *msg, ...)
3086 {
3087   va_list ap;
3088   va_start (ap, msg);
3089   issue_warning_error_from_context (cl, msg, ap);
3090   va_end (ap);
3091 }
3092
3093 /* Issue a warning at a current source line CL */
3094
3095 static void
3096 parse_warning_context (tree cl, const char *msg, ...)
3097 {
3098   va_list ap;
3099   va_start (ap, msg);
3100
3101   force_error = do_warning = 1;
3102   issue_warning_error_from_context (cl, msg, ap);
3103   do_warning = force_error = 0;
3104   va_end (ap);
3105 }
3106
3107 static tree
3108 find_expr_with_wfl (tree node)
3109 {
3110   while (node)
3111     {
3112       char code;
3113       tree to_return;
3114
3115       switch (TREE_CODE (node))
3116         {
3117         case BLOCK:
3118           node = BLOCK_EXPR_BODY (node);
3119           continue;
3120
3121         case COMPOUND_EXPR:
3122           to_return = find_expr_with_wfl (TREE_OPERAND (node, 0));
3123           if (to_return)
3124             return to_return;
3125           node = TREE_OPERAND (node, 1);
3126           continue;
3127
3128         case LOOP_EXPR:
3129           node = TREE_OPERAND (node, 0);
3130           continue;
3131
3132         case LABELED_BLOCK_EXPR:
3133           node = TREE_OPERAND (node, 1);
3134           continue;
3135
3136         default:
3137           code = TREE_CODE_CLASS (TREE_CODE (node));
3138           if (((code == '1') || (code == '2') || (code == 'e'))
3139               && EXPR_WFL_LINECOL (node))
3140             return node;
3141           return NULL_TREE;
3142         }
3143     }
3144   return NULL_TREE;
3145 }
3146
3147 /* Issue a missing return statement error. Uses METHOD to figure the
3148    last line of the method the error occurs in.  */
3149
3150 static void
3151 missing_return_error (tree method)
3152 {
3153   EXPR_WFL_SET_LINECOL (wfl_operator, DECL_FUNCTION_LAST_LINE (method), -2);
3154   parse_error_context (wfl_operator, "Missing return statement");
3155 }
3156
3157 /* Issue an unreachable statement error. From NODE, find the next
3158    statement to report appropriately.  */
3159 static void
3160 unreachable_stmt_error (tree node)
3161 {
3162   /* Browse node to find the next expression node that has a WFL. Use
3163      the location to report the error */
3164   if (TREE_CODE (node) == COMPOUND_EXPR)
3165     node = find_expr_with_wfl (TREE_OPERAND (node, 1));
3166   else
3167     node = find_expr_with_wfl (node);
3168
3169   if (node)
3170     {
3171       EXPR_WFL_SET_LINECOL (wfl_operator, EXPR_WFL_LINENO (node), -2);
3172       parse_error_context (wfl_operator, "Unreachable statement");
3173     }
3174   else
3175     abort ();
3176 }
3177
3178 static int
3179 not_accessible_field_error (tree wfl, tree decl)
3180 {
3181   parse_error_context
3182     (wfl, "Can't access %s field `%s.%s' from `%s'",
3183      accessibility_string (get_access_flags_from_decl (decl)),
3184      GET_TYPE_NAME (DECL_CONTEXT (decl)),
3185      IDENTIFIER_POINTER (DECL_NAME (decl)),
3186      IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (current_class))));
3187   return 1;
3188 }
3189
3190 int
3191 java_report_errors (void)
3192 {
3193   if (java_error_count)
3194     fprintf (stderr, "%d error%s",
3195              java_error_count, (java_error_count == 1 ? "" : "s"));
3196   if (java_warning_count)
3197     fprintf (stderr, "%s%d warning%s", (java_error_count ? ", " : ""),
3198              java_warning_count, (java_warning_count == 1 ? "" : "s"));
3199   if (java_error_count || java_warning_count)
3200     putc ('\n', stderr);
3201   return java_error_count;
3202 }
3203
3204 static char *
3205 java_accstring_lookup (int flags)
3206 {
3207   static char buffer [80];
3208 #define COPY_RETURN(S) {strcpy (buffer, S); return buffer;}
3209
3210   /* Access modifier looked-up first for easier report on forbidden
3211      access. */
3212   if (flags & ACC_PUBLIC) COPY_RETURN ("public");
3213   if (flags & ACC_PRIVATE) COPY_RETURN ("private");
3214   if (flags & ACC_PROTECTED) COPY_RETURN ("protected");
3215   if (flags & ACC_STATIC) COPY_RETURN ("static");
3216   if (flags & ACC_FINAL) COPY_RETURN ("final");
3217   if (flags & ACC_SYNCHRONIZED) COPY_RETURN ("synchronized");
3218   if (flags & ACC_VOLATILE) COPY_RETURN ("volatile");
3219   if (flags & ACC_TRANSIENT) COPY_RETURN ("transient");
3220   if (flags & ACC_NATIVE) COPY_RETURN ("native");
3221   if (flags & ACC_INTERFACE) COPY_RETURN ("interface");
3222   if (flags & ACC_ABSTRACT) COPY_RETURN ("abstract");
3223
3224   buffer [0] = '\0';
3225   return buffer;
3226 #undef COPY_RETURN
3227 }
3228
3229 /* Returns a string denoting the accessibility of a class or a member as
3230    indicated by FLAGS.  We need a separate function from
3231    java_accstring_lookup, as the latter can return spurious "static", etc.
3232    if package-private access is defined (in which case none of the
3233    relevant access control bits in FLAGS is set).  */
3234
3235 static const char *
3236 accessibility_string (int flags)
3237 {
3238   if (flags & ACC_PRIVATE) return "private";
3239   if (flags & ACC_PROTECTED) return "protected";
3240   if (flags & ACC_PUBLIC) return "public";
3241
3242   return "package-private";
3243 }
3244
3245 /* Issuing error messages upon redefinition of classes, interfaces or
3246    variables. */
3247
3248 static void
3249 classitf_redefinition_error (const char *context, tree id, tree decl, tree cl)
3250 {
3251   parse_error_context (cl, "%s `%s' already defined in %s:%d",
3252                        context, IDENTIFIER_POINTER (id),
3253                        DECL_SOURCE_FILE (decl), DECL_SOURCE_LINE (decl));
3254   /* Here we should point out where its redefined. It's a unicode. FIXME */
3255 }
3256
3257 static void
3258 variable_redefinition_error (tree context, tree name, tree type, int line)
3259 {
3260   const char *type_name;
3261
3262   /* Figure a proper name for type. We might haven't resolved it */
3263   if (TREE_CODE (type) == POINTER_TYPE && !TREE_TYPE (type))
3264     type_name = IDENTIFIER_POINTER (TYPE_NAME (type));
3265   else
3266     type_name = lang_printable_name (type, 0);
3267
3268   parse_error_context (context,
3269                        "Variable `%s' is already defined in this method and was declared `%s %s' at line %d",
3270                        IDENTIFIER_POINTER (name),
3271                        type_name, IDENTIFIER_POINTER (name), line);
3272 }
3273
3274 /* If ANAME is terminated with `[]', it indicates an array. This
3275    function returns the number of `[]' found and if this number is
3276    greater than zero, it extracts the array type name and places it in
3277    the node pointed to by TRIMMED unless TRIMMED is null.  */
3278
3279 static int
3280 build_type_name_from_array_name (tree aname, tree *trimmed)
3281 {
3282   const char *name = IDENTIFIER_POINTER (aname);
3283   int len = IDENTIFIER_LENGTH (aname);
3284   int array_dims;
3285
3286   STRING_STRIP_BRACKETS (name, len, array_dims);
3287
3288   if (array_dims && trimmed)
3289     *trimmed = get_identifier_with_length (name, len);
3290
3291   return array_dims;
3292 }
3293
3294 static tree
3295 build_array_from_name (tree type, tree type_wfl, tree name, tree *ret_name)
3296 {
3297   int more_dims = 0;
3298
3299   /* Eventually get more dims */
3300   more_dims = build_type_name_from_array_name (name, &name);
3301
3302   /* If we have, then craft a new type for this variable */
3303   if (more_dims)
3304     {
3305       tree save = type;
3306
3307       /* If we have a pointer, use its type */
3308       if (TREE_CODE (type) == POINTER_TYPE)
3309         type = TREE_TYPE (type);
3310
3311       /* Building the first dimension of a primitive type uses this
3312          function */
3313       if (JPRIMITIVE_TYPE_P (type))
3314         {
3315           type = build_java_array_type (type, -1);
3316           more_dims--;
3317         }
3318       /* Otherwise, if we have a WFL for this type, use it (the type
3319          is already an array on an unresolved type, and we just keep
3320          on adding dimensions) */
3321       else if (type_wfl)
3322         {
3323           type = type_wfl;
3324           more_dims += build_type_name_from_array_name (TYPE_NAME (save),
3325                                                         NULL);
3326         }
3327
3328       /* Add all the dimensions */
3329       while (more_dims--)
3330         type = build_unresolved_array_type (type);
3331
3332       /* The type may have been incomplete in the first place */
3333       if (type_wfl)
3334         type = obtain_incomplete_type (type);
3335     }
3336
3337   if (ret_name)
3338     *ret_name = name;
3339   return type;
3340 }
3341
3342 /* Build something that the type identifier resolver will identify as
3343    being an array to an unresolved type. TYPE_WFL is a WFL on a
3344    identifier. */
3345
3346 static tree
3347 build_unresolved_array_type (tree type_or_wfl)
3348 {
3349   const char *ptr;
3350   tree wfl;
3351
3352   /* TYPE_OR_WFL might be an array on a resolved type. In this case,
3353      just create a array type */
3354   if (TREE_CODE (type_or_wfl) == RECORD_TYPE)
3355     return build_java_array_type (type_or_wfl, -1);
3356
3357   obstack_grow (&temporary_obstack,
3358                  IDENTIFIER_POINTER (EXPR_WFL_NODE (type_or_wfl)),
3359                  IDENTIFIER_LENGTH (EXPR_WFL_NODE (type_or_wfl)));
3360   obstack_grow0 (&temporary_obstack, "[]", 2);
3361   ptr = obstack_finish (&temporary_obstack);
3362   wfl = build_expr_wfl (get_identifier (ptr),
3363                         EXPR_WFL_FILENAME (type_or_wfl),
3364                         EXPR_WFL_LINENO (type_or_wfl),
3365                         EXPR_WFL_COLNO (type_or_wfl));
3366   /* Re-install the existing qualifications so that the type can be
3367      resolved properly. */
3368   EXPR_WFL_QUALIFICATION (wfl) = EXPR_WFL_QUALIFICATION (type_or_wfl);
3369   return wfl;
3370 }
3371
3372 static void
3373 parser_add_interface (tree class_decl, tree interface_decl, tree wfl)
3374 {
3375   if (maybe_add_interface (TREE_TYPE (class_decl), TREE_TYPE (interface_decl)))
3376     parse_error_context (wfl, "Interface `%s' repeated",
3377                          IDENTIFIER_POINTER (DECL_NAME (interface_decl)));
3378 }
3379
3380 /* Bulk of common class/interface checks. Return 1 if an error was
3381    encountered. TAG is 0 for a class, 1 for an interface.  */
3382
3383 static int
3384 check_class_interface_creation (int is_interface, int flags, tree raw_name,
3385                                 tree qualified_name, tree decl, tree cl)
3386 {
3387   tree node;
3388   int sca = 0;                  /* Static class allowed */
3389   int icaf = 0;                 /* Inner class allowed flags */
3390   int uaaf = CLASS_MODIFIERS;   /* Usually allowed access flags */
3391
3392   if (!quiet_flag)
3393     fprintf (stderr, " %s%s %s",
3394              (CPC_INNER_P () ? "inner" : ""),
3395              (is_interface ? "interface" : "class"),
3396              IDENTIFIER_POINTER (qualified_name));
3397
3398   /* Scope of an interface/class type name:
3399        - Can't be imported by a single type import
3400        - Can't already exists in the package */
3401   if (IS_A_SINGLE_IMPORT_CLASSFILE_NAME_P (raw_name)
3402       && (node = find_name_in_single_imports (raw_name))
3403       && !CPC_INNER_P ())
3404     {
3405       parse_error_context
3406         (cl, "%s name `%s' clashes with imported type `%s'",
3407          (is_interface ? "Interface" : "Class"),
3408          IDENTIFIER_POINTER (raw_name), IDENTIFIER_POINTER (node));
3409       return 1;
3410     }
3411   if (decl && CLASS_COMPLETE_P (decl))
3412     {
3413       classitf_redefinition_error ((is_interface ? "Interface" : "Class"),
3414                                    qualified_name, decl, cl);
3415       return 1;
3416     }
3417
3418   if (check_inner_class_redefinition (raw_name, cl))
3419     return 1;
3420
3421   /* If public, file name should match class/interface name, except
3422      when dealing with an inner class */
3423   if (!CPC_INNER_P () && (flags & ACC_PUBLIC ))
3424     {
3425       const char *f;
3426
3427       for (f = &input_filename [strlen (input_filename)];
3428            f != input_filename && ! IS_DIR_SEPARATOR (f[0]);
3429            f--)
3430         ;
3431       if (IS_DIR_SEPARATOR (f[0]))
3432         f++;
3433       if (strncmp (IDENTIFIER_POINTER (raw_name),
3434                    f , IDENTIFIER_LENGTH (raw_name)) ||
3435           f [IDENTIFIER_LENGTH (raw_name)] != '.')
3436         parse_error_context
3437           (cl, "Public %s `%s' must be defined in a file called `%s.java'",
3438                              (is_interface ? "interface" : "class"),
3439                              IDENTIFIER_POINTER (qualified_name),
3440                              IDENTIFIER_POINTER (raw_name));
3441     }
3442
3443   /* Static classes can be declared only in top level classes. Note:
3444      once static, a inner class is a top level class. */
3445   if (flags & ACC_STATIC)
3446     {
3447       /* Catch the specific error of declaring an class inner class
3448          with no toplevel enclosing class. Prevent check_modifiers from
3449          complaining a second time */
3450       if (CPC_INNER_P () && !TOPLEVEL_CLASS_DECL_P (GET_CPC()))
3451         {
3452           parse_error_context (cl, "Inner class `%s' can't be static. Static classes can only occur in interfaces and top-level classes",
3453                                IDENTIFIER_POINTER (qualified_name));
3454           sca = ACC_STATIC;
3455         }
3456       /* Else, in the context of a top-level class declaration, let
3457          `check_modifiers' do its job, otherwise, give it a go */
3458       else
3459         sca = (GET_CPC_LIST () ? ACC_STATIC : 0);
3460     }
3461
3462   /* Inner classes can be declared private or protected
3463      within their enclosing classes. */
3464   if (CPC_INNER_P ())
3465     {
3466       /* A class which is local to a block can't be public, private,
3467          protected or static. But it is created final, so allow this
3468          one. */
3469       if (current_function_decl)
3470         icaf = sca = uaaf = ACC_FINAL;
3471       else
3472         {
3473           check_modifiers_consistency (flags);
3474           icaf = ACC_PROTECTED;
3475           if (! CLASS_INTERFACE (GET_CPC ()))
3476             icaf |= ACC_PRIVATE;
3477         }
3478     }
3479
3480   if (is_interface)
3481     {
3482       if (CPC_INNER_P ())
3483         uaaf = INTERFACE_INNER_MODIFIERS;
3484       else
3485         uaaf = INTERFACE_MODIFIERS;
3486
3487       check_modifiers ("Illegal modifier `%s' for interface declaration",
3488                        flags, uaaf);
3489     }
3490   else
3491     check_modifiers ((current_function_decl ?
3492                       "Illegal modifier `%s' for local class declaration" :
3493                       "Illegal modifier `%s' for class declaration"),
3494                      flags, uaaf|sca|icaf);
3495   return 0;
3496 }
3497
3498 /* Construct a nested class name.  If the final component starts with
3499    a digit, return true.  Otherwise return false.  */
3500 static int
3501 make_nested_class_name (tree cpc_list)
3502 {
3503   tree name;
3504
3505   if (!cpc_list)
3506     return 0;
3507
3508   make_nested_class_name (TREE_CHAIN (cpc_list));
3509
3510   /* Pick the qualified name when dealing with the first upmost
3511      enclosing class */
3512   name = (TREE_CHAIN (cpc_list)
3513           ? TREE_PURPOSE (cpc_list) : DECL_NAME (TREE_VALUE (cpc_list)));
3514   obstack_grow (&temporary_obstack,
3515                 IDENTIFIER_POINTER (name), IDENTIFIER_LENGTH (name));
3516   obstack_1grow (&temporary_obstack, '$');
3517
3518   return ISDIGIT (IDENTIFIER_POINTER (name)[0]);
3519 }
3520
3521 /* Can't redefine a class already defined in an earlier scope. */
3522
3523 static int
3524 check_inner_class_redefinition (tree raw_name, tree cl)
3525 {
3526   tree scope_list;
3527
3528   for (scope_list = GET_CPC_LIST (); scope_list;
3529        scope_list = GET_NEXT_ENCLOSING_CPC (scope_list))
3530     if (raw_name == GET_CPC_UN_NODE (scope_list))
3531       {
3532         parse_error_context
3533           (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",
3534            IDENTIFIER_POINTER (raw_name));
3535         return 1;
3536       }
3537   return 0;
3538 }
3539
3540 /* Tries to find a decl for CLASS_TYPE within ENCLOSING. If we fail,
3541    we remember ENCLOSING and SUPER.  */
3542
3543 static tree
3544 resolve_inner_class (htab_t circularity_hash, tree cl, tree *enclosing,
3545                      tree *super, tree class_type)
3546 {
3547   tree local_enclosing = *enclosing;
3548   tree local_super = NULL_TREE;
3549
3550   while (local_enclosing)
3551     {
3552       tree intermediate, decl;
3553
3554       *htab_find_slot (circularity_hash, local_enclosing, INSERT) =
3555         local_enclosing;
3556
3557       if ((decl = find_as_inner_class (local_enclosing, class_type, cl)))
3558         return decl;
3559
3560       intermediate = local_enclosing;
3561       /* Explore enclosing contexts. */
3562       while (INNER_CLASS_DECL_P (intermediate))
3563         {
3564           intermediate = DECL_CONTEXT (intermediate);
3565           if ((decl = find_as_inner_class (intermediate, class_type, cl)))
3566             return decl;
3567         }
3568
3569       /* Now go to the upper classes, bail out if necessary.  We will
3570          analyze the returned SUPER and act accordingly (see
3571          do_resolve_class).  */
3572       if (JPRIMITIVE_TYPE_P (TREE_TYPE (local_enclosing))
3573           || TREE_TYPE (local_enclosing) == void_type_node)
3574         {
3575           parse_error_context (cl, "Qualifier must be a reference");
3576           local_enclosing = NULL_TREE;
3577           break;
3578         }
3579       local_super = CLASSTYPE_SUPER (TREE_TYPE (local_enclosing));
3580       if (!local_super || local_super == object_type_node)
3581         break;
3582
3583       if (TREE_CODE (local_super) == POINTER_TYPE)
3584         local_super = do_resolve_class (NULL, local_super, NULL, NULL);
3585       else
3586         local_super = TYPE_NAME (local_super);
3587
3588       /* We may not have checked for circular inheritance yet, so do so
3589          here to prevent an infinite loop. */
3590       if (htab_find (circularity_hash, local_super) != NULL)
3591         {
3592           if (!cl)
3593             cl = lookup_cl (local_enclosing);
3594
3595           parse_error_context
3596             (cl, "Cyclic inheritance involving %s",
3597              IDENTIFIER_POINTER (DECL_NAME (local_enclosing)));
3598           local_enclosing = NULL_TREE;
3599         }
3600       else
3601         local_enclosing = local_super;
3602     }
3603
3604   /* We failed. Return LOCAL_SUPER and LOCAL_ENCLOSING. */
3605   *super = local_super;
3606   *enclosing = local_enclosing;
3607
3608   return NULL_TREE;
3609 }
3610
3611 /* Within ENCLOSING, find a decl for NAME and return it. NAME can be
3612    qualified. */
3613
3614 static tree
3615 find_as_inner_class (tree enclosing, tree name, tree cl)
3616 {
3617   tree qual, to_return;
3618   if (!enclosing)
3619     return NULL_TREE;
3620
3621   name = TYPE_NAME (name);
3622
3623   /* First search: within the scope of `enclosing', search for name */
3624   if (QUALIFIED_P (name) && cl && EXPR_WFL_NODE (cl) == name)
3625     qual = EXPR_WFL_QUALIFICATION (cl);
3626   else if (cl)
3627     qual = build_tree_list (cl, NULL_TREE);
3628   else
3629     qual = build_tree_list (build_expr_wfl (name, NULL, 0, 0), NULL_TREE);
3630
3631   if ((to_return = find_as_inner_class_do (qual, enclosing)))
3632     return to_return;
3633
3634   /* We're dealing with a qualified name. Try to resolve thing until
3635      we get something that is an enclosing class. */
3636   if (QUALIFIED_P (name) && cl && EXPR_WFL_NODE (cl) == name)
3637     {
3638       tree acc = NULL_TREE, decl = NULL_TREE, ptr;
3639
3640       for (qual = EXPR_WFL_QUALIFICATION (cl); qual && !decl;
3641            qual = TREE_CHAIN (qual))
3642         {
3643           acc = merge_qualified_name (acc,
3644                                       EXPR_WFL_NODE (TREE_PURPOSE (qual)));
3645           BUILD_PTR_FROM_NAME (ptr, acc);
3646           decl = do_resolve_class (NULL_TREE, ptr, NULL_TREE, cl);
3647         }
3648
3649       /* A NULL qual and a decl means that the search ended
3650          successfully?!? We have to do something then. FIXME */
3651
3652       if (decl)
3653         enclosing = decl;
3654       else
3655         qual = EXPR_WFL_QUALIFICATION (cl);
3656     }
3657   /* Otherwise, create a qual for the other part of the resolution. */
3658   else
3659     qual = build_tree_list (build_expr_wfl (name, NULL, 0, 0), NULL_TREE);
3660
3661   return find_as_inner_class_do (qual, enclosing);
3662 }
3663
3664 /* We go inside the list of sub classes and try to find a way
3665    through. */
3666
3667 static tree
3668 find_as_inner_class_do (tree qual, tree enclosing)
3669 {
3670   if (!qual)
3671     return NULL_TREE;
3672
3673   for (; qual && enclosing; qual = TREE_CHAIN (qual))
3674     {
3675       tree name_to_match = EXPR_WFL_NODE (TREE_PURPOSE (qual));
3676       tree next_enclosing = NULL_TREE;
3677       tree inner_list;
3678
3679       for (inner_list = DECL_INNER_CLASS_LIST (enclosing);
3680            inner_list; inner_list = TREE_CHAIN (inner_list))
3681         {
3682           if (TREE_VALUE (inner_list) == name_to_match)
3683             {
3684               next_enclosing = TREE_PURPOSE (inner_list);
3685               break;
3686             }
3687         }
3688       enclosing = next_enclosing;
3689     }
3690
3691   return (!qual && enclosing ? enclosing : NULL_TREE);
3692 }
3693
3694 static void
3695 link_nested_class_to_enclosing (void)
3696 {
3697   if (GET_ENCLOSING_CPC ())
3698     {
3699       tree enclosing = GET_ENCLOSING_CPC_CONTEXT ();
3700       DECL_INNER_CLASS_LIST (enclosing) =
3701         tree_cons (GET_CPC (), GET_CPC_UN (),
3702                    DECL_INNER_CLASS_LIST (enclosing));
3703     }
3704 }
3705
3706 static tree
3707 maybe_make_nested_class_name (tree name)
3708 {
3709   tree id = NULL_TREE;
3710
3711   if (CPC_INNER_P ())
3712     {
3713       /* If we're in a function, we must append a number to create the
3714          nested class name.  However, we don't do this if the class we
3715          are constructing is anonymous, because in that case we'll
3716          already have a number as the class name.  */
3717       if (! make_nested_class_name (GET_CPC_LIST ())
3718           && current_function_decl != NULL_TREE
3719           && ! ISDIGIT (IDENTIFIER_POINTER (name)[0]))
3720         {
3721           char buf[10];
3722           sprintf (buf, "%d", anonymous_class_counter);
3723           ++anonymous_class_counter;
3724           obstack_grow (&temporary_obstack, buf, strlen (buf));
3725           obstack_1grow (&temporary_obstack, '$');
3726         }
3727       obstack_grow0 (&temporary_obstack,
3728                      IDENTIFIER_POINTER (name),
3729                      IDENTIFIER_LENGTH (name));
3730       id = get_identifier (obstack_finish (&temporary_obstack));
3731       if (ctxp->package)
3732         QUALIFIED_P (id) = 1;
3733     }
3734   return id;
3735 }
3736
3737 /* If DECL is NULL, create and push a new DECL, record the current
3738    line CL and do other maintenance things.  */
3739
3740 static tree
3741 maybe_create_class_interface_decl (tree decl, tree raw_name,
3742                                    tree qualified_name, tree cl)
3743 {
3744   if (!decl)
3745     decl = push_class (make_class (), qualified_name);
3746
3747   /* Take care of the file and line business */
3748   DECL_SOURCE_FILE (decl) = EXPR_WFL_FILENAME (cl);
3749   /* If we're emitting xrefs, store the line/col number information */
3750   if (flag_emit_xref)
3751     DECL_SOURCE_LINE (decl) = EXPR_WFL_LINECOL (cl);
3752   else
3753     DECL_SOURCE_LINE (decl) = EXPR_WFL_LINENO (cl);
3754   CLASS_FROM_SOURCE_P (TREE_TYPE (decl)) = 1;
3755   CLASS_PARSED_P (TREE_TYPE (decl)) = 1;
3756   CLASS_FROM_CURRENTLY_COMPILED_P (TREE_TYPE (decl)) =
3757     IS_A_COMMAND_LINE_FILENAME_P (EXPR_WFL_FILENAME_NODE (cl));
3758
3759   PUSH_CPC (decl, raw_name);
3760   DECL_CONTEXT (decl) = GET_ENCLOSING_CPC_CONTEXT ();
3761
3762   /* Link the declaration to the already seen ones */
3763   TREE_CHAIN (decl) = ctxp->class_list;
3764   ctxp->class_list = decl;
3765
3766   /* Create a new nodes in the global lists */
3767   gclass_list = tree_cons (NULL_TREE, decl, gclass_list);
3768   all_class_list = tree_cons (NULL_TREE, decl, all_class_list);
3769
3770   /* Install a new dependency list element */
3771   create_jdep_list (ctxp);
3772
3773   SOURCE_FRONTEND_DEBUG (("Defining class/interface %s",
3774                           IDENTIFIER_POINTER (qualified_name)));
3775   return decl;
3776 }
3777
3778 static void
3779 add_superinterfaces (tree decl, tree interface_list)
3780 {
3781   tree node;
3782   /* Superinterface(s): if present and defined, parser_check_super_interface ()
3783      takes care of ensuring that:
3784        - This is an accessible interface type,
3785        - Circularity detection.
3786    parser_add_interface is then called. If present but not defined,
3787    the check operation is delayed until the super interface gets
3788    defined.  */
3789   for (node = interface_list; node; node = TREE_CHAIN (node))
3790     {
3791       tree current = TREE_PURPOSE (node);
3792       tree idecl = IDENTIFIER_CLASS_VALUE (EXPR_WFL_NODE (current));
3793       if (idecl && CLASS_LOADED_P (TREE_TYPE (idecl)))
3794         {
3795           if (!parser_check_super_interface (idecl, decl, current))
3796             parser_add_interface (decl, idecl, current);
3797         }
3798       else
3799         register_incomplete_type (JDEP_INTERFACE,
3800                                   current, decl, NULL_TREE);
3801     }
3802 }
3803
3804 /* Create an interface in pass1 and return its decl. Return the
3805    interface's decl in pass 2.  */
3806
3807 static tree
3808 create_interface (int flags, tree id, tree super)
3809 {
3810   tree raw_name = EXPR_WFL_NODE (id);
3811   tree q_name = parser_qualified_classname (raw_name);
3812   tree decl = IDENTIFIER_CLASS_VALUE (q_name);
3813
3814   /* Certain syntax errors are making SUPER be like ID. Avoid this
3815      case. */
3816   if (ctxp->class_err && id == super)
3817     super = NULL;
3818
3819   EXPR_WFL_NODE (id) = q_name;  /* Keep source location, even if refined. */
3820
3821   /* Basic checks: scope, redefinition, modifiers */
3822   if (check_class_interface_creation (1, flags, raw_name, q_name, decl, id))
3823     {
3824       PUSH_ERROR ();
3825       return NULL_TREE;
3826     }
3827
3828   /* Suspend the current parsing context if we're parsing an inner
3829      interface */
3830   if (CPC_INNER_P ())
3831     {
3832       java_parser_context_suspend ();
3833       /* Interface members are public. */
3834       if (CLASS_INTERFACE (GET_CPC ()))
3835         flags |= ACC_PUBLIC;
3836     }
3837
3838   /* Push a new context for (static) initialized upon declaration fields */
3839   java_parser_context_push_initialized_field ();
3840
3841   /* Interface modifiers check
3842        - public/abstract allowed (already done at that point)
3843        - abstract is obsolete (comes first, it's a warning, or should be)
3844        - Can't use twice the same (checked in the modifier rule) */
3845   if ((flags & ACC_ABSTRACT) && flag_redundant)
3846     parse_warning_context
3847       (MODIFIER_WFL (ABSTRACT_TK),
3848        "Redundant use of `abstract' modifier. Interface `%s' is implicitly abstract", IDENTIFIER_POINTER (raw_name));
3849
3850   /* Create a new decl if DECL is NULL, otherwise fix it */
3851   decl = maybe_create_class_interface_decl (decl, raw_name, q_name, id);
3852
3853   /* Interfaces are always abstract. */
3854   flags |= ACC_ABSTRACT;
3855
3856   /* Inner interfaces are always static.  */
3857   if (INNER_CLASS_DECL_P (decl))
3858     flags |= ACC_STATIC;
3859
3860   /* Set super info and mark the class a complete */
3861   set_super_info (ACC_INTERFACE | flags, TREE_TYPE (decl),
3862                   object_type_node, ctxp->interface_number);
3863   ctxp->interface_number = 0;
3864   CLASS_COMPLETE_P (decl) = 1;
3865   add_superinterfaces (decl, super);
3866
3867   /* Eventually sets the @deprecated tag flag */
3868   CHECK_DEPRECATED (decl);
3869
3870   return decl;
3871 }
3872
3873 /* Patch anonymous class CLASS, by either extending or implementing
3874    DEP.  */
3875
3876 static void
3877 patch_anonymous_class (tree type_decl, tree class_decl, tree wfl)
3878 {
3879   tree class = TREE_TYPE (class_decl);
3880   tree type =  TREE_TYPE (type_decl);
3881   tree binfo = TYPE_BINFO (class);
3882
3883   /* If it's an interface, implement it */
3884   if (CLASS_INTERFACE (type_decl))
3885     {
3886       tree s_binfo;
3887       int length;
3888
3889       if (parser_check_super_interface (type_decl, class_decl, wfl))
3890         return;
3891
3892       s_binfo = TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO (class)), 0);
3893       length = TREE_VEC_LENGTH (TYPE_BINFO_BASETYPES (class))+1;
3894       TYPE_BINFO_BASETYPES (class) = make_tree_vec (length);
3895       TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO (class)), 0) = s_binfo;
3896       /* And add the interface */
3897       parser_add_interface (class_decl, type_decl, wfl);
3898     }
3899   /* Otherwise, it's a type we want to extend */
3900   else
3901     {
3902       if (parser_check_super (type_decl, class_decl, wfl))
3903         return;
3904       BINFO_TYPE (TREE_VEC_ELT (BINFO_BASETYPES (binfo), 0)) = type;
3905     }
3906 }
3907
3908 static tree
3909 create_anonymous_class (int location, tree type_name)
3910 {
3911   char buffer [80];
3912   tree super = NULL_TREE, itf = NULL_TREE;
3913   tree id, type_decl, class;
3914
3915   /* The unqualified name of the anonymous class. It's just a number. */
3916   sprintf (buffer, "%d", anonymous_class_counter++);
3917   id = build_wfl_node (get_identifier (buffer));
3918   EXPR_WFL_LINECOL (id) = location;
3919
3920   /* We know about the type to extend/implement. We go ahead */
3921   if ((type_decl = IDENTIFIER_CLASS_VALUE (EXPR_WFL_NODE (type_name))))
3922     {
3923       /* Create a class which either implements on extends the designated
3924          class. The class bears an inaccessible name. */
3925       if (CLASS_INTERFACE (type_decl))
3926         {
3927           /* It's OK to modify it here. It's been already used and
3928              shouldn't be reused */
3929           ctxp->interface_number = 1;
3930           /* Interfaces should presented as a list of WFLs */
3931           itf = build_tree_list (type_name, NULL_TREE);
3932         }
3933       else
3934         super = type_name;
3935     }
3936
3937   class = create_class (ACC_FINAL, id, super, itf);
3938
3939   /* We didn't know anything about the stuff. We register a dependence. */
3940   if (!type_decl)
3941     register_incomplete_type (JDEP_ANONYMOUS, type_name, class, NULL_TREE);
3942
3943   ANONYMOUS_CLASS_P (TREE_TYPE (class)) = 1;
3944   return class;
3945 }
3946
3947 /* Create a class in pass1 and return its decl. Return class
3948    interface's decl in pass 2.  */
3949
3950 static tree
3951 create_class (int flags, tree id, tree super, tree interfaces)
3952 {
3953   tree raw_name = EXPR_WFL_NODE (id);
3954   tree class_id, decl;
3955   tree super_decl_type;
3956
3957   /* Certain syntax errors are making SUPER be like ID. Avoid this
3958      case. */
3959   if (ctxp->class_err && id == super)
3960     super = NULL;
3961
3962   class_id = parser_qualified_classname (raw_name);
3963   decl = IDENTIFIER_CLASS_VALUE (class_id);
3964   EXPR_WFL_NODE (id) = class_id;
3965
3966   /* Basic check: scope, redefinition, modifiers */
3967   if (check_class_interface_creation (0, flags, raw_name, class_id, decl, id))
3968     {
3969       PUSH_ERROR ();
3970       return NULL_TREE;
3971     }
3972
3973   /* Suspend the current parsing context if we're parsing an inner
3974      class or an anonymous class. */
3975   if (CPC_INNER_P ())
3976     {
3977       java_parser_context_suspend ();
3978       /* Interface members are public. */
3979       if (CLASS_INTERFACE (GET_CPC ()))
3980         flags |= ACC_PUBLIC;
3981     }
3982
3983   /* Push a new context for (static) initialized upon declaration fields */
3984   java_parser_context_push_initialized_field ();
3985
3986   /* Class modifier check:
3987        - Allowed modifier (already done at that point)
3988        - abstract AND final forbidden
3989        - Public classes defined in the correct file */
3990   if ((flags & ACC_ABSTRACT) && (flags & ACC_FINAL))
3991     parse_error_context
3992       (id, "Class `%s' can't be declared both abstract and final",
3993        IDENTIFIER_POINTER (raw_name));
3994
3995   /* Create a new decl if DECL is NULL, otherwise fix it */
3996   decl = maybe_create_class_interface_decl (decl, raw_name, class_id, id);
3997
3998   /* If SUPER exists, use it, otherwise use Object */
3999   if (super)
4000     {
4001       /* java.lang.Object can't extend anything.  */
4002       if (TREE_TYPE (IDENTIFIER_CLASS_VALUE (class_id)) == object_type_node)
4003         {
4004           parse_error_context (id, "`java.lang.Object' can't extend anything");
4005           return NULL_TREE;
4006         }
4007
4008       super_decl_type =
4009         register_incomplete_type (JDEP_SUPER, super, decl, NULL_TREE);
4010     }
4011   else if (TREE_TYPE (decl) != object_type_node)
4012     super_decl_type = object_type_node;
4013   /* We're defining java.lang.Object */
4014   else
4015     super_decl_type = NULL_TREE;
4016
4017   /* A class nested in an interface is implicitly static. */
4018   if (INNER_CLASS_DECL_P (decl)
4019       && CLASS_INTERFACE (TYPE_NAME (TREE_TYPE (DECL_CONTEXT (decl)))))
4020     {
4021       flags |= ACC_STATIC;
4022     }
4023
4024   /* Set super info and mark the class as complete. */
4025   set_super_info (flags, TREE_TYPE (decl), super_decl_type,
4026                   ctxp->interface_number);
4027   ctxp->interface_number = 0;
4028   CLASS_COMPLETE_P (decl) = 1;
4029   add_superinterfaces (decl, interfaces);
4030
4031   /* TYPE_VFIELD' is a compiler-generated field used to point to
4032      virtual function tables.  In gcj, every class has a common base
4033      virtual function table in java.lang.object.  */
4034   TYPE_VFIELD (TREE_TYPE (decl)) = TYPE_VFIELD (object_type_node);
4035
4036   /* Add the private this$<n> field, Replicate final locals still in
4037      scope as private final fields mangled like val$<local_name>.
4038      This doesn't not occur for top level (static) inner classes. */
4039   if (PURE_INNER_CLASS_DECL_P (decl))
4040     add_inner_class_fields (decl, current_function_decl);
4041
4042   /* If doing xref, store the location at which the inherited class
4043      (if any) was seen. */
4044   if (flag_emit_xref && super)
4045     DECL_INHERITED_SOURCE_LINE (decl) = EXPR_WFL_LINECOL (super);
4046
4047   /* Eventually sets the @deprecated tag flag */
4048   CHECK_DEPRECATED (decl);
4049
4050   /* Reset the anonymous class counter when declaring non inner classes */
4051   if (!INNER_CLASS_DECL_P (decl))
4052     anonymous_class_counter = 1;
4053
4054   return decl;
4055 }
4056
4057 /* End a class declaration: register the statements used to create
4058    finit$ and <clinit>, pop the current class and resume the prior
4059    parser context if necessary.  */
4060
4061 static void
4062 end_class_declaration (int resume)
4063 {
4064   /* If an error occurred, context weren't pushed and won't need to be
4065      popped by a resume. */
4066   int no_error_occurred = ctxp->next && GET_CPC () != error_mark_node;
4067
4068   if (GET_CPC () != error_mark_node)
4069     dump_java_tree (TDI_class, GET_CPC ());
4070
4071   java_parser_context_pop_initialized_field ();
4072   POP_CPC ();
4073   if (resume && no_error_occurred)
4074     java_parser_context_resume ();
4075
4076   /* We're ending a class declaration, this is a good time to reset
4077      the interface cout. Note that might have been already done in
4078      create_interface, but if at that time an inner class was being
4079      dealt with, the interface count was reset in a context created
4080      for the sake of handling inner classes declaration. */
4081   ctxp->interface_number = 0;
4082 }
4083
4084 static void
4085 add_inner_class_fields (tree class_decl, tree fct_decl)
4086 {
4087   tree block, marker, f;
4088
4089   f = add_field (TREE_TYPE (class_decl),
4090                  build_current_thisn (TREE_TYPE (class_decl)),
4091                  build_pointer_type (TREE_TYPE (DECL_CONTEXT (class_decl))),
4092                  ACC_PRIVATE);
4093   FIELD_THISN (f) = 1;
4094
4095   if (!fct_decl)
4096     return;
4097
4098   for (block = GET_CURRENT_BLOCK (fct_decl);
4099        block && TREE_CODE (block) == BLOCK; block = BLOCK_SUPERCONTEXT (block))
4100     {
4101       tree decl;
4102       for (decl = BLOCK_EXPR_DECLS (block); decl; decl = TREE_CHAIN (decl))
4103         {
4104           tree name, pname;
4105           tree wfl, init, list;
4106
4107           /* Avoid non final arguments. */
4108           if (!LOCAL_FINAL_P (decl))
4109             continue;
4110
4111           MANGLE_OUTER_LOCAL_VARIABLE_NAME (name, DECL_NAME (decl));
4112           MANGLE_ALIAS_INITIALIZER_PARAMETER_NAME_ID (pname, DECL_NAME (decl));
4113           wfl = build_wfl_node (name);
4114           init = build_wfl_node (pname);
4115           /* Build an initialization for the field: it will be
4116              initialized by a parameter added to finit$, bearing a
4117              mangled name of the field itself (param$<n>.) The
4118              parameter is provided to finit$ by the constructor
4119              invoking it (hence the constructor will also feature a
4120              hidden parameter, set to the value of the outer context
4121              local at the time the inner class is created.)
4122
4123              Note: we take into account all possible locals that can
4124              be accessed by the inner class. It's actually not trivial
4125              to minimize these aliases down to the ones really
4126              used. One way to do that would be to expand all regular
4127              methods first, then finit$ to get a picture of what's
4128              used.  It works with the exception that we would have to
4129              go back on all constructor invoked in regular methods to
4130              have their invocation reworked (to include the right amount
4131              of alias initializer parameters.)
4132
4133              The only real way around, I think, is a first pass to
4134              identify locals really used in the inner class. We leave
4135              the flag FIELD_LOCAL_ALIAS_USED around for that future
4136              use.
4137
4138              On the other hand, it only affect local inner classes,
4139              whose constructors (and finit$ call) will be featuring
4140              unnecessary arguments. It's easy for a developer to keep
4141              this number of parameter down by using the `final'
4142              keyword only when necessary. For the time being, we can
4143              issue a warning on unnecessary finals. FIXME */
4144           init = build_assignment (ASSIGN_TK, EXPR_WFL_LINECOL (wfl),
4145                                    wfl, init);
4146
4147           /* Register the field. The TREE_LIST holding the part
4148              initialized/initializer will be marked ARG_FINAL_P so
4149              that the created field can be marked
4150              FIELD_LOCAL_ALIAS. */
4151           list = build_tree_list (wfl, init);
4152           ARG_FINAL_P (list) = 1;
4153           register_fields (ACC_PRIVATE | ACC_FINAL, TREE_TYPE (decl), list);
4154         }
4155     }
4156
4157   if (!CPC_INITIALIZER_STMT (ctxp))
4158     return;
4159
4160   /* If we ever registered an alias field, insert and marker to
4161      remember where the list ends. The second part of the list (the one
4162      featuring initialized fields) so it can be later reversed to
4163      enforce 8.5. The marker will be removed during that operation. */
4164   marker = build_tree_list (NULL_TREE, NULL_TREE);
4165   TREE_CHAIN (marker) = CPC_INITIALIZER_STMT (ctxp);
4166   SET_CPC_INITIALIZER_STMT (ctxp, marker);
4167 }
4168
4169 /* Can't use lookup_field () since we don't want to load the class and
4170    can't set the CLASS_LOADED_P flag */
4171
4172 static tree
4173 find_field (tree class, tree name)
4174 {
4175   tree decl;
4176   for (decl = TYPE_FIELDS (class); decl; decl = TREE_CHAIN (decl))
4177     {
4178       if (DECL_NAME (decl) == name)
4179         return decl;
4180     }
4181   return NULL_TREE;
4182 }
4183
4184 /* Wrap around lookup_field that doesn't potentially upset the value
4185    of CLASS */
4186
4187 static tree
4188 lookup_field_wrapper (tree class, tree name)
4189 {
4190   tree type = class;
4191   tree decl = NULL_TREE;
4192   java_parser_context_save_global ();
4193
4194   /* Last chance: if we're within the context of an inner class, we
4195      might be trying to access a local variable defined in an outer
4196      context. We try to look for it now. */
4197   if (INNER_CLASS_TYPE_P (class) && TREE_CODE (name) == IDENTIFIER_NODE)
4198     {
4199       tree new_name;
4200       MANGLE_OUTER_LOCAL_VARIABLE_NAME (new_name, name);
4201       decl = lookup_field (&type, new_name);
4202       if (decl && decl != error_mark_node)
4203         FIELD_LOCAL_ALIAS_USED (decl) = 1;
4204     }
4205   if (!decl || decl == error_mark_node)
4206     {
4207       type = class;
4208       decl = lookup_field (&type, name);
4209     }
4210
4211   /* If the field still hasn't been found, try the next enclosing context. */
4212   if (!decl && INNER_CLASS_TYPE_P (class))
4213     {
4214       tree outer_type = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (class)));
4215       decl = lookup_field_wrapper (outer_type, name);
4216     }
4217
4218   java_parser_context_restore_global ();
4219   return decl == error_mark_node ? NULL : decl;
4220 }
4221
4222 /* Find duplicate field within the same class declarations and report
4223    the error. Returns 1 if a duplicated field was found, 0
4224    otherwise.  */
4225
4226 static int
4227 duplicate_declaration_error_p (tree new_field_name, tree new_type, tree cl)
4228 {
4229   /* This might be modified to work with method decl as well */
4230   tree decl = find_field (TREE_TYPE (GET_CPC ()), new_field_name);
4231   if (decl)
4232     {
4233       char *t1 = xstrdup (purify_type_name
4234                          ((TREE_CODE (new_type) == POINTER_TYPE
4235                            && TREE_TYPE (new_type) == NULL_TREE) ?
4236                           IDENTIFIER_POINTER (TYPE_NAME (new_type)) :
4237                           lang_printable_name (new_type, 1)));
4238       /* The type may not have been completed by the time we report
4239          the error */
4240       char *t2 = xstrdup (purify_type_name
4241                          ((TREE_CODE (TREE_TYPE (decl)) == POINTER_TYPE
4242                            && TREE_TYPE (TREE_TYPE (decl)) == NULL_TREE) ?
4243                           IDENTIFIER_POINTER (TYPE_NAME (TREE_TYPE (decl))) :
4244                           lang_printable_name (TREE_TYPE (decl), 1)));
4245       parse_error_context
4246         (cl , "Duplicate variable declaration: `%s %s' was `%s %s' (%s:%d)",
4247          t1, IDENTIFIER_POINTER (new_field_name),
4248          t2, IDENTIFIER_POINTER (DECL_NAME (decl)),
4249          DECL_SOURCE_FILE (decl), DECL_SOURCE_LINE (decl));
4250       free (t1);
4251       free (t2);
4252       return 1;
4253     }
4254   return 0;
4255 }
4256
4257 /* Field registration routine. If TYPE doesn't exist, field
4258    declarations are linked to the undefined TYPE dependency list, to
4259    be later resolved in java_complete_class () */
4260
4261 static void
4262 register_fields (int flags, tree type, tree variable_list)
4263 {
4264   tree current, saved_type;
4265   tree class_type = NULL_TREE;
4266   int saved_lineno = input_line;
4267   int must_chain = 0;
4268   tree wfl = NULL_TREE;
4269
4270   if (GET_CPC ())
4271     class_type = TREE_TYPE (GET_CPC ());
4272
4273   if (!class_type || class_type == error_mark_node)
4274     return;
4275
4276   /* If we're adding fields to interfaces, those fields are public,
4277      static, final */
4278   if (CLASS_INTERFACE (TYPE_NAME (class_type)))
4279     {
4280       OBSOLETE_MODIFIER_WARNING (MODIFIER_WFL (PUBLIC_TK),
4281                                  flags, ACC_PUBLIC, "interface field(s)");
4282       OBSOLETE_MODIFIER_WARNING (MODIFIER_WFL (STATIC_TK),
4283                                  flags, ACC_STATIC, "interface field(s)");
4284       OBSOLETE_MODIFIER_WARNING (MODIFIER_WFL (FINAL_TK),
4285                                  flags, ACC_FINAL, "interface field(s)");
4286       check_modifiers ("Illegal interface member modifier `%s'", flags,
4287                        INTERFACE_FIELD_MODIFIERS);
4288       flags |= (ACC_PUBLIC | ACC_STATIC | ACC_FINAL);
4289     }
4290
4291   /* Obtain a suitable type for resolution, if necessary */
4292   SET_TYPE_FOR_RESOLUTION (type, wfl, must_chain);
4293
4294   /* If TYPE is fully resolved and we don't have a reference, make one */
4295   PROMOTE_RECORD_IF_COMPLETE (type, must_chain);
4296
4297   for (current = variable_list, saved_type = type; current;
4298        current = TREE_CHAIN (current), type = saved_type)
4299     {
4300       tree real_type;
4301       tree field_decl;
4302       tree cl = TREE_PURPOSE (current);
4303       tree init = TREE_VALUE (current);
4304       tree current_name = EXPR_WFL_NODE (cl);
4305
4306       /* Can't declare non-final static fields in inner classes */
4307       if ((flags & ACC_STATIC) && !TOPLEVEL_CLASS_TYPE_P (class_type)
4308           && !(flags & ACC_FINAL))
4309         parse_error_context
4310           (cl, "Field `%s' can't be static in inner class `%s' unless it is final",
4311            IDENTIFIER_POINTER (EXPR_WFL_NODE (cl)),
4312            lang_printable_name (class_type, 0));
4313
4314       /* Process NAME, as it may specify extra dimension(s) for it */
4315       type = build_array_from_name (type, wfl, current_name, &current_name);
4316
4317       /* Type adjustment. We may have just readjusted TYPE because
4318          the variable specified more dimensions. Make sure we have
4319          a reference if we can and don't have one already. Also
4320          change the name if we have an init. */
4321       if (type != saved_type)
4322         {
4323           PROMOTE_RECORD_IF_COMPLETE (type, must_chain);
4324           if (init)
4325             EXPR_WFL_NODE (TREE_OPERAND (init, 0)) = current_name;
4326         }
4327
4328       real_type = GET_REAL_TYPE (type);
4329       /* Check for redeclarations */
4330       if (duplicate_declaration_error_p (current_name, real_type, cl))
4331         continue;
4332
4333       /* Set input_line to the line the field was found and create a
4334          declaration for it. Eventually sets the @deprecated tag flag. */
4335       if (flag_emit_xref)
4336         input_line = EXPR_WFL_LINECOL (cl);
4337       else
4338         input_line = EXPR_WFL_LINENO (cl);
4339       field_decl = add_field (class_type, current_name, real_type, flags);
4340       CHECK_DEPRECATED_NO_RESET (field_decl);
4341
4342       /* If the field denotes a final instance variable, then we
4343          allocate a LANG_DECL_SPECIFIC part to keep track of its
4344          initialization. We also mark whether the field was
4345          initialized upon its declaration. We don't do that if the
4346          created field is an alias to a final local. */
4347       if (!ARG_FINAL_P (current) && (flags & ACC_FINAL))
4348         {
4349           MAYBE_CREATE_VAR_LANG_DECL_SPECIFIC (field_decl);
4350           DECL_FIELD_FINAL_WFL (field_decl) = cl;
4351         }
4352
4353       /* If the couple initializer/initialized is marked ARG_FINAL_P,
4354          we mark the created field FIELD_LOCAL_ALIAS, so that we can
4355          hide parameters to this inner class finit$ and
4356          constructors. It also means that the field isn't final per
4357          say. */
4358       if (ARG_FINAL_P (current))
4359         {
4360           FIELD_LOCAL_ALIAS (field_decl) = 1;
4361           FIELD_FINAL (field_decl) = 0;
4362         }
4363
4364       /* Check if we must chain. */
4365       if (must_chain)
4366         register_incomplete_type (JDEP_FIELD, wfl, field_decl, type);
4367
4368       /* If we have an initialization value tied to the field */
4369       if (init)
4370         {
4371           /* The field is declared static */
4372           if (flags & ACC_STATIC)
4373             {
4374               /* We include the field and its initialization part into
4375                  a list used to generate <clinit>. After <clinit> is
4376                  walked, field initializations will be processed and
4377                  fields initialized with known constants will be taken
4378                  out of <clinit> and have their DECL_INITIAL set
4379                  appropriately. */
4380               TREE_CHAIN (init) = CPC_STATIC_INITIALIZER_STMT (ctxp);
4381               SET_CPC_STATIC_INITIALIZER_STMT (ctxp, init);
4382               if (TREE_OPERAND (init, 1)
4383                   && TREE_CODE (TREE_OPERAND (init, 1)) == NEW_ARRAY_INIT)
4384                 TREE_STATIC (TREE_OPERAND (init, 1)) = 1;
4385             }
4386           /* A non-static field declared with an immediate initialization is
4387              to be initialized in <init>, if any.  This field is remembered
4388              to be processed at the time of the generation of <init>. */
4389           else
4390             {
4391               TREE_CHAIN (init) = CPC_INITIALIZER_STMT (ctxp);
4392               SET_CPC_INITIALIZER_STMT (ctxp, init);
4393             }
4394           MODIFY_EXPR_FROM_INITIALIZATION_P (init) = 1;
4395           DECL_INITIAL (field_decl) = TREE_OPERAND (init, 1);
4396         }
4397     }
4398
4399   CLEAR_DEPRECATED;
4400   input_line = saved_lineno;
4401 }
4402
4403 /* Generate finit$, using the list of initialized fields to populate
4404    its body. finit$'s parameter(s) list is adjusted to include the
4405    one(s) used to initialized the field(s) caching outer context
4406    local(s).  */
4407
4408 static tree
4409 generate_finit (tree class_type)
4410 {
4411   int count = 0;
4412   tree list = TYPE_FINIT_STMT_LIST (class_type);
4413   tree mdecl, current, parms;
4414
4415   parms = build_alias_initializer_parameter_list (AIPL_FUNCTION_CREATION,
4416                                                   class_type, NULL_TREE,
4417                                                   &count);
4418   CRAFTED_PARAM_LIST_FIXUP (parms);
4419   mdecl = create_artificial_method (class_type, ACC_PRIVATE, void_type_node,
4420                                     finit_identifier_node, parms);
4421   fix_method_argument_names (parms, mdecl);
4422   layout_class_method (class_type, CLASSTYPE_SUPER (class_type),
4423                        mdecl, NULL_TREE);
4424   DECL_FUNCTION_NAP (mdecl) = count;
4425   start_artificial_method_body (mdecl);
4426
4427   for (current = list; current; current = TREE_CHAIN (current))
4428     java_method_add_stmt (mdecl,
4429                           build_debugable_stmt (EXPR_WFL_LINECOL (current),
4430                                                 current));
4431   end_artificial_method_body (mdecl);
4432   return mdecl;
4433 }
4434
4435 /* Generate a function to run the instance initialization code. The
4436    private method is called `instinit$'. Unless we're dealing with an
4437    anonymous class, we determine whether all ctors of CLASS_TYPE
4438    declare a checked exception in their `throws' clause in order to
4439    see whether it's necessary to encapsulate the instance initializer
4440    statements in a try/catch/rethrow sequence.  */
4441
4442 static tree
4443 generate_instinit (tree class_type)
4444 {
4445   tree current;
4446   tree compound = NULL_TREE;
4447   tree parms = tree_cons (this_identifier_node,
4448                           build_pointer_type (class_type), end_params_node);
4449   tree mdecl = create_artificial_method (class_type, ACC_PRIVATE,
4450                                          void_type_node,
4451                                          instinit_identifier_node, parms);
4452
4453   layout_class_method (class_type, CLASSTYPE_SUPER (class_type),
4454                        mdecl, NULL_TREE);
4455
4456   /* Gather all the statements in a compound */
4457   for (current = TYPE_II_STMT_LIST (class_type);
4458        current; current = TREE_CHAIN (current))
4459     compound = add_stmt_to_compound (compound, NULL_TREE, current);
4460
4461   /* We need to encapsulate COMPOUND by a try/catch statement to
4462      rethrow exceptions that might occur in the instance initializer.
4463      We do that only if all ctors of CLASS_TYPE are set to catch a
4464      checked exception. This doesn't apply to anonymous classes (since
4465      they don't have declared ctors.) */
4466   if (!ANONYMOUS_CLASS_P (class_type) &&
4467       ctors_unchecked_throws_clause_p (class_type))
4468     {
4469       compound = encapsulate_with_try_catch (0, exception_type_node, compound,
4470                                              build1 (THROW_EXPR, NULL_TREE,
4471                                                      build_wfl_node (wpv_id)));
4472       DECL_FUNCTION_THROWS (mdecl) = build_tree_list (NULL_TREE,
4473                                                       exception_type_node);
4474     }
4475
4476   start_artificial_method_body (mdecl);
4477   java_method_add_stmt (mdecl, compound);
4478   end_artificial_method_body (mdecl);
4479
4480   return mdecl;
4481 }
4482
4483 /* FIXME */
4484 static tree
4485 build_instinit_invocation (tree class_type)
4486 {
4487   tree to_return = NULL_TREE;
4488
4489   if (TYPE_II_STMT_LIST (class_type))
4490     {
4491       tree parm = build_tree_list (NULL_TREE,
4492                                    build_wfl_node (this_identifier_node));
4493       to_return =
4494         build_method_invocation (build_wfl_node (instinit_identifier_node),
4495                                  parm);
4496     }
4497   return to_return;
4498 }
4499
4500 /* Shared across method_declarator and method_header to remember the
4501    patch stage that was reached during the declaration of the method.
4502    A method DECL is built differently is there is no patch
4503    (JDEP_NO_PATCH) or a patch (JDEP_METHOD or JDEP_METHOD_RETURN)
4504    pending on the currently defined method.  */
4505
4506 static int patch_stage;
4507
4508 /* Check the method declaration and add the method to its current
4509    class.  If the argument list is known to contain incomplete types,
4510    the method is partially added and the registration will be resume
4511    once the method arguments resolved. If TYPE is NULL, we're dealing
4512    with a constructor.  */
4513
4514 static tree
4515 method_header (int flags, tree type, tree mdecl, tree throws)
4516 {
4517   tree type_wfl = NULL_TREE;
4518   tree meth_name = NULL_TREE;
4519   tree current, orig_arg, this_class = NULL;
4520   tree id, meth;
4521   int saved_lineno;
4522   int constructor_ok = 0, must_chain;
4523   int count;
4524
4525   if (mdecl == error_mark_node)
4526     return error_mark_node;
4527   meth = TREE_VALUE (mdecl);
4528   id = TREE_PURPOSE (mdecl);
4529
4530   check_modifiers_consistency (flags);
4531
4532   if (GET_CPC ())
4533     this_class = TREE_TYPE (GET_CPC ());
4534
4535   if (!this_class || this_class == error_mark_node)
4536     return NULL_TREE;
4537
4538   /* There are some forbidden modifiers for an abstract method and its
4539      class must be abstract as well.  */
4540   if (type && (flags & ACC_ABSTRACT))
4541     {
4542       ABSTRACT_CHECK (flags, ACC_PRIVATE, id, "Private");
4543       ABSTRACT_CHECK (flags, ACC_STATIC, id, "Static");
4544       ABSTRACT_CHECK (flags, ACC_FINAL, id, "Final");
4545       ABSTRACT_CHECK (flags, ACC_NATIVE, id, "Native");
4546       ABSTRACT_CHECK (flags, ACC_SYNCHRONIZED, id, "Synchronized");
4547       ABSTRACT_CHECK (flags, ACC_STRICT, id, "Strictfp");
4548       if (!CLASS_ABSTRACT (TYPE_NAME (this_class))
4549           && !CLASS_INTERFACE (TYPE_NAME (this_class)))
4550         parse_error_context
4551           (id, "Class `%s' must be declared abstract to define abstract method `%s'",
4552            IDENTIFIER_POINTER (DECL_NAME (GET_CPC ())),
4553            IDENTIFIER_POINTER (EXPR_WFL_NODE (id)));
4554     }
4555
4556   /* A native method can't be strictfp.  */
4557   if ((flags & ACC_NATIVE) && (flags & ACC_STRICT))
4558     parse_error_context (id, "native method `%s' can't be strictfp",
4559                          IDENTIFIER_POINTER (EXPR_WFL_NODE (id)));
4560   /* No such thing as a transient or volatile method.  */
4561   if ((flags & ACC_TRANSIENT))
4562     parse_error_context (id, "method `%s' can't be transient",
4563                          IDENTIFIER_POINTER (EXPR_WFL_NODE (id)));
4564   if ((flags & ACC_VOLATILE))
4565     parse_error_context (id, "method `%s' can't be volatile",
4566                          IDENTIFIER_POINTER (EXPR_WFL_NODE (id)));
4567
4568   /* Things to be checked when declaring a constructor */
4569   if (!type)
4570     {
4571       int ec = java_error_count;
4572       /* 8.6: Constructor declarations: we might be trying to define a
4573          method without specifying a return type. */
4574       if (EXPR_WFL_NODE (id) != GET_CPC_UN ())
4575         parse_error_context
4576           (id, "Invalid method declaration, return type required");
4577       /* 8.6.3: Constructor modifiers */
4578       else
4579         {
4580           JCONSTRUCTOR_CHECK (flags, ACC_ABSTRACT, id, "abstract");
4581           JCONSTRUCTOR_CHECK (flags, ACC_STATIC, id, "static");
4582           JCONSTRUCTOR_CHECK (flags, ACC_FINAL, id, "final");
4583           JCONSTRUCTOR_CHECK (flags, ACC_NATIVE, id, "native");
4584           JCONSTRUCTOR_CHECK (flags, ACC_SYNCHRONIZED, id, "synchronized");
4585           JCONSTRUCTOR_CHECK (flags, ACC_STRICT, id, "strictfp");
4586         }
4587       /* If we found error here, we don't consider it's OK to tread
4588          the method definition as a constructor, for the rest of this
4589          function */
4590       if (ec == java_error_count)
4591         constructor_ok = 1;
4592     }
4593
4594   /* Method declared within the scope of an interface are implicitly
4595      abstract and public. Conflicts with other erroneously provided
4596      modifiers are checked right after. */
4597
4598   if (CLASS_INTERFACE (TYPE_NAME (this_class)))
4599     {
4600       /* If FLAGS isn't set because of a modifier, turn the
4601          corresponding modifier WFL to NULL so we issue a warning on
4602          the obsolete use of the modifier */
4603       if (!(flags & ACC_PUBLIC))
4604         MODIFIER_WFL (PUBLIC_TK) = NULL;
4605       if (!(flags & ACC_ABSTRACT))
4606         MODIFIER_WFL (ABSTRACT_TK) = NULL;
4607       flags |= ACC_PUBLIC;
4608       flags |= ACC_ABSTRACT;
4609     }
4610
4611   /* Inner class can't declare static methods */
4612   if ((flags & ACC_STATIC) && !TOPLEVEL_CLASS_TYPE_P (this_class))
4613     {
4614       parse_error_context
4615         (id, "Method `%s' can't be static in inner class `%s'. Only members of interfaces and top-level classes can be static",
4616          IDENTIFIER_POINTER (EXPR_WFL_NODE (id)),
4617          lang_printable_name (this_class, 0));
4618     }
4619
4620   /* Modifiers context reset moved up, so abstract method declaration
4621      modifiers can be later checked.  */
4622
4623   /* Set constructor returned type to void and method name to <init>,
4624      unless we found an error identifier the constructor (in which
4625      case we retain the original name) */
4626   if (!type)
4627     {
4628       type = void_type_node;
4629       if (constructor_ok)
4630         meth_name = init_identifier_node;
4631     }
4632   else
4633     meth_name = EXPR_WFL_NODE (id);
4634
4635   /* Do the returned type resolution and registration if necessary */
4636   SET_TYPE_FOR_RESOLUTION (type, type_wfl, must_chain);
4637
4638   if (meth_name)
4639     type = build_array_from_name (type, type_wfl, meth_name, &meth_name);
4640   EXPR_WFL_NODE (id) = meth_name;
4641   PROMOTE_RECORD_IF_COMPLETE (type, must_chain);
4642
4643   if (must_chain)
4644     {
4645       patch_stage = JDEP_METHOD_RETURN;
4646       register_incomplete_type (patch_stage, type_wfl, id, type);
4647       TREE_TYPE (meth) = GET_REAL_TYPE (type);
4648     }
4649   else
4650     TREE_TYPE (meth) = type;
4651
4652   saved_lineno = input_line;
4653   /* When defining an abstract or interface method, the curly
4654      bracket at level 1 doesn't exist because there is no function
4655      body */
4656   input_line = (ctxp->first_ccb_indent1 ? ctxp->first_ccb_indent1 :
4657             EXPR_WFL_LINENO (id));
4658
4659   /* Remember the original argument list */
4660   orig_arg = TYPE_ARG_TYPES (meth);
4661
4662   if (patch_stage)              /* includes ret type and/or all args */
4663     {
4664       jdep *jdep;
4665       meth = add_method_1 (this_class, flags, meth_name, meth);
4666       /* Patch for the return type */
4667       if (patch_stage == JDEP_METHOD_RETURN)
4668         {
4669           jdep = CLASSD_LAST (ctxp->classd_list);
4670           JDEP_GET_PATCH (jdep) = &TREE_TYPE (TREE_TYPE (meth));
4671         }
4672       /* This is the stop JDEP. METH allows the function's signature
4673          to be computed. */
4674       register_incomplete_type (JDEP_METHOD_END, NULL_TREE, meth, NULL_TREE);
4675     }
4676   else
4677     meth = add_method (this_class, flags, meth_name,
4678                        build_java_signature (meth));
4679
4680   /* Remember final parameters */
4681   MARK_FINAL_PARMS (meth, orig_arg);
4682
4683   /* Fix the method argument list so we have the argument name
4684      information */
4685   fix_method_argument_names (orig_arg, meth);
4686
4687   /* Register the parameter number and re-install the current line
4688      number */
4689   DECL_MAX_LOCALS (meth) = ctxp->formal_parameter_number+1;
4690   input_line = saved_lineno;
4691
4692   /* Register exception specified by the `throws' keyword for
4693      resolution and set the method decl appropriate field to the list.
4694      Note: the grammar ensures that what we get here are class
4695      types. */
4696   if (throws)
4697     {
4698       throws = nreverse (throws);
4699       for (current = throws; current; current = TREE_CHAIN (current))
4700         {
4701           register_incomplete_type (JDEP_EXCEPTION, TREE_VALUE (current),
4702                                     NULL_TREE, NULL_TREE);
4703           JDEP_GET_PATCH (CLASSD_LAST (ctxp->classd_list)) =
4704             &TREE_VALUE (current);
4705         }
4706       DECL_FUNCTION_THROWS (meth) = throws;
4707     }
4708
4709   if (TREE_TYPE (GET_CPC ()) != object_type_node)
4710     DECL_FUNCTION_WFL (meth) = id;
4711
4712   /* Set the flag if we correctly processed a constructor */
4713   if (constructor_ok)
4714     {
4715       DECL_CONSTRUCTOR_P (meth) = 1;
4716       /* Compute and store the number of artificial parameters declared
4717          for this constructor */
4718       for (count = 0, current = TYPE_FIELDS (this_class); current;
4719            current = TREE_CHAIN (current))
4720         if (FIELD_LOCAL_ALIAS (current))
4721           count++;
4722       DECL_FUNCTION_NAP (meth) = count;
4723     }
4724
4725   /* Eventually set the @deprecated tag flag */
4726   CHECK_DEPRECATED (meth);
4727
4728   /* If doing xref, store column and line number information instead
4729      of the line number only. */
4730   if (flag_emit_xref)
4731     DECL_SOURCE_LINE (meth) = EXPR_WFL_LINECOL (id);
4732
4733   return meth;
4734 }
4735
4736 static void
4737 fix_method_argument_names (tree orig_arg, tree meth)
4738 {
4739   tree arg = TYPE_ARG_TYPES (TREE_TYPE (meth));
4740   if (TREE_CODE (TREE_TYPE (meth)) == METHOD_TYPE)
4741     {
4742       TREE_PURPOSE (arg) = this_identifier_node;
4743       arg = TREE_CHAIN (arg);
4744     }
4745   while (orig_arg != end_params_node)
4746     {
4747       TREE_PURPOSE (arg) = TREE_PURPOSE (orig_arg);
4748       orig_arg = TREE_CHAIN (orig_arg);
4749       arg = TREE_CHAIN (arg);
4750     }
4751 }
4752
4753 /* Complete the method declaration with METHOD_BODY.  */
4754
4755 static void
4756 finish_method_declaration (tree method_body)
4757 {
4758   int flags;
4759
4760   if (!current_function_decl)
4761     return;
4762
4763   flags = get_access_flags_from_decl (current_function_decl);
4764
4765   /* 8.4.5 Method Body */
4766   if ((flags & ACC_ABSTRACT || flags & ACC_NATIVE) && method_body)
4767     {
4768       tree name = DECL_NAME (current_function_decl);
4769       parse_error_context (DECL_FUNCTION_WFL (current_function_decl),
4770                            "%s method `%s' can't have a body defined",
4771                            (METHOD_NATIVE (current_function_decl) ?
4772                             "Native" : "Abstract"),
4773                            IDENTIFIER_POINTER (name));
4774       method_body = NULL_TREE;
4775     }
4776   else if (!(flags & ACC_ABSTRACT) && !(flags & ACC_NATIVE) && !method_body)
4777     {
4778       tree name = DECL_NAME (current_function_decl);
4779       parse_error_context
4780         (DECL_FUNCTION_WFL (current_function_decl),
4781          "Non native and non abstract method `%s' must have a body defined",
4782          IDENTIFIER_POINTER (name));
4783       method_body = NULL_TREE;
4784     }
4785
4786   if (flag_emit_class_files && method_body
4787       && TREE_CODE (method_body) == NOP_EXPR
4788       && TREE_TYPE (current_function_decl)
4789       && TREE_TYPE (TREE_TYPE (current_function_decl)) == void_type_node)
4790     method_body = build1 (RETURN_EXPR, void_type_node, NULL);
4791
4792   BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (current_function_decl)) = method_body;
4793   maybe_absorb_scoping_blocks ();
4794   /* Exit function's body */
4795   exit_block ();
4796   /* Merge last line of the function with first line, directly in the
4797      function decl. It will be used to emit correct debug info. */
4798   if (!flag_emit_xref)
4799     DECL_FUNCTION_LAST_LINE (current_function_decl) = ctxp->last_ccb_indent1;
4800
4801   /* Since function's argument's list are shared, reset the
4802      ARG_FINAL_P parameter that might have been set on some of this
4803      function parameters. */
4804   UNMARK_FINAL_PARMS (current_function_decl);
4805
4806   /* So we don't have an irrelevant function declaration context for
4807      the next static block we'll see. */
4808   current_function_decl = NULL_TREE;
4809 }
4810
4811 /* Build a an error message for constructor circularity errors.  */
4812
4813 static char *
4814 constructor_circularity_msg (tree from, tree to)
4815 {
4816   static char string [4096];
4817   char *t = xstrdup (lang_printable_name (from, 0));
4818   sprintf (string, "`%s' invokes `%s'", t, lang_printable_name (to, 0));
4819   free (t);
4820   return string;
4821 }
4822
4823 /* Verify a circular call to METH. Return 1 if an error is found, 0
4824    otherwise.  */
4825
4826 static GTY(()) tree vcc_list;
4827 static int
4828 verify_constructor_circularity (tree meth, tree current)
4829 {
4830   tree c;
4831
4832   for (c = DECL_CONSTRUCTOR_CALLS (current); c; c = TREE_CHAIN (c))
4833     {
4834       if (TREE_VALUE (c) == meth)
4835         {
4836           char *t;
4837           if (vcc_list)
4838             {
4839               tree liste;
4840               vcc_list = nreverse (vcc_list);
4841               for (liste = vcc_list; liste; liste = TREE_CHAIN (liste))
4842                 {
4843                   parse_error_context
4844                     (TREE_PURPOSE (TREE_PURPOSE (liste)), "%s",
4845                      constructor_circularity_msg
4846                       (TREE_VALUE (liste), TREE_VALUE (TREE_PURPOSE (liste))));
4847                   java_error_count--;
4848                 }
4849             }
4850           t = xstrdup (lang_printable_name (meth, 0));
4851           parse_error_context (TREE_PURPOSE (c),
4852                                "%s: recursive invocation of constructor `%s'",
4853                                constructor_circularity_msg (current, meth), t);
4854           free (t);
4855           vcc_list = NULL_TREE;
4856           return 1;
4857         }
4858     }
4859   for (c = DECL_CONSTRUCTOR_CALLS (current); c; c = TREE_CHAIN (c))
4860     {
4861       vcc_list = tree_cons (c, current, vcc_list);
4862       if (verify_constructor_circularity (meth, TREE_VALUE (c)))
4863         return 1;
4864       vcc_list = TREE_CHAIN (vcc_list);
4865     }
4866   return 0;
4867 }
4868
4869 /* Check modifiers that can be declared but exclusively */
4870
4871 static void
4872 check_modifiers_consistency (int flags)
4873 {
4874   int acc_count = 0;
4875   tree cl = NULL_TREE;
4876
4877   THIS_MODIFIER_ONLY (flags, ACC_PUBLIC, PUBLIC_TK, acc_count, cl);
4878   THIS_MODIFIER_ONLY (flags, ACC_PRIVATE, PRIVATE_TK, acc_count, cl);
4879   THIS_MODIFIER_ONLY (flags, ACC_PROTECTED, PROTECTED_TK, acc_count, cl);
4880   if (acc_count > 1)
4881     parse_error_context
4882       (cl, "Inconsistent member declaration.  At most one of `public', `private', or `protected' may be specified");
4883
4884   acc_count = 0;
4885   cl = NULL_TREE;
4886   THIS_MODIFIER_ONLY (flags, ACC_FINAL, FINAL_TK, acc_count, cl);
4887   THIS_MODIFIER_ONLY (flags, ACC_VOLATILE, VOLATILE_TK, acc_count, cl);
4888   if (acc_count > 1)
4889     parse_error_context (cl,
4890                          "Inconsistent member declaration.  At most one of `final' or `volatile' may be specified");
4891 }
4892
4893 /* Check the methode header METH for abstract specifics features */
4894
4895 static void
4896 check_abstract_method_header (tree meth)
4897 {
4898   int flags = get_access_flags_from_decl (meth);
4899
4900   OBSOLETE_MODIFIER_WARNING2 (MODIFIER_WFL (ABSTRACT_TK), flags,
4901                               ACC_ABSTRACT, "abstract method",
4902                               IDENTIFIER_POINTER (DECL_NAME (meth)));
4903   OBSOLETE_MODIFIER_WARNING2 (MODIFIER_WFL (PUBLIC_TK), flags,
4904                               ACC_PUBLIC, "abstract method",
4905                               IDENTIFIER_POINTER (DECL_NAME (meth)));
4906
4907   check_modifiers ("Illegal modifier `%s' for interface method",
4908                   flags, INTERFACE_METHOD_MODIFIERS);
4909 }
4910
4911 /* Create a FUNCTION_TYPE node and start augmenting it with the
4912    declared function arguments. Arguments type that can't be resolved
4913    are left as they are, but the returned node is marked as containing
4914    incomplete types.  */
4915
4916 static tree
4917 method_declarator (tree id, tree list)
4918 {
4919   tree arg_types = NULL_TREE, current, node;
4920   tree meth = make_node (FUNCTION_TYPE);
4921   jdep *jdep;
4922
4923   patch_stage = JDEP_NO_PATCH;
4924
4925   if (GET_CPC () == error_mark_node)
4926     return error_mark_node;
4927
4928   /* If we're dealing with an inner class constructor, we hide the
4929      this$<n> decl in the name field of its parameter declaration.  We
4930      also might have to hide the outer context local alias
4931      initializers. Not done when the class is a toplevel class. */
4932   if (PURE_INNER_CLASS_DECL_P (GET_CPC ())
4933       && EXPR_WFL_NODE (id) == GET_CPC_UN ())
4934     {
4935       tree aliases_list, type, thisn;
4936       /* First the aliases, linked to the regular parameters */
4937       aliases_list =
4938         build_alias_initializer_parameter_list (AIPL_FUNCTION_DECLARATION,
4939                                                 TREE_TYPE (GET_CPC ()),
4940                                                 NULL_TREE, NULL);
4941       list = chainon (nreverse (aliases_list), list);
4942
4943       /* Then this$<n> */
4944       type = TREE_TYPE (DECL_CONTEXT (GET_CPC ()));
4945       thisn = build_current_thisn (TREE_TYPE (GET_CPC ()));
4946       list = tree_cons (build_wfl_node (thisn), build_pointer_type (type),
4947                         list);
4948     }
4949
4950   for (current = list; current; current = TREE_CHAIN (current))
4951     {
4952       int must_chain = 0;
4953       tree wfl_name = TREE_PURPOSE (current);
4954       tree type = TREE_VALUE (current);
4955       tree name = EXPR_WFL_NODE (wfl_name);
4956       tree already, arg_node;
4957       tree type_wfl = NULL_TREE;
4958       tree real_type;
4959
4960       /* Obtain a suitable type for resolution, if necessary */
4961       SET_TYPE_FOR_RESOLUTION (type, type_wfl, must_chain);
4962
4963       /* Process NAME, as it may specify extra dimension(s) for it */
4964       type = build_array_from_name (type, type_wfl, name, &name);
4965       EXPR_WFL_NODE (wfl_name) = name;
4966
4967       real_type = GET_REAL_TYPE (type);
4968       if (TREE_CODE (real_type) == RECORD_TYPE)
4969         {
4970           real_type = promote_type (real_type);
4971           if (TREE_CODE (type) == TREE_LIST)
4972             TREE_PURPOSE (type) = real_type;
4973         }
4974
4975       /* Check redefinition */
4976       for (already = arg_types; already; already = TREE_CHAIN (already))
4977         if (TREE_PURPOSE (already) == name)
4978           {
4979             parse_error_context
4980               (wfl_name, "Variable `%s' is used more than once in the argument list of method `%s'",
4981                IDENTIFIER_POINTER (name),
4982                IDENTIFIER_POINTER (EXPR_WFL_NODE (id)));
4983             break;
4984           }
4985
4986       /* If we've an incomplete argument type, we know there is a location
4987          to patch when the type get resolved, later.  */
4988       jdep = NULL;
4989       if (must_chain)
4990         {
4991           patch_stage = JDEP_METHOD;
4992           type = register_incomplete_type (patch_stage,
4993                                            type_wfl, wfl_name, type);
4994           jdep = CLASSD_LAST (ctxp->classd_list);
4995           JDEP_MISC (jdep) = id;
4996         }
4997
4998       /* The argument node: a name and a (possibly) incomplete type.  */
4999       arg_node = build_tree_list (name, real_type);
5000       /* Remember arguments declared final. */
5001       ARG_FINAL_P (arg_node) = ARG_FINAL_P (current);
5002
5003       if (jdep)
5004         JDEP_GET_PATCH (jdep) = &TREE_VALUE (arg_node);
5005       TREE_CHAIN (arg_node) = arg_types;
5006       arg_types = arg_node;
5007     }
5008   TYPE_ARG_TYPES (meth) = chainon (nreverse (arg_types), end_params_node);
5009   node = build_tree_list (id, meth);
5010   return node;
5011 }
5012
5013 static int
5014 unresolved_type_p (tree wfl, tree *returned)
5015 {
5016   if (TREE_CODE (wfl) == EXPR_WITH_FILE_LOCATION)
5017     {
5018       if (returned)
5019         {
5020           tree decl = IDENTIFIER_CLASS_VALUE (EXPR_WFL_NODE (wfl));
5021           if (decl && current_class && (decl == TYPE_NAME (current_class)))
5022             *returned = TREE_TYPE (decl);
5023           else if (GET_CPC_UN () == EXPR_WFL_NODE (wfl))
5024             *returned = TREE_TYPE (GET_CPC ());
5025           else
5026             *returned = NULL_TREE;
5027         }
5028       return 1;
5029     }
5030   if (returned)
5031     *returned = wfl;
5032   return 0;
5033 }
5034
5035 /* From NAME, build a qualified identifier node using the
5036    qualification from the current package definition. */
5037
5038 static tree
5039 parser_qualified_classname (tree name)
5040 {
5041   tree nested_class_name;
5042
5043   if ((nested_class_name = maybe_make_nested_class_name (name)))
5044     return nested_class_name;
5045
5046   if (ctxp->package)
5047     return merge_qualified_name (ctxp->package, name);
5048   else
5049     return name;
5050 }
5051
5052 /* Called once the type a interface extends is resolved. Returns 0 if
5053    everything is OK.  */
5054
5055 static int
5056 parser_check_super_interface (tree super_decl, tree this_decl, tree this_wfl)
5057 {
5058   tree super_type = TREE_TYPE (super_decl);
5059
5060   /* Has to be an interface */
5061   if (!CLASS_INTERFACE (super_decl))
5062     {
5063       parse_error_context
5064         (this_wfl, "%s `%s' can't implement/extend %s `%s'",
5065          (CLASS_INTERFACE (TYPE_NAME (TREE_TYPE (this_decl))) ?
5066           "Interface" : "Class"),
5067          IDENTIFIER_POINTER (DECL_NAME (this_decl)),
5068          (TYPE_ARRAY_P (super_type) ? "array" : "class"),
5069          IDENTIFIER_POINTER (DECL_NAME (super_decl)));
5070       return 1;
5071     }
5072
5073   /* Check top-level interface access. Inner classes are subject to member
5074      access rules (6.6.1). */
5075   if (! INNER_CLASS_P (super_type)
5076       && check_pkg_class_access (DECL_NAME (super_decl),
5077                                  NULL_TREE, true, this_decl))
5078     return 1;
5079
5080   SOURCE_FRONTEND_DEBUG (("Completing interface %s with %s",
5081                           IDENTIFIER_POINTER (DECL_NAME (this_decl)),
5082                           IDENTIFIER_POINTER (DECL_NAME (super_decl))));
5083   return 0;
5084 }
5085
5086 /* Makes sure that SUPER_DECL is suitable to extend THIS_DECL. Returns
5087    0 if everything is OK.  */
5088
5089 static int
5090 parser_check_super (tree super_decl, tree this_decl, tree wfl)
5091 {
5092   tree super_type = TREE_TYPE (super_decl);
5093
5094   /* SUPER should be a CLASS (neither an array nor an interface) */
5095   if (TYPE_ARRAY_P (super_type) || CLASS_INTERFACE (TYPE_NAME (super_type)))
5096     {
5097       parse_error_context
5098         (wfl, "Class `%s' can't subclass %s `%s'",
5099          IDENTIFIER_POINTER (DECL_NAME (this_decl)),
5100          (CLASS_INTERFACE (TYPE_NAME (super_type)) ? "interface" : "array"),
5101          IDENTIFIER_POINTER (DECL_NAME (super_decl)));
5102       return 1;
5103     }
5104
5105   if (CLASS_FINAL (TYPE_NAME (super_type)))
5106     {
5107       parse_error_context (wfl, "Can't subclass final classes: %s",
5108                            IDENTIFIER_POINTER (DECL_NAME (super_decl)));
5109       return 1;
5110     }
5111
5112   /* Check top-level class scope. Inner classes are subject to member access
5113      rules (6.6.1). */
5114   if (! INNER_CLASS_P (super_type)
5115       && (check_pkg_class_access (DECL_NAME (super_decl), wfl, true, NULL_TREE)))
5116     return 1;
5117
5118   SOURCE_FRONTEND_DEBUG (("Completing class %s with %s",
5119                           IDENTIFIER_POINTER (DECL_NAME (this_decl)),
5120                           IDENTIFIER_POINTER (DECL_NAME (super_decl))));
5121   return 0;
5122 }
5123
5124 /* Create a new dependency list and link it (in a LIFO manner) to the
5125    CTXP list of type dependency list.  */
5126
5127 static void
5128 create_jdep_list (struct parser_ctxt *ctxp)
5129 {
5130   jdeplist *new = xmalloc (sizeof (jdeplist));
5131   new->first = new->last = NULL;
5132   new->next = ctxp->classd_list;
5133   ctxp->classd_list = new;
5134 }
5135
5136 static jdeplist *
5137 reverse_jdep_list (struct parser_ctxt *ctxp)
5138 {
5139   jdeplist *prev = NULL, *current, *next;
5140   for (current = ctxp->classd_list; current; current = next)
5141     {
5142       next = current->next;
5143       current->next = prev;
5144       prev = current;
5145     }
5146   return prev;
5147 }
5148
5149 /* Create a fake pointer based on the ID stored in
5150    TYPE_NAME. TYPE_NAME can be a WFL or a incomplete type asking to be
5151    registered again. */
5152
5153 static tree
5154 obtain_incomplete_type (tree type_name)
5155 {
5156   tree ptr = NULL_TREE, name;
5157
5158   if (TREE_CODE (type_name) == EXPR_WITH_FILE_LOCATION)
5159     name = EXPR_WFL_NODE (type_name);
5160   else if (INCOMPLETE_TYPE_P (type_name))
5161     name = TYPE_NAME (type_name);
5162   else
5163     abort ();
5164
5165   /* Workaround from build_pointer_type for incomplete types.  */
5166   BUILD_PTR_FROM_NAME (ptr, name);
5167   TYPE_MODE (ptr) = ptr_mode;
5168   layout_type (ptr);
5169
5170   return ptr;
5171 }
5172
5173 /* Register a incomplete type whose name is WFL. Reuse PTR if PTR is
5174    non NULL instead of computing a new fake type based on WFL. The new
5175    dependency is inserted in the current type dependency list, in FIFO
5176    manner.  */
5177
5178 static tree
5179 register_incomplete_type (int kind, tree wfl, tree decl, tree ptr)
5180 {
5181   jdep *new = xmalloc (sizeof (jdep));
5182
5183   if (!ptr && kind != JDEP_METHOD_END) /* JDEP_METHOD_END is a mere marker */
5184     ptr = obtain_incomplete_type (wfl);
5185
5186   JDEP_KIND (new) = kind;
5187   JDEP_DECL (new) = decl;
5188   JDEP_TO_RESOLVE (new) = ptr;
5189   JDEP_WFL (new) = wfl;
5190   JDEP_CHAIN (new) = NULL;
5191   JDEP_MISC (new) = NULL_TREE;
5192   /* For some dependencies, set the enclosing class of the current
5193      class to be the enclosing context */
5194   if ((kind == JDEP_INTERFACE || kind == JDEP_ANONYMOUS || kind == JDEP_SUPER)
5195       && GET_ENCLOSING_CPC ())
5196     JDEP_ENCLOSING (new) = TREE_VALUE (GET_ENCLOSING_CPC ());
5197   else
5198     JDEP_ENCLOSING (new) = GET_CPC ();
5199   JDEP_GET_PATCH (new) = (tree *)NULL;
5200
5201   JDEP_INSERT (ctxp->classd_list, new);
5202
5203   return ptr;
5204 }
5205
5206 /* This checks for circular references with innerclasses. We start
5207    from SOURCE and should never reach TARGET. Extended/implemented
5208    types in SOURCE have their enclosing context checked not to reach
5209    TARGET. When the last enclosing context of SOURCE is reached, its
5210    extended/implemented types are also checked not to reach TARGET.
5211    In case of error, WFL of the offending type is returned; NULL_TREE
5212    otherwise.  */
5213
5214 static tree
5215 check_inner_circular_reference (tree source, tree target)
5216 {
5217   tree basetype_vec = TYPE_BINFO_BASETYPES (source);
5218   tree ctx, cl;
5219   int i;
5220
5221   if (!basetype_vec)
5222     return NULL_TREE;
5223
5224   for (i = 0; i < TREE_VEC_LENGTH (basetype_vec); i++)
5225     {
5226       tree su;
5227
5228       /* We can end up with a NULL_TREE or an incomplete type here if
5229          we encountered previous type resolution errors. It's safe to
5230          simply ignore these cases.  */
5231       if (TREE_VEC_ELT (basetype_vec, i) == NULL_TREE)
5232         continue;
5233       su = BINFO_TYPE (TREE_VEC_ELT (basetype_vec, i));
5234       if (INCOMPLETE_TYPE_P (su))
5235         continue;
5236
5237       if (inherits_from_p (su, target))
5238         return lookup_cl (TYPE_NAME (su));
5239
5240       for (ctx = DECL_CONTEXT (TYPE_NAME (su)); ctx; ctx = DECL_CONTEXT (ctx))
5241         {
5242           /* An enclosing context shouldn't be TARGET */
5243           if (ctx == TYPE_NAME (target))
5244             return lookup_cl (TYPE_NAME (su));
5245
5246           /* When we reach the enclosing last context, start a check
5247              on it, with the same target */
5248           if (! DECL_CONTEXT (ctx) &&
5249               (cl = check_inner_circular_reference (TREE_TYPE (ctx), target)))
5250             return cl;
5251         }
5252     }
5253   return NULL_TREE;
5254 }
5255
5256 /* Explore TYPE's `extends' clause member(s) and return the WFL of the
5257    offending type if a circularity is detected. NULL_TREE is returned
5258    otherwise. TYPE can be an interface or a class.   */
5259
5260 static tree
5261 check_circular_reference (tree type)
5262 {
5263   tree basetype_vec = TYPE_BINFO_BASETYPES (type);
5264   int i;
5265
5266   if (!basetype_vec)
5267     return NULL_TREE;
5268
5269   if (! CLASS_INTERFACE (TYPE_NAME (type)))
5270     {
5271       if (inherits_from_p (CLASSTYPE_SUPER (type), type))
5272         return lookup_cl (TYPE_NAME (type));
5273       return NULL_TREE;
5274     }
5275
5276   for (i = 0; i < TREE_VEC_LENGTH (basetype_vec); i++)
5277     {
5278       tree vec_elt = TREE_VEC_ELT (basetype_vec, i);
5279       if (vec_elt && BINFO_TYPE (vec_elt) != object_type_node
5280           && interface_of_p (type, BINFO_TYPE (vec_elt)))
5281         return lookup_cl (TYPE_NAME (BINFO_TYPE (vec_elt)));
5282     }
5283   return NULL_TREE;
5284 }
5285
5286 void
5287 java_check_circular_reference (void)
5288 {
5289   tree current;
5290   for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
5291     {
5292       tree type = TREE_TYPE (current);
5293       tree cl;
5294
5295       cl = check_circular_reference (type);
5296       if (! cl)
5297         cl = check_inner_circular_reference (type, type);
5298       if (cl)
5299         parse_error_context (cl, "Cyclic class inheritance%s",
5300                              (cyclic_inheritance_report ?
5301                               cyclic_inheritance_report : ""));
5302     }
5303 }
5304
5305 /* Augment the parameter list PARM with parameters crafted to
5306    initialize outer context locals aliases. Through ARTIFICIAL, a
5307    count is kept of the number of crafted parameters. MODE governs
5308    what eventually gets created: something suitable for a function
5309    creation or a function invocation, either the constructor or
5310    finit$.  */
5311
5312 static tree
5313 build_alias_initializer_parameter_list (int mode, tree class_type, tree parm,
5314                                         int *artificial)
5315 {
5316   tree field;
5317   tree additional_parms = NULL_TREE;
5318
5319   for (field = TYPE_FIELDS (class_type); field; field = TREE_CHAIN (field))
5320     if (FIELD_LOCAL_ALIAS (field))
5321       {
5322         const char *buffer = IDENTIFIER_POINTER (DECL_NAME (field));
5323         tree purpose = NULL_TREE, value = NULL_TREE, name = NULL_TREE;
5324         tree mangled_id;
5325
5326         switch (mode)
5327           {
5328           case AIPL_FUNCTION_DECLARATION:
5329             MANGLE_ALIAS_INITIALIZER_PARAMETER_NAME_STR (mangled_id,
5330                                                          &buffer [4]);
5331             purpose = build_wfl_node (mangled_id);
5332             if (TREE_CODE (TREE_TYPE (field)) == POINTER_TYPE)
5333               value = build_wfl_node (TYPE_NAME (TREE_TYPE (field)));
5334             else
5335               value = TREE_TYPE (field);
5336             break;
5337
5338           case AIPL_FUNCTION_CREATION:
5339             MANGLE_ALIAS_INITIALIZER_PARAMETER_NAME_STR (purpose,
5340                                                          &buffer [4]);
5341             value = TREE_TYPE (field);
5342             break;
5343
5344           case AIPL_FUNCTION_FINIT_INVOCATION:
5345             MANGLE_ALIAS_INITIALIZER_PARAMETER_NAME_STR (mangled_id,
5346                                                          &buffer [4]);
5347             /* Now, this is wrong. purpose should always be the NAME
5348                of something and value its matching value (decl, type,
5349                etc...) FIXME -- but there is a lot to fix. */
5350
5351             /* When invoked for this kind of operation, we already
5352                know whether a field is used or not. */
5353             purpose = TREE_TYPE (field);
5354             value = build_wfl_node (mangled_id);
5355             break;
5356
5357           case AIPL_FUNCTION_CTOR_INVOCATION:
5358             /* There are two case: the constructor invocation happens
5359                outside the local inner, in which case, locales from the outer
5360                context are directly used.
5361
5362                Otherwise, we fold to using the alias directly. */
5363             if (class_type == current_class)
5364               value = field;
5365             else
5366               {
5367                 name = get_identifier (&buffer[4]);
5368                 value = IDENTIFIER_LOCAL_VALUE (name);
5369               }
5370             break;
5371           }
5372         additional_parms = tree_cons (purpose, value, additional_parms);
5373         if (artificial)
5374           *artificial +=1;
5375       }
5376   if (additional_parms)
5377     {
5378       if (ANONYMOUS_CLASS_P (class_type)
5379           && mode == AIPL_FUNCTION_CTOR_INVOCATION)
5380         additional_parms = nreverse (additional_parms);
5381       parm = chainon (additional_parms, parm);
5382     }
5383
5384    return parm;
5385 }
5386
5387 /* Craft a constructor for CLASS_DECL -- what we should do when none
5388    where found. ARGS is non NULL when a special signature must be
5389    enforced. This is the case for anonymous classes.  */
5390
5391 static tree
5392 craft_constructor (tree class_decl, tree args)
5393 {
5394   tree class_type = TREE_TYPE (class_decl);
5395   tree parm = NULL_TREE;
5396   int flags = (get_access_flags_from_decl (class_decl) & ACC_PUBLIC ?
5397                ACC_PUBLIC : 0);
5398   int i = 0, artificial = 0;
5399   tree decl, ctor_name;
5400   char buffer [80];
5401
5402   /* The constructor name is <init> unless we're dealing with an
5403      anonymous class, in which case the name will be fixed after having
5404      be expanded. */
5405   if (ANONYMOUS_CLASS_P (class_type))
5406     ctor_name = DECL_NAME (class_decl);
5407   else
5408     ctor_name = init_identifier_node;
5409
5410   /* If we're dealing with an inner class constructor, we hide the
5411      this$<n> decl in the name field of its parameter declaration. */
5412   if (PURE_INNER_CLASS_TYPE_P (class_type))
5413     {
5414       tree type = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (class_type)));
5415       parm = tree_cons (build_current_thisn (class_type),
5416                         build_pointer_type (type), parm);
5417
5418       /* Some more arguments to be hidden here. The values of the local
5419          variables of the outer context that the inner class needs to see. */
5420       parm = build_alias_initializer_parameter_list (AIPL_FUNCTION_CREATION,
5421                                                      class_type, parm,
5422                                                      &artificial);
5423     }
5424
5425   /* Then if there are any args to be enforced, enforce them now */
5426   for (; args && args != end_params_node; args = TREE_CHAIN (args))
5427     {
5428       sprintf (buffer, "parm%d", i++);
5429       parm = tree_cons (get_identifier (buffer), TREE_VALUE (args), parm);
5430     }
5431
5432   CRAFTED_PARAM_LIST_FIXUP (parm);
5433   decl = create_artificial_method (class_type, flags, void_type_node,
5434                                    ctor_name, parm);
5435   fix_method_argument_names (parm, decl);
5436   /* Now, mark the artificial parameters. */
5437   DECL_FUNCTION_NAP (decl) = artificial;
5438   DECL_FUNCTION_SYNTHETIC_CTOR (decl) = DECL_CONSTRUCTOR_P (decl) = 1;
5439   DECL_INLINE (decl) = 1;
5440   return decl;
5441 }
5442
5443
5444 /* Fix the constructors. This will be called right after circular
5445    references have been checked. It is necessary to fix constructors
5446    early even if no code generation will take place for that class:
5447    some generated constructor might be required by the class whose
5448    compilation triggered this one to be simply loaded.  */
5449
5450 void
5451 java_fix_constructors (void)
5452 {
5453   tree current;
5454
5455   for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
5456     {
5457       tree class_type = TREE_TYPE (current);
5458       int saw_ctor = 0;
5459       tree decl;
5460
5461       if (CLASS_INTERFACE (TYPE_NAME (class_type)))
5462         continue;
5463
5464       output_class = current_class = class_type;
5465       for (decl = TYPE_METHODS (class_type); decl; decl = TREE_CHAIN (decl))
5466         {
5467           if (DECL_CONSTRUCTOR_P (decl))
5468             {
5469               fix_constructors (decl);
5470               saw_ctor = 1;
5471             }
5472         }
5473
5474       /* Anonymous class constructor can't be generated that early. */
5475       if (!saw_ctor && !ANONYMOUS_CLASS_P (class_type))
5476         craft_constructor (current, NULL_TREE);
5477     }
5478 }
5479
5480 /* safe_layout_class just makes sure that we can load a class without
5481    disrupting the current_class, input_file, input_line, etc, information
5482    about the class processed currently.  */
5483
5484 void
5485 safe_layout_class (tree class)
5486 {
5487   tree save_current_class = current_class;
5488   location_t save_location = input_location;
5489
5490   layout_class (class);
5491
5492   current_class = save_current_class;
5493   input_location = save_location;
5494 }
5495
5496 static tree
5497 jdep_resolve_class (jdep *dep)
5498 {
5499   tree decl;
5500
5501   if (JDEP_RESOLVED_P (dep))
5502     decl = JDEP_RESOLVED_DECL (dep);
5503   else
5504     {
5505       decl = resolve_class (JDEP_ENCLOSING (dep), JDEP_TO_RESOLVE (dep),
5506                             JDEP_DECL (dep), JDEP_WFL (dep));
5507       JDEP_RESOLVED (dep, decl);
5508       /* If there is no WFL, that's ok.  We generate this warning
5509          elsewhere.  */
5510       if (decl && JDEP_WFL (dep) != NULL_TREE)
5511         check_deprecation (JDEP_WFL (dep), decl);
5512     }
5513
5514   if (!decl)
5515     complete_class_report_errors (dep);
5516   else if (INNER_CLASS_DECL_P (decl))
5517     {
5518       tree inner = TREE_TYPE (decl);
5519       if (! CLASS_LOADED_P (inner))
5520         {
5521           safe_layout_class (inner);
5522           if (TYPE_SIZE (inner) == error_mark_node)
5523             TYPE_SIZE (inner) = NULL_TREE;
5524         }
5525       check_inner_class_access (decl, JDEP_ENCLOSING (dep), JDEP_WFL (dep));
5526     }
5527   return decl;
5528 }
5529
5530 /* Complete unsatisfied class declaration and their dependencies */
5531
5532 void
5533 java_complete_class (void)
5534 {
5535   tree cclass;
5536   jdeplist *cclassd;
5537   int error_found;
5538   tree type;
5539
5540   /* Process imports */
5541   process_imports ();
5542
5543   /* Reverse things so we have the right order */
5544   ctxp->class_list = nreverse (ctxp->class_list);
5545   ctxp->classd_list = reverse_jdep_list (ctxp);
5546
5547   for (cclassd = ctxp->classd_list, cclass = ctxp->class_list;
5548        cclass && cclassd;
5549        cclass = TREE_CHAIN (cclass), cclassd = CLASSD_CHAIN (cclassd))
5550     {
5551       jdep *dep;
5552
5553       /* We keep the compilation unit imports in the class so that
5554          they can be used later to resolve type dependencies that
5555          aren't necessary to solve now. */
5556       TYPE_IMPORT_LIST (TREE_TYPE (cclass)) = ctxp->import_list;
5557       TYPE_IMPORT_DEMAND_LIST (TREE_TYPE (cclass)) = ctxp->import_demand_list;
5558
5559       for (dep = CLASSD_FIRST (cclassd); dep; dep = JDEP_CHAIN (dep))
5560         {
5561           tree decl;
5562           if (!(decl = jdep_resolve_class (dep)))
5563             continue;
5564
5565           /* Now it's time to patch */
5566           switch (JDEP_KIND (dep))
5567             {
5568             case JDEP_SUPER:
5569               /* Simply patch super */
5570               if (parser_check_super (decl, JDEP_DECL (dep), JDEP_WFL (dep)))
5571                 continue;
5572               BINFO_TYPE (TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO
5573                 (TREE_TYPE (JDEP_DECL (dep)))), 0)) = TREE_TYPE (decl);
5574               break;
5575
5576             case JDEP_FIELD:
5577               {
5578                 /* We do part of the job done in add_field */
5579                 tree field_decl = JDEP_DECL (dep);
5580                 tree field_type = TREE_TYPE (decl);
5581                 if (TREE_CODE (field_type) == RECORD_TYPE)
5582                   field_type = promote_type (field_type);
5583                 TREE_TYPE (field_decl) = field_type;
5584                 DECL_ALIGN (field_decl) = 0;
5585                 DECL_USER_ALIGN (field_decl) = 0;
5586                 layout_decl (field_decl, 0);
5587                 SOURCE_FRONTEND_DEBUG
5588                   (("Completed field/var decl `%s' with `%s'",
5589                     IDENTIFIER_POINTER (DECL_NAME (field_decl)),
5590                     IDENTIFIER_POINTER (DECL_NAME (decl))));
5591                 break;
5592               }
5593             case JDEP_METHOD:   /* We start patching a method */
5594             case JDEP_METHOD_RETURN:
5595               error_found = 0;
5596               while (1)
5597                 {
5598                   if (decl)
5599                     {
5600                       type = TREE_TYPE(decl);
5601                       if (TREE_CODE (type) == RECORD_TYPE)
5602                         type = promote_type (type);
5603                       JDEP_APPLY_PATCH (dep, type);
5604                       SOURCE_FRONTEND_DEBUG
5605                         (((JDEP_KIND (dep) == JDEP_METHOD_RETURN ?
5606                            "Completing fct `%s' with ret type `%s'":
5607                            "Completing arg `%s' with type `%s'"),
5608                           IDENTIFIER_POINTER (EXPR_WFL_NODE
5609                                               (JDEP_DECL_WFL (dep))),
5610                           IDENTIFIER_POINTER (DECL_NAME (decl))));
5611                     }
5612                   else
5613                     error_found = 1;
5614                   dep = JDEP_CHAIN (dep);
5615                   if (JDEP_KIND (dep) == JDEP_METHOD_END)
5616                     break;
5617                   else
5618                     decl = jdep_resolve_class (dep);
5619                 }
5620               if (!error_found)
5621                 {
5622                   tree mdecl = JDEP_DECL (dep), signature;
5623                   /* Recompute and reset the signature, check first that
5624                      all types are now defined. If they're not,
5625                      don't build the signature. */
5626                   if (check_method_types_complete (mdecl))
5627                     {
5628                       signature = build_java_signature (TREE_TYPE (mdecl));
5629                       set_java_signature (TREE_TYPE (mdecl), signature);
5630                     }
5631                 }
5632               else
5633                 continue;
5634               break;
5635
5636             case JDEP_INTERFACE:
5637               if (parser_check_super_interface (decl, JDEP_DECL (dep),
5638                                                 JDEP_WFL (dep)))
5639                 continue;
5640               parser_add_interface (JDEP_DECL (dep), decl, JDEP_WFL (dep));
5641               break;
5642
5643             case JDEP_PARM:
5644             case JDEP_VARIABLE:
5645               type = TREE_TYPE(decl);
5646               if (TREE_CODE (type) == RECORD_TYPE)
5647                 type = promote_type (type);
5648               JDEP_APPLY_PATCH (dep, type);
5649               break;
5650
5651             case JDEP_TYPE:
5652               JDEP_APPLY_PATCH (dep, TREE_TYPE (decl));
5653               SOURCE_FRONTEND_DEBUG
5654                 (("Completing a random type dependency on a '%s' node",
5655                   tree_code_name [TREE_CODE (JDEP_DECL (dep))]));
5656               break;
5657
5658             case JDEP_EXCEPTION:
5659               JDEP_APPLY_PATCH (dep, TREE_TYPE (decl));
5660               SOURCE_FRONTEND_DEBUG
5661                 (("Completing `%s' `throws' argument node",
5662                   IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_WFL (dep)))));
5663               break;
5664
5665             case JDEP_ANONYMOUS:
5666               patch_anonymous_class (decl, JDEP_DECL (dep), JDEP_WFL (dep));
5667               break;
5668
5669             default:
5670               abort ();
5671             }
5672         }
5673     }
5674   return;
5675 }
5676
5677 /* Resolve class CLASS_TYPE. Handle the case of trying to resolve an
5678    array.  */
5679
5680 static tree
5681 resolve_class (tree enclosing, tree class_type, tree decl, tree cl)
5682 {
5683   tree tname = TYPE_NAME (class_type);
5684   tree resolved_type = TREE_TYPE (class_type);
5685   int array_dims = 0;
5686   tree resolved_type_decl;
5687
5688   if (resolved_type != NULL_TREE)
5689     {
5690       tree resolved_type_decl = TYPE_NAME (resolved_type);
5691       if (resolved_type_decl == NULL_TREE
5692           || TREE_CODE (resolved_type_decl) == IDENTIFIER_NODE)
5693         {
5694           resolved_type_decl = build_decl (TYPE_DECL,
5695                                            TYPE_NAME (class_type),
5696                                            resolved_type);
5697         }
5698       return resolved_type_decl;
5699     }
5700
5701   /* 1- Check to see if we have an array. If true, find what we really
5702      want to resolve  */
5703   if ((array_dims = build_type_name_from_array_name (tname,
5704                                                      &TYPE_NAME (class_type))))
5705     WFL_STRIP_BRACKET (cl, cl);
5706
5707   /* 2- Resolve the bare type */
5708   if (!(resolved_type_decl = do_resolve_class (enclosing, class_type,
5709                                                decl, cl)))
5710     return NULL_TREE;
5711   resolved_type = TREE_TYPE (resolved_type_decl);
5712
5713   /* 3- If we have an array, reconstruct the array down to its nesting */
5714   if (array_dims)
5715     {
5716       for (; array_dims; array_dims--)
5717         resolved_type = build_java_array_type (resolved_type, -1);
5718       resolved_type_decl = TYPE_NAME (resolved_type);
5719     }
5720   TREE_TYPE (class_type) = resolved_type;
5721   return resolved_type_decl;
5722 }
5723
5724 /* Effectively perform the resolution of class CLASS_TYPE.  DECL or CL
5725    are used to report error messages; CL must either be NULL_TREE or a
5726    WFL wrapping a class.  Do not try to replace TYPE_NAME (class_type)
5727    by a variable, since it is changed by find_in_imports{_on_demand}
5728    and (but it doesn't really matter) qualify_and_find.  */
5729
5730 tree
5731 do_resolve_class (tree enclosing, tree class_type, tree decl, tree cl)
5732 {
5733   tree new_class_decl = NULL_TREE, super = NULL_TREE;
5734   tree saved_enclosing_type = enclosing ? TREE_TYPE (enclosing) : NULL_TREE;
5735   tree decl_result;
5736   htab_t circularity_hash;
5737
5738   if (QUALIFIED_P (TYPE_NAME (class_type)))
5739     {
5740       /* If the type name is of the form `Q . Id', then Q is either a
5741          package name or a class name.  First we try to find Q as a
5742          class and then treat Id as a member type.  If we can't find Q
5743          as a class then we fall through.  */
5744       tree q, left, left_type, right;
5745       if (split_qualified_name (&left, &right, TYPE_NAME (class_type)) == 0)
5746         {
5747           BUILD_PTR_FROM_NAME (left_type, left);
5748           q = do_resolve_class (enclosing, left_type, decl, cl);
5749           if (q)
5750             {
5751               enclosing = q;
5752               saved_enclosing_type = TREE_TYPE (q);
5753               BUILD_PTR_FROM_NAME (class_type, right);
5754             }
5755         }
5756     }
5757
5758   if (enclosing)
5759     {
5760       /* This hash table is used to register the classes we're going
5761          through when searching the current class as an inner class, in
5762          order to detect circular references. Remember to free it before
5763          returning the section 0- of this function. */
5764       circularity_hash = htab_create (20, htab_hash_pointer, htab_eq_pointer,
5765                                       NULL);
5766
5767       /* 0- Search in the current class as an inner class.
5768          Maybe some code here should be added to load the class or
5769          something, at least if the class isn't an inner class and ended
5770          being loaded from class file. FIXME. */
5771       while (enclosing)
5772         {
5773           new_class_decl = resolve_inner_class (circularity_hash, cl, &enclosing,
5774                                                 &super, class_type);
5775           if (new_class_decl)
5776             break;
5777
5778           /* If we haven't found anything because SUPER reached Object and
5779              ENCLOSING happens to be an innerclass, try the enclosing context. */
5780           if ((!super || super == object_type_node) &&
5781               enclosing && INNER_CLASS_DECL_P (enclosing))
5782             enclosing = DECL_CONTEXT (enclosing);
5783           else
5784             enclosing = NULL_TREE;
5785         }
5786
5787       htab_delete (circularity_hash);
5788
5789       if (new_class_decl)
5790         return new_class_decl;
5791     }
5792
5793   /* 1- Check for the type in single imports. This will change
5794      TYPE_NAME() if something relevant is found */
5795   find_in_imports (saved_enclosing_type, class_type);
5796
5797   /* 2- And check for the type in the current compilation unit */
5798   if ((new_class_decl = IDENTIFIER_CLASS_VALUE (TYPE_NAME (class_type))))
5799     {
5800       if (!CLASS_LOADED_P (TREE_TYPE (new_class_decl)))
5801         load_class (TYPE_NAME (class_type), 0);
5802       return IDENTIFIER_CLASS_VALUE (TYPE_NAME (class_type));
5803     }
5804
5805   /* 3- Search according to the current package definition */
5806   if (!QUALIFIED_P (TYPE_NAME (class_type)))
5807     {
5808       if ((new_class_decl = qualify_and_find (class_type, ctxp->package,
5809                                              TYPE_NAME (class_type))))
5810         return new_class_decl;
5811     }
5812
5813   /* 4- Check the import on demands. Don't allow bar.baz to be
5814      imported from foo.* */
5815   if (!QUALIFIED_P (TYPE_NAME (class_type)))
5816     if (find_in_imports_on_demand (saved_enclosing_type, class_type))
5817       return NULL_TREE;
5818
5819   /* If found in find_in_imports_on_demand, the type has already been
5820      loaded. */
5821   if ((new_class_decl = IDENTIFIER_CLASS_VALUE (TYPE_NAME (class_type))))
5822     return new_class_decl;
5823
5824   /* 5- Try with a name qualified with the package name we've seen so far */
5825   if (!QUALIFIED_P (TYPE_NAME (class_type)))
5826     {
5827       tree package;
5828
5829       /* If there is a current package (ctxp->package), it's the first
5830          element of package_list and we can skip it. */
5831       for (package = (ctxp->package ?
5832                       TREE_CHAIN (package_list) : package_list);
5833            package; package = TREE_CHAIN (package))
5834         if ((new_class_decl = qualify_and_find (class_type,
5835                                                TREE_PURPOSE (package),
5836                                                TYPE_NAME (class_type))))
5837           return new_class_decl;
5838     }
5839
5840   /* 5- Check another compilation unit that bears the name of type */
5841   load_class (TYPE_NAME (class_type), 0);
5842
5843   if (!cl)
5844     cl = lookup_cl (decl);
5845
5846   /* If we don't have a value for CL, then we're being called recursively.
5847      We can't check package access just yet, but it will be taken care of
5848      by the caller. */
5849   if (cl)
5850     {
5851       if (check_pkg_class_access (TYPE_NAME (class_type), cl, true, NULL_TREE))
5852         return NULL_TREE;
5853     }
5854
5855   /* 6- Last call for a resolution */
5856   decl_result = IDENTIFIER_CLASS_VALUE (TYPE_NAME (class_type));
5857
5858   /* The final lookup might have registered a.b.c into a.b$c If we
5859      failed at the first lookup, progressively change the name if
5860      applicable and use the matching DECL instead. */
5861   if (!decl_result && QUALIFIED_P (TYPE_NAME (class_type)))
5862     {
5863       char *separator;
5864       tree name = TYPE_NAME (class_type);
5865       char *namebuffer = alloca (IDENTIFIER_LENGTH (name) + 1);
5866
5867       strcpy (namebuffer, IDENTIFIER_POINTER (name));
5868
5869       do {
5870
5871        /* Reach the last '.', and if applicable, replace it by a `$' and
5872           see if this exists as a type. */
5873        if ((separator = strrchr (namebuffer, '.')))
5874          {
5875            *separator = '$';
5876            name = get_identifier (namebuffer);
5877            decl_result = IDENTIFIER_CLASS_VALUE (name);
5878          }
5879       } while (!decl_result && separator);
5880     }
5881   return decl_result;
5882 }
5883
5884 static tree
5885 qualify_and_find (tree class_type, tree package, tree name)
5886 {
5887   tree new_qualified = merge_qualified_name (package, name);
5888   tree new_class_decl;
5889
5890   if (!IDENTIFIER_CLASS_VALUE (new_qualified))
5891     load_class (new_qualified, 0);
5892   if ((new_class_decl = IDENTIFIER_CLASS_VALUE (new_qualified)))
5893     {
5894       if (!CLASS_LOADED_P (TREE_TYPE (new_class_decl)))
5895         load_class (TREE_TYPE (new_class_decl), 0);
5896       TYPE_NAME (class_type) = new_qualified;
5897       return IDENTIFIER_CLASS_VALUE (new_qualified);
5898     }
5899   return NULL_TREE;
5900 }
5901
5902 /* Resolve NAME and lay it out (if not done and if not the current
5903    parsed class). Return a decl node. This function is meant to be
5904    called when type resolution is necessary during the walk pass.  */
5905
5906 static tree
5907 resolve_and_layout (tree something, tree cl)
5908 {
5909   tree decl, decl_type;
5910
5911   /* Don't do that on the current class */
5912   if (something == current_class)
5913     return TYPE_NAME (current_class);
5914
5915   /* Don't do anything for void and other primitive types */
5916   if (JPRIMITIVE_TYPE_P (something) || something == void_type_node)
5917     return NULL_TREE;
5918
5919   /* Pointer types can be reall pointer types or fake pointers. When
5920      finding a real pointer, recheck for primitive types */
5921   if (TREE_CODE (something) == POINTER_TYPE)
5922     {
5923       if (TREE_TYPE (something))
5924         {
5925           something = TREE_TYPE (something);
5926           if (JPRIMITIVE_TYPE_P (something) || something == void_type_node)
5927             return NULL_TREE;
5928         }
5929       else
5930         something = TYPE_NAME (something);
5931     }
5932
5933   /* Don't do anything for arrays of primitive types */
5934   if (TREE_CODE (something) == RECORD_TYPE && TYPE_ARRAY_P (something)
5935       && JPRIMITIVE_TYPE_P (TYPE_ARRAY_ELEMENT (something)))
5936     return NULL_TREE;
5937
5938   /* Something might be a WFL */
5939   if (TREE_CODE (something) == EXPR_WITH_FILE_LOCATION)
5940     something = EXPR_WFL_NODE (something);
5941
5942   /* Otherwise, if something is not and IDENTIFIER_NODE, it can be a a
5943      TYPE_DECL or a real TYPE */
5944   else if (TREE_CODE (something) != IDENTIFIER_NODE)
5945     something = (TREE_CODE (TYPE_NAME (something)) == TYPE_DECL ?
5946             DECL_NAME (TYPE_NAME (something)) : TYPE_NAME (something));
5947
5948   if (!(decl = resolve_no_layout (something, cl)))
5949     return NULL_TREE;
5950
5951   /* Resolve and layout if necessary */
5952   decl_type = TREE_TYPE (decl);
5953   layout_class_methods (decl_type);
5954   /* Check methods */
5955   if (CLASS_FROM_SOURCE_P (decl_type))
5956     java_check_methods (decl);
5957   /* Layout the type if necessary */
5958   if (decl_type != current_class && !CLASS_LOADED_P (decl_type))
5959     safe_layout_class (decl_type);
5960
5961   return decl;
5962 }
5963
5964 /* Resolve a class, returns its decl but doesn't perform any
5965    layout. The current parsing context is saved and restored */
5966
5967 static tree
5968 resolve_no_layout (tree name, tree cl)
5969 {
5970   tree ptr, decl;
5971   BUILD_PTR_FROM_NAME (ptr, name);
5972   java_parser_context_save_global ();
5973   decl = resolve_class (TYPE_NAME (current_class), ptr, NULL_TREE, cl);
5974   java_parser_context_restore_global ();
5975
5976   return decl;
5977 }
5978
5979 /* Called when reporting errors. Skip the '[]'s in a complex array
5980    type description that failed to be resolved. purify_type_name can't
5981    use an identifier tree.  */
5982
5983 static const char *
5984 purify_type_name (const char *name)
5985 {
5986   int len = strlen (name);
5987   int bracket_found;
5988
5989   STRING_STRIP_BRACKETS (name, len, bracket_found);
5990   if (bracket_found)
5991     {
5992       char *stripped_name = xmemdup (name, len, len+1);
5993       stripped_name [len] = '\0';
5994       return stripped_name;
5995     }
5996   return name;
5997 }
5998
5999 /* The type CURRENT refers to can't be found. We print error messages.  */
6000
6001 static void
6002 complete_class_report_errors (jdep *dep)
6003 {
6004   const char *name;
6005
6006   if (!JDEP_WFL (dep))
6007     return;
6008
6009   name = IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_WFL (dep)));
6010   switch (JDEP_KIND (dep))
6011     {
6012     case JDEP_SUPER:
6013       parse_error_context
6014         (JDEP_WFL (dep), "Superclass `%s' of class `%s' not found",
6015          purify_type_name (name),
6016          IDENTIFIER_POINTER (DECL_NAME (JDEP_DECL (dep))));
6017       break;
6018     case JDEP_FIELD:
6019       parse_error_context
6020         (JDEP_WFL (dep), "Type `%s' not found in declaration of field `%s'",
6021          purify_type_name (name),
6022          IDENTIFIER_POINTER (DECL_NAME (JDEP_DECL (dep))));
6023       break;
6024     case JDEP_METHOD:           /* Covers arguments */
6025       parse_error_context
6026         (JDEP_WFL (dep), "Type `%s' not found in the declaration of the argument `%s' of method `%s'",
6027          purify_type_name (name),
6028          IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_DECL_WFL (dep))),
6029          IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_MISC (dep))));
6030       break;
6031     case JDEP_METHOD_RETURN:    /* Covers return type */
6032       parse_error_context
6033         (JDEP_WFL (dep), "Type `%s' not found in the declaration of the return type of method `%s'",
6034          purify_type_name (name),
6035          IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_DECL_WFL (dep))));
6036       break;
6037     case JDEP_INTERFACE:
6038       parse_error_context
6039         (JDEP_WFL (dep), "Superinterface `%s' of %s `%s' not found",
6040          IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_WFL (dep))),
6041          (CLASS_OR_INTERFACE (JDEP_DECL (dep), "class", "interface")),
6042          IDENTIFIER_POINTER (DECL_NAME (JDEP_DECL (dep))));
6043       break;
6044     case JDEP_VARIABLE:
6045       parse_error_context
6046         (JDEP_WFL (dep), "Type `%s' not found in the declaration of the local variable `%s'",
6047          purify_type_name (IDENTIFIER_POINTER
6048                            (EXPR_WFL_NODE (JDEP_WFL (dep)))),
6049          IDENTIFIER_POINTER (DECL_NAME (JDEP_DECL (dep))));
6050       break;
6051     case JDEP_EXCEPTION:        /* As specified by `throws' */
6052       parse_error_context
6053           (JDEP_WFL (dep), "Class `%s' not found in `throws'",
6054          IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_WFL (dep))));
6055       break;
6056     default:
6057       /* Fix for -Wall. Just break doing nothing. The error will be
6058          caught later */
6059       break;
6060     }
6061 }
6062
6063 /* Return a static string containing the DECL prototype string. If
6064    DECL is a constructor, use the class name instead of the form
6065    <init> */
6066
6067 static const char *
6068 get_printable_method_name (tree decl)
6069 {
6070   const char *to_return;
6071   tree name = NULL_TREE;
6072
6073   if (DECL_CONSTRUCTOR_P (decl))
6074     {
6075       name = DECL_NAME (decl);
6076       DECL_NAME (decl) = DECL_NAME (TYPE_NAME (DECL_CONTEXT (decl)));
6077     }
6078
6079   to_return = lang_printable_name (decl, 0);
6080   if (DECL_CONSTRUCTOR_P (decl))
6081     DECL_NAME (decl) = name;
6082
6083   return to_return;
6084 }
6085
6086 /* Track method being redefined inside the same class. As a side
6087    effect, set DECL_NAME to an IDENTIFIER (prior entering this
6088    function it's a FWL, so we can track errors more accurately.)  */
6089
6090 static int
6091 check_method_redefinition (tree class, tree method)
6092 {
6093   tree redef, sig;
6094
6095   /* There's no need to verify <clinit> and finit$ and instinit$ */
6096   if (DECL_CLINIT_P (method)
6097       || DECL_FINIT_P (method) || DECL_INSTINIT_P (method))
6098     return 0;
6099
6100   sig = TYPE_ARGUMENT_SIGNATURE (TREE_TYPE (method));
6101   for (redef = TYPE_METHODS (class); redef; redef = TREE_CHAIN (redef))
6102     {
6103       if (redef == method)
6104         break;
6105       if (DECL_NAME (redef) == DECL_NAME (method)
6106           && sig == TYPE_ARGUMENT_SIGNATURE (TREE_TYPE (redef))
6107           && !DECL_ARTIFICIAL (method))
6108         {
6109           parse_error_context
6110             (DECL_FUNCTION_WFL (method), "Duplicate %s declaration `%s'",
6111              (DECL_CONSTRUCTOR_P (redef) ? "constructor" : "method"),
6112              get_printable_method_name (redef));
6113           return 1;
6114         }
6115     }
6116   return 0;
6117 }
6118
6119 /* Return 1 if check went ok, 0 otherwise.  */
6120 static int
6121 check_abstract_method_definitions (int do_interface, tree class_decl,
6122                                    tree type)
6123 {
6124   tree class = TREE_TYPE (class_decl);
6125   tree method, end_type;
6126   int ok = 1;
6127
6128   end_type = (do_interface ? object_type_node : type);
6129   for (method = TYPE_METHODS (type); method; method = TREE_CHAIN (method))
6130     {
6131       tree other_super, other_method, method_sig, method_name;
6132       int found = 0;
6133       int end_type_reached = 0;
6134
6135       if (!METHOD_ABSTRACT (method) || METHOD_FINAL (method))
6136         continue;
6137
6138       /* Now verify that somewhere in between TYPE and CLASS,
6139          abstract method METHOD gets a non abstract definition
6140          that is inherited by CLASS.  */
6141
6142       method_sig = build_java_signature (TREE_TYPE (method));
6143       method_name = DECL_NAME (method);
6144       if (TREE_CODE (method_name) == EXPR_WITH_FILE_LOCATION)
6145         method_name = EXPR_WFL_NODE (method_name);
6146
6147       other_super = class;
6148       do {
6149         if (other_super == end_type)
6150           end_type_reached = 1;
6151
6152         /* Method search */
6153         for (other_method = TYPE_METHODS (other_super); other_method;
6154             other_method = TREE_CHAIN (other_method))
6155           {
6156             tree s = build_java_signature (TREE_TYPE (other_method));
6157             tree other_name = DECL_NAME (other_method);
6158
6159             if (TREE_CODE (other_name) == EXPR_WITH_FILE_LOCATION)
6160               other_name = EXPR_WFL_NODE (other_name);
6161             if (!DECL_CLINIT_P (other_method)
6162                 && !DECL_CONSTRUCTOR_P (other_method)
6163                 && method_name == other_name
6164                 && method_sig == s
6165                 && !METHOD_ABSTRACT (other_method))
6166              {
6167                found = 1;
6168                break;
6169              }
6170           }
6171         other_super = CLASSTYPE_SUPER (other_super);
6172       } while (!end_type_reached);
6173
6174       /* Report that abstract METHOD didn't find an implementation
6175          that CLASS can use. */
6176       if (!found)
6177         {
6178           char *t = xstrdup (lang_printable_name
6179                             (TREE_TYPE (TREE_TYPE (method)), 0));
6180           tree ccn = DECL_NAME (TYPE_NAME (DECL_CONTEXT (method)));
6181
6182           parse_error_context
6183             (lookup_cl (class_decl),
6184              "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",
6185              IDENTIFIER_POINTER (DECL_NAME (class_decl)),
6186              t, lang_printable_name (method, 0),
6187              (CLASS_INTERFACE (TYPE_NAME (DECL_CONTEXT (method))) ?
6188               "interface" : "class"),
6189              IDENTIFIER_POINTER (ccn),
6190              (CLASS_INTERFACE (class_decl) ? "interface" : "class"),
6191              IDENTIFIER_POINTER (DECL_NAME (class_decl)));
6192           ok = 0;
6193           free (t);
6194         }
6195     }
6196
6197   if (ok && do_interface)
6198     {
6199       /* Check for implemented interfaces. */
6200       int i;
6201       tree vector = TYPE_BINFO_BASETYPES (type);
6202       for (i = 1; ok && vector && i < TREE_VEC_LENGTH (vector); i++)
6203         {
6204           tree super = BINFO_TYPE (TREE_VEC_ELT (vector, i));
6205           ok = check_abstract_method_definitions (1, class_decl, super);
6206         }
6207     }
6208
6209   return ok;
6210 }
6211
6212 /* Check that CLASS_DECL somehow implements all inherited abstract
6213    methods.  */
6214
6215 static void
6216 java_check_abstract_method_definitions (tree class_decl)
6217 {
6218   tree class = TREE_TYPE (class_decl);
6219   tree super, vector;
6220   int i;
6221
6222   if (CLASS_ABSTRACT (class_decl))
6223     return;
6224
6225   /* Check for inherited types */
6226   super = class;
6227   do {
6228     super = CLASSTYPE_SUPER (super);
6229     check_abstract_method_definitions (0, class_decl, super);
6230   } while (super != object_type_node);
6231
6232   /* Check for implemented interfaces. */
6233   vector = TYPE_BINFO_BASETYPES (class);
6234   for (i = 1; i < TREE_VEC_LENGTH (vector); i++)
6235     {
6236       super = BINFO_TYPE (TREE_VEC_ELT (vector, i));
6237       check_abstract_method_definitions (1, class_decl, super);
6238     }
6239 }
6240
6241 /* Check all the types method DECL uses and return 1 if all of them
6242    are now complete, 0 otherwise. This is used to check whether its
6243    safe to build a method signature or not.  */
6244
6245 static int
6246 check_method_types_complete (tree decl)
6247 {
6248   tree type = TREE_TYPE (decl);
6249   tree args;
6250
6251   if (!INCOMPLETE_TYPE_P (TREE_TYPE (type)))
6252     return 0;
6253
6254   args = TYPE_ARG_TYPES (type);
6255   if (TREE_CODE (type) == METHOD_TYPE)
6256     args = TREE_CHAIN (args);
6257   for (; args != end_params_node; args = TREE_CHAIN (args))
6258     if (INCOMPLETE_TYPE_P (TREE_VALUE (args)))
6259       return 0;
6260
6261   return 1;
6262 }
6263
6264 /* Visible interface to check methods contained in CLASS_DECL */
6265
6266 void
6267 java_check_methods (tree class_decl)
6268 {
6269   if (CLASS_METHOD_CHECKED_P (TREE_TYPE (class_decl)))
6270     return;
6271
6272   if (CLASS_INTERFACE (class_decl))
6273     java_check_abstract_methods (class_decl);
6274   else
6275     java_check_regular_methods (class_decl);
6276
6277   CLASS_METHOD_CHECKED_P (TREE_TYPE (class_decl)) = 1;
6278 }
6279
6280 /* Like not_accessible_p, but doesn't refer to the current class at
6281    all.  */
6282 static bool
6283 hack_is_accessible_p (tree member, tree from_where)
6284 {
6285   int flags = get_access_flags_from_decl (member);
6286
6287   if (from_where == DECL_CONTEXT (member)
6288       || (flags & ACC_PUBLIC))
6289     return true;
6290
6291   if ((flags & ACC_PROTECTED))
6292     {
6293       if (inherits_from_p (from_where, DECL_CONTEXT (member)))
6294         return true;
6295     }
6296
6297   if ((flags & ACC_PRIVATE))
6298     return false;
6299
6300   /* Package private, or protected.  */
6301   return in_same_package (TYPE_NAME (from_where),
6302                           TYPE_NAME (DECL_CONTEXT (member)));
6303 }
6304
6305 /* Check all the methods of CLASS_DECL. Methods are first completed
6306    then checked according to regular method existence rules.  If no
6307    constructor for CLASS_DECL were encountered, then build its
6308    declaration.  */
6309 static void
6310 java_check_regular_methods (tree class_decl)
6311 {
6312   int saw_constructor = ANONYMOUS_CLASS_P (TREE_TYPE (class_decl));
6313   tree method;
6314   tree class = TREE_TYPE (class_decl);
6315   tree found = NULL_TREE;
6316   tree mthrows;
6317
6318   /* It is not necessary to check methods defined in java.lang.Object */
6319   if (class == object_type_node)
6320     return;
6321
6322   if (!TYPE_NVIRTUALS (class))
6323     TYPE_METHODS (class) = nreverse (TYPE_METHODS (class));
6324
6325   /* Should take interfaces into account. FIXME */
6326   for (method = TYPE_METHODS (class); method; method = TREE_CHAIN (method))
6327     {
6328       tree sig;
6329       tree method_wfl = DECL_FUNCTION_WFL (method);
6330       int aflags;
6331
6332       /* Check for redefinitions */
6333       if (check_method_redefinition (class, method))
6334         continue;
6335
6336       /* We verify things thrown by the method.  They must inherit from
6337          java.lang.Throwable.  */
6338       for (mthrows = DECL_FUNCTION_THROWS (method);
6339            mthrows; mthrows = TREE_CHAIN (mthrows))
6340         {
6341           if (!inherits_from_p (TREE_VALUE (mthrows), throwable_type_node))
6342             parse_error_context
6343               (TREE_PURPOSE (mthrows), "Class `%s' in `throws' clause must be a subclass of class `java.lang.Throwable'",
6344                IDENTIFIER_POINTER
6345                  (DECL_NAME (TYPE_NAME (TREE_VALUE (mthrows)))));
6346         }
6347
6348       /* If we see one constructor a mark so we don't generate the
6349          default one.  Also skip other verifications: constructors
6350          can't be inherited hence hidden or overridden.  */
6351       if (DECL_CONSTRUCTOR_P (method))
6352         {
6353           saw_constructor = 1;
6354           continue;
6355         }
6356
6357       sig = build_java_argument_signature (TREE_TYPE (method));
6358       found = lookup_argument_method_generic (class, DECL_NAME (method), sig,
6359                                               SEARCH_SUPER | SEARCH_INTERFACE);
6360
6361       /* Inner class can't declare static methods */
6362       if (METHOD_STATIC (method) && !TOPLEVEL_CLASS_DECL_P (class_decl))
6363         {
6364           char *t = xstrdup (lang_printable_name (class, 0));
6365           parse_error_context
6366             (method_wfl, "Method `%s' can't be static in inner class `%s'. Only members of interfaces and top-level classes can be static",
6367              lang_printable_name (method, 0), t);
6368           free (t);
6369         }
6370
6371       /* Nothing overrides or it's a private method. */
6372       if (!found)
6373         continue;
6374       if (METHOD_PRIVATE (found))
6375         {
6376           found = NULL_TREE;
6377           continue;
6378         }
6379
6380       /* If `found' is declared in an interface, make sure the
6381          modifier matches. */
6382       if (CLASS_INTERFACE (TYPE_NAME (DECL_CONTEXT (found)))
6383           && clinit_identifier_node != DECL_NAME (found)
6384           && !METHOD_PUBLIC (method))
6385         {
6386           tree found_decl = TYPE_NAME (DECL_CONTEXT (found));
6387           parse_error_context (method_wfl, "Class `%s' must override `%s' with a public method in order to implement interface `%s'",
6388                                IDENTIFIER_POINTER (DECL_NAME (class_decl)),
6389                                lang_printable_name (method, 0),
6390                                IDENTIFIER_POINTER (DECL_NAME (found_decl)));
6391         }
6392
6393       /* Can't override a method with the same name and different return
6394          types. */
6395       if (TREE_TYPE (TREE_TYPE (found)) != TREE_TYPE (TREE_TYPE (method)))
6396         {
6397           char *t = xstrdup
6398             (lang_printable_name (TREE_TYPE (TREE_TYPE (found)), 0));
6399           parse_error_context
6400             (method_wfl,
6401              "Method `%s' was defined with return type `%s' in class `%s'",
6402              lang_printable_name (found, 0), t,
6403              IDENTIFIER_POINTER
6404                (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found)))));
6405           free (t);
6406         }
6407
6408       aflags = get_access_flags_from_decl (found);
6409
6410       /* Can't override final. Can't override static. */
6411       if (METHOD_FINAL (found) || METHOD_STATIC (found))
6412         {
6413           /* Static *can* override static */
6414           if (METHOD_STATIC (found) && METHOD_STATIC (method))
6415             continue;
6416           parse_error_context
6417             (method_wfl,
6418              "%s methods can't be overridden. Method `%s' is %s in class `%s'",
6419              (METHOD_FINAL (found) ? "Final" : "Static"),
6420              lang_printable_name (found, 0),
6421              (METHOD_FINAL (found) ? "final" : "static"),
6422              IDENTIFIER_POINTER
6423                (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found)))));
6424           continue;
6425         }
6426
6427       /* Static method can't override instance method. */
6428       if (METHOD_STATIC (method))
6429         {
6430           parse_error_context
6431             (method_wfl,
6432              "Instance methods can't be overridden by a static method. Method `%s' is an instance method in class `%s'",
6433              lang_printable_name (found, 0),
6434              IDENTIFIER_POINTER
6435                (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found)))));
6436           continue;
6437         }
6438
6439       /* - Overriding/hiding public must be public
6440          - Overriding/hiding protected must be protected or public
6441          - If the overridden or hidden method has default (package)
6442            access, then the overriding or hiding method must not be
6443            private; otherwise, a compile-time error occurs.  If
6444            `found' belongs to an interface, things have been already
6445            taken care of.  */
6446       if (!CLASS_INTERFACE (TYPE_NAME (DECL_CONTEXT (found)))
6447           && ((METHOD_PUBLIC (found) && !METHOD_PUBLIC (method))
6448               || (METHOD_PROTECTED (found)
6449                   && !(METHOD_PUBLIC (method) || METHOD_PROTECTED (method)))
6450               || (!(aflags & (ACC_PUBLIC | ACC_PRIVATE | ACC_STATIC))
6451                   && METHOD_PRIVATE (method))))
6452         {
6453           parse_error_context
6454             (method_wfl,
6455              "Methods can't be overridden to be more private. Method `%s' is not %s in class `%s'", lang_printable_name (method, 0),
6456              (METHOD_PUBLIC (method) ? "public" :
6457               (METHOD_PRIVATE (method) ? "private" : "protected")),
6458              IDENTIFIER_POINTER (DECL_NAME
6459                                  (TYPE_NAME (DECL_CONTEXT (found)))));
6460           continue;
6461         }
6462
6463       /* Check this method against all the other implementations it
6464          overrides.  Here we only check the class hierarchy; the rest
6465          of the checking is done later.  If this method is just a
6466          Miranda method, we can skip the check.  */
6467       if (! METHOD_INVISIBLE (method))
6468         check_concrete_throws_clauses (class, method, DECL_NAME (method), sig);
6469     }
6470
6471   /* The above throws clause check only looked at superclasses.  Now
6472      we must also make sure that all methods declared in interfaces
6473      have compatible throws clauses.  FIXME: there are more efficient
6474      ways to organize this checking; we should implement one.  */
6475   check_interface_throws_clauses (class, class);
6476
6477   if (!TYPE_NVIRTUALS (class))
6478     TYPE_METHODS (class) = nreverse (TYPE_METHODS (class));
6479
6480   /* Search for inherited abstract method not yet implemented in this
6481      class.  */
6482   java_check_abstract_method_definitions (class_decl);
6483
6484   if (!saw_constructor)
6485     abort ();
6486 }
6487
6488 /* Check to make sure that all the methods in all the interfaces
6489    implemented by CLASS_DECL are compatible with the concrete
6490    implementations available in CHECK_CLASS_DECL.  */
6491 static void
6492 check_interface_throws_clauses (tree check_class_decl, tree class_decl)
6493 {
6494   for (; class_decl != NULL_TREE; class_decl = CLASSTYPE_SUPER (class_decl))
6495     {
6496       tree bases;
6497       int iface_len;
6498       int i;
6499
6500       if (! CLASS_LOADED_P (class_decl))
6501         {
6502           if (CLASS_FROM_SOURCE_P (class_decl))
6503             safe_layout_class (class_decl);
6504           else
6505             load_class (class_decl, 1);
6506         }
6507
6508       bases = TYPE_BINFO_BASETYPES (class_decl);
6509       iface_len = TREE_VEC_LENGTH (bases) - 1;
6510       for (i = iface_len; i > 0; --i)
6511         {
6512           tree interface = BINFO_TYPE (TREE_VEC_ELT (bases, i));
6513           tree iface_method;
6514
6515           for (iface_method = TYPE_METHODS (interface);
6516                iface_method != NULL_TREE;
6517                iface_method = TREE_CHAIN (iface_method))
6518             {
6519               tree sig, method;
6520
6521               /* First look for a concrete method implemented or
6522                  inherited by this class.  No need to search
6523                  interfaces here, since we're already looking through
6524                  all of them.  */
6525               sig = build_java_argument_signature (TREE_TYPE (iface_method));
6526               method
6527                 = lookup_argument_method_generic (check_class_decl,
6528                                                   DECL_NAME (iface_method),
6529                                                   sig, SEARCH_VISIBLE);
6530               /* If we don't find an implementation, that is ok.  Any
6531                  potential errors from that are diagnosed elsewhere.
6532                  Also, multiple inheritance with conflicting throws
6533                  clauses is fine in the absence of a concrete
6534                  implementation.  */
6535               if (method != NULL_TREE && !METHOD_ABSTRACT (method)
6536                   && !METHOD_INVISIBLE (iface_method))
6537                 {
6538                   tree method_wfl = DECL_FUNCTION_WFL (method);
6539                   check_throws_clauses (method, method_wfl, iface_method);
6540                 }
6541             }
6542
6543           /* Now check superinterfaces.  */
6544           check_interface_throws_clauses (check_class_decl, interface);
6545         }
6546     }
6547 }
6548
6549 /* Check throws clauses of a method against the clauses of all the
6550    methods it overrides.  We do this by searching up the class
6551    hierarchy, examining all matching accessible methods.  */
6552 static void
6553 check_concrete_throws_clauses (tree class, tree self_method,
6554                                tree name, tree signature)
6555 {
6556   tree method = lookup_argument_method_generic (class, name, signature,
6557                                                 SEARCH_SUPER | SEARCH_VISIBLE);
6558   while (method != NULL_TREE)
6559     {
6560       if (! METHOD_INVISIBLE (method) && hack_is_accessible_p (method, class))
6561         check_throws_clauses (self_method, DECL_FUNCTION_WFL (self_method),
6562                               method);
6563
6564       method = lookup_argument_method_generic (DECL_CONTEXT (method),
6565                                                name, signature,
6566                                                SEARCH_SUPER | SEARCH_VISIBLE);
6567     }
6568 }
6569
6570 /* Generate an error if the `throws' clause of METHOD (if any) is
6571    incompatible with the `throws' clause of FOUND (if any).  */
6572 static void
6573 check_throws_clauses (tree method, tree method_wfl, tree found)
6574 {
6575   tree mthrows;
6576
6577   /* Can't check these things with class loaded from bytecode. FIXME */
6578   if (!CLASS_FROM_SOURCE_P (DECL_CONTEXT (found)))
6579     return;
6580
6581   for (mthrows = DECL_FUNCTION_THROWS (method);
6582        mthrows; mthrows = TREE_CHAIN (mthrows))
6583     {
6584       tree fthrows;
6585
6586       /* We don't verify unchecked expressions */
6587       if (IS_UNCHECKED_EXCEPTION_P (TREE_VALUE (mthrows)))
6588         continue;
6589       /* Checked expression must be compatible */
6590       for (fthrows = DECL_FUNCTION_THROWS (found);
6591            fthrows; fthrows = TREE_CHAIN (fthrows))
6592         {
6593           if (inherits_from_p (TREE_VALUE (mthrows), TREE_VALUE (fthrows)))
6594             break;
6595         }
6596       if (!fthrows)
6597         {
6598           parse_error_context
6599             (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'",
6600              IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (TREE_VALUE (mthrows)))),
6601              lang_printable_name (found, 0),
6602              IDENTIFIER_POINTER
6603              (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found)))));
6604         }
6605     }
6606 }
6607
6608 /* Check abstract method of interface INTERFACE */
6609 static void
6610 java_check_abstract_methods (tree interface_decl)
6611 {
6612   int i, n;
6613   tree method, basetype_vec, found;
6614   tree interface = TREE_TYPE (interface_decl);
6615
6616   for (method = TYPE_METHODS (interface); method; method = TREE_CHAIN (method))
6617     {
6618       /* 2- Check for double definition inside the defining interface */
6619       if (check_method_redefinition (interface, method))
6620         continue;
6621
6622       /* 3- Overriding is OK as far as we preserve the return type.  */
6623       found = lookup_java_interface_method2 (interface, method);
6624       if (found)
6625         {
6626           char *t;
6627           t = xstrdup (lang_printable_name (TREE_TYPE (TREE_TYPE (found)), 0));
6628           parse_error_context
6629             (DECL_FUNCTION_WFL (found),
6630              "Method `%s' was defined with return type `%s' in class `%s'",
6631              lang_printable_name (found, 0), t,
6632              IDENTIFIER_POINTER
6633                (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found)))));
6634           free (t);
6635           continue;
6636         }
6637     }
6638
6639   /* 4- Inherited methods can't differ by their returned types */
6640   if (!(basetype_vec = TYPE_BINFO_BASETYPES (interface)))
6641     return;
6642   n = TREE_VEC_LENGTH (basetype_vec);
6643   for (i = 0; i < n; i++)
6644     {
6645       tree sub_interface_method, sub_interface;
6646       tree vec_elt = TREE_VEC_ELT (basetype_vec, i);
6647       if (!vec_elt)
6648         continue;
6649       sub_interface = BINFO_TYPE (vec_elt);
6650       for (sub_interface_method = TYPE_METHODS (sub_interface);
6651            sub_interface_method;
6652            sub_interface_method = TREE_CHAIN (sub_interface_method))
6653         {
6654           found = lookup_java_interface_method2 (interface,
6655                                                  sub_interface_method);
6656           if (found && (found != sub_interface_method))
6657             {
6658               parse_error_context
6659                 (lookup_cl (sub_interface_method),
6660                  "Interface `%s' inherits method `%s' from interface `%s'. This method is redefined with a different return type in interface `%s'",
6661                  IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (interface))),
6662                  lang_printable_name (found, 0),
6663                  IDENTIFIER_POINTER
6664                    (DECL_NAME (TYPE_NAME
6665                                (DECL_CONTEXT (sub_interface_method)))),
6666                  IDENTIFIER_POINTER
6667                    (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found)))));
6668             }
6669         }
6670     }
6671 }
6672
6673 /* Lookup methods in interfaces using their name and partial
6674    signature. Return a matching method only if their types differ.  */
6675
6676 static tree
6677 lookup_java_interface_method2 (tree class, tree method_decl)
6678 {
6679   int i, n;
6680   tree basetype_vec = TYPE_BINFO_BASETYPES (class), to_return;
6681
6682   if (!basetype_vec)
6683     return NULL_TREE;
6684
6685   n = TREE_VEC_LENGTH (basetype_vec);
6686   for (i = 0; i < n; i++)
6687     {
6688       tree vec_elt = TREE_VEC_ELT (basetype_vec, i), to_return;
6689       if ((BINFO_TYPE (vec_elt) != object_type_node)
6690           && (to_return =
6691               lookup_java_method2 (BINFO_TYPE (vec_elt), method_decl, 1)))
6692         return to_return;
6693     }
6694   for (i = 0; i < n; i++)
6695     {
6696       to_return = lookup_java_interface_method2
6697         (BINFO_TYPE (TREE_VEC_ELT (basetype_vec, i)), method_decl);
6698       if (to_return)
6699         return to_return;
6700     }
6701
6702   return NULL_TREE;
6703 }
6704
6705 /* Lookup method using their name and partial signature. Return a
6706    matching method only if their types differ.  */
6707
6708 static tree
6709 lookup_java_method2 (tree clas, tree method_decl, int do_interface)
6710 {
6711   tree method, method_signature, method_name, method_type, name;
6712
6713   method_signature = build_java_argument_signature (TREE_TYPE (method_decl));
6714   name = DECL_NAME (method_decl);
6715   method_name = (TREE_CODE (name) == EXPR_WITH_FILE_LOCATION ?
6716                  EXPR_WFL_NODE (name) : name);
6717   method_type = TREE_TYPE (TREE_TYPE (method_decl));
6718
6719   while (clas != NULL_TREE)
6720     {
6721       for (method = TYPE_METHODS (clas);
6722            method != NULL_TREE;  method = TREE_CHAIN (method))
6723         {
6724           tree method_sig = build_java_argument_signature (TREE_TYPE (method));
6725           tree name = DECL_NAME (method);
6726           if ((TREE_CODE (name) == EXPR_WITH_FILE_LOCATION ?
6727                EXPR_WFL_NODE (name) : name) == method_name
6728               && method_sig == method_signature
6729               && TREE_TYPE (TREE_TYPE (method)) != method_type)
6730             return method;
6731         }
6732       clas = (do_interface ? NULL_TREE : CLASSTYPE_SUPER (clas));
6733     }
6734   return NULL_TREE;
6735 }
6736
6737 /* Return the line that matches DECL line number, and try its best to
6738    position the column number. Used during error reports.  */
6739
6740 static GTY(()) tree cl_v;
6741 static tree
6742 lookup_cl (tree decl)
6743 {
6744   char *line, *found;
6745
6746   if (!decl)
6747     return NULL_TREE;
6748
6749   if (cl_v == NULL_TREE)
6750     {
6751       cl_v = build_expr_wfl (NULL_TREE, NULL, 0, 0);
6752     }
6753
6754   EXPR_WFL_FILENAME_NODE (cl_v) = get_identifier (DECL_SOURCE_FILE (decl));
6755   EXPR_WFL_SET_LINECOL (cl_v, DECL_SOURCE_LINE (decl), -1);
6756
6757   line = java_get_line_col (EXPR_WFL_FILENAME (cl_v),
6758                             EXPR_WFL_LINENO (cl_v), EXPR_WFL_COLNO (cl_v));
6759
6760   found = strstr ((const char *)line,
6761                   (const char *)IDENTIFIER_POINTER (DECL_NAME (decl)));
6762   if (found)
6763     EXPR_WFL_SET_LINECOL (cl_v, EXPR_WFL_LINENO (cl_v), found - line);
6764
6765   return cl_v;
6766 }
6767
6768 /* Look for a simple name in the single-type import list */
6769
6770 static tree
6771 find_name_in_single_imports (tree name)
6772 {
6773   tree node;
6774
6775   for (node = ctxp->import_list; node; node = TREE_CHAIN (node))
6776     if (TREE_VALUE (node) == name)
6777       return (EXPR_WFL_NODE (TREE_PURPOSE (node)));
6778
6779   return NULL_TREE;
6780 }
6781
6782 /* Process all single-type import. */
6783
6784 static int
6785 process_imports (void)
6786 {
6787   tree import;
6788   int error_found;
6789
6790   for (import = ctxp->import_list; import; import = TREE_CHAIN (import))
6791     {
6792       tree to_be_found = EXPR_WFL_NODE (TREE_PURPOSE (import));
6793       char *original_name;
6794
6795       original_name = xmemdup (IDENTIFIER_POINTER (to_be_found),
6796                                IDENTIFIER_LENGTH (to_be_found),
6797                                IDENTIFIER_LENGTH (to_be_found) + 1);
6798
6799       /* Don't load twice something already defined. */
6800       if (IDENTIFIER_CLASS_VALUE (to_be_found))
6801         continue;
6802
6803       while (1)
6804         {
6805           tree left;
6806
6807           QUALIFIED_P (to_be_found) = 1;
6808           load_class (to_be_found, 0);
6809           error_found =
6810             check_pkg_class_access (to_be_found, TREE_PURPOSE (import), true, NULL_TREE);
6811
6812           /* We found it, we can bail out */
6813           if (IDENTIFIER_CLASS_VALUE (to_be_found))
6814             {
6815               check_deprecation (TREE_PURPOSE (import),
6816                                  IDENTIFIER_CLASS_VALUE (to_be_found));
6817               break;
6818             }
6819
6820           /* We haven't found it. Maybe we're trying to access an
6821              inner class.  The only way for us to know is to try again
6822              after having dropped a qualifier. If we can't break it further,
6823              we have an error. */
6824           if (split_qualified_name (&left, NULL, to_be_found))
6825             break;
6826
6827           to_be_found = left;
6828         }
6829       if (!IDENTIFIER_CLASS_VALUE (to_be_found))
6830         {
6831           parse_error_context (TREE_PURPOSE (import),
6832                                "Class or interface `%s' not found in import",
6833                                original_name);
6834           error_found = 1;
6835         }
6836
6837       free (original_name);
6838       if (error_found)
6839         return 1;
6840     }
6841   return 0;
6842 }
6843
6844 /* Possibly find and mark a class imported by a single-type import
6845    statement.  */
6846
6847 static void
6848 find_in_imports (tree enclosing_type, tree class_type)
6849 {
6850   tree import = (enclosing_type ? TYPE_IMPORT_LIST (enclosing_type) :
6851                  ctxp->import_list);
6852   while (import)
6853     {
6854       if (TREE_VALUE (import) == TYPE_NAME (class_type))
6855         {
6856           TYPE_NAME (class_type) = EXPR_WFL_NODE (TREE_PURPOSE (import));
6857           QUALIFIED_P (TYPE_NAME (class_type)) = 1;
6858           return;
6859         }
6860       import = TREE_CHAIN (import);
6861     }
6862 }
6863
6864 static int
6865 note_possible_classname (const char *name, int len)
6866 {
6867   tree node;
6868   if (len > 5 && strncmp (&name [len-5], ".java", 5) == 0)
6869     len = len - 5;
6870   else if (len > 6 && strncmp (&name [len-6], ".class", 6) == 0)
6871     len = len - 6;
6872   else
6873     return 0;
6874   node = ident_subst (name, len, "", '/', '.', "");
6875   IS_A_CLASSFILE_NAME (node) = 1; /* Or soon to be */
6876   QUALIFIED_P (node) = strchr (name, '/') ? 1 : 0;
6877   return 1;
6878 }
6879
6880 /* Read a import directory, gathering potential match for further type
6881    references. Indifferently reads a filesystem or a ZIP archive
6882    directory.  */
6883
6884 static void
6885 read_import_dir (tree wfl)
6886 {
6887   tree package_id = EXPR_WFL_NODE (wfl);
6888   const char *package_name = IDENTIFIER_POINTER (package_id);
6889   int package_length = IDENTIFIER_LENGTH (package_id);
6890   DIR *dirp = NULL;
6891   JCF *saved_jcf = current_jcf;
6892
6893   int found = 0;
6894   int k;
6895   void *entry;
6896   struct buffer filename[1];
6897
6898   if (IS_AN_IMPORT_ON_DEMAND_P (package_id))
6899     return;
6900   IS_AN_IMPORT_ON_DEMAND_P (package_id) = 1;
6901
6902   BUFFER_INIT (filename);
6903   buffer_grow (filename, package_length + 100);
6904
6905   for (entry = jcf_path_start (); entry != NULL; entry = jcf_path_next (entry))
6906     {
6907       const char *entry_name = jcf_path_name (entry);
6908       int entry_length = strlen (entry_name);
6909       if (jcf_path_is_zipfile (entry))
6910         {
6911           ZipFile *zipf;
6912           buffer_grow (filename, entry_length);
6913           memcpy (filename->data, entry_name, entry_length - 1);
6914           filename->data[entry_length-1] = '\0';
6915           zipf = opendir_in_zip (filename->data, jcf_path_is_system (entry));
6916           if (zipf == NULL)
6917             error ("malformed .zip archive in CLASSPATH: %s", entry_name);
6918           else
6919             {
6920               ZipDirectory *zipd = (ZipDirectory *) zipf->central_directory;
6921               BUFFER_RESET (filename);
6922               for (k = 0; k < package_length; k++)
6923                 {
6924                   char ch = package_name[k];
6925                   *filename->ptr++ = ch == '.' ? '/' : ch;
6926                 }
6927               *filename->ptr++ = '/';
6928
6929               for (k = 0; k < zipf->count;  k++, zipd = ZIPDIR_NEXT (zipd))
6930                 {
6931                   const char *current_entry = ZIPDIR_FILENAME (zipd);
6932                   int current_entry_len = zipd->filename_length;
6933
6934                   if (current_entry_len >= BUFFER_LENGTH (filename)
6935                       && strncmp (filename->data, current_entry,
6936                                   BUFFER_LENGTH (filename)) != 0)
6937                     continue;
6938                   found |= note_possible_classname (current_entry,
6939                                                     current_entry_len);
6940                 }
6941             }
6942         }
6943       else
6944         {
6945           BUFFER_RESET (filename);
6946           buffer_grow (filename, entry_length + package_length + 4);
6947           strcpy (filename->data, entry_name);
6948           filename->ptr = filename->data + entry_length;
6949           for (k = 0; k < package_length; k++)
6950             {
6951               char ch = package_name[k];
6952               *filename->ptr++ = ch == '.' ? '/' : ch;
6953             }
6954           *filename->ptr = '\0';
6955
6956           dirp = opendir (filename->data);
6957           if (dirp == NULL)
6958             continue;
6959           *filename->ptr++ = '/';
6960           for (;;)
6961             {
6962               int len;
6963               const char *d_name;
6964               struct dirent *direntp = readdir (dirp);
6965               if (!direntp)
6966                 break;
6967               d_name = direntp->d_name;
6968               len = strlen (direntp->d_name);
6969               buffer_grow (filename, len+1);
6970               strcpy (filename->ptr, d_name);
6971               found |= note_possible_classname (filename->data + entry_length,
6972                                                 package_length+len+1);
6973             }
6974           if (dirp)
6975             closedir (dirp);
6976         }
6977     }
6978
6979   free (filename->data);
6980
6981   /* Here we should have a unified way of retrieving an entry, to be
6982      indexed. */
6983   if (!found)
6984     {
6985       static int first = 1;
6986       if (first)
6987         {
6988           error ("Can't find default package `%s'. Check the CLASSPATH environment variable and the access to the archives", package_name);
6989           java_error_count++;
6990           first = 0;
6991         }
6992       else
6993         parse_error_context (wfl, "Package `%s' not found in import",
6994                              package_name);
6995       current_jcf = saved_jcf;
6996       return;
6997     }
6998   current_jcf = saved_jcf;
6999 }
7000
7001 /* Possibly find a type in the import on demands specified
7002    types. Returns 1 if an error occurred, 0 otherwise. Run through the
7003    entire list, to detected potential double definitions.  */
7004
7005 static int
7006 find_in_imports_on_demand (tree enclosing_type, tree class_type)
7007 {
7008   tree class_type_name = TYPE_NAME (class_type);
7009   tree import = (enclosing_type ? TYPE_IMPORT_DEMAND_LIST (enclosing_type) :
7010                   ctxp->import_demand_list);
7011   tree cl = NULL_TREE;
7012   int seen_once = -1;   /* -1 when not set, 1 if seen once, >1 otherwise. */
7013   int to_return = -1;   /* -1 when not set, 0 or 1 otherwise */
7014   tree node;
7015
7016   for (; import; import = TREE_CHAIN (import))
7017     {
7018       int saved_lineno = input_line;
7019       int access_check;
7020       const char *id_name;
7021       tree decl, type_name_copy;
7022
7023       obstack_grow (&temporary_obstack,
7024                     IDENTIFIER_POINTER (EXPR_WFL_NODE (TREE_PURPOSE (import))),
7025                     IDENTIFIER_LENGTH (EXPR_WFL_NODE (TREE_PURPOSE (import))));
7026       obstack_1grow (&temporary_obstack, '.');
7027       obstack_grow0 (&temporary_obstack,
7028                      IDENTIFIER_POINTER (class_type_name),
7029                      IDENTIFIER_LENGTH (class_type_name));
7030       id_name = obstack_finish (&temporary_obstack);
7031
7032       if (! (node = maybe_get_identifier (id_name)))
7033         continue;
7034
7035       /* Setup input_line so that it refers to the line of the import (in
7036          case we parse a class file and encounter errors */
7037       input_line = EXPR_WFL_LINENO (TREE_PURPOSE (import));
7038
7039       type_name_copy = TYPE_NAME (class_type);
7040       TYPE_NAME (class_type) = node;
7041       QUALIFIED_P (node) = 1;
7042       decl = IDENTIFIER_CLASS_VALUE (node);
7043       access_check = -1;
7044       /* If there is no DECL set for the class or if the class isn't
7045          loaded and not seen in source yet, then load */
7046       if (!decl || ! CLASS_LOADED_P (TREE_TYPE (decl)))
7047         {
7048           load_class (node, 0);
7049           decl = IDENTIFIER_CLASS_VALUE (node);
7050         }
7051       if (decl && ! INNER_CLASS_P (TREE_TYPE (decl)))
7052         access_check = check_pkg_class_access (node, TREE_PURPOSE (import),
7053                                                false, NULL_TREE);
7054       else
7055         /* 6.6.1: Inner classes are subject to member access rules. */
7056         access_check = 0;
7057
7058       input_line = saved_lineno;
7059
7060       /* If the loaded class is not accessible or couldn't be loaded,
7061          we restore the original TYPE_NAME and process the next
7062          import. */
7063       if (access_check || !decl)
7064         {
7065           TYPE_NAME (class_type) = type_name_copy;
7066           continue;
7067         }
7068
7069       /* If the loaded class is accessible, we keep a tab on it to
7070          detect and report multiple inclusions. */
7071       if (IS_A_CLASSFILE_NAME (node))
7072         {
7073           if (seen_once < 0)
7074             {
7075               cl = TREE_PURPOSE (import);
7076               seen_once = 1;
7077             }
7078           else if (seen_once >= 0)
7079             {
7080               tree location = (cl ? cl : TREE_PURPOSE (import));
7081               tree package = (cl ? EXPR_WFL_NODE (cl) :
7082                               EXPR_WFL_NODE (TREE_PURPOSE (import)));
7083               seen_once++;
7084               parse_error_context
7085                 (location,
7086                  "Type `%s' also potentially defined in package `%s'",
7087                  IDENTIFIER_POINTER (TYPE_NAME (class_type)),
7088                  IDENTIFIER_POINTER (package));
7089             }
7090         }
7091       to_return = access_check;
7092     }
7093
7094   if (seen_once == 1)
7095     return to_return;
7096   else
7097     return (seen_once < 0 ? 0 : seen_once); /* It's ok not to have found */
7098 }
7099
7100 /* Add package NAME to the list of packages encountered so far. To
7101    speed up class lookup in do_resolve_class, we make sure a
7102    particular package is added only once.  */
7103
7104 static void
7105 register_package (tree name)
7106 {
7107   static htab_t pht;
7108   void **e;
7109
7110   if (pht == NULL)
7111     pht = htab_create (50, htab_hash_pointer, htab_eq_pointer, NULL);
7112
7113   e = htab_find_slot (pht, name, INSERT);
7114   if (*e == NULL)
7115     {
7116       package_list = chainon (package_list, build_tree_list (name, NULL));
7117       *e = name;
7118     }
7119 }
7120
7121 static tree
7122 resolve_package (tree pkg, tree *next, tree *type_name)
7123 {
7124   tree current;
7125   tree decl = NULL_TREE;
7126   *type_name = NULL_TREE;
7127
7128   /* The trick is to determine when the package name stops and were
7129      the name of something contained in the package starts. Then we
7130      return a fully qualified name of what we want to get. */
7131
7132   *next = EXPR_WFL_QUALIFICATION (pkg);
7133
7134   /* Try to progressively construct a type name */
7135   if (TREE_CODE (pkg) == EXPR_WITH_FILE_LOCATION)
7136     for (current = EXPR_WFL_QUALIFICATION (pkg);
7137          current; current = TREE_CHAIN (current))
7138       {
7139         /* If we don't have what we're expecting, exit now. TYPE_NAME
7140            will be null and the error caught later. */
7141         if (TREE_CODE (QUAL_WFL (current)) != EXPR_WITH_FILE_LOCATION)
7142           break;
7143         *type_name =
7144           merge_qualified_name (*type_name, EXPR_WFL_NODE (QUAL_WFL (current)));
7145         if ((decl = resolve_no_layout (*type_name, NULL_TREE)))
7146           {
7147             /* resolve_package should be used in a loop, hence we
7148                point at this one to naturally process the next one at
7149                the next iteration. */
7150             *next = current;
7151             break;
7152           }
7153       }
7154   return decl;
7155 }
7156
7157
7158 /* Check accessibility of inner classes according to member access rules.
7159    DECL is the inner class, ENCLOSING_DECL is the class from which the
7160    access is being attempted. */
7161
7162 static void
7163 check_inner_class_access (tree decl, tree enclosing_decl, tree cl)
7164 {
7165   const char *access;
7166   tree enclosing_decl_type;
7167
7168   /* We don't issue an error message when CL is null. CL can be null
7169      as a result of processing a JDEP crafted by source_start_java_method
7170      for the purpose of patching its parm decl. But the error would
7171      have been already trapped when fixing the method's signature.
7172      DECL can also be NULL in case of earlier errors. */
7173   if (!decl || !cl)
7174     return;
7175
7176   enclosing_decl_type = TREE_TYPE (enclosing_decl);
7177
7178   if (CLASS_PRIVATE (decl))
7179     {
7180       /* Access is permitted only within the body of the top-level
7181          class in which DECL is declared. */
7182       tree top_level = decl;
7183       while (DECL_CONTEXT (top_level))
7184         top_level = DECL_CONTEXT (top_level);
7185       while (DECL_CONTEXT (enclosing_decl))
7186         enclosing_decl = DECL_CONTEXT (enclosing_decl);
7187       if (top_level == enclosing_decl)
7188         return;
7189       access = "private";
7190     }
7191   else if (CLASS_PROTECTED (decl))
7192     {
7193       tree decl_context;
7194       /* Access is permitted from within the same package... */
7195       if (in_same_package (decl, enclosing_decl))
7196         return;
7197
7198       /* ... or from within the body of a subtype of the context in which
7199          DECL is declared. */
7200       decl_context = DECL_CONTEXT (decl);
7201       while (enclosing_decl)
7202         {
7203           if (CLASS_INTERFACE (decl))
7204             {
7205               if (interface_of_p (TREE_TYPE (decl_context),
7206                                   enclosing_decl_type))
7207                 return;
7208             }
7209           else
7210             {
7211               /* Eww. The order of the arguments is different!! */
7212               if (inherits_from_p (enclosing_decl_type,
7213                                    TREE_TYPE (decl_context)))
7214                 return;
7215             }
7216           enclosing_decl = DECL_CONTEXT (enclosing_decl);
7217         }
7218       access = "protected";
7219     }
7220   else if (! CLASS_PUBLIC (decl))
7221     {
7222       /* Access is permitted only from within the same package as DECL. */
7223       if (in_same_package (decl, enclosing_decl))
7224         return;
7225       access = "non-public";
7226     }
7227   else
7228     /* Class is public. */
7229     return;
7230
7231   parse_error_context (cl, "Nested %s %s is %s; cannot be accessed from here",
7232                        (CLASS_INTERFACE (decl) ? "interface" : "class"),
7233                        lang_printable_name (decl, 0), access);
7234 }
7235
7236 /* Accessibility check for top-level classes. If CLASS_NAME is in a
7237    foreign package, it must be PUBLIC. Return 0 if no access
7238    violations were found, 1 otherwise. If VERBOSE is true and an error
7239    was found, it is reported and accounted for.  If CL is NULL then
7240    look it up with THIS_DECL.  */
7241
7242 static int
7243 check_pkg_class_access (tree class_name, tree cl, bool verbose, tree this_decl)
7244 {
7245   tree type;
7246
7247   if (!IDENTIFIER_CLASS_VALUE (class_name))
7248     return 0;
7249
7250   if (!(type = TREE_TYPE (IDENTIFIER_CLASS_VALUE (class_name))))
7251     return 0;
7252
7253   if (!CLASS_PUBLIC (TYPE_NAME (type)))
7254     {
7255       /* Access to a private class within the same package is
7256          allowed. */
7257       tree l, r;
7258       split_qualified_name (&l, &r, class_name);
7259       if (!QUALIFIED_P (class_name) && !ctxp->package)
7260         /* Both in the empty package. */
7261         return 0;
7262       if (l == ctxp->package)
7263         /* Both in the same package. */
7264         return 0;
7265
7266       if (verbose)
7267         parse_error_context
7268           (cl == NULL ? lookup_cl (this_decl): cl,
7269            "Can't access %s `%s'. Only public classes and interfaces in other packages can be accessed",
7270            (CLASS_INTERFACE (TYPE_NAME (type)) ? "interface" : "class"),
7271            IDENTIFIER_POINTER (class_name));
7272       return 1;
7273     }
7274   return 0;
7275 }
7276
7277 /* Local variable declaration. */
7278
7279 static void
7280 declare_local_variables (int modifier, tree type, tree vlist)
7281 {
7282   tree decl, current, saved_type;
7283   tree type_wfl = NULL_TREE;
7284   int must_chain = 0;
7285   int final_p = 0;
7286
7287   /* Push a new block if statements were seen between the last time we
7288      pushed a block and now. Keep a count of blocks to close */
7289   if (BLOCK_EXPR_BODY (GET_CURRENT_BLOCK (current_function_decl)))
7290     {
7291       tree b = enter_block ();
7292       BLOCK_IS_IMPLICIT (b) = 1;
7293     }
7294
7295   if (modifier)
7296     {
7297       size_t i;
7298       for (i = 0; i < ARRAY_SIZE (ctxp->modifier_ctx); i++)
7299         if (1 << i & modifier)
7300           break;
7301       if (modifier == ACC_FINAL)
7302         final_p = 1;
7303       else
7304         {
7305           parse_error_context
7306             (ctxp->modifier_ctx [i],
7307              "Only `final' is allowed as a local variables modifier");
7308           return;
7309         }
7310     }
7311
7312   /* Obtain an incomplete type if TYPE is not complete. TYPE_WFL will
7313      hold the TYPE value if a new incomplete has to be created (as
7314      opposed to being found already existing and reused). */
7315   SET_TYPE_FOR_RESOLUTION (type, type_wfl, must_chain);
7316
7317   /* If TYPE is fully resolved and we don't have a reference, make one */
7318   PROMOTE_RECORD_IF_COMPLETE (type, must_chain);
7319
7320   /* Go through all the declared variables */
7321   for (current = vlist, saved_type = type; current;
7322        current = TREE_CHAIN (current), type = saved_type)
7323     {
7324       tree other, real_type;
7325       tree wfl  = TREE_PURPOSE (current);
7326       tree name = EXPR_WFL_NODE (wfl);
7327       tree init = TREE_VALUE (current);
7328
7329       /* Process NAME, as it may specify extra dimension(s) for it */
7330       type = build_array_from_name (type, type_wfl, name, &name);
7331
7332       /* Variable redefinition check */
7333       if ((other = lookup_name_in_blocks (name)))
7334         {
7335           variable_redefinition_error (wfl, name, TREE_TYPE (other),
7336                                        DECL_SOURCE_LINE (other));
7337           continue;
7338         }
7339
7340       /* Type adjustment. We may have just readjusted TYPE because
7341          the variable specified more dimensions. Make sure we have
7342          a reference if we can and don't have one already. */
7343       PROMOTE_RECORD_IF_COMPLETE (type, must_chain);
7344
7345       real_type = GET_REAL_TYPE (type);
7346       /* Never layout this decl. This will be done when its scope
7347          will be entered */
7348       decl = build_decl (VAR_DECL, name, real_type);
7349       MAYBE_CREATE_VAR_LANG_DECL_SPECIFIC (decl);
7350       DECL_FINAL (decl) = final_p;
7351       BLOCK_CHAIN_DECL (decl);
7352
7353       /* If doing xreferencing, replace the line number with the WFL
7354          compound value */
7355       if (flag_emit_xref)
7356         DECL_SOURCE_LINE (decl) = EXPR_WFL_LINECOL (wfl);
7357
7358       /* Don't try to use an INIT statement when an error was found */
7359       if (init && java_error_count)
7360         init = NULL_TREE;
7361
7362       /* Remember it if this is an initialized-upon-declaration final
7363          variable.  */
7364       if (init && final_p)
7365         {
7366           DECL_LOCAL_FINAL_IUD (decl) = 1;
7367         }
7368
7369       /* Add the initialization function to the current function's code */
7370       if (init)
7371         {
7372           /* Name might have been readjusted */
7373           EXPR_WFL_NODE (TREE_OPERAND (init, 0)) = name;
7374           MODIFY_EXPR_FROM_INITIALIZATION_P (init) = 1;
7375           java_method_add_stmt (current_function_decl,
7376                                 build_debugable_stmt (EXPR_WFL_LINECOL (init),
7377                                                       init));
7378         }
7379
7380       /* Setup dependency the type of the decl */
7381       if (must_chain)
7382         {
7383           jdep *dep;
7384           register_incomplete_type (JDEP_VARIABLE, type_wfl, decl, type);
7385           dep = CLASSD_LAST (ctxp->classd_list);
7386           JDEP_GET_PATCH (dep) = &TREE_TYPE (decl);
7387         }
7388     }
7389   SOURCE_FRONTEND_DEBUG (("Defined locals"));
7390 }
7391
7392 /* Called during parsing. Build decls from argument list.  */
7393
7394 static void
7395 source_start_java_method (tree fndecl)
7396 {
7397   tree tem;
7398   tree parm_decl;
7399   int i;
7400
7401   if (!fndecl)
7402     return;
7403
7404   current_function_decl = fndecl;
7405
7406   /* New scope for the function */
7407   enter_block ();
7408   for (tem = TYPE_ARG_TYPES (TREE_TYPE (fndecl)), i = 0;
7409        tem != end_params_node; tem = TREE_CHAIN (tem), i++)
7410     {
7411       tree type = TREE_VALUE (tem);
7412       tree name = TREE_PURPOSE (tem);
7413
7414       /* If type is incomplete. Create an incomplete decl and ask for
7415          the decl to be patched later */
7416       if (INCOMPLETE_TYPE_P (type))
7417         {
7418           jdep *jdep;
7419           tree real_type = GET_REAL_TYPE (type);
7420           parm_decl = build_decl (PARM_DECL, name, real_type);
7421           type = obtain_incomplete_type (type);
7422           register_incomplete_type (JDEP_PARM, NULL_TREE, NULL_TREE, type);
7423           jdep = CLASSD_LAST (ctxp->classd_list);
7424           JDEP_MISC (jdep) = name;
7425           JDEP_GET_PATCH (jdep) = &TREE_TYPE (parm_decl);
7426         }
7427       else
7428         parm_decl = build_decl (PARM_DECL, name, type);
7429
7430       /* Remember if a local variable was declared final (via its
7431          TREE_LIST of type/name.) Set DECL_FINAL accordingly. */
7432       if (ARG_FINAL_P (tem))
7433         {
7434           MAYBE_CREATE_VAR_LANG_DECL_SPECIFIC (parm_decl);
7435           DECL_FINAL (parm_decl) = 1;
7436         }
7437
7438       BLOCK_CHAIN_DECL (parm_decl);
7439     }
7440   tem = BLOCK_EXPR_DECLS (DECL_FUNCTION_BODY (current_function_decl));
7441   BLOCK_EXPR_DECLS (DECL_FUNCTION_BODY (current_function_decl)) =
7442     nreverse (tem);
7443   DECL_ARG_SLOT_COUNT (current_function_decl) = i;
7444   DECL_MAX_LOCALS (current_function_decl) = i;
7445 }
7446
7447 /* Called during parsing. Creates an artificial method declaration.  */
7448
7449 static tree
7450 create_artificial_method (tree class, int flags, tree type,
7451                           tree name, tree args)
7452 {
7453   tree mdecl;
7454
7455   java_parser_context_save_global ();
7456   input_line = 0;
7457   mdecl = make_node (FUNCTION_TYPE);
7458   TREE_TYPE (mdecl) = type;
7459   TYPE_ARG_TYPES (mdecl) = args;
7460   mdecl = add_method (class, flags, name, build_java_signature (mdecl));
7461   java_parser_context_restore_global ();
7462   DECL_ARTIFICIAL (mdecl) = 1;
7463   return mdecl;
7464 }
7465
7466 /* Starts the body if an artificial method.  */
7467
7468 static void
7469 start_artificial_method_body (tree mdecl)
7470 {
7471   DECL_SOURCE_LINE (mdecl) = 1;
7472   DECL_FUNCTION_LAST_LINE (mdecl) = 1;
7473   source_start_java_method (mdecl);
7474   enter_block ();
7475 }
7476
7477 static void
7478 end_artificial_method_body (tree mdecl)
7479 {
7480   /* exit_block modifies DECL_FUNCTION_BODY (current_function_decl).
7481      It has to be evaluated first. (if mdecl is current_function_decl,
7482      we have an undefined behavior if no temporary variable is used.) */
7483   tree b = exit_block ();
7484   BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (mdecl)) = b;
7485   exit_block ();
7486 }
7487
7488 /* Dump a tree of some kind.  This is a convenience wrapper for the
7489    dump_* functions in tree-dump.c.  */
7490 static void
7491 dump_java_tree (enum tree_dump_index phase, tree t)
7492 {
7493   FILE *stream;
7494   int flags;
7495
7496   stream = dump_begin (phase, &flags);
7497   flags |= TDF_SLIM;
7498   if (stream)
7499     {
7500       dump_node (t, flags, stream);
7501       dump_end (phase, stream);
7502     }
7503 }
7504
7505 /* Terminate a function and expand its body.  */
7506
7507 static void
7508 source_end_java_method (void)
7509 {
7510   tree fndecl = current_function_decl;
7511
7512   if (!fndecl)
7513     return;
7514
7515   java_parser_context_save_global ();
7516   input_line = ctxp->last_ccb_indent1;
7517
7518   /* Turn function bodies with only a NOP expr null, so they don't get
7519      generated at all and we won't get warnings when using the -W
7520      -Wall flags. */
7521   if (IS_EMPTY_STMT (BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (fndecl))))
7522     BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (fndecl)) = NULL_TREE;
7523
7524   if (BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (fndecl))
7525       && ! flag_emit_class_files
7526       && ! flag_emit_xref)
7527     finish_method (fndecl);
7528
7529   current_function_decl = NULL_TREE;
7530   java_parser_context_restore_global ();
7531   current_function_decl = NULL_TREE;
7532 }
7533
7534 /* Record EXPR in the current function block. Complements compound
7535    expression second operand if necessary.  */
7536
7537 tree
7538 java_method_add_stmt (tree fndecl, tree expr)
7539 {
7540   if (!GET_CURRENT_BLOCK (fndecl))
7541     return NULL_TREE;
7542   return add_stmt_to_block (GET_CURRENT_BLOCK (fndecl), NULL_TREE, expr);
7543 }
7544
7545 static tree
7546 add_stmt_to_block (tree b, tree type, tree stmt)
7547 {
7548   tree body = BLOCK_EXPR_BODY (b), c;
7549
7550   if (java_error_count)
7551     return body;
7552
7553   if ((c = add_stmt_to_compound (body, type, stmt)) == body)
7554     return body;
7555
7556   BLOCK_EXPR_BODY (b) = c;
7557   TREE_SIDE_EFFECTS (c) = 1;
7558   return c;
7559 }
7560
7561 /* Lays out the methods for the classes seen so far.  */
7562
7563 void
7564 java_layout_seen_class_methods (void)
7565 {
7566   tree previous_list = all_class_list;
7567   tree end = NULL_TREE;
7568   tree current;
7569
7570   while (1)
7571     {
7572       for (current = previous_list;
7573            current != end; current = TREE_CHAIN (current))
7574         {
7575           tree cls = TREE_TYPE (TREE_VALUE (current));
7576
7577           if (! CLASS_LOADED_P (cls))
7578             load_class (cls, 0);
7579
7580           layout_class_methods (cls);
7581         }
7582
7583       /* Note that new classes might have been added while laying out
7584          methods, changing the value of all_class_list.  */
7585
7586       if (previous_list != all_class_list)
7587         {
7588           end = previous_list;
7589           previous_list = all_class_list;
7590         }
7591       else
7592         break;
7593     }
7594 }
7595
7596 static GTY(()) tree stop_reordering;
7597 void
7598 java_reorder_fields (void)
7599 {
7600   tree current;
7601
7602   for (current = gclass_list; current; current = TREE_CHAIN (current))
7603     {
7604       output_class = current_class = TREE_TYPE (TREE_VALUE (current));
7605
7606       if (current_class == stop_reordering)
7607         break;
7608
7609       /* Reverse the fields, but leave the dummy field in front.
7610          Fields are already ordered for Object and Class */
7611       if (TYPE_FIELDS (current_class) && current_class != object_type_node
7612           && current_class != class_type_node)
7613       {
7614         /* If the dummy field is there, reverse the right fields and
7615            just layout the type for proper fields offset */
7616         if (!DECL_NAME (TYPE_FIELDS (current_class)))
7617           {
7618             tree fields = TYPE_FIELDS (current_class);
7619             TREE_CHAIN (fields) = nreverse (TREE_CHAIN (fields));
7620             TYPE_SIZE (current_class) = NULL_TREE;
7621           }
7622         /* We don't have a dummy field, we need to layout the class,
7623            after having reversed the fields */
7624         else
7625           {
7626             TYPE_FIELDS (current_class) =
7627               nreverse (TYPE_FIELDS (current_class));
7628             TYPE_SIZE (current_class) = NULL_TREE;
7629           }
7630       }
7631     }
7632   /* There are cases were gclass_list will be empty. */
7633   if (gclass_list)
7634     stop_reordering = TREE_TYPE (TREE_VALUE (gclass_list));
7635 }
7636
7637 /* Layout the methods of all classes loaded in one way or another.
7638    Check methods of source parsed classes. Then reorder the
7639    fields and layout the classes or the type of all source parsed
7640    classes */
7641
7642 void
7643 java_layout_classes (void)
7644 {
7645   tree current;
7646   int save_error_count = java_error_count;
7647
7648   /* Layout the methods of all classes seen so far */
7649   java_layout_seen_class_methods ();
7650   java_parse_abort_on_error ();
7651   all_class_list = NULL_TREE;
7652
7653   /* Then check the methods of all parsed classes */
7654   for (current = gclass_list; current; current = TREE_CHAIN (current))
7655     if (CLASS_FROM_SOURCE_P (TREE_TYPE (TREE_VALUE (current))))
7656       java_check_methods (TREE_VALUE (current));
7657   java_parse_abort_on_error ();
7658
7659   for (current = gclass_list; current; current = TREE_CHAIN (current))
7660     {
7661       output_class = current_class = TREE_TYPE (TREE_VALUE (current));
7662       layout_class (current_class);
7663
7664       /* Error reported by the caller */
7665       if (java_error_count)
7666         return;
7667     }
7668
7669   /* We might have reloaded classes durign the process of laying out
7670      classes for code generation. We must layout the methods of those
7671      late additions, as constructor checks might use them */
7672   java_layout_seen_class_methods ();
7673   java_parse_abort_on_error ();
7674 }
7675
7676 /* Expand methods in the current set of classes remembered for
7677    generation.  */
7678
7679 static void
7680 java_complete_expand_classes (void)
7681 {
7682   tree current;
7683
7684   do_not_fold = flag_emit_xref;
7685
7686   for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
7687     if (!INNER_CLASS_DECL_P (current))
7688       java_complete_expand_class (current);
7689 }
7690
7691 /* Expand the methods found in OUTER, starting first by OUTER's inner
7692    classes, if any.  */
7693
7694 static void
7695 java_complete_expand_class (tree outer)
7696 {
7697   tree inner_list;
7698
7699   /* We need to go after all inner classes and start expanding them,
7700      starting with most nested ones. We have to do that because nested
7701      classes might add functions to outer classes */
7702
7703   for (inner_list = DECL_INNER_CLASS_LIST (outer);
7704        inner_list; inner_list = TREE_CHAIN (inner_list))
7705     java_complete_expand_class (TREE_PURPOSE (inner_list));
7706
7707   java_complete_expand_methods (outer);
7708 }
7709
7710 /* Expand methods registered in CLASS_DECL. The general idea is that
7711    we expand regular methods first. This allows us get an estimate on
7712    how outer context local alias fields are really used so we can add
7713    to the constructor just enough code to initialize them properly (it
7714    also lets us generate finit$ correctly.) Then we expand the
7715    constructors and then <clinit>.  */
7716
7717 static void
7718 java_complete_expand_methods (tree class_decl)
7719 {
7720   tree clinit, decl, first_decl;
7721
7722   output_class = current_class = TREE_TYPE (class_decl);
7723
7724   /* Pre-expand <clinit> to figure whether we really need it or
7725      not. If we do need it, we pre-expand the static fields so they're
7726      ready to be used somewhere else. <clinit> will be fully expanded
7727      after we processed the constructors. */
7728   first_decl = TYPE_METHODS (current_class);
7729   clinit = maybe_generate_pre_expand_clinit (current_class);
7730
7731   /* Then generate finit$ (if we need to) because constructors will
7732    try to use it.*/
7733   if (TYPE_FINIT_STMT_LIST (current_class))
7734     java_complete_expand_method (generate_finit (current_class));
7735
7736   /* Then generate instinit$ (if we need to) because constructors will
7737      try to use it. */
7738   if (TYPE_II_STMT_LIST (current_class))
7739     java_complete_expand_method (generate_instinit (current_class));
7740
7741   /* Now do the constructors */
7742   for (decl = first_decl ; !java_error_count && decl; decl = TREE_CHAIN (decl))
7743     {
7744       int no_body;
7745
7746       if (!DECL_CONSTRUCTOR_P (decl))
7747         continue;
7748
7749       no_body = !DECL_FUNCTION_BODY (decl);
7750       /* Don't generate debug info on line zero when expanding a
7751          generated constructor. */
7752       if (no_body)
7753         restore_line_number_status (1);
7754
7755       java_complete_expand_method (decl);
7756
7757       if (no_body)
7758         restore_line_number_status (0);
7759     }
7760
7761   /* First, do the ordinary methods. */
7762   for (decl = first_decl; decl; decl = TREE_CHAIN (decl))
7763     {
7764       /* Ctors aren't part of this batch. */
7765       if (DECL_CONSTRUCTOR_P (decl) || DECL_CLINIT_P (decl))
7766         continue;
7767
7768       /* Skip abstract or native methods -- but do handle native
7769          methods when generating JNI stubs.  */
7770       if (METHOD_ABSTRACT (decl) || (! flag_jni && METHOD_NATIVE (decl)))
7771         {
7772           DECL_FUNCTION_BODY (decl) = NULL_TREE;
7773           continue;
7774         }
7775
7776       if (METHOD_NATIVE (decl))
7777         {
7778           tree body;
7779           current_function_decl = decl;
7780           body = build_jni_stub (decl);
7781           BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (decl)) = body;
7782         }
7783
7784       java_complete_expand_method (decl);
7785     }
7786
7787   /* If there is indeed a <clinit>, fully expand it now */
7788   if (clinit)
7789     {
7790       /* Prevent the use of `this' inside <clinit> */
7791       ctxp->explicit_constructor_p = 1;
7792       java_complete_expand_method (clinit);
7793       ctxp->explicit_constructor_p = 0;
7794     }
7795
7796   /* We might have generated a class$ that we now want to expand */
7797   if (TYPE_DOT_CLASS (current_class))
7798     java_complete_expand_method (TYPE_DOT_CLASS (current_class));
7799
7800   /* Now verify constructor circularity (stop after the first one we
7801      prove wrong.) */
7802   if (!CLASS_INTERFACE (class_decl))
7803     for (decl = TYPE_METHODS (current_class); decl; decl = TREE_CHAIN (decl))
7804       if (DECL_CONSTRUCTOR_P (decl)
7805           && verify_constructor_circularity (decl, decl))
7806         break;
7807 }
7808
7809 /* Attempt to create <clinit>. Pre-expand static fields so they can be
7810    safely used in some other methods/constructors.  */
7811
7812 static tree
7813 maybe_generate_pre_expand_clinit (tree class_type)
7814 {
7815   tree current, mdecl;
7816
7817   if (!TYPE_CLINIT_STMT_LIST (class_type))
7818     return NULL_TREE;
7819
7820   /* Go through all static fields and pre expand them */
7821   for (current = TYPE_FIELDS (class_type); current;
7822        current = TREE_CHAIN (current))
7823     if (FIELD_STATIC (current))
7824       build_field_ref (NULL_TREE, class_type, DECL_NAME (current));
7825
7826   /* Then build the <clinit> method */
7827   mdecl = create_artificial_method (class_type, ACC_STATIC, void_type_node,
7828                                     clinit_identifier_node, end_params_node);
7829   layout_class_method (class_type, CLASSTYPE_SUPER (class_type),
7830                        mdecl, NULL_TREE);
7831   start_artificial_method_body (mdecl);
7832
7833   /* We process the list of assignment we produced as the result of
7834      the declaration of initialized static field and add them as
7835      statement to the <clinit> method. */
7836   for (current = TYPE_CLINIT_STMT_LIST (class_type); current;
7837        current = TREE_CHAIN (current))
7838     {
7839       tree stmt = current;
7840       /* We build the assignment expression that will initialize the
7841          field to its value. There are strict rules on static
7842          initializers (8.5). FIXME */
7843       if (TREE_CODE (stmt) != BLOCK && !IS_EMPTY_STMT (stmt))
7844         stmt = build_debugable_stmt (EXPR_WFL_LINECOL (stmt), stmt);
7845       java_method_add_stmt (mdecl, stmt);
7846     }
7847
7848   end_artificial_method_body (mdecl);
7849
7850   /* Now we want to place <clinit> as the last method (because we need
7851      it at least for interface so that it doesn't interfere with the
7852      dispatch table based lookup. */
7853   if (TREE_CHAIN (TYPE_METHODS (class_type)))
7854     {
7855       current = TREE_CHAIN (TYPE_METHODS (class_type));
7856       TYPE_METHODS (class_type) = current;
7857
7858       while (TREE_CHAIN (current))
7859         current = TREE_CHAIN (current);
7860
7861       TREE_CHAIN (current) = mdecl;
7862       TREE_CHAIN (mdecl) = NULL_TREE;
7863     }
7864
7865   return mdecl;
7866 }
7867
7868 /* Analyzes a method body and look for something that isn't a
7869    MODIFY_EXPR with a constant value.  */
7870
7871 static int
7872 analyze_clinit_body (tree this_class, tree bbody)
7873 {
7874   while (bbody)
7875     switch (TREE_CODE (bbody))
7876       {
7877       case BLOCK:
7878         bbody = BLOCK_EXPR_BODY (bbody);
7879         break;
7880
7881       case EXPR_WITH_FILE_LOCATION:
7882         bbody = EXPR_WFL_NODE (bbody);
7883         break;
7884
7885       case COMPOUND_EXPR:
7886         if (analyze_clinit_body (this_class, TREE_OPERAND (bbody, 0)))
7887           return 1;
7888         bbody = TREE_OPERAND (bbody, 1);
7889         break;
7890
7891       case MODIFY_EXPR:
7892         /* If we're generating to class file and we're dealing with an
7893            array initialization, we return 1 to keep <clinit> */
7894         if (TREE_CODE (TREE_OPERAND (bbody, 1)) == NEW_ARRAY_INIT
7895             && flag_emit_class_files)
7896           return 1;
7897
7898         /* There are a few cases where we're required to keep
7899            <clinit>:
7900            - If this is an assignment whose operand is not constant,
7901            - If this is an assignment to a non-initialized field,
7902            - If this field is not a member of the current class.
7903         */
7904         return (! TREE_CONSTANT (TREE_OPERAND (bbody, 1))
7905                 || ! DECL_INITIAL (TREE_OPERAND (bbody, 0))
7906                 || DECL_CONTEXT (TREE_OPERAND (bbody, 0)) != this_class);
7907
7908       default:
7909         return 1;
7910       }
7911   return 0;
7912 }
7913
7914
7915 /* See whether we could get rid of <clinit>. Criteria are: all static
7916    final fields have constant initial values and the body of <clinit>
7917    is empty. Return 1 if <clinit> was discarded, 0 otherwise. */
7918
7919 static int
7920 maybe_yank_clinit (tree mdecl)
7921 {
7922   tree type, current;
7923   tree fbody, bbody;
7924
7925   if (!DECL_CLINIT_P (mdecl))
7926     return 0;
7927
7928   /* If the body isn't empty, then we keep <clinit>. Note that if
7929      we're emitting classfiles, this isn't enough not to rule it
7930      out. */
7931   fbody = DECL_FUNCTION_BODY (mdecl);
7932   bbody = BLOCK_EXPR_BODY (fbody);
7933   if (bbody && bbody != error_mark_node)
7934     bbody = BLOCK_EXPR_BODY (bbody);
7935   else
7936     return 0;
7937   if (bbody && ! flag_emit_class_files && !IS_EMPTY_STMT (bbody))
7938     return 0;
7939
7940   type = DECL_CONTEXT (mdecl);
7941   current = TYPE_FIELDS (type);
7942
7943   for (current = (current ? TREE_CHAIN (current) : current);
7944        current; current = TREE_CHAIN (current))
7945     {
7946       tree f_init;
7947
7948       /* We're not interested in non-static fields.  */
7949       if (!FIELD_STATIC (current))
7950         continue;
7951
7952       /* Nor in fields without initializers. */
7953       f_init = DECL_INITIAL (current);
7954       if (f_init == NULL_TREE)
7955         continue;
7956
7957       /* Anything that isn't String or a basic type is ruled out -- or
7958          if we know how to deal with it (when doing things natively) we
7959          should generated an empty <clinit> so that SUID are computed
7960          correctly. */
7961       if (! JSTRING_TYPE_P (TREE_TYPE (current))
7962           && ! JNUMERIC_TYPE_P (TREE_TYPE (current)))
7963         return 0;
7964
7965       if (! FIELD_FINAL (current) || ! TREE_CONSTANT (f_init))
7966         return 0;
7967     }
7968
7969   /* Now we analyze the method body and look for something that
7970      isn't a MODIFY_EXPR */
7971   if (!IS_EMPTY_STMT (bbody) && analyze_clinit_body (type, bbody))
7972     return 0;
7973
7974   /* Get rid of <clinit> in the class' list of methods */
7975   if (TYPE_METHODS (type) == mdecl)
7976     TYPE_METHODS (type) = TREE_CHAIN (mdecl);
7977   else
7978     for (current = TYPE_METHODS (type); current;
7979          current = TREE_CHAIN (current))
7980       if (TREE_CHAIN (current) == mdecl)
7981         {
7982           TREE_CHAIN (current) = TREE_CHAIN (mdecl);
7983           break;
7984         }
7985
7986   return 1;
7987 }
7988
7989 /* Install the argument from MDECL. Suitable to completion and
7990    expansion of mdecl's body.  */
7991
7992 void
7993 start_complete_expand_method (tree mdecl)
7994 {
7995   tree tem;
7996
7997   pushlevel (1);                /* Prepare for a parameter push */
7998   tem = BLOCK_EXPR_DECLS (DECL_FUNCTION_BODY (current_function_decl));
7999   DECL_ARGUMENTS (mdecl) = tem;
8000
8001   for (; tem; tem = TREE_CHAIN (tem))
8002     {
8003       /* TREE_CHAIN (tem) will change after pushdecl. */
8004       tree next = TREE_CHAIN (tem);
8005       tree type = TREE_TYPE (tem);
8006       if (targetm.calls.promote_prototypes (type)
8007           && TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node)
8008           && INTEGRAL_TYPE_P (type))
8009         type = integer_type_node;
8010       DECL_ARG_TYPE (tem) = type;
8011       layout_decl (tem, 0);
8012       pushdecl (tem);
8013       /* Re-install the next so that the list is kept and the loop
8014          advances. */
8015       TREE_CHAIN (tem) = next;
8016     }
8017   pushdecl_force_head (DECL_ARGUMENTS (mdecl));
8018   input_line = DECL_SOURCE_LINE (mdecl);
8019   build_result_decl (mdecl);
8020 }
8021
8022
8023 /* Complete and expand a method.  */
8024
8025 static void
8026 java_complete_expand_method (tree mdecl)
8027 {
8028   tree fbody, block_body, exception_copy;
8029
8030   current_function_decl = mdecl;
8031   /* Fix constructors before expanding them */
8032   if (DECL_CONSTRUCTOR_P (mdecl))
8033     fix_constructors (mdecl);
8034
8035   /* Expand functions that have a body */
8036   if (!DECL_FUNCTION_BODY (mdecl))
8037     return;
8038
8039   fbody = DECL_FUNCTION_BODY (mdecl);
8040   block_body = BLOCK_EXPR_BODY (fbody);
8041   exception_copy = NULL_TREE;
8042
8043   current_function_decl = mdecl;
8044
8045   if (! quiet_flag)
8046     fprintf (stderr, " [%s.",
8047              lang_printable_name (DECL_CONTEXT (mdecl), 0));
8048   announce_function (mdecl);
8049   if (! quiet_flag)
8050     fprintf (stderr, "]");
8051
8052   /* Prepare the function for tree completion */
8053   start_complete_expand_method (mdecl);
8054
8055   /* Install the current this */
8056   current_this = (!METHOD_STATIC (mdecl) ?
8057                   BLOCK_EXPR_DECLS (DECL_FUNCTION_BODY (mdecl)) : NULL_TREE);
8058
8059   /* Purge the `throws' list of unchecked exceptions (we save a copy
8060      of the list and re-install it later.) */
8061   exception_copy = copy_list (DECL_FUNCTION_THROWS (mdecl));
8062   purge_unchecked_exceptions (mdecl);
8063
8064   /* Install exceptions thrown with `throws' */
8065   PUSH_EXCEPTIONS (DECL_FUNCTION_THROWS (mdecl));
8066
8067   if (block_body != NULL_TREE)
8068     {
8069       block_body = java_complete_tree (block_body);
8070
8071       /* Before we check initialization, attached all class initialization
8072          variable to the block_body */
8073       htab_traverse (DECL_FUNCTION_INIT_TEST_TABLE (mdecl),
8074                      attach_init_test_initialization_flags, block_body);
8075
8076       if (! flag_emit_xref && ! METHOD_NATIVE (mdecl))
8077         {
8078           check_for_initialization (block_body, mdecl);
8079
8080           /* Go through all the flags marking the initialization of
8081              static variables and see whether they're definitively
8082              assigned, in which case the type is remembered as
8083              definitively initialized in MDECL. */
8084           if (STATIC_CLASS_INIT_OPT_P ())
8085             {
8086               /* Always register the context as properly initialized in
8087                  MDECL. This used with caution helps removing extra
8088                  initialization of self. */
8089               if (METHOD_STATIC (mdecl))
8090                 {
8091                   *(htab_find_slot
8092                     (DECL_FUNCTION_INITIALIZED_CLASS_TABLE (mdecl),
8093                      DECL_CONTEXT (mdecl), INSERT)) = DECL_CONTEXT (mdecl);
8094                 }
8095             }
8096         }
8097       ctxp->explicit_constructor_p = 0;
8098     }
8099
8100   BLOCK_EXPR_BODY (fbody) = block_body;
8101
8102   /* If we saw a return but couldn't evaluate it properly, we'll have
8103      an error_mark_node here. */
8104   if (block_body != error_mark_node
8105       && (block_body == NULL_TREE || CAN_COMPLETE_NORMALLY (block_body))
8106       && TREE_CODE (TREE_TYPE (TREE_TYPE (mdecl))) != VOID_TYPE
8107       && !flag_emit_xref)
8108     missing_return_error (current_function_decl);
8109
8110   /* See if we can get rid of <clinit> if MDECL happens to be <clinit> */
8111   maybe_yank_clinit (mdecl);
8112
8113   /* Pop the current level, with special measures if we found errors. */
8114   if (java_error_count)
8115     pushdecl_force_head (DECL_ARGUMENTS (mdecl));
8116   poplevel (1, 0, 1);
8117
8118   /* Pop the exceptions and sanity check */
8119   POP_EXCEPTIONS();
8120   if (currently_caught_type_list)
8121     abort ();
8122
8123   /* Restore the copy of the list of exceptions if emitting xrefs. */
8124   DECL_FUNCTION_THROWS (mdecl) = exception_copy;
8125 }
8126
8127 /* For with each class for which there's code to generate. */
8128
8129 static void
8130 java_expand_method_bodies (tree class)
8131 {
8132   tree decl;
8133   for (decl = TYPE_METHODS (class); decl; decl = TREE_CHAIN (decl))
8134     {
8135       tree block;
8136
8137       if (! DECL_FUNCTION_BODY (decl))
8138         continue;
8139
8140       current_function_decl = decl;
8141
8142       block = BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (decl));
8143
8144       /* Save the function body for gimplify and inlining.  */
8145       DECL_SAVED_TREE (decl) = block;
8146
8147       /* It's time to assign the variable flagging static class
8148          initialization based on which classes invoked static methods
8149          are definitely initializing. This should be flagged. */
8150       if (STATIC_CLASS_INIT_OPT_P ())
8151         {
8152           tree list = DECL_FUNCTION_STATIC_METHOD_INVOCATION_COMPOUND (decl);
8153           for (; list != NULL_TREE;  list = TREE_CHAIN (list))
8154             {
8155               /* Executed for each statement calling a static function.
8156                  LIST is a TREE_LIST whose PURPOSE is the called function
8157                  and VALUE is a compound whose second operand can be patched
8158                  with static class initialization flag assignments.  */
8159
8160               tree called_method = TREE_PURPOSE (list);
8161               tree compound = TREE_VALUE (list);
8162               tree assignment_compound_list
8163                 = build_tree_list (called_method, NULL);
8164
8165               /* For each class definitely initialized in
8166                  CALLED_METHOD, fill ASSIGNMENT_COMPOUND with
8167                  assignment to the class initialization flag. */
8168               htab_traverse (DECL_FUNCTION_INITIALIZED_CLASS_TABLE (called_method),
8169                              emit_test_initialization,
8170                              assignment_compound_list);
8171
8172               if (TREE_VALUE (assignment_compound_list))
8173                 TREE_OPERAND (compound, 1)
8174                   = TREE_VALUE (assignment_compound_list);
8175             }
8176         }
8177
8178       /* Expand the function body.  */
8179       source_end_java_method ();
8180     }
8181 }
8182
8183 \f
8184
8185 /* This section of the code deals with accessing enclosing context
8186    fields either directly by using the relevant access to this$<n> or
8187    by invoking an access method crafted for that purpose.  */
8188
8189 /* Build the necessary access from an inner class to an outer
8190    class. This routine could be optimized to cache previous result
8191    (decl, current_class and returned access).  When an access method
8192    needs to be generated, it always takes the form of a read. It might
8193    be later turned into a write by calling outer_field_access_fix.  */
8194
8195 static tree
8196 build_outer_field_access (tree id, tree decl)
8197 {
8198   tree access = NULL_TREE;
8199   tree ctx = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (current_class)));
8200   tree decl_ctx = DECL_CONTEXT (decl);
8201
8202   /* If the immediate enclosing context of the current class is the
8203      field decl's class or inherits from it; build the access as
8204      `this$<n>.<field>'. Note that we will break the `private' barrier
8205      if we're not emitting bytecodes. */
8206   if ((ctx == decl_ctx || inherits_from_p (ctx, decl_ctx))
8207       && (!FIELD_PRIVATE (decl) || !flag_emit_class_files ))
8208     {
8209       tree thisn = build_current_thisn (current_class);
8210       access = make_qualified_primary (build_wfl_node (thisn),
8211                                        id, EXPR_WFL_LINECOL (id));
8212     }
8213   /* Otherwise, generate access methods to outer this and access the
8214      field (either using an access method or by direct access.) */
8215   else
8216     {
8217       int lc = EXPR_WFL_LINECOL (id);
8218
8219       /* Now we chain the required number of calls to the access$0 to
8220          get a hold to the enclosing instance we need, and then we
8221          build the field access. */
8222       access = build_access_to_thisn (current_class, decl_ctx, lc);
8223
8224       /* If the field is private and we're generating bytecode, then
8225          we generate an access method */
8226       if (FIELD_PRIVATE (decl) && flag_emit_class_files )
8227         {
8228           tree name = build_outer_field_access_methods (decl);
8229           access = build_outer_field_access_expr (lc, decl_ctx,
8230                                                   name, access, NULL_TREE);
8231         }
8232       /* Otherwise we use `access$(this$<j>). ... access$(this$<i>).<field>'.
8233          Once again we break the `private' access rule from a foreign
8234          class. */
8235       else
8236         access = make_qualified_primary (access, id, lc);
8237     }
8238   return resolve_expression_name (access, NULL);
8239 }
8240
8241 /* Return a nonzero value if NODE describes an outer field inner
8242    access.  */
8243
8244 static int
8245 outer_field_access_p (tree type, tree decl)
8246 {
8247   if (!INNER_CLASS_TYPE_P (type)
8248       || TREE_CODE (decl) != FIELD_DECL
8249       || DECL_CONTEXT (decl) == type)
8250     return 0;
8251
8252   /* If the inner class extends the declaration context of the field
8253      we're trying to access, then this isn't an outer field access */
8254   if (inherits_from_p (type, DECL_CONTEXT (decl)))
8255     return 0;
8256
8257   for (type = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (type))); ;
8258        type = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (type))))
8259     {
8260       if (type == DECL_CONTEXT (decl))
8261         return 1;
8262
8263       if (!DECL_CONTEXT (TYPE_NAME (type)))
8264         {
8265           /* Before we give up, see whether the field is inherited from
8266              the enclosing context we're considering. */
8267           if (inherits_from_p (type, DECL_CONTEXT (decl)))
8268             return 1;
8269           break;
8270         }
8271     }
8272
8273   return 0;
8274 }
8275
8276 /* Return a nonzero value if NODE represents an outer field inner
8277    access that was been already expanded. As a side effect, it returns
8278    the name of the field being accessed and the argument passed to the
8279    access function, suitable for a regeneration of the access method
8280    call if necessary. */
8281
8282 static int
8283 outer_field_expanded_access_p (tree node, tree *name, tree *arg_type,
8284                                tree *arg)
8285 {
8286   int identified = 0;
8287
8288   if (TREE_CODE (node) != CALL_EXPR)
8289     return 0;
8290
8291   /* Well, gcj generates slightly different tree nodes when compiling
8292      to native or bytecodes. It's the case for function calls. */
8293
8294   if (flag_emit_class_files
8295       && TREE_CODE (node) == CALL_EXPR
8296       && OUTER_FIELD_ACCESS_IDENTIFIER_P (DECL_NAME (TREE_OPERAND (node, 0))))
8297     identified = 1;
8298   else if (!flag_emit_class_files)
8299     {
8300       node = TREE_OPERAND (node, 0);
8301
8302       if (node && TREE_OPERAND (node, 0)
8303           && TREE_CODE (TREE_OPERAND (node, 0)) == ADDR_EXPR)
8304         {
8305           node = TREE_OPERAND (node, 0);
8306           if (TREE_OPERAND (node, 0)
8307               && TREE_CODE (TREE_OPERAND (node, 0)) == FUNCTION_DECL
8308               && (OUTER_FIELD_ACCESS_IDENTIFIER_P
8309                   (DECL_NAME (TREE_OPERAND (node, 0)))))
8310             identified = 1;
8311         }
8312     }
8313
8314   if (identified && name && arg_type && arg)
8315     {
8316       tree argument = TREE_OPERAND (node, 1);
8317       *name = DECL_NAME (TREE_OPERAND (node, 0));
8318       *arg_type = TREE_TYPE (TREE_TYPE (TREE_VALUE (argument)));
8319       *arg = TREE_VALUE (argument);
8320     }
8321   return identified;
8322 }
8323
8324 /* Detect in NODE an outer field read access from an inner class and
8325    transform it into a write with RHS as an argument. This function is
8326    called from the java_complete_lhs when an assignment to a LHS can
8327    be identified. */
8328
8329 static tree
8330 outer_field_access_fix (tree wfl, tree node, tree rhs)
8331 {
8332   tree name, arg_type, arg;
8333
8334   if (outer_field_expanded_access_p (node, &name, &arg_type, &arg))
8335     {
8336       node = build_outer_field_access_expr (EXPR_WFL_LINECOL (wfl),
8337                                             arg_type, name, arg, rhs);
8338       return java_complete_tree (node);
8339     }
8340   return NULL_TREE;
8341 }
8342
8343 /* Construct the expression that calls an access method:
8344      <type>.access$<n>(<arg1> [, <arg2>]);
8345
8346    ARG2 can be NULL and will be omitted in that case. It will denote a
8347    read access.  */
8348
8349 static tree
8350 build_outer_field_access_expr (int lc, tree type, tree access_method_name,
8351                                tree arg1, tree arg2)
8352 {
8353   tree args, cn, access;
8354
8355   args = arg1 ? arg1 :
8356     build_wfl_node (build_current_thisn (current_class));
8357   args = build_tree_list (NULL_TREE, args);
8358
8359   if (arg2)
8360     args = tree_cons (NULL_TREE, arg2, args);
8361
8362   access = build_method_invocation (build_wfl_node (access_method_name), args);
8363   cn = build_wfl_node (DECL_NAME (TYPE_NAME (type)));
8364   return make_qualified_primary (cn, access, lc);
8365 }
8366
8367 static tree
8368 build_new_access_id (void)
8369 {
8370   static int access_n_counter = 1;
8371   char buffer [128];
8372
8373   sprintf (buffer, "access$%d", access_n_counter++);
8374   return get_identifier (buffer);
8375 }
8376
8377 /* Create the static access functions for the outer field DECL. We define a
8378    read:
8379      TREE_TYPE (<field>) access$<n> (DECL_CONTEXT (<field>) inst$) {
8380        return inst$.field;
8381      }
8382    and a write access:
8383      TREE_TYPE (<field>) access$<n> (DECL_CONTEXT (<field>) inst$,
8384                                      TREE_TYPE (<field>) value$) {
8385        return inst$.field = value$;
8386      }
8387    We should have a usage flags on the DECL so we can lazily turn the ones
8388    we're using for code generation. FIXME.
8389 */
8390
8391 static tree
8392 build_outer_field_access_methods (tree decl)
8393 {
8394   tree id, args, stmt, mdecl;
8395
8396   if (FIELD_INNER_ACCESS_P (decl))
8397     return FIELD_INNER_ACCESS (decl);
8398
8399   MAYBE_CREATE_VAR_LANG_DECL_SPECIFIC (decl);
8400
8401   /* Create the identifier and a function named after it. */
8402   id = build_new_access_id ();
8403
8404   /* The identifier is marked as bearing the name of a generated write
8405      access function for outer field accessed from inner classes. */
8406   OUTER_FIELD_ACCESS_IDENTIFIER_P (id) = 1;
8407
8408   /* Create the read access */
8409   args = build_tree_list (inst_id, build_pointer_type (DECL_CONTEXT (decl)));
8410   TREE_CHAIN (args) = end_params_node;
8411   stmt = make_qualified_primary (build_wfl_node (inst_id),
8412                                  build_wfl_node (DECL_NAME (decl)), 0);
8413   stmt = build_return (0, stmt);
8414   mdecl = build_outer_field_access_method (DECL_CONTEXT (decl),
8415                                            TREE_TYPE (decl), id, args, stmt);
8416   DECL_FUNCTION_ACCESS_DECL (mdecl) = decl;
8417
8418   /* Create the write access method. No write access for final variable */
8419   if (!FIELD_FINAL (decl))
8420     {
8421       args = build_tree_list (inst_id,
8422                               build_pointer_type (DECL_CONTEXT (decl)));
8423       TREE_CHAIN (args) = build_tree_list (wpv_id, TREE_TYPE (decl));
8424       TREE_CHAIN (TREE_CHAIN (args)) = end_params_node;
8425       stmt = make_qualified_primary (build_wfl_node (inst_id),
8426                                      build_wfl_node (DECL_NAME (decl)), 0);
8427       stmt = build_return (0, build_assignment (ASSIGN_TK, 0, stmt,
8428                                                 build_wfl_node (wpv_id)));
8429       mdecl = build_outer_field_access_method (DECL_CONTEXT (decl),
8430                                                TREE_TYPE (decl), id,
8431                                                args, stmt);
8432     }
8433   DECL_FUNCTION_ACCESS_DECL (mdecl) = decl;
8434
8435   /* Return the access name */
8436   return FIELD_INNER_ACCESS (decl) = id;
8437 }
8438
8439 /* Build an field access method NAME.  */
8440
8441 static tree
8442 build_outer_field_access_method (tree class, tree type, tree name,
8443                                  tree args, tree body)
8444 {
8445   tree saved_current_function_decl, mdecl;
8446
8447   /* Create the method */
8448   mdecl = create_artificial_method (class, ACC_STATIC, type, name, args);
8449   fix_method_argument_names (args, mdecl);
8450   layout_class_method (class, NULL_TREE, mdecl, NULL_TREE);
8451
8452   /* Attach the method body. */
8453   saved_current_function_decl = current_function_decl;
8454   start_artificial_method_body (mdecl);
8455   java_method_add_stmt (mdecl, body);
8456   end_artificial_method_body (mdecl);
8457   current_function_decl = saved_current_function_decl;
8458
8459   return mdecl;
8460 }
8461
8462 \f
8463 /* This section deals with building access function necessary for
8464    certain kinds of method invocation from inner classes.  */
8465
8466 static tree
8467 build_outer_method_access_method (tree decl)
8468 {
8469   tree saved_current_function_decl, mdecl;
8470   tree args = NULL_TREE, call_args = NULL_TREE;
8471   tree carg, id, body, class;
8472   char buffer [80];
8473   int parm_id_count = 0;
8474
8475   /* Test this abort with an access to a private field */
8476   if (!strcmp (IDENTIFIER_POINTER (DECL_NAME (decl)), "access$"))
8477     abort ();
8478
8479   /* Check the cache first */
8480   if (DECL_FUNCTION_INNER_ACCESS (decl))
8481     return DECL_FUNCTION_INNER_ACCESS (decl);
8482
8483   class = DECL_CONTEXT (decl);
8484
8485   /* Obtain an access identifier and mark it */
8486   id = build_new_access_id ();
8487   OUTER_FIELD_ACCESS_IDENTIFIER_P (id) = 1;
8488
8489   carg = TYPE_ARG_TYPES (TREE_TYPE (decl));
8490   /* Create the arguments, as much as the original */
8491   for (; carg && carg != end_params_node;
8492        carg = TREE_CHAIN (carg))
8493     {
8494       sprintf (buffer, "write_parm_value$%d", parm_id_count++);
8495       args = chainon (args, build_tree_list (get_identifier (buffer),
8496                                              TREE_VALUE (carg)));
8497     }
8498   args = chainon (args, end_params_node);
8499
8500   /* Create the method */
8501   mdecl = create_artificial_method (class, ACC_STATIC,
8502                                     TREE_TYPE (TREE_TYPE (decl)), id, args);
8503   layout_class_method (class, NULL_TREE, mdecl, NULL_TREE);
8504   /* There is a potential bug here. We should be able to use
8505      fix_method_argument_names, but then arg names get mixed up and
8506      eventually a constructor will have its this$0 altered and the
8507      outer context won't be assignment properly. The testcase is
8508      stub.java FIXME */
8509   TYPE_ARG_TYPES (TREE_TYPE (mdecl)) = args;
8510
8511   /* Attach the method body. */
8512   saved_current_function_decl = current_function_decl;
8513   start_artificial_method_body (mdecl);
8514
8515   /* The actual method invocation uses the same args. When invoking a
8516      static methods that way, we don't want to skip the first
8517      argument. */
8518   carg = args;
8519   if (!METHOD_STATIC (decl))
8520     carg = TREE_CHAIN (carg);
8521   for (; carg && carg != end_params_node; carg = TREE_CHAIN (carg))
8522     call_args = tree_cons (NULL_TREE, build_wfl_node (TREE_PURPOSE (carg)),
8523                            call_args);
8524
8525   body = build_method_invocation (build_wfl_node (DECL_NAME (decl)),
8526                                   call_args);
8527   if (!METHOD_STATIC (decl))
8528     body = make_qualified_primary (build_wfl_node (TREE_PURPOSE (args)),
8529                                    body, 0);
8530   if (TREE_TYPE (TREE_TYPE (decl)) != void_type_node)
8531     body = build_return (0, body);
8532   java_method_add_stmt (mdecl,body);
8533   end_artificial_method_body (mdecl);
8534   current_function_decl = saved_current_function_decl;
8535
8536   /* Back tag the access function so it know what it accesses */
8537   DECL_FUNCTION_ACCESS_DECL (decl) = mdecl;
8538
8539   /* Tag the current method so it knows it has an access generated */
8540   return DECL_FUNCTION_INNER_ACCESS (decl) = mdecl;
8541 }
8542
8543 \f
8544 /* This section of the code deals with building expressions to access
8545    the enclosing instance of an inner class. The enclosing instance is
8546    kept in a generated field called this$<n>, with <n> being the
8547    inner class nesting level (starting from 0.)  */
8548
8549 /* Build an access to a given this$<n>, always chaining access call to
8550    others. Access methods to this$<n> are build on the fly if
8551    necessary. This CAN'T be used to solely access this$<n-1> from
8552    this$<n> (which alway yield to special cases and optimization, see
8553    for example build_outer_field_access).  */
8554
8555 static tree
8556 build_access_to_thisn (tree from, tree to, int lc)
8557 {
8558   tree access = NULL_TREE;
8559
8560   while (from != to && PURE_INNER_CLASS_TYPE_P (from))
8561     {
8562       if (!access)
8563         {
8564           access = build_current_thisn (from);
8565           access = build_wfl_node (access);
8566         }
8567       else
8568         {
8569           tree access0_wfl, cn;
8570
8571           maybe_build_thisn_access_method (from);
8572           access0_wfl = build_wfl_node (access0_identifier_node);
8573           cn = build_wfl_node (DECL_NAME (TYPE_NAME (from)));
8574           EXPR_WFL_LINECOL (access0_wfl) = lc;
8575           access = build_tree_list (NULL_TREE, access);
8576           access = build_method_invocation (access0_wfl, access);
8577           access = make_qualified_primary (cn, access, lc);
8578         }
8579
8580       /* If FROM isn't an inner class, that's fine, we've done enough.
8581          What we're looking for can be accessed from there.  */
8582       from = DECL_CONTEXT (TYPE_NAME (from));
8583       if (!from)
8584         break;
8585       from = TREE_TYPE (from);
8586     }
8587   return access;
8588 }
8589
8590 /* Build an access function to the this$<n> local to TYPE. NULL_TREE
8591    is returned if nothing needs to be generated. Otherwise, the method
8592    generated and a method decl is returned.
8593
8594    NOTE: These generated methods should be declared in a class file
8595    attribute so that they can't be referred to directly.  */
8596
8597 static tree
8598 maybe_build_thisn_access_method (tree type)
8599 {
8600   tree mdecl, args, stmt, rtype;
8601   tree saved_current_function_decl;
8602
8603   /* If TYPE is a top-level class, no access method is required.
8604      If there already is such an access method, bail out. */
8605   if (CLASS_ACCESS0_GENERATED_P (type) || !PURE_INNER_CLASS_TYPE_P (type))
8606     return NULL_TREE;
8607
8608   /* We generate the method. The method looks like:
8609      static <outer_of_type> access$0 (<type> inst$) { return inst$.this$<n>; }
8610   */
8611   args = build_tree_list (inst_id, build_pointer_type (type));
8612   TREE_CHAIN (args) = end_params_node;
8613   rtype = build_pointer_type (TREE_TYPE (DECL_CONTEXT (TYPE_NAME (type))));
8614   mdecl = create_artificial_method (type, ACC_STATIC, rtype,
8615                                     access0_identifier_node, args);
8616   fix_method_argument_names (args, mdecl);
8617   layout_class_method (type, NULL_TREE, mdecl, NULL_TREE);
8618   stmt = build_current_thisn (type);
8619   stmt = make_qualified_primary (build_wfl_node (inst_id),
8620                                  build_wfl_node (stmt), 0);
8621   stmt = build_return (0, stmt);
8622
8623   saved_current_function_decl = current_function_decl;
8624   start_artificial_method_body (mdecl);
8625   java_method_add_stmt (mdecl, stmt);
8626   end_artificial_method_body (mdecl);
8627   current_function_decl = saved_current_function_decl;
8628
8629   CLASS_ACCESS0_GENERATED_P (type) = 1;
8630
8631   return mdecl;
8632 }
8633
8634 /* Craft an correctly numbered `this$<n>'string. this$0 is used for
8635    the first level of innerclassing. this$1 for the next one, etc...
8636    This function can be invoked with TYPE to NULL, available and then
8637    has to count the parser context.  */
8638
8639 static GTY(()) tree saved_thisn;
8640 static GTY(()) tree saved_type;
8641
8642 static tree
8643 build_current_thisn (tree type)
8644 {
8645   static int saved_i = -1;
8646   static int saved_type_i = 0;
8647   tree decl;
8648   char buffer [24];
8649   int i = 0;
8650
8651   if (type)
8652     {
8653       if (type == saved_type)
8654         i = saved_type_i;
8655       else
8656         {
8657           for (i = -1, decl = DECL_CONTEXT (TYPE_NAME (type));
8658                decl; decl = DECL_CONTEXT (decl), i++)
8659             ;
8660
8661           saved_type = type;
8662           saved_type_i = i;
8663         }
8664     }
8665   else
8666     i = list_length (GET_CPC_LIST ())-2;
8667
8668   if (i == saved_i)
8669     return saved_thisn;
8670
8671   sprintf (buffer, "this$%d", i);
8672   saved_i = i;
8673   saved_thisn = get_identifier (buffer);
8674   return saved_thisn;
8675 }
8676
8677 /* Return the assignment to the hidden enclosing context `this$<n>'
8678    by the second incoming parameter to the innerclass constructor. The
8679    form used is `this.this$<n> = this$<n>;'.  */
8680
8681 static tree
8682 build_thisn_assign (void)
8683 {
8684   if (current_class && PURE_INNER_CLASS_TYPE_P (current_class))
8685     {
8686       tree thisn = build_current_thisn (current_class);
8687       tree lhs = make_qualified_primary (build_wfl_node (this_identifier_node),
8688                                          build_wfl_node (thisn), 0);
8689       tree rhs = build_wfl_node (thisn);
8690       EXPR_WFL_SET_LINECOL (lhs, input_line, 0);
8691       return build_assignment (ASSIGN_TK, EXPR_WFL_LINECOL (lhs), lhs, rhs);
8692     }
8693   return NULL_TREE;
8694 }
8695
8696 \f
8697 /* Building the synthetic `class$' used to implement the `.class' 1.1
8698    extension for non primitive types. This method looks like:
8699
8700     static Class class$(String type) throws NoClassDefFoundError
8701     {
8702       try {return (java.lang.Class.forName (String));}
8703       catch (ClassNotFoundException e) {
8704         throw new NoClassDefFoundError(e.getMessage());}
8705     } */
8706
8707 static GTY(()) tree get_message_wfl;
8708 static GTY(()) tree type_parm_wfl;
8709
8710 static tree
8711 build_dot_class_method (tree class)
8712 {
8713 #define BWF(S) build_wfl_node (get_identifier ((S)))
8714 #define MQN(X,Y) make_qualified_name ((X), (Y), 0)
8715   tree args, tmp, saved_current_function_decl, mdecl, qual_name;
8716   tree stmt, throw_stmt;
8717
8718   if (!get_message_wfl)
8719     {
8720       get_message_wfl = build_wfl_node (get_identifier ("getMessage"));
8721       type_parm_wfl = build_wfl_node (get_identifier ("type$"));
8722     }
8723
8724   /* Build the arguments */
8725   args = build_tree_list (get_identifier ("type$"),
8726                           build_pointer_type (string_type_node));
8727   TREE_CHAIN (args) = end_params_node;
8728
8729   /* Build the qualified name java.lang.Class.forName */
8730   tmp = MQN (MQN (MQN (BWF ("java"),
8731                        BWF ("lang")), BWF ("Class")), BWF ("forName"));
8732
8733   /* Create the "class$" function */
8734   mdecl = create_artificial_method (class, ACC_STATIC,
8735                                     build_pointer_type (class_type_node),
8736                                     classdollar_identifier_node, args);
8737   qual_name = MQN (MQN (BWF ("java"), BWF ("lang")),
8738                    BWF ("NoClassDefFoundError"));
8739   DECL_FUNCTION_THROWS (mdecl) = build_tree_list (NULL_TREE, qual_name);
8740   register_incomplete_type (JDEP_EXCEPTION, qual_name, NULL_TREE, NULL_TREE);
8741   JDEP_GET_PATCH (CLASSD_LAST (ctxp->classd_list)) =
8742     &TREE_VALUE (DECL_FUNCTION_THROWS (mdecl));
8743
8744   /* We start by building the try block. We need to build:
8745        return (java.lang.Class.forName (type)); */
8746   stmt = build_method_invocation (tmp,
8747                                   build_tree_list (NULL_TREE, type_parm_wfl));
8748   stmt = build_return (0, stmt);
8749
8750   /* Now onto the catch block. We start by building the expression
8751      throwing a new exception: throw new NoClassDefFoundError (_.getMessage) */
8752   throw_stmt = make_qualified_name (build_wfl_node (wpv_id),
8753                                     get_message_wfl, 0);
8754   throw_stmt = build_method_invocation (throw_stmt, NULL_TREE);
8755
8756   /* Build new NoClassDefFoundError (_.getMessage) */
8757   throw_stmt = build_new_invocation
8758     (build_wfl_node (get_identifier ("NoClassDefFoundError")),
8759      build_tree_list (build_pointer_type (string_type_node), throw_stmt));
8760
8761   /* Build the throw, (it's too early to use BUILD_THROW) */
8762   throw_stmt = build1 (THROW_EXPR, NULL_TREE, throw_stmt);
8763
8764   /* Encapsulate STMT in a try block. The catch clause executes THROW_STMT */
8765   qual_name = MQN (MQN (BWF ("java"), BWF ("lang")),
8766                    BWF ("ClassNotFoundException"));
8767   stmt = encapsulate_with_try_catch (0, qual_name, stmt, throw_stmt);
8768
8769   fix_method_argument_names (args, mdecl);
8770   layout_class_method (class, NULL_TREE, mdecl, NULL_TREE);
8771   saved_current_function_decl = current_function_decl;
8772   start_artificial_method_body (mdecl);
8773   java_method_add_stmt (mdecl, stmt);
8774   end_artificial_method_body (mdecl);
8775   current_function_decl = saved_current_function_decl;
8776   TYPE_DOT_CLASS (class) = mdecl;
8777
8778   return mdecl;
8779 }
8780
8781 static tree
8782 build_dot_class_method_invocation (tree this_class, tree type)
8783 {
8784   tree dot_class_method = TYPE_DOT_CLASS (this_class);
8785   tree sig_id, s, t;
8786
8787   if (TYPE_ARRAY_P (type))
8788     sig_id = build_java_signature (type);
8789   else
8790     sig_id = DECL_NAME (TYPE_NAME (type));
8791
8792   /* Ensure that the proper name separator is used */
8793   sig_id = unmangle_classname (IDENTIFIER_POINTER (sig_id),
8794                                IDENTIFIER_LENGTH (sig_id));
8795
8796   s = build_string (IDENTIFIER_LENGTH (sig_id),
8797                     IDENTIFIER_POINTER (sig_id));
8798   t = build_method_invocation (build_wfl_node (DECL_NAME (dot_class_method)),
8799                                build_tree_list (NULL_TREE, s));
8800   if (DECL_CONTEXT (dot_class_method) != this_class)
8801     {
8802       tree class_name = DECL_NAME (TYPE_NAME (DECL_CONTEXT (dot_class_method)));
8803       t = make_qualified_primary (build_wfl_node (class_name), t, 0);
8804     }
8805   return t;
8806 }
8807
8808 /* This section of the code deals with constructor.  */
8809
8810 /* Craft a body for default constructor. Patch existing constructor
8811    bodies with call to super() and field initialization statements if
8812    necessary.  */
8813
8814 static void
8815 fix_constructors (tree mdecl)
8816 {
8817   tree iii;                     /* Instance Initializer Invocation */
8818   tree body = DECL_FUNCTION_BODY (mdecl);
8819   tree thisn_assign, compound = NULL_TREE;
8820   tree class_type = DECL_CONTEXT (mdecl);
8821
8822   if (DECL_FIXED_CONSTRUCTOR_P (mdecl))
8823     return;
8824   DECL_FIXED_CONSTRUCTOR_P (mdecl) = 1;
8825
8826   if (!body)
8827     {
8828       /* It is an error for the compiler to generate a default
8829          constructor if the superclass doesn't have a constructor that
8830          takes no argument, or the same args for an anonymous class */
8831       if (verify_constructor_super (mdecl))
8832         {
8833           tree sclass_decl = TYPE_NAME (CLASSTYPE_SUPER (class_type));
8834           tree save = DECL_NAME (mdecl);
8835           const char *n = IDENTIFIER_POINTER (DECL_NAME (sclass_decl));
8836           DECL_NAME (mdecl) = DECL_NAME (sclass_decl);
8837           parse_error_context
8838             (lookup_cl (TYPE_NAME (class_type)),
8839              "No constructor matching `%s' found in class `%s'",
8840              lang_printable_name (mdecl, 0), n);
8841           DECL_NAME (mdecl) = save;
8842         }
8843
8844       /* The constructor body must be crafted by hand. It's the
8845          constructor we defined when we realize we didn't have the
8846          CLASSNAME() constructor */
8847       start_artificial_method_body (mdecl);
8848
8849       /* Insert an assignment to the this$<n> hidden field, if
8850          necessary */
8851       if ((thisn_assign = build_thisn_assign ()))
8852         java_method_add_stmt (mdecl, thisn_assign);
8853
8854       /* We don't generate a super constructor invocation if we're
8855          compiling java.lang.Object. build_super_invocation takes care
8856          of that. */
8857       java_method_add_stmt (mdecl, build_super_invocation (mdecl));
8858
8859       /* FIXME */
8860       if ((iii = build_instinit_invocation (class_type)))
8861         java_method_add_stmt (mdecl, iii);
8862
8863       end_artificial_method_body (mdecl);
8864     }
8865   /* Search for an explicit constructor invocation */
8866   else
8867     {
8868       int found = 0;
8869       int invokes_this = 0;
8870       tree found_call = NULL_TREE;
8871       tree main_block = BLOCK_EXPR_BODY (body);
8872
8873       while (body)
8874         switch (TREE_CODE (body))
8875           {
8876           case CALL_EXPR:
8877             found = CALL_EXPLICIT_CONSTRUCTOR_P (body);
8878             if (CALL_THIS_CONSTRUCTOR_P (body))
8879               invokes_this = 1;
8880             body = NULL_TREE;
8881             break;
8882           case COMPOUND_EXPR:
8883           case EXPR_WITH_FILE_LOCATION:
8884             found_call = body;
8885             body = TREE_OPERAND (body, 0);
8886             break;
8887           case BLOCK:
8888             found_call = body;
8889             body = BLOCK_EXPR_BODY (body);
8890             break;
8891           default:
8892             found = 0;
8893             body = NULL_TREE;
8894           }
8895
8896       /* Generate the assignment to this$<n>, if necessary */
8897       if ((thisn_assign = build_thisn_assign ()))
8898         compound = add_stmt_to_compound (compound, NULL_TREE, thisn_assign);
8899
8900       /* The constructor is missing an invocation of super() */
8901       if (!found)
8902         compound = add_stmt_to_compound (compound, NULL_TREE,
8903                                          build_super_invocation (mdecl));
8904       /* Explicit super() invocation should take place before the
8905          instance initializer blocks. */
8906       else
8907         {
8908           compound = add_stmt_to_compound (compound, NULL_TREE,
8909                                            TREE_OPERAND (found_call, 0));
8910           TREE_OPERAND (found_call, 0) = build_java_empty_stmt ();
8911         }
8912
8913       DECL_INIT_CALLS_THIS (mdecl) = invokes_this;
8914
8915       /* Insert the instance initializer block right after. */
8916       if (!invokes_this && (iii = build_instinit_invocation (class_type)))
8917         compound = add_stmt_to_compound (compound, NULL_TREE, iii);
8918
8919       /* Fix the constructor main block if we're adding extra stmts */
8920       if (compound)
8921         {
8922           compound = add_stmt_to_compound (compound, NULL_TREE,
8923                                            BLOCK_EXPR_BODY (main_block));
8924           BLOCK_EXPR_BODY (main_block) = compound;
8925         }
8926     }
8927 }
8928
8929 /* Browse constructors in the super class, searching for a constructor
8930    that doesn't take any argument. Return 0 if one is found, 1
8931    otherwise.  If the current class is an anonymous inner class, look
8932    for something that has the same signature. */
8933
8934 static int
8935 verify_constructor_super (tree mdecl)
8936 {
8937   tree class = CLASSTYPE_SUPER (current_class);
8938   int super_inner = PURE_INNER_CLASS_TYPE_P (class);
8939   tree sdecl;
8940
8941   if (!class)
8942     return 0;
8943
8944   if (ANONYMOUS_CLASS_P (current_class))
8945     {
8946       tree mdecl_arg_type;
8947       SKIP_THIS_AND_ARTIFICIAL_PARMS (mdecl_arg_type, mdecl);
8948       for (sdecl = TYPE_METHODS (class); sdecl; sdecl = TREE_CHAIN (sdecl))
8949         if (DECL_CONSTRUCTOR_P (sdecl))
8950           {
8951             tree m_arg_type;
8952             tree arg_type = TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (sdecl)));
8953             if (super_inner)
8954               arg_type = TREE_CHAIN (arg_type);
8955             for (m_arg_type = mdecl_arg_type;
8956                  (arg_type != end_params_node
8957                   && m_arg_type != end_params_node);
8958                  arg_type = TREE_CHAIN (arg_type),
8959                    m_arg_type = TREE_CHAIN (m_arg_type))
8960               if (!valid_method_invocation_conversion_p
8961                      (TREE_VALUE (arg_type),
8962                       TREE_VALUE (m_arg_type)))
8963                 break;
8964
8965             if (arg_type == end_params_node && m_arg_type == end_params_node)
8966               return 0;
8967           }
8968     }
8969   else
8970     {
8971       for (sdecl = TYPE_METHODS (class); sdecl; sdecl = TREE_CHAIN (sdecl))
8972         {
8973           tree arg = TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (sdecl)));
8974           if (super_inner)
8975             arg = TREE_CHAIN (arg);
8976           if (DECL_CONSTRUCTOR_P (sdecl) && arg == end_params_node)
8977             return 0;
8978         }
8979     }
8980   return 1;
8981 }
8982
8983 /* Generate code for all context remembered for code generation.  */
8984
8985 static GTY(()) tree reversed_class_list;
8986 void
8987 java_expand_classes (void)
8988 {
8989   int save_error_count = 0;
8990   static struct parser_ctxt *cur_ctxp = NULL;
8991
8992   java_parse_abort_on_error ();
8993   if (!(ctxp = ctxp_for_generation))
8994     return;
8995   java_layout_classes ();
8996   java_parse_abort_on_error ();
8997
8998   for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
8999     {
9000       tree current;
9001       for (current = cur_ctxp->class_list;
9002            current;
9003            current = TREE_CHAIN (current))
9004         gen_indirect_dispatch_tables (TREE_TYPE (current));
9005     }
9006
9007   for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
9008     {
9009       ctxp = cur_ctxp;
9010       input_filename = ctxp->filename;
9011       lang_init_source (2);            /* Error msgs have method prototypes */
9012       java_complete_expand_classes (); /* Complete and expand classes */
9013       java_parse_abort_on_error ();
9014     }
9015   input_filename = main_input_filename;
9016
9017   /* Find anonymous classes and expand their constructor. This extra pass is
9018      necessary because the constructor itself is only generated when the
9019      method in which it is defined is expanded. */
9020   for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
9021     {
9022       tree current;
9023       ctxp = cur_ctxp;
9024       for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
9025         {
9026           output_class = current_class = TREE_TYPE (current);
9027           if (ANONYMOUS_CLASS_P (current_class))
9028             {
9029               tree d;
9030               for (d = TYPE_METHODS (current_class); d; d = TREE_CHAIN (d))
9031                 {
9032                   if (DECL_CONSTRUCTOR_P (d))
9033                     {
9034                       restore_line_number_status (1);
9035                       java_complete_expand_method (d);
9036                       restore_line_number_status (0);
9037                       break;    /* There is only one constructor. */
9038                     }
9039                 }
9040             }
9041         }
9042     }
9043
9044   /* Expanding the constructors of anonymous classes generates access
9045      methods.  Scan all the methods looking for null DECL_RESULTs --
9046      this will be the case if a method hasn't been expanded.  */
9047   for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
9048     {
9049       tree current;
9050       ctxp = cur_ctxp;
9051       for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
9052         {
9053           tree d;
9054           output_class = current_class = TREE_TYPE (current);
9055           for (d = TYPE_METHODS (current_class); d; d = TREE_CHAIN (d))
9056             {
9057               if (DECL_RESULT (d) == NULL_TREE)
9058                 {
9059                   restore_line_number_status (1);
9060                   java_complete_expand_method (d);
9061                   restore_line_number_status (0);
9062                 }
9063             }
9064         }
9065     }
9066
9067   /* ???  Instead of all this we could iterate around the list of
9068      classes until there were no more un-expanded methods.  It would
9069      take a little longer -- one pass over the whole list of methods
9070      -- but it would be simpler.  Like this:  */
9071 #if 0
9072     {
9073       int something_changed;
9074
9075       do
9076         {
9077           something_changed = 0;
9078           for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
9079             {
9080               tree current;
9081               ctxp = cur_ctxp;
9082               for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
9083                 {
9084                   tree d;
9085                   output_class = current_class = TREE_TYPE (current);
9086                   for (d = TYPE_METHODS (current_class); d; d = TREE_CHAIN (d))
9087                     {
9088                       if (DECL_RESULT (d) == NULL_TREE)
9089                         {
9090                           something_changed = 1;
9091                           restore_line_number_status (1);
9092                           java_complete_expand_method (d);
9093                           restore_line_number_status (0);
9094                         }
9095                     }
9096                 }
9097             }
9098         }
9099       while (something_changed);
9100     }
9101 #endif
9102
9103   /* If we've found error at that stage, don't try to generate
9104      anything, unless we're emitting xrefs or checking the syntax only
9105      (but not using -fsyntax-only for the purpose of generating
9106      bytecode. */
9107   if (java_error_count && !flag_emit_xref
9108       && (!flag_syntax_only && !flag_emit_class_files))
9109     return;
9110
9111   /* Now things are stable, go for generation of the class data. */
9112
9113   /* We pessimistically marked all methods and fields external until
9114      we knew what set of classes we were planning to compile.  Now mark
9115      those that will be generated locally as not external.  */
9116   for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
9117     {
9118       tree current;
9119       ctxp = cur_ctxp;
9120       for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
9121         java_mark_class_local (TREE_TYPE (current));
9122     }
9123
9124   /* Compile the classes.  */
9125   for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
9126     {
9127       tree current;
9128       reversed_class_list = NULL;
9129
9130       ctxp = cur_ctxp;
9131
9132       /* We write out the classes in reverse order.  This ensures that
9133          inner classes are written before their containing classes,
9134          which is important for parallel builds.  Otherwise, the
9135          class file for the outer class may be found, but the class
9136          file for the inner class may not be present.  In that
9137          situation, the compiler cannot fall back to the original
9138          source, having already read the outer class, so we must
9139          prevent that situation.  */
9140       for (current = ctxp->class_list;
9141            current;
9142            current = TREE_CHAIN (current))
9143         reversed_class_list
9144           = tree_cons (NULL_TREE, current, reversed_class_list);
9145
9146       for (current = reversed_class_list;
9147            current;
9148            current = TREE_CHAIN (current))
9149         {
9150           output_class = current_class = TREE_TYPE (TREE_VALUE (current));
9151           if (flag_emit_class_files)
9152             write_classfile (current_class);
9153           if (flag_emit_xref)
9154             expand_xref (current_class);
9155           else if (! flag_syntax_only)
9156             java_expand_method_bodies (current_class);
9157         }
9158     }
9159 }
9160
9161 void
9162 java_finish_classes (void)
9163 {
9164   static struct parser_ctxt *cur_ctxp = NULL;
9165   for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
9166     {
9167       tree current;
9168       ctxp = cur_ctxp;
9169       for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
9170         {
9171           output_class = current_class = TREE_TYPE (current);
9172           finish_class ();
9173         }
9174     }
9175 }
9176
9177 /* Wrap non WFL PRIMARY around a WFL and set EXPR_WFL_QUALIFICATION to
9178    a tree list node containing RIGHT. Fore coming RIGHTs will be
9179    chained to this hook. LOCATION contains the location of the
9180    separating `.' operator.  */
9181
9182 static tree
9183 make_qualified_primary (tree primary, tree right, int location)
9184 {
9185   tree wfl;
9186
9187   if (TREE_CODE (primary) != EXPR_WITH_FILE_LOCATION)
9188     wfl = build_wfl_wrap (primary, location);
9189   else
9190     {
9191       wfl = primary;
9192       /* If wfl wasn't qualified, we build a first anchor */
9193       if (!EXPR_WFL_QUALIFICATION (wfl))
9194         EXPR_WFL_QUALIFICATION (wfl) = build_tree_list (wfl, NULL_TREE);
9195     }
9196
9197   /* And chain them */
9198   EXPR_WFL_LINECOL (right) = location;
9199   chainon (EXPR_WFL_QUALIFICATION (wfl), build_tree_list (right, NULL_TREE));
9200   PRIMARY_P (wfl) =  1;
9201   return wfl;
9202 }
9203
9204 /* Simple merge of two name separated by a `.' */
9205
9206 static tree
9207 merge_qualified_name (tree left, tree right)
9208 {
9209   tree node;
9210   if (!left && !right)
9211     return NULL_TREE;
9212
9213   if (!left)
9214     return right;
9215
9216   if (!right)
9217     return left;
9218
9219   obstack_grow (&temporary_obstack, IDENTIFIER_POINTER (left),
9220                 IDENTIFIER_LENGTH (left));
9221   obstack_1grow (&temporary_obstack, '.');
9222   obstack_grow0 (&temporary_obstack, IDENTIFIER_POINTER (right),
9223                  IDENTIFIER_LENGTH (right));
9224   node =  get_identifier (obstack_base (&temporary_obstack));
9225   obstack_free (&temporary_obstack, obstack_base (&temporary_obstack));
9226   QUALIFIED_P (node) = 1;
9227   return node;
9228 }
9229
9230 /* Merge the two parts of a qualified name into LEFT.  Set the
9231    location information of the resulting node to LOCATION, usually
9232    inherited from the location information of the `.' operator. */
9233
9234 static tree
9235 make_qualified_name (tree left, tree right, int location)
9236 {
9237 #ifdef USE_COMPONENT_REF
9238   tree node = build (COMPONENT_REF, NULL_TREE, left, right, NULL_TREE);
9239   EXPR_WFL_LINECOL (node) = location;
9240   return node;
9241 #else
9242   tree left_id = EXPR_WFL_NODE (left);
9243   tree right_id = EXPR_WFL_NODE (right);
9244   tree wfl, merge;
9245
9246   merge = merge_qualified_name (left_id, right_id);
9247
9248   /* Left wasn't qualified and is now qualified */
9249   if (!QUALIFIED_P (left_id))
9250     {
9251       tree wfl = build_expr_wfl (left_id, ctxp->filename, 0, 0);
9252       EXPR_WFL_LINECOL (wfl) = EXPR_WFL_LINECOL (left);
9253       EXPR_WFL_QUALIFICATION (left) = build_tree_list (wfl, NULL_TREE);
9254     }
9255
9256   wfl = build_expr_wfl (right_id, ctxp->filename, 0, 0);
9257   EXPR_WFL_LINECOL (wfl) = location;
9258   chainon (EXPR_WFL_QUALIFICATION (left), build_tree_list (wfl, NULL_TREE));
9259
9260   EXPR_WFL_NODE (left) = merge;
9261   return left;
9262 #endif
9263 }
9264
9265 /* Extract the last identifier component of the qualified in WFL. The
9266    last identifier is removed from the linked list */
9267
9268 static tree
9269 cut_identifier_in_qualified (tree wfl)
9270 {
9271   tree q;
9272   tree previous = NULL_TREE;
9273   for (q = EXPR_WFL_QUALIFICATION (wfl); ; previous = q, q = TREE_CHAIN (q))
9274     if (!TREE_CHAIN (q))
9275       {
9276         if (!previous)
9277           /* Operating on a non qualified qualified WFL.  */
9278           abort ();
9279
9280         TREE_CHAIN (previous) = NULL_TREE;
9281         return TREE_PURPOSE (q);
9282       }
9283 }
9284
9285 /* Resolve the expression name NAME. Return its decl.  */
9286
9287 static tree
9288 resolve_expression_name (tree id, tree *orig)
9289 {
9290   tree name = EXPR_WFL_NODE (id);
9291   tree decl;
9292
9293   /* 6.5.5.1: Simple expression names */
9294   if (!PRIMARY_P (id) && !QUALIFIED_P (name))
9295     {
9296       /* 15.13.1: NAME can appear within the scope of a local variable
9297          declaration */
9298       if ((decl = IDENTIFIER_LOCAL_VALUE (name)))
9299         return decl;
9300
9301       /* 15.13.1: NAME can appear within a class declaration */
9302       else
9303         {
9304           decl = lookup_field_wrapper (current_class, name);
9305           if (decl)
9306             {
9307               tree access = NULL_TREE;
9308               int fs = FIELD_STATIC (decl);
9309
9310               /* If we're accessing an outer scope local alias, make
9311                  sure we change the name of the field we're going to
9312                  build access to. */
9313               if (FIELD_LOCAL_ALIAS_USED (decl))
9314                 name = DECL_NAME (decl);
9315
9316               check_deprecation (id, decl);
9317
9318               /* Instance variable (8.3.1.1) can't appear within
9319                  static method, static initializer or initializer for
9320                  a static variable. */
9321               if (!fs && METHOD_STATIC (current_function_decl))
9322                 {
9323                   static_ref_err (id, name, current_class);
9324                   return error_mark_node;
9325                 }
9326               /* Instance variables can't appear as an argument of
9327                  an explicit constructor invocation */
9328               if (!fs && ctxp->explicit_constructor_p
9329                   && !enclosing_context_p (DECL_CONTEXT (decl), current_class))
9330                 {
9331                   parse_error_context
9332                     (id, "Can't reference `%s' before the superclass constructor has been called", IDENTIFIER_POINTER (name));
9333                   return error_mark_node;
9334                 }
9335
9336               /* If we're processing an inner class and we're trying
9337                  to access a field belonging to an outer class, build
9338                  the access to the field */
9339               if (!fs && outer_field_access_p (current_class, decl))
9340                 {
9341                   if (CLASS_STATIC (TYPE_NAME (current_class)))
9342                     {
9343                       static_ref_err (id, DECL_NAME (decl), current_class);
9344                       return error_mark_node;
9345                     }
9346                   access = build_outer_field_access (id, decl);
9347                   if (orig)
9348                     *orig = access;
9349                   return access;
9350                 }
9351
9352               /* Otherwise build what it takes to access the field */
9353               access = build_field_ref ((fs ? NULL_TREE : current_this),
9354                                         DECL_CONTEXT (decl), name);
9355               if (fs)
9356                 access = maybe_build_class_init_for_field (decl, access);
9357               /* We may be asked to save the real field access node */
9358               if (orig)
9359                 *orig = access;
9360               /* Last check: can we access the field? */
9361               if (not_accessible_p (current_class, decl, NULL_TREE, 0))
9362                 {
9363                   not_accessible_field_error (id, decl);
9364                   return error_mark_node;
9365                 }
9366               /* And we return what we got */
9367               return access;
9368             }
9369           /* Fall down to error report on undefined variable */
9370         }
9371     }
9372   /* 6.5.5.2 Qualified Expression Names */
9373   else
9374     {
9375       if (orig)
9376         *orig = NULL_TREE;
9377       qualify_ambiguous_name (id);
9378       /* 15.10.1 Field Access Using a Primary and/or Expression Name */
9379       /* 15.10.2: Accessing Superclass Members using super */
9380       return resolve_field_access (id, orig, NULL);
9381     }
9382
9383   /* We've got an error here */
9384   if (INNER_CLASS_TYPE_P (current_class))
9385     parse_error_context (id,
9386                          "Local variable `%s' can't be accessed from within the inner class `%s' unless it is declared final",
9387                          IDENTIFIER_POINTER (name),
9388                          IDENTIFIER_POINTER (DECL_NAME
9389                                              (TYPE_NAME (current_class))));
9390   else
9391     parse_error_context (id, "Undefined variable `%s'",
9392                          IDENTIFIER_POINTER (name));
9393
9394   return error_mark_node;
9395 }
9396
9397 static void
9398 static_ref_err (tree wfl, tree field_id, tree class_type)
9399 {
9400   parse_error_context
9401     (wfl,
9402      "Can't make a static reference to nonstatic variable `%s' in class `%s'",
9403      IDENTIFIER_POINTER (field_id),
9404      IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (class_type))));
9405 }
9406
9407 /* 15.10.1 Field Access Using a Primary and/or Expression Name.
9408    We return something suitable to generate the field access. We also
9409    return the field decl in FIELD_DECL and its type in FIELD_TYPE.  If
9410    recipient's address can be null. */
9411
9412 static tree
9413 resolve_field_access (tree qual_wfl, tree *field_decl, tree *field_type)
9414 {
9415   int is_static = 0;
9416   tree field_ref;
9417   tree decl = NULL_TREE, where_found, type_found;
9418
9419   if (resolve_qualified_expression_name (qual_wfl, &decl,
9420                                          &where_found, &type_found))
9421     return error_mark_node;
9422
9423   /* Resolve the LENGTH field of an array here */
9424   if (DECL_P (decl) && DECL_NAME (decl) == length_identifier_node
9425       && type_found && TYPE_ARRAY_P (type_found)
9426       && ! flag_emit_class_files && ! flag_emit_xref)
9427     {
9428       tree length = build_java_array_length_access (where_found);
9429       field_ref = length;
9430
9431       /* In case we're dealing with a static array, we need to
9432          initialize its class before the array length can be fetched.
9433          It's also a good time to create a DECL_RTL for the field if
9434          none already exists, otherwise if the field was declared in a
9435          class found in an external file and hasn't been (and won't
9436          be) accessed for its value, none will be created. */
9437       if (TREE_CODE (where_found) == VAR_DECL && FIELD_STATIC (where_found))
9438         {
9439           build_static_field_ref (where_found);
9440           field_ref = build_class_init (DECL_CONTEXT (where_found), field_ref);
9441         }
9442     }
9443   /* We might have been trying to resolve field.method(). In which
9444      case, the resolution is over and decl is the answer */
9445   else if (JDECL_P (decl) && IDENTIFIER_LOCAL_VALUE (DECL_NAME (decl)) == decl)
9446     field_ref = decl;
9447   else if (JDECL_P (decl))
9448     {
9449       if (!type_found)
9450         type_found = DECL_CONTEXT (decl);
9451       is_static = FIELD_STATIC (decl);
9452       field_ref = build_field_ref ((is_static && !flag_emit_xref?
9453                                     NULL_TREE : where_found),
9454                                    type_found, DECL_NAME (decl));
9455       if (field_ref == error_mark_node)
9456         return error_mark_node;
9457       if (is_static)
9458         field_ref = maybe_build_class_init_for_field (decl, field_ref);
9459
9460       /* If we're looking at a static field, we may need to generate a
9461          class initialization for it.  This can happen when the access
9462          looks like `field.ref', where `field' is a static field in an
9463          interface we implement.  */
9464       if (!flag_emit_class_files
9465           && !flag_emit_xref
9466           && TREE_CODE (where_found) == VAR_DECL
9467           && FIELD_STATIC (where_found))
9468         {
9469           build_static_field_ref (where_found);
9470           field_ref = build_class_init (DECL_CONTEXT (where_found), field_ref);
9471         }
9472     }
9473   else
9474     field_ref = decl;
9475
9476   if (field_decl)
9477     *field_decl = decl;
9478   if (field_type)
9479     *field_type = (QUAL_DECL_TYPE (decl) ?
9480                    QUAL_DECL_TYPE (decl) : TREE_TYPE (decl));
9481   return field_ref;
9482 }
9483
9484 /* If NODE is an access to f static field, strip out the class
9485    initialization part and return the field decl, otherwise, return
9486    NODE. */
9487
9488 static tree
9489 strip_out_static_field_access_decl (tree node)
9490 {
9491   if (TREE_CODE (node) == COMPOUND_EXPR)
9492     {
9493       tree op1 = TREE_OPERAND (node, 1);
9494       if (TREE_CODE (op1) == COMPOUND_EXPR)
9495          {
9496            tree call = TREE_OPERAND (op1, 0);
9497            if (TREE_CODE (call) == CALL_EXPR
9498                && TREE_CODE (TREE_OPERAND (call, 0)) == ADDR_EXPR
9499                && TREE_OPERAND (TREE_OPERAND (call, 0), 0)
9500                == soft_initclass_node)
9501              return TREE_OPERAND (op1, 1);
9502          }
9503       else if (JDECL_P (op1))
9504         return op1;
9505     }
9506   return node;
9507 }
9508
9509 /* 6.5.5.2: Qualified Expression Names */
9510
9511 static int
9512 resolve_qualified_expression_name (tree wfl, tree *found_decl,
9513                                    tree *where_found, tree *type_found)
9514 {
9515   int from_type = 0;            /* Field search initiated from a type */
9516   int from_super = 0, from_cast = 0, from_qualified_this = 0;
9517   int previous_call_static = 0;
9518   int is_static;
9519   tree decl = NULL_TREE, type = NULL_TREE, q;
9520   /* For certain for of inner class instantiation */
9521   tree saved_current, saved_this;
9522 #define RESTORE_THIS_AND_CURRENT_CLASS                          \
9523   { current_class = saved_current; current_this = saved_this;}
9524
9525   *type_found = *where_found = NULL_TREE;
9526
9527   for (q = EXPR_WFL_QUALIFICATION (wfl); q; q = TREE_CHAIN (q))
9528     {
9529       tree qual_wfl = QUAL_WFL (q);
9530       tree ret_decl;            /* for EH checking */
9531       int location;             /* for EH checking */
9532
9533       /* 15.10.1 Field Access Using a Primary */
9534       switch (TREE_CODE (qual_wfl))
9535         {
9536         case CALL_EXPR:
9537         case NEW_CLASS_EXPR:
9538           /* If the access to the function call is a non static field,
9539              build the code to access it. */
9540           if (JDECL_P (decl) && !FIELD_STATIC (decl))
9541             {
9542               decl = maybe_access_field (decl, *where_found,
9543                                          DECL_CONTEXT (decl));
9544               if (decl == error_mark_node)
9545                 return 1;
9546             }
9547
9548           /* And code for the function call */
9549           if (complete_function_arguments (qual_wfl))
9550             return 1;
9551
9552           /* We might have to setup a new current class and a new this
9553              for the search of an inner class, relative to the type of
9554              a expression resolved as `decl'. The current values are
9555              saved and restored shortly after */
9556           saved_current = current_class;
9557           saved_this = current_this;
9558           if (decl
9559               && (TREE_CODE (qual_wfl) == NEW_CLASS_EXPR
9560                   || from_qualified_this))
9561             {
9562               /* If we still have `from_qualified_this', we have the form
9563                  <T>.this.f() and we need to build <T>.this */
9564               if (from_qualified_this)
9565                 {
9566                   decl = build_access_to_thisn (current_class, type, 0);
9567                   decl = java_complete_tree (decl);
9568                   type = TREE_TYPE (TREE_TYPE (decl));
9569                 }
9570               current_class = type;
9571               current_this = decl;
9572               from_qualified_this = 0;
9573             }
9574
9575           if (from_super && TREE_CODE (qual_wfl) == CALL_EXPR)
9576             CALL_USING_SUPER (qual_wfl) = 1;
9577           location = (TREE_CODE (qual_wfl) == CALL_EXPR ?
9578                       EXPR_WFL_LINECOL (TREE_OPERAND (qual_wfl, 0)) : 0);
9579           *where_found = patch_method_invocation (qual_wfl, decl, type,
9580                                                   from_super,
9581                                                   &is_static, &ret_decl);
9582           from_super = 0;
9583           if (*where_found == error_mark_node)
9584             {
9585               RESTORE_THIS_AND_CURRENT_CLASS;
9586               return 1;
9587             }
9588           *type_found = type = QUAL_DECL_TYPE (*where_found);
9589
9590           *where_found = force_evaluation_order (*where_found);
9591
9592           /* If we're creating an inner class instance, check for that
9593              an enclosing instance is in scope */
9594           if (TREE_CODE (qual_wfl) == NEW_CLASS_EXPR
9595               && INNER_ENCLOSING_SCOPE_CHECK (type))
9596             {
9597               parse_error_context
9598                 (qual_wfl, "No enclosing instance for inner class `%s' is in scope%s",
9599                  lang_printable_name (type, 0),
9600                  (!current_this ? "" :
9601                   "; an explicit one must be provided when creating this inner class"));
9602               RESTORE_THIS_AND_CURRENT_CLASS;
9603               return 1;
9604             }
9605
9606           /* In case we had to change then to resolve a inner class
9607              instantiation using a primary qualified by a `new' */
9608           RESTORE_THIS_AND_CURRENT_CLASS;
9609
9610           if (location)
9611             {
9612               tree arguments = NULL_TREE;
9613               if (TREE_CODE (qual_wfl) == CALL_EXPR
9614                   && TREE_OPERAND (qual_wfl, 1) != NULL_TREE)
9615                 arguments = TREE_VALUE (TREE_OPERAND (qual_wfl, 1));
9616               check_thrown_exceptions (location, ret_decl, arguments);
9617             }
9618
9619           /* If the previous call was static and this one is too,
9620              build a compound expression to hold the two (because in
9621              that case, previous function calls aren't transported as
9622              forcoming function's argument. */
9623           if (previous_call_static && is_static)
9624             {
9625               decl = build (COMPOUND_EXPR, TREE_TYPE (*where_found),
9626                             decl, *where_found);
9627               TREE_SIDE_EFFECTS (decl) = 1;
9628             }
9629           else
9630             {
9631               previous_call_static = is_static;
9632               decl = *where_found;
9633             }
9634           from_type = 0;
9635           continue;
9636
9637         case NEW_ARRAY_EXPR:
9638         case NEW_ANONYMOUS_ARRAY_EXPR:
9639           *where_found = decl = java_complete_tree (qual_wfl);
9640           if (decl == error_mark_node)
9641             return 1;
9642           *type_found = type = QUAL_DECL_TYPE (decl);
9643           continue;
9644
9645         case CONVERT_EXPR:
9646           *where_found = decl = java_complete_tree (qual_wfl);
9647           if (decl == error_mark_node)
9648             return 1;
9649           *type_found = type = QUAL_DECL_TYPE (decl);
9650           from_cast = 1;
9651           continue;
9652
9653         case CONDITIONAL_EXPR:
9654         case STRING_CST:
9655         case MODIFY_EXPR:
9656           *where_found = decl = java_complete_tree (qual_wfl);
9657           if (decl == error_mark_node)
9658             return 1;
9659           *type_found = type = QUAL_DECL_TYPE (decl);
9660           continue;
9661
9662         case ARRAY_REF:
9663           /* If the access to the function call is a non static field,
9664              build the code to access it. */
9665           if (JDECL_P (decl) && !FIELD_STATIC (decl))
9666             {
9667               decl = maybe_access_field (decl, *where_found, type);
9668               if (decl == error_mark_node)
9669                 return 1;
9670             }
9671           /* And code for the array reference expression */
9672           decl = java_complete_tree (qual_wfl);
9673           if (decl == error_mark_node)
9674             return 1;
9675           type = QUAL_DECL_TYPE (decl);
9676           continue;
9677
9678         case PLUS_EXPR:
9679           if ((decl = java_complete_tree (qual_wfl)) == error_mark_node)
9680             return 1;
9681           if ((type = patch_string (decl)))
9682             decl = type;
9683           *where_found = QUAL_RESOLUTION (q) = decl;
9684           *type_found = type = TREE_TYPE (decl);
9685           break;
9686
9687         case CLASS_LITERAL:
9688           if ((decl = java_complete_tree (qual_wfl)) == error_mark_node)
9689             return 1;
9690           *where_found = QUAL_RESOLUTION (q) = decl;
9691           *type_found = type = TREE_TYPE (decl);
9692           break;
9693
9694         default:
9695           /* Fix for -Wall Just go to the next statement. Don't
9696              continue */
9697           break;
9698         }
9699
9700       /* If we fall here, we weren't processing a (static) function call. */
9701       previous_call_static = 0;
9702
9703       /* It can be the keyword THIS */
9704       if (TREE_CODE (qual_wfl) == EXPR_WITH_FILE_LOCATION
9705           && EXPR_WFL_NODE (qual_wfl) == this_identifier_node)
9706         {
9707           if (!current_this)
9708             {
9709               parse_error_context
9710                 (wfl, "Keyword `this' used outside allowed context");
9711               return 1;
9712             }
9713           if (ctxp->explicit_constructor_p
9714               && type == current_class)
9715             {
9716               parse_error_context (wfl, "Can't reference `this' before the superclass constructor has been called");
9717               return 1;
9718             }
9719           /* We have to generate code for intermediate access */
9720           if (!from_type || TREE_TYPE (TREE_TYPE (current_this)) == type)
9721             {
9722               *where_found = decl = current_this;
9723               *type_found = type = QUAL_DECL_TYPE (decl);
9724             }
9725           /* We're trying to access the this from somewhere else. Make sure
9726              it's allowed before doing so. */
9727           else
9728             {
9729               if (!enclosing_context_p (type, current_class))
9730                 {
9731                   char *p  = xstrdup (lang_printable_name (type, 0));
9732                   parse_error_context (qual_wfl, "Can't use variable `%s.this': type `%s' isn't an outer type of type `%s'",
9733                                        p, p,
9734                                        lang_printable_name (current_class, 0));
9735                   free (p);
9736                   return 1;
9737                 }
9738               from_qualified_this = 1;
9739               /* If there's nothing else after that, we need to
9740                  produce something now, otherwise, the section of the
9741                  code that needs to produce <T>.this will generate
9742                  what is necessary. */
9743               if (!TREE_CHAIN (q))
9744                 {
9745                   decl = build_access_to_thisn (current_class, type, 0);
9746                   *where_found = decl = java_complete_tree (decl);
9747                   *type_found = type = TREE_TYPE (decl);
9748                 }
9749             }
9750
9751           from_type = 0;
9752           continue;
9753         }
9754
9755       /* 15.10.2 Accessing Superclass Members using SUPER */
9756       if (TREE_CODE (qual_wfl) == EXPR_WITH_FILE_LOCATION
9757           && EXPR_WFL_NODE (qual_wfl) == super_identifier_node)
9758         {
9759           tree node;
9760           /* Check on the restricted use of SUPER */
9761           if (METHOD_STATIC (current_function_decl)
9762               || current_class == object_type_node)
9763             {
9764               parse_error_context
9765                 (wfl, "Keyword `super' used outside allowed context");
9766               return 1;
9767             }
9768           /* Otherwise, treat SUPER as (SUPER_CLASS)THIS */
9769           node = build_cast (EXPR_WFL_LINECOL (qual_wfl),
9770                              CLASSTYPE_SUPER (current_class),
9771                              build_this (EXPR_WFL_LINECOL (qual_wfl)));
9772           *where_found = decl = java_complete_tree (node);
9773           if (decl == error_mark_node)
9774             return 1;
9775           *type_found = type = QUAL_DECL_TYPE (decl);
9776           from_super = from_type = 1;
9777           continue;
9778         }
9779
9780       /* 15.13.1: Can't search for field name in packages, so we
9781          assume a variable/class name was meant. */
9782       if (RESOLVE_PACKAGE_NAME_P (qual_wfl))
9783         {
9784           tree name;
9785           if ((decl = resolve_package (wfl, &q, &name)))
9786             {
9787               tree list;
9788               *where_found = decl;
9789
9790               check_pkg_class_access (DECL_NAME (decl), qual_wfl, true, NULL);
9791
9792               /* We want to be absolutely sure that the class is laid
9793                  out. We're going to search something inside it. */
9794               *type_found = type = TREE_TYPE (decl);
9795               layout_class (type);
9796               from_type = 1;
9797
9798               /* Fix them all the way down, if any are left. */
9799               if (q)
9800                 {
9801                   list = TREE_CHAIN (q);
9802                   while (list)
9803                     {
9804                       RESOLVE_PACKAGE_NAME_P (QUAL_WFL (list)) = 0;
9805                       list = TREE_CHAIN (list);
9806                     }
9807                 }
9808             }
9809           else
9810             {
9811               if (from_super || from_cast)
9812                 parse_error_context
9813                   ((from_cast ? qual_wfl : wfl),
9814                    "No variable `%s' defined in class `%s'",
9815                    IDENTIFIER_POINTER (EXPR_WFL_NODE (qual_wfl)),
9816                    lang_printable_name (type, 0));
9817               else
9818                 parse_error_context
9819                   (qual_wfl, "Undefined variable or class name: `%s'",
9820                    IDENTIFIER_POINTER (name));
9821               return 1;
9822             }
9823         }
9824
9825       /* We have a type name. It's been already resolved when the
9826          expression was qualified. */
9827       else if (RESOLVE_TYPE_NAME_P (qual_wfl) && QUAL_RESOLUTION (q))
9828         {
9829           decl = QUAL_RESOLUTION (q);
9830
9831           /* Sneak preview. If next we see a `new', we're facing a
9832              qualification which resulted in a type being selected
9833              instead of a field.  Report the error.  */
9834           if(TREE_CHAIN (q)
9835              && TREE_CODE (TREE_PURPOSE (TREE_CHAIN (q))) == NEW_CLASS_EXPR)
9836             {
9837               parse_error_context (qual_wfl, "Undefined variable `%s'",
9838                                    IDENTIFIER_POINTER (EXPR_WFL_NODE (wfl)));
9839               return 1;
9840             }
9841
9842           check_pkg_class_access (DECL_NAME (decl), qual_wfl, true, NULL);
9843
9844           check_deprecation (qual_wfl, decl);
9845
9846           type = TREE_TYPE (decl);
9847           from_type = 1;
9848         }
9849       /* We resolve an expression name */
9850       else
9851         {
9852           tree field_decl = NULL_TREE;
9853
9854           /* If there exists an early resolution, use it. That occurs
9855              only once and we know that there are more things to
9856              come. Don't do that when processing something after SUPER
9857              (we need more thing to be put in place below */
9858           if (!from_super && QUAL_RESOLUTION (q))
9859             {
9860               decl = QUAL_RESOLUTION (q);
9861               if (!type)
9862                 {
9863                   if (TREE_CODE (decl) == FIELD_DECL && !FIELD_STATIC (decl))
9864                     {
9865                       if (current_this)
9866                         *where_found = current_this;
9867                       else
9868                         {
9869                           static_ref_err (qual_wfl, DECL_NAME (decl),
9870                                           current_class);
9871                           return 1;
9872                         }
9873                       if (outer_field_access_p (current_class, decl))
9874                         decl = build_outer_field_access (qual_wfl, decl);
9875                     }
9876                   else
9877                     {
9878                       *where_found = TREE_TYPE (decl);
9879                       if (TREE_CODE (*where_found) == POINTER_TYPE)
9880                         *where_found = TREE_TYPE (*where_found);
9881                     }
9882                 }
9883             }
9884
9885           /* Report and error if we're using a numerical literal as a
9886              qualifier. It can only be an INTEGER_CST. */
9887           else if (TREE_CODE (qual_wfl) == INTEGER_CST)
9888             {
9889               parse_error_context
9890                 (wfl, "Can't use type `%s' as a qualifier",
9891                  lang_printable_name (TREE_TYPE (qual_wfl), 0));
9892               return 1;
9893             }
9894
9895           /* We have to search for a field, knowing the type of its
9896              container. The flag FROM_TYPE indicates that we resolved
9897              the last member of the expression as a type name, which
9898              means that for the resolution of this field, we'll look
9899              for other errors than if it was resolved as a member of
9900              an other field. */
9901           else
9902             {
9903               int is_static;
9904               tree field_decl_type; /* For layout */
9905
9906               if (!from_type && !JREFERENCE_TYPE_P (type))
9907                 {
9908                   parse_error_context
9909                     (qual_wfl, "Attempt to reference field `%s' in `%s %s'",
9910                      IDENTIFIER_POINTER (EXPR_WFL_NODE (qual_wfl)),
9911                      lang_printable_name (type, 0),
9912                      IDENTIFIER_POINTER (DECL_NAME (decl)));
9913                   return 1;
9914                 }
9915
9916               field_decl = lookup_field_wrapper (type,
9917                                                  EXPR_WFL_NODE (qual_wfl));
9918
9919               /* Maybe what we're trying to access to is an inner
9920                  class, only if decl is a TYPE_DECL. */
9921               if (!field_decl && TREE_CODE (decl) == TYPE_DECL)
9922                 {
9923                   tree ptr, inner_decl;
9924
9925                   BUILD_PTR_FROM_NAME (ptr, EXPR_WFL_NODE (qual_wfl));
9926                   inner_decl = resolve_class (decl, ptr, NULL_TREE, qual_wfl);
9927                   if (inner_decl)
9928                     {
9929                       check_inner_class_access (inner_decl, decl, qual_wfl);
9930                       type = TREE_TYPE (inner_decl);
9931                       decl = inner_decl;
9932                       from_type = 1;
9933                       continue;
9934                     }
9935                 }
9936
9937               if (field_decl == NULL_TREE)
9938                 {
9939                   parse_error_context
9940                     (qual_wfl, "No variable `%s' defined in type `%s'",
9941                      IDENTIFIER_POINTER (EXPR_WFL_NODE (qual_wfl)),
9942                      GET_TYPE_NAME (type));
9943                   return 1;
9944                 }
9945               if (field_decl == error_mark_node)
9946                 return 1;
9947
9948               /* Layout the type of field_decl, since we may need
9949                  it. Don't do primitive types or loaded classes. The
9950                  situation of non primitive arrays may not handled
9951                  properly here. FIXME */
9952               if (TREE_CODE (TREE_TYPE (field_decl)) == POINTER_TYPE)
9953                 field_decl_type = TREE_TYPE (TREE_TYPE (field_decl));
9954               else
9955                 field_decl_type = TREE_TYPE (field_decl);
9956               if (!JPRIMITIVE_TYPE_P (field_decl_type)
9957                   && !CLASS_LOADED_P (field_decl_type)
9958                   && !TYPE_ARRAY_P (field_decl_type))
9959                 resolve_and_layout (field_decl_type, NULL_TREE);
9960
9961               /* Check on accessibility here */
9962               if (not_accessible_p (current_class, field_decl,
9963                                     DECL_CONTEXT (field_decl), from_super))
9964                 return not_accessible_field_error (qual_wfl,field_decl);
9965               check_deprecation (qual_wfl, field_decl);
9966
9967               /* There are things to check when fields are accessed
9968                  from type. There are no restrictions on a static
9969                  declaration of the field when it is accessed from an
9970                  interface */
9971               is_static = FIELD_STATIC (field_decl);
9972               if (!from_super && from_type
9973                   && !TYPE_INTERFACE_P (type)
9974                   && !is_static
9975                   && (current_function_decl
9976                       && METHOD_STATIC (current_function_decl)))
9977                 {
9978                   static_ref_err (qual_wfl, EXPR_WFL_NODE (qual_wfl), type);
9979                   return 1;
9980                 }
9981               from_cast = from_super = 0;
9982
9983               /* It's an access from a type but it isn't static, we
9984                  make it relative to `this'. */
9985               if (!is_static && from_type)
9986                 decl = current_this;
9987
9988               /* If we need to generate something to get a proper
9989                  handle on what this field is accessed from, do it
9990                  now. */
9991               if (!is_static)
9992                 {
9993                   decl = maybe_access_field (decl, *where_found, *type_found);
9994                   if (decl == error_mark_node)
9995                     return 1;
9996                 }
9997
9998               /* We want to keep the location were found it, and the type
9999                  we found. */
10000               *where_found = decl;
10001               *type_found = type;
10002
10003               /* Generate the correct expression for field access from
10004                  qualified this */
10005               if (from_qualified_this)
10006                 {
10007                   field_decl = build_outer_field_access (qual_wfl, field_decl);
10008                   from_qualified_this = 0;
10009                 }
10010
10011               /* This is the decl found and eventually the next one to
10012                  search from */
10013               decl = field_decl;
10014             }
10015           from_type = 0;
10016           type = QUAL_DECL_TYPE (decl);
10017
10018           /* Sneak preview. If decl is qualified by a `new', report
10019              the error here to be accurate on the peculiar construct */
10020           if (TREE_CHAIN (q)
10021               && TREE_CODE (TREE_PURPOSE (TREE_CHAIN (q))) == NEW_CLASS_EXPR
10022               && !JREFERENCE_TYPE_P (type))
10023             {
10024               parse_error_context (qual_wfl, "Attempt to reference field `new' in a `%s'",
10025                                    lang_printable_name (type, 0));
10026               return 1;
10027             }
10028         }
10029       /* `q' might have changed due to a after package resolution
10030          re-qualification */
10031       if (!q)
10032         break;
10033     }
10034   *found_decl = decl;
10035   return 0;
10036 }
10037
10038 /* 6.6 Qualified name and access control. Returns 1 if MEMBER (a decl)
10039    can't be accessed from REFERENCE (a record type). If MEMBER
10040    features a protected access, we then use WHERE which, if non null,
10041    holds the type of MEMBER's access that is checked against
10042    6.6.2.1. This function should be used when decl is a field or a
10043    method.  */
10044
10045 static int
10046 not_accessible_p (tree reference, tree member, tree where, int from_super)
10047 {
10048   int access_flag = get_access_flags_from_decl (member);
10049
10050   /* Inner classes are processed by check_inner_class_access */
10051   if (INNER_CLASS_TYPE_P (reference))
10052     return 0;
10053
10054   /* Access always granted for members declared public */
10055   if (access_flag & ACC_PUBLIC)
10056     return 0;
10057
10058   /* Check access on protected members */
10059   if (access_flag & ACC_PROTECTED)
10060     {
10061       /* Access granted if it occurs from within the package
10062          containing the class in which the protected member is
10063          declared */
10064       if (class_in_current_package (DECL_CONTEXT (member)))
10065         return 0;
10066
10067       /* If accessed with the form `super.member', then access is granted */
10068       if (from_super)
10069         return 0;
10070
10071       /* If where is active, access was made through a
10072          qualifier. Access is granted if the type of the qualifier is
10073          or is a sublass of the type the access made from (6.6.2.1.)  */
10074       if (where && !inherits_from_p (reference, where))
10075         return 1;
10076
10077       /* Otherwise, access is granted if occurring from the class where
10078          member is declared or a subclass of it. Find the right
10079          context to perform the check */
10080       if (PURE_INNER_CLASS_TYPE_P (reference))
10081         {
10082           while (INNER_CLASS_TYPE_P (reference))
10083             {
10084               if (inherits_from_p (reference, DECL_CONTEXT (member)))
10085                 return 0;
10086               reference = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (reference)));
10087             }
10088         }
10089       if (inherits_from_p (reference, DECL_CONTEXT (member)))
10090         return 0;
10091       return 1;
10092     }
10093
10094   /* Check access on private members. Access is granted only if it
10095      occurs from within the class in which it is declared -- that does
10096      it for innerclasses too. */
10097   if (access_flag & ACC_PRIVATE)
10098     {
10099       if (reference == DECL_CONTEXT (member))
10100         return 0;
10101       if (enclosing_context_p (reference, DECL_CONTEXT (member)))
10102         return 0;
10103       return 1;
10104     }
10105
10106   /* Default access is permitted only when occurring from within the
10107      package in which the context (MEMBER) is declared.  */
10108   return !class_in_current_package (DECL_CONTEXT (member));
10109 }
10110
10111 /* Test deprecated decl access.  */
10112 static void
10113 check_deprecation (tree wfl, tree decl)
10114 {
10115   const char *file;
10116   tree elt;
10117
10118   if (! flag_deprecated)
10119     return;
10120
10121   /* We want to look at the element type of arrays here, so we strip
10122      all surrounding array types.  */
10123   if (TYPE_ARRAY_P (TREE_TYPE (decl)))
10124     {
10125       elt = TREE_TYPE (decl);
10126       while (TYPE_ARRAY_P (elt))
10127         elt = TYPE_ARRAY_ELEMENT (elt);
10128       /* We'll end up with a pointer type, so we use TREE_TYPE to go
10129          to the record.  */
10130       decl = TYPE_NAME (TREE_TYPE (elt));
10131     }
10132   file = DECL_SOURCE_FILE (decl);
10133
10134   /* Complain if the field is deprecated and the file it was defined
10135      in isn't compiled at the same time the file which contains its
10136      use is */
10137   if (DECL_DEPRECATED (decl)
10138       && !IS_A_COMMAND_LINE_FILENAME_P (get_identifier (file)))
10139     {
10140       const char *the;
10141       switch (TREE_CODE (decl))
10142         {
10143         case FUNCTION_DECL:
10144           the = "method";
10145           break;
10146         case FIELD_DECL:
10147         case VAR_DECL:
10148           the = "field";
10149           break;
10150         case TYPE_DECL:
10151           parse_warning_context (wfl, "The class `%s' has been deprecated",
10152                                  IDENTIFIER_POINTER (DECL_NAME (decl)));
10153           return;
10154         default:
10155           abort ();
10156         }
10157       /* Don't issue a message if the context as been deprecated as a
10158          whole. */
10159       if (! CLASS_DEPRECATED (TYPE_NAME (DECL_CONTEXT (decl))))
10160         parse_warning_context
10161           (wfl, "The %s `%s' in class `%s' has been deprecated",
10162            the, lang_printable_name (decl, 0),
10163            IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (DECL_CONTEXT (decl)))));
10164     }
10165 }
10166
10167 /* Returns 1 if class was declared in the current package, 0 otherwise */
10168
10169 static GTY(()) tree cicp_cache;
10170 static int
10171 class_in_current_package (tree class)
10172 {
10173   int qualified_flag;
10174   tree left;
10175
10176   if (cicp_cache == class)
10177     return 1;
10178
10179   qualified_flag = QUALIFIED_P (DECL_NAME (TYPE_NAME (class)));
10180
10181   /* If the current package is empty and the name of CLASS is
10182      qualified, class isn't in the current package.  If there is a
10183      current package and the name of the CLASS is not qualified, class
10184      isn't in the current package */
10185   if ((!ctxp->package && qualified_flag) || (ctxp->package && !qualified_flag))
10186     return 0;
10187
10188   /* If there is not package and the name of CLASS isn't qualified,
10189      they belong to the same unnamed package */
10190   if (!ctxp->package && !qualified_flag)
10191     return 1;
10192
10193   /* Compare the left part of the name of CLASS with the package name */
10194   split_qualified_name (&left, NULL, DECL_NAME (TYPE_NAME (class)));
10195   if (ctxp->package == left)
10196     {
10197       cicp_cache = class;
10198       return 1;
10199     }
10200   return 0;
10201 }
10202
10203 /* This function may generate code to access DECL from WHERE. This is
10204    done only if certain conditions meet.  */
10205
10206 static tree
10207 maybe_access_field (tree decl, tree where, tree type)
10208 {
10209   if (TREE_CODE (decl) == FIELD_DECL && decl != current_this
10210       && !FIELD_STATIC (decl))
10211     decl = build_field_ref (where ? where : current_this,
10212                             (type ? type : DECL_CONTEXT (decl)),
10213                             DECL_NAME (decl));
10214   return decl;
10215 }
10216
10217 /* Build a method invocation, by patching PATCH. If non NULL
10218    and according to the situation, PRIMARY and WHERE may be
10219    used. IS_STATIC is set to 1 if the invoked function is static. */
10220
10221 static tree
10222 patch_method_invocation (tree patch, tree primary, tree where, int from_super,
10223                          int *is_static, tree *ret_decl)
10224 {
10225   tree wfl = TREE_OPERAND (patch, 0);
10226   tree args = TREE_OPERAND (patch, 1);
10227   tree name = EXPR_WFL_NODE (wfl);
10228   tree list;
10229   int is_static_flag = 0;
10230   int is_super_init = 0;
10231   tree this_arg = NULL_TREE;
10232   int is_array_clone_call = 0;
10233
10234   /* Should be overridden if everything goes well. Otherwise, if
10235      something fails, it should keep this value. It stop the
10236      evaluation of a bogus assignment. See java_complete_tree,
10237      MODIFY_EXPR: for the reasons why we sometimes want to keep on
10238      evaluating an assignment */
10239   TREE_TYPE (patch) = error_mark_node;
10240
10241   /* Since lookup functions are messing with line numbers, save the
10242      context now.  */
10243   java_parser_context_save_global ();
10244
10245   /* 15.11.1: Compile-Time Step 1: Determine Class or Interface to Search */
10246
10247   /* Resolution of qualified name, excluding constructors */
10248   if (QUALIFIED_P (name) && !CALL_CONSTRUCTOR_P (patch))
10249     {
10250       tree identifier, identifier_wfl, type, resolved;
10251       /* Extract the last IDENTIFIER of the qualified
10252          expression. This is a wfl and we will use it's location
10253          data during error report. */
10254       identifier_wfl = cut_identifier_in_qualified (wfl);
10255       identifier = EXPR_WFL_NODE (identifier_wfl);
10256
10257       /* Given the context, IDENTIFIER is syntactically qualified
10258          as a MethodName. We need to qualify what's before */
10259       qualify_ambiguous_name (wfl);
10260       resolved = resolve_field_access (wfl, NULL, NULL);
10261
10262       if (TREE_CODE (resolved) == VAR_DECL && FIELD_STATIC (resolved)
10263          && FIELD_FINAL (resolved)
10264          && !inherits_from_p (DECL_CONTEXT (resolved), current_class)
10265          && !flag_emit_class_files && !flag_emit_xref)
10266        resolved = build_class_init (DECL_CONTEXT (resolved), resolved);
10267
10268       if (resolved == error_mark_node)
10269         PATCH_METHOD_RETURN_ERROR ();
10270
10271       type = GET_SKIP_TYPE (resolved);
10272       resolve_and_layout (type, NULL_TREE);
10273
10274       if (JPRIMITIVE_TYPE_P (type))
10275         {
10276           parse_error_context
10277             (identifier_wfl,
10278              "Can't invoke a method on primitive type `%s'",
10279              IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type))));
10280           PATCH_METHOD_RETURN_ERROR ();
10281         }
10282
10283       list = lookup_method_invoke (0, identifier_wfl, type, identifier, args);
10284       args = nreverse (args);
10285
10286       /* We're resolving a call from a type */
10287       if (TREE_CODE (resolved) == TYPE_DECL)
10288         {
10289           if (CLASS_INTERFACE (resolved))
10290             {
10291               parse_error_context
10292                 (identifier_wfl,
10293                 "Can't make static reference to method `%s' in interface `%s'",
10294                  IDENTIFIER_POINTER (identifier),
10295                  IDENTIFIER_POINTER (name));
10296               PATCH_METHOD_RETURN_ERROR ();
10297             }
10298           if (list && !METHOD_STATIC (list))
10299             {
10300               char *fct_name = xstrdup (lang_printable_name (list, 0));
10301               parse_error_context
10302                 (identifier_wfl,
10303                  "Can't make static reference to method `%s %s' in class `%s'",
10304                  lang_printable_name (TREE_TYPE (TREE_TYPE (list)), 0),
10305                  fct_name, IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type))));
10306               free (fct_name);
10307               PATCH_METHOD_RETURN_ERROR ();
10308             }
10309         }
10310       else
10311         this_arg = primary = resolved;
10312
10313       if (TYPE_ARRAY_P (type) && identifier == get_identifier ("clone"))
10314         is_array_clone_call = 1;
10315
10316       /* IDENTIFIER_WFL will be used to report any problem further */
10317       wfl = identifier_wfl;
10318     }
10319   /* Resolution of simple names, names generated after a primary: or
10320      constructors */
10321   else
10322     {
10323       tree class_to_search = NULL_TREE;
10324       int lc;                   /* Looking for Constructor */
10325
10326       /* We search constructor in their target class */
10327       if (CALL_CONSTRUCTOR_P (patch))
10328         {
10329           if (TREE_CODE (patch) == NEW_CLASS_EXPR)
10330             class_to_search = EXPR_WFL_NODE (wfl);
10331           else if (EXPR_WFL_NODE (TREE_OPERAND (patch, 0)) ==
10332                    this_identifier_node)
10333             class_to_search = NULL_TREE;
10334           else if (EXPR_WFL_NODE (TREE_OPERAND (patch, 0)) ==
10335                    super_identifier_node)
10336             {
10337               is_super_init = 1;
10338               if (CLASSTYPE_SUPER (current_class))
10339                 class_to_search =
10340                   DECL_NAME (TYPE_NAME (CLASSTYPE_SUPER (current_class)));
10341               else
10342                 {
10343                   parse_error_context (wfl, "Can't invoke super constructor on java.lang.Object");
10344                   PATCH_METHOD_RETURN_ERROR ();
10345                 }
10346             }
10347
10348           /* Class to search is NULL if we're searching the current one */
10349           if (class_to_search)
10350             {
10351               class_to_search = resolve_and_layout (class_to_search, wfl);
10352
10353               if (!class_to_search)
10354                 {
10355                   parse_error_context
10356                     (wfl, "Class `%s' not found in type declaration",
10357                      IDENTIFIER_POINTER (EXPR_WFL_NODE (wfl)));
10358                   PATCH_METHOD_RETURN_ERROR ();
10359                 }
10360
10361               /* Can't instantiate an abstract class, but we can
10362                  invoke it's constructor. It's use within the `new'
10363                  context is denied here. */
10364               if (CLASS_ABSTRACT (class_to_search)
10365                   && TREE_CODE (patch) == NEW_CLASS_EXPR)
10366                 {
10367                   parse_error_context
10368                     (wfl, "Class `%s' is an abstract class. It can't be instantiated",
10369                      IDENTIFIER_POINTER (EXPR_WFL_NODE (wfl)));
10370                   PATCH_METHOD_RETURN_ERROR ();
10371                 }
10372
10373               class_to_search = TREE_TYPE (class_to_search);
10374             }
10375           else
10376             class_to_search = current_class;
10377           lc = 1;
10378         }
10379       /* This is a regular search in the local class, unless an
10380          alternate class is specified. */
10381       else
10382         {
10383           if (where != NULL_TREE)
10384             class_to_search = where;
10385           else if (QUALIFIED_P (name))
10386             class_to_search = current_class;
10387           else
10388             {
10389               class_to_search = current_class;
10390
10391               for (;;)
10392                 {
10393                   if (has_method (class_to_search, name))
10394                     break;
10395                   if (! INNER_CLASS_TYPE_P (class_to_search))
10396                     {
10397                       parse_error_context (wfl,
10398                                            "No method named `%s' in scope",
10399                                            IDENTIFIER_POINTER (name));
10400                       PATCH_METHOD_RETURN_ERROR ();
10401                     }
10402                   class_to_search
10403                     = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (class_to_search)));
10404                 }
10405             }
10406           lc = 0;
10407         }
10408
10409       /* NAME is a simple identifier or comes from a primary. Search
10410          in the class whose declaration contain the method being
10411          invoked. */
10412       resolve_and_layout (class_to_search, NULL_TREE);
10413
10414       list = lookup_method_invoke (lc, wfl, class_to_search, name, args);
10415       /* Don't continue if no method were found, as the next statement
10416          can't be executed then. */
10417       if (!list)
10418         PATCH_METHOD_RETURN_ERROR ();
10419
10420       if (TYPE_ARRAY_P (class_to_search)
10421           && DECL_NAME (list) == get_identifier ("clone"))
10422         is_array_clone_call = 1;
10423
10424       /* Check for static reference if non static methods */
10425       if (check_for_static_method_reference (wfl, patch, list,
10426                                              class_to_search, primary))
10427         PATCH_METHOD_RETURN_ERROR ();
10428
10429       /* Check for inner classes creation from illegal contexts */
10430       if (lc && (INNER_CLASS_TYPE_P (class_to_search)
10431                  && !CLASS_STATIC (TYPE_NAME (class_to_search)))
10432           && INNER_ENCLOSING_SCOPE_CHECK (class_to_search)
10433           && !DECL_INIT_P (current_function_decl))
10434         {
10435           parse_error_context
10436             (wfl, "No enclosing instance for inner class `%s' is in scope%s",
10437              lang_printable_name (class_to_search, 0),
10438              (!current_this ? "" :
10439               "; an explicit one must be provided when creating this inner class"));
10440           PATCH_METHOD_RETURN_ERROR ();
10441         }
10442
10443       /* Non static methods are called with the current object extra
10444          argument. If patch a `new TYPE()', the argument is the value
10445          returned by the object allocator. If method is resolved as a
10446          primary, use the primary otherwise use the current THIS. */
10447       args = nreverse (args);
10448       if (TREE_CODE (patch) != NEW_CLASS_EXPR)
10449         {
10450           this_arg = primary ? primary : current_this;
10451
10452           /* If we're using an access method, things are different.
10453              There are two family of cases:
10454
10455              1) We're not generating bytecodes:
10456
10457              - LIST is non static. It's invocation is transformed from
10458                x(a1,...,an) into this$<n>.x(a1,....an).
10459              - LIST is static. It's invocation is transformed from
10460                x(a1,...,an) into TYPE_OF(this$<n>).x(a1,....an)
10461
10462              2) We're generating bytecodes:
10463
10464              - LIST is non static. It's invocation is transformed from
10465                x(a1,....,an) into access$<n>(this$<n>,a1,...,an).
10466              - LIST is static. It's invocation is transformed from
10467                x(a1,....,an) into TYPE_OF(this$<n>).x(a1,....an).
10468
10469              Of course, this$<n> can be arbitrarily complex, ranging from
10470              this$0 (the immediate outer context) to
10471              access$0(access$0(...(this$0))).
10472
10473              maybe_use_access_method returns a nonzero value if the
10474              this_arg has to be moved into the (then generated) stub
10475              argument list. In the meantime, the selected function
10476              might have be replaced by a generated stub. */
10477           if (!primary &&
10478               maybe_use_access_method (is_super_init, &list, &this_arg))
10479             {
10480               args = tree_cons (NULL_TREE, this_arg, args);
10481               this_arg = NULL_TREE; /* So it doesn't get chained twice */
10482             }
10483         }
10484     }
10485
10486   /* Merge point of all resolution schemes. If we have nothing, this
10487      is an error, already signaled */
10488   if (!list)
10489     PATCH_METHOD_RETURN_ERROR ();
10490
10491   /* Check accessibility, position the is_static flag, build and
10492      return the call */
10493   if (not_accessible_p (DECL_CONTEXT (current_function_decl), list,
10494                         (primary ? TREE_TYPE (TREE_TYPE (primary)) :
10495                          NULL_TREE), from_super)
10496       /* Calls to clone() on array types are permitted as a special-case. */
10497       && !is_array_clone_call)
10498     {
10499       const char *const fct_name = IDENTIFIER_POINTER (DECL_NAME (list));
10500       const char *const access =
10501         accessibility_string (get_access_flags_from_decl (list));
10502       const char *const klass =
10503         IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (DECL_CONTEXT (list))));
10504       const char *const refklass =
10505         IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (current_class)));
10506       const char *const what = (DECL_CONSTRUCTOR_P (list)
10507                                 ? "constructor" : "method");
10508       /* FIXME: WFL yields the wrong message here but I don't know
10509          what else to use.  */
10510       parse_error_context (wfl,
10511                            "Can't access %s %s `%s.%s' from `%s'",
10512                            access, what, klass, fct_name, refklass);
10513       PATCH_METHOD_RETURN_ERROR ();
10514     }
10515
10516   /* Deprecation check: check whether the method being invoked or the
10517      instance-being-created's type are deprecated.  */
10518   if (TREE_CODE (patch) == NEW_CLASS_EXPR)
10519     check_deprecation (wfl, TYPE_NAME (DECL_CONTEXT (list)));
10520   check_deprecation (wfl, list);
10521
10522   /* If invoking a innerclass constructor, there are hidden parameters
10523      to pass */
10524   if (TREE_CODE (patch) == NEW_CLASS_EXPR
10525       && PURE_INNER_CLASS_TYPE_P (DECL_CONTEXT (list)))
10526     {
10527       /* And make sure we add the accessed local variables to be saved
10528          in field aliases. */
10529       args = build_alias_initializer_parameter_list
10530         (AIPL_FUNCTION_CTOR_INVOCATION, DECL_CONTEXT (list), args, NULL);
10531
10532       /* Secretly pass the current_this/primary as a second argument */
10533       if (primary || current_this)
10534         {
10535           tree extra_arg;
10536           tree this_type = (current_this ?
10537                             TREE_TYPE (TREE_TYPE (current_this)) : NULL_TREE);
10538           /* Method's (list) enclosing context */
10539           tree mec = DECL_CONTEXT (TYPE_NAME (DECL_CONTEXT (list)));
10540           /* If we have a primary, use it. */
10541           if (primary)
10542             extra_arg = primary;
10543           /* The current `this' is an inner class but isn't a direct
10544              enclosing context for the inner class we're trying to
10545              create. Build an access to the proper enclosing context
10546              and use it. */
10547           else if (current_this && PURE_INNER_CLASS_TYPE_P (this_type)
10548                    && this_type != TREE_TYPE (mec))
10549             {
10550
10551               extra_arg = build_access_to_thisn (current_class,
10552                                                  TREE_TYPE (mec), 0);
10553               extra_arg = java_complete_tree (extra_arg);
10554             }
10555           /* Otherwise, just use the current `this' as an enclosing
10556              context. */
10557           else
10558             extra_arg = current_this;
10559           args = tree_cons (NULL_TREE, extra_arg, args);
10560         }
10561       else
10562         args = tree_cons (NULL_TREE, integer_zero_node, args);
10563     }
10564
10565   /* This handles the situation where a constructor invocation needs
10566      to have an enclosing context passed as a second parameter (the
10567      constructor is one of an inner class). */
10568   if ((is_super_init ||
10569        (TREE_CODE (patch) == CALL_EXPR && name == this_identifier_node))
10570       && PURE_INNER_CLASS_TYPE_P (DECL_CONTEXT (list)))
10571     {
10572       tree dest = TYPE_NAME (DECL_CONTEXT (list));
10573       tree extra_arg =
10574         build_access_to_thisn (current_class, DECL_CONTEXT (dest), 0);
10575       extra_arg = java_complete_tree (extra_arg);
10576       args = tree_cons (NULL_TREE, extra_arg, args);
10577     }
10578
10579   is_static_flag = METHOD_STATIC (list);
10580   if (! is_static_flag && this_arg != NULL_TREE)
10581     args = tree_cons (NULL_TREE, this_arg, args);
10582
10583   /* In the context of an explicit constructor invocation, we can't
10584      invoke any method relying on `this'. Exceptions are: we're
10585      invoking a static function, primary exists and is not the current
10586      this, we're creating a new object. */
10587   if (ctxp->explicit_constructor_p
10588       && !is_static_flag
10589       && (!primary || primary == current_this)
10590       && (TREE_CODE (patch) != NEW_CLASS_EXPR))
10591     {
10592       parse_error_context (wfl, "Can't reference `this' before the superclass constructor has been called");
10593       PATCH_METHOD_RETURN_ERROR ();
10594     }
10595   java_parser_context_restore_global ();
10596   if (is_static)
10597     *is_static = is_static_flag;
10598   /* Sometimes, we want the decl of the selected method. Such as for
10599      EH checking */
10600   if (ret_decl)
10601     *ret_decl = list;
10602   patch = patch_invoke (patch, list, args);
10603
10604   /* Now is a good time to insert the call to finit$ */
10605   if (is_super_init && CLASS_HAS_FINIT_P (current_class))
10606     {
10607       tree finit_parms, finit_call;
10608
10609       /* Prepare to pass hidden parameters to finit$, if any. */
10610       finit_parms = build_alias_initializer_parameter_list
10611         (AIPL_FUNCTION_FINIT_INVOCATION, current_class, NULL_TREE, NULL);
10612
10613       finit_call =
10614         build_method_invocation (build_wfl_node (finit_identifier_node),
10615                                  finit_parms);
10616
10617       /* Generate the code used to initialize fields declared with an
10618          initialization statement and build a compound statement along
10619          with the super constructor invocation. */
10620       CAN_COMPLETE_NORMALLY (patch) = 1;
10621       patch = build (COMPOUND_EXPR, void_type_node, patch,
10622                      java_complete_tree (finit_call));
10623     }
10624   return patch;
10625 }
10626
10627 /* Check that we're not trying to do a static reference to a method in
10628    non static method. Return 1 if it's the case, 0 otherwise. */
10629
10630 static int
10631 check_for_static_method_reference (tree wfl, tree node, tree method,
10632                                    tree where, tree primary)
10633 {
10634   if (METHOD_STATIC (current_function_decl)
10635       && !METHOD_STATIC (method) && !primary && !CALL_CONSTRUCTOR_P (node))
10636     {
10637       char *fct_name = xstrdup (lang_printable_name (method, 0));
10638       parse_error_context
10639         (wfl, "Can't make static reference to method `%s %s' in class `%s'",
10640          lang_printable_name (TREE_TYPE (TREE_TYPE (method)), 0), fct_name,
10641          IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (where))));
10642       free (fct_name);
10643       return 1;
10644     }
10645   return 0;
10646 }
10647
10648 /* Fix the invocation of *MDECL if necessary in the case of a
10649    invocation from an inner class. *THIS_ARG might be modified
10650    appropriately and an alternative access to *MDECL might be
10651    returned.  */
10652
10653 static int
10654 maybe_use_access_method (int is_super_init, tree *mdecl, tree *this_arg)
10655 {
10656   tree ctx;
10657   tree md = *mdecl, ta = *this_arg;
10658   int to_return = 0;
10659   int non_static_context = !METHOD_STATIC (md);
10660
10661   if (is_super_init
10662       || DECL_CONTEXT (md) == current_class
10663       || !PURE_INNER_CLASS_TYPE_P (current_class)
10664       || DECL_FINIT_P (md)
10665       || DECL_INSTINIT_P (md))
10666     return 0;
10667
10668   /* If we're calling a method found in an enclosing class, generate
10669      what it takes to retrieve the right this. Don't do that if we're
10670      invoking a static method. Note that if MD's type is unrelated to
10671      CURRENT_CLASS, then the current this can be used. */
10672
10673   if (non_static_context && DECL_CONTEXT (md) != object_type_node)
10674     {
10675       ctx = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (current_class)));
10676       if (inherits_from_p (ctx, DECL_CONTEXT (md)))
10677         {
10678           ta = build_current_thisn (current_class);
10679           ta = build_wfl_node (ta);
10680         }
10681       else
10682         {
10683           tree type = ctx;
10684           while (type)
10685             {
10686               maybe_build_thisn_access_method (type);
10687               if (inherits_from_p (type, DECL_CONTEXT (md)))
10688                 {
10689                   ta = build_access_to_thisn (ctx, type, 0);
10690                   break;
10691                 }
10692               type = (DECL_CONTEXT (TYPE_NAME (type)) ?
10693                       TREE_TYPE (DECL_CONTEXT (TYPE_NAME (type))) : NULL_TREE);
10694             }
10695         }
10696       ta = java_complete_tree (ta);
10697     }
10698
10699   /* We might have to use an access method to get to MD. We can
10700      break the method access rule as far as we're not generating
10701      bytecode */
10702   if (METHOD_PRIVATE (md) && flag_emit_class_files)
10703     {
10704       md = build_outer_method_access_method (md);
10705       to_return = 1;
10706     }
10707
10708   *mdecl = md;
10709   *this_arg = ta;
10710
10711   /* Returning a nonzero value indicates we were doing a non static
10712      method invocation that is now a static invocation. It will have
10713      callee displace `this' to insert it in the regular argument
10714      list. */
10715   return (non_static_context && to_return);
10716 }
10717
10718 /* Patch an invoke expression METHOD and ARGS, based on its invocation
10719    mode.  */
10720
10721 static tree
10722 patch_invoke (tree patch, tree method, tree args)
10723 {
10724   tree dtable, func;
10725   tree original_call, t, ta;
10726   tree check = NULL_TREE;
10727
10728   /* Last step for args: convert build-in types. If we're dealing with
10729      a new TYPE() type call, the first argument to the constructor
10730      isn't found in the incoming argument list, but delivered by
10731      `new' */
10732   t = TYPE_ARG_TYPES (TREE_TYPE (method));
10733   if (TREE_CODE (patch) == NEW_CLASS_EXPR)
10734     t = TREE_CHAIN (t);
10735   for (ta = args; t != end_params_node && ta;
10736        t = TREE_CHAIN (t), ta = TREE_CHAIN (ta))
10737     if (JPRIMITIVE_TYPE_P (TREE_TYPE (TREE_VALUE (ta))) &&
10738         TREE_TYPE (TREE_VALUE (ta)) != TREE_VALUE (t))
10739       TREE_VALUE (ta) = convert (TREE_VALUE (t), TREE_VALUE (ta));
10740
10741   /* Resolve unresolved returned type issues */
10742   t = TREE_TYPE (TREE_TYPE (method));
10743   if (TREE_CODE (t) == POINTER_TYPE && !CLASS_LOADED_P (TREE_TYPE (t)))
10744     resolve_and_layout (TREE_TYPE (t), NULL);
10745
10746   if (flag_emit_class_files || flag_emit_xref)
10747     func = method;
10748   else
10749     {
10750       switch (invocation_mode (method, CALL_USING_SUPER (patch)))
10751         {
10752         case INVOKE_VIRTUAL:
10753           dtable = invoke_build_dtable (0, args);
10754           func = build_invokevirtual (dtable, method);
10755           break;
10756
10757         case INVOKE_NONVIRTUAL:
10758           /* If the object for the method call is null, we throw an
10759              exception.  We don't do this if the object is the current
10760              method's `this'.  In other cases we just rely on an
10761              optimization pass to eliminate redundant checks.  */
10762           if (TREE_VALUE (args) != current_this)
10763             {
10764               /* We use a save_expr here to make sure we only evaluate
10765                  the new `self' expression once.  */
10766               tree save_arg = save_expr (TREE_VALUE (args));
10767               TREE_VALUE (args) = save_arg;
10768               check = java_check_reference (save_arg, 1);
10769             }
10770           /* Fall through.  */
10771
10772         case INVOKE_SUPER:
10773         case INVOKE_STATIC:
10774           {
10775             tree signature = build_java_signature (TREE_TYPE (method));
10776             func = build_known_method_ref (method, TREE_TYPE (method),
10777                                            DECL_CONTEXT (method),
10778                                            signature, args);
10779           }
10780           break;
10781
10782         case INVOKE_INTERFACE:
10783           dtable = invoke_build_dtable (1, args);
10784           func = build_invokeinterface (dtable, method);
10785           break;
10786
10787         default:
10788           abort ();
10789         }
10790
10791       /* Ensure self_type is initialized, (invokestatic). FIXME */
10792       func = build1 (NOP_EXPR, build_pointer_type (TREE_TYPE (method)), func);
10793     }
10794
10795   TREE_TYPE (patch) = TREE_TYPE (TREE_TYPE (method));
10796   TREE_OPERAND (patch, 0) = func;
10797   TREE_OPERAND (patch, 1) = args;
10798   patch = check_for_builtin (method, patch);
10799   original_call = patch;
10800
10801   /* We're processing a `new TYPE ()' form. New is called and its
10802      returned value is the first argument to the constructor. We build
10803      a COMPOUND_EXPR and use saved expression so that the overall NEW
10804      expression value is a pointer to a newly created and initialized
10805      class. */
10806   if (TREE_CODE (original_call) == NEW_CLASS_EXPR)
10807     {
10808       tree class = DECL_CONTEXT (method);
10809       tree c1, saved_new, size, new;
10810       tree alloc_node;
10811
10812       if (flag_emit_class_files || flag_emit_xref)
10813         {
10814           TREE_TYPE (patch) = build_pointer_type (class);
10815           return patch;
10816         }
10817       if (!TYPE_SIZE (class))
10818         safe_layout_class (class);
10819       size = size_in_bytes (class);
10820       alloc_node =
10821         (class_has_finalize_method (class) ? alloc_object_node
10822                                            : alloc_no_finalizer_node);
10823       new = build (CALL_EXPR, promote_type (class),
10824                      build_address_of (alloc_node),
10825                      build_tree_list (NULL_TREE, build_class_ref (class)),
10826                      NULL_TREE);
10827       saved_new = save_expr (new);
10828       c1 = build_tree_list (NULL_TREE, saved_new);
10829       TREE_CHAIN (c1) = TREE_OPERAND (original_call, 1);
10830       TREE_OPERAND (original_call, 1) = c1;
10831       TREE_SET_CODE (original_call, CALL_EXPR);
10832       patch = build (COMPOUND_EXPR, TREE_TYPE (new), patch, saved_new);
10833     }
10834
10835   /* If CHECK is set, then we are building a check to see if the object
10836      is NULL.  */
10837   if (check != NULL_TREE)
10838     {
10839       /* We have to call force_evaluation_order now because creating a
10840          COMPOUND_EXPR wraps the arg list in a way that makes it
10841          unrecognizable by force_evaluation_order later.  Yuk.  */
10842       patch = build (COMPOUND_EXPR, TREE_TYPE (patch), check,
10843                      force_evaluation_order (patch));
10844       TREE_SIDE_EFFECTS (patch) = 1;
10845     }
10846
10847   /* In order to be able to modify PATCH later, we SAVE_EXPR it and
10848      put it as the first expression of a COMPOUND_EXPR. The second
10849      expression being an empty statement to be later patched if
10850      necessary. We remember a TREE_LIST (the PURPOSE is the method,
10851      the VALUE is the compound) in a hashtable and return a
10852      COMPOUND_EXPR built so that the result of the evaluation of the
10853      original PATCH node is returned. */
10854   if (STATIC_CLASS_INIT_OPT_P ()
10855       && current_function_decl && METHOD_STATIC (method))
10856     {
10857       tree list;
10858       tree fndecl = current_function_decl;
10859       /* We have to call force_evaluation_order now because creating a
10860          COMPOUND_EXPR wraps the arg list in a way that makes it
10861          unrecognizable by force_evaluation_order later.  Yuk.  */
10862       tree save = force_evaluation_order (patch);
10863       tree type = TREE_TYPE (patch);
10864
10865       patch = build (COMPOUND_EXPR, type, save, build_java_empty_stmt ());
10866       list = tree_cons (method, patch,
10867                         DECL_FUNCTION_STATIC_METHOD_INVOCATION_COMPOUND (fndecl));
10868
10869       DECL_FUNCTION_STATIC_METHOD_INVOCATION_COMPOUND (fndecl) = list;
10870
10871       patch = build (COMPOUND_EXPR, type, patch, save);
10872     }
10873
10874   return patch;
10875 }
10876
10877 static int
10878 invocation_mode (tree method, int super)
10879 {
10880   int access = get_access_flags_from_decl (method);
10881
10882   if (super)
10883     return INVOKE_SUPER;
10884
10885   if (access & ACC_STATIC)
10886     return INVOKE_STATIC;
10887
10888   /* We have to look for a constructor before we handle nonvirtual
10889      calls; otherwise the constructor will look nonvirtual.  */
10890   if (DECL_CONSTRUCTOR_P (method))
10891     return INVOKE_STATIC;
10892
10893   if (access & ACC_FINAL || access & ACC_PRIVATE)
10894     return INVOKE_NONVIRTUAL;
10895
10896   if (CLASS_FINAL (TYPE_NAME (DECL_CONTEXT (method))))
10897     return INVOKE_NONVIRTUAL;
10898
10899   if (CLASS_INTERFACE (TYPE_NAME (DECL_CONTEXT (method))))
10900     return INVOKE_INTERFACE;
10901
10902   return INVOKE_VIRTUAL;
10903 }
10904
10905 /* Retrieve a refined list of matching methods. It covers the step
10906    15.11.2 (Compile-Time Step 2) */
10907
10908 static tree
10909 lookup_method_invoke (int lc, tree cl, tree class, tree name, tree arg_list)
10910 {
10911   tree atl = end_params_node;           /* Arg Type List */
10912   tree method, signature, list, node;
10913   const char *candidates;               /* Used for error report */
10914   char *dup;
10915
10916   /* Fix the arguments */
10917   for (node = arg_list; node; node = TREE_CHAIN (node))
10918     {
10919       tree current_arg = TREE_TYPE (TREE_VALUE (node));
10920       /* Non primitive type may have to be resolved */
10921       if (!JPRIMITIVE_TYPE_P (current_arg))
10922         resolve_and_layout (current_arg, NULL_TREE);
10923       /* And promoted */
10924       if (TREE_CODE (current_arg) == RECORD_TYPE)
10925         current_arg = promote_type (current_arg);
10926       atl = tree_cons (NULL_TREE, current_arg, atl);
10927     }
10928
10929   /* Presto. If we're dealing with an anonymous class and a
10930      constructor call, generate the right constructor now, since we
10931      know the arguments' types. */
10932
10933   if (lc && ANONYMOUS_CLASS_P (class))
10934     {
10935       tree saved_current_class;
10936       tree mdecl = craft_constructor (TYPE_NAME (class), atl);
10937       saved_current_class = current_class;
10938       current_class = class;
10939       fix_constructors (mdecl);
10940       current_class = saved_current_class;
10941     }
10942
10943   /* Find all candidates and then refine the list, searching for the
10944      most specific method. */
10945   list = find_applicable_accessible_methods_list (lc, class, name, atl);
10946   list = find_most_specific_methods_list (list);
10947   if (list && !TREE_CHAIN (list))
10948     return TREE_VALUE (list);
10949
10950   /* Issue an error. List candidates if any. Candidates are listed
10951      only if accessible (non accessible methods may end-up here for
10952      the sake of a better error report). */
10953   candidates = NULL;
10954   if (list)
10955     {
10956       tree current;
10957       obstack_grow (&temporary_obstack, ". Candidates are:\n", 18);
10958       for (current = list; current; current = TREE_CHAIN (current))
10959         {
10960           tree cm = TREE_VALUE (current);
10961           char string [4096];
10962           if (!cm || not_accessible_p (class, cm, NULL_TREE, 0))
10963             continue;
10964           sprintf
10965             (string, "  `%s' in `%s'%s",
10966              get_printable_method_name (cm),
10967              IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (DECL_CONTEXT (cm)))),
10968              (TREE_CHAIN (current) ? "\n" : ""));
10969           obstack_grow (&temporary_obstack, string, strlen (string));
10970         }
10971       obstack_1grow (&temporary_obstack, '\0');
10972       candidates = obstack_finish (&temporary_obstack);
10973     }
10974   /* Issue the error message */
10975   method = make_node (FUNCTION_TYPE);
10976   TYPE_ARG_TYPES (method) = atl;
10977   signature = build_java_argument_signature (method);
10978   dup = xstrdup (lang_printable_name (class, 0));
10979   parse_error_context (cl, "Can't find %s `%s(%s)' in type `%s'%s",
10980                        (lc ? "constructor" : "method"),
10981                        (lc ? dup : IDENTIFIER_POINTER (name)),
10982                        IDENTIFIER_POINTER (signature), dup,
10983                        (candidates ? candidates : ""));
10984   free (dup);
10985   return NULL_TREE;
10986 }
10987
10988 /* 15.11.2.1: Find Methods that are Applicable and Accessible. LC is 1
10989    when we're looking for a constructor. */
10990
10991 static tree
10992 find_applicable_accessible_methods_list (int lc, tree class, tree name,
10993                                          tree arglist)
10994 {
10995   static htab_t searched_classes;
10996   static int search_not_done = 0;
10997   tree list = NULL_TREE, all_list = NULL_TREE;
10998
10999   /* Check the hash table to determine if this class has been searched
11000      already. */
11001   if (searched_classes)
11002     {
11003       if (htab_find (searched_classes, class) != NULL)
11004         return NULL;
11005     }
11006   else
11007     {
11008       searched_classes = htab_create (10, htab_hash_pointer,
11009                                       htab_eq_pointer, NULL);
11010     }
11011
11012   search_not_done++;
11013   *htab_find_slot (searched_classes, class, INSERT) = class;
11014
11015   if (!CLASS_LOADED_P (class))
11016     {
11017       load_class (class, 1);
11018       safe_layout_class (class);
11019     }
11020
11021   /* Search interfaces */
11022   if (TREE_CODE (TYPE_NAME (class)) == TYPE_DECL
11023       && CLASS_INTERFACE (TYPE_NAME (class)))
11024     {
11025       int i, n;
11026       tree basetype_vec = TYPE_BINFO_BASETYPES (class);
11027       search_applicable_methods_list (lc, TYPE_METHODS (class),
11028                                       name, arglist, &list, &all_list);
11029       n = TREE_VEC_LENGTH (basetype_vec);
11030       for (i = 1; i < n; i++)
11031         {
11032           tree t = BINFO_TYPE (TREE_VEC_ELT (basetype_vec, i));
11033           tree rlist;
11034
11035           rlist = find_applicable_accessible_methods_list (lc,  t, name,
11036                                                            arglist);
11037           list = chainon (rlist, list);
11038         }
11039     }
11040   /* Search classes */
11041   else
11042     {
11043       search_applicable_methods_list (lc, TYPE_METHODS (class),
11044                                       name, arglist, &list, &all_list);
11045
11046       /* When looking finit$, class$ or instinit$, we turn LC to 1 so
11047          that we only search in class. Note that we should have found
11048          something at this point. */
11049       if (ID_FINIT_P (name) || ID_CLASSDOLLAR_P (name) || ID_INSTINIT_P (name))
11050         {
11051           lc = 1;
11052           if (!list)
11053             abort ();
11054         }
11055
11056       /* We must search all interfaces of this class */
11057       if (!lc)
11058       {
11059         tree basetype_vec = TYPE_BINFO_BASETYPES (class);
11060         int n = TREE_VEC_LENGTH (basetype_vec), i;
11061         for (i = 1; i < n; i++)
11062           {
11063             tree t = BINFO_TYPE (TREE_VEC_ELT (basetype_vec, i));
11064             if (t != object_type_node)
11065               {
11066                 tree rlist
11067                   = find_applicable_accessible_methods_list (lc, t,
11068                                                              name, arglist);
11069                 list = chainon (rlist, list);
11070               }
11071           }
11072       }
11073
11074       /* Search superclass */
11075       if (!lc && CLASSTYPE_SUPER (class) != NULL_TREE)
11076         {
11077           tree rlist;
11078           class = CLASSTYPE_SUPER (class);
11079           rlist = find_applicable_accessible_methods_list (lc, class,
11080                                                            name, arglist);
11081           list = chainon (rlist, list);
11082         }
11083     }
11084
11085   search_not_done--;
11086
11087   /* We're done. Reset the searched classes list and finally search
11088      java.lang.Object if it wasn't searched already. */
11089   if (!search_not_done)
11090     {
11091       if (!lc
11092           && TYPE_METHODS (object_type_node)
11093           && htab_find (searched_classes, object_type_node) == NULL)
11094         {
11095           search_applicable_methods_list (lc,
11096                                           TYPE_METHODS (object_type_node),
11097                                           name, arglist, &list, &all_list);
11098         }
11099       htab_delete (searched_classes);
11100       searched_classes = NULL;
11101     }
11102
11103   /* Either return the list obtained or all selected (but
11104      inaccessible) methods for better error report. */
11105   return (!list ? all_list : list);
11106 }
11107
11108 /* Effectively search for the appropriate method in method */
11109
11110 static void
11111 search_applicable_methods_list (int lc, tree method, tree name, tree arglist,
11112                                 tree *list, tree *all_list)
11113 {
11114   for (; method; method = TREE_CHAIN (method))
11115     {
11116       /* When dealing with constructor, stop here, otherwise search
11117          other classes */
11118       if (lc && !DECL_CONSTRUCTOR_P (method))
11119         continue;
11120       else if (!lc && (DECL_CONSTRUCTOR_P (method)
11121                        || (DECL_NAME (method) != name)))
11122         continue;
11123
11124       if (argument_types_convertible (method, arglist))
11125         {
11126           /* Retain accessible methods only */
11127           if (!not_accessible_p (DECL_CONTEXT (current_function_decl),
11128                                  method, NULL_TREE, 0))
11129             *list = tree_cons (NULL_TREE, method, *list);
11130           else
11131             /* Also retain all selected method here */
11132             *all_list = tree_cons (NULL_TREE, method, *list);
11133         }
11134     }
11135 }
11136
11137 /* 15.11.2.2 Choose the Most Specific Method */
11138
11139 static tree
11140 find_most_specific_methods_list (tree list)
11141 {
11142   int max = 0;
11143   int abstract, candidates;
11144   tree current, new_list = NULL_TREE;
11145   for (current = list; current; current = TREE_CHAIN (current))
11146     {
11147       tree method;
11148       DECL_SPECIFIC_COUNT (TREE_VALUE (current)) = 0;
11149
11150       for (method = list; method; method = TREE_CHAIN (method))
11151         {
11152           tree method_v, current_v;
11153           /* Don't test a method against itself */
11154           if (method == current)
11155             continue;
11156
11157           method_v = TREE_VALUE (method);
11158           current_v = TREE_VALUE (current);
11159
11160           /* Compare arguments and location where methods where declared */
11161           if (argument_types_convertible (method_v, current_v))
11162             {
11163               if (valid_method_invocation_conversion_p
11164                   (DECL_CONTEXT (method_v), DECL_CONTEXT (current_v))
11165                   || (INNER_CLASS_TYPE_P (DECL_CONTEXT (current_v))
11166                       && enclosing_context_p (DECL_CONTEXT (method_v),
11167                                               DECL_CONTEXT (current_v))))
11168                 {
11169                   int v = (DECL_SPECIFIC_COUNT (current_v) +=
11170                     (INNER_CLASS_TYPE_P (DECL_CONTEXT (current_v)) ? 2 : 1));
11171                   max = (v > max ? v : max);
11172                 }
11173             }
11174         }
11175     }
11176
11177   /* Review the list and select the maximally specific methods */
11178   for (current = list, abstract = -1, candidates = -1;
11179        current; current = TREE_CHAIN (current))
11180     if (DECL_SPECIFIC_COUNT (TREE_VALUE (current)) == max)
11181       {
11182         new_list = tree_cons (NULL_TREE, TREE_VALUE (current), new_list);
11183         abstract += (METHOD_ABSTRACT (TREE_VALUE (current)) ? 1 : 0);
11184         candidates++;
11185       }
11186
11187   /* If we have several and they're all abstract, just pick the
11188      closest one. */
11189   if (candidates > 0 && candidates == abstract)
11190     {
11191       /* FIXME: merge the throws clauses.  There is no convenient way
11192          to do this in gcj right now, since ideally we'd like to
11193          introduce a new METHOD_DECL here, but that is really not
11194          possible.  */
11195       new_list = nreverse (new_list);
11196       TREE_CHAIN (new_list) = NULL_TREE;
11197       return new_list;
11198     }
11199
11200   /* We have several (we couldn't find a most specific), all but one
11201      are abstract, we pick the only non abstract one. */
11202   if (candidates > 0 && (candidates == abstract+1))
11203     {
11204       for (current = new_list; current; current = TREE_CHAIN (current))
11205         if (!METHOD_ABSTRACT (TREE_VALUE (current)))
11206           {
11207             TREE_CHAIN (current) = NULL_TREE;
11208             new_list = current;
11209           }
11210     }
11211
11212   /* If we can't find one, lower expectations and try to gather multiple
11213      maximally specific methods */
11214   while (!new_list && max)
11215     {
11216       while (--max > 0)
11217         {
11218           if (DECL_SPECIFIC_COUNT (TREE_VALUE (current)) == max)
11219             new_list = tree_cons (NULL_TREE, TREE_VALUE (current), new_list);
11220         }
11221     }
11222
11223   return new_list;
11224 }
11225
11226 /* Make sure that the type of each M2_OR_ARGLIST arguments can be
11227    converted by method invocation conversion (5.3) to the type of the
11228    corresponding parameter of M1. Implementation expects M2_OR_ARGLIST
11229    to change less often than M1. */
11230
11231 static GTY(()) tree m2_arg_value;
11232 static GTY(()) tree m2_arg_cache;
11233
11234 static int
11235 argument_types_convertible (tree m1, tree m2_or_arglist)
11236 {
11237   tree m1_arg, m2_arg;
11238
11239   SKIP_THIS_AND_ARTIFICIAL_PARMS (m1_arg, m1)
11240
11241   if (m2_arg_value == m2_or_arglist)
11242     m2_arg = m2_arg_cache;
11243   else
11244     {
11245       /* M2_OR_ARGLIST can be a function DECL or a raw list of
11246          argument types */
11247       if (m2_or_arglist && TREE_CODE (m2_or_arglist) == FUNCTION_DECL)
11248         {
11249           m2_arg = TYPE_ARG_TYPES (TREE_TYPE (m2_or_arglist));
11250           if (!METHOD_STATIC (m2_or_arglist))
11251             m2_arg = TREE_CHAIN (m2_arg);
11252         }
11253       else
11254         m2_arg = m2_or_arglist;
11255
11256       m2_arg_value = m2_or_arglist;
11257       m2_arg_cache = m2_arg;
11258     }
11259
11260   while (m1_arg != end_params_node && m2_arg != end_params_node)
11261     {
11262       resolve_and_layout (TREE_VALUE (m1_arg), NULL_TREE);
11263       if (!valid_method_invocation_conversion_p (TREE_VALUE (m1_arg),
11264                                                  TREE_VALUE (m2_arg)))
11265         break;
11266       m1_arg = TREE_CHAIN (m1_arg);
11267       m2_arg = TREE_CHAIN (m2_arg);
11268     }
11269   return m1_arg == end_params_node && m2_arg == end_params_node;
11270 }
11271
11272 /* Qualification routines */
11273
11274 /* Given a name x.y.z, look up x locally.  If it's found, save the
11275    decl.  If it's not found, mark the name as RESOLVE_PACKAGE_NAME_P,
11276    so that we later try and load the appropriate classes.  */
11277 static void
11278 qualify_ambiguous_name (tree id)
11279 {
11280   tree name, decl;
11281
11282   /* We inspect the first item of the qualification list.  As a sanity
11283      check, make sure that it is an identfier node.  */
11284   tree qual = EXPR_WFL_QUALIFICATION (id);
11285   tree qual_wfl = QUAL_WFL (qual);
11286
11287   if (TREE_CODE (qual_wfl) != EXPR_WITH_FILE_LOCATION)
11288     return;
11289
11290   name = EXPR_WFL_NODE (qual_wfl);
11291
11292   /* If we don't have an identifier, or we have a 'this' or 'super',
11293      then field access processing is all we need : there is nothing
11294      for us to do.  */
11295   if (!name || TREE_CODE (name) != IDENTIFIER_NODE ||
11296       name == this_identifier_node ||
11297       name == super_identifier_node)
11298     return;
11299
11300   /* If name appears within the scope of a local variable declaration
11301      or parameter declaration, or is a field within an enclosing
11302      class, then it is an expression name.  Save the decl and let
11303      resolve_field_access do it's work.  */
11304   if ((decl = IDENTIFIER_LOCAL_VALUE (name)) ||
11305       (decl = lookup_field_wrapper (current_class, name)))
11306     {
11307       QUAL_RESOLUTION (qual) = decl;
11308       return;
11309     }
11310
11311   /* If name is a known class name (either declared or imported), mark
11312      us as a type name.  */
11313   if ((decl = resolve_and_layout (name, NULL_TREE)))
11314     {
11315       RESOLVE_TYPE_NAME_P (qual_wfl) = 1;
11316       QUAL_RESOLUTION (qual) = decl;
11317     }
11318
11319   /* Check here that NAME isn't declared by more than one
11320      type-import-on-demand declaration of the compilation unit
11321      containing NAME. FIXME */
11322
11323   /* We couldn't find a declaration for the name.  Assume for now that
11324      we have a qualified class name that needs to be loaded from an
11325      external class file.  */
11326   else
11327     RESOLVE_PACKAGE_NAME_P (qual_wfl) = 1;
11328
11329   /* Propagate the qualification across other components of the
11330      qualified name */
11331   for (qual = TREE_CHAIN (qual); qual;
11332        qual_wfl = QUAL_WFL (qual), qual = TREE_CHAIN (qual))
11333     {
11334       if (RESOLVE_PACKAGE_NAME_P (qual_wfl))
11335         RESOLVE_PACKAGE_NAME_P (QUAL_WFL (qual)) = 1;
11336     }
11337
11338   /* Store the global qualification for the ambiguous part of ID back
11339      into ID fields */
11340   if (RESOLVE_TYPE_NAME_P (qual_wfl))
11341     RESOLVE_TYPE_NAME_P (id) = 1;
11342   else if (RESOLVE_PACKAGE_NAME_P (qual_wfl))
11343     RESOLVE_PACKAGE_NAME_P (id) = 1;
11344 }
11345
11346 /* Patch tree nodes in a function body. When a BLOCK is found, push
11347    local variable decls if present.
11348    Same as java_complete_lhs, but does resolve static finals to values. */
11349
11350 static tree
11351 java_complete_tree (tree node)
11352 {
11353   node = java_complete_lhs (node);
11354   if (JDECL_P (node) && CLASS_FINAL_VARIABLE_P (node)
11355       && DECL_INITIAL (node) != NULL_TREE
11356       && !flag_emit_xref)
11357     {
11358       tree value = fold_constant_for_init (node, node);
11359       if (value != NULL_TREE)
11360         return value;
11361     }
11362   return node;
11363 }
11364
11365 static tree
11366 java_stabilize_reference (tree node)
11367 {
11368   if (TREE_CODE (node) == COMPOUND_EXPR)
11369     {
11370       tree op0 = TREE_OPERAND (node, 0);
11371       tree op1 = TREE_OPERAND (node, 1);
11372       TREE_OPERAND (node, 0) = save_expr (op0);
11373       TREE_OPERAND (node, 1) = java_stabilize_reference (op1);
11374       return node;
11375     }
11376   return stabilize_reference (node);
11377 }
11378
11379 /* Patch tree nodes in a function body. When a BLOCK is found, push
11380    local variable decls if present.
11381    Same as java_complete_tree, but does not resolve static finals to values. */
11382
11383 static tree
11384 java_complete_lhs (tree node)
11385 {
11386   tree nn, cn, wfl_op1, wfl_op2, wfl_op3;
11387   int flag;
11388
11389   /* CONVERT_EXPR always has its type set, even though it needs to be
11390      worked out. */
11391   if (TREE_TYPE (node) && TREE_CODE (node) != CONVERT_EXPR)
11392     return node;
11393
11394   /* The switch block implements cases processing container nodes
11395      first.  Contained nodes are always written back. Leaves come
11396      next and return a value. */
11397   switch (TREE_CODE (node))
11398     {
11399     case BLOCK:
11400
11401       /* 1- Block section.
11402          Set the local values on decl names so we can identify them
11403          faster when they're referenced. At that stage, identifiers
11404          are legal so we don't check for declaration errors. */
11405       for (cn = BLOCK_EXPR_DECLS (node); cn; cn = TREE_CHAIN (cn))
11406         {
11407           DECL_CONTEXT (cn) = current_function_decl;
11408           IDENTIFIER_LOCAL_VALUE (DECL_NAME (cn)) = cn;
11409         }
11410       if (BLOCK_EXPR_BODY (node) == NULL_TREE)
11411           CAN_COMPLETE_NORMALLY (node) = 1;
11412       else
11413         {
11414           tree stmt = BLOCK_EXPR_BODY (node);
11415           tree *ptr;
11416           int error_seen = 0;
11417           if (TREE_CODE (stmt) == COMPOUND_EXPR)
11418             {
11419               /* Re-order from (((A; B); C); ...; Z) to
11420                  (A; (B; (C ; (...; Z)))).
11421                  This makes it easier to scan the statements left-to-right
11422                  without using recursion (which might overflow the stack
11423                  if the block has many statements. */
11424               for (;;)
11425                 {
11426                   tree left = TREE_OPERAND (stmt, 0);
11427                   if (TREE_CODE (left) != COMPOUND_EXPR)
11428                     break;
11429                   TREE_OPERAND (stmt, 0) = TREE_OPERAND (left, 1);
11430                   TREE_OPERAND (left, 1) = stmt;
11431                   stmt = left;
11432                 }
11433               BLOCK_EXPR_BODY (node) = stmt;
11434             }
11435
11436           /* Now do the actual complete, without deep recursion for
11437              long blocks. */
11438           ptr = &BLOCK_EXPR_BODY (node);
11439           while (TREE_CODE (*ptr) == COMPOUND_EXPR
11440                  && !IS_EMPTY_STMT (TREE_OPERAND (*ptr, 1)))
11441             {
11442               tree cur = java_complete_tree (TREE_OPERAND (*ptr, 0));
11443               tree *next = &TREE_OPERAND (*ptr, 1);
11444               TREE_OPERAND (*ptr, 0) = cur;
11445               if (IS_EMPTY_STMT (cur))
11446                 {
11447                   /* Optimization;  makes it easier to detect empty bodies.
11448                      Most useful for <clinit> with all-constant initializer. */
11449                   *ptr = *next;
11450                   continue;
11451                 }
11452               if (TREE_CODE (cur) == ERROR_MARK)
11453                 error_seen++;
11454               else if (! CAN_COMPLETE_NORMALLY (cur))
11455                 {
11456                   wfl_op2 = *next;
11457                   for (;;)
11458                     {
11459                       if (TREE_CODE (wfl_op2) == BLOCK)
11460                         wfl_op2 = BLOCK_EXPR_BODY (wfl_op2);
11461                       else if (TREE_CODE (wfl_op2) == COMPOUND_EXPR)
11462                         wfl_op2 = TREE_OPERAND (wfl_op2, 0);
11463                       else
11464                         break;
11465                     }
11466                   if (TREE_CODE (wfl_op2) != CASE_EXPR
11467                       && TREE_CODE (wfl_op2) != DEFAULT_EXPR)
11468                     unreachable_stmt_error (*ptr);
11469                 }
11470               if (TREE_TYPE (*ptr) == NULL_TREE)
11471                 TREE_TYPE (*ptr) = void_type_node;
11472               ptr = next;
11473             }
11474           *ptr = java_complete_tree (*ptr);
11475
11476           if (TREE_CODE (*ptr) == ERROR_MARK || error_seen > 0)
11477             return error_mark_node;
11478           CAN_COMPLETE_NORMALLY (node) = CAN_COMPLETE_NORMALLY (*ptr);
11479         }
11480       /* Turn local bindings to null */
11481       for (cn = BLOCK_EXPR_DECLS (node); cn; cn = TREE_CHAIN (cn))
11482         IDENTIFIER_LOCAL_VALUE (DECL_NAME (cn)) = NULL_TREE;
11483
11484       TREE_TYPE (node) = void_type_node;
11485       break;
11486
11487       /* 2- They are expressions but ultimately deal with statements */
11488
11489     case THROW_EXPR:
11490       wfl_op1 = TREE_OPERAND (node, 0);
11491       COMPLETE_CHECK_OP_0 (node);
11492       /* 14.19 A throw statement cannot complete normally. */
11493       CAN_COMPLETE_NORMALLY (node) = 0;
11494       return patch_throw_statement (node, wfl_op1);
11495
11496     case SYNCHRONIZED_EXPR:
11497       wfl_op1 = TREE_OPERAND (node, 0);
11498       return patch_synchronized_statement (node, wfl_op1);
11499
11500     case TRY_EXPR:
11501       return patch_try_statement (node);
11502
11503     case TRY_FINALLY_EXPR:
11504       COMPLETE_CHECK_OP_0 (node);
11505       COMPLETE_CHECK_OP_1 (node);
11506       if (IS_EMPTY_STMT (TREE_OPERAND (node, 0)))
11507         /* Reduce try/finally nodes with an empty try block.  */
11508         return TREE_OPERAND (node, 1);
11509       if (IS_EMPTY_STMT (TREE_OPERAND (node, 1)))
11510         /* Likewise for an empty finally block.  */
11511         return TREE_OPERAND (node, 0);
11512       CAN_COMPLETE_NORMALLY (node)
11513         = (CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 0))
11514            && CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 1)));
11515       TREE_TYPE (node) = TREE_TYPE (TREE_OPERAND (node, 0));
11516       return node;
11517
11518     case LABELED_BLOCK_EXPR:
11519       PUSH_LABELED_BLOCK (node);
11520       if (LABELED_BLOCK_BODY (node))
11521         COMPLETE_CHECK_OP_1 (node);
11522       TREE_TYPE (node) = void_type_node;
11523       POP_LABELED_BLOCK ();
11524
11525       if (IS_EMPTY_STMT (LABELED_BLOCK_BODY (node)))
11526         {
11527           LABELED_BLOCK_BODY (node) = NULL_TREE;
11528           CAN_COMPLETE_NORMALLY (node) = 1;
11529         }
11530       else if (CAN_COMPLETE_NORMALLY (LABELED_BLOCK_BODY (node)))
11531         CAN_COMPLETE_NORMALLY (node) = 1;
11532       return node;
11533
11534     case EXIT_BLOCK_EXPR:
11535       /* We don't complete operand 1, because it's the return value of
11536          the EXIT_BLOCK_EXPR which doesn't exist it Java */
11537       return patch_bc_statement (node);
11538
11539     case CASE_EXPR:
11540       cn = java_complete_tree (TREE_OPERAND (node, 0));
11541       if (cn == error_mark_node)
11542         return cn;
11543
11544       /* First, the case expression must be constant. Values of final
11545          fields are accepted. */
11546       cn = fold (cn);
11547       if ((TREE_CODE (cn) == COMPOUND_EXPR || TREE_CODE (cn) == COMPONENT_REF)
11548           && JDECL_P (TREE_OPERAND (cn, 1))
11549           && FIELD_FINAL (TREE_OPERAND (cn, 1))
11550           && DECL_INITIAL (TREE_OPERAND (cn, 1)))
11551         {
11552           cn = fold_constant_for_init (DECL_INITIAL (TREE_OPERAND (cn, 1)),
11553                                        TREE_OPERAND (cn, 1));
11554         }
11555       /* Accept final locals too. */
11556       else if (TREE_CODE (cn) == VAR_DECL && DECL_FINAL (cn)
11557                && DECL_INITIAL (cn))
11558         cn = fold_constant_for_init (DECL_INITIAL (cn), cn);
11559
11560       if (!TREE_CONSTANT (cn) && !flag_emit_xref)
11561         {
11562           EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
11563           parse_error_context (node, "Constant expression required");
11564           return error_mark_node;
11565         }
11566
11567       nn = ctxp->current_loop;
11568
11569       /* It must be assignable to the type of the switch expression. */
11570       if (!try_builtin_assignconv (NULL_TREE,
11571                                    TREE_TYPE (TREE_OPERAND (nn, 0)), cn))
11572         {
11573           EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
11574           parse_error_context
11575             (wfl_operator,
11576              "Incompatible type for case. Can't convert `%s' to `int'",
11577              lang_printable_name (TREE_TYPE (cn), 0));
11578           return error_mark_node;
11579         }
11580
11581       cn = fold (convert (int_type_node, cn));
11582       TREE_CONSTANT_OVERFLOW (cn) = 0;
11583       CAN_COMPLETE_NORMALLY (cn) = 1;
11584
11585       /* Save the label on a list so that we can later check for
11586          duplicates.  */
11587       case_label_list = tree_cons (node, cn, case_label_list);
11588
11589       /* Multiple instance of a case label bearing the same value is
11590          checked later. The case expression is all right so far. */
11591       if (TREE_CODE (cn) == VAR_DECL)
11592         cn = DECL_INITIAL (cn);
11593       TREE_OPERAND (node, 0) = cn;
11594       TREE_TYPE (node) = void_type_node;
11595       CAN_COMPLETE_NORMALLY (node) = 1;
11596       TREE_SIDE_EFFECTS (node) = 1;
11597       break;
11598
11599     case DEFAULT_EXPR:
11600       nn = ctxp->current_loop;
11601       /* Only one default label is allowed per switch statement */
11602       if (SWITCH_HAS_DEFAULT (nn))
11603         {
11604           EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
11605           parse_error_context (wfl_operator,
11606                                "Duplicate case label: `default'");
11607           return error_mark_node;
11608         }
11609       else
11610         SWITCH_HAS_DEFAULT (nn) = 1;
11611       TREE_TYPE (node) = void_type_node;
11612       TREE_SIDE_EFFECTS (node) = 1;
11613       CAN_COMPLETE_NORMALLY (node) = 1;
11614       break;
11615
11616     case SWITCH_EXPR:
11617     case LOOP_EXPR:
11618       PUSH_LOOP (node);
11619       /* Check whether the loop was enclosed in a labeled
11620          statement. If not, create one, insert the loop in it and
11621          return the node */
11622       nn = patch_loop_statement (node);
11623
11624       /* Anyways, walk the body of the loop */
11625       if (TREE_CODE (node) == LOOP_EXPR)
11626         TREE_OPERAND (node, 0) = java_complete_tree (TREE_OPERAND (node, 0));
11627       /* Switch statement: walk the switch expression and the cases */
11628       else
11629         node = patch_switch_statement (node);
11630
11631       if (node == error_mark_node || TREE_OPERAND (node, 0) == error_mark_node)
11632         nn = error_mark_node;
11633       else
11634         {
11635           TREE_TYPE (nn) = TREE_TYPE (node) = void_type_node;
11636           /* If we returned something different, that's because we
11637              inserted a label. Pop the label too. */
11638           if (nn != node)
11639             {
11640               if (CAN_COMPLETE_NORMALLY (node))
11641                 CAN_COMPLETE_NORMALLY (nn) = 1;
11642               POP_LABELED_BLOCK ();
11643             }
11644         }
11645       POP_LOOP ();
11646       return nn;
11647
11648     case EXIT_EXPR:
11649       TREE_OPERAND (node, 0) = java_complete_tree (TREE_OPERAND (node, 0));
11650       return patch_exit_expr (node);
11651
11652     case COND_EXPR:
11653       /* Condition */
11654       TREE_OPERAND (node, 0) = java_complete_tree (TREE_OPERAND (node, 0));
11655       if (TREE_OPERAND (node, 0) == error_mark_node)
11656         return error_mark_node;
11657       /* then-else branches */
11658       TREE_OPERAND (node, 1) = java_complete_tree (TREE_OPERAND (node, 1));
11659       if (TREE_OPERAND (node, 1) == error_mark_node)
11660         return error_mark_node;
11661       TREE_OPERAND (node, 2) = java_complete_tree (TREE_OPERAND (node, 2));
11662       if (TREE_OPERAND (node, 2) == error_mark_node)
11663         return error_mark_node;
11664       return patch_if_else_statement (node);
11665       break;
11666
11667     case CONDITIONAL_EXPR:
11668       /* Condition */
11669       wfl_op1 = TREE_OPERAND (node, 0);
11670       COMPLETE_CHECK_OP_0 (node);
11671       wfl_op2 = TREE_OPERAND (node, 1);
11672       COMPLETE_CHECK_OP_1 (node);
11673       wfl_op3 = TREE_OPERAND (node, 2);
11674       COMPLETE_CHECK_OP_2 (node);
11675       return patch_conditional_expr (node, wfl_op1, wfl_op2);
11676
11677       /* 3- Expression section */
11678     case COMPOUND_EXPR:
11679       wfl_op2 = TREE_OPERAND (node, 1);
11680       TREE_OPERAND (node, 0) = nn =
11681         java_complete_tree (TREE_OPERAND (node, 0));
11682       if (IS_EMPTY_STMT (wfl_op2))
11683         CAN_COMPLETE_NORMALLY (node) = CAN_COMPLETE_NORMALLY (nn);
11684       else
11685         {
11686           if (! CAN_COMPLETE_NORMALLY (nn) && TREE_CODE (nn) != ERROR_MARK)
11687             {
11688               /* An unreachable condition in a do-while statement
11689                  is *not* (technically) an unreachable statement. */
11690               nn = wfl_op2;
11691               if (TREE_CODE (nn) == EXPR_WITH_FILE_LOCATION)
11692                 nn = EXPR_WFL_NODE (nn);
11693               /* NN can be NULL_TREE exactly when UPDATE is, in
11694                  finish_for_loop.  */
11695               if (nn != NULL_TREE && TREE_CODE (nn) != EXIT_EXPR)
11696                 {
11697                   SET_WFL_OPERATOR (wfl_operator, node, wfl_op2);
11698                   if (SUPPRESS_UNREACHABLE_ERROR (nn))
11699                     {
11700                       /* Perhaps this warning should have an
11701                          associated flag.  The code being compiled is
11702                          pedantically correct, but useless.  */
11703                       parse_warning_context (wfl_operator,
11704                                              "Unreachable statement");
11705                     }
11706                   else
11707                     parse_error_context (wfl_operator,
11708                                          "Unreachable statement");
11709                 }
11710             }
11711           TREE_OPERAND (node, 1) = java_complete_tree (TREE_OPERAND (node, 1));
11712           if (TREE_OPERAND (node, 1) == error_mark_node)
11713             return error_mark_node;
11714           /* Even though we might allow the case where the first
11715              operand doesn't return normally, we still should compute
11716              CAN_COMPLETE_NORMALLY correctly.  */
11717           CAN_COMPLETE_NORMALLY (node)
11718             = (CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 0))
11719                && CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 1)));
11720         }
11721       TREE_TYPE (node) = TREE_TYPE (TREE_OPERAND (node, 1));
11722       break;
11723
11724     case RETURN_EXPR:
11725       /* CAN_COMPLETE_NORMALLY (node) = 0; */
11726       return patch_return (node);
11727
11728     case EXPR_WITH_FILE_LOCATION:
11729       if (!EXPR_WFL_NODE (node) /* Or a PRIMARY flag ? */
11730           || TREE_CODE (EXPR_WFL_NODE (node)) == IDENTIFIER_NODE)
11731         {
11732           tree wfl = node;
11733           node = resolve_expression_name (node, NULL);
11734           if (node == error_mark_node)
11735             return node;
11736           /* Keep line number information somewhere were it doesn't
11737              disrupt the completion process. */
11738           if (flag_emit_xref && TREE_CODE (node) != CALL_EXPR)
11739             {
11740               EXPR_WFL_NODE (wfl) = TREE_OPERAND (node, 1);
11741               TREE_OPERAND (node, 1) = wfl;
11742             }
11743           CAN_COMPLETE_NORMALLY (node) = 1;
11744         }
11745       else
11746         {
11747           tree body;
11748           int save_lineno = input_line;
11749           input_line = EXPR_WFL_LINENO (node);
11750           body = java_complete_tree (EXPR_WFL_NODE (node));
11751           input_line = save_lineno;
11752           EXPR_WFL_NODE (node) = body;
11753           TREE_SIDE_EFFECTS (node) = TREE_SIDE_EFFECTS (body);
11754           CAN_COMPLETE_NORMALLY (node) = CAN_COMPLETE_NORMALLY (body);
11755           if (IS_EMPTY_STMT (body) || TREE_CONSTANT (body))
11756             {
11757               /* Makes it easier to constant fold, detect empty bodies. */
11758               return body;
11759             }
11760           if (body == error_mark_node)
11761             {
11762               /* Its important for the evaluation of assignment that
11763                  this mark on the TREE_TYPE is propagated. */
11764               TREE_TYPE (node) = error_mark_node;
11765               return error_mark_node;
11766             }
11767           else
11768             TREE_TYPE (node) = TREE_TYPE (EXPR_WFL_NODE (node));
11769
11770         }
11771       break;
11772
11773     case NEW_ARRAY_EXPR:
11774       /* Patch all the dimensions */
11775       flag = 0;
11776       for (cn = TREE_OPERAND (node, 1); cn; cn = TREE_CHAIN (cn))
11777         {
11778           int location = EXPR_WFL_LINECOL (TREE_VALUE (cn));
11779           tree dim = convert (int_type_node,
11780                               java_complete_tree (TREE_VALUE (cn)));
11781           if (dim == error_mark_node)
11782             {
11783               flag = 1;
11784               continue;
11785             }
11786           else
11787             {
11788               TREE_VALUE (cn) = dim;
11789               /* Setup the location of the current dimension, for
11790                  later error report. */
11791               TREE_PURPOSE (cn) =
11792                 build_expr_wfl (NULL_TREE, input_filename, 0, 0);
11793               EXPR_WFL_LINECOL (TREE_PURPOSE (cn)) = location;
11794             }
11795         }
11796       /* They complete the array creation expression, if no errors
11797          were found. */
11798       CAN_COMPLETE_NORMALLY (node) = 1;
11799       return (flag ? error_mark_node
11800               : force_evaluation_order (patch_newarray (node)));
11801
11802     case NEW_ANONYMOUS_ARRAY_EXPR:
11803       /* Create the array type if necessary. */
11804       if (ANONYMOUS_ARRAY_DIMS_SIG (node))
11805         {
11806           tree type = ANONYMOUS_ARRAY_BASE_TYPE (node);
11807           if (!(type = resolve_type_during_patch (type)))
11808             return error_mark_node;
11809           type = build_array_from_name (type, NULL_TREE,
11810                                         ANONYMOUS_ARRAY_DIMS_SIG (node), NULL);
11811           ANONYMOUS_ARRAY_BASE_TYPE (node) = build_pointer_type (type);
11812         }
11813       node = patch_new_array_init (ANONYMOUS_ARRAY_BASE_TYPE (node),
11814                                    ANONYMOUS_ARRAY_INITIALIZER (node));
11815       if (node == error_mark_node)
11816         return error_mark_node;
11817       CAN_COMPLETE_NORMALLY (node) = 1;
11818       return node;
11819
11820     case NEW_CLASS_EXPR:
11821     case CALL_EXPR:
11822       /* Complete function's argument(s) first */
11823       if (complete_function_arguments (node))
11824         return error_mark_node;
11825       else
11826         {
11827           tree decl, wfl = TREE_OPERAND (node, 0);
11828           int in_this = CALL_THIS_CONSTRUCTOR_P (node);
11829           int from_super = (EXPR_WFL_NODE (TREE_OPERAND (node, 0)) ==
11830                            super_identifier_node);
11831           tree arguments;
11832           int location = EXPR_WFL_LINECOL (node);
11833
11834           node = patch_method_invocation (node, NULL_TREE, NULL_TREE,
11835                                           from_super, 0, &decl);
11836           if (node == error_mark_node)
11837             return error_mark_node;
11838
11839           if (TREE_CODE (node) == CALL_EXPR
11840               && TREE_OPERAND (node, 1) != NULL_TREE)
11841             arguments = TREE_VALUE (TREE_OPERAND (node, 1));
11842           else
11843             arguments = NULL_TREE;
11844           check_thrown_exceptions (location, decl, arguments);
11845           /* If we call this(...), register signature and positions */
11846           if (in_this)
11847             DECL_CONSTRUCTOR_CALLS (current_function_decl) =
11848               tree_cons (wfl, decl,
11849                          DECL_CONSTRUCTOR_CALLS (current_function_decl));
11850           CAN_COMPLETE_NORMALLY (node) = 1;
11851           return force_evaluation_order (node);
11852         }
11853
11854     case MODIFY_EXPR:
11855       /* Save potential wfls */
11856       wfl_op1 = TREE_OPERAND (node, 0);
11857       TREE_OPERAND (node, 0) = nn = java_complete_lhs (wfl_op1);
11858
11859       if (MODIFY_EXPR_FROM_INITIALIZATION_P (node)
11860           && TREE_CODE (nn) == VAR_DECL && TREE_STATIC (nn)
11861           && DECL_INITIAL (nn) != NULL_TREE)
11862         {
11863           tree value;
11864
11865           value = fold_constant_for_init (nn, nn);
11866
11867           /* When we have a primitype type, or a string and we're not
11868              emitting a class file, we actually don't want to generate
11869              anything for the assignment. */
11870           if (value != NULL_TREE &&
11871               (JPRIMITIVE_TYPE_P (TREE_TYPE (value)) ||
11872                (TREE_TYPE (value) == string_ptr_type_node &&
11873                 ! flag_emit_class_files)))
11874             {
11875               /* Prepare node for patch_assignment */
11876               TREE_OPERAND (node, 1) = value;
11877               /* Call patch assignment to verify the assignment */
11878               if (patch_assignment (node, wfl_op1) == error_mark_node)
11879                 return error_mark_node;
11880               /* Set DECL_INITIAL properly (a conversion might have
11881                  been decided by patch_assignment) and return the
11882                  empty statement. */
11883               else
11884                 {
11885                   tree patched = patch_string (TREE_OPERAND (node, 1));
11886                   if (patched)
11887                     DECL_INITIAL (nn) = patched;
11888                   else
11889                     DECL_INITIAL (nn) = TREE_OPERAND (node, 1);
11890                   DECL_FIELD_FINAL_IUD (nn) = 1;
11891                   return build_java_empty_stmt ();
11892                 }
11893             }
11894           if (! flag_emit_class_files)
11895             DECL_INITIAL (nn) = NULL_TREE;
11896         }
11897       wfl_op2 = TREE_OPERAND (node, 1);
11898
11899       if (TREE_OPERAND (node, 0) == error_mark_node)
11900         return error_mark_node;
11901
11902       flag = COMPOUND_ASSIGN_P (wfl_op2);
11903       if (flag)
11904         {
11905           /* This might break when accessing outer field from inner
11906              class. TESTME, FIXME */
11907           tree lvalue = java_stabilize_reference (TREE_OPERAND (node, 0));
11908
11909           /* Hand stabilize the lhs on both places */
11910           TREE_OPERAND (node, 0) = lvalue;
11911           TREE_OPERAND (TREE_OPERAND (node, 1), 0) =
11912             (flag_emit_class_files ? lvalue : save_expr (lvalue));
11913
11914           /* 15.25.2.a: Left hand is not an array access. FIXME */
11915           /* Now complete the RHS. We write it back later on. */
11916           nn = java_complete_tree (TREE_OPERAND (node, 1));
11917
11918           if ((cn = patch_string (nn)))
11919             nn = cn;
11920
11921           /* The last part of the rewrite for E1 op= E2 is to have
11922              E1 = (T)(E1 op E2), with T being the type of E1. */
11923           nn = java_complete_tree (build_cast (EXPR_WFL_LINECOL (wfl_op2),
11924                                                TREE_TYPE (lvalue), nn));
11925
11926           /* If the assignment is compound and has reference type,
11927              then ensure the LHS has type String and nothing else.  */
11928           if (JREFERENCE_TYPE_P (TREE_TYPE (lvalue))
11929               && ! JSTRING_TYPE_P (TREE_TYPE (lvalue)))
11930             parse_error_context (wfl_op2,
11931                                  "Incompatible type for `+='. Can't convert `%s' to `java.lang.String'",
11932                                  lang_printable_name (TREE_TYPE (lvalue), 0));
11933
11934           /* 15.25.2.b: Left hand is an array access. FIXME */
11935         }
11936
11937       /* If we're about to patch a NEW_ARRAY_INIT, we call a special
11938          function to complete this RHS. Note that a NEW_ARRAY_INIT
11939          might have been already fully expanded if created as a result
11940          of processing an anonymous array initializer. We avoid doing
11941          the operation twice by testing whether the node already bears
11942          a type. */
11943       else if (TREE_CODE (wfl_op2) == NEW_ARRAY_INIT && !TREE_TYPE (wfl_op2))
11944         nn = patch_new_array_init (TREE_TYPE (TREE_OPERAND (node, 0)),
11945                                    TREE_OPERAND (node, 1));
11946       /* Otherwise we simply complete the RHS */
11947       else
11948         nn = java_complete_tree (TREE_OPERAND (node, 1));
11949
11950       if (nn == error_mark_node)
11951         return error_mark_node;
11952
11953       /* Write back the RHS as we evaluated it. */
11954       TREE_OPERAND (node, 1) = nn;
11955
11956       /* In case we're handling = with a String as a RHS, we need to
11957          produce a String out of the RHS (it might still be a
11958          STRING_CST or a StringBuffer at this stage */
11959       if ((nn = patch_string (TREE_OPERAND (node, 1))))
11960         TREE_OPERAND (node, 1) = nn;
11961
11962       if ((nn = outer_field_access_fix (wfl_op1, TREE_OPERAND (node, 0),
11963                                         TREE_OPERAND (node, 1))))
11964         {
11965           /* We return error_mark_node if outer_field_access_fix
11966              detects we write into a final. */
11967           if (nn == error_mark_node)
11968             return error_mark_node;
11969           node = nn;
11970         }
11971       else
11972         {
11973           node = patch_assignment (node, wfl_op1);
11974           if (node == error_mark_node)
11975             return error_mark_node;
11976           /* Reorganize the tree if necessary. */
11977           if (flag && (!JREFERENCE_TYPE_P (TREE_TYPE (node))
11978                        || JSTRING_P (TREE_TYPE (node))))
11979             node = java_refold (node);
11980         }
11981
11982       /* Seek to set DECL_INITIAL to a proper value, since it might have
11983          undergone a conversion in patch_assignment. We do that only when
11984          it's necessary to have DECL_INITIAL properly set. */
11985       nn = TREE_OPERAND (node, 0);
11986       if (TREE_CODE (nn) == VAR_DECL
11987           && DECL_INITIAL (nn) && CONSTANT_VALUE_P (DECL_INITIAL (nn))
11988           && FIELD_STATIC (nn) && FIELD_FINAL (nn)
11989           && (JPRIMITIVE_TYPE_P (TREE_TYPE (nn))
11990               || TREE_TYPE (nn) == string_ptr_type_node))
11991         DECL_INITIAL (nn) = TREE_OPERAND (node, 1);
11992
11993       CAN_COMPLETE_NORMALLY (node) = 1;
11994       return node;
11995
11996     case MULT_EXPR:
11997     case PLUS_EXPR:
11998     case MINUS_EXPR:
11999     case LSHIFT_EXPR:
12000     case RSHIFT_EXPR:
12001     case URSHIFT_EXPR:
12002     case BIT_AND_EXPR:
12003     case BIT_XOR_EXPR:
12004     case BIT_IOR_EXPR:
12005     case TRUNC_MOD_EXPR:
12006     case TRUNC_DIV_EXPR:
12007     case RDIV_EXPR:
12008     case TRUTH_ANDIF_EXPR:
12009     case TRUTH_ORIF_EXPR:
12010     case EQ_EXPR:
12011     case NE_EXPR:
12012     case GT_EXPR:
12013     case GE_EXPR:
12014     case LT_EXPR:
12015     case LE_EXPR:
12016       /* Operands 0 and 1 are WFL in certain cases only. patch_binop
12017          knows how to handle those cases. */
12018       wfl_op1 = TREE_OPERAND (node, 0);
12019       wfl_op2 = TREE_OPERAND (node, 1);
12020
12021       CAN_COMPLETE_NORMALLY (node) = 1;
12022       /* Don't complete string nodes if dealing with the PLUS operand. */
12023       if (TREE_CODE (node) != PLUS_EXPR || !JSTRING_P (wfl_op1))
12024         {
12025           nn = java_complete_tree (wfl_op1);
12026           if (nn == error_mark_node)
12027             return error_mark_node;
12028
12029           TREE_OPERAND (node, 0) = nn;
12030         }
12031       if (TREE_CODE (node) != PLUS_EXPR || !JSTRING_P (wfl_op2))
12032         {
12033           nn = java_complete_tree (wfl_op2);
12034           if (nn == error_mark_node)
12035             return error_mark_node;
12036
12037           TREE_OPERAND (node, 1) = nn;
12038         }
12039       return patch_binop (node, wfl_op1, wfl_op2);
12040
12041     case INSTANCEOF_EXPR:
12042       wfl_op1 = TREE_OPERAND (node, 0);
12043       COMPLETE_CHECK_OP_0 (node);
12044       if (flag_emit_xref)
12045         {
12046           TREE_TYPE (node) = boolean_type_node;
12047           return node;
12048         }
12049       return patch_binop (node, wfl_op1, TREE_OPERAND (node, 1));
12050
12051     case UNARY_PLUS_EXPR:
12052     case NEGATE_EXPR:
12053     case TRUTH_NOT_EXPR:
12054     case BIT_NOT_EXPR:
12055     case PREDECREMENT_EXPR:
12056     case PREINCREMENT_EXPR:
12057     case POSTDECREMENT_EXPR:
12058     case POSTINCREMENT_EXPR:
12059     case CONVERT_EXPR:
12060       /* There are cases were wfl_op1 is a WFL. patch_unaryop knows
12061          how to handle those cases. */
12062       wfl_op1 = TREE_OPERAND (node, 0);
12063       CAN_COMPLETE_NORMALLY (node) = 1;
12064       TREE_OPERAND (node, 0) = java_complete_tree (wfl_op1);
12065       if (TREE_OPERAND (node, 0) == error_mark_node)
12066         return error_mark_node;
12067       node = patch_unaryop (node, wfl_op1);
12068       CAN_COMPLETE_NORMALLY (node) = 1;
12069       break;
12070
12071     case ARRAY_REF:
12072       /* There are cases were wfl_op1 is a WFL. patch_array_ref knows
12073          how to handle those cases. */
12074       wfl_op1 = TREE_OPERAND (node, 0);
12075       TREE_OPERAND (node, 0) = java_complete_tree (wfl_op1);
12076       if (TREE_OPERAND (node, 0) == error_mark_node)
12077         return error_mark_node;
12078       if (!flag_emit_class_files && !flag_emit_xref)
12079         TREE_OPERAND (node, 0) = save_expr (TREE_OPERAND (node, 0));
12080       /* The same applies to wfl_op2 */
12081       wfl_op2 = TREE_OPERAND (node, 1);
12082       TREE_OPERAND (node, 1) = java_complete_tree (wfl_op2);
12083       if (TREE_OPERAND (node, 1) == error_mark_node)
12084         return error_mark_node;
12085       if (!flag_emit_class_files && !flag_emit_xref)
12086         TREE_OPERAND (node, 1) = save_expr (TREE_OPERAND (node, 1));
12087       return patch_array_ref (node);
12088
12089     case RECORD_TYPE:
12090       return node;;
12091
12092     case COMPONENT_REF:
12093       /* The first step in the re-write of qualified name handling.  FIXME.
12094          So far, this is only to support PRIMTYPE.class -> PRIMCLASS.TYPE. */
12095       TREE_OPERAND (node, 0) = java_complete_tree (TREE_OPERAND (node, 0));
12096       if (TREE_CODE (TREE_OPERAND (node, 0)) == RECORD_TYPE)
12097         {
12098           tree name = TREE_OPERAND (node, 1);
12099           tree field = lookup_field_wrapper (TREE_OPERAND (node, 0), name);
12100           if (field == NULL_TREE)
12101             {
12102               error ("missing static field `%s'", IDENTIFIER_POINTER (name));
12103               return error_mark_node;
12104             }
12105           if (! FIELD_STATIC (field))
12106             {
12107               error ("not a static field `%s'", IDENTIFIER_POINTER (name));
12108               return error_mark_node;
12109             }
12110           return field;
12111         }
12112       else
12113         abort ();
12114       break;
12115
12116     case THIS_EXPR:
12117       /* Can't use THIS in a static environment */
12118       if (!current_this)
12119         {
12120           EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
12121           parse_error_context (wfl_operator,
12122                                "Keyword `this' used outside allowed context");
12123           TREE_TYPE (node) = error_mark_node;
12124           return error_mark_node;
12125         }
12126       if (ctxp->explicit_constructor_p)
12127         {
12128           EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
12129           parse_error_context
12130             (wfl_operator, "Can't reference `this' or `super' before the superclass constructor has been called");
12131           TREE_TYPE (node) = error_mark_node;
12132           return error_mark_node;
12133         }
12134       return current_this;
12135
12136     case CLASS_LITERAL:
12137       CAN_COMPLETE_NORMALLY (node) = 1;
12138       node = patch_incomplete_class_ref (node);
12139       if (node == error_mark_node)
12140         return error_mark_node;
12141       break;
12142
12143     default:
12144       CAN_COMPLETE_NORMALLY (node) = 1;
12145       /* Ok: may be we have a STRING_CST or a crafted `StringBuffer'
12146          and it's time to turn it into the appropriate String object */
12147       if ((nn = patch_string (node)))
12148         node = nn;
12149       else
12150         internal_error ("No case for %s", tree_code_name [TREE_CODE (node)]);
12151     }
12152   return node;
12153 }
12154
12155 /* Complete function call's argument. Return a nonzero value is an
12156    error was found.  */
12157
12158 static int
12159 complete_function_arguments (tree node)
12160 {
12161   int flag = 0;
12162   tree cn;
12163
12164   ctxp->explicit_constructor_p += (CALL_EXPLICIT_CONSTRUCTOR_P (node) ? 1 : 0);
12165   for (cn = TREE_OPERAND (node, 1); cn; cn = TREE_CHAIN (cn))
12166     {
12167       tree wfl = TREE_VALUE (cn), parm, temp;
12168       parm = java_complete_tree (wfl);
12169
12170       if (parm == error_mark_node)
12171         {
12172           flag = 1;
12173           continue;
12174         }
12175       /* If we have a string literal that we haven't transformed yet or a
12176          crafted string buffer, as a result of the use of the String
12177          `+' operator. Build `parm.toString()' and expand it. */
12178       if ((temp = patch_string (parm)))
12179         parm = temp;
12180
12181       TREE_VALUE (cn) = parm;
12182     }
12183   ctxp->explicit_constructor_p -= (CALL_EXPLICIT_CONSTRUCTOR_P (node) ? 1 : 0);
12184   return flag;
12185 }
12186
12187 /* Sometimes (for loops and variable initialized during their
12188    declaration), we want to wrap a statement around a WFL and turn it
12189    debugable.  */
12190
12191 static tree
12192 build_debugable_stmt (int location, tree stmt)
12193 {
12194   if (TREE_CODE (stmt) != EXPR_WITH_FILE_LOCATION)
12195     {
12196       stmt = build_expr_wfl (stmt, input_filename, 0, 0);
12197       EXPR_WFL_LINECOL (stmt) = location;
12198     }
12199   JAVA_MAYBE_GENERATE_DEBUG_INFO (stmt);
12200   return stmt;
12201 }
12202
12203 static tree
12204 build_expr_block (tree body, tree decls)
12205 {
12206   tree node = make_node (BLOCK);
12207   BLOCK_EXPR_DECLS (node) = decls;
12208   BLOCK_EXPR_BODY (node) = body;
12209   if (body)
12210     TREE_TYPE (node) = TREE_TYPE (body);
12211   TREE_SIDE_EFFECTS (node) = 1;
12212   return node;
12213 }
12214
12215 /* Create a new function block and link it appropriately to current
12216    function block chain */
12217
12218 static tree
12219 enter_block (void)
12220 {
12221   tree b = build_expr_block (NULL_TREE, NULL_TREE);
12222
12223   /* Link block B supercontext to the previous block. The current
12224      function DECL is used as supercontext when enter_a_block is called
12225      for the first time for a given function. The current function body
12226      (DECL_FUNCTION_BODY) is set to be block B.  */
12227
12228   tree fndecl = current_function_decl;
12229
12230   if (!fndecl) {
12231     BLOCK_SUPERCONTEXT (b) = current_static_block;
12232     current_static_block = b;
12233   }
12234
12235   else if (!DECL_FUNCTION_BODY (fndecl))
12236     {
12237       BLOCK_SUPERCONTEXT (b) = fndecl;
12238       DECL_FUNCTION_BODY (fndecl) = b;
12239     }
12240   else
12241     {
12242       BLOCK_SUPERCONTEXT (b) = DECL_FUNCTION_BODY (fndecl);
12243       DECL_FUNCTION_BODY (fndecl) = b;
12244     }
12245   return b;
12246 }
12247
12248 /* Exit a block by changing the current function body
12249    (DECL_FUNCTION_BODY) to the current block super context, only if
12250    the block being exited isn't the method's top level one.  */
12251
12252 static tree
12253 exit_block (void)
12254 {
12255   tree b;
12256   if (current_function_decl)
12257     {
12258       b = DECL_FUNCTION_BODY (current_function_decl);
12259       if (BLOCK_SUPERCONTEXT (b) != current_function_decl)
12260         DECL_FUNCTION_BODY (current_function_decl) = BLOCK_SUPERCONTEXT (b);
12261     }
12262   else
12263     {
12264       b = current_static_block;
12265
12266       if (BLOCK_SUPERCONTEXT (b))
12267         current_static_block = BLOCK_SUPERCONTEXT (b);
12268     }
12269   return b;
12270 }
12271
12272 /* Lookup for NAME in the nested function's blocks, all the way up to
12273    the current toplevel one. It complies with Java's local variable
12274    scoping rules.  */
12275
12276 static tree
12277 lookup_name_in_blocks (tree name)
12278 {
12279   tree b = GET_CURRENT_BLOCK (current_function_decl);
12280
12281   while (b != current_function_decl)
12282     {
12283       tree current;
12284
12285       /* Paranoid sanity check. To be removed */
12286       if (TREE_CODE (b) != BLOCK)
12287         abort ();
12288
12289       for (current = BLOCK_EXPR_DECLS (b); current;
12290            current = TREE_CHAIN (current))
12291         if (DECL_NAME (current) == name)
12292           return current;
12293       b = BLOCK_SUPERCONTEXT (b);
12294     }
12295   return NULL_TREE;
12296 }
12297
12298 static void
12299 maybe_absorb_scoping_blocks (void)
12300 {
12301   while (BLOCK_IS_IMPLICIT (GET_CURRENT_BLOCK (current_function_decl)))
12302     {
12303       tree b = exit_block ();
12304       java_method_add_stmt (current_function_decl, b);
12305       SOURCE_FRONTEND_DEBUG (("Absorbing scoping block at line %d", input_line));
12306     }
12307 }
12308
12309 \f
12310 /* This section of the source is reserved to build_* functions that
12311    are building incomplete tree nodes and the patch_* functions that
12312    are completing them.  */
12313
12314 /* Wrap a non WFL node around a WFL.  */
12315
12316 static tree
12317 build_wfl_wrap (tree node, int location)
12318 {
12319   tree wfl, node_to_insert = node;
12320
12321   /* We want to process THIS . xxx symbolically, to keep it consistent
12322      with the way we're processing SUPER. A THIS from a primary as a
12323      different form than a SUPER. Turn THIS into something symbolic */
12324   if (TREE_CODE (node) == THIS_EXPR)
12325     node_to_insert = wfl = build_wfl_node (this_identifier_node);
12326   else
12327     wfl = build_expr_wfl (NULL_TREE, ctxp->filename, 0, 0);
12328
12329   EXPR_WFL_LINECOL (wfl) = location;
12330   EXPR_WFL_QUALIFICATION (wfl) = build_tree_list (node_to_insert, NULL_TREE);
12331   return wfl;
12332 }
12333
12334 /* Build a super() constructor invocation. Returns an empty statement if
12335    we're currently dealing with the class java.lang.Object. */
12336
12337 static tree
12338 build_super_invocation (tree mdecl)
12339 {
12340   if (DECL_CONTEXT (mdecl) == object_type_node)
12341     return build_java_empty_stmt ();
12342   else
12343     {
12344       tree super_wfl = build_wfl_node (super_identifier_node);
12345       tree a = NULL_TREE, t;
12346       /* If we're dealing with an anonymous class, pass the arguments
12347          of the crafted constructor along. */
12348       if (ANONYMOUS_CLASS_P (DECL_CONTEXT (mdecl)))
12349         {
12350           SKIP_THIS_AND_ARTIFICIAL_PARMS (t, mdecl);
12351           for (; t != end_params_node; t = TREE_CHAIN (t))
12352             a = tree_cons (NULL_TREE, build_wfl_node (TREE_PURPOSE (t)), a);
12353         }
12354       return build_method_invocation (super_wfl, a);
12355     }
12356 }
12357
12358 /* Build a SUPER/THIS qualified method invocation.  */
12359
12360 static tree
12361 build_this_super_qualified_invocation (int use_this, tree name, tree args,
12362                                        int lloc, int rloc)
12363 {
12364   tree invok;
12365   tree wfl =
12366     build_wfl_node (use_this ? this_identifier_node : super_identifier_node);
12367   EXPR_WFL_LINECOL (wfl) = lloc;
12368   invok = build_method_invocation (name, args);
12369   return make_qualified_primary (wfl, invok, rloc);
12370 }
12371
12372 /* Build an incomplete CALL_EXPR node. */
12373
12374 static tree
12375 build_method_invocation (tree name, tree args)
12376 {
12377   tree call = build (CALL_EXPR, NULL_TREE, name, args, NULL_TREE);
12378   TREE_SIDE_EFFECTS (call) = 1;
12379   EXPR_WFL_LINECOL (call) = EXPR_WFL_LINECOL (name);
12380   return call;
12381 }
12382
12383 /* Build an incomplete new xxx(...) node. */
12384
12385 static tree
12386 build_new_invocation (tree name, tree args)
12387 {
12388   tree call = build (NEW_CLASS_EXPR, NULL_TREE, name, args, NULL_TREE);
12389   TREE_SIDE_EFFECTS (call) = 1;
12390   EXPR_WFL_LINECOL (call) = EXPR_WFL_LINECOL (name);
12391   return call;
12392 }
12393
12394 /* Build an incomplete assignment expression. */
12395
12396 static tree
12397 build_assignment (int op, int op_location, tree lhs, tree rhs)
12398 {
12399   tree assignment;
12400   /* Build the corresponding binop if we deal with a Compound
12401      Assignment operator. Mark the binop sub-tree as part of a
12402      Compound Assignment expression */
12403   if (op != ASSIGN_TK)
12404     {
12405       rhs = build_binop (BINOP_LOOKUP (op), op_location, lhs, rhs);
12406       COMPOUND_ASSIGN_P (rhs) = 1;
12407     }
12408   assignment = build (MODIFY_EXPR, NULL_TREE, lhs, rhs);
12409   TREE_SIDE_EFFECTS (assignment) = 1;
12410   EXPR_WFL_LINECOL (assignment) = op_location;
12411   return assignment;
12412 }
12413
12414 /* Print an INTEGER_CST node as decimal in a static buffer, and return
12415    the buffer.  This is used only for string conversion.  */
12416 static char *
12417 string_convert_int_cst (tree node)
12418 {
12419   /* Long.MIN_VALUE is -9223372036854775808, 20 characters.  */
12420   static char buffer[21];
12421
12422   unsigned HOST_WIDE_INT lo = TREE_INT_CST_LOW (node);
12423   unsigned HOST_WIDE_INT hi = TREE_INT_CST_HIGH (node);
12424   char *p = buffer + sizeof (buffer);
12425   int neg = 0;
12426
12427   unsigned HOST_WIDE_INT hibit = (((unsigned HOST_WIDE_INT) 1)
12428                                   << (HOST_BITS_PER_WIDE_INT - 1));
12429
12430   *--p = '\0';
12431
12432   /* If negative, note the fact and negate the value.  */
12433   if ((hi & hibit))
12434     {
12435       lo = ~lo;
12436       hi = ~hi;
12437       if (++lo == 0)
12438         ++hi;
12439       neg = 1;
12440     }
12441
12442   /* Divide by 10 until there are no bits left.  */
12443   do
12444     {
12445       unsigned HOST_WIDE_INT acc = 0;
12446       unsigned HOST_WIDE_INT outhi = 0, outlo = 0;
12447       unsigned int i;
12448
12449       /* Use long division to compute the result and the remainder.  */
12450       for (i = 0; i < 2 * HOST_BITS_PER_WIDE_INT; ++i)
12451         {
12452           /* Shift a bit into accumulator.  */
12453           acc <<= 1;
12454           if ((hi & hibit))
12455             acc |= 1;
12456
12457           /* Shift the value.  */
12458           hi <<= 1;
12459           if ((lo & hibit))
12460             hi |= 1;
12461           lo <<= 1;
12462
12463           /* Shift the correct bit into the result.  */
12464           outhi <<= 1;
12465           if ((outlo & hibit))
12466             outhi |= 1;
12467           outlo <<= 1;
12468           if (acc >= 10)
12469             {
12470               acc -= 10;
12471               outlo |= 1;
12472             }
12473         }
12474
12475       /* '0' == 060 in Java, but might not be here (think EBCDIC).  */
12476       *--p = '\060' + acc;
12477
12478       hi = outhi;
12479       lo = outlo;
12480     }
12481   while (hi || lo);
12482
12483   if (neg)
12484     *--p = '\055'; /* '-' == 055 in Java, but might not be here.  */
12485
12486   return p;
12487 }
12488
12489 /* Print an INTEGER_CST node in a static buffer, and return the
12490    buffer.  This is used only for error handling.  */
12491 char *
12492 print_int_node (tree node)
12493 {
12494   static char buffer [80];
12495   if (TREE_CONSTANT_OVERFLOW (node))
12496     sprintf (buffer, "<overflow>");
12497
12498   if (TREE_INT_CST_HIGH (node) == 0)
12499     sprintf (buffer, HOST_WIDE_INT_PRINT_UNSIGNED,
12500              TREE_INT_CST_LOW (node));
12501   else if (TREE_INT_CST_HIGH (node) == -1
12502            && TREE_INT_CST_LOW (node) != 0)
12503     sprintf (buffer, "-" HOST_WIDE_INT_PRINT_UNSIGNED,
12504              -TREE_INT_CST_LOW (node));
12505   else
12506     sprintf (buffer, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
12507              TREE_INT_CST_HIGH (node), TREE_INT_CST_LOW (node));
12508
12509   return buffer;
12510 }
12511
12512 \f
12513 /* Return 1 if an assignment to a FINAL is attempted in a non suitable
12514    context.  */
12515
12516 /* 15.25 Assignment operators. */
12517
12518 static tree
12519 patch_assignment (tree node, tree wfl_op1)
12520 {
12521   tree rhs = TREE_OPERAND (node, 1);
12522   tree lvalue = TREE_OPERAND (node, 0), llvalue;
12523   tree lhs_type = NULL_TREE, rhs_type, new_rhs = NULL_TREE;
12524   int error_found = 0;
12525   int lvalue_from_array = 0;
12526   int is_return = 0;
12527
12528   EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
12529
12530   /* Lhs can be a named variable */
12531   if (JDECL_P (lvalue))
12532     {
12533       lhs_type = TREE_TYPE (lvalue);
12534     }
12535   /* Or Lhs can be an array access. */
12536   else if (TREE_CODE (lvalue) == ARRAY_REF)
12537     {
12538       lhs_type = TREE_TYPE (lvalue);
12539       lvalue_from_array = 1;
12540     }
12541   /* Or a field access */
12542   else if (TREE_CODE (lvalue) == COMPONENT_REF)
12543     lhs_type = TREE_TYPE (lvalue);
12544   /* Or a function return slot */
12545   else if (TREE_CODE (lvalue) == RESULT_DECL)
12546     {
12547       /* If the return type is an integral type, then we create the
12548          RESULT_DECL with a promoted type, but we need to do these
12549          checks against the unpromoted type to ensure type safety.  So
12550          here we look at the real type, not the type of the decl we
12551          are modifying.  */
12552       lhs_type = TREE_TYPE (TREE_TYPE (current_function_decl));
12553       is_return = 1;
12554     }
12555   /* Otherwise, we might want to try to write into an optimized static
12556      final, this is an of a different nature, reported further on. */
12557   else if (TREE_CODE (wfl_op1) == EXPR_WITH_FILE_LOCATION
12558            && resolve_expression_name (wfl_op1, &llvalue))
12559     {
12560       lhs_type = TREE_TYPE (lvalue);
12561     }
12562   else
12563     {
12564       parse_error_context (wfl_op1, "Invalid left hand side of assignment");
12565       error_found = 1;
12566     }
12567
12568   rhs_type = TREE_TYPE (rhs);
12569
12570   /* 5.1 Try the assignment conversion for builtin type. */
12571   new_rhs = try_builtin_assignconv (wfl_op1, lhs_type, rhs);
12572
12573   /* 5.2 If it failed, try a reference conversion */
12574   if (!new_rhs)
12575     new_rhs = try_reference_assignconv (lhs_type, rhs);
12576
12577   /* 15.25.2 If we have a compound assignment, convert RHS into the
12578      type of the LHS */
12579   else if (COMPOUND_ASSIGN_P (TREE_OPERAND (node, 1)))
12580     new_rhs = convert (lhs_type, rhs);
12581
12582   /* Explicit cast required. This is an error */
12583   if (!new_rhs)
12584     {
12585       char *t1 = xstrdup (lang_printable_name (TREE_TYPE (rhs), 0));
12586       char *t2 = xstrdup (lang_printable_name (lhs_type, 0));
12587       tree wfl;
12588       char operation [32];      /* Max size known */
12589
12590       /* If the assignment is part of a declaration, we use the WFL of
12591          the declared variable to point out the error and call it a
12592          declaration problem. If the assignment is a genuine =
12593          operator, we call is a operator `=' problem, otherwise we
12594          call it an assignment problem. In both of these last cases,
12595          we use the WFL of the operator to indicate the error. */
12596
12597       if (MODIFY_EXPR_FROM_INITIALIZATION_P (node))
12598         {
12599           wfl = wfl_op1;
12600           strcpy (operation, "declaration");
12601         }
12602       else
12603         {
12604           wfl = wfl_operator;
12605           if (COMPOUND_ASSIGN_P (TREE_OPERAND (node, 1)))
12606             strcpy (operation, "assignment");
12607           else if (is_return)
12608             strcpy (operation, "`return'");
12609           else
12610             strcpy (operation, "`='");
12611         }
12612
12613       if (!valid_cast_to_p (rhs_type, lhs_type))
12614         parse_error_context
12615           (wfl, "Incompatible type for %s. Can't convert `%s' to `%s'",
12616            operation, t1, t2);
12617       else
12618         parse_error_context (wfl, "Incompatible type for %s. Explicit cast needed to convert `%s' to `%s'",
12619                              operation, t1, t2);
12620       free (t1); free (t2);
12621       error_found = 1;
12622     }
12623
12624   if (error_found)
12625     return error_mark_node;
12626
12627   /* If we're processing a `return' statement, promote the actual type
12628      to the promoted type.  */
12629   if (is_return)
12630     new_rhs = convert (TREE_TYPE (lvalue), new_rhs);
12631
12632   /* 10.10: Array Store Exception runtime check */
12633   if (!flag_emit_class_files
12634       && !flag_emit_xref
12635       && lvalue_from_array
12636       && JREFERENCE_TYPE_P (TYPE_ARRAY_ELEMENT (lhs_type)))
12637     {
12638       tree array, store_check, base, index_expr;
12639
12640       /* Save RHS so that it doesn't get re-evaluated by the store check. */
12641       new_rhs = save_expr (new_rhs);
12642
12643       /* Get the INDIRECT_REF. */
12644       array = TREE_OPERAND (TREE_OPERAND (lvalue, 0), 0);
12645       /* Get the array pointer expr. */
12646       array = TREE_OPERAND (array, 0);
12647       store_check = build_java_arraystore_check (array, new_rhs);
12648
12649       index_expr = TREE_OPERAND (lvalue, 1);
12650
12651       if (TREE_CODE (index_expr) == COMPOUND_EXPR)
12652         {
12653           /* A COMPOUND_EXPR here is a bounds check. The bounds check must
12654              happen before the store check, so prepare to insert the store
12655              check within the second operand of the existing COMPOUND_EXPR. */
12656           base = index_expr;
12657         }
12658       else
12659         base = lvalue;
12660
12661       index_expr = TREE_OPERAND (base, 1);
12662       TREE_OPERAND (base, 1) = build (COMPOUND_EXPR, TREE_TYPE (index_expr),
12663                                       store_check, index_expr);
12664     }
12665
12666   /* Final locals can be used as case values in switch
12667      statement. Prepare them for this eventuality. */
12668   if (TREE_CODE (lvalue) == VAR_DECL
12669       && DECL_FINAL (lvalue)
12670       && TREE_CONSTANT (new_rhs)
12671       && IDENTIFIER_LOCAL_VALUE (DECL_NAME (lvalue))
12672       && JINTEGRAL_TYPE_P (TREE_TYPE (lvalue))
12673       )
12674     {
12675       TREE_CONSTANT (lvalue) = 1;
12676       TREE_INVARIANT (lvalue) = 1;
12677       DECL_INITIAL (lvalue) = new_rhs;
12678     }
12679
12680   /* Copy the rhs if it's a reference.  */
12681   if (! flag_check_references && ! flag_emit_class_files && optimize > 0)
12682     {
12683       switch (TREE_CODE (new_rhs))
12684         {
12685         case ARRAY_REF:
12686         case INDIRECT_REF:
12687         case COMPONENT_REF:
12688           /* Transform a = foo.bar
12689              into a = ({int tmp; tmp = foo.bar;}).
12690              We need to ensure that if a read from memory fails
12691              because of a NullPointerException, a destination variable
12692              will remain unchanged.  An explicit temporary does what
12693              we need.
12694
12695              If flag_check_references is set, this is unnecessary
12696              because we'll check each reference before doing any
12697              reads.  If optimize is not set the result will never be
12698              written to a stack slot that contains the LHS.  */
12699           {
12700             tree tmp = build_decl (VAR_DECL, get_identifier ("<tmp>"),
12701                                    TREE_TYPE (new_rhs));
12702             tree block = make_node (BLOCK);
12703             tree assignment
12704               = build (MODIFY_EXPR, TREE_TYPE (new_rhs), tmp, fold (new_rhs));
12705             DECL_CONTEXT (tmp) = current_function_decl;
12706             TREE_TYPE (block) = TREE_TYPE (new_rhs);
12707             BLOCK_VARS (block) = tmp;
12708             BLOCK_EXPR_BODY (block) = assignment;
12709             TREE_SIDE_EFFECTS (block) = 1;
12710             new_rhs = block;
12711           }
12712           break;
12713         default:
12714           break;
12715         }
12716     }
12717
12718   TREE_OPERAND (node, 0) = lvalue;
12719   TREE_OPERAND (node, 1) = new_rhs;
12720   TREE_TYPE (node) = lhs_type;
12721   return node;
12722 }
12723
12724 /* Check that type SOURCE can be cast into type DEST. If the cast
12725    can't occur at all, return NULL; otherwise, return a possibly
12726    modified rhs.  */
12727
12728 static tree
12729 try_reference_assignconv (tree lhs_type, tree rhs)
12730 {
12731   tree new_rhs = NULL_TREE;
12732   tree rhs_type = TREE_TYPE (rhs);
12733
12734   if (!JPRIMITIVE_TYPE_P (rhs_type) && JREFERENCE_TYPE_P (lhs_type))
12735     {
12736       /* `null' may be assigned to any reference type */
12737       if (rhs == null_pointer_node)
12738         new_rhs = null_pointer_node;
12739       /* Try the reference assignment conversion */
12740       else if (valid_ref_assignconv_cast_p (rhs_type, lhs_type, 0))
12741         new_rhs = rhs;
12742       /* This is a magic assignment that we process differently */
12743       else if (TREE_CODE (rhs) == JAVA_EXC_OBJ_EXPR)
12744         new_rhs = rhs;
12745     }
12746   return new_rhs;
12747 }
12748
12749 /* Check that RHS can be converted into LHS_TYPE by the assignment
12750    conversion (5.2), for the cases of RHS being a builtin type. Return
12751    NULL_TREE if the conversion fails or if because RHS isn't of a
12752    builtin type. Return a converted RHS if the conversion is possible.  */
12753
12754 static tree
12755 try_builtin_assignconv (tree wfl_op1, tree lhs_type, tree rhs)
12756 {
12757   tree new_rhs = NULL_TREE;
12758   tree rhs_type = TREE_TYPE (rhs);
12759
12760   /* Handle boolean specially.  */
12761   if (TREE_CODE (rhs_type) == BOOLEAN_TYPE
12762       || TREE_CODE (lhs_type) == BOOLEAN_TYPE)
12763     {
12764       if (TREE_CODE (rhs_type) == BOOLEAN_TYPE
12765           && TREE_CODE (lhs_type) == BOOLEAN_TYPE)
12766         new_rhs = rhs;
12767     }
12768
12769   /* 5.1.1 Try Identity Conversion,
12770      5.1.2 Try Widening Primitive Conversion */
12771   else if (valid_builtin_assignconv_identity_widening_p (lhs_type, rhs_type))
12772     new_rhs = convert (lhs_type, rhs);
12773
12774   /* Try a narrowing primitive conversion (5.1.3):
12775        - expression is a constant expression of type byte, short, char,
12776          or int, AND
12777        - variable is byte, short or char AND
12778        - The value of the expression is representable in the type of the
12779          variable */
12780   else if ((rhs_type == byte_type_node || rhs_type == short_type_node
12781             || rhs_type == char_type_node || rhs_type == int_type_node)
12782             && TREE_CONSTANT (rhs)
12783            && (lhs_type == byte_type_node || lhs_type == char_type_node
12784                || lhs_type == short_type_node))
12785     {
12786       if (int_fits_type_p (rhs, lhs_type))
12787         new_rhs = convert (lhs_type, rhs);
12788       else if (wfl_op1)         /* Might be called with a NULL */
12789         parse_warning_context
12790           (wfl_op1, "Constant expression `%s' too wide for narrowing primitive conversion to `%s'",
12791            print_int_node (rhs), lang_printable_name (lhs_type, 0));
12792       /* Reported a warning that will turn into an error further
12793          down, so we don't return */
12794     }
12795
12796   return new_rhs;
12797 }
12798
12799 /* Return 1 if RHS_TYPE can be converted to LHS_TYPE by identity
12800    conversion (5.1.1) or widening primitive conversion (5.1.2).  Return
12801    0 is the conversion test fails.  This implements parts the method
12802    invocation conversion (5.3).  */
12803
12804 static int
12805 valid_builtin_assignconv_identity_widening_p (tree lhs_type, tree rhs_type)
12806 {
12807   /* 5.1.1: This is the identity conversion part. */
12808   if (lhs_type == rhs_type)
12809     return 1;
12810
12811   /* Reject non primitive types and boolean conversions.  */
12812   if (!JNUMERIC_TYPE_P (lhs_type) || !JNUMERIC_TYPE_P (rhs_type))
12813     return 0;
12814
12815   /* 5.1.2: widening primitive conversion. byte, even if it's smaller
12816      than a char can't be converted into a char. Short can't too, but
12817      the < test below takes care of that */
12818   if (lhs_type == char_type_node && rhs_type == byte_type_node)
12819     return 0;
12820
12821   /* Accept all promoted type here. Note, we can't use <= in the test
12822      below, because we still need to bounce out assignments of short
12823      to char and the likes */
12824   if (lhs_type == int_type_node
12825       && (rhs_type == promoted_byte_type_node
12826           || rhs_type == promoted_short_type_node
12827           || rhs_type == promoted_char_type_node
12828           || rhs_type == promoted_boolean_type_node))
12829     return 1;
12830
12831   /* From here, an integral is widened if its precision is smaller
12832      than the precision of the LHS or if the LHS is a floating point
12833      type, or the RHS is a float and the RHS a double. */
12834   if ((JINTEGRAL_TYPE_P (rhs_type) && JINTEGRAL_TYPE_P (lhs_type)
12835        && (TYPE_PRECISION (rhs_type) < TYPE_PRECISION (lhs_type)))
12836       || (JINTEGRAL_TYPE_P (rhs_type) && JFLOAT_TYPE_P (lhs_type))
12837       || (rhs_type == float_type_node && lhs_type == double_type_node))
12838     return 1;
12839
12840   return 0;
12841 }
12842
12843 /* Check that something of SOURCE type can be assigned or cast to
12844    something of DEST type at runtime. Return 1 if the operation is
12845    valid, 0 otherwise. If CAST is set to 1, we're treating the case
12846    were SOURCE is cast into DEST, which borrows a lot of the
12847    assignment check. */
12848
12849 static int
12850 valid_ref_assignconv_cast_p (tree source, tree dest, int cast)
12851 {
12852   /* SOURCE or DEST might be null if not from a declared entity. */
12853   if (!source || !dest)
12854     return 0;
12855   if (JNULLP_TYPE_P (source))
12856     return 1;
12857   if (TREE_CODE (source) == POINTER_TYPE)
12858     source = TREE_TYPE (source);
12859   if (TREE_CODE (dest) == POINTER_TYPE)
12860     dest = TREE_TYPE (dest);
12861
12862   /* If source and dest are being compiled from bytecode, they may need to
12863      be loaded. */
12864   if (CLASS_P (source) && !CLASS_LOADED_P (source))
12865     {
12866       load_class (source, 1);
12867       safe_layout_class (source);
12868     }
12869   if (CLASS_P (dest) && !CLASS_LOADED_P (dest))
12870     {
12871       load_class (dest, 1);
12872       safe_layout_class (dest);
12873     }
12874
12875   /* Case where SOURCE is a class type */
12876   if (TYPE_CLASS_P (source))
12877     {
12878       if (TYPE_CLASS_P (dest))
12879         return  (source == dest
12880                  || inherits_from_p (source, dest)
12881                  || (cast && inherits_from_p (dest, source)));
12882       if (TYPE_INTERFACE_P (dest))
12883         {
12884           /* If doing a cast and SOURCE is final, the operation is
12885              always correct a compile time (because even if SOURCE
12886              does not implement DEST, a subclass of SOURCE might). */
12887           if (cast && !CLASS_FINAL (TYPE_NAME (source)))
12888             return 1;
12889           /* Otherwise, SOURCE must implement DEST */
12890           return interface_of_p (dest, source);
12891         }
12892       /* DEST is an array, cast permitted if SOURCE is of Object type */
12893       return (cast && source == object_type_node ? 1 : 0);
12894     }
12895   if (TYPE_INTERFACE_P (source))
12896     {
12897       if (TYPE_CLASS_P (dest))
12898         {
12899           /* If not casting, DEST must be the Object type */
12900           if (!cast)
12901             return dest == object_type_node;
12902           /* We're doing a cast. The cast is always valid is class
12903              DEST is not final, otherwise, DEST must implement SOURCE */
12904           else if (!CLASS_FINAL (TYPE_NAME (dest)))
12905             return 1;
12906           else
12907             return interface_of_p (source, dest);
12908         }
12909       if (TYPE_INTERFACE_P (dest))
12910         {
12911           /* If doing a cast, then if SOURCE and DEST contain method
12912              with the same signature but different return type, then
12913              this is a (compile time) error */
12914           if (cast)
12915             {
12916               tree method_source, method_dest;
12917               tree source_type;
12918               tree source_sig;
12919               tree source_name;
12920               for (method_source = TYPE_METHODS (source); method_source;
12921                    method_source = TREE_CHAIN (method_source))
12922                 {
12923                   source_sig =
12924                     build_java_argument_signature (TREE_TYPE (method_source));
12925                   source_type = TREE_TYPE (TREE_TYPE (method_source));
12926                   source_name = DECL_NAME (method_source);
12927                   for (method_dest = TYPE_METHODS (dest);
12928                        method_dest; method_dest = TREE_CHAIN (method_dest))
12929                     if (source_sig ==
12930                         build_java_argument_signature (TREE_TYPE (method_dest))
12931                         && source_name == DECL_NAME (method_dest)
12932                         && source_type != TREE_TYPE (TREE_TYPE (method_dest)))
12933                       return 0;
12934                 }
12935               return 1;
12936             }
12937           else
12938             return source == dest || interface_of_p (dest, source);
12939         }
12940       else
12941         {
12942           /* Array */
12943           return (cast
12944                   && (DECL_NAME (TYPE_NAME (source))
12945                       == java_lang_cloneable_identifier_node
12946                       || (DECL_NAME (TYPE_NAME (source))
12947                           == java_io_serializable_identifier_node)));
12948         }
12949     }
12950   if (TYPE_ARRAY_P (source))
12951     {
12952       if (TYPE_CLASS_P (dest))
12953         return dest == object_type_node;
12954       /* Can't cast an array to an interface unless the interface is
12955          java.lang.Cloneable or java.io.Serializable.  */
12956       if (TYPE_INTERFACE_P (dest))
12957         return (DECL_NAME (TYPE_NAME (dest))
12958                 == java_lang_cloneable_identifier_node
12959                 || (DECL_NAME (TYPE_NAME (dest))
12960                     == java_io_serializable_identifier_node));
12961       else                      /* Arrays */
12962         {
12963           tree source_element_type = TYPE_ARRAY_ELEMENT (source);
12964           tree dest_element_type = TYPE_ARRAY_ELEMENT (dest);
12965
12966           /* In case of severe errors, they turn out null */
12967           if (!dest_element_type || !source_element_type)
12968             return 0;
12969           if (source_element_type == dest_element_type)
12970             return 1;
12971           return valid_ref_assignconv_cast_p (source_element_type,
12972                                               dest_element_type, cast);
12973         }
12974       return 0;
12975     }
12976   return 0;
12977 }
12978
12979 static int
12980 valid_cast_to_p (tree source, tree dest)
12981 {
12982   if (TREE_CODE (source) == POINTER_TYPE)
12983     source = TREE_TYPE (source);
12984   if (TREE_CODE (dest) == POINTER_TYPE)
12985     dest = TREE_TYPE (dest);
12986
12987   if (TREE_CODE (source) == RECORD_TYPE && TREE_CODE (dest) == RECORD_TYPE)
12988     return valid_ref_assignconv_cast_p (source, dest, 1);
12989
12990   else if (JNUMERIC_TYPE_P (source) && JNUMERIC_TYPE_P (dest))
12991     return 1;
12992
12993   else if (TREE_CODE (source) == BOOLEAN_TYPE
12994            && TREE_CODE (dest) == BOOLEAN_TYPE)
12995     return 1;
12996
12997   return 0;
12998 }
12999
13000 static tree
13001 do_unary_numeric_promotion (tree arg)
13002 {
13003   tree type = TREE_TYPE (arg);
13004   if ((TREE_CODE (type) == INTEGER_TYPE && TYPE_PRECISION (type) < 32)
13005       || TREE_CODE (type) == CHAR_TYPE)
13006     arg = convert (int_type_node, arg);
13007   return arg;
13008 }
13009
13010 /* Return a nonzero value if SOURCE can be converted into DEST using
13011    the method invocation conversion rule (5.3).  */
13012 static int
13013 valid_method_invocation_conversion_p (tree dest, tree source)
13014 {
13015   return ((JPRIMITIVE_TYPE_P (source) && JPRIMITIVE_TYPE_P (dest)
13016            && valid_builtin_assignconv_identity_widening_p (dest, source))
13017           || ((JREFERENCE_TYPE_P (source) || JNULLP_TYPE_P (source))
13018               && (JREFERENCE_TYPE_P (dest) || JNULLP_TYPE_P (dest))
13019               && valid_ref_assignconv_cast_p (source, dest, 0)));
13020 }
13021
13022 /* Build an incomplete binop expression. */
13023
13024 static tree
13025 build_binop (enum tree_code op, int op_location, tree op1, tree op2)
13026 {
13027   tree binop = build (op, NULL_TREE, op1, op2);
13028   TREE_SIDE_EFFECTS (binop) = 1;
13029   /* Store the location of the operator, for better error report. The
13030      string of the operator will be rebuild based on the OP value. */
13031   EXPR_WFL_LINECOL (binop) = op_location;
13032   return binop;
13033 }
13034
13035 /* Build the string of the operator retained by NODE. If NODE is part
13036    of a compound expression, add an '=' at the end of the string. This
13037    function is called when an error needs to be reported on an
13038    operator. The string is returned as a pointer to a static character
13039    buffer. */
13040
13041 static char *
13042 operator_string (tree node)
13043 {
13044 #define BUILD_OPERATOR_STRING(S)                                        \
13045   {                                                                     \
13046     sprintf (buffer, "%s%s", S, (COMPOUND_ASSIGN_P (node) ? "=" : "")); \
13047     return buffer;                                                      \
13048   }
13049
13050   static char buffer [10];
13051   switch (TREE_CODE (node))
13052     {
13053     case MULT_EXPR: BUILD_OPERATOR_STRING ("*");
13054     case RDIV_EXPR: BUILD_OPERATOR_STRING ("/");
13055     case TRUNC_MOD_EXPR: BUILD_OPERATOR_STRING ("%");
13056     case PLUS_EXPR: BUILD_OPERATOR_STRING ("+");
13057     case MINUS_EXPR: BUILD_OPERATOR_STRING ("-");
13058     case LSHIFT_EXPR: BUILD_OPERATOR_STRING ("<<");
13059     case RSHIFT_EXPR: BUILD_OPERATOR_STRING (">>");
13060     case URSHIFT_EXPR: BUILD_OPERATOR_STRING (">>>");
13061     case BIT_AND_EXPR: BUILD_OPERATOR_STRING ("&");
13062     case BIT_XOR_EXPR: BUILD_OPERATOR_STRING ("^");
13063     case BIT_IOR_EXPR: BUILD_OPERATOR_STRING ("|");
13064     case TRUTH_ANDIF_EXPR: BUILD_OPERATOR_STRING ("&&");
13065     case TRUTH_ORIF_EXPR: BUILD_OPERATOR_STRING ("||");
13066     case EQ_EXPR: BUILD_OPERATOR_STRING ("==");
13067     case NE_EXPR: BUILD_OPERATOR_STRING ("!=");
13068     case GT_EXPR: BUILD_OPERATOR_STRING (">");
13069     case GE_EXPR: BUILD_OPERATOR_STRING (">=");
13070     case LT_EXPR: BUILD_OPERATOR_STRING ("<");
13071     case LE_EXPR: BUILD_OPERATOR_STRING ("<=");
13072     case UNARY_PLUS_EXPR: BUILD_OPERATOR_STRING ("+");
13073     case NEGATE_EXPR: BUILD_OPERATOR_STRING ("-");
13074     case TRUTH_NOT_EXPR: BUILD_OPERATOR_STRING ("!");
13075     case BIT_NOT_EXPR: BUILD_OPERATOR_STRING ("~");
13076     case PREINCREMENT_EXPR:     /* Fall through */
13077     case POSTINCREMENT_EXPR: BUILD_OPERATOR_STRING ("++");
13078     case PREDECREMENT_EXPR:     /* Fall through */
13079     case POSTDECREMENT_EXPR: BUILD_OPERATOR_STRING ("--");
13080     default:
13081       internal_error ("unregistered operator %s",
13082                       tree_code_name [TREE_CODE (node)]);
13083     }
13084   return NULL;
13085 #undef BUILD_OPERATOR_STRING
13086 }
13087
13088 /* Return 1 if VAR_ACCESS1 is equivalent to VAR_ACCESS2.  */
13089
13090 static int
13091 java_decl_equiv (tree var_acc1, tree var_acc2)
13092 {
13093   if (JDECL_P (var_acc1))
13094     return (var_acc1 == var_acc2);
13095
13096   return (TREE_CODE (var_acc1) == COMPONENT_REF
13097           && TREE_CODE (var_acc2) == COMPONENT_REF
13098           && TREE_OPERAND (TREE_OPERAND (var_acc1, 0), 0)
13099              == TREE_OPERAND (TREE_OPERAND (var_acc2, 0), 0)
13100           && TREE_OPERAND (var_acc1, 1) == TREE_OPERAND (var_acc2, 1));
13101 }
13102
13103 /* Return a nonzero value if CODE is one of the operators that can be
13104    used in conjunction with the `=' operator in a compound assignment.  */
13105
13106 static int
13107 binop_compound_p (enum tree_code code)
13108 {
13109   int i;
13110   for (i = 0; i < BINOP_COMPOUND_CANDIDATES; i++)
13111     if (binop_lookup [i] == code)
13112       break;
13113
13114   return i < BINOP_COMPOUND_CANDIDATES;
13115 }
13116
13117 /* Reorganize after a fold to get SAVE_EXPR to generate what we want.  */
13118
13119 static tree
13120 java_refold (tree t)
13121 {
13122   tree c, b, ns, decl;
13123
13124   if (TREE_CODE (t) != MODIFY_EXPR)
13125     return t;
13126
13127   c = TREE_OPERAND (t, 1);
13128   if (! (c && TREE_CODE (c) == COMPOUND_EXPR
13129          && TREE_CODE (TREE_OPERAND (c, 0)) == MODIFY_EXPR
13130          && binop_compound_p (TREE_CODE (TREE_OPERAND (c, 1)))))
13131     return t;
13132
13133   /* Now the left branch of the binary operator. */
13134   b = TREE_OPERAND (TREE_OPERAND (c, 1), 0);
13135   if (! (b && TREE_CODE (b) == NOP_EXPR
13136          && TREE_CODE (TREE_OPERAND (b, 0)) == SAVE_EXPR))
13137     return t;
13138
13139   ns = TREE_OPERAND (TREE_OPERAND (b, 0), 0);
13140   if (! (ns && TREE_CODE (ns) == NOP_EXPR
13141          && TREE_CODE (TREE_OPERAND (ns, 0)) == SAVE_EXPR))
13142     return t;
13143
13144   decl = TREE_OPERAND (TREE_OPERAND (ns, 0), 0);
13145   if ((JDECL_P (decl) || TREE_CODE (decl) == COMPONENT_REF)
13146       /* It's got to be the an equivalent decl */
13147       && java_decl_equiv (decl, TREE_OPERAND (TREE_OPERAND (c, 0), 0)))
13148     {
13149       /* Shorten the NOP_EXPR/SAVE_EXPR path. */
13150       TREE_OPERAND (TREE_OPERAND (c, 1), 0) = TREE_OPERAND (ns, 0);
13151       /* Substitute the COMPOUND_EXPR by the BINOP_EXPR */
13152       TREE_OPERAND (t, 1) = TREE_OPERAND (c, 1);
13153       /* Change the right part of the BINOP_EXPR */
13154       TREE_OPERAND (TREE_OPERAND (t, 1), 1) = TREE_OPERAND (c, 0);
13155     }
13156
13157   return t;
13158 }
13159
13160 /* Binary operators (15.16 up to 15.18). We return error_mark_node on
13161    errors but we modify NODE so that it contains the type computed
13162    according to the expression, when it's fixed. Otherwise, we write
13163    error_mark_node as the type. It allows us to further the analysis
13164    of remaining nodes and detects more errors in certain cases.  */
13165
13166 static tree
13167 patch_binop (tree node, tree wfl_op1, tree wfl_op2)
13168 {
13169   tree op1 = TREE_OPERAND (node, 0);
13170   tree op2 = TREE_OPERAND (node, 1);
13171   tree op1_type = TREE_TYPE (op1);
13172   tree op2_type = TREE_TYPE (op2);
13173   tree prom_type = NULL_TREE, cn;
13174   enum tree_code code = TREE_CODE (node);
13175
13176   /* If 1, tell the routine that we have to return error_mark_node
13177      after checking for the initialization of the RHS */
13178   int error_found = 0;
13179
13180   EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
13181
13182   /* If either op<n>_type are NULL, this might be early signs of an
13183      error situation, unless it's too early to tell (in case we're
13184      handling a `+', `==', `!=' or `instanceof'.) We want to set op<n>_type
13185      correctly so the error can be later on reported accurately. */
13186   if (! (code == PLUS_EXPR || code == NE_EXPR
13187          || code == EQ_EXPR || code == INSTANCEOF_EXPR))
13188     {
13189       tree n;
13190       if (! op1_type)
13191         {
13192           n = java_complete_tree (op1);
13193           op1_type = TREE_TYPE (n);
13194         }
13195       if (! op2_type)
13196         {
13197           n = java_complete_tree (op2);
13198           op2_type = TREE_TYPE (n);
13199         }
13200     }
13201
13202   switch (code)
13203     {
13204     /* 15.16 Multiplicative operators */
13205     case MULT_EXPR:             /* 15.16.1 Multiplication Operator * */
13206     case RDIV_EXPR:             /* 15.16.2 Division Operator / */
13207     case TRUNC_DIV_EXPR:        /* 15.16.2 Integral type Division Operator / */
13208     case TRUNC_MOD_EXPR:        /* 15.16.3 Remainder operator % */
13209       if (!JNUMERIC_TYPE_P (op1_type) || !JNUMERIC_TYPE_P (op2_type))
13210         {
13211           if (!JNUMERIC_TYPE_P (op1_type))
13212             ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op1_type);
13213           if (!JNUMERIC_TYPE_P (op2_type) && (op1_type != op2_type))
13214             ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op2_type);
13215           TREE_TYPE (node) = error_mark_node;
13216           error_found = 1;
13217           break;
13218         }
13219       prom_type = binary_numeric_promotion (op1_type, op2_type, &op1, &op2);
13220
13221       /* Detect integral division by zero */
13222       if ((code == RDIV_EXPR || code == TRUNC_MOD_EXPR)
13223           && TREE_CODE (prom_type) == INTEGER_TYPE
13224           && (op2 == integer_zero_node || op2 == long_zero_node ||
13225               (TREE_CODE (op2) == INTEGER_CST &&
13226                ! TREE_INT_CST_LOW (op2)  && ! TREE_INT_CST_HIGH (op2))))
13227         {
13228           parse_warning_context (wfl_operator, "Evaluating this expression will result in an arithmetic exception being thrown");
13229           TREE_CONSTANT (node) = 0;
13230           TREE_INVARIANT (node) = 0;
13231         }
13232
13233       /* Change the division operator if necessary */
13234       if (code == RDIV_EXPR && TREE_CODE (prom_type) == INTEGER_TYPE)
13235         TREE_SET_CODE (node, TRUNC_DIV_EXPR);
13236
13237       /* Before divisions as is disappear, try to simplify and bail if
13238          applicable, otherwise we won't perform even simple
13239          simplifications like (1-1)/3. We can't do that with floating
13240          point number, folds can't handle them at this stage. */
13241       if (code == RDIV_EXPR && TREE_CONSTANT (op1) && TREE_CONSTANT (op2)
13242           && JINTEGRAL_TYPE_P (op1) && JINTEGRAL_TYPE_P (op2))
13243         {
13244           TREE_TYPE (node) = prom_type;
13245           node = fold (node);
13246           if (TREE_CODE (node) != code)
13247             return node;
13248         }
13249
13250       if (TREE_CODE (prom_type) == INTEGER_TYPE
13251           && flag_use_divide_subroutine
13252           && ! flag_emit_class_files
13253           && (code == RDIV_EXPR || code == TRUNC_MOD_EXPR))
13254         return build_java_soft_divmod (TREE_CODE (node), prom_type, op1, op2);
13255
13256       /* This one is more complicated. FLOATs are processed by a
13257          function call to soft_fmod. Duplicate the value of the
13258          COMPOUND_ASSIGN_P flag. */
13259       if (code == TRUNC_MOD_EXPR)
13260         {
13261           tree mod = build_java_binop (TRUNC_MOD_EXPR, prom_type, op1, op2);
13262           COMPOUND_ASSIGN_P (mod) = COMPOUND_ASSIGN_P (node);
13263           TREE_SIDE_EFFECTS (mod)
13264             = TREE_SIDE_EFFECTS (op1) | TREE_SIDE_EFFECTS (op2);
13265           return mod;
13266         }
13267       break;
13268
13269     /* 15.17 Additive Operators */
13270     case PLUS_EXPR:             /* 15.17.1 String Concatenation Operator + */
13271
13272       /* Operation is valid if either one argument is a string
13273          constant, a String object or a StringBuffer crafted for the
13274          purpose of the a previous usage of the String concatenation
13275          operator */
13276
13277       if (TREE_CODE (op1) == STRING_CST
13278           || TREE_CODE (op2) == STRING_CST
13279           || JSTRING_TYPE_P (op1_type)
13280           || JSTRING_TYPE_P (op2_type)
13281           || IS_CRAFTED_STRING_BUFFER_P (op1)
13282           || IS_CRAFTED_STRING_BUFFER_P (op2))
13283         return build_string_concatenation (op1, op2);
13284
13285     case MINUS_EXPR:            /* 15.17.2 Additive Operators (+ and -) for
13286                                    Numeric Types */
13287       if (!JNUMERIC_TYPE_P (op1_type) || !JNUMERIC_TYPE_P (op2_type))
13288         {
13289           if (!JNUMERIC_TYPE_P (op1_type))
13290             ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op1_type);
13291           if (!JNUMERIC_TYPE_P (op2_type) && (op1_type != op2_type))
13292             ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op2_type);
13293           TREE_TYPE (node) = error_mark_node;
13294           error_found = 1;
13295           break;
13296         }
13297       prom_type = binary_numeric_promotion (op1_type, op2_type, &op1, &op2);
13298       break;
13299
13300     /* 15.18 Shift Operators */
13301     case LSHIFT_EXPR:
13302     case RSHIFT_EXPR:
13303     case URSHIFT_EXPR:
13304       if (!JINTEGRAL_TYPE_P (op1_type) || !JINTEGRAL_TYPE_P (op2_type))
13305         {
13306           if (!JINTEGRAL_TYPE_P (op1_type))
13307             ERROR_CAST_NEEDED_TO_INTEGRAL (wfl_operator, node, op1_type);
13308           else
13309             {
13310               if (JNUMERIC_TYPE_P (op2_type))
13311                 parse_error_context (wfl_operator,
13312                                      "Incompatible type for `%s'. Explicit cast needed to convert shift distance from `%s' to integral",
13313                                      operator_string (node),
13314                                      lang_printable_name (op2_type, 0));
13315               else
13316                 parse_error_context (wfl_operator,
13317                                      "Incompatible type for `%s'. Can't convert shift distance from `%s' to integral",
13318                                      operator_string (node),
13319                                      lang_printable_name (op2_type, 0));
13320             }
13321           TREE_TYPE (node) = error_mark_node;
13322           error_found = 1;
13323           break;
13324         }
13325
13326       /* Unary numeric promotion (5.6.1) is performed on each operand
13327          separately */
13328       op1 = do_unary_numeric_promotion (op1);
13329       op2 = do_unary_numeric_promotion (op2);
13330
13331       /* If the right hand side is of type `long', first cast it to
13332          `int'.  */
13333       if (TREE_TYPE (op2) == long_type_node)
13334         op2 = build1 (CONVERT_EXPR, int_type_node, op2);
13335
13336       /* The type of the shift expression is the type of the promoted
13337          type of the left-hand operand */
13338       prom_type = TREE_TYPE (op1);
13339
13340       /* Shift int only up to 0x1f and long up to 0x3f */
13341       if (prom_type == int_type_node)
13342         op2 = fold (build (BIT_AND_EXPR, int_type_node, op2,
13343                            build_int_2 (0x1f, 0)));
13344       else
13345         op2 = fold (build (BIT_AND_EXPR, int_type_node, op2,
13346                            build_int_2 (0x3f, 0)));
13347
13348       /* The >>> operator is a >> operating on unsigned quantities */
13349       if (code == URSHIFT_EXPR && ! flag_emit_class_files)
13350         {
13351           tree to_return;
13352           tree utype = java_unsigned_type (prom_type);
13353           op1 = convert (utype, op1);
13354           TREE_SET_CODE (node, RSHIFT_EXPR);
13355           TREE_OPERAND (node, 0) = op1;
13356           TREE_OPERAND (node, 1) = op2;
13357           TREE_TYPE (node) = utype;
13358           to_return = convert (prom_type, node);
13359           /* Copy the original value of the COMPOUND_ASSIGN_P flag */
13360           COMPOUND_ASSIGN_P (to_return) = COMPOUND_ASSIGN_P (node);
13361           TREE_SIDE_EFFECTS (to_return)
13362             = TREE_SIDE_EFFECTS (op1) | TREE_SIDE_EFFECTS (op2);
13363           return to_return;
13364         }
13365       break;
13366
13367       /* 15.19.1 Type Comparison Operator instanceof */
13368     case INSTANCEOF_EXPR:
13369
13370       TREE_TYPE (node) = boolean_type_node;
13371
13372       /* OP1_TYPE might be NULL when OP1 is a string constant.  */
13373       if ((cn = patch_string (op1)))
13374         {
13375           op1 = cn;
13376           op1_type = TREE_TYPE (op1);
13377         }
13378       if (op1_type == NULL_TREE)
13379         abort ();
13380
13381       if (!(op2_type = resolve_type_during_patch (op2)))
13382         return error_mark_node;
13383
13384       /* The first operand must be a reference type or the null type */
13385       if (!JREFERENCE_TYPE_P (op1_type) && op1 != null_pointer_node)
13386         error_found = 1;        /* Error reported further below */
13387
13388       /* The second operand must be a reference type */
13389       if (!JREFERENCE_TYPE_P (op2_type))
13390         {
13391           SET_WFL_OPERATOR (wfl_operator, node, wfl_op2);
13392           parse_error_context
13393             (wfl_operator, "Invalid argument `%s' for `instanceof'",
13394              lang_printable_name (op2_type, 0));
13395           error_found = 1;
13396         }
13397
13398       if (!error_found && valid_ref_assignconv_cast_p (op1_type, op2_type, 1))
13399         {
13400           /* If the first operand is null, the result is always false */
13401           if (op1 == null_pointer_node)
13402             return boolean_false_node;
13403           else if (flag_emit_class_files)
13404             {
13405               TREE_OPERAND (node, 1) = op2_type;
13406               TREE_SIDE_EFFECTS (node) = TREE_SIDE_EFFECTS (op1);
13407               return node;
13408             }
13409           /* Otherwise we have to invoke instance of to figure it out */
13410           else
13411             return build_instanceof (op1, op2_type);
13412         }
13413       /* There is no way the expression operand can be an instance of
13414          the type operand. This is a compile time error. */
13415       else
13416         {
13417           char *t1 = xstrdup (lang_printable_name (op1_type, 0));
13418           SET_WFL_OPERATOR (wfl_operator, node, wfl_op1);
13419           parse_error_context
13420             (wfl_operator, "Impossible for `%s' to be instance of `%s'",
13421              t1, lang_printable_name (op2_type, 0));
13422           free (t1);
13423           error_found = 1;
13424         }
13425
13426       break;
13427
13428       /* 15.21 Bitwise and Logical Operators */
13429     case BIT_AND_EXPR:
13430     case BIT_XOR_EXPR:
13431     case BIT_IOR_EXPR:
13432       if (JINTEGRAL_TYPE_P (op1_type) && JINTEGRAL_TYPE_P (op2_type))
13433         /* Binary numeric promotion is performed on both operand and the
13434            expression retain that type */
13435         prom_type = binary_numeric_promotion (op1_type, op2_type, &op1, &op2);
13436
13437       else if (TREE_CODE (op1_type) == BOOLEAN_TYPE
13438                && TREE_CODE (op1_type) == BOOLEAN_TYPE)
13439         /* The type of the bitwise operator expression is BOOLEAN */
13440         prom_type = boolean_type_node;
13441       else
13442         {
13443           if (!JINTEGRAL_TYPE_P (op1_type))
13444             ERROR_CAST_NEEDED_TO_INTEGRAL (wfl_operator, node, op1_type);
13445           if (!JINTEGRAL_TYPE_P (op2_type) && (op1_type != op2_type))
13446             ERROR_CAST_NEEDED_TO_INTEGRAL (wfl_operator, node, op2_type);
13447           TREE_TYPE (node) = error_mark_node;
13448           error_found = 1;
13449           /* Insert a break here if adding thing before the switch's
13450              break for this case */
13451         }
13452       break;
13453
13454       /* 15.22 Conditional-And Operator */
13455     case TRUTH_ANDIF_EXPR:
13456       /* 15.23 Conditional-Or Operator */
13457     case TRUTH_ORIF_EXPR:
13458       /* Operands must be of BOOLEAN type */
13459       if (TREE_CODE (op1_type) != BOOLEAN_TYPE ||
13460           TREE_CODE (op2_type) != BOOLEAN_TYPE)
13461         {
13462           if (TREE_CODE (op1_type) != BOOLEAN_TYPE)
13463             ERROR_CANT_CONVERT_TO_BOOLEAN (wfl_operator, node, op1_type);
13464           if (TREE_CODE (op2_type) != BOOLEAN_TYPE && (op1_type != op2_type))
13465             ERROR_CANT_CONVERT_TO_BOOLEAN (wfl_operator, node, op2_type);
13466           TREE_TYPE (node) = boolean_type_node;
13467           error_found = 1;
13468           break;
13469         }
13470       else if (integer_zerop (op1))
13471         {
13472           return code == TRUTH_ANDIF_EXPR ? op1 : op2;
13473         }
13474       else if (integer_onep (op1))
13475         {
13476           return code == TRUTH_ANDIF_EXPR ? op2 : op1;
13477         }
13478       /* The type of the conditional operators is BOOLEAN */
13479       prom_type = boolean_type_node;
13480       break;
13481
13482       /* 15.19.1 Numerical Comparison Operators <, <=, >, >= */
13483     case LT_EXPR:
13484     case GT_EXPR:
13485     case LE_EXPR:
13486     case GE_EXPR:
13487       /* The type of each of the operands must be a primitive numeric
13488          type */
13489       if (!JNUMERIC_TYPE_P (op1_type) || ! JNUMERIC_TYPE_P (op2_type))
13490         {
13491           if (!JNUMERIC_TYPE_P (op1_type))
13492             ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op1_type);
13493           if (!JNUMERIC_TYPE_P (op2_type) && (op1_type != op2_type))
13494             ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op2_type);
13495           TREE_TYPE (node) = boolean_type_node;
13496           error_found = 1;
13497           break;
13498         }
13499       /* Binary numeric promotion is performed on the operands */
13500       binary_numeric_promotion (op1_type, op2_type, &op1, &op2);
13501       /* The type of the relation expression is always BOOLEAN */
13502       prom_type = boolean_type_node;
13503       break;
13504
13505       /* 15.20 Equality Operator */
13506     case EQ_EXPR:
13507     case NE_EXPR:
13508       /* It's time for us to patch the strings. */
13509       if ((cn = patch_string (op1)))
13510        {
13511          op1 = cn;
13512          op1_type = TREE_TYPE (op1);
13513        }
13514       if ((cn = patch_string (op2)))
13515        {
13516          op2 = cn;
13517          op2_type = TREE_TYPE (op2);
13518        }
13519
13520       /* 15.20.1 Numerical Equality Operators == and != */
13521       /* Binary numeric promotion is performed on the operands */
13522       if (JNUMERIC_TYPE_P (op1_type) && JNUMERIC_TYPE_P (op2_type))
13523         binary_numeric_promotion (op1_type, op2_type, &op1, &op2);
13524
13525       /* 15.20.2 Boolean Equality Operators == and != */
13526       else if (TREE_CODE (op1_type) == BOOLEAN_TYPE &&
13527           TREE_CODE (op2_type) == BOOLEAN_TYPE)
13528         ;                       /* Nothing to do here */
13529
13530       /* 15.20.3 Reference Equality Operators == and != */
13531       /* Types have to be either references or the null type. If
13532          they're references, it must be possible to convert either
13533          type to the other by casting conversion. */
13534       else if (op1 == null_pointer_node || op2 == null_pointer_node
13535                || (JREFERENCE_TYPE_P (op1_type) && JREFERENCE_TYPE_P (op2_type)
13536                    && (valid_ref_assignconv_cast_p (op1_type, op2_type, 1)
13537                        || valid_ref_assignconv_cast_p (op2_type,
13538                                                        op1_type, 1))))
13539         ;                       /* Nothing to do here */
13540
13541       /* Else we have an error figure what can't be converted into
13542          what and report the error */
13543       else
13544         {
13545           char *t1;
13546           t1 = xstrdup (lang_printable_name (op1_type, 0));
13547           parse_error_context
13548             (wfl_operator,
13549              "Incompatible type for `%s'. Can't convert `%s' to `%s'",
13550              operator_string (node), t1,
13551              lang_printable_name (op2_type, 0));
13552           free (t1);
13553           TREE_TYPE (node) = boolean_type_node;
13554           error_found = 1;
13555           break;
13556         }
13557       prom_type = boolean_type_node;
13558       break;
13559     default:
13560       abort ();
13561     }
13562
13563   if (error_found)
13564     return error_mark_node;
13565
13566   TREE_OPERAND (node, 0) = op1;
13567   TREE_OPERAND (node, 1) = op2;
13568   TREE_TYPE (node) = prom_type;
13569   TREE_SIDE_EFFECTS (node) = TREE_SIDE_EFFECTS (op1) | TREE_SIDE_EFFECTS (op2);
13570
13571   if (flag_emit_xref)
13572     return node;
13573
13574   /* fold does not respect side-effect order as required for Java but not C.
13575    * Also, it sometimes create SAVE_EXPRs which are bad when emitting
13576    * bytecode.
13577    */
13578   if (flag_emit_class_files ? (TREE_CONSTANT (op1) && TREE_CONSTANT (op2))
13579       : ! TREE_SIDE_EFFECTS (node))
13580     node = fold (node);
13581   return node;
13582 }
13583
13584 /* Concatenate the STRING_CST CSTE and STRING. When AFTER is a non
13585    zero value, the value of CSTE comes after the valude of STRING */
13586
13587 static tree
13588 do_merge_string_cste (tree cste, const char *string, int string_len, int after)
13589 {
13590   const char *old = TREE_STRING_POINTER (cste);
13591   int old_len = TREE_STRING_LENGTH (cste);
13592   int len = old_len + string_len;
13593   char *new = alloca (len+1);
13594
13595   if (after)
13596     {
13597       memcpy (new, string, string_len);
13598       memcpy (&new [string_len], old, old_len);
13599     }
13600   else
13601     {
13602       memcpy (new, old, old_len);
13603       memcpy (&new [old_len], string, string_len);
13604     }
13605   new [len] = '\0';
13606   return build_string (len, new);
13607 }
13608
13609 /* Tries to merge OP1 (a STRING_CST) and OP2 (if suitable). Return a
13610    new STRING_CST on success, NULL_TREE on failure.  */
13611
13612 static tree
13613 merge_string_cste (tree op1, tree op2, int after)
13614 {
13615   /* Handle two string constants right away.  */
13616   if (TREE_CODE (op2) == STRING_CST)
13617     return do_merge_string_cste (op1, TREE_STRING_POINTER (op2),
13618                                  TREE_STRING_LENGTH (op2), after);
13619
13620   /* Reasonable integer constant can be treated right away.  */
13621   if (TREE_CODE (op2) == INTEGER_CST && !TREE_CONSTANT_OVERFLOW (op2))
13622     {
13623       static const char *const boolean_true = "true";
13624       static const char *const boolean_false = "false";
13625       static const char *const null_pointer = "null";
13626       char ch[4];
13627       const char *string;
13628
13629       if (op2 == boolean_true_node)
13630         string = boolean_true;
13631       else if (op2 == boolean_false_node)
13632         string = boolean_false;
13633       else if (op2 == null_pointer_node
13634                || (integer_zerop (op2)
13635                    && TREE_CODE (TREE_TYPE (op2)) == POINTER_TYPE))
13636         /* FIXME: null is not a compile-time constant, so it is only safe to
13637            merge if the overall expression is non-constant. However, this
13638            code always merges without checking the overall expression.  */
13639         string = null_pointer;
13640       else if (TREE_TYPE (op2) == char_type_node)
13641         {
13642           /* Convert the character into UTF-8.  */
13643           unsigned int c = (unsigned int) TREE_INT_CST_LOW (op2);
13644           unsigned char *p = (unsigned char *) ch;
13645           if (0x01 <= c && c <= 0x7f)
13646             *p++ = (unsigned char) c;
13647           else if (c < 0x7ff)
13648             {
13649               *p++ = (unsigned char) (c >> 6 | 0xc0);
13650               *p++ = (unsigned char) ((c & 0x3f) | 0x80);
13651             }
13652           else
13653             {
13654               *p++ = (unsigned char) (c >> 12 | 0xe0);
13655               *p++ = (unsigned char) (((c >> 6) & 0x3f) | 0x80);
13656               *p++ = (unsigned char) ((c & 0x3f) | 0x80);
13657             }
13658           *p = '\0';
13659
13660           string = ch;
13661         }
13662       else
13663         string = string_convert_int_cst (op2);
13664
13665       return do_merge_string_cste (op1, string, strlen (string), after);
13666     }
13667   return NULL_TREE;
13668 }
13669
13670 /* Tries to statically concatenate OP1 and OP2 if possible. Either one
13671    has to be a STRING_CST and the other part must be a STRING_CST or a
13672    INTEGRAL constant. Return a new STRING_CST if the operation
13673    succeed, NULL_TREE otherwise.
13674
13675    If the case we want to optimize for space, we might want to return
13676    NULL_TREE for each invocation of this routine. FIXME */
13677
13678 static tree
13679 string_constant_concatenation (tree op1, tree op2)
13680 {
13681   if (TREE_CODE (op1) == STRING_CST || (TREE_CODE (op2) == STRING_CST))
13682     {
13683       tree string, rest;
13684       int invert;
13685
13686       string = (TREE_CODE (op1) == STRING_CST ? op1 : op2);
13687       rest   = (string == op1 ? op2 : op1);
13688       invert = (string == op1 ? 0 : 1 );
13689
13690       /* Walk REST, only if it looks reasonable */
13691       if (TREE_CODE (rest) != STRING_CST
13692           && !IS_CRAFTED_STRING_BUFFER_P (rest)
13693           && !JSTRING_TYPE_P (TREE_TYPE (rest))
13694           && TREE_CODE (rest) == EXPR_WITH_FILE_LOCATION)
13695         {
13696           rest = java_complete_tree (rest);
13697           if (rest == error_mark_node)
13698             return error_mark_node;
13699           rest = fold (rest);
13700         }
13701       return merge_string_cste (string, rest, invert);
13702     }
13703   return NULL_TREE;
13704 }
13705
13706 /* Implement the `+' operator. Does static optimization if possible,
13707    otherwise create (if necessary) and append elements to a
13708    StringBuffer. The StringBuffer will be carried around until it is
13709    used for a function call or an assignment. Then toString() will be
13710    called on it to turn it into a String object. */
13711
13712 static tree
13713 build_string_concatenation (tree op1, tree op2)
13714 {
13715   tree result;
13716   int side_effects = TREE_SIDE_EFFECTS (op1) | TREE_SIDE_EFFECTS (op2);
13717
13718   if (flag_emit_xref)
13719     return build (PLUS_EXPR, string_type_node, op1, op2);
13720
13721   /* Try to do some static optimization */
13722   if ((result = string_constant_concatenation (op1, op2)))
13723     return result;
13724
13725   /* Discard empty strings on either side of the expression */
13726   if (TREE_CODE (op1) == STRING_CST && TREE_STRING_LENGTH (op1) == 0)
13727     {
13728       op1 = op2;
13729       op2 = NULL_TREE;
13730     }
13731   else if (TREE_CODE (op2) == STRING_CST && TREE_STRING_LENGTH (op2) == 0)
13732     op2 = NULL_TREE;
13733
13734   /* If operands are string constant, turn then into object references */
13735   if (TREE_CODE (op1) == STRING_CST)
13736     op1 = patch_string_cst (op1);
13737   if (op2 && TREE_CODE (op2) == STRING_CST)
13738     op2 = patch_string_cst (op2);
13739
13740   /* If either one of the constant is null and the other non null
13741      operand is a String constant, return it. */
13742   if ((TREE_CODE (op1) == STRING_CST) && !op2)
13743     return op1;
13744
13745   /* If OP1 isn't already a StringBuffer, create and
13746      initialize a new one */
13747   if (!IS_CRAFTED_STRING_BUFFER_P (op1))
13748     {
13749       /* Two solutions here:
13750          1) OP1 is a constant string reference, we call new StringBuffer(OP1)
13751          2) OP1 is something else, we call new StringBuffer().append(OP1).  */
13752       if (TREE_CONSTANT (op1) && JSTRING_TYPE_P (TREE_TYPE (op1)))
13753         op1 = BUILD_STRING_BUFFER (op1);
13754       else
13755         {
13756           tree aNew = BUILD_STRING_BUFFER (NULL_TREE);
13757           op1 = make_qualified_primary (aNew, BUILD_APPEND (op1), 0);
13758         }
13759     }
13760
13761   if (op2)
13762     {
13763       /* OP1 is no longer the last node holding a crafted StringBuffer */
13764       IS_CRAFTED_STRING_BUFFER_P (op1) = 0;
13765       /* Create a node for `{new...,xxx}.append (op2)' */
13766       if (op2)
13767         op1 = make_qualified_primary (op1, BUILD_APPEND (op2), 0);
13768     }
13769
13770   /* Mark the last node holding a crafted StringBuffer */
13771   IS_CRAFTED_STRING_BUFFER_P (op1) = 1;
13772
13773   TREE_SIDE_EFFECTS (op1) = side_effects;
13774   return op1;
13775 }
13776
13777 /* Patch the string node NODE. NODE can be a STRING_CST of a crafted
13778    StringBuffer. If no string were found to be patched, return
13779    NULL. */
13780
13781 static tree
13782 patch_string (tree node)
13783 {
13784   if (node == error_mark_node)
13785     return error_mark_node;
13786   if (TREE_CODE (node) == STRING_CST)
13787     return patch_string_cst (node);
13788   else if (IS_CRAFTED_STRING_BUFFER_P (node))
13789     {
13790       int saved = ctxp->explicit_constructor_p;
13791       tree invoke = build_method_invocation (wfl_to_string, NULL_TREE);
13792       tree ret;
13793       /* Temporary disable forbid the use of `this'. */
13794       ctxp->explicit_constructor_p = 0;
13795       ret = java_complete_tree (make_qualified_primary (node, invoke, 0));
13796       /* String concatenation arguments must be evaluated in order too. */
13797       ret = force_evaluation_order (ret);
13798       /* Restore it at its previous value */
13799       ctxp->explicit_constructor_p = saved;
13800       return ret;
13801     }
13802   return NULL_TREE;
13803 }
13804
13805 /* Build the internal representation of a string constant.  */
13806
13807 static tree
13808 patch_string_cst (tree node)
13809 {
13810   int location;
13811   if (! flag_emit_class_files)
13812     {
13813       node = get_identifier (TREE_STRING_POINTER (node));
13814       location = alloc_name_constant (CONSTANT_String, node);
13815       node = build_ref_from_constant_pool (location);
13816     }
13817   TREE_CONSTANT (node) = 1;
13818   TREE_INVARIANT (node) = 1;
13819
13820   /* ??? Guessing that the class file code can't handle casts.  */
13821   if (! flag_emit_class_files)
13822     node = convert (string_ptr_type_node, node);
13823   else
13824     TREE_TYPE (node) = string_ptr_type_node;
13825
13826   return node;
13827 }
13828
13829 /* Build an incomplete unary operator expression. */
13830
13831 static tree
13832 build_unaryop (int op_token, int op_location, tree op1)
13833 {
13834   enum tree_code op;
13835   tree unaryop;
13836   switch (op_token)
13837     {
13838     case PLUS_TK: op = UNARY_PLUS_EXPR; break;
13839     case MINUS_TK: op = NEGATE_EXPR; break;
13840     case NEG_TK: op = TRUTH_NOT_EXPR; break;
13841     case NOT_TK: op = BIT_NOT_EXPR; break;
13842     default: abort ();
13843     }
13844
13845   unaryop = build1 (op, NULL_TREE, op1);
13846   TREE_SIDE_EFFECTS (unaryop) = 1;
13847   /* Store the location of the operator, for better error report. The
13848      string of the operator will be rebuild based on the OP value. */
13849   EXPR_WFL_LINECOL (unaryop) = op_location;
13850   return unaryop;
13851 }
13852
13853 /* Special case for the ++/-- operators, since they require an extra
13854    argument to build, which is set to NULL and patched
13855    later. IS_POST_P is 1 if the operator, 0 otherwise.  */
13856
13857 static tree
13858 build_incdec (int op_token, int op_location, tree op1, int is_post_p)
13859 {
13860   static const enum tree_code lookup [2][2] =
13861     {
13862       { PREDECREMENT_EXPR, PREINCREMENT_EXPR, },
13863       { POSTDECREMENT_EXPR, POSTINCREMENT_EXPR, },
13864     };
13865   tree node = build (lookup [is_post_p][(op_token - DECR_TK)],
13866                      NULL_TREE, op1, NULL_TREE);
13867   TREE_SIDE_EFFECTS (node) = 1;
13868   /* Store the location of the operator, for better error report. The
13869      string of the operator will be rebuild based on the OP value. */
13870   EXPR_WFL_LINECOL (node) = op_location;
13871   return node;
13872 }
13873
13874 /* Build an incomplete cast operator, based on the use of the
13875    CONVERT_EXPR. Note that TREE_TYPE of the constructed node is
13876    set. java_complete_tree is trained to walk a CONVERT_EXPR even
13877    though its type is already set.  */
13878
13879 static tree
13880 build_cast (int location, tree type, tree exp)
13881 {
13882   tree node = build1 (CONVERT_EXPR, type, exp);
13883   EXPR_WFL_LINECOL (node) = location;
13884   return node;
13885 }
13886
13887 /* Build an incomplete class reference operator.  */
13888 static tree
13889 build_incomplete_class_ref (int location, tree class_name)
13890 {
13891   tree node = build1 (CLASS_LITERAL, NULL_TREE, class_name);
13892   tree class_decl = GET_CPC ();
13893   tree this_class = TREE_TYPE (class_decl);
13894
13895   /* Generate the synthetic static method `class$'.  (Previously we
13896      deferred this, causing different method tables to be emitted
13897      for native code and bytecode.)  */
13898   if (!TYPE_DOT_CLASS (this_class)
13899       && !JPRIMITIVE_TYPE_P (class_name)
13900       && !(TREE_CODE (class_name) == VOID_TYPE))
13901     {
13902       tree cpc_list = GET_CPC_LIST();
13903       tree cpc = cpc_list;
13904       tree target_class;
13905
13906       /* For inner classes, add a 'class$' method to their outermost
13907          context, creating it if necessary.  */
13908
13909       while (GET_NEXT_ENCLOSING_CPC(cpc))
13910         cpc = GET_NEXT_ENCLOSING_CPC(cpc);
13911       class_decl = TREE_VALUE (cpc);
13912
13913       target_class = TREE_TYPE (class_decl);
13914
13915       if (CLASS_INTERFACE (TYPE_NAME (target_class)))
13916         {
13917           /* For interfaces, adding a static 'class$' method directly
13918              is illegal.  So create an inner class to contain the new
13919              method.  Empirically this matches the behavior of javac.  */
13920           tree t, inner;
13921           /* We want the generated inner class inside the outermost class. */
13922           GET_CPC_LIST() = cpc;
13923           t = build_wfl_node (DECL_NAME (TYPE_NAME (object_type_node)));
13924           inner = create_anonymous_class (0, t);
13925           target_class = TREE_TYPE (inner);
13926           end_class_declaration (1);
13927           GET_CPC_LIST() = cpc_list;
13928         }
13929
13930       if (TYPE_DOT_CLASS (target_class) == NULL_TREE)
13931         build_dot_class_method (target_class);
13932
13933       if (this_class != target_class)
13934         TYPE_DOT_CLASS (this_class) = TYPE_DOT_CLASS (target_class);
13935     }
13936
13937   EXPR_WFL_LINECOL (node) = location;
13938   return node;
13939 }
13940
13941 /* Complete an incomplete class reference operator.  */
13942 static tree
13943 patch_incomplete_class_ref (tree node)
13944 {
13945   tree type = TREE_OPERAND (node, 0);
13946   tree ref_type;
13947
13948   if (!(ref_type = resolve_type_during_patch (type)))
13949     return error_mark_node;
13950
13951   /* If we're not emitting class files and we know ref_type is a
13952      compiled class, build a direct reference.  */
13953   if ((! flag_emit_class_files && is_compiled_class (ref_type))
13954       || JPRIMITIVE_TYPE_P (ref_type)
13955       || TREE_CODE (ref_type) == VOID_TYPE)
13956     {
13957       tree dot = build_class_ref (ref_type);
13958       /* A class referenced by `foo.class' is initialized.  */
13959       if (!flag_emit_class_files)
13960        dot = build_class_init (ref_type, dot);
13961       return java_complete_tree (dot);
13962     }
13963
13964   /* If we're emitting class files and we have to deal with non
13965      primitive types, we invoke the synthetic static method `class$'.  */
13966   ref_type = build_dot_class_method_invocation (current_class, ref_type);
13967   return java_complete_tree (ref_type);
13968 }
13969
13970 /* 15.14 Unary operators. We return error_mark_node in case of error,
13971    but preserve the type of NODE if the type is fixed.  */
13972
13973 static tree
13974 patch_unaryop (tree node, tree wfl_op)
13975 {
13976   tree op = TREE_OPERAND (node, 0);
13977   tree op_type = TREE_TYPE (op);
13978   tree prom_type = NULL_TREE, value, decl;
13979   int outer_field_flag = 0;
13980   int code = TREE_CODE (node);
13981   int error_found = 0;
13982
13983   EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
13984
13985   switch (code)
13986     {
13987       /* 15.13.2 Postfix Increment Operator ++ */
13988     case POSTINCREMENT_EXPR:
13989       /* 15.13.3 Postfix Increment Operator -- */
13990     case POSTDECREMENT_EXPR:
13991       /* 15.14.1 Prefix Increment Operator ++ */
13992     case PREINCREMENT_EXPR:
13993       /* 15.14.2 Prefix Decrement Operator -- */
13994     case PREDECREMENT_EXPR:
13995       op = decl = strip_out_static_field_access_decl (op);
13996       outer_field_flag = outer_field_expanded_access_p (op, NULL, NULL, NULL);
13997       /* We might be trying to change an outer field accessed using
13998          access method. */
13999       if (outer_field_flag)
14000         {
14001           /* Retrieve the decl of the field we're trying to access. We
14002              do that by first retrieving the function we would call to
14003              access the field. It has been already verified that this
14004              field isn't final */
14005           if (flag_emit_class_files)
14006             decl = TREE_OPERAND (op, 0);
14007           else
14008             decl = TREE_OPERAND (TREE_OPERAND (TREE_OPERAND (op, 0), 0), 0);
14009           decl = DECL_FUNCTION_ACCESS_DECL (decl);
14010         }
14011       /* We really should have a JAVA_ARRAY_EXPR to avoid this */
14012       else if (!JDECL_P (decl)
14013           && TREE_CODE (decl) != COMPONENT_REF
14014           && !(flag_emit_class_files && TREE_CODE (decl) == ARRAY_REF)
14015           && TREE_CODE (decl) != INDIRECT_REF
14016           && !(TREE_CODE (decl) == COMPOUND_EXPR
14017                && TREE_OPERAND (decl, 1)
14018                && (TREE_CODE (TREE_OPERAND (decl, 1)) == INDIRECT_REF)))
14019         {
14020           TREE_TYPE (node) = error_mark_node;
14021           error_found = 1;
14022         }
14023
14024       /* From now on, we know that op if a variable and that it has a
14025          valid wfl. We use wfl_op to locate errors related to the
14026          ++/-- operand. */
14027       if (!JNUMERIC_TYPE_P (op_type))
14028         {
14029           parse_error_context
14030             (wfl_op, "Invalid argument type `%s' to `%s'",
14031              lang_printable_name (op_type, 0), operator_string (node));
14032           TREE_TYPE (node) = error_mark_node;
14033           error_found = 1;
14034         }
14035       else
14036         {
14037           /* Before the addition, binary numeric promotion is performed on
14038              both operands, if really necessary */
14039           if (JINTEGRAL_TYPE_P (op_type))
14040             {
14041               value = build_int_2 (1, 0);
14042               TREE_TYPE (value) = TREE_TYPE (node) = op_type;
14043             }
14044           else
14045             {
14046               value = build_int_2 (1, 0);
14047               TREE_TYPE (node) =
14048                 binary_numeric_promotion (op_type,
14049                                           TREE_TYPE (value), &op, &value);
14050             }
14051
14052           /* We remember we might be accessing an outer field */
14053           if (outer_field_flag)
14054             {
14055               /* We re-generate an access to the field */
14056               value = build (PLUS_EXPR, TREE_TYPE (op),
14057                              build_outer_field_access (wfl_op, decl), value);
14058
14059               /* And we patch the original access$() into a write
14060                  with plus_op as a rhs */
14061               return outer_field_access_fix (node, op, value);
14062             }
14063
14064           /* And write back into the node. */
14065           TREE_OPERAND (node, 0) = op;
14066           TREE_OPERAND (node, 1) = value;
14067           /* Convert the overall back into its original type, if
14068              necessary, and return */
14069           if (JINTEGRAL_TYPE_P (op_type))
14070             return fold (node);
14071           else
14072             return fold (convert (op_type, node));
14073         }
14074       break;
14075
14076       /* 15.14.3 Unary Plus Operator + */
14077     case UNARY_PLUS_EXPR:
14078       /* 15.14.4 Unary Minus Operator - */
14079     case NEGATE_EXPR:
14080       if (!JNUMERIC_TYPE_P (op_type))
14081         {
14082           ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op_type);
14083           TREE_TYPE (node) = error_mark_node;
14084           error_found = 1;
14085         }
14086       /* Unary numeric promotion is performed on operand */
14087       else
14088         {
14089           op = do_unary_numeric_promotion (op);
14090           prom_type = TREE_TYPE (op);
14091           if (code == UNARY_PLUS_EXPR)
14092             return fold (op);
14093         }
14094       break;
14095
14096       /* 15.14.5 Bitwise Complement Operator ~ */
14097     case BIT_NOT_EXPR:
14098       if (!JINTEGRAL_TYPE_P (op_type))
14099         {
14100           ERROR_CAST_NEEDED_TO_INTEGRAL (wfl_operator, node, op_type);
14101           TREE_TYPE (node) = error_mark_node;
14102           error_found = 1;
14103         }
14104       else
14105         {
14106           op = do_unary_numeric_promotion (op);
14107           prom_type = TREE_TYPE (op);
14108         }
14109       break;
14110
14111       /* 15.14.6 Logical Complement Operator ! */
14112     case TRUTH_NOT_EXPR:
14113       if (TREE_CODE (op_type) != BOOLEAN_TYPE)
14114         {
14115           ERROR_CANT_CONVERT_TO_BOOLEAN (wfl_operator, node, op_type);
14116           /* But the type is known. We will report an error if further
14117              attempt of a assignment is made with this rhs */
14118           TREE_TYPE (node) = boolean_type_node;
14119           error_found = 1;
14120         }
14121       else
14122         prom_type = boolean_type_node;
14123       break;
14124
14125       /* 15.15 Cast Expression */
14126     case CONVERT_EXPR:
14127       value = patch_cast (node, wfl_operator);
14128       if (value == error_mark_node)
14129         {
14130           /* If this cast is part of an assignment, we tell the code
14131              that deals with it not to complain about a mismatch,
14132              because things have been cast, anyways */
14133           TREE_TYPE (node) = error_mark_node;
14134           error_found = 1;
14135         }
14136       else
14137         {
14138           value = fold (value);
14139           TREE_SIDE_EFFECTS (value) = TREE_SIDE_EFFECTS (op);
14140           return value;
14141         }
14142       break;
14143     }
14144
14145   if (error_found)
14146     return error_mark_node;
14147
14148   /* There are cases where node has been replaced by something else
14149      and we don't end up returning here: UNARY_PLUS_EXPR,
14150      CONVERT_EXPR, {POST,PRE}{INCR,DECR}EMENT_EXPR. */
14151   TREE_OPERAND (node, 0) = fold (op);
14152   TREE_TYPE (node) = prom_type;
14153   TREE_SIDE_EFFECTS (node) = TREE_SIDE_EFFECTS (op);
14154   return fold (node);
14155 }
14156
14157 /* Generic type resolution that sometimes takes place during node
14158    patching. Returned the resolved type or generate an error
14159    message. Return the resolved type or NULL_TREE.  */
14160
14161 static tree
14162 resolve_type_during_patch (tree type)
14163 {
14164   if (unresolved_type_p (type, NULL))
14165     {
14166       tree type_decl = resolve_and_layout (EXPR_WFL_NODE (type), type);
14167       if (!type_decl)
14168         {
14169           parse_error_context (type,
14170                                "Class `%s' not found in type declaration",
14171                                IDENTIFIER_POINTER (EXPR_WFL_NODE (type)));
14172           return NULL_TREE;
14173         }
14174
14175       check_deprecation (type, type_decl);
14176
14177       return TREE_TYPE (type_decl);
14178     }
14179   return type;
14180 }
14181
14182 /* 5.5 Casting Conversion. error_mark_node is returned if an error is
14183    found. Otherwise NODE or something meant to replace it is returned.  */
14184
14185 static tree
14186 patch_cast (tree node, tree wfl_op)
14187 {
14188   tree op = TREE_OPERAND (node, 0);
14189   tree cast_type = TREE_TYPE (node);
14190   tree patched, op_type;
14191   char *t1;
14192
14193   /* Some string patching might be necessary at this stage */
14194   if ((patched = patch_string (op)))
14195     TREE_OPERAND (node, 0) = op = patched;
14196   op_type = TREE_TYPE (op);
14197
14198   /* First resolve OP_TYPE if unresolved */
14199   if (!(cast_type = resolve_type_during_patch (cast_type)))
14200     return error_mark_node;
14201
14202   /* Check on cast that are proven correct at compile time */
14203   if (JNUMERIC_TYPE_P (cast_type) && JNUMERIC_TYPE_P (op_type))
14204     {
14205       /* Same type */
14206       if (cast_type == op_type)
14207         return node;
14208
14209       /* A narrowing conversion from a floating-point number to an
14210          integral type requires special handling (5.1.3).  */
14211       if (JFLOAT_TYPE_P (op_type) && JINTEGRAL_TYPE_P (cast_type))
14212         if (cast_type != long_type_node)
14213           op = convert (integer_type_node, op);
14214
14215       /* Try widening/narrowing conversion.  Potentially, things need
14216          to be worked out in gcc so we implement the extreme cases
14217          correctly.  fold_convert() needs to be fixed.  */
14218       return convert (cast_type, op);
14219     }
14220
14221   /* It's also valid to cast a boolean into a boolean */
14222   if (op_type == boolean_type_node && cast_type == boolean_type_node)
14223     return node;
14224
14225   /* null can be casted to references */
14226   if (op == null_pointer_node && JREFERENCE_TYPE_P (cast_type))
14227     return build_null_of_type (cast_type);
14228
14229   /* The remaining legal casts involve conversion between reference
14230      types. Check for their compile time correctness. */
14231   if (JREFERENCE_TYPE_P (op_type) && JREFERENCE_TYPE_P (cast_type)
14232       && valid_ref_assignconv_cast_p (op_type, cast_type, 1))
14233     {
14234       TREE_TYPE (node) = promote_type (cast_type);
14235       /* Now, the case can be determined correct at compile time if
14236          OP_TYPE can be converted into CAST_TYPE by assignment
14237          conversion (5.2) */
14238
14239       if (valid_ref_assignconv_cast_p (op_type, cast_type, 0))
14240         {
14241           TREE_SET_CODE (node, NOP_EXPR);
14242           return node;
14243         }
14244
14245       if (flag_emit_class_files)
14246         {
14247           TREE_SET_CODE (node, CONVERT_EXPR);
14248           return node;
14249         }
14250
14251       /* The cast requires a run-time check */
14252       return build (CALL_EXPR, promote_type (cast_type),
14253                     build_address_of (soft_checkcast_node),
14254                     tree_cons (NULL_TREE, build_class_ref (cast_type),
14255                                build_tree_list (NULL_TREE, op)),
14256                     NULL_TREE);
14257     }
14258
14259   /* Any other casts are proven incorrect at compile time */
14260   t1 = xstrdup (lang_printable_name (op_type, 0));
14261   parse_error_context (wfl_op, "Invalid cast from `%s' to `%s'",
14262                        t1, lang_printable_name (cast_type, 0));
14263   free (t1);
14264   return error_mark_node;
14265 }
14266
14267 /* Build a null constant and give it the type TYPE.  */
14268
14269 static tree
14270 build_null_of_type (tree type)
14271 {
14272   tree node = build_int_2 (0, 0);
14273   TREE_TYPE (node) = promote_type (type);
14274   return node;
14275 }
14276
14277 /* Build an ARRAY_REF incomplete tree node. Note that operand 1 isn't
14278    a list of indices. */
14279 static tree
14280 build_array_ref (int location, tree array, tree index)
14281 {
14282   tree node = build (ARRAY_REF, NULL_TREE, array, index, NULL_TREE, NULL_TREE);
14283   EXPR_WFL_LINECOL (node) = location;
14284   return node;
14285 }
14286
14287 /* 15.12 Array Access Expression */
14288
14289 static tree
14290 patch_array_ref (tree node)
14291 {
14292   tree array = TREE_OPERAND (node, 0);
14293   tree array_type  = TREE_TYPE (array);
14294   tree index = TREE_OPERAND (node, 1);
14295   tree index_type = TREE_TYPE (index);
14296   int error_found = 0;
14297
14298   EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
14299
14300   if (TREE_CODE (array_type) == POINTER_TYPE)
14301     array_type = TREE_TYPE (array_type);
14302
14303   /* The array reference must be an array */
14304   if (!TYPE_ARRAY_P (array_type))
14305     {
14306       parse_error_context
14307         (wfl_operator,
14308          "`[]' can only be applied to arrays. It can't be applied to `%s'",
14309          lang_printable_name (array_type, 0));
14310       TREE_TYPE (node) = error_mark_node;
14311       error_found = 1;
14312     }
14313
14314   /* The array index undergoes unary numeric promotion. The promoted
14315      type must be int */
14316   index = do_unary_numeric_promotion (index);
14317   if (TREE_TYPE (index) != int_type_node)
14318     {
14319       if (valid_cast_to_p (index_type, int_type_node))
14320         parse_error_context (wfl_operator,
14321    "Incompatible type for `[]'. Explicit cast needed to convert `%s' to `int'",
14322                              lang_printable_name (index_type, 0));
14323       else
14324         parse_error_context (wfl_operator,
14325           "Incompatible type for `[]'. Can't convert `%s' to `int'",
14326                              lang_printable_name (index_type, 0));
14327       TREE_TYPE (node) = error_mark_node;
14328       error_found = 1;
14329     }
14330
14331   if (error_found)
14332     return error_mark_node;
14333
14334   array_type = TYPE_ARRAY_ELEMENT (array_type);
14335
14336   if (flag_emit_class_files || flag_emit_xref)
14337     {
14338       TREE_OPERAND (node, 0) = array;
14339       TREE_OPERAND (node, 1) = index;
14340     }
14341   else
14342     node = build_java_arrayaccess (array, array_type, index);
14343   TREE_TYPE (node) = array_type;
14344   return node;
14345 }
14346
14347 /* 15.9 Array Creation Expressions */
14348
14349 static tree
14350 build_newarray_node (tree type, tree dims, int extra_dims)
14351 {
14352   tree node =
14353     build (NEW_ARRAY_EXPR, NULL_TREE, type, nreverse (dims),
14354            build_int_2 (extra_dims, 0));
14355   return node;
14356 }
14357
14358 static tree
14359 patch_newarray (tree node)
14360 {
14361   tree type = TREE_OPERAND (node, 0);
14362   tree dims = TREE_OPERAND (node, 1);
14363   tree cdim, array_type;
14364   int error_found = 0;
14365   int ndims = 0;
14366   int xdims = TREE_INT_CST_LOW (TREE_OPERAND (node, 2));
14367
14368   /* Dimension types are verified. It's better for the types to be
14369      verified in order. */
14370   for (cdim = dims, ndims = 0; cdim; cdim = TREE_CHAIN (cdim), ndims++ )
14371     {
14372       int dim_error = 0;
14373       tree dim = TREE_VALUE (cdim);
14374
14375       /* Dim might have been saved during its evaluation */
14376       dim = (TREE_CODE (dim) == SAVE_EXPR ? TREE_OPERAND (dim, 0) : dim);
14377
14378       /* The type of each specified dimension must be an integral type. */
14379       if (!JINTEGRAL_TYPE_P (TREE_TYPE (dim)))
14380         dim_error = 1;
14381
14382       /* Each expression undergoes an unary numeric promotion (5.6.1) and the
14383          promoted type must be int. */
14384       else
14385         {
14386           dim = do_unary_numeric_promotion (dim);
14387           if (TREE_TYPE (dim) != int_type_node)
14388             dim_error = 1;
14389         }
14390
14391       /* Report errors on types here */
14392       if (dim_error)
14393         {
14394           parse_error_context
14395             (TREE_PURPOSE (cdim),
14396              "Incompatible type for dimension in array creation expression. %s convert `%s' to `int'",
14397              (valid_cast_to_p (TREE_TYPE (dim), int_type_node) ?
14398               "Explicit cast needed to" : "Can't"),
14399              lang_printable_name (TREE_TYPE (dim), 0));
14400           error_found = 1;
14401         }
14402
14403       TREE_PURPOSE (cdim) = NULL_TREE;
14404     }
14405
14406   /* Resolve array base type if unresolved */
14407   if (!(type = resolve_type_during_patch (type)))
14408     error_found = 1;
14409
14410   if (error_found)
14411     {
14412       /* We don't want further evaluation of this bogus array creation
14413          operation */
14414       TREE_TYPE (node) = error_mark_node;
14415       return error_mark_node;
14416     }
14417
14418   /* Set array_type to the actual (promoted) array type of the result. */
14419   if (TREE_CODE (type) == RECORD_TYPE)
14420     type = build_pointer_type (type);
14421   while (--xdims >= 0)
14422     {
14423       type = promote_type (build_java_array_type (type, -1));
14424     }
14425   dims = nreverse (dims);
14426   array_type = type;
14427   for (cdim = dims; cdim; cdim = TREE_CHAIN (cdim))
14428     {
14429       type = array_type;
14430       array_type
14431         = build_java_array_type (type,
14432                                  TREE_CODE (cdim) == INTEGER_CST
14433                                  ? (HOST_WIDE_INT) TREE_INT_CST_LOW (cdim)
14434                                  : -1);
14435       array_type = promote_type (array_type);
14436     }
14437   dims = nreverse (dims);
14438
14439   /* The node is transformed into a function call. Things are done
14440      differently according to the number of dimensions. If the number
14441      of dimension is equal to 1, then the nature of the base type
14442      (primitive or not) matters. */
14443   if (ndims == 1)
14444     return build_new_array (type, TREE_VALUE (dims));
14445
14446   /* Can't reuse what's already written in expr.c because it uses the
14447      JVM stack representation. Provide a build_multianewarray. FIXME */
14448   return build (CALL_EXPR, array_type,
14449                 build_address_of (soft_multianewarray_node),
14450                 tree_cons (NULL_TREE, build_class_ref (TREE_TYPE (array_type)),
14451                            tree_cons (NULL_TREE,
14452                                       build_int_2 (ndims, 0), dims )),
14453                 NULL_TREE);
14454 }
14455
14456 /* 10.6 Array initializer.  */
14457
14458 /* Build a wfl for array element that don't have one, so we can
14459    pin-point errors.  */
14460
14461 static tree
14462 maybe_build_array_element_wfl (tree node)
14463 {
14464   if (TREE_CODE (node) != EXPR_WITH_FILE_LOCATION)
14465     return build_expr_wfl (NULL_TREE, ctxp->filename,
14466                            ctxp->elc.line, ctxp->elc.prev_col);
14467   else
14468     return NULL_TREE;
14469 }
14470
14471 /* Build a NEW_ARRAY_INIT that features a CONSTRUCTOR node. This makes
14472    identification of initialized arrays easier to detect during walk
14473    and expansion.  */
14474
14475 static tree
14476 build_new_array_init (int location, tree values)
14477 {
14478   tree constructor = build_constructor (NULL_TREE, values);
14479   tree to_return = build1 (NEW_ARRAY_INIT, NULL_TREE, constructor);
14480   EXPR_WFL_LINECOL (to_return) = location;
14481   return to_return;
14482 }
14483
14484 /* Expand a NEW_ARRAY_INIT node. Return error_mark_node if an error
14485    occurred.  Otherwise return NODE after having set its type
14486    appropriately.  */
14487
14488 static tree
14489 patch_new_array_init (tree type, tree node)
14490 {
14491   int error_seen = 0;
14492   tree current, element_type;
14493   HOST_WIDE_INT length;
14494   int all_constant = 1;
14495   tree init = TREE_OPERAND (node, 0);
14496
14497   if (TREE_CODE (type) != POINTER_TYPE || ! TYPE_ARRAY_P (TREE_TYPE (type)))
14498     {
14499       parse_error_context (node,
14500                            "Invalid array initializer for non-array type `%s'",
14501                            lang_printable_name (type, 1));
14502       return error_mark_node;
14503     }
14504   type = TREE_TYPE (type);
14505   element_type = TYPE_ARRAY_ELEMENT (type);
14506
14507   CONSTRUCTOR_ELTS (init) = nreverse (CONSTRUCTOR_ELTS (init));
14508
14509   for (length = 0, current = CONSTRUCTOR_ELTS (init);
14510        current;  length++, current = TREE_CHAIN (current))
14511     {
14512       tree elt = TREE_VALUE (current);
14513       if (elt == NULL_TREE || TREE_CODE (elt) != NEW_ARRAY_INIT)
14514         {
14515           error_seen |= array_constructor_check_entry (element_type, current);
14516           elt = TREE_VALUE (current);
14517           /* When compiling to native code, STRING_CST is converted to
14518              INDIRECT_REF, but still with a TREE_CONSTANT flag. */
14519           if (! TREE_CONSTANT (elt) || TREE_CODE (elt) == INDIRECT_REF)
14520             all_constant = 0;
14521         }
14522       else
14523         {
14524           TREE_VALUE (current) = patch_new_array_init (element_type, elt);
14525           TREE_PURPOSE (current) = NULL_TREE;
14526           all_constant = 0;
14527         }
14528       if (elt && TREE_CODE (elt) == TREE_LIST
14529           && TREE_VALUE (elt) == error_mark_node)
14530         error_seen = 1;
14531     }
14532
14533   if (error_seen)
14534     return error_mark_node;
14535
14536   /* Create a new type. We can't reuse the one we have here by
14537      patching its dimension because it originally is of dimension -1
14538      hence reused by gcc. This would prevent triangular arrays. */
14539   type = build_java_array_type (element_type, length);
14540   TREE_TYPE (init) = TREE_TYPE (TREE_CHAIN (TREE_CHAIN (TYPE_FIELDS (type))));
14541   TREE_TYPE (node) = promote_type (type);
14542   TREE_CONSTANT (init) = all_constant;
14543   TREE_INVARIANT (init) = all_constant;
14544   TREE_CONSTANT (node) = all_constant;
14545   TREE_INVARIANT (node) = all_constant;
14546   return node;
14547 }
14548
14549 /* Verify that one entry of the initializer element list can be
14550    assigned to the array base type. Report 1 if an error occurred, 0
14551    otherwise.  */
14552
14553 static int
14554 array_constructor_check_entry (tree type, tree entry)
14555 {
14556   char *array_type_string = NULL;       /* For error reports */
14557   tree value, type_value, new_value, wfl_value, patched;
14558   int error_seen = 0;
14559
14560   new_value = NULL_TREE;
14561   wfl_value = TREE_VALUE (entry);
14562
14563   value = java_complete_tree (TREE_VALUE (entry));
14564   /* patch_string return error_mark_node if arg is error_mark_node */
14565   if ((patched = patch_string (value)))
14566     value = patched;
14567   if (value == error_mark_node)
14568     return 1;
14569
14570   type_value = TREE_TYPE (value);
14571
14572   /* At anytime, try_builtin_assignconv can report a warning on
14573      constant overflow during narrowing. */
14574   SET_WFL_OPERATOR (wfl_operator, TREE_PURPOSE (entry), wfl_value);
14575   new_value = try_builtin_assignconv (wfl_operator, type, value);
14576   if (!new_value && (new_value = try_reference_assignconv (type, value)))
14577     type_value = promote_type (type);
14578
14579   /* Check and report errors */
14580   if (!new_value)
14581     {
14582       const char *const msg = (!valid_cast_to_p (type_value, type) ?
14583                    "Can't" : "Explicit cast needed to");
14584       if (!array_type_string)
14585         array_type_string = xstrdup (lang_printable_name (type, 1));
14586       parse_error_context
14587         (wfl_operator, "Incompatible type for array. %s convert `%s' to `%s'",
14588          msg, lang_printable_name (type_value, 1), array_type_string);
14589       error_seen = 1;
14590     }
14591
14592   if (new_value)
14593     TREE_VALUE (entry) = new_value;
14594
14595   if (array_type_string)
14596     free (array_type_string);
14597
14598   TREE_PURPOSE (entry) = NULL_TREE;
14599   return error_seen;
14600 }
14601
14602 static tree
14603 build_this (int location)
14604 {
14605   tree node = build_wfl_node (this_identifier_node);
14606   TREE_SET_CODE (node, THIS_EXPR);
14607   EXPR_WFL_LINECOL (node) = location;
14608   return node;
14609 }
14610
14611 /* 14.15 The return statement. It builds a modify expression that
14612    assigns the returned value to the RESULT_DECL that hold the value
14613    to be returned. */
14614
14615 static tree
14616 build_return (int location, tree op)
14617 {
14618   tree node = build1 (RETURN_EXPR, NULL_TREE, op);
14619   EXPR_WFL_LINECOL (node) = location;
14620   node = build_debugable_stmt (location, node);
14621   return node;
14622 }
14623
14624 static tree
14625 patch_return (tree node)
14626 {
14627   tree return_exp = TREE_OPERAND (node, 0);
14628   tree meth = current_function_decl;
14629   tree mtype = TREE_TYPE (TREE_TYPE (current_function_decl));
14630   int error_found = 0;
14631
14632   TREE_TYPE (node) = error_mark_node;
14633   EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
14634
14635   /* It's invalid to have a return value within a function that is
14636      declared with the keyword void or that is a constructor */
14637   if (return_exp && (mtype == void_type_node || DECL_CONSTRUCTOR_P (meth)))
14638     error_found = 1;
14639
14640   /* It's invalid to use a return statement in a static block */
14641   if (DECL_CLINIT_P (current_function_decl))
14642     error_found = 1;
14643
14644   /* It's invalid to have a no return value within a function that
14645      isn't declared with the keyword `void' */
14646   if (!return_exp && (mtype != void_type_node && !DECL_CONSTRUCTOR_P (meth)))
14647     error_found = 2;
14648
14649   if (DECL_INSTINIT_P (current_function_decl))
14650     error_found = 1;
14651
14652   if (error_found)
14653     {
14654       if (DECL_INSTINIT_P (current_function_decl))
14655         parse_error_context (wfl_operator,
14656                              "`return' inside instance initializer");
14657
14658       else if (DECL_CLINIT_P (current_function_decl))
14659         parse_error_context (wfl_operator,
14660                              "`return' inside static initializer");
14661
14662       else if (!DECL_CONSTRUCTOR_P (meth))
14663         {
14664           char *t = xstrdup (lang_printable_name (mtype, 0));
14665           parse_error_context (wfl_operator,
14666                                "`return' with%s value from `%s %s'",
14667                                (error_found == 1 ? "" : "out"),
14668                                t, lang_printable_name (meth, 0));
14669           free (t);
14670         }
14671       else
14672         parse_error_context (wfl_operator,
14673                              "`return' with value from constructor `%s'",
14674                              lang_printable_name (meth, 0));
14675       return error_mark_node;
14676     }
14677
14678   /* If we have a return_exp, build a modify expression and expand
14679      it. Note: at that point, the assignment is declared valid, but we
14680      may want to carry some more hacks */
14681   if (return_exp)
14682     {
14683       tree exp = java_complete_tree (return_exp);
14684       tree modify, patched;
14685
14686       if ((patched = patch_string (exp)))
14687         exp = patched;
14688
14689       modify = build (MODIFY_EXPR, NULL_TREE, DECL_RESULT (meth), exp);
14690       EXPR_WFL_LINECOL (modify) = EXPR_WFL_LINECOL (node);
14691       modify = java_complete_tree (modify);
14692
14693       if (modify != error_mark_node)
14694         {
14695           TREE_SIDE_EFFECTS (modify) = 1;
14696           TREE_OPERAND (node, 0) = modify;
14697         }
14698       else
14699         return error_mark_node;
14700     }
14701   TREE_TYPE (node) = void_type_node;
14702   TREE_SIDE_EFFECTS (node) = 1;
14703   return node;
14704 }
14705
14706 /* 14.8 The if Statement */
14707
14708 static tree
14709 build_if_else_statement (int location, tree expression, tree if_body,
14710                          tree else_body)
14711 {
14712   tree node;
14713   if (!else_body)
14714     else_body = build_java_empty_stmt ();
14715   node = build (COND_EXPR, NULL_TREE, expression, if_body, else_body);
14716   EXPR_WFL_LINECOL (node) = location;
14717   node = build_debugable_stmt (location, node);
14718   return node;
14719 }
14720
14721 static tree
14722 patch_if_else_statement (tree node)
14723 {
14724   tree expression = TREE_OPERAND (node, 0);
14725   int can_complete_normally
14726     = (CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 1))
14727        | CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 2)));
14728
14729   TREE_TYPE (node) = error_mark_node;
14730   EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
14731
14732   /* The type of expression must be boolean */
14733   if (TREE_TYPE (expression) != boolean_type_node
14734       && TREE_TYPE (expression) != promoted_boolean_type_node)
14735     {
14736       parse_error_context
14737         (wfl_operator,
14738          "Incompatible type for `if'. Can't convert `%s' to `boolean'",
14739          lang_printable_name (TREE_TYPE (expression), 0));
14740       return error_mark_node;
14741     }
14742
14743   TREE_TYPE (node) = void_type_node;
14744   TREE_SIDE_EFFECTS (node) = 1;
14745   CAN_COMPLETE_NORMALLY (node) = can_complete_normally;
14746   return node;
14747 }
14748
14749 /* 14.6 Labeled Statements */
14750
14751 /* Action taken when a labeled statement is parsed. a new
14752    LABELED_BLOCK_EXPR is created. No statement is attached to the
14753    label, yet.  LABEL can be NULL_TREE for artificially-generated blocks. */
14754
14755 static tree
14756 build_labeled_block (int location, tree label)
14757 {
14758   tree label_name ;
14759   tree label_decl, node;
14760   if (label == NULL_TREE || label == continue_identifier_node)
14761     label_name = label;
14762   else
14763     {
14764       label_name = merge_qualified_name (label_id, label);
14765       /* Issue an error if we try to reuse a label that was previously
14766          declared */
14767       if (IDENTIFIER_LOCAL_VALUE (label_name))
14768         {
14769           EXPR_WFL_LINECOL (wfl_operator) = location;
14770           parse_error_context (wfl_operator,
14771             "Declaration of `%s' shadows a previous label declaration",
14772                                IDENTIFIER_POINTER (label));
14773           EXPR_WFL_LINECOL (wfl_operator) =
14774             EXPR_WFL_LINECOL (IDENTIFIER_LOCAL_VALUE (label_name));
14775           parse_error_context (wfl_operator,
14776             "This is the location of the previous declaration of label `%s'",
14777                                IDENTIFIER_POINTER (label));
14778           java_error_count--;
14779         }
14780     }
14781
14782   label_decl = create_label_decl (label_name);
14783   node = build (LABELED_BLOCK_EXPR, NULL_TREE, label_decl, NULL_TREE);
14784   EXPR_WFL_LINECOL (node) = location;
14785   TREE_SIDE_EFFECTS (node) = 1;
14786   return node;
14787 }
14788
14789 /* A labeled statement LBE is attached a statement.  */
14790
14791 static tree
14792 finish_labeled_statement (tree lbe, /* Labeled block expr */
14793                           tree statement)
14794 {
14795   /* In anyways, tie the loop to its statement */
14796   LABELED_BLOCK_BODY (lbe) = statement;
14797   pop_labeled_block ();
14798   POP_LABELED_BLOCK ();
14799   return lbe;
14800 }
14801
14802 /* 14.10, 14.11, 14.12 Loop Statements */
14803
14804 /* Create an empty LOOP_EXPR and make it the last in the nested loop
14805    list. */
14806
14807 static tree
14808 build_new_loop (tree loop_body)
14809 {
14810   tree loop =  build (LOOP_EXPR, NULL_TREE, loop_body);
14811   TREE_SIDE_EFFECTS (loop) = 1;
14812   PUSH_LOOP (loop);
14813   return loop;
14814 }
14815
14816 /* Create a loop body according to the following structure:
14817      COMPOUND_EXPR
14818        COMPOUND_EXPR            (loop main body)
14819          EXIT_EXPR              (this order is for while/for loops.
14820          LABELED_BLOCK_EXPR      the order is reversed for do loops)
14821            LABEL_DECL           (a continue occurring here branches at the
14822            BODY                  end of this labeled block)
14823        INCREMENT                (if any)
14824
14825   REVERSED, if nonzero, tells that the loop condition expr comes
14826   after the body, like in the do-while loop.
14827
14828   To obtain a loop, the loop body structure described above is
14829   encapsulated within a LOOP_EXPR surrounded by a LABELED_BLOCK_EXPR:
14830
14831    LABELED_BLOCK_EXPR
14832      LABEL_DECL                   (use this label to exit the loop)
14833      LOOP_EXPR
14834        <structure described above> */
14835
14836 static tree
14837 build_loop_body (int location, tree condition, int reversed)
14838 {
14839   tree first, second, body;
14840
14841   condition = build (EXIT_EXPR, NULL_TREE, condition); /* Force walk */
14842   EXPR_WFL_LINECOL (condition) = location; /* For accurate error report */
14843   condition = build_debugable_stmt (location, condition);
14844   TREE_SIDE_EFFECTS (condition) = 1;
14845
14846   body = build_labeled_block (0, continue_identifier_node);
14847   first = (reversed ? body : condition);
14848   second = (reversed ? condition : body);
14849   return
14850     build (COMPOUND_EXPR, NULL_TREE,
14851            build (COMPOUND_EXPR, NULL_TREE, first, second),
14852                   build_java_empty_stmt ());
14853 }
14854
14855 /* Install CONDITION (if any) and loop BODY (using REVERSED to tell
14856    their order) on the current loop. Unlink the current loop from the
14857    loop list.  */
14858
14859 static tree
14860 finish_loop_body (int location, tree condition, tree body, int reversed)
14861 {
14862   tree to_return = ctxp->current_loop;
14863   tree loop_body = LOOP_EXPR_BODY (to_return);
14864   if (condition)
14865     {
14866       tree cnode = LOOP_EXPR_BODY_CONDITION_EXPR (loop_body, reversed);
14867       /* We wrapped the EXIT_EXPR around a WFL so we can debug it.
14868          The real EXIT_EXPR is one operand further. */
14869       EXPR_WFL_LINECOL (cnode) = location;
14870       /* This one is for accurate error reports */
14871       EXPR_WFL_LINECOL (TREE_OPERAND (cnode, 0)) = location;
14872       TREE_OPERAND (TREE_OPERAND (cnode, 0), 0) = condition;
14873     }
14874   LOOP_EXPR_BODY_BODY_EXPR (loop_body, reversed) = body;
14875   POP_LOOP ();
14876   return to_return;
14877 }
14878
14879 /* Tailored version of finish_loop_body for FOR loops, when FOR
14880    loops feature the condition part */
14881
14882 static tree
14883 finish_for_loop (int location, tree condition, tree update, tree body)
14884 {
14885   /* Put the condition and the loop body in place */
14886   tree loop = finish_loop_body (location, condition, body, 0);
14887   /* LOOP is the current loop which has been now popped of the loop
14888      stack.  Mark the update block as reachable and install it.  We do
14889      this because the (current interpretation of the) JLS requires
14890      that the update expression be considered reachable even if the
14891      for loop's body doesn't complete normally.  */
14892   if (update != NULL_TREE && !IS_EMPTY_STMT (update))
14893     {
14894       tree up2 = update;
14895       if (TREE_CODE (up2) == EXPR_WITH_FILE_LOCATION)
14896         up2 = EXPR_WFL_NODE (up2);
14897       /* It is possible for the update expression to be an
14898          EXPR_WFL_NODE wrapping nothing.  */
14899       if (up2 != NULL_TREE && !IS_EMPTY_STMT (up2))
14900         {
14901           /* Try to detect constraint violations.  These would be
14902              programming errors somewhere.  */
14903           if (! IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (up2)))
14904               || TREE_CODE (up2) == LOOP_EXPR)
14905             abort ();
14906           SUPPRESS_UNREACHABLE_ERROR (up2) = 1;
14907         }
14908     }
14909   LOOP_EXPR_BODY_UPDATE_BLOCK (LOOP_EXPR_BODY (loop)) = update;
14910   return loop;
14911 }
14912
14913 /* Try to find the loop a block might be related to. This comprises
14914    the case where the LOOP_EXPR is found as the second operand of a
14915    COMPOUND_EXPR, because the loop happens to have an initialization
14916    part, then expressed as the first operand of the COMPOUND_EXPR. If
14917    the search finds something, 1 is returned. Otherwise, 0 is
14918    returned. The search is assumed to start from a
14919    LABELED_BLOCK_EXPR's block.  */
14920
14921 static tree
14922 search_loop (tree statement)
14923 {
14924   if (TREE_CODE (statement) == LOOP_EXPR)
14925     return statement;
14926
14927   if (TREE_CODE (statement) == BLOCK)
14928     statement = BLOCK_SUBBLOCKS (statement);
14929   else
14930     return NULL_TREE;
14931
14932   if (statement && TREE_CODE (statement) == COMPOUND_EXPR)
14933     while (statement && TREE_CODE (statement) == COMPOUND_EXPR)
14934       statement = TREE_OPERAND (statement, 1);
14935
14936   return (TREE_CODE (statement) == LOOP_EXPR
14937           && FOR_LOOP_P (statement) ? statement : NULL_TREE);
14938 }
14939
14940 /* Return 1 if LOOP can be found in the labeled block BLOCK. 0 is
14941    returned otherwise.  */
14942
14943 static int
14944 labeled_block_contains_loop_p (tree block, tree loop)
14945 {
14946   if (!block)
14947     return 0;
14948
14949   if (LABELED_BLOCK_BODY (block) == loop)
14950     return 1;
14951
14952   if (FOR_LOOP_P (loop) && search_loop (LABELED_BLOCK_BODY (block)) == loop)
14953     return 1;
14954
14955   return 0;
14956 }
14957
14958 /* If the loop isn't surrounded by a labeled statement, create one and
14959    insert LOOP as its body.  */
14960
14961 static tree
14962 patch_loop_statement (tree loop)
14963 {
14964   tree loop_label;
14965
14966   TREE_TYPE (loop) = void_type_node;
14967   if (labeled_block_contains_loop_p (ctxp->current_labeled_block, loop))
14968     return loop;
14969
14970   loop_label = build_labeled_block (0, NULL_TREE);
14971   /* LOOP is an EXPR node, so it should have a valid EXPR_WFL_LINECOL
14972      that LOOP_LABEL could enquire about, for a better accuracy. FIXME */
14973   LABELED_BLOCK_BODY (loop_label) = loop;
14974   PUSH_LABELED_BLOCK (loop_label);
14975   return loop_label;
14976 }
14977
14978 /* 14.13, 14.14: break and continue Statements */
14979
14980 /* Build a break or a continue statement. a null NAME indicates an
14981    unlabeled break/continue statement.  */
14982
14983 static tree
14984 build_bc_statement (int location, int is_break, tree name)
14985 {
14986   tree break_continue, label_block_expr = NULL_TREE;
14987
14988   if (name)
14989     {
14990       if (!(label_block_expr = IDENTIFIER_LOCAL_VALUE
14991             (merge_qualified_name (label_id, EXPR_WFL_NODE (name)))))
14992         /* Null means that we don't have a target for this named
14993            break/continue. In this case, we make the target to be the
14994            label name, so that the error can be reported accurately in
14995            patch_bc_statement. */
14996         label_block_expr = EXPR_WFL_NODE (name);
14997     }
14998   /* Unlabeled break/continue will be handled during the
14999      break/continue patch operation */
15000   break_continue
15001     = build (EXIT_BLOCK_EXPR, NULL_TREE, label_block_expr, NULL_TREE);
15002
15003   IS_BREAK_STMT_P (break_continue) = is_break;
15004   TREE_SIDE_EFFECTS (break_continue) = 1;
15005   EXPR_WFL_LINECOL (break_continue) = location;
15006   break_continue = build_debugable_stmt (location, break_continue);
15007   return break_continue;
15008 }
15009
15010 /* Verification of a break/continue statement. */
15011
15012 static tree
15013 patch_bc_statement (tree node)
15014 {
15015   tree bc_label = EXIT_BLOCK_LABELED_BLOCK (node), target_stmt;
15016   tree labeled_block = ctxp->current_labeled_block;
15017   EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
15018
15019   /* Having an identifier here means that the target is unknown. */
15020   if (bc_label != NULL_TREE && TREE_CODE (bc_label) == IDENTIFIER_NODE)
15021     {
15022       parse_error_context (wfl_operator, "No label definition found for `%s'",
15023                            IDENTIFIER_POINTER (bc_label));
15024       return error_mark_node;
15025     }
15026   if (! IS_BREAK_STMT_P (node))
15027     {
15028       /* It's a continue statement. */
15029       for (;; labeled_block = TREE_CHAIN (labeled_block))
15030         {
15031           if (labeled_block == NULL_TREE)
15032             {
15033               if (bc_label == NULL_TREE)
15034                 parse_error_context (wfl_operator,
15035                                      "`continue' must be in loop");
15036               else
15037                 parse_error_context
15038                   (wfl_operator, "continue label `%s' does not name a loop",
15039                    IDENTIFIER_POINTER (bc_label));
15040               return error_mark_node;
15041             }
15042           if ((DECL_NAME (LABELED_BLOCK_LABEL (labeled_block))
15043                == continue_identifier_node)
15044               && (bc_label == NULL_TREE
15045                   || TREE_CHAIN (labeled_block) == bc_label))
15046             {
15047               bc_label = labeled_block;
15048               break;
15049             }
15050         }
15051     }
15052   else if (!bc_label)
15053     {
15054       for (;; labeled_block = TREE_CHAIN (labeled_block))
15055         {
15056           if (labeled_block == NULL_TREE)
15057             {
15058               parse_error_context (wfl_operator,
15059                                      "`break' must be in loop or switch");
15060               return error_mark_node;
15061             }
15062           target_stmt = LABELED_BLOCK_BODY (labeled_block);
15063           if (TREE_CODE (target_stmt) == SWITCH_EXPR
15064               || search_loop (target_stmt))
15065             {
15066               bc_label = labeled_block;
15067               break;
15068             }
15069         }
15070     }
15071
15072   EXIT_BLOCK_LABELED_BLOCK (node) = bc_label;
15073   CAN_COMPLETE_NORMALLY (bc_label) = 1;
15074
15075   /* Our break/continue don't return values. */
15076   TREE_TYPE (node) = void_type_node;
15077   /* Encapsulate the break within a compound statement so that it's
15078      expanded all the times by expand_expr (and not clobbered
15079      sometimes, like after a if statement) */
15080   node = add_stmt_to_compound (NULL_TREE, void_type_node, node);
15081   TREE_SIDE_EFFECTS (node) = 1;
15082   return node;
15083 }
15084
15085 /* Process the exit expression belonging to a loop. Its type must be
15086    boolean.  */
15087
15088 static tree
15089 patch_exit_expr (tree node)
15090 {
15091   tree expression = TREE_OPERAND (node, 0);
15092   TREE_TYPE (node) = error_mark_node;
15093   EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
15094
15095   /* The type of expression must be boolean */
15096   if (TREE_TYPE (expression) != boolean_type_node)
15097     {
15098       parse_error_context
15099         (wfl_operator,
15100     "Incompatible type for loop conditional. Can't convert `%s' to `boolean'",
15101          lang_printable_name (TREE_TYPE (expression), 0));
15102       return error_mark_node;
15103     }
15104   /* Now we know things are allright, invert the condition, fold and
15105      return */
15106   TREE_OPERAND (node, 0) =
15107     fold (build1 (TRUTH_NOT_EXPR, boolean_type_node, expression));
15108
15109   if (! integer_zerop (TREE_OPERAND (node, 0))
15110       && ctxp->current_loop != NULL_TREE
15111       && TREE_CODE (ctxp->current_loop) == LOOP_EXPR)
15112     CAN_COMPLETE_NORMALLY (ctxp->current_loop) = 1;
15113   if (! integer_onep (TREE_OPERAND (node, 0)))
15114     CAN_COMPLETE_NORMALLY (node) = 1;
15115
15116
15117   TREE_TYPE (node) = void_type_node;
15118   return node;
15119 }
15120
15121 /* 14.9 Switch statement */
15122
15123 static tree
15124 patch_switch_statement (tree node)
15125 {
15126   tree se = TREE_OPERAND (node, 0), se_type;
15127   tree save, iter;
15128
15129   /* Complete the switch expression */
15130   se = TREE_OPERAND (node, 0) = java_complete_tree (se);
15131   se_type = TREE_TYPE (se);
15132   /* The type of the switch expression must be char, byte, short or
15133      int */
15134   if (! JINTEGRAL_TYPE_P (se_type) || se_type == long_type_node)
15135     {
15136       EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
15137       parse_error_context (wfl_operator,
15138           "Incompatible type for `switch'. Can't convert `%s' to `int'",
15139                            lang_printable_name (se_type, 0));
15140       /* This is what java_complete_tree will check */
15141       TREE_OPERAND (node, 0) = error_mark_node;
15142       return error_mark_node;
15143     }
15144
15145   /* Save and restore the outer case label list.  */
15146   save = case_label_list;
15147   case_label_list = NULL_TREE;
15148
15149   TREE_OPERAND (node, 1) = java_complete_tree (TREE_OPERAND (node, 1));
15150
15151   /* See if we've found a duplicate label.  We can't leave this until
15152      code generation, because in `--syntax-only' and `-C' modes we
15153      don't do ordinary code generation.  */
15154   for (iter = case_label_list; iter != NULL_TREE; iter = TREE_CHAIN (iter))
15155     {
15156       HOST_WIDE_INT val = TREE_INT_CST_LOW (TREE_VALUE (iter));
15157       tree subiter;
15158       for (subiter = TREE_CHAIN (iter);
15159            subiter != NULL_TREE;
15160            subiter = TREE_CHAIN (subiter))
15161         {
15162           HOST_WIDE_INT subval = TREE_INT_CST_LOW (TREE_VALUE (subiter));
15163           if (val == subval)
15164             {
15165               EXPR_WFL_LINECOL (wfl_operator)
15166                 = EXPR_WFL_LINECOL (TREE_PURPOSE (iter));
15167               /* The case_label_list is in reverse order, so print the
15168                  outer label first.  */
15169               parse_error_context (wfl_operator, "duplicate case label: `"
15170                                    HOST_WIDE_INT_PRINT_DEC "'", subval);
15171               EXPR_WFL_LINECOL (wfl_operator)
15172                 = EXPR_WFL_LINECOL (TREE_PURPOSE (subiter));
15173               parse_error_context (wfl_operator, "original label is here");
15174
15175               break;
15176             }
15177         }
15178     }
15179
15180   case_label_list = save;
15181
15182   /* Ready to return */
15183   if (TREE_CODE (TREE_OPERAND (node, 1)) == ERROR_MARK)
15184     {
15185       TREE_TYPE (node) = error_mark_node;
15186       return error_mark_node;
15187     }
15188   TREE_TYPE (node) = void_type_node;
15189   TREE_SIDE_EFFECTS (node) = 1;
15190   CAN_COMPLETE_NORMALLY (node)
15191     = CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 1))
15192       || ! SWITCH_HAS_DEFAULT (node);
15193   return node;
15194 }
15195
15196 /* Assertions.  */
15197
15198 /* Build an assertion expression for `assert CONDITION : VALUE'; VALUE
15199    might be NULL_TREE.  */
15200 static tree
15201 build_assertion (int location, tree condition, tree value)
15202 {
15203   tree node;
15204   tree klass = GET_CPC ();
15205
15206   if (! enable_assertions (klass))
15207     {
15208       condition = build (TRUTH_ANDIF_EXPR, NULL_TREE,
15209                          boolean_false_node, condition);
15210       if (value == NULL_TREE)
15211         value = build_java_empty_stmt ();
15212       return build_if_else_statement (location, condition,
15213                                       value, NULL_TREE);
15214     }
15215
15216   if (! CLASS_USES_ASSERTIONS (klass))
15217     {
15218       tree field, classdollar, id, call;
15219       tree class_type = TREE_TYPE (klass);
15220
15221       field = add_field (class_type,
15222                          get_identifier ("$assertionsDisabled"),
15223                          boolean_type_node,
15224                          ACC_PRIVATE | ACC_STATIC | ACC_FINAL);
15225       MAYBE_CREATE_VAR_LANG_DECL_SPECIFIC (field);
15226       FIELD_SYNTHETIC (field) = 1;
15227
15228       classdollar = build_incomplete_class_ref (location, class_type);
15229
15230       /* Call CLASS.desiredAssertionStatus().  */
15231       id = build_wfl_node (get_identifier ("desiredAssertionStatus"));
15232       call = build (CALL_EXPR, NULL_TREE, id, NULL_TREE, NULL_TREE);
15233       call = make_qualified_primary (classdollar, call, location);
15234       TREE_SIDE_EFFECTS (call) = 1;
15235
15236       /* Invert to obtain !CLASS.desiredAssertionStatus().  This may
15237          seem odd, but we do it to generate code identical to that of
15238          the JDK.  */
15239       call = build1 (TRUTH_NOT_EXPR, NULL_TREE, call);
15240       TREE_SIDE_EFFECTS (call) = 1;
15241       DECL_INITIAL (field) = call;
15242
15243       /* Record the initializer in the initializer statement list.  */
15244       call = build (MODIFY_EXPR, NULL_TREE, field, call);
15245       TREE_CHAIN (call) = CPC_STATIC_INITIALIZER_STMT (ctxp);
15246       SET_CPC_STATIC_INITIALIZER_STMT (ctxp, call);
15247       MODIFY_EXPR_FROM_INITIALIZATION_P (call) = 1;
15248
15249       CLASS_USES_ASSERTIONS (klass) = 1;
15250     }
15251
15252   if (value != NULL_TREE)
15253     value = tree_cons (NULL_TREE, value, NULL_TREE);
15254
15255   node = build_wfl_node (get_identifier ("java"));
15256   node = make_qualified_name (node, build_wfl_node (get_identifier ("lang")),
15257                               location);
15258   node = make_qualified_name (node, build_wfl_node (get_identifier ("AssertionError")),
15259                               location);
15260
15261   node = build (NEW_CLASS_EXPR, NULL_TREE, node, value, NULL_TREE);
15262   TREE_SIDE_EFFECTS (node) = 1;
15263   /* It is too early to use BUILD_THROW.  */
15264   node = build1 (THROW_EXPR, NULL_TREE, node);
15265   TREE_SIDE_EFFECTS (node) = 1;
15266
15267   /* We invert the condition; if we just put NODE as the `else' part
15268      then we generate weird-looking bytecode.  */
15269   condition = build1 (TRUTH_NOT_EXPR, NULL_TREE, condition);
15270   /* Check $assertionsDisabled.  */
15271   condition
15272     = build (TRUTH_ANDIF_EXPR, NULL_TREE,
15273              build1 (TRUTH_NOT_EXPR, NULL_TREE,
15274                      build_wfl_node (get_identifier ("$assertionsDisabled"))),
15275              condition);
15276   node = build_if_else_statement (location, condition, node, NULL_TREE);
15277   return node;
15278 }
15279
15280 /* 14.18 The try/catch statements */
15281
15282 /* Encapsulate TRY_STMTS' in a try catch sequence. The catch clause
15283    catches TYPE and executes CATCH_STMTS.  */
15284
15285 static tree
15286 encapsulate_with_try_catch (int location, tree type_or_name, tree try_stmts,
15287                             tree catch_stmts)
15288 {
15289   tree try_block, catch_clause_param, catch_block, catch;
15290
15291   /* First build a try block */
15292   try_block = build_expr_block (try_stmts, NULL_TREE);
15293
15294   /* Build a catch block: we need a catch clause parameter */
15295   if (TREE_CODE (type_or_name) == EXPR_WITH_FILE_LOCATION)
15296     {
15297       tree catch_type = obtain_incomplete_type (type_or_name);
15298       jdep *dep;
15299       catch_clause_param = build_decl (VAR_DECL, wpv_id, catch_type);
15300       register_incomplete_type (JDEP_VARIABLE, type_or_name,
15301                                 catch_clause_param, catch_type);
15302       dep = CLASSD_LAST (ctxp->classd_list);
15303       JDEP_GET_PATCH (dep) = &TREE_TYPE (catch_clause_param);
15304     }
15305   else
15306     catch_clause_param = build_decl (VAR_DECL, wpv_id,
15307                                      build_pointer_type (type_or_name));
15308
15309   /* And a block */
15310   catch_block = build_expr_block (NULL_TREE, catch_clause_param);
15311
15312   /* Initialize the variable and store in the block */
15313   catch = build (MODIFY_EXPR, NULL_TREE, catch_clause_param,
15314                  build (JAVA_EXC_OBJ_EXPR, ptr_type_node));
15315   add_stmt_to_block (catch_block, NULL_TREE, catch);
15316
15317   /* Add the catch statements */
15318   add_stmt_to_block (catch_block, NULL_TREE, catch_stmts);
15319
15320   /* Now we can build a JAVA_CATCH_EXPR */
15321   catch_block = build1 (JAVA_CATCH_EXPR, NULL_TREE, catch_block);
15322
15323   return build_try_statement (location, try_block, catch_block);
15324 }
15325
15326 static tree
15327 build_try_statement (int location, tree try_block, tree catches)
15328 {
15329   tree node = build (TRY_EXPR, NULL_TREE, try_block, catches);
15330   EXPR_WFL_LINECOL (node) = location;
15331   return node;
15332 }
15333
15334 static tree
15335 build_try_finally_statement (int location, tree try_block, tree finally)
15336 {
15337   tree node = build (TRY_FINALLY_EXPR, NULL_TREE, try_block, finally);
15338   EXPR_WFL_LINECOL (node) = location;
15339   return node;
15340 }
15341
15342 static tree
15343 patch_try_statement (tree node)
15344 {
15345   int error_found = 0;
15346   tree try = TREE_OPERAND (node, 0);
15347   /* Exception handlers are considered in left to right order */
15348   tree catch = nreverse (TREE_OPERAND (node, 1));
15349   tree current, caught_type_list = NULL_TREE;
15350
15351   /* Check catch clauses, if any. Every time we find an error, we try
15352      to process the next catch clause. We process the catch clause before
15353      the try block so that when processing the try block we can check thrown
15354      exceptions againts the caught type list. */
15355   for (current = catch; current; current = TREE_CHAIN (current))
15356     {
15357       tree carg_decl, carg_type;
15358       tree sub_current, catch_block, catch_clause;
15359       int unreachable;
15360
15361       /* At this point, the structure of the catch clause is
15362            JAVA_CATCH_EXPR              (catch node)
15363              BLOCK              (with the decl of the parameter)
15364                COMPOUND_EXPR
15365                  MODIFY_EXPR   (assignment of the catch parameter)
15366                  BLOCK          (catch clause block)
15367        */
15368       catch_clause = TREE_OPERAND (current, 0);
15369       carg_decl = BLOCK_EXPR_DECLS (catch_clause);
15370       carg_type = TREE_TYPE (TREE_TYPE (carg_decl));
15371
15372       /* Catch clauses can't have more than one parameter declared,
15373          but it's already enforced by the grammar. Make sure that the
15374          only parameter of the clause statement in of class Throwable
15375          or a subclass of Throwable, but that was done earlier. The
15376          catch clause parameter type has also been resolved. */
15377
15378       /* Just make sure that the catch clause parameter type inherits
15379          from java.lang.Throwable */
15380       if (!inherits_from_p (carg_type, throwable_type_node))
15381         {
15382           EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (current);
15383           parse_error_context (wfl_operator,
15384                                "Can't catch class `%s'. Catch clause parameter type must be a subclass of class `java.lang.Throwable'",
15385                                lang_printable_name (carg_type, 0));
15386           error_found = 1;
15387           continue;
15388         }
15389
15390       /* Partial check for unreachable catch statement: The catch
15391          clause is reachable iff is no earlier catch block A in
15392          the try statement such that the type of the catch
15393          clause's parameter is the same as or a subclass of the
15394          type of A's parameter */
15395       unreachable = 0;
15396       for (sub_current = catch;
15397            sub_current != current; sub_current = TREE_CHAIN (sub_current))
15398         {
15399           tree sub_catch_clause, decl;
15400           sub_catch_clause = TREE_OPERAND (sub_current, 0);
15401           decl = BLOCK_EXPR_DECLS (sub_catch_clause);
15402
15403           if (inherits_from_p (carg_type, TREE_TYPE (TREE_TYPE (decl))))
15404             {
15405               EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (current);
15406               parse_error_context
15407                 (wfl_operator,
15408                  "`catch' not reached because of the catch clause at line %d",
15409                  EXPR_WFL_LINENO (sub_current));
15410               unreachable = error_found = 1;
15411               break;
15412             }
15413         }
15414       /* Complete the catch clause block */
15415       catch_block = java_complete_tree (TREE_OPERAND (current, 0));
15416       if (catch_block == error_mark_node)
15417         {
15418           error_found = 1;
15419           continue;
15420         }
15421       if (CAN_COMPLETE_NORMALLY (catch_block))
15422         CAN_COMPLETE_NORMALLY (node) = 1;
15423       TREE_OPERAND (current, 0) = catch_block;
15424
15425       if (unreachable)
15426         continue;
15427
15428       /* Things to do here: the exception must be thrown */
15429
15430       /* Link this type to the caught type list */
15431       caught_type_list = tree_cons (NULL_TREE, carg_type, caught_type_list);
15432     }
15433
15434   PUSH_EXCEPTIONS (caught_type_list);
15435   if ((try = java_complete_tree (try)) == error_mark_node)
15436     error_found = 1;
15437   if (CAN_COMPLETE_NORMALLY (try))
15438     CAN_COMPLETE_NORMALLY (node) = 1;
15439   POP_EXCEPTIONS ();
15440
15441   /* Verification ends here */
15442   if (error_found)
15443     return error_mark_node;
15444
15445   TREE_OPERAND (node, 0) = try;
15446   TREE_OPERAND (node, 1) = catch;
15447   TREE_TYPE (node) = void_type_node;
15448   return node;
15449 }
15450
15451 /* 14.17 The synchronized Statement */
15452
15453 static tree
15454 patch_synchronized_statement (tree node, tree wfl_op1)
15455 {
15456   tree expr = java_complete_tree (TREE_OPERAND (node, 0));
15457   tree block = TREE_OPERAND (node, 1);
15458
15459   tree tmp, enter, exit, expr_decl, assignment;
15460
15461   if (expr == error_mark_node)
15462     {
15463       block = java_complete_tree (block);
15464       return expr;
15465     }
15466
15467   /* We might be trying to synchronize on a STRING_CST */
15468   if ((tmp = patch_string (expr)))
15469     expr = tmp;
15470
15471   /* The TYPE of expr must be a reference type */
15472   if (!JREFERENCE_TYPE_P (TREE_TYPE (expr)))
15473     {
15474       SET_WFL_OPERATOR (wfl_operator, node, wfl_op1);
15475       parse_error_context (wfl_operator, "Incompatible type for `synchronized'. Can't convert `%s' to `java.lang.Object'",
15476                            lang_printable_name (TREE_TYPE (expr), 0));
15477       return error_mark_node;
15478     }
15479
15480   if (flag_emit_xref)
15481     {
15482       TREE_OPERAND (node, 0) = expr;
15483       TREE_OPERAND (node, 1) = java_complete_tree (block);
15484       CAN_COMPLETE_NORMALLY (node) = 1;
15485       return node;
15486     }
15487
15488   /* Generate a try-finally for the synchronized statement, except
15489      that the handler that catches all throw exception calls
15490      _Jv_MonitorExit and then rethrow the exception.
15491      The synchronized statement is then implemented as:
15492      TRY
15493        {
15494          _Jv_MonitorEnter (expression)
15495          synchronized_block
15496          _Jv_MonitorExit (expression)
15497        }
15498      CATCH_ALL
15499        {
15500          e = _Jv_exception_info ();
15501          _Jv_MonitorExit (expression)
15502          Throw (e);
15503        } */
15504
15505   expr_decl = build_decl (VAR_DECL, generate_name (), TREE_TYPE (expr));
15506   BUILD_MONITOR_ENTER (enter, expr_decl);
15507   BUILD_MONITOR_EXIT (exit, expr_decl);
15508   CAN_COMPLETE_NORMALLY (enter) = 1;
15509   CAN_COMPLETE_NORMALLY (exit) = 1;
15510   assignment = build (MODIFY_EXPR, NULL_TREE, expr_decl, expr);
15511   TREE_SIDE_EFFECTS (assignment) = 1;
15512   node = build (COMPOUND_EXPR, NULL_TREE,
15513                 build (COMPOUND_EXPR, NULL_TREE, assignment, enter),
15514                 build (TRY_FINALLY_EXPR, NULL_TREE, block, exit));
15515   node = build_expr_block (node, expr_decl);
15516
15517   return java_complete_tree (node);
15518 }
15519
15520 /* 14.16 The throw Statement */
15521
15522 static tree
15523 patch_throw_statement (tree node, tree wfl_op1)
15524 {
15525   tree expr = TREE_OPERAND (node, 0);
15526   tree type = TREE_TYPE (expr);
15527   int unchecked_ok = 0, tryblock_throws_ok = 0;
15528
15529   /* Thrown expression must be assignable to java.lang.Throwable */
15530   if (!try_reference_assignconv (throwable_type_node, expr))
15531     {
15532       SET_WFL_OPERATOR (wfl_operator, node, wfl_op1);
15533       parse_error_context (wfl_operator,
15534     "Can't throw `%s'; it must be a subclass of class `java.lang.Throwable'",
15535                            lang_printable_name (type, 0));
15536       /* If the thrown expression was a reference, we further the
15537          compile-time check. */
15538       if (!JREFERENCE_TYPE_P (type))
15539         return error_mark_node;
15540     }
15541
15542   /* At least one of the following must be true */
15543
15544   /* The type of the throw expression is a not checked exception,
15545      i.e. is a unchecked expression. */
15546   unchecked_ok = IS_UNCHECKED_EXCEPTION_P (TREE_TYPE (type));
15547
15548   SET_WFL_OPERATOR (wfl_operator, node, wfl_op1);
15549   /* An instance can't throw a checked exception unless that exception
15550      is explicitly declared in the `throws' clause of each
15551      constructor. This doesn't apply to anonymous classes, since they
15552      don't have declared constructors. */
15553   if (!unchecked_ok
15554       && DECL_INSTINIT_P (current_function_decl)
15555       && !ANONYMOUS_CLASS_P (current_class))
15556     {
15557       tree current;
15558       for (current = TYPE_METHODS (current_class); current;
15559            current = TREE_CHAIN (current))
15560         if (DECL_CONSTRUCTOR_P (current)
15561             && !check_thrown_exceptions_do (TREE_TYPE (expr)))
15562           {
15563             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)",
15564                                  lang_printable_name (TREE_TYPE (expr), 0));
15565             return error_mark_node;
15566           }
15567     }
15568
15569   /* Throw is contained in a try statement and at least one catch
15570      clause can receive the thrown expression or the current method is
15571      declared to throw such an exception. Or, the throw statement is
15572      contained in a method or constructor declaration and the type of
15573      the Expression is assignable to at least one type listed in the
15574      throws clause the declaration. */
15575   if (!unchecked_ok)
15576     tryblock_throws_ok = check_thrown_exceptions_do (TREE_TYPE (expr));
15577   if (!(unchecked_ok || tryblock_throws_ok))
15578     {
15579       /* If there is a surrounding try block that has no matching
15580          clatch clause, report it first. A surrounding try block exits
15581          only if there is something after the list of checked
15582          exception thrown by the current function (if any). */
15583       if (IN_TRY_BLOCK_P ())
15584         parse_error_context (wfl_operator, "Checked exception `%s' can't be caught by any of the catch clause(s) of the surrounding `try' block",
15585                              lang_printable_name (type, 0));
15586       /* If we have no surrounding try statement and the method doesn't have
15587          any throws, report it now. FIXME */
15588
15589       /* We report that the exception can't be throw from a try block
15590          in all circumstances but when the `throw' is inside a static
15591          block. */
15592       else if (!EXCEPTIONS_P (currently_caught_type_list)
15593                && !tryblock_throws_ok)
15594         {
15595           if (DECL_CLINIT_P (current_function_decl))
15596             parse_error_context (wfl_operator,
15597                    "Checked exception `%s' can't be thrown in initializer",
15598                                  lang_printable_name (type, 0));
15599           else
15600             parse_error_context (wfl_operator,
15601                    "Checked exception `%s' isn't thrown from a `try' block",
15602                                  lang_printable_name (type, 0));
15603         }
15604       /* Otherwise, the current method doesn't have the appropriate
15605          throws declaration */
15606       else
15607         parse_error_context (wfl_operator, "Checked exception `%s' doesn't match any of current method's `throws' declaration(s)",
15608                              lang_printable_name (type, 0));
15609       return error_mark_node;
15610     }
15611
15612   if (! flag_emit_class_files && ! flag_emit_xref)
15613     BUILD_THROW (node, expr);
15614
15615   /* If doing xrefs, keep the location where the `throw' was seen. */
15616   if (flag_emit_xref)
15617     EXPR_WFL_LINECOL (node) = EXPR_WFL_LINECOL (wfl_op1);
15618   return node;
15619 }
15620
15621 /* Check that exception said to be thrown by method DECL can be
15622    effectively caught from where DECL is invoked.  THIS_EXPR is the
15623    expression that computes `this' for the method call.  */
15624 static void
15625 check_thrown_exceptions (int location, tree decl, tree this_expr)
15626 {
15627   tree throws;
15628   int is_array_call = 0;
15629
15630   /* Skip check within generated methods, such as access$<n>.  */
15631   if (OUTER_FIELD_ACCESS_IDENTIFIER_P (DECL_NAME (current_function_decl)))
15632     return;
15633
15634   if (this_expr != NULL_TREE
15635       && TREE_CODE (TREE_TYPE (this_expr)) == POINTER_TYPE
15636       && TYPE_ARRAY_P (TREE_TYPE (TREE_TYPE (this_expr))))
15637     is_array_call = 1;
15638
15639   /* For all the unchecked exceptions thrown by DECL.  */
15640   for (throws = DECL_FUNCTION_THROWS (decl); throws;
15641        throws = TREE_CHAIN (throws))
15642     if (!check_thrown_exceptions_do (TREE_VALUE (throws)))
15643       {
15644         /* Suppress errors about cloning arrays.  */
15645         if (is_array_call && DECL_NAME (decl) == get_identifier ("clone"))
15646           continue;
15647
15648         EXPR_WFL_LINECOL (wfl_operator) = location;
15649         if (DECL_FINIT_P (current_function_decl))
15650           parse_error_context
15651             (wfl_operator, "Exception `%s' can't be thrown in initializer",
15652              lang_printable_name (TREE_VALUE (throws), 0));
15653         else
15654           {
15655             parse_error_context
15656               (wfl_operator, "Exception `%s' must be caught, or it must be declared in the `throws' clause of `%s'",
15657                lang_printable_name (TREE_VALUE (throws), 0),
15658                (DECL_INIT_P (current_function_decl) ?
15659                 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (current_class))) :
15660                 IDENTIFIER_POINTER (DECL_NAME (current_function_decl))));
15661           }
15662       }
15663 }
15664
15665 /* Return 1 if checked EXCEPTION is caught at the current nesting level of
15666    try-catch blocks, OR is listed in the `throws' clause of the
15667    current method.  */
15668
15669 static int
15670 check_thrown_exceptions_do (tree exception)
15671 {
15672   tree list = currently_caught_type_list;
15673   resolve_and_layout (exception, NULL_TREE);
15674   /* First, all the nested try-catch-finally at that stage. The
15675      last element contains `throws' clause exceptions, if any. */
15676   if (IS_UNCHECKED_EXCEPTION_P (exception))
15677     return 1;
15678   while (list)
15679     {
15680       tree caught;
15681       for (caught = TREE_VALUE (list); caught; caught = TREE_CHAIN (caught))
15682         if (valid_ref_assignconv_cast_p (exception, TREE_VALUE (caught), 0))
15683           return 1;
15684       list = TREE_CHAIN (list);
15685     }
15686   return 0;
15687 }
15688
15689 static void
15690 purge_unchecked_exceptions (tree mdecl)
15691 {
15692   tree throws = DECL_FUNCTION_THROWS (mdecl);
15693   tree new = NULL_TREE;
15694
15695   while (throws)
15696     {
15697       tree next = TREE_CHAIN (throws);
15698       if (!IS_UNCHECKED_EXCEPTION_P (TREE_VALUE (throws)))
15699         {
15700           TREE_CHAIN (throws) = new;
15701           new = throws;
15702         }
15703       throws = next;
15704     }
15705   /* List is inverted here, but it doesn't matter */
15706   DECL_FUNCTION_THROWS (mdecl) = new;
15707 }
15708
15709 /* This function goes over all of CLASS_TYPE ctors and checks whether
15710    each of them features at least one unchecked exception in its
15711    `throws' clause. If it's the case, it returns `true', `false'
15712    otherwise.  */
15713
15714 static bool
15715 ctors_unchecked_throws_clause_p (tree class_type)
15716 {
15717   tree current;
15718
15719   for (current = TYPE_METHODS (class_type); current;
15720        current = TREE_CHAIN (current))
15721     {
15722       bool ctu = false; /* Ctor Throws Unchecked */
15723       if (DECL_CONSTRUCTOR_P (current))
15724         {
15725           tree throws;
15726           for (throws = DECL_FUNCTION_THROWS (current); throws && !ctu;
15727                throws = TREE_CHAIN (throws))
15728             if (inherits_from_p (TREE_VALUE (throws), exception_type_node))
15729               ctu = true;
15730         }
15731       /* We return false as we found one ctor that is unfit. */
15732       if (!ctu && DECL_CONSTRUCTOR_P (current))
15733         return false;
15734     }
15735   /* All ctors feature at least one unchecked exception in their
15736      `throws' clause. */
15737   return true;
15738 }
15739
15740 /* 15.24 Conditional Operator ?: */
15741
15742 static tree
15743 patch_conditional_expr (tree node, tree wfl_cond, tree wfl_op1)
15744 {
15745   tree cond = TREE_OPERAND (node, 0);
15746   tree op1 = TREE_OPERAND (node, 1);
15747   tree op2 = TREE_OPERAND (node, 2);
15748   tree resulting_type = NULL_TREE;
15749   tree t1, t2, patched;
15750   int error_found = 0;
15751
15752   /* Operands of ?: might be StringBuffers crafted as a result of a
15753      string concatenation. Obtain a descent operand here.  */
15754   if ((patched = patch_string (op1)))
15755     TREE_OPERAND (node, 1) = op1 = patched;
15756   if ((patched = patch_string (op2)))
15757     TREE_OPERAND (node, 2) = op2 = patched;
15758
15759   t1 = TREE_TYPE (op1);
15760   t2 = TREE_TYPE (op2);
15761
15762   /* The first expression must be a boolean */
15763   if (TREE_TYPE (cond) != boolean_type_node)
15764     {
15765       SET_WFL_OPERATOR (wfl_operator, node, wfl_cond);
15766       parse_error_context (wfl_operator,
15767                "Incompatible type for `?:'. Can't convert `%s' to `boolean'",
15768                            lang_printable_name (TREE_TYPE (cond), 0));
15769       error_found = 1;
15770     }
15771
15772   /* Second and third can be numeric, boolean (i.e. primitive),
15773      references or null. Anything else results in an error */
15774   if (!((JNUMERIC_TYPE_P (t1) && JNUMERIC_TYPE_P (t2))
15775         || ((JREFERENCE_TYPE_P (t1) || op1 == null_pointer_node)
15776             && (JREFERENCE_TYPE_P (t2) || op2 == null_pointer_node))
15777         || (t1 == boolean_type_node && t2 == boolean_type_node)))
15778     error_found = 1;
15779
15780   /* Determine the type of the conditional expression. Same types are
15781      easy to deal with */
15782   else if (t1 == t2)
15783     resulting_type = t1;
15784
15785   /* There are different rules for numeric types */
15786   else if (JNUMERIC_TYPE_P (t1))
15787     {
15788       /* if byte/short found, the resulting type is short */
15789       if ((t1 == byte_type_node && t2 == short_type_node)
15790           || (t1 == short_type_node && t2 == byte_type_node))
15791         resulting_type = short_type_node;
15792
15793       /* If t1 is a constant int and t2 is of type byte, short or char
15794          and t1's value fits in t2, then the resulting type is t2 */
15795       else if ((t1 == int_type_node && TREE_CONSTANT (TREE_OPERAND (node, 1)))
15796           && JBSC_TYPE_P (t2) && int_fits_type_p (TREE_OPERAND (node, 1), t2))
15797         resulting_type = t2;
15798
15799       /* If t2 is a constant int and t1 is of type byte, short or char
15800          and t2's value fits in t1, then the resulting type is t1 */
15801       else if ((t2 == int_type_node && TREE_CONSTANT (TREE_OPERAND (node, 2)))
15802           && JBSC_TYPE_P (t1) && int_fits_type_p (TREE_OPERAND (node, 2), t1))
15803         resulting_type = t1;
15804
15805       /* Otherwise, binary numeric promotion is applied and the
15806          resulting type is the promoted type of operand 1 and 2 */
15807       else
15808         resulting_type = binary_numeric_promotion (t1, t2,
15809                                                    &TREE_OPERAND (node, 1),
15810                                                    &TREE_OPERAND (node, 2));
15811     }
15812
15813   /* Cases of a reference and a null type */
15814   else if (JREFERENCE_TYPE_P (t1) && op2 == null_pointer_node)
15815     resulting_type = t1;
15816
15817   else if (JREFERENCE_TYPE_P (t2) && op1 == null_pointer_node)
15818     resulting_type = t2;
15819
15820   /* Last case: different reference types. If a type can be converted
15821      into the other one by assignment conversion, the latter
15822      determines the type of the expression */
15823   else if ((resulting_type = try_reference_assignconv (t1, op2)))
15824     resulting_type = promote_type (t1);
15825
15826   else if ((resulting_type = try_reference_assignconv (t2, op1)))
15827     resulting_type = promote_type (t2);
15828
15829   /* If we don't have any resulting type, we're in trouble */
15830   if (!resulting_type)
15831     {
15832       char *t = xstrdup (lang_printable_name (t1, 0));
15833       SET_WFL_OPERATOR (wfl_operator, node, wfl_op1);
15834       parse_error_context (wfl_operator,
15835                  "Incompatible type for `?:'. Can't convert `%s' to `%s'",
15836                            t, lang_printable_name (t2, 0));
15837       free (t);
15838       error_found = 1;
15839     }
15840
15841   if (error_found)
15842     {
15843       TREE_TYPE (node) = error_mark_node;
15844       return error_mark_node;
15845     }
15846
15847   TREE_TYPE (node) = resulting_type;
15848   TREE_SET_CODE (node, COND_EXPR);
15849   CAN_COMPLETE_NORMALLY (node) = 1;
15850   return node;
15851 }
15852
15853 /* Wrap EXPR with code to initialize DECL's class, if appropriate. */
15854
15855 static tree
15856 maybe_build_class_init_for_field (tree decl, tree expr)
15857 {
15858   tree clas = DECL_CONTEXT (decl);
15859   if (flag_emit_class_files || flag_emit_xref)
15860     return expr;
15861
15862   if (TREE_CODE (decl) == VAR_DECL && FIELD_STATIC (decl)
15863       && FIELD_FINAL (decl))
15864     {
15865       tree init = DECL_INITIAL (decl);
15866       if (init != NULL_TREE)
15867         init = fold_constant_for_init (init, decl);
15868       if (init != NULL_TREE && CONSTANT_VALUE_P (init))
15869         return expr;
15870     }
15871
15872   return build_class_init (clas, expr);
15873 }
15874
15875 /* Try to constant fold NODE.
15876    If NODE is not a constant expression, return NULL_EXPR.
15877    CONTEXT is a static final VAR_DECL whose initializer we are folding. */
15878
15879 static tree
15880 fold_constant_for_init (tree node, tree context)
15881 {
15882   tree op0, op1, val;
15883   enum tree_code code = TREE_CODE (node);
15884
15885   switch (code)
15886     {
15887     case INTEGER_CST:
15888       if (node == null_pointer_node)
15889         return NULL_TREE;
15890     case STRING_CST:
15891     case REAL_CST:
15892       return node;
15893
15894     case PLUS_EXPR:
15895     case MINUS_EXPR:
15896     case MULT_EXPR:
15897     case TRUNC_MOD_EXPR:
15898     case RDIV_EXPR:
15899     case LSHIFT_EXPR:
15900     case RSHIFT_EXPR:
15901     case URSHIFT_EXPR:
15902     case BIT_AND_EXPR:
15903     case BIT_XOR_EXPR:
15904     case BIT_IOR_EXPR:
15905     case TRUTH_ANDIF_EXPR:
15906     case TRUTH_ORIF_EXPR:
15907     case EQ_EXPR:
15908     case NE_EXPR:
15909     case GT_EXPR:
15910     case GE_EXPR:
15911     case LT_EXPR:
15912     case LE_EXPR:
15913       op0 = TREE_OPERAND (node, 0);
15914       op1 = TREE_OPERAND (node, 1);
15915       val = fold_constant_for_init (op0, context);
15916       if (val == NULL_TREE || ! TREE_CONSTANT (val))
15917         return NULL_TREE;
15918       TREE_OPERAND (node, 0) = val;
15919       val = fold_constant_for_init (op1, context);
15920       if (val == NULL_TREE || ! TREE_CONSTANT (val))
15921         return NULL_TREE;
15922       TREE_OPERAND (node, 1) = val;
15923       return patch_binop (node, op0, op1);
15924
15925     case UNARY_PLUS_EXPR:
15926     case NEGATE_EXPR:
15927     case TRUTH_NOT_EXPR:
15928     case BIT_NOT_EXPR:
15929     case CONVERT_EXPR:
15930       op0 = TREE_OPERAND (node, 0);
15931       val = fold_constant_for_init (op0, context);
15932       if (val == NULL_TREE || ! TREE_CONSTANT (val))
15933         return NULL_TREE;
15934       TREE_OPERAND (node, 0) = val;
15935       val = patch_unaryop (node, op0);
15936       if (! TREE_CONSTANT (val))
15937         return NULL_TREE;
15938       return val;
15939
15940       break;
15941
15942     case COND_EXPR:
15943       val = fold_constant_for_init (TREE_OPERAND (node, 0), context);
15944       if (val == NULL_TREE || ! TREE_CONSTANT (val))
15945         return NULL_TREE;
15946       TREE_OPERAND (node, 0) = val;
15947       val = fold_constant_for_init (TREE_OPERAND (node, 1), context);
15948       if (val == NULL_TREE || ! TREE_CONSTANT (val))
15949         return NULL_TREE;
15950       TREE_OPERAND (node, 1) = val;
15951       val = fold_constant_for_init (TREE_OPERAND (node, 2), context);
15952       if (val == NULL_TREE || ! TREE_CONSTANT (val))
15953         return NULL_TREE;
15954       TREE_OPERAND (node, 2) = val;
15955       return integer_zerop (TREE_OPERAND (node, 0)) ? TREE_OPERAND (node, 1)
15956         : TREE_OPERAND (node, 2);
15957
15958     case VAR_DECL:
15959     case FIELD_DECL:
15960       if (! FIELD_FINAL (node)
15961           || DECL_INITIAL (node) == NULL_TREE)
15962         return NULL_TREE;
15963       val = DECL_INITIAL (node);
15964       /* Guard against infinite recursion. */
15965       DECL_INITIAL (node) = NULL_TREE;
15966       val = fold_constant_for_init (val, node);
15967       if (val != NULL_TREE && TREE_CODE (val) != STRING_CST)
15968         val = try_builtin_assignconv (NULL_TREE, TREE_TYPE (node), val);
15969       DECL_INITIAL (node) = val;
15970       return val;
15971
15972     case EXPR_WITH_FILE_LOCATION:
15973       /* Compare java_complete_tree and resolve_expression_name. */
15974       if (!EXPR_WFL_NODE (node) /* Or a PRIMARY flag ? */
15975           || TREE_CODE (EXPR_WFL_NODE (node)) == IDENTIFIER_NODE)
15976         {
15977           tree name = EXPR_WFL_NODE (node);
15978           tree decl;
15979           if (PRIMARY_P (node))
15980             return NULL_TREE;
15981           else if (! QUALIFIED_P (name))
15982             {
15983               decl = lookup_field_wrapper (DECL_CONTEXT (context), name);
15984               if (decl == NULL_TREE
15985                   || (! FIELD_STATIC (decl) && ! FIELD_FINAL (decl)))
15986                 return NULL_TREE;
15987               return fold_constant_for_init (decl, decl);
15988             }
15989           else
15990             {
15991               /* Install the proper context for the field resolution.
15992                  The prior context is restored once the name is
15993                  properly qualified. */
15994               tree saved_current_class = current_class;
15995               /* Wait until the USE_COMPONENT_REF re-write.  FIXME. */
15996               current_class = DECL_CONTEXT (context);
15997               qualify_ambiguous_name (node);
15998               current_class = saved_current_class;
15999               if (resolve_field_access (node, &decl, NULL)
16000                   && decl != NULL_TREE)
16001                 return fold_constant_for_init (decl, decl);
16002               return NULL_TREE;
16003             }
16004         }
16005       else
16006         {
16007           op0 = TREE_OPERAND (node, 0);
16008           val = fold_constant_for_init (op0, context);
16009           if (val == NULL_TREE || ! TREE_CONSTANT (val))
16010             return NULL_TREE;
16011           TREE_OPERAND (node, 0) = val;
16012           return val;
16013         }
16014
16015 #ifdef USE_COMPONENT_REF
16016     case IDENTIFIER:
16017     case COMPONENT_REF:
16018       ?;
16019 #endif
16020
16021     default:
16022       return NULL_TREE;
16023     }
16024 }
16025
16026 #ifdef USE_COMPONENT_REF
16027 /* Context is 'T' for TypeName, 'P' for PackageName,
16028    'M' for MethodName, 'E' for ExpressionName, and 'A' for AmbiguousName. */
16029
16030 tree
16031 resolve_simple_name (tree name, int context)
16032 {
16033 }
16034
16035 tree
16036 resolve_qualified_name (tree name, int context)
16037 {
16038 }
16039 #endif
16040
16041 void
16042 init_src_parse (void)
16043 {
16044   /* Sanity check; we've been bit by this before.  */
16045   if (ARRAY_SIZE (ctxp->modifier_ctx) != MODIFIER_TK - PUBLIC_TK)
16046     abort ();
16047 }
16048
16049 \f
16050
16051 /* This section deals with the functions that are called when tables
16052    recording class initialization information are traversed.  */
16053
16054 /* Attach to PTR (a block) the declaration found in ENTRY. */
16055
16056 static int
16057 attach_init_test_initialization_flags (void **entry, void *ptr)
16058 {
16059   tree block = (tree)ptr;
16060   struct treetreehash_entry *ite = (struct treetreehash_entry *) *entry;
16061
16062   if (block != error_mark_node)
16063     {
16064       TREE_CHAIN (ite->value) = BLOCK_EXPR_DECLS (block);
16065       BLOCK_EXPR_DECLS (block) = ite->value;
16066     }
16067   return true;
16068 }
16069
16070 /* This function is called for each class that is known definitely
16071    initialized when a given static method was called. This function
16072    augments a compound expression (INFO) storing all assignment to
16073    initialized static class flags if a flag already existed, otherwise
16074    a new one is created.  */
16075
16076 static int
16077 emit_test_initialization (void **entry_p, void *info)
16078 {
16079   tree l = (tree) info;
16080   tree decl, init;
16081   tree key = (tree) *entry_p;
16082   tree *ite;
16083   htab_t cf_ht = DECL_FUNCTION_INIT_TEST_TABLE (current_function_decl);
16084
16085   /* If we haven't found a flag and we're dealing with self registered
16086      with current_function_decl, then don't do anything. Self is
16087      always added as definitely initialized but this information is
16088      valid only if used outside the current function. */
16089   if (current_function_decl == TREE_PURPOSE (l)
16090       && java_treetreehash_find (cf_ht, key) == NULL)
16091     return true;
16092
16093   ite = java_treetreehash_new (cf_ht, key);
16094
16095   /* If we don't have a variable, create one and install it. */
16096   if (*ite == NULL)
16097     {
16098       tree block;
16099
16100       decl = build_decl (VAR_DECL, NULL_TREE, boolean_type_node);
16101       MAYBE_CREATE_VAR_LANG_DECL_SPECIFIC (decl);
16102       LOCAL_CLASS_INITIALIZATION_FLAG (decl) = 1;
16103       DECL_CONTEXT (decl) = current_function_decl;
16104       DECL_INITIAL (decl) = boolean_true_node;
16105       /* Don't emit any symbolic debugging info for this decl.  */
16106       DECL_IGNORED_P (decl) = 1;
16107
16108       /* The trick is to find the right context for it. */
16109       block = BLOCK_SUBBLOCKS (GET_CURRENT_BLOCK (current_function_decl));
16110       TREE_CHAIN (decl) = BLOCK_EXPR_DECLS (block);
16111       BLOCK_EXPR_DECLS (block) = decl;
16112       *ite = decl;
16113     }
16114   else
16115     decl = *ite;
16116
16117   /* Now simply augment the compound that holds all the assignments
16118      pertaining to this method invocation. */
16119   init = build (MODIFY_EXPR, boolean_type_node, decl, boolean_true_node);
16120   TREE_SIDE_EFFECTS (init) = 1;
16121   TREE_VALUE (l) = add_stmt_to_compound (TREE_VALUE (l), void_type_node, init);
16122   TREE_SIDE_EFFECTS (TREE_VALUE (l)) = 1;
16123
16124   return true;
16125 }
16126
16127 #include "gt-java-parse.h"
16128 #include "gtype-java.h"