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
   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
  75 /* Local function prototypes */
  76 static char *java_accstring_lookup (int);
  77 static void  classitf_redefinition_error (const char *,tree, tree, tree);
  78 static void  variable_redefinition_error (tree, tree, tree, int);
  79 static tree  create_class (int, tree, tree, tree);
  80 static tree  create_interface (int, tree, tree);
  81 static void  end_class_declaration (int);
  82 static tree  find_field (tree, tree);
  83 static tree lookup_field_wrapper (tree, tree);
  84 static int   duplicate_declaration_error_p (tree, tree, tree);
  85 static void  register_fields (int, tree, tree);
  86 static tree parser_qualified_classname (tree);
  87 static int  parser_check_super (tree, tree, tree);
  88 static int  parser_check_super_interface (tree, tree, tree);
  89 static void check_modifiers_consistency (int);
  90 static tree lookup_cl (tree);
  91 static tree lookup_java_method2 (tree, tree, int);
  92 static tree method_header (int, tree, tree, tree);
  93 static void fix_method_argument_names (tree ,tree);
  94 static tree method_declarator (tree, tree);
  95 static void parse_warning_context (tree cl, const char *msg, ...)
  96   ATTRIBUTE_PRINTF_2;
  97 static void issue_warning_error_from_context (tree, const char *msg, va_list)
  98   ATTRIBUTE_PRINTF (2, 0);
  99 static void parse_ctor_invocation_error (void);
 100 static tree parse_jdk1_1_error (const char *);
 101 static void complete_class_report_errors (jdep *);
 102 static int process_imports (void);
 103 static void read_import_dir (tree);
 104 static int find_in_imports_on_demand (tree, tree);
 105 static void find_in_imports (tree, tree);
 106 static void check_inner_class_access (tree, tree, tree);
 107 static int check_pkg_class_access (tree, tree, bool);
 108 static void register_package (tree);
 109 static tree resolve_package (tree, tree *, tree *);
 110 static tree resolve_class (tree, tree, tree, tree);
 111 static void declare_local_variables (int, tree, tree);
 112 static void dump_java_tree (enum tree_dump_index, tree);
 113 static void source_start_java_method (tree);
 114 static void source_end_java_method (void);
 115 static tree find_name_in_single_imports (tree);
 116 static void check_abstract_method_header (tree);
 117 static tree lookup_java_interface_method2 (tree, tree);
 118 static tree resolve_expression_name (tree, tree *);
 119 static tree maybe_create_class_interface_decl (tree, tree, tree, tree);
 120 static int check_class_interface_creation (int, int, tree, tree, tree, tree);
 121 static tree patch_method_invocation (tree, tree, tree, int, int *, tree *);
 122 static int breakdown_qualified (tree *, tree *, tree);
 123 static int in_same_package (tree, tree);
 124 static tree resolve_and_layout (tree, tree);
 125 static tree qualify_and_find (tree, tree, tree);
 126 static tree resolve_no_layout (tree, tree);
 127 static int invocation_mode (tree, int);
 128 static tree find_applicable_accessible_methods_list (int, tree, tree, tree);
 129 static void search_applicable_methods_list (int, tree, tree, tree, tree *, tree *);
 130 static tree find_most_specific_methods_list (tree);
 131 static int argument_types_convertible (tree, tree);
 132 static tree patch_invoke (tree, tree, tree);
 133 static int maybe_use_access_method (int, tree *, tree *);
 134 static tree lookup_method_invoke (int, tree, tree, tree, tree);
 135 static tree register_incomplete_type (int, tree, tree, tree);
 136 static tree check_inner_circular_reference (tree, tree);
 137 static tree check_circular_reference (tree);
 138 static tree obtain_incomplete_type (tree);
 139 static tree java_complete_lhs (tree);
 140 static tree java_complete_tree (tree);
 141 static tree maybe_generate_pre_expand_clinit (tree);
 142 static int analyze_clinit_body (tree, tree);
 143 static int maybe_yank_clinit (tree);
 144 static void start_complete_expand_method (tree);
 145 static void java_complete_expand_method (tree);
 146 static void java_expand_method_bodies (tree);
 147 static int  unresolved_type_p (tree, tree *);
 148 static void create_jdep_list (struct parser_ctxt *);
 149 static tree build_expr_block (tree, tree);
 150 static tree enter_block (void);
 151 static tree exit_block (void);
 152 static tree lookup_name_in_blocks (tree);
 153 static void maybe_absorb_scoping_blocks (void);
 154 static tree build_method_invocation (tree, tree);
 155 static tree build_new_invocation (tree, tree);
 156 static tree build_assignment (int, int, tree, tree);
 157 static tree build_binop (enum tree_code, int, tree, tree);
 158 static tree patch_assignment (tree, tree);
 159 static tree patch_binop (tree, tree, tree);
 160 static tree build_unaryop (int, int, tree);
 161 static tree build_incdec (int, int, tree, int);
 162 static tree patch_unaryop (tree, tree);
 163 static tree build_cast (int, tree, tree);
 164 static tree build_null_of_type (tree);
 165 static tree patch_cast (tree, tree);
 166 static int valid_ref_assignconv_cast_p (tree, tree, int);
 167 static int valid_builtin_assignconv_identity_widening_p (tree, tree);
 168 static int valid_cast_to_p (tree, tree);
 169 static int valid_method_invocation_conversion_p (tree, tree);
 170 static tree try_builtin_assignconv (tree, tree, tree);
 171 static tree try_reference_assignconv (tree, tree);
 172 static tree build_unresolved_array_type (tree);
 173 static int build_type_name_from_array_name (tree, tree *);
 174 static tree build_array_from_name (tree, tree, tree, tree *);
 175 static tree build_array_ref (int, tree, tree);
 176 static tree patch_array_ref (tree);
 177 static tree make_qualified_name (tree, tree, int);
 178 static tree merge_qualified_name (tree, tree);
 179 static tree make_qualified_primary (tree, tree, int);
 180 static int resolve_qualified_expression_name (tree, tree *, tree *, tree *);
 181 static void qualify_ambiguous_name (tree);
 182 static tree resolve_field_access (tree, tree *, tree *);
 183 static tree build_newarray_node (tree, tree, int);
 184 static tree patch_newarray (tree);
 185 static tree resolve_type_during_patch (tree);
 186 static tree build_this (int);
 187 static tree build_wfl_wrap (tree, int);
 188 static tree build_return (int, tree);
 189 static tree patch_return (tree);
 190 static tree maybe_access_field (tree, tree, tree);
 191 static int complete_function_arguments (tree);
 192 static int check_for_static_method_reference (tree, tree, tree, tree, tree);
 193 static int not_accessible_p (tree, tree, tree, int);
 194 static void check_deprecation (tree, tree);
 195 static int class_in_current_package (tree);
 196 static tree build_if_else_statement (int, tree, tree, tree);
 197 static tree patch_if_else_statement (tree);
 198 static tree add_stmt_to_compound (tree, tree, tree);
 199 static tree add_stmt_to_block (tree, tree, tree);
 200 static tree patch_exit_expr (tree);
 201 static tree build_labeled_block (int, tree);
 202 static tree finish_labeled_statement (tree, tree);
 203 static tree build_bc_statement (int, int, tree);
 204 static tree patch_bc_statement (tree);
 205 static tree patch_loop_statement (tree);
 206 static tree build_new_loop (tree);
 207 static tree build_loop_body (int, tree, int);
 208 static tree finish_loop_body (int, tree, tree, int);
 209 static tree build_debugable_stmt (int, tree);
 210 static tree finish_for_loop (int, tree, tree, tree);
 211 static tree patch_switch_statement (tree);
 212 static tree string_constant_concatenation (tree, tree);
 213 static tree build_string_concatenation (tree, tree);
 214 static tree patch_string_cst (tree);
 215 static tree patch_string (tree);
 216 static tree encapsulate_with_try_catch (int, tree, tree, tree);
 217 static tree build_assertion (int, tree, tree);
 218 static tree build_try_statement (int, tree, tree);
 219 static tree build_try_finally_statement (int, tree, tree);
 220 static tree patch_try_statement (tree);
 221 static tree patch_synchronized_statement (tree, tree);
 222 static tree patch_throw_statement (tree, tree);
 223 static void check_thrown_exceptions (int, tree);
 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_throws_clauses (tree, tree, tree);
 228 static void finish_method_declaration (tree);
 229 static tree build_super_invocation (tree);
 230 static int verify_constructor_circularity (tree, tree);
 231 static char *constructor_circularity_msg (tree, tree);
 232 static tree build_this_super_qualified_invocation (int, tree, tree, int, int);
 233 static const char *get_printable_method_name (tree);
 234 static tree patch_conditional_expr (tree, tree, tree);
 235 static tree generate_finit (tree);
 236 static tree generate_instinit (tree);
 237 static tree build_instinit_invocation (tree);
 238 static void fix_constructors (tree);
 239 static tree build_alias_initializer_parameter_list (int, tree, tree, int *);
 240 static tree craft_constructor (tree, tree);
 241 static int verify_constructor_super (tree);
 242 static tree create_artificial_method (tree, int, tree, tree, tree);
 243 static void start_artificial_method_body (tree);
 244 static void end_artificial_method_body (tree);
 245 static int check_method_redefinition (tree, tree);
 246 static int check_method_types_complete (tree);
 247 static void java_check_regular_methods (tree);
 248 static void java_check_abstract_methods (tree);
 249 static void unreachable_stmt_error (tree);
 250 static tree find_expr_with_wfl (tree);
 251 static void missing_return_error (tree);
 252 static tree build_new_array_init (int, tree);
 253 static tree patch_new_array_init (tree, tree);
 254 static tree maybe_build_array_element_wfl (tree);
 255 static int array_constructor_check_entry (tree, tree);
 256 static const char *purify_type_name (const char *);
 257 static tree fold_constant_for_init (tree, tree);
 258 static tree strip_out_static_field_access_decl (tree);
 259 static jdeplist *reverse_jdep_list (struct parser_ctxt *);
 260 static void static_ref_err (tree, tree, tree);
 261 static void parser_add_interface (tree, tree, tree);
 262 static void add_superinterfaces (tree, tree);
 263 static tree jdep_resolve_class (jdep *);
 264 static int note_possible_classname (const char *, int);
 265 static void java_complete_expand_classes (void);
 266 static void java_complete_expand_class (tree);
 267 static void java_complete_expand_methods (tree);
 268 static tree cut_identifier_in_qualified (tree);
 269 static tree java_stabilize_reference (tree);
 270 static tree do_unary_numeric_promotion (tree);
 271 static char * operator_string (tree);
 272 static tree do_merge_string_cste (tree, const char *, int, int);
 273 static tree merge_string_cste (tree, tree, int);
 274 static tree java_refold (tree);
 275 static int java_decl_equiv (tree, tree);
 276 static int binop_compound_p (enum tree_code);
 277 static tree search_loop (tree);
 278 static int labeled_block_contains_loop_p (tree, tree);
 279 static int check_abstract_method_definitions (int, tree, tree);
 280 static void java_check_abstract_method_definitions (tree);
 281 static void java_debug_context_do (int);
 282 static void java_parser_context_push_initialized_field (void);
 283 static void java_parser_context_pop_initialized_field (void);
 284 static tree reorder_static_initialized (tree);
 285 static void java_parser_context_suspend (void);
 286 static void java_parser_context_resume (void);
 287 static int pop_current_osb (struct parser_ctxt *);
 288
 289 /* JDK 1.1 work. FIXME */
 290
 291 static tree maybe_make_nested_class_name (tree);
 292 static int make_nested_class_name (tree);
 293 static void set_nested_class_simple_name_value (tree, int);
 294 static void link_nested_class_to_enclosing (void);
 295 static tree resolve_inner_class (htab_t, tree, tree *, tree *, tree);
 296 static tree find_as_inner_class (tree, tree, tree);
 297 static tree find_as_inner_class_do (tree, tree);
 298 static int check_inner_class_redefinition (tree, tree);
 299
 300 static tree build_thisn_assign (void);
 301 static tree build_current_thisn (tree);
 302 static tree build_access_to_thisn (tree, tree, int);
 303 static tree maybe_build_thisn_access_method (tree);
 304
 305 static tree build_outer_field_access (tree, tree);
 306 static tree build_outer_field_access_methods (tree);
 307 static tree build_outer_field_access_expr (int, tree, tree,
 308                                                   tree, tree);
 309 static tree build_outer_method_access_method (tree);
 310 static tree build_new_access_id (void);
 311 static tree build_outer_field_access_method (tree, tree, tree,
 312                                                     tree, tree);
 313
 314 static int outer_field_access_p (tree, tree);
 315 static int outer_field_expanded_access_p (tree, tree *,
 316                                                  tree *, tree *);
 317 static tree outer_field_access_fix (tree, tree, tree);
 318 static tree build_incomplete_class_ref (int, tree);
 319 static tree patch_incomplete_class_ref (tree);
 320 static tree create_anonymous_class (int, tree);
 321 static void patch_anonymous_class (tree, tree, tree);
 322 static void add_inner_class_fields (tree, tree);
 323
 324 static tree build_dot_class_method (tree);
 325 static tree build_dot_class_method_invocation (tree);
 326 static void create_new_parser_context (int);
 327 static tree maybe_build_class_init_for_field (tree, tree);
 328
 329 static int attach_init_test_initialization_flags (void **, void *);
 330 static int emit_test_initialization (void **, void *);
 331
 332 static char *string_convert_int_cst (tree);
 333
 334 /* Number of error found so far. */
 335 int java_error_count;
 336 /* Number of warning found so far. */
 337 int java_warning_count;
 338 /* Tell when not to fold, when doing xrefs */
 339 int do_not_fold;
 340 /* Cyclic inheritance report, as it can be set by layout_class */
 341 const char *cyclic_inheritance_report;
 342
 343 /* The current parser context */
 344 struct parser_ctxt *ctxp;
 345
 346 /* List of things that were analyzed for which code will be generated */
 347 struct parser_ctxt *ctxp_for_generation = NULL;
 348
 349 /* binop_lookup maps token to tree_code. It is used where binary
 350    operations are involved and required by the parser. RDIV_EXPR
 351    covers both integral/floating point division. The code is changed
 352    once the type of both operator is worked out.  */
 353
 354 static const enum tree_code binop_lookup[19] =
 355   {
 356     PLUS_EXPR, MINUS_EXPR, MULT_EXPR, RDIV_EXPR, TRUNC_MOD_EXPR,
 357     LSHIFT_EXPR, RSHIFT_EXPR, URSHIFT_EXPR,
 358     BIT_AND_EXPR, BIT_XOR_EXPR, BIT_IOR_EXPR,
 359     TRUTH_ANDIF_EXPR, TRUTH_ORIF_EXPR,
 360     EQ_EXPR, NE_EXPR, GT_EXPR, GE_EXPR, LT_EXPR, LE_EXPR,
 361    };
 362 #define BINOP_LOOKUP(VALUE)                                             \
 363   binop_lookup [((VALUE) - PLUS_TK) % ARRAY_SIZE (binop_lookup)]
 364
 365 /* This is the end index for binary operators that can also be used
 366    in compound assignements. */
 367 #define BINOP_COMPOUND_CANDIDATES 11
 368
 369 /* The "$L" identifier we use to create labels.  */
 370 static GTY(()) tree label_id;
 371
 372 /* The "StringBuffer" identifier used for the String `+' operator. */
 373 static GTY(()) tree wfl_string_buffer;
 374
 375 /* The "append" identifier used for String `+' operator.  */
 376 static GTY(()) tree wfl_append;
 377
 378 /* The "toString" identifier used for String `+' operator. */
 379 static GTY(()) tree wfl_to_string;
 380
 381 /* The "java.lang" import qualified name.  */
 382 static GTY(()) tree java_lang_id;
 383
 384 /* The generated `inst$' identifier used for generated enclosing
 385    instance/field access functions.  */
 386 static GTY(()) tree inst_id;
 387
 388 /* Context and flag for static blocks */
 389 static GTY(()) tree current_static_block;
 390
 391 /* The generated `write_parm_value$' identifier.  */
 392 static GTY(()) tree wpv_id;
 393
 394 /* The list of all packages we've seen so far */
 395 static GTY(()) tree package_list;
 396
 397 /* Hold THIS for the scope of the current method decl.  */
 398 static GTY(()) tree current_this;
 399
 400 /* Hold a list of catch clauses list. The first element of this list is
 401    the list of the catch clauses of the currently analysed try block. */
 402 static GTY(()) tree currently_caught_type_list;
 403
 404 /* This holds a linked list of all the case labels for the current
 405    switch statement.  It is only used when checking to see if there
 406    are duplicate labels.  FIXME: probably this should just be attached
 407    to the switch itself; then it could be referenced via
 408    `ctxp->current_loop'.  */
 409 static GTY(()) tree case_label_list;
 410
 411 /* Anonymous class counter. Will be reset to 1 every time a non
 412    anonymous class gets created. */
 413 static int anonymous_class_counter = 1;
 414
 415 static GTY(()) tree src_parse_roots[1];
 416
 417 /* All classes seen from source code */
 418 #define gclass_list src_parse_roots[0]
 419
 420 /* Check modifiers. If one doesn't fit, retrieve it in its declaration
 421    line and point it out.  */
 422 /* Should point out the one that don't fit. ASCII/unicode, going
 423    backward. FIXME */
 424
 425 #define check_modifiers(__message, __value, __mask) do {        \
 426   if ((__value) & ~(__mask))                                    \
 427     {                                                           \
 428       size_t i, remainder = (__value) & ~(__mask);              \
 429       for (i = 0; i < ARRAY_SIZE (ctxp->modifier_ctx); i++)     \
 430         if ((1 << i) & remainder)                               \
 431           parse_error_context (ctxp->modifier_ctx [i], (__message), \
 432                                java_accstring_lookup (1 << i)); \
 433     }                                                           \
 434 } while (0)
 435
 436 %}
 437
 438 %union {
 439   tree node;
 440   int sub_token;
 441   struct {
 442     int token;
 443     int location;
 444   } operator;
 445   int value;
 446 }
 447
 448 %{
 449 #include "lex.c"
 450 %}
 451
 452 %pure_parser
 453
 454 /* Things defined here have to match the order of what's in the
 455    binop_lookup table.  */
 456
 457 %token   PLUS_TK         MINUS_TK        MULT_TK         DIV_TK    REM_TK
 458 %token   LS_TK           SRS_TK          ZRS_TK
 459 %token   AND_TK          XOR_TK          OR_TK
 460 %token   BOOL_AND_TK BOOL_OR_TK
 461 %token   EQ_TK NEQ_TK GT_TK GTE_TK LT_TK LTE_TK
 462
 463 /* This maps to the same binop_lookup entry than the token above */
 464
 465 %token   PLUS_ASSIGN_TK  MINUS_ASSIGN_TK MULT_ASSIGN_TK DIV_ASSIGN_TK
 466 %token   REM_ASSIGN_TK
 467 %token   LS_ASSIGN_TK    SRS_ASSIGN_TK   ZRS_ASSIGN_TK
 468 %token   AND_ASSIGN_TK   XOR_ASSIGN_TK   OR_ASSIGN_TK
 469
 470
 471 /* Modifier TOKEN have to be kept in this order. Don't scramble it */
 472
 473 %token   PUBLIC_TK       PRIVATE_TK         PROTECTED_TK
 474 %token   STATIC_TK       FINAL_TK           SYNCHRONIZED_TK
 475 %token   VOLATILE_TK     TRANSIENT_TK       NATIVE_TK
 476 %token   PAD_TK          ABSTRACT_TK        STRICT_TK
 477 %token   MODIFIER_TK
 478
 479 /* Keep those two in order, too */
 480 %token   DECR_TK INCR_TK
 481
 482 /* From now one, things can be in any order */
 483
 484 %token   DEFAULT_TK      IF_TK              THROW_TK
 485 %token   BOOLEAN_TK      DO_TK              IMPLEMENTS_TK
 486 %token   THROWS_TK       BREAK_TK           IMPORT_TK
 487 %token   ELSE_TK         INSTANCEOF_TK      RETURN_TK
 488 %token   VOID_TK         CATCH_TK           INTERFACE_TK
 489 %token   CASE_TK         EXTENDS_TK         FINALLY_TK
 490 %token   SUPER_TK        WHILE_TK           CLASS_TK
 491 %token   SWITCH_TK       CONST_TK           TRY_TK
 492 %token   FOR_TK          NEW_TK             CONTINUE_TK
 493 %token   GOTO_TK         PACKAGE_TK         THIS_TK
 494 %token   ASSERT_TK
 495
 496 %token   BYTE_TK         SHORT_TK           INT_TK            LONG_TK
 497 %token   CHAR_TK         INTEGRAL_TK
 498
 499 %token   FLOAT_TK        DOUBLE_TK          FP_TK
 500
 501 %token   ID_TK
 502
 503 %token   REL_QM_TK         REL_CL_TK NOT_TK  NEG_TK
 504
 505 %token   ASSIGN_ANY_TK   ASSIGN_TK
 506 %token   OP_TK  CP_TK  OCB_TK  CCB_TK  OSB_TK  CSB_TK  SC_TK  C_TK DOT_TK
 507
 508 %token   STRING_LIT_TK   CHAR_LIT_TK        INT_LIT_TK        FP_LIT_TK
 509 %token   TRUE_TK         FALSE_TK           BOOL_LIT_TK       NULL_TK
 510
 511 %type    <value>        modifiers MODIFIER_TK final synchronized
 512
 513 %type    <node>         super ID_TK identifier
 514 %type    <node>         name simple_name qualified_name
 515 %type    <node>         type_declaration compilation_unit
 516                         field_declaration method_declaration extends_interfaces
 517                         interfaces interface_type_list
 518                         import_declarations package_declaration
 519                         type_declarations interface_body
 520                         interface_member_declaration constant_declaration
 521                         interface_member_declarations interface_type
 522                         abstract_method_declaration
 523 %type    <node>         class_body_declaration class_member_declaration
 524                         static_initializer constructor_declaration block
 525 %type    <node>         class_body_declarations constructor_header
 526 %type    <node>         class_or_interface_type class_type class_type_list
 527                         constructor_declarator explicit_constructor_invocation
 528 %type    <node>         dim_expr dim_exprs this_or_super throws
 529
 530 %type    <node>         variable_declarator_id variable_declarator
 531                         variable_declarators variable_initializer
 532                         variable_initializers constructor_body
 533                         array_initializer
 534
 535 %type    <node>         class_body block_end constructor_block_end
 536 %type    <node>         statement statement_without_trailing_substatement
 537                         labeled_statement if_then_statement label_decl
 538                         if_then_else_statement while_statement for_statement
 539                         statement_nsi labeled_statement_nsi do_statement
 540                         if_then_else_statement_nsi while_statement_nsi
 541                         for_statement_nsi statement_expression_list for_init
 542                         for_update statement_expression expression_statement
 543                         primary_no_new_array expression primary
 544                         array_creation_expression array_type
 545                         class_instance_creation_expression field_access
 546                         method_invocation array_access something_dot_new
 547                         argument_list postfix_expression while_expression
 548                         post_increment_expression post_decrement_expression
 549                         unary_expression_not_plus_minus unary_expression
 550                         pre_increment_expression pre_decrement_expression
 551                         cast_expression
 552                         multiplicative_expression additive_expression
 553                         shift_expression relational_expression
 554                         equality_expression and_expression
 555                         exclusive_or_expression inclusive_or_expression
 556                         conditional_and_expression conditional_or_expression
 557                         conditional_expression assignment_expression
 558                         left_hand_side assignment for_header for_begin
 559                         constant_expression do_statement_begin empty_statement
 560                         switch_statement synchronized_statement throw_statement
 561                         try_statement assert_statement
 562                         switch_expression switch_block
 563                         catches catch_clause catch_clause_parameter finally
 564                         anonymous_class_creation trap_overflow_corner_case
 565 %type    <node>         return_statement break_statement continue_statement
 566
 567 %type    <operator>     ASSIGN_TK      MULT_ASSIGN_TK  DIV_ASSIGN_TK
 568 %type    <operator>     REM_ASSIGN_TK  PLUS_ASSIGN_TK  MINUS_ASSIGN_TK
 569 %type    <operator>     LS_ASSIGN_TK   SRS_ASSIGN_TK   ZRS_ASSIGN_TK
 570 %type    <operator>     AND_ASSIGN_TK  XOR_ASSIGN_TK   OR_ASSIGN_TK
 571 %type    <operator>     ASSIGN_ANY_TK  assignment_operator
 572 %token   <operator>     EQ_TK GTE_TK ZRS_TK SRS_TK GT_TK LTE_TK LS_TK
 573 %token   <operator>     BOOL_AND_TK AND_TK BOOL_OR_TK OR_TK INCR_TK PLUS_TK
 574 %token   <operator>     DECR_TK MINUS_TK MULT_TK DIV_TK XOR_TK REM_TK NEQ_TK
 575 %token   <operator>     NEG_TK REL_QM_TK REL_CL_TK NOT_TK LT_TK OCB_TK CCB_TK
 576 %token   <operator>     OP_TK OSB_TK DOT_TK THROW_TK INSTANCEOF_TK
 577 %type    <operator>     THIS_TK SUPER_TK RETURN_TK BREAK_TK CONTINUE_TK
 578 %type    <operator>     CASE_TK DEFAULT_TK TRY_TK CATCH_TK SYNCHRONIZED_TK
 579 %type    <operator>     NEW_TK ASSERT_TK
 580
 581 %type    <node>         method_body
 582
 583 %type    <node>         literal INT_LIT_TK FP_LIT_TK BOOL_LIT_TK CHAR_LIT_TK
 584                         STRING_LIT_TK NULL_TK VOID_TK
 585
 586 %type    <node>         IF_TK WHILE_TK FOR_TK
 587
 588 %type    <node>         formal_parameter_list formal_parameter
 589                         method_declarator method_header
 590
 591 %type    <node>         primitive_type reference_type type
 592                         BOOLEAN_TK INTEGRAL_TK FP_TK
 593
 594 /* Added or modified JDK 1.1 rule types  */
 595 %type    <node>         type_literals
 596
 597 %%
 598 /* 19.2 Production from 2.3: The Syntactic Grammar  */
 599 goal:  compilation_unit
 600                 {}
 601 ;
 602
 603 /* 19.3 Productions from 3: Lexical structure  */
 604 literal:
 605         INT_LIT_TK
 606 |       FP_LIT_TK
 607 |       BOOL_LIT_TK
 608 |       CHAR_LIT_TK
 609 |       STRING_LIT_TK
 610 |       NULL_TK
 611 ;
 612
 613 /* 19.4 Productions from 4: Types, Values and Variables  */
 614 type:
 615         primitive_type
 616 |       reference_type
 617 ;
 618
 619 primitive_type:
 620         INTEGRAL_TK
 621 |       FP_TK
 622 |       BOOLEAN_TK
 623 ;
 624
 625 reference_type:
 626         class_or_interface_type
 627 |       array_type
 628 ;
 629
 630 class_or_interface_type:
 631         name
 632 ;
 633
 634 class_type:
 635         class_or_interface_type /* Default rule */
 636 ;
 637
 638 interface_type:
 639          class_or_interface_type
 640 ;
 641
 642 array_type:
 643         primitive_type dims
 644                 {
 645                   int osb = pop_current_osb (ctxp);
 646                   tree t = build_java_array_type (($1), -1);
 647                   while (--osb)
 648                     t = build_unresolved_array_type (t);
 649                   $$ = t;
 650                 }
 651 |       name dims
 652                 {
 653                   int osb = pop_current_osb (ctxp);
 654                   tree t = $1;
 655                   while (osb--)
 656                     t = build_unresolved_array_type (t);
 657                   $$ = t;
 658                 }
 659 ;
 660
 661 /* 19.5 Productions from 6: Names  */
 662 name:
 663         simple_name             /* Default rule */
 664 |       qualified_name          /* Default rule */
 665 ;
 666
 667 simple_name:
 668         identifier              /* Default rule */
 669 ;
 670
 671 qualified_name:
 672         name DOT_TK identifier
 673                 { $$ = make_qualified_name ($1, $3, $2.location); }
 674 ;
 675
 676 identifier:
 677         ID_TK
 678 ;
 679
 680 /* 19.6: Production from 7: Packages  */
 681 compilation_unit:
 682                 {$$ = NULL;}
 683 |       package_declaration
 684 |       import_declarations
 685 |       type_declarations
 686 |       package_declaration import_declarations
 687 |       package_declaration type_declarations
 688 |       import_declarations type_declarations
 689 |       package_declaration import_declarations type_declarations
 690 ;
 691
 692 import_declarations:
 693         import_declaration
 694                 {
 695                   $$ = NULL;
 696                 }
 697 |       import_declarations import_declaration
 698                 {
 699                   $$ = NULL;
 700                 }
 701 ;
 702
 703 type_declarations:
 704         type_declaration
 705 |       type_declarations type_declaration
 706 ;
 707
 708 package_declaration:
 709         PACKAGE_TK name SC_TK
 710                 {
 711                   ctxp->package = EXPR_WFL_NODE ($2);
 712                   register_package (ctxp->package);
 713                 }
 714 |       PACKAGE_TK error
 715                 {yyerror ("Missing name"); RECOVER;}
 716 |       PACKAGE_TK name error
 717                 {yyerror ("';' expected"); RECOVER;}
 718 ;
 719
 720 import_declaration:
 721         single_type_import_declaration
 722 |       type_import_on_demand_declaration
 723 ;
 724
 725 single_type_import_declaration:
 726         IMPORT_TK name SC_TK
 727                 {
 728                   tree name = EXPR_WFL_NODE ($2), last_name;
 729                   int   i = IDENTIFIER_LENGTH (name)-1;
 730                   const char *last = &IDENTIFIER_POINTER (name)[i];
 731                   while (last != IDENTIFIER_POINTER (name))
 732                     {
 733                       if (last [0] == '.')
 734                         break;
 735                       last--;
 736                     }
 737                   last_name = get_identifier (++last);
 738                   if (IS_A_SINGLE_IMPORT_CLASSFILE_NAME_P (last_name))
 739                     {
 740                       tree err = find_name_in_single_imports (last_name);
 741                       if (err && err != name)
 742                         parse_error_context
 743                           ($2, "Ambiguous class: `%s' and `%s'",
 744                            IDENTIFIER_POINTER (name),
 745                            IDENTIFIER_POINTER (err));
 746                       else
 747                         REGISTER_IMPORT ($2, last_name);
 748                     }
 749                   else
 750                     REGISTER_IMPORT ($2, last_name);
 751                 }
 752 |       IMPORT_TK error
 753                 {yyerror ("Missing name"); RECOVER;}
 754 |       IMPORT_TK name error
 755                 {yyerror ("';' expected"); RECOVER;}
 756 ;
 757
 758 type_import_on_demand_declaration:
 759         IMPORT_TK name DOT_TK MULT_TK SC_TK
 760                 {
 761                   tree name = EXPR_WFL_NODE ($2);
 762                   tree it;
 763                   /* Search for duplicates. */
 764                   for (it = ctxp->import_demand_list; it; it = TREE_CHAIN (it))
 765                     if (EXPR_WFL_NODE (TREE_PURPOSE (it)) == name)
 766                       break;
 767                   /* Don't import the same thing more than once, just ignore
 768                      duplicates (7.5.2) */
 769                   if (! it)
 770                     {
 771                       read_import_dir ($2);
 772                       ctxp->import_demand_list =
 773                         chainon (ctxp->import_demand_list,
 774                                  build_tree_list ($2, NULL_TREE));
 775                     }
 776                 }
 777 |       IMPORT_TK name DOT_TK error
 778                 {yyerror ("'*' expected"); RECOVER;}
 779 |       IMPORT_TK name DOT_TK MULT_TK error
 780                 {yyerror ("';' expected"); RECOVER;}
 781 ;
 782
 783 type_declaration:
 784         class_declaration
 785                 { end_class_declaration (0); }
 786 |       interface_declaration
 787                 { end_class_declaration (0); }
 788 |       empty_statement
 789 |       error
 790                 {
 791                   YYERROR_NOW;
 792                   yyerror ("Class or interface declaration expected");
 793                 }
 794 ;
 795
 796 /* 19.7 Shortened from the original:
 797    modifiers: modifier | modifiers modifier
 798    modifier: any of public...  */
 799 modifiers:
 800         MODIFIER_TK
 801                 {
 802                   $$ = (1 << $1);
 803                 }
 804 |       modifiers MODIFIER_TK
 805                 {
 806                   int acc = (1 << $2);
 807                   if ($$ & acc)
 808                     parse_error_context
 809                       (ctxp->modifier_ctx [$2], "Modifier `%s' declared twice",
 810                        java_accstring_lookup (acc));
 811                   else
 812                     {
 813                       $$ |= acc;
 814                     }
 815                 }
 816 ;
 817
 818 /* 19.8.1 Production from $8.1: Class Declaration */
 819 class_declaration:
 820         modifiers CLASS_TK identifier super interfaces
 821                 { create_class ($1, $3, $4, $5); }
 822         class_body
 823                 {;}
 824 |       CLASS_TK identifier super interfaces
 825                 { create_class (0, $2, $3, $4); }
 826         class_body
 827                 {;}
 828 |       modifiers CLASS_TK error
 829                 { yyerror ("Missing class name"); RECOVER; }
 830 |       CLASS_TK error
 831                 { yyerror ("Missing class name"); RECOVER; }
 832 |       CLASS_TK identifier error
 833                 {
 834                   if (!ctxp->class_err) yyerror ("'{' expected");
 835                   DRECOVER(class1);
 836                 }
 837 |       modifiers CLASS_TK identifier error
 838                 { if (!ctxp->class_err) yyerror ("'{' expected"); RECOVER; }
 839 ;
 840
 841 super:
 842                 { $$ = NULL; }
 843 |       EXTENDS_TK class_type
 844                 { $$ = $2; }
 845 |       EXTENDS_TK class_type error
 846                 {yyerror ("'{' expected"); ctxp->class_err=1;}
 847 |       EXTENDS_TK error
 848                 {yyerror ("Missing super class name"); ctxp->class_err=1;}
 849 ;
 850
 851 interfaces:
 852                 { $$ = NULL_TREE; }
 853 |       IMPLEMENTS_TK interface_type_list
 854                 { $$ = $2; }
 855 |       IMPLEMENTS_TK error
 856                 {
 857                   ctxp->class_err=1;
 858                   yyerror ("Missing interface name");
 859                 }
 860 ;
 861
 862 interface_type_list:
 863         interface_type
 864                 {
 865                   ctxp->interface_number = 1;
 866                   $$ = build_tree_list ($1, NULL_TREE);
 867                 }
 868 |       interface_type_list C_TK interface_type
 869                 {
 870                   ctxp->interface_number++;
 871                   $$ = chainon ($1, build_tree_list ($3, NULL_TREE));
 872                 }
 873 |       interface_type_list C_TK error
 874                 {yyerror ("Missing interface name"); RECOVER;}
 875 ;
 876
 877 class_body:
 878         OCB_TK CCB_TK
 879                 {
 880                   /* Store the location of the `}' when doing xrefs */
 881                   if (flag_emit_xref)
 882                     DECL_END_SOURCE_LINE (GET_CPC ()) =
 883                       EXPR_WFL_ADD_COL ($2.location, 1);
 884                   $$ = GET_CPC ();
 885                 }
 886 |       OCB_TK class_body_declarations CCB_TK
 887                 {
 888                   /* Store the location of the `}' when doing xrefs */
 889                   if (flag_emit_xref)
 890                     DECL_END_SOURCE_LINE (GET_CPC ()) =
 891                       EXPR_WFL_ADD_COL ($3.location, 1);
 892                   $$ = GET_CPC ();
 893                 }
 894 ;
 895
 896 class_body_declarations:
 897         class_body_declaration
 898 |       class_body_declarations class_body_declaration
 899 ;
 900
 901 class_body_declaration:
 902         class_member_declaration
 903 |       static_initializer
 904 |       constructor_declaration
 905 |       block                   /* Added, JDK1.1, instance initializer */
 906                 {
 907                   if ($1 != empty_stmt_node)
 908                     {
 909                       TREE_CHAIN ($1) = CPC_INSTANCE_INITIALIZER_STMT (ctxp);
 910                       SET_CPC_INSTANCE_INITIALIZER_STMT (ctxp, $1);
 911                     }
 912                 }
 913 ;
 914
 915 class_member_declaration:
 916         field_declaration
 917 |       method_declaration
 918 |       class_declaration       /* Added, JDK1.1 inner classes */
 919                 { end_class_declaration (1); }
 920 |       interface_declaration   /* Added, JDK1.1 inner interfaces */
 921                 { end_class_declaration (1); }
 922 |       empty_statement
 923 ;
 924
 925 /* 19.8.2 Productions from 8.3: Field Declarations  */
 926 field_declaration:
 927         type variable_declarators SC_TK
 928                 { register_fields (0, $1, $2); }
 929 |       modifiers type variable_declarators SC_TK
 930                 {
 931                   check_modifiers
 932                     ("Illegal modifier `%s' for field declaration",
 933                      $1, FIELD_MODIFIERS);
 934                   check_modifiers_consistency ($1);
 935                   register_fields ($1, $2, $3);
 936                 }
 937 ;
 938
 939 variable_declarators:
 940         /* Should we use build_decl_list () instead ? FIXME */
 941         variable_declarator     /* Default rule */
 942 |       variable_declarators C_TK variable_declarator
 943                 { $$ = chainon ($1, $3); }
 944 |       variable_declarators C_TK error
 945                 {yyerror ("Missing term"); RECOVER;}
 946 ;
 947
 948 variable_declarator:
 949         variable_declarator_id
 950                 { $$ = build_tree_list ($1, NULL_TREE); }
 951 |       variable_declarator_id ASSIGN_TK variable_initializer
 952                 {
 953                   if (java_error_count)
 954                     $3 = NULL_TREE;
 955                   $$ = build_tree_list
 956                     ($1, build_assignment ($2.token, $2.location, $1, $3));
 957                 }
 958 |       variable_declarator_id ASSIGN_TK error
 959                 {
 960                   yyerror ("Missing variable initializer");
 961                   $$ = build_tree_list ($1, NULL_TREE);
 962                   RECOVER;
 963                 }
 964 |       variable_declarator_id ASSIGN_TK variable_initializer error
 965                 {
 966                   yyerror ("';' expected");
 967                   $$ = build_tree_list ($1, NULL_TREE);
 968                   RECOVER;
 969                 }
 970 ;
 971
 972 variable_declarator_id:
 973         identifier
 974 |       variable_declarator_id OSB_TK CSB_TK
 975                 { $$ = build_unresolved_array_type ($1); }
 976 |       identifier error
 977                 {yyerror ("Invalid declaration"); DRECOVER(vdi);}
 978 |       variable_declarator_id OSB_TK error
 979                 {
 980                   yyerror ("']' expected");
 981                   DRECOVER(vdi);
 982                 }
 983 |       variable_declarator_id CSB_TK error
 984                 {yyerror ("Unbalanced ']'"); DRECOVER(vdi);}
 985 ;
 986
 987 variable_initializer:
 988         expression
 989 |       array_initializer
 990 ;
 991
 992 /* 19.8.3 Productions from 8.4: Method Declarations  */
 993 method_declaration:
 994         method_header
 995                 {
 996                   current_function_decl = $1;
 997                   if (current_function_decl
 998                       && TREE_CODE (current_function_decl) == FUNCTION_DECL)
 999                     source_start_java_method (current_function_decl);
1000                   else
1001                     current_function_decl = NULL_TREE;
1002                 }
1003         method_body
1004                 { finish_method_declaration ($3); }
1005 |       method_header error
1006                 {YYNOT_TWICE yyerror ("'{' expected"); RECOVER;}
1007 ;
1008
1009 method_header:
1010         type method_declarator throws
1011                 { $$ = method_header (0, $1, $2, $3); }
1012 |       VOID_TK method_declarator throws
1013                 { $$ = method_header (0, void_type_node, $2, $3); }
1014 |       modifiers type method_declarator throws
1015                 { $$ = method_header ($1, $2, $3, $4); }
1016 |       modifiers VOID_TK method_declarator throws
1017                 { $$ = method_header ($1, void_type_node, $3, $4); }
1018 |       type error
1019                 {
1020                   yyerror ("Invalid method declaration, method name required");
1021                   RECOVER;
1022                 }
1023 |       modifiers type error
1024                 {
1025                   yyerror ("Identifier expected");
1026                   RECOVER;
1027                 }
1028 |       VOID_TK error
1029                 {
1030                   yyerror ("Identifier expected");
1031                   RECOVER;
1032                 }
1033 |       modifiers VOID_TK error
1034                 {
1035                   yyerror ("Identifier expected");
1036                   RECOVER;
1037                 }
1038 |       modifiers error
1039                 {
1040                   yyerror ("Invalid method declaration, return type required");
1041                   RECOVER;
1042                 }
1043 ;
1044
1045 method_declarator:
1046         identifier OP_TK CP_TK
1047                 {
1048                   ctxp->formal_parameter_number = 0;
1049                   $$ = method_declarator ($1, NULL_TREE);
1050                 }
1051 |       identifier OP_TK formal_parameter_list CP_TK
1052                 { $$ = method_declarator ($1, $3); }
1053 |       method_declarator OSB_TK CSB_TK
1054                 {
1055                   EXPR_WFL_LINECOL (wfl_operator) = $2.location;
1056                   TREE_PURPOSE ($1) =
1057                     build_unresolved_array_type (TREE_PURPOSE ($1));
1058                   parse_warning_context
1059                     (wfl_operator,
1060                      "Discouraged form of returned type specification");
1061                 }
1062 |       identifier OP_TK error
1063                 {yyerror ("')' expected"); DRECOVER(method_declarator);}
1064 |       method_declarator OSB_TK error
1065                 {yyerror ("']' expected"); RECOVER;}
1066 ;
1067
1068 formal_parameter_list:
1069         formal_parameter
1070                 {
1071                   ctxp->formal_parameter_number = 1;
1072                 }
1073 |       formal_parameter_list C_TK formal_parameter
1074                 {
1075                   ctxp->formal_parameter_number += 1;
1076                   $$ = chainon ($1, $3);
1077                 }
1078 |       formal_parameter_list C_TK error
1079                 { yyerror ("Missing formal parameter term"); RECOVER; }
1080 ;
1081
1082 formal_parameter:
1083         type variable_declarator_id
1084                 {
1085                   $$ = build_tree_list ($2, $1);
1086                 }
1087 |       final type variable_declarator_id /* Added, JDK1.1 final parms */
1088                 {
1089                   $$ = build_tree_list ($3, $2);
1090                   ARG_FINAL_P ($$) = 1;
1091                 }
1092 |       type error
1093                 {
1094                   yyerror ("Missing identifier"); RECOVER;
1095                   $$ = NULL_TREE;
1096                 }
1097 |       final type error
1098                 {
1099                   yyerror ("Missing identifier"); RECOVER;
1100                   $$ = NULL_TREE;
1101                 }
1102 ;
1103
1104 final:
1105         modifiers
1106                 {
1107                   check_modifiers ("Illegal modifier `%s'. Only `final' was expected here",
1108                                    $1, ACC_FINAL);
1109                   if ($1 != ACC_FINAL)
1110                     MODIFIER_WFL (FINAL_TK) = build_wfl_node (NULL_TREE);
1111                 }
1112 ;
1113
1114 throws:
1115                 { $$ = NULL_TREE; }
1116 |       THROWS_TK class_type_list
1117                 { $$ = $2; }
1118 |       THROWS_TK error
1119                 {yyerror ("Missing class type term"); RECOVER;}
1120 ;
1121
1122 class_type_list:
1123         class_type
1124                 { $$ = build_tree_list ($1, $1); }
1125 |       class_type_list C_TK class_type
1126                 { $$ = tree_cons ($3, $3, $1); }
1127 |       class_type_list C_TK error
1128                 {yyerror ("Missing class type term"); RECOVER;}
1129 ;
1130
1131 method_body:
1132         block
1133 |       SC_TK { $$ = NULL_TREE; }
1134 ;
1135
1136 /* 19.8.4 Productions from 8.5: Static Initializers  */
1137 static_initializer:
1138         static block
1139                 {
1140                   TREE_CHAIN ($2) = CPC_STATIC_INITIALIZER_STMT (ctxp);
1141                   SET_CPC_STATIC_INITIALIZER_STMT (ctxp, $2);
1142                   current_static_block = NULL_TREE;
1143                 }
1144 ;
1145
1146 static:                         /* Test lval.sub_token here */
1147         modifiers
1148                 {
1149                   check_modifiers ("Illegal modifier `%s' for static initializer", $1, ACC_STATIC);
1150                   /* Can't have a static initializer in an innerclass */
1151                   if ($1 | ACC_STATIC &&
1152                       GET_CPC_LIST () && !TOPLEVEL_CLASS_DECL_P (GET_CPC ()))
1153                     parse_error_context
1154                       (MODIFIER_WFL (STATIC_TK),
1155                        "Can't define static initializer in class `%s'. Static initializer can only be defined in top-level classes",
1156                        IDENTIFIER_POINTER (DECL_NAME (GET_CPC ())));
1157                   SOURCE_FRONTEND_DEBUG (("Modifiers: %d", $1));
1158                 }
1159 ;
1160
1161 /* 19.8.5 Productions from 8.6: Constructor Declarations  */
1162 constructor_declaration:
1163         constructor_header
1164                 {
1165                   current_function_decl = $1;
1166                   source_start_java_method (current_function_decl);
1167                 }
1168         constructor_body
1169                 { finish_method_declaration ($3); }
1170 ;
1171
1172 constructor_header:
1173         constructor_declarator throws
1174                 { $$ = method_header (0, NULL_TREE, $1, $2); }
1175 |       modifiers constructor_declarator throws
1176                 { $$ = method_header ($1, NULL_TREE, $2, $3); }
1177 ;
1178
1179 constructor_declarator:
1180         simple_name OP_TK CP_TK
1181                 {
1182                   ctxp->formal_parameter_number = 0;
1183                   $$ = method_declarator ($1, NULL_TREE);
1184                 }
1185 |       simple_name OP_TK formal_parameter_list CP_TK
1186                 { $$ = method_declarator ($1, $3); }
1187 ;
1188
1189 constructor_body:
1190         /* Unlike regular method, we always need a complete (empty)
1191            body so we can safely perform all the required code
1192            addition (super invocation and field initialization) */
1193         block_begin constructor_block_end
1194                 {
1195                   BLOCK_EXPR_BODY ($2) = empty_stmt_node;
1196                   $$ = $2;
1197                 }
1198 |       block_begin explicit_constructor_invocation constructor_block_end
1199                 { $$ = $3; }
1200 |       block_begin block_statements constructor_block_end
1201                 { $$ = $3; }
1202 |       block_begin explicit_constructor_invocation block_statements constructor_block_end
1203                 { $$ = $4; }
1204 ;
1205
1206 constructor_block_end:
1207         block_end
1208 ;
1209
1210 /* Error recovery for that rule moved down expression_statement: rule.  */
1211 explicit_constructor_invocation:
1212         this_or_super OP_TK CP_TK SC_TK
1213                 {
1214                   $$ = build_method_invocation ($1, NULL_TREE);
1215                   $$ = build_debugable_stmt (EXPR_WFL_LINECOL ($1), $$);
1216                   $$ = java_method_add_stmt (current_function_decl, $$);
1217                 }
1218 |       this_or_super OP_TK argument_list CP_TK SC_TK
1219                 {
1220                   $$ = build_method_invocation ($1, $3);
1221                   $$ = build_debugable_stmt (EXPR_WFL_LINECOL ($1), $$);
1222                   $$ = java_method_add_stmt (current_function_decl, $$);
1223                 }
1224         /* Added, JDK1.1 inner classes. Modified because the rule
1225            'primary' couldn't work.  */
1226 |       name DOT_TK SUPER_TK OP_TK argument_list CP_TK SC_TK
1227                 {$$ = parse_jdk1_1_error ("explicit constructor invocation"); }
1228 |       name DOT_TK SUPER_TK OP_TK CP_TK SC_TK
1229                 {$$ = parse_jdk1_1_error ("explicit constructor invocation"); }
1230 ;
1231
1232 this_or_super:                  /* Added, simplifies error diagnostics */
1233         THIS_TK
1234                 {
1235                   tree wfl = build_wfl_node (this_identifier_node);
1236                   EXPR_WFL_LINECOL (wfl) = $1.location;
1237                   $$ = wfl;
1238                 }
1239 |       SUPER_TK
1240                 {
1241                   tree wfl = build_wfl_node (super_identifier_node);
1242                   EXPR_WFL_LINECOL (wfl) = $1.location;
1243                   $$ = wfl;
1244                 }
1245 ;
1246
1247 /* 19.9 Productions from 9: Interfaces  */
1248 /* 19.9.1 Productions from 9.1: Interfaces Declarations  */
1249 interface_declaration:
1250         INTERFACE_TK identifier
1251                 { create_interface (0, $2, NULL_TREE); }
1252         interface_body
1253                 { ; }
1254 |       modifiers INTERFACE_TK identifier
1255                 { create_interface ($1, $3, NULL_TREE); }
1256         interface_body
1257                 { ; }
1258 |       INTERFACE_TK identifier extends_interfaces
1259                 { create_interface (0, $2, $3); }
1260         interface_body
1261                 { ; }
1262 |       modifiers INTERFACE_TK identifier extends_interfaces
1263                 { create_interface ($1, $3, $4); }
1264         interface_body
1265                 { ; }
1266 |       INTERFACE_TK identifier error
1267                 { yyerror ("'{' expected"); RECOVER; }
1268 |       modifiers INTERFACE_TK identifier error
1269                 { yyerror ("'{' expected"); RECOVER; }
1270 ;
1271
1272 extends_interfaces:
1273         EXTENDS_TK interface_type
1274                 {
1275                   ctxp->interface_number = 1;
1276                   $$ = build_tree_list ($2, NULL_TREE);
1277                 }
1278 |       extends_interfaces C_TK interface_type
1279                 {
1280                   ctxp->interface_number++;
1281                   $$ = chainon ($1, build_tree_list ($3, NULL_TREE));
1282                 }
1283 |       EXTENDS_TK error
1284                 {yyerror ("Invalid interface type"); RECOVER;}
1285 |       extends_interfaces C_TK error
1286                 {yyerror ("Missing term"); RECOVER;}
1287 ;
1288
1289 interface_body:
1290         OCB_TK CCB_TK
1291                 { $$ = NULL_TREE; }
1292 |       OCB_TK interface_member_declarations CCB_TK
1293                 { $$ = NULL_TREE; }
1294 ;
1295
1296 interface_member_declarations:
1297         interface_member_declaration
1298 |       interface_member_declarations interface_member_declaration
1299 ;
1300
1301 interface_member_declaration:
1302         constant_declaration
1303 |       abstract_method_declaration
1304 |       class_declaration       /* Added, JDK1.1 inner classes */
1305                 { end_class_declaration (1); }
1306 |       interface_declaration   /* Added, JDK1.1 inner interfaces */
1307                 { end_class_declaration (1); }
1308 ;
1309
1310 constant_declaration:
1311         field_declaration
1312 ;
1313
1314 abstract_method_declaration:
1315         method_header SC_TK
1316                 {
1317                   check_abstract_method_header ($1);
1318                   current_function_decl = NULL_TREE; /* FIXME ? */
1319                 }
1320 |       method_header error
1321                 {yyerror ("';' expected"); RECOVER;}
1322 ;
1323
1324 /* 19.10 Productions from 10: Arrays  */
1325 array_initializer:
1326         OCB_TK CCB_TK
1327                 { $$ = build_new_array_init ($1.location, NULL_TREE); }
1328 |       OCB_TK C_TK CCB_TK
1329                 { $$ = build_new_array_init ($1.location, NULL_TREE); }
1330 |       OCB_TK variable_initializers CCB_TK
1331                 { $$ = build_new_array_init ($1.location, $2); }
1332 |       OCB_TK variable_initializers C_TK CCB_TK
1333                 { $$ = build_new_array_init ($1.location, $2); }
1334 ;
1335
1336 variable_initializers:
1337         variable_initializer
1338                 {
1339                   $$ = tree_cons (maybe_build_array_element_wfl ($1),
1340                                   $1, NULL_TREE);
1341                 }
1342 |       variable_initializers C_TK variable_initializer
1343                 {
1344                   $$ = tree_cons (maybe_build_array_element_wfl ($3), $3, $1);
1345                 }
1346 |       variable_initializers C_TK error
1347                 {yyerror ("Missing term"); RECOVER;}
1348 ;
1349
1350 /* 19.11 Production from 14: Blocks and Statements  */
1351 block:
1352         OCB_TK CCB_TK
1353                 {
1354                   /* Store the location of the `}' when doing xrefs */
1355                   if (current_function_decl && flag_emit_xref)
1356                     DECL_END_SOURCE_LINE (current_function_decl) =
1357                       EXPR_WFL_ADD_COL ($2.location, 1);
1358                   $$ = empty_stmt_node;
1359                 }
1360 |       block_begin block_statements block_end
1361                 { $$ = $3; }
1362 ;
1363
1364 block_begin:
1365         OCB_TK
1366                 { enter_block (); }
1367 ;
1368
1369 block_end:
1370         CCB_TK
1371                 {
1372                   maybe_absorb_scoping_blocks ();
1373                   /* Store the location of the `}' when doing xrefs */
1374                   if (current_function_decl && flag_emit_xref)
1375                     DECL_END_SOURCE_LINE (current_function_decl) =
1376                       EXPR_WFL_ADD_COL ($1.location, 1);
1377                   $$ = exit_block ();
1378                   if (!BLOCK_SUBBLOCKS ($$))
1379                     BLOCK_SUBBLOCKS ($$) = empty_stmt_node;
1380                 }
1381 ;
1382
1383 block_statements:
1384         block_statement
1385 |       block_statements block_statement
1386 ;
1387
1388 block_statement:
1389         local_variable_declaration_statement
1390 |       statement
1391                 { java_method_add_stmt (current_function_decl, $1); }
1392 |       class_declaration       /* Added, JDK1.1 local classes */
1393                 {
1394                   LOCAL_CLASS_P (TREE_TYPE (GET_CPC ())) = 1;
1395                   end_class_declaration (1);
1396                 }
1397 ;
1398
1399 local_variable_declaration_statement:
1400         local_variable_declaration SC_TK /* Can't catch missing ';' here */
1401 ;
1402
1403 local_variable_declaration:
1404         type variable_declarators
1405                 { declare_local_variables (0, $1, $2); }
1406 |       final type variable_declarators /* Added, JDK1.1 final locals */
1407                 { declare_local_variables ($1, $2, $3); }
1408 ;
1409
1410 statement:
1411         statement_without_trailing_substatement
1412 |       labeled_statement
1413 |       if_then_statement
1414 |       if_then_else_statement
1415 |       while_statement
1416 |       for_statement
1417                 { $$ = exit_block (); }
1418 ;
1419
1420 statement_nsi:
1421         statement_without_trailing_substatement
1422 |       labeled_statement_nsi
1423 |       if_then_else_statement_nsi
1424 |       while_statement_nsi
1425 |       for_statement_nsi
1426                 { $$ = exit_block (); }
1427 ;
1428
1429 statement_without_trailing_substatement:
1430         block
1431 |       empty_statement
1432 |       expression_statement
1433 |       switch_statement
1434 |       do_statement
1435 |       break_statement
1436 |       continue_statement
1437 |       return_statement
1438 |       synchronized_statement
1439 |       throw_statement
1440 |       try_statement
1441 |       assert_statement
1442 ;
1443
1444 empty_statement:
1445         SC_TK
1446                 {
1447                   if (flag_extraneous_semicolon
1448                       && ! current_static_block
1449                       && (! current_function_decl ||
1450                           /* Verify we're not in a inner class declaration */
1451                           (GET_CPC () != TYPE_NAME
1452                            (DECL_CONTEXT (current_function_decl)))))
1453
1454                     {
1455                       EXPR_WFL_SET_LINECOL (wfl_operator, input_line, -1);
1456                       parse_warning_context (wfl_operator, "An empty declaration is a deprecated feature that should not be used");
1457                     }
1458                   $$ = empty_stmt_node;
1459                 }
1460 ;
1461
1462 label_decl:
1463         identifier REL_CL_TK
1464                 {
1465                   $$ = build_labeled_block (EXPR_WFL_LINECOL ($1),
1466                                             EXPR_WFL_NODE ($1));
1467                   pushlevel (2);
1468                   push_labeled_block ($$);
1469                   PUSH_LABELED_BLOCK ($$);
1470                 }
1471 ;
1472
1473 labeled_statement:
1474         label_decl statement
1475                 { $$ = finish_labeled_statement ($1, $2); }
1476 |       identifier error
1477                 {yyerror ("':' expected"); RECOVER;}
1478 ;
1479
1480 labeled_statement_nsi:
1481         label_decl statement_nsi
1482                 { $$ = finish_labeled_statement ($1, $2); }
1483 ;
1484
1485 /* We concentrate here a bunch of error handling rules that we couldn't write
1486    earlier, because expression_statement catches a missing ';'.  */
1487 expression_statement:
1488         statement_expression SC_TK
1489                 {
1490                   /* We have a statement. Generate a WFL around it so
1491                      we can debug it */
1492                   $$ = build_expr_wfl ($1, input_filename, input_line, 0);
1493                   /* We know we have a statement, so set the debug
1494                      info to be eventually generate here. */
1495                   $$ = JAVA_MAYBE_GENERATE_DEBUG_INFO ($$);
1496                 }
1497 |       error SC_TK
1498                 {
1499                   YYNOT_TWICE yyerror ("Invalid expression statement");
1500                   DRECOVER (expr_stmt);
1501                 }
1502 |       error OCB_TK
1503                 {
1504                   YYNOT_TWICE yyerror ("Invalid expression statement");
1505                   DRECOVER (expr_stmt);
1506                 }
1507 |       error CCB_TK
1508                 {
1509                   YYNOT_TWICE yyerror ("Invalid expression statement");
1510                   DRECOVER (expr_stmt);
1511                 }
1512 |       this_or_super OP_TK error
1513                 {yyerror ("')' expected"); RECOVER;}
1514 |       this_or_super OP_TK CP_TK error
1515                 {
1516                   parse_ctor_invocation_error ();
1517                   RECOVER;
1518                 }
1519 |       this_or_super OP_TK argument_list error
1520                 {yyerror ("')' expected"); RECOVER;}
1521 |       this_or_super OP_TK argument_list CP_TK error
1522                 {
1523                   parse_ctor_invocation_error ();
1524                   RECOVER;
1525                 }
1526 |       name DOT_TK SUPER_TK error
1527                 {yyerror ("'(' expected"); RECOVER;}
1528 |       name DOT_TK SUPER_TK OP_TK error
1529                 {yyerror ("')' expected"); RECOVER;}
1530 |       name DOT_TK SUPER_TK OP_TK argument_list error
1531                 {yyerror ("')' expected"); RECOVER;}
1532 |       name DOT_TK SUPER_TK OP_TK argument_list CP_TK error
1533                 {yyerror ("';' expected"); RECOVER;}
1534 |       name DOT_TK SUPER_TK OP_TK CP_TK error
1535                 {yyerror ("';' expected"); RECOVER;}
1536 ;
1537
1538 statement_expression:
1539         assignment
1540 |       pre_increment_expression
1541 |       pre_decrement_expression
1542 |       post_increment_expression
1543 |       post_decrement_expression
1544 |       method_invocation
1545 |       class_instance_creation_expression
1546 ;
1547
1548 if_then_statement:
1549         IF_TK OP_TK expression CP_TK statement
1550                 {
1551                   $$ = build_if_else_statement ($2.location, $3,
1552                                                 $5, NULL_TREE);
1553                 }
1554 |       IF_TK error
1555                 {yyerror ("'(' expected"); RECOVER;}
1556 |       IF_TK OP_TK error
1557                 {yyerror ("Missing term"); RECOVER;}
1558 |       IF_TK OP_TK expression error
1559                 {yyerror ("')' expected"); RECOVER;}
1560 ;
1561
1562 if_then_else_statement:
1563         IF_TK OP_TK expression CP_TK statement_nsi ELSE_TK statement
1564                 { $$ = build_if_else_statement ($2.location, $3, $5, $7); }
1565 ;
1566
1567 if_then_else_statement_nsi:
1568         IF_TK OP_TK expression CP_TK statement_nsi ELSE_TK statement_nsi
1569                 { $$ = build_if_else_statement ($2.location, $3, $5, $7); }
1570 ;
1571
1572 switch_statement:
1573         switch_expression
1574                 {
1575                   enter_block ();
1576                 }
1577         switch_block
1578                 {
1579                   /* Make into "proper list" of COMPOUND_EXPRs.
1580                      I.e. make the last statement also have its own
1581                      COMPOUND_EXPR. */
1582                   maybe_absorb_scoping_blocks ();
1583                   TREE_OPERAND ($1, 1) = exit_block ();
1584                   $$ = build_debugable_stmt (EXPR_WFL_LINECOL ($1), $1);
1585                 }
1586 ;
1587
1588 switch_expression:
1589         SWITCH_TK OP_TK expression CP_TK
1590                 {
1591                   $$ = build (SWITCH_EXPR, NULL_TREE, $3, NULL_TREE);
1592                   EXPR_WFL_LINECOL ($$) = $2.location;
1593                 }
1594 |       SWITCH_TK error
1595                 {yyerror ("'(' expected"); RECOVER;}
1596 |       SWITCH_TK OP_TK error
1597                 {yyerror ("Missing term or ')'"); DRECOVER(switch_statement);}
1598 |       SWITCH_TK OP_TK expression CP_TK error
1599                 {yyerror ("'{' expected"); RECOVER;}
1600 ;
1601
1602 /* Default assignment is there to avoid type node on switch_block
1603    node. */
1604
1605 switch_block:
1606         OCB_TK CCB_TK
1607                 { $$ = NULL_TREE; }
1608 |       OCB_TK switch_labels CCB_TK
1609                 { $$ = NULL_TREE; }
1610 |       OCB_TK switch_block_statement_groups CCB_TK
1611                 { $$ = NULL_TREE; }
1612 |       OCB_TK switch_block_statement_groups switch_labels CCB_TK
1613                 { $$ = NULL_TREE; }
1614 ;
1615
1616 switch_block_statement_groups:
1617         switch_block_statement_group
1618 |       switch_block_statement_groups switch_block_statement_group
1619 ;
1620
1621 switch_block_statement_group:
1622         switch_labels block_statements
1623 ;
1624
1625 switch_labels:
1626         switch_label
1627 |       switch_labels switch_label
1628 ;
1629
1630 switch_label:
1631         CASE_TK constant_expression REL_CL_TK
1632                 {
1633                   tree lab = build1 (CASE_EXPR, NULL_TREE, $2);
1634                   EXPR_WFL_LINECOL (lab) = $1.location;
1635                   java_method_add_stmt (current_function_decl, lab);
1636                 }
1637 |       DEFAULT_TK REL_CL_TK
1638                 {
1639                   tree lab = build (DEFAULT_EXPR, NULL_TREE, NULL_TREE);
1640                   EXPR_WFL_LINECOL (lab) = $1.location;
1641                   java_method_add_stmt (current_function_decl, lab);
1642                 }
1643 |       CASE_TK error
1644                 {yyerror ("Missing or invalid constant expression"); RECOVER;}
1645 |       CASE_TK constant_expression error
1646                 {yyerror ("':' expected"); RECOVER;}
1647 |       DEFAULT_TK error
1648                 {yyerror ("':' expected"); RECOVER;}
1649 ;
1650
1651 while_expression:
1652         WHILE_TK OP_TK expression CP_TK
1653                 {
1654                   tree body = build_loop_body ($2.location, $3, 0);
1655                   $$ = build_new_loop (body);
1656                 }
1657 ;
1658
1659 while_statement:
1660         while_expression statement
1661                 { $$ = finish_loop_body (0, NULL_TREE, $2, 0); }
1662 |       WHILE_TK error
1663                 {YYERROR_NOW; yyerror ("'(' expected"); RECOVER;}
1664 |       WHILE_TK OP_TK error
1665                 {yyerror ("Missing term and ')' expected"); RECOVER;}
1666 |       WHILE_TK OP_TK expression error
1667                 {yyerror ("')' expected"); RECOVER;}
1668 ;
1669
1670 while_statement_nsi:
1671         while_expression statement_nsi
1672                 { $$ = finish_loop_body (0, NULL_TREE, $2, 0); }
1673 ;
1674
1675 do_statement_begin:
1676         DO_TK
1677                 {
1678                   tree body = build_loop_body (0, NULL_TREE, 1);
1679                   $$ = build_new_loop (body);
1680                 }
1681         /* Need error handing here. FIXME */
1682 ;
1683
1684 do_statement:
1685         do_statement_begin statement WHILE_TK OP_TK expression CP_TK SC_TK
1686                 { $$ = finish_loop_body ($4.location, $5, $2, 1); }
1687 ;
1688
1689 for_statement:
1690         for_begin SC_TK expression SC_TK for_update CP_TK statement
1691                 {
1692                   if (TREE_CODE_CLASS (TREE_CODE ($3)) == 'c')
1693                     $3 = build_wfl_node ($3);
1694                   $$ = finish_for_loop (EXPR_WFL_LINECOL ($3), $3, $5, $7);
1695                 }
1696 |       for_begin SC_TK SC_TK for_update CP_TK statement
1697                 {
1698                   $$ = finish_for_loop (0, NULL_TREE, $4, $6);
1699                   /* We have not condition, so we get rid of the EXIT_EXPR */
1700                   LOOP_EXPR_BODY_CONDITION_EXPR (LOOP_EXPR_BODY ($$), 0) =
1701                     empty_stmt_node;
1702                 }
1703 |       for_begin SC_TK error
1704                 {yyerror ("Invalid control expression"); RECOVER;}
1705 |       for_begin SC_TK expression SC_TK error
1706                 {yyerror ("Invalid update expression"); RECOVER;}
1707 |       for_begin SC_TK SC_TK error
1708                 {yyerror ("Invalid update expression"); RECOVER;}
1709 ;
1710
1711 for_statement_nsi:
1712         for_begin SC_TK expression SC_TK for_update CP_TK statement_nsi
1713                 { $$ = finish_for_loop (EXPR_WFL_LINECOL ($3), $3, $5, $7);}
1714 |       for_begin SC_TK SC_TK for_update CP_TK statement_nsi
1715                 {
1716                   $$ = finish_for_loop (0, NULL_TREE, $4, $6);
1717                   /* We have not condition, so we get rid of the EXIT_EXPR */
1718                   LOOP_EXPR_BODY_CONDITION_EXPR (LOOP_EXPR_BODY ($$), 0) =
1719                     empty_stmt_node;
1720                 }
1721 ;
1722
1723 for_header:
1724         FOR_TK OP_TK
1725                 {
1726                   /* This scope defined for local variable that may be
1727                      defined within the scope of the for loop */
1728                   enter_block ();
1729                 }
1730 |       FOR_TK error
1731                 {yyerror ("'(' expected"); DRECOVER(for_1);}
1732 |       FOR_TK OP_TK error
1733                 {yyerror ("Invalid init statement"); RECOVER;}
1734 ;
1735
1736 for_begin:
1737         for_header for_init
1738                 {
1739                   /* We now declare the loop body. The loop is
1740                      declared as a for loop. */
1741                   tree body = build_loop_body (0, NULL_TREE, 0);
1742                   $$ =  build_new_loop (body);
1743                   FOR_LOOP_P ($$) = 1;
1744                   /* The loop is added to the current block the for
1745                      statement is defined within */
1746                   java_method_add_stmt (current_function_decl, $$);
1747                 }
1748 ;
1749 for_init:                       /* Can be empty */
1750                 { $$ = empty_stmt_node; }
1751 |       statement_expression_list
1752                 {
1753                   /* Init statement recorded within the previously
1754                      defined block scope */
1755                   $$ = java_method_add_stmt (current_function_decl, $1);
1756                 }
1757 |       local_variable_declaration
1758                 {
1759                   /* Local variable are recorded within the previously
1760                      defined block scope */
1761                   $$ = NULL_TREE;
1762                 }
1763 |       statement_expression_list error
1764                 {yyerror ("';' expected"); DRECOVER(for_init_1);}
1765 ;
1766
1767 for_update:                     /* Can be empty */
1768                 {$$ = empty_stmt_node;}
1769 |       statement_expression_list
1770                 { $$ = build_debugable_stmt (BUILD_LOCATION (), $1); }
1771 ;
1772
1773 statement_expression_list:
1774         statement_expression
1775                 { $$ = add_stmt_to_compound (NULL_TREE, NULL_TREE, $1); }
1776 |       statement_expression_list C_TK statement_expression
1777                 { $$ = add_stmt_to_compound ($1, NULL_TREE, $3); }
1778 |       statement_expression_list C_TK error
1779                 {yyerror ("Missing term"); RECOVER;}
1780 ;
1781
1782 break_statement:
1783         BREAK_TK SC_TK
1784                 { $$ = build_bc_statement ($1.location, 1, NULL_TREE); }
1785 |       BREAK_TK identifier SC_TK
1786                 { $$ = build_bc_statement ($1.location, 1, $2); }
1787 |       BREAK_TK error
1788                 {yyerror ("Missing term"); RECOVER;}
1789 |       BREAK_TK identifier error
1790                 {yyerror ("';' expected"); RECOVER;}
1791 ;
1792
1793 continue_statement:
1794         CONTINUE_TK SC_TK
1795                 { $$ = build_bc_statement ($1.location, 0, NULL_TREE); }
1796 |       CONTINUE_TK identifier SC_TK
1797                 { $$ = build_bc_statement ($1.location, 0, $2); }
1798 |       CONTINUE_TK error
1799                 {yyerror ("Missing term"); RECOVER;}
1800 |       CONTINUE_TK identifier error
1801                 {yyerror ("';' expected"); RECOVER;}
1802 ;
1803
1804 return_statement:
1805         RETURN_TK SC_TK
1806                 { $$ = build_return ($1.location, NULL_TREE); }
1807 |       RETURN_TK expression SC_TK
1808                 { $$ = build_return ($1.location, $2); }
1809 |       RETURN_TK error
1810                 {yyerror ("Missing term"); RECOVER;}
1811 |       RETURN_TK expression error
1812                 {yyerror ("';' expected"); RECOVER;}
1813 ;
1814
1815 throw_statement:
1816         THROW_TK expression SC_TK
1817                 {
1818                   $$ = build1 (THROW_EXPR, NULL_TREE, $2);
1819                   EXPR_WFL_LINECOL ($$) = $1.location;
1820                 }
1821 |       THROW_TK error
1822                 {yyerror ("Missing term"); RECOVER;}
1823 |       THROW_TK expression error
1824                 {yyerror ("';' expected"); RECOVER;}
1825 ;
1826
1827 assert_statement:
1828         ASSERT_TK expression REL_CL_TK expression SC_TK
1829                 {
1830                   $$ = build_assertion ($1.location, $2, $4);
1831                 }
1832 |       ASSERT_TK expression SC_TK
1833                 {
1834                   $$ = build_assertion ($1.location, $2, NULL_TREE);
1835                 }
1836 |       ASSERT_TK error
1837                 {yyerror ("Missing term"); RECOVER;}
1838 |       ASSERT_TK expression error
1839                 {yyerror ("';' expected"); RECOVER;}
1840 ;
1841
1842 synchronized_statement:
1843         synchronized OP_TK expression CP_TK block
1844                 {
1845                   $$ = build (SYNCHRONIZED_EXPR, NULL_TREE, $3, $5);
1846                   EXPR_WFL_LINECOL ($$) =
1847                     EXPR_WFL_LINECOL (MODIFIER_WFL (SYNCHRONIZED_TK));
1848                 }
1849 |       synchronized OP_TK expression CP_TK error
1850                 {yyerror ("'{' expected"); RECOVER;}
1851 |       synchronized error
1852                 {yyerror ("'(' expected"); RECOVER;}
1853 |       synchronized OP_TK error CP_TK
1854                 {yyerror ("Missing term"); RECOVER;}
1855 |       synchronized OP_TK error
1856                 {yyerror ("Missing term"); RECOVER;}
1857 ;
1858
1859 synchronized:
1860         modifiers
1861                 {
1862                   check_modifiers (
1863              "Illegal modifier `%s'. Only `synchronized' was expected here",
1864                                    $1, ACC_SYNCHRONIZED);
1865                   if ($1 != ACC_SYNCHRONIZED)
1866                     MODIFIER_WFL (SYNCHRONIZED_TK) =
1867                       build_wfl_node (NULL_TREE);
1868                 }
1869 ;
1870
1871 try_statement:
1872         TRY_TK block catches
1873                 { $$ = build_try_statement ($1.location, $2, $3); }
1874 |       TRY_TK block finally
1875                 { $$ = build_try_finally_statement ($1.location, $2, $3); }
1876 |       TRY_TK block catches finally
1877                 { $$ = build_try_finally_statement
1878                     ($1.location, build_try_statement ($1.location,
1879                                                        $2, $3), $4);
1880                 }
1881 |       TRY_TK error
1882                 {yyerror ("'{' expected"); DRECOVER (try_statement);}
1883 ;
1884
1885 catches:
1886         catch_clause
1887 |       catches catch_clause
1888                 {
1889                   TREE_CHAIN ($2) = $1;
1890                   $$ = $2;
1891                 }
1892 ;
1893
1894 catch_clause:
1895         catch_clause_parameter block
1896                 {
1897                   java_method_add_stmt (current_function_decl, $2);
1898                   exit_block ();
1899                   $$ = $1;
1900                 }
1901 ;
1902
1903 catch_clause_parameter:
1904         CATCH_TK OP_TK formal_parameter CP_TK
1905                 {
1906                   /* We add a block to define a scope for
1907                      formal_parameter (CCBP). The formal parameter is
1908                      declared initialized by the appropriate function
1909                      call */
1910                   tree ccpb = enter_block ();
1911                   tree init = build_assignment
1912                     (ASSIGN_TK, $2.location, TREE_PURPOSE ($3),
1913                      build (JAVA_EXC_OBJ_EXPR, ptr_type_node));
1914                   declare_local_variables (0, TREE_VALUE ($3),
1915                                            build_tree_list (TREE_PURPOSE ($3),
1916                                                             init));
1917                   $$ = build1 (CATCH_EXPR, NULL_TREE, ccpb);
1918                   EXPR_WFL_LINECOL ($$) = $1.location;
1919                 }
1920 |       CATCH_TK error
1921                 {yyerror ("'(' expected"); RECOVER; $$ = NULL_TREE;}
1922 |       CATCH_TK OP_TK error
1923                 {
1924                   yyerror ("Missing term or ')' expected");
1925                   RECOVER; $$ = NULL_TREE;
1926                 }
1927 |       CATCH_TK OP_TK error CP_TK /* That's for () */
1928                 {yyerror ("Missing term"); RECOVER; $$ = NULL_TREE;}
1929 ;
1930
1931 finally:
1932         FINALLY_TK block
1933                 { $$ = $2; }
1934 |       FINALLY_TK error
1935                 {yyerror ("'{' expected"); RECOVER; }
1936 ;
1937
1938 /* 19.12 Production from 15: Expressions  */
1939 primary:
1940         primary_no_new_array
1941 |       array_creation_expression
1942 ;
1943
1944 primary_no_new_array:
1945         literal
1946 |       THIS_TK
1947                 { $$ = build_this ($1.location); }
1948 |       OP_TK expression CP_TK
1949                 {$$ = $2;}
1950 |       class_instance_creation_expression
1951 |       field_access
1952 |       method_invocation
1953 |       array_access
1954 |       type_literals
1955         /* Added, JDK1.1 inner classes. Documentation is wrong
1956            refering to a 'ClassName' (class_name) rule that doesn't
1957            exist. Used name: instead.  */
1958 |       name DOT_TK THIS_TK
1959                 {
1960                   tree wfl = build_wfl_node (this_identifier_node);
1961                   $$ = make_qualified_primary ($1, wfl, EXPR_WFL_LINECOL ($1));
1962                 }
1963 |       OP_TK expression error
1964                 {yyerror ("')' expected"); RECOVER;}
1965 |       name DOT_TK error
1966                 {yyerror ("'class' or 'this' expected" ); RECOVER;}
1967 |       primitive_type DOT_TK error
1968                 {yyerror ("'class' expected" ); RECOVER;}
1969 |       VOID_TK DOT_TK error
1970                 {yyerror ("'class' expected" ); RECOVER;}
1971 ;
1972
1973 type_literals:
1974         name DOT_TK CLASS_TK
1975                 { $$ = build_incomplete_class_ref ($2.location, $1); }
1976 |       array_type DOT_TK CLASS_TK
1977                 { $$ = build_incomplete_class_ref ($2.location, $1); }
1978 |       primitive_type DOT_TK CLASS_TK
1979                 { $$ = build_incomplete_class_ref ($2.location, $1); }
1980 |       VOID_TK DOT_TK CLASS_TK
1981                 {
1982                    $$ = build_incomplete_class_ref ($2.location,
1983                                                    void_type_node);
1984                 }
1985 ;
1986
1987 class_instance_creation_expression:
1988         NEW_TK class_type OP_TK argument_list CP_TK
1989                 { $$ = build_new_invocation ($2, $4); }
1990 |       NEW_TK class_type OP_TK CP_TK
1991                 { $$ = build_new_invocation ($2, NULL_TREE); }
1992 |       anonymous_class_creation
1993         /* Added, JDK1.1 inner classes, modified to use name or
1994            primary instead of primary solely which couldn't work in
1995            all situations.  */
1996 |       something_dot_new identifier OP_TK CP_TK
1997                 {
1998                   tree ctor = build_new_invocation ($2, NULL_TREE);
1999                   $$ = make_qualified_primary ($1, ctor,
2000                                                EXPR_WFL_LINECOL ($1));
2001                 }
2002 |       something_dot_new identifier OP_TK CP_TK class_body
2003 |       something_dot_new identifier OP_TK argument_list CP_TK
2004                 {
2005                   tree ctor = build_new_invocation ($2, $4);
2006                   $$ = make_qualified_primary ($1, ctor,
2007                                                EXPR_WFL_LINECOL ($1));
2008                 }
2009 |       something_dot_new identifier OP_TK argument_list CP_TK class_body
2010 |       NEW_TK error SC_TK
2011                 {yyerror ("'(' expected"); DRECOVER(new_1);}
2012 |       NEW_TK class_type error
2013                 {yyerror ("'(' expected"); RECOVER;}
2014 |       NEW_TK class_type OP_TK error
2015                 {yyerror ("')' or term expected"); RECOVER;}
2016 |       NEW_TK class_type OP_TK argument_list error
2017                 {yyerror ("')' expected"); RECOVER;}
2018 |       something_dot_new error
2019                 {YYERROR_NOW; yyerror ("Identifier expected"); RECOVER;}
2020 |       something_dot_new identifier error
2021                 {yyerror ("'(' expected"); RECOVER;}
2022 ;
2023
2024 /* Created after JDK1.1 rules originally added to
2025    class_instance_creation_expression, but modified to use
2026    'class_type' instead of 'TypeName' (type_name) which is mentionned
2027    in the documentation but doesn't exist. */
2028
2029 anonymous_class_creation:
2030         NEW_TK class_type OP_TK argument_list CP_TK
2031                 { create_anonymous_class ($1.location, $2); }
2032         class_body
2033                 {
2034                   tree id = build_wfl_node (DECL_NAME (GET_CPC ()));
2035                   EXPR_WFL_LINECOL (id) = EXPR_WFL_LINECOL ($2);
2036
2037                   end_class_declaration (1);
2038
2039                   /* Now we can craft the new expression */
2040                   $$ = build_new_invocation (id, $4);
2041
2042                   /* Note that we can't possibly be here if
2043                      `class_type' is an interface (in which case the
2044                      anonymous class extends Object and implements
2045                      `class_type', hence its constructor can't have
2046                      arguments.) */
2047
2048                   /* Otherwise, the innerclass must feature a
2049                      constructor matching `argument_list'. Anonymous
2050                      classes are a bit special: it's impossible to
2051                      define constructor for them, hence constructors
2052                      must be generated following the hints provided by
2053                      the `new' expression. Whether a super constructor
2054                      of that nature exists or not is to be verified
2055                      later on in verify_constructor_super.
2056
2057                      It's during the expansion of a `new' statement
2058                      refering to an anonymous class that a ctor will
2059                      be generated for the anonymous class, with the
2060                      right arguments. */
2061
2062                 }
2063 |       NEW_TK class_type OP_TK CP_TK
2064                 { create_anonymous_class ($1.location, $2); }
2065         class_body
2066                 {
2067                   tree id = build_wfl_node (DECL_NAME (GET_CPC ()));
2068                   EXPR_WFL_LINECOL (id) = EXPR_WFL_LINECOL ($2);
2069
2070                   end_class_declaration (1);
2071
2072                   /* Now we can craft the new expression. The
2073                      statement doesn't need to be remember so that a
2074                      constructor can be generated, since its signature
2075                      is already known. */
2076                   $$ = build_new_invocation (id, NULL_TREE);
2077                 }
2078 ;
2079
2080 something_dot_new:              /* Added, not part of the specs. */
2081         name DOT_TK NEW_TK
2082                 { $$ = $1; }
2083 |       primary DOT_TK NEW_TK
2084                 { $$ = $1; }
2085 ;
2086
2087 argument_list:
2088         expression
2089                 {
2090                   $$ = tree_cons (NULL_TREE, $1, NULL_TREE);
2091                   ctxp->formal_parameter_number = 1;
2092                 }
2093 |       argument_list C_TK expression
2094                 {
2095                   ctxp->formal_parameter_number += 1;
2096                   $$ = tree_cons (NULL_TREE, $3, $1);
2097                 }
2098 |       argument_list C_TK error
2099                 {yyerror ("Missing term"); RECOVER;}
2100 ;
2101
2102 array_creation_expression:
2103         NEW_TK primitive_type dim_exprs
2104                 { $$ = build_newarray_node ($2, $3, 0); }
2105 |       NEW_TK class_or_interface_type dim_exprs
2106                 { $$ = build_newarray_node ($2, $3, 0); }
2107 |       NEW_TK primitive_type dim_exprs dims
2108                 { $$ = build_newarray_node ($2, $3, pop_current_osb (ctxp));}
2109 |       NEW_TK class_or_interface_type dim_exprs dims
2110                 { $$ = build_newarray_node ($2, $3, pop_current_osb (ctxp));}
2111         /* Added, JDK1.1 anonymous array. Initial documentation rule
2112            modified */
2113 |       NEW_TK class_or_interface_type dims array_initializer
2114                 {
2115                   char *sig;
2116                   int osb = pop_current_osb (ctxp);
2117                   while (osb--)
2118                     obstack_grow (&temporary_obstack, "[]", 2);
2119                   obstack_1grow (&temporary_obstack, '\0');
2120                   sig = obstack_finish (&temporary_obstack);
2121                   $$ = build (NEW_ANONYMOUS_ARRAY_EXPR, NULL_TREE,
2122                               $2, get_identifier (sig), $4);
2123                 }
2124 |       NEW_TK primitive_type dims array_initializer
2125                 {
2126                   int osb = pop_current_osb (ctxp);
2127                   tree type = $2;
2128                   while (osb--)
2129                     type = build_java_array_type (type, -1);
2130                   $$ = build (NEW_ANONYMOUS_ARRAY_EXPR, NULL_TREE,
2131                               build_pointer_type (type), NULL_TREE, $4);
2132                 }
2133 |       NEW_TK error CSB_TK
2134                 {yyerror ("'[' expected"); DRECOVER ("]");}
2135 |       NEW_TK error OSB_TK
2136                 {yyerror ("']' expected"); RECOVER;}
2137 ;
2138
2139 dim_exprs:
2140         dim_expr
2141                 { $$ = build_tree_list (NULL_TREE, $1); }
2142 |       dim_exprs dim_expr
2143                 { $$ = tree_cons (NULL_TREE, $2, $$); }
2144 ;
2145
2146 dim_expr:
2147         OSB_TK expression CSB_TK
2148                 {
2149                   if (JNUMERIC_TYPE_P (TREE_TYPE ($2)))
2150                     {
2151                       $2 = build_wfl_node ($2);
2152                       TREE_TYPE ($2) = NULL_TREE;
2153                     }
2154                   EXPR_WFL_LINECOL ($2) = $1.location;
2155                   $$ = $2;
2156                 }
2157 |       OSB_TK expression error
2158                 {yyerror ("']' expected"); RECOVER;}
2159 |       OSB_TK error
2160                 {
2161                   yyerror ("Missing term");
2162                   yyerror ("']' expected");
2163                   RECOVER;
2164                 }
2165 ;
2166
2167 dims:
2168         OSB_TK CSB_TK
2169                 {
2170                   int allocate = 0;
2171                   /* If not initialized, allocate memory for the osb
2172                      numbers stack */
2173                   if (!ctxp->osb_limit)
2174                     {
2175                       allocate = ctxp->osb_limit = 32;
2176                       ctxp->osb_depth = -1;
2177                     }
2178                   /* If capacity overflown, reallocate a bigger chunk */
2179                   else if (ctxp->osb_depth+1 == ctxp->osb_limit)
2180                     allocate = ctxp->osb_limit << 1;
2181
2182                   if (allocate)
2183                     {
2184                       allocate *= sizeof (int);
2185                       if (ctxp->osb_number)
2186                         ctxp->osb_number = xrealloc (ctxp->osb_number,
2187                                                      allocate);
2188                       else
2189                         ctxp->osb_number = xmalloc (allocate);
2190                     }
2191                   ctxp->osb_depth++;
2192                   CURRENT_OSB (ctxp) = 1;
2193                 }
2194 |       dims OSB_TK CSB_TK
2195                 { CURRENT_OSB (ctxp)++; }
2196 |       dims OSB_TK error
2197                 { yyerror ("']' expected"); RECOVER;}
2198 ;
2199
2200 field_access:
2201         primary DOT_TK identifier
2202                 { $$ = make_qualified_primary ($1, $3, $2.location); }
2203                 /*  FIXME - REWRITE TO:
2204                 { $$ = build_binop (COMPONENT_REF, $2.location, $1, $3); } */
2205 |       SUPER_TK DOT_TK identifier
2206                 {
2207                   tree super_wfl = build_wfl_node (super_identifier_node);
2208                   EXPR_WFL_LINECOL (super_wfl) = $1.location;
2209                   $$ = make_qualified_name (super_wfl, $3, $2.location);
2210                 }
2211 |       SUPER_TK error
2212                 {yyerror ("Field expected"); DRECOVER (super_field_acces);}
2213 ;
2214
2215 method_invocation:
2216         name OP_TK CP_TK
2217                 { $$ = build_method_invocation ($1, NULL_TREE); }
2218 |       name OP_TK argument_list CP_TK
2219                 { $$ = build_method_invocation ($1, $3); }
2220 |       primary DOT_TK identifier OP_TK CP_TK
2221                 {
2222                   if (TREE_CODE ($1) == THIS_EXPR)
2223                     $$ = build_this_super_qualified_invocation
2224                       (1, $3, NULL_TREE, 0, $2.location);
2225                   else
2226                     {
2227                       tree invok = build_method_invocation ($3, NULL_TREE);
2228                       $$ = make_qualified_primary ($1, invok, $2.location);
2229                     }
2230                 }
2231 |       primary DOT_TK identifier OP_TK argument_list CP_TK
2232                 {
2233                   if (TREE_CODE ($1) == THIS_EXPR)
2234                     $$ = build_this_super_qualified_invocation
2235                       (1, $3, $5, 0, $2.location);
2236                   else
2237                     {
2238                       tree invok = build_method_invocation ($3, $5);
2239                       $$ = make_qualified_primary ($1, invok, $2.location);
2240                     }
2241                 }
2242 |       SUPER_TK DOT_TK identifier OP_TK CP_TK
2243                 {
2244                   $$ = build_this_super_qualified_invocation
2245                     (0, $3, NULL_TREE, $1.location, $2.location);
2246                 }
2247 |       SUPER_TK DOT_TK identifier OP_TK argument_list CP_TK
2248                 {
2249                   $$ = build_this_super_qualified_invocation
2250                     (0, $3, $5, $1.location, $2.location);
2251                 }
2252         /* Screws up thing. I let it here until I'm convinced it can
2253            be removed. FIXME
2254 |       primary DOT_TK error
2255                 {yyerror ("'(' expected"); DRECOVER(bad);} */
2256 |       SUPER_TK DOT_TK error CP_TK
2257                 { yyerror ("'(' expected"); DRECOVER (method_invocation); }
2258 |       SUPER_TK DOT_TK error DOT_TK
2259                 { yyerror ("'(' expected"); DRECOVER (method_invocation); }
2260 ;
2261
2262 array_access:
2263         name OSB_TK expression CSB_TK
2264                 { $$ = build_array_ref ($2.location, $1, $3); }
2265 |       primary_no_new_array OSB_TK expression CSB_TK
2266                 { $$ = build_array_ref ($2.location, $1, $3); }
2267 |       name OSB_TK error
2268                 {
2269                   yyerror ("Missing term and ']' expected");
2270                   DRECOVER(array_access);
2271                 }
2272 |       name OSB_TK expression error
2273                 {
2274                   yyerror ("']' expected");
2275                   DRECOVER(array_access);
2276                 }
2277 |       primary_no_new_array OSB_TK error
2278                 {
2279                   yyerror ("Missing term and ']' expected");
2280                   DRECOVER(array_access);
2281                 }
2282 |       primary_no_new_array OSB_TK expression error
2283                 {
2284                   yyerror ("']' expected");
2285                   DRECOVER(array_access);
2286                 }
2287 ;
2288
2289 postfix_expression:
2290         primary
2291 |       name
2292 |       post_increment_expression
2293 |       post_decrement_expression
2294 ;
2295
2296 post_increment_expression:
2297         postfix_expression INCR_TK
2298                 { $$ = build_incdec ($2.token, $2.location, $1, 1); }
2299 ;
2300
2301 post_decrement_expression:
2302         postfix_expression DECR_TK
2303                 { $$ = build_incdec ($2.token, $2.location, $1, 1); }
2304 ;
2305
2306 trap_overflow_corner_case:
2307         pre_increment_expression
2308 |       pre_decrement_expression
2309 |       PLUS_TK unary_expression
2310                 {$$ = build_unaryop ($1.token, $1.location, $2); }
2311 |       unary_expression_not_plus_minus
2312 |       PLUS_TK error
2313                 {yyerror ("Missing term"); RECOVER}
2314 ;
2315
2316 unary_expression:
2317         trap_overflow_corner_case
2318                 {
2319                   error_if_numeric_overflow ($1);
2320                   $$ = $1;
2321                 }
2322 |       MINUS_TK trap_overflow_corner_case
2323                 {$$ = build_unaryop ($1.token, $1.location, $2); }
2324 |       MINUS_TK error
2325                 {yyerror ("Missing term"); RECOVER}
2326 ;
2327
2328 pre_increment_expression:
2329         INCR_TK unary_expression
2330                 {$$ = build_incdec ($1.token, $1.location, $2, 0); }
2331 |       INCR_TK error
2332                 {yyerror ("Missing term"); RECOVER}
2333 ;
2334
2335 pre_decrement_expression:
2336         DECR_TK unary_expression
2337                 {$$ = build_incdec ($1.token, $1.location, $2, 0); }
2338 |       DECR_TK error
2339                 {yyerror ("Missing term"); RECOVER}
2340 ;
2341
2342 unary_expression_not_plus_minus:
2343         postfix_expression
2344 |       NOT_TK unary_expression
2345                 {$$ = build_unaryop ($1.token, $1.location, $2); }
2346 |       NEG_TK unary_expression
2347                 {$$ = build_unaryop ($1.token, $1.location, $2); }
2348 |       cast_expression
2349 |       NOT_TK error
2350                 {yyerror ("Missing term"); RECOVER}
2351 |       NEG_TK error
2352                 {yyerror ("Missing term"); RECOVER}
2353 ;
2354
2355 cast_expression:                /* Error handling here is potentially weak */
2356         OP_TK primitive_type dims CP_TK unary_expression
2357                 {
2358                   tree type = $2;
2359                   int osb = pop_current_osb (ctxp);
2360                   while (osb--)
2361                     type = build_java_array_type (type, -1);
2362                   $$ = build_cast ($1.location, type, $5);
2363                 }
2364 |       OP_TK primitive_type CP_TK unary_expression
2365                 { $$ = build_cast ($1.location, $2, $4); }
2366 |       OP_TK expression CP_TK unary_expression_not_plus_minus
2367                 { $$ = build_cast ($1.location, $2, $4); }
2368 |       OP_TK name dims CP_TK unary_expression_not_plus_minus
2369                 {
2370                   const char *ptr;
2371                   int osb = pop_current_osb (ctxp);
2372                   obstack_grow (&temporary_obstack,
2373                                 IDENTIFIER_POINTER (EXPR_WFL_NODE ($2)),
2374                                 IDENTIFIER_LENGTH (EXPR_WFL_NODE ($2)));
2375                   while (osb--)
2376                     obstack_grow (&temporary_obstack, "[]", 2);
2377                   obstack_1grow (&temporary_obstack, '\0');
2378                   ptr = obstack_finish (&temporary_obstack);
2379                   EXPR_WFL_NODE ($2) = get_identifier (ptr);
2380                   $$ = build_cast ($1.location, $2, $5);
2381                 }
2382 |       OP_TK primitive_type OSB_TK error
2383                 {yyerror ("']' expected, invalid type expression");}
2384 |       OP_TK error
2385                 {
2386                   YYNOT_TWICE yyerror ("Invalid type expression"); RECOVER;
2387                   RECOVER;
2388                 }
2389 |       OP_TK primitive_type dims CP_TK error
2390                 {yyerror ("Missing term"); RECOVER;}
2391 |       OP_TK primitive_type CP_TK error
2392                 {yyerror ("Missing term"); RECOVER;}
2393 |       OP_TK name dims CP_TK error
2394                 {yyerror ("Missing term"); RECOVER;}
2395 ;
2396
2397 multiplicative_expression:
2398         unary_expression
2399 |       multiplicative_expression MULT_TK unary_expression
2400                 {
2401                   $$ = build_binop (BINOP_LOOKUP ($2.token),
2402                                     $2.location, $1, $3);
2403                 }
2404 |       multiplicative_expression DIV_TK unary_expression
2405                 {
2406                   $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2407                                     $1, $3);
2408                 }
2409 |       multiplicative_expression REM_TK unary_expression
2410                 {
2411                   $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2412                                     $1, $3);
2413                 }
2414 |       multiplicative_expression MULT_TK error
2415                 {yyerror ("Missing term"); RECOVER;}
2416 |       multiplicative_expression DIV_TK error
2417                 {yyerror ("Missing term"); RECOVER;}
2418 |       multiplicative_expression REM_TK error
2419                 {yyerror ("Missing term"); RECOVER;}
2420 ;
2421
2422 additive_expression:
2423         multiplicative_expression
2424 |       additive_expression PLUS_TK multiplicative_expression
2425                 {
2426                   $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2427                                     $1, $3);
2428                 }
2429 |       additive_expression MINUS_TK multiplicative_expression
2430                 {
2431                   $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2432                                     $1, $3);
2433                 }
2434 |       additive_expression PLUS_TK error
2435                 {yyerror ("Missing term"); RECOVER;}
2436 |       additive_expression MINUS_TK error
2437                 {yyerror ("Missing term"); RECOVER;}
2438 ;
2439
2440 shift_expression:
2441         additive_expression
2442 |       shift_expression LS_TK additive_expression
2443                 {
2444                   $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2445                                     $1, $3);
2446                 }
2447 |       shift_expression SRS_TK additive_expression
2448                 {
2449                   $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2450                                     $1, $3);
2451                 }
2452 |       shift_expression ZRS_TK additive_expression
2453                 {
2454                   $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2455                                     $1, $3);
2456                 }
2457 |       shift_expression LS_TK error
2458                 {yyerror ("Missing term"); RECOVER;}
2459 |       shift_expression SRS_TK error
2460                 {yyerror ("Missing term"); RECOVER;}
2461 |       shift_expression ZRS_TK error
2462                 {yyerror ("Missing term"); RECOVER;}
2463 ;
2464
2465 relational_expression:
2466         shift_expression
2467 |       relational_expression LT_TK shift_expression
2468                 {
2469                   $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2470                                     $1, $3);
2471                 }
2472 |       relational_expression GT_TK shift_expression
2473                 {
2474                   $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2475                                     $1, $3);
2476                 }
2477 |       relational_expression LTE_TK shift_expression
2478                 {
2479                   $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2480                                     $1, $3);
2481                 }
2482 |       relational_expression GTE_TK shift_expression
2483                 {
2484                   $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2485                                     $1, $3);
2486                 }
2487 |       relational_expression INSTANCEOF_TK reference_type
2488                 { $$ = build_binop (INSTANCEOF_EXPR, $2.location, $1, $3); }
2489 |       relational_expression LT_TK error
2490                 {yyerror ("Missing term"); RECOVER;}
2491 |       relational_expression GT_TK error
2492                 {yyerror ("Missing term"); RECOVER;}
2493 |       relational_expression LTE_TK error
2494                 {yyerror ("Missing term"); RECOVER;}
2495 |       relational_expression GTE_TK error
2496                 {yyerror ("Missing term"); RECOVER;}
2497 |       relational_expression INSTANCEOF_TK error
2498                 {yyerror ("Invalid reference type"); RECOVER;}
2499 ;
2500
2501 equality_expression:
2502         relational_expression
2503 |       equality_expression EQ_TK relational_expression
2504                 {
2505                   $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2506                                     $1, $3);
2507                 }
2508 |       equality_expression NEQ_TK relational_expression
2509                 {
2510                   $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2511                                     $1, $3);
2512                 }
2513 |       equality_expression EQ_TK error
2514                 {yyerror ("Missing term"); RECOVER;}
2515 |       equality_expression NEQ_TK error
2516                 {yyerror ("Missing term"); RECOVER;}
2517 ;
2518
2519 and_expression:
2520         equality_expression
2521 |       and_expression AND_TK equality_expression
2522                 {
2523                   $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2524                                     $1, $3);
2525                 }
2526 |       and_expression AND_TK error
2527                 {yyerror ("Missing term"); RECOVER;}
2528 ;
2529
2530 exclusive_or_expression:
2531         and_expression
2532 |       exclusive_or_expression XOR_TK and_expression
2533                 {
2534                   $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2535                                     $1, $3);
2536                 }
2537 |       exclusive_or_expression XOR_TK error
2538                 {yyerror ("Missing term"); RECOVER;}
2539 ;
2540
2541 inclusive_or_expression:
2542         exclusive_or_expression
2543 |       inclusive_or_expression OR_TK exclusive_or_expression
2544                 {
2545                   $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2546                                     $1, $3);
2547                 }
2548 |       inclusive_or_expression OR_TK error
2549                 {yyerror ("Missing term"); RECOVER;}
2550 ;
2551
2552 conditional_and_expression:
2553         inclusive_or_expression
2554 |       conditional_and_expression BOOL_AND_TK inclusive_or_expression
2555                 {
2556                   $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2557                                     $1, $3);
2558                 }
2559 |       conditional_and_expression BOOL_AND_TK error
2560                 {yyerror ("Missing term"); RECOVER;}
2561 ;
2562
2563 conditional_or_expression:
2564         conditional_and_expression
2565 |       conditional_or_expression BOOL_OR_TK conditional_and_expression
2566                 {
2567                   $$ = build_binop (BINOP_LOOKUP ($2.token), $2.location,
2568                                     $1, $3);
2569                 }
2570 |       conditional_or_expression BOOL_OR_TK error
2571                 {yyerror ("Missing term"); RECOVER;}
2572 ;
2573
2574 conditional_expression:         /* Error handling here is weak */
2575         conditional_or_expression
2576 |       conditional_or_expression REL_QM_TK expression REL_CL_TK conditional_expression
2577                 {
2578                   $$ = build (CONDITIONAL_EXPR, NULL_TREE, $1, $3, $5);
2579                   EXPR_WFL_LINECOL ($$) = $2.location;
2580                 }
2581 |       conditional_or_expression REL_QM_TK REL_CL_TK error
2582                 {
2583                   YYERROR_NOW;
2584                   yyerror ("Missing term");
2585                   DRECOVER (1);
2586                 }
2587 |       conditional_or_expression REL_QM_TK error
2588                 {yyerror ("Missing term"); DRECOVER (2);}
2589 |       conditional_or_expression REL_QM_TK expression REL_CL_TK error
2590                 {yyerror ("Missing term"); DRECOVER (3);}
2591 ;
2592
2593 assignment_expression:
2594         conditional_expression
2595 |       assignment
2596 ;
2597
2598 assignment:
2599         left_hand_side assignment_operator assignment_expression
2600                 { $$ = build_assignment ($2.token, $2.location, $1, $3); }
2601 |       left_hand_side assignment_operator error
2602                 {
2603                   YYNOT_TWICE yyerror ("Missing term");
2604                   DRECOVER (assign);
2605                 }
2606 ;
2607
2608 left_hand_side:
2609         name
2610 |       field_access
2611 |       array_access
2612 ;
2613
2614 assignment_operator:
2615         ASSIGN_ANY_TK
2616 |       ASSIGN_TK
2617 ;
2618
2619 expression:
2620         assignment_expression
2621 ;
2622
2623 constant_expression:
2624         expression
2625 ;
2626
2627 %%
2628
2629 /* Helper function to retrieve an OSB count. Should be used when the
2630    `dims:' rule is being used.  */
2631
2632 static int
2633 pop_current_osb (struct parser_ctxt *ctxp)
2634 {
2635   int to_return;
2636
2637   if (ctxp->osb_depth < 0)
2638     abort ();
2639
2640   to_return = CURRENT_OSB (ctxp);
2641   ctxp->osb_depth--;
2642
2643   return to_return;
2644 }
2645
2646 \f
2647
2648 /* This section of the code deal with save/restoring parser contexts.
2649    Add mode documentation here. FIXME */
2650
2651 /* Helper function. Create a new parser context. With
2652    COPY_FROM_PREVIOUS set to a nonzero value, content of the previous
2653    context is copied, otherwise, the new context is zeroed. The newly
2654    created context becomes the current one.  */
2655
2656 static void
2657 create_new_parser_context (int copy_from_previous)
2658 {
2659   struct parser_ctxt *new;
2660
2661   new = ggc_alloc (sizeof (struct parser_ctxt));
2662   if (copy_from_previous)
2663     {
2664       memcpy (new, ctxp, sizeof (struct parser_ctxt));
2665       new->saved_data_ctx = 1;
2666     }
2667   else
2668     memset (new, 0, sizeof (struct parser_ctxt));
2669
2670   new->next = ctxp;
2671   ctxp = new;
2672 }
2673
2674 /* Create a new parser context and make it the current one. */
2675
2676 void
2677 java_push_parser_context (void)
2678 {
2679   create_new_parser_context (0);
2680 }
2681
2682 void
2683 java_pop_parser_context (int generate)
2684 {
2685   tree current;
2686   struct parser_ctxt *toFree, *next;
2687
2688   if (!ctxp)
2689     return;
2690
2691   toFree = ctxp;
2692   next = ctxp->next;
2693   if (next)
2694     {
2695       input_line = ctxp->lineno;
2696       current_class = ctxp->class_type;
2697     }
2698
2699   /* If the old and new lexers differ, then free the old one.  */
2700   if (ctxp->lexer && next && ctxp->lexer != next->lexer)
2701     java_destroy_lexer (ctxp->lexer);
2702
2703   /* Set the single import class file flag to 0 for the current list
2704      of imported things */
2705   for (current = ctxp->import_list; current; current = TREE_CHAIN (current))
2706     IS_A_SINGLE_IMPORT_CLASSFILE_NAME_P (TREE_VALUE (current)) = 0;
2707
2708   /* And restore those of the previous context */
2709   if ((ctxp = next))            /* Assignment is really meant here */
2710     for (current = ctxp->import_list; current; current = TREE_CHAIN (current))
2711       IS_A_SINGLE_IMPORT_CLASSFILE_NAME_P (TREE_VALUE (current)) = 1;
2712
2713   /* If we pushed a context to parse a class intended to be generated,
2714      we keep it so we can remember the class. What we could actually
2715      do is to just update a list of class names.  */
2716   if (generate)
2717     {
2718       toFree->next = ctxp_for_generation;
2719       ctxp_for_generation = toFree;
2720     }
2721 }
2722
2723 /* Create a parser context for the use of saving some global
2724    variables.  */
2725
2726 void
2727 java_parser_context_save_global (void)
2728 {
2729   if (!ctxp)
2730     {
2731       java_push_parser_context ();
2732       ctxp->saved_data_ctx = 1;
2733     }
2734
2735   /* If this context already stores data, create a new one suitable
2736      for data storage. */
2737   else if (ctxp->saved_data)
2738     create_new_parser_context (1);
2739
2740   ctxp->lineno = input_line;
2741   ctxp->class_type = current_class;
2742   ctxp->filename = input_filename;
2743   ctxp->function_decl = current_function_decl;
2744   ctxp->saved_data = 1;
2745 }
2746
2747 /* Restore some global variables from the previous context. Make the
2748    previous context the current one.  */
2749
2750 void
2751 java_parser_context_restore_global (void)
2752 {
2753   input_line = ctxp->lineno;
2754   current_class = ctxp->class_type;
2755   input_filename = ctxp->filename;
2756   if (wfl_operator)
2757     {
2758       tree s;
2759       BUILD_FILENAME_IDENTIFIER_NODE (s, input_filename);
2760       EXPR_WFL_FILENAME_NODE (wfl_operator) = s;
2761     }
2762   current_function_decl = ctxp->function_decl;
2763   ctxp->saved_data = 0;
2764   if (ctxp->saved_data_ctx)
2765     java_pop_parser_context (0);
2766 }
2767
2768 /* Suspend vital data for the current class/function being parsed so
2769    that an other class can be parsed. Used to let local/anonymous
2770    classes be parsed.  */
2771
2772 static void
2773 java_parser_context_suspend (void)
2774 {
2775   /* This makes debugging through java_debug_context easier */
2776   static const char *const name = "<inner buffer context>";
2777
2778   /* Duplicate the previous context, use it to save the globals we're
2779      interested in */
2780   create_new_parser_context (1);
2781   ctxp->function_decl = current_function_decl;
2782   ctxp->class_type = current_class;
2783
2784   /* Then create a new context which inherits all data from the
2785      previous one. This will be the new current context  */
2786   create_new_parser_context (1);
2787
2788   /* Help debugging */
2789   ctxp->next->filename = name;
2790 }
2791
2792 /* Resume vital data for the current class/function being parsed so
2793    that an other class can be parsed. Used to let local/anonymous
2794    classes be parsed.  The trick is the data storing file position
2795    informations must be restored to their current value, so parsing
2796    can resume as if no context was ever saved. */
2797
2798 static void
2799 java_parser_context_resume (void)
2800 {
2801   struct parser_ctxt *old = ctxp;             /* This one is to be discarded */
2802   struct parser_ctxt *saver = old->next;      /* This one contain saved info */
2803   struct parser_ctxt *restored = saver->next; /* This one is the old current */
2804
2805   /* We need to inherit the list of classes to complete/generate */
2806   restored->classd_list = old->classd_list;
2807   restored->class_list = old->class_list;
2808
2809   /* Restore the current class and function from the saver */
2810   current_class = saver->class_type;
2811   current_function_decl = saver->function_decl;
2812
2813   /* Retrive the restored context */
2814   ctxp = restored;
2815
2816   /* Re-installed the data for the parsing to carry on */
2817   memcpy (&ctxp->marker_begining, &old->marker_begining,
2818           (size_t)(&ctxp->marker_end - &ctxp->marker_begining));
2819 }
2820
2821 /* Add a new anchor node to which all statement(s) initializing static
2822    and non static initialized upon declaration field(s) will be
2823    linked.  */
2824
2825 static void
2826 java_parser_context_push_initialized_field (void)
2827 {
2828   tree node;
2829
2830   node = build_tree_list (NULL_TREE, NULL_TREE);
2831   TREE_CHAIN (node) = CPC_STATIC_INITIALIZER_LIST (ctxp);
2832   CPC_STATIC_INITIALIZER_LIST (ctxp) = node;
2833
2834   node = build_tree_list (NULL_TREE, NULL_TREE);
2835   TREE_CHAIN (node) = CPC_INITIALIZER_LIST (ctxp);
2836   CPC_INITIALIZER_LIST (ctxp) = node;
2837
2838   node = build_tree_list (NULL_TREE, NULL_TREE);
2839   TREE_CHAIN (node) = CPC_INSTANCE_INITIALIZER_LIST (ctxp);
2840   CPC_INSTANCE_INITIALIZER_LIST (ctxp) = node;
2841 }
2842
2843 /* Pop the lists of initialized field. If this lists aren't empty,
2844    remember them so we can use it to create and populate the finit$
2845    or <clinit> functions. */
2846
2847 static void
2848 java_parser_context_pop_initialized_field (void)
2849 {
2850   tree stmts;
2851   tree class_type = TREE_TYPE (GET_CPC ());
2852
2853   if (CPC_INITIALIZER_LIST (ctxp))
2854     {
2855       stmts = CPC_INITIALIZER_STMT (ctxp);
2856       CPC_INITIALIZER_LIST (ctxp) = TREE_CHAIN (CPC_INITIALIZER_LIST (ctxp));
2857       if (stmts && !java_error_count)
2858         TYPE_FINIT_STMT_LIST (class_type) = reorder_static_initialized (stmts);
2859     }
2860
2861   if (CPC_STATIC_INITIALIZER_LIST (ctxp))
2862     {
2863       stmts = CPC_STATIC_INITIALIZER_STMT (ctxp);
2864       CPC_STATIC_INITIALIZER_LIST (ctxp) =
2865         TREE_CHAIN (CPC_STATIC_INITIALIZER_LIST (ctxp));
2866       /* Keep initialization in order to enforce 8.5 */
2867       if (stmts && !java_error_count)
2868         TYPE_CLINIT_STMT_LIST (class_type) = nreverse (stmts);
2869     }
2870
2871   /* JDK 1.1 instance initializers */
2872   if (CPC_INSTANCE_INITIALIZER_LIST (ctxp))
2873     {
2874       stmts = CPC_INSTANCE_INITIALIZER_STMT (ctxp);
2875       CPC_INSTANCE_INITIALIZER_LIST (ctxp) =
2876         TREE_CHAIN (CPC_INSTANCE_INITIALIZER_LIST (ctxp));
2877       if (stmts && !java_error_count)
2878         TYPE_II_STMT_LIST (class_type) = nreverse (stmts);
2879     }
2880 }
2881
2882 static tree
2883 reorder_static_initialized (tree list)
2884 {
2885   /* We have to keep things in order. The alias initializer have to
2886      come first, then the initialized regular field, in reverse to
2887      keep them in lexical order. */
2888   tree marker, previous = NULL_TREE;
2889   for (marker = list; marker; previous = marker, marker = TREE_CHAIN (marker))
2890     if (TREE_CODE (marker) == TREE_LIST
2891         && !TREE_VALUE (marker) && !TREE_PURPOSE (marker))
2892       break;
2893
2894   /* No static initialized, the list is fine as is */
2895   if (!previous)
2896     list = TREE_CHAIN (marker);
2897
2898   /* No marker? reverse the whole list */
2899   else if (!marker)
2900     list = nreverse (list);
2901
2902   /* Otherwise, reverse what's after the marker and the new reordered
2903      sublist will replace the marker. */
2904   else
2905     {
2906       TREE_CHAIN (previous) = NULL_TREE;
2907       list = nreverse (list);
2908       list = chainon (TREE_CHAIN (marker), list);
2909     }
2910   return list;
2911 }
2912
2913 /* Helper functions to dump the parser context stack.  */
2914
2915 #define TAB_CONTEXT(C) \
2916   {int i; for (i = 0; i < (C); i++) fputc (' ', stderr);}
2917
2918 static void
2919 java_debug_context_do (int tab)
2920 {
2921   struct parser_ctxt *copy = ctxp;
2922   while (copy)
2923     {
2924       TAB_CONTEXT (tab);
2925       fprintf (stderr, "ctxt: 0x%0lX\n", (unsigned long)copy);
2926       TAB_CONTEXT (tab);
2927       fprintf (stderr, "filename: %s\n", copy->filename);
2928       TAB_CONTEXT (tab);
2929       fprintf (stderr, "lineno: %d\n", copy->lineno);
2930       TAB_CONTEXT (tab);
2931       fprintf (stderr, "package: %s\n",
2932                (copy->package ?
2933                 IDENTIFIER_POINTER (copy->package) : "<none>"));
2934       TAB_CONTEXT (tab);
2935       fprintf (stderr, "context for saving: %d\n", copy->saved_data_ctx);
2936       TAB_CONTEXT (tab);
2937       fprintf (stderr, "saved data: %d\n", copy->saved_data);
2938       copy = copy->next;
2939       tab += 2;
2940     }
2941 }
2942
2943 /* Dump the stacked up parser contexts. Intended to be called from a
2944    debugger.  */
2945
2946 void
2947 java_debug_context (void)
2948 {
2949   java_debug_context_do (0);
2950 }
2951
2952 \f
2953
2954 /* Flag for the error report routine to issue the error the first time
2955    it's called (overriding the default behavior which is to drop the
2956    first invocation and honor the second one, taking advantage of a
2957    richer context.  */
2958 static int force_error = 0;
2959
2960 /* Reporting an constructor invocation error.  */
2961 static void
2962 parse_ctor_invocation_error (void)
2963 {
2964   if (DECL_CONSTRUCTOR_P (current_function_decl))
2965     yyerror ("Constructor invocation must be first thing in a constructor");
2966   else
2967     yyerror ("Only constructors can invoke constructors");
2968 }
2969
2970 /* Reporting JDK1.1 features not implemented.  */
2971
2972 static tree
2973 parse_jdk1_1_error (const char *msg)
2974 {
2975   sorry (": `%s' JDK1.1(TM) feature", msg);
2976   java_error_count++;
2977   return empty_stmt_node;
2978 }
2979
2980 static int do_warning = 0;
2981
2982 void
2983 yyerror (const char *msg)
2984 {
2985   static java_lc elc;
2986   static int  prev_lineno;
2987   static const char *prev_msg;
2988
2989   int save_lineno;
2990   char *remainder, *code_from_source;
2991
2992   if (!force_error && prev_lineno == input_line)
2993     return;
2994
2995   /* Save current error location but report latter, when the context is
2996      richer.  */
2997   if (ctxp->java_error_flag == 0)
2998     {
2999       ctxp->java_error_flag = 1;
3000       elc = ctxp->elc;
3001       /* Do something to use the previous line if we're reaching the
3002          end of the file... */
3003 #ifdef VERBOSE_SKELETON
3004       printf ("* Error detected (%s)\n", (msg ? msg : "(null)"));
3005 #endif
3006       return;
3007     }
3008
3009   /* Ignore duplicate message on the same line. BTW, this is dubious. FIXME */
3010   if (!force_error && msg == prev_msg && prev_lineno == elc.line)
3011     return;
3012
3013   ctxp->java_error_flag = 0;
3014   if (do_warning)
3015     java_warning_count++;
3016   else
3017     java_error_count++;
3018
3019   if (elc.col == 0 && msg && msg[1] == ';')
3020     {
3021       elc.col  = ctxp->p_line->char_col-1;
3022       elc.line = ctxp->p_line->lineno;
3023     }
3024
3025   save_lineno = input_line;
3026   prev_lineno = input_line = elc.line;
3027   prev_msg = msg;
3028
3029   code_from_source = java_get_line_col (ctxp->filename, elc.line, elc.col);
3030   obstack_grow0 (&temporary_obstack,
3031                  code_from_source, strlen (code_from_source));
3032   remainder = obstack_finish (&temporary_obstack);
3033   if (do_warning)
3034     warning ("%s.\n%s", msg, remainder);
3035   else
3036     error ("%s.\n%s", msg, remainder);
3037
3038   /* This allow us to cheaply avoid an extra 'Invalid expression
3039      statement' error report when errors have been already reported on
3040      the same line. This occurs when we report an error but don't have
3041      a synchronization point other than ';', which
3042      expression_statement is the only one to take care of.  */
3043   ctxp->prevent_ese = input_line = save_lineno;
3044 }
3045
3046 static void
3047 issue_warning_error_from_context (tree cl, const char *msg, va_list ap)
3048 {
3049   const char *saved, *saved_input_filename;
3050   char buffer [4096];
3051   vsprintf (buffer, msg, ap);
3052   force_error = 1;
3053
3054   ctxp->elc.line = EXPR_WFL_LINENO (cl);
3055   ctxp->elc.col  = (EXPR_WFL_COLNO (cl) == 0xfff ? -1 :
3056                     (EXPR_WFL_COLNO (cl) == 0xffe ? -2 : EXPR_WFL_COLNO (cl)));
3057
3058   /* We have a CL, that's a good reason for using it if it contains data */
3059   saved = ctxp->filename;
3060   if (TREE_CODE (cl) == EXPR_WITH_FILE_LOCATION && EXPR_WFL_FILENAME_NODE (cl))
3061     ctxp->filename = EXPR_WFL_FILENAME (cl);
3062   saved_input_filename = input_filename;
3063   input_filename = ctxp->filename;
3064   java_error (NULL);
3065   java_error (buffer);
3066   ctxp->filename = saved;
3067   input_filename = saved_input_filename;
3068   force_error = 0;
3069 }
3070
3071 /* Issue an error message at a current source line CL */
3072
3073 void
3074 parse_error_context (tree cl, const char *msg, ...)
3075 {
3076   va_list ap;
3077   va_start (ap, msg);
3078   issue_warning_error_from_context (cl, msg, ap);
3079   va_end (ap);
3080 }
3081
3082 /* Issue a warning at a current source line CL */
3083
3084 static void
3085 parse_warning_context (tree cl, const char *msg, ...)
3086 {
3087   va_list ap;
3088   va_start (ap, msg);
3089
3090   force_error = do_warning = 1;
3091   issue_warning_error_from_context (cl, msg, ap);
3092   do_warning = force_error = 0;
3093   va_end (ap);
3094 }
3095
3096 static tree
3097 find_expr_with_wfl (tree node)
3098 {
3099   while (node)
3100     {
3101       char code;
3102       tree to_return;
3103
3104       switch (TREE_CODE (node))
3105         {
3106         case BLOCK:
3107           node = BLOCK_EXPR_BODY (node);
3108           continue;
3109
3110         case COMPOUND_EXPR:
3111           to_return = find_expr_with_wfl (TREE_OPERAND (node, 0));
3112           if (to_return)
3113             return to_return;
3114           node = TREE_OPERAND (node, 1);
3115           continue;
3116
3117         case LOOP_EXPR:
3118           node = TREE_OPERAND (node, 0);
3119           continue;
3120
3121         case LABELED_BLOCK_EXPR:
3122           node = TREE_OPERAND (node, 1);
3123           continue;
3124
3125         default:
3126           code = TREE_CODE_CLASS (TREE_CODE (node));
3127           if (((code == '1') || (code == '2') || (code == 'e'))
3128               && EXPR_WFL_LINECOL (node))
3129             return node;
3130           return NULL_TREE;
3131         }
3132     }
3133   return NULL_TREE;
3134 }
3135
3136 /* Issue a missing return statement error. Uses METHOD to figure the
3137    last line of the method the error occurs in.  */
3138
3139 static void
3140 missing_return_error (tree method)
3141 {
3142   EXPR_WFL_SET_LINECOL (wfl_operator, DECL_SOURCE_LINE_LAST (method), -2);
3143   parse_error_context (wfl_operator, "Missing return statement");
3144 }
3145
3146 /* Issue an unreachable statement error. From NODE, find the next
3147    statement to report appropriately.  */
3148 static void
3149 unreachable_stmt_error (tree node)
3150 {
3151   /* Browse node to find the next expression node that has a WFL. Use
3152      the location to report the error */
3153   if (TREE_CODE (node) == COMPOUND_EXPR)
3154     node = find_expr_with_wfl (TREE_OPERAND (node, 1));
3155   else
3156     node = find_expr_with_wfl (node);
3157
3158   if (node)
3159     {
3160       EXPR_WFL_SET_LINECOL (wfl_operator, EXPR_WFL_LINENO (node), -2);
3161       parse_error_context (wfl_operator, "Unreachable statement");
3162     }
3163   else
3164     abort ();
3165 }
3166
3167 int
3168 java_report_errors (void)
3169 {
3170   if (java_error_count)
3171     fprintf (stderr, "%d error%s",
3172              java_error_count, (java_error_count == 1 ? "" : "s"));
3173   if (java_warning_count)
3174     fprintf (stderr, "%s%d warning%s", (java_error_count ? ", " : ""),
3175              java_warning_count, (java_warning_count == 1 ? "" : "s"));
3176   if (java_error_count || java_warning_count)
3177     putc ('\n', stderr);
3178   return java_error_count;
3179 }
3180
3181 static char *
3182 java_accstring_lookup (int flags)
3183 {
3184   static char buffer [80];
3185 #define COPY_RETURN(S) {strcpy (buffer, S); return buffer;}
3186
3187   /* Access modifier looked-up first for easier report on forbidden
3188      access. */
3189   if (flags & ACC_PUBLIC) COPY_RETURN ("public");
3190   if (flags & ACC_PRIVATE) COPY_RETURN ("private");
3191   if (flags & ACC_PROTECTED) COPY_RETURN ("protected");
3192   if (flags & ACC_STATIC) COPY_RETURN ("static");
3193   if (flags & ACC_FINAL) COPY_RETURN ("final");
3194   if (flags & ACC_SYNCHRONIZED) COPY_RETURN ("synchronized");
3195   if (flags & ACC_VOLATILE) COPY_RETURN ("volatile");
3196   if (flags & ACC_TRANSIENT) COPY_RETURN ("transient");
3197   if (flags & ACC_NATIVE) COPY_RETURN ("native");
3198   if (flags & ACC_INTERFACE) COPY_RETURN ("interface");
3199   if (flags & ACC_ABSTRACT) COPY_RETURN ("abstract");
3200
3201   buffer [0] = '\0';
3202   return buffer;
3203 #undef COPY_RETURN
3204 }
3205
3206 /* Issuing error messages upon redefinition of classes, interfaces or
3207    variables. */
3208
3209 static void
3210 classitf_redefinition_error (const char *context, tree id, tree decl, tree cl)
3211 {
3212   parse_error_context (cl, "%s `%s' already defined in %s:%d",
3213                        context, IDENTIFIER_POINTER (id),
3214                        DECL_SOURCE_FILE (decl), DECL_SOURCE_LINE (decl));
3215   /* Here we should point out where its redefined. It's a unicode. FIXME */
3216 }
3217
3218 static void
3219 variable_redefinition_error (tree context, tree name, tree type, int line)
3220 {
3221   const char *type_name;
3222
3223   /* Figure a proper name for type. We might haven't resolved it */
3224   if (TREE_CODE (type) == POINTER_TYPE && !TREE_TYPE (type))
3225     type_name = IDENTIFIER_POINTER (TYPE_NAME (type));
3226   else
3227     type_name = lang_printable_name (type, 0);
3228
3229   parse_error_context (context,
3230                        "Variable `%s' is already defined in this method and was declared `%s %s' at line %d",
3231                        IDENTIFIER_POINTER (name),
3232                        type_name, IDENTIFIER_POINTER (name), line);
3233 }
3234
3235 /* If ANAME is terminated with `[]', it indicates an array. This
3236    function returns the number of `[]' found and if this number is
3237    greater than zero, it extracts the array type name and places it in
3238    the node pointed to by TRIMMED unless TRIMMED is null.  */
3239
3240 static int
3241 build_type_name_from_array_name (tree aname, tree *trimmed)
3242 {
3243   const char *name = IDENTIFIER_POINTER (aname);
3244   int len = IDENTIFIER_LENGTH (aname);
3245   int array_dims;
3246
3247   STRING_STRIP_BRACKETS (name, len, array_dims);
3248
3249   if (array_dims && trimmed)
3250     *trimmed = get_identifier_with_length (name, len);
3251
3252   return array_dims;
3253 }
3254
3255 static tree
3256 build_array_from_name (tree type, tree type_wfl, tree name, tree *ret_name)
3257 {
3258   int more_dims = 0;
3259
3260   /* Eventually get more dims */
3261   more_dims = build_type_name_from_array_name (name, &name);
3262
3263   /* If we have, then craft a new type for this variable */
3264   if (more_dims)
3265     {
3266       tree save = type;
3267
3268       /* If we have a pointer, use its type */
3269       if (TREE_CODE (type) == POINTER_TYPE)
3270         type = TREE_TYPE (type);
3271
3272       /* Building the first dimension of a primitive type uses this
3273          function */
3274       if (JPRIMITIVE_TYPE_P (type))
3275         {
3276           type = build_java_array_type (type, -1);
3277           more_dims--;
3278         }
3279       /* Otherwise, if we have a WFL for this type, use it (the type
3280          is already an array on an unresolved type, and we just keep
3281          on adding dimensions) */
3282       else if (type_wfl)
3283         {
3284           type = type_wfl;
3285           more_dims += build_type_name_from_array_name (TYPE_NAME (save),
3286                                                         NULL);
3287         }
3288
3289       /* Add all the dimensions */
3290       while (more_dims--)
3291         type = build_unresolved_array_type (type);
3292
3293       /* The type may have been incomplete in the first place */
3294       if (type_wfl)
3295         type = obtain_incomplete_type (type);
3296     }
3297
3298   if (ret_name)
3299     *ret_name = name;
3300   return type;
3301 }
3302
3303 /* Build something that the type identifier resolver will identify as
3304    being an array to an unresolved type. TYPE_WFL is a WFL on a
3305    identifier. */
3306
3307 static tree
3308 build_unresolved_array_type (tree type_or_wfl)
3309 {
3310   const char *ptr;
3311   tree wfl;
3312
3313   /* TYPE_OR_WFL might be an array on a resolved type. In this case,
3314      just create a array type */
3315   if (TREE_CODE (type_or_wfl) == RECORD_TYPE)
3316     return build_java_array_type (type_or_wfl, -1);
3317
3318   obstack_grow (&temporary_obstack,
3319                  IDENTIFIER_POINTER (EXPR_WFL_NODE (type_or_wfl)),
3320                  IDENTIFIER_LENGTH (EXPR_WFL_NODE (type_or_wfl)));
3321   obstack_grow0 (&temporary_obstack, "[]", 2);
3322   ptr = obstack_finish (&temporary_obstack);
3323   wfl = build_expr_wfl (get_identifier (ptr),
3324                         EXPR_WFL_FILENAME (type_or_wfl),
3325                         EXPR_WFL_LINENO (type_or_wfl),
3326                         EXPR_WFL_COLNO (type_or_wfl));
3327   /* Re-install the existing qualifications so that the type can be
3328      resolved properly. */
3329   EXPR_WFL_QUALIFICATION (wfl) = EXPR_WFL_QUALIFICATION (type_or_wfl);
3330   return wfl;
3331 }
3332
3333 static void
3334 parser_add_interface (tree class_decl, tree interface_decl, tree wfl)
3335 {
3336   if (maybe_add_interface (TREE_TYPE (class_decl), TREE_TYPE (interface_decl)))
3337     parse_error_context (wfl, "Interface `%s' repeated",
3338                          IDENTIFIER_POINTER (DECL_NAME (interface_decl)));
3339 }
3340
3341 /* Bulk of common class/interface checks. Return 1 if an error was
3342    encountered. TAG is 0 for a class, 1 for an interface.  */
3343
3344 static int
3345 check_class_interface_creation (int is_interface, int flags, tree raw_name,
3346                                 tree qualified_name, tree decl, tree cl)
3347 {
3348   tree node;
3349   int sca = 0;                  /* Static class allowed */
3350   int icaf = 0;                 /* Inner class allowed flags */
3351   int uaaf = CLASS_MODIFIERS;   /* Usually allowed access flags */
3352
3353   if (!quiet_flag)
3354     fprintf (stderr, " %s%s %s",
3355              (CPC_INNER_P () ? "inner" : ""),
3356              (is_interface ? "interface" : "class"),
3357              IDENTIFIER_POINTER (qualified_name));
3358
3359   /* Scope of an interface/class type name:
3360        - Can't be imported by a single type import
3361        - Can't already exists in the package */
3362   if (IS_A_SINGLE_IMPORT_CLASSFILE_NAME_P (raw_name)
3363       && (node = find_name_in_single_imports (raw_name))
3364       && !CPC_INNER_P ())
3365     {
3366       parse_error_context
3367         (cl, "%s name `%s' clashes with imported type `%s'",
3368          (is_interface ? "Interface" : "Class"),
3369          IDENTIFIER_POINTER (raw_name), IDENTIFIER_POINTER (node));
3370       return 1;
3371     }
3372   if (decl && CLASS_COMPLETE_P (decl))
3373     {
3374       classitf_redefinition_error ((is_interface ? "Interface" : "Class"),
3375                                    qualified_name, decl, cl);
3376       return 1;
3377     }
3378
3379   if (check_inner_class_redefinition (raw_name, cl))
3380     return 1;
3381
3382   /* If public, file name should match class/interface name, except
3383      when dealing with an inner class */
3384   if (!CPC_INNER_P () && (flags & ACC_PUBLIC ))
3385     {
3386       const char *f;
3387
3388       for (f = &input_filename [strlen (input_filename)];
3389            f != input_filename && ! IS_DIR_SEPARATOR (f[0]);
3390            f--)
3391         ;
3392       if (IS_DIR_SEPARATOR (f[0]))
3393         f++;
3394       if (strncmp (IDENTIFIER_POINTER (raw_name),
3395                    f , IDENTIFIER_LENGTH (raw_name)) ||
3396           f [IDENTIFIER_LENGTH (raw_name)] != '.')
3397         parse_error_context
3398           (cl, "Public %s `%s' must be defined in a file called `%s.java'",
3399                              (is_interface ? "interface" : "class"),
3400                              IDENTIFIER_POINTER (qualified_name),
3401                              IDENTIFIER_POINTER (raw_name));
3402     }
3403
3404   /* Static classes can be declared only in top level classes. Note:
3405      once static, a inner class is a top level class. */
3406   if (flags & ACC_STATIC)
3407     {
3408       /* Catch the specific error of declaring an class inner class
3409          with no toplevel enclosing class. Prevent check_modifiers from
3410          complaining a second time */
3411       if (CPC_INNER_P () && !TOPLEVEL_CLASS_DECL_P (GET_CPC()))
3412         {
3413           parse_error_context (cl, "Inner class `%s' can't be static. Static classes can only occur in interfaces and top-level classes",
3414                                IDENTIFIER_POINTER (qualified_name));
3415           sca = ACC_STATIC;
3416         }
3417       /* Else, in the context of a top-level class declaration, let
3418          `check_modifiers' do its job, otherwise, give it a go */
3419       else
3420         sca = (GET_CPC_LIST () ? ACC_STATIC : 0);
3421     }
3422
3423   /* Inner classes can be declared private or protected
3424      within their enclosing classes. */
3425   if (CPC_INNER_P ())
3426     {
3427       /* A class which is local to a block can't be public, private,
3428          protected or static. But it is created final, so allow this
3429          one. */
3430       if (current_function_decl)
3431         icaf = sca = uaaf = ACC_FINAL;
3432       else
3433         {
3434           check_modifiers_consistency (flags);
3435           icaf = ACC_PROTECTED;
3436           if (! CLASS_INTERFACE (GET_CPC ()))
3437             icaf |= ACC_PRIVATE;
3438         }
3439     }
3440
3441   if (is_interface)
3442     {
3443       if (CPC_INNER_P ())
3444         uaaf = INTERFACE_INNER_MODIFIERS;
3445       else
3446         uaaf = INTERFACE_MODIFIERS;
3447
3448       check_modifiers ("Illegal modifier `%s' for interface declaration",
3449                        flags, uaaf);
3450     }
3451   else
3452     check_modifiers ((current_function_decl ?
3453                       "Illegal modifier `%s' for local class declaration" :
3454                       "Illegal modifier `%s' for class declaration"),
3455                      flags, uaaf|sca|icaf);
3456   return 0;
3457 }
3458
3459 /* Construct a nested class name.  If the final component starts with
3460    a digit, return true.  Otherwise return false.  */
3461 static int
3462 make_nested_class_name (tree cpc_list)
3463 {
3464   tree name;
3465
3466   if (!cpc_list)
3467     return 0;
3468
3469   make_nested_class_name (TREE_CHAIN (cpc_list));
3470
3471   /* Pick the qualified name when dealing with the first upmost
3472      enclosing class */
3473   name = (TREE_CHAIN (cpc_list)
3474           ? TREE_PURPOSE (cpc_list) : DECL_NAME (TREE_VALUE (cpc_list)));
3475   obstack_grow (&temporary_obstack,
3476                 IDENTIFIER_POINTER (name), IDENTIFIER_LENGTH (name));
3477   obstack_1grow (&temporary_obstack, '$');
3478
3479   return ISDIGIT (IDENTIFIER_POINTER (name)[0]);
3480 }
3481
3482 /* Can't redefine a class already defined in an earlier scope. */
3483
3484 static int
3485 check_inner_class_redefinition (tree raw_name, tree cl)
3486 {
3487   tree scope_list;
3488
3489   for (scope_list = GET_CPC_LIST (); scope_list;
3490        scope_list = GET_NEXT_ENCLOSING_CPC (scope_list))
3491     if (raw_name == GET_CPC_UN_NODE (scope_list))
3492       {
3493         parse_error_context
3494           (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",
3495            IDENTIFIER_POINTER (raw_name));
3496         return 1;
3497       }
3498   return 0;
3499 }
3500
3501 /* Tries to find a decl for CLASS_TYPE within ENCLOSING. If we fail,
3502    we remember ENCLOSING and SUPER.  */
3503
3504 static tree
3505 resolve_inner_class (htab_t circularity_hash, tree cl, tree *enclosing,
3506                      tree *super, tree class_type)
3507 {
3508   tree local_enclosing = *enclosing;
3509   tree local_super = NULL_TREE;
3510
3511   while (local_enclosing)
3512     {
3513       tree intermediate, decl;
3514
3515       *htab_find_slot (circularity_hash, local_enclosing, INSERT) =
3516         local_enclosing;
3517
3518       if ((decl = find_as_inner_class (local_enclosing, class_type, cl)))
3519         return decl;
3520
3521       intermediate = local_enclosing;
3522       /* Explore enclosing contexts. */
3523       while (INNER_CLASS_DECL_P (intermediate))
3524         {
3525           intermediate = DECL_CONTEXT (intermediate);
3526           if ((decl = find_as_inner_class (intermediate, class_type, cl)))
3527             return decl;
3528         }
3529
3530       /* Now go to the upper classes, bail out if necessary.  We will
3531          analyze the returned SUPER and act accordingly (see
3532          do_resolve_class).  */
3533       if (JPRIMITIVE_TYPE_P (TREE_TYPE (local_enclosing))
3534           || TREE_TYPE (local_enclosing) == void_type_node)
3535         {
3536           parse_error_context (cl, "Qualifier must be a reference");
3537           local_enclosing = NULL_TREE;
3538           break;
3539         }
3540       local_super = CLASSTYPE_SUPER (TREE_TYPE (local_enclosing));
3541       if (!local_super || local_super == object_type_node)
3542         break;
3543
3544       if (TREE_CODE (local_super) == POINTER_TYPE)
3545         local_super = do_resolve_class (NULL, local_super, NULL, NULL);
3546       else
3547         local_super = TYPE_NAME (local_super);
3548
3549       /* We may not have checked for circular inheritance yet, so do so
3550          here to prevent an infinite loop. */
3551       if (htab_find (circularity_hash, local_super) != NULL)
3552         {
3553           if (!cl)
3554             cl = lookup_cl (local_enclosing);
3555
3556           parse_error_context
3557             (cl, "Cyclic inheritance involving %s",
3558              IDENTIFIER_POINTER (DECL_NAME (local_enclosing)));
3559           local_enclosing = NULL_TREE;
3560         }
3561       else
3562         local_enclosing = local_super;
3563     }
3564
3565   /* We failed. Return LOCAL_SUPER and LOCAL_ENCLOSING. */
3566   *super = local_super;
3567   *enclosing = local_enclosing;
3568
3569   return NULL_TREE;
3570 }
3571
3572 /* Within ENCLOSING, find a decl for NAME and return it. NAME can be
3573    qualified. */
3574
3575 static tree
3576 find_as_inner_class (tree enclosing, tree name, tree cl)
3577 {
3578   tree qual, to_return;
3579   if (!enclosing)
3580     return NULL_TREE;
3581
3582   name = TYPE_NAME (name);
3583
3584   /* First search: within the scope of `enclosing', search for name */
3585   if (QUALIFIED_P (name) && cl && EXPR_WFL_NODE (cl) == name)
3586     qual = EXPR_WFL_QUALIFICATION (cl);
3587   else if (cl)
3588     qual = build_tree_list (cl, NULL_TREE);
3589   else
3590     qual = build_tree_list (build_expr_wfl (name, NULL, 0, 0), NULL_TREE);
3591
3592   if ((to_return = find_as_inner_class_do (qual, enclosing)))
3593     return to_return;
3594
3595   /* We're dealing with a qualified name. Try to resolve thing until
3596      we get something that is an enclosing class. */
3597   if (QUALIFIED_P (name) && cl && EXPR_WFL_NODE (cl) == name)
3598     {
3599       tree acc = NULL_TREE, decl = NULL_TREE, ptr;
3600
3601       for (qual = EXPR_WFL_QUALIFICATION (cl); qual && !decl;
3602            qual = TREE_CHAIN (qual))
3603         {
3604           acc = merge_qualified_name (acc,
3605                                       EXPR_WFL_NODE (TREE_PURPOSE (qual)));
3606           BUILD_PTR_FROM_NAME (ptr, acc);
3607           decl = do_resolve_class (NULL_TREE, ptr, NULL_TREE, cl);
3608         }
3609
3610       /* A NULL qual and a decl means that the search ended
3611          successfully?!? We have to do something then. FIXME */
3612
3613       if (decl)
3614         enclosing = decl;
3615       else
3616         qual = EXPR_WFL_QUALIFICATION (cl);
3617     }
3618   /* Otherwise, create a qual for the other part of the resolution. */
3619   else
3620     qual = build_tree_list (build_expr_wfl (name, NULL, 0, 0), NULL_TREE);
3621
3622   return find_as_inner_class_do (qual, enclosing);
3623 }
3624
3625 /* We go inside the list of sub classes and try to find a way
3626    through. */
3627
3628 static tree
3629 find_as_inner_class_do (tree qual, tree enclosing)
3630 {
3631   if (!qual)
3632     return NULL_TREE;
3633
3634   for (; qual && enclosing; qual = TREE_CHAIN (qual))
3635     {
3636       tree name_to_match = EXPR_WFL_NODE (TREE_PURPOSE (qual));
3637       tree next_enclosing = NULL_TREE;
3638       tree inner_list;
3639
3640       for (inner_list = DECL_INNER_CLASS_LIST (enclosing);
3641            inner_list; inner_list = TREE_CHAIN (inner_list))
3642         {
3643           if (TREE_VALUE (inner_list) == name_to_match)
3644             {
3645               next_enclosing = TREE_PURPOSE (inner_list);
3646               break;
3647             }
3648         }
3649       enclosing = next_enclosing;
3650     }
3651
3652   return (!qual && enclosing ? enclosing : NULL_TREE);
3653 }
3654
3655 /* Reach all inner classes and tie their unqualified name to a
3656    DECL. */
3657
3658 static void
3659 set_nested_class_simple_name_value (tree outer, int set)
3660 {
3661   tree l;
3662
3663   for (l = DECL_INNER_CLASS_LIST (outer); l; l = TREE_CHAIN (l))
3664     IDENTIFIER_GLOBAL_VALUE (TREE_VALUE (l)) = (set ?
3665                                                 TREE_PURPOSE (l) : NULL_TREE);
3666 }
3667
3668 static void
3669 link_nested_class_to_enclosing (void)
3670 {
3671   if (GET_ENCLOSING_CPC ())
3672     {
3673       tree enclosing = GET_ENCLOSING_CPC_CONTEXT ();
3674       DECL_INNER_CLASS_LIST (enclosing) =
3675         tree_cons (GET_CPC (), GET_CPC_UN (),
3676                    DECL_INNER_CLASS_LIST (enclosing));
3677     }
3678 }
3679
3680 static tree
3681 maybe_make_nested_class_name (tree name)
3682 {
3683   tree id = NULL_TREE;
3684
3685   if (CPC_INNER_P ())
3686     {
3687       /* If we're in a function, we must append a number to create the
3688          nested class name.  However, we don't do this if the class we
3689          are constructing is anonymous, because in that case we'll
3690          already have a number as the class name.  */
3691       if (! make_nested_class_name (GET_CPC_LIST ())
3692           && current_function_decl != NULL_TREE
3693           && ! ISDIGIT (IDENTIFIER_POINTER (name)[0]))
3694         {
3695           char buf[10];
3696           sprintf (buf, "%d", anonymous_class_counter);
3697           ++anonymous_class_counter;
3698           obstack_grow (&temporary_obstack, buf, strlen (buf));
3699           obstack_1grow (&temporary_obstack, '$');
3700         }
3701       obstack_grow0 (&temporary_obstack,
3702                      IDENTIFIER_POINTER (name),
3703                      IDENTIFIER_LENGTH (name));
3704       id = get_identifier (obstack_finish (&temporary_obstack));
3705       if (ctxp->package)
3706         QUALIFIED_P (id) = 1;
3707     }
3708   return id;
3709 }
3710
3711 /* If DECL is NULL, create and push a new DECL, record the current
3712    line CL and do other maintenance things.  */
3713
3714 static tree
3715 maybe_create_class_interface_decl (tree decl, tree raw_name,
3716                                    tree qualified_name, tree cl)
3717 {
3718   if (!decl)
3719     decl = push_class (make_class (), qualified_name);
3720
3721   /* Take care of the file and line business */
3722   DECL_SOURCE_FILE (decl) = EXPR_WFL_FILENAME (cl);
3723   /* If we're emiting xrefs, store the line/col number information */
3724   if (flag_emit_xref)
3725     DECL_SOURCE_LINE (decl) = EXPR_WFL_LINECOL (cl);
3726   else
3727     DECL_SOURCE_LINE (decl) = EXPR_WFL_LINENO (cl);
3728   CLASS_FROM_SOURCE_P (TREE_TYPE (decl)) = 1;
3729   CLASS_PARSED_P (TREE_TYPE (decl)) = 1;
3730   CLASS_FROM_CURRENTLY_COMPILED_P (TREE_TYPE (decl)) =
3731     IS_A_COMMAND_LINE_FILENAME_P (EXPR_WFL_FILENAME_NODE (cl));
3732
3733   PUSH_CPC (decl, raw_name);
3734   DECL_CONTEXT (decl) = GET_ENCLOSING_CPC_CONTEXT ();
3735
3736   /* Link the declaration to the already seen ones */
3737   TREE_CHAIN (decl) = ctxp->class_list;
3738   ctxp->class_list = decl;
3739
3740   /* Create a new nodes in the global lists */
3741   gclass_list = tree_cons (NULL_TREE, decl, gclass_list);
3742   all_class_list = tree_cons (NULL_TREE, decl, all_class_list);
3743
3744   /* Install a new dependency list element */
3745   create_jdep_list (ctxp);
3746
3747   SOURCE_FRONTEND_DEBUG (("Defining class/interface %s",
3748                           IDENTIFIER_POINTER (qualified_name)));
3749   return decl;
3750 }
3751
3752 static void
3753 add_superinterfaces (tree decl, tree interface_list)
3754 {
3755   tree node;
3756   /* Superinterface(s): if present and defined, parser_check_super_interface ()
3757      takes care of ensuring that:
3758        - This is an accessible interface type,
3759        - Circularity detection.
3760    parser_add_interface is then called. If present but not defined,
3761    the check operation is delayed until the super interface gets
3762    defined.  */
3763   for (node = interface_list; node; node = TREE_CHAIN (node))
3764     {
3765       tree current = TREE_PURPOSE (node);
3766       tree idecl = IDENTIFIER_CLASS_VALUE (EXPR_WFL_NODE (current));
3767       if (idecl && CLASS_LOADED_P (TREE_TYPE (idecl)))
3768         {
3769           if (!parser_check_super_interface (idecl, decl, current))
3770             parser_add_interface (decl, idecl, current);
3771         }
3772       else
3773         register_incomplete_type (JDEP_INTERFACE,
3774                                   current, decl, NULL_TREE);
3775     }
3776 }
3777
3778 /* Create an interface in pass1 and return its decl. Return the
3779    interface's decl in pass 2.  */
3780
3781 static tree
3782 create_interface (int flags, tree id, tree super)
3783 {
3784   tree raw_name = EXPR_WFL_NODE (id);
3785   tree q_name = parser_qualified_classname (raw_name);
3786   tree decl = IDENTIFIER_CLASS_VALUE (q_name);
3787
3788   /* Certain syntax errors are making SUPER be like ID. Avoid this
3789      case. */
3790   if (ctxp->class_err && id == super)
3791     super = NULL;
3792
3793   EXPR_WFL_NODE (id) = q_name;  /* Keep source location, even if refined. */
3794
3795   /* Basic checks: scope, redefinition, modifiers */
3796   if (check_class_interface_creation (1, flags, raw_name, q_name, decl, id))
3797     {
3798       PUSH_ERROR ();
3799       return NULL_TREE;
3800     }
3801
3802   /* Suspend the current parsing context if we're parsing an inner
3803      interface */
3804   if (CPC_INNER_P ())
3805     {
3806       java_parser_context_suspend ();
3807       /* Interface members are public. */
3808       if (CLASS_INTERFACE (GET_CPC ()))
3809         flags |= ACC_PUBLIC;
3810     }
3811
3812   /* Push a new context for (static) initialized upon declaration fields */
3813   java_parser_context_push_initialized_field ();
3814
3815   /* Interface modifiers check
3816        - public/abstract allowed (already done at that point)
3817        - abstract is obsolete (comes first, it's a warning, or should be)
3818        - Can't use twice the same (checked in the modifier rule) */
3819   if ((flags & ACC_ABSTRACT) && flag_redundant)
3820     parse_warning_context
3821       (MODIFIER_WFL (ABSTRACT_TK),
3822        "Redundant use of `abstract' modifier. Interface `%s' is implicitly abstract", IDENTIFIER_POINTER (raw_name));
3823
3824   /* Create a new decl if DECL is NULL, otherwise fix it */
3825   decl = maybe_create_class_interface_decl (decl, raw_name, q_name, id);
3826
3827   /* Set super info and mark the class a complete */
3828   set_super_info (ACC_INTERFACE | flags, TREE_TYPE (decl),
3829                   object_type_node, ctxp->interface_number);
3830   ctxp->interface_number = 0;
3831   CLASS_COMPLETE_P (decl) = 1;
3832   add_superinterfaces (decl, super);
3833
3834   /* Eventually sets the @deprecated tag flag */
3835   CHECK_DEPRECATED (decl);
3836
3837   return decl;
3838 }
3839
3840 /* Patch anonymous class CLASS, by either extending or implementing
3841    DEP.  */
3842
3843 static void
3844 patch_anonymous_class (tree type_decl, tree class_decl, tree wfl)
3845 {
3846   tree class = TREE_TYPE (class_decl);
3847   tree type =  TREE_TYPE (type_decl);
3848   tree binfo = TYPE_BINFO (class);
3849
3850   /* If it's an interface, implement it */
3851   if (CLASS_INTERFACE (type_decl))
3852     {
3853       tree s_binfo;
3854       int length;
3855
3856       if (parser_check_super_interface (type_decl, class_decl, wfl))
3857         return;
3858
3859       s_binfo = TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO (class)), 0);
3860       length = TREE_VEC_LENGTH (TYPE_BINFO_BASETYPES (class))+1;
3861       TYPE_BINFO_BASETYPES (class) = make_tree_vec (length);
3862       TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO (class)), 0) = s_binfo;
3863       /* And add the interface */
3864       parser_add_interface (class_decl, type_decl, wfl);
3865     }
3866   /* Otherwise, it's a type we want to extend */
3867   else
3868     {
3869       if (parser_check_super (type_decl, class_decl, wfl))
3870         return;
3871       BINFO_TYPE (TREE_VEC_ELT (BINFO_BASETYPES (binfo), 0)) = type;
3872     }
3873 }
3874
3875 static tree
3876 create_anonymous_class (int location, tree type_name)
3877 {
3878   char buffer [80];
3879   tree super = NULL_TREE, itf = NULL_TREE;
3880   tree id, type_decl, class;
3881
3882   /* The unqualified name of the anonymous class. It's just a number. */
3883   sprintf (buffer, "%d", anonymous_class_counter++);
3884   id = build_wfl_node (get_identifier (buffer));
3885   EXPR_WFL_LINECOL (id) = location;
3886
3887   /* We know about the type to extend/implement. We go ahead */
3888   if ((type_decl = IDENTIFIER_CLASS_VALUE (EXPR_WFL_NODE (type_name))))
3889     {
3890       /* Create a class which either implements on extends the designated
3891          class. The class bears an innacessible name. */
3892       if (CLASS_INTERFACE (type_decl))
3893         {
3894           /* It's OK to modify it here. It's been already used and
3895              shouldn't be reused */
3896           ctxp->interface_number = 1;
3897           /* Interfaces should presented as a list of WFLs */
3898           itf = build_tree_list (type_name, NULL_TREE);
3899         }
3900       else
3901         super = type_name;
3902     }
3903
3904   class = create_class (ACC_FINAL, id, super, itf);
3905
3906   /* We didn't know anything about the stuff. We register a dependence. */
3907   if (!type_decl)
3908     register_incomplete_type (JDEP_ANONYMOUS, type_name, class, NULL_TREE);
3909
3910   ANONYMOUS_CLASS_P (TREE_TYPE (class)) = 1;
3911   return class;
3912 }
3913
3914 /* Create a class in pass1 and return its decl. Return class
3915    interface's decl in pass 2.  */
3916
3917 static tree
3918 create_class (int flags, tree id, tree super, tree interfaces)
3919 {
3920   tree raw_name = EXPR_WFL_NODE (id);
3921   tree class_id, decl;
3922   tree super_decl_type;
3923
3924   /* Certain syntax errors are making SUPER be like ID. Avoid this
3925      case. */
3926   if (ctxp->class_err && id == super)
3927     super = NULL;
3928
3929   class_id = parser_qualified_classname (raw_name);
3930   decl = IDENTIFIER_CLASS_VALUE (class_id);
3931   EXPR_WFL_NODE (id) = class_id;
3932
3933   /* Basic check: scope, redefinition, modifiers */
3934   if (check_class_interface_creation (0, flags, raw_name, class_id, decl, id))
3935     {
3936       PUSH_ERROR ();
3937       return NULL_TREE;
3938     }
3939
3940   /* Suspend the current parsing context if we're parsing an inner
3941      class or an anonymous class. */
3942   if (CPC_INNER_P ())
3943     {
3944       java_parser_context_suspend ();
3945       /* Interface members are public. */
3946       if (CLASS_INTERFACE (GET_CPC ()))
3947         flags |= ACC_PUBLIC;
3948     }
3949
3950   /* Push a new context for (static) initialized upon declaration fields */
3951   java_parser_context_push_initialized_field ();
3952
3953   /* Class modifier check:
3954        - Allowed modifier (already done at that point)
3955        - abstract AND final forbidden
3956        - Public classes defined in the correct file */
3957   if ((flags & ACC_ABSTRACT) && (flags & ACC_FINAL))
3958     parse_error_context
3959       (id, "Class `%s' can't be declared both abstract and final",
3960        IDENTIFIER_POINTER (raw_name));
3961
3962   /* Create a new decl if DECL is NULL, otherwise fix it */
3963   decl = maybe_create_class_interface_decl (decl, raw_name, class_id, id);
3964
3965   /* If SUPER exists, use it, otherwise use Object */
3966   if (super)
3967     {
3968       /* Can't extend java.lang.Object */
3969       if (TREE_TYPE (IDENTIFIER_CLASS_VALUE (class_id)) == object_type_node)
3970         {
3971           parse_error_context (id, "Can't extend `java.lang.Object'");
3972           return NULL_TREE;
3973         }
3974
3975       super_decl_type =
3976         register_incomplete_type (JDEP_SUPER, super, decl, NULL_TREE);
3977     }
3978   else if (TREE_TYPE (decl) != object_type_node)
3979     super_decl_type = object_type_node;
3980   /* We're defining java.lang.Object */
3981   else
3982     super_decl_type = NULL_TREE;
3983
3984   /* A class nested in an interface is implicitly static. */
3985   if (INNER_CLASS_DECL_P (decl)
3986       && CLASS_INTERFACE (TYPE_NAME (TREE_TYPE (DECL_CONTEXT (decl)))))
3987     {
3988       flags |= ACC_STATIC;
3989     }
3990
3991   /* Set super info and mark the class as complete. */
3992   set_super_info (flags, TREE_TYPE (decl), super_decl_type,
3993                   ctxp->interface_number);
3994   ctxp->interface_number = 0;
3995   CLASS_COMPLETE_P (decl) = 1;
3996   add_superinterfaces (decl, interfaces);
3997
3998   /* Add the private this$<n> field, Replicate final locals still in
3999      scope as private final fields mangled like val$<local_name>.
4000      This doesn't not occur for top level (static) inner classes. */
4001   if (PURE_INNER_CLASS_DECL_P (decl))
4002     add_inner_class_fields (decl, current_function_decl);
4003
4004   /* If doing xref, store the location at which the inherited class
4005      (if any) was seen. */
4006   if (flag_emit_xref && super)
4007     DECL_INHERITED_SOURCE_LINE (decl) = EXPR_WFL_LINECOL (super);
4008
4009   /* Eventually sets the @deprecated tag flag */
4010   CHECK_DEPRECATED (decl);
4011
4012   /* Reset the anonymous class counter when declaring non inner classes */
4013   if (!INNER_CLASS_DECL_P (decl))
4014     anonymous_class_counter = 1;
4015
4016   return decl;
4017 }
4018
4019 /* End a class declaration: register the statements used to create
4020    finit$ and <clinit>, pop the current class and resume the prior
4021    parser context if necessary.  */
4022
4023 static void
4024 end_class_declaration (int resume)
4025 {
4026   /* If an error occurred, context weren't pushed and won't need to be
4027      popped by a resume. */
4028   int no_error_occurred = ctxp->next && GET_CPC () != error_mark_node;
4029
4030   if (GET_CPC () != error_mark_node)
4031     dump_java_tree (TDI_class, GET_CPC ());
4032
4033   java_parser_context_pop_initialized_field ();
4034   POP_CPC ();
4035   if (resume && no_error_occurred)
4036     java_parser_context_resume ();
4037
4038   /* We're ending a class declaration, this is a good time to reset
4039      the interface cout. Note that might have been already done in
4040      create_interface, but if at that time an inner class was being
4041      dealt with, the interface count was reset in a context created
4042      for the sake of handling inner classes declaration. */
4043   ctxp->interface_number = 0;
4044 }
4045
4046 static void
4047 add_inner_class_fields (tree class_decl, tree fct_decl)
4048 {
4049   tree block, marker, f;
4050
4051   f = add_field (TREE_TYPE (class_decl),
4052                  build_current_thisn (TREE_TYPE (class_decl)),
4053                  build_pointer_type (TREE_TYPE (DECL_CONTEXT (class_decl))),
4054                  ACC_PRIVATE);
4055   FIELD_THISN (f) = 1;
4056
4057   if (!fct_decl)
4058     return;
4059
4060   for (block = GET_CURRENT_BLOCK (fct_decl);
4061        block && TREE_CODE (block) == BLOCK; block = BLOCK_SUPERCONTEXT (block))
4062     {
4063       tree decl;
4064       for (decl = BLOCK_EXPR_DECLS (block); decl; decl = TREE_CHAIN (decl))
4065         {
4066           tree name, pname;
4067           tree wfl, init, list;
4068
4069           /* Avoid non final arguments. */
4070           if (!LOCAL_FINAL_P (decl))
4071             continue;
4072
4073           MANGLE_OUTER_LOCAL_VARIABLE_NAME (name, DECL_NAME (decl));
4074           MANGLE_ALIAS_INITIALIZER_PARAMETER_NAME_ID (pname, DECL_NAME (decl));
4075           wfl = build_wfl_node (name);
4076           init = build_wfl_node (pname);
4077           /* Build an initialization for the field: it will be
4078              initialized by a parameter added to finit$, bearing a
4079              mangled name of the field itself (param$<n>.) The
4080              parameter is provided to finit$ by the constructor
4081              invoking it (hence the constructor will also feature a
4082              hidden parameter, set to the value of the outer context
4083              local at the time the inner class is created.)
4084
4085              Note: we take into account all possible locals that can
4086              be accessed by the inner class. It's actually not trivial
4087              to minimize these aliases down to the ones really
4088              used. One way to do that would be to expand all regular
4089              methods first, then finit$ to get a picture of what's
4090              used.  It works with the exception that we would have to
4091              go back on all constructor invoked in regular methods to
4092              have their invokation reworked (to include the right amount
4093              of alias initializer parameters.)
4094
4095              The only real way around, I think, is a first pass to
4096              identify locals really used in the inner class. We leave
4097              the flag FIELD_LOCAL_ALIAS_USED around for that future
4098              use.
4099
4100              On the other hand, it only affect local inner classes,
4101              whose constructors (and finit$ call) will be featuring
4102              unecessary arguments. It's easy for a developper to keep
4103              this number of parameter down by using the `final'
4104              keyword only when necessary. For the time being, we can
4105              issue a warning on unecessary finals. FIXME */
4106           init = build_assignment (ASSIGN_TK, EXPR_WFL_LINECOL (wfl),
4107                                    wfl, init);
4108
4109           /* Register the field. The TREE_LIST holding the part
4110              initialized/initializer will be marked ARG_FINAL_P so
4111              that the created field can be marked
4112              FIELD_LOCAL_ALIAS. */
4113           list = build_tree_list (wfl, init);
4114           ARG_FINAL_P (list) = 1;
4115           register_fields (ACC_PRIVATE | ACC_FINAL, TREE_TYPE (decl), list);
4116         }
4117     }
4118
4119   if (!CPC_INITIALIZER_STMT (ctxp))
4120     return;
4121
4122   /* If we ever registered an alias field, insert and marker to
4123      remeber where the list ends. The second part of the list (the one
4124      featuring initialized fields) so it can be later reversed to
4125      enforce 8.5. The marker will be removed during that operation. */
4126   marker = build_tree_list (NULL_TREE, NULL_TREE);
4127   TREE_CHAIN (marker) = CPC_INITIALIZER_STMT (ctxp);
4128   SET_CPC_INITIALIZER_STMT (ctxp, marker);
4129 }
4130
4131 /* Can't use lookup_field () since we don't want to load the class and
4132    can't set the CLASS_LOADED_P flag */
4133
4134 static tree
4135 find_field (tree class, tree name)
4136 {
4137   tree decl;
4138   for (decl = TYPE_FIELDS (class); decl; decl = TREE_CHAIN (decl))
4139     {
4140       if (DECL_NAME (decl) == name)
4141         return decl;
4142     }
4143   return NULL_TREE;
4144 }
4145
4146 /* Wrap around lookup_field that doesn't potentially upset the value
4147    of CLASS */
4148
4149 static tree
4150 lookup_field_wrapper (tree class, tree name)
4151 {
4152   tree type = class;
4153   tree decl = NULL_TREE;
4154   java_parser_context_save_global ();
4155
4156   /* Last chance: if we're within the context of an inner class, we
4157      might be trying to access a local variable defined in an outer
4158      context. We try to look for it now. */
4159   if (INNER_CLASS_TYPE_P (class) && TREE_CODE (name) == IDENTIFIER_NODE)
4160     {
4161       tree new_name;
4162       MANGLE_OUTER_LOCAL_VARIABLE_NAME (new_name, name);
4163       decl = lookup_field (&type, new_name);
4164       if (decl && decl != error_mark_node)
4165         FIELD_LOCAL_ALIAS_USED (decl) = 1;
4166     }
4167   if (!decl || decl == error_mark_node)
4168     {
4169       type = class;
4170       decl = lookup_field (&type, name);
4171     }
4172
4173   /* If the field still hasn't been found, try the next enclosing context. */
4174   if (!decl && INNER_CLASS_TYPE_P (class))
4175     {
4176       tree outer_type = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (class)));
4177       decl = lookup_field_wrapper (outer_type, name);
4178     }
4179
4180   java_parser_context_restore_global ();
4181   return decl == error_mark_node ? NULL : decl;
4182 }
4183
4184 /* Find duplicate field within the same class declarations and report
4185    the error. Returns 1 if a duplicated field was found, 0
4186    otherwise.  */
4187
4188 static int
4189 duplicate_declaration_error_p (tree new_field_name, tree new_type, tree cl)
4190 {
4191   /* This might be modified to work with method decl as well */
4192   tree decl = find_field (TREE_TYPE (GET_CPC ()), new_field_name);
4193   if (decl)
4194     {
4195       char *t1 = xstrdup (purify_type_name
4196                          ((TREE_CODE (new_type) == POINTER_TYPE
4197                            && TREE_TYPE (new_type) == NULL_TREE) ?
4198                           IDENTIFIER_POINTER (TYPE_NAME (new_type)) :
4199                           lang_printable_name (new_type, 1)));
4200       /* The type may not have been completed by the time we report
4201          the error */
4202       char *t2 = xstrdup (purify_type_name
4203                          ((TREE_CODE (TREE_TYPE (decl)) == POINTER_TYPE
4204                            && TREE_TYPE (TREE_TYPE (decl)) == NULL_TREE) ?
4205                           IDENTIFIER_POINTER (TYPE_NAME (TREE_TYPE (decl))) :
4206                           lang_printable_name (TREE_TYPE (decl), 1)));
4207       parse_error_context
4208         (cl , "Duplicate variable declaration: `%s %s' was `%s %s' (%s:%d)",
4209          t1, IDENTIFIER_POINTER (new_field_name),
4210          t2, IDENTIFIER_POINTER (DECL_NAME (decl)),
4211          DECL_SOURCE_FILE (decl), DECL_SOURCE_LINE (decl));
4212       free (t1);
4213       free (t2);
4214       return 1;
4215     }
4216   return 0;
4217 }
4218
4219 /* Field registration routine. If TYPE doesn't exist, field
4220    declarations are linked to the undefined TYPE dependency list, to
4221    be later resolved in java_complete_class () */
4222
4223 static void
4224 register_fields (int flags, tree type, tree variable_list)
4225 {
4226   tree current, saved_type;
4227   tree class_type = NULL_TREE;
4228   int saved_lineno = input_line;
4229   int must_chain = 0;
4230   tree wfl = NULL_TREE;
4231
4232   if (GET_CPC ())
4233     class_type = TREE_TYPE (GET_CPC ());
4234
4235   if (!class_type || class_type == error_mark_node)
4236     return;
4237
4238   /* If we're adding fields to interfaces, those fields are public,
4239      static, final */
4240   if (CLASS_INTERFACE (TYPE_NAME (class_type)))
4241     {
4242       OBSOLETE_MODIFIER_WARNING (MODIFIER_WFL (PUBLIC_TK),
4243                                  flags, ACC_PUBLIC, "interface field(s)");
4244       OBSOLETE_MODIFIER_WARNING (MODIFIER_WFL (STATIC_TK),
4245                                  flags, ACC_STATIC, "interface field(s)");
4246       OBSOLETE_MODIFIER_WARNING (MODIFIER_WFL (FINAL_TK),
4247                                  flags, ACC_FINAL, "interface field(s)");
4248       check_modifiers ("Illegal interface member modifier `%s'", flags,
4249                        INTERFACE_FIELD_MODIFIERS);
4250       flags |= (ACC_PUBLIC | ACC_STATIC | ACC_FINAL);
4251     }
4252
4253   /* Obtain a suitable type for resolution, if necessary */
4254   SET_TYPE_FOR_RESOLUTION (type, wfl, must_chain);
4255
4256   /* If TYPE is fully resolved and we don't have a reference, make one */
4257   PROMOTE_RECORD_IF_COMPLETE (type, must_chain);
4258
4259   for (current = variable_list, saved_type = type; current;
4260        current = TREE_CHAIN (current), type = saved_type)
4261     {
4262       tree real_type;
4263       tree field_decl;
4264       tree cl = TREE_PURPOSE (current);
4265       tree init = TREE_VALUE (current);
4266       tree current_name = EXPR_WFL_NODE (cl);
4267
4268       /* Can't declare non-final static fields in inner classes */
4269       if ((flags & ACC_STATIC) && !TOPLEVEL_CLASS_TYPE_P (class_type)
4270           && !(flags & ACC_FINAL))
4271         parse_error_context
4272           (cl, "Field `%s' can't be static in inner class `%s' unless it is final",
4273            IDENTIFIER_POINTER (EXPR_WFL_NODE (cl)),
4274            lang_printable_name (class_type, 0));
4275
4276       /* Process NAME, as it may specify extra dimension(s) for it */
4277       type = build_array_from_name (type, wfl, current_name, &current_name);
4278
4279       /* Type adjustment. We may have just readjusted TYPE because
4280          the variable specified more dimensions. Make sure we have
4281          a reference if we can and don't have one already. Also
4282          change the name if we have an init. */
4283       if (type != saved_type)
4284         {
4285           PROMOTE_RECORD_IF_COMPLETE (type, must_chain);
4286           if (init)
4287             EXPR_WFL_NODE (TREE_OPERAND (init, 0)) = current_name;
4288         }
4289
4290       real_type = GET_REAL_TYPE (type);
4291       /* Check for redeclarations */
4292       if (duplicate_declaration_error_p (current_name, real_type, cl))
4293         continue;
4294
4295       /* Set lineno to the line the field was found and create a
4296          declaration for it. Eventually sets the @deprecated tag flag. */
4297       if (flag_emit_xref)
4298         input_line = EXPR_WFL_LINECOL (cl);
4299       else
4300         input_line = EXPR_WFL_LINENO (cl);
4301       field_decl = add_field (class_type, current_name, real_type, flags);
4302       CHECK_DEPRECATED_NO_RESET (field_decl);
4303
4304       /* If the field denotes a final instance variable, then we
4305          allocate a LANG_DECL_SPECIFIC part to keep track of its
4306          initialization. We also mark whether the field was
4307          initialized upon its declaration. We don't do that if the
4308          created field is an alias to a final local. */
4309       if (!ARG_FINAL_P (current) && (flags & ACC_FINAL))
4310         {
4311           MAYBE_CREATE_VAR_LANG_DECL_SPECIFIC (field_decl);
4312           DECL_FIELD_FINAL_WFL (field_decl) = cl;
4313         }
4314
4315       /* If the couple initializer/initialized is marked ARG_FINAL_P,
4316          we mark the created field FIELD_LOCAL_ALIAS, so that we can
4317          hide parameters to this inner class finit$ and
4318          constructors. It also means that the field isn't final per
4319          say. */
4320       if (ARG_FINAL_P (current))
4321         {
4322           FIELD_LOCAL_ALIAS (field_decl) = 1;
4323           FIELD_FINAL (field_decl) = 0;
4324         }
4325
4326       /* Check if we must chain. */
4327       if (must_chain)
4328         register_incomplete_type (JDEP_FIELD, wfl, field_decl, type);
4329
4330       /* If we have an initialization value tied to the field */
4331       if (init)
4332         {
4333           /* The field is declared static */
4334           if (flags & ACC_STATIC)
4335             {
4336               /* We include the field and its initialization part into
4337                  a list used to generate <clinit>. After <clinit> is
4338                  walked, field initializations will be processed and
4339                  fields initialized with known constants will be taken
4340                  out of <clinit> and have their DECL_INITIAL set
4341                  appropriately. */
4342               TREE_CHAIN (init) = CPC_STATIC_INITIALIZER_STMT (ctxp);
4343               SET_CPC_STATIC_INITIALIZER_STMT (ctxp, init);
4344               if (TREE_OPERAND (init, 1)
4345                   && TREE_CODE (TREE_OPERAND (init, 1)) == NEW_ARRAY_INIT)
4346                 TREE_STATIC (TREE_OPERAND (init, 1)) = 1;
4347             }
4348           /* A non-static field declared with an immediate initialization is
4349              to be initialized in <init>, if any.  This field is remembered
4350              to be processed at the time of the generation of <init>. */
4351           else
4352             {
4353               TREE_CHAIN (init) = CPC_INITIALIZER_STMT (ctxp);
4354               SET_CPC_INITIALIZER_STMT (ctxp, init);
4355             }
4356           MODIFY_EXPR_FROM_INITIALIZATION_P (init) = 1;
4357           DECL_INITIAL (field_decl) = TREE_OPERAND (init, 1);
4358         }
4359     }
4360
4361   CLEAR_DEPRECATED;
4362   input_line = saved_lineno;
4363 }
4364
4365 /* Generate finit$, using the list of initialized fields to populate
4366    its body. finit$'s parameter(s) list is adjusted to include the
4367    one(s) used to initialized the field(s) caching outer context
4368    local(s).  */
4369
4370 static tree
4371 generate_finit (tree class_type)
4372 {
4373   int count = 0;
4374   tree list = TYPE_FINIT_STMT_LIST (class_type);
4375   tree mdecl, current, parms;
4376
4377   parms = build_alias_initializer_parameter_list (AIPL_FUNCTION_CREATION,
4378                                                   class_type, NULL_TREE,
4379                                                   &count);
4380   CRAFTED_PARAM_LIST_FIXUP (parms);
4381   mdecl = create_artificial_method (class_type, ACC_PRIVATE, void_type_node,
4382                                     finit_identifier_node, parms);
4383   fix_method_argument_names (parms, mdecl);
4384   layout_class_method (class_type, CLASSTYPE_SUPER (class_type),
4385                        mdecl, NULL_TREE);
4386   DECL_FUNCTION_NAP (mdecl) = count;
4387   start_artificial_method_body (mdecl);
4388
4389   for (current = list; current; current = TREE_CHAIN (current))
4390     java_method_add_stmt (mdecl,
4391                           build_debugable_stmt (EXPR_WFL_LINECOL (current),
4392                                                 current));
4393   end_artificial_method_body (mdecl);
4394   return mdecl;
4395 }
4396
4397 /* Generate a function to run the instance initialization code. The
4398    private method is called `instinit$'. Unless we're dealing with an
4399    anonymous class, we determine whether all ctors of CLASS_TYPE
4400    declare a checked exception in their `throws' clause in order to
4401    see whether it's necessary to encapsulate the instance initializer
4402    statements in a try/catch/rethrow sequence.  */
4403
4404 static tree
4405 generate_instinit (tree class_type)
4406 {
4407   tree current;
4408   tree compound = NULL_TREE;
4409   tree parms = tree_cons (this_identifier_node,
4410                           build_pointer_type (class_type), end_params_node);
4411   tree mdecl = create_artificial_method (class_type, ACC_PRIVATE,
4412                                          void_type_node,
4413                                          instinit_identifier_node, parms);
4414
4415   layout_class_method (class_type, CLASSTYPE_SUPER (class_type),
4416                        mdecl, NULL_TREE);
4417
4418   /* Gather all the statements in a compound */
4419   for (current = TYPE_II_STMT_LIST (class_type);
4420        current; current = TREE_CHAIN (current))
4421     compound = add_stmt_to_compound (compound, NULL_TREE, current);
4422
4423   /* We need to encapsulate COMPOUND by a try/catch statement to
4424      rethrow exceptions that might occur in the instance initializer.
4425      We do that only if all ctors of CLASS_TYPE are set to catch a
4426      checked exception. This doesn't apply to anonymous classes (since
4427      they don't have declared ctors.) */
4428   if (!ANONYMOUS_CLASS_P (class_type) &&
4429       ctors_unchecked_throws_clause_p (class_type))
4430     {
4431       compound = encapsulate_with_try_catch (0, exception_type_node, compound,
4432                                              build1 (THROW_EXPR, NULL_TREE,
4433                                                      build_wfl_node (wpv_id)));
4434       DECL_FUNCTION_THROWS (mdecl) = build_tree_list (NULL_TREE,
4435                                                       exception_type_node);
4436     }
4437
4438   start_artificial_method_body (mdecl);
4439   java_method_add_stmt (mdecl, compound);
4440   end_artificial_method_body (mdecl);
4441
4442   return mdecl;
4443 }
4444
4445 /* FIXME */
4446 static tree
4447 build_instinit_invocation (tree class_type)
4448 {
4449   tree to_return = NULL_TREE;
4450
4451   if (TYPE_II_STMT_LIST (class_type))
4452     {
4453       tree parm = build_tree_list (NULL_TREE,
4454                                    build_wfl_node (this_identifier_node));
4455       to_return =
4456         build_method_invocation (build_wfl_node (instinit_identifier_node),
4457                                  parm);
4458     }
4459   return to_return;
4460 }
4461
4462 /* Shared accros method_declarator and method_header to remember the
4463    patch stage that was reached during the declaration of the method.
4464    A method DECL is built differently is there is no patch
4465    (JDEP_NO_PATCH) or a patch (JDEP_METHOD or JDEP_METHOD_RETURN)
4466    pending on the currently defined method.  */
4467
4468 static int patch_stage;
4469
4470 /* Check the method declaration and add the method to its current
4471    class.  If the argument list is known to contain incomplete types,
4472    the method is partially added and the registration will be resume
4473    once the method arguments resolved. If TYPE is NULL, we're dealing
4474    with a constructor.  */
4475
4476 static tree
4477 method_header (int flags, tree type, tree mdecl, tree throws)
4478 {
4479   tree type_wfl = NULL_TREE;
4480   tree meth_name = NULL_TREE;
4481   tree current, orig_arg, this_class = NULL;
4482   tree id, meth;
4483   int saved_lineno;
4484   int constructor_ok = 0, must_chain;
4485   int count;
4486
4487   if (mdecl == error_mark_node)
4488     return error_mark_node;
4489   meth = TREE_VALUE (mdecl);
4490   id = TREE_PURPOSE (mdecl);
4491
4492   check_modifiers_consistency (flags);
4493
4494   if (GET_CPC ())
4495     this_class = TREE_TYPE (GET_CPC ());
4496
4497   if (!this_class || this_class == error_mark_node)
4498     return NULL_TREE;
4499
4500   /* There are some forbidden modifiers for an abstract method and its
4501      class must be abstract as well.  */
4502   if (type && (flags & ACC_ABSTRACT))
4503     {
4504       ABSTRACT_CHECK (flags, ACC_PRIVATE, id, "Private");
4505       ABSTRACT_CHECK (flags, ACC_STATIC, id, "Static");
4506       ABSTRACT_CHECK (flags, ACC_FINAL, id, "Final");
4507       ABSTRACT_CHECK (flags, ACC_NATIVE, id, "Native");
4508       ABSTRACT_CHECK (flags, ACC_SYNCHRONIZED, id, "Synchronized");
4509       ABSTRACT_CHECK (flags, ACC_STRICT, id, "Strictfp");
4510       if (!CLASS_ABSTRACT (TYPE_NAME (this_class))
4511           && !CLASS_INTERFACE (TYPE_NAME (this_class)))
4512         parse_error_context
4513           (id, "Class `%s' must be declared abstract to define abstract method `%s'",
4514            IDENTIFIER_POINTER (DECL_NAME (GET_CPC ())),
4515            IDENTIFIER_POINTER (EXPR_WFL_NODE (id)));
4516     }
4517
4518   /* A native method can't be strictfp.  */
4519   if ((flags & ACC_NATIVE) && (flags & ACC_STRICT))
4520     parse_error_context (id, "native method `%s' can't be strictfp",
4521                          IDENTIFIER_POINTER (EXPR_WFL_NODE (id)));
4522   /* No such thing as a transient or volatile method.  */
4523   if ((flags & ACC_TRANSIENT))
4524     parse_error_context (id, "method `%s' can't be transient",
4525                          IDENTIFIER_POINTER (EXPR_WFL_NODE (id)));
4526   if ((flags & ACC_VOLATILE))
4527     parse_error_context (id, "method `%s' can't be volatile",
4528                          IDENTIFIER_POINTER (EXPR_WFL_NODE (id)));
4529
4530   /* Things to be checked when declaring a constructor */
4531   if (!type)
4532     {
4533       int ec = java_error_count;
4534       /* 8.6: Constructor declarations: we might be trying to define a
4535          method without specifying a return type. */
4536       if (EXPR_WFL_NODE (id) != GET_CPC_UN ())
4537         parse_error_context
4538           (id, "Invalid method declaration, return type required");
4539       /* 8.6.3: Constructor modifiers */
4540       else
4541         {
4542           JCONSTRUCTOR_CHECK (flags, ACC_ABSTRACT, id, "abstract");
4543           JCONSTRUCTOR_CHECK (flags, ACC_STATIC, id, "static");
4544           JCONSTRUCTOR_CHECK (flags, ACC_FINAL, id, "final");
4545           JCONSTRUCTOR_CHECK (flags, ACC_NATIVE, id, "native");
4546           JCONSTRUCTOR_CHECK (flags, ACC_SYNCHRONIZED, id, "synchronized");
4547           JCONSTRUCTOR_CHECK (flags, ACC_STRICT, id, "strictfp");
4548         }
4549       /* If we found error here, we don't consider it's OK to tread
4550          the method definition as a constructor, for the rest of this
4551          function */
4552       if (ec == java_error_count)
4553         constructor_ok = 1;
4554     }
4555
4556   /* Method declared within the scope of an interface are implicitly
4557      abstract and public. Conflicts with other erroneously provided
4558      modifiers are checked right after. */
4559
4560   if (CLASS_INTERFACE (TYPE_NAME (this_class)))
4561     {
4562       /* If FLAGS isn't set because of a modifier, turn the
4563          corresponding modifier WFL to NULL so we issue a warning on
4564          the obsolete use of the modifier */
4565       if (!(flags & ACC_PUBLIC))
4566         MODIFIER_WFL (PUBLIC_TK) = NULL;
4567       if (!(flags & ACC_ABSTRACT))
4568         MODIFIER_WFL (ABSTRACT_TK) = NULL;
4569       flags |= ACC_PUBLIC;
4570       flags |= ACC_ABSTRACT;
4571     }
4572
4573   /* Inner class can't declare static methods */
4574   if ((flags & ACC_STATIC) && !TOPLEVEL_CLASS_TYPE_P (this_class))
4575     {
4576       parse_error_context
4577         (id, "Method `%s' can't be static in inner class `%s'. Only members of interfaces and top-level classes can be static",
4578          IDENTIFIER_POINTER (EXPR_WFL_NODE (id)),
4579          lang_printable_name (this_class, 0));
4580     }
4581
4582   /* Modifiers context reset moved up, so abstract method declaration
4583      modifiers can be later checked.  */
4584
4585   /* Set constructor returned type to void and method name to <init>,
4586      unless we found an error identifier the constructor (in which
4587      case we retain the original name) */
4588   if (!type)
4589     {
4590       type = void_type_node;
4591       if (constructor_ok)
4592         meth_name = init_identifier_node;
4593     }
4594   else
4595     meth_name = EXPR_WFL_NODE (id);
4596
4597   /* Do the returned type resolution and registration if necessary */
4598   SET_TYPE_FOR_RESOLUTION (type, type_wfl, must_chain);
4599
4600   if (meth_name)
4601     type = build_array_from_name (type, type_wfl, meth_name, &meth_name);
4602   EXPR_WFL_NODE (id) = meth_name;
4603   PROMOTE_RECORD_IF_COMPLETE (type, must_chain);
4604
4605   if (must_chain)
4606     {
4607       patch_stage = JDEP_METHOD_RETURN;
4608       register_incomplete_type (patch_stage, type_wfl, id, type);
4609       TREE_TYPE (meth) = GET_REAL_TYPE (type);
4610     }
4611   else
4612     TREE_TYPE (meth) = type;
4613
4614   saved_lineno = input_line;
4615   /* When defining an abstract or interface method, the curly
4616      bracket at level 1 doesn't exist because there is no function
4617      body */
4618   input_line = (ctxp->first_ccb_indent1 ? ctxp->first_ccb_indent1 :
4619             EXPR_WFL_LINENO (id));
4620
4621   /* Remember the original argument list */
4622   orig_arg = TYPE_ARG_TYPES (meth);
4623
4624   if (patch_stage)              /* includes ret type and/or all args */
4625     {
4626       jdep *jdep;
4627       meth = add_method_1 (this_class, flags, meth_name, meth);
4628       /* Patch for the return type */
4629       if (patch_stage == JDEP_METHOD_RETURN)
4630         {
4631           jdep = CLASSD_LAST (ctxp->classd_list);
4632           JDEP_GET_PATCH (jdep) = &TREE_TYPE (TREE_TYPE (meth));
4633         }
4634       /* This is the stop JDEP. METH allows the function's signature
4635          to be computed. */
4636       register_incomplete_type (JDEP_METHOD_END, NULL_TREE, meth, NULL_TREE);
4637     }
4638   else
4639     meth = add_method (this_class, flags, meth_name,
4640                        build_java_signature (meth));
4641
4642   /* Remember final parameters */
4643   MARK_FINAL_PARMS (meth, orig_arg);
4644
4645   /* Fix the method argument list so we have the argument name
4646      information */
4647   fix_method_argument_names (orig_arg, meth);
4648
4649   /* Register the parameter number and re-install the current line
4650      number */
4651   DECL_MAX_LOCALS (meth) = ctxp->formal_parameter_number+1;
4652   input_line = saved_lineno;
4653
4654   /* Register exception specified by the `throws' keyword for
4655      resolution and set the method decl appropriate field to the list.
4656      Note: the grammar ensures that what we get here are class
4657      types. */
4658   if (throws)
4659     {
4660       throws = nreverse (throws);
4661       for (current = throws; current; current = TREE_CHAIN (current))
4662         {
4663           register_incomplete_type (JDEP_EXCEPTION, TREE_VALUE (current),
4664                                     NULL_TREE, NULL_TREE);
4665           JDEP_GET_PATCH (CLASSD_LAST (ctxp->classd_list)) =
4666             &TREE_VALUE (current);
4667         }
4668       DECL_FUNCTION_THROWS (meth) = throws;
4669     }
4670
4671   if (TREE_TYPE (GET_CPC ()) != object_type_node)
4672     DECL_FUNCTION_WFL (meth) = id;
4673
4674   /* Set the flag if we correctly processed a constructor */
4675   if (constructor_ok)
4676     {
4677       DECL_CONSTRUCTOR_P (meth) = 1;
4678       /* Compute and store the number of artificial parameters declared
4679          for this constructor */
4680       for (count = 0, current = TYPE_FIELDS (this_class); current;
4681            current = TREE_CHAIN (current))
4682         if (FIELD_LOCAL_ALIAS (current))
4683           count++;
4684       DECL_FUNCTION_NAP (meth) = count;
4685     }
4686
4687   /* Eventually set the @deprecated tag flag */
4688   CHECK_DEPRECATED (meth);
4689
4690   /* If doing xref, store column and line number information instead
4691      of the line number only. */
4692   if (flag_emit_xref)
4693     DECL_SOURCE_LINE (meth) = EXPR_WFL_LINECOL (id);
4694
4695   return meth;
4696 }
4697
4698 static void
4699 fix_method_argument_names (tree orig_arg, tree meth)
4700 {
4701   tree arg = TYPE_ARG_TYPES (TREE_TYPE (meth));
4702   if (TREE_CODE (TREE_TYPE (meth)) == METHOD_TYPE)
4703     {
4704       TREE_PURPOSE (arg) = this_identifier_node;
4705       arg = TREE_CHAIN (arg);
4706     }
4707   while (orig_arg != end_params_node)
4708     {
4709       TREE_PURPOSE (arg) = TREE_PURPOSE (orig_arg);
4710       orig_arg = TREE_CHAIN (orig_arg);
4711       arg = TREE_CHAIN (arg);
4712     }
4713 }
4714
4715 /* Complete the method declaration with METHOD_BODY.  */
4716
4717 static void
4718 finish_method_declaration (tree method_body)
4719 {
4720   int flags;
4721
4722   if (!current_function_decl)
4723     return;
4724
4725   flags = get_access_flags_from_decl (current_function_decl);
4726
4727   /* 8.4.5 Method Body */
4728   if ((flags & ACC_ABSTRACT || flags & ACC_NATIVE) && method_body)
4729     {
4730       tree name = DECL_NAME (current_function_decl);
4731       parse_error_context (DECL_FUNCTION_WFL (current_function_decl),
4732                            "%s method `%s' can't have a body defined",
4733                            (METHOD_NATIVE (current_function_decl) ?
4734                             "Native" : "Abstract"),
4735                            IDENTIFIER_POINTER (name));
4736       method_body = NULL_TREE;
4737     }
4738   else if (!(flags & ACC_ABSTRACT) && !(flags & ACC_NATIVE) && !method_body)
4739     {
4740       tree name = DECL_NAME (current_function_decl);
4741       parse_error_context
4742         (DECL_FUNCTION_WFL (current_function_decl),
4743          "Non native and non abstract method `%s' must have a body defined",
4744          IDENTIFIER_POINTER (name));
4745       method_body = NULL_TREE;
4746     }
4747
4748   if (flag_emit_class_files && method_body
4749       && TREE_CODE (method_body) == NOP_EXPR
4750       && TREE_TYPE (current_function_decl)
4751       && TREE_TYPE (TREE_TYPE (current_function_decl)) == void_type_node)
4752     method_body = build1 (RETURN_EXPR, void_type_node, NULL);
4753
4754   BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (current_function_decl)) = method_body;
4755   maybe_absorb_scoping_blocks ();
4756   /* Exit function's body */
4757   exit_block ();
4758   /* Merge last line of the function with first line, directly in the
4759      function decl. It will be used to emit correct debug info. */
4760   if (!flag_emit_xref)
4761     DECL_SOURCE_LINE_MERGE (current_function_decl, ctxp->last_ccb_indent1);
4762
4763   /* Since function's argument's list are shared, reset the
4764      ARG_FINAL_P parameter that might have been set on some of this
4765      function parameters. */
4766   UNMARK_FINAL_PARMS (current_function_decl);
4767
4768   /* So we don't have an irrelevant function declaration context for
4769      the next static block we'll see. */
4770   current_function_decl = NULL_TREE;
4771 }
4772
4773 /* Build a an error message for constructor circularity errors.  */
4774
4775 static char *
4776 constructor_circularity_msg (tree from, tree to)
4777 {
4778   static char string [4096];
4779   char *t = xstrdup (lang_printable_name (from, 0));
4780   sprintf (string, "`%s' invokes `%s'", t, lang_printable_name (to, 0));
4781   free (t);
4782   return string;
4783 }
4784
4785 /* Verify a circular call to METH. Return 1 if an error is found, 0
4786    otherwise.  */
4787
4788 static GTY(()) tree vcc_list;
4789 static int
4790 verify_constructor_circularity (tree meth, tree current)
4791 {
4792   tree c;
4793
4794   for (c = DECL_CONSTRUCTOR_CALLS (current); c; c = TREE_CHAIN (c))
4795     {
4796       if (TREE_VALUE (c) == meth)
4797         {
4798           char *t;
4799           if (vcc_list)
4800             {
4801               tree liste;
4802               vcc_list = nreverse (vcc_list);
4803               for (liste = vcc_list; liste; liste = TREE_CHAIN (liste))
4804                 {
4805                   parse_error_context
4806                     (TREE_PURPOSE (TREE_PURPOSE (liste)), "%s",
4807                      constructor_circularity_msg
4808                       (TREE_VALUE (liste), TREE_VALUE (TREE_PURPOSE (liste))));
4809                   java_error_count--;
4810                 }
4811             }
4812           t = xstrdup (lang_printable_name (meth, 0));
4813           parse_error_context (TREE_PURPOSE (c),
4814                                "%s: recursive invocation of constructor `%s'",
4815                                constructor_circularity_msg (current, meth), t);
4816           free (t);
4817           vcc_list = NULL_TREE;
4818           return 1;
4819         }
4820     }
4821   for (c = DECL_CONSTRUCTOR_CALLS (current); c; c = TREE_CHAIN (c))
4822     {
4823       vcc_list = tree_cons (c, current, vcc_list);
4824       if (verify_constructor_circularity (meth, TREE_VALUE (c)))
4825         return 1;
4826       vcc_list = TREE_CHAIN (vcc_list);
4827     }
4828   return 0;
4829 }
4830
4831 /* Check modifiers that can be declared but exclusively */
4832
4833 static void
4834 check_modifiers_consistency (int flags)
4835 {
4836   int acc_count = 0;
4837   tree cl = NULL_TREE;
4838
4839   THIS_MODIFIER_ONLY (flags, ACC_PUBLIC, PUBLIC_TK, acc_count, cl);
4840   THIS_MODIFIER_ONLY (flags, ACC_PRIVATE, PRIVATE_TK, acc_count, cl);
4841   THIS_MODIFIER_ONLY (flags, ACC_PROTECTED, PROTECTED_TK, acc_count, cl);
4842   if (acc_count > 1)
4843     parse_error_context
4844       (cl, "Inconsistent member declaration.  At most one of `public', `private', or `protected' may be specified");
4845
4846   acc_count = 0;
4847   cl = NULL_TREE;
4848   THIS_MODIFIER_ONLY (flags, ACC_FINAL, FINAL_TK, acc_count, cl);
4849   THIS_MODIFIER_ONLY (flags, ACC_VOLATILE, VOLATILE_TK, acc_count, cl);
4850   if (acc_count > 1)
4851     parse_error_context (cl,
4852                          "Inconsistent member declaration.  At most one of `final' or `volatile' may be specified");
4853 }
4854
4855 /* Check the methode header METH for abstract specifics features */
4856
4857 static void
4858 check_abstract_method_header (tree meth)
4859 {
4860   int flags = get_access_flags_from_decl (meth);
4861
4862   OBSOLETE_MODIFIER_WARNING2 (MODIFIER_WFL (ABSTRACT_TK), flags,
4863                               ACC_ABSTRACT, "abstract method",
4864                               IDENTIFIER_POINTER (DECL_NAME (meth)));
4865   OBSOLETE_MODIFIER_WARNING2 (MODIFIER_WFL (PUBLIC_TK), flags,
4866                               ACC_PUBLIC, "abstract method",
4867                               IDENTIFIER_POINTER (DECL_NAME (meth)));
4868
4869   check_modifiers ("Illegal modifier `%s' for interface method",
4870                   flags, INTERFACE_METHOD_MODIFIERS);
4871 }
4872
4873 /* Create a FUNCTION_TYPE node and start augmenting it with the
4874    declared function arguments. Arguments type that can't be resolved
4875    are left as they are, but the returned node is marked as containing
4876    incomplete types.  */
4877
4878 static tree
4879 method_declarator (tree id, tree list)
4880 {
4881   tree arg_types = NULL_TREE, current, node;
4882   tree meth = make_node (FUNCTION_TYPE);
4883   jdep *jdep;
4884
4885   patch_stage = JDEP_NO_PATCH;
4886
4887   if (GET_CPC () == error_mark_node)
4888     return error_mark_node;
4889
4890   /* If we're dealing with an inner class constructor, we hide the
4891      this$<n> decl in the name field of its parameter declaration.  We
4892      also might have to hide the outer context local alias
4893      initializers. Not done when the class is a toplevel class. */
4894   if (PURE_INNER_CLASS_DECL_P (GET_CPC ())
4895       && EXPR_WFL_NODE (id) == GET_CPC_UN ())
4896     {
4897       tree aliases_list, type, thisn;
4898       /* First the aliases, linked to the regular parameters */
4899       aliases_list =
4900         build_alias_initializer_parameter_list (AIPL_FUNCTION_DECLARATION,
4901                                                 TREE_TYPE (GET_CPC ()),
4902                                                 NULL_TREE, NULL);
4903       list = chainon (nreverse (aliases_list), list);
4904
4905       /* Then this$<n> */
4906       type = TREE_TYPE (DECL_CONTEXT (GET_CPC ()));
4907       thisn = build_current_thisn (TREE_TYPE (GET_CPC ()));
4908       list = tree_cons (build_wfl_node (thisn), build_pointer_type (type),
4909                         list);
4910     }
4911
4912   for (current = list; current; current = TREE_CHAIN (current))
4913     {
4914       int must_chain = 0;
4915       tree wfl_name = TREE_PURPOSE (current);
4916       tree type = TREE_VALUE (current);
4917       tree name = EXPR_WFL_NODE (wfl_name);
4918       tree already, arg_node;
4919       tree type_wfl = NULL_TREE;
4920       tree real_type;
4921
4922       /* Obtain a suitable type for resolution, if necessary */
4923       SET_TYPE_FOR_RESOLUTION (type, type_wfl, must_chain);
4924
4925       /* Process NAME, as it may specify extra dimension(s) for it */
4926       type = build_array_from_name (type, type_wfl, name, &name);
4927       EXPR_WFL_NODE (wfl_name) = name;
4928
4929       real_type = GET_REAL_TYPE (type);
4930       if (TREE_CODE (real_type) == RECORD_TYPE)
4931         {
4932           real_type = promote_type (real_type);
4933           if (TREE_CODE (type) == TREE_LIST)
4934             TREE_PURPOSE (type) = real_type;
4935         }
4936
4937       /* Check redefinition */
4938       for (already = arg_types; already; already = TREE_CHAIN (already))
4939         if (TREE_PURPOSE (already) == name)
4940           {
4941             parse_error_context
4942               (wfl_name, "Variable `%s' is used more than once in the argument list of method `%s'",
4943                IDENTIFIER_POINTER (name),
4944                IDENTIFIER_POINTER (EXPR_WFL_NODE (id)));
4945             break;
4946           }
4947
4948       /* If we've an incomplete argument type, we know there is a location
4949          to patch when the type get resolved, later.  */
4950       jdep = NULL;
4951       if (must_chain)
4952         {
4953           patch_stage = JDEP_METHOD;
4954           type = register_incomplete_type (patch_stage,
4955                                            type_wfl, wfl_name, type);
4956           jdep = CLASSD_LAST (ctxp->classd_list);
4957           JDEP_MISC (jdep) = id;
4958         }
4959
4960       /* The argument node: a name and a (possibly) incomplete type.  */
4961       arg_node = build_tree_list (name, real_type);
4962       /* Remeber arguments declared final. */
4963       ARG_FINAL_P (arg_node) = ARG_FINAL_P (current);
4964
4965       if (jdep)
4966         JDEP_GET_PATCH (jdep) = &TREE_VALUE (arg_node);
4967       TREE_CHAIN (arg_node) = arg_types;
4968       arg_types = arg_node;
4969     }
4970   TYPE_ARG_TYPES (meth) = chainon (nreverse (arg_types), end_params_node);
4971   node = build_tree_list (id, meth);
4972   return node;
4973 }
4974
4975 static int
4976 unresolved_type_p (tree wfl, tree *returned)
4977
4978 {
4979   if (TREE_CODE (wfl) == EXPR_WITH_FILE_LOCATION)
4980     {
4981       if (returned)
4982         {
4983           tree decl = IDENTIFIER_CLASS_VALUE (EXPR_WFL_NODE (wfl));
4984           if (decl && current_class && (decl == TYPE_NAME (current_class)))
4985             *returned = TREE_TYPE (decl);
4986           else if (GET_CPC_UN () == EXPR_WFL_NODE (wfl))
4987             *returned = TREE_TYPE (GET_CPC ());
4988           else
4989             *returned = NULL_TREE;
4990         }
4991       return 1;
4992     }
4993   if (returned)
4994     *returned = wfl;
4995   return 0;
4996 }
4997
4998 /* From NAME, build a qualified identifier node using the
4999    qualification from the current package definition. */
5000
5001 static tree
5002 parser_qualified_classname (tree name)
5003 {
5004   tree nested_class_name;
5005
5006   if ((nested_class_name = maybe_make_nested_class_name (name)))
5007     return nested_class_name;
5008
5009   if (ctxp->package)
5010     return merge_qualified_name (ctxp->package, name);
5011   else
5012     return name;
5013 }
5014
5015 /* Called once the type a interface extends is resolved. Returns 0 if
5016    everything is OK.  */
5017
5018 static int
5019 parser_check_super_interface (tree super_decl, tree this_decl, tree this_wfl)
5020 {
5021   tree super_type = TREE_TYPE (super_decl);
5022
5023   /* Has to be an interface */
5024   if (!CLASS_INTERFACE (super_decl))
5025     {
5026       parse_error_context
5027         (this_wfl, "%s `%s' can't implement/extend %s `%s'",
5028          (CLASS_INTERFACE (TYPE_NAME (TREE_TYPE (this_decl))) ?
5029           "Interface" : "Class"),
5030          IDENTIFIER_POINTER (DECL_NAME (this_decl)),
5031          (TYPE_ARRAY_P (super_type) ? "array" : "class"),
5032          IDENTIFIER_POINTER (DECL_NAME (super_decl)));
5033       return 1;
5034     }
5035
5036   /* Check top-level interface access. Inner classes are subject to member
5037      access rules (6.6.1). */
5038   if (! INNER_CLASS_P (super_type)
5039       && check_pkg_class_access (DECL_NAME (super_decl),
5040                                  lookup_cl (this_decl), true))
5041     return 1;
5042
5043   SOURCE_FRONTEND_DEBUG (("Completing interface %s with %s",
5044                           IDENTIFIER_POINTER (DECL_NAME (this_decl)),
5045                           IDENTIFIER_POINTER (DECL_NAME (super_decl))));
5046   return 0;
5047 }
5048
5049 /* Makes sure that SUPER_DECL is suitable to extend THIS_DECL. Returns
5050    0 if everthing is OK.  */
5051
5052 static int
5053 parser_check_super (tree super_decl, tree this_decl, tree wfl)
5054 {
5055   tree super_type = TREE_TYPE (super_decl);
5056
5057   /* SUPER should be a CLASS (neither an array nor an interface) */
5058   if (TYPE_ARRAY_P (super_type) || CLASS_INTERFACE (TYPE_NAME (super_type)))
5059     {
5060       parse_error_context
5061         (wfl, "Class `%s' can't subclass %s `%s'",
5062          IDENTIFIER_POINTER (DECL_NAME (this_decl)),
5063          (CLASS_INTERFACE (TYPE_NAME (super_type)) ? "interface" : "array"),
5064          IDENTIFIER_POINTER (DECL_NAME (super_decl)));
5065       return 1;
5066     }
5067
5068   if (CLASS_FINAL (TYPE_NAME (super_type)))
5069     {
5070       parse_error_context (wfl, "Can't subclass final classes: %s",
5071                            IDENTIFIER_POINTER (DECL_NAME (super_decl)));
5072       return 1;
5073     }
5074
5075   /* Check top-level class scope. Inner classes are subject to member access
5076      rules (6.6.1). */
5077   if (! INNER_CLASS_P (super_type)
5078       && (check_pkg_class_access (DECL_NAME (super_decl), wfl, true)))
5079     return 1;
5080
5081   SOURCE_FRONTEND_DEBUG (("Completing class %s with %s",
5082                           IDENTIFIER_POINTER (DECL_NAME (this_decl)),
5083                           IDENTIFIER_POINTER (DECL_NAME (super_decl))));
5084   return 0;
5085 }
5086
5087 /* Create a new dependency list and link it (in a LIFO manner) to the
5088    CTXP list of type dependency list.  */
5089
5090 static void
5091 create_jdep_list (struct parser_ctxt *ctxp)
5092 {
5093   jdeplist *new = xmalloc (sizeof (jdeplist));
5094   new->first = new->last = NULL;
5095   new->next = ctxp->classd_list;
5096   ctxp->classd_list = new;
5097 }
5098
5099 static jdeplist *
5100 reverse_jdep_list (struct parser_ctxt *ctxp)
5101 {
5102   register jdeplist *prev = NULL, *current, *next;
5103   for (current = ctxp->classd_list; current; current = next)
5104     {
5105       next = current->next;
5106       current->next = prev;
5107       prev = current;
5108     }
5109   return prev;
5110 }
5111
5112 /* Create a fake pointer based on the ID stored in
5113    TYPE_NAME. TYPE_NAME can be a WFL or a incomplete type asking to be
5114    registered again. */
5115
5116 static tree
5117 obtain_incomplete_type (tree type_name)
5118 {
5119   tree ptr = NULL_TREE, name;
5120
5121   if (TREE_CODE (type_name) == EXPR_WITH_FILE_LOCATION)
5122     name = EXPR_WFL_NODE (type_name);
5123   else if (INCOMPLETE_TYPE_P (type_name))
5124     name = TYPE_NAME (type_name);
5125   else
5126     abort ();
5127
5128   /* Workaround from build_pointer_type for incomplete types.  */
5129   BUILD_PTR_FROM_NAME (ptr, name);
5130   TYPE_MODE (ptr) = ptr_mode;
5131   layout_type (ptr);
5132
5133   return ptr;
5134 }
5135
5136 /* Register a incomplete type whose name is WFL. Reuse PTR if PTR is
5137    non NULL instead of computing a new fake type based on WFL. The new
5138    dependency is inserted in the current type dependency list, in FIFO
5139    manner.  */
5140
5141 static tree
5142 register_incomplete_type (int kind, tree wfl, tree decl, tree ptr)
5143 {
5144   jdep *new = xmalloc (sizeof (jdep));
5145
5146   if (!ptr && kind != JDEP_METHOD_END) /* JDEP_METHOD_END is a mere marker */
5147     ptr = obtain_incomplete_type (wfl);
5148
5149   JDEP_KIND (new) = kind;
5150   JDEP_DECL (new) = decl;
5151   JDEP_TO_RESOLVE (new) = ptr;
5152   JDEP_WFL (new) = wfl;
5153   JDEP_CHAIN (new) = NULL;
5154   JDEP_MISC (new) = NULL_TREE;
5155   /* For some dependencies, set the enclosing class of the current
5156      class to be the enclosing context */
5157   if ((kind == JDEP_INTERFACE  || kind == JDEP_ANONYMOUS)
5158       && GET_ENCLOSING_CPC ())
5159     JDEP_ENCLOSING (new) = TREE_VALUE (GET_ENCLOSING_CPC ());
5160   else if (kind == JDEP_SUPER)
5161     JDEP_ENCLOSING (new) = (GET_ENCLOSING_CPC () ?
5162                             TREE_VALUE (GET_ENCLOSING_CPC ()) : NULL_TREE);
5163   else
5164     JDEP_ENCLOSING (new) = GET_CPC ();
5165   JDEP_GET_PATCH (new) = (tree *)NULL;
5166
5167   JDEP_INSERT (ctxp->classd_list, new);
5168
5169   return ptr;
5170 }
5171
5172 /* This checks for circular references with innerclasses. We start
5173    from SOURCE and should never reach TARGET. Extended/implemented
5174    types in SOURCE have their enclosing context checked not to reach
5175    TARGET. When the last enclosing context of SOURCE is reached, its
5176    extended/implemented types are also checked not to reach TARGET.
5177    In case of error, WFL of the offending type is returned; NULL_TREE
5178    otherwise.  */
5179
5180 static tree
5181 check_inner_circular_reference (tree source, tree target)
5182 {
5183   tree basetype_vec = TYPE_BINFO_BASETYPES (source);
5184   tree ctx, cl;
5185   int i;
5186
5187   if (!basetype_vec)
5188     return NULL_TREE;
5189
5190   for (i = 0; i < TREE_VEC_LENGTH (basetype_vec); i++)
5191     {
5192       tree su;
5193
5194       /* We can end up with a NULL_TREE or an incomplete type here if
5195          we encountered previous type resolution errors. It's safe to
5196          simply ignore these cases.  */
5197       if (TREE_VEC_ELT (basetype_vec, i) == NULL_TREE)
5198         continue;
5199       su = BINFO_TYPE (TREE_VEC_ELT (basetype_vec, i));
5200       if (INCOMPLETE_TYPE_P (su))
5201         continue;
5202
5203       if (inherits_from_p (su, target))
5204         return lookup_cl (TYPE_NAME (su));
5205
5206       for (ctx = DECL_CONTEXT (TYPE_NAME (su)); ctx; ctx = DECL_CONTEXT (ctx))
5207         {
5208           /* An enclosing context shouldn't be TARGET */
5209           if (ctx == TYPE_NAME (target))
5210             return lookup_cl (TYPE_NAME (su));
5211
5212           /* When we reach the enclosing last context, start a check
5213              on it, with the same target */
5214           if (! DECL_CONTEXT (ctx) &&
5215               (cl = check_inner_circular_reference (TREE_TYPE (ctx), target)))
5216             return cl;
5217         }
5218     }
5219   return NULL_TREE;
5220 }
5221
5222 /* Explore TYPE's `extends' clause member(s) and return the WFL of the
5223    offending type if a circularity is detected. NULL_TREE is returned
5224    otherwise. TYPE can be an interface or a class.   */
5225
5226 static tree
5227 check_circular_reference (tree type)
5228 {
5229   tree basetype_vec = TYPE_BINFO_BASETYPES (type);
5230   int i;
5231
5232   if (!basetype_vec)
5233     return NULL_TREE;
5234
5235   if (! CLASS_INTERFACE (TYPE_NAME (type)))
5236     {
5237       if (inherits_from_p (CLASSTYPE_SUPER (type), type))
5238         return lookup_cl (TYPE_NAME (type));
5239       return NULL_TREE;
5240     }
5241
5242   for (i = 0; i < TREE_VEC_LENGTH (basetype_vec); i++)
5243     {
5244       tree vec_elt = TREE_VEC_ELT (basetype_vec, i);
5245       if (vec_elt && BINFO_TYPE (vec_elt) != object_type_node
5246           && interface_of_p (type, BINFO_TYPE (vec_elt)))
5247         return lookup_cl (TYPE_NAME (BINFO_TYPE (vec_elt)));
5248     }
5249   return NULL_TREE;
5250 }
5251
5252 void
5253 java_check_circular_reference (void)
5254 {
5255   tree current;
5256   for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
5257     {
5258       tree type = TREE_TYPE (current);
5259       tree cl;
5260
5261       cl = check_circular_reference (type);
5262       if (! cl)
5263         cl = check_inner_circular_reference (type, type);
5264       if (cl)
5265         parse_error_context (cl, "Cyclic class inheritance%s",
5266                              (cyclic_inheritance_report ?
5267                               cyclic_inheritance_report : ""));
5268     }
5269 }
5270
5271 /* Augment the parameter list PARM with parameters crafted to
5272    initialize outer context locals aliases. Through ARTIFICIAL, a
5273    count is kept of the number of crafted parameters. MODE governs
5274    what eventually gets created: something suitable for a function
5275    creation or a function invocation, either the constructor or
5276    finit$.  */
5277
5278 static tree
5279 build_alias_initializer_parameter_list (int mode, tree class_type, tree parm,
5280                                         int *artificial)
5281 {
5282   tree field;
5283   tree additional_parms = NULL_TREE;
5284
5285   for (field = TYPE_FIELDS (class_type); field; field = TREE_CHAIN (field))
5286     if (FIELD_LOCAL_ALIAS (field))
5287       {
5288         const char *buffer = IDENTIFIER_POINTER (DECL_NAME (field));
5289         tree purpose = NULL_TREE, value = NULL_TREE, name = NULL_TREE;
5290         tree mangled_id;
5291
5292         switch (mode)
5293           {
5294           case AIPL_FUNCTION_DECLARATION:
5295             MANGLE_ALIAS_INITIALIZER_PARAMETER_NAME_STR (mangled_id,
5296                                                          &buffer [4]);
5297             purpose = build_wfl_node (mangled_id);
5298             if (TREE_CODE (TREE_TYPE (field)) == POINTER_TYPE)
5299               value = build_wfl_node (TYPE_NAME (TREE_TYPE (field)));
5300             else
5301               value = TREE_TYPE (field);
5302             break;
5303
5304           case AIPL_FUNCTION_CREATION:
5305             MANGLE_ALIAS_INITIALIZER_PARAMETER_NAME_STR (purpose,
5306                                                          &buffer [4]);
5307             value = TREE_TYPE (field);
5308             break;
5309
5310           case AIPL_FUNCTION_FINIT_INVOCATION:
5311             MANGLE_ALIAS_INITIALIZER_PARAMETER_NAME_STR (mangled_id,
5312                                                          &buffer [4]);
5313             /* Now, this is wrong. purpose should always be the NAME
5314                of something and value its matching value (decl, type,
5315                etc...) FIXME -- but there is a lot to fix. */
5316
5317             /* When invoked for this kind of operation, we already
5318                know whether a field is used or not. */
5319             purpose = TREE_TYPE (field);
5320             value = build_wfl_node (mangled_id);
5321             break;
5322
5323           case AIPL_FUNCTION_CTOR_INVOCATION:
5324             /* There are two case: the constructor invokation happends
5325                outside the local inner, in which case, locales from the outer
5326                context are directly used.
5327
5328                Otherwise, we fold to using the alias directly. */
5329             if (class_type == current_class)
5330               value = field;
5331             else
5332               {
5333                 name = get_identifier (&buffer[4]);
5334                 value = IDENTIFIER_LOCAL_VALUE (name);
5335               }
5336             break;
5337           }
5338         additional_parms = tree_cons (purpose, value, additional_parms);
5339         if (artificial)
5340           *artificial +=1;
5341       }
5342   if (additional_parms)
5343     {
5344       if (ANONYMOUS_CLASS_P (class_type)
5345           && mode == AIPL_FUNCTION_CTOR_INVOCATION)
5346         additional_parms = nreverse (additional_parms);
5347       parm = chainon (additional_parms, parm);
5348     }
5349
5350    return parm;
5351 }
5352
5353 /* Craft a constructor for CLASS_DECL -- what we should do when none
5354    where found. ARGS is non NULL when a special signature must be
5355    enforced. This is the case for anonymous classes.  */
5356
5357 static tree
5358 craft_constructor (tree class_decl, tree args)
5359 {
5360   tree class_type = TREE_TYPE (class_decl);
5361   tree parm = NULL_TREE;
5362   int flags = (get_access_flags_from_decl (class_decl) & ACC_PUBLIC ?
5363                ACC_PUBLIC : 0);
5364   int i = 0, artificial = 0;
5365   tree decl, ctor_name;
5366   char buffer [80];
5367
5368   /* The constructor name is <init> unless we're dealing with an
5369      anonymous class, in which case the name will be fixed after having
5370      be expanded. */
5371   if (ANONYMOUS_CLASS_P (class_type))
5372     ctor_name = DECL_NAME (class_decl);
5373   else
5374     ctor_name = init_identifier_node;
5375
5376   /* If we're dealing with an inner class constructor, we hide the
5377      this$<n> decl in the name field of its parameter declaration. */
5378   if (PURE_INNER_CLASS_TYPE_P (class_type))
5379     {
5380       tree type = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (class_type)));
5381       parm = tree_cons (build_current_thisn (class_type),
5382                         build_pointer_type (type), parm);
5383
5384       /* Some more arguments to be hidden here. The values of the local
5385          variables of the outer context that the inner class needs to see. */
5386       parm = build_alias_initializer_parameter_list (AIPL_FUNCTION_CREATION,
5387                                                      class_type, parm,
5388                                                      &artificial);
5389     }
5390
5391   /* Then if there are any args to be enforced, enforce them now */
5392   for (; args && args != end_params_node; args = TREE_CHAIN (args))
5393     {
5394       sprintf (buffer, "parm%d", i++);
5395       parm = tree_cons (get_identifier (buffer), TREE_VALUE (args), parm);
5396     }
5397
5398   CRAFTED_PARAM_LIST_FIXUP (parm);
5399   decl = create_artificial_method (class_type, flags, void_type_node,
5400                                    ctor_name, parm);
5401   fix_method_argument_names (parm, decl);
5402   /* Now, mark the artificial parameters. */
5403   DECL_FUNCTION_NAP (decl) = artificial;
5404   DECL_FUNCTION_SYNTHETIC_CTOR (decl) = DECL_CONSTRUCTOR_P (decl) = 1;
5405   return decl;
5406 }
5407
5408
5409 /* Fix the constructors. This will be called right after circular
5410    references have been checked. It is necessary to fix constructors
5411    early even if no code generation will take place for that class:
5412    some generated constructor might be required by the class whose
5413    compilation triggered this one to be simply loaded.  */
5414
5415 void
5416 java_fix_constructors (void)
5417 {
5418   tree current;
5419
5420   for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
5421     {
5422       tree class_type = TREE_TYPE (current);
5423       int saw_ctor = 0;
5424       tree decl;
5425
5426       if (CLASS_INTERFACE (TYPE_NAME (class_type)))
5427         continue;
5428
5429       current_class = class_type;
5430       for (decl = TYPE_METHODS (class_type); decl; decl = TREE_CHAIN (decl))
5431         {
5432           if (DECL_CONSTRUCTOR_P (decl))
5433             {
5434               fix_constructors (decl);
5435               saw_ctor = 1;
5436             }
5437         }
5438
5439       /* Anonymous class constructor can't be generated that early. */
5440       if (!saw_ctor && !ANONYMOUS_CLASS_P (class_type))
5441         craft_constructor (current, NULL_TREE);
5442     }
5443 }
5444
5445 /* safe_layout_class just makes sure that we can load a class without
5446    disrupting the current_class, input_file, lineno, etc, information
5447    about the class processed currently.  */
5448
5449 void
5450 safe_layout_class (tree class)
5451 {
5452   tree save_current_class = current_class;
5453   const char *save_input_filename = input_filename;
5454   int save_lineno = input_line;
5455
5456   layout_class (class);
5457
5458   current_class = save_current_class;
5459   input_filename = save_input_filename;
5460   input_line = save_lineno;
5461 }
5462
5463 static tree
5464 jdep_resolve_class (jdep *dep)
5465 {
5466   tree decl;
5467
5468   if (JDEP_RESOLVED_P (dep))
5469     decl = JDEP_RESOLVED_DECL (dep);
5470   else
5471     {
5472       decl = resolve_class (JDEP_ENCLOSING (dep), JDEP_TO_RESOLVE (dep),
5473                             JDEP_DECL (dep), JDEP_WFL (dep));
5474       JDEP_RESOLVED (dep, decl);
5475       /* If there is no WFL, that's ok.  We generate this warning
5476          elsewhere.  */
5477       if (decl && JDEP_WFL (dep) != NULL_TREE)
5478         check_deprecation (JDEP_WFL (dep), decl);
5479     }
5480
5481   if (!decl)
5482     complete_class_report_errors (dep);
5483   else if (PURE_INNER_CLASS_DECL_P (decl))
5484     {
5485       tree inner = TREE_TYPE (decl);
5486       if (! CLASS_LOADED_P (inner))
5487         {
5488           safe_layout_class (inner);
5489           if (TYPE_SIZE (inner) == error_mark_node)
5490             TYPE_SIZE (inner) = NULL_TREE;
5491         }
5492       check_inner_class_access (decl, JDEP_ENCLOSING (dep), JDEP_WFL (dep));
5493     }
5494   return decl;
5495 }
5496
5497 /* Complete unsatisfied class declaration and their dependencies */
5498
5499 void
5500 java_complete_class (void)
5501 {
5502   tree cclass;
5503   jdeplist *cclassd;
5504   int error_found;
5505   tree type;
5506
5507   /* Process imports */
5508   process_imports ();
5509
5510   /* Reverse things so we have the right order */
5511   ctxp->class_list = nreverse (ctxp->class_list);
5512   ctxp->classd_list = reverse_jdep_list (ctxp);
5513
5514   for (cclassd = ctxp->classd_list, cclass = ctxp->class_list;
5515        cclass && cclassd;
5516        cclass = TREE_CHAIN (cclass), cclassd = CLASSD_CHAIN (cclassd))
5517     {
5518       jdep *dep;
5519
5520       /* We keep the compilation unit imports in the class so that
5521          they can be used later to resolve type dependencies that
5522          aren't necessary to solve now. */
5523       TYPE_IMPORT_LIST (TREE_TYPE (cclass)) = ctxp->import_list;
5524       TYPE_IMPORT_DEMAND_LIST (TREE_TYPE (cclass)) = ctxp->import_demand_list;
5525
5526       for (dep = CLASSD_FIRST (cclassd); dep; dep = JDEP_CHAIN (dep))
5527         {
5528           tree decl;
5529           if (!(decl = jdep_resolve_class (dep)))
5530             continue;
5531
5532           /* Now it's time to patch */
5533           switch (JDEP_KIND (dep))
5534             {
5535             case JDEP_SUPER:
5536               /* Simply patch super */
5537               if (parser_check_super (decl, JDEP_DECL (dep), JDEP_WFL (dep)))
5538                 continue;
5539               BINFO_TYPE (TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO
5540                 (TREE_TYPE (JDEP_DECL (dep)))), 0)) = TREE_TYPE (decl);
5541               break;
5542
5543             case JDEP_FIELD:
5544               {
5545                 /* We do part of the job done in add_field */
5546                 tree field_decl = JDEP_DECL (dep);
5547                 tree field_type = TREE_TYPE (decl);
5548                 if (TREE_CODE (field_type) == RECORD_TYPE)
5549                   field_type = promote_type (field_type);
5550                 TREE_TYPE (field_decl) = field_type;
5551                 DECL_ALIGN (field_decl) = 0;
5552                 DECL_USER_ALIGN (field_decl) = 0;
5553                 layout_decl (field_decl, 0);
5554                 SOURCE_FRONTEND_DEBUG
5555                   (("Completed field/var decl `%s' with `%s'",
5556                     IDENTIFIER_POINTER (DECL_NAME (field_decl)),
5557                     IDENTIFIER_POINTER (DECL_NAME (decl))));
5558                 break;
5559               }
5560             case JDEP_METHOD:   /* We start patching a method */
5561             case JDEP_METHOD_RETURN:
5562               error_found = 0;
5563               while (1)
5564                 {
5565                   if (decl)
5566                     {
5567                       type = TREE_TYPE(decl);
5568                       if (TREE_CODE (type) == RECORD_TYPE)
5569                         type = promote_type (type);
5570                       JDEP_APPLY_PATCH (dep, type);
5571                       SOURCE_FRONTEND_DEBUG
5572                         (((JDEP_KIND (dep) == JDEP_METHOD_RETURN ?
5573                            "Completing fct `%s' with ret type `%s'":
5574                            "Completing arg `%s' with type `%s'"),
5575                           IDENTIFIER_POINTER (EXPR_WFL_NODE
5576                                               (JDEP_DECL_WFL (dep))),
5577                           IDENTIFIER_POINTER (DECL_NAME (decl))));
5578                     }
5579                   else
5580                     error_found = 1;
5581                   dep = JDEP_CHAIN (dep);
5582                   if (JDEP_KIND (dep) == JDEP_METHOD_END)
5583                     break;
5584                   else
5585                     decl = jdep_resolve_class (dep);
5586                 }
5587               if (!error_found)
5588                 {
5589                   tree mdecl = JDEP_DECL (dep), signature;
5590                   /* Recompute and reset the signature, check first that
5591                      all types are now defined. If they're not,
5592                      don't build the signature. */
5593                   if (check_method_types_complete (mdecl))
5594                     {
5595                       signature = build_java_signature (TREE_TYPE (mdecl));
5596                       set_java_signature (TREE_TYPE (mdecl), signature);
5597                     }
5598                 }
5599               else
5600                 continue;
5601               break;
5602
5603             case JDEP_INTERFACE:
5604               if (parser_check_super_interface (decl, JDEP_DECL (dep),
5605                                                 JDEP_WFL (dep)))
5606                 continue;
5607               parser_add_interface (JDEP_DECL (dep), decl, JDEP_WFL (dep));
5608               break;
5609
5610             case JDEP_PARM:
5611             case JDEP_VARIABLE:
5612               type = TREE_TYPE(decl);
5613               if (TREE_CODE (type) == RECORD_TYPE)
5614                 type = promote_type (type);
5615               JDEP_APPLY_PATCH (dep, type);
5616               break;
5617
5618             case JDEP_TYPE:
5619               JDEP_APPLY_PATCH (dep, TREE_TYPE (decl));
5620               SOURCE_FRONTEND_DEBUG
5621                 (("Completing a random type dependency on a '%s' node",
5622                   tree_code_name [TREE_CODE (JDEP_DECL (dep))]));
5623               break;
5624
5625             case JDEP_EXCEPTION:
5626               JDEP_APPLY_PATCH (dep, TREE_TYPE (decl));
5627               SOURCE_FRONTEND_DEBUG
5628                 (("Completing `%s' `throws' argument node",
5629                   IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_WFL (dep)))));
5630               break;
5631
5632             case JDEP_ANONYMOUS:
5633               patch_anonymous_class (decl, JDEP_DECL (dep), JDEP_WFL (dep));
5634               break;
5635
5636             default:
5637               abort ();
5638             }
5639         }
5640     }
5641   return;
5642 }
5643
5644 /* Resolve class CLASS_TYPE. Handle the case of trying to resolve an
5645    array.  */
5646
5647 static tree
5648 resolve_class (tree enclosing, tree class_type, tree decl, tree cl)
5649 {
5650   tree tname = TYPE_NAME (class_type);
5651   tree resolved_type = TREE_TYPE (class_type);
5652   int array_dims = 0;
5653   tree resolved_type_decl;
5654
5655   if (resolved_type != NULL_TREE)
5656     {
5657       tree resolved_type_decl = TYPE_NAME (resolved_type);
5658       if (resolved_type_decl == NULL_TREE
5659           || TREE_CODE (resolved_type_decl) == IDENTIFIER_NODE)
5660         {
5661           resolved_type_decl = build_decl (TYPE_DECL,
5662                                            TYPE_NAME (class_type),
5663                                            resolved_type);
5664         }
5665       return resolved_type_decl;
5666     }
5667
5668   /* 1- Check to see if we have an array. If true, find what we really
5669      want to resolve  */
5670   if ((array_dims = build_type_name_from_array_name (tname,
5671                                                      &TYPE_NAME (class_type))))
5672     WFL_STRIP_BRACKET (cl, cl);
5673
5674   /* 2- Resolve the bare type */
5675   if (!(resolved_type_decl = do_resolve_class (enclosing, class_type,
5676                                                decl, cl)))
5677     return NULL_TREE;
5678   resolved_type = TREE_TYPE (resolved_type_decl);
5679
5680   /* 3- If we have an array, reconstruct the array down to its nesting */
5681   if (array_dims)
5682     {
5683       for (; array_dims; array_dims--)
5684         resolved_type = build_java_array_type (resolved_type, -1);
5685       resolved_type_decl = TYPE_NAME (resolved_type);
5686     }
5687   TREE_TYPE (class_type) = resolved_type;
5688   return resolved_type_decl;
5689 }
5690
5691 /* Effectively perform the resolution of class CLASS_TYPE.  DECL or CL
5692    are used to report error messages; CL must either be NULL_TREE or a
5693    WFL wrapping a class.  Do not try to replace TYPE_NAME (class_type)
5694    by a variable, since it is changed by find_in_imports{_on_demand}
5695    and (but it doesn't really matter) qualify_and_find.  */
5696
5697 tree
5698 do_resolve_class (tree enclosing, tree class_type, tree decl, tree cl)
5699 {
5700   tree new_class_decl = NULL_TREE, super = NULL_TREE;
5701   tree saved_enclosing_type = enclosing ? TREE_TYPE (enclosing) : NULL_TREE;
5702   tree decl_result;
5703   htab_t circularity_hash;
5704
5705   if (QUALIFIED_P (TYPE_NAME (class_type)))
5706     {
5707       /* If the type name is of the form `Q . Id', then Q is either a
5708          package name or a class name.  First we try to find Q as a
5709          class and then treat Id as a member type.  If we can't find Q
5710          as a class then we fall through.  */
5711       tree q, left, left_type, right;
5712       breakdown_qualified (&left, &right, TYPE_NAME (class_type));
5713       BUILD_PTR_FROM_NAME (left_type, left);
5714       q = do_resolve_class (enclosing, left_type, decl, cl);
5715       if (q)
5716         {
5717           enclosing = q;
5718           saved_enclosing_type = TREE_TYPE (q);
5719           BUILD_PTR_FROM_NAME (class_type, right);
5720         }
5721     }
5722
5723   if (enclosing)
5724     {
5725       /* This hash table is used to register the classes we're going
5726          through when searching the current class as an inner class, in
5727          order to detect circular references. Remember to free it before
5728          returning the section 0- of this function. */
5729       circularity_hash = htab_create (20, htab_hash_pointer, htab_eq_pointer,
5730                                       NULL);
5731
5732       /* 0- Search in the current class as an inner class.
5733          Maybe some code here should be added to load the class or
5734          something, at least if the class isn't an inner class and ended
5735          being loaded from class file. FIXME. */
5736       while (enclosing)
5737         {
5738           new_class_decl = resolve_inner_class (circularity_hash, cl, &enclosing,
5739                                                 &super, class_type);
5740           if (new_class_decl)
5741             break;
5742
5743           /* If we haven't found anything because SUPER reached Object and
5744              ENCLOSING happens to be an innerclass, try the enclosing context. */
5745           if ((!super || super == object_type_node) &&
5746               enclosing && INNER_CLASS_DECL_P (enclosing))
5747             enclosing = DECL_CONTEXT (enclosing);
5748           else
5749             enclosing = NULL_TREE;
5750         }
5751
5752       htab_delete (circularity_hash);
5753
5754       if (new_class_decl)
5755         return new_class_decl;
5756     }
5757
5758   /* 1- Check for the type in single imports. This will change
5759      TYPE_NAME() if something relevant is found */
5760   find_in_imports (saved_enclosing_type, class_type);
5761
5762   /* 2- And check for the type in the current compilation unit */
5763   if ((new_class_decl = IDENTIFIER_CLASS_VALUE (TYPE_NAME (class_type))))
5764     {
5765       if (!CLASS_LOADED_P (TREE_TYPE (new_class_decl)) &&
5766           !CLASS_FROM_SOURCE_P (TREE_TYPE (new_class_decl)))
5767         load_class (TYPE_NAME (class_type), 0);
5768       return IDENTIFIER_CLASS_VALUE (TYPE_NAME (class_type));
5769     }
5770
5771   /* 3- Search according to the current package definition */
5772   if (!QUALIFIED_P (TYPE_NAME (class_type)))
5773     {
5774       if ((new_class_decl = qualify_and_find (class_type, ctxp->package,
5775                                              TYPE_NAME (class_type))))
5776         return new_class_decl;
5777     }
5778
5779   /* 4- Check the import on demands. Don't allow bar.baz to be
5780      imported from foo.* */
5781   if (!QUALIFIED_P (TYPE_NAME (class_type)))
5782     if (find_in_imports_on_demand (saved_enclosing_type, class_type))
5783       return NULL_TREE;
5784
5785   /* If found in find_in_imports_on_demand, the type has already been
5786      loaded. */
5787   if ((new_class_decl = IDENTIFIER_CLASS_VALUE (TYPE_NAME (class_type))))
5788     return new_class_decl;
5789
5790   /* 5- Try with a name qualified with the package name we've seen so far */
5791   if (!QUALIFIED_P (TYPE_NAME (class_type)))
5792     {
5793       tree package;
5794
5795       /* If there is a current package (ctxp->package), it's the first
5796          element of package_list and we can skip it. */
5797       for (package = (ctxp->package ?
5798                       TREE_CHAIN (package_list) : package_list);
5799            package; package = TREE_CHAIN (package))
5800         if ((new_class_decl = qualify_and_find (class_type,
5801                                                TREE_PURPOSE (package),
5802                                                TYPE_NAME (class_type))))
5803           return new_class_decl;
5804     }
5805
5806   /* 5- Check another compilation unit that bears the name of type */
5807   load_class (TYPE_NAME (class_type), 0);
5808
5809   if (!cl)
5810     cl = lookup_cl (decl);
5811
5812   /* If we don't have a value for CL, then we're being called recursively.
5813      We can't check package access just yet, but it will be taken care of
5814      by the caller. */
5815   if (cl)
5816     {
5817       if (check_pkg_class_access (TYPE_NAME (class_type), cl, true))
5818         return NULL_TREE;
5819     }
5820
5821   /* 6- Last call for a resolution */
5822   decl_result = IDENTIFIER_CLASS_VALUE (TYPE_NAME (class_type));
5823
5824   /* The final lookup might have registered a.b.c into a.b$c If we
5825      failed at the first lookup, progressively change the name if
5826      applicable and use the matching DECL instead. */
5827   if (!decl_result && QUALIFIED_P (TYPE_NAME (class_type)))
5828     {
5829       char *separator;
5830       tree name = TYPE_NAME (class_type);
5831       char *namebuffer = alloca (IDENTIFIER_LENGTH (name) + 1);
5832
5833       strcpy (namebuffer, IDENTIFIER_POINTER (name));
5834
5835       do {
5836
5837        /* Reach the last '.', and if applicable, replace it by a `$' and
5838           see if this exists as a type. */
5839        if ((separator = strrchr (namebuffer, '.')))
5840          {
5841            *separator = '$';
5842            name = get_identifier (namebuffer);
5843            decl_result = IDENTIFIER_CLASS_VALUE (name);
5844          }
5845       } while (!decl_result && separator);
5846     }
5847   return decl_result;
5848 }
5849
5850 static tree
5851 qualify_and_find (tree class_type, tree package, tree name)
5852 {
5853   tree new_qualified = merge_qualified_name (package, name);
5854   tree new_class_decl;
5855
5856   if (!IDENTIFIER_CLASS_VALUE (new_qualified))
5857     load_class (new_qualified, 0);
5858   if ((new_class_decl = IDENTIFIER_CLASS_VALUE (new_qualified)))
5859     {
5860       if (!CLASS_LOADED_P (TREE_TYPE (new_class_decl)) &&
5861           !CLASS_FROM_SOURCE_P (TREE_TYPE (new_class_decl)))
5862         load_class (new_qualified, 0);
5863       TYPE_NAME (class_type) = new_qualified;
5864       return IDENTIFIER_CLASS_VALUE (new_qualified);
5865     }
5866   return NULL_TREE;
5867 }
5868
5869 /* Resolve NAME and lay it out (if not done and if not the current
5870    parsed class). Return a decl node. This function is meant to be
5871    called when type resolution is necessary during the walk pass.  */
5872
5873 static tree
5874 resolve_and_layout (tree something, tree cl)
5875 {
5876   tree decl, decl_type;
5877
5878   /* Don't do that on the current class */
5879   if (something == current_class)
5880     return TYPE_NAME (current_class);
5881
5882   /* Don't do anything for void and other primitive types */
5883   if (JPRIMITIVE_TYPE_P (something) || something == void_type_node)
5884     return NULL_TREE;
5885
5886   /* Pointer types can be reall pointer types or fake pointers. When
5887      finding a real pointer, recheck for primitive types */
5888   if (TREE_CODE (something) == POINTER_TYPE)
5889     {
5890       if (TREE_TYPE (something))
5891         {
5892           something = TREE_TYPE (something);
5893           if (JPRIMITIVE_TYPE_P (something) || something == void_type_node)
5894             return NULL_TREE;
5895         }
5896       else
5897         something = TYPE_NAME (something);
5898     }
5899
5900   /* Don't do anything for arrays of primitive types */
5901   if (TREE_CODE (something) == RECORD_TYPE && TYPE_ARRAY_P (something)
5902       && JPRIMITIVE_TYPE_P (TYPE_ARRAY_ELEMENT (something)))
5903     return NULL_TREE;
5904
5905   /* Something might be a WFL */
5906   if (TREE_CODE (something) == EXPR_WITH_FILE_LOCATION)
5907     something = EXPR_WFL_NODE (something);
5908
5909   /* Otherwise, if something is not and IDENTIFIER_NODE, it can be a a
5910      TYPE_DECL or a real TYPE */
5911   else if (TREE_CODE (something) != IDENTIFIER_NODE)
5912     something = (TREE_CODE (TYPE_NAME (something)) == TYPE_DECL ?
5913             DECL_NAME (TYPE_NAME (something)) : TYPE_NAME (something));
5914
5915   if (!(decl = resolve_no_layout (something, cl)))
5916     return NULL_TREE;
5917
5918   /* Resolve and layout if necessary */
5919   decl_type = TREE_TYPE (decl);
5920   layout_class_methods (decl_type);
5921   /* Check methods */
5922   if (CLASS_FROM_SOURCE_P (decl_type))
5923     java_check_methods (decl);
5924   /* Layout the type if necessary */
5925   if (decl_type != current_class && !CLASS_LOADED_P (decl_type))
5926     safe_layout_class (decl_type);
5927
5928   return decl;
5929 }
5930
5931 /* Resolve a class, returns its decl but doesn't perform any
5932    layout. The current parsing context is saved and restored */
5933
5934 static tree
5935 resolve_no_layout (tree name, tree cl)
5936 {
5937   tree ptr, decl;
5938   BUILD_PTR_FROM_NAME (ptr, name);
5939   java_parser_context_save_global ();
5940   decl = resolve_class (TYPE_NAME (current_class), ptr, NULL_TREE, cl);
5941   java_parser_context_restore_global ();
5942
5943   return decl;
5944 }
5945
5946 /* Called when reporting errors. Skip the '[]'s in a complex array
5947    type description that failed to be resolved. purify_type_name can't
5948    use an identifier tree.  */
5949
5950 static const char *
5951 purify_type_name (const char *name)
5952 {
5953   int len = strlen (name);
5954   int bracket_found;
5955
5956   STRING_STRIP_BRACKETS (name, len, bracket_found);
5957   if (bracket_found)
5958     {
5959       char *stripped_name = xmemdup (name, len, len+1);
5960       stripped_name [len] = '\0';
5961       return stripped_name;
5962     }
5963   return name;
5964 }
5965
5966 /* The type CURRENT refers to can't be found. We print error messages.  */
5967
5968 static void
5969 complete_class_report_errors (jdep *dep)
5970 {
5971   const char *name;
5972
5973   if (!JDEP_WFL (dep))
5974     return;
5975
5976   name = IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_WFL (dep)));
5977   switch (JDEP_KIND (dep))
5978     {
5979     case JDEP_SUPER:
5980       parse_error_context
5981         (JDEP_WFL (dep), "Superclass `%s' of class `%s' not found",
5982          purify_type_name (name),
5983          IDENTIFIER_POINTER (DECL_NAME (JDEP_DECL (dep))));
5984       break;
5985     case JDEP_FIELD:
5986       parse_error_context
5987         (JDEP_WFL (dep), "Type `%s' not found in declaration of field `%s'",
5988          purify_type_name (name),
5989          IDENTIFIER_POINTER (DECL_NAME (JDEP_DECL (dep))));
5990       break;
5991     case JDEP_METHOD:           /* Covers arguments */
5992       parse_error_context
5993         (JDEP_WFL (dep), "Type `%s' not found in the declaration of the argument `%s' of method `%s'",
5994          purify_type_name (name),
5995          IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_DECL_WFL (dep))),
5996          IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_MISC (dep))));
5997       break;
5998     case JDEP_METHOD_RETURN:    /* Covers return type */
5999       parse_error_context
6000         (JDEP_WFL (dep), "Type `%s' not found in the declaration of the return type of method `%s'",
6001          purify_type_name (name),
6002          IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_DECL_WFL (dep))));
6003       break;
6004     case JDEP_INTERFACE:
6005       parse_error_context
6006         (JDEP_WFL (dep), "Superinterface `%s' of %s `%s' not found",
6007          IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_WFL (dep))),
6008          (CLASS_OR_INTERFACE (JDEP_DECL (dep), "class", "interface")),
6009          IDENTIFIER_POINTER (DECL_NAME (JDEP_DECL (dep))));
6010       break;
6011     case JDEP_VARIABLE:
6012       parse_error_context
6013         (JDEP_WFL (dep), "Type `%s' not found in the declaration of the local variable `%s'",
6014          purify_type_name (IDENTIFIER_POINTER
6015                            (EXPR_WFL_NODE (JDEP_WFL (dep)))),
6016          IDENTIFIER_POINTER (DECL_NAME (JDEP_DECL (dep))));
6017       break;
6018     case JDEP_EXCEPTION:        /* As specified by `throws' */
6019       parse_error_context
6020           (JDEP_WFL (dep), "Class `%s' not found in `throws'",
6021          IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_WFL (dep))));
6022       break;
6023     default:
6024       /* Fix for -Wall. Just break doing nothing. The error will be
6025          caught later */
6026       break;
6027     }
6028 }
6029
6030 /* Return a static string containing the DECL prototype string. If
6031    DECL is a constructor, use the class name instead of the form
6032    <init> */
6033
6034 static const char *
6035 get_printable_method_name (tree decl)
6036 {
6037   const char *to_return;
6038   tree name = NULL_TREE;
6039
6040   if (DECL_CONSTRUCTOR_P (decl))
6041     {
6042       name = DECL_NAME (decl);
6043       DECL_NAME (decl) = DECL_NAME (TYPE_NAME (DECL_CONTEXT (decl)));
6044     }
6045
6046   to_return = lang_printable_name (decl, 0);
6047   if (DECL_CONSTRUCTOR_P (decl))
6048     DECL_NAME (decl) = name;
6049
6050   return to_return;
6051 }
6052
6053 /* Track method being redefined inside the same class. As a side
6054    effect, set DECL_NAME to an IDENTIFIER (prior entering this
6055    function it's a FWL, so we can track errors more accurately.)  */
6056
6057 static int
6058 check_method_redefinition (tree class, tree method)
6059 {
6060   tree redef, sig;
6061
6062   /* There's no need to verify <clinit> and finit$ and instinit$ */
6063   if (DECL_CLINIT_P (method)
6064       || DECL_FINIT_P (method) || DECL_INSTINIT_P (method))
6065     return 0;
6066
6067   sig = TYPE_ARGUMENT_SIGNATURE (TREE_TYPE (method));
6068   for (redef = TYPE_METHODS (class); redef; redef = TREE_CHAIN (redef))
6069     {
6070       if (redef == method)
6071         break;
6072       if (DECL_NAME (redef) == DECL_NAME (method)
6073           && sig == TYPE_ARGUMENT_SIGNATURE (TREE_TYPE (redef))
6074           && !DECL_ARTIFICIAL (method))
6075         {
6076           parse_error_context
6077             (DECL_FUNCTION_WFL (method), "Duplicate %s declaration `%s'",
6078              (DECL_CONSTRUCTOR_P (redef) ? "constructor" : "method"),
6079              get_printable_method_name (redef));
6080           return 1;
6081         }
6082     }
6083   return 0;
6084 }
6085
6086 /* Return 1 if check went ok, 0 otherwise.  */
6087 static int
6088 check_abstract_method_definitions (int do_interface, tree class_decl,
6089                                    tree type)
6090 {
6091   tree class = TREE_TYPE (class_decl);
6092   tree method, end_type;
6093   int ok = 1;
6094
6095   end_type = (do_interface ? object_type_node : type);
6096   for (method = TYPE_METHODS (type); method; method = TREE_CHAIN (method))
6097     {
6098       tree other_super, other_method, method_sig, method_name;
6099       int found = 0;
6100       int end_type_reached = 0;
6101
6102       if (!METHOD_ABSTRACT (method) || METHOD_FINAL (method))
6103         continue;
6104
6105       /* Now verify that somewhere in between TYPE and CLASS,
6106          abstract method METHOD gets a non abstract definition
6107          that is inherited by CLASS.  */
6108
6109       method_sig = build_java_signature (TREE_TYPE (method));
6110       method_name = DECL_NAME (method);
6111       if (TREE_CODE (method_name) == EXPR_WITH_FILE_LOCATION)
6112         method_name = EXPR_WFL_NODE (method_name);
6113
6114       other_super = class;
6115       do {
6116         if (other_super == end_type)
6117           end_type_reached = 1;
6118
6119         /* Method search */
6120         for (other_method = TYPE_METHODS (other_super); other_method;
6121             other_method = TREE_CHAIN (other_method))
6122           {
6123             tree s = build_java_signature (TREE_TYPE (other_method));
6124             tree other_name = DECL_NAME (other_method);
6125
6126             if (TREE_CODE (other_name) == EXPR_WITH_FILE_LOCATION)
6127               other_name = EXPR_WFL_NODE (other_name);
6128             if (!DECL_CLINIT_P (other_method)
6129                 && !DECL_CONSTRUCTOR_P (other_method)
6130                 && method_name == other_name
6131                 && method_sig == s
6132                 && !METHOD_ABSTRACT (other_method))
6133              {
6134                found = 1;
6135                break;
6136              }
6137           }
6138         other_super = CLASSTYPE_SUPER (other_super);
6139       } while (!end_type_reached);
6140
6141       /* Report that abstract METHOD didn't find an implementation
6142          that CLASS can use. */
6143       if (!found)
6144         {
6145           char *t = xstrdup (lang_printable_name
6146                             (TREE_TYPE (TREE_TYPE (method)), 0));
6147           tree ccn = DECL_NAME (TYPE_NAME (DECL_CONTEXT (method)));
6148
6149           parse_error_context
6150             (lookup_cl (class_decl),
6151              "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",
6152              IDENTIFIER_POINTER (DECL_NAME (class_decl)),
6153              t, lang_printable_name (method, 0),
6154              (CLASS_INTERFACE (TYPE_NAME (DECL_CONTEXT (method))) ?
6155               "interface" : "class"),
6156              IDENTIFIER_POINTER (ccn),
6157              (CLASS_INTERFACE (class_decl) ? "interface" : "class"),
6158              IDENTIFIER_POINTER (DECL_NAME (class_decl)));
6159           ok = 0;
6160           free (t);
6161         }
6162     }
6163
6164   if (ok && do_interface)
6165     {
6166       /* Check for implemented interfaces. */
6167       int i;
6168       tree vector = TYPE_BINFO_BASETYPES (type);
6169       for (i = 1; ok && vector && i < TREE_VEC_LENGTH (vector); i++)
6170         {
6171           tree super = BINFO_TYPE (TREE_VEC_ELT (vector, i));
6172           ok = check_abstract_method_definitions (1, class_decl, super);
6173         }
6174     }
6175
6176   return ok;
6177 }
6178
6179 /* Check that CLASS_DECL somehow implements all inherited abstract
6180    methods.  */
6181
6182 static void
6183 java_check_abstract_method_definitions (tree class_decl)
6184 {
6185   tree class = TREE_TYPE (class_decl);
6186   tree super, vector;
6187   int i;
6188
6189   if (CLASS_ABSTRACT (class_decl))
6190     return;
6191
6192   /* Check for inherited types */
6193   super = class;
6194   do {
6195     super = CLASSTYPE_SUPER (super);
6196     check_abstract_method_definitions (0, class_decl, super);
6197   } while (super != object_type_node);
6198
6199   /* Check for implemented interfaces. */
6200   vector = TYPE_BINFO_BASETYPES (class);
6201   for (i = 1; i < TREE_VEC_LENGTH (vector); i++)
6202     {
6203       super = BINFO_TYPE (TREE_VEC_ELT (vector, i));
6204       check_abstract_method_definitions (1, class_decl, super);
6205     }
6206 }
6207
6208 /* Check all the types method DECL uses and return 1 if all of them
6209    are now complete, 0 otherwise. This is used to check whether its
6210    safe to build a method signature or not.  */
6211
6212 static int
6213 check_method_types_complete (tree decl)
6214 {
6215   tree type = TREE_TYPE (decl);
6216   tree args;
6217
6218   if (!INCOMPLETE_TYPE_P (TREE_TYPE (type)))
6219     return 0;
6220
6221   args = TYPE_ARG_TYPES (type);
6222   if (TREE_CODE (type) == METHOD_TYPE)
6223     args = TREE_CHAIN (args);
6224   for (; args != end_params_node; args = TREE_CHAIN (args))
6225     if (INCOMPLETE_TYPE_P (TREE_VALUE (args)))
6226       return 0;
6227
6228   return 1;
6229 }
6230
6231 /* Visible interface to check methods contained in CLASS_DECL */
6232
6233 void
6234 java_check_methods (tree class_decl)
6235 {
6236   if (CLASS_METHOD_CHECKED_P (TREE_TYPE (class_decl)))
6237     return;
6238
6239   if (CLASS_INTERFACE (class_decl))
6240     java_check_abstract_methods (class_decl);
6241   else
6242     java_check_regular_methods (class_decl);
6243
6244   CLASS_METHOD_CHECKED_P (TREE_TYPE (class_decl)) = 1;
6245 }
6246
6247 /* Check all the methods of CLASS_DECL. Methods are first completed
6248    then checked according to regular method existence rules.  If no
6249    constructor for CLASS_DECL were encountered, then build its
6250    declaration.  */
6251
6252 static void
6253 java_check_regular_methods (tree class_decl)
6254 {
6255   int saw_constructor = ANONYMOUS_CLASS_P (TREE_TYPE (class_decl));
6256   tree method;
6257   tree class = TREE_TYPE (class_decl);
6258   tree found = NULL_TREE;
6259   tree mthrows;
6260
6261   /* It is not necessary to check methods defined in java.lang.Object */
6262   if (class == object_type_node)
6263     return;
6264
6265   if (!TYPE_NVIRTUALS (class))
6266     TYPE_METHODS (class) = nreverse (TYPE_METHODS (class));
6267
6268   /* Should take interfaces into account. FIXME */
6269   for (method = TYPE_METHODS (class); method; method = TREE_CHAIN (method))
6270     {
6271       tree sig;
6272       tree method_wfl = DECL_FUNCTION_WFL (method);
6273       int aflags;
6274
6275       /* Check for redefinitions */
6276       if (check_method_redefinition (class, method))
6277         continue;
6278
6279       /* We verify things thrown by the method.  They must inherit from
6280          java.lang.Throwable.  */
6281       for (mthrows = DECL_FUNCTION_THROWS (method);
6282            mthrows; mthrows = TREE_CHAIN (mthrows))
6283         {
6284           if (!inherits_from_p (TREE_VALUE (mthrows), throwable_type_node))
6285             parse_error_context
6286               (TREE_PURPOSE (mthrows), "Class `%s' in `throws' clause must be a subclass of class `java.lang.Throwable'",
6287                IDENTIFIER_POINTER
6288                  (DECL_NAME (TYPE_NAME (TREE_VALUE (mthrows)))));
6289         }
6290
6291       /* If we see one constructor a mark so we don't generate the
6292          default one.  Also skip other verifications: constructors
6293          can't be inherited hence hidden or overridden.  */
6294       if (DECL_CONSTRUCTOR_P (method))
6295         {
6296           saw_constructor = 1;
6297           continue;
6298         }
6299
6300       sig = build_java_argument_signature (TREE_TYPE (method));
6301       found = lookup_argument_method2 (class, DECL_NAME (method), sig);
6302
6303       /* Inner class can't declare static methods */
6304       if (METHOD_STATIC (method) && !TOPLEVEL_CLASS_DECL_P (class_decl))
6305         {
6306           char *t = xstrdup (lang_printable_name (class, 0));
6307           parse_error_context
6308             (method_wfl, "Method `%s' can't be static in inner class `%s'. Only members of interfaces and top-level classes can be static",
6309              lang_printable_name (method, 0), t);
6310           free (t);
6311         }
6312
6313       /* Nothing overrides or it's a private method. */
6314       if (!found)
6315         continue;
6316       if (METHOD_PRIVATE (found))
6317         {
6318           found = NULL_TREE;
6319           continue;
6320         }
6321
6322       /* If `found' is declared in an interface, make sure the
6323          modifier matches. */
6324       if (CLASS_INTERFACE (TYPE_NAME (DECL_CONTEXT (found)))
6325           && clinit_identifier_node != DECL_NAME (found)
6326           && !METHOD_PUBLIC (method))
6327         {
6328           tree found_decl = TYPE_NAME (DECL_CONTEXT (found));
6329           parse_error_context (method_wfl, "Class `%s' must override `%s' with a public method in order to implement interface `%s'",
6330                                IDENTIFIER_POINTER (DECL_NAME (class_decl)),
6331                                lang_printable_name (method, 0),
6332                                IDENTIFIER_POINTER (DECL_NAME (found_decl)));
6333         }
6334
6335       /* Can't override a method with the same name and different return
6336          types. */
6337       if (TREE_TYPE (TREE_TYPE (found)) != TREE_TYPE (TREE_TYPE (method)))
6338         {
6339           char *t = xstrdup
6340             (lang_printable_name (TREE_TYPE (TREE_TYPE (found)), 0));
6341           parse_error_context
6342             (method_wfl,
6343              "Method `%s' was defined with return type `%s' in class `%s'",
6344              lang_printable_name (found, 0), t,
6345              IDENTIFIER_POINTER
6346                (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found)))));
6347           free (t);
6348         }
6349
6350       aflags = get_access_flags_from_decl (found);
6351
6352       /* Can't override final. Can't override static. */
6353       if (METHOD_FINAL (found) || METHOD_STATIC (found))
6354         {
6355           /* Static *can* override static */
6356           if (METHOD_STATIC (found) && METHOD_STATIC (method))
6357             continue;
6358           parse_error_context
6359             (method_wfl,
6360              "%s methods can't be overriden. Method `%s' is %s in class `%s'",
6361              (METHOD_FINAL (found) ? "Final" : "Static"),
6362              lang_printable_name (found, 0),
6363              (METHOD_FINAL (found) ? "final" : "static"),
6364              IDENTIFIER_POINTER
6365                (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found)))));
6366           continue;
6367         }
6368
6369       /* Static method can't override instance method. */
6370       if (METHOD_STATIC (method))
6371         {
6372           parse_error_context
6373             (method_wfl,
6374              "Instance methods can't be overriden by a static method. Method `%s' is an instance method in class `%s'",
6375              lang_printable_name (found, 0),
6376              IDENTIFIER_POINTER
6377                (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found)))));
6378           continue;
6379         }
6380
6381       /* - Overriding/hiding public must be public
6382          - Overriding/hiding protected must be protected or public
6383          - If the overriden or hidden method has default (package)
6384            access, then the overriding or hiding method must not be
6385            private; otherwise, a compile-time error occurs.  If
6386            `found' belongs to an interface, things have been already
6387            taken care of.  */
6388       if (!CLASS_INTERFACE (TYPE_NAME (DECL_CONTEXT (found)))
6389           && ((METHOD_PUBLIC (found) && !METHOD_PUBLIC (method))
6390               || (METHOD_PROTECTED (found)
6391                   && !(METHOD_PUBLIC (method) || METHOD_PROTECTED (method)))
6392               || (!(aflags & (ACC_PUBLIC | ACC_PRIVATE | ACC_STATIC))
6393                   && METHOD_PRIVATE (method))))
6394         {
6395           parse_error_context
6396             (method_wfl,
6397              "Methods can't be overridden to be more private. Method `%s' is not %s in class `%s'", lang_printable_name (method, 0),
6398              (METHOD_PUBLIC (method) ? "public" :
6399               (METHOD_PRIVATE (method) ? "private" : "protected")),
6400              IDENTIFIER_POINTER (DECL_NAME
6401                                  (TYPE_NAME (DECL_CONTEXT (found)))));
6402           continue;
6403         }
6404
6405       /* Overriding methods must have compatible `throws' clauses on checked
6406          exceptions, if any */
6407       check_throws_clauses (method, method_wfl, found);
6408
6409       /* Inheriting multiple methods with the same signature. FIXME */
6410     }
6411
6412   if (!TYPE_NVIRTUALS (class))
6413     TYPE_METHODS (class) = nreverse (TYPE_METHODS (class));
6414
6415   /* Search for inherited abstract method not yet implemented in this
6416      class.  */
6417   java_check_abstract_method_definitions (class_decl);
6418
6419   if (!saw_constructor)
6420     abort ();
6421 }
6422
6423 /* Return a nonzero value if the `throws' clause of METHOD (if any)
6424    is incompatible with the `throws' clause of FOUND (if any).  */
6425
6426 static void
6427 check_throws_clauses (tree method, tree method_wfl, tree found)
6428 {
6429   tree mthrows, fthrows;
6430
6431   /* Can't check these things with class loaded from bytecode. FIXME */
6432   if (!CLASS_FROM_SOURCE_P (DECL_CONTEXT (found)))
6433     return;
6434
6435   for (mthrows = DECL_FUNCTION_THROWS (method);
6436        mthrows; mthrows = TREE_CHAIN (mthrows))
6437     {
6438       /* We don't verify unchecked expressions */
6439       if (IS_UNCHECKED_EXCEPTION_P (TREE_VALUE (mthrows)))
6440         continue;
6441       /* Checked expression must be compatible */
6442       for (fthrows = DECL_FUNCTION_THROWS (found);
6443            fthrows; fthrows = TREE_CHAIN (fthrows))
6444         if (inherits_from_p (TREE_VALUE (mthrows), TREE_VALUE (fthrows)))
6445           break;
6446       if (!fthrows)
6447         {
6448           parse_error_context
6449             (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'",
6450              IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (TREE_VALUE (mthrows)))),
6451              lang_printable_name (found, 0),
6452              IDENTIFIER_POINTER
6453                (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found)))));
6454         }
6455     }
6456 }
6457
6458 /* Check abstract method of interface INTERFACE */
6459
6460 static void
6461 java_check_abstract_methods (tree interface_decl)
6462 {
6463   int i, n;
6464   tree method, basetype_vec, found;
6465   tree interface = TREE_TYPE (interface_decl);
6466
6467   for (method = TYPE_METHODS (interface); method; method = TREE_CHAIN (method))
6468     {
6469       /* 2- Check for double definition inside the defining interface */
6470       if (check_method_redefinition (interface, method))
6471         continue;
6472
6473       /* 3- Overriding is OK as far as we preserve the return type and
6474          the thrown exceptions (FIXME) */
6475       found = lookup_java_interface_method2 (interface, method);
6476       if (found)
6477         {
6478           char *t;
6479           t = xstrdup (lang_printable_name (TREE_TYPE (TREE_TYPE (found)), 0));
6480           parse_error_context
6481             (DECL_FUNCTION_WFL (found),
6482              "Method `%s' was defined with return type `%s' in class `%s'",
6483              lang_printable_name (found, 0), t,
6484              IDENTIFIER_POINTER
6485                (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found)))));
6486           free (t);
6487           continue;
6488         }
6489     }
6490
6491   /* 4- Inherited methods can't differ by their returned types */
6492   if (!(basetype_vec = TYPE_BINFO_BASETYPES (interface)))
6493     return;
6494   n = TREE_VEC_LENGTH (basetype_vec);
6495   for (i = 0; i < n; i++)
6496     {
6497       tree sub_interface_method, sub_interface;
6498       tree vec_elt = TREE_VEC_ELT (basetype_vec, i);
6499       if (!vec_elt)
6500         continue;
6501       sub_interface = BINFO_TYPE (vec_elt);
6502       for (sub_interface_method = TYPE_METHODS (sub_interface);
6503            sub_interface_method;
6504            sub_interface_method = TREE_CHAIN (sub_interface_method))
6505         {
6506           found = lookup_java_interface_method2 (interface,
6507                                                  sub_interface_method);
6508           if (found && (found != sub_interface_method))
6509             {
6510               parse_error_context
6511                 (lookup_cl (sub_interface_method),
6512                  "Interface `%s' inherits method `%s' from interface `%s'. This method is redefined with a different return type in interface `%s'",
6513                  IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (interface))),
6514                  lang_printable_name (found, 0),
6515                  IDENTIFIER_POINTER
6516                    (DECL_NAME (TYPE_NAME
6517                                (DECL_CONTEXT (sub_interface_method)))),
6518                  IDENTIFIER_POINTER
6519                    (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found)))));
6520             }
6521         }
6522     }
6523 }
6524
6525 /* Lookup methods in interfaces using their name and partial
6526    signature. Return a matching method only if their types differ.  */
6527
6528 static tree
6529 lookup_java_interface_method2 (tree class, tree method_decl)
6530 {
6531   int i, n;
6532   tree basetype_vec = TYPE_BINFO_BASETYPES (class), to_return;
6533
6534   if (!basetype_vec)
6535     return NULL_TREE;
6536
6537   n = TREE_VEC_LENGTH (basetype_vec);
6538   for (i = 0; i < n; i++)
6539     {
6540       tree vec_elt = TREE_VEC_ELT (basetype_vec, i), to_return;
6541       if ((BINFO_TYPE (vec_elt) != object_type_node)
6542           && (to_return =
6543               lookup_java_method2 (BINFO_TYPE (vec_elt), method_decl, 1)))
6544         return to_return;
6545     }
6546   for (i = 0; i < n; i++)
6547     {
6548       to_return = lookup_java_interface_method2
6549         (BINFO_TYPE (TREE_VEC_ELT (basetype_vec, i)), method_decl);
6550       if (to_return)
6551         return to_return;
6552     }
6553
6554   return NULL_TREE;
6555 }
6556
6557 /* Lookup method using their name and partial signature. Return a
6558    matching method only if their types differ.  */
6559
6560 static tree
6561 lookup_java_method2 (tree clas, tree method_decl, int do_interface)
6562 {
6563   tree method, method_signature, method_name, method_type, name;
6564
6565   method_signature = build_java_argument_signature (TREE_TYPE (method_decl));
6566   name = DECL_NAME (method_decl);
6567   method_name = (TREE_CODE (name) == EXPR_WITH_FILE_LOCATION ?
6568                  EXPR_WFL_NODE (name) : name);
6569   method_type = TREE_TYPE (TREE_TYPE (method_decl));
6570
6571   while (clas != NULL_TREE)
6572     {
6573       for (method = TYPE_METHODS (clas);
6574            method != NULL_TREE;  method = TREE_CHAIN (method))
6575         {
6576           tree method_sig = build_java_argument_signature (TREE_TYPE (method));
6577           tree name = DECL_NAME (method);
6578           if ((TREE_CODE (name) == EXPR_WITH_FILE_LOCATION ?
6579                EXPR_WFL_NODE (name) : name) == method_name
6580               && method_sig == method_signature
6581               && TREE_TYPE (TREE_TYPE (method)) != method_type)
6582             return method;
6583         }
6584       clas = (do_interface ? NULL_TREE : CLASSTYPE_SUPER (clas));
6585     }
6586   return NULL_TREE;
6587 }
6588
6589 /* Return the line that matches DECL line number, and try its best to
6590    position the column number. Used during error reports.  */
6591
6592 static GTY(()) tree cl_v;
6593 static tree
6594 lookup_cl (tree decl)
6595 {
6596   char *line, *found;
6597
6598   if (!decl)
6599     return NULL_TREE;
6600
6601   if (cl_v == NULL_TREE)
6602     {
6603       cl_v = build_expr_wfl (NULL_TREE, NULL, 0, 0);
6604     }
6605
6606   EXPR_WFL_FILENAME_NODE (cl_v) = get_identifier (DECL_SOURCE_FILE (decl));
6607   EXPR_WFL_SET_LINECOL (cl_v, DECL_SOURCE_LINE_FIRST (decl), -1);
6608
6609   line = java_get_line_col (EXPR_WFL_FILENAME (cl_v),
6610                             EXPR_WFL_LINENO (cl_v), EXPR_WFL_COLNO (cl_v));
6611
6612   found = strstr ((const char *)line,
6613                   (const char *)IDENTIFIER_POINTER (DECL_NAME (decl)));
6614   if (found)
6615     EXPR_WFL_SET_LINECOL (cl_v, EXPR_WFL_LINENO (cl_v), found - line);
6616
6617   return cl_v;
6618 }
6619
6620 /* Look for a simple name in the single-type import list */
6621
6622 static tree
6623 find_name_in_single_imports (tree name)
6624 {
6625   tree node;
6626
6627   for (node = ctxp->import_list; node; node = TREE_CHAIN (node))
6628     if (TREE_VALUE (node) == name)
6629       return (EXPR_WFL_NODE (TREE_PURPOSE (node)));
6630
6631   return NULL_TREE;
6632 }
6633
6634 /* Process all single-type import. */
6635
6636 static int
6637 process_imports (void)
6638 {
6639   tree import;
6640   int error_found;
6641
6642   for (import = ctxp->import_list; import; import = TREE_CHAIN (import))
6643     {
6644       tree to_be_found = EXPR_WFL_NODE (TREE_PURPOSE (import));
6645       char *original_name;
6646
6647       original_name = xmemdup (IDENTIFIER_POINTER (to_be_found),
6648                                IDENTIFIER_LENGTH (to_be_found),
6649                                IDENTIFIER_LENGTH (to_be_found) + 1);
6650
6651       /* Don't load twice something already defined. */
6652       if (IDENTIFIER_CLASS_VALUE (to_be_found))
6653         continue;
6654
6655       while (1)
6656         {
6657           tree left;
6658
6659           QUALIFIED_P (to_be_found) = 1;
6660           load_class (to_be_found, 0);
6661           error_found =
6662             check_pkg_class_access (to_be_found, TREE_PURPOSE (import), true);
6663
6664           /* We found it, we can bail out */
6665           if (IDENTIFIER_CLASS_VALUE (to_be_found))
6666             {
6667               check_deprecation (TREE_PURPOSE (import),
6668                                  IDENTIFIER_CLASS_VALUE (to_be_found));
6669               break;
6670             }
6671
6672           /* We haven't found it. Maybe we're trying to access an
6673              inner class.  The only way for us to know is to try again
6674              after having dropped a qualifier. If we can't break it further,
6675              we have an error. */
6676           if (breakdown_qualified (&left, NULL, to_be_found))
6677             break;
6678
6679           to_be_found = left;
6680         }
6681       if (!IDENTIFIER_CLASS_VALUE (to_be_found))
6682         {
6683           parse_error_context (TREE_PURPOSE (import),
6684                                "Class or interface `%s' not found in import",
6685                                original_name);
6686           error_found = 1;
6687         }
6688
6689       free (original_name);
6690       if (error_found)
6691         return 1;
6692     }
6693   return 0;
6694 }
6695
6696 /* Possibly find and mark a class imported by a single-type import
6697    statement.  */
6698
6699 static void
6700 find_in_imports (tree enclosing_type, tree class_type)
6701 {
6702   tree import = (enclosing_type ? TYPE_IMPORT_LIST (enclosing_type) :
6703                  ctxp->import_list);
6704   while (import)
6705     {
6706       if (TREE_VALUE (import) == TYPE_NAME (class_type))
6707         {
6708           TYPE_NAME (class_type) = EXPR_WFL_NODE (TREE_PURPOSE (import));
6709           QUALIFIED_P (TYPE_NAME (class_type)) = 1;
6710           return;
6711         }
6712       import = TREE_CHAIN (import);
6713     }
6714 }
6715
6716 static int
6717 note_possible_classname (const char *name, int len)
6718 {
6719   tree node;
6720   if (len > 5 && strncmp (&name [len-5], ".java", 5) == 0)
6721     len = len - 5;
6722   else if (len > 6 && strncmp (&name [len-6], ".class", 6) == 0)
6723     len = len - 6;
6724   else
6725     return 0;
6726   node = ident_subst (name, len, "", '/', '.', "");
6727   IS_A_CLASSFILE_NAME (node) = 1; /* Or soon to be */
6728   QUALIFIED_P (node) = strchr (name, '/') ? 1 : 0;
6729   return 1;
6730 }
6731
6732 /* Read a import directory, gathering potential match for further type
6733    references. Indifferently reads a filesystem or a ZIP archive
6734    directory.  */
6735
6736 static void
6737 read_import_dir (tree wfl)
6738 {
6739   tree package_id = EXPR_WFL_NODE (wfl);
6740   const char *package_name = IDENTIFIER_POINTER (package_id);
6741   int package_length = IDENTIFIER_LENGTH (package_id);
6742   DIR *dirp = NULL;
6743   JCF *saved_jcf = current_jcf;
6744
6745   int found = 0;
6746   int k;
6747   void *entry;
6748   struct buffer filename[1];
6749
6750   if (IS_AN_IMPORT_ON_DEMAND_P (package_id))
6751     return;
6752   IS_AN_IMPORT_ON_DEMAND_P (package_id) = 1;
6753
6754   BUFFER_INIT (filename);
6755   buffer_grow (filename, package_length + 100);
6756
6757   for (entry = jcf_path_start (); entry != NULL; entry = jcf_path_next (entry))
6758     {
6759       const char *entry_name = jcf_path_name (entry);
6760       int entry_length = strlen (entry_name);
6761       if (jcf_path_is_zipfile (entry))
6762         {
6763           ZipFile *zipf;
6764           buffer_grow (filename, entry_length);
6765           memcpy (filename->data, entry_name, entry_length - 1);
6766           filename->data[entry_length-1] = '\0';
6767           zipf = opendir_in_zip (filename->data, jcf_path_is_system (entry));
6768           if (zipf == NULL)
6769             error ("malformed .zip archive in CLASSPATH: %s", entry_name);
6770           else
6771             {
6772               ZipDirectory *zipd = (ZipDirectory *) zipf->central_directory;
6773               BUFFER_RESET (filename);
6774               for (k = 0; k < package_length; k++)
6775                 {
6776                   char ch = package_name[k];
6777                   *filename->ptr++ = ch == '.' ? '/' : ch;
6778                 }
6779               *filename->ptr++ = '/';
6780
6781               for (k = 0; k < zipf->count;  k++, zipd = ZIPDIR_NEXT (zipd))
6782                 {
6783                   const char *current_entry = ZIPDIR_FILENAME (zipd);
6784                   int current_entry_len = zipd->filename_length;
6785
6786                   if (current_entry_len >= BUFFER_LENGTH (filename)
6787                       && strncmp (filename->data, current_entry,
6788                                   BUFFER_LENGTH (filename)) != 0)
6789                     continue;
6790                   found |= note_possible_classname (current_entry,
6791                                                     current_entry_len);
6792                 }
6793             }
6794         }
6795       else
6796         {
6797           BUFFER_RESET (filename);
6798           buffer_grow (filename, entry_length + package_length + 4);
6799           strcpy (filename->data, entry_name);
6800           filename->ptr = filename->data + entry_length;
6801           for (k = 0; k < package_length; k++)
6802             {
6803               char ch = package_name[k];
6804               *filename->ptr++ = ch == '.' ? '/' : ch;
6805             }
6806           *filename->ptr = '\0';
6807
6808           dirp = opendir (filename->data);
6809           if (dirp == NULL)
6810             continue;
6811           *filename->ptr++ = '/';
6812           for (;;)
6813             {
6814               int len;
6815               const char *d_name;
6816               struct dirent *direntp = readdir (dirp);
6817               if (!direntp)
6818                 break;
6819               d_name = direntp->d_name;
6820               len = strlen (direntp->d_name);
6821               buffer_grow (filename, len+1);
6822               strcpy (filename->ptr, d_name);
6823               found |= note_possible_classname (filename->data + entry_length,
6824                                                 package_length+len+1);
6825             }
6826           if (dirp)
6827             closedir (dirp);
6828         }
6829     }
6830
6831   free (filename->data);
6832
6833   /* Here we should have a unified way of retrieving an entry, to be
6834      indexed. */
6835   if (!found)
6836     {
6837       static int first = 1;
6838       if (first)
6839         {
6840           error ("Can't find default package `%s'. Check the CLASSPATH environment variable and the access to the archives", package_name);
6841           java_error_count++;
6842           first = 0;
6843         }
6844       else
6845         parse_error_context (wfl, "Package `%s' not found in import",
6846                              package_name);
6847       current_jcf = saved_jcf;
6848       return;
6849     }
6850   current_jcf = saved_jcf;
6851 }
6852
6853 /* Possibly find a type in the import on demands specified
6854    types. Returns 1 if an error occurred, 0 otherwise. Run through the
6855    entire list, to detected potential double definitions.  */
6856
6857 static int
6858 find_in_imports_on_demand (tree enclosing_type, tree class_type)
6859 {
6860   tree class_type_name = TYPE_NAME (class_type);
6861   tree import = (enclosing_type ? TYPE_IMPORT_DEMAND_LIST (enclosing_type) :
6862                   ctxp->import_demand_list);
6863   tree cl = NULL_TREE;
6864   int seen_once = -1;   /* -1 when not set, 1 if seen once, >1 otherwise. */
6865   int to_return = -1;   /* -1 when not set, 0 or 1 otherwise */
6866   tree node;
6867
6868   for (; import; import = TREE_CHAIN (import))
6869     {
6870       int saved_lineno = input_line;
6871       int access_check;
6872       const char *id_name;
6873       tree decl, type_name_copy;
6874
6875       obstack_grow (&temporary_obstack,
6876                     IDENTIFIER_POINTER (EXPR_WFL_NODE (TREE_PURPOSE (import))),
6877                     IDENTIFIER_LENGTH (EXPR_WFL_NODE (TREE_PURPOSE (import))));
6878       obstack_1grow (&temporary_obstack, '.');
6879       obstack_grow0 (&temporary_obstack,
6880                      IDENTIFIER_POINTER (class_type_name),
6881                      IDENTIFIER_LENGTH (class_type_name));
6882       id_name = obstack_finish (&temporary_obstack);
6883
6884       if (! (node = maybe_get_identifier (id_name)))
6885         continue;
6886
6887       /* Setup lineno so that it refers to the line of the import (in
6888          case we parse a class file and encounter errors */
6889       input_line = EXPR_WFL_LINENO (TREE_PURPOSE (import));
6890
6891       type_name_copy = TYPE_NAME (class_type);
6892       TYPE_NAME (class_type) = node;
6893       QUALIFIED_P (node) = 1;
6894       decl = IDENTIFIER_CLASS_VALUE (node);
6895       access_check = -1;
6896       /* If there is no DECL set for the class or if the class isn't
6897          loaded and not seen in source yet, then load */
6898       if (!decl || (!CLASS_LOADED_P (TREE_TYPE (decl))
6899                     && !CLASS_FROM_SOURCE_P (TREE_TYPE (decl))))
6900         {
6901           load_class (node, 0);
6902           decl = IDENTIFIER_CLASS_VALUE (node);
6903         }
6904       if (decl && ! INNER_CLASS_P (TREE_TYPE (decl)))
6905         access_check = check_pkg_class_access (node, TREE_PURPOSE (import),
6906                                                false);
6907       else
6908         /* 6.6.1: Inner classes are subject to member access rules. */
6909         access_check = 0;
6910
6911       input_line = saved_lineno;
6912
6913       /* If the loaded class is not accessible or couldn't be loaded,
6914          we restore the original TYPE_NAME and process the next
6915          import. */
6916       if (access_check || !decl)
6917         {
6918           TYPE_NAME (class_type) = type_name_copy;
6919           continue;
6920         }
6921
6922       /* If the loaded class is accessible, we keep a tab on it to
6923          detect and report multiple inclusions. */
6924       if (IS_A_CLASSFILE_NAME (node))
6925         {
6926           if (seen_once < 0)
6927             {
6928               cl = TREE_PURPOSE (import);
6929               seen_once = 1;
6930             }
6931           else if (seen_once >= 0)
6932             {
6933               tree location = (cl ? cl : TREE_PURPOSE (import));
6934               tree package = (cl ? EXPR_WFL_NODE (cl) :
6935                               EXPR_WFL_NODE (TREE_PURPOSE (import)));
6936               seen_once++;
6937               parse_error_context
6938                 (location,
6939                  "Type `%s' also potentially defined in package `%s'",
6940                  IDENTIFIER_POINTER (TYPE_NAME (class_type)),
6941                  IDENTIFIER_POINTER (package));
6942             }
6943         }
6944       to_return = access_check;
6945     }
6946
6947   if (seen_once == 1)
6948     return to_return;
6949   else
6950     return (seen_once < 0 ? 0 : seen_once); /* It's ok not to have found */
6951 }
6952
6953 /* Add package NAME to the list of packages encountered so far. To
6954    speed up class lookup in do_resolve_class, we make sure a
6955    particular package is added only once.  */
6956
6957 static void
6958 register_package (tree name)
6959 {
6960   static htab_t pht;
6961   void **e;
6962
6963   if (pht == NULL)
6964     pht = htab_create (50, htab_hash_pointer, htab_eq_pointer, NULL);
6965
6966   e = htab_find_slot (pht, name, INSERT);
6967   if (*e == NULL)
6968     {
6969       package_list = chainon (package_list, build_tree_list (name, NULL));
6970       *e = name;
6971     }
6972 }
6973
6974 static tree
6975 resolve_package (tree pkg, tree *next, tree *type_name)
6976 {
6977   tree current;
6978   tree decl = NULL_TREE;
6979   *type_name = NULL_TREE;
6980
6981   /* The trick is to determine when the package name stops and were
6982      the name of something contained in the package starts. Then we
6983      return a fully qualified name of what we want to get. */
6984
6985   *next = EXPR_WFL_QUALIFICATION (pkg);
6986
6987   /* Try to progressively construct a type name */
6988   if (TREE_CODE (pkg) == EXPR_WITH_FILE_LOCATION)
6989     for (current = EXPR_WFL_QUALIFICATION (pkg);
6990          current; current = TREE_CHAIN (current))
6991       {
6992         /* If we don't have what we're expecting, exit now. TYPE_NAME
6993            will be null and the error caught later. */
6994         if (TREE_CODE (QUAL_WFL (current)) != EXPR_WITH_FILE_LOCATION)
6995           break;
6996         *type_name =
6997           merge_qualified_name (*type_name, EXPR_WFL_NODE (QUAL_WFL (current)));
6998         if ((decl = resolve_no_layout (*type_name, NULL_TREE)))
6999           {
7000             /* resolve_package should be used in a loop, hence we
7001                point at this one to naturally process the next one at
7002                the next iteration. */
7003             *next = current;
7004             break;
7005           }
7006       }
7007   return decl;
7008 }
7009
7010
7011 /* Check accessibility of inner classes according to member access rules.
7012    DECL is the inner class, ENCLOSING_DECL is the class from which the
7013    access is being attempted. */
7014
7015 static void
7016 check_inner_class_access (tree decl, tree enclosing_decl, tree cl)
7017 {
7018   const char *access;
7019   tree enclosing_decl_type;
7020
7021   /* We don't issue an error message when CL is null. CL can be null
7022      as a result of processing a JDEP crafted by source_start_java_method
7023      for the purpose of patching its parm decl. But the error would
7024      have been already trapped when fixing the method's signature.
7025      DECL can also be NULL in case of earlier errors. */
7026   if (!decl || !cl)
7027     return;
7028
7029   enclosing_decl_type = TREE_TYPE (enclosing_decl);
7030
7031   if (CLASS_PRIVATE (decl))
7032     {
7033       /* Access is permitted only within the body of the top-level
7034          class in which DECL is declared. */
7035       tree top_level = decl;
7036       while (DECL_CONTEXT (top_level))
7037         top_level = DECL_CONTEXT (top_level);
7038       while (DECL_CONTEXT (enclosing_decl))
7039         enclosing_decl = DECL_CONTEXT (enclosing_decl);
7040       if (top_level == enclosing_decl)
7041         return;
7042       access = "private";
7043     }
7044   else if (CLASS_PROTECTED (decl))
7045     {
7046       tree decl_context;
7047       /* Access is permitted from within the same package... */
7048       if (in_same_package (decl, enclosing_decl))
7049         return;
7050
7051       /* ... or from within the body of a subtype of the context in which
7052          DECL is declared. */
7053       decl_context = DECL_CONTEXT (decl);
7054       while (enclosing_decl)
7055         {
7056           if (CLASS_INTERFACE (decl))
7057             {
7058               if (interface_of_p (TREE_TYPE (decl_context),
7059                                   enclosing_decl_type))
7060                 return;
7061             }
7062           else
7063             {
7064               /* Eww. The order of the arguments is different!! */
7065               if (inherits_from_p (enclosing_decl_type,
7066                                    TREE_TYPE (decl_context)))
7067                 return;
7068             }
7069           enclosing_decl = DECL_CONTEXT (enclosing_decl);
7070         }
7071       access = "protected";
7072     }
7073   else if (! CLASS_PUBLIC (decl))
7074     {
7075       /* Access is permitted only from within the same package as DECL. */
7076       if (in_same_package (decl, enclosing_decl))
7077         return;
7078       access = "non-public";
7079     }
7080   else
7081     /* Class is public. */
7082     return;
7083
7084   parse_error_context (cl, "Nested %s %s is %s; cannot be accessed from here",
7085                        (CLASS_INTERFACE (decl) ? "interface" : "class"),
7086                        lang_printable_name (decl, 0), access);
7087 }
7088
7089 /* Accessibility check for top-level classes. If CLASS_NAME is in a
7090    foreign package, it must be PUBLIC. Return 0 if no access
7091    violations were found, 1 otherwise. If VERBOSE is true and an error
7092    was found, it is reported and accounted for.  */
7093
7094 static int
7095 check_pkg_class_access (tree class_name, tree cl, bool verbose)
7096 {
7097   tree type;
7098
7099   if (!IDENTIFIER_CLASS_VALUE (class_name))
7100     return 0;
7101
7102   if (!(type = TREE_TYPE (IDENTIFIER_CLASS_VALUE (class_name))))
7103     return 0;
7104
7105   if (!CLASS_PUBLIC (TYPE_NAME (type)))
7106     {
7107       /* Access to a private class within the same package is
7108          allowed. */
7109       tree l, r;
7110       breakdown_qualified (&l, &r, class_name);
7111       if (!QUALIFIED_P (class_name) && !ctxp->package)
7112         /* Both in the empty package. */
7113         return 0;
7114       if (l == ctxp->package)
7115         /* Both in the same package. */
7116         return 0;
7117
7118       if (verbose)
7119         parse_error_context
7120           (cl, "Can't access %s `%s'. Only public classes and interfaces in other packages can be accessed",
7121            (CLASS_INTERFACE (TYPE_NAME (type)) ? "interface" : "class"),
7122            IDENTIFIER_POINTER (class_name));
7123       return 1;
7124     }
7125   return 0;
7126 }
7127
7128 /* Local variable declaration. */
7129
7130 static void
7131 declare_local_variables (int modifier, tree type, tree vlist)
7132 {
7133   tree decl, current, saved_type;
7134   tree type_wfl = NULL_TREE;
7135   int must_chain = 0;
7136   int final_p = 0;
7137
7138   /* Push a new block if statements were seen between the last time we
7139      pushed a block and now. Keep a count of blocks to close */
7140   if (BLOCK_EXPR_BODY (GET_CURRENT_BLOCK (current_function_decl)))
7141     {
7142       tree b = enter_block ();
7143       BLOCK_IS_IMPLICIT (b) = 1;
7144     }
7145
7146   if (modifier)
7147     {
7148       size_t i;
7149       for (i = 0; i < ARRAY_SIZE (ctxp->modifier_ctx); i++)
7150         if (1 << i & modifier)
7151           break;
7152       if (modifier == ACC_FINAL)
7153         final_p = 1;
7154       else
7155         {
7156           parse_error_context
7157             (ctxp->modifier_ctx [i],
7158              "Only `final' is allowed as a local variables modifier");
7159           return;
7160         }
7161     }
7162
7163   /* Obtain an incomplete type if TYPE is not complete. TYPE_WFL will
7164      hold the TYPE value if a new incomplete has to be created (as
7165      opposed to being found already existing and reused). */
7166   SET_TYPE_FOR_RESOLUTION (type, type_wfl, must_chain);
7167
7168   /* If TYPE is fully resolved and we don't have a reference, make one */
7169   PROMOTE_RECORD_IF_COMPLETE (type, must_chain);
7170
7171   /* Go through all the declared variables */
7172   for (current = vlist, saved_type = type; current;
7173        current = TREE_CHAIN (current), type = saved_type)
7174     {
7175       tree other, real_type;
7176       tree wfl  = TREE_PURPOSE (current);
7177       tree name = EXPR_WFL_NODE (wfl);
7178       tree init = TREE_VALUE (current);
7179
7180       /* Process NAME, as it may specify extra dimension(s) for it */
7181       type = build_array_from_name (type, type_wfl, name, &name);
7182
7183       /* Variable redefinition check */
7184       if ((other = lookup_name_in_blocks (name)))
7185         {
7186           variable_redefinition_error (wfl, name, TREE_TYPE (other),
7187                                        DECL_SOURCE_LINE (other));
7188           continue;
7189         }
7190
7191       /* Type adjustment. We may have just readjusted TYPE because
7192          the variable specified more dimensions. Make sure we have
7193          a reference if we can and don't have one already. */
7194       PROMOTE_RECORD_IF_COMPLETE (type, must_chain);
7195
7196       real_type = GET_REAL_TYPE (type);
7197       /* Never layout this decl. This will be done when its scope
7198          will be entered */
7199       decl = build_decl (VAR_DECL, name, real_type);
7200       MAYBE_CREATE_VAR_LANG_DECL_SPECIFIC (decl);
7201       DECL_FINAL (decl) = final_p;
7202       BLOCK_CHAIN_DECL (decl);
7203
7204       /* If doing xreferencing, replace the line number with the WFL
7205          compound value */
7206       if (flag_emit_xref)
7207         DECL_SOURCE_LINE (decl) = EXPR_WFL_LINECOL (wfl);
7208
7209       /* Don't try to use an INIT statement when an error was found */
7210       if (init && java_error_count)
7211         init = NULL_TREE;
7212
7213       /* Add the initialization function to the current function's code */
7214       if (init)
7215         {
7216           /* Name might have been readjusted */
7217           EXPR_WFL_NODE (TREE_OPERAND (init, 0)) = name;
7218           MODIFY_EXPR_FROM_INITIALIZATION_P (init) = 1;
7219           java_method_add_stmt (current_function_decl,
7220                                 build_debugable_stmt (EXPR_WFL_LINECOL (init),
7221                                                       init));
7222         }
7223
7224       /* Setup dependency the type of the decl */
7225       if (must_chain)
7226         {
7227           jdep *dep;
7228           register_incomplete_type (JDEP_VARIABLE, type_wfl, decl, type);
7229           dep = CLASSD_LAST (ctxp->classd_list);
7230           JDEP_GET_PATCH (dep) = &TREE_TYPE (decl);
7231         }
7232     }
7233   SOURCE_FRONTEND_DEBUG (("Defined locals"));
7234 }
7235
7236 /* Called during parsing. Build decls from argument list.  */
7237
7238 static void
7239 source_start_java_method (tree fndecl)
7240 {
7241   tree tem;
7242   tree parm_decl;
7243   int i;
7244
7245   if (!fndecl)
7246     return;
7247
7248   current_function_decl = fndecl;
7249
7250   /* New scope for the function */
7251   enter_block ();
7252   for (tem = TYPE_ARG_TYPES (TREE_TYPE (fndecl)), i = 0;
7253        tem != end_params_node; tem = TREE_CHAIN (tem), i++)
7254     {
7255       tree type = TREE_VALUE (tem);
7256       tree name = TREE_PURPOSE (tem);
7257
7258       /* If type is incomplete. Create an incomplete decl and ask for
7259          the decl to be patched later */
7260       if (INCOMPLETE_TYPE_P (type))
7261         {
7262           jdep *jdep;
7263           tree real_type = GET_REAL_TYPE (type);
7264           parm_decl = build_decl (PARM_DECL, name, real_type);
7265           type = obtain_incomplete_type (type);
7266           register_incomplete_type (JDEP_PARM, NULL_TREE, NULL_TREE, type);
7267           jdep = CLASSD_LAST (ctxp->classd_list);
7268           JDEP_MISC (jdep) = name;
7269           JDEP_GET_PATCH (jdep) = &TREE_TYPE (parm_decl);
7270         }
7271       else
7272         parm_decl = build_decl (PARM_DECL, name, type);
7273
7274       /* Remember if a local variable was declared final (via its
7275          TREE_LIST of type/name.) Set DECL_FINAL accordingly. */
7276       if (ARG_FINAL_P (tem))
7277         {
7278           MAYBE_CREATE_VAR_LANG_DECL_SPECIFIC (parm_decl);
7279           DECL_FINAL (parm_decl) = 1;
7280         }
7281
7282       BLOCK_CHAIN_DECL (parm_decl);
7283     }
7284   tem = BLOCK_EXPR_DECLS (DECL_FUNCTION_BODY (current_function_decl));
7285   BLOCK_EXPR_DECLS (DECL_FUNCTION_BODY (current_function_decl)) =
7286     nreverse (tem);
7287   DECL_ARG_SLOT_COUNT (current_function_decl) = i;
7288   DECL_MAX_LOCALS (current_function_decl) = i;
7289 }
7290
7291 /* Called during parsing. Creates an artificial method declaration.  */
7292
7293 static tree
7294 create_artificial_method (tree class, int flags, tree type,
7295                           tree name, tree args)
7296 {
7297   tree mdecl;
7298
7299   java_parser_context_save_global ();
7300   input_line = 0;
7301   mdecl = make_node (FUNCTION_TYPE);
7302   TREE_TYPE (mdecl) = type;
7303   TYPE_ARG_TYPES (mdecl) = args;
7304   mdecl = add_method (class, flags, name, build_java_signature (mdecl));
7305   java_parser_context_restore_global ();
7306   DECL_ARTIFICIAL (mdecl) = 1;
7307   return mdecl;
7308 }
7309
7310 /* Starts the body if an artificial method.  */
7311
7312 static void
7313 start_artificial_method_body (tree mdecl)
7314 {
7315   DECL_SOURCE_LINE (mdecl) = 1;
7316   DECL_SOURCE_LINE_MERGE (mdecl, 1);
7317   source_start_java_method (mdecl);
7318   enter_block ();
7319 }
7320
7321 static void
7322 end_artificial_method_body (tree mdecl)
7323 {
7324   /* exit_block modifies DECL_FUNCTION_BODY (current_function_decl).
7325      It has to be evaluated first. (if mdecl is current_function_decl,
7326      we have an undefined behavior if no temporary variable is used.) */
7327   tree b = exit_block ();
7328   BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (mdecl)) = b;
7329   exit_block ();
7330 }
7331
7332 /* Dump a tree of some kind.  This is a convenience wrapper for the
7333    dump_* functions in tree-dump.c.  */
7334 static void
7335 dump_java_tree (enum tree_dump_index phase, tree t)
7336 {
7337   FILE *stream;
7338   int flags;
7339
7340   stream = dump_begin (phase, &flags);
7341   flags |= TDF_SLIM;
7342   if (stream)
7343     {
7344       dump_node (t, flags, stream);
7345       dump_end (phase, stream);
7346     }
7347 }
7348
7349 /* Terminate a function and expand its body.  */
7350
7351 static void
7352 source_end_java_method (void)
7353 {
7354   tree fndecl = current_function_decl;
7355
7356   if (!fndecl)
7357     return;
7358
7359   java_parser_context_save_global ();
7360   input_line = ctxp->last_ccb_indent1;
7361
7362   /* Turn function bodies with only a NOP expr null, so they don't get
7363      generated at all and we won't get warnings when using the -W
7364      -Wall flags. */
7365   if (BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (fndecl)) == empty_stmt_node)
7366     BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (fndecl)) = NULL_TREE;
7367
7368   /* We've generated all the trees for this function, and it has been
7369      patched.  Dump it to a file if the user requested it.  */
7370   dump_java_tree (TDI_original, fndecl);
7371
7372   java_optimize_inline (fndecl);
7373
7374   /* Generate function's code */
7375   if (BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (fndecl))
7376       && ! flag_emit_class_files
7377       && ! flag_emit_xref)
7378     expand_expr_stmt (BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (fndecl)));
7379
7380   /* pop out of its parameters */
7381   pushdecl_force_head (DECL_ARGUMENTS (fndecl));
7382   poplevel (1, 0, 1);
7383   BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl)) = fndecl;
7384
7385   /* Generate rtl for function exit.  */
7386   if (! flag_emit_class_files && ! flag_emit_xref)
7387     {
7388       input_line = DECL_SOURCE_LINE_LAST (fndecl);
7389       expand_function_end (input_filename, input_line, 0);
7390
7391       DECL_SOURCE_LINE (fndecl) = DECL_SOURCE_LINE_FIRST (fndecl);
7392
7393       /* Run the optimizers and output assembler code for this function. */
7394       rest_of_compilation (fndecl);
7395     }
7396
7397   current_function_decl = NULL_TREE;
7398   java_parser_context_restore_global ();
7399 }
7400
7401 /* Record EXPR in the current function block. Complements compound
7402    expression second operand if necessary.  */
7403
7404 tree
7405 java_method_add_stmt (tree fndecl, tree expr)
7406 {
7407   if (!GET_CURRENT_BLOCK (fndecl))
7408     return NULL_TREE;
7409   return add_stmt_to_block (GET_CURRENT_BLOCK (fndecl), NULL_TREE, expr);
7410 }
7411
7412 static tree
7413 add_stmt_to_block (tree b, tree type, tree stmt)
7414 {
7415   tree body = BLOCK_EXPR_BODY (b), c;
7416
7417   if (java_error_count)
7418     return body;
7419
7420   if ((c = add_stmt_to_compound (body, type, stmt)) == body)
7421     return body;
7422
7423   BLOCK_EXPR_BODY (b) = c;
7424   TREE_SIDE_EFFECTS (c) = 1;
7425   return c;
7426 }
7427
7428 /* Add STMT to EXISTING if possible, otherwise create a new
7429    COMPOUND_EXPR and add STMT to it. */
7430
7431 static tree
7432 add_stmt_to_compound (tree existing, tree type, tree stmt)
7433 {
7434   /* Keep track of this for inlining.  */
7435   if (current_function_decl)
7436     ++DECL_NUM_STMTS (current_function_decl);
7437
7438   if (existing)
7439     return build (COMPOUND_EXPR, type, existing, stmt);
7440   else
7441     return stmt;
7442 }
7443
7444 void java_layout_seen_class_methods (void)
7445 {
7446   tree previous_list = all_class_list;
7447   tree end = NULL_TREE;
7448   tree current;
7449
7450   while (1)
7451     {
7452       for (current = previous_list;
7453            current != end; current = TREE_CHAIN (current))
7454         layout_class_methods (TREE_TYPE (TREE_VALUE (current)));
7455
7456       if (previous_list != all_class_list)
7457         {
7458           end = previous_list;
7459           previous_list = all_class_list;
7460         }
7461       else
7462         break;
7463     }
7464 }
7465
7466 static GTY(()) tree stop_reordering;
7467 void
7468 java_reorder_fields (void)
7469 {
7470   tree current;
7471
7472   for (current = gclass_list; current; current = TREE_CHAIN (current))
7473     {
7474       current_class = TREE_TYPE (TREE_VALUE (current));
7475
7476       if (current_class == stop_reordering)
7477         break;
7478
7479       /* Reverse the fields, but leave the dummy field in front.
7480          Fields are already ordered for Object and Class */
7481       if (TYPE_FIELDS (current_class) && current_class != object_type_node
7482           && current_class != class_type_node)
7483       {
7484         /* If the dummy field is there, reverse the right fields and
7485            just layout the type for proper fields offset */
7486         if (!DECL_NAME (TYPE_FIELDS (current_class)))
7487           {
7488             tree fields = TYPE_FIELDS (current_class);
7489             TREE_CHAIN (fields) = nreverse (TREE_CHAIN (fields));
7490             TYPE_SIZE (current_class) = NULL_TREE;
7491           }
7492         /* We don't have a dummy field, we need to layout the class,
7493            after having reversed the fields */
7494         else
7495           {
7496             TYPE_FIELDS (current_class) =
7497               nreverse (TYPE_FIELDS (current_class));
7498             TYPE_SIZE (current_class) = NULL_TREE;
7499           }
7500       }
7501     }
7502   /* There are cases were gclass_list will be empty. */
7503   if (gclass_list)
7504     stop_reordering = TREE_TYPE (TREE_VALUE (gclass_list));
7505 }
7506
7507 /* Layout the methods of all classes loaded in one way or another.
7508    Check methods of source parsed classes. Then reorder the
7509    fields and layout the classes or the type of all source parsed
7510    classes */
7511
7512 void
7513 java_layout_classes (void)
7514 {
7515   tree current;
7516   int save_error_count = java_error_count;
7517
7518   /* Layout the methods of all classes seen so far */
7519   java_layout_seen_class_methods ();
7520   java_parse_abort_on_error ();
7521   all_class_list = NULL_TREE;
7522
7523   /* Then check the methods of all parsed classes */
7524   for (current = gclass_list; current; current = TREE_CHAIN (current))
7525     if (CLASS_FROM_SOURCE_P (TREE_TYPE (TREE_VALUE (current))))
7526       java_check_methods (TREE_VALUE (current));
7527   java_parse_abort_on_error ();
7528
7529   for (current = gclass_list; current; current = TREE_CHAIN (current))
7530     {
7531       current_class = TREE_TYPE (TREE_VALUE (current));
7532       layout_class (current_class);
7533
7534       /* Error reported by the caller */
7535       if (java_error_count)
7536         return;
7537     }
7538
7539   /* We might have reloaded classes durign the process of laying out
7540      classes for code generation. We must layout the methods of those
7541      late additions, as constructor checks might use them */
7542   java_layout_seen_class_methods ();
7543   java_parse_abort_on_error ();
7544 }
7545
7546 /* Expand methods in the current set of classes rememebered for
7547    generation.  */
7548
7549 static void
7550 java_complete_expand_classes (void)
7551 {
7552   tree current;
7553
7554   do_not_fold = flag_emit_xref;
7555
7556   for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
7557     if (!INNER_CLASS_DECL_P (current))
7558       java_complete_expand_class (current);
7559 }
7560
7561 /* Expand the methods found in OUTER, starting first by OUTER's inner
7562    classes, if any.  */
7563
7564 static void
7565 java_complete_expand_class (tree outer)
7566 {
7567   tree inner_list;
7568
7569   set_nested_class_simple_name_value (outer, 1); /* Set */
7570
7571   /* We need to go after all inner classes and start expanding them,
7572      starting with most nested ones. We have to do that because nested
7573      classes might add functions to outer classes */
7574
7575   for (inner_list = DECL_INNER_CLASS_LIST (outer);
7576        inner_list; inner_list = TREE_CHAIN (inner_list))
7577     java_complete_expand_class (TREE_PURPOSE (inner_list));
7578
7579   java_complete_expand_methods (outer);
7580   set_nested_class_simple_name_value (outer, 0); /* Reset */
7581 }
7582
7583 /* Expand methods registered in CLASS_DECL. The general idea is that
7584    we expand regular methods first. This allows us get an estimate on
7585    how outer context local alias fields are really used so we can add
7586    to the constructor just enough code to initialize them properly (it
7587    also lets us generate finit$ correctly.) Then we expand the
7588    constructors and then <clinit>.  */
7589
7590 static void
7591 java_complete_expand_methods (tree class_decl)
7592 {
7593   tree clinit, decl, first_decl;
7594
7595   current_class = TREE_TYPE (class_decl);
7596
7597   /* Initialize a new constant pool */
7598   init_outgoing_cpool ();
7599
7600   /* Pre-expand <clinit> to figure whether we really need it or
7601      not. If we do need it, we pre-expand the static fields so they're
7602      ready to be used somewhere else. <clinit> will be fully expanded
7603      after we processed the constructors. */
7604   first_decl = TYPE_METHODS (current_class);
7605   clinit = maybe_generate_pre_expand_clinit (current_class);
7606
7607   /* Then generate finit$ (if we need to) because constructors will
7608    try to use it.*/
7609   if (TYPE_FINIT_STMT_LIST (current_class))
7610     java_complete_expand_method (generate_finit (current_class));
7611
7612   /* Then generate instinit$ (if we need to) because constructors will
7613      try to use it. */
7614   if (TYPE_II_STMT_LIST (current_class))
7615     java_complete_expand_method (generate_instinit (current_class));
7616
7617   /* Now do the constructors */
7618   for (decl = first_decl ; !java_error_count && decl; decl = TREE_CHAIN (decl))
7619     {
7620       int no_body;
7621
7622       if (!DECL_CONSTRUCTOR_P (decl))
7623         continue;
7624
7625       no_body = !DECL_FUNCTION_BODY (decl);
7626       /* Don't generate debug info on line zero when expanding a
7627          generated constructor. */
7628       if (no_body)
7629         restore_line_number_status (1);
7630
7631       java_complete_expand_method (decl);
7632
7633       if (no_body)
7634         restore_line_number_status (0);
7635     }
7636
7637   /* First, do the ordinary methods. */
7638   for (decl = first_decl; decl; decl = TREE_CHAIN (decl))
7639     {
7640       /* Ctors aren't part of this batch. */
7641       if (DECL_CONSTRUCTOR_P (decl) || DECL_CLINIT_P (decl))
7642         continue;
7643
7644       /* Skip abstract or native methods -- but do handle native
7645          methods when generating JNI stubs.  */
7646       if (METHOD_ABSTRACT (decl) || (! flag_jni && METHOD_NATIVE (decl)))
7647         {
7648           DECL_FUNCTION_BODY (decl) = NULL_TREE;
7649           continue;
7650         }
7651
7652       if (METHOD_NATIVE (decl))
7653         {
7654           tree body;
7655           current_function_decl = decl;
7656           body = build_jni_stub (decl);
7657           BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (decl)) = body;
7658         }
7659
7660       java_complete_expand_method (decl);
7661     }
7662
7663   /* If there is indeed a <clinit>, fully expand it now */
7664   if (clinit)
7665     {
7666       /* Prevent the use of `this' inside <clinit> */
7667       ctxp->explicit_constructor_p = 1;
7668       java_complete_expand_method (clinit);
7669       ctxp->explicit_constructor_p = 0;
7670     }
7671
7672   /* We might have generated a class$ that we now want to expand */
7673   if (TYPE_DOT_CLASS (current_class))
7674     java_complete_expand_method (TYPE_DOT_CLASS (current_class));
7675
7676   /* Now verify constructor circularity (stop after the first one we
7677      prove wrong.) */
7678   if (!CLASS_INTERFACE (class_decl))
7679     for (decl = TYPE_METHODS (current_class); decl; decl = TREE_CHAIN (decl))
7680       if (DECL_CONSTRUCTOR_P (decl)
7681           && verify_constructor_circularity (decl, decl))
7682         break;
7683
7684   /* Save the constant pool. We'll need to restore it later. */
7685   TYPE_CPOOL (current_class) = outgoing_cpool;
7686 }
7687
7688 /* Attempt to create <clinit>. Pre-expand static fields so they can be
7689    safely used in some other methods/constructors.  */
7690
7691 static tree
7692 maybe_generate_pre_expand_clinit (tree class_type)
7693 {
7694   tree current, mdecl;
7695
7696   if (!TYPE_CLINIT_STMT_LIST (class_type))
7697     return NULL_TREE;
7698
7699   /* Go through all static fields and pre expand them */
7700   for (current = TYPE_FIELDS (class_type); current;
7701        current = TREE_CHAIN (current))
7702     if (FIELD_STATIC (current))
7703       build_field_ref (NULL_TREE, class_type, DECL_NAME (current));
7704
7705   /* Then build the <clinit> method */
7706   mdecl = create_artificial_method (class_type, ACC_STATIC, void_type_node,
7707                                     clinit_identifier_node, end_params_node);
7708   layout_class_method (class_type, CLASSTYPE_SUPER (class_type),
7709                        mdecl, NULL_TREE);
7710   start_artificial_method_body (mdecl);
7711
7712   /* We process the list of assignment we produced as the result of
7713      the declaration of initialized static field and add them as
7714      statement to the <clinit> method. */
7715   for (current = TYPE_CLINIT_STMT_LIST (class_type); current;
7716        current = TREE_CHAIN (current))
7717     {
7718       tree stmt = current;
7719       /* We build the assignment expression that will initialize the
7720          field to its value. There are strict rules on static
7721          initializers (8.5). FIXME */
7722       if (TREE_CODE (stmt) != BLOCK && stmt != empty_stmt_node)
7723         stmt = build_debugable_stmt (EXPR_WFL_LINECOL (stmt), stmt);
7724       java_method_add_stmt (mdecl, stmt);
7725     }
7726
7727   end_artificial_method_body (mdecl);
7728
7729   /* Now we want to place <clinit> as the last method (because we need
7730      it at least for interface so that it doesn't interfere with the
7731      dispatch table based lookup. */
7732   if (TREE_CHAIN (TYPE_METHODS (class_type)))
7733     {
7734       current = TREE_CHAIN (TYPE_METHODS (class_type));
7735       TYPE_METHODS (class_type) = current;
7736
7737       while (TREE_CHAIN (current))
7738         current = TREE_CHAIN (current);
7739
7740       TREE_CHAIN (current) = mdecl;
7741       TREE_CHAIN (mdecl) = NULL_TREE;
7742     }
7743
7744   return mdecl;
7745 }
7746
7747 /* Analyzes a method body and look for something that isn't a
7748    MODIFY_EXPR with a constant value.  */
7749
7750 static int
7751 analyze_clinit_body (tree this_class, tree bbody)
7752 {
7753   while (bbody)
7754     switch (TREE_CODE (bbody))
7755       {
7756       case BLOCK:
7757         bbody = BLOCK_EXPR_BODY (bbody);
7758         break;
7759
7760       case EXPR_WITH_FILE_LOCATION:
7761         bbody = EXPR_WFL_NODE (bbody);
7762         break;
7763
7764       case COMPOUND_EXPR:
7765         if (analyze_clinit_body (this_class, TREE_OPERAND (bbody, 0)))
7766           return 1;
7767         bbody = TREE_OPERAND (bbody, 1);
7768         break;
7769
7770       case MODIFY_EXPR:
7771         /* If we're generating to class file and we're dealing with an
7772            array initialization, we return 1 to keep <clinit> */
7773         if (TREE_CODE (TREE_OPERAND (bbody, 1)) == NEW_ARRAY_INIT
7774             && flag_emit_class_files)
7775           return 1;
7776
7777         /* There are a few cases where we're required to keep
7778            <clinit>:
7779            - If this is an assignment whose operand is not constant,
7780            - If this is an assignment to a non-initialized field,
7781            - If this field is not a member of the current class.
7782         */
7783         return (! TREE_CONSTANT (TREE_OPERAND (bbody, 1))
7784                 || ! DECL_INITIAL (TREE_OPERAND (bbody, 0))
7785                 || DECL_CONTEXT (TREE_OPERAND (bbody, 0)) != this_class);
7786
7787       default:
7788         return 1;
7789       }
7790   return 0;
7791 }
7792
7793
7794 /* See whether we could get rid of <clinit>. Criteria are: all static
7795    final fields have constant initial values and the body of <clinit>
7796    is empty. Return 1 if <clinit> was discarded, 0 otherwise. */
7797
7798 static int
7799 maybe_yank_clinit (tree mdecl)
7800 {
7801   tree type, current;
7802   tree fbody, bbody;
7803
7804   if (!DECL_CLINIT_P (mdecl))
7805     return 0;
7806
7807   /* If the body isn't empty, then we keep <clinit>. Note that if
7808      we're emitting classfiles, this isn't enough not to rule it
7809      out. */
7810   fbody = DECL_FUNCTION_BODY (mdecl);
7811   bbody = BLOCK_EXPR_BODY (fbody);
7812   if (bbody && bbody != error_mark_node)
7813     bbody = BLOCK_EXPR_BODY (bbody);
7814   else
7815     return 0;
7816   if (bbody && ! flag_emit_class_files && bbody != empty_stmt_node)
7817     return 0;
7818
7819   type = DECL_CONTEXT (mdecl);
7820   current = TYPE_FIELDS (type);
7821
7822   for (current = (current ? TREE_CHAIN (current) : current);
7823        current; current = TREE_CHAIN (current))
7824     {
7825       tree f_init;
7826
7827       /* We're not interested in non-static fields.  */
7828       if (!FIELD_STATIC (current))
7829         continue;
7830
7831       /* Nor in fields without initializers. */
7832       f_init = DECL_INITIAL (current);
7833       if (f_init == NULL_TREE)
7834         continue;
7835
7836       /* Anything that isn't String or a basic type is ruled out -- or
7837          if we know how to deal with it (when doing things natively) we
7838          should generated an empty <clinit> so that SUID are computed
7839          correctly. */
7840       if (! JSTRING_TYPE_P (TREE_TYPE (current))
7841           && ! JNUMERIC_TYPE_P (TREE_TYPE (current)))
7842         return 0;
7843
7844       if (! FIELD_FINAL (current) || ! TREE_CONSTANT (f_init))
7845         return 0;
7846     }
7847
7848   /* Now we analyze the method body and look for something that
7849      isn't a MODIFY_EXPR */
7850   if (bbody != empty_stmt_node && analyze_clinit_body (type, bbody))
7851     return 0;
7852
7853   /* Get rid of <clinit> in the class' list of methods */
7854   if (TYPE_METHODS (type) == mdecl)
7855     TYPE_METHODS (type) = TREE_CHAIN (mdecl);
7856   else
7857     for (current = TYPE_METHODS (type); current;
7858          current = TREE_CHAIN (current))
7859       if (TREE_CHAIN (current) == mdecl)
7860         {
7861           TREE_CHAIN (current) = TREE_CHAIN (mdecl);
7862           break;
7863         }
7864
7865   return 1;
7866 }
7867
7868 /* Install the argument from MDECL. Suitable to completion and
7869    expansion of mdecl's body.  */
7870
7871 static void
7872 start_complete_expand_method (tree mdecl)
7873 {
7874   tree tem;
7875
7876   pushlevel (1);                /* Prepare for a parameter push */
7877   tem = BLOCK_EXPR_DECLS (DECL_FUNCTION_BODY (current_function_decl));
7878   DECL_ARGUMENTS (mdecl) = tem;
7879
7880   for (; tem; tem = TREE_CHAIN (tem))
7881     {
7882       /* TREE_CHAIN (tem) will change after pushdecl. */
7883       tree next = TREE_CHAIN (tem);
7884       tree type = TREE_TYPE (tem);
7885       if (PROMOTE_PROTOTYPES
7886           && TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node)
7887           && INTEGRAL_TYPE_P (type))
7888         type = integer_type_node;
7889       DECL_ARG_TYPE (tem) = type;
7890       layout_decl (tem, 0);
7891       pushdecl (tem);
7892       /* Re-install the next so that the list is kept and the loop
7893          advances. */
7894       TREE_CHAIN (tem) = next;
7895     }
7896   pushdecl_force_head (DECL_ARGUMENTS (mdecl));
7897   input_line = DECL_SOURCE_LINE_FIRST (mdecl);
7898   build_result_decl (mdecl);
7899 }
7900
7901
7902 /* Complete and expand a method.  */
7903
7904 static void
7905 java_complete_expand_method (tree mdecl)
7906 {
7907   tree fbody, block_body, exception_copy;
7908
7909   current_function_decl = mdecl;
7910   /* Fix constructors before expanding them */
7911   if (DECL_CONSTRUCTOR_P (mdecl))
7912     fix_constructors (mdecl);
7913
7914   /* Expand functions that have a body */
7915   if (!DECL_FUNCTION_BODY (mdecl))
7916     return;
7917
7918   fbody = DECL_FUNCTION_BODY (mdecl);
7919   block_body = BLOCK_EXPR_BODY (fbody);
7920   exception_copy = NULL_TREE;
7921
7922   current_function_decl = mdecl;
7923
7924   if (! quiet_flag)
7925     fprintf (stderr, " [%s.",
7926              lang_printable_name (DECL_CONTEXT (mdecl), 0));
7927   announce_function (mdecl);
7928   if (! quiet_flag)
7929     fprintf (stderr, "]");
7930
7931   /* Prepare the function for tree completion */
7932   start_complete_expand_method (mdecl);
7933
7934   /* Install the current this */
7935   current_this = (!METHOD_STATIC (mdecl) ?
7936                   BLOCK_EXPR_DECLS (DECL_FUNCTION_BODY (mdecl)) : NULL_TREE);
7937
7938   /* Purge the `throws' list of unchecked exceptions (we save a copy
7939      of the list and re-install it later.) */
7940   exception_copy = copy_list (DECL_FUNCTION_THROWS (mdecl));
7941   purge_unchecked_exceptions (mdecl);
7942
7943   /* Install exceptions thrown with `throws' */
7944   PUSH_EXCEPTIONS (DECL_FUNCTION_THROWS (mdecl));
7945
7946   if (block_body != NULL_TREE)
7947     {
7948       block_body = java_complete_tree (block_body);
7949
7950       /* Before we check initialization, attached all class initialization
7951          variable to the block_body */
7952       htab_traverse (DECL_FUNCTION_INIT_TEST_TABLE (mdecl),
7953                      attach_init_test_initialization_flags, block_body);
7954
7955       if (! flag_emit_xref && ! METHOD_NATIVE (mdecl))
7956         {
7957           check_for_initialization (block_body, mdecl);
7958
7959           /* Go through all the flags marking the initialization of
7960              static variables and see whether they're definitively
7961              assigned, in which case the type is remembered as
7962              definitively initialized in MDECL. */
7963           if (STATIC_CLASS_INIT_OPT_P ())
7964             {
7965               /* Always register the context as properly initialized in
7966                  MDECL. This used with caution helps removing extra
7967                  initialization of self. */
7968               if (METHOD_STATIC (mdecl))
7969                 {
7970                   *(htab_find_slot
7971                     (DECL_FUNCTION_INITIALIZED_CLASS_TABLE (mdecl),
7972                      DECL_CONTEXT (mdecl), INSERT)) = DECL_CONTEXT (mdecl);
7973                 }
7974             }
7975         }
7976       ctxp->explicit_constructor_p = 0;
7977     }
7978
7979   BLOCK_EXPR_BODY (fbody) = block_body;
7980
7981   /* If we saw a return but couldn't evaluate it properly, we'll have
7982      an error_mark_node here. */
7983   if (block_body != error_mark_node
7984       && (block_body == NULL_TREE || CAN_COMPLETE_NORMALLY (block_body))
7985       && TREE_CODE (TREE_TYPE (TREE_TYPE (mdecl))) != VOID_TYPE
7986       && !flag_emit_xref)
7987     missing_return_error (current_function_decl);
7988
7989   /* See if we can get rid of <clinit> if MDECL happens to be <clinit> */
7990   maybe_yank_clinit (mdecl);
7991
7992   /* Pop the current level, with special measures if we found errors. */
7993   if (java_error_count)
7994     pushdecl_force_head (DECL_ARGUMENTS (mdecl));
7995   poplevel (1, 0, 1);
7996
7997   /* Pop the exceptions and sanity check */
7998   POP_EXCEPTIONS();
7999   if (currently_caught_type_list)
8000     abort ();
8001
8002   /* Restore the copy of the list of exceptions if emitting xrefs. */
8003   DECL_FUNCTION_THROWS (mdecl) = exception_copy;
8004 }
8005
8006 /* For with each class for which there's code to generate. */
8007
8008 static void
8009 java_expand_method_bodies (tree class)
8010 {
8011   tree decl;
8012   for (decl = TYPE_METHODS (class); decl; decl = TREE_CHAIN (decl))
8013     {
8014       if (!DECL_FUNCTION_BODY (decl))
8015         continue;
8016
8017       current_function_decl = decl;
8018
8019       /* Save the function for inlining.  */
8020       if (flag_inline_trees)
8021         DECL_SAVED_TREE (decl) =
8022           BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (decl));
8023
8024       /* It's time to assign the variable flagging static class
8025          initialization based on which classes invoked static methods
8026          are definitely initializing. This should be flagged. */
8027       if (STATIC_CLASS_INIT_OPT_P ())
8028         {
8029           tree list = DECL_FUNCTION_STATIC_METHOD_INVOCATION_COMPOUND (decl);
8030           for (; list != NULL_TREE;  list = TREE_CHAIN (list))
8031             {
8032               /* Executed for each statement calling a static function.
8033                  LIST is a TREE_LIST whose PURPOSE is the called function
8034                  and VALUE is a compound whose second operand can be patched
8035                  with static class initialization flag assignments.  */
8036
8037               tree called_method = TREE_PURPOSE (list);
8038               tree compound = TREE_VALUE (list);
8039               tree assignment_compound_list
8040                 = build_tree_list (called_method, NULL);
8041
8042               /* For each class definitely initialized in
8043                  CALLED_METHOD, fill ASSIGNMENT_COMPOUND with
8044                  assignment to the class initialization flag. */
8045               htab_traverse (DECL_FUNCTION_INITIALIZED_CLASS_TABLE (called_method),
8046                              emit_test_initialization,
8047                              assignment_compound_list);
8048
8049               if (TREE_VALUE (assignment_compound_list))
8050                 TREE_OPERAND (compound, 1)
8051                   = TREE_VALUE (assignment_compound_list);
8052             }
8053         }
8054
8055       /* Prepare the function for RTL expansion */
8056       start_complete_expand_method (decl);
8057
8058       /* Expand function start, generate initialization flag
8059          assignment, and handle synchronized methods. */
8060       complete_start_java_method (decl);
8061
8062       /* Expand the rest of the function body and terminate
8063          expansion. */
8064       source_end_java_method ();
8065     }
8066 }
8067
8068 \f
8069
8070 /* This section of the code deals with accessing enclosing context
8071    fields either directly by using the relevant access to this$<n> or
8072    by invoking an access method crafted for that purpose.  */
8073
8074 /* Build the necessary access from an inner class to an outer
8075    class. This routine could be optimized to cache previous result
8076    (decl, current_class and returned access).  When an access method
8077    needs to be generated, it always takes the form of a read. It might
8078    be later turned into a write by calling outer_field_access_fix.  */
8079
8080 static tree
8081 build_outer_field_access (tree id, tree decl)
8082 {
8083   tree access = NULL_TREE;
8084   tree ctx = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (current_class)));
8085   tree decl_ctx = DECL_CONTEXT (decl);
8086
8087   /* If the immediate enclosing context of the current class is the
8088      field decl's class or inherits from it; build the access as
8089      `this$<n>.<field>'. Note that we will break the `private' barrier
8090      if we're not emitting bytecodes. */
8091   if ((ctx == decl_ctx || inherits_from_p (ctx, decl_ctx))
8092       && (!FIELD_PRIVATE (decl) || !flag_emit_class_files ))
8093     {
8094       tree thisn = build_current_thisn (current_class);
8095       access = make_qualified_primary (build_wfl_node (thisn),
8096                                        id, EXPR_WFL_LINECOL (id));
8097     }
8098   /* Otherwise, generate access methods to outer this and access the
8099      field (either using an access method or by direct access.) */
8100   else
8101     {
8102       int lc = EXPR_WFL_LINECOL (id);
8103
8104       /* Now we chain the required number of calls to the access$0 to
8105          get a hold to the enclosing instance we need, and then we
8106          build the field access. */
8107       access = build_access_to_thisn (current_class, decl_ctx, lc);
8108
8109       /* If the field is private and we're generating bytecode, then
8110          we generate an access method */
8111       if (FIELD_PRIVATE (decl) && flag_emit_class_files )
8112         {
8113           tree name = build_outer_field_access_methods (decl);
8114           access = build_outer_field_access_expr (lc, decl_ctx,
8115                                                   name, access, NULL_TREE);
8116         }
8117       /* Otherwise we use `access$(this$<j>). ... access$(this$<i>).<field>'.
8118          Once again we break the `private' access rule from a foreign
8119          class. */
8120       else
8121         access = make_qualified_primary (access, id, lc);
8122     }
8123   return resolve_expression_name (access, NULL);
8124 }
8125
8126 /* Return a nonzero value if NODE describes an outer field inner
8127    access.  */
8128
8129 static int
8130 outer_field_access_p (tree type, tree decl)
8131 {
8132   if (!INNER_CLASS_TYPE_P (type)
8133       || TREE_CODE (decl) != FIELD_DECL
8134       || DECL_CONTEXT (decl) == type)
8135     return 0;
8136
8137   /* If the inner class extends the declaration context of the field
8138      we're try to acces, then this isn't an outer field access */
8139   if (inherits_from_p (type, DECL_CONTEXT (decl)))
8140     return 0;
8141
8142   for (type = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (type))); ;
8143        type = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (type))))
8144     {
8145       if (type == DECL_CONTEXT (decl))
8146         return 1;
8147
8148       if (!DECL_CONTEXT (TYPE_NAME (type)))
8149         {
8150           /* Before we give up, see whether the field is inherited from
8151              the enclosing context we're considering. */
8152           if (inherits_from_p (type, DECL_CONTEXT (decl)))
8153             return 1;
8154           break;
8155         }
8156     }
8157
8158   return 0;
8159 }
8160
8161 /* Return a nonzero value if NODE represents an outer field inner
8162    access that was been already expanded. As a side effect, it returns
8163    the name of the field being accessed and the argument passed to the
8164    access function, suitable for a regeneration of the access method
8165    call if necessary. */
8166
8167 static int
8168 outer_field_expanded_access_p (tree node, tree *name, tree *arg_type,
8169                                tree *arg)
8170 {
8171   int identified = 0;
8172
8173   if (TREE_CODE (node) != CALL_EXPR)
8174     return 0;
8175
8176   /* Well, gcj generates slightly different tree nodes when compiling
8177      to native or bytecodes. It's the case for function calls. */
8178
8179   if (flag_emit_class_files
8180       && TREE_CODE (node) == CALL_EXPR
8181       && OUTER_FIELD_ACCESS_IDENTIFIER_P (DECL_NAME (TREE_OPERAND (node, 0))))
8182     identified = 1;
8183   else if (!flag_emit_class_files)
8184     {
8185       node = TREE_OPERAND (node, 0);
8186
8187       if (node && TREE_OPERAND (node, 0)
8188           && TREE_CODE (TREE_OPERAND (node, 0)) == ADDR_EXPR)
8189         {
8190           node = TREE_OPERAND (node, 0);
8191           if (TREE_OPERAND (node, 0)
8192               && TREE_CODE (TREE_OPERAND (node, 0)) == FUNCTION_DECL
8193               && (OUTER_FIELD_ACCESS_IDENTIFIER_P
8194                   (DECL_NAME (TREE_OPERAND (node, 0)))))
8195             identified = 1;
8196         }
8197     }
8198
8199   if (identified && name && arg_type && arg)
8200     {
8201       tree argument = TREE_OPERAND (node, 1);
8202       *name = DECL_NAME (TREE_OPERAND (node, 0));
8203       *arg_type = TREE_TYPE (TREE_TYPE (TREE_VALUE (argument)));
8204       *arg = TREE_VALUE (argument);
8205     }
8206   return identified;
8207 }
8208
8209 /* Detect in NODE an outer field read access from an inner class and
8210    transform it into a write with RHS as an argument. This function is
8211    called from the java_complete_lhs when an assignment to a LHS can
8212    be identified. */
8213
8214 static tree
8215 outer_field_access_fix (tree wfl, tree node, tree rhs)
8216 {
8217   tree name, arg_type, arg;
8218
8219   if (outer_field_expanded_access_p (node, &name, &arg_type, &arg))
8220     {
8221       node = build_outer_field_access_expr (EXPR_WFL_LINECOL (wfl),
8222                                             arg_type, name, arg, rhs);
8223       return java_complete_tree (node);
8224     }
8225   return NULL_TREE;
8226 }
8227
8228 /* Construct the expression that calls an access method:
8229      <type>.access$<n>(<arg1> [, <arg2>]);
8230
8231    ARG2 can be NULL and will be omitted in that case. It will denote a
8232    read access.  */
8233
8234 static tree
8235 build_outer_field_access_expr (int lc, tree type, tree access_method_name,
8236                                tree arg1, tree arg2)
8237 {
8238   tree args, cn, access;
8239
8240   args = arg1 ? arg1 :
8241     build_wfl_node (build_current_thisn (current_class));
8242   args = build_tree_list (NULL_TREE, args);
8243
8244   if (arg2)
8245     args = tree_cons (NULL_TREE, arg2, args);
8246
8247   access = build_method_invocation (build_wfl_node (access_method_name), args);
8248   cn = build_wfl_node (DECL_NAME (TYPE_NAME (type)));
8249   return make_qualified_primary (cn, access, lc);
8250 }
8251
8252 static tree
8253 build_new_access_id (void)
8254 {
8255   static int access_n_counter = 1;
8256   char buffer [128];
8257
8258   sprintf (buffer, "access$%d", access_n_counter++);
8259   return get_identifier (buffer);
8260 }
8261
8262 /* Create the static access functions for the outer field DECL. We define a
8263    read:
8264      TREE_TYPE (<field>) access$<n> (DECL_CONTEXT (<field>) inst$) {
8265        return inst$.field;
8266      }
8267    and a write access:
8268      TREE_TYPE (<field>) access$<n> (DECL_CONTEXT (<field>) inst$,
8269                                      TREE_TYPE (<field>) value$) {
8270        return inst$.field = value$;
8271      }
8272    We should have a usage flags on the DECL so we can lazily turn the ones
8273    we're using for code generation. FIXME.
8274 */
8275
8276 static tree
8277 build_outer_field_access_methods (tree decl)
8278 {
8279   tree id, args, stmt, mdecl;
8280
8281   if (FIELD_INNER_ACCESS_P (decl))
8282     return FIELD_INNER_ACCESS (decl);
8283
8284   MAYBE_CREATE_VAR_LANG_DECL_SPECIFIC (decl);
8285
8286   /* Create the identifier and a function named after it. */
8287   id = build_new_access_id ();
8288
8289   /* The identifier is marked as bearing the name of a generated write
8290      access function for outer field accessed from inner classes. */
8291   OUTER_FIELD_ACCESS_IDENTIFIER_P (id) = 1;
8292
8293   /* Create the read access */
8294   args = build_tree_list (inst_id, build_pointer_type (DECL_CONTEXT (decl)));
8295   TREE_CHAIN (args) = end_params_node;
8296   stmt = make_qualified_primary (build_wfl_node (inst_id),
8297                                  build_wfl_node (DECL_NAME (decl)), 0);
8298   stmt = build_return (0, stmt);
8299   mdecl = build_outer_field_access_method (DECL_CONTEXT (decl),
8300                                            TREE_TYPE (decl), id, args, stmt);
8301   DECL_FUNCTION_ACCESS_DECL (mdecl) = decl;
8302
8303   /* Create the write access method. No write access for final variable */
8304   if (!FIELD_FINAL (decl))
8305     {
8306       args = build_tree_list (inst_id,
8307                               build_pointer_type (DECL_CONTEXT (decl)));
8308       TREE_CHAIN (args) = build_tree_list (wpv_id, TREE_TYPE (decl));
8309       TREE_CHAIN (TREE_CHAIN (args)) = end_params_node;
8310       stmt = make_qualified_primary (build_wfl_node (inst_id),
8311                                      build_wfl_node (DECL_NAME (decl)), 0);
8312       stmt = build_return (0, build_assignment (ASSIGN_TK, 0, stmt,
8313                                                 build_wfl_node (wpv_id)));
8314       mdecl = build_outer_field_access_method (DECL_CONTEXT (decl),
8315                                                TREE_TYPE (decl), id,
8316                                                args, stmt);
8317     }
8318   DECL_FUNCTION_ACCESS_DECL (mdecl) = decl;
8319
8320   /* Return the access name */
8321   return FIELD_INNER_ACCESS (decl) = id;
8322 }
8323
8324 /* Build an field access method NAME.  */
8325
8326 static tree
8327 build_outer_field_access_method (tree class, tree type, tree name,
8328                                  tree args, tree body)
8329 {
8330   tree saved_current_function_decl, mdecl;
8331
8332   /* Create the method */
8333   mdecl = create_artificial_method (class, ACC_STATIC, type, name, args);
8334   fix_method_argument_names (args, mdecl);
8335   layout_class_method (class, NULL_TREE, mdecl, NULL_TREE);
8336
8337   /* Attach the method body. */
8338   saved_current_function_decl = current_function_decl;
8339   start_artificial_method_body (mdecl);
8340   java_method_add_stmt (mdecl, body);
8341   end_artificial_method_body (mdecl);
8342   current_function_decl = saved_current_function_decl;
8343
8344   return mdecl;
8345 }
8346
8347 \f
8348 /* This section deals with building access function necessary for
8349    certain kinds of method invocation from inner classes.  */
8350
8351 static tree
8352 build_outer_method_access_method (tree decl)
8353 {
8354   tree saved_current_function_decl, mdecl;
8355   tree args = NULL_TREE, call_args = NULL_TREE;
8356   tree carg, id, body, class;
8357   char buffer [80];
8358   int parm_id_count = 0;
8359
8360   /* Test this abort with an access to a private field */
8361   if (!strcmp (IDENTIFIER_POINTER (DECL_NAME (decl)), "access$"))
8362     abort ();
8363
8364   /* Check the cache first */
8365   if (DECL_FUNCTION_INNER_ACCESS (decl))
8366     return DECL_FUNCTION_INNER_ACCESS (decl);
8367
8368   class = DECL_CONTEXT (decl);
8369
8370   /* Obtain an access identifier and mark it */
8371   id = build_new_access_id ();
8372   OUTER_FIELD_ACCESS_IDENTIFIER_P (id) = 1;
8373
8374   carg = TYPE_ARG_TYPES (TREE_TYPE (decl));
8375   /* Create the arguments, as much as the original */
8376   for (; carg && carg != end_params_node;
8377        carg = TREE_CHAIN (carg))
8378     {
8379       sprintf (buffer, "write_parm_value$%d", parm_id_count++);
8380       args = chainon (args, build_tree_list (get_identifier (buffer),
8381                                              TREE_VALUE (carg)));
8382     }
8383   args = chainon (args, end_params_node);
8384
8385   /* Create the method */
8386   mdecl = create_artificial_method (class, ACC_STATIC,
8387                                     TREE_TYPE (TREE_TYPE (decl)), id, args);
8388   layout_class_method (class, NULL_TREE, mdecl, NULL_TREE);
8389   /* There is a potential bug here. We should be able to use
8390      fix_method_argument_names, but then arg names get mixed up and
8391      eventually a constructor will have its this$0 altered and the
8392      outer context won't be assignment properly. The test case is
8393      stub.java FIXME */
8394   TYPE_ARG_TYPES (TREE_TYPE (mdecl)) = args;
8395
8396   /* Attach the method body. */
8397   saved_current_function_decl = current_function_decl;
8398   start_artificial_method_body (mdecl);
8399
8400   /* The actual method invocation uses the same args. When invoking a
8401      static methods that way, we don't want to skip the first
8402      argument. */
8403   carg = args;
8404   if (!METHOD_STATIC (decl))
8405     carg = TREE_CHAIN (carg);
8406   for (; carg && carg != end_params_node; carg = TREE_CHAIN (carg))
8407     call_args = tree_cons (NULL_TREE, build_wfl_node (TREE_PURPOSE (carg)),
8408                            call_args);
8409
8410   body = build_method_invocation (build_wfl_node (DECL_NAME (decl)),
8411                                   call_args);
8412   if (!METHOD_STATIC (decl))
8413     body = make_qualified_primary (build_wfl_node (TREE_PURPOSE (args)),
8414                                    body, 0);
8415   if (TREE_TYPE (TREE_TYPE (decl)) != void_type_node)
8416     body = build_return (0, body);
8417   java_method_add_stmt (mdecl,body);
8418   end_artificial_method_body (mdecl);
8419   current_function_decl = saved_current_function_decl;
8420
8421   /* Back tag the access function so it know what it accesses */
8422   DECL_FUNCTION_ACCESS_DECL (decl) = mdecl;
8423
8424   /* Tag the current method so it knows it has an access generated */
8425   return DECL_FUNCTION_INNER_ACCESS (decl) = mdecl;
8426 }
8427
8428 \f
8429 /* This section of the code deals with building expressions to access
8430    the enclosing instance of an inner class. The enclosing instance is
8431    kept in a generated field called this$<n>, with <n> being the
8432    inner class nesting level (starting from 0.)  */
8433
8434 /* Build an access to a given this$<n>, always chaining access call to
8435    others. Access methods to this$<n> are build on the fly if
8436    necessary. This CAN'T be used to solely access this$<n-1> from
8437    this$<n> (which alway yield to special cases and optimization, see
8438    for example build_outer_field_access).  */
8439
8440 static tree
8441 build_access_to_thisn (tree from, tree to, int lc)
8442 {
8443   tree access = NULL_TREE;
8444
8445   while (from != to && PURE_INNER_CLASS_TYPE_P (from))
8446     {
8447       if (!access)
8448         {
8449           access = build_current_thisn (from);
8450           access = build_wfl_node (access);
8451         }
8452       else
8453         {
8454           tree access0_wfl, cn;
8455
8456           maybe_build_thisn_access_method (from);
8457           access0_wfl = build_wfl_node (access0_identifier_node);
8458           cn = build_wfl_node (DECL_NAME (TYPE_NAME (from)));
8459           EXPR_WFL_LINECOL (access0_wfl) = lc;
8460           access = build_tree_list (NULL_TREE, access);
8461           access = build_method_invocation (access0_wfl, access);
8462           access = make_qualified_primary (cn, access, lc);
8463         }
8464
8465       /* If FROM isn't an inner class, that's fine, we've done enough.
8466          What we're looking for can be accessed from there.  */
8467       from = DECL_CONTEXT (TYPE_NAME (from));
8468       if (!from)
8469         break;
8470       from = TREE_TYPE (from);
8471     }
8472   return access;
8473 }
8474
8475 /* Build an access function to the this$<n> local to TYPE. NULL_TREE
8476    is returned if nothing needs to be generated. Otherwise, the method
8477    generated and a method decl is returned.
8478
8479    NOTE: These generated methods should be declared in a class file
8480    attribute so that they can't be referred to directly.  */
8481
8482 static tree
8483 maybe_build_thisn_access_method (tree type)
8484 {
8485   tree mdecl, args, stmt, rtype;
8486   tree saved_current_function_decl;
8487
8488   /* If TYPE is a top-level class, no access method is required.
8489      If there already is such an access method, bail out. */
8490   if (CLASS_ACCESS0_GENERATED_P (type) || !PURE_INNER_CLASS_TYPE_P (type))
8491     return NULL_TREE;
8492
8493   /* We generate the method. The method looks like:
8494      static <outer_of_type> access$0 (<type> inst$) { return inst$.this$<n>; }
8495   */
8496   args = build_tree_list (inst_id, build_pointer_type (type));
8497   TREE_CHAIN (args) = end_params_node;
8498   rtype = build_pointer_type (TREE_TYPE (DECL_CONTEXT (TYPE_NAME (type))));
8499   mdecl = create_artificial_method (type, ACC_STATIC, rtype,
8500                                     access0_identifier_node, args);
8501   fix_method_argument_names (args, mdecl);
8502   layout_class_method (type, NULL_TREE, mdecl, NULL_TREE);
8503   stmt = build_current_thisn (type);
8504   stmt = make_qualified_primary (build_wfl_node (inst_id),
8505                                  build_wfl_node (stmt), 0);
8506   stmt = build_return (0, stmt);
8507
8508   saved_current_function_decl = current_function_decl;
8509   start_artificial_method_body (mdecl);
8510   java_method_add_stmt (mdecl, stmt);
8511   end_artificial_method_body (mdecl);
8512   current_function_decl = saved_current_function_decl;
8513
8514   CLASS_ACCESS0_GENERATED_P (type) = 1;
8515
8516   return mdecl;
8517 }
8518
8519 /* Craft an correctly numbered `this$<n>'string. this$0 is used for
8520    the first level of innerclassing. this$1 for the next one, etc...
8521    This function can be invoked with TYPE to NULL, available and then
8522    has to count the parser context.  */
8523
8524 static GTY(()) tree saved_thisn;
8525 static GTY(()) tree saved_type;
8526
8527 static tree
8528 build_current_thisn (tree type)
8529 {
8530   static int saved_i = -1;
8531   static int saved_type_i = 0;
8532   tree decl;
8533   char buffer [24];
8534   int i = 0;
8535
8536   if (type)
8537     {
8538       if (type == saved_type)
8539         i = saved_type_i;
8540       else
8541         {
8542           for (i = -1, decl = DECL_CONTEXT (TYPE_NAME (type));
8543                decl; decl = DECL_CONTEXT (decl), i++)
8544             ;
8545
8546           saved_type = type;
8547           saved_type_i = i;
8548         }
8549     }
8550   else
8551     i = list_length (GET_CPC_LIST ())-2;
8552
8553   if (i == saved_i)
8554     return saved_thisn;
8555
8556   sprintf (buffer, "this$%d", i);
8557   saved_i = i;
8558   saved_thisn = get_identifier (buffer);
8559   return saved_thisn;
8560 }
8561
8562 /* Return the assignement to the hidden enclosing context `this$<n>'
8563    by the second incoming parameter to the innerclass constructor. The
8564    form used is `this.this$<n> = this$<n>;'.  */
8565
8566 static tree
8567 build_thisn_assign (void)
8568 {
8569   if (current_class && PURE_INNER_CLASS_TYPE_P (current_class))
8570     {
8571       tree thisn = build_current_thisn (current_class);
8572       tree lhs = make_qualified_primary (build_wfl_node (this_identifier_node),
8573                                          build_wfl_node (thisn), 0);
8574       tree rhs = build_wfl_node (thisn);
8575       EXPR_WFL_SET_LINECOL (lhs, input_line, 0);
8576       return build_assignment (ASSIGN_TK, EXPR_WFL_LINECOL (lhs), lhs, rhs);
8577     }
8578   return NULL_TREE;
8579 }
8580
8581 \f
8582 /* Building the synthetic `class$' used to implement the `.class' 1.1
8583    extension for non primitive types. This method looks like:
8584
8585     static Class class$(String type) throws NoClassDefFoundError
8586     {
8587       try {return (java.lang.Class.forName (String));}
8588       catch (ClassNotFoundException e) {
8589         throw new NoClassDefFoundError(e.getMessage());}
8590     } */
8591
8592 static GTY(()) tree get_message_wfl;
8593 static GTY(()) tree type_parm_wfl;
8594
8595 static tree
8596 build_dot_class_method (tree class)
8597 {
8598 #define BWF(S) build_wfl_node (get_identifier ((S)))
8599 #define MQN(X,Y) make_qualified_name ((X), (Y), 0)
8600   tree args, tmp, saved_current_function_decl, mdecl;
8601   tree stmt, throw_stmt;
8602
8603   if (!get_message_wfl)
8604     {
8605       get_message_wfl = build_wfl_node (get_identifier ("getMessage"));
8606       type_parm_wfl = build_wfl_node (get_identifier ("type$"));
8607     }
8608
8609   /* Build the arguments */
8610   args = build_tree_list (get_identifier ("type$"),
8611                           build_pointer_type (string_type_node));
8612   TREE_CHAIN (args) = end_params_node;
8613
8614   /* Build the qualified name java.lang.Class.forName */
8615   tmp = MQN (MQN (MQN (BWF ("java"),
8616                        BWF ("lang")), BWF ("Class")), BWF ("forName"));
8617   load_class (class_not_found_type_node, 1);
8618   load_class (no_class_def_found_type_node, 1);
8619
8620   /* Create the "class$" function */
8621   mdecl = create_artificial_method (class, ACC_STATIC,
8622                                     build_pointer_type (class_type_node),
8623                                     classdollar_identifier_node, args);
8624   DECL_FUNCTION_THROWS (mdecl) =
8625     build_tree_list (NULL_TREE, no_class_def_found_type_node);
8626
8627   /* We start by building the try block. We need to build:
8628        return (java.lang.Class.forName (type)); */
8629   stmt = build_method_invocation (tmp,
8630                                   build_tree_list (NULL_TREE, type_parm_wfl));
8631   stmt = build_return (0, stmt);
8632
8633   /* Now onto the catch block. We start by building the expression
8634      throwing a new exception: throw new NoClassDefFoundError (_.getMessage) */
8635   throw_stmt = make_qualified_name (build_wfl_node (wpv_id),
8636                                     get_message_wfl, 0);
8637   throw_stmt = build_method_invocation (throw_stmt, NULL_TREE);
8638
8639   /* Build new NoClassDefFoundError (_.getMessage) */
8640   throw_stmt = build_new_invocation
8641     (build_wfl_node (get_identifier ("NoClassDefFoundError")),
8642      build_tree_list (build_pointer_type (string_type_node), throw_stmt));
8643
8644   /* Build the throw, (it's too early to use BUILD_THROW) */
8645   throw_stmt = build1 (THROW_EXPR, NULL_TREE, throw_stmt);
8646
8647   /* Encapsulate STMT in a try block. The catch clause executes THROW_STMT */
8648   stmt = encapsulate_with_try_catch (0, class_not_found_type_node,
8649                                      stmt, throw_stmt);
8650
8651   fix_method_argument_names (args, mdecl);
8652   layout_class_method (class, NULL_TREE, mdecl, NULL_TREE);
8653   saved_current_function_decl = current_function_decl;
8654   start_artificial_method_body (mdecl);
8655   java_method_add_stmt (mdecl, stmt);
8656   end_artificial_method_body (mdecl);
8657   current_function_decl = saved_current_function_decl;
8658   TYPE_DOT_CLASS (class) = mdecl;
8659
8660   return mdecl;
8661 }
8662
8663 static tree
8664 build_dot_class_method_invocation (tree type)
8665 {
8666   tree sig_id, s;
8667
8668   if (TYPE_ARRAY_P (type))
8669     sig_id = build_java_signature (type);
8670   else
8671     sig_id = DECL_NAME (TYPE_NAME (type));
8672
8673   /* Ensure that the proper name separator is used */
8674   sig_id = unmangle_classname (IDENTIFIER_POINTER (sig_id),
8675                                IDENTIFIER_LENGTH (sig_id));
8676
8677   s = build_string (IDENTIFIER_LENGTH (sig_id),
8678                     IDENTIFIER_POINTER (sig_id));
8679   return build_method_invocation (build_wfl_node (classdollar_identifier_node),
8680                                   build_tree_list (NULL_TREE, s));
8681 }
8682
8683 /* This section of the code deals with constructor.  */
8684
8685 /* Craft a body for default constructor. Patch existing constructor
8686    bodies with call to super() and field initialization statements if
8687    necessary.  */
8688
8689 static void
8690 fix_constructors (tree mdecl)
8691 {
8692   tree iii;                     /* Instance Initializer Invocation */
8693   tree body = DECL_FUNCTION_BODY (mdecl);
8694   tree thisn_assign, compound = NULL_TREE;
8695   tree class_type = DECL_CONTEXT (mdecl);
8696
8697   if (DECL_FIXED_CONSTRUCTOR_P (mdecl))
8698     return;
8699   DECL_FIXED_CONSTRUCTOR_P (mdecl) = 1;
8700
8701   if (!body)
8702     {
8703       /* It is an error for the compiler to generate a default
8704          constructor if the superclass doesn't have a constructor that
8705          takes no argument, or the same args for an anonymous class */
8706       if (verify_constructor_super (mdecl))
8707         {
8708           tree sclass_decl = TYPE_NAME (CLASSTYPE_SUPER (class_type));
8709           tree save = DECL_NAME (mdecl);
8710           const char *n = IDENTIFIER_POINTER (DECL_NAME (sclass_decl));
8711           DECL_NAME (mdecl) = DECL_NAME (sclass_decl);
8712           parse_error_context
8713             (lookup_cl (TYPE_NAME (class_type)),
8714              "No constructor matching `%s' found in class `%s'",
8715              lang_printable_name (mdecl, 0), n);
8716           DECL_NAME (mdecl) = save;
8717         }
8718
8719       /* The constructor body must be crafted by hand. It's the
8720          constructor we defined when we realize we didn't have the
8721          CLASSNAME() constructor */
8722       start_artificial_method_body (mdecl);
8723
8724       /* Insert an assignment to the this$<n> hidden field, if
8725          necessary */
8726       if ((thisn_assign = build_thisn_assign ()))
8727         java_method_add_stmt (mdecl, thisn_assign);
8728
8729       /* We don't generate a super constructor invocation if we're
8730          compiling java.lang.Object. build_super_invocation takes care
8731          of that. */
8732       java_method_add_stmt (mdecl, build_super_invocation (mdecl));
8733
8734       /* FIXME */
8735       if ((iii = build_instinit_invocation (class_type)))
8736         java_method_add_stmt (mdecl, iii);
8737
8738       end_artificial_method_body (mdecl);
8739     }
8740   /* Search for an explicit constructor invocation */
8741   else
8742     {
8743       int found = 0;
8744       int invokes_this = 0;
8745       tree found_call = NULL_TREE;
8746       tree main_block = BLOCK_EXPR_BODY (body);
8747
8748       while (body)
8749         switch (TREE_CODE (body))
8750           {
8751           case CALL_EXPR:
8752             found = CALL_EXPLICIT_CONSTRUCTOR_P (body);
8753             if (CALL_THIS_CONSTRUCTOR_P (body))
8754               invokes_this = 1;
8755             body = NULL_TREE;
8756             break;
8757           case COMPOUND_EXPR:
8758           case EXPR_WITH_FILE_LOCATION:
8759             found_call = body;
8760             body = TREE_OPERAND (body, 0);
8761             break;
8762           case BLOCK:
8763             found_call = body;
8764             body = BLOCK_EXPR_BODY (body);
8765             break;
8766           default:
8767             found = 0;
8768             body = NULL_TREE;
8769           }
8770
8771       /* Generate the assignment to this$<n>, if necessary */
8772       if ((thisn_assign = build_thisn_assign ()))
8773         compound = add_stmt_to_compound (compound, NULL_TREE, thisn_assign);
8774
8775       /* The constructor is missing an invocation of super() */
8776       if (!found)
8777         compound = add_stmt_to_compound (compound, NULL_TREE,
8778                                          build_super_invocation (mdecl));
8779       /* Explicit super() invokation should take place before the
8780          instance initializer blocks. */
8781       else
8782         {
8783           compound = add_stmt_to_compound (compound, NULL_TREE,
8784                                            TREE_OPERAND (found_call, 0));
8785           TREE_OPERAND (found_call, 0) = empty_stmt_node;
8786         }
8787
8788       DECL_INIT_CALLS_THIS (mdecl) = invokes_this;
8789
8790       /* Insert the instance initializer block right after. */
8791       if (!invokes_this && (iii = build_instinit_invocation (class_type)))
8792         compound = add_stmt_to_compound (compound, NULL_TREE, iii);
8793
8794       /* Fix the constructor main block if we're adding extra stmts */
8795       if (compound)
8796         {
8797           compound = add_stmt_to_compound (compound, NULL_TREE,
8798                                            BLOCK_EXPR_BODY (main_block));
8799           BLOCK_EXPR_BODY (main_block) = compound;
8800         }
8801     }
8802 }
8803
8804 /* Browse constructors in the super class, searching for a constructor
8805    that doesn't take any argument. Return 0 if one is found, 1
8806    otherwise.  If the current class is an anonymous inner class, look
8807    for something that has the same signature. */
8808
8809 static int
8810 verify_constructor_super (tree mdecl)
8811 {
8812   tree class = CLASSTYPE_SUPER (current_class);
8813   int super_inner = PURE_INNER_CLASS_TYPE_P (class);
8814   tree sdecl;
8815
8816   if (!class)
8817     return 0;
8818
8819   if (ANONYMOUS_CLASS_P (current_class))
8820     {
8821       tree mdecl_arg_type;
8822       SKIP_THIS_AND_ARTIFICIAL_PARMS (mdecl_arg_type, mdecl);
8823       for (sdecl = TYPE_METHODS (class); sdecl; sdecl = TREE_CHAIN (sdecl))
8824         if (DECL_CONSTRUCTOR_P (sdecl))
8825           {
8826             tree m_arg_type;
8827             tree arg_type = TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (sdecl)));
8828             if (super_inner)
8829               arg_type = TREE_CHAIN (arg_type);
8830             for (m_arg_type = mdecl_arg_type;
8831                  (arg_type != end_params_node
8832                   && m_arg_type != end_params_node);
8833                  arg_type = TREE_CHAIN (arg_type),
8834                    m_arg_type = TREE_CHAIN (m_arg_type))
8835               if (!valid_method_invocation_conversion_p
8836                      (TREE_VALUE (arg_type),
8837                       TREE_VALUE (m_arg_type)))
8838                 break;
8839
8840             if (arg_type == end_params_node && m_arg_type == end_params_node)
8841               return 0;
8842           }
8843     }
8844   else
8845     {
8846       for (sdecl = TYPE_METHODS (class); sdecl; sdecl = TREE_CHAIN (sdecl))
8847         {
8848           tree arg = TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (sdecl)));
8849           if (super_inner)
8850             arg = TREE_CHAIN (arg);
8851           if (DECL_CONSTRUCTOR_P (sdecl) && arg == end_params_node)
8852             return 0;
8853         }
8854     }
8855   return 1;
8856 }
8857
8858 /* Generate code for all context remembered for code generation.  */
8859
8860 static GTY(()) tree reversed_class_list;
8861 void
8862 java_expand_classes (void)
8863 {
8864   int save_error_count = 0;
8865   static struct parser_ctxt *cur_ctxp = NULL;
8866
8867   java_parse_abort_on_error ();
8868   if (!(ctxp = ctxp_for_generation))
8869     return;
8870   java_layout_classes ();
8871   java_parse_abort_on_error ();
8872
8873   for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
8874     {
8875       ctxp = cur_ctxp;
8876       input_filename = ctxp->filename;
8877       lang_init_source (2);            /* Error msgs have method prototypes */
8878       java_complete_expand_classes (); /* Complete and expand classes */
8879       java_parse_abort_on_error ();
8880     }
8881   input_filename = main_input_filename;
8882
8883
8884   /* Find anonymous classes and expand their constructor. This extra pass is
8885      neccessary because the constructor itself is only generated when the
8886      method in which it is defined is expanded. */
8887   for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
8888     {
8889       tree current;
8890       ctxp = cur_ctxp;
8891       for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
8892         {
8893           current_class = TREE_TYPE (current);
8894           if (ANONYMOUS_CLASS_P (current_class))
8895             {
8896               tree d;
8897               for (d = TYPE_METHODS (current_class); d; d = TREE_CHAIN (d))
8898                 {
8899                   if (DECL_CONSTRUCTOR_P (d))
8900                     {
8901                       restore_line_number_status (1);
8902                       java_complete_expand_method (d);
8903                       restore_line_number_status (0);
8904                       break;    /* There is only one constructor. */
8905                     }
8906                 }
8907             }
8908         }
8909     }
8910
8911   /* Expanding the constructors of anonymous classes generates access
8912      methods.  Scan all the methods looking for null DECL_RESULTs --
8913      this will be the case if a method hasn't been expanded.  */
8914   for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
8915     {
8916       tree current;
8917       ctxp = cur_ctxp;
8918       for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
8919         {
8920           tree d;
8921           current_class = TREE_TYPE (current);
8922           for (d = TYPE_METHODS (current_class); d; d = TREE_CHAIN (d))
8923             {
8924               if (DECL_RESULT (d) == NULL_TREE)
8925                 {
8926                   restore_line_number_status (1);
8927                   java_complete_expand_method (d);
8928                   restore_line_number_status (0);
8929                 }
8930             }
8931         }
8932     }
8933
8934   /* ???  Instead of all this we could iterate around the list of
8935      classes until there were no more un-expanded methods.  It would
8936      take a little longer -- one pass over the whole list of methods
8937      -- but it would be simpler.  Like this:  */
8938 #if 0
8939     {
8940       int something_changed;
8941
8942       do
8943         {
8944           something_changed = 0;
8945           for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
8946             {
8947               tree current;
8948               ctxp = cur_ctxp;
8949               for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
8950                 {
8951                   tree d;
8952                   current_class = TREE_TYPE (current);
8953                   for (d = TYPE_METHODS (current_class); d; d = TREE_CHAIN (d))
8954                     {
8955                       if (DECL_RESULT (d) == NULL_TREE)
8956                         {
8957                           something_changed = 1;
8958                           restore_line_number_status (1);
8959                           java_complete_expand_method (d);
8960                           restore_line_number_status (0);
8961                         }
8962                     }
8963                 }
8964             }
8965         }
8966       while (something_changed);
8967     }
8968 #endif
8969
8970   /* If we've found error at that stage, don't try to generate
8971      anything, unless we're emitting xrefs or checking the syntax only
8972      (but not using -fsyntax-only for the purpose of generating
8973      bytecode. */
8974   if (java_error_count && !flag_emit_xref
8975       && (!flag_syntax_only && !flag_emit_class_files))
8976     return;
8977
8978   /* Now things are stable, go for generation of the class data. */
8979
8980   /* We pessimistically marked all methods and fields external until
8981      we knew what set of classes we were planning to compile.  Now mark
8982      those that will be generated locally as not external.  */
8983   for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
8984     {
8985       tree current;
8986       ctxp = cur_ctxp;
8987       for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
8988         java_mark_class_local (TREE_TYPE (current));
8989     }
8990
8991   /* Compile the classes.  */
8992   for (cur_ctxp = ctxp_for_generation; cur_ctxp; cur_ctxp = cur_ctxp->next)
8993     {
8994       tree current;
8995       reversed_class_list = NULL;
8996
8997       ctxp = cur_ctxp;
8998
8999       /* We write out the classes in reverse order.  This ensures that
9000          inner classes are written before their containing classes,
9001          which is important for parallel builds.  Otherwise, the
9002          class file for the outer class may be found, but the class
9003          file for the inner class may not be present.  In that
9004          situation, the compiler cannot fall back to the original
9005          source, having already read the outer class, so we must
9006          prevent that situation.  */
9007       for (current = ctxp->class_list;
9008            current;
9009            current = TREE_CHAIN (current))
9010         reversed_class_list
9011           = tree_cons (NULL_TREE, current, reversed_class_list);
9012
9013       for (current = reversed_class_list;
9014            current;
9015            current = TREE_CHAIN (current))
9016         {
9017           current_class = TREE_TYPE (TREE_VALUE (current));
9018           outgoing_cpool = TYPE_CPOOL (current_class);
9019           if (flag_emit_class_files)
9020             write_classfile (current_class);
9021           if (flag_emit_xref)
9022             expand_xref (current_class);
9023           else if (! flag_syntax_only)
9024             {
9025               java_expand_method_bodies (current_class);
9026               finish_class ();
9027             }
9028         }
9029     }
9030 }
9031
9032 /* Wrap non WFL PRIMARY around a WFL and set EXPR_WFL_QUALIFICATION to
9033    a tree list node containing RIGHT. Fore coming RIGHTs will be
9034    chained to this hook. LOCATION contains the location of the
9035    separating `.' operator.  */
9036
9037 static tree
9038 make_qualified_primary (tree primary, tree right, int location)
9039 {
9040   tree wfl;
9041
9042   if (TREE_CODE (primary) != EXPR_WITH_FILE_LOCATION)
9043     wfl = build_wfl_wrap (primary, location);
9044   else
9045     {
9046       wfl = primary;
9047       /* If wfl wasn't qualified, we build a first anchor */
9048       if (!EXPR_WFL_QUALIFICATION (wfl))
9049         EXPR_WFL_QUALIFICATION (wfl) = build_tree_list (wfl, NULL_TREE);
9050     }
9051
9052   /* And chain them */
9053   EXPR_WFL_LINECOL (right) = location;
9054   chainon (EXPR_WFL_QUALIFICATION (wfl), build_tree_list (right, NULL_TREE));
9055   PRIMARY_P (wfl) =  1;
9056   return wfl;
9057 }
9058
9059 /* Simple merge of two name separated by a `.' */
9060
9061 static tree
9062 merge_qualified_name (tree left, tree right)
9063 {
9064   tree node;
9065   if (!left && !right)
9066     return NULL_TREE;
9067
9068   if (!left)
9069     return right;
9070
9071   if (!right)
9072     return left;
9073
9074   obstack_grow (&temporary_obstack, IDENTIFIER_POINTER (left),
9075                 IDENTIFIER_LENGTH (left));
9076   obstack_1grow (&temporary_obstack, '.');
9077   obstack_grow0 (&temporary_obstack, IDENTIFIER_POINTER (right),
9078                  IDENTIFIER_LENGTH (right));
9079   node =  get_identifier (obstack_base (&temporary_obstack));
9080   obstack_free (&temporary_obstack, obstack_base (&temporary_obstack));
9081   QUALIFIED_P (node) = 1;
9082   return node;
9083 }
9084
9085 /* Merge the two parts of a qualified name into LEFT.  Set the
9086    location information of the resulting node to LOCATION, usually
9087    inherited from the location information of the `.' operator. */
9088
9089 static tree
9090 make_qualified_name (tree left, tree right, int location)
9091 {
9092 #ifdef USE_COMPONENT_REF
9093   tree node = build (COMPONENT_REF, NULL_TREE, left, right);
9094   EXPR_WFL_LINECOL (node) = location;
9095   return node;
9096 #else
9097   tree left_id = EXPR_WFL_NODE (left);
9098   tree right_id = EXPR_WFL_NODE (right);
9099   tree wfl, merge;
9100
9101   merge = merge_qualified_name (left_id, right_id);
9102
9103   /* Left wasn't qualified and is now qualified */
9104   if (!QUALIFIED_P (left_id))
9105     {
9106       tree wfl = build_expr_wfl (left_id, ctxp->filename, 0, 0);
9107       EXPR_WFL_LINECOL (wfl) = EXPR_WFL_LINECOL (left);
9108       EXPR_WFL_QUALIFICATION (left) = build_tree_list (wfl, NULL_TREE);
9109     }
9110
9111   wfl = build_expr_wfl (right_id, ctxp->filename, 0, 0);
9112   EXPR_WFL_LINECOL (wfl) = location;
9113   chainon (EXPR_WFL_QUALIFICATION (left), build_tree_list (wfl, NULL_TREE));
9114
9115   EXPR_WFL_NODE (left) = merge;
9116   return left;
9117 #endif
9118 }
9119
9120 /* Extract the last identifier component of the qualified in WFL. The
9121    last identifier is removed from the linked list */
9122
9123 static tree
9124 cut_identifier_in_qualified (tree wfl)
9125 {
9126   tree q;
9127   tree previous = NULL_TREE;
9128   for (q = EXPR_WFL_QUALIFICATION (wfl); ; previous = q, q = TREE_CHAIN (q))
9129     if (!TREE_CHAIN (q))
9130       {
9131         if (!previous)
9132           /* Operating on a non qualified qualified WFL.  */
9133           abort ();
9134
9135         TREE_CHAIN (previous) = NULL_TREE;
9136         return TREE_PURPOSE (q);
9137       }
9138 }
9139
9140 /* Resolve the expression name NAME. Return its decl.  */
9141
9142 static tree
9143 resolve_expression_name (tree id, tree *orig)
9144 {
9145   tree name = EXPR_WFL_NODE (id);
9146   tree decl;
9147
9148   /* 6.5.5.1: Simple expression names */
9149   if (!PRIMARY_P (id) && !QUALIFIED_P (name))
9150     {
9151       /* 15.13.1: NAME can appear within the scope of a local variable
9152          declaration */
9153       if ((decl = IDENTIFIER_LOCAL_VALUE (name)))
9154         return decl;
9155
9156       /* 15.13.1: NAME can appear within a class declaration */
9157       else
9158         {
9159           decl = lookup_field_wrapper (current_class, name);
9160           if (decl)
9161             {
9162               tree access = NULL_TREE;
9163               int fs = FIELD_STATIC (decl);
9164
9165               /* If we're accessing an outer scope local alias, make
9166                  sure we change the name of the field we're going to
9167                  build access to. */
9168               if (FIELD_LOCAL_ALIAS_USED (decl))
9169                 name = DECL_NAME (decl);
9170
9171               check_deprecation (id, decl);
9172
9173               /* Instance variable (8.3.1.1) can't appear within
9174                  static method, static initializer or initializer for
9175                  a static variable. */
9176               if (!fs && METHOD_STATIC (current_function_decl))
9177                 {
9178                   static_ref_err (id, name, current_class);
9179                   return error_mark_node;
9180                 }
9181               /* Instance variables can't appear as an argument of
9182                  an explicit constructor invocation */
9183               if (!fs && ctxp->explicit_constructor_p
9184                   && !enclosing_context_p (DECL_CONTEXT (decl), current_class))
9185                 {
9186                   parse_error_context
9187                     (id, "Can't reference `%s' before the superclass constructor has been called", IDENTIFIER_POINTER (name));
9188                   return error_mark_node;
9189                 }
9190
9191               /* If we're processing an inner class and we're trying
9192                  to access a field belonging to an outer class, build
9193                  the access to the field */
9194               if (!fs && outer_field_access_p (current_class, decl))
9195                 {
9196                   if (CLASS_STATIC (TYPE_NAME (current_class)))
9197                     {
9198                       static_ref_err (id, DECL_NAME (decl), current_class);
9199                       return error_mark_node;
9200                     }
9201                   access = build_outer_field_access (id, decl);
9202                   if (orig)
9203                     *orig = access;
9204                   return access;
9205                 }
9206
9207               /* Otherwise build what it takes to access the field */
9208               access = build_field_ref ((fs ? NULL_TREE : current_this),
9209                                         DECL_CONTEXT (decl), name);
9210               if (fs)
9211                 access = maybe_build_class_init_for_field (decl, access);
9212               /* We may be asked to save the real field access node */
9213               if (orig)
9214                 *orig = access;
9215               /* And we return what we got */
9216               return access;
9217             }
9218           /* Fall down to error report on undefined variable */
9219         }
9220     }
9221   /* 6.5.5.2 Qualified Expression Names */
9222   else
9223     {
9224       if (orig)
9225         *orig = NULL_TREE;
9226       qualify_ambiguous_name (id);
9227       /* 15.10.1 Field Access Using a Primary and/or Expression Name */
9228       /* 15.10.2: Accessing Superclass Members using super */
9229       return resolve_field_access (id, orig, NULL);
9230     }
9231
9232   /* We've got an error here */
9233   if (INNER_CLASS_TYPE_P (current_class))
9234     parse_error_context (id,
9235                          "Local variable `%s' can't be accessed from within the inner class `%s' unless it is declared final",
9236                          IDENTIFIER_POINTER (name),
9237                          IDENTIFIER_POINTER (DECL_NAME
9238                                              (TYPE_NAME (current_class))));
9239   else
9240     parse_error_context (id, "Undefined variable `%s'",
9241                          IDENTIFIER_POINTER (name));
9242
9243   return error_mark_node;
9244 }
9245
9246 static void
9247 static_ref_err (tree wfl, tree field_id, tree class_type)
9248 {
9249   parse_error_context
9250     (wfl,
9251      "Can't make a static reference to nonstatic variable `%s' in class `%s'",
9252      IDENTIFIER_POINTER (field_id),
9253      IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (class_type))));
9254 }
9255
9256 /* 15.10.1 Field Access Using a Primary and/or Expression Name.
9257    We return something suitable to generate the field access. We also
9258    return the field decl in FIELD_DECL and its type in FIELD_TYPE.  If
9259    recipient's address can be null. */
9260
9261 static tree
9262 resolve_field_access (tree qual_wfl, tree *field_decl, tree *field_type)
9263 {
9264   int is_static = 0;
9265   tree field_ref;
9266   tree decl, where_found, type_found;
9267
9268   if (resolve_qualified_expression_name (qual_wfl, &decl,
9269                                          &where_found, &type_found))
9270     return error_mark_node;
9271
9272   /* Resolve the LENGTH field of an array here */
9273   if (DECL_P (decl) && DECL_NAME (decl) == length_identifier_node
9274       && type_found && TYPE_ARRAY_P (type_found)
9275       && ! flag_emit_class_files && ! flag_emit_xref)
9276     {
9277       tree length = build_java_array_length_access (where_found);
9278       field_ref = length;
9279
9280       /* In case we're dealing with a static array, we need to
9281          initialize its class before the array length can be fetched.
9282          It's also a good time to create a DECL_RTL for the field if
9283          none already exists, otherwise if the field was declared in a
9284          class found in an external file and hasn't been (and won't
9285          be) accessed for its value, none will be created. */
9286       if (TREE_CODE (where_found) == VAR_DECL && FIELD_STATIC (where_found))
9287         {
9288           build_static_field_ref (where_found);
9289           field_ref = build_class_init (DECL_CONTEXT (where_found), field_ref);
9290         }
9291     }
9292   /* We might have been trying to resolve field.method(). In which
9293      case, the resolution is over and decl is the answer */
9294   else if (JDECL_P (decl) && IDENTIFIER_LOCAL_VALUE (DECL_NAME (decl)) == decl)
9295     field_ref = decl;
9296   else if (JDECL_P (decl))
9297     {
9298       if (!type_found)
9299         type_found = DECL_CONTEXT (decl);
9300       is_static = FIELD_STATIC (decl);
9301       field_ref = build_field_ref ((is_static && !flag_emit_xref?
9302                                     NULL_TREE : where_found),
9303                                    type_found, DECL_NAME (decl));
9304       if (field_ref == error_mark_node)
9305         return error_mark_node;
9306       if (is_static)
9307         field_ref = maybe_build_class_init_for_field (decl, field_ref);
9308
9309       /* If we're looking at a static field, we may need to generate a
9310          class initialization for it.  This can happen when the access
9311          looks like `field.ref', where `field' is a static field in an
9312          interface we implement.  */
9313       if (!flag_emit_class_files
9314           && !flag_emit_xref
9315           && TREE_CODE (where_found) == VAR_DECL
9316           && FIELD_STATIC (where_found))
9317         {
9318           build_static_field_ref (where_found);
9319           field_ref = build_class_init (DECL_CONTEXT (where_found), field_ref);
9320         }
9321     }
9322   else
9323     field_ref = decl;
9324
9325   if (field_decl)
9326     *field_decl = decl;
9327   if (field_type)
9328     *field_type = (QUAL_DECL_TYPE (decl) ?
9329                    QUAL_DECL_TYPE (decl) : TREE_TYPE (decl));
9330   return field_ref;
9331 }
9332
9333 /* If NODE is an access to f static field, strip out the class
9334    initialization part and return the field decl, otherwise, return
9335    NODE. */
9336
9337 static tree
9338 strip_out_static_field_access_decl (tree node)
9339 {
9340   if (TREE_CODE (node) == COMPOUND_EXPR)
9341     {
9342       tree op1 = TREE_OPERAND (node, 1);
9343       if (TREE_CODE (op1) == COMPOUND_EXPR)
9344          {
9345            tree call = TREE_OPERAND (op1, 0);
9346            if (TREE_CODE (call) == CALL_EXPR
9347                && TREE_CODE (TREE_OPERAND (call, 0)) == ADDR_EXPR
9348                && TREE_OPERAND (TREE_OPERAND (call, 0), 0)
9349                == soft_initclass_node)
9350              return TREE_OPERAND (op1, 1);
9351          }
9352       else if (JDECL_P (op1))
9353         return op1;
9354     }
9355   return node;
9356 }
9357
9358 /* 6.5.5.2: Qualified Expression Names */
9359
9360 static int
9361 resolve_qualified_expression_name (tree wfl, tree *found_decl,
9362                                    tree *where_found, tree *type_found)
9363 {
9364   int from_type = 0;            /* Field search initiated from a type */
9365   int from_super = 0, from_cast = 0, from_qualified_this = 0;
9366   int previous_call_static = 0;
9367   int is_static;
9368   tree decl = NULL_TREE, type = NULL_TREE, q;
9369   /* For certain for of inner class instantiation */
9370   tree saved_current, saved_this;
9371 #define RESTORE_THIS_AND_CURRENT_CLASS                          \
9372   { current_class = saved_current; current_this = saved_this;}
9373
9374   *type_found = *where_found = NULL_TREE;
9375
9376   for (q = EXPR_WFL_QUALIFICATION (wfl); q; q = TREE_CHAIN (q))
9377     {
9378       tree qual_wfl = QUAL_WFL (q);
9379       tree ret_decl;            /* for EH checking */
9380       int location;             /* for EH checking */
9381
9382       /* 15.10.1 Field Access Using a Primary */
9383       switch (TREE_CODE (qual_wfl))
9384         {
9385         case CALL_EXPR:
9386         case NEW_CLASS_EXPR:
9387           /* If the access to the function call is a non static field,
9388              build the code to access it. */
9389           if (JDECL_P (decl) && !FIELD_STATIC (decl))
9390             {
9391               decl = maybe_access_field (decl, *where_found,
9392                                          DECL_CONTEXT (decl));
9393               if (decl == error_mark_node)
9394                 return 1;
9395             }
9396
9397           /* And code for the function call */
9398           if (complete_function_arguments (qual_wfl))
9399             return 1;
9400
9401           /* We might have to setup a new current class and a new this
9402              for the search of an inner class, relative to the type of
9403              a expression resolved as `decl'. The current values are
9404              saved and restored shortly after */
9405           saved_current = current_class;
9406           saved_this = current_this;
9407           if (decl
9408               && (TREE_CODE (qual_wfl) == NEW_CLASS_EXPR
9409                   || from_qualified_this))
9410             {
9411               /* If we still have `from_qualified_this', we have the form
9412                  <T>.this.f() and we need to build <T>.this */
9413               if (from_qualified_this)
9414                 {
9415                   decl = build_access_to_thisn (current_class, type, 0);
9416                   decl = java_complete_tree (decl);
9417                   type = TREE_TYPE (TREE_TYPE (decl));
9418                 }
9419               current_class = type;
9420               current_this = decl;
9421               from_qualified_this = 0;
9422             }
9423
9424           if (from_super && TREE_CODE (qual_wfl) == CALL_EXPR)
9425             CALL_USING_SUPER (qual_wfl) = 1;
9426           location = (TREE_CODE (qual_wfl) == CALL_EXPR ?
9427                       EXPR_WFL_LINECOL (TREE_OPERAND (qual_wfl, 0)) : 0);
9428           *where_found = patch_method_invocation (qual_wfl, decl, type,
9429                                                   from_super,
9430                                                   &is_static, &ret_decl);
9431           from_super = 0;
9432           if (*where_found == error_mark_node)
9433             {
9434               RESTORE_THIS_AND_CURRENT_CLASS;
9435               return 1;
9436             }
9437           *type_found = type = QUAL_DECL_TYPE (*where_found);
9438
9439           *where_found = force_evaluation_order (*where_found);
9440
9441           /* If we're creating an inner class instance, check for that
9442              an enclosing instance is in scope */
9443           if (TREE_CODE (qual_wfl) == NEW_CLASS_EXPR
9444               && INNER_ENCLOSING_SCOPE_CHECK (type))
9445             {
9446               parse_error_context
9447                 (qual_wfl, "No enclosing instance for inner class `%s' is in scope%s",
9448                  lang_printable_name (type, 0),
9449                  (!current_this ? "" :
9450                   "; an explicit one must be provided when creating this inner class"));
9451               RESTORE_THIS_AND_CURRENT_CLASS;
9452               return 1;
9453             }
9454
9455           /* In case we had to change then to resolve a inner class
9456              instantiation using a primary qualified by a `new' */
9457           RESTORE_THIS_AND_CURRENT_CLASS;
9458
9459           /* EH check. No check on access$<n> functions */
9460           if (location
9461               && !OUTER_FIELD_ACCESS_IDENTIFIER_P
9462                     (DECL_NAME (current_function_decl)))
9463             check_thrown_exceptions (location, ret_decl);
9464
9465           /* If the previous call was static and this one is too,
9466              build a compound expression to hold the two (because in
9467              that case, previous function calls aren't transported as
9468              forcoming function's argument. */
9469           if (previous_call_static && is_static)
9470             {
9471               decl = build (COMPOUND_EXPR, TREE_TYPE (*where_found),
9472                             decl, *where_found);
9473               TREE_SIDE_EFFECTS (decl) = 1;
9474             }
9475           else
9476             {
9477               previous_call_static = is_static;
9478               decl = *where_found;
9479             }
9480           from_type = 0;
9481           continue;
9482
9483         case NEW_ARRAY_EXPR:
9484         case NEW_ANONYMOUS_ARRAY_EXPR:
9485           *where_found = decl = java_complete_tree (qual_wfl);
9486           if (decl == error_mark_node)
9487             return 1;
9488           *type_found = type = QUAL_DECL_TYPE (decl);
9489           continue;
9490
9491         case CONVERT_EXPR:
9492           *where_found = decl = java_complete_tree (qual_wfl);
9493           if (decl == error_mark_node)
9494             return 1;
9495           *type_found = type = QUAL_DECL_TYPE (decl);
9496           from_cast = 1;
9497           continue;
9498
9499         case CONDITIONAL_EXPR:
9500         case STRING_CST:
9501         case MODIFY_EXPR:
9502           *where_found = decl = java_complete_tree (qual_wfl);
9503           if (decl == error_mark_node)
9504             return 1;
9505           *type_found = type = QUAL_DECL_TYPE (decl);
9506           continue;
9507
9508         case ARRAY_REF:
9509           /* If the access to the function call is a non static field,
9510              build the code to access it. */
9511           if (JDECL_P (decl) && !FIELD_STATIC (decl))
9512             {
9513               decl = maybe_access_field (decl, *where_found, type);
9514               if (decl == error_mark_node)
9515                 return 1;
9516             }
9517           /* And code for the array reference expression */
9518           decl = java_complete_tree (qual_wfl);
9519           if (decl == error_mark_node)
9520             return 1;
9521           type = QUAL_DECL_TYPE (decl);
9522           continue;
9523
9524         case PLUS_EXPR:
9525           if ((decl = java_complete_tree (qual_wfl)) == error_mark_node)
9526             return 1;
9527           if ((type = patch_string (decl)))
9528             decl = type;
9529           *where_found = QUAL_RESOLUTION (q) = decl;
9530           *type_found = type = TREE_TYPE (decl);
9531           break;
9532
9533         case CLASS_LITERAL:
9534           if ((decl = java_complete_tree (qual_wfl)) == error_mark_node)
9535             return 1;
9536           *where_found = QUAL_RESOLUTION (q) = decl;
9537           *type_found = type = TREE_TYPE (decl);
9538           break;
9539
9540         default:
9541           /* Fix for -Wall Just go to the next statement. Don't
9542              continue */
9543           break;
9544         }
9545
9546       /* If we fall here, we weren't processing a (static) function call. */
9547       previous_call_static = 0;
9548
9549       /* It can be the keyword THIS */
9550       if (TREE_CODE (qual_wfl) == EXPR_WITH_FILE_LOCATION
9551           && EXPR_WFL_NODE (qual_wfl) == this_identifier_node)
9552         {
9553           if (!current_this)
9554             {
9555               parse_error_context
9556                 (wfl, "Keyword `this' used outside allowed context");
9557               return 1;
9558             }
9559           if (ctxp->explicit_constructor_p
9560               && type == current_class)
9561             {
9562               parse_error_context (wfl, "Can't reference `this' before the superclass constructor has been called");
9563               return 1;
9564             }
9565           /* We have to generate code for intermediate access */
9566           if (!from_type || TREE_TYPE (TREE_TYPE (current_this)) == type)
9567             {
9568               *where_found = decl = current_this;
9569               *type_found = type = QUAL_DECL_TYPE (decl);
9570             }
9571           /* We're trying to access the this from somewhere else. Make sure
9572              it's allowed before doing so. */
9573           else
9574             {
9575               if (!enclosing_context_p (type, current_class))
9576                 {
9577                   char *p  = xstrdup (lang_printable_name (type, 0));
9578                   parse_error_context (qual_wfl, "Can't use variable `%s.this': type `%s' isn't an outer type of type `%s'",
9579                                        p, p,
9580                                        lang_printable_name (current_class, 0));
9581                   free (p);
9582                   return 1;
9583                 }
9584               from_qualified_this = 1;
9585               /* If there's nothing else after that, we need to
9586                  produce something now, otherwise, the section of the
9587                  code that needs to produce <T>.this will generate
9588                  what is necessary. */
9589               if (!TREE_CHAIN (q))
9590                 {
9591                   decl = build_access_to_thisn (current_class, type, 0);
9592                   *where_found = decl = java_complete_tree (decl);
9593                   *type_found = type = TREE_TYPE (decl);
9594                 }
9595             }
9596
9597           from_type = 0;
9598           continue;
9599         }
9600
9601       /* 15.10.2 Accessing Superclass Members using SUPER */
9602       if (TREE_CODE (qual_wfl) == EXPR_WITH_FILE_LOCATION
9603           && EXPR_WFL_NODE (qual_wfl) == super_identifier_node)
9604         {
9605           tree node;
9606           /* Check on the restricted use of SUPER */
9607           if (METHOD_STATIC (current_function_decl)
9608               || current_class == object_type_node)
9609             {
9610               parse_error_context
9611                 (wfl, "Keyword `super' used outside allowed context");
9612               return 1;
9613             }
9614           /* Otherwise, treat SUPER as (SUPER_CLASS)THIS */
9615           node = build_cast (EXPR_WFL_LINECOL (qual_wfl),
9616                              CLASSTYPE_SUPER (current_class),
9617                              build_this (EXPR_WFL_LINECOL (qual_wfl)));
9618           *where_found = decl = java_complete_tree (node);
9619           if (decl == error_mark_node)
9620             return 1;
9621           *type_found = type = QUAL_DECL_TYPE (decl);
9622           from_super = from_type = 1;
9623           continue;
9624         }
9625
9626       /* 15.13.1: Can't search for field name in packages, so we
9627          assume a variable/class name was meant. */
9628       if (RESOLVE_PACKAGE_NAME_P (qual_wfl))
9629         {
9630           tree name;
9631           if ((decl = resolve_package (wfl, &q, &name)))
9632             {
9633               tree list;
9634               *where_found = decl;
9635
9636               /* We want to be absolutely sure that the class is laid
9637                  out. We're going to search something inside it. */
9638               *type_found = type = TREE_TYPE (decl);
9639               layout_class (type);
9640               from_type = 1;
9641
9642               /* Fix them all the way down, if any are left. */
9643               if (q)
9644                 {
9645                   list = TREE_CHAIN (q);
9646                   while (list)
9647                     {
9648                       RESOLVE_EXPRESSION_NAME_P (QUAL_WFL (list)) = 1;
9649                       RESOLVE_PACKAGE_NAME_P (QUAL_WFL (list)) = 0;
9650                       list = TREE_CHAIN (list);
9651                     }
9652                 }
9653             }
9654           else
9655             {
9656               if (from_super || from_cast)
9657                 parse_error_context
9658                   ((from_cast ? qual_wfl : wfl),
9659                    "No variable `%s' defined in class `%s'",
9660                    IDENTIFIER_POINTER (EXPR_WFL_NODE (qual_wfl)),
9661                    lang_printable_name (type, 0));
9662               else
9663                 parse_error_context
9664                   (qual_wfl, "Undefined variable or class name: `%s'",
9665                    IDENTIFIER_POINTER (name));
9666               return 1;
9667             }
9668         }
9669
9670       /* We have a type name. It's been already resolved when the
9671          expression was qualified. */
9672       else if (RESOLVE_TYPE_NAME_P (qual_wfl) && QUAL_RESOLUTION (q))
9673         {
9674           decl = QUAL_RESOLUTION (q);
9675
9676           /* Sneak preview. If next we see a `new', we're facing a
9677              qualification with resulted in a type being selected
9678              instead of a field.  Report the error */
9679           if(TREE_CHAIN (q)
9680              && TREE_CODE (TREE_PURPOSE (TREE_CHAIN (q))) == NEW_CLASS_EXPR)
9681             {
9682               parse_error_context (qual_wfl, "Undefined variable `%s'",
9683                                    IDENTIFIER_POINTER (EXPR_WFL_NODE (wfl)));
9684               return 1;
9685             }
9686
9687           if (not_accessible_p (TREE_TYPE (decl), decl, type, 0))
9688             {
9689               parse_error_context
9690                 (qual_wfl, "Can't access %s field `%s.%s' from `%s'",
9691                  java_accstring_lookup (get_access_flags_from_decl (decl)),
9692                  GET_TYPE_NAME (type),
9693                  IDENTIFIER_POINTER (DECL_NAME (decl)),
9694                  IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (current_class))));
9695               return 1;
9696             }
9697           check_deprecation (qual_wfl, decl);
9698
9699           type = TREE_TYPE (decl);
9700           from_type = 1;
9701         }
9702       /* We resolve an expression name */
9703       else
9704         {
9705           tree field_decl = NULL_TREE;
9706
9707           /* If there exists an early resolution, use it. That occurs
9708              only once and we know that there are more things to
9709              come. Don't do that when processing something after SUPER
9710              (we need more thing to be put in place below */
9711           if (!from_super && QUAL_RESOLUTION (q))
9712             {
9713               decl = QUAL_RESOLUTION (q);
9714               if (!type)
9715                 {
9716                   if (TREE_CODE (decl) == FIELD_DECL && !FIELD_STATIC (decl))
9717                     {
9718                       if (current_this)
9719                         *where_found = current_this;
9720                       else
9721                         {
9722                           static_ref_err (qual_wfl, DECL_NAME (decl),
9723                                           current_class);
9724                           return 1;
9725                         }
9726                       if (outer_field_access_p (current_class, decl))
9727                         decl = build_outer_field_access (qual_wfl, decl);
9728                     }
9729                   else
9730                     {
9731                       *where_found = TREE_TYPE (decl);
9732                       if (TREE_CODE (*where_found) == POINTER_TYPE)
9733                         *where_found = TREE_TYPE (*where_found);
9734                     }
9735                 }
9736             }
9737
9738           /* Report and error if we're using a numerical litteral as a
9739              qualifier. It can only be an INTEGER_CST. */
9740           else if (TREE_CODE (qual_wfl) == INTEGER_CST)
9741             {
9742               parse_error_context
9743                 (wfl, "Can't use type `%s' as a qualifier",
9744                  lang_printable_name (TREE_TYPE (qual_wfl), 0));
9745               return 1;
9746             }
9747
9748           /* We have to search for a field, knowing the type of its
9749              container. The flag FROM_TYPE indicates that we resolved
9750              the last member of the expression as a type name, which
9751              means that for the resolution of this field, we'll look
9752              for other errors than if it was resolved as a member of
9753              an other field. */
9754           else
9755             {
9756               int is_static;
9757               tree field_decl_type; /* For layout */
9758
9759               if (!from_type && !JREFERENCE_TYPE_P (type))
9760                 {
9761                   parse_error_context
9762                     (qual_wfl, "Attempt to reference field `%s' in `%s %s'",
9763                      IDENTIFIER_POINTER (EXPR_WFL_NODE (qual_wfl)),
9764                      lang_printable_name (type, 0),
9765                      IDENTIFIER_POINTER (DECL_NAME (decl)));
9766                   return 1;
9767                 }
9768
9769               field_decl = lookup_field_wrapper (type,
9770                                                  EXPR_WFL_NODE (qual_wfl));
9771
9772               /* Maybe what we're trying to access to is an inner
9773                  class, only if decl is a TYPE_DECL. */
9774               if (!field_decl && TREE_CODE (decl) == TYPE_DECL)
9775                 {
9776                   tree ptr, inner_decl;
9777
9778                   BUILD_PTR_FROM_NAME (ptr, EXPR_WFL_NODE (qual_wfl));
9779                   inner_decl = resolve_class (decl, ptr, NULL_TREE, qual_wfl);
9780                   if (inner_decl)
9781                     {
9782                       check_inner_class_access (inner_decl, decl, qual_wfl);
9783                       type = TREE_TYPE (inner_decl);
9784                       decl = inner_decl;
9785                       from_type = 1;
9786                       continue;
9787                     }
9788                 }
9789
9790               if (field_decl == NULL_TREE)
9791                 {
9792                   parse_error_context
9793                     (qual_wfl, "No variable `%s' defined in type `%s'",
9794                      IDENTIFIER_POINTER (EXPR_WFL_NODE (qual_wfl)),
9795                      GET_TYPE_NAME (type));
9796                   return 1;
9797                 }
9798               if (field_decl == error_mark_node)
9799                 return 1;
9800
9801               /* Layout the type of field_decl, since we may need
9802                  it. Don't do primitive types or loaded classes. The
9803                  situation of non primitive arrays may not handled
9804                  properly here. FIXME */
9805               if (TREE_CODE (TREE_TYPE (field_decl)) == POINTER_TYPE)
9806                 field_decl_type = TREE_TYPE (TREE_TYPE (field_decl));
9807               else
9808                 field_decl_type = TREE_TYPE (field_decl);
9809               if (!JPRIMITIVE_TYPE_P (field_decl_type)
9810                   && !CLASS_LOADED_P (field_decl_type)
9811                   && !TYPE_ARRAY_P (field_decl_type))
9812                 resolve_and_layout (field_decl_type, NULL_TREE);
9813
9814               /* Check on accessibility here */
9815               if (not_accessible_p (current_class, field_decl,
9816                                     DECL_CONTEXT (field_decl), from_super))
9817                 {
9818                   parse_error_context
9819                     (qual_wfl,
9820                      "Can't access %s field `%s.%s' from `%s'",
9821                      java_accstring_lookup
9822                        (get_access_flags_from_decl (field_decl)),
9823                      GET_TYPE_NAME (type),
9824                      IDENTIFIER_POINTER (DECL_NAME (field_decl)),
9825                      IDENTIFIER_POINTER
9826                        (DECL_NAME (TYPE_NAME (current_class))));
9827                   return 1;
9828                 }
9829               check_deprecation (qual_wfl, field_decl);
9830
9831               /* There are things to check when fields are accessed
9832                  from type. There are no restrictions on a static
9833                  declaration of the field when it is accessed from an
9834                  interface */
9835               is_static = FIELD_STATIC (field_decl);
9836               if (!from_super && from_type
9837                   && !TYPE_INTERFACE_P (type)
9838                   && !is_static
9839                   && (current_function_decl
9840                       && METHOD_STATIC (current_function_decl)))
9841                 {
9842                   static_ref_err (qual_wfl, EXPR_WFL_NODE (qual_wfl), type);
9843                   return 1;
9844                 }
9845               from_cast = from_super = 0;
9846
9847               /* It's an access from a type but it isn't static, we
9848                  make it relative to `this'. */
9849               if (!is_static && from_type)
9850                 decl = current_this;
9851
9852               /* If we need to generate something to get a proper
9853                  handle on what this field is accessed from, do it
9854                  now. */
9855               if (!is_static)
9856                 {
9857                   decl = maybe_access_field (decl, *where_found, *type_found);
9858                   if (decl == error_mark_node)
9859                     return 1;
9860                 }
9861
9862               /* We want to keep the location were found it, and the type
9863                  we found. */
9864               *where_found = decl;
9865               *type_found = type;
9866
9867               /* Generate the correct expression for field access from
9868                  qualified this */
9869               if (from_qualified_this)
9870                 {
9871                   field_decl = build_outer_field_access (qual_wfl, field_decl);
9872                   from_qualified_this = 0;
9873                 }
9874
9875               /* This is the decl found and eventually the next one to
9876                  search from */
9877               decl = field_decl;
9878             }
9879           from_type = 0;
9880           type = QUAL_DECL_TYPE (decl);
9881
9882           /* Sneak preview. If decl is qualified by a `new', report
9883              the error here to be accurate on the peculiar construct */
9884           if (TREE_CHAIN (q)
9885               && TREE_CODE (TREE_PURPOSE (TREE_CHAIN (q))) == NEW_CLASS_EXPR
9886               && !JREFERENCE_TYPE_P (type))
9887             {
9888               parse_error_context (qual_wfl, "Attempt to reference field `new' in a `%s'",
9889                                    lang_printable_name (type, 0));
9890               return 1;
9891             }
9892         }
9893       /* `q' might have changed due to a after package resolution
9894          re-qualification */
9895       if (!q)
9896         break;
9897     }
9898   *found_decl = decl;
9899   return 0;
9900 }
9901
9902 /* 6.6 Qualified name and access control. Returns 1 if MEMBER (a decl)
9903    can't be accessed from REFERENCE (a record type). If MEMBER
9904    features a protected access, we then use WHERE which, if non null,
9905    holds the type of MEMBER's access that is checked against
9906    6.6.2.1. This function should be used when decl is a field or a
9907    method.  */
9908
9909 static int
9910 not_accessible_p (tree reference, tree member, tree where, int from_super)
9911 {
9912   int access_flag = get_access_flags_from_decl (member);
9913
9914   /* Inner classes are processed by check_inner_class_access */
9915   if (INNER_CLASS_TYPE_P (reference))
9916     return 0;
9917
9918   /* Access always granted for members declared public */
9919   if (access_flag & ACC_PUBLIC)
9920     return 0;
9921
9922   /* Check access on protected members */
9923   if (access_flag & ACC_PROTECTED)
9924     {
9925       /* Access granted if it occurs from within the package
9926          containing the class in which the protected member is
9927          declared */
9928       if (class_in_current_package (DECL_CONTEXT (member)))
9929         return 0;
9930
9931       /* If accessed with the form `super.member', then access is granted */
9932       if (from_super)
9933         return 0;
9934
9935       /* If where is active, access was made through a
9936          qualifier. Access is granted if the type of the qualifier is
9937          or is a sublass of the type the access made from (6.6.2.1.)  */
9938       if (where && !inherits_from_p (reference, where))
9939         return 1;
9940
9941       /* Otherwise, access is granted if occurring from the class where
9942          member is declared or a subclass of it. Find the right
9943          context to perform the check */
9944       if (PURE_INNER_CLASS_TYPE_P (reference))
9945         {
9946           while (INNER_CLASS_TYPE_P (reference))
9947             {
9948               if (inherits_from_p (reference, DECL_CONTEXT (member)))
9949                 return 0;
9950               reference = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (reference)));
9951             }
9952         }
9953       if (inherits_from_p (reference, DECL_CONTEXT (member)))
9954         return 0;
9955       return 1;
9956     }
9957
9958   /* Check access on private members. Access is granted only if it
9959      occurs from within the class in which it is declared -- that does
9960      it for innerclasses too. */
9961   if (access_flag & ACC_PRIVATE)
9962     {
9963       if (reference == DECL_CONTEXT (member))
9964         return 0;
9965       if (enclosing_context_p (reference, DECL_CONTEXT (member)))
9966         return 0;
9967       return 1;
9968     }
9969
9970   /* Default access are permitted only when occurring within the
9971      package in which the type (REFERENCE) is declared. In other words,
9972      REFERENCE is defined in the current package */
9973   if (ctxp->package)
9974     return !class_in_current_package (reference);
9975
9976   /* Otherwise, access is granted */
9977   return 0;
9978 }
9979
9980 /* Test deprecated decl access.  */
9981 static void
9982 check_deprecation (tree wfl, tree decl)
9983 {
9984   const char *file;
9985   tree elt;
9986
9987   if (! flag_deprecated)
9988     return;
9989
9990   /* We want to look at the element type of arrays here, so we strip
9991      all surrounding array types.  */
9992   if (TYPE_ARRAY_P (TREE_TYPE (decl)))
9993     {
9994       elt = TREE_TYPE (decl);
9995       while (TYPE_ARRAY_P (elt))
9996         elt = TYPE_ARRAY_ELEMENT (elt);
9997       /* We'll end up with a pointer type, so we use TREE_TYPE to go
9998          to the record.  */
9999       decl = TYPE_NAME (TREE_TYPE (elt));
10000     }
10001   file = DECL_SOURCE_FILE (decl);
10002
10003   /* Complain if the field is deprecated and the file it was defined
10004      in isn't compiled at the same time the file which contains its
10005      use is */
10006   if (DECL_DEPRECATED (decl)
10007       && !IS_A_COMMAND_LINE_FILENAME_P (get_identifier (file)))
10008     {
10009       const char *the;
10010       switch (TREE_CODE (decl))
10011         {
10012         case FUNCTION_DECL:
10013           the = "method";
10014           break;
10015         case FIELD_DECL:
10016         case VAR_DECL:
10017           the = "field";
10018           break;
10019         case TYPE_DECL:
10020           parse_warning_context (wfl, "The class `%s' has been deprecated",
10021                                  IDENTIFIER_POINTER (DECL_NAME (decl)));
10022           return;
10023         default:
10024           abort ();
10025         }
10026       /* Don't issue a message if the context as been deprecated as a
10027          whole. */
10028       if (! CLASS_DEPRECATED (TYPE_NAME (DECL_CONTEXT (decl))))
10029         parse_warning_context
10030           (wfl, "The %s `%s' in class `%s' has been deprecated",
10031            the, lang_printable_name (decl, 0),
10032            IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (DECL_CONTEXT (decl)))));
10033     }
10034 }
10035
10036 /* Returns 1 if class was declared in the current package, 0 otherwise */
10037
10038 static GTY(()) tree cicp_cache;
10039 static int
10040 class_in_current_package (tree class)
10041 {
10042   int qualified_flag;
10043   tree left;
10044
10045   if (cicp_cache == class)
10046     return 1;
10047
10048   qualified_flag = QUALIFIED_P (DECL_NAME (TYPE_NAME (class)));
10049
10050   /* If the current package is empty and the name of CLASS is
10051      qualified, class isn't in the current package.  If there is a
10052      current package and the name of the CLASS is not qualified, class
10053      isn't in the current package */
10054   if ((!ctxp->package && qualified_flag) || (ctxp->package && !qualified_flag))
10055     return 0;
10056
10057   /* If there is not package and the name of CLASS isn't qualified,
10058      they belong to the same unnamed package */
10059   if (!ctxp->package && !qualified_flag)
10060     return 1;
10061
10062   /* Compare the left part of the name of CLASS with the package name */
10063   breakdown_qualified (&left, NULL, DECL_NAME (TYPE_NAME (class)));
10064   if (ctxp->package == left)
10065     {
10066       cicp_cache = class;
10067       return 1;
10068     }
10069   return 0;
10070 }
10071
10072 /* This function may generate code to access DECL from WHERE. This is
10073    done only if certain conditions meet.  */
10074
10075 static tree
10076 maybe_access_field (tree decl, tree where, tree type)
10077 {
10078   if (TREE_CODE (decl) == FIELD_DECL && decl != current_this
10079       && !FIELD_STATIC (decl))
10080     decl = build_field_ref (where ? where : current_this,
10081                             (type ? type : DECL_CONTEXT (decl)),
10082                             DECL_NAME (decl));
10083   return decl;
10084 }
10085
10086 /* Build a method invocation, by patching PATCH. If non NULL
10087    and according to the situation, PRIMARY and WHERE may be
10088    used. IS_STATIC is set to 1 if the invoked function is static. */
10089
10090 static tree
10091 patch_method_invocation (tree patch, tree primary, tree where, int from_super,
10092                          int *is_static, tree *ret_decl)
10093 {
10094   tree wfl = TREE_OPERAND (patch, 0);
10095   tree args = TREE_OPERAND (patch, 1);
10096   tree name = EXPR_WFL_NODE (wfl);
10097   tree list;
10098   int is_static_flag = 0;
10099   int is_super_init = 0;
10100   tree this_arg = NULL_TREE;
10101   int is_array_clone_call = 0;
10102
10103   /* Should be overriden if everything goes well. Otherwise, if
10104      something fails, it should keep this value. It stop the
10105      evaluation of a bogus assignment. See java_complete_tree,
10106      MODIFY_EXPR: for the reasons why we sometimes want to keep on
10107      evaluating an assignment */
10108   TREE_TYPE (patch) = error_mark_node;
10109
10110   /* Since lookup functions are messing with line numbers, save the
10111      context now.  */
10112   java_parser_context_save_global ();
10113
10114   /* 15.11.1: Compile-Time Step 1: Determine Class or Interface to Search */
10115
10116   /* Resolution of qualified name, excluding constructors */
10117   if (QUALIFIED_P (name) && !CALL_CONSTRUCTOR_P (patch))
10118     {
10119       tree identifier, identifier_wfl, type, resolved;
10120       /* Extract the last IDENTIFIER of the qualified
10121          expression. This is a wfl and we will use it's location
10122          data during error report. */
10123       identifier_wfl = cut_identifier_in_qualified (wfl);
10124       identifier = EXPR_WFL_NODE (identifier_wfl);
10125
10126       /* Given the context, IDENTIFIER is syntactically qualified
10127          as a MethodName. We need to qualify what's before */
10128       qualify_ambiguous_name (wfl);
10129       resolved = resolve_field_access (wfl, NULL, NULL);
10130
10131       if (TREE_CODE (resolved) == VAR_DECL && FIELD_STATIC (resolved)
10132          && FIELD_FINAL (resolved)
10133          && !inherits_from_p (DECL_CONTEXT (resolved), current_class)
10134          && !flag_emit_class_files && !flag_emit_xref)
10135        resolved = build_class_init (DECL_CONTEXT (resolved), resolved);
10136
10137       if (resolved == error_mark_node)
10138         PATCH_METHOD_RETURN_ERROR ();
10139
10140       type = GET_SKIP_TYPE (resolved);
10141       resolve_and_layout (type, NULL_TREE);
10142
10143       if (JPRIMITIVE_TYPE_P (type))
10144         {
10145           parse_error_context
10146             (identifier_wfl,
10147              "Can't invoke a method on primitive type `%s'",
10148              IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type))));
10149           PATCH_METHOD_RETURN_ERROR ();
10150         }
10151
10152       list = lookup_method_invoke (0, identifier_wfl, type, identifier, args);
10153       args = nreverse (args);
10154
10155       /* We're resolving a call from a type */
10156       if (TREE_CODE (resolved) == TYPE_DECL)
10157         {
10158           if (CLASS_INTERFACE (resolved))
10159             {
10160               parse_error_context
10161                 (identifier_wfl,
10162                 "Can't make static reference to method `%s' in interface `%s'",
10163                  IDENTIFIER_POINTER (identifier),
10164                  IDENTIFIER_POINTER (name));
10165               PATCH_METHOD_RETURN_ERROR ();
10166             }
10167           if (list && !METHOD_STATIC (list))
10168             {
10169               char *fct_name = xstrdup (lang_printable_name (list, 0));
10170               parse_error_context
10171                 (identifier_wfl,
10172                  "Can't make static reference to method `%s %s' in class `%s'",
10173                  lang_printable_name (TREE_TYPE (TREE_TYPE (list)), 0),
10174                  fct_name, IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type))));
10175               free (fct_name);
10176               PATCH_METHOD_RETURN_ERROR ();
10177             }
10178         }
10179       else
10180         this_arg = primary = resolved;
10181
10182       if (TYPE_ARRAY_P (type) && identifier == get_identifier ("clone"))
10183         is_array_clone_call = 1;
10184
10185       /* IDENTIFIER_WFL will be used to report any problem further */
10186       wfl = identifier_wfl;
10187     }
10188   /* Resolution of simple names, names generated after a primary: or
10189      constructors */
10190   else
10191     {
10192       tree class_to_search = NULL_TREE;
10193       int lc;                   /* Looking for Constructor */
10194
10195       /* We search constructor in their target class */
10196       if (CALL_CONSTRUCTOR_P (patch))
10197         {
10198           if (TREE_CODE (patch) == NEW_CLASS_EXPR)
10199             class_to_search = EXPR_WFL_NODE (wfl);
10200           else if (EXPR_WFL_NODE (TREE_OPERAND (patch, 0)) ==
10201                    this_identifier_node)
10202             class_to_search = NULL_TREE;
10203           else if (EXPR_WFL_NODE (TREE_OPERAND (patch, 0)) ==
10204                    super_identifier_node)
10205             {
10206               is_super_init = 1;
10207               if (CLASSTYPE_SUPER (current_class))
10208                 class_to_search =
10209                   DECL_NAME (TYPE_NAME (CLASSTYPE_SUPER (current_class)));
10210               else
10211                 {
10212                   parse_error_context (wfl, "Can't invoke super constructor on java.lang.Object");
10213                   PATCH_METHOD_RETURN_ERROR ();
10214                 }
10215             }
10216
10217           /* Class to search is NULL if we're searching the current one */
10218           if (class_to_search)
10219             {
10220               class_to_search = resolve_and_layout (class_to_search, wfl);
10221
10222               if (!class_to_search)
10223                 {
10224                   parse_error_context
10225                     (wfl, "Class `%s' not found in type declaration",
10226                      IDENTIFIER_POINTER (EXPR_WFL_NODE (wfl)));
10227                   PATCH_METHOD_RETURN_ERROR ();
10228                 }
10229
10230               /* Can't instantiate an abstract class, but we can
10231                  invoke it's constructor. It's use within the `new'
10232                  context is denied here. */
10233               if (CLASS_ABSTRACT (class_to_search)
10234                   && TREE_CODE (patch) == NEW_CLASS_EXPR)
10235                 {
10236                   parse_error_context
10237                     (wfl, "Class `%s' is an abstract class. It can't be instantiated",
10238                      IDENTIFIER_POINTER (EXPR_WFL_NODE (wfl)));
10239                   PATCH_METHOD_RETURN_ERROR ();
10240                 }
10241
10242               class_to_search = TREE_TYPE (class_to_search);
10243             }
10244           else
10245             class_to_search = current_class;
10246           lc = 1;
10247         }
10248       /* This is a regular search in the local class, unless an
10249          alternate class is specified. */
10250       else
10251         {
10252           if (where != NULL_TREE)
10253             class_to_search = where;
10254           else if (QUALIFIED_P (name))
10255             class_to_search = current_class;
10256           else
10257             {
10258               class_to_search = current_class;
10259
10260               for (;;)
10261                 {
10262                   if (has_method (class_to_search, name))
10263                     break;
10264                   if (! INNER_CLASS_TYPE_P (class_to_search))
10265                     {
10266                       parse_error_context (wfl,
10267                                            "No method named `%s' in scope",
10268                                            IDENTIFIER_POINTER (name));
10269                       PATCH_METHOD_RETURN_ERROR ();
10270                     }
10271                   class_to_search
10272                     = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (class_to_search)));
10273                 }
10274             }
10275           lc = 0;
10276         }
10277
10278       /* NAME is a simple identifier or comes from a primary. Search
10279          in the class whose declaration contain the method being
10280          invoked. */
10281       resolve_and_layout (class_to_search, NULL_TREE);
10282
10283       list = lookup_method_invoke (lc, wfl, class_to_search, name, args);
10284       /* Don't continue if no method were found, as the next statement
10285          can't be executed then. */
10286       if (!list)
10287         PATCH_METHOD_RETURN_ERROR ();
10288
10289       if (TYPE_ARRAY_P (class_to_search)
10290           && DECL_NAME (list) == get_identifier ("clone"))
10291         is_array_clone_call = 1;
10292
10293       /* Check for static reference if non static methods */
10294       if (check_for_static_method_reference (wfl, patch, list,
10295                                              class_to_search, primary))
10296         PATCH_METHOD_RETURN_ERROR ();
10297
10298       /* Check for inner classes creation from illegal contexts */
10299       if (lc && (INNER_CLASS_TYPE_P (class_to_search)
10300                  && !CLASS_STATIC (TYPE_NAME (class_to_search)))
10301           && INNER_ENCLOSING_SCOPE_CHECK (class_to_search)
10302           && !DECL_INIT_P (current_function_decl))
10303         {
10304           parse_error_context
10305             (wfl, "No enclosing instance for inner class `%s' is in scope%s",
10306              lang_printable_name (class_to_search, 0),
10307              (!current_this ? "" :
10308               "; an explicit one must be provided when creating this inner class"));
10309           PATCH_METHOD_RETURN_ERROR ();
10310         }
10311
10312       /* Non static methods are called with the current object extra
10313          argument. If patch a `new TYPE()', the argument is the value
10314          returned by the object allocator. If method is resolved as a
10315          primary, use the primary otherwise use the current THIS. */
10316       args = nreverse (args);
10317       if (TREE_CODE (patch) != NEW_CLASS_EXPR)
10318         {
10319           this_arg = primary ? primary : current_this;
10320
10321           /* If we're using an access method, things are different.
10322              There are two familly of cases:
10323
10324              1) We're not generating bytecodes:
10325
10326              - LIST is non static. It's invocation is transformed from
10327                x(a1,...,an) into this$<n>.x(a1,....an).
10328              - LIST is static. It's invocation is transformed from
10329                x(a1,...,an) into TYPE_OF(this$<n>).x(a1,....an)
10330
10331              2) We're generating bytecodes:
10332
10333              - LIST is non static. It's invocation is transformed from
10334                x(a1,....,an) into access$<n>(this$<n>,a1,...,an).
10335              - LIST is static. It's invocation is transformed from
10336                x(a1,....,an) into TYPE_OF(this$<n>).x(a1,....an).
10337
10338              Of course, this$<n> can be abitrary complex, ranging from
10339              this$0 (the immediate outer context) to
10340              access$0(access$0(...(this$0))).
10341
10342              maybe_use_access_method returns a nonzero value if the
10343              this_arg has to be moved into the (then generated) stub
10344              argument list. In the meantime, the selected function
10345              might have be replaced by a generated stub. */
10346           if (!primary &&
10347               maybe_use_access_method (is_super_init, &list, &this_arg))
10348             {
10349               args = tree_cons (NULL_TREE, this_arg, args);
10350               this_arg = NULL_TREE; /* So it doesn't get chained twice */
10351             }
10352         }
10353     }
10354
10355   /* Merge point of all resolution schemes. If we have nothing, this
10356      is an error, already signaled */
10357   if (!list)
10358     PATCH_METHOD_RETURN_ERROR ();
10359
10360   /* Check accessibility, position the is_static flag, build and
10361      return the call */
10362   if (not_accessible_p (DECL_CONTEXT (current_function_decl), list,
10363                         (primary ? TREE_TYPE (TREE_TYPE (primary)) :
10364                          NULL_TREE), from_super)
10365       /* Calls to clone() on array types are permitted as a special-case. */
10366       && !is_array_clone_call)
10367     {
10368       const char *const fct_name = IDENTIFIER_POINTER (DECL_NAME (list));
10369       const char *const access =
10370         java_accstring_lookup (get_access_flags_from_decl (list));
10371       const char *const klass =
10372         IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (DECL_CONTEXT (list))));
10373       const char *const refklass =
10374         IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (current_class)));
10375       const char *const what = (DECL_CONSTRUCTOR_P (list)
10376                                 ? "constructor" : "method");
10377       /* FIXME: WFL yields the wrong message here but I don't know
10378          what else to use.  */
10379       parse_error_context (wfl,
10380                            "Can't access %s %s `%s.%s' from `%s'",
10381                            access, what, klass, fct_name, refklass);
10382       PATCH_METHOD_RETURN_ERROR ();
10383     }
10384
10385   /* Deprecation check: check whether the method being invoked or the
10386      instance-being-created's type are deprecated.  */
10387   if (TREE_CODE (patch) == NEW_CLASS_EXPR)
10388     check_deprecation (wfl, TYPE_NAME (DECL_CONTEXT (list)));
10389   check_deprecation (wfl, list);
10390
10391   /* If invoking a innerclass constructor, there are hidden parameters
10392      to pass */
10393   if (TREE_CODE (patch) == NEW_CLASS_EXPR
10394       && PURE_INNER_CLASS_TYPE_P (DECL_CONTEXT (list)))
10395     {
10396       /* And make sure we add the accessed local variables to be saved
10397          in field aliases. */
10398       args = build_alias_initializer_parameter_list
10399         (AIPL_FUNCTION_CTOR_INVOCATION, DECL_CONTEXT (list), args, NULL);
10400
10401       /* Secretly pass the current_this/primary as a second argument */
10402       if (primary || current_this)
10403         {
10404           tree extra_arg;
10405           tree this_type = (current_this ?
10406                             TREE_TYPE (TREE_TYPE (current_this)) : NULL_TREE);
10407           /* Method's (list) enclosing context */
10408           tree mec = DECL_CONTEXT (TYPE_NAME (DECL_CONTEXT (list)));
10409           /* If we have a primary, use it. */
10410           if (primary)
10411             extra_arg = primary;
10412           /* The current `this' is an inner class but isn't a direct
10413              enclosing context for the inner class we're trying to
10414              create. Build an access to the proper enclosing context
10415              and use it. */
10416           else if (current_this && PURE_INNER_CLASS_TYPE_P (this_type)
10417                    && this_type != TREE_TYPE (mec))
10418             {
10419
10420               extra_arg = build_access_to_thisn (current_class,
10421                                                  TREE_TYPE (mec), 0);
10422               extra_arg = java_complete_tree (extra_arg);
10423             }
10424           /* Otherwise, just use the current `this' as an enclosing
10425              context. */
10426           else
10427             extra_arg = current_this;
10428           args = tree_cons (NULL_TREE, extra_arg, args);
10429         }
10430       else
10431         args = tree_cons (NULL_TREE, integer_zero_node, args);
10432     }
10433
10434   /* This handles the situation where a constructor invocation needs
10435      to have an enclosing context passed as a second parameter (the
10436      constructor is one of an inner class). */
10437   if ((is_super_init ||
10438        (TREE_CODE (patch) == CALL_EXPR && name == this_identifier_node))
10439       && PURE_INNER_CLASS_TYPE_P (DECL_CONTEXT (list)))
10440     {
10441       tree dest = TYPE_NAME (DECL_CONTEXT (list));
10442       tree extra_arg =
10443         build_access_to_thisn (current_class, DECL_CONTEXT (dest), 0);
10444       extra_arg = java_complete_tree (extra_arg);
10445       args = tree_cons (NULL_TREE, extra_arg, args);
10446     }
10447
10448   is_static_flag = METHOD_STATIC (list);
10449   if (! is_static_flag && this_arg != NULL_TREE)
10450     args = tree_cons (NULL_TREE, this_arg, args);
10451
10452   /* In the context of an explicit constructor invocation, we can't
10453      invoke any method relying on `this'. Exceptions are: we're
10454      invoking a static function, primary exists and is not the current
10455      this, we're creating a new object. */
10456   if (ctxp->explicit_constructor_p
10457       && !is_static_flag
10458       && (!primary || primary == current_this)
10459       && (TREE_CODE (patch) != NEW_CLASS_EXPR))
10460     {
10461       parse_error_context (wfl, "Can't reference `this' before the superclass constructor has been called");
10462       PATCH_METHOD_RETURN_ERROR ();
10463     }
10464   java_parser_context_restore_global ();
10465   if (is_static)
10466     *is_static = is_static_flag;
10467   /* Sometimes, we want the decl of the selected method. Such as for
10468      EH checking */
10469   if (ret_decl)
10470     *ret_decl = list;
10471   patch = patch_invoke (patch, list, args);
10472
10473   /* Now is a good time to insert the call to finit$ */
10474   if (is_super_init && CLASS_HAS_FINIT_P (current_class))
10475     {
10476       tree finit_parms, finit_call;
10477
10478       /* Prepare to pass hidden parameters to finit$, if any. */
10479       finit_parms = build_alias_initializer_parameter_list
10480         (AIPL_FUNCTION_FINIT_INVOCATION, current_class, NULL_TREE, NULL);
10481
10482       finit_call =
10483         build_method_invocation (build_wfl_node (finit_identifier_node),
10484                                  finit_parms);
10485
10486       /* Generate the code used to initialize fields declared with an
10487          initialization statement and build a compound statement along
10488          with the super constructor invocation. */
10489       CAN_COMPLETE_NORMALLY (patch) = 1;
10490       patch = build (COMPOUND_EXPR, void_type_node, patch,
10491                      java_complete_tree (finit_call));
10492     }
10493   return patch;
10494 }
10495
10496 /* Check that we're not trying to do a static reference to a method in
10497    non static method. Return 1 if it's the case, 0 otherwise. */
10498
10499 static int
10500 check_for_static_method_reference (tree wfl, tree node, tree method,
10501                                    tree where, tree primary)
10502 {
10503   if (METHOD_STATIC (current_function_decl)
10504       && !METHOD_STATIC (method) && !primary && !CALL_CONSTRUCTOR_P (node))
10505     {
10506       char *fct_name = xstrdup (lang_printable_name (method, 0));
10507       parse_error_context
10508         (wfl, "Can't make static reference to method `%s %s' in class `%s'",
10509          lang_printable_name (TREE_TYPE (TREE_TYPE (method)), 0), fct_name,
10510          IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (where))));
10511       free (fct_name);
10512       return 1;
10513     }
10514   return 0;
10515 }
10516
10517 /* Fix the invocation of *MDECL if necessary in the case of a
10518    invocation from an inner class. *THIS_ARG might be modified
10519    appropriately and an alternative access to *MDECL might be
10520    returned.  */
10521
10522 static int
10523 maybe_use_access_method (int is_super_init, tree *mdecl, tree *this_arg)
10524 {
10525   tree ctx;
10526   tree md = *mdecl, ta = *this_arg;
10527   int to_return = 0;
10528   int non_static_context = !METHOD_STATIC (md);
10529
10530   if (is_super_init
10531       || DECL_CONTEXT (md) == current_class
10532       || !PURE_INNER_CLASS_TYPE_P (current_class)
10533       || DECL_FINIT_P (md)
10534       || DECL_INSTINIT_P (md))
10535     return 0;
10536
10537   /* If we're calling a method found in an enclosing class, generate
10538      what it takes to retrieve the right this. Don't do that if we're
10539      invoking a static method. Note that if MD's type is unrelated to
10540      CURRENT_CLASS, then the current this can be used. */
10541
10542   if (non_static_context && DECL_CONTEXT (md) != object_type_node)
10543     {
10544       ctx = TREE_TYPE (DECL_CONTEXT (TYPE_NAME (current_class)));
10545       if (inherits_from_p (ctx, DECL_CONTEXT (md)))
10546         {
10547           ta = build_current_thisn (current_class);
10548           ta = build_wfl_node (ta);
10549         }
10550       else
10551         {
10552           tree type = ctx;
10553           while (type)
10554             {
10555               maybe_build_thisn_access_method (type);
10556               if (inherits_from_p (type, DECL_CONTEXT (md)))
10557                 {
10558                   ta = build_access_to_thisn (ctx, type, 0);
10559                   break;
10560                 }
10561               type = (DECL_CONTEXT (TYPE_NAME (type)) ?
10562                       TREE_TYPE (DECL_CONTEXT (TYPE_NAME (type))) : NULL_TREE);
10563             }
10564         }
10565       ta = java_complete_tree (ta);
10566     }
10567
10568   /* We might have to use an access method to get to MD. We can
10569      break the method access rule as far as we're not generating
10570      bytecode */
10571   if (METHOD_PRIVATE (md) && flag_emit_class_files)
10572     {
10573       md = build_outer_method_access_method (md);
10574       to_return = 1;
10575     }
10576
10577   *mdecl = md;
10578   *this_arg = ta;
10579
10580   /* Returnin a nonzero value indicates we were doing a non static
10581      method invokation that is now a static invocation. It will have
10582      callee displace `this' to insert it in the regular argument
10583      list. */
10584   return (non_static_context && to_return);
10585 }
10586
10587 /* Patch an invoke expression METHOD and ARGS, based on its invocation
10588    mode.  */
10589
10590 static tree
10591 patch_invoke (tree patch, tree method, tree args)
10592 {
10593   tree dtable, func;
10594   tree original_call, t, ta;
10595   tree check = NULL_TREE;
10596
10597   /* Last step for args: convert build-in types. If we're dealing with
10598      a new TYPE() type call, the first argument to the constructor
10599      isn't found in the incoming argument list, but delivered by
10600      `new' */
10601   t = TYPE_ARG_TYPES (TREE_TYPE (method));
10602   if (TREE_CODE (patch) == NEW_CLASS_EXPR)
10603     t = TREE_CHAIN (t);
10604   for (ta = args; t != end_params_node && ta;
10605        t = TREE_CHAIN (t), ta = TREE_CHAIN (ta))
10606     if (JPRIMITIVE_TYPE_P (TREE_TYPE (TREE_VALUE (ta))) &&
10607         TREE_TYPE (TREE_VALUE (ta)) != TREE_VALUE (t))
10608       TREE_VALUE (ta) = convert (TREE_VALUE (t), TREE_VALUE (ta));
10609
10610   /* Resolve unresolved returned type isses */
10611   t = TREE_TYPE (TREE_TYPE (method));
10612   if (TREE_CODE (t) == POINTER_TYPE && !CLASS_LOADED_P (TREE_TYPE (t)))
10613     resolve_and_layout (TREE_TYPE (t), NULL);
10614
10615   if (flag_emit_class_files || flag_emit_xref)
10616     func = method;
10617   else
10618     {
10619       switch (invocation_mode (method, CALL_USING_SUPER (patch)))
10620         {
10621         case INVOKE_VIRTUAL:
10622           dtable = invoke_build_dtable (0, args);
10623           func = build_invokevirtual (dtable, method);
10624           break;
10625
10626         case INVOKE_NONVIRTUAL:
10627           /* If the object for the method call is null, we throw an
10628              exception.  We don't do this if the object is the current
10629              method's `this'.  In other cases we just rely on an
10630              optimization pass to eliminate redundant checks.  */
10631           if (TREE_VALUE (args) != current_this)
10632             {
10633               /* We use a save_expr here to make sure we only evaluate
10634                  the new `self' expression once.  */
10635               tree save_arg = save_expr (TREE_VALUE (args));
10636               TREE_VALUE (args) = save_arg;
10637               check = java_check_reference (save_arg, 1);
10638             }
10639           /* Fall through.  */
10640
10641         case INVOKE_SUPER:
10642         case INVOKE_STATIC:
10643           {
10644             tree signature = build_java_signature (TREE_TYPE (method));
10645             func = build_known_method_ref (method, TREE_TYPE (method),
10646                                            DECL_CONTEXT (method),
10647                                            signature, args);
10648           }
10649           break;
10650
10651         case INVOKE_INTERFACE:
10652           dtable = invoke_build_dtable (1, args);
10653           func = build_invokeinterface (dtable, method);
10654           break;
10655
10656         default:
10657           abort ();
10658         }
10659
10660       /* Ensure self_type is initialized, (invokestatic). FIXME */
10661       func = build1 (NOP_EXPR, build_pointer_type (TREE_TYPE (method)), func);
10662     }
10663
10664   TREE_TYPE (patch) = TREE_TYPE (TREE_TYPE (method));
10665   TREE_OPERAND (patch, 0) = func;
10666   TREE_OPERAND (patch, 1) = args;
10667   patch = check_for_builtin (method, patch);
10668   original_call = patch;
10669
10670   /* We're processing a `new TYPE ()' form. New is called and its
10671      returned value is the first argument to the constructor. We build
10672      a COMPOUND_EXPR and use saved expression so that the overall NEW
10673      expression value is a pointer to a newly created and initialized
10674      class. */
10675   if (TREE_CODE (original_call) == NEW_CLASS_EXPR)
10676     {
10677       tree class = DECL_CONTEXT (method);
10678       tree c1, saved_new, size, new;
10679       tree alloc_node;
10680
10681       if (flag_emit_class_files || flag_emit_xref)
10682         {
10683           TREE_TYPE (patch) = build_pointer_type (class);
10684           return patch;
10685         }
10686       if (!TYPE_SIZE (class))
10687         safe_layout_class (class);
10688       size = size_in_bytes (class);
10689       alloc_node =
10690         (class_has_finalize_method (class) ? alloc_object_node
10691                                            : alloc_no_finalizer_node);
10692       new = build (CALL_EXPR, promote_type (class),
10693                    build_address_of (alloc_node),
10694                    tree_cons (NULL_TREE, build_class_ref (class),
10695                               build_tree_list (NULL_TREE,
10696                                                size_in_bytes (class))),
10697                    NULL_TREE);
10698       saved_new = save_expr (new);
10699       c1 = build_tree_list (NULL_TREE, saved_new);
10700       TREE_CHAIN (c1) = TREE_OPERAND (original_call, 1);
10701       TREE_OPERAND (original_call, 1) = c1;
10702       TREE_SET_CODE (original_call, CALL_EXPR);
10703       patch = build (COMPOUND_EXPR, TREE_TYPE (new), patch, saved_new);
10704     }
10705
10706   /* If CHECK is set, then we are building a check to see if the object
10707      is NULL.  */
10708   if (check != NULL_TREE)
10709     {
10710       /* We have to call force_evaluation_order now because creating a
10711          COMPOUND_EXPR wraps the arg list in a way that makes it
10712          unrecognizable by force_evaluation_order later.  Yuk.  */
10713       patch = build (COMPOUND_EXPR, TREE_TYPE (patch), check,
10714                      force_evaluation_order (patch));
10715       TREE_SIDE_EFFECTS (patch) = 1;
10716     }
10717
10718   /* In order to be able to modify PATCH later, we SAVE_EXPR it and
10719      put it as the first expression of a COMPOUND_EXPR. The second
10720      expression being an empty statement to be later patched if
10721      necessary. We remember a TREE_LIST (the PURPOSE is the method,
10722      the VALUE is the compound) in a hashtable and return a
10723      COMPOUND_EXPR built so that the result of the evaluation of the
10724      original PATCH node is returned. */
10725   if (STATIC_CLASS_INIT_OPT_P ()
10726       && current_function_decl && METHOD_STATIC (method))
10727     {
10728       tree list;
10729       tree fndecl = current_function_decl;
10730       /* We have to call force_evaluation_order now because creating a
10731          COMPOUND_EXPR wraps the arg list in a way that makes it
10732          unrecognizable by force_evaluation_order later.  Yuk.  */
10733       tree save = save_expr (force_evaluation_order (patch));
10734       tree type = TREE_TYPE (patch);
10735
10736       patch = build (COMPOUND_EXPR, type, save, empty_stmt_node);
10737       list = tree_cons (method, patch,
10738                         DECL_FUNCTION_STATIC_METHOD_INVOCATION_COMPOUND (fndecl));
10739
10740       DECL_FUNCTION_STATIC_METHOD_INVOCATION_COMPOUND (fndecl) = list;
10741
10742       patch = build (COMPOUND_EXPR, type, patch, save);
10743     }
10744
10745   return patch;
10746 }
10747
10748 static int
10749 invocation_mode (tree method, int super)
10750 {
10751   int access = get_access_flags_from_decl (method);
10752
10753   if (super)
10754     return INVOKE_SUPER;
10755
10756   if (access & ACC_STATIC)
10757     return INVOKE_STATIC;
10758
10759   /* We have to look for a constructor before we handle nonvirtual
10760      calls; otherwise the constructor will look nonvirtual.  */
10761   if (DECL_CONSTRUCTOR_P (method))
10762     return INVOKE_STATIC;
10763
10764   if (access & ACC_FINAL || access & ACC_PRIVATE)
10765     return INVOKE_NONVIRTUAL;
10766
10767   if (CLASS_FINAL (TYPE_NAME (DECL_CONTEXT (method))))
10768     return INVOKE_NONVIRTUAL;
10769
10770   if (CLASS_INTERFACE (TYPE_NAME (DECL_CONTEXT (method))))
10771     return INVOKE_INTERFACE;
10772
10773   return INVOKE_VIRTUAL;
10774 }
10775
10776 /* Retrieve a refined list of matching methods. It covers the step
10777    15.11.2 (Compile-Time Step 2) */
10778
10779 static tree
10780 lookup_method_invoke (int lc, tree cl, tree class, tree name, tree arg_list)
10781 {
10782   tree atl = end_params_node;           /* Arg Type List */
10783   tree method, signature, list, node;
10784   const char *candidates;               /* Used for error report */
10785   char *dup;
10786
10787   /* Fix the arguments */
10788   for (node = arg_list; node; node = TREE_CHAIN (node))
10789     {
10790       tree current_arg = TREE_TYPE (TREE_VALUE (node));
10791       /* Non primitive type may have to be resolved */
10792       if (!JPRIMITIVE_TYPE_P (current_arg))
10793         resolve_and_layout (current_arg, NULL_TREE);
10794       /* And promoted */
10795       if (TREE_CODE (current_arg) == RECORD_TYPE)
10796         current_arg = promote_type (current_arg);
10797       atl = tree_cons (NULL_TREE, current_arg, atl);
10798     }
10799
10800   /* Presto. If we're dealing with an anonymous class and a
10801      constructor call, generate the right constructor now, since we
10802      know the arguments' types. */
10803
10804   if (lc && ANONYMOUS_CLASS_P (class))
10805     {
10806       tree saved_current_class;
10807       tree mdecl = craft_constructor (TYPE_NAME (class), atl);
10808       saved_current_class = current_class;
10809       current_class = class;
10810       fix_constructors (mdecl);
10811       current_class = saved_current_class;
10812     }
10813
10814   /* Find all candidates and then refine the list, searching for the
10815      most specific method. */
10816   list = find_applicable_accessible_methods_list (lc, class, name, atl);
10817   list = find_most_specific_methods_list (list);
10818   if (list && !TREE_CHAIN (list))
10819     return TREE_VALUE (list);
10820
10821   /* Issue an error. List candidates if any. Candidates are listed
10822      only if accessible (non accessible methods may end-up here for
10823      the sake of a better error report). */
10824   candidates = NULL;
10825   if (list)
10826     {
10827       tree current;
10828       obstack_grow (&temporary_obstack, ". Candidates are:\n", 18);
10829       for (current = list; current; current = TREE_CHAIN (current))
10830         {
10831           tree cm = TREE_VALUE (current);
10832           char string [4096];
10833           if (!cm || not_accessible_p (class, cm, NULL_TREE, 0))
10834             continue;
10835           sprintf
10836             (string, "  `%s' in `%s'%s",
10837              get_printable_method_name (cm),
10838              IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (DECL_CONTEXT (cm)))),
10839              (TREE_CHAIN (current) ? "\n" : ""));
10840           obstack_grow (&temporary_obstack, string, strlen (string));
10841         }
10842       obstack_1grow (&temporary_obstack, '\0');
10843       candidates = obstack_finish (&temporary_obstack);
10844     }
10845   /* Issue the error message */
10846   method = make_node (FUNCTION_TYPE);
10847   TYPE_ARG_TYPES (method) = atl;
10848   signature = build_java_argument_signature (method);
10849   dup = xstrdup (lang_printable_name (class, 0));
10850   parse_error_context (cl, "Can't find %s `%s(%s)' in type `%s'%s",
10851                        (lc ? "constructor" : "method"),
10852                        (lc ? dup : IDENTIFIER_POINTER (name)),
10853                        IDENTIFIER_POINTER (signature), dup,
10854                        (candidates ? candidates : ""));
10855   free (dup);
10856   return NULL_TREE;
10857 }
10858
10859 /* 15.11.2.1: Find Methods that are Applicable and Accessible. LC is 1
10860    when we're looking for a constructor. */
10861
10862 static tree
10863 find_applicable_accessible_methods_list (int lc, tree class, tree name,
10864                                          tree arglist)
10865 {
10866   static htab_t searched_classes;
10867   static int search_not_done = 0;
10868   tree list = NULL_TREE, all_list = NULL_TREE;
10869
10870   /* Check the hash table to determine if this class has been searched
10871      already. */
10872   if (searched_classes)
10873     {
10874       if (htab_find (searched_classes, class) != NULL)
10875         return NULL;
10876     }
10877   else
10878     {
10879       searched_classes = htab_create (10, htab_hash_pointer,
10880                                       htab_eq_pointer, NULL);
10881     }
10882
10883   search_not_done++;
10884   *htab_find_slot (searched_classes, class, INSERT) = class;
10885
10886   if (!CLASS_LOADED_P (class) && !CLASS_FROM_SOURCE_P (class))
10887     {
10888       load_class (class, 1);
10889       safe_layout_class (class);
10890     }
10891
10892   /* Search interfaces */
10893   if (TREE_CODE (TYPE_NAME (class)) == TYPE_DECL
10894       && CLASS_INTERFACE (TYPE_NAME (class)))
10895     {
10896       int i, n;
10897       tree basetype_vec = TYPE_BINFO_BASETYPES (class);
10898       search_applicable_methods_list (lc, TYPE_METHODS (class),
10899                                       name, arglist, &list, &all_list);
10900       n = TREE_VEC_LENGTH (basetype_vec);
10901       for (i = 1; i < n; i++)
10902         {
10903           tree t = BINFO_TYPE (TREE_VEC_ELT (basetype_vec, i));
10904           tree rlist;
10905
10906           rlist = find_applicable_accessible_methods_list (lc,  t, name,
10907                                                            arglist);
10908           list = chainon (rlist, list);
10909         }
10910     }
10911   /* Search classes */
10912   else
10913     {
10914       search_applicable_methods_list (lc, TYPE_METHODS (class),
10915                                       name, arglist, &list, &all_list);
10916
10917       /* When looking finit$, class$ or instinit$, we turn LC to 1 so
10918          that we only search in class. Note that we should have found
10919          something at this point. */
10920       if (ID_FINIT_P (name) || ID_CLASSDOLLAR_P (name) || ID_INSTINIT_P (name))
10921         {
10922           lc = 1;
10923           if (!list)
10924             abort ();
10925         }
10926
10927       /* We must search all interfaces of this class */
10928       if (!lc)
10929       {
10930         tree basetype_vec = TYPE_BINFO_BASETYPES (class);
10931         int n = TREE_VEC_LENGTH (basetype_vec), i;
10932         for (i = 1; i < n; i++)
10933           {
10934             tree t = BINFO_TYPE (TREE_VEC_ELT (basetype_vec, i));
10935             if (t != object_type_node)
10936               {
10937                 tree rlist
10938                   = find_applicable_accessible_methods_list (lc, t,
10939                                                              name, arglist);
10940                 list = chainon (rlist, list);
10941               }
10942           }
10943       }
10944
10945       /* Search superclass */
10946       if (!lc && CLASSTYPE_SUPER (class) != NULL_TREE)
10947         {
10948           tree rlist;
10949           class = CLASSTYPE_SUPER (class);
10950           rlist = find_applicable_accessible_methods_list (lc, class,
10951                                                            name, arglist);
10952           list = chainon (rlist, list);
10953         }
10954     }
10955
10956   search_not_done--;
10957
10958   /* We're done. Reset the searched classes list and finally search
10959      java.lang.Object if it wasn't searched already. */
10960   if (!search_not_done)
10961     {
10962       if (!lc
10963           && TYPE_METHODS (object_type_node)
10964           && htab_find (searched_classes, object_type_node) == NULL)
10965         {
10966           search_applicable_methods_list (lc,
10967                                           TYPE_METHODS (object_type_node),
10968                                           name, arglist, &list, &all_list);
10969         }
10970       htab_delete (searched_classes);
10971       searched_classes = NULL;
10972     }
10973
10974   /* Either return the list obtained or all selected (but
10975      inaccessible) methods for better error report. */
10976   return (!list ? all_list : list);
10977 }
10978
10979 /* Effectively search for the appropriate method in method */
10980
10981 static void
10982 search_applicable_methods_list (int lc, tree method, tree name, tree arglist,
10983                                 tree *list, tree *all_list)
10984 {
10985   for (; method; method = TREE_CHAIN (method))
10986     {
10987       /* When dealing with constructor, stop here, otherwise search
10988          other classes */
10989       if (lc && !DECL_CONSTRUCTOR_P (method))
10990         continue;
10991       else if (!lc && (DECL_CONSTRUCTOR_P (method)
10992                        || (DECL_NAME (method) != name)))
10993         continue;
10994
10995       if (argument_types_convertible (method, arglist))
10996         {
10997           /* Retain accessible methods only */
10998           if (!not_accessible_p (DECL_CONTEXT (current_function_decl),
10999                                  method, NULL_TREE, 0))
11000             *list = tree_cons (NULL_TREE, method, *list);
11001           else
11002             /* Also retain all selected method here */
11003             *all_list = tree_cons (NULL_TREE, method, *list);
11004         }
11005     }
11006 }
11007
11008 /* 15.11.2.2 Choose the Most Specific Method */
11009
11010 static tree
11011 find_most_specific_methods_list (tree list)
11012 {
11013   int max = 0;
11014   int abstract, candidates;
11015   tree current, new_list = NULL_TREE;
11016   for (current = list; current; current = TREE_CHAIN (current))
11017     {
11018       tree method;
11019       DECL_SPECIFIC_COUNT (TREE_VALUE (current)) = 0;
11020
11021       for (method = list; method; method = TREE_CHAIN (method))
11022         {
11023           tree method_v, current_v;
11024           /* Don't test a method against itself */
11025           if (method == current)
11026             continue;
11027
11028           method_v = TREE_VALUE (method);
11029           current_v = TREE_VALUE (current);
11030
11031           /* Compare arguments and location where methods where declared */
11032           if (argument_types_convertible (method_v, current_v))
11033             {
11034               if (valid_method_invocation_conversion_p
11035                   (DECL_CONTEXT (method_v), DECL_CONTEXT (current_v))
11036                   || (INNER_CLASS_TYPE_P (DECL_CONTEXT (current_v))
11037                       && enclosing_context_p (DECL_CONTEXT (method_v),
11038                                               DECL_CONTEXT (current_v))))
11039                 {
11040                   int v = (DECL_SPECIFIC_COUNT (current_v) +=
11041                     (INNER_CLASS_TYPE_P (DECL_CONTEXT (current_v)) ? 2 : 1));
11042                   max = (v > max ? v : max);
11043                 }
11044             }
11045         }
11046     }
11047
11048   /* Review the list and select the maximally specific methods */
11049   for (current = list, abstract = -1, candidates = -1;
11050        current; current = TREE_CHAIN (current))
11051     if (DECL_SPECIFIC_COUNT (TREE_VALUE (current)) == max)
11052       {
11053         new_list = tree_cons (NULL_TREE, TREE_VALUE (current), new_list);
11054         abstract += (METHOD_ABSTRACT (TREE_VALUE (current)) ? 1 : 0);
11055         candidates++;
11056       }
11057
11058   /* If we have several and they're all abstract, just pick the
11059      closest one. */
11060   if (candidates > 0 && (candidates == abstract))
11061     {
11062       new_list = nreverse (new_list);
11063       TREE_CHAIN (new_list) = NULL_TREE;
11064     }
11065
11066   /* We have several (we couldn't find a most specific), all but one
11067      are abstract, we pick the only non abstract one. */
11068   if (candidates > 0 && (candidates == abstract+1))
11069     {
11070       for (current = new_list; current; current = TREE_CHAIN (current))
11071         if (!METHOD_ABSTRACT (TREE_VALUE (current)))
11072           {
11073             TREE_CHAIN (current) = NULL_TREE;
11074             new_list = current;
11075           }
11076     }
11077
11078   /* If we can't find one, lower expectations and try to gather multiple
11079      maximally specific methods */
11080   while (!new_list && max)
11081     {
11082       while (--max > 0)
11083         {
11084           if (DECL_SPECIFIC_COUNT (TREE_VALUE (current)) == max)
11085             new_list = tree_cons (NULL_TREE, TREE_VALUE (current), new_list);
11086         }
11087     }
11088
11089   return new_list;
11090 }
11091
11092 /* Make sure that the type of each M2_OR_ARGLIST arguments can be
11093    converted by method invocation conversion (5.3) to the type of the
11094    corresponding parameter of M1. Implementation expects M2_OR_ARGLIST
11095    to change less often than M1. */
11096
11097 static GTY(()) tree m2_arg_value;
11098 static GTY(()) tree m2_arg_cache;
11099
11100 static int
11101 argument_types_convertible (tree m1, tree m2_or_arglist)
11102 {
11103   register tree m1_arg, m2_arg;
11104
11105   SKIP_THIS_AND_ARTIFICIAL_PARMS (m1_arg, m1)
11106
11107   if (m2_arg_value == m2_or_arglist)
11108     m2_arg = m2_arg_cache;
11109   else
11110     {
11111       /* M2_OR_ARGLIST can be a function DECL or a raw list of
11112          argument types */
11113       if (m2_or_arglist && TREE_CODE (m2_or_arglist) == FUNCTION_DECL)
11114         {
11115           m2_arg = TYPE_ARG_TYPES (TREE_TYPE (m2_or_arglist));
11116           if (!METHOD_STATIC (m2_or_arglist))
11117             m2_arg = TREE_CHAIN (m2_arg);
11118         }
11119       else
11120         m2_arg = m2_or_arglist;
11121
11122       m2_arg_value = m2_or_arglist;
11123       m2_arg_cache = m2_arg;
11124     }
11125
11126   while (m1_arg != end_params_node && m2_arg != end_params_node)
11127     {
11128       resolve_and_layout (TREE_VALUE (m1_arg), NULL_TREE);
11129       if (!valid_method_invocation_conversion_p (TREE_VALUE (m1_arg),
11130                                                  TREE_VALUE (m2_arg)))
11131         break;
11132       m1_arg = TREE_CHAIN (m1_arg);
11133       m2_arg = TREE_CHAIN (m2_arg);
11134     }
11135   return m1_arg == end_params_node && m2_arg == end_params_node;
11136 }
11137
11138 /* Qualification routines */
11139
11140 static void
11141 qualify_ambiguous_name (tree id)
11142 {
11143   tree qual, qual_wfl, name = NULL_TREE, decl, ptr_type = NULL_TREE,
11144     saved_current_class;
11145   int again, super_found = 0, this_found = 0, new_array_found = 0;
11146   int code;
11147
11148   /* We first qualify the first element, then derive qualification of
11149      others based on the first one. If the first element is qualified
11150      by a resolution (field or type), this resolution is stored in the
11151      QUAL_RESOLUTION of the qual element being examined. We need to
11152      save the current_class since the use of SUPER might change the
11153      its value. */
11154   saved_current_class = current_class;
11155   qual = EXPR_WFL_QUALIFICATION (id);
11156   do {
11157
11158     /* Simple qualified expression feature a qual_wfl that is a
11159        WFL. Expression derived from a primary feature more complicated
11160        things like a CALL_EXPR. Expression from primary need to be
11161        worked out to extract the part on which the qualification will
11162        take place. */
11163     qual_wfl = QUAL_WFL (qual);
11164     switch (TREE_CODE (qual_wfl))
11165       {
11166       case CALL_EXPR:
11167         qual_wfl = TREE_OPERAND (qual_wfl, 0);
11168         if (TREE_CODE (qual_wfl) != EXPR_WITH_FILE_LOCATION
11169             || (EXPR_WFL_QUALIFICATION (qual_wfl)
11170                 && TREE_CODE (EXPR_WFL_QUALIFICATION (qual_wfl)) == TREE_LIST))
11171           {
11172             qual = EXPR_WFL_QUALIFICATION (qual_wfl);
11173             qual_wfl = QUAL_WFL (qual);
11174           }
11175         break;
11176       case NEW_ARRAY_EXPR:
11177       case NEW_ANONYMOUS_ARRAY_EXPR:
11178         qual = TREE_CHAIN (qual);
11179         again = new_array_found = 1;
11180         continue;
11181       case CONVERT_EXPR:
11182         break;
11183       case NEW_CLASS_EXPR:
11184         qual_wfl = TREE_OPERAND (qual_wfl, 0);
11185         break;
11186       case ARRAY_REF:
11187         while (TREE_CODE (qual_wfl) == ARRAY_REF)
11188           qual_wfl = TREE_OPERAND (qual_wfl, 0);
11189         break;
11190       case STRING_CST:
11191         qual = TREE_CHAIN (qual);
11192         qual_wfl = QUAL_WFL (qual);
11193         break;
11194       case CLASS_LITERAL:
11195         qual = TREE_CHAIN (qual);
11196         qual_wfl = QUAL_WFL (qual);
11197       break;
11198       default:
11199         /* Fix for -Wall. Just break doing nothing */
11200         break;
11201       }
11202
11203     ptr_type = current_class;
11204     again = 0;
11205     code = TREE_CODE (qual_wfl);
11206
11207     /* Pos evaluation: non WFL leading expression nodes */
11208     if (code == CONVERT_EXPR
11209         && TREE_CODE (TREE_TYPE (qual_wfl)) == EXPR_WITH_FILE_LOCATION)
11210       name = EXPR_WFL_NODE (TREE_TYPE (qual_wfl));
11211
11212     else if (code == INTEGER_CST)
11213       name = qual_wfl;
11214
11215     else if (code == CONVERT_EXPR &&
11216              TREE_CODE (TREE_OPERAND (qual_wfl, 0)) == EXPR_WITH_FILE_LOCATION)
11217       name = TREE_OPERAND (qual_wfl, 0);
11218
11219     else if (code == CONVERT_EXPR
11220              && TREE_CODE (TREE_OPERAND (qual_wfl, 0)) == CALL_EXPR
11221              && (TREE_CODE (TREE_OPERAND (TREE_OPERAND (qual_wfl, 0), 0))
11222                  == EXPR_WITH_FILE_LOCATION))
11223       name = TREE_OPERAND (TREE_OPERAND (qual_wfl, 0), 0);
11224
11225     else if ((code == ARRAY_REF || code == CALL_EXPR || code == MODIFY_EXPR) &&
11226              TREE_CODE (TREE_OPERAND (qual_wfl, 0)) == EXPR_WITH_FILE_LOCATION)
11227       name = EXPR_WFL_NODE (TREE_OPERAND (qual_wfl, 0));
11228
11229     else if (code == TREE_LIST)
11230       name = EXPR_WFL_NODE (TREE_PURPOSE (qual_wfl));
11231
11232     else if (code == STRING_CST || code == CONDITIONAL_EXPR
11233              || code == PLUS_EXPR)
11234       {
11235         qual = TREE_CHAIN (qual);
11236         qual_wfl = QUAL_WFL (qual);
11237         again = 1;
11238       }
11239     else
11240       {
11241         name = EXPR_WFL_NODE (qual_wfl);
11242         if (!name)
11243           {
11244             qual = EXPR_WFL_QUALIFICATION (qual_wfl);
11245             again = 1;
11246           }
11247       }
11248
11249     /* If we have a THIS (from a primary), we set the context accordingly */
11250     if (name == this_identifier_node)
11251       {
11252         /* This isn't really elegant. One more added irregularity
11253            before I start using COMPONENT_REF (hopefully very soon.)  */
11254         if (TREE_CODE (TREE_PURPOSE (qual)) == ARRAY_REF
11255             && TREE_CODE (TREE_OPERAND (TREE_PURPOSE (qual), 0)) ==
11256                EXPR_WITH_FILE_LOCATION
11257             && EXPR_WFL_NODE (TREE_OPERAND (TREE_PURPOSE (qual), 0)) ==
11258                this_identifier_node)
11259             {
11260               qual = TREE_OPERAND (TREE_PURPOSE (qual), 0);
11261               qual = EXPR_WFL_QUALIFICATION (qual);
11262             }
11263         qual = TREE_CHAIN (qual);
11264         qual_wfl = QUAL_WFL (qual);
11265         if (TREE_CODE (qual_wfl) == CALL_EXPR)
11266           again = 1;
11267         else if (TREE_CODE (qual_wfl) == EXPR_WITH_FILE_LOCATION)
11268           name = EXPR_WFL_NODE (qual_wfl);
11269         else if (TREE_CODE (qual_wfl) == NEW_CLASS_EXPR)
11270           name = TREE_OPERAND (qual_wfl, 0);
11271         this_found = 1;
11272       }
11273     /* If we have a SUPER, we set the context accordingly */
11274     if (name == super_identifier_node)
11275       {
11276         current_class = CLASSTYPE_SUPER (ptr_type);
11277         /* Check that there is such a thing as a super class. If not,
11278            return.  The error will be caught later on, during the
11279            resolution */
11280         if (!current_class)
11281           {
11282             current_class = saved_current_class;
11283             return;
11284           }
11285         qual = TREE_CHAIN (qual);
11286         /* Do one more interation to set things up */
11287         super_found = again = 1;
11288       }
11289   } while (again);
11290
11291   /* If name appears within the scope of a local variable declaration
11292      or parameter declaration, then it is an expression name. We don't
11293      carry this test out if we're in the context of the use of SUPER
11294      or THIS */
11295   if (!this_found && !super_found
11296       && TREE_CODE (name) != STRING_CST && TREE_CODE (name) != INTEGER_CST
11297       && (decl = IDENTIFIER_LOCAL_VALUE (name)))
11298     {
11299       RESOLVE_EXPRESSION_NAME_P (qual_wfl) = 1;
11300       QUAL_RESOLUTION (qual) = decl;
11301     }
11302
11303   /* If within the class/interface NAME was found to be used there
11304      exists a (possibly inherited) field named NAME, then this is an
11305      expression name. If we saw a NEW_ARRAY_EXPR before and want to
11306      address length, it is OK. */
11307   else if ((decl = lookup_field_wrapper (ptr_type, name))
11308            || name == length_identifier_node)
11309     {
11310       RESOLVE_EXPRESSION_NAME_P (qual_wfl) = 1;
11311       QUAL_RESOLUTION (qual) = (new_array_found ? NULL_TREE : decl);
11312     }
11313
11314   /* We reclassify NAME as yielding to a type name resolution if:
11315      - NAME is a class/interface declared within the compilation
11316        unit containing NAME,
11317      - NAME is imported via a single-type-import declaration,
11318      - NAME is declared in an another compilation unit of the package
11319        of the compilation unit containing NAME,
11320      - NAME is declared by exactly on type-import-on-demand declaration
11321      of the compilation unit containing NAME.
11322      - NAME is actually a STRING_CST.
11323      This can't happen if the expression was qualified by `this.' */
11324   else if (! this_found &&
11325            (TREE_CODE (name) == STRING_CST ||
11326             TREE_CODE (name) == INTEGER_CST ||
11327             (decl = resolve_and_layout (name, NULL_TREE))))
11328     {
11329       RESOLVE_TYPE_NAME_P (qual_wfl) = 1;
11330       QUAL_RESOLUTION (qual) = decl;
11331     }
11332
11333   /* Method call, array references and cast are expression name */
11334   else if (TREE_CODE (QUAL_WFL (qual)) == CALL_EXPR
11335            || TREE_CODE (QUAL_WFL (qual)) == ARRAY_REF
11336            || TREE_CODE (QUAL_WFL (qual)) == CONVERT_EXPR
11337            || TREE_CODE (QUAL_WFL (qual)) == MODIFY_EXPR)
11338     RESOLVE_EXPRESSION_NAME_P (qual_wfl) = 1;
11339
11340   /* Check here that NAME isn't declared by more than one
11341      type-import-on-demand declaration of the compilation unit
11342      containing NAME. FIXME */
11343
11344   /* Otherwise, NAME is reclassified as a package name */
11345   else
11346     RESOLVE_PACKAGE_NAME_P (qual_wfl) = 1;
11347
11348   /* Propagate the qualification accross other components of the
11349      qualified name */
11350   for (qual = TREE_CHAIN (qual); qual;
11351        qual_wfl = QUAL_WFL (qual), qual = TREE_CHAIN (qual))
11352     {
11353       if (RESOLVE_PACKAGE_NAME_P (qual_wfl))
11354         RESOLVE_PACKAGE_NAME_P (QUAL_WFL (qual)) = 1;
11355       else
11356         RESOLVE_EXPRESSION_NAME_P (QUAL_WFL (qual)) = 1;
11357     }
11358
11359   /* Store the global qualification for the ambiguous part of ID back
11360      into ID fields */
11361   if (RESOLVE_EXPRESSION_NAME_P (qual_wfl))
11362     RESOLVE_EXPRESSION_NAME_P (id) = 1;
11363   else if (RESOLVE_TYPE_NAME_P (qual_wfl))
11364     RESOLVE_TYPE_NAME_P (id) = 1;
11365   else if (RESOLVE_PACKAGE_NAME_P (qual_wfl))
11366     RESOLVE_PACKAGE_NAME_P (id) = 1;
11367
11368   /* Restore the current class */
11369   current_class = saved_current_class;
11370 }
11371
11372 static int
11373 breakdown_qualified (tree *left, tree *right, tree source)
11374 {
11375   char *p, *base;
11376   int l = IDENTIFIER_LENGTH (source);
11377
11378   base = alloca (l + 1);
11379   memcpy (base, IDENTIFIER_POINTER (source), l + 1);
11380
11381   /* Breakdown NAME into REMAINDER . IDENTIFIER.  */
11382   p = base + l - 1;
11383   while (*p != '.' && p != base)
11384     p--;
11385
11386   /* We didn't find a '.'. Return an error.  */
11387   if (p == base)
11388     return 1;
11389
11390   *p = '\0';
11391   if (right)
11392     *right = get_identifier (p+1);
11393   *left = get_identifier (base);
11394
11395   return 0;
11396 }
11397
11398 /* Return TRUE if two classes are from the same package. */
11399
11400 static int
11401 in_same_package (tree name1, tree name2)
11402 {
11403   tree tmp;
11404   tree pkg1;
11405   tree pkg2;
11406
11407   if (TREE_CODE (name1) == TYPE_DECL)
11408     name1 = DECL_NAME (name1);
11409   if (TREE_CODE (name2) == TYPE_DECL)
11410     name2 = DECL_NAME (name2);
11411
11412   if (QUALIFIED_P (name1) != QUALIFIED_P (name2))
11413     /* One in empty package. */
11414     return 0;
11415
11416   if (QUALIFIED_P (name1) == 0 && QUALIFIED_P (name2) == 0)
11417     /* Both in empty package. */
11418     return 1;
11419
11420   breakdown_qualified (&pkg1, &tmp, name1);
11421   breakdown_qualified (&pkg2, &tmp, name2);
11422
11423   return (pkg1 == pkg2);
11424 }
11425
11426 /* Patch tree nodes in a function body. When a BLOCK is found, push
11427    local variable decls if present.
11428    Same as java_complete_lhs, but does resolve static finals to values. */
11429
11430 static tree
11431 java_complete_tree (tree node)
11432 {
11433   node = java_complete_lhs (node);
11434   if (JDECL_P (node) && CLASS_FINAL_VARIABLE_P (node)
11435       && DECL_INITIAL (node) != NULL_TREE
11436       && !flag_emit_xref)
11437     {
11438       tree value = fold_constant_for_init (node, node);
11439       if (value != NULL_TREE)
11440         return value;
11441     }
11442   return node;
11443 }
11444
11445 static tree
11446 java_stabilize_reference (tree node)
11447 {
11448   if (TREE_CODE (node) == COMPOUND_EXPR)
11449     {
11450       tree op0 = TREE_OPERAND (node, 0);
11451       tree op1 = TREE_OPERAND (node, 1);
11452       TREE_OPERAND (node, 0) = save_expr (op0);
11453       TREE_OPERAND (node, 1) = java_stabilize_reference (op1);
11454       return node;
11455     }
11456   return stabilize_reference (node);
11457 }
11458
11459 /* Patch tree nodes in a function body. When a BLOCK is found, push
11460    local variable decls if present.
11461    Same as java_complete_tree, but does not resolve static finals to values. */
11462
11463 static tree
11464 java_complete_lhs (tree node)
11465 {
11466   tree nn, cn, wfl_op1, wfl_op2, wfl_op3;
11467   int flag;
11468
11469   /* CONVERT_EXPR always has its type set, even though it needs to be
11470      worked out. */
11471   if (TREE_TYPE (node) && TREE_CODE (node) != CONVERT_EXPR)
11472     return node;
11473
11474   /* The switch block implements cases processing container nodes
11475      first.  Contained nodes are always written back. Leaves come
11476      next and return a value. */
11477   switch (TREE_CODE (node))
11478     {
11479     case BLOCK:
11480
11481       /* 1- Block section.
11482          Set the local values on decl names so we can identify them
11483          faster when they're referenced. At that stage, identifiers
11484          are legal so we don't check for declaration errors. */
11485       for (cn = BLOCK_EXPR_DECLS (node); cn; cn = TREE_CHAIN (cn))
11486         {
11487           DECL_CONTEXT (cn) = current_function_decl;
11488           IDENTIFIER_LOCAL_VALUE (DECL_NAME (cn)) = cn;
11489         }
11490       if (BLOCK_EXPR_BODY (node) == NULL_TREE)
11491           CAN_COMPLETE_NORMALLY (node) = 1;
11492       else
11493         {
11494           tree stmt = BLOCK_EXPR_BODY (node);
11495           tree *ptr;
11496           int error_seen = 0;
11497           if (TREE_CODE (stmt) == COMPOUND_EXPR)
11498             {
11499               /* Re-order from (((A; B); C); ...; Z) to
11500                  (A; (B; (C ; (...; Z)))).
11501                  This makes it easier to scan the statements left-to-right
11502                  without using recursion (which might overflow the stack
11503                  if the block has many statements. */
11504               for (;;)
11505                 {
11506                   tree left = TREE_OPERAND (stmt, 0);
11507                   if (TREE_CODE (left) != COMPOUND_EXPR)
11508                     break;
11509                   TREE_OPERAND (stmt, 0) = TREE_OPERAND (left, 1);
11510                   TREE_OPERAND (left, 1) = stmt;
11511                   stmt = left;
11512                 }
11513               BLOCK_EXPR_BODY (node) = stmt;
11514             }
11515
11516           /* Now do the actual complete, without deep recursion for
11517              long blocks. */
11518           ptr = &BLOCK_EXPR_BODY (node);
11519           while (TREE_CODE (*ptr) == COMPOUND_EXPR
11520                  && TREE_OPERAND (*ptr, 1) != empty_stmt_node)
11521             {
11522               tree cur = java_complete_tree (TREE_OPERAND (*ptr, 0));
11523               tree *next = &TREE_OPERAND (*ptr, 1);
11524               TREE_OPERAND (*ptr, 0) = cur;
11525               if (cur == empty_stmt_node)
11526                 {
11527                   /* Optimization;  makes it easier to detect empty bodies.
11528                      Most useful for <clinit> with all-constant initializer. */
11529                   *ptr = *next;
11530                   continue;
11531                 }
11532               if (TREE_CODE (cur) == ERROR_MARK)
11533                 error_seen++;
11534               else if (! CAN_COMPLETE_NORMALLY (cur))
11535                 {
11536                   wfl_op2 = *next;
11537                   for (;;)
11538                     {
11539                       if (TREE_CODE (wfl_op2) == BLOCK)
11540                         wfl_op2 = BLOCK_EXPR_BODY (wfl_op2);
11541                       else if (TREE_CODE (wfl_op2) == COMPOUND_EXPR)
11542                         wfl_op2 = TREE_OPERAND (wfl_op2, 0);
11543                       else
11544                         break;
11545                     }
11546                   if (TREE_CODE (wfl_op2) != CASE_EXPR
11547                       && TREE_CODE (wfl_op2) != DEFAULT_EXPR)
11548                     unreachable_stmt_error (*ptr);
11549                 }
11550               ptr = next;
11551             }
11552           *ptr = java_complete_tree (*ptr);
11553
11554           if (TREE_CODE (*ptr) == ERROR_MARK || error_seen > 0)
11555             return error_mark_node;
11556           CAN_COMPLETE_NORMALLY (node) = CAN_COMPLETE_NORMALLY (*ptr);
11557         }
11558       /* Turn local bindings to null */
11559       for (cn = BLOCK_EXPR_DECLS (node); cn; cn = TREE_CHAIN (cn))
11560         IDENTIFIER_LOCAL_VALUE (DECL_NAME (cn)) = NULL_TREE;
11561
11562       TREE_TYPE (node) = void_type_node;
11563       break;
11564
11565       /* 2- They are expressions but ultimately deal with statements */
11566
11567     case THROW_EXPR:
11568       wfl_op1 = TREE_OPERAND (node, 0);
11569       COMPLETE_CHECK_OP_0 (node);
11570       /* 14.19 A throw statement cannot complete normally. */
11571       CAN_COMPLETE_NORMALLY (node) = 0;
11572       return patch_throw_statement (node, wfl_op1);
11573
11574     case SYNCHRONIZED_EXPR:
11575       wfl_op1 = TREE_OPERAND (node, 0);
11576       return patch_synchronized_statement (node, wfl_op1);
11577
11578     case TRY_EXPR:
11579       return patch_try_statement (node);
11580
11581     case TRY_FINALLY_EXPR:
11582       COMPLETE_CHECK_OP_0 (node);
11583       COMPLETE_CHECK_OP_1 (node);
11584       if (TREE_OPERAND (node, 0) == empty_stmt_node)
11585         return TREE_OPERAND (node, 1);
11586       if (TREE_OPERAND (node, 1) == empty_stmt_node)
11587         return TREE_OPERAND (node, 0);
11588       CAN_COMPLETE_NORMALLY (node)
11589         = (CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 0))
11590            && CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 1)));
11591       TREE_TYPE (node) = TREE_TYPE (TREE_OPERAND (node, 0));
11592       return node;
11593
11594     case LABELED_BLOCK_EXPR:
11595       PUSH_LABELED_BLOCK (node);
11596       if (LABELED_BLOCK_BODY (node))
11597         COMPLETE_CHECK_OP_1 (node);
11598       TREE_TYPE (node) = void_type_node;
11599       POP_LABELED_BLOCK ();
11600
11601       if (LABELED_BLOCK_BODY (node) == empty_stmt_node)
11602         {
11603           LABELED_BLOCK_BODY (node) = NULL_TREE;
11604           CAN_COMPLETE_NORMALLY (node) = 1;
11605         }
11606       else if (CAN_COMPLETE_NORMALLY (LABELED_BLOCK_BODY (node)))
11607         CAN_COMPLETE_NORMALLY (node) = 1;
11608       return node;
11609
11610     case EXIT_BLOCK_EXPR:
11611       /* We don't complete operand 1, because it's the return value of
11612          the EXIT_BLOCK_EXPR which doesn't exist it Java */
11613       return patch_bc_statement (node);
11614
11615     case CASE_EXPR:
11616       cn = java_complete_tree (TREE_OPERAND (node, 0));
11617       if (cn == error_mark_node)
11618         return cn;
11619
11620       /* First, the case expression must be constant. Values of final
11621          fields are accepted. */
11622       cn = fold (cn);
11623       if ((TREE_CODE (cn) == COMPOUND_EXPR || TREE_CODE (cn) == COMPONENT_REF)
11624           && JDECL_P (TREE_OPERAND (cn, 1))
11625           && FIELD_FINAL (TREE_OPERAND (cn, 1))
11626           && DECL_INITIAL (TREE_OPERAND (cn, 1)))
11627         {
11628           cn = fold_constant_for_init (DECL_INITIAL (TREE_OPERAND (cn, 1)),
11629                                        TREE_OPERAND (cn, 1));
11630         }
11631       /* Accept final locals too. */
11632       else if (TREE_CODE (cn) == VAR_DECL && DECL_FINAL (cn))
11633         cn = fold_constant_for_init (DECL_INITIAL (cn), cn);
11634
11635       if (!TREE_CONSTANT (cn) && !flag_emit_xref)
11636         {
11637           EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
11638           parse_error_context (node, "Constant expression required");
11639           return error_mark_node;
11640         }
11641
11642       nn = ctxp->current_loop;
11643
11644       /* It must be assignable to the type of the switch expression. */
11645       if (!try_builtin_assignconv (NULL_TREE,
11646                                    TREE_TYPE (TREE_OPERAND (nn, 0)), cn))
11647         {
11648           EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
11649           parse_error_context
11650             (wfl_operator,
11651              "Incompatible type for case. Can't convert `%s' to `int'",
11652              lang_printable_name (TREE_TYPE (cn), 0));
11653           return error_mark_node;
11654         }
11655
11656       cn = fold (convert (int_type_node, cn));
11657       TREE_CONSTANT_OVERFLOW (cn) = 0;
11658       CAN_COMPLETE_NORMALLY (cn) = 1;
11659
11660       /* Save the label on a list so that we can later check for
11661          duplicates.  */
11662       case_label_list = tree_cons (node, cn, case_label_list);
11663
11664       /* Multiple instance of a case label bearing the same value is
11665          checked later. The case expression is all right so far. */
11666       if (TREE_CODE (cn) == VAR_DECL)
11667         cn = DECL_INITIAL (cn);
11668       TREE_OPERAND (node, 0) = cn;
11669       TREE_TYPE (node) = void_type_node;
11670       CAN_COMPLETE_NORMALLY (node) = 1;
11671       TREE_SIDE_EFFECTS (node) = 1;
11672       break;
11673
11674     case DEFAULT_EXPR:
11675       nn = ctxp->current_loop;
11676       /* Only one default label is allowed per switch statement */
11677       if (SWITCH_HAS_DEFAULT (nn))
11678         {
11679           EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
11680           parse_error_context (wfl_operator,
11681                                "Duplicate case label: `default'");
11682           return error_mark_node;
11683         }
11684       else
11685         SWITCH_HAS_DEFAULT (nn) = 1;
11686       TREE_TYPE (node) = void_type_node;
11687       TREE_SIDE_EFFECTS (node) = 1;
11688       CAN_COMPLETE_NORMALLY (node) = 1;
11689       break;
11690
11691     case SWITCH_EXPR:
11692     case LOOP_EXPR:
11693       PUSH_LOOP (node);
11694       /* Check whether the loop was enclosed in a labeled
11695          statement. If not, create one, insert the loop in it and
11696          return the node */
11697       nn = patch_loop_statement (node);
11698
11699       /* Anyways, walk the body of the loop */
11700       if (TREE_CODE (node) == LOOP_EXPR)
11701         TREE_OPERAND (node, 0) = java_complete_tree (TREE_OPERAND (node, 0));
11702       /* Switch statement: walk the switch expression and the cases */
11703       else
11704         node = patch_switch_statement (node);
11705
11706       if (node == error_mark_node || TREE_OPERAND (node, 0) == error_mark_node)
11707         nn = error_mark_node;
11708       else
11709         {
11710           TREE_TYPE (nn) = TREE_TYPE (node) = void_type_node;
11711           /* If we returned something different, that's because we
11712              inserted a label. Pop the label too. */
11713           if (nn != node)
11714             {
11715               if (CAN_COMPLETE_NORMALLY (node))
11716                 CAN_COMPLETE_NORMALLY (nn) = 1;
11717               POP_LABELED_BLOCK ();
11718             }
11719         }
11720       POP_LOOP ();
11721       return nn;
11722
11723     case EXIT_EXPR:
11724       TREE_OPERAND (node, 0) = java_complete_tree (TREE_OPERAND (node, 0));
11725       return patch_exit_expr (node);
11726
11727     case COND_EXPR:
11728       /* Condition */
11729       TREE_OPERAND (node, 0) = java_complete_tree (TREE_OPERAND (node, 0));
11730       if (TREE_OPERAND (node, 0) == error_mark_node)
11731         return error_mark_node;
11732       /* then-else branches */
11733       TREE_OPERAND (node, 1) = java_complete_tree (TREE_OPERAND (node, 1));
11734       if (TREE_OPERAND (node, 1) == error_mark_node)
11735         return error_mark_node;
11736       TREE_OPERAND (node, 2) = java_complete_tree (TREE_OPERAND (node, 2));
11737       if (TREE_OPERAND (node, 2) == error_mark_node)
11738         return error_mark_node;
11739       return patch_if_else_statement (node);
11740       break;
11741
11742     case CONDITIONAL_EXPR:
11743       /* Condition */
11744       wfl_op1 = TREE_OPERAND (node, 0);
11745       COMPLETE_CHECK_OP_0 (node);
11746       wfl_op2 = TREE_OPERAND (node, 1);
11747       COMPLETE_CHECK_OP_1 (node);
11748       wfl_op3 = TREE_OPERAND (node, 2);
11749       COMPLETE_CHECK_OP_2 (node);
11750       return patch_conditional_expr (node, wfl_op1, wfl_op2);
11751
11752       /* 3- Expression section */
11753     case COMPOUND_EXPR:
11754       wfl_op2 = TREE_OPERAND (node, 1);
11755       TREE_OPERAND (node, 0) = nn =
11756         java_complete_tree (TREE_OPERAND (node, 0));
11757       if (wfl_op2 == empty_stmt_node)
11758         CAN_COMPLETE_NORMALLY (node) = CAN_COMPLETE_NORMALLY (nn);
11759       else
11760         {
11761           if (! CAN_COMPLETE_NORMALLY (nn) && TREE_CODE (nn) != ERROR_MARK)
11762             {
11763               /* An unreachable condition in a do-while statement
11764                  is *not* (technically) an unreachable statement. */
11765               nn = wfl_op2;
11766               if (TREE_CODE (nn) == EXPR_WITH_FILE_LOCATION)
11767                 nn = EXPR_WFL_NODE (nn);
11768               /* NN can be NULL_TREE exactly when UPDATE is, in
11769                  finish_for_loop.  */
11770               if (nn != NULL_TREE && TREE_CODE (nn) != EXIT_EXPR)
11771                 {
11772                   SET_WFL_OPERATOR (wfl_operator, node, wfl_op2);
11773                   if (SUPPRESS_UNREACHABLE_ERROR (nn))
11774                     {
11775                       /* Perhaps this warning should have an
11776                          associated flag.  The code being compiled is
11777                          pedantically correct, but useless.  */
11778                       parse_warning_context (wfl_operator,
11779                                              "Unreachable statement");
11780                     }
11781                   else
11782                     parse_error_context (wfl_operator,
11783                                          "Unreachable statement");
11784                 }
11785             }
11786           TREE_OPERAND (node, 1) = java_complete_tree (TREE_OPERAND (node, 1));
11787           if (TREE_OPERAND (node, 1) == error_mark_node)
11788             return error_mark_node;
11789           /* Even though we might allow the case where the first
11790              operand doesn't return normally, we still should compute
11791              CAN_COMPLETE_NORMALLY correctly.  */
11792           CAN_COMPLETE_NORMALLY (node)
11793             = (CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 0))
11794                && CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 1)));
11795         }
11796       TREE_TYPE (node) = TREE_TYPE (TREE_OPERAND (node, 1));
11797       break;
11798
11799     case RETURN_EXPR:
11800       /* CAN_COMPLETE_NORMALLY (node) = 0; */
11801       return patch_return (node);
11802
11803     case EXPR_WITH_FILE_LOCATION:
11804       if (!EXPR_WFL_NODE (node) /* Or a PRIMARY flag ? */
11805           || TREE_CODE (EXPR_WFL_NODE (node)) == IDENTIFIER_NODE)
11806         {
11807           tree wfl = node;
11808           node = resolve_expression_name (node, NULL);
11809           if (node == error_mark_node)
11810             return node;
11811           /* Keep line number information somewhere were it doesn't
11812              disrupt the completion process. */
11813           if (flag_emit_xref && TREE_CODE (node) != CALL_EXPR)
11814             {
11815               EXPR_WFL_NODE (wfl) = TREE_OPERAND (node, 1);
11816               TREE_OPERAND (node, 1) = wfl;
11817             }
11818           CAN_COMPLETE_NORMALLY (node) = 1;
11819         }
11820       else
11821         {
11822           tree body;
11823           int save_lineno = input_line;
11824           input_line = EXPR_WFL_LINENO (node);
11825           body = java_complete_tree (EXPR_WFL_NODE (node));
11826           input_line = save_lineno;
11827           EXPR_WFL_NODE (node) = body;
11828           TREE_SIDE_EFFECTS (node) = TREE_SIDE_EFFECTS (body);
11829           CAN_COMPLETE_NORMALLY (node) = CAN_COMPLETE_NORMALLY (body);
11830           if (body == empty_stmt_node || TREE_CONSTANT (body))
11831             {
11832               /* Makes it easier to constant fold, detect empty bodies. */
11833               return body;
11834             }
11835           if (body == error_mark_node)
11836             {
11837               /* Its important for the evaluation of assignment that
11838                  this mark on the TREE_TYPE is propagated. */
11839               TREE_TYPE (node) = error_mark_node;
11840               return error_mark_node;
11841             }
11842           else
11843             TREE_TYPE (node) = TREE_TYPE (EXPR_WFL_NODE (node));
11844
11845         }
11846       break;
11847
11848     case NEW_ARRAY_EXPR:
11849       /* Patch all the dimensions */
11850       flag = 0;
11851       for (cn = TREE_OPERAND (node, 1); cn; cn = TREE_CHAIN (cn))
11852         {
11853           int location = EXPR_WFL_LINECOL (TREE_VALUE (cn));
11854           tree dim = convert (int_type_node,
11855                               java_complete_tree (TREE_VALUE (cn)));
11856           if (dim == error_mark_node)
11857             {
11858               flag = 1;
11859               continue;
11860             }
11861           else
11862             {
11863               TREE_VALUE (cn) = dim;
11864               /* Setup the location of the current dimension, for
11865                  later error report. */
11866               TREE_PURPOSE (cn) =
11867                 build_expr_wfl (NULL_TREE, input_filename, 0, 0);
11868               EXPR_WFL_LINECOL (TREE_PURPOSE (cn)) = location;
11869             }
11870         }
11871       /* They complete the array creation expression, if no errors
11872          were found. */
11873       CAN_COMPLETE_NORMALLY (node) = 1;
11874       return (flag ? error_mark_node
11875               : force_evaluation_order (patch_newarray (node)));
11876
11877     case NEW_ANONYMOUS_ARRAY_EXPR:
11878       /* Create the array type if necessary. */
11879       if (ANONYMOUS_ARRAY_DIMS_SIG (node))
11880         {
11881           tree type = ANONYMOUS_ARRAY_BASE_TYPE (node);
11882           if (!(type = resolve_type_during_patch (type)))
11883             return error_mark_node;
11884           type = build_array_from_name (type, NULL_TREE,
11885                                         ANONYMOUS_ARRAY_DIMS_SIG (node), NULL);
11886           ANONYMOUS_ARRAY_BASE_TYPE (node) = build_pointer_type (type);
11887         }
11888       node = patch_new_array_init (ANONYMOUS_ARRAY_BASE_TYPE (node),
11889                                    ANONYMOUS_ARRAY_INITIALIZER (node));
11890       if (node == error_mark_node)
11891         return error_mark_node;
11892       CAN_COMPLETE_NORMALLY (node) = 1;
11893       return node;
11894
11895     case NEW_CLASS_EXPR:
11896     case CALL_EXPR:
11897       /* Complete function's argument(s) first */
11898       if (complete_function_arguments (node))
11899         return error_mark_node;
11900       else
11901         {
11902           tree decl, wfl = TREE_OPERAND (node, 0);
11903           int in_this = CALL_THIS_CONSTRUCTOR_P (node);
11904           int from_super = (EXPR_WFL_NODE (TREE_OPERAND (node, 0)) ==
11905                            super_identifier_node);
11906
11907           node = patch_method_invocation (node, NULL_TREE, NULL_TREE,
11908                                           from_super, 0, &decl);
11909           if (node == error_mark_node)
11910             return error_mark_node;
11911
11912           check_thrown_exceptions (EXPR_WFL_LINECOL (node), decl);
11913           /* If we call this(...), register signature and positions */
11914           if (in_this)
11915             DECL_CONSTRUCTOR_CALLS (current_function_decl) =
11916               tree_cons (wfl, decl,
11917                          DECL_CONSTRUCTOR_CALLS (current_function_decl));
11918           CAN_COMPLETE_NORMALLY (node) = 1;
11919           return force_evaluation_order (node);
11920         }
11921
11922     case MODIFY_EXPR:
11923       /* Save potential wfls */
11924       wfl_op1 = TREE_OPERAND (node, 0);
11925       TREE_OPERAND (node, 0) = nn = java_complete_lhs (wfl_op1);
11926
11927       if (MODIFY_EXPR_FROM_INITIALIZATION_P (node)
11928           && TREE_CODE (nn) == VAR_DECL && TREE_STATIC (nn)
11929           && DECL_INITIAL (nn) != NULL_TREE)
11930         {
11931           tree value;
11932
11933           value = fold_constant_for_init (nn, nn);
11934
11935           /* When we have a primitype type, or a string and we're not
11936              emitting a class file, we actually don't want to generate
11937              anything for the assignment. */
11938           if (value != NULL_TREE &&
11939               (JPRIMITIVE_TYPE_P (TREE_TYPE (value)) ||
11940                (TREE_TYPE (value) == string_ptr_type_node &&
11941                 ! flag_emit_class_files)))
11942             {
11943               /* Prepare node for patch_assignment */
11944               TREE_OPERAND (node, 1) = value;
11945               /* Call patch assignment to verify the assignment */
11946               if (patch_assignment (node, wfl_op1) == error_mark_node)
11947                 return error_mark_node;
11948               /* Set DECL_INITIAL properly (a conversion might have
11949                  been decided by patch_assignment) and return the
11950                  empty statement. */
11951               else
11952                 {
11953                   tree patched = patch_string (TREE_OPERAND (node, 1));
11954                   if (patched)
11955                     DECL_INITIAL (nn) = patched;
11956                   else
11957                     DECL_INITIAL (nn) = TREE_OPERAND (node, 1);
11958                   DECL_FIELD_FINAL_IUD (nn) = 1;
11959                   return empty_stmt_node;
11960                 }
11961             }
11962           if (! flag_emit_class_files)
11963             DECL_INITIAL (nn) = NULL_TREE;
11964         }
11965       wfl_op2 = TREE_OPERAND (node, 1);
11966
11967       if (TREE_OPERAND (node, 0) == error_mark_node)
11968         return error_mark_node;
11969
11970       flag = COMPOUND_ASSIGN_P (wfl_op2);
11971       if (flag)
11972         {
11973           /* This might break when accessing outer field from inner
11974              class. TESTME, FIXME */
11975           tree lvalue = java_stabilize_reference (TREE_OPERAND (node, 0));
11976
11977           /* Hand stabilize the lhs on both places */
11978           TREE_OPERAND (node, 0) = lvalue;
11979           TREE_OPERAND (TREE_OPERAND (node, 1), 0) =
11980             (flag_emit_class_files ? lvalue : save_expr (lvalue));
11981
11982           /* 15.25.2.a: Left hand is not an array access. FIXME */
11983           /* Now complete the RHS. We write it back later on. */
11984           nn = java_complete_tree (TREE_OPERAND (node, 1));
11985
11986           if ((cn = patch_string (nn)))
11987             nn = cn;
11988
11989           /* The last part of the rewrite for E1 op= E2 is to have
11990              E1 = (T)(E1 op E2), with T being the type of E1. */
11991           nn = java_complete_tree (build_cast (EXPR_WFL_LINECOL (wfl_op2),
11992                                                TREE_TYPE (lvalue), nn));
11993
11994           /* If the assignment is compound and has reference type,
11995              then ensure the LHS has type String and nothing else.  */
11996           if (JREFERENCE_TYPE_P (TREE_TYPE (lvalue))
11997               && ! JSTRING_TYPE_P (TREE_TYPE (lvalue)))
11998             parse_error_context (wfl_op2,
11999                                  "Incompatible type for `+='. Can't convert `%s' to `java.lang.String'",
12000                                  lang_printable_name (TREE_TYPE (lvalue), 0));
12001
12002           /* 15.25.2.b: Left hand is an array access. FIXME */
12003         }
12004
12005       /* If we're about to patch a NEW_ARRAY_INIT, we call a special
12006          function to complete this RHS. Note that a NEW_ARRAY_INIT
12007          might have been already fully expanded if created as a result
12008          of processing an anonymous array initializer. We avoid doing
12009          the operation twice by testing whether the node already bears
12010          a type. */
12011       else if (TREE_CODE (wfl_op2) == NEW_ARRAY_INIT && !TREE_TYPE (wfl_op2))
12012         nn = patch_new_array_init (TREE_TYPE (TREE_OPERAND (node, 0)),
12013                                    TREE_OPERAND (node, 1));
12014       /* Otherwise we simply complete the RHS */
12015       else
12016         nn = java_complete_tree (TREE_OPERAND (node, 1));
12017
12018       if (nn == error_mark_node)
12019         return error_mark_node;
12020
12021       /* Write back the RHS as we evaluated it. */
12022       TREE_OPERAND (node, 1) = nn;
12023
12024       /* In case we're handling = with a String as a RHS, we need to
12025          produce a String out of the RHS (it might still be a
12026          STRING_CST or a StringBuffer at this stage */
12027       if ((nn = patch_string (TREE_OPERAND (node, 1))))
12028         TREE_OPERAND (node, 1) = nn;
12029
12030       if ((nn = outer_field_access_fix (wfl_op1, TREE_OPERAND (node, 0),
12031                                         TREE_OPERAND (node, 1))))
12032         {
12033           /* We return error_mark_node if outer_field_access_fix
12034              detects we write into a final. */
12035           if (nn == error_mark_node)
12036             return error_mark_node;
12037           node = nn;
12038         }
12039       else
12040         {
12041           node = patch_assignment (node, wfl_op1);
12042           if (node == error_mark_node)
12043             return error_mark_node;
12044           /* Reorganize the tree if necessary. */
12045           if (flag && (!JREFERENCE_TYPE_P (TREE_TYPE (node))
12046                        || JSTRING_P (TREE_TYPE (node))))
12047             node = java_refold (node);
12048         }
12049
12050       /* Seek to set DECL_INITIAL to a proper value, since it might have
12051          undergone a conversion in patch_assignment. We do that only when
12052          it's necessary to have DECL_INITIAL properly set. */
12053       nn = TREE_OPERAND (node, 0);
12054       if (TREE_CODE (nn) == VAR_DECL
12055           && DECL_INITIAL (nn) && CONSTANT_VALUE_P (DECL_INITIAL (nn))
12056           && FIELD_STATIC (nn) && FIELD_FINAL (nn)
12057           && (JPRIMITIVE_TYPE_P (TREE_TYPE (nn))
12058               || TREE_TYPE (nn) == string_ptr_type_node))
12059         DECL_INITIAL (nn) = TREE_OPERAND (node, 1);
12060
12061       CAN_COMPLETE_NORMALLY (node) = 1;
12062       return node;
12063
12064     case MULT_EXPR:
12065     case PLUS_EXPR:
12066     case MINUS_EXPR:
12067     case LSHIFT_EXPR:
12068     case RSHIFT_EXPR:
12069     case URSHIFT_EXPR:
12070     case BIT_AND_EXPR:
12071     case BIT_XOR_EXPR:
12072     case BIT_IOR_EXPR:
12073     case TRUNC_MOD_EXPR:
12074     case TRUNC_DIV_EXPR:
12075     case RDIV_EXPR:
12076     case TRUTH_ANDIF_EXPR:
12077     case TRUTH_ORIF_EXPR:
12078     case EQ_EXPR:
12079     case NE_EXPR:
12080     case GT_EXPR:
12081     case GE_EXPR:
12082     case LT_EXPR:
12083     case LE_EXPR:
12084       /* Operands 0 and 1 are WFL in certain cases only. patch_binop
12085          knows how to handle those cases. */
12086       wfl_op1 = TREE_OPERAND (node, 0);
12087       wfl_op2 = TREE_OPERAND (node, 1);
12088
12089       CAN_COMPLETE_NORMALLY (node) = 1;
12090       /* Don't complete string nodes if dealing with the PLUS operand. */
12091       if (TREE_CODE (node) != PLUS_EXPR || !JSTRING_P (wfl_op1))
12092         {
12093           nn = java_complete_tree (wfl_op1);
12094           if (nn == error_mark_node)
12095             return error_mark_node;
12096
12097           TREE_OPERAND (node, 0) = nn;
12098         }
12099       if (TREE_CODE (node) != PLUS_EXPR || !JSTRING_P (wfl_op2))
12100         {
12101           nn = java_complete_tree (wfl_op2);
12102           if (nn == error_mark_node)
12103             return error_mark_node;
12104
12105           TREE_OPERAND (node, 1) = nn;
12106         }
12107       return force_evaluation_order (patch_binop (node, wfl_op1, wfl_op2));
12108
12109     case INSTANCEOF_EXPR:
12110       wfl_op1 = TREE_OPERAND (node, 0);
12111       COMPLETE_CHECK_OP_0 (node);
12112       if (flag_emit_xref)
12113         {
12114           TREE_TYPE (node) = boolean_type_node;
12115           return node;
12116         }
12117       return patch_binop (node, wfl_op1, TREE_OPERAND (node, 1));
12118
12119     case UNARY_PLUS_EXPR:
12120     case NEGATE_EXPR:
12121     case TRUTH_NOT_EXPR:
12122     case BIT_NOT_EXPR:
12123     case PREDECREMENT_EXPR:
12124     case PREINCREMENT_EXPR:
12125     case POSTDECREMENT_EXPR:
12126     case POSTINCREMENT_EXPR:
12127     case CONVERT_EXPR:
12128       /* There are cases were wfl_op1 is a WFL. patch_unaryop knows
12129          how to handle those cases. */
12130       wfl_op1 = TREE_OPERAND (node, 0);
12131       CAN_COMPLETE_NORMALLY (node) = 1;
12132       TREE_OPERAND (node, 0) = java_complete_tree (wfl_op1);
12133       if (TREE_OPERAND (node, 0) == error_mark_node)
12134         return error_mark_node;
12135       node = patch_unaryop (node, wfl_op1);
12136       CAN_COMPLETE_NORMALLY (node) = 1;
12137       break;
12138
12139     case ARRAY_REF:
12140       /* There are cases were wfl_op1 is a WFL. patch_array_ref knows
12141          how to handle those cases. */
12142       wfl_op1 = TREE_OPERAND (node, 0);
12143       TREE_OPERAND (node, 0) = java_complete_tree (wfl_op1);
12144       if (TREE_OPERAND (node, 0) == error_mark_node)
12145         return error_mark_node;
12146       if (!flag_emit_class_files && !flag_emit_xref)
12147         TREE_OPERAND (node, 0) = save_expr (TREE_OPERAND (node, 0));
12148       /* The same applies to wfl_op2 */
12149       wfl_op2 = TREE_OPERAND (node, 1);
12150       TREE_OPERAND (node, 1) = java_complete_tree (wfl_op2);
12151       if (TREE_OPERAND (node, 1) == error_mark_node)
12152         return error_mark_node;
12153       if (!flag_emit_class_files && !flag_emit_xref)
12154         TREE_OPERAND (node, 1) = save_expr (TREE_OPERAND (node, 1));
12155       return patch_array_ref (node);
12156
12157     case RECORD_TYPE:
12158       return node;;
12159
12160     case COMPONENT_REF:
12161       /* The first step in the re-write of qualified name handling.  FIXME.
12162          So far, this is only to support PRIMTYPE.class -> PRIMCLASS.TYPE. */
12163       TREE_OPERAND (node, 0) = java_complete_tree (TREE_OPERAND (node, 0));
12164       if (TREE_CODE (TREE_OPERAND (node, 0)) == RECORD_TYPE)
12165         {
12166           tree name = TREE_OPERAND (node, 1);
12167           tree field = lookup_field_wrapper (TREE_OPERAND (node, 0), name);
12168           if (field == NULL_TREE)
12169             {
12170               error ("missing static field `%s'", IDENTIFIER_POINTER (name));
12171               return error_mark_node;
12172             }
12173           if (! FIELD_STATIC (field))
12174             {
12175               error ("not a static field `%s'", IDENTIFIER_POINTER (name));
12176               return error_mark_node;
12177             }
12178           return field;
12179         }
12180       else
12181         abort ();
12182       break;
12183
12184     case THIS_EXPR:
12185       /* Can't use THIS in a static environment */
12186       if (!current_this)
12187         {
12188           EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
12189           parse_error_context (wfl_operator,
12190                                "Keyword `this' used outside allowed context");
12191           TREE_TYPE (node) = error_mark_node;
12192           return error_mark_node;
12193         }
12194       if (ctxp->explicit_constructor_p)
12195         {
12196           EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
12197           parse_error_context
12198             (wfl_operator, "Can't reference `this' or `super' before the superclass constructor has been called");
12199           TREE_TYPE (node) = error_mark_node;
12200           return error_mark_node;
12201         }
12202       return current_this;
12203
12204     case CLASS_LITERAL:
12205       CAN_COMPLETE_NORMALLY (node) = 1;
12206       node = patch_incomplete_class_ref (node);
12207       if (node == error_mark_node)
12208         return error_mark_node;
12209       break;
12210
12211     default:
12212       CAN_COMPLETE_NORMALLY (node) = 1;
12213       /* Ok: may be we have a STRING_CST or a crafted `StringBuffer'
12214          and it's time to turn it into the appropriate String object */
12215       if ((nn = patch_string (node)))
12216         node = nn;
12217       else
12218         internal_error ("No case for %s", tree_code_name [TREE_CODE (node)]);
12219     }
12220   return node;
12221 }
12222
12223 /* Complete function call's argument. Return a nonzero value is an
12224    error was found.  */
12225
12226 static int
12227 complete_function_arguments (tree node)
12228 {
12229   int flag = 0;
12230   tree cn;
12231
12232   ctxp->explicit_constructor_p += (CALL_EXPLICIT_CONSTRUCTOR_P (node) ? 1 : 0);
12233   for (cn = TREE_OPERAND (node, 1); cn; cn = TREE_CHAIN (cn))
12234     {
12235       tree wfl = TREE_VALUE (cn), parm, temp;
12236       parm = java_complete_tree (wfl);
12237
12238       if (parm == error_mark_node)
12239         {
12240           flag = 1;
12241           continue;
12242         }
12243       /* If have a string literal that we haven't transformed yet or a
12244          crafted string buffer, as a result of use of the the String
12245          `+' operator. Build `parm.toString()' and expand it. */
12246       if ((temp = patch_string (parm)))
12247         parm = temp;
12248
12249       TREE_VALUE (cn) = parm;
12250     }
12251   ctxp->explicit_constructor_p -= (CALL_EXPLICIT_CONSTRUCTOR_P (node) ? 1 : 0);
12252   return flag;
12253 }
12254
12255 /* Sometimes (for loops and variable initialized during their
12256    declaration), we want to wrap a statement around a WFL and turn it
12257    debugable.  */
12258
12259 static tree
12260 build_debugable_stmt (int location, tree stmt)
12261 {
12262   if (TREE_CODE (stmt) != EXPR_WITH_FILE_LOCATION)
12263     {
12264       stmt = build_expr_wfl (stmt, input_filename, 0, 0);
12265       EXPR_WFL_LINECOL (stmt) = location;
12266     }
12267   JAVA_MAYBE_GENERATE_DEBUG_INFO (stmt);
12268   return stmt;
12269 }
12270
12271 static tree
12272 build_expr_block (tree body, tree decls)
12273
12274 {
12275   tree node = make_node (BLOCK);
12276   BLOCK_EXPR_DECLS (node) = decls;
12277   BLOCK_EXPR_BODY (node) = body;
12278   if (body)
12279     TREE_TYPE (node) = TREE_TYPE (body);
12280   TREE_SIDE_EFFECTS (node) = 1;
12281   return node;
12282 }
12283
12284 /* Create a new function block and link it appropriately to current
12285    function block chain */
12286
12287 static tree
12288 enter_block (void)
12289 {
12290   tree b = build_expr_block (NULL_TREE, NULL_TREE);
12291
12292   /* Link block B supercontext to the previous block. The current
12293      function DECL is used as supercontext when enter_a_block is called
12294      for the first time for a given function. The current function body
12295      (DECL_FUNCTION_BODY) is set to be block B.  */
12296
12297   tree fndecl = current_function_decl;
12298
12299   if (!fndecl) {
12300     BLOCK_SUPERCONTEXT (b) = current_static_block;
12301     current_static_block = b;
12302   }
12303
12304   else if (!DECL_FUNCTION_BODY (fndecl))
12305     {
12306       BLOCK_SUPERCONTEXT (b) = fndecl;
12307       DECL_FUNCTION_BODY (fndecl) = b;
12308     }
12309   else
12310     {
12311       BLOCK_SUPERCONTEXT (b) = DECL_FUNCTION_BODY (fndecl);
12312       DECL_FUNCTION_BODY (fndecl) = b;
12313     }
12314   return b;
12315 }
12316
12317 /* Exit a block by changing the current function body
12318    (DECL_FUNCTION_BODY) to the current block super context, only if
12319    the block being exited isn't the method's top level one.  */
12320
12321 static tree
12322 exit_block (void)
12323 {
12324   tree b;
12325   if (current_function_decl)
12326     {
12327       b = DECL_FUNCTION_BODY (current_function_decl);
12328       if (BLOCK_SUPERCONTEXT (b) != current_function_decl)
12329         DECL_FUNCTION_BODY (current_function_decl) = BLOCK_SUPERCONTEXT (b);
12330     }
12331   else
12332     {
12333       b = current_static_block;
12334
12335       if (BLOCK_SUPERCONTEXT (b))
12336         current_static_block = BLOCK_SUPERCONTEXT (b);
12337     }
12338   return b;
12339 }
12340
12341 /* Lookup for NAME in the nested function's blocks, all the way up to
12342    the current toplevel one. It complies with Java's local variable
12343    scoping rules.  */
12344
12345 static tree
12346 lookup_name_in_blocks (tree name)
12347 {
12348   tree b = GET_CURRENT_BLOCK (current_function_decl);
12349
12350   while (b != current_function_decl)
12351     {
12352       tree current;
12353
12354       /* Paranoid sanity check. To be removed */
12355       if (TREE_CODE (b) != BLOCK)
12356         abort ();
12357
12358       for (current = BLOCK_EXPR_DECLS (b); current;
12359            current = TREE_CHAIN (current))
12360         if (DECL_NAME (current) == name)
12361           return current;
12362       b = BLOCK_SUPERCONTEXT (b);
12363     }
12364   return NULL_TREE;
12365 }
12366
12367 static void
12368 maybe_absorb_scoping_blocks (void)
12369 {
12370   while (BLOCK_IS_IMPLICIT (GET_CURRENT_BLOCK (current_function_decl)))
12371     {
12372       tree b = exit_block ();
12373       java_method_add_stmt (current_function_decl, b);
12374       SOURCE_FRONTEND_DEBUG (("Absorbing scoping block at line %d", input_line));
12375     }
12376 }
12377
12378 \f
12379 /* This section of the source is reserved to build_* functions that
12380    are building incomplete tree nodes and the patch_* functions that
12381    are completing them.  */
12382
12383 /* Wrap a non WFL node around a WFL.  */
12384
12385 static tree
12386 build_wfl_wrap (tree node, int location)
12387 {
12388   tree wfl, node_to_insert = node;
12389
12390   /* We want to process THIS . xxx symbolicaly, to keep it consistent
12391      with the way we're processing SUPER. A THIS from a primary as a
12392      different form than a SUPER. Turn THIS into something symbolic */
12393   if (TREE_CODE (node) == THIS_EXPR)
12394     node_to_insert = wfl = build_wfl_node (this_identifier_node);
12395   else
12396     wfl = build_expr_wfl (NULL_TREE, ctxp->filename, 0, 0);
12397
12398   EXPR_WFL_LINECOL (wfl) = location;
12399   EXPR_WFL_QUALIFICATION (wfl) = build_tree_list (node_to_insert, NULL_TREE);
12400   return wfl;
12401 }
12402
12403 /* Build a super() constructor invocation. Returns empty_stmt_node if
12404    we're currently dealing with the class java.lang.Object. */
12405
12406 static tree
12407 build_super_invocation (tree mdecl)
12408 {
12409   if (DECL_CONTEXT (mdecl) == object_type_node)
12410     return empty_stmt_node;
12411   else
12412     {
12413       tree super_wfl = build_wfl_node (super_identifier_node);
12414       tree a = NULL_TREE, t;
12415       /* If we're dealing with an anonymous class, pass the arguments
12416          of the crafted constructor along. */
12417       if (ANONYMOUS_CLASS_P (DECL_CONTEXT (mdecl)))
12418         {
12419           SKIP_THIS_AND_ARTIFICIAL_PARMS (t, mdecl);
12420           for (; t != end_params_node; t = TREE_CHAIN (t))
12421             a = tree_cons (NULL_TREE, build_wfl_node (TREE_PURPOSE (t)), a);
12422         }
12423       return build_method_invocation (super_wfl, a);
12424     }
12425 }
12426
12427 /* Build a SUPER/THIS qualified method invocation.  */
12428
12429 static tree
12430 build_this_super_qualified_invocation (int use_this, tree name, tree args,
12431                                        int lloc, int rloc)
12432 {
12433   tree invok;
12434   tree wfl =
12435     build_wfl_node (use_this ? this_identifier_node : super_identifier_node);
12436   EXPR_WFL_LINECOL (wfl) = lloc;
12437   invok = build_method_invocation (name, args);
12438   return make_qualified_primary (wfl, invok, rloc);
12439 }
12440
12441 /* Build an incomplete CALL_EXPR node. */
12442
12443 static tree
12444 build_method_invocation (tree name, tree args)
12445 {
12446   tree call = build (CALL_EXPR, NULL_TREE, name, args, NULL_TREE);
12447   TREE_SIDE_EFFECTS (call) = 1;
12448   EXPR_WFL_LINECOL (call) = EXPR_WFL_LINECOL (name);
12449   return call;
12450 }
12451
12452 /* Build an incomplete new xxx(...) node. */
12453
12454 static tree
12455 build_new_invocation (tree name, tree args)
12456 {
12457   tree call = build (NEW_CLASS_EXPR, NULL_TREE, name, args, NULL_TREE);
12458   TREE_SIDE_EFFECTS (call) = 1;
12459   EXPR_WFL_LINECOL (call) = EXPR_WFL_LINECOL (name);
12460   return call;
12461 }
12462
12463 /* Build an incomplete assignment expression. */
12464
12465 static tree
12466 build_assignment (int op, int op_location, tree lhs, tree rhs)
12467 {
12468   tree assignment;
12469   /* Build the corresponding binop if we deal with a Compound
12470      Assignment operator. Mark the binop sub-tree as part of a
12471      Compound Assignment expression */
12472   if (op != ASSIGN_TK)
12473     {
12474       rhs = build_binop (BINOP_LOOKUP (op), op_location, lhs, rhs);
12475       COMPOUND_ASSIGN_P (rhs) = 1;
12476     }
12477   assignment = build (MODIFY_EXPR, NULL_TREE, lhs, rhs);
12478   TREE_SIDE_EFFECTS (assignment) = 1;
12479   EXPR_WFL_LINECOL (assignment) = op_location;
12480   return assignment;
12481 }
12482
12483 /* Print an INTEGER_CST node as decimal in a static buffer, and return
12484    the buffer.  This is used only for string conversion.  */
12485 static char *
12486 string_convert_int_cst (tree node)
12487 {
12488   /* Long.MIN_VALUE is -9223372036854775808, 20 characters.  */
12489   static char buffer[21];
12490
12491   unsigned HOST_WIDE_INT lo = TREE_INT_CST_LOW (node);
12492   unsigned HOST_WIDE_INT hi = TREE_INT_CST_HIGH (node);
12493   char *p = buffer + sizeof (buffer);
12494   int neg = 0;
12495
12496   unsigned HOST_WIDE_INT hibit = (((unsigned HOST_WIDE_INT) 1)
12497                                   << (HOST_BITS_PER_WIDE_INT - 1));
12498
12499   *--p = '\0';
12500
12501   /* If negative, note the fact and negate the value.  */
12502   if ((hi & hibit))
12503     {
12504       lo = ~lo;
12505       hi = ~hi;
12506       if (++lo == 0)
12507         ++hi;
12508       neg = 1;
12509     }
12510
12511   /* Divide by 10 until there are no bits left.  */
12512   do
12513     {
12514       unsigned HOST_WIDE_INT acc = 0;
12515       unsigned HOST_WIDE_INT outhi = 0, outlo = 0;
12516       unsigned int i;
12517
12518       /* Use long division to compute the result and the remainder.  */
12519       for (i = 0; i < 2 * HOST_BITS_PER_WIDE_INT; ++i)
12520         {
12521           /* Shift a bit into accumulator.  */
12522           acc <<= 1;
12523           if ((hi & hibit))
12524             acc |= 1;
12525
12526           /* Shift the value.  */
12527           hi <<= 1;
12528           if ((lo & hibit))
12529             hi |= 1;
12530           lo <<= 1;
12531
12532           /* Shift the correct bit into the result.  */
12533           outhi <<= 1;
12534           if ((outlo & hibit))
12535             outhi |= 1;
12536           outlo <<= 1;
12537           if (acc >= 10)
12538             {
12539               acc -= 10;
12540               outlo |= 1;
12541             }
12542         }
12543
12544       /* '0' == 060 in Java, but might not be here (think EBCDIC).  */
12545       *--p = '\060' + acc;
12546
12547       hi = outhi;
12548       lo = outlo;
12549     }
12550   while (hi || lo);
12551
12552   if (neg)
12553     *--p = '\055'; /* '-' == 055 in Java, but might not be here.  */
12554
12555   return p;
12556 }
12557
12558 /* Print an INTEGER_CST node in a static buffer, and return the
12559    buffer.  This is used only for error handling.  */
12560 char *
12561 print_int_node (tree node)
12562 {
12563   static char buffer [80];
12564   if (TREE_CONSTANT_OVERFLOW (node))
12565     sprintf (buffer, "<overflow>");
12566
12567   if (TREE_INT_CST_HIGH (node) == 0)
12568     sprintf (buffer, HOST_WIDE_INT_PRINT_UNSIGNED,
12569              TREE_INT_CST_LOW (node));
12570   else if (TREE_INT_CST_HIGH (node) == -1
12571            && TREE_INT_CST_LOW (node) != 0)
12572     sprintf (buffer, "-" HOST_WIDE_INT_PRINT_UNSIGNED,
12573              -TREE_INT_CST_LOW (node));
12574   else
12575     sprintf (buffer, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
12576              TREE_INT_CST_HIGH (node), TREE_INT_CST_LOW (node));
12577
12578   return buffer;
12579 }
12580
12581 \f
12582 /* Return 1 if an assignment to a FINAL is attempted in a non suitable
12583    context.  */
12584
12585 /* 15.25 Assignment operators. */
12586
12587 static tree
12588 patch_assignment (tree node, tree wfl_op1)
12589 {
12590   tree rhs = TREE_OPERAND (node, 1);
12591   tree lvalue = TREE_OPERAND (node, 0), llvalue;
12592   tree lhs_type = NULL_TREE, rhs_type, new_rhs = NULL_TREE;
12593   int error_found = 0;
12594   int lvalue_from_array = 0;
12595   int is_return = 0;
12596
12597   EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
12598
12599   /* Lhs can be a named variable */
12600   if (JDECL_P (lvalue))
12601     {
12602       lhs_type = TREE_TYPE (lvalue);
12603     }
12604   /* Or Lhs can be an array access. */
12605   else if (TREE_CODE (lvalue) == ARRAY_REF)
12606     {
12607       lhs_type = TREE_TYPE (lvalue);
12608       lvalue_from_array = 1;
12609     }
12610   /* Or a field access */
12611   else if (TREE_CODE (lvalue) == COMPONENT_REF)
12612     lhs_type = TREE_TYPE (lvalue);
12613   /* Or a function return slot */
12614   else if (TREE_CODE (lvalue) == RESULT_DECL)
12615     {
12616       /* If the return type is an integral type, then we create the
12617          RESULT_DECL with a promoted type, but we need to do these
12618          checks against the unpromoted type to ensure type safety.  So
12619          here we look at the real type, not the type of the decl we
12620          are modifying.  */
12621       lhs_type = TREE_TYPE (TREE_TYPE (current_function_decl));
12622       is_return = 1;
12623     }
12624   /* Otherwise, we might want to try to write into an optimized static
12625      final, this is an of a different nature, reported further on. */
12626   else if (TREE_CODE (wfl_op1) == EXPR_WITH_FILE_LOCATION
12627            && resolve_expression_name (wfl_op1, &llvalue))
12628     {
12629       lhs_type = TREE_TYPE (lvalue);
12630     }
12631   else
12632     {
12633       parse_error_context (wfl_op1, "Invalid left hand side of assignment");
12634       error_found = 1;
12635     }
12636
12637   rhs_type = TREE_TYPE (rhs);
12638
12639   /* 5.1 Try the assignment conversion for builtin type. */
12640   new_rhs = try_builtin_assignconv (wfl_op1, lhs_type, rhs);
12641
12642   /* 5.2 If it failed, try a reference conversion */
12643   if (!new_rhs && (new_rhs = try_reference_assignconv (lhs_type, rhs)))
12644     lhs_type = promote_type (rhs_type);
12645
12646   /* 15.25.2 If we have a compound assignment, convert RHS into the
12647      type of the LHS */
12648   else if (COMPOUND_ASSIGN_P (TREE_OPERAND (node, 1)))
12649     new_rhs = convert (lhs_type, rhs);
12650
12651   /* Explicit cast required. This is an error */
12652   if (!new_rhs)
12653     {
12654       char *t1 = xstrdup (lang_printable_name (TREE_TYPE (rhs), 0));
12655       char *t2 = xstrdup (lang_printable_name (lhs_type, 0));
12656       tree wfl;
12657       char operation [32];      /* Max size known */
12658
12659       /* If the assignment is part of a declaration, we use the WFL of
12660          the declared variable to point out the error and call it a
12661          declaration problem. If the assignment is a genuine =
12662          operator, we call is a operator `=' problem, otherwise we
12663          call it an assignment problem. In both of these last cases,
12664          we use the WFL of the operator to indicate the error. */
12665
12666       if (MODIFY_EXPR_FROM_INITIALIZATION_P (node))
12667         {
12668           wfl = wfl_op1;
12669           strcpy (operation, "declaration");
12670         }
12671       else
12672         {
12673           wfl = wfl_operator;
12674           if (COMPOUND_ASSIGN_P (TREE_OPERAND (node, 1)))
12675             strcpy (operation, "assignment");
12676           else if (is_return)
12677             strcpy (operation, "`return'");
12678           else
12679             strcpy (operation, "`='");
12680         }
12681
12682       if (!valid_cast_to_p (rhs_type, lhs_type))
12683         parse_error_context
12684           (wfl, "Incompatible type for %s. Can't convert `%s' to `%s'",
12685            operation, t1, t2);
12686       else
12687         parse_error_context (wfl, "Incompatible type for %s. Explicit cast needed to convert `%s' to `%s'",
12688                              operation, t1, t2);
12689       free (t1); free (t2);
12690       error_found = 1;
12691     }
12692
12693   if (error_found)
12694     return error_mark_node;
12695
12696   /* If we're processing a `return' statement, promote the actual type
12697      to the promoted type.  */
12698   if (is_return)
12699     new_rhs = convert (TREE_TYPE (lvalue), new_rhs);
12700
12701   /* 10.10: Array Store Exception runtime check */
12702   if (!flag_emit_class_files
12703       && !flag_emit_xref
12704       && lvalue_from_array
12705       && JREFERENCE_TYPE_P (TYPE_ARRAY_ELEMENT (lhs_type)))
12706     {
12707       tree array, store_check, base, index_expr;
12708
12709       /* Save RHS so that it doesn't get re-evaluated by the store check. */
12710       new_rhs = save_expr (new_rhs);
12711
12712       /* Get the INDIRECT_REF. */
12713       array = TREE_OPERAND (TREE_OPERAND (lvalue, 0), 0);
12714       /* Get the array pointer expr. */
12715       array = TREE_OPERAND (array, 0);
12716       store_check = build_java_arraystore_check (array, new_rhs);
12717
12718       index_expr = TREE_OPERAND (lvalue, 1);
12719
12720       if (TREE_CODE (index_expr) == COMPOUND_EXPR)
12721         {
12722           /* A COMPOUND_EXPR here is a bounds check. The bounds check must
12723              happen before the store check, so prepare to insert the store
12724              check within the second operand of the existing COMPOUND_EXPR. */
12725           base = index_expr;
12726         }
12727       else
12728         base = lvalue;
12729
12730       index_expr = TREE_OPERAND (base, 1);
12731       TREE_OPERAND (base, 1) = build (COMPOUND_EXPR, TREE_TYPE (index_expr),
12732                                       store_check, index_expr);
12733     }
12734
12735   /* Final locals can be used as case values in switch
12736      statement. Prepare them for this eventuality. */
12737   if (TREE_CODE (lvalue) == VAR_DECL
12738       && DECL_FINAL (lvalue)
12739       && TREE_CONSTANT (new_rhs)
12740       && IDENTIFIER_LOCAL_VALUE (DECL_NAME (lvalue))
12741       && JINTEGRAL_TYPE_P (TREE_TYPE (lvalue))
12742       )
12743     {
12744       TREE_CONSTANT (lvalue) = 1;
12745       DECL_INITIAL (lvalue) = new_rhs;
12746     }
12747
12748   /* Copy the rhs if it's a reference.  */
12749   if (! flag_check_references && ! flag_emit_class_files && optimize > 0)
12750     {
12751       switch (TREE_CODE (new_rhs))
12752         {
12753         case ARRAY_REF:
12754         case INDIRECT_REF:
12755         case COMPONENT_REF:
12756           /* Transform a = foo.bar
12757              into a = { int tmp; tmp = foo.bar; tmp; ).
12758              We need to ensure that if a read from memory fails
12759              because of a NullPointerException, a destination variable
12760              will remain unchanged.  An explicit temporary does what
12761              we need.
12762
12763              If flag_check_references is set, this is unnecessary
12764              because we'll check each reference before doing any
12765              reads.  If optimize is not set the result will never be
12766              written to a stack slot that contains the LHS.  */
12767           {
12768             tree tmp = build_decl (VAR_DECL, get_identifier ("<tmp>"),
12769                                    TREE_TYPE (new_rhs));
12770             tree block = build (BLOCK, TREE_TYPE (new_rhs), NULL);
12771             tree assignment
12772               = build (MODIFY_EXPR, TREE_TYPE (new_rhs), tmp, fold (new_rhs));
12773             BLOCK_VARS (block) = tmp;
12774             BLOCK_EXPR_BODY (block)
12775               = build (COMPOUND_EXPR, TREE_TYPE (new_rhs), assignment, tmp);
12776             TREE_SIDE_EFFECTS (block) = 1;
12777             new_rhs = block;
12778           }
12779           break;
12780         default:
12781           break;
12782         }
12783     }
12784
12785   TREE_OPERAND (node, 0) = lvalue;
12786   TREE_OPERAND (node, 1) = new_rhs;
12787   TREE_TYPE (node) = lhs_type;
12788   return node;
12789 }
12790
12791 /* Check that type SOURCE can be cast into type DEST. If the cast
12792    can't occur at all, return NULL; otherwise, return a possibly
12793    modified rhs.  */
12794
12795 static tree
12796 try_reference_assignconv (tree lhs_type, tree rhs)
12797 {
12798   tree new_rhs = NULL_TREE;
12799   tree rhs_type = TREE_TYPE (rhs);
12800
12801   if (!JPRIMITIVE_TYPE_P (rhs_type) && JREFERENCE_TYPE_P (lhs_type))
12802     {
12803       /* `null' may be assigned to any reference type */
12804       if (rhs == null_pointer_node)
12805         new_rhs = null_pointer_node;
12806       /* Try the reference assignment conversion */
12807       else if (valid_ref_assignconv_cast_p (rhs_type, lhs_type, 0))
12808         new_rhs = rhs;
12809       /* This is a magic assignment that we process differently */
12810       else if (TREE_CODE (rhs) == JAVA_EXC_OBJ_EXPR)
12811         new_rhs = rhs;
12812     }
12813   return new_rhs;
12814 }
12815
12816 /* Check that RHS can be converted into LHS_TYPE by the assignment
12817    conversion (5.2), for the cases of RHS being a builtin type. Return
12818    NULL_TREE if the conversion fails or if because RHS isn't of a
12819    builtin type. Return a converted RHS if the conversion is possible.  */
12820
12821 static tree
12822 try_builtin_assignconv (tree wfl_op1, tree lhs_type, tree rhs)
12823 {
12824   tree new_rhs = NULL_TREE;
12825   tree rhs_type = TREE_TYPE (rhs);
12826
12827   /* Handle boolean specially.  */
12828   if (TREE_CODE (rhs_type) == BOOLEAN_TYPE
12829       || TREE_CODE (lhs_type) == BOOLEAN_TYPE)
12830     {
12831       if (TREE_CODE (rhs_type) == BOOLEAN_TYPE
12832           && TREE_CODE (lhs_type) == BOOLEAN_TYPE)
12833         new_rhs = rhs;
12834     }
12835
12836   /* 5.1.1 Try Identity Conversion,
12837      5.1.2 Try Widening Primitive Conversion */
12838   else if (valid_builtin_assignconv_identity_widening_p (lhs_type, rhs_type))
12839     new_rhs = convert (lhs_type, rhs);
12840
12841   /* Try a narrowing primitive conversion (5.1.3):
12842        - expression is a constant expression of type byte, short, char,
12843          or int, AND
12844        - variable is byte, short or char AND
12845        - The value of the expression is representable in the type of the
12846          variable */
12847   else if ((rhs_type == byte_type_node || rhs_type == short_type_node
12848             || rhs_type == char_type_node || rhs_type == int_type_node)
12849             && TREE_CONSTANT (rhs)
12850            && (lhs_type == byte_type_node || lhs_type == char_type_node
12851                || lhs_type == short_type_node))
12852     {
12853       if (int_fits_type_p (rhs, lhs_type))
12854         new_rhs = convert (lhs_type, rhs);
12855       else if (wfl_op1)         /* Might be called with a NULL */
12856         parse_warning_context
12857           (wfl_op1, "Constant expression `%s' too wide for narrowing primitive conversion to `%s'",
12858            print_int_node (rhs), lang_printable_name (lhs_type, 0));
12859       /* Reported a warning that will turn into an error further
12860          down, so we don't return */
12861     }
12862
12863   return new_rhs;
12864 }
12865
12866 /* Return 1 if RHS_TYPE can be converted to LHS_TYPE by identity
12867    conversion (5.1.1) or widening primitive conversion (5.1.2).  Return
12868    0 is the conversion test fails.  This implements parts the method
12869    invocation convertion (5.3).  */
12870
12871 static int
12872 valid_builtin_assignconv_identity_widening_p (tree lhs_type, tree rhs_type)
12873 {
12874   /* 5.1.1: This is the identity conversion part. */
12875   if (lhs_type == rhs_type)
12876     return 1;
12877
12878   /* Reject non primitive types and boolean conversions.  */
12879   if (!JNUMERIC_TYPE_P (lhs_type) || !JNUMERIC_TYPE_P (rhs_type))
12880     return 0;
12881
12882   /* 5.1.2: widening primitive conversion. byte, even if it's smaller
12883      than a char can't be converted into a char. Short can't too, but
12884      the < test below takes care of that */
12885   if (lhs_type == char_type_node && rhs_type == byte_type_node)
12886     return 0;
12887
12888   /* Accept all promoted type here. Note, we can't use <= in the test
12889      below, because we still need to bounce out assignments of short
12890      to char and the likes */
12891   if (lhs_type == int_type_node
12892       && (rhs_type == promoted_byte_type_node
12893           || rhs_type == promoted_short_type_node
12894           || rhs_type == promoted_char_type_node
12895           || rhs_type == promoted_boolean_type_node))
12896     return 1;
12897
12898   /* From here, an integral is widened if its precision is smaller
12899      than the precision of the LHS or if the LHS is a floating point
12900      type, or the RHS is a float and the RHS a double. */
12901   if ((JINTEGRAL_TYPE_P (rhs_type) && JINTEGRAL_TYPE_P (lhs_type)
12902        && (TYPE_PRECISION (rhs_type) < TYPE_PRECISION (lhs_type)))
12903       || (JINTEGRAL_TYPE_P (rhs_type) && JFLOAT_TYPE_P (lhs_type))
12904       || (rhs_type == float_type_node && lhs_type == double_type_node))
12905     return 1;
12906
12907   return 0;
12908 }
12909
12910 /* Check that something of SOURCE type can be assigned or cast to
12911    something of DEST type at runtime. Return 1 if the operation is
12912    valid, 0 otherwise. If CAST is set to 1, we're treating the case
12913    were SOURCE is cast into DEST, which borrows a lot of the
12914    assignment check. */
12915
12916 static int
12917 valid_ref_assignconv_cast_p (tree source, tree dest, int cast)
12918 {
12919   /* SOURCE or DEST might be null if not from a declared entity. */
12920   if (!source || !dest)
12921     return 0;
12922   if (JNULLP_TYPE_P (source))
12923     return 1;
12924   if (TREE_CODE (source) == POINTER_TYPE)
12925     source = TREE_TYPE (source);
12926   if (TREE_CODE (dest) == POINTER_TYPE)
12927     dest = TREE_TYPE (dest);
12928
12929   /* If source and dest are being compiled from bytecode, they may need to
12930      be loaded. */
12931   if (CLASS_P (source) && !CLASS_LOADED_P (source))
12932     {
12933       load_class (source, 1);
12934       safe_layout_class (source);
12935     }
12936   if (CLASS_P (dest) && !CLASS_LOADED_P (dest))
12937     {
12938       load_class (dest, 1);
12939       safe_layout_class (dest);
12940     }
12941
12942   /* Case where SOURCE is a class type */
12943   if (TYPE_CLASS_P (source))
12944     {
12945       if (TYPE_CLASS_P (dest))
12946         return  (source == dest
12947                  || inherits_from_p (source, dest)
12948                  || (cast && inherits_from_p (dest, source)));
12949       if (TYPE_INTERFACE_P (dest))
12950         {
12951           /* If doing a cast and SOURCE is final, the operation is
12952              always correct a compile time (because even if SOURCE
12953              does not implement DEST, a subclass of SOURCE might). */
12954           if (cast && !CLASS_FINAL (TYPE_NAME (source)))
12955             return 1;
12956           /* Otherwise, SOURCE must implement DEST */
12957           return interface_of_p (dest, source);
12958         }
12959       /* DEST is an array, cast permited if SOURCE is of Object type */
12960       return (cast && source == object_type_node ? 1 : 0);
12961     }
12962   if (TYPE_INTERFACE_P (source))
12963     {
12964       if (TYPE_CLASS_P (dest))
12965         {
12966           /* If not casting, DEST must be the Object type */
12967           if (!cast)
12968             return dest == object_type_node;
12969           /* We're doing a cast. The cast is always valid is class
12970              DEST is not final, otherwise, DEST must implement SOURCE */
12971           else if (!CLASS_FINAL (TYPE_NAME (dest)))
12972             return 1;
12973           else
12974             return interface_of_p (source, dest);
12975         }
12976       if (TYPE_INTERFACE_P (dest))
12977         {
12978           /* If doing a cast, then if SOURCE and DEST contain method
12979              with the same signature but different return type, then
12980              this is a (compile time) error */
12981           if (cast)
12982             {
12983               tree method_source, method_dest;
12984               tree source_type;
12985               tree source_sig;
12986               tree source_name;
12987               for (method_source = TYPE_METHODS (source); method_source;
12988                    method_source = TREE_CHAIN (method_source))
12989                 {
12990                   source_sig =
12991                     build_java_argument_signature (TREE_TYPE (method_source));
12992                   source_type = TREE_TYPE (TREE_TYPE (method_source));
12993                   source_name = DECL_NAME (method_source);
12994                   for (method_dest = TYPE_METHODS (dest);
12995                        method_dest; method_dest = TREE_CHAIN (method_dest))
12996                     if (source_sig ==
12997                         build_java_argument_signature (TREE_TYPE (method_dest))
12998                         && source_name == DECL_NAME (method_dest)
12999                         && source_type != TREE_TYPE (TREE_TYPE (method_dest)))
13000                       return 0;
13001                 }
13002               return 1;
13003             }
13004           else
13005             return source == dest || interface_of_p (dest, source);
13006         }
13007       else
13008         {
13009           /* Array */
13010           return (cast
13011                   && (DECL_NAME (TYPE_NAME (source))
13012                       == java_lang_cloneable_identifier_node
13013                       || (DECL_NAME (TYPE_NAME (source))
13014                           == java_io_serializable_identifier_node)));
13015         }
13016     }
13017   if (TYPE_ARRAY_P (source))
13018     {
13019       if (TYPE_CLASS_P (dest))
13020         return dest == object_type_node;
13021       /* Can't cast an array to an interface unless the interface is
13022          java.lang.Cloneable or java.io.Serializable.  */
13023       if (TYPE_INTERFACE_P (dest))
13024         return (DECL_NAME (TYPE_NAME (dest))
13025                 == java_lang_cloneable_identifier_node
13026                 || (DECL_NAME (TYPE_NAME (dest))
13027                     == java_io_serializable_identifier_node));
13028       else                      /* Arrays */
13029         {
13030           tree source_element_type = TYPE_ARRAY_ELEMENT (source);
13031           tree dest_element_type = TYPE_ARRAY_ELEMENT (dest);
13032
13033           /* In case of severe errors, they turn out null */
13034           if (!dest_element_type || !source_element_type)
13035             return 0;
13036           if (source_element_type == dest_element_type)
13037             return 1;
13038           return valid_ref_assignconv_cast_p (source_element_type,
13039                                               dest_element_type, cast);
13040         }
13041       return 0;
13042     }
13043   return 0;
13044 }
13045
13046 static int
13047 valid_cast_to_p (tree source, tree dest)
13048 {
13049   if (TREE_CODE (source) == POINTER_TYPE)
13050     source = TREE_TYPE (source);
13051   if (TREE_CODE (dest) == POINTER_TYPE)
13052     dest = TREE_TYPE (dest);
13053
13054   if (TREE_CODE (source) == RECORD_TYPE && TREE_CODE (dest) == RECORD_TYPE)
13055     return valid_ref_assignconv_cast_p (source, dest, 1);
13056
13057   else if (JNUMERIC_TYPE_P (source) && JNUMERIC_TYPE_P (dest))
13058     return 1;
13059
13060   else if (TREE_CODE (source) == BOOLEAN_TYPE
13061            && TREE_CODE (dest) == BOOLEAN_TYPE)
13062     return 1;
13063
13064   return 0;
13065 }
13066
13067 static tree
13068 do_unary_numeric_promotion (tree arg)
13069 {
13070   tree type = TREE_TYPE (arg);
13071   if ((TREE_CODE (type) == INTEGER_TYPE && TYPE_PRECISION (type) < 32)
13072       || TREE_CODE (type) == CHAR_TYPE)
13073     arg = convert (int_type_node, arg);
13074   return arg;
13075 }
13076
13077 /* Return a nonzero value if SOURCE can be converted into DEST using
13078    the method invocation conversion rule (5.3).  */
13079 static int
13080 valid_method_invocation_conversion_p (tree dest, tree source)
13081 {
13082   return ((JPRIMITIVE_TYPE_P (source) && JPRIMITIVE_TYPE_P (dest)
13083            && valid_builtin_assignconv_identity_widening_p (dest, source))
13084           || ((JREFERENCE_TYPE_P (source) || JNULLP_TYPE_P (source))
13085               && (JREFERENCE_TYPE_P (dest) || JNULLP_TYPE_P (dest))
13086               && valid_ref_assignconv_cast_p (source, dest, 0)));
13087 }
13088
13089 /* Build an incomplete binop expression. */
13090
13091 static tree
13092 build_binop (enum tree_code op, int op_location, tree op1, tree op2)
13093 {
13094   tree binop = build (op, NULL_TREE, op1, op2);
13095   TREE_SIDE_EFFECTS (binop) = 1;
13096   /* Store the location of the operator, for better error report. The
13097      string of the operator will be rebuild based on the OP value. */
13098   EXPR_WFL_LINECOL (binop) = op_location;
13099   return binop;
13100 }
13101
13102 /* Build the string of the operator retained by NODE. If NODE is part
13103    of a compound expression, add an '=' at the end of the string. This
13104    function is called when an error needs to be reported on an
13105    operator. The string is returned as a pointer to a static character
13106    buffer. */
13107
13108 static char *
13109 operator_string (tree node)
13110 {
13111 #define BUILD_OPERATOR_STRING(S)                                        \
13112   {                                                                     \
13113     sprintf (buffer, "%s%s", S, (COMPOUND_ASSIGN_P (node) ? "=" : "")); \
13114     return buffer;                                                      \
13115   }
13116
13117   static char buffer [10];
13118   switch (TREE_CODE (node))
13119     {
13120     case MULT_EXPR: BUILD_OPERATOR_STRING ("*");
13121     case RDIV_EXPR: BUILD_OPERATOR_STRING ("/");
13122     case TRUNC_MOD_EXPR: BUILD_OPERATOR_STRING ("%");
13123     case PLUS_EXPR: BUILD_OPERATOR_STRING ("+");
13124     case MINUS_EXPR: BUILD_OPERATOR_STRING ("-");
13125     case LSHIFT_EXPR: BUILD_OPERATOR_STRING ("<<");
13126     case RSHIFT_EXPR: BUILD_OPERATOR_STRING (">>");
13127     case URSHIFT_EXPR: BUILD_OPERATOR_STRING (">>>");
13128     case BIT_AND_EXPR: BUILD_OPERATOR_STRING ("&");
13129     case BIT_XOR_EXPR: BUILD_OPERATOR_STRING ("^");
13130     case BIT_IOR_EXPR: BUILD_OPERATOR_STRING ("|");
13131     case TRUTH_ANDIF_EXPR: BUILD_OPERATOR_STRING ("&&");
13132     case TRUTH_ORIF_EXPR: BUILD_OPERATOR_STRING ("||");
13133     case EQ_EXPR: BUILD_OPERATOR_STRING ("==");
13134     case NE_EXPR: BUILD_OPERATOR_STRING ("!=");
13135     case GT_EXPR: BUILD_OPERATOR_STRING (">");
13136     case GE_EXPR: BUILD_OPERATOR_STRING (">=");
13137     case LT_EXPR: BUILD_OPERATOR_STRING ("<");
13138     case LE_EXPR: BUILD_OPERATOR_STRING ("<=");
13139     case UNARY_PLUS_EXPR: BUILD_OPERATOR_STRING ("+");
13140     case NEGATE_EXPR: BUILD_OPERATOR_STRING ("-");
13141     case TRUTH_NOT_EXPR: BUILD_OPERATOR_STRING ("!");
13142     case BIT_NOT_EXPR: BUILD_OPERATOR_STRING ("~");
13143     case PREINCREMENT_EXPR:     /* Fall through */
13144     case POSTINCREMENT_EXPR: BUILD_OPERATOR_STRING ("++");
13145     case PREDECREMENT_EXPR:     /* Fall through */
13146     case POSTDECREMENT_EXPR: BUILD_OPERATOR_STRING ("--");
13147     default:
13148       internal_error ("unregistered operator %s",
13149                       tree_code_name [TREE_CODE (node)]);
13150     }
13151   return NULL;
13152 #undef BUILD_OPERATOR_STRING
13153 }
13154
13155 /* Return 1 if VAR_ACCESS1 is equivalent to VAR_ACCESS2.  */
13156
13157 static int
13158 java_decl_equiv (tree var_acc1, tree var_acc2)
13159 {
13160   if (JDECL_P (var_acc1))
13161     return (var_acc1 == var_acc2);
13162
13163   return (TREE_CODE (var_acc1) == COMPONENT_REF
13164           && TREE_CODE (var_acc2) == COMPONENT_REF
13165           && TREE_OPERAND (TREE_OPERAND (var_acc1, 0), 0)
13166              == TREE_OPERAND (TREE_OPERAND (var_acc2, 0), 0)
13167           && TREE_OPERAND (var_acc1, 1) == TREE_OPERAND (var_acc2, 1));
13168 }
13169
13170 /* Return a nonzero value if CODE is one of the operators that can be
13171    used in conjunction with the `=' operator in a compound assignment.  */
13172
13173 static int
13174 binop_compound_p (enum tree_code code)
13175 {
13176   int i;
13177   for (i = 0; i < BINOP_COMPOUND_CANDIDATES; i++)
13178     if (binop_lookup [i] == code)
13179       break;
13180
13181   return i < BINOP_COMPOUND_CANDIDATES;
13182 }
13183
13184 /* Reorganize after a fold to get SAVE_EXPR to generate what we want.  */
13185
13186 static tree
13187 java_refold (tree t)
13188 {
13189   tree c, b, ns, decl;
13190
13191   if (TREE_CODE (t) != MODIFY_EXPR)
13192     return t;
13193
13194   c = TREE_OPERAND (t, 1);
13195   if (! (c && TREE_CODE (c) == COMPOUND_EXPR
13196          && TREE_CODE (TREE_OPERAND (c, 0)) == MODIFY_EXPR
13197          && binop_compound_p (TREE_CODE (TREE_OPERAND (c, 1)))))
13198     return t;
13199
13200   /* Now the left branch of the binary operator. */
13201   b = TREE_OPERAND (TREE_OPERAND (c, 1), 0);
13202   if (! (b && TREE_CODE (b) == NOP_EXPR
13203          && TREE_CODE (TREE_OPERAND (b, 0)) == SAVE_EXPR))
13204     return t;
13205
13206   ns = TREE_OPERAND (TREE_OPERAND (b, 0), 0);
13207   if (! (ns && TREE_CODE (ns) == NOP_EXPR
13208          && TREE_CODE (TREE_OPERAND (ns, 0)) == SAVE_EXPR))
13209     return t;
13210
13211   decl = TREE_OPERAND (TREE_OPERAND (ns, 0), 0);
13212   if ((JDECL_P (decl) || TREE_CODE (decl) == COMPONENT_REF)
13213       /* It's got to be the an equivalent decl */
13214       && java_decl_equiv (decl, TREE_OPERAND (TREE_OPERAND (c, 0), 0)))
13215     {
13216       /* Shorten the NOP_EXPR/SAVE_EXPR path. */
13217       TREE_OPERAND (TREE_OPERAND (c, 1), 0) = TREE_OPERAND (ns, 0);
13218       /* Substitute the COMPOUND_EXPR by the BINOP_EXPR */
13219       TREE_OPERAND (t, 1) = TREE_OPERAND (c, 1);
13220       /* Change the right part of the BINOP_EXPR */
13221       TREE_OPERAND (TREE_OPERAND (t, 1), 1) = TREE_OPERAND (c, 0);
13222     }
13223
13224   return t;
13225 }
13226
13227 /* Binary operators (15.16 up to 15.18). We return error_mark_node on
13228    errors but we modify NODE so that it contains the type computed
13229    according to the expression, when it's fixed. Otherwise, we write
13230    error_mark_node as the type. It allows us to further the analysis
13231    of remaining nodes and detects more errors in certain cases.  */
13232
13233 static tree
13234 patch_binop (tree node, tree wfl_op1, tree wfl_op2)
13235 {
13236   tree op1 = TREE_OPERAND (node, 0);
13237   tree op2 = TREE_OPERAND (node, 1);
13238   tree op1_type = TREE_TYPE (op1);
13239   tree op2_type = TREE_TYPE (op2);
13240   tree prom_type = NULL_TREE, cn;
13241   enum tree_code code = TREE_CODE (node);
13242
13243   /* If 1, tell the routine that we have to return error_mark_node
13244      after checking for the initialization of the RHS */
13245   int error_found = 0;
13246
13247   EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
13248
13249   /* If either op<n>_type are NULL, this might be early signs of an
13250      error situation, unless it's too early to tell (in case we're
13251      handling a `+', `==', `!=' or `instanceof'.) We want to set op<n>_type
13252      correctly so the error can be later on reported accurately. */
13253   if (! (code == PLUS_EXPR || code == NE_EXPR
13254          || code == EQ_EXPR || code == INSTANCEOF_EXPR))
13255     {
13256       tree n;
13257       if (! op1_type)
13258         {
13259           n = java_complete_tree (op1);
13260           op1_type = TREE_TYPE (n);
13261         }
13262       if (! op2_type)
13263         {
13264           n = java_complete_tree (op2);
13265           op2_type = TREE_TYPE (n);
13266         }
13267     }
13268
13269   switch (code)
13270     {
13271     /* 15.16 Multiplicative operators */
13272     case MULT_EXPR:             /* 15.16.1 Multiplication Operator * */
13273     case RDIV_EXPR:             /* 15.16.2 Division Operator / */
13274     case TRUNC_DIV_EXPR:        /* 15.16.2 Integral type Division Operator / */
13275     case TRUNC_MOD_EXPR:        /* 15.16.3 Remainder operator % */
13276       if (!JNUMERIC_TYPE_P (op1_type) || !JNUMERIC_TYPE_P (op2_type))
13277         {
13278           if (!JNUMERIC_TYPE_P (op1_type))
13279             ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op1_type);
13280           if (!JNUMERIC_TYPE_P (op2_type) && (op1_type != op2_type))
13281             ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op2_type);
13282           TREE_TYPE (node) = error_mark_node;
13283           error_found = 1;
13284           break;
13285         }
13286       prom_type = binary_numeric_promotion (op1_type, op2_type, &op1, &op2);
13287
13288       /* Detect integral division by zero */
13289       if ((code == RDIV_EXPR || code == TRUNC_MOD_EXPR)
13290           && TREE_CODE (prom_type) == INTEGER_TYPE
13291           && (op2 == integer_zero_node || op2 == long_zero_node ||
13292               (TREE_CODE (op2) == INTEGER_CST &&
13293                ! TREE_INT_CST_LOW (op2)  && ! TREE_INT_CST_HIGH (op2))))
13294         {
13295           parse_warning_context (wfl_operator, "Evaluating this expression will result in an arithmetic exception being thrown");
13296           TREE_CONSTANT (node) = 0;
13297         }
13298
13299       /* Change the division operator if necessary */
13300       if (code == RDIV_EXPR && TREE_CODE (prom_type) == INTEGER_TYPE)
13301         TREE_SET_CODE (node, TRUNC_DIV_EXPR);
13302
13303       /* Before divisions as is disapear, try to simplify and bail if
13304          applicable, otherwise we won't perform even simple
13305          simplifications like (1-1)/3. We can't do that with floating
13306          point number, folds can't handle them at this stage. */
13307       if (code == RDIV_EXPR && TREE_CONSTANT (op1) && TREE_CONSTANT (op2)
13308           && JINTEGRAL_TYPE_P (op1) && JINTEGRAL_TYPE_P (op2))
13309         {
13310           TREE_TYPE (node) = prom_type;
13311           node = fold (node);
13312           if (TREE_CODE (node) != code)
13313             return node;
13314         }
13315
13316       if (TREE_CODE (prom_type) == INTEGER_TYPE
13317           && flag_use_divide_subroutine
13318           && ! flag_emit_class_files
13319           && (code == RDIV_EXPR || code == TRUNC_MOD_EXPR))
13320         return build_java_soft_divmod (TREE_CODE (node), prom_type, op1, op2);
13321
13322       /* This one is more complicated. FLOATs are processed by a
13323          function call to soft_fmod. Duplicate the value of the
13324          COMPOUND_ASSIGN_P flag. */
13325       if (code == TRUNC_MOD_EXPR)
13326         {
13327           tree mod = build_java_binop (TRUNC_MOD_EXPR, prom_type, op1, op2);
13328           COMPOUND_ASSIGN_P (mod) = COMPOUND_ASSIGN_P (node);
13329           TREE_SIDE_EFFECTS (mod)
13330             = TREE_SIDE_EFFECTS (op1) | TREE_SIDE_EFFECTS (op2);
13331           return mod;
13332         }
13333       break;
13334
13335     /* 15.17 Additive Operators */
13336     case PLUS_EXPR:             /* 15.17.1 String Concatenation Operator + */
13337
13338       /* Operation is valid if either one argument is a string
13339          constant, a String object or a StringBuffer crafted for the
13340          purpose of the a previous usage of the String concatenation
13341          operator */
13342
13343       if (TREE_CODE (op1) == STRING_CST
13344           || TREE_CODE (op2) == STRING_CST
13345           || JSTRING_TYPE_P (op1_type)
13346           || JSTRING_TYPE_P (op2_type)
13347           || IS_CRAFTED_STRING_BUFFER_P (op1)
13348           || IS_CRAFTED_STRING_BUFFER_P (op2))
13349         return build_string_concatenation (op1, op2);
13350
13351     case MINUS_EXPR:            /* 15.17.2 Additive Operators (+ and -) for
13352                                    Numeric Types */
13353       if (!JNUMERIC_TYPE_P (op1_type) || !JNUMERIC_TYPE_P (op2_type))
13354         {
13355           if (!JNUMERIC_TYPE_P (op1_type))
13356             ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op1_type);
13357           if (!JNUMERIC_TYPE_P (op2_type) && (op1_type != op2_type))
13358             ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op2_type);
13359           TREE_TYPE (node) = error_mark_node;
13360           error_found = 1;
13361           break;
13362         }
13363       prom_type = binary_numeric_promotion (op1_type, op2_type, &op1, &op2);
13364       break;
13365
13366     /* 15.18 Shift Operators */
13367     case LSHIFT_EXPR:
13368     case RSHIFT_EXPR:
13369     case URSHIFT_EXPR:
13370       if (!JINTEGRAL_TYPE_P (op1_type) || !JINTEGRAL_TYPE_P (op2_type))
13371         {
13372           if (!JINTEGRAL_TYPE_P (op1_type))
13373             ERROR_CAST_NEEDED_TO_INTEGRAL (wfl_operator, node, op1_type);
13374           else
13375             {
13376               if (JNUMERIC_TYPE_P (op2_type))
13377                 parse_error_context (wfl_operator,
13378                                      "Incompatible type for `%s'. Explicit cast needed to convert shift distance from `%s' to integral",
13379                                      operator_string (node),
13380                                      lang_printable_name (op2_type, 0));
13381               else
13382                 parse_error_context (wfl_operator,
13383                                      "Incompatible type for `%s'. Can't convert shift distance from `%s' to integral",
13384                                      operator_string (node),
13385                                      lang_printable_name (op2_type, 0));
13386             }
13387           TREE_TYPE (node) = error_mark_node;
13388           error_found = 1;
13389           break;
13390         }
13391
13392       /* Unary numeric promotion (5.6.1) is performed on each operand
13393          separately */
13394       op1 = do_unary_numeric_promotion (op1);
13395       op2 = do_unary_numeric_promotion (op2);
13396
13397       /* If the right hand side is of type `long', first cast it to
13398          `int'.  */
13399       if (TREE_TYPE (op2) == long_type_node)
13400         op2 = build1 (CONVERT_EXPR, int_type_node, op2);
13401
13402       /* The type of the shift expression is the type of the promoted
13403          type of the left-hand operand */
13404       prom_type = TREE_TYPE (op1);
13405
13406       /* Shift int only up to 0x1f and long up to 0x3f */
13407       if (prom_type == int_type_node)
13408         op2 = fold (build (BIT_AND_EXPR, int_type_node, op2,
13409                            build_int_2 (0x1f, 0)));
13410       else
13411         op2 = fold (build (BIT_AND_EXPR, int_type_node, op2,
13412                            build_int_2 (0x3f, 0)));
13413
13414       /* The >>> operator is a >> operating on unsigned quantities */
13415       if (code == URSHIFT_EXPR && ! flag_emit_class_files)
13416         {
13417           tree to_return;
13418           tree utype = java_unsigned_type (prom_type);
13419           op1 = convert (utype, op1);
13420           TREE_SET_CODE (node, RSHIFT_EXPR);
13421           TREE_OPERAND (node, 0) = op1;
13422           TREE_OPERAND (node, 1) = op2;
13423           TREE_TYPE (node) = utype;
13424           to_return = convert (prom_type, node);
13425           /* Copy the original value of the COMPOUND_ASSIGN_P flag */
13426           COMPOUND_ASSIGN_P (to_return) = COMPOUND_ASSIGN_P (node);
13427           TREE_SIDE_EFFECTS (to_return)
13428             = TREE_SIDE_EFFECTS (op1) | TREE_SIDE_EFFECTS (op2);
13429           return to_return;
13430         }
13431       break;
13432
13433       /* 15.19.1 Type Comparison Operator instanceof */
13434     case INSTANCEOF_EXPR:
13435
13436       TREE_TYPE (node) = boolean_type_node;
13437
13438       /* OP1_TYPE might be NULL when OP1 is a string constant.  */
13439       if ((cn = patch_string (op1)))
13440         {
13441           op1 = cn;
13442           op1_type = TREE_TYPE (op1);
13443         }
13444       if (op1_type == NULL_TREE)
13445         abort ();
13446
13447       if (!(op2_type = resolve_type_during_patch (op2)))
13448         return error_mark_node;
13449
13450       /* The first operand must be a reference type or the null type */
13451       if (!JREFERENCE_TYPE_P (op1_type) && op1 != null_pointer_node)
13452         error_found = 1;        /* Error reported further below */
13453
13454       /* The second operand must be a reference type */
13455       if (!JREFERENCE_TYPE_P (op2_type))
13456         {
13457           SET_WFL_OPERATOR (wfl_operator, node, wfl_op2);
13458           parse_error_context
13459             (wfl_operator, "Invalid argument `%s' for `instanceof'",
13460              lang_printable_name (op2_type, 0));
13461           error_found = 1;
13462         }
13463
13464       if (!error_found && valid_ref_assignconv_cast_p (op1_type, op2_type, 1))
13465         {
13466           /* If the first operand is null, the result is always false */
13467           if (op1 == null_pointer_node)
13468             return boolean_false_node;
13469           else if (flag_emit_class_files)
13470             {
13471               TREE_OPERAND (node, 1) = op2_type;
13472               TREE_SIDE_EFFECTS (node) = TREE_SIDE_EFFECTS (op1);
13473               return node;
13474             }
13475           /* Otherwise we have to invoke instance of to figure it out */
13476           else
13477             return build_instanceof (op1, op2_type);
13478         }
13479       /* There is no way the expression operand can be an instance of
13480          the type operand. This is a compile time error. */
13481       else
13482         {
13483           char *t1 = xstrdup (lang_printable_name (op1_type, 0));
13484           SET_WFL_OPERATOR (wfl_operator, node, wfl_op1);
13485           parse_error_context
13486             (wfl_operator, "Impossible for `%s' to be instance of `%s'",
13487              t1, lang_printable_name (op2_type, 0));
13488           free (t1);
13489           error_found = 1;
13490         }
13491
13492       break;
13493
13494       /* 15.21 Bitwise and Logical Operators */
13495     case BIT_AND_EXPR:
13496     case BIT_XOR_EXPR:
13497     case BIT_IOR_EXPR:
13498       if (JINTEGRAL_TYPE_P (op1_type) && JINTEGRAL_TYPE_P (op2_type))
13499         /* Binary numeric promotion is performed on both operand and the
13500            expression retain that type */
13501         prom_type = binary_numeric_promotion (op1_type, op2_type, &op1, &op2);
13502
13503       else if (TREE_CODE (op1_type) == BOOLEAN_TYPE
13504                && TREE_CODE (op1_type) == BOOLEAN_TYPE)
13505         /* The type of the bitwise operator expression is BOOLEAN */
13506         prom_type = boolean_type_node;
13507       else
13508         {
13509           if (!JINTEGRAL_TYPE_P (op1_type))
13510             ERROR_CAST_NEEDED_TO_INTEGRAL (wfl_operator, node, op1_type);
13511           if (!JINTEGRAL_TYPE_P (op2_type) && (op1_type != op2_type))
13512             ERROR_CAST_NEEDED_TO_INTEGRAL (wfl_operator, node, op2_type);
13513           TREE_TYPE (node) = error_mark_node;
13514           error_found = 1;
13515           /* Insert a break here if adding thing before the switch's
13516              break for this case */
13517         }
13518       break;
13519
13520       /* 15.22 Conditional-And Operator */
13521     case TRUTH_ANDIF_EXPR:
13522       /* 15.23 Conditional-Or Operator */
13523     case TRUTH_ORIF_EXPR:
13524       /* Operands must be of BOOLEAN type */
13525       if (TREE_CODE (op1_type) != BOOLEAN_TYPE ||
13526           TREE_CODE (op2_type) != BOOLEAN_TYPE)
13527         {
13528           if (TREE_CODE (op1_type) != BOOLEAN_TYPE)
13529             ERROR_CANT_CONVERT_TO_BOOLEAN (wfl_operator, node, op1_type);
13530           if (TREE_CODE (op2_type) != BOOLEAN_TYPE && (op1_type != op2_type))
13531             ERROR_CANT_CONVERT_TO_BOOLEAN (wfl_operator, node, op2_type);
13532           TREE_TYPE (node) = boolean_type_node;
13533           error_found = 1;
13534           break;
13535         }
13536       else if (integer_zerop (op1))
13537         {
13538           return code == TRUTH_ANDIF_EXPR ? op1 : op2;
13539         }
13540       else if (integer_onep (op1))
13541         {
13542           return code == TRUTH_ANDIF_EXPR ? op2 : op1;
13543         }
13544       /* The type of the conditional operators is BOOLEAN */
13545       prom_type = boolean_type_node;
13546       break;
13547
13548       /* 15.19.1 Numerical Comparison Operators <, <=, >, >= */
13549     case LT_EXPR:
13550     case GT_EXPR:
13551     case LE_EXPR:
13552     case GE_EXPR:
13553       /* The type of each of the operands must be a primitive numeric
13554          type */
13555       if (!JNUMERIC_TYPE_P (op1_type) || ! JNUMERIC_TYPE_P (op2_type))
13556         {
13557           if (!JNUMERIC_TYPE_P (op1_type))
13558             ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op1_type);
13559           if (!JNUMERIC_TYPE_P (op2_type) && (op1_type != op2_type))
13560             ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op2_type);
13561           TREE_TYPE (node) = boolean_type_node;
13562           error_found = 1;
13563           break;
13564         }
13565       /* Binary numeric promotion is performed on the operands */
13566       binary_numeric_promotion (op1_type, op2_type, &op1, &op2);
13567       /* The type of the relation expression is always BOOLEAN */
13568       prom_type = boolean_type_node;
13569       break;
13570
13571       /* 15.20 Equality Operator */
13572     case EQ_EXPR:
13573     case NE_EXPR:
13574       /* It's time for us to patch the strings. */
13575       if ((cn = patch_string (op1)))
13576        {
13577          op1 = cn;
13578          op1_type = TREE_TYPE (op1);
13579        }
13580       if ((cn = patch_string (op2)))
13581        {
13582          op2 = cn;
13583          op2_type = TREE_TYPE (op2);
13584        }
13585
13586       /* 15.20.1 Numerical Equality Operators == and != */
13587       /* Binary numeric promotion is performed on the operands */
13588       if (JNUMERIC_TYPE_P (op1_type) && JNUMERIC_TYPE_P (op2_type))
13589         binary_numeric_promotion (op1_type, op2_type, &op1, &op2);
13590
13591       /* 15.20.2 Boolean Equality Operators == and != */
13592       else if (TREE_CODE (op1_type) == BOOLEAN_TYPE &&
13593           TREE_CODE (op2_type) == BOOLEAN_TYPE)
13594         ;                       /* Nothing to do here */
13595
13596       /* 15.20.3 Reference Equality Operators == and != */
13597       /* Types have to be either references or the null type. If
13598          they're references, it must be possible to convert either
13599          type to the other by casting conversion. */
13600       else if (op1 == null_pointer_node || op2 == null_pointer_node
13601                || (JREFERENCE_TYPE_P (op1_type) && JREFERENCE_TYPE_P (op2_type)
13602                    && (valid_ref_assignconv_cast_p (op1_type, op2_type, 1)
13603                        || valid_ref_assignconv_cast_p (op2_type,
13604                                                        op1_type, 1))))
13605         ;                       /* Nothing to do here */
13606
13607       /* Else we have an error figure what can't be converted into
13608          what and report the error */
13609       else
13610         {
13611           char *t1;
13612           t1 = xstrdup (lang_printable_name (op1_type, 0));
13613           parse_error_context
13614             (wfl_operator,
13615              "Incompatible type for `%s'. Can't convert `%s' to `%s'",
13616              operator_string (node), t1,
13617              lang_printable_name (op2_type, 0));
13618           free (t1);
13619           TREE_TYPE (node) = boolean_type_node;
13620           error_found = 1;
13621           break;
13622         }
13623       prom_type = boolean_type_node;
13624       break;
13625     default:
13626       abort ();
13627     }
13628
13629   if (error_found)
13630     return error_mark_node;
13631
13632   TREE_OPERAND (node, 0) = op1;
13633   TREE_OPERAND (node, 1) = op2;
13634   TREE_TYPE (node) = prom_type;
13635   TREE_SIDE_EFFECTS (node) = TREE_SIDE_EFFECTS (op1) | TREE_SIDE_EFFECTS (op2);
13636
13637   if (flag_emit_xref)
13638     return node;
13639
13640   /* fold does not respect side-effect order as required for Java but not C.
13641    * Also, it sometimes create SAVE_EXPRs which are bad when emitting
13642    * bytecode.
13643    */
13644   if (flag_emit_class_files ? (TREE_CONSTANT (op1) && TREE_CONSTANT (op2))
13645       : ! TREE_SIDE_EFFECTS (node))
13646     node = fold (node);
13647   return node;
13648 }
13649
13650 /* Concatenate the STRING_CST CSTE and STRING. When AFTER is a non
13651    zero value, the value of CSTE comes after the valude of STRING */
13652
13653 static tree
13654 do_merge_string_cste (tree cste, const char *string, int string_len, int after)
13655 {
13656   const char *old = TREE_STRING_POINTER (cste);
13657   int old_len = TREE_STRING_LENGTH (cste);
13658   int len = old_len + string_len;
13659   char *new = alloca (len+1);
13660
13661   if (after)
13662     {
13663       memcpy (new, string, string_len);
13664       memcpy (&new [string_len], old, old_len);
13665     }
13666   else
13667     {
13668       memcpy (new, old, old_len);
13669       memcpy (&new [old_len], string, string_len);
13670     }
13671   new [len] = '\0';
13672   return build_string (len, new);
13673 }
13674
13675 /* Tries to merge OP1 (a STRING_CST) and OP2 (if suitable). Return a
13676    new STRING_CST on success, NULL_TREE on failure.  */
13677
13678 static tree
13679 merge_string_cste (tree op1, tree op2, int after)
13680 {
13681   /* Handle two string constants right away.  */
13682   if (TREE_CODE (op2) == STRING_CST)
13683     return do_merge_string_cste (op1, TREE_STRING_POINTER (op2),
13684                                  TREE_STRING_LENGTH (op2), after);
13685
13686   /* Reasonable integer constant can be treated right away.  */
13687   if (TREE_CODE (op2) == INTEGER_CST && !TREE_CONSTANT_OVERFLOW (op2))
13688     {
13689       static const char *const boolean_true = "true";
13690       static const char *const boolean_false = "false";
13691       static const char *const null_pointer = "null";
13692       char ch[4];
13693       const char *string;
13694
13695       if (op2 == boolean_true_node)
13696         string = boolean_true;
13697       else if (op2 == boolean_false_node)
13698         string = boolean_false;
13699       else if (op2 == null_pointer_node)
13700         /* FIXME: null is not a compile-time constant, so it is only safe to
13701            merge if the overall expression is non-constant. However, this
13702            code always merges without checking the overall expression.  */
13703         string = null_pointer;
13704       else if (TREE_TYPE (op2) == char_type_node)
13705         {
13706           /* Convert the character into UTF-8.  */
13707           unsigned int c = (unsigned int) TREE_INT_CST_LOW (op2);
13708           unsigned char *p = (unsigned char *) ch;
13709           if (0x01 <= c && c <= 0x7f)
13710             *p++ = (unsigned char) c;
13711           else if (c < 0x7ff)
13712             {
13713               *p++ = (unsigned char) (c >> 6 | 0xc0);
13714               *p++ = (unsigned char) ((c & 0x3f) | 0x80);
13715             }
13716           else
13717             {
13718               *p++ = (unsigned char) (c >> 12 | 0xe0);
13719               *p++ = (unsigned char) (((c >> 6) & 0x3f) | 0x80);
13720               *p++ = (unsigned char) ((c & 0x3f) | 0x80);
13721             }
13722           *p = '\0';
13723
13724           string = ch;
13725         }
13726       else
13727         string = string_convert_int_cst (op2);
13728
13729       return do_merge_string_cste (op1, string, strlen (string), after);
13730     }
13731   return NULL_TREE;
13732 }
13733
13734 /* Tries to statically concatenate OP1 and OP2 if possible. Either one
13735    has to be a STRING_CST and the other part must be a STRING_CST or a
13736    INTEGRAL constant. Return a new STRING_CST if the operation
13737    succeed, NULL_TREE otherwise.
13738
13739    If the case we want to optimize for space, we might want to return
13740    NULL_TREE for each invocation of this routine. FIXME */
13741
13742 static tree
13743 string_constant_concatenation (tree op1, tree op2)
13744 {
13745   if (TREE_CODE (op1) == STRING_CST || (TREE_CODE (op2) == STRING_CST))
13746     {
13747       tree string, rest;
13748       int invert;
13749
13750       string = (TREE_CODE (op1) == STRING_CST ? op1 : op2);
13751       rest   = (string == op1 ? op2 : op1);
13752       invert = (string == op1 ? 0 : 1 );
13753
13754       /* Walk REST, only if it looks reasonable */
13755       if (TREE_CODE (rest) != STRING_CST
13756           && !IS_CRAFTED_STRING_BUFFER_P (rest)
13757           && !JSTRING_TYPE_P (TREE_TYPE (rest))
13758           && TREE_CODE (rest) == EXPR_WITH_FILE_LOCATION)
13759         {
13760           rest = java_complete_tree (rest);
13761           if (rest == error_mark_node)
13762             return error_mark_node;
13763           rest = fold (rest);
13764         }
13765       return merge_string_cste (string, rest, invert);
13766     }
13767   return NULL_TREE;
13768 }
13769
13770 /* Implement the `+' operator. Does static optimization if possible,
13771    otherwise create (if necessary) and append elements to a
13772    StringBuffer. The StringBuffer will be carried around until it is
13773    used for a function call or an assignment. Then toString() will be
13774    called on it to turn it into a String object. */
13775
13776 static tree
13777 build_string_concatenation (tree op1, tree op2)
13778 {
13779   tree result;
13780   int side_effects = TREE_SIDE_EFFECTS (op1) | TREE_SIDE_EFFECTS (op2);
13781
13782   if (flag_emit_xref)
13783     return build (PLUS_EXPR, string_type_node, op1, op2);
13784
13785   /* Try to do some static optimization */
13786   if ((result = string_constant_concatenation (op1, op2)))
13787     return result;
13788
13789   /* Discard empty strings on either side of the expression */
13790   if (TREE_CODE (op1) == STRING_CST && TREE_STRING_LENGTH (op1) == 0)
13791     {
13792       op1 = op2;
13793       op2 = NULL_TREE;
13794     }
13795   else if (TREE_CODE (op2) == STRING_CST && TREE_STRING_LENGTH (op2) == 0)
13796     op2 = NULL_TREE;
13797
13798   /* If operands are string constant, turn then into object references */
13799   if (TREE_CODE (op1) == STRING_CST)
13800     op1 = patch_string_cst (op1);
13801   if (op2 && TREE_CODE (op2) == STRING_CST)
13802     op2 = patch_string_cst (op2);
13803
13804   /* If either one of the constant is null and the other non null
13805      operand is a String constant, return it. */
13806   if ((TREE_CODE (op1) == STRING_CST) && !op2)
13807     return op1;
13808
13809   /* If OP1 isn't already a StringBuffer, create and
13810      initialize a new one */
13811   if (!IS_CRAFTED_STRING_BUFFER_P (op1))
13812     {
13813       /* Two solutions here:
13814          1) OP1 is a constant string reference, we call new StringBuffer(OP1)
13815          2) OP1 is something else, we call new StringBuffer().append(OP1).  */
13816       if (TREE_CONSTANT (op1) && JSTRING_TYPE_P (TREE_TYPE (op1)))
13817         op1 = BUILD_STRING_BUFFER (op1);
13818       else
13819         {
13820           tree aNew = BUILD_STRING_BUFFER (NULL_TREE);
13821           op1 = make_qualified_primary (aNew, BUILD_APPEND (op1), 0);
13822         }
13823     }
13824
13825   if (op2)
13826     {
13827       /* OP1 is no longer the last node holding a crafted StringBuffer */
13828       IS_CRAFTED_STRING_BUFFER_P (op1) = 0;
13829       /* Create a node for `{new...,xxx}.append (op2)' */
13830       if (op2)
13831         op1 = make_qualified_primary (op1, BUILD_APPEND (op2), 0);
13832     }
13833
13834   /* Mark the last node holding a crafted StringBuffer */
13835   IS_CRAFTED_STRING_BUFFER_P (op1) = 1;
13836
13837   TREE_SIDE_EFFECTS (op1) = side_effects;
13838   return op1;
13839 }
13840
13841 /* Patch the string node NODE. NODE can be a STRING_CST of a crafted
13842    StringBuffer. If no string were found to be patched, return
13843    NULL. */
13844
13845 static tree
13846 patch_string (tree node)
13847 {
13848   if (node == error_mark_node)
13849     return error_mark_node;
13850   if (TREE_CODE (node) == STRING_CST)
13851     return patch_string_cst (node);
13852   else if (IS_CRAFTED_STRING_BUFFER_P (node))
13853     {
13854       int saved = ctxp->explicit_constructor_p;
13855       tree invoke = build_method_invocation (wfl_to_string, NULL_TREE);
13856       tree ret;
13857       /* Temporary disable forbid the use of `this'. */
13858       ctxp->explicit_constructor_p = 0;
13859       ret = java_complete_tree (make_qualified_primary (node, invoke, 0));
13860       /* String concatenation arguments must be evaluated in order too. */
13861       ret = force_evaluation_order (ret);
13862       /* Restore it at its previous value */
13863       ctxp->explicit_constructor_p = saved;
13864       return ret;
13865     }
13866   return NULL_TREE;
13867 }
13868
13869 /* Build the internal representation of a string constant.  */
13870
13871 static tree
13872 patch_string_cst (tree node)
13873 {
13874   int location;
13875   if (! flag_emit_class_files)
13876     {
13877       node = get_identifier (TREE_STRING_POINTER (node));
13878       location = alloc_name_constant (CONSTANT_String, node);
13879       node = build_ref_from_constant_pool (location);
13880     }
13881   TREE_TYPE (node) = string_ptr_type_node;
13882   TREE_CONSTANT (node) = 1;
13883   return node;
13884 }
13885
13886 /* Build an incomplete unary operator expression. */
13887
13888 static tree
13889 build_unaryop (int op_token, int op_location, tree op1)
13890 {
13891   enum tree_code op;
13892   tree unaryop;
13893   switch (op_token)
13894     {
13895     case PLUS_TK: op = UNARY_PLUS_EXPR; break;
13896     case MINUS_TK: op = NEGATE_EXPR; break;
13897     case NEG_TK: op = TRUTH_NOT_EXPR; break;
13898     case NOT_TK: op = BIT_NOT_EXPR; break;
13899     default: abort ();
13900     }
13901
13902   unaryop = build1 (op, NULL_TREE, op1);
13903   TREE_SIDE_EFFECTS (unaryop) = 1;
13904   /* Store the location of the operator, for better error report. The
13905      string of the operator will be rebuild based on the OP value. */
13906   EXPR_WFL_LINECOL (unaryop) = op_location;
13907   return unaryop;
13908 }
13909
13910 /* Special case for the ++/-- operators, since they require an extra
13911    argument to build, which is set to NULL and patched
13912    later. IS_POST_P is 1 if the operator, 0 otherwise.  */
13913
13914 static tree
13915 build_incdec (int op_token, int op_location, tree op1, int is_post_p)
13916 {
13917   static const enum tree_code lookup [2][2] =
13918     {
13919       { PREDECREMENT_EXPR, PREINCREMENT_EXPR, },
13920       { POSTDECREMENT_EXPR, POSTINCREMENT_EXPR, },
13921     };
13922   tree node = build (lookup [is_post_p][(op_token - DECR_TK)],
13923                      NULL_TREE, op1, NULL_TREE);
13924   TREE_SIDE_EFFECTS (node) = 1;
13925   /* Store the location of the operator, for better error report. The
13926      string of the operator will be rebuild based on the OP value. */
13927   EXPR_WFL_LINECOL (node) = op_location;
13928   return node;
13929 }
13930
13931 /* Build an incomplete cast operator, based on the use of the
13932    CONVERT_EXPR. Note that TREE_TYPE of the constructed node is
13933    set. java_complete_tree is trained to walk a CONVERT_EXPR even
13934    though its type is already set.  */
13935
13936 static tree
13937 build_cast (int location, tree type, tree exp)
13938 {
13939   tree node = build1 (CONVERT_EXPR, type, exp);
13940   EXPR_WFL_LINECOL (node) = location;
13941   return node;
13942 }
13943
13944 /* Build an incomplete class reference operator.  */
13945 static tree
13946 build_incomplete_class_ref (int location, tree class_name)
13947 {
13948   tree node = build1 (CLASS_LITERAL, NULL_TREE, class_name);
13949   EXPR_WFL_LINECOL (node) = location;
13950   return node;
13951 }
13952
13953 /* Complete an incomplete class reference operator.  */
13954 static tree
13955 patch_incomplete_class_ref (tree node)
13956 {
13957   tree type = TREE_OPERAND (node, 0);
13958   tree ref_type;
13959
13960   if (!(ref_type = resolve_type_during_patch (type)))
13961     return error_mark_node;
13962
13963   /* Generate the synthetic static method `class$'.  (Previously we
13964      deferred this, causing different method tables to be emitted
13965      for native code and bytecode.)  */
13966   if (!TYPE_DOT_CLASS (current_class))
13967       build_dot_class_method (current_class);
13968
13969   /* If we're not emitting class files and we know ref_type is a
13970      compiled class, build a direct reference.  */
13971   if ((! flag_emit_class_files && is_compiled_class (ref_type))
13972       || JPRIMITIVE_TYPE_P (ref_type)
13973       || TREE_CODE (ref_type) == VOID_TYPE)
13974     {
13975       tree dot = build_class_ref (ref_type);
13976       /* A class referenced by `foo.class' is initialized.  */
13977       if (!flag_emit_class_files)
13978        dot = build_class_init (ref_type, dot);
13979       return java_complete_tree (dot);
13980     }
13981
13982   /* If we're emitting class files and we have to deal with non
13983      primitive types, we invoke the synthetic static method `class$'.  */
13984   ref_type = build_dot_class_method_invocation (ref_type);
13985   return java_complete_tree (ref_type);
13986 }
13987
13988 /* 15.14 Unary operators. We return error_mark_node in case of error,
13989    but preserve the type of NODE if the type is fixed.  */
13990
13991 static tree
13992 patch_unaryop (tree node, tree wfl_op)
13993 {
13994   tree op = TREE_OPERAND (node, 0);
13995   tree op_type = TREE_TYPE (op);
13996   tree prom_type = NULL_TREE, value, decl;
13997   int outer_field_flag = 0;
13998   int code = TREE_CODE (node);
13999   int error_found = 0;
14000
14001   EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
14002
14003   switch (code)
14004     {
14005       /* 15.13.2 Postfix Increment Operator ++ */
14006     case POSTINCREMENT_EXPR:
14007       /* 15.13.3 Postfix Increment Operator -- */
14008     case POSTDECREMENT_EXPR:
14009       /* 15.14.1 Prefix Increment Operator ++ */
14010     case PREINCREMENT_EXPR:
14011       /* 15.14.2 Prefix Decrement Operator -- */
14012     case PREDECREMENT_EXPR:
14013       op = decl = strip_out_static_field_access_decl (op);
14014       outer_field_flag = outer_field_expanded_access_p (op, NULL, NULL, NULL);
14015       /* We might be trying to change an outer field accessed using
14016          access method. */
14017       if (outer_field_flag)
14018         {
14019           /* Retrieve the decl of the field we're trying to access. We
14020              do that by first retrieving the function we would call to
14021              access the field. It has been already verified that this
14022              field isn't final */
14023           if (flag_emit_class_files)
14024             decl = TREE_OPERAND (op, 0);
14025           else
14026             decl = TREE_OPERAND (TREE_OPERAND (TREE_OPERAND (op, 0), 0), 0);
14027           decl = DECL_FUNCTION_ACCESS_DECL (decl);
14028         }
14029       /* We really should have a JAVA_ARRAY_EXPR to avoid this */
14030       else if (!JDECL_P (decl)
14031           && TREE_CODE (decl) != COMPONENT_REF
14032           && !(flag_emit_class_files && TREE_CODE (decl) == ARRAY_REF)
14033           && TREE_CODE (decl) != INDIRECT_REF
14034           && !(TREE_CODE (decl) == COMPOUND_EXPR
14035                && TREE_OPERAND (decl, 1)
14036                && (TREE_CODE (TREE_OPERAND (decl, 1)) == INDIRECT_REF)))
14037         {
14038           TREE_TYPE (node) = error_mark_node;
14039           error_found = 1;
14040         }
14041
14042       /* From now on, we know that op if a variable and that it has a
14043          valid wfl. We use wfl_op to locate errors related to the
14044          ++/-- operand. */
14045       if (!JNUMERIC_TYPE_P (op_type))
14046         {
14047           parse_error_context
14048             (wfl_op, "Invalid argument type `%s' to `%s'",
14049              lang_printable_name (op_type, 0), operator_string (node));
14050           TREE_TYPE (node) = error_mark_node;
14051           error_found = 1;
14052         }
14053       else
14054         {
14055           /* Before the addition, binary numeric promotion is performed on
14056              both operands, if really necessary */
14057           if (JINTEGRAL_TYPE_P (op_type))
14058             {
14059               value = build_int_2 (1, 0);
14060               TREE_TYPE (value) = TREE_TYPE (node) = op_type;
14061             }
14062           else
14063             {
14064               value = build_int_2 (1, 0);
14065               TREE_TYPE (node) =
14066                 binary_numeric_promotion (op_type,
14067                                           TREE_TYPE (value), &op, &value);
14068             }
14069
14070           /* We remember we might be accessing an outer field */
14071           if (outer_field_flag)
14072             {
14073               /* We re-generate an access to the field */
14074               value = build (PLUS_EXPR, TREE_TYPE (op),
14075                              build_outer_field_access (wfl_op, decl), value);
14076
14077               /* And we patch the original access$() into a write
14078                  with plus_op as a rhs */
14079               return outer_field_access_fix (node, op, value);
14080             }
14081
14082           /* And write back into the node. */
14083           TREE_OPERAND (node, 0) = op;
14084           TREE_OPERAND (node, 1) = value;
14085           /* Convert the overall back into its original type, if
14086              necessary, and return */
14087           if (JINTEGRAL_TYPE_P (op_type))
14088             return fold (node);
14089           else
14090             return fold (convert (op_type, node));
14091         }
14092       break;
14093
14094       /* 15.14.3 Unary Plus Operator + */
14095     case UNARY_PLUS_EXPR:
14096       /* 15.14.4 Unary Minus Operator - */
14097     case NEGATE_EXPR:
14098       if (!JNUMERIC_TYPE_P (op_type))
14099         {
14100           ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op_type);
14101           TREE_TYPE (node) = error_mark_node;
14102           error_found = 1;
14103         }
14104       /* Unary numeric promotion is performed on operand */
14105       else
14106         {
14107           op = do_unary_numeric_promotion (op);
14108           prom_type = TREE_TYPE (op);
14109           if (code == UNARY_PLUS_EXPR)
14110             return fold (op);
14111         }
14112       break;
14113
14114       /* 15.14.5 Bitwise Complement Operator ~ */
14115     case BIT_NOT_EXPR:
14116       if (!JINTEGRAL_TYPE_P (op_type))
14117         {
14118           ERROR_CAST_NEEDED_TO_INTEGRAL (wfl_operator, node, op_type);
14119           TREE_TYPE (node) = error_mark_node;
14120           error_found = 1;
14121         }
14122       else
14123         {
14124           op = do_unary_numeric_promotion (op);
14125           prom_type = TREE_TYPE (op);
14126         }
14127       break;
14128
14129       /* 15.14.6 Logical Complement Operator ! */
14130     case TRUTH_NOT_EXPR:
14131       if (TREE_CODE (op_type) != BOOLEAN_TYPE)
14132         {
14133           ERROR_CANT_CONVERT_TO_BOOLEAN (wfl_operator, node, op_type);
14134           /* But the type is known. We will report an error if further
14135              attempt of a assignment is made with this rhs */
14136           TREE_TYPE (node) = boolean_type_node;
14137           error_found = 1;
14138         }
14139       else
14140         prom_type = boolean_type_node;
14141       break;
14142
14143       /* 15.15 Cast Expression */
14144     case CONVERT_EXPR:
14145       value = patch_cast (node, wfl_operator);
14146       if (value == error_mark_node)
14147         {
14148           /* If this cast is part of an assignment, we tell the code
14149              that deals with it not to complain about a mismatch,
14150              because things have been cast, anyways */
14151           TREE_TYPE (node) = error_mark_node;
14152           error_found = 1;
14153         }
14154       else
14155         {
14156           value = fold (value);
14157           TREE_SIDE_EFFECTS (value) = TREE_SIDE_EFFECTS (op);
14158           return value;
14159         }
14160       break;
14161     }
14162
14163   if (error_found)
14164     return error_mark_node;
14165
14166   /* There are cases where node has been replaced by something else
14167      and we don't end up returning here: UNARY_PLUS_EXPR,
14168      CONVERT_EXPR, {POST,PRE}{INCR,DECR}EMENT_EXPR. */
14169   TREE_OPERAND (node, 0) = fold (op);
14170   TREE_TYPE (node) = prom_type;
14171   TREE_SIDE_EFFECTS (node) = TREE_SIDE_EFFECTS (op);
14172   return fold (node);
14173 }
14174
14175 /* Generic type resolution that sometimes takes place during node
14176    patching. Returned the resolved type or generate an error
14177    message. Return the resolved type or NULL_TREE.  */
14178
14179 static tree
14180 resolve_type_during_patch (tree type)
14181 {
14182   if (unresolved_type_p (type, NULL))
14183     {
14184       tree type_decl = resolve_and_layout (EXPR_WFL_NODE (type), type);
14185       if (!type_decl)
14186         {
14187           parse_error_context (type,
14188                                "Class `%s' not found in type declaration",
14189                                IDENTIFIER_POINTER (EXPR_WFL_NODE (type)));
14190           return NULL_TREE;
14191         }
14192
14193       check_deprecation (type, type_decl);
14194
14195       return TREE_TYPE (type_decl);
14196     }
14197   return type;
14198 }
14199
14200 /* 5.5 Casting Conversion. error_mark_node is returned if an error is
14201    found. Otherwise NODE or something meant to replace it is returned.  */
14202
14203 static tree
14204 patch_cast (tree node, tree wfl_op)
14205 {
14206   tree op = TREE_OPERAND (node, 0);
14207   tree cast_type = TREE_TYPE (node);
14208   tree patched, op_type;
14209   char *t1;
14210
14211   /* Some string patching might be necessary at this stage */
14212   if ((patched = patch_string (op)))
14213     TREE_OPERAND (node, 0) = op = patched;
14214   op_type = TREE_TYPE (op);
14215
14216   /* First resolve OP_TYPE if unresolved */
14217   if (!(cast_type = resolve_type_during_patch (cast_type)))
14218     return error_mark_node;
14219
14220   /* Check on cast that are proven correct at compile time */
14221   if (JNUMERIC_TYPE_P (cast_type) && JNUMERIC_TYPE_P (op_type))
14222     {
14223       /* Same type */
14224       if (cast_type == op_type)
14225         return node;
14226
14227       /* float and double type are converted to the original type main
14228          variant and then to the target type. */
14229       if (JFLOAT_TYPE_P (op_type) && TREE_CODE (cast_type) == CHAR_TYPE)
14230         op = convert (integer_type_node, op);
14231
14232       /* Try widening/narowwing convertion. Potentially, things need
14233          to be worked out in gcc so we implement the extreme cases
14234          correctly. fold_convert() needs to be fixed. */
14235       return convert (cast_type, op);
14236     }
14237
14238   /* It's also valid to cast a boolean into a boolean */
14239   if (op_type == boolean_type_node && cast_type == boolean_type_node)
14240     return node;
14241
14242   /* null can be casted to references */
14243   if (op == null_pointer_node && JREFERENCE_TYPE_P (cast_type))
14244     return build_null_of_type (cast_type);
14245
14246   /* The remaining legal casts involve conversion between reference
14247      types. Check for their compile time correctness. */
14248   if (JREFERENCE_TYPE_P (op_type) && JREFERENCE_TYPE_P (cast_type)
14249       && valid_ref_assignconv_cast_p (op_type, cast_type, 1))
14250     {
14251       TREE_TYPE (node) = promote_type (cast_type);
14252       /* Now, the case can be determined correct at compile time if
14253          OP_TYPE can be converted into CAST_TYPE by assignment
14254          conversion (5.2) */
14255
14256       if (valid_ref_assignconv_cast_p (op_type, cast_type, 0))
14257         {
14258           TREE_SET_CODE (node, NOP_EXPR);
14259           return node;
14260         }
14261
14262       if (flag_emit_class_files)
14263         {
14264           TREE_SET_CODE (node, CONVERT_EXPR);
14265           return node;
14266         }
14267
14268       /* The cast requires a run-time check */
14269       return build (CALL_EXPR, promote_type (cast_type),
14270                     build_address_of (soft_checkcast_node),
14271                     tree_cons (NULL_TREE, build_class_ref (cast_type),
14272                                build_tree_list (NULL_TREE, op)),
14273                     NULL_TREE);
14274     }
14275
14276   /* Any other casts are proven incorrect at compile time */
14277   t1 = xstrdup (lang_printable_name (op_type, 0));
14278   parse_error_context (wfl_op, "Invalid cast from `%s' to `%s'",
14279                        t1, lang_printable_name (cast_type, 0));
14280   free (t1);
14281   return error_mark_node;
14282 }
14283
14284 /* Build a null constant and give it the type TYPE.  */
14285
14286 static tree
14287 build_null_of_type (tree type)
14288 {
14289   tree node = build_int_2 (0, 0);
14290   TREE_TYPE (node) = promote_type (type);
14291   return node;
14292 }
14293
14294 /* Build an ARRAY_REF incomplete tree node. Note that operand 1 isn't
14295    a list of indices. */
14296 static tree
14297 build_array_ref (int location, tree array, tree index)
14298 {
14299   tree node = build (ARRAY_REF, NULL_TREE, array, index);
14300   EXPR_WFL_LINECOL (node) = location;
14301   return node;
14302 }
14303
14304 /* 15.12 Array Access Expression */
14305
14306 static tree
14307 patch_array_ref (tree node)
14308 {
14309   tree array = TREE_OPERAND (node, 0);
14310   tree array_type  = TREE_TYPE (array);
14311   tree index = TREE_OPERAND (node, 1);
14312   tree index_type = TREE_TYPE (index);
14313   int error_found = 0;
14314
14315   EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
14316
14317   if (TREE_CODE (array_type) == POINTER_TYPE)
14318     array_type = TREE_TYPE (array_type);
14319
14320   /* The array reference must be an array */
14321   if (!TYPE_ARRAY_P (array_type))
14322     {
14323       parse_error_context
14324         (wfl_operator,
14325          "`[]' can only be applied to arrays. It can't be applied to `%s'",
14326          lang_printable_name (array_type, 0));
14327       TREE_TYPE (node) = error_mark_node;
14328       error_found = 1;
14329     }
14330
14331   /* The array index undergoes unary numeric promotion. The promoted
14332      type must be int */
14333   index = do_unary_numeric_promotion (index);
14334   if (TREE_TYPE (index) != int_type_node)
14335     {
14336       if (valid_cast_to_p (index_type, int_type_node))
14337         parse_error_context (wfl_operator,
14338    "Incompatible type for `[]'. Explicit cast needed to convert `%s' to `int'",
14339                              lang_printable_name (index_type, 0));
14340       else
14341         parse_error_context (wfl_operator,
14342           "Incompatible type for `[]'. Can't convert `%s' to `int'",
14343                              lang_printable_name (index_type, 0));
14344       TREE_TYPE (node) = error_mark_node;
14345       error_found = 1;
14346     }
14347
14348   if (error_found)
14349     return error_mark_node;
14350
14351   array_type = TYPE_ARRAY_ELEMENT (array_type);
14352
14353   if (flag_emit_class_files || flag_emit_xref)
14354     {
14355       TREE_OPERAND (node, 0) = array;
14356       TREE_OPERAND (node, 1) = index;
14357     }
14358   else
14359     node = build_java_arrayaccess (array, array_type, index);
14360   TREE_TYPE (node) = array_type;
14361   return node;
14362 }
14363
14364 /* 15.9 Array Creation Expressions */
14365
14366 static tree
14367 build_newarray_node (tree type, tree dims, int extra_dims)
14368 {
14369   tree node =
14370     build (NEW_ARRAY_EXPR, NULL_TREE, type, nreverse (dims),
14371            build_int_2 (extra_dims, 0));
14372   return node;
14373 }
14374
14375 static tree
14376 patch_newarray (tree node)
14377 {
14378   tree type = TREE_OPERAND (node, 0);
14379   tree dims = TREE_OPERAND (node, 1);
14380   tree cdim, array_type;
14381   int error_found = 0;
14382   int ndims = 0;
14383   int xdims = TREE_INT_CST_LOW (TREE_OPERAND (node, 2));
14384
14385   /* Dimension types are verified. It's better for the types to be
14386      verified in order. */
14387   for (cdim = dims, ndims = 0; cdim; cdim = TREE_CHAIN (cdim), ndims++ )
14388     {
14389       int dim_error = 0;
14390       tree dim = TREE_VALUE (cdim);
14391
14392       /* Dim might have been saved during its evaluation */
14393       dim = (TREE_CODE (dim) == SAVE_EXPR ? TREE_OPERAND (dim, 0) : dim);
14394
14395       /* The type of each specified dimension must be an integral type. */
14396       if (!JINTEGRAL_TYPE_P (TREE_TYPE (dim)))
14397         dim_error = 1;
14398
14399       /* Each expression undergoes an unary numeric promotion (5.6.1) and the
14400          promoted type must be int. */
14401       else
14402         {
14403           dim = do_unary_numeric_promotion (dim);
14404           if (TREE_TYPE (dim) != int_type_node)
14405             dim_error = 1;
14406         }
14407
14408       /* Report errors on types here */
14409       if (dim_error)
14410         {
14411           parse_error_context
14412             (TREE_PURPOSE (cdim),
14413              "Incompatible type for dimension in array creation expression. %s convert `%s' to `int'",
14414              (valid_cast_to_p (TREE_TYPE (dim), int_type_node) ?
14415               "Explicit cast needed to" : "Can't"),
14416              lang_printable_name (TREE_TYPE (dim), 0));
14417           error_found = 1;
14418         }
14419
14420       TREE_PURPOSE (cdim) = NULL_TREE;
14421     }
14422
14423   /* Resolve array base type if unresolved */
14424   if (!(type = resolve_type_during_patch (type)))
14425     error_found = 1;
14426
14427   if (error_found)
14428     {
14429       /* We don't want further evaluation of this bogus array creation
14430          operation */
14431       TREE_TYPE (node) = error_mark_node;
14432       return error_mark_node;
14433     }
14434
14435   /* Set array_type to the actual (promoted) array type of the result. */
14436   if (TREE_CODE (type) == RECORD_TYPE)
14437     type = build_pointer_type (type);
14438   while (--xdims >= 0)
14439     {
14440       type = promote_type (build_java_array_type (type, -1));
14441     }
14442   dims = nreverse (dims);
14443   array_type = type;
14444   for (cdim = dims; cdim; cdim = TREE_CHAIN (cdim))
14445     {
14446       type = array_type;
14447       array_type
14448         = build_java_array_type (type,
14449                                  TREE_CODE (cdim) == INTEGER_CST
14450                                  ? (HOST_WIDE_INT) TREE_INT_CST_LOW (cdim)
14451                                  : -1);
14452       array_type = promote_type (array_type);
14453     }
14454   dims = nreverse (dims);
14455
14456   /* The node is transformed into a function call. Things are done
14457      differently according to the number of dimensions. If the number
14458      of dimension is equal to 1, then the nature of the base type
14459      (primitive or not) matters. */
14460   if (ndims == 1)
14461     return build_new_array (type, TREE_VALUE (dims));
14462
14463   /* Can't reuse what's already written in expr.c because it uses the
14464      JVM stack representation. Provide a build_multianewarray. FIXME */
14465   return build (CALL_EXPR, array_type,
14466                 build_address_of (soft_multianewarray_node),
14467                 tree_cons (NULL_TREE, build_class_ref (TREE_TYPE (array_type)),
14468                            tree_cons (NULL_TREE,
14469                                       build_int_2 (ndims, 0), dims )),
14470                 NULL_TREE);
14471 }
14472
14473 /* 10.6 Array initializer.  */
14474
14475 /* Build a wfl for array element that don't have one, so we can
14476    pin-point errors.  */
14477
14478 static tree
14479 maybe_build_array_element_wfl (tree node)
14480 {
14481   if (TREE_CODE (node) != EXPR_WITH_FILE_LOCATION)
14482     return build_expr_wfl (NULL_TREE, ctxp->filename,
14483                            ctxp->elc.line, ctxp->elc.prev_col);
14484   else
14485     return NULL_TREE;
14486 }
14487
14488 /* Build a NEW_ARRAY_INIT that features a CONSTRUCTOR node. This makes
14489    identification of initialized arrays easier to detect during walk
14490    and expansion.  */
14491
14492 static tree
14493 build_new_array_init (int location, tree values)
14494 {
14495   tree constructor = build_constructor (NULL_TREE, values);
14496   tree to_return = build1 (NEW_ARRAY_INIT, NULL_TREE, constructor);
14497   EXPR_WFL_LINECOL (to_return) = location;
14498   return to_return;
14499 }
14500
14501 /* Expand a NEW_ARRAY_INIT node. Return error_mark_node if an error
14502    occurred.  Otherwise return NODE after having set its type
14503    appropriately.  */
14504
14505 static tree
14506 patch_new_array_init (tree type, tree node)
14507 {
14508   int error_seen = 0;
14509   tree current, element_type;
14510   HOST_WIDE_INT length;
14511   int all_constant = 1;
14512   tree init = TREE_OPERAND (node, 0);
14513
14514   if (TREE_CODE (type) != POINTER_TYPE || ! TYPE_ARRAY_P (TREE_TYPE (type)))
14515     {
14516       parse_error_context (node,
14517                            "Invalid array initializer for non-array type `%s'",
14518                            lang_printable_name (type, 1));
14519       return error_mark_node;
14520     }
14521   type = TREE_TYPE (type);
14522   element_type = TYPE_ARRAY_ELEMENT (type);
14523
14524   CONSTRUCTOR_ELTS (init) = nreverse (CONSTRUCTOR_ELTS (init));
14525
14526   for (length = 0, current = CONSTRUCTOR_ELTS (init);
14527        current;  length++, current = TREE_CHAIN (current))
14528     {
14529       tree elt = TREE_VALUE (current);
14530       if (elt == NULL_TREE || TREE_CODE (elt) != NEW_ARRAY_INIT)
14531         {
14532           error_seen |= array_constructor_check_entry (element_type, current);
14533           elt = TREE_VALUE (current);
14534           /* When compiling to native code, STRING_CST is converted to
14535              INDIRECT_REF, but still with a TREE_CONSTANT flag. */
14536           if (! TREE_CONSTANT (elt) || TREE_CODE (elt) == INDIRECT_REF)
14537             all_constant = 0;
14538         }
14539       else
14540         {
14541           TREE_VALUE (current) = patch_new_array_init (element_type, elt);
14542           TREE_PURPOSE (current) = NULL_TREE;
14543           all_constant = 0;
14544         }
14545       if (elt && TREE_CODE (elt) == TREE_LIST
14546           && TREE_VALUE (elt) == error_mark_node)
14547         error_seen = 1;
14548     }
14549
14550   if (error_seen)
14551     return error_mark_node;
14552
14553   /* Create a new type. We can't reuse the one we have here by
14554      patching its dimension because it originally is of dimension -1
14555      hence reused by gcc. This would prevent triangular arrays. */
14556   type = build_java_array_type (element_type, length);
14557   TREE_TYPE (init) = TREE_TYPE (TREE_CHAIN (TREE_CHAIN (TYPE_FIELDS (type))));
14558   TREE_TYPE (node) = promote_type (type);
14559   TREE_CONSTANT (init) = all_constant;
14560   TREE_CONSTANT (node) = all_constant;
14561   return node;
14562 }
14563
14564 /* Verify that one entry of the initializer element list can be
14565    assigned to the array base type. Report 1 if an error occurred, 0
14566    otherwise.  */
14567
14568 static int
14569 array_constructor_check_entry (tree type, tree entry)
14570 {
14571   char *array_type_string = NULL;       /* For error reports */
14572   tree value, type_value, new_value, wfl_value, patched;
14573   int error_seen = 0;
14574
14575   new_value = NULL_TREE;
14576   wfl_value = TREE_VALUE (entry);
14577
14578   value = java_complete_tree (TREE_VALUE (entry));
14579   /* patch_string return error_mark_node if arg is error_mark_node */
14580   if ((patched = patch_string (value)))
14581     value = patched;
14582   if (value == error_mark_node)
14583     return 1;
14584
14585   type_value = TREE_TYPE (value);
14586
14587   /* At anytime, try_builtin_assignconv can report a warning on
14588      constant overflow during narrowing. */
14589   SET_WFL_OPERATOR (wfl_operator, TREE_PURPOSE (entry), wfl_value);
14590   new_value = try_builtin_assignconv (wfl_operator, type, value);
14591   if (!new_value && (new_value = try_reference_assignconv (type, value)))
14592     type_value = promote_type (type);
14593
14594   /* Check and report errors */
14595   if (!new_value)
14596     {
14597       const char *const msg = (!valid_cast_to_p (type_value, type) ?
14598                    "Can't" : "Explicit cast needed to");
14599       if (!array_type_string)
14600         array_type_string = xstrdup (lang_printable_name (type, 1));
14601       parse_error_context
14602         (wfl_operator, "Incompatible type for array. %s convert `%s' to `%s'",
14603          msg, lang_printable_name (type_value, 1), array_type_string);
14604       error_seen = 1;
14605     }
14606
14607   if (new_value)
14608     TREE_VALUE (entry) = new_value;
14609
14610   if (array_type_string)
14611     free (array_type_string);
14612
14613   TREE_PURPOSE (entry) = NULL_TREE;
14614   return error_seen;
14615 }
14616
14617 static tree
14618 build_this (int location)
14619 {
14620   tree node = build_wfl_node (this_identifier_node);
14621   TREE_SET_CODE (node, THIS_EXPR);
14622   EXPR_WFL_LINECOL (node) = location;
14623   return node;
14624 }
14625
14626 /* 14.15 The return statement. It builds a modify expression that
14627    assigns the returned value to the RESULT_DECL that hold the value
14628    to be returned. */
14629
14630 static tree
14631 build_return (int location, tree op)
14632 {
14633   tree node = build1 (RETURN_EXPR, NULL_TREE, op);
14634   EXPR_WFL_LINECOL (node) = location;
14635   node = build_debugable_stmt (location, node);
14636   return node;
14637 }
14638
14639 static tree
14640 patch_return (tree node)
14641 {
14642   tree return_exp = TREE_OPERAND (node, 0);
14643   tree meth = current_function_decl;
14644   tree mtype = TREE_TYPE (TREE_TYPE (current_function_decl));
14645   int error_found = 0;
14646
14647   TREE_TYPE (node) = error_mark_node;
14648   EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
14649
14650   /* It's invalid to have a return value within a function that is
14651      declared with the keyword void or that is a constructor */
14652   if (return_exp && (mtype == void_type_node || DECL_CONSTRUCTOR_P (meth)))
14653     error_found = 1;
14654
14655   /* It's invalid to use a return statement in a static block */
14656   if (DECL_CLINIT_P (current_function_decl))
14657     error_found = 1;
14658
14659   /* It's invalid to have a no return value within a function that
14660      isn't declared with the keyword `void' */
14661   if (!return_exp && (mtype != void_type_node && !DECL_CONSTRUCTOR_P (meth)))
14662     error_found = 2;
14663
14664   if (DECL_INSTINIT_P (current_function_decl))
14665     error_found = 1;
14666
14667   if (error_found)
14668     {
14669       if (DECL_INSTINIT_P (current_function_decl))
14670         parse_error_context (wfl_operator,
14671                              "`return' inside instance initializer");
14672
14673       else if (DECL_CLINIT_P (current_function_decl))
14674         parse_error_context (wfl_operator,
14675                              "`return' inside static initializer");
14676
14677       else if (!DECL_CONSTRUCTOR_P (meth))
14678         {
14679           char *t = xstrdup (lang_printable_name (mtype, 0));
14680           parse_error_context (wfl_operator,
14681                                "`return' with%s value from `%s %s'",
14682                                (error_found == 1 ? "" : "out"),
14683                                t, lang_printable_name (meth, 0));
14684           free (t);
14685         }
14686       else
14687         parse_error_context (wfl_operator,
14688                              "`return' with value from constructor `%s'",
14689                              lang_printable_name (meth, 0));
14690       return error_mark_node;
14691     }
14692
14693   /* If we have a return_exp, build a modify expression and expand
14694      it. Note: at that point, the assignment is declared valid, but we
14695      may want to carry some more hacks */
14696   if (return_exp)
14697     {
14698       tree exp = java_complete_tree (return_exp);
14699       tree modify, patched;
14700
14701       if ((patched = patch_string (exp)))
14702         exp = patched;
14703
14704       modify = build (MODIFY_EXPR, NULL_TREE, DECL_RESULT (meth), exp);
14705       EXPR_WFL_LINECOL (modify) = EXPR_WFL_LINECOL (node);
14706       modify = java_complete_tree (modify);
14707
14708       if (modify != error_mark_node)
14709         {
14710           TREE_SIDE_EFFECTS (modify) = 1;
14711           TREE_OPERAND (node, 0) = modify;
14712         }
14713       else
14714         return error_mark_node;
14715     }
14716   TREE_TYPE (node) = void_type_node;
14717   TREE_SIDE_EFFECTS (node) = 1;
14718   return node;
14719 }
14720
14721 /* 14.8 The if Statement */
14722
14723 static tree
14724 build_if_else_statement (int location, tree expression, tree if_body,
14725                          tree else_body)
14726 {
14727   tree node;
14728   if (!else_body)
14729     else_body = empty_stmt_node;
14730   node = build (COND_EXPR, NULL_TREE, expression, if_body, else_body);
14731   EXPR_WFL_LINECOL (node) = location;
14732   node = build_debugable_stmt (location, node);
14733   return node;
14734 }
14735
14736 static tree
14737 patch_if_else_statement (tree node)
14738 {
14739   tree expression = TREE_OPERAND (node, 0);
14740   int can_complete_normally
14741     = (CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 1))
14742        | CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 2)));
14743
14744   TREE_TYPE (node) = error_mark_node;
14745   EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
14746
14747   /* The type of expression must be boolean */
14748   if (TREE_TYPE (expression) != boolean_type_node
14749       && TREE_TYPE (expression) != promoted_boolean_type_node)
14750     {
14751       parse_error_context
14752         (wfl_operator,
14753          "Incompatible type for `if'. Can't convert `%s' to `boolean'",
14754          lang_printable_name (TREE_TYPE (expression), 0));
14755       return error_mark_node;
14756     }
14757
14758   if (TREE_CODE (expression) == INTEGER_CST)
14759     {
14760       if (integer_zerop (expression))
14761         node = TREE_OPERAND (node, 2);
14762       else
14763         node = TREE_OPERAND (node, 1);
14764       if (CAN_COMPLETE_NORMALLY (node) != can_complete_normally)
14765         {
14766           node = build (COMPOUND_EXPR, void_type_node, node, empty_stmt_node);
14767           CAN_COMPLETE_NORMALLY (node) = can_complete_normally;
14768         }
14769       return node;
14770     }
14771   TREE_TYPE (node) = void_type_node;
14772   TREE_SIDE_EFFECTS (node) = 1;
14773   CAN_COMPLETE_NORMALLY (node) = can_complete_normally;
14774   return node;
14775 }
14776
14777 /* 14.6 Labeled Statements */
14778
14779 /* Action taken when a lableled statement is parsed. a new
14780    LABELED_BLOCK_EXPR is created. No statement is attached to the
14781    label, yet.  LABEL can be NULL_TREE for artificially-generated blocks. */
14782
14783 static tree
14784 build_labeled_block (int location, tree label)
14785 {
14786   tree label_name ;
14787   tree label_decl, node;
14788   if (label == NULL_TREE || label == continue_identifier_node)
14789     label_name = label;
14790   else
14791     {
14792       label_name = merge_qualified_name (label_id, label);
14793       /* Issue an error if we try to reuse a label that was previously
14794          declared */
14795       if (IDENTIFIER_LOCAL_VALUE (label_name))
14796         {
14797           EXPR_WFL_LINECOL (wfl_operator) = location;
14798           parse_error_context (wfl_operator,
14799             "Declaration of `%s' shadows a previous label declaration",
14800                                IDENTIFIER_POINTER (label));
14801           EXPR_WFL_LINECOL (wfl_operator) =
14802             EXPR_WFL_LINECOL (IDENTIFIER_LOCAL_VALUE (label_name));
14803           parse_error_context (wfl_operator,
14804             "This is the location of the previous declaration of label `%s'",
14805                                IDENTIFIER_POINTER (label));
14806           java_error_count--;
14807         }
14808     }
14809
14810   label_decl = create_label_decl (label_name);
14811   node = build (LABELED_BLOCK_EXPR, NULL_TREE, label_decl, NULL_TREE);
14812   EXPR_WFL_LINECOL (node) = location;
14813   TREE_SIDE_EFFECTS (node) = 1;
14814   return node;
14815 }
14816
14817 /* A labeled statement LBE is attached a statement.  */
14818
14819 static tree
14820 finish_labeled_statement (tree lbe, /* Labeled block expr */
14821                           tree statement)
14822 {
14823   /* In anyways, tie the loop to its statement */
14824   LABELED_BLOCK_BODY (lbe) = statement;
14825   pop_labeled_block ();
14826   POP_LABELED_BLOCK ();
14827   return lbe;
14828 }
14829
14830 /* 14.10, 14.11, 14.12 Loop Statements */
14831
14832 /* Create an empty LOOP_EXPR and make it the last in the nested loop
14833    list. */
14834
14835 static tree
14836 build_new_loop (tree loop_body)
14837 {
14838   tree loop =  build (LOOP_EXPR, NULL_TREE, loop_body);
14839   TREE_SIDE_EFFECTS (loop) = 1;
14840   PUSH_LOOP (loop);
14841   return loop;
14842 }
14843
14844 /* Create a loop body according to the following structure:
14845      COMPOUND_EXPR
14846        COMPOUND_EXPR            (loop main body)
14847          EXIT_EXPR              (this order is for while/for loops.
14848          LABELED_BLOCK_EXPR      the order is reversed for do loops)
14849            LABEL_DECL           (a continue occurring here branches at the
14850            BODY                  end of this labeled block)
14851        INCREMENT                (if any)
14852
14853   REVERSED, if nonzero, tells that the loop condition expr comes
14854   after the body, like in the do-while loop.
14855
14856   To obtain a loop, the loop body structure described above is
14857   encapsulated within a LOOP_EXPR surrounded by a LABELED_BLOCK_EXPR:
14858
14859    LABELED_BLOCK_EXPR
14860      LABEL_DECL                   (use this label to exit the loop)
14861      LOOP_EXPR
14862        <structure described above> */
14863
14864 static tree
14865 build_loop_body (int location, tree condition, int reversed)
14866 {
14867   tree first, second, body;
14868
14869   condition = build (EXIT_EXPR, NULL_TREE, condition); /* Force walk */
14870   EXPR_WFL_LINECOL (condition) = location; /* For accurate error report */
14871   condition = build_debugable_stmt (location, condition);
14872   TREE_SIDE_EFFECTS (condition) = 1;
14873
14874   body = build_labeled_block (0, continue_identifier_node);
14875   first = (reversed ? body : condition);
14876   second = (reversed ? condition : body);
14877   return
14878     build (COMPOUND_EXPR, NULL_TREE,
14879            build (COMPOUND_EXPR, NULL_TREE, first, second), empty_stmt_node);
14880 }
14881
14882 /* Install CONDITION (if any) and loop BODY (using REVERSED to tell
14883    their order) on the current loop. Unlink the current loop from the
14884    loop list.  */
14885
14886 static tree
14887 finish_loop_body (int location, tree condition, tree body, int reversed)
14888 {
14889   tree to_return = ctxp->current_loop;
14890   tree loop_body = LOOP_EXPR_BODY (to_return);
14891   if (condition)
14892     {
14893       tree cnode = LOOP_EXPR_BODY_CONDITION_EXPR (loop_body, reversed);
14894       /* We wrapped the EXIT_EXPR around a WFL so we can debug it.
14895          The real EXIT_EXPR is one operand further. */
14896       EXPR_WFL_LINECOL (cnode) = location;
14897       /* This one is for accurate error reports */
14898       EXPR_WFL_LINECOL (TREE_OPERAND (cnode, 0)) = location;
14899       TREE_OPERAND (TREE_OPERAND (cnode, 0), 0) = condition;
14900     }
14901   LOOP_EXPR_BODY_BODY_EXPR (loop_body, reversed) = body;
14902   POP_LOOP ();
14903   return to_return;
14904 }
14905
14906 /* Tailored version of finish_loop_body for FOR loops, when FOR
14907    loops feature the condition part */
14908
14909 static tree
14910 finish_for_loop (int location, tree condition, tree update, tree body)
14911 {
14912   /* Put the condition and the loop body in place */
14913   tree loop = finish_loop_body (location, condition, body, 0);
14914   /* LOOP is the current loop which has been now popped of the loop
14915      stack.  Mark the update block as reachable and install it.  We do
14916      this because the (current interpretation of the) JLS requires
14917      that the update expression be considered reachable even if the
14918      for loop's body doesn't complete normally.  */
14919   if (update != NULL_TREE && update != empty_stmt_node)
14920     {
14921       tree up2 = update;
14922       if (TREE_CODE (up2) == EXPR_WITH_FILE_LOCATION)
14923         up2 = EXPR_WFL_NODE (up2);
14924       /* It is possible for the update expression to be an
14925          EXPR_WFL_NODE wrapping nothing.  */
14926       if (up2 != NULL_TREE && up2 != empty_stmt_node)
14927         {
14928           /* Try to detect constraint violations.  These would be
14929              programming errors somewhere.  */
14930           if (! IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (up2)))
14931               || TREE_CODE (up2) == LOOP_EXPR)
14932             abort ();
14933           SUPPRESS_UNREACHABLE_ERROR (up2) = 1;
14934         }
14935     }
14936   LOOP_EXPR_BODY_UPDATE_BLOCK (LOOP_EXPR_BODY (loop)) = update;
14937   return loop;
14938 }
14939
14940 /* Try to find the loop a block might be related to. This comprises
14941    the case where the LOOP_EXPR is found as the second operand of a
14942    COMPOUND_EXPR, because the loop happens to have an initialization
14943    part, then expressed as the first operand of the COMPOUND_EXPR. If
14944    the search finds something, 1 is returned. Otherwise, 0 is
14945    returned. The search is assumed to start from a
14946    LABELED_BLOCK_EXPR's block.  */
14947
14948 static tree
14949 search_loop (tree statement)
14950 {
14951   if (TREE_CODE (statement) == LOOP_EXPR)
14952     return statement;
14953
14954   if (TREE_CODE (statement) == BLOCK)
14955     statement = BLOCK_SUBBLOCKS (statement);
14956   else
14957     return NULL_TREE;
14958
14959   if (statement && TREE_CODE (statement) == COMPOUND_EXPR)
14960     while (statement && TREE_CODE (statement) == COMPOUND_EXPR)
14961       statement = TREE_OPERAND (statement, 1);
14962
14963   return (TREE_CODE (statement) == LOOP_EXPR
14964           && FOR_LOOP_P (statement) ? statement : NULL_TREE);
14965 }
14966
14967 /* Return 1 if LOOP can be found in the labeled block BLOCK. 0 is
14968    returned otherwise.  */
14969
14970 static int
14971 labeled_block_contains_loop_p (tree block, tree loop)
14972 {
14973   if (!block)
14974     return 0;
14975
14976   if (LABELED_BLOCK_BODY (block) == loop)
14977     return 1;
14978
14979   if (FOR_LOOP_P (loop) && search_loop (LABELED_BLOCK_BODY (block)) == loop)
14980     return 1;
14981
14982   return 0;
14983 }
14984
14985 /* If the loop isn't surrounded by a labeled statement, create one and
14986    insert LOOP as its body.  */
14987
14988 static tree
14989 patch_loop_statement (tree loop)
14990 {
14991   tree loop_label;
14992
14993   TREE_TYPE (loop) = void_type_node;
14994   if (labeled_block_contains_loop_p (ctxp->current_labeled_block, loop))
14995     return loop;
14996
14997   loop_label = build_labeled_block (0, NULL_TREE);
14998   /* LOOP is an EXPR node, so it should have a valid EXPR_WFL_LINECOL
14999      that LOOP_LABEL could enquire about, for a better accuracy. FIXME */
15000   LABELED_BLOCK_BODY (loop_label) = loop;
15001   PUSH_LABELED_BLOCK (loop_label);
15002   return loop_label;
15003 }
15004
15005 /* 14.13, 14.14: break and continue Statements */
15006
15007 /* Build a break or a continue statement. a null NAME indicates an
15008    unlabeled break/continue statement.  */
15009
15010 static tree
15011 build_bc_statement (int location, int is_break, tree name)
15012 {
15013   tree break_continue, label_block_expr = NULL_TREE;
15014
15015   if (name)
15016     {
15017       if (!(label_block_expr = IDENTIFIER_LOCAL_VALUE
15018             (merge_qualified_name (label_id, EXPR_WFL_NODE (name)))))
15019         /* Null means that we don't have a target for this named
15020            break/continue. In this case, we make the target to be the
15021            label name, so that the error can be reported accuratly in
15022            patch_bc_statement. */
15023         label_block_expr = EXPR_WFL_NODE (name);
15024     }
15025   /* Unlabeled break/continue will be handled during the
15026      break/continue patch operation */
15027   break_continue
15028     = build (EXIT_BLOCK_EXPR, NULL_TREE, label_block_expr, NULL_TREE);
15029
15030   IS_BREAK_STMT_P (break_continue) = is_break;
15031   TREE_SIDE_EFFECTS (break_continue) = 1;
15032   EXPR_WFL_LINECOL (break_continue) = location;
15033   break_continue = build_debugable_stmt (location, break_continue);
15034   return break_continue;
15035 }
15036
15037 /* Verification of a break/continue statement. */
15038
15039 static tree
15040 patch_bc_statement (tree node)
15041 {
15042   tree bc_label = EXIT_BLOCK_LABELED_BLOCK (node), target_stmt;
15043   tree labeled_block = ctxp->current_labeled_block;
15044   EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
15045
15046   /* Having an identifier here means that the target is unknown. */
15047   if (bc_label != NULL_TREE && TREE_CODE (bc_label) == IDENTIFIER_NODE)
15048     {
15049       parse_error_context (wfl_operator, "No label definition found for `%s'",
15050                            IDENTIFIER_POINTER (bc_label));
15051       return error_mark_node;
15052     }
15053   if (! IS_BREAK_STMT_P (node))
15054     {
15055       /* It's a continue statement. */
15056       for (;; labeled_block = TREE_CHAIN (labeled_block))
15057         {
15058           if (labeled_block == NULL_TREE)
15059             {
15060               if (bc_label == NULL_TREE)
15061                 parse_error_context (wfl_operator,
15062                                      "`continue' must be in loop");
15063               else
15064                 parse_error_context
15065                   (wfl_operator, "continue label `%s' does not name a loop",
15066                    IDENTIFIER_POINTER (bc_label));
15067               return error_mark_node;
15068             }
15069           if ((DECL_NAME (LABELED_BLOCK_LABEL (labeled_block))
15070                == continue_identifier_node)
15071               && (bc_label == NULL_TREE
15072                   || TREE_CHAIN (labeled_block) == bc_label))
15073             {
15074               bc_label = labeled_block;
15075               break;
15076             }
15077         }
15078     }
15079   else if (!bc_label)
15080     {
15081       for (;; labeled_block = TREE_CHAIN (labeled_block))
15082         {
15083           if (labeled_block == NULL_TREE)
15084             {
15085               parse_error_context (wfl_operator,
15086                                      "`break' must be in loop or switch");
15087               return error_mark_node;
15088             }
15089           target_stmt = LABELED_BLOCK_BODY (labeled_block);
15090           if (TREE_CODE (target_stmt) == SWITCH_EXPR
15091               || search_loop (target_stmt))
15092             {
15093               bc_label = labeled_block;
15094               break;
15095             }
15096         }
15097     }
15098
15099   EXIT_BLOCK_LABELED_BLOCK (node) = bc_label;
15100   CAN_COMPLETE_NORMALLY (bc_label) = 1;
15101
15102   /* Our break/continue don't return values. */
15103   TREE_TYPE (node) = void_type_node;
15104   /* Encapsulate the break within a compound statement so that it's
15105      expanded all the times by expand_expr (and not clobbered
15106      sometimes, like after a if statement) */
15107   node = add_stmt_to_compound (NULL_TREE, void_type_node, node);
15108   TREE_SIDE_EFFECTS (node) = 1;
15109   return node;
15110 }
15111
15112 /* Process the exit expression belonging to a loop. Its type must be
15113    boolean.  */
15114
15115 static tree
15116 patch_exit_expr (tree node)
15117 {
15118   tree expression = TREE_OPERAND (node, 0);
15119   TREE_TYPE (node) = error_mark_node;
15120   EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
15121
15122   /* The type of expression must be boolean */
15123   if (TREE_TYPE (expression) != boolean_type_node)
15124     {
15125       parse_error_context
15126         (wfl_operator,
15127     "Incompatible type for loop conditional. Can't convert `%s' to `boolean'",
15128          lang_printable_name (TREE_TYPE (expression), 0));
15129       return error_mark_node;
15130     }
15131   /* Now we know things are allright, invert the condition, fold and
15132      return */
15133   TREE_OPERAND (node, 0) =
15134     fold (build1 (TRUTH_NOT_EXPR, boolean_type_node, expression));
15135
15136   if (! integer_zerop (TREE_OPERAND (node, 0))
15137       && ctxp->current_loop != NULL_TREE
15138       && TREE_CODE (ctxp->current_loop) == LOOP_EXPR)
15139     CAN_COMPLETE_NORMALLY (ctxp->current_loop) = 1;
15140   if (! integer_onep (TREE_OPERAND (node, 0)))
15141     CAN_COMPLETE_NORMALLY (node) = 1;
15142
15143
15144   TREE_TYPE (node) = void_type_node;
15145   return node;
15146 }
15147
15148 /* 14.9 Switch statement */
15149
15150 static tree
15151 patch_switch_statement (tree node)
15152 {
15153   tree se = TREE_OPERAND (node, 0), se_type;
15154   tree save, iter;
15155
15156   /* Complete the switch expression */
15157   se = TREE_OPERAND (node, 0) = java_complete_tree (se);
15158   se_type = TREE_TYPE (se);
15159   /* The type of the switch expression must be char, byte, short or
15160      int */
15161   if (! JINTEGRAL_TYPE_P (se_type) || se_type == long_type_node)
15162     {
15163       EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
15164       parse_error_context (wfl_operator,
15165           "Incompatible type for `switch'. Can't convert `%s' to `int'",
15166                            lang_printable_name (se_type, 0));
15167       /* This is what java_complete_tree will check */
15168       TREE_OPERAND (node, 0) = error_mark_node;
15169       return error_mark_node;
15170     }
15171
15172   /* Save and restore the outer case label list.  */
15173   save = case_label_list;
15174   case_label_list = NULL_TREE;
15175
15176   TREE_OPERAND (node, 1) = java_complete_tree (TREE_OPERAND (node, 1));
15177
15178   /* See if we've found a duplicate label.  We can't leave this until
15179      code generation, because in `--syntax-only' and `-C' modes we
15180      don't do ordinary code generation.  */
15181   for (iter = case_label_list; iter != NULL_TREE; iter = TREE_CHAIN (iter))
15182     {
15183       HOST_WIDE_INT val = TREE_INT_CST_LOW (TREE_VALUE (iter));
15184       tree subiter;
15185       for (subiter = TREE_CHAIN (iter);
15186            subiter != NULL_TREE;
15187            subiter = TREE_CHAIN (subiter))
15188         {
15189           HOST_WIDE_INT subval = TREE_INT_CST_LOW (TREE_VALUE (subiter));
15190           if (val == subval)
15191             {
15192               EXPR_WFL_LINECOL (wfl_operator)
15193                 = EXPR_WFL_LINECOL (TREE_PURPOSE (iter));
15194               /* The case_label_list is in reverse order, so print the
15195                  outer label first.  */
15196               parse_error_context (wfl_operator, "duplicate case label: `"
15197                                    HOST_WIDE_INT_PRINT_DEC "'", subval);
15198               EXPR_WFL_LINECOL (wfl_operator)
15199                 = EXPR_WFL_LINECOL (TREE_PURPOSE (subiter));
15200               parse_error_context (wfl_operator, "original label is here");
15201
15202               break;
15203             }
15204         }
15205     }
15206
15207   case_label_list = save;
15208
15209   /* Ready to return */
15210   if (TREE_CODE (TREE_OPERAND (node, 1)) == ERROR_MARK)
15211     {
15212       TREE_TYPE (node) = error_mark_node;
15213       return error_mark_node;
15214     }
15215   TREE_TYPE (node) = void_type_node;
15216   TREE_SIDE_EFFECTS (node) = 1;
15217   CAN_COMPLETE_NORMALLY (node)
15218     = CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 1))
15219       || ! SWITCH_HAS_DEFAULT (node);
15220   return node;
15221 }
15222
15223 /* Assertions.  */
15224
15225 /* Build an assertion expression for `assert CONDITION : VALUE'; VALUE
15226    might be NULL_TREE.  */
15227 static tree
15228 build_assertion (int location, tree condition, tree value)
15229 {
15230   tree node;
15231   tree klass = GET_CPC ();
15232
15233   if (! CLASS_USES_ASSERTIONS (klass))
15234     {
15235       tree field, classdollar, id, call;
15236       tree class_type = TREE_TYPE (klass);
15237
15238       field = add_field (class_type,
15239                          get_identifier ("$assertionsDisabled"),
15240                          boolean_type_node,
15241                          ACC_PRIVATE | ACC_STATIC | ACC_FINAL);
15242       MAYBE_CREATE_VAR_LANG_DECL_SPECIFIC (field);
15243       FIELD_SYNTHETIC (field) = 1;
15244
15245       if (!TYPE_DOT_CLASS (class_type))
15246         build_dot_class_method (class_type);
15247       classdollar = build_dot_class_method_invocation (class_type);
15248
15249       /* Call CLASS.desiredAssertionStatus().  */
15250       id = build_wfl_node (get_identifier ("desiredAssertionStatus"));
15251       call = build (CALL_EXPR, NULL_TREE, id, NULL_TREE, NULL_TREE);
15252       call = make_qualified_primary (classdollar, call, location);
15253       TREE_SIDE_EFFECTS (call) = 1;
15254
15255       /* Invert to obtain !CLASS.desiredAssertionStatus().  This may
15256          seem odd, but we do it to generate code identical to that of
15257          the JDK.  */
15258       call = build1 (TRUTH_NOT_EXPR, NULL_TREE, call);
15259       TREE_SIDE_EFFECTS (call) = 1;
15260       DECL_INITIAL (field) = call;
15261
15262       /* Record the initializer in the initializer statement list.  */
15263       call = build (MODIFY_EXPR, NULL_TREE, field, call);
15264       TREE_CHAIN (call) = CPC_STATIC_INITIALIZER_STMT (ctxp);
15265       SET_CPC_STATIC_INITIALIZER_STMT (ctxp, call);
15266       MODIFY_EXPR_FROM_INITIALIZATION_P (call) = 1;
15267
15268       CLASS_USES_ASSERTIONS (klass) = 1;
15269     }
15270
15271   if (value != NULL_TREE)
15272     value = tree_cons (NULL_TREE, value, NULL_TREE);
15273
15274   node = build_wfl_node (get_identifier ("java"));
15275   node = make_qualified_name (node, build_wfl_node (get_identifier ("lang")),
15276                               location);
15277   node = make_qualified_name (node, build_wfl_node (get_identifier ("AssertionError")),
15278                               location);
15279
15280   node = build (NEW_CLASS_EXPR, NULL_TREE, node, value, NULL_TREE);
15281   TREE_SIDE_EFFECTS (node) = 1;
15282   /* It is too early to use BUILD_THROW.  */
15283   node = build1 (THROW_EXPR, NULL_TREE, node);
15284   TREE_SIDE_EFFECTS (node) = 1;
15285
15286   /* We invert the condition; if we just put NODE as the `else' part
15287      then we generate weird-looking bytecode.  */
15288   condition = build1 (TRUTH_NOT_EXPR, NULL_TREE, condition);
15289   /* Check $assertionsDisabled.  */
15290   condition
15291     = build (TRUTH_ANDIF_EXPR, NULL_TREE,
15292              build1 (TRUTH_NOT_EXPR, NULL_TREE,
15293                      build_wfl_node (get_identifier ("$assertionsDisabled"))),
15294              condition);
15295   node = build_if_else_statement (location, condition, node, NULL_TREE);
15296   return node;
15297 }
15298
15299 /* 14.18 The try/catch statements */
15300
15301 /* Encapsulate TRY_STMTS' in a try catch sequence. The catch clause
15302    catches TYPE and executes CATCH_STMTS.  */
15303
15304 static tree
15305 encapsulate_with_try_catch (int location, tree type, tree try_stmts,
15306                             tree catch_stmts)
15307 {
15308   tree try_block, catch_clause_param, catch_block, catch;
15309
15310   /* First build a try block */
15311   try_block = build_expr_block (try_stmts, NULL_TREE);
15312
15313   /* Build a catch block: we need a catch clause parameter */
15314   catch_clause_param = build_decl (VAR_DECL,
15315                                    wpv_id, build_pointer_type (type));
15316   /* And a block */
15317   catch_block = build_expr_block (NULL_TREE, catch_clause_param);
15318
15319   /* Initialize the variable and store in the block */
15320   catch = build (MODIFY_EXPR, NULL_TREE, catch_clause_param,
15321                  build (JAVA_EXC_OBJ_EXPR, ptr_type_node));
15322   add_stmt_to_block (catch_block, NULL_TREE, catch);
15323
15324   /* Add the catch statements */
15325   add_stmt_to_block (catch_block, NULL_TREE, catch_stmts);
15326
15327   /* Now we can build a CATCH_EXPR */
15328   catch_block = build1 (CATCH_EXPR, NULL_TREE, catch_block);
15329
15330   return build_try_statement (location, try_block, catch_block);
15331 }
15332
15333 static tree
15334 build_try_statement (int location, tree try_block, tree catches)
15335 {
15336   tree node = build (TRY_EXPR, NULL_TREE, try_block, catches);
15337   EXPR_WFL_LINECOL (node) = location;
15338   return node;
15339 }
15340
15341 static tree
15342 build_try_finally_statement (int location, tree try_block, tree finally)
15343 {
15344   tree node = build (TRY_FINALLY_EXPR, NULL_TREE, try_block, finally);
15345   EXPR_WFL_LINECOL (node) = location;
15346   return node;
15347 }
15348
15349 static tree
15350 patch_try_statement (tree node)
15351 {
15352   int error_found = 0;
15353   tree try = TREE_OPERAND (node, 0);
15354   /* Exception handlers are considered in left to right order */
15355   tree catch = nreverse (TREE_OPERAND (node, 1));
15356   tree current, caught_type_list = NULL_TREE;
15357
15358   /* Check catch clauses, if any. Every time we find an error, we try
15359      to process the next catch clause. We process the catch clause before
15360      the try block so that when processing the try block we can check thrown
15361      exceptions againts the caught type list. */
15362   for (current = catch; current; current = TREE_CHAIN (current))
15363     {
15364       tree carg_decl, carg_type;
15365       tree sub_current, catch_block, catch_clause;
15366       int unreachable;
15367
15368       /* At this point, the structure of the catch clause is
15369            CATCH_EXPR           (catch node)
15370              BLOCK              (with the decl of the parameter)
15371                COMPOUND_EXPR
15372                  MODIFY_EXPR   (assignment of the catch parameter)
15373                  BLOCK          (catch clause block)
15374        */
15375       catch_clause = TREE_OPERAND (current, 0);
15376       carg_decl = BLOCK_EXPR_DECLS (catch_clause);
15377       carg_type = TREE_TYPE (TREE_TYPE (carg_decl));
15378
15379       /* Catch clauses can't have more than one parameter declared,
15380          but it's already enforced by the grammar. Make sure that the
15381          only parameter of the clause statement in of class Throwable
15382          or a subclass of Throwable, but that was done earlier. The
15383          catch clause parameter type has also been resolved. */
15384
15385       /* Just make sure that the catch clause parameter type inherits
15386          from java.lang.Throwable */
15387       if (!inherits_from_p (carg_type, throwable_type_node))
15388         {
15389           EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (current);
15390           parse_error_context (wfl_operator,
15391                                "Can't catch class `%s'. Catch clause parameter type must be a subclass of class `java.lang.Throwable'",
15392                                lang_printable_name (carg_type, 0));
15393           error_found = 1;
15394           continue;
15395         }
15396
15397       /* Partial check for unreachable catch statement: The catch
15398          clause is reachable iff is no earlier catch block A in
15399          the try statement such that the type of the catch
15400          clause's parameter is the same as or a subclass of the
15401          type of A's parameter */
15402       unreachable = 0;
15403       for (sub_current = catch;
15404            sub_current != current; sub_current = TREE_CHAIN (sub_current))
15405         {
15406           tree sub_catch_clause, decl;
15407           sub_catch_clause = TREE_OPERAND (sub_current, 0);
15408           decl = BLOCK_EXPR_DECLS (sub_catch_clause);
15409
15410           if (inherits_from_p (carg_type, TREE_TYPE (TREE_TYPE (decl))))
15411             {
15412               EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (current);
15413               parse_error_context
15414                 (wfl_operator,
15415                  "`catch' not reached because of the catch clause at line %d",
15416                  EXPR_WFL_LINENO (sub_current));
15417               unreachable = error_found = 1;
15418               break;
15419             }
15420         }
15421       /* Complete the catch clause block */
15422       catch_block = java_complete_tree (TREE_OPERAND (current, 0));
15423       if (catch_block == error_mark_node)
15424         {
15425           error_found = 1;
15426           continue;
15427         }
15428       if (CAN_COMPLETE_NORMALLY (catch_block))
15429         CAN_COMPLETE_NORMALLY (node) = 1;
15430       TREE_OPERAND (current, 0) = catch_block;
15431
15432       if (unreachable)
15433         continue;
15434
15435       /* Things to do here: the exception must be thrown */
15436
15437       /* Link this type to the caught type list */
15438       caught_type_list = tree_cons (NULL_TREE, carg_type, caught_type_list);
15439     }
15440
15441   PUSH_EXCEPTIONS (caught_type_list);
15442   if ((try = java_complete_tree (try)) == error_mark_node)
15443     error_found = 1;
15444   if (CAN_COMPLETE_NORMALLY (try))
15445     CAN_COMPLETE_NORMALLY (node) = 1;
15446   POP_EXCEPTIONS ();
15447
15448   /* Verification ends here */
15449   if (error_found)
15450     return error_mark_node;
15451
15452   TREE_OPERAND (node, 0) = try;
15453   TREE_OPERAND (node, 1) = catch;
15454   TREE_TYPE (node) = void_type_node;
15455   return node;
15456 }
15457
15458 /* 14.17 The synchronized Statement */
15459
15460 static tree
15461 patch_synchronized_statement (tree node, tree wfl_op1)
15462 {
15463   tree expr = java_complete_tree (TREE_OPERAND (node, 0));
15464   tree block = TREE_OPERAND (node, 1);
15465
15466   tree tmp, enter, exit, expr_decl, assignment;
15467
15468   if (expr == error_mark_node)
15469     {
15470       block = java_complete_tree (block);
15471       return expr;
15472     }
15473
15474   /* We might be trying to synchronize on a STRING_CST */
15475   if ((tmp = patch_string (expr)))
15476     expr = tmp;
15477
15478   /* The TYPE of expr must be a reference type */
15479   if (!JREFERENCE_TYPE_P (TREE_TYPE (expr)))
15480     {
15481       SET_WFL_OPERATOR (wfl_operator, node, wfl_op1);
15482       parse_error_context (wfl_operator, "Incompatible type for `synchronized'. Can't convert `%s' to `java.lang.Object'",
15483                            lang_printable_name (TREE_TYPE (expr), 0));
15484       return error_mark_node;
15485     }
15486
15487   if (flag_emit_xref)
15488     {
15489       TREE_OPERAND (node, 0) = expr;
15490       TREE_OPERAND (node, 1) = java_complete_tree (block);
15491       CAN_COMPLETE_NORMALLY (node) = 1;
15492       return node;
15493     }
15494
15495   /* Generate a try-finally for the synchronized statement, except
15496      that the handler that catches all throw exception calls
15497      _Jv_MonitorExit and then rethrow the exception.
15498      The synchronized statement is then implemented as:
15499      TRY
15500        {
15501          _Jv_MonitorEnter (expression)
15502          synchronized_block
15503          _Jv_MonitorExit (expression)
15504        }
15505      CATCH_ALL
15506        {
15507          e = _Jv_exception_info ();
15508          _Jv_MonitorExit (expression)
15509          Throw (e);
15510        } */
15511
15512   expr_decl = build_decl (VAR_DECL, generate_name (), TREE_TYPE (expr));
15513   BUILD_MONITOR_ENTER (enter, expr_decl);
15514   BUILD_MONITOR_EXIT (exit, expr_decl);
15515   CAN_COMPLETE_NORMALLY (enter) = 1;
15516   CAN_COMPLETE_NORMALLY (exit) = 1;
15517   assignment = build (MODIFY_EXPR, NULL_TREE, expr_decl, expr);
15518   TREE_SIDE_EFFECTS (assignment) = 1;
15519   node = build (COMPOUND_EXPR, NULL_TREE,
15520                 build (COMPOUND_EXPR, NULL_TREE, assignment, enter),
15521                 build (TRY_FINALLY_EXPR, NULL_TREE, block, exit));
15522   node = build_expr_block (node, expr_decl);
15523
15524   return java_complete_tree (node);
15525 }
15526
15527 /* 14.16 The throw Statement */
15528
15529 static tree
15530 patch_throw_statement (tree node, tree wfl_op1)
15531 {
15532   tree expr = TREE_OPERAND (node, 0);
15533   tree type = TREE_TYPE (expr);
15534   int unchecked_ok = 0, tryblock_throws_ok = 0;
15535
15536   /* Thrown expression must be assignable to java.lang.Throwable */
15537   if (!try_reference_assignconv (throwable_type_node, expr))
15538     {
15539       SET_WFL_OPERATOR (wfl_operator, node, wfl_op1);
15540       parse_error_context (wfl_operator,
15541     "Can't throw `%s'; it must be a subclass of class `java.lang.Throwable'",
15542                            lang_printable_name (type, 0));
15543       /* If the thrown expression was a reference, we further the
15544          compile-time check. */
15545       if (!JREFERENCE_TYPE_P (type))
15546         return error_mark_node;
15547     }
15548
15549   /* At least one of the following must be true */
15550
15551   /* The type of the throw expression is a not checked exception,
15552      i.e. is a unchecked expression. */
15553   unchecked_ok = IS_UNCHECKED_EXCEPTION_P (TREE_TYPE (type));
15554
15555   SET_WFL_OPERATOR (wfl_operator, node, wfl_op1);
15556   /* An instance can't throw a checked exception unless that exception
15557      is explicitly declared in the `throws' clause of each
15558      constructor. This doesn't apply to anonymous classes, since they
15559      don't have declared constructors. */
15560   if (!unchecked_ok
15561       && DECL_INSTINIT_P (current_function_decl)
15562       && !ANONYMOUS_CLASS_P (current_class))
15563     {
15564       tree current;
15565       for (current = TYPE_METHODS (current_class); current;
15566            current = TREE_CHAIN (current))
15567         if (DECL_CONSTRUCTOR_P (current)
15568             && !check_thrown_exceptions_do (TREE_TYPE (expr)))
15569           {
15570             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)",
15571                                  lang_printable_name (TREE_TYPE (expr), 0));
15572             return error_mark_node;
15573           }
15574     }
15575
15576   /* Throw is contained in a try statement and at least one catch
15577      clause can receive the thrown expression or the current method is
15578      declared to throw such an exception. Or, the throw statement is
15579      contained in a method or constructor declaration and the type of
15580      the Expression is assignable to at least one type listed in the
15581      throws clause the declaration. */
15582   if (!unchecked_ok)
15583     tryblock_throws_ok = check_thrown_exceptions_do (TREE_TYPE (expr));
15584   if (!(unchecked_ok || tryblock_throws_ok))
15585     {
15586       /* If there is a surrounding try block that has no matching
15587          clatch clause, report it first. A surrounding try block exits
15588          only if there is something after the list of checked
15589          exception thrown by the current function (if any). */
15590       if (IN_TRY_BLOCK_P ())
15591         parse_error_context (wfl_operator, "Checked exception `%s' can't be caught by any of the catch clause(s) of the surrounding `try' block",
15592                              lang_printable_name (type, 0));
15593       /* If we have no surrounding try statement and the method doesn't have
15594          any throws, report it now. FIXME */
15595
15596       /* We report that the exception can't be throw from a try block
15597          in all circumstances but when the `throw' is inside a static
15598          block. */
15599       else if (!EXCEPTIONS_P (currently_caught_type_list)
15600                && !tryblock_throws_ok)
15601         {
15602           if (DECL_CLINIT_P (current_function_decl))
15603             parse_error_context (wfl_operator,
15604                    "Checked exception `%s' can't be thrown in initializer",
15605                                  lang_printable_name (type, 0));
15606           else
15607             parse_error_context (wfl_operator,
15608                    "Checked exception `%s' isn't thrown from a `try' block",
15609                                  lang_printable_name (type, 0));
15610         }
15611       /* Otherwise, the current method doesn't have the appropriate
15612          throws declaration */
15613       else
15614         parse_error_context (wfl_operator, "Checked exception `%s' doesn't match any of current method's `throws' declaration(s)",
15615                              lang_printable_name (type, 0));
15616       return error_mark_node;
15617     }
15618
15619   if (! flag_emit_class_files && ! flag_emit_xref)
15620     BUILD_THROW (node, expr);
15621
15622   /* If doing xrefs, keep the location where the `throw' was seen. */
15623   if (flag_emit_xref)
15624     EXPR_WFL_LINECOL (node) = EXPR_WFL_LINECOL (wfl_op1);
15625   return node;
15626 }
15627
15628 /* Check that exception said to be thrown by method DECL can be
15629    effectively caught from where DECL is invoked.  */
15630
15631 static void
15632 check_thrown_exceptions (int location, tree decl)
15633 {
15634   tree throws;
15635   /* For all the unchecked exceptions thrown by DECL */
15636   for (throws = DECL_FUNCTION_THROWS (decl); throws;
15637        throws = TREE_CHAIN (throws))
15638     if (!check_thrown_exceptions_do (TREE_VALUE (throws)))
15639       {
15640 #if 1
15641         /* Temporary hack to suppresses errors about cloning arrays. FIXME */
15642         if (DECL_NAME (decl) == get_identifier ("clone"))
15643           continue;
15644 #endif
15645         EXPR_WFL_LINECOL (wfl_operator) = location;
15646         if (DECL_FINIT_P (current_function_decl))
15647           parse_error_context
15648             (wfl_operator, "Exception `%s' can't be thrown in initializer",
15649              lang_printable_name (TREE_VALUE (throws), 0));
15650         else
15651           {
15652             parse_error_context
15653               (wfl_operator, "Exception `%s' must be caught, or it must be declared in the `throws' clause of `%s'",
15654                lang_printable_name (TREE_VALUE (throws), 0),
15655                (DECL_INIT_P (current_function_decl) ?
15656                 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (current_class))) :
15657                 IDENTIFIER_POINTER (DECL_NAME (current_function_decl))));
15658           }
15659       }
15660 }
15661
15662 /* Return 1 if checked EXCEPTION is caught at the current nesting level of
15663    try-catch blocks, OR is listed in the `throws' clause of the
15664    current method.  */
15665
15666 static int
15667 check_thrown_exceptions_do (tree exception)
15668 {
15669   tree list = currently_caught_type_list;
15670   resolve_and_layout (exception, NULL_TREE);
15671   /* First, all the nested try-catch-finally at that stage. The
15672      last element contains `throws' clause exceptions, if any. */
15673   if (IS_UNCHECKED_EXCEPTION_P (exception))
15674     return 1;
15675   while (list)
15676     {
15677       tree caught;
15678       for (caught = TREE_VALUE (list); caught; caught = TREE_CHAIN (caught))
15679         if (valid_ref_assignconv_cast_p (exception, TREE_VALUE (caught), 0))
15680           return 1;
15681       list = TREE_CHAIN (list);
15682     }
15683   return 0;
15684 }
15685
15686 static void
15687 purge_unchecked_exceptions (tree mdecl)
15688 {
15689   tree throws = DECL_FUNCTION_THROWS (mdecl);
15690   tree new = NULL_TREE;
15691
15692   while (throws)
15693     {
15694       tree next = TREE_CHAIN (throws);
15695       if (!IS_UNCHECKED_EXCEPTION_P (TREE_VALUE (throws)))
15696         {
15697           TREE_CHAIN (throws) = new;
15698           new = throws;
15699         }
15700       throws = next;
15701     }
15702   /* List is inverted here, but it doesn't matter */
15703   DECL_FUNCTION_THROWS (mdecl) = new;
15704 }
15705
15706 /* This function goes over all of CLASS_TYPE ctors and checks whether
15707    each of them features at least one unchecked exception in its
15708    `throws' clause. If it's the case, it returns `true', `false'
15709    otherwise.  */
15710
15711 static bool
15712 ctors_unchecked_throws_clause_p (tree class_type)
15713 {
15714   tree current;
15715
15716   for (current = TYPE_METHODS (class_type); current;
15717        current = TREE_CHAIN (current))
15718     {
15719       bool ctu = false; /* Ctor Throws Unchecked */
15720       if (DECL_CONSTRUCTOR_P (current))
15721         {
15722           tree throws;
15723           for (throws = DECL_FUNCTION_THROWS (current); throws && !ctu;
15724                throws = TREE_CHAIN (throws))
15725             if (inherits_from_p (TREE_VALUE (throws), exception_type_node))
15726               ctu = true;
15727         }
15728       /* We return false as we found one ctor that is unfit. */
15729       if (!ctu && DECL_CONSTRUCTOR_P (current))
15730         return false;
15731     }
15732   /* All ctors feature at least one unchecked exception in their
15733      `throws' clause. */
15734   return true;
15735 }
15736
15737 /* 15.24 Conditional Operator ?: */
15738
15739 static tree
15740 patch_conditional_expr (tree node, tree wfl_cond, tree wfl_op1)
15741 {
15742   tree cond = TREE_OPERAND (node, 0);
15743   tree op1 = TREE_OPERAND (node, 1);
15744   tree op2 = TREE_OPERAND (node, 2);
15745   tree resulting_type = NULL_TREE;
15746   tree t1, t2, patched;
15747   int error_found = 0;
15748
15749   /* Operands of ?: might be StringBuffers crafted as a result of a
15750      string concatenation. Obtain a descent operand here.  */
15751   if ((patched = patch_string (op1)))
15752     TREE_OPERAND (node, 1) = op1 = patched;
15753   if ((patched = patch_string (op2)))
15754     TREE_OPERAND (node, 2) = op2 = patched;
15755
15756   t1 = TREE_TYPE (op1);
15757   t2 = TREE_TYPE (op2);
15758
15759   /* The first expression must be a boolean */
15760   if (TREE_TYPE (cond) != boolean_type_node)
15761     {
15762       SET_WFL_OPERATOR (wfl_operator, node, wfl_cond);
15763       parse_error_context (wfl_operator,
15764                "Incompatible type for `?:'. Can't convert `%s' to `boolean'",
15765                            lang_printable_name (TREE_TYPE (cond), 0));
15766       error_found = 1;
15767     }
15768
15769   /* Second and third can be numeric, boolean (i.e. primitive),
15770      references or null. Anything else results in an error */
15771   if (!((JNUMERIC_TYPE_P (t1) && JNUMERIC_TYPE_P (t2))
15772         || ((JREFERENCE_TYPE_P (t1) || op1 == null_pointer_node)
15773             && (JREFERENCE_TYPE_P (t2) || op2 == null_pointer_node))
15774         || (t1 == boolean_type_node && t2 == boolean_type_node)))
15775     error_found = 1;
15776
15777   /* Determine the type of the conditional expression. Same types are
15778      easy to deal with */
15779   else if (t1 == t2)
15780     resulting_type = t1;
15781
15782   /* There are different rules for numeric types */
15783   else if (JNUMERIC_TYPE_P (t1))
15784     {
15785       /* if byte/short found, the resulting type is short */
15786       if ((t1 == byte_type_node && t2 == short_type_node)
15787           || (t1 == short_type_node && t2 == byte_type_node))
15788         resulting_type = short_type_node;
15789
15790       /* If t1 is a constant int and t2 is of type byte, short or char
15791          and t1's value fits in t2, then the resulting type is t2 */
15792       else if ((t1 == int_type_node && TREE_CONSTANT (TREE_OPERAND (node, 1)))
15793           && JBSC_TYPE_P (t2) && int_fits_type_p (TREE_OPERAND (node, 1), t2))
15794         resulting_type = t2;
15795
15796       /* If t2 is a constant int and t1 is of type byte, short or char
15797          and t2's value fits in t1, then the resulting type is t1 */
15798       else if ((t2 == int_type_node && TREE_CONSTANT (TREE_OPERAND (node, 2)))
15799           && JBSC_TYPE_P (t1) && int_fits_type_p (TREE_OPERAND (node, 2), t1))
15800         resulting_type = t1;
15801
15802       /* Otherwise, binary numeric promotion is applied and the
15803          resulting type is the promoted type of operand 1 and 2 */
15804       else
15805         resulting_type = binary_numeric_promotion (t1, t2,
15806                                                    &TREE_OPERAND (node, 1),
15807                                                    &TREE_OPERAND (node, 2));
15808     }
15809
15810   /* Cases of a reference and a null type */
15811   else if (JREFERENCE_TYPE_P (t1) && op2 == null_pointer_node)
15812     resulting_type = t1;
15813
15814   else if (JREFERENCE_TYPE_P (t2) && op1 == null_pointer_node)
15815     resulting_type = t2;
15816
15817   /* Last case: different reference types. If a type can be converted
15818      into the other one by assignment conversion, the latter
15819      determines the type of the expression */
15820   else if ((resulting_type = try_reference_assignconv (t1, op2)))
15821     resulting_type = promote_type (t1);
15822
15823   else if ((resulting_type = try_reference_assignconv (t2, op1)))
15824     resulting_type = promote_type (t2);
15825
15826   /* If we don't have any resulting type, we're in trouble */
15827   if (!resulting_type)
15828     {
15829       char *t = xstrdup (lang_printable_name (t1, 0));
15830       SET_WFL_OPERATOR (wfl_operator, node, wfl_op1);
15831       parse_error_context (wfl_operator,
15832                  "Incompatible type for `?:'. Can't convert `%s' to `%s'",
15833                            t, lang_printable_name (t2, 0));
15834       free (t);
15835       error_found = 1;
15836     }
15837
15838   if (error_found)
15839     {
15840       TREE_TYPE (node) = error_mark_node;
15841       return error_mark_node;
15842     }
15843
15844   TREE_TYPE (node) = resulting_type;
15845   TREE_SET_CODE (node, COND_EXPR);
15846   CAN_COMPLETE_NORMALLY (node) = 1;
15847   return node;
15848 }
15849
15850 /* Wrap EXPR with code to initialize DECL's class, if appropriate. */
15851
15852 static tree
15853 maybe_build_class_init_for_field (tree decl, tree expr)
15854 {
15855   tree clas = DECL_CONTEXT (decl);
15856   if (flag_emit_class_files || flag_emit_xref)
15857     return expr;
15858
15859   if (TREE_CODE (decl) == VAR_DECL && FIELD_STATIC (decl)
15860       && FIELD_FINAL (decl))
15861     {
15862       tree init = DECL_INITIAL (decl);
15863       if (init != NULL_TREE)
15864         init = fold_constant_for_init (init, decl);
15865       if (init != NULL_TREE && CONSTANT_VALUE_P (init))
15866         return expr;
15867     }
15868
15869   return build_class_init (clas, expr);
15870 }
15871
15872 /* Try to constant fold NODE.
15873    If NODE is not a constant expression, return NULL_EXPR.
15874    CONTEXT is a static final VAR_DECL whose initializer we are folding. */
15875
15876 static tree
15877 fold_constant_for_init (tree node, tree context)
15878 {
15879   tree op0, op1, val;
15880   enum tree_code code = TREE_CODE (node);
15881
15882   switch (code)
15883     {
15884     case INTEGER_CST:
15885       if (node == null_pointer_node)
15886         return NULL_TREE;
15887     case STRING_CST:
15888     case REAL_CST:
15889       return node;
15890
15891     case PLUS_EXPR:
15892     case MINUS_EXPR:
15893     case MULT_EXPR:
15894     case TRUNC_MOD_EXPR:
15895     case RDIV_EXPR:
15896     case LSHIFT_EXPR:
15897     case RSHIFT_EXPR:
15898     case URSHIFT_EXPR:
15899     case BIT_AND_EXPR:
15900     case BIT_XOR_EXPR:
15901     case BIT_IOR_EXPR:
15902     case TRUTH_ANDIF_EXPR:
15903     case TRUTH_ORIF_EXPR:
15904     case EQ_EXPR:
15905     case NE_EXPR:
15906     case GT_EXPR:
15907     case GE_EXPR:
15908     case LT_EXPR:
15909     case LE_EXPR:
15910       op0 = TREE_OPERAND (node, 0);
15911       op1 = TREE_OPERAND (node, 1);
15912       val = fold_constant_for_init (op0, context);
15913       if (val == NULL_TREE || ! TREE_CONSTANT (val))
15914         return NULL_TREE;
15915       TREE_OPERAND (node, 0) = val;
15916       val = fold_constant_for_init (op1, context);
15917       if (val == NULL_TREE || ! TREE_CONSTANT (val))
15918         return NULL_TREE;
15919       TREE_OPERAND (node, 1) = val;
15920       return patch_binop (node, op0, op1);
15921
15922     case UNARY_PLUS_EXPR:
15923     case NEGATE_EXPR:
15924     case TRUTH_NOT_EXPR:
15925     case BIT_NOT_EXPR:
15926     case CONVERT_EXPR:
15927       op0 = TREE_OPERAND (node, 0);
15928       val = fold_constant_for_init (op0, context);
15929       if (val == NULL_TREE || ! TREE_CONSTANT (val))
15930         return NULL_TREE;
15931       TREE_OPERAND (node, 0) = val;
15932       return patch_unaryop (node, op0);
15933       break;
15934
15935     case COND_EXPR:
15936       val = fold_constant_for_init (TREE_OPERAND (node, 0), context);
15937       if (val == NULL_TREE || ! TREE_CONSTANT (val))
15938         return NULL_TREE;
15939       TREE_OPERAND (node, 0) = val;
15940       val = fold_constant_for_init (TREE_OPERAND (node, 1), context);
15941       if (val == NULL_TREE || ! TREE_CONSTANT (val))
15942         return NULL_TREE;
15943       TREE_OPERAND (node, 1) = val;
15944       val = fold_constant_for_init (TREE_OPERAND (node, 2), context);
15945       if (val == NULL_TREE || ! TREE_CONSTANT (val))
15946         return NULL_TREE;
15947       TREE_OPERAND (node, 2) = val;
15948       return integer_zerop (TREE_OPERAND (node, 0)) ? TREE_OPERAND (node, 1)
15949         : TREE_OPERAND (node, 2);
15950
15951     case VAR_DECL:
15952     case FIELD_DECL:
15953       if (! FIELD_FINAL (node)
15954           || DECL_INITIAL (node) == NULL_TREE)
15955         return NULL_TREE;
15956       val = DECL_INITIAL (node);
15957       /* Guard against infinite recursion. */
15958       DECL_INITIAL (node) = NULL_TREE;
15959       val = fold_constant_for_init (val, node);
15960       if (val != NULL_TREE && TREE_CODE (val) != STRING_CST)
15961         val = try_builtin_assignconv (NULL_TREE, TREE_TYPE (node), val);
15962       DECL_INITIAL (node) = val;
15963       return val;
15964
15965     case EXPR_WITH_FILE_LOCATION:
15966       /* Compare java_complete_tree and resolve_expression_name. */
15967       if (!EXPR_WFL_NODE (node) /* Or a PRIMARY flag ? */
15968           || TREE_CODE (EXPR_WFL_NODE (node)) == IDENTIFIER_NODE)
15969         {
15970           tree name = EXPR_WFL_NODE (node);
15971           tree decl;
15972           if (PRIMARY_P (node))
15973             return NULL_TREE;
15974           else if (! QUALIFIED_P (name))
15975             {
15976               decl = lookup_field_wrapper (DECL_CONTEXT (context), name);
15977               if (decl == NULL_TREE
15978                   || (! FIELD_STATIC (decl) && ! FIELD_FINAL (decl)))
15979                 return NULL_TREE;
15980               return fold_constant_for_init (decl, decl);
15981             }
15982           else
15983             {
15984               /* Install the proper context for the field resolution.
15985                  The prior context is restored once the name is
15986                  properly qualified. */
15987               tree saved_current_class = current_class;
15988               /* Wait until the USE_COMPONENT_REF re-write.  FIXME. */
15989               current_class = DECL_CONTEXT (context);
15990               qualify_ambiguous_name (node);
15991               current_class = saved_current_class;
15992               if (resolve_field_access (node, &decl, NULL)
15993                   && decl != NULL_TREE)
15994                 return fold_constant_for_init (decl, decl);
15995               return NULL_TREE;
15996             }
15997         }
15998       else
15999         {
16000           op0 = TREE_OPERAND (node, 0);
16001           val = fold_constant_for_init (op0, context);
16002           if (val == NULL_TREE || ! TREE_CONSTANT (val))
16003             return NULL_TREE;
16004           TREE_OPERAND (node, 0) = val;
16005           return val;
16006         }
16007
16008 #ifdef USE_COMPONENT_REF
16009     case IDENTIFIER:
16010     case COMPONENT_REF:
16011       ?;
16012 #endif
16013
16014     default:
16015       return NULL_TREE;
16016     }
16017 }
16018
16019 #ifdef USE_COMPONENT_REF
16020 /* Context is 'T' for TypeName, 'P' for PackageName,
16021    'M' for MethodName, 'E' for ExpressionName, and 'A' for AmbiguousName. */
16022
16023 tree
16024 resolve_simple_name (tree name, int context)
16025 {
16026 }
16027
16028 tree
16029 resolve_qualified_name (tree name, int context)
16030 {
16031 }
16032 #endif
16033
16034 void
16035 init_src_parse (void)
16036 {
16037   /* Sanity check; we've been bit by this before.  */
16038   if (ARRAY_SIZE (ctxp->modifier_ctx) != MODIFIER_TK - PUBLIC_TK)
16039     abort ();
16040 }
16041
16042 \f
16043
16044 /* This section deals with the functions that are called when tables
16045    recording class initialization information are traversed.  */
16046
16047 /* Attach to PTR (a block) the declaration found in ENTRY. */
16048
16049 static int
16050 attach_init_test_initialization_flags (void **entry, void *ptr)
16051 {
16052   tree block = (tree)ptr;
16053   struct treetreehash_entry *ite = (struct treetreehash_entry *) *entry;
16054
16055   if (block != error_mark_node)
16056     {
16057       TREE_CHAIN (ite->value) = BLOCK_EXPR_DECLS (block);
16058       BLOCK_EXPR_DECLS (block) = ite->value;
16059     }
16060   return true;
16061 }
16062
16063 /* This function is called for each classes that is known definitely
16064    assigned when a given static method was called. This function
16065    augments a compound expression (INFO) storing all assignment to
16066    initialized static class flags if a flag already existed, otherwise
16067    a new one is created.  */
16068
16069 static int
16070 emit_test_initialization (void **entry_p, void *info)
16071 {
16072   tree l = (tree) info;
16073   tree decl, init;
16074   tree key = (tree) *entry_p;
16075   tree *ite;
16076   htab_t cf_ht = DECL_FUNCTION_INIT_TEST_TABLE (current_function_decl);
16077
16078   /* If we haven't found a flag and we're dealing with self registered
16079      with current_function_decl, then don't do anything. Self is
16080      always added as definitely initialized but this information is
16081      valid only if used outside the current function. */
16082   if (current_function_decl == TREE_PURPOSE (l)
16083       && java_treetreehash_find (cf_ht, key) == NULL)
16084     return true;
16085
16086   ite = java_treetreehash_new (cf_ht, key);
16087
16088   /* If we don't have a variable, create one and install it. */
16089   if (*ite == NULL)
16090     {
16091       tree block;
16092
16093       decl = build_decl (VAR_DECL, NULL_TREE, boolean_type_node);
16094       MAYBE_CREATE_VAR_LANG_DECL_SPECIFIC (decl);
16095       LOCAL_CLASS_INITIALIZATION_FLAG (decl) = 1;
16096       DECL_CONTEXT (decl) = current_function_decl;
16097       DECL_INITIAL (decl) = boolean_true_node;
16098
16099       /* The trick is to find the right context for it. */
16100       block = BLOCK_SUBBLOCKS (GET_CURRENT_BLOCK (current_function_decl));
16101       TREE_CHAIN (decl) = BLOCK_EXPR_DECLS (block);
16102       BLOCK_EXPR_DECLS (block) = decl;
16103       *ite = decl;
16104     }
16105   else
16106     decl = *ite;
16107
16108   /* Now simply augment the compound that holds all the assignments
16109      pertaining to this method invocation. */
16110   init = build (MODIFY_EXPR, boolean_type_node, decl, boolean_true_node);
16111   TREE_SIDE_EFFECTS (init) = 1;
16112   TREE_VALUE (l) = add_stmt_to_compound (TREE_VALUE (l), void_type_node, init);
16113   TREE_SIDE_EFFECTS (TREE_VALUE (l)) = 1;
16114
16115   return true;
16116 }
16117
16118 #include "gt-java-parse.h"
16119 #include "gtype-java.h"