gcc/java/expr.c

   1 /* Process expressions for the GNU compiler for the Java(TM) language.
   2    Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004,
   3    2005, 2006, 2007, 2008, 2010 Free Software Foundation, Inc.
   4
   5 This file is part of GCC.
   6
   7 GCC is free software; you can redistribute it and/or modify
   8 it under the terms of the GNU General Public License as published by
   9 the Free Software Foundation; either version 3, or (at your option)
  10 any later version.
  11
  12 GCC is distributed in the hope that it will be useful,
  13 but WITHOUT ANY WARRANTY; without even the implied warranty of
  14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  15 GNU General Public License for more details.
  16
  17 You should have received a copy of the GNU General Public License
  18 along with GCC; see the file COPYING3.  If not see
  19 <http://www.gnu.org/licenses/>.
  20
  21 Java and all Java-based marks are trademarks or registered trademarks
  22 of Sun Microsystems, Inc. in the United States and other countries.
  23 The Free Software Foundation is independent of Sun Microsystems, Inc.  */
  24
  25 /* Hacked by Per Bothner <bothner@cygnus.com> February 1996. */
  26
  27 #include "config.h"
  28 #include "system.h"
  29 #include "coretypes.h"
  30 #include "tree.h"
  31 #include "flags.h"
  32 #include "java-tree.h"
  33 #include "javaop.h"
  34 #include "java-opcodes.h"
  35 #include "jcf.h"
  36 #include "java-except.h"
  37 #include "parse.h"
  38 #include "diagnostic-core.h"
  39 #include "ggc.h"
  40 #include "tree-iterator.h"
  41 #include "target.h"
  42
  43 static void flush_quick_stack (void);
  44 static void push_value (tree);
  45 static tree pop_value (tree);
  46 static void java_stack_swap (void);
  47 static void java_stack_dup (int, int);
  48 static void build_java_athrow (tree);
  49 static void build_java_jsr (int, int);
  50 static void build_java_ret (tree);
  51 static void expand_java_multianewarray (tree, int);
  52 static void expand_java_arraystore (tree);
  53 static void expand_java_arrayload (tree);
  54 static void expand_java_array_length (void);
  55 static tree build_java_monitor (tree, tree);
  56 static void expand_java_pushc (int, tree);
  57 static void expand_java_return (tree);
  58 static void expand_load_internal (int, tree, int);
  59 static void expand_java_NEW (tree);
  60 static void expand_java_INSTANCEOF (tree);
  61 static void expand_java_CHECKCAST (tree);
  62 static void expand_iinc (unsigned int, int, int);
  63 static void expand_java_binop (tree, enum tree_code);
  64 static void note_label (int, int);
  65 static void expand_compare (enum tree_code, tree, tree, int);
  66 static void expand_test (enum tree_code, tree, int);
  67 static void expand_cond (enum tree_code, tree, int);
  68 static void expand_java_goto (int);
  69 static tree expand_java_switch (tree, int);
  70 static void expand_java_add_case (tree, int, int);
  71 static VEC(tree,gc) *pop_arguments (tree);
  72 static void expand_invoke (int, int, int);
  73 static void expand_java_field_op (int, int, int);
  74 static void java_push_constant_from_pool (struct JCF *, int);
  75 static void java_stack_pop (int);
  76 static tree build_java_throw_out_of_bounds_exception (tree);
  77 static tree build_java_check_indexed_type (tree, tree);
  78 static unsigned char peek_opcode_at_pc (struct JCF *, int, int);
  79 static void promote_arguments (void);
  80 static void cache_cpool_data_ref (void);
  81
  82 static GTY(()) tree operand_type[59];
  83
  84 static GTY(()) tree methods_ident;
  85 static GTY(()) tree ncode_ident;
  86 tree dtable_ident = NULL_TREE;
  87
  88 /* Set to nonzero value in order to emit class initialization code
  89    before static field references.  */
  90 int always_initialize_class_p = 0;
  91
  92 /* We store the stack state in two places:
  93    Within a basic block, we use the quick_stack, which is a VEC of expression
  94    nodes.
  95    This is the top part of the stack;  below that we use find_stack_slot.
  96    At the end of a basic block, the quick_stack must be flushed
  97    to the stack slot array (as handled by find_stack_slot).
  98    Using quick_stack generates better code (especially when
  99    compiled without optimization), because we do not have to
 100    explicitly store and load trees to temporary variables.
 101
 102    If a variable is on the quick stack, it means the value of variable
 103    when the quick stack was last flushed.  Conceptually, flush_quick_stack
 104    saves all the quick_stack elements in parallel.  However, that is
 105    complicated, so it actually saves them (i.e. copies each stack value
 106    to is home virtual register) from low indexes.  This allows a quick_stack
 107    element at index i (counting from the bottom of stack the) to references
 108    slot virtuals for register that are >= i, but not those that are deeper.
 109    This convention makes most operations easier.  For example iadd works
 110    even when the stack contains (reg[0], reg[1]):  It results in the
 111    stack containing (reg[0]+reg[1]), which is OK.  However, some stack
 112    operations are more complicated.  For example dup given a stack
 113    containing (reg[0]) would yield (reg[0], reg[0]), which would violate
 114    the convention, since stack value 1 would refer to a register with
 115    lower index (reg[0]), which flush_quick_stack does not safely handle.
 116    So dup cannot just add an extra element to the quick_stack, but iadd can.
 117 */
 118
 119 static GTY(()) VEC(tree,gc) *quick_stack;
 120
 121 /* The physical memory page size used in this computer.  See
 122    build_field_ref().  */
 123 static GTY(()) tree page_size;
 124
 125 /* The stack pointer of the Java virtual machine.
 126    This does include the size of the quick_stack. */
 127
 128 int stack_pointer;
 129
 130 const unsigned char *linenumber_table;
 131 int linenumber_count;
 132
 133 /* Largest pc so far in this method that has been passed to lookup_label. */
 134 int highest_label_pc_this_method = -1;
 135
 136 /* Base value for this method to add to pc to get generated label. */
 137 int start_label_pc_this_method = 0;
 138
 139 void
 140 init_expr_processing (void)
 141 {
 142   operand_type[21] = operand_type[54] = int_type_node;
 143   operand_type[22] = operand_type[55] = long_type_node;
 144   operand_type[23] = operand_type[56] = float_type_node;
 145   operand_type[24] = operand_type[57] = double_type_node;
 146   operand_type[25] = operand_type[58] = ptr_type_node;
 147 }
 148
 149 tree
 150 java_truthvalue_conversion (tree expr)
 151 {
 152   /* It is simpler and generates better code to have only TRUTH_*_EXPR
 153      or comparison expressions as truth values at this level.
 154
 155      This function should normally be identity for Java.  */
 156
 157   switch (TREE_CODE (expr))
 158     {
 159     case EQ_EXPR:   case NE_EXPR:   case UNEQ_EXPR: case LTGT_EXPR:
 160     case LE_EXPR:   case GE_EXPR:   case LT_EXPR:   case GT_EXPR:
 161     case UNLE_EXPR: case UNGE_EXPR: case UNLT_EXPR: case UNGT_EXPR:
 162     case ORDERED_EXPR: case UNORDERED_EXPR:
 163     case TRUTH_ANDIF_EXPR:
 164     case TRUTH_ORIF_EXPR:
 165     case TRUTH_AND_EXPR:
 166     case TRUTH_OR_EXPR:
 167     case TRUTH_XOR_EXPR:
 168     case TRUTH_NOT_EXPR:
 169     case ERROR_MARK:
 170       return expr;
 171
 172     case INTEGER_CST:
 173       return integer_zerop (expr) ? boolean_false_node : boolean_true_node;
 174
 175     case REAL_CST:
 176       return real_zerop (expr) ? boolean_false_node : boolean_true_node;
 177
 178     /* are these legal? XXX JH */
 179     case NEGATE_EXPR:
 180     case ABS_EXPR:
 181     case FLOAT_EXPR:
 182       /* These don't change whether an object is nonzero or zero.  */
 183       return java_truthvalue_conversion (TREE_OPERAND (expr, 0));
 184
 185     case COND_EXPR:
 186       /* Distribute the conversion into the arms of a COND_EXPR.  */
 187       return fold_build3 (COND_EXPR, boolean_type_node, TREE_OPERAND (expr, 0),
 188                           java_truthvalue_conversion (TREE_OPERAND (expr, 1)),
 189                           java_truthvalue_conversion (TREE_OPERAND (expr, 2)));
 190
 191     case NOP_EXPR:
 192       /* If this is widening the argument, we can ignore it.  */
 193       if (TYPE_PRECISION (TREE_TYPE (expr))
 194           >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr, 0))))
 195         return java_truthvalue_conversion (TREE_OPERAND (expr, 0));
 196       /* fall through to default */
 197
 198     default:
 199       return fold_build2 (NE_EXPR, boolean_type_node,
 200                           expr, boolean_false_node);
 201     }
 202 }
 203
 204 /* Save any stack slots that happen to be in the quick_stack into their
 205    home virtual register slots.
 206
 207    The copy order is from low stack index to high, to support the invariant
 208    that the expression for a slot may contain decls for stack slots with
 209    higher (or the same) index, but not lower. */
 210
 211 static void
 212 flush_quick_stack (void)
 213 {
 214   int stack_index = stack_pointer;
 215   unsigned ix;
 216   tree t;
 217
 218   /* Count the number of slots the quick stack is holding.  */
 219   for (ix = 0; VEC_iterate(tree, quick_stack, ix, t); ix++)
 220     stack_index -= 1 + TYPE_IS_WIDE (TREE_TYPE (t));
 221
 222   for (ix = 0; VEC_iterate(tree, quick_stack, ix, t); ix++)
 223     {
 224       tree decl, type = TREE_TYPE (t);
 225
 226       decl = find_stack_slot (stack_index, type);
 227       if (decl != t)
 228         java_add_stmt (build2 (MODIFY_EXPR, TREE_TYPE (t), decl, t));
 229       stack_index += 1 + TYPE_IS_WIDE (type);
 230     }
 231
 232   VEC_truncate (tree, quick_stack, 0);
 233 }
 234
 235 /* Push TYPE on the type stack.
 236    Return true on success, 0 on overflow. */
 237
 238 int
 239 push_type_0 (tree type)
 240 {
 241   int n_words;
 242   type = promote_type (type);
 243   n_words = 1 + TYPE_IS_WIDE (type);
 244   if (stack_pointer + n_words > DECL_MAX_STACK (current_function_decl))
 245     return 0;
 246   /* Allocate decl for this variable now, so we get a temporary that
 247      survives the whole method. */
 248   find_stack_slot (stack_pointer, type);
 249   stack_type_map[stack_pointer++] = type;
 250   n_words--;
 251   while (--n_words >= 0)
 252     stack_type_map[stack_pointer++] = TYPE_SECOND;
 253   return 1;
 254 }
 255
 256 void
 257 push_type (tree type)
 258 {
 259   int r = push_type_0 (type);
 260   gcc_assert (r);
 261 }
 262
 263 static void
 264 push_value (tree value)
 265 {
 266   tree type = TREE_TYPE (value);
 267   if (TYPE_PRECISION (type) < 32 && INTEGRAL_TYPE_P (type))
 268     {
 269       type = promote_type (type);
 270       value = convert (type, value);
 271     }
 272   push_type (type);
 273   VEC_safe_push (tree, gc, quick_stack, value);
 274
 275   /* If the value has a side effect, then we need to evaluate it
 276      whether or not the result is used.  If the value ends up on the
 277      quick stack and is then popped, this won't happen -- so we flush
 278      the quick stack.  It is safest to simply always flush, though,
 279      since TREE_SIDE_EFFECTS doesn't capture COMPONENT_REF, and for
 280      the latter we may need to strip conversions.  */
 281   flush_quick_stack ();
 282 }
 283
 284 /* Pop a type from the type stack.
 285    TYPE is the expected type.   Return the actual type, which must be
 286    convertible to TYPE.
 287    On an error, *MESSAGEP is set to a freshly malloc'd error message. */
 288
 289 tree
 290 pop_type_0 (tree type, char **messagep)
 291 {
 292   int n_words;
 293   tree t;
 294   *messagep = NULL;
 295   if (TREE_CODE (type) == RECORD_TYPE)
 296     type = promote_type (type);
 297   n_words = 1 + TYPE_IS_WIDE (type);
 298   if (stack_pointer < n_words)
 299     {
 300       *messagep = xstrdup ("stack underflow");
 301       return type;
 302     }
 303   while (--n_words > 0)
 304     {
 305       if (stack_type_map[--stack_pointer] != void_type_node)
 306         {
 307           *messagep = xstrdup ("Invalid multi-word value on type stack");
 308           return type;
 309         }
 310     }
 311   t = stack_type_map[--stack_pointer];
 312   if (type == NULL_TREE || t == type)
 313     return t;
 314   if (TREE_CODE (t) == TREE_LIST)
 315     {
 316       do
 317         {
 318           tree tt = TREE_PURPOSE (t);
 319           if (! can_widen_reference_to (tt, type))
 320             {
 321               t = tt;
 322               goto fail;
 323             }
 324           t = TREE_CHAIN (t);
 325         }
 326       while (t);
 327       return t;
 328     }
 329   if (INTEGRAL_TYPE_P (type) && INTEGRAL_TYPE_P (t)
 330       && TYPE_PRECISION (type) <= 32 && TYPE_PRECISION (t) <= 32)
 331     return t;
 332   if (TREE_CODE (type) == POINTER_TYPE && TREE_CODE (t) == POINTER_TYPE)
 333     {
 334       /* If the expected type we've been passed is object or ptr
 335          (i.e. void*), the caller needs to know the real type.  */
 336       if (type == ptr_type_node || type == object_ptr_type_node)
 337         return t;
 338
 339       /* Since the verifier has already run, we know that any
 340          types we see will be compatible.  In BC mode, this fact
 341          may be checked at runtime, but if that is so then we can
 342          assume its truth here as well.  So, we always succeed
 343          here, with the expected type.  */
 344       return type;
 345     }
 346
 347   if (! flag_verify_invocations && flag_indirect_dispatch
 348       && t == object_ptr_type_node)
 349     {
 350       if (type != ptr_type_node)
 351         warning (0, "need to insert runtime check for %s",
 352                  xstrdup (lang_printable_name (type, 0)));
 353       return type;
 354     }
 355
 356   /* lang_printable_name uses a static buffer, so we must save the result
 357      from calling it the first time.  */
 358  fail:
 359   {
 360     char *temp = xstrdup (lang_printable_name (type, 0));
 361     /* If the stack contains a multi-word type, keep popping the stack until
 362        the real type is found.  */
 363     while (t == void_type_node)
 364       t = stack_type_map[--stack_pointer];
 365     *messagep = concat ("expected type '", temp,
 366                         "' but stack contains '", lang_printable_name (t, 0),
 367                         "'", NULL);
 368     free (temp);
 369   }
 370   return type;
 371 }
 372
 373 /* Pop a type from the type stack.
 374    TYPE is the expected type.  Return the actual type, which must be
 375    convertible to TYPE, otherwise call error. */
 376
 377 tree
 378 pop_type (tree type)
 379 {
 380   char *message = NULL;
 381   type = pop_type_0 (type, &message);
 382   if (message != NULL)
 383     {
 384       error ("%s", message);
 385       free (message);
 386     }
 387   return type;
 388 }
 389
 390 \f
 391 /* Return true if two type assertions are equal.  */
 392
 393 static int
 394 type_assertion_eq (const void * k1_p, const void * k2_p)
 395 {
 396   const type_assertion k1 = *(const type_assertion *)k1_p;
 397   const type_assertion k2 = *(const type_assertion *)k2_p;
 398   return (k1.assertion_code == k2.assertion_code
 399           && k1.op1 == k2.op1
 400           && k1.op2 == k2.op2);
 401 }
 402
 403 /* Hash a type assertion.  */
 404
 405 static hashval_t
 406 type_assertion_hash (const void *p)
 407 {
 408   const type_assertion *k_p = (const type_assertion *) p;
 409   hashval_t hash = iterative_hash (&k_p->assertion_code, sizeof
 410                                    k_p->assertion_code, 0);
 411
 412   switch (k_p->assertion_code)
 413     {
 414     case JV_ASSERT_TYPES_COMPATIBLE:
 415       hash = iterative_hash (&TYPE_UID (k_p->op2), sizeof TYPE_UID (k_p->op2),
 416                              hash);
 417       /* Fall through.  */
 418
 419     case JV_ASSERT_IS_INSTANTIABLE:
 420       hash = iterative_hash (&TYPE_UID (k_p->op1), sizeof TYPE_UID (k_p->op1),
 421                              hash);
 422       /* Fall through.  */
 423
 424     case JV_ASSERT_END_OF_TABLE:
 425       break;
 426
 427     default:
 428       gcc_unreachable ();
 429     }
 430
 431   return hash;
 432 }
 433
 434 /* Add an entry to the type assertion table for the given class.
 435    KLASS is the class for which this assertion will be evaluated by the
 436    runtime during loading/initialization.
 437    ASSERTION_CODE is the 'opcode' or type of this assertion: see java-tree.h.
 438    OP1 and OP2 are the operands. The tree type of these arguments may be
 439    specific to each assertion_code. */
 440
 441 void
 442 add_type_assertion (tree klass, int assertion_code, tree op1, tree op2)
 443 {
 444   htab_t assertions_htab;
 445   type_assertion as;
 446   void **as_pp;
 447
 448   assertions_htab = TYPE_ASSERTIONS (klass);
 449   if (assertions_htab == NULL)
 450     {
 451       assertions_htab = htab_create_ggc (7, type_assertion_hash,
 452                                          type_assertion_eq, NULL);
 453       TYPE_ASSERTIONS (current_class) = assertions_htab;
 454     }
 455
 456   as.assertion_code = assertion_code;
 457   as.op1 = op1;
 458   as.op2 = op2;
 459
 460   as_pp = htab_find_slot (assertions_htab, &as, INSERT);
 461
 462   /* Don't add the same assertion twice.  */
 463   if (*as_pp)
 464     return;
 465
 466   *as_pp = ggc_alloc_type_assertion ();
 467   **(type_assertion **)as_pp = as;
 468 }
 469
 470 \f
 471 /* Return 1 if SOURCE_TYPE can be safely widened to TARGET_TYPE.
 472    Handles array types and interfaces.  */
 473
 474 int
 475 can_widen_reference_to (tree source_type, tree target_type)
 476 {
 477   if (source_type == ptr_type_node || target_type == object_ptr_type_node)
 478     return 1;
 479
 480   /* Get rid of pointers  */
 481   if (TREE_CODE (source_type) == POINTER_TYPE)
 482     source_type = TREE_TYPE (source_type);
 483   if (TREE_CODE (target_type) == POINTER_TYPE)
 484     target_type = TREE_TYPE (target_type);
 485
 486   if (source_type == target_type)
 487     return 1;
 488
 489   /* FIXME: This is very pessimistic, in that it checks everything,
 490      even if we already know that the types are compatible.  If we're
 491      to support full Java class loader semantics, we need this.
 492      However, we could do something more optimal.  */
 493   if (! flag_verify_invocations)
 494     {
 495       add_type_assertion (current_class, JV_ASSERT_TYPES_COMPATIBLE,
 496                           source_type, target_type);
 497
 498       if (!quiet_flag)
 499        warning (0, "assert: %s is assign compatible with %s",
 500                 xstrdup (lang_printable_name (target_type, 0)),
 501                 xstrdup (lang_printable_name (source_type, 0)));
 502       /* Punt everything to runtime.  */
 503       return 1;
 504     }
 505
 506   if (TYPE_DUMMY (source_type) || TYPE_DUMMY (target_type))
 507     {
 508       return 1;
 509     }
 510   else
 511     {
 512       if (TYPE_ARRAY_P (source_type) || TYPE_ARRAY_P (target_type))
 513         {
 514           HOST_WIDE_INT source_length, target_length;
 515           if (TYPE_ARRAY_P (source_type) != TYPE_ARRAY_P (target_type))
 516             {
 517               /* An array implements Cloneable and Serializable.  */
 518               tree name = DECL_NAME (TYPE_NAME (target_type));
 519               return (name == java_lang_cloneable_identifier_node
 520                       || name == java_io_serializable_identifier_node);
 521             }
 522           target_length = java_array_type_length (target_type);
 523           if (target_length >= 0)
 524             {
 525               source_length = java_array_type_length (source_type);
 526               if (source_length != target_length)
 527                 return 0;
 528             }
 529           source_type = TYPE_ARRAY_ELEMENT (source_type);
 530           target_type = TYPE_ARRAY_ELEMENT (target_type);
 531           if (source_type == target_type)
 532             return 1;
 533           if (TREE_CODE (source_type) != POINTER_TYPE
 534               || TREE_CODE (target_type) != POINTER_TYPE)
 535             return 0;
 536           return can_widen_reference_to (source_type, target_type);
 537         }
 538       else
 539         {
 540           int source_depth = class_depth (source_type);
 541           int target_depth = class_depth (target_type);
 542
 543           if (TYPE_DUMMY (source_type) || TYPE_DUMMY (target_type))
 544             {
 545               if (! quiet_flag)
 546                 warning (0, "assert: %s is assign compatible with %s",
 547                          xstrdup (lang_printable_name (target_type, 0)),
 548                          xstrdup (lang_printable_name (source_type, 0)));
 549               return 1;
 550             }
 551
 552           /* class_depth can return a negative depth if an error occurred */
 553           if (source_depth < 0 || target_depth < 0)
 554             return 0;
 555
 556           if (CLASS_INTERFACE (TYPE_NAME (target_type)))
 557             {
 558               /* target_type is OK if source_type or source_type ancestors
 559                  implement target_type. We handle multiple sub-interfaces  */
 560               tree binfo, base_binfo;
 561               int i;
 562
 563               for (binfo = TYPE_BINFO (source_type), i = 0;
 564                    BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
 565                 if (can_widen_reference_to
 566                     (BINFO_TYPE (base_binfo), target_type))
 567                   return 1;
 568
 569               if (!i)
 570                 return 0;
 571             }
 572
 573           for ( ; source_depth > target_depth;  source_depth--)
 574             {
 575               source_type
 576                 = BINFO_TYPE (BINFO_BASE_BINFO (TYPE_BINFO (source_type), 0));
 577             }
 578           return source_type == target_type;
 579         }
 580     }
 581 }
 582
 583 static tree
 584 pop_value (tree type)
 585 {
 586   type = pop_type (type);
 587   if (VEC_length (tree, quick_stack) != 0)
 588     return VEC_pop (tree, quick_stack);
 589   else
 590     return find_stack_slot (stack_pointer, promote_type (type));
 591 }
 592
 593
 594 /* Pop and discard the top COUNT stack slots. */
 595
 596 static void
 597 java_stack_pop (int count)
 598 {
 599   while (count > 0)
 600     {
 601       tree type;
 602
 603       gcc_assert (stack_pointer != 0);
 604
 605       type = stack_type_map[stack_pointer - 1];
 606       if (type == TYPE_SECOND)
 607         {
 608           count--;
 609           gcc_assert (stack_pointer != 1 && count > 0);
 610
 611           type = stack_type_map[stack_pointer - 2];
 612         }
 613       pop_value (type);
 614       count--;
 615     }
 616 }
 617
 618 /* Implement the 'swap' operator (to swap two top stack slots). */
 619
 620 static void
 621 java_stack_swap (void)
 622 {
 623   tree type1, type2;
 624   tree temp;
 625   tree decl1, decl2;
 626
 627   if (stack_pointer < 2
 628       || (type1 = stack_type_map[stack_pointer - 1]) == TYPE_SECOND
 629       || (type2 = stack_type_map[stack_pointer - 2]) == TYPE_SECOND
 630       || TYPE_IS_WIDE (type1) || TYPE_IS_WIDE (type2))
 631     /* Bad stack swap.  */
 632     abort ();
 633   /* Bad stack swap.  */
 634
 635   flush_quick_stack ();
 636   decl1 = find_stack_slot (stack_pointer - 1, type1);
 637   decl2 = find_stack_slot (stack_pointer - 2, type2);
 638   temp = build_decl (input_location, VAR_DECL, NULL_TREE, type1);
 639   java_add_local_var (temp);
 640   java_add_stmt (build2 (MODIFY_EXPR, type1, temp, decl1));
 641   java_add_stmt (build2 (MODIFY_EXPR, type2,
 642                          find_stack_slot (stack_pointer - 1, type2),
 643                          decl2));
 644   java_add_stmt (build2 (MODIFY_EXPR, type1,
 645                          find_stack_slot (stack_pointer - 2, type1),
 646                          temp));
 647   stack_type_map[stack_pointer - 1] = type2;
 648   stack_type_map[stack_pointer - 2] = type1;
 649 }
 650
 651 static void
 652 java_stack_dup (int size, int offset)
 653 {
 654   int low_index = stack_pointer - size - offset;
 655   int dst_index;
 656   if (low_index < 0)
 657     error ("stack underflow - dup* operation");
 658
 659   flush_quick_stack ();
 660
 661   stack_pointer += size;
 662   dst_index = stack_pointer;
 663
 664   for (dst_index = stack_pointer;  --dst_index >= low_index; )
 665     {
 666       tree type;
 667       int src_index = dst_index - size;
 668       if (src_index < low_index)
 669         src_index = dst_index + size + offset;
 670       type = stack_type_map [src_index];
 671       if (type == TYPE_SECOND)
 672         {
 673           /* Dup operation splits 64-bit number.  */
 674           gcc_assert (src_index > low_index);
 675
 676           stack_type_map[dst_index] = type;
 677           src_index--;  dst_index--;
 678           type = stack_type_map[src_index];
 679           gcc_assert (TYPE_IS_WIDE (type));
 680         }
 681       else
 682         gcc_assert (! TYPE_IS_WIDE (type));
 683
 684       if (src_index != dst_index)
 685         {
 686           tree src_decl = find_stack_slot (src_index, type);
 687           tree dst_decl = find_stack_slot (dst_index, type);
 688
 689           java_add_stmt
 690             (build2 (MODIFY_EXPR, TREE_TYPE (dst_decl), dst_decl, src_decl));
 691           stack_type_map[dst_index] = type;
 692         }
 693     }
 694 }
 695
 696 /* Calls _Jv_Throw or _Jv_Sjlj_Throw.  Discard the contents of the
 697    value stack. */
 698
 699 static void
 700 build_java_athrow (tree node)
 701 {
 702   tree call;
 703
 704   call = build_call_nary (void_type_node,
 705                           build_address_of (throw_node),
 706                           1, node);
 707   TREE_SIDE_EFFECTS (call) = 1;
 708   java_add_stmt (call);
 709   java_stack_pop (stack_pointer);
 710 }
 711
 712 /* Implementation for jsr/ret */
 713
 714 static void
 715 build_java_jsr (int target_pc, int return_pc)
 716 {
 717   tree where =  lookup_label (target_pc);
 718   tree ret = lookup_label (return_pc);
 719   tree ret_label = fold_build1 (ADDR_EXPR, return_address_type_node, ret);
 720   push_value (ret_label);
 721   flush_quick_stack ();
 722   java_add_stmt (build1 (GOTO_EXPR, void_type_node, where));
 723
 724   /* Do not need to emit the label here.  We noted the existence of the
 725      label as a jump target in note_instructions; we'll emit the label
 726      for real at the beginning of the expand_byte_code loop.  */
 727 }
 728
 729 static void
 730 build_java_ret (tree location)
 731 {
 732   java_add_stmt (build1 (GOTO_EXPR, void_type_node, location));
 733 }
 734
 735 /* Implementation of operations on array: new, load, store, length */
 736
 737 tree
 738 decode_newarray_type (int atype)
 739 {
 740   switch (atype)
 741     {
 742     case 4:  return boolean_type_node;
 743     case 5:  return char_type_node;
 744     case 6:  return float_type_node;
 745     case 7:  return double_type_node;
 746     case 8:  return byte_type_node;
 747     case 9:  return short_type_node;
 748     case 10: return int_type_node;
 749     case 11: return long_type_node;
 750     default: return NULL_TREE;
 751     }
 752 }
 753
 754 /* Map primitive type to the code used by OPCODE_newarray. */
 755
 756 int
 757 encode_newarray_type (tree type)
 758 {
 759   if (type == boolean_type_node)
 760     return 4;
 761   else if (type == char_type_node)
 762     return 5;
 763   else if (type == float_type_node)
 764     return 6;
 765   else if (type == double_type_node)
 766     return 7;
 767   else if (type == byte_type_node)
 768     return 8;
 769   else if (type == short_type_node)
 770     return 9;
 771   else if (type == int_type_node)
 772     return 10;
 773   else if (type == long_type_node)
 774     return 11;
 775   else
 776     gcc_unreachable ();
 777 }
 778
 779 /* Build a call to _Jv_ThrowBadArrayIndex(), the
 780    ArrayIndexOfBoundsException exception handler.  */
 781
 782 static tree
 783 build_java_throw_out_of_bounds_exception (tree index)
 784 {
 785   tree node;
 786
 787   /* We need to build a COMPOUND_EXPR because _Jv_ThrowBadArrayIndex()
 788      has void return type.  We cannot just set the type of the CALL_EXPR below
 789      to int_type_node because we would lose it during gimplification.  */
 790   gcc_assert (VOID_TYPE_P (TREE_TYPE (TREE_TYPE (soft_badarrayindex_node))));
 791   node = build_call_nary (void_type_node,
 792                                build_address_of (soft_badarrayindex_node),
 793                                1, index);
 794   TREE_SIDE_EFFECTS (node) = 1;
 795
 796   node = build2 (COMPOUND_EXPR, int_type_node, node, integer_zero_node);
 797   TREE_SIDE_EFFECTS (node) = 1; /* Allows expansion within ANDIF */
 798
 799   return (node);
 800 }
 801
 802 /* Return the length of an array. Doesn't perform any checking on the nature
 803    or value of the array NODE. May be used to implement some bytecodes.  */
 804
 805 tree
 806 build_java_array_length_access (tree node)
 807 {
 808   tree type = TREE_TYPE (node);
 809   tree array_type = TREE_TYPE (type);
 810   HOST_WIDE_INT length;
 811
 812   if (!is_array_type_p (type))
 813     {
 814       /* With the new verifier, we will see an ordinary pointer type
 815          here.  In this case, we just use an arbitrary array type.  */
 816       array_type = build_java_array_type (object_ptr_type_node, -1);
 817       type = promote_type (array_type);
 818     }
 819
 820   length = java_array_type_length (type);
 821   if (length >= 0)
 822     return build_int_cst (NULL_TREE, length);
 823
 824   node = build3 (COMPONENT_REF, int_type_node,
 825                  build_java_indirect_ref (array_type, node,
 826                                           flag_check_references),
 827                  lookup_field (&array_type, get_identifier ("length")),
 828                  NULL_TREE);
 829   IS_ARRAY_LENGTH_ACCESS (node) = 1;
 830   return node;
 831 }
 832
 833 /* Optionally checks a reference against the NULL pointer.  ARG1: the
 834    expr, ARG2: we should check the reference.  Don't generate extra
 835    checks if we're not generating code.  */
 836
 837 tree
 838 java_check_reference (tree expr, int check)
 839 {
 840   if (!flag_syntax_only && check)
 841     {
 842       expr = save_expr (expr);
 843       expr = build3 (COND_EXPR, TREE_TYPE (expr),
 844                      build2 (EQ_EXPR, boolean_type_node,
 845                              expr, null_pointer_node),
 846                      build_call_nary (void_type_node,
 847                                       build_address_of (soft_nullpointer_node),
 848                                       0),
 849                      expr);
 850     }
 851
 852   return expr;
 853 }
 854
 855 /* Reference an object: just like an INDIRECT_REF, but with checking.  */
 856
 857 tree
 858 build_java_indirect_ref (tree type, tree expr, int check)
 859 {
 860   tree t;
 861   t = java_check_reference (expr, check);
 862   t = convert (build_pointer_type (type), t);
 863   return build1 (INDIRECT_REF, type, t);
 864 }
 865
 866 /* Implement array indexing (either as l-value or r-value).
 867    Returns a tree for ARRAY[INDEX], assume TYPE is the element type.
 868    Optionally performs bounds checking and/or test to NULL.
 869    At this point, ARRAY should have been verified as an array.  */
 870
 871 tree
 872 build_java_arrayaccess (tree array, tree type, tree index)
 873 {
 874   tree node, throw_expr = NULL_TREE;
 875   tree data_field;
 876   tree ref;
 877   tree array_type = TREE_TYPE (TREE_TYPE (array));
 878   tree size_exp = fold_convert (sizetype, size_in_bytes (type));
 879
 880   if (!is_array_type_p (TREE_TYPE (array)))
 881     {
 882       /* With the new verifier, we will see an ordinary pointer type
 883          here.  In this case, we just use the correct array type.  */
 884       array_type = build_java_array_type (type, -1);
 885     }
 886
 887   if (flag_bounds_check)
 888     {
 889       /* Generate:
 890        * (unsigned jint) INDEX >= (unsigned jint) LEN
 891        *    && throw ArrayIndexOutOfBoundsException.
 892        * Note this is equivalent to and more efficient than:
 893        * INDEX < 0 || INDEX >= LEN && throw ... */
 894       tree test;
 895       tree len = convert (unsigned_int_type_node,
 896                           build_java_array_length_access (array));
 897       test = fold_build2 (GE_EXPR, boolean_type_node,
 898                           convert (unsigned_int_type_node, index),
 899                           len);
 900       if (! integer_zerop (test))
 901         {
 902           throw_expr
 903             = build2 (TRUTH_ANDIF_EXPR, int_type_node, test,
 904                       build_java_throw_out_of_bounds_exception (index));
 905           /* allows expansion within COMPOUND */
 906           TREE_SIDE_EFFECTS( throw_expr ) = 1;
 907         }
 908     }
 909
 910   /* If checking bounds, wrap the index expr with a COMPOUND_EXPR in order
 911      to have the bounds check evaluated first. */
 912   if (throw_expr != NULL_TREE)
 913     index = build2 (COMPOUND_EXPR, int_type_node, throw_expr, index);
 914
 915   data_field = lookup_field (&array_type, get_identifier ("data"));
 916
 917   ref = build3 (COMPONENT_REF, TREE_TYPE (data_field),
 918                 build_java_indirect_ref (array_type, array,
 919                                          flag_check_references),
 920                 data_field, NULL_TREE);
 921
 922   /* Take the address of the data field and convert it to a pointer to
 923      the element type.  */
 924   node = build1 (NOP_EXPR, build_pointer_type (type), build_address_of (ref));
 925
 926   /* Multiply the index by the size of an element to obtain a byte
 927      offset.  Convert the result to a pointer to the element type.  */
 928   index = build2 (MULT_EXPR, sizetype,
 929                   fold_convert (sizetype, index),
 930                   size_exp);
 931
 932   /* Sum the byte offset and the address of the data field.  */
 933   node = fold_build2 (POINTER_PLUS_EXPR, TREE_TYPE (node), node, index);
 934
 935   /* Finally, return
 936
 937     *((&array->data) + index*size_exp)
 938
 939   */
 940   return build1 (INDIRECT_REF, TREE_TYPE (TREE_TYPE (node)), node);
 941 }
 942
 943 /* Generate code to throw an ArrayStoreException if OBJECT is not assignable
 944    (at runtime) to an element of ARRAY.  A NOP_EXPR is returned if it can
 945    determine that no check is required. */
 946
 947 tree
 948 build_java_arraystore_check (tree array, tree object)
 949 {
 950   tree check, element_type, source;
 951   tree array_type_p = TREE_TYPE (array);
 952   tree object_type = TYPE_NAME (TREE_TYPE (TREE_TYPE (object)));
 953
 954   if (! flag_verify_invocations)
 955     {
 956       /* With the new verifier, we don't track precise types.  FIXME:
 957          performance regression here.  */
 958       element_type = TYPE_NAME (object_type_node);
 959     }
 960   else
 961     {
 962       gcc_assert (is_array_type_p (array_type_p));
 963
 964       /* Get the TYPE_DECL for ARRAY's element type. */
 965       element_type
 966         = TYPE_NAME (TREE_TYPE (TREE_TYPE (TREE_TYPE (array_type_p))));
 967     }
 968
 969   gcc_assert (TREE_CODE (element_type) == TYPE_DECL
 970               && TREE_CODE (object_type) == TYPE_DECL);
 971
 972   if (!flag_store_check)
 973     return build1 (NOP_EXPR, array_type_p, array);
 974
 975   /* No check is needed if the element type is final.  Also check that
 976      element_type matches object_type, since in the bytecode
 977      compilation case element_type may be the actual element type of
 978      the array rather than its declared type.  However, if we're doing
 979      indirect dispatch, we can't do the `final' optimization.  */
 980   if (element_type == object_type
 981       && ! flag_indirect_dispatch
 982       && CLASS_FINAL (element_type))
 983     return build1 (NOP_EXPR, array_type_p, array);
 984
 985   /* OBJECT might be wrapped by a SAVE_EXPR. */
 986   if (TREE_CODE (object) == SAVE_EXPR)
 987     source = TREE_OPERAND (object, 0);
 988   else
 989     source = object;
 990
 991   /* Avoid the check if OBJECT was just loaded from the same array. */
 992   if (TREE_CODE (source) == ARRAY_REF)
 993     {
 994       tree target;
 995       source = TREE_OPERAND (source, 0); /* COMPONENT_REF. */
 996       source = TREE_OPERAND (source, 0); /* INDIRECT_REF. */
 997       source = TREE_OPERAND (source, 0); /* Source array's DECL or SAVE_EXPR. */
 998       if (TREE_CODE (source) == SAVE_EXPR)
 999         source = TREE_OPERAND (source, 0);
1000
1001       target = array;
1002       if (TREE_CODE (target) == SAVE_EXPR)
1003         target = TREE_OPERAND (target, 0);
1004
1005       if (source == target)
1006         return build1 (NOP_EXPR, array_type_p, array);
1007     }
1008
1009   /* Build an invocation of _Jv_CheckArrayStore */
1010   check = build_call_nary (void_type_node,
1011                            build_address_of (soft_checkarraystore_node),
1012                            2, array, object);
1013   TREE_SIDE_EFFECTS (check) = 1;
1014
1015   return check;
1016 }
1017
1018 /* Makes sure that INDEXED_TYPE is appropriate. If not, make it from
1019    ARRAY_NODE. This function is used to retrieve something less vague than
1020    a pointer type when indexing the first dimension of something like [[<t>.
1021    May return a corrected type, if necessary, otherwise INDEXED_TYPE is
1022    return unchanged.  */
1023
1024 static tree
1025 build_java_check_indexed_type (tree array_node ATTRIBUTE_UNUSED,
1026                                tree indexed_type)
1027 {
1028   /* We used to check to see if ARRAY_NODE really had array type.
1029      However, with the new verifier, this is not necessary, as we know
1030      that the object will be an array of the appropriate type.  */
1031
1032   return indexed_type;
1033 }
1034
1035 /* newarray triggers a call to _Jv_NewPrimArray. This function should be
1036    called with an integer code (the type of array to create), and the length
1037    of the array to create.  */
1038
1039 tree
1040 build_newarray (int atype_value, tree length)
1041 {
1042   tree type_arg;
1043
1044   tree prim_type = decode_newarray_type (atype_value);
1045   tree type
1046     = build_java_array_type (prim_type,
1047                              host_integerp (length, 0) == INTEGER_CST
1048                              ? tree_low_cst (length, 0) : -1);
1049
1050   /* Pass a reference to the primitive type class and save the runtime
1051      some work.  */
1052   type_arg = build_class_ref (prim_type);
1053
1054   return build_call_nary (promote_type (type),
1055                           build_address_of (soft_newarray_node),
1056                           2, type_arg, length);
1057 }
1058
1059 /* Generates anewarray from a given CLASS_TYPE. Gets from the stack the size
1060    of the dimension. */
1061
1062 tree
1063 build_anewarray (tree class_type, tree length)
1064 {
1065   tree type
1066     = build_java_array_type (class_type,
1067                              host_integerp (length, 0)
1068                              ? tree_low_cst (length, 0) : -1);
1069
1070   return build_call_nary (promote_type (type),
1071                           build_address_of (soft_anewarray_node),
1072                           3,
1073                           length,
1074                           build_class_ref (class_type),
1075                           null_pointer_node);
1076 }
1077
1078 /* Return a node the evaluates 'new TYPE[LENGTH]'. */
1079
1080 tree
1081 build_new_array (tree type, tree length)
1082 {
1083   if (JPRIMITIVE_TYPE_P (type))
1084     return build_newarray (encode_newarray_type (type), length);
1085   else
1086     return build_anewarray (TREE_TYPE (type), length);
1087 }
1088
1089 /* Generates a call to _Jv_NewMultiArray. multianewarray expects a
1090    class pointer, a number of dimensions and the matching number of
1091    dimensions. The argument list is NULL terminated.  */
1092
1093 static void
1094 expand_java_multianewarray (tree class_type, int ndim)
1095 {
1096   int i;
1097   VEC(tree,gc) *args = NULL;
1098
1099   VEC_safe_grow (tree, gc, args, 3 + ndim);
1100
1101   VEC_replace (tree, args, 0, build_class_ref (class_type));
1102   VEC_replace (tree, args, 1, build_int_cst (NULL_TREE, ndim));
1103
1104   for(i = ndim - 1; i >= 0; i-- )
1105     VEC_replace (tree, args, (unsigned)(2 + i), pop_value (int_type_node));
1106
1107   VEC_replace (tree, args, 2 + ndim, null_pointer_node);
1108
1109   push_value (build_call_vec (promote_type (class_type),
1110                               build_address_of (soft_multianewarray_node),
1111                               args));
1112 }
1113
1114 /*  ARRAY[INDEX] <- RHS. build_java_check_indexed_type makes sure that
1115     ARRAY is an array type. May expand some bound checking and NULL
1116     pointer checking. RHS_TYPE_NODE we are going to store. In the case
1117     of the CHAR/BYTE/BOOLEAN SHORT, the type popped of the stack is an
1118     INT. In those cases, we make the conversion.
1119
1120     if ARRAy is a reference type, the assignment is checked at run-time
1121     to make sure that the RHS can be assigned to the array element
1122     type. It is not necessary to generate this code if ARRAY is final.  */
1123
1124 static void
1125 expand_java_arraystore (tree rhs_type_node)
1126 {
1127   tree rhs_node    = pop_value ((INTEGRAL_TYPE_P (rhs_type_node)
1128                                  && TYPE_PRECISION (rhs_type_node) <= 32) ?
1129                                  int_type_node : rhs_type_node);
1130   tree index = pop_value (int_type_node);
1131   tree array_type, array, temp, access;
1132
1133   /* If we're processing an `aaload' we might as well just pick
1134      `Object'.  */
1135   if (TREE_CODE (rhs_type_node) == POINTER_TYPE)
1136     {
1137       array_type = build_java_array_type (object_ptr_type_node, -1);
1138       rhs_type_node = object_ptr_type_node;
1139     }
1140   else
1141     array_type = build_java_array_type (rhs_type_node, -1);
1142
1143   array = pop_value (array_type);
1144   array = build1 (NOP_EXPR, promote_type (array_type), array);
1145
1146   rhs_type_node    = build_java_check_indexed_type (array, rhs_type_node);
1147
1148   flush_quick_stack ();
1149
1150   index = save_expr (index);
1151   array = save_expr (array);
1152
1153   /* We want to perform the bounds check (done by
1154      build_java_arrayaccess) before the type check (done by
1155      build_java_arraystore_check).  So, we call build_java_arrayaccess
1156      -- which returns an ARRAY_REF lvalue -- and we then generate code
1157      to stash the address of that lvalue in a temp.  Then we call
1158      build_java_arraystore_check, and finally we generate a
1159      MODIFY_EXPR to set the array element.  */
1160
1161   access = build_java_arrayaccess (array, rhs_type_node, index);
1162   temp = build_decl (input_location, VAR_DECL, NULL_TREE,
1163                      build_pointer_type (TREE_TYPE (access)));
1164   java_add_local_var (temp);
1165   java_add_stmt (build2 (MODIFY_EXPR, TREE_TYPE (temp),
1166                          temp,
1167                          build_fold_addr_expr (access)));
1168
1169   if (TREE_CODE (rhs_type_node) == POINTER_TYPE)
1170     {
1171       tree check = build_java_arraystore_check (array, rhs_node);
1172       java_add_stmt (check);
1173     }
1174
1175   java_add_stmt (build2 (MODIFY_EXPR, TREE_TYPE (access),
1176                          build1 (INDIRECT_REF, TREE_TYPE (access), temp),
1177                          rhs_node));
1178 }
1179
1180 /* Expand the evaluation of ARRAY[INDEX]. build_java_check_indexed_type makes
1181    sure that LHS is an array type. May expand some bound checking and NULL
1182    pointer checking.
1183    LHS_TYPE_NODE is the type of ARRAY[INDEX]. But in the case of CHAR/BYTE/
1184    BOOLEAN/SHORT, we push a promoted type back to the stack.
1185 */
1186
1187 static void
1188 expand_java_arrayload (tree lhs_type_node)
1189 {
1190   tree load_node;
1191   tree index_node = pop_value (int_type_node);
1192   tree array_type;
1193   tree array_node;
1194
1195   /* If we're processing an `aaload' we might as well just pick
1196      `Object'.  */
1197   if (TREE_CODE (lhs_type_node) == POINTER_TYPE)
1198     {
1199       array_type = build_java_array_type (object_ptr_type_node, -1);
1200       lhs_type_node = object_ptr_type_node;
1201     }
1202   else
1203     array_type = build_java_array_type (lhs_type_node, -1);
1204   array_node = pop_value (array_type);
1205   array_node = build1 (NOP_EXPR, promote_type (array_type), array_node);
1206
1207   index_node = save_expr (index_node);
1208   array_node = save_expr (array_node);
1209
1210   lhs_type_node = build_java_check_indexed_type (array_node,
1211                                                  lhs_type_node);
1212   load_node = build_java_arrayaccess (array_node,
1213                                       lhs_type_node,
1214                                       index_node);
1215   if (INTEGRAL_TYPE_P (lhs_type_node) && TYPE_PRECISION (lhs_type_node) <= 32)
1216     load_node = fold_build1 (NOP_EXPR, int_type_node, load_node);
1217   push_value (load_node);
1218 }
1219
1220 /* Expands .length. Makes sure that we deal with and array and may expand
1221    a NULL check on the array object.  */
1222
1223 static void
1224 expand_java_array_length (void)
1225 {
1226   tree array  = pop_value (ptr_type_node);
1227   tree length = build_java_array_length_access (array);
1228
1229   push_value (length);
1230 }
1231
1232 /* Emit code for the call to _Jv_Monitor{Enter,Exit}. CALL can be
1233    either soft_monitorenter_node or soft_monitorexit_node.  */
1234
1235 static tree
1236 build_java_monitor (tree call, tree object)
1237 {
1238   return build_call_nary (void_type_node,
1239                           build_address_of (call),
1240                           1, object);
1241 }
1242
1243 /* Emit code for one of the PUSHC instructions. */
1244
1245 static void
1246 expand_java_pushc (int ival, tree type)
1247 {
1248   tree value;
1249   if (type == ptr_type_node && ival == 0)
1250     value = null_pointer_node;
1251   else if (type == int_type_node || type == long_type_node)
1252     value = build_int_cst (type, ival);
1253   else if (type == float_type_node || type == double_type_node)
1254     {
1255       REAL_VALUE_TYPE x;
1256       REAL_VALUE_FROM_INT (x, ival, 0, TYPE_MODE (type));
1257       value = build_real (type, x);
1258     }
1259   else
1260     gcc_unreachable ();
1261
1262   push_value (value);
1263 }
1264
1265 static void
1266 expand_java_return (tree type)
1267 {
1268   if (type == void_type_node)
1269     java_add_stmt (build1 (RETURN_EXPR, void_type_node, NULL));
1270   else
1271     {
1272       tree retval = pop_value (type);
1273       tree res = DECL_RESULT (current_function_decl);
1274       retval = build2 (MODIFY_EXPR, TREE_TYPE (res), res, retval);
1275
1276       /* Handle the situation where the native integer type is smaller
1277          than the JVM integer. It can happen for many cross compilers.
1278          The whole if expression just goes away if INT_TYPE_SIZE < 32
1279          is false. */
1280       if (INT_TYPE_SIZE < 32
1281           && (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (res)))
1282               < GET_MODE_SIZE (TYPE_MODE (type))))
1283         retval = build1(NOP_EXPR, TREE_TYPE(res), retval);
1284
1285       TREE_SIDE_EFFECTS (retval) = 1;
1286       java_add_stmt (build1 (RETURN_EXPR, void_type_node, retval));
1287     }
1288 }
1289
1290 static void
1291 expand_load_internal (int index, tree type, int pc)
1292 {
1293   tree copy;
1294   tree var = find_local_variable (index, type, pc);
1295
1296   /* Now VAR is the VAR_DECL (or PARM_DECL) that we are going to push
1297      on the stack.  If there is an assignment to this VAR_DECL between
1298      the stack push and the use, then the wrong code could be
1299      generated.  To avoid this we create a new local and copy our
1300      value into it.  Then we push this new local on the stack.
1301      Hopefully this all gets optimized out.  */
1302   copy = build_decl (input_location, VAR_DECL, NULL_TREE, type);
1303   if ((INTEGRAL_TYPE_P (type) || POINTER_TYPE_P (type))
1304       && TREE_TYPE (copy) != TREE_TYPE (var))
1305     var = convert (type, var);
1306   java_add_local_var (copy);
1307   java_add_stmt (build2 (MODIFY_EXPR, TREE_TYPE (var), copy, var));
1308
1309   push_value (copy);
1310 }
1311
1312 tree
1313 build_address_of (tree value)
1314 {
1315   return build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (value)), value);
1316 }
1317
1318 bool
1319 class_has_finalize_method (tree type)
1320 {
1321   tree super = CLASSTYPE_SUPER (type);
1322
1323   if (super == NULL_TREE)
1324     return false;       /* Every class with a real finalizer inherits   */
1325                         /* from java.lang.Object.                       */
1326   else
1327     return HAS_FINALIZER_P (type) || class_has_finalize_method (super);
1328 }
1329
1330 tree
1331 java_create_object (tree type)
1332 {
1333   tree alloc_node = (class_has_finalize_method (type)
1334                      ? alloc_object_node
1335                      : alloc_no_finalizer_node);
1336
1337   return build_call_nary (promote_type (type),
1338                           build_address_of (alloc_node),
1339                           1, build_class_ref (type));
1340 }
1341
1342 static void
1343 expand_java_NEW (tree type)
1344 {
1345   tree alloc_node;
1346
1347   alloc_node = (class_has_finalize_method (type) ? alloc_object_node
1348                                                  : alloc_no_finalizer_node);
1349   if (! CLASS_LOADED_P (type))
1350     load_class (type, 1);
1351   safe_layout_class (type);
1352   push_value (build_call_nary (promote_type (type),
1353                                build_address_of (alloc_node),
1354                                1, build_class_ref (type)));
1355 }
1356
1357 /* This returns an expression which will extract the class of an
1358    object.  */
1359
1360 tree
1361 build_get_class (tree value)
1362 {
1363   tree class_field = lookup_field (&dtable_type, get_identifier ("class"));
1364   tree vtable_field = lookup_field (&object_type_node,
1365                                     get_identifier ("vtable"));
1366   tree tmp = build3 (COMPONENT_REF, dtable_ptr_type,
1367                      build_java_indirect_ref (object_type_node, value,
1368                                               flag_check_references),
1369                      vtable_field, NULL_TREE);
1370   return build3 (COMPONENT_REF, class_ptr_type,
1371                  build1 (INDIRECT_REF, dtable_type, tmp),
1372                  class_field, NULL_TREE);
1373 }
1374
1375 /* This builds the tree representation of the `instanceof' operator.
1376    It tries various tricks to optimize this in cases where types are
1377    known.  */
1378
1379 tree
1380 build_instanceof (tree value, tree type)
1381 {
1382   tree expr;
1383   tree itype = TREE_TYPE (TREE_TYPE (soft_instanceof_node));
1384   tree valtype = TREE_TYPE (TREE_TYPE (value));
1385   tree valclass = TYPE_NAME (valtype);
1386   tree klass;
1387
1388   /* When compiling from bytecode, we need to ensure that TYPE has
1389      been loaded.  */
1390   if (CLASS_P (type) && ! CLASS_LOADED_P (type))
1391     {
1392       load_class (type, 1);
1393       safe_layout_class (type);
1394       if (! TYPE_SIZE (type) || TREE_CODE (TYPE_SIZE (type)) == ERROR_MARK)
1395         return error_mark_node;
1396     }
1397   klass = TYPE_NAME (type);
1398
1399   if (type == object_type_node || inherits_from_p (valtype, type))
1400     {
1401       /* Anything except `null' is an instance of Object.  Likewise,
1402          if the object is known to be an instance of the class, then
1403          we only need to check for `null'.  */
1404       expr = build2 (NE_EXPR, itype, value, null_pointer_node);
1405     }
1406   else if (flag_verify_invocations
1407            && ! TYPE_ARRAY_P (type)
1408            && ! TYPE_ARRAY_P (valtype)
1409            && DECL_P (klass) && DECL_P (valclass)
1410            && ! CLASS_INTERFACE (valclass)
1411            && ! CLASS_INTERFACE (klass)
1412            && ! inherits_from_p (type, valtype)
1413            && (CLASS_FINAL (klass)
1414                || ! inherits_from_p (valtype, type)))
1415     {
1416       /* The classes are from different branches of the derivation
1417          tree, so we immediately know the answer.  */
1418       expr = boolean_false_node;
1419     }
1420   else if (DECL_P (klass) && CLASS_FINAL (klass))
1421     {
1422       tree save = save_expr (value);
1423       expr = build3 (COND_EXPR, itype,
1424                      build2 (NE_EXPR, boolean_type_node,
1425                              save, null_pointer_node),
1426                      build2 (EQ_EXPR, itype,
1427                              build_get_class (save),
1428                              build_class_ref (type)),
1429                      boolean_false_node);
1430     }
1431   else
1432     {
1433       expr = build_call_nary (itype,
1434                               build_address_of (soft_instanceof_node),
1435                               2, value, build_class_ref (type));
1436     }
1437   TREE_SIDE_EFFECTS (expr) = TREE_SIDE_EFFECTS (value);
1438   return expr;
1439 }
1440
1441 static void
1442 expand_java_INSTANCEOF (tree type)
1443 {
1444   tree value = pop_value (object_ptr_type_node);
1445   value = build_instanceof (value, type);
1446   push_value (value);
1447 }
1448
1449 static void
1450 expand_java_CHECKCAST (tree type)
1451 {
1452   tree value = pop_value (ptr_type_node);
1453   value = build_call_nary (promote_type (type),
1454                            build_address_of (soft_checkcast_node),
1455                            2, build_class_ref (type), value);
1456   push_value (value);
1457 }
1458
1459 static void
1460 expand_iinc (unsigned int local_var_index, int ival, int pc)
1461 {
1462   tree local_var, res;
1463   tree constant_value;
1464
1465   flush_quick_stack ();
1466   local_var = find_local_variable (local_var_index, int_type_node, pc);
1467   constant_value = build_int_cst (NULL_TREE, ival);
1468   res = fold_build2 (PLUS_EXPR, int_type_node, local_var, constant_value);
1469   java_add_stmt (build2 (MODIFY_EXPR, TREE_TYPE (local_var), local_var, res));
1470 }
1471
1472
1473 tree
1474 build_java_soft_divmod (enum tree_code op, tree type, tree op1, tree op2)
1475 {
1476   tree call = NULL;
1477   tree arg1 = convert (type, op1);
1478   tree arg2 = convert (type, op2);
1479
1480   if (type == int_type_node)
1481     {
1482       switch (op)
1483         {
1484         case TRUNC_DIV_EXPR:
1485           call = soft_idiv_node;
1486           break;
1487         case TRUNC_MOD_EXPR:
1488           call = soft_irem_node;
1489           break;
1490         default:
1491           break;
1492         }
1493     }
1494   else if (type == long_type_node)
1495     {
1496       switch (op)
1497         {
1498         case TRUNC_DIV_EXPR:
1499           call = soft_ldiv_node;
1500           break;
1501         case TRUNC_MOD_EXPR:
1502           call = soft_lrem_node;
1503           break;
1504         default:
1505           break;
1506         }
1507     }
1508
1509   gcc_assert (call);
1510   call = build_call_nary (type, build_address_of (call), 2, arg1, arg2);
1511   return call;
1512 }
1513
1514 tree
1515 build_java_binop (enum tree_code op, tree type, tree arg1, tree arg2)
1516 {
1517   tree mask;
1518   switch (op)
1519     {
1520     case URSHIFT_EXPR:
1521       {
1522         tree u_type = unsigned_type_for (type);
1523         arg1 = convert (u_type, arg1);
1524         arg1 = build_java_binop (RSHIFT_EXPR, u_type, arg1, arg2);
1525         return convert (type, arg1);
1526       }
1527     case LSHIFT_EXPR:
1528     case RSHIFT_EXPR:
1529       mask = build_int_cst (NULL_TREE,
1530                             TYPE_PRECISION (TREE_TYPE (arg1)) - 1);
1531       arg2 = fold_build2 (BIT_AND_EXPR, int_type_node, arg2, mask);
1532       break;
1533
1534     case COMPARE_L_EXPR:  /* arg1 > arg2 ?  1 : arg1 == arg2 ? 0 : -1 */
1535     case COMPARE_G_EXPR:  /* arg1 < arg2 ? -1 : arg1 == arg2 ? 0 :  1 */
1536       arg1 = save_expr (arg1);  arg2 = save_expr (arg2);
1537       {
1538         tree ifexp1 = fold_build2 (op == COMPARE_L_EXPR ? GT_EXPR : LT_EXPR,
1539                                    boolean_type_node, arg1, arg2);
1540         tree ifexp2 = fold_build2 (EQ_EXPR, boolean_type_node, arg1, arg2);
1541         tree second_compare = fold_build3 (COND_EXPR, int_type_node,
1542                                            ifexp2, integer_zero_node,
1543                                            op == COMPARE_L_EXPR
1544                                            ? integer_minus_one_node
1545                                            : integer_one_node);
1546         return fold_build3 (COND_EXPR, int_type_node, ifexp1,
1547                             op == COMPARE_L_EXPR ? integer_one_node
1548                             : integer_minus_one_node,
1549                             second_compare);
1550       }
1551     case COMPARE_EXPR:
1552       arg1 = save_expr (arg1);  arg2 = save_expr (arg2);
1553       {
1554         tree ifexp1 = fold_build2 (LT_EXPR, boolean_type_node, arg1, arg2);
1555         tree ifexp2 = fold_build2 (GT_EXPR, boolean_type_node, arg1, arg2);
1556         tree second_compare = fold_build3 (COND_EXPR, int_type_node,
1557                                            ifexp2, integer_one_node,
1558                                            integer_zero_node);
1559         return fold_build3 (COND_EXPR, int_type_node,
1560                             ifexp1, integer_minus_one_node, second_compare);
1561       }
1562     case TRUNC_DIV_EXPR:
1563     case TRUNC_MOD_EXPR:
1564       if (TREE_CODE (type) == REAL_TYPE
1565           && op == TRUNC_MOD_EXPR)
1566         {
1567           tree call;
1568           if (type != double_type_node)
1569             {
1570               arg1 = convert (double_type_node, arg1);
1571               arg2 = convert (double_type_node, arg2);
1572             }
1573           call = build_call_nary (double_type_node,
1574                                   build_address_of (soft_fmod_node),
1575                                   2, arg1, arg2);
1576           if (type != double_type_node)
1577             call = convert (type, call);
1578           return call;
1579         }
1580
1581       if (TREE_CODE (type) == INTEGER_TYPE
1582           && flag_use_divide_subroutine
1583           && ! flag_syntax_only)
1584         return build_java_soft_divmod (op, type, arg1, arg2);
1585
1586       break;
1587     default:  ;
1588     }
1589   return fold_build2 (op, type, arg1, arg2);
1590 }
1591
1592 static void
1593 expand_java_binop (tree type, enum tree_code op)
1594 {
1595   tree larg, rarg;
1596   tree ltype = type;
1597   tree rtype = type;
1598   switch (op)
1599     {
1600     case LSHIFT_EXPR:
1601     case RSHIFT_EXPR:
1602     case URSHIFT_EXPR:
1603       rtype = int_type_node;
1604       rarg = pop_value (rtype);
1605       break;
1606     default:
1607       rarg = pop_value (rtype);
1608     }
1609   larg = pop_value (ltype);
1610   push_value (build_java_binop (op, type, larg, rarg));
1611 }
1612
1613 /* Lookup the field named NAME in *TYPEP or its super classes.
1614    If not found, return NULL_TREE.
1615    (If the *TYPEP is not found, or if the field reference is
1616    ambiguous, return error_mark_node.)
1617    If found, return the FIELD_DECL, and set *TYPEP to the
1618    class containing the field. */
1619
1620 tree
1621 lookup_field (tree *typep, tree name)
1622 {
1623   if (CLASS_P (*typep) && !CLASS_LOADED_P (*typep))
1624     {
1625       load_class (*typep, 1);
1626       safe_layout_class (*typep);
1627       if (!TYPE_SIZE (*typep) || TREE_CODE (TYPE_SIZE (*typep)) == ERROR_MARK)
1628         return error_mark_node;
1629     }
1630   do
1631     {
1632       tree field, binfo, base_binfo;
1633       tree save_field;
1634       int i;
1635
1636       for (field = TYPE_FIELDS (*typep); field; field = DECL_CHAIN (field))
1637         if (DECL_NAME (field) == name)
1638           return field;
1639
1640       /* Process implemented interfaces. */
1641       save_field = NULL_TREE;
1642       for (binfo = TYPE_BINFO (*typep), i = 0;
1643            BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
1644         {
1645           tree t = BINFO_TYPE (base_binfo);
1646           if ((field = lookup_field (&t, name)))
1647             {
1648               if (save_field == field)
1649                 continue;
1650               if (save_field == NULL_TREE)
1651                 save_field = field;
1652               else
1653                 {
1654                   tree i1 = DECL_CONTEXT (save_field);
1655                   tree i2 = DECL_CONTEXT (field);
1656                   error ("reference %qs is ambiguous: appears in interface %qs and interface %qs",
1657                          IDENTIFIER_POINTER (name),
1658                          IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (i1))),
1659                          IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (i2))));
1660                   return error_mark_node;
1661                 }
1662             }
1663         }
1664
1665       if (save_field != NULL_TREE)
1666         return save_field;
1667
1668       *typep = CLASSTYPE_SUPER (*typep);
1669     } while (*typep);
1670   return NULL_TREE;
1671 }
1672
1673 /* Look up the field named NAME in object SELF_VALUE,
1674    which has class SELF_CLASS (a non-handle RECORD_TYPE).
1675    SELF_VALUE is NULL_TREE if looking for a static field. */
1676
1677 tree
1678 build_field_ref (tree self_value, tree self_class, tree name)
1679 {
1680   tree base_class = self_class;
1681   tree field_decl = lookup_field (&base_class, name);
1682   if (field_decl == NULL_TREE)
1683     {
1684       error ("field %qs not found", IDENTIFIER_POINTER (name));
1685       return error_mark_node;
1686     }
1687   if (self_value == NULL_TREE)
1688     {
1689       return build_static_field_ref (field_decl);
1690     }
1691   else
1692     {
1693       tree base_type = promote_type (base_class);
1694
1695       /* CHECK is true if self_value is not the this pointer.  */
1696       int check = (! (DECL_P (self_value)
1697                       && DECL_NAME (self_value) == this_identifier_node));
1698
1699       /* Determine whether a field offset from NULL will lie within
1700          Page 0: this is necessary on those GNU/Linux/BSD systems that
1701          trap SEGV to generate NullPointerExceptions.
1702
1703          We assume that Page 0 will be mapped with NOPERM, and that
1704          memory may be allocated from any other page, so only field
1705          offsets < pagesize are guaranteed to trap.  We also assume
1706          the smallest page size we'll encounter is 4k bytes.  */
1707       if (! flag_syntax_only && check && ! flag_check_references
1708           && ! flag_indirect_dispatch)
1709         {
1710           tree field_offset = byte_position (field_decl);
1711           if (! page_size)
1712             page_size = size_int (4096);
1713           check = ! INT_CST_LT_UNSIGNED (field_offset, page_size);
1714         }
1715
1716       if (base_type != TREE_TYPE (self_value))
1717         self_value = fold_build1 (NOP_EXPR, base_type, self_value);
1718       if (! flag_syntax_only && flag_indirect_dispatch)
1719         {
1720           tree otable_index
1721             = build_int_cst (NULL_TREE, get_symbol_table_index
1722                              (field_decl, NULL_TREE,
1723                               &TYPE_OTABLE_METHODS (output_class)));
1724           tree field_offset
1725             = build4 (ARRAY_REF, integer_type_node,
1726                       TYPE_OTABLE_DECL (output_class), otable_index,
1727                       NULL_TREE, NULL_TREE);
1728           tree address;
1729
1730           if (DECL_CONTEXT (field_decl) != output_class)
1731             field_offset
1732               = build3 (COND_EXPR, TREE_TYPE (field_offset),
1733                         build2 (EQ_EXPR, boolean_type_node,
1734                                 field_offset, integer_zero_node),
1735                         build_call_nary (void_type_node,
1736                                          build_address_of (soft_nosuchfield_node),
1737                                          1, otable_index),
1738                         field_offset);
1739
1740           field_offset = fold (convert (sizetype, field_offset));
1741           self_value = java_check_reference (self_value, check);
1742           address
1743             = fold_build2 (POINTER_PLUS_EXPR,
1744                            TREE_TYPE (self_value),
1745                            self_value, field_offset);
1746           address = fold_convert (build_pointer_type (TREE_TYPE (field_decl)),
1747                                   address);
1748           return fold_build1 (INDIRECT_REF, TREE_TYPE (field_decl), address);
1749         }
1750
1751       self_value = build_java_indirect_ref (TREE_TYPE (TREE_TYPE (self_value)),
1752                                             self_value, check);
1753       return fold_build3 (COMPONENT_REF, TREE_TYPE (field_decl),
1754                           self_value, field_decl, NULL_TREE);
1755     }
1756 }
1757
1758 tree
1759 lookup_label (int pc)
1760 {
1761   tree name;
1762   char buf[32];
1763   if (pc > highest_label_pc_this_method)
1764     highest_label_pc_this_method = pc;
1765   targetm.asm_out.generate_internal_label (buf, "LJpc=",
1766                                            start_label_pc_this_method + pc);
1767   name = get_identifier (buf);
1768   if (IDENTIFIER_LOCAL_VALUE (name))
1769     return IDENTIFIER_LOCAL_VALUE (name);
1770   else
1771     {
1772       /* The type of the address of a label is return_address_type_node. */
1773       tree decl = create_label_decl (name);
1774       return pushdecl (decl);
1775     }
1776 }
1777
1778 /* Generate a unique name for the purpose of loops and switches
1779    labels, and try-catch-finally blocks label or temporary variables.  */
1780
1781 tree
1782 generate_name (void)
1783 {
1784   static int l_number = 0;
1785   char buff [32];
1786   targetm.asm_out.generate_internal_label (buff, "LJv", l_number);
1787   l_number++;
1788   return get_identifier (buff);
1789 }
1790
1791 tree
1792 create_label_decl (tree name)
1793 {
1794   tree decl;
1795   decl = build_decl (input_location, LABEL_DECL, name,
1796                      TREE_TYPE (return_address_type_node));
1797   DECL_CONTEXT (decl) = current_function_decl;
1798   DECL_IGNORED_P (decl) = 1;
1799   return decl;
1800 }
1801
1802 /* This maps a bytecode offset (PC) to various flags.  */
1803 char *instruction_bits;
1804
1805 /* This is a vector of type states for the current method.  It is
1806    indexed by PC.  Each element is a tree vector holding the type
1807    state at that PC.  We only note type states at basic block
1808    boundaries.  */
1809 VEC(tree, gc) *type_states;
1810
1811 static void
1812 note_label (int current_pc ATTRIBUTE_UNUSED, int target_pc)
1813 {
1814   lookup_label (target_pc);
1815   instruction_bits [target_pc] |= BCODE_JUMP_TARGET;
1816 }
1817
1818 /* Emit code to jump to TARGET_PC if VALUE1 CONDITION VALUE2,
1819    where CONDITION is one of one the compare operators. */
1820
1821 static void
1822 expand_compare (enum tree_code condition, tree value1, tree value2,
1823                 int target_pc)
1824 {
1825   tree target = lookup_label (target_pc);
1826   tree cond = fold_build2 (condition, boolean_type_node, value1, value2);
1827   java_add_stmt
1828     (build3 (COND_EXPR, void_type_node, java_truthvalue_conversion (cond),
1829              build1 (GOTO_EXPR, void_type_node, target),
1830              build_java_empty_stmt ()));
1831 }
1832
1833 /* Emit code for a TEST-type opcode. */
1834
1835 static void
1836 expand_test (enum tree_code condition, tree type, int target_pc)
1837 {
1838   tree value1, value2;
1839   flush_quick_stack ();
1840   value1 = pop_value (type);
1841   value2 = (type == ptr_type_node) ? null_pointer_node : integer_zero_node;
1842   expand_compare (condition, value1, value2, target_pc);
1843 }
1844
1845 /* Emit code for a COND-type opcode. */
1846
1847 static void
1848 expand_cond (enum tree_code condition, tree type, int target_pc)
1849 {
1850   tree value1, value2;
1851   flush_quick_stack ();
1852   /* note: pop values in opposite order */
1853   value2 = pop_value (type);
1854   value1 = pop_value (type);
1855   /* Maybe should check value1 and value2 for type compatibility ??? */
1856   expand_compare (condition, value1, value2, target_pc);
1857 }
1858
1859 static void
1860 expand_java_goto (int target_pc)
1861 {
1862   tree target_label = lookup_label (target_pc);
1863   flush_quick_stack ();
1864   java_add_stmt (build1 (GOTO_EXPR, void_type_node, target_label));
1865 }
1866
1867 static tree
1868 expand_java_switch (tree selector, int default_pc)
1869 {
1870   tree switch_expr, x;
1871
1872   flush_quick_stack ();
1873   switch_expr = build3 (SWITCH_EXPR, TREE_TYPE (selector), selector,
1874                         NULL_TREE, NULL_TREE);
1875   java_add_stmt (switch_expr);
1876
1877   x = build3 (CASE_LABEL_EXPR, void_type_node, NULL_TREE, NULL_TREE,
1878               create_artificial_label (input_location));
1879   append_to_statement_list (x, &SWITCH_BODY (switch_expr));
1880
1881   x = build1 (GOTO_EXPR, void_type_node, lookup_label (default_pc));
1882   append_to_statement_list (x, &SWITCH_BODY (switch_expr));
1883
1884   return switch_expr;
1885 }
1886
1887 static void
1888 expand_java_add_case (tree switch_expr, int match, int target_pc)
1889 {
1890   tree value, x;
1891
1892   value = build_int_cst (TREE_TYPE (switch_expr), match);
1893
1894   x = build3 (CASE_LABEL_EXPR, void_type_node, value, NULL_TREE,
1895               create_artificial_label (input_location));
1896   append_to_statement_list (x, &SWITCH_BODY (switch_expr));
1897
1898   x = build1 (GOTO_EXPR, void_type_node, lookup_label (target_pc));
1899   append_to_statement_list (x, &SWITCH_BODY (switch_expr));
1900 }
1901
1902 static VEC(tree,gc) *
1903 pop_arguments (tree method_type)
1904 {
1905   function_args_iterator fnai;
1906   tree type;
1907   VEC(tree,gc) *args = NULL;
1908   int arity;
1909
1910   FOREACH_FUNCTION_ARGS (method_type, type, fnai)
1911     {
1912       /* XXX: leaky abstraction.  */
1913       if (type == void_type_node)
1914         break;
1915
1916       VEC_safe_push (tree, gc, args, type);
1917     }
1918
1919   arity = VEC_length (tree, args);
1920
1921   while (arity--)
1922     {
1923       tree arg = pop_value (VEC_index (tree, args, arity));
1924
1925       /* We simply cast each argument to its proper type.  This is
1926          needed since we lose type information coming out of the
1927          verifier.  We also have to do this when we pop an integer
1928          type that must be promoted for the function call.  */
1929       if (TREE_CODE (type) == POINTER_TYPE)
1930         arg = build1 (NOP_EXPR, type, arg);
1931       else if (targetm.calls.promote_prototypes (type)
1932                && TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node)
1933                && INTEGRAL_TYPE_P (type))
1934         arg = convert (integer_type_node, arg);
1935
1936       VEC_replace (tree, args, arity, arg);
1937     }
1938
1939   return args;
1940 }
1941
1942 /* Attach to PTR (a block) the declaration found in ENTRY. */
1943
1944 int
1945 attach_init_test_initialization_flags (void **entry, void *ptr)
1946 {
1947   tree block = (tree)ptr;
1948   struct treetreehash_entry *ite = (struct treetreehash_entry *) *entry;
1949
1950   if (block != error_mark_node)
1951     {
1952       if (TREE_CODE (block) == BIND_EXPR)
1953         {
1954           tree body = BIND_EXPR_BODY (block);
1955           DECL_CHAIN (ite->value) = BIND_EXPR_VARS (block);
1956           BIND_EXPR_VARS (block) = ite->value;
1957           body = build2 (COMPOUND_EXPR, void_type_node,
1958                          build1 (DECL_EXPR, void_type_node, ite->value), body);
1959           BIND_EXPR_BODY (block) = body;
1960         }
1961       else
1962         {
1963           tree body = BLOCK_SUBBLOCKS (block);
1964           TREE_CHAIN (ite->value) = BLOCK_EXPR_DECLS (block);
1965           BLOCK_EXPR_DECLS (block) = ite->value;
1966           body = build2 (COMPOUND_EXPR, void_type_node,
1967                          build1 (DECL_EXPR, void_type_node, ite->value), body);
1968           BLOCK_SUBBLOCKS (block) = body;
1969         }
1970
1971     }
1972   return true;
1973 }
1974
1975 /* Build an expression to initialize the class CLAS.
1976    if EXPR is non-NULL, returns an expression to first call the initializer
1977    (if it is needed) and then calls EXPR. */
1978
1979 tree
1980 build_class_init (tree clas, tree expr)
1981 {
1982   tree init;
1983
1984   /* An optimization: if CLAS is a superclass of the class we're
1985      compiling, we don't need to initialize it.  However, if CLAS is
1986      an interface, it won't necessarily be initialized, even if we
1987      implement it.  */
1988   if ((! CLASS_INTERFACE (TYPE_NAME (clas))
1989        && inherits_from_p (current_class, clas))
1990       || current_class == clas)
1991     return expr;
1992
1993   if (always_initialize_class_p)
1994     {
1995       init = build_call_nary (void_type_node,
1996                               build_address_of (soft_initclass_node),
1997                               1, build_class_ref (clas));
1998       TREE_SIDE_EFFECTS (init) = 1;
1999     }
2000   else
2001     {
2002       tree *init_test_decl;
2003       tree decl;
2004       init_test_decl = java_treetreehash_new
2005         (DECL_FUNCTION_INIT_TEST_TABLE (current_function_decl), clas);
2006
2007       if (*init_test_decl == NULL)
2008         {
2009           /* Build a declaration and mark it as a flag used to track
2010              static class initializations. */
2011           decl = build_decl (input_location, VAR_DECL, NULL_TREE,
2012                              boolean_type_node);
2013           MAYBE_CREATE_VAR_LANG_DECL_SPECIFIC (decl);
2014           DECL_CONTEXT (decl) = current_function_decl;
2015           DECL_INITIAL (decl) = boolean_false_node;
2016           /* Don't emit any symbolic debugging info for this decl.  */
2017           DECL_IGNORED_P (decl) = 1;
2018           *init_test_decl = decl;
2019         }
2020
2021       init = build_call_nary (void_type_node,
2022                               build_address_of (soft_initclass_node),
2023                               1, build_class_ref (clas));
2024       TREE_SIDE_EFFECTS (init) = 1;
2025       init = build3 (COND_EXPR, void_type_node,
2026                      build2 (EQ_EXPR, boolean_type_node,
2027                              *init_test_decl, boolean_false_node),
2028                      init, integer_zero_node);
2029       TREE_SIDE_EFFECTS (init) = 1;
2030       init = build2 (COMPOUND_EXPR, TREE_TYPE (expr), init,
2031                      build2 (MODIFY_EXPR, boolean_type_node,
2032                              *init_test_decl, boolean_true_node));
2033       TREE_SIDE_EFFECTS (init) = 1;
2034     }
2035
2036   if (expr != NULL_TREE)
2037     {
2038       expr = build2 (COMPOUND_EXPR, TREE_TYPE (expr), init, expr);
2039       TREE_SIDE_EFFECTS (expr) = 1;
2040       return expr;
2041     }
2042   return init;
2043 }
2044
2045 \f
2046
2047 /* Rewrite expensive calls that require stack unwinding at runtime to
2048    cheaper alternatives.  The logic here performs these
2049    transformations:
2050
2051    java.lang.Class.forName("foo") -> java.lang.Class.forName("foo", class$)
2052    java.lang.Class.getClassLoader() -> java.lang.Class.getClassLoader(class$)
2053
2054 */
2055
2056 typedef struct
2057 {
2058   const char *classname;
2059   const char *method;
2060   const char *signature;
2061   const char *new_classname;
2062   const char *new_signature;
2063   int flags;
2064   void (*rewrite_arglist) (VEC(tree,gc) **);
2065 } rewrite_rule;
2066
2067 /* Add __builtin_return_address(0) to the end of an arglist.  */
2068
2069
2070 static void
2071 rewrite_arglist_getcaller (VEC(tree,gc) **arglist)
2072 {
2073   tree retaddr
2074     = build_call_expr (built_in_decls[BUILT_IN_RETURN_ADDRESS],
2075                        1, integer_zero_node);
2076
2077   DECL_UNINLINABLE (current_function_decl) = 1;
2078
2079   VEC_safe_push (tree, gc, *arglist, retaddr);
2080 }
2081
2082 /* Add this.class to the end of an arglist.  */
2083
2084 static void
2085 rewrite_arglist_getclass (VEC(tree,gc) **arglist)
2086 {
2087   VEC_safe_push (tree, gc, *arglist, build_class_ref (output_class));
2088 }
2089
2090 static rewrite_rule rules[] =
2091   {{"java.lang.Class", "getClassLoader", "()Ljava/lang/ClassLoader;",
2092     "java.lang.Class", "(Ljava/lang/Class;)Ljava/lang/ClassLoader;",
2093     ACC_FINAL|ACC_PRIVATE, rewrite_arglist_getclass},
2094
2095    {"java.lang.Class", "forName", "(Ljava/lang/String;)Ljava/lang/Class;",
2096     "java.lang.Class", "(Ljava/lang/String;Ljava/lang/Class;)Ljava/lang/Class;",
2097     ACC_FINAL|ACC_PRIVATE|ACC_STATIC, rewrite_arglist_getclass},
2098
2099    {"gnu.classpath.VMStackWalker", "getCallingClass", "()Ljava/lang/Class;",
2100     "gnu.classpath.VMStackWalker", "(Lgnu/gcj/RawData;)Ljava/lang/Class;",
2101     ACC_FINAL|ACC_PRIVATE|ACC_STATIC, rewrite_arglist_getcaller},
2102
2103    {"gnu.classpath.VMStackWalker", "getCallingClassLoader",
2104     "()Ljava/lang/ClassLoader;",
2105     "gnu.classpath.VMStackWalker", "(Lgnu/gcj/RawData;)Ljava/lang/ClassLoader;",
2106     ACC_FINAL|ACC_PRIVATE|ACC_STATIC, rewrite_arglist_getcaller},
2107
2108    {"gnu.java.lang.VMCPStringBuilder", "toString", "([CII)Ljava/lang/String;",
2109     "java.lang.String", "([CII)Ljava/lang/String;",
2110     ACC_FINAL|ACC_PRIVATE|ACC_STATIC, NULL},
2111
2112    {NULL, NULL, NULL, NULL, NULL, 0, NULL}};
2113
2114 /* True if this method is special, i.e. it's a private method that
2115    should be exported from a DSO.  */
2116
2117 bool
2118 special_method_p (tree candidate_method)
2119 {
2120   tree context = DECL_NAME (TYPE_NAME (DECL_CONTEXT (candidate_method)));
2121   tree method = DECL_NAME (candidate_method);
2122   rewrite_rule *p;
2123
2124   for (p = rules; p->classname; p++)
2125     {
2126       if (get_identifier (p->classname) == context
2127           && get_identifier (p->method) == method)
2128         return true;
2129     }
2130   return false;
2131 }
2132
2133 /* Scan the rules list for replacements for *METHOD_P and replace the
2134    args accordingly.  If the rewrite results in an access to a private
2135    method, update SPECIAL.*/
2136
2137 void
2138 maybe_rewrite_invocation (tree *method_p, VEC(tree,gc) **arg_list_p,
2139                           tree *method_signature_p, tree *special)
2140 {
2141   tree context = DECL_NAME (TYPE_NAME (DECL_CONTEXT (*method_p)));
2142   rewrite_rule *p;
2143   *special = NULL_TREE;
2144
2145   for (p = rules; p->classname; p++)
2146     {
2147       if (get_identifier (p->classname) == context)
2148         {
2149           tree method = DECL_NAME (*method_p);
2150           if (get_identifier (p->method) == method
2151               && get_identifier (p->signature) == *method_signature_p)
2152             {
2153               tree maybe_method;
2154               tree destination_class
2155                 = lookup_class (get_identifier (p->new_classname));
2156               gcc_assert (destination_class);
2157               maybe_method
2158                 = lookup_java_method (destination_class,
2159                                       method,
2160                                       get_identifier (p->new_signature));
2161               if (! maybe_method && ! flag_verify_invocations)
2162                 {
2163                   maybe_method
2164                     = add_method (destination_class, p->flags,
2165                                   method, get_identifier (p->new_signature));
2166                   DECL_EXTERNAL (maybe_method) = 1;
2167                 }
2168               *method_p = maybe_method;
2169               gcc_assert (*method_p);
2170               if (p->rewrite_arglist)
2171                 p->rewrite_arglist (arg_list_p);
2172               *method_signature_p = get_identifier (p->new_signature);
2173               *special = integer_one_node;
2174
2175               break;
2176             }
2177         }
2178     }
2179 }
2180
2181 \f
2182
2183 tree
2184 build_known_method_ref (tree method, tree method_type ATTRIBUTE_UNUSED,
2185                         tree self_type, tree method_signature ATTRIBUTE_UNUSED,
2186                         VEC(tree,gc) *arg_list ATTRIBUTE_UNUSED, tree special)
2187 {
2188   tree func;
2189   if (is_compiled_class (self_type))
2190     {
2191       /* With indirect dispatch we have to use indirect calls for all
2192          publicly visible methods or gcc will use PLT indirections
2193          to reach them.  We also have to use indirect dispatch for all
2194          external methods.  */
2195       if (! flag_indirect_dispatch
2196           || (! DECL_EXTERNAL (method) && ! TREE_PUBLIC (method)))
2197         {
2198           func = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (method)),
2199                          method);
2200         }
2201       else
2202         {
2203           tree table_index
2204             = build_int_cst (NULL_TREE,
2205                              (get_symbol_table_index
2206                               (method, special,
2207                                &TYPE_ATABLE_METHODS (output_class))));
2208           func
2209             = build4 (ARRAY_REF,
2210                       TREE_TYPE (TREE_TYPE (TYPE_ATABLE_DECL (output_class))),
2211                       TYPE_ATABLE_DECL (output_class), table_index,
2212                       NULL_TREE, NULL_TREE);
2213         }
2214       func = convert (method_ptr_type_node, func);
2215     }
2216   else
2217     {
2218       /* We don't know whether the method has been (statically) compiled.
2219          Compile this code to get a reference to the method's code:
2220
2221          SELF_TYPE->methods[METHOD_INDEX].ncode
2222
2223       */
2224
2225       int method_index = 0;
2226       tree meth, ref;
2227
2228       /* The method might actually be declared in some superclass, so
2229          we have to use its class context, not the caller's notion of
2230          where the method is.  */
2231       self_type = DECL_CONTEXT (method);
2232       ref = build_class_ref (self_type);
2233       ref = build1 (INDIRECT_REF, class_type_node, ref);
2234       if (ncode_ident == NULL_TREE)
2235         ncode_ident = get_identifier ("ncode");
2236       if (methods_ident == NULL_TREE)
2237         methods_ident = get_identifier ("methods");
2238       ref = build3 (COMPONENT_REF, method_ptr_type_node, ref,
2239                     lookup_field (&class_type_node, methods_ident),
2240                     NULL_TREE);
2241       for (meth = TYPE_METHODS (self_type);
2242            ; meth = DECL_CHAIN (meth))
2243         {
2244           if (method == meth)
2245             break;
2246           if (meth == NULL_TREE)
2247             fatal_error ("method '%s' not found in class",
2248                          IDENTIFIER_POINTER (DECL_NAME (method)));
2249           method_index++;
2250         }
2251       method_index *= int_size_in_bytes (method_type_node);
2252       ref = fold_build2 (POINTER_PLUS_EXPR, method_ptr_type_node,
2253                          ref, size_int (method_index));
2254       ref = build1 (INDIRECT_REF, method_type_node, ref);
2255       func = build3 (COMPONENT_REF, nativecode_ptr_type_node,
2256                      ref, lookup_field (&method_type_node, ncode_ident),
2257                      NULL_TREE);
2258     }
2259   return func;
2260 }
2261
2262 tree
2263 invoke_build_dtable (int is_invoke_interface, VEC(tree,gc) *arg_list)
2264 {
2265   tree dtable, objectref;
2266   tree saved = save_expr (VEC_index (tree, arg_list, 0));
2267
2268   VEC_replace (tree, arg_list, 0, saved);
2269
2270   /* If we're dealing with interfaces and if the objectref
2271      argument is an array then get the dispatch table of the class
2272      Object rather than the one from the objectref.  */
2273   objectref = (is_invoke_interface
2274                && is_array_type_p (TREE_TYPE (saved))
2275                ? build_class_ref (object_type_node) : saved);
2276
2277   if (dtable_ident == NULL_TREE)
2278     dtable_ident = get_identifier ("vtable");
2279   dtable = build_java_indirect_ref (object_type_node, objectref,
2280                                     flag_check_references);
2281   dtable = build3 (COMPONENT_REF, dtable_ptr_type, dtable,
2282                    lookup_field (&object_type_node, dtable_ident), NULL_TREE);
2283
2284   return dtable;
2285 }
2286
2287 /* Determine the index in SYMBOL_TABLE for a reference to the decl
2288    T. If this decl has not been seen before, it will be added to the
2289    [oa]table_methods. If it has, the existing table slot will be
2290    reused.  */
2291
2292 int
2293 get_symbol_table_index (tree t, tree special,
2294                         VEC(method_entry,gc) **symbol_table)
2295 {
2296   method_entry *e;
2297   unsigned i;
2298
2299   FOR_EACH_VEC_ELT (method_entry, *symbol_table, i, e)
2300     if (t == e->method && special == e->special)
2301       goto done;
2302
2303   e = VEC_safe_push (method_entry, gc, *symbol_table, NULL);
2304   e->method = t;
2305   e->special = special;
2306
2307  done:
2308   return i + 1;
2309 }
2310
2311 tree
2312 build_invokevirtual (tree dtable, tree method, tree special)
2313 {
2314   tree func;
2315   tree nativecode_ptr_ptr_type_node
2316     = build_pointer_type (nativecode_ptr_type_node);
2317   tree method_index;
2318   tree otable_index;
2319
2320   if (flag_indirect_dispatch)
2321     {
2322       gcc_assert (! CLASS_INTERFACE (TYPE_NAME (DECL_CONTEXT (method))));
2323
2324       otable_index
2325         = build_int_cst (NULL_TREE, get_symbol_table_index
2326                          (method, special,
2327                           &TYPE_OTABLE_METHODS (output_class)));
2328       method_index = build4 (ARRAY_REF, integer_type_node,
2329                              TYPE_OTABLE_DECL (output_class),
2330                              otable_index, NULL_TREE, NULL_TREE);
2331     }
2332   else
2333     {
2334       /* We fetch the DECL_VINDEX field directly here, rather than
2335          using get_method_index().  DECL_VINDEX is the true offset
2336          from the vtable base to a method, regrdless of any extra
2337          words inserted at the start of the vtable.  */
2338       method_index = DECL_VINDEX (method);
2339       method_index = size_binop (MULT_EXPR, method_index,
2340                                  TYPE_SIZE_UNIT (nativecode_ptr_ptr_type_node));
2341       if (TARGET_VTABLE_USES_DESCRIPTORS)
2342         method_index = size_binop (MULT_EXPR, method_index,
2343                                    size_int (TARGET_VTABLE_USES_DESCRIPTORS));
2344     }
2345
2346   func = fold_build2 (POINTER_PLUS_EXPR, TREE_TYPE (dtable), dtable,
2347                       convert (sizetype, method_index));
2348
2349   if (TARGET_VTABLE_USES_DESCRIPTORS)
2350     func = build1 (NOP_EXPR, nativecode_ptr_type_node, func);
2351   else
2352     {
2353       func = fold_convert (nativecode_ptr_ptr_type_node, func);
2354       func = build1 (INDIRECT_REF, nativecode_ptr_type_node, func);
2355     }
2356
2357   return func;
2358 }
2359
2360 static GTY(()) tree class_ident;
2361 tree
2362 build_invokeinterface (tree dtable, tree method)
2363 {
2364   tree interface;
2365   tree idx;
2366
2367   /* We expand invokeinterface here.  */
2368
2369   if (class_ident == NULL_TREE)
2370     class_ident = get_identifier ("class");
2371
2372   dtable = build_java_indirect_ref (dtable_type, dtable,
2373                                     flag_check_references);
2374   dtable = build3 (COMPONENT_REF, class_ptr_type, dtable,
2375                    lookup_field (&dtable_type, class_ident), NULL_TREE);
2376
2377   interface = DECL_CONTEXT (method);
2378   gcc_assert (CLASS_INTERFACE (TYPE_NAME (interface)));
2379   layout_class_methods (interface);
2380
2381   if (flag_indirect_dispatch)
2382     {
2383       int itable_index
2384         = 2 * (get_symbol_table_index
2385                (method, NULL_TREE, &TYPE_ITABLE_METHODS (output_class)));
2386       interface
2387         = build4 (ARRAY_REF,
2388                  TREE_TYPE (TREE_TYPE (TYPE_ITABLE_DECL (output_class))),
2389                  TYPE_ITABLE_DECL (output_class),
2390                   build_int_cst (NULL_TREE, itable_index-1),
2391                   NULL_TREE, NULL_TREE);
2392       idx
2393         = build4 (ARRAY_REF,
2394                  TREE_TYPE (TREE_TYPE (TYPE_ITABLE_DECL (output_class))),
2395                  TYPE_ITABLE_DECL (output_class),
2396                   build_int_cst (NULL_TREE, itable_index),
2397                   NULL_TREE, NULL_TREE);
2398       interface = convert (class_ptr_type, interface);
2399       idx = convert (integer_type_node, idx);
2400     }
2401   else
2402     {
2403       idx = build_int_cst (NULL_TREE,
2404                            get_interface_method_index (method, interface));
2405       interface = build_class_ref (interface);
2406     }
2407
2408   return build_call_nary (ptr_type_node,
2409                           build_address_of (soft_lookupinterfacemethod_node),
2410                           3, dtable, interface, idx);
2411 }
2412
2413 /* Expand one of the invoke_* opcodes.
2414    OPCODE is the specific opcode.
2415    METHOD_REF_INDEX is an index into the constant pool.
2416    NARGS is the number of arguments, or -1 if not specified. */
2417
2418 static void
2419 expand_invoke (int opcode, int method_ref_index, int nargs ATTRIBUTE_UNUSED)
2420 {
2421   tree method_signature
2422     = COMPONENT_REF_SIGNATURE(&current_jcf->cpool, method_ref_index);
2423   tree method_name = COMPONENT_REF_NAME (&current_jcf->cpool,
2424                                          method_ref_index);
2425   tree self_type
2426     = get_class_constant (current_jcf,
2427                           COMPONENT_REF_CLASS_INDEX(&current_jcf->cpool,
2428                           method_ref_index));
2429   const char *const self_name
2430     = IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (self_type)));
2431   tree call, func, method, method_type;
2432   VEC(tree,gc) *arg_list;
2433   tree check = NULL_TREE;
2434
2435   tree special = NULL_TREE;
2436
2437   if (! CLASS_LOADED_P (self_type))
2438     {
2439       load_class (self_type, 1);
2440       safe_layout_class (self_type);
2441       if (TREE_CODE (TYPE_SIZE (self_type)) == ERROR_MARK)
2442         fatal_error ("failed to find class '%s'", self_name);
2443     }
2444   layout_class_methods (self_type);
2445
2446   if (ID_INIT_P (method_name))
2447     method = lookup_java_constructor (self_type, method_signature);
2448   else
2449     method = lookup_java_method (self_type, method_name, method_signature);
2450
2451   /* We've found a method in a class other than the one in which it
2452      was wanted.  This can happen if, for instance, we're trying to
2453      compile invokespecial super.equals().
2454      FIXME: This is a kludge.  Rather than nullifying the result, we
2455      should change lookup_java_method() so that it doesn't search the
2456      superclass chain when we're BC-compiling.  */
2457   if (! flag_verify_invocations
2458       && method
2459       && ! TYPE_ARRAY_P (self_type)
2460       && self_type != DECL_CONTEXT (method))
2461     method = NULL_TREE;
2462
2463   /* We've found a method in an interface, but this isn't an interface
2464      call.  */
2465   if (opcode != OPCODE_invokeinterface
2466       && method
2467       && (CLASS_INTERFACE (TYPE_NAME (DECL_CONTEXT (method)))))
2468     method = NULL_TREE;
2469
2470   /* We've found a non-interface method but we are making an
2471      interface call.  This can happen if the interface overrides a
2472      method in Object.  */
2473   if (! flag_verify_invocations
2474       && opcode == OPCODE_invokeinterface
2475       && method
2476       && ! CLASS_INTERFACE (TYPE_NAME (DECL_CONTEXT (method))))
2477     method = NULL_TREE;
2478
2479   if (method == NULL_TREE)
2480     {
2481       if (flag_verify_invocations || ! flag_indirect_dispatch)
2482         {
2483           error ("class '%s' has no method named '%s' matching signature '%s'",
2484                  self_name,
2485                  IDENTIFIER_POINTER (method_name),
2486                  IDENTIFIER_POINTER (method_signature));
2487         }
2488       else
2489         {
2490           int flags = ACC_PUBLIC;
2491           if (opcode == OPCODE_invokestatic)
2492             flags |= ACC_STATIC;
2493           if (opcode == OPCODE_invokeinterface)
2494             {
2495               flags |= ACC_INTERFACE | ACC_ABSTRACT;
2496               CLASS_INTERFACE (TYPE_NAME (self_type)) = 1;
2497             }
2498           method = add_method (self_type, flags, method_name,
2499                                method_signature);
2500           DECL_ARTIFICIAL (method) = 1;
2501           METHOD_DUMMY (method) = 1;
2502           layout_class_method (self_type, NULL,
2503                                method, NULL);
2504         }
2505     }
2506
2507   /* Invoke static can't invoke static/abstract method */
2508   if (method != NULL_TREE)
2509     {
2510       if (opcode == OPCODE_invokestatic)
2511         {
2512           if (!METHOD_STATIC (method))
2513             {
2514               error ("invokestatic on non static method");
2515               method = NULL_TREE;
2516             }
2517           else if (METHOD_ABSTRACT (method))
2518             {
2519               error ("invokestatic on abstract method");
2520               method = NULL_TREE;
2521             }
2522         }
2523       else
2524         {
2525           if (METHOD_STATIC (method))
2526             {
2527               error ("invoke[non-static] on static method");
2528               method = NULL_TREE;
2529             }
2530         }
2531     }
2532
2533   if (method == NULL_TREE)
2534     {
2535       /* If we got here, we emitted an error message above.  So we
2536          just pop the arguments, push a properly-typed zero, and
2537          continue.  */
2538       method_type = get_type_from_signature (method_signature);
2539       pop_arguments (method_type);
2540       if (opcode != OPCODE_invokestatic)
2541         pop_type (self_type);
2542       method_type = promote_type (TREE_TYPE (method_type));
2543       push_value (convert (method_type, integer_zero_node));
2544       return;
2545     }
2546
2547   method_type = TREE_TYPE (method);
2548   arg_list = pop_arguments (method_type);
2549   flush_quick_stack ();
2550
2551   maybe_rewrite_invocation (&method, &arg_list, &method_signature,
2552                             &special);
2553
2554   func = NULL_TREE;
2555   if (opcode == OPCODE_invokestatic)
2556     func = build_known_method_ref (method, method_type, self_type,
2557                                    method_signature, arg_list, special);
2558   else if (opcode == OPCODE_invokespecial
2559            || (opcode == OPCODE_invokevirtual
2560                && (METHOD_PRIVATE (method)
2561                    || METHOD_FINAL (method)
2562                    || CLASS_FINAL (TYPE_NAME (self_type)))))
2563     {
2564       /* If the object for the method call is null, we throw an
2565          exception.  We don't do this if the object is the current
2566          method's `this'.  In other cases we just rely on an
2567          optimization pass to eliminate redundant checks.  FIXME:
2568          Unfortunately there doesn't seem to be a way to determine
2569          what the current method is right now.
2570          We do omit the check if we're calling <init>.  */
2571       /* We use a SAVE_EXPR here to make sure we only evaluate
2572          the new `self' expression once.  */
2573       tree save_arg = save_expr (VEC_index (tree, arg_list, 0));
2574       VEC_replace (tree, arg_list, 0, save_arg);
2575       check = java_check_reference (save_arg, ! DECL_INIT_P (method));
2576       func = build_known_method_ref (method, method_type, self_type,
2577                                      method_signature, arg_list, special);
2578     }
2579   else
2580     {
2581       tree dtable = invoke_build_dtable (opcode == OPCODE_invokeinterface,
2582                                          arg_list);
2583       if (opcode == OPCODE_invokevirtual)
2584         func = build_invokevirtual (dtable, method, special);
2585       else
2586         func = build_invokeinterface (dtable, method);
2587     }
2588
2589   if (TREE_CODE (func) == ADDR_EXPR)
2590     TREE_TYPE (func) = build_pointer_type (method_type);
2591   else
2592     func = build1 (NOP_EXPR, build_pointer_type (method_type), func);
2593
2594   call = build_call_vec (TREE_TYPE (method_type), func, arg_list);
2595   TREE_SIDE_EFFECTS (call) = 1;
2596   call = check_for_builtin (method, call);
2597
2598   if (check != NULL_TREE)
2599     {
2600       call = build2 (COMPOUND_EXPR, TREE_TYPE (call), check, call);
2601       TREE_SIDE_EFFECTS (call) = 1;
2602     }
2603
2604   if (TREE_CODE (TREE_TYPE (method_type)) == VOID_TYPE)
2605     java_add_stmt (call);
2606   else
2607     {
2608       push_value (call);
2609       flush_quick_stack ();
2610     }
2611 }
2612
2613 /* Create a stub which will be put into the vtable but which will call
2614    a JNI function.  */
2615
2616 tree
2617 build_jni_stub (tree method)
2618 {
2619   tree jnifunc, call, body, method_sig, arg_types;
2620   tree jniarg0, jniarg1, jniarg2, jniarg3;
2621   tree jni_func_type, tem;
2622   tree env_var, res_var = NULL_TREE, block;
2623   tree method_args;
2624   tree meth_var;
2625   tree bind;
2626   VEC(tree,gc) *args = NULL;
2627   int args_size = 0;
2628
2629   tree klass = DECL_CONTEXT (method);
2630   klass = build_class_ref (klass);
2631
2632   gcc_assert (METHOD_NATIVE (method) && flag_jni);
2633
2634   DECL_ARTIFICIAL (method) = 1;
2635   DECL_EXTERNAL (method) = 0;
2636
2637   env_var = build_decl (input_location,
2638                         VAR_DECL, get_identifier ("env"), ptr_type_node);
2639   DECL_CONTEXT (env_var) = method;
2640
2641   if (TREE_TYPE (TREE_TYPE (method)) != void_type_node)
2642     {
2643       res_var = build_decl (input_location, VAR_DECL, get_identifier ("res"),
2644                             TREE_TYPE (TREE_TYPE (method)));
2645       DECL_CONTEXT (res_var) = method;
2646       DECL_CHAIN (env_var) = res_var;
2647     }
2648
2649   method_args = DECL_ARGUMENTS (method);
2650   block = build_block (env_var, NULL_TREE, method_args, NULL_TREE);
2651   TREE_SIDE_EFFECTS (block) = 1;
2652   TREE_TYPE (block) = TREE_TYPE (TREE_TYPE (method));
2653
2654   /* Compute the local `env' by calling _Jv_GetJNIEnvNewFrame.  */
2655   body = build2 (MODIFY_EXPR, ptr_type_node, env_var,
2656                  build_call_nary (ptr_type_node,
2657                                   build_address_of (soft_getjnienvnewframe_node),
2658                                   1, klass));
2659
2660   /* The JNIEnv structure is the first argument to the JNI function.  */
2661   args_size += int_size_in_bytes (TREE_TYPE (env_var));
2662   VEC_safe_push (tree, gc, args, env_var);
2663
2664   /* For a static method the second argument is the class.  For a
2665      non-static method the second argument is `this'; that is already
2666      available in the argument list.  */
2667   if (METHOD_STATIC (method))
2668     {
2669       args_size += int_size_in_bytes (TREE_TYPE (klass));
2670       VEC_safe_push (tree, gc, args, klass);
2671     }
2672
2673   /* All the arguments to this method become arguments to the
2674      underlying JNI function.  If we had to wrap object arguments in a
2675      special way, we would do that here.  */
2676   for (tem = method_args; tem != NULL_TREE; tem = DECL_CHAIN (tem))
2677     {
2678       int arg_bits = TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (tem)));
2679 #ifdef PARM_BOUNDARY
2680       arg_bits = (((arg_bits + PARM_BOUNDARY - 1) / PARM_BOUNDARY)
2681                   * PARM_BOUNDARY);
2682 #endif
2683       args_size += (arg_bits / BITS_PER_UNIT);
2684
2685       VEC_safe_push (tree, gc, args, tem);
2686     }
2687   arg_types = TYPE_ARG_TYPES (TREE_TYPE (method));
2688
2689   /* Argument types for static methods and the JNIEnv structure.
2690      FIXME: Write and use build_function_type_vec to avoid this.  */
2691   if (METHOD_STATIC (method))
2692     arg_types = tree_cons (NULL_TREE, object_ptr_type_node, arg_types);
2693   arg_types = tree_cons (NULL_TREE, ptr_type_node, arg_types);
2694
2695   /* We call _Jv_LookupJNIMethod to find the actual underlying
2696      function pointer.  _Jv_LookupJNIMethod will throw the appropriate
2697      exception if this function is not found at runtime.  */
2698   method_sig = build_java_signature (TREE_TYPE (method));
2699   jniarg0 = klass;
2700   jniarg1 = build_utf8_ref (DECL_NAME (method));
2701   jniarg2 = build_utf8_ref (unmangle_classname
2702                             (IDENTIFIER_POINTER (method_sig),
2703                              IDENTIFIER_LENGTH (method_sig)));
2704   jniarg3 = build_int_cst (NULL_TREE, args_size);
2705
2706   tem = build_function_type (TREE_TYPE (TREE_TYPE (method)), arg_types);
2707
2708 #ifdef MODIFY_JNI_METHOD_CALL
2709   tem = MODIFY_JNI_METHOD_CALL (tem);
2710 #endif
2711
2712   jni_func_type = build_pointer_type (tem);
2713
2714   /* Use the actual function type, rather than a generic pointer type,
2715      such that this decl keeps the actual pointer type from being
2716      garbage-collected.  If it is, we end up using canonical types
2717      with different uids for equivalent function types, and this in
2718      turn causes utf8 identifiers and output order to vary.  */
2719   meth_var = build_decl (input_location,
2720                          VAR_DECL, get_identifier ("meth"), jni_func_type);
2721   TREE_STATIC (meth_var) = 1;
2722   TREE_PUBLIC (meth_var) = 0;
2723   DECL_EXTERNAL (meth_var) = 0;
2724   DECL_CONTEXT (meth_var) = method;
2725   DECL_ARTIFICIAL (meth_var) = 1;
2726   DECL_INITIAL (meth_var) = null_pointer_node;
2727   TREE_USED (meth_var) = 1;
2728   chainon (env_var, meth_var);
2729   build_result_decl (method);
2730
2731   jnifunc = build3 (COND_EXPR, jni_func_type,
2732                     build2 (NE_EXPR, boolean_type_node,
2733                             meth_var, build_int_cst (TREE_TYPE (meth_var), 0)),
2734                     meth_var,
2735                     build2 (MODIFY_EXPR, jni_func_type, meth_var,
2736                             build1
2737                             (NOP_EXPR, jni_func_type,
2738                              build_call_nary (ptr_type_node,
2739                                               build_address_of
2740                                               (soft_lookupjnimethod_node),
2741                                               4,
2742                                               jniarg0, jniarg1,
2743                                               jniarg2, jniarg3))));
2744
2745   /* Now we make the actual JNI call via the resulting function
2746      pointer.    */
2747   call = build_call_vec (TREE_TYPE (TREE_TYPE (method)), jnifunc, args);
2748
2749   /* If the JNI call returned a result, capture it here.  If we had to
2750      unwrap JNI object results, we would do that here.  */
2751   if (res_var != NULL_TREE)
2752     {
2753       /* If the call returns an object, it may return a JNI weak
2754          reference, in which case we must unwrap it.  */
2755       if (! JPRIMITIVE_TYPE_P (TREE_TYPE (TREE_TYPE (method))))
2756         call = build_call_nary (TREE_TYPE (TREE_TYPE (method)),
2757                                 build_address_of (soft_unwrapjni_node),
2758                                 1, call);
2759       call = build2 (MODIFY_EXPR, TREE_TYPE (TREE_TYPE (method)),
2760                      res_var, call);
2761     }
2762
2763   TREE_SIDE_EFFECTS (call) = 1;
2764
2765   body = build2 (COMPOUND_EXPR, void_type_node, body, call);
2766   TREE_SIDE_EFFECTS (body) = 1;
2767
2768   /* Now free the environment we allocated.  */
2769   call = build_call_nary (ptr_type_node,
2770                           build_address_of (soft_jnipopsystemframe_node),
2771                           1, env_var);
2772   TREE_SIDE_EFFECTS (call) = 1;
2773   body = build2 (COMPOUND_EXPR, void_type_node, body, call);
2774   TREE_SIDE_EFFECTS (body) = 1;
2775
2776   /* Finally, do the return.  */
2777   if (res_var != NULL_TREE)
2778     {
2779       tree drt;
2780       gcc_assert (DECL_RESULT (method));
2781       /* Make sure we copy the result variable to the actual
2782          result.  We use the type of the DECL_RESULT because it
2783          might be different from the return type of the function:
2784          it might be promoted.  */
2785       drt = TREE_TYPE (DECL_RESULT (method));
2786       if (drt != TREE_TYPE (res_var))
2787         res_var = build1 (CONVERT_EXPR, drt, res_var);
2788       res_var = build2 (MODIFY_EXPR, drt, DECL_RESULT (method), res_var);
2789       TREE_SIDE_EFFECTS (res_var) = 1;
2790     }
2791
2792   body = build2 (COMPOUND_EXPR, void_type_node, body,
2793                  build1 (RETURN_EXPR, void_type_node, res_var));
2794   TREE_SIDE_EFFECTS (body) = 1;
2795
2796   /* Prepend class initialization for static methods reachable from
2797      other classes.  */
2798   if (METHOD_STATIC (method)
2799       && (! METHOD_PRIVATE (method)
2800           || INNER_CLASS_P (DECL_CONTEXT (method))))
2801     {
2802       tree init = build_call_expr (soft_initclass_node, 1,
2803                                    klass);
2804       body = build2 (COMPOUND_EXPR, void_type_node, init, body);
2805       TREE_SIDE_EFFECTS (body) = 1;
2806     }
2807
2808   bind = build3 (BIND_EXPR, void_type_node, BLOCK_VARS (block),
2809                  body, block);
2810   return bind;
2811 }
2812
2813
2814 /* Given lvalue EXP, return a volatile expression that references the
2815    same object.  */
2816
2817 tree
2818 java_modify_addr_for_volatile (tree exp)
2819 {
2820   tree exp_type = TREE_TYPE (exp);
2821   tree v_type
2822     = build_qualified_type (exp_type,
2823                             TYPE_QUALS (exp_type) | TYPE_QUAL_VOLATILE);
2824   tree addr = build_fold_addr_expr (exp);
2825   v_type = build_pointer_type (v_type);
2826   addr = fold_convert (v_type, addr);
2827   exp = build_fold_indirect_ref (addr);
2828   return exp;
2829 }
2830
2831
2832 /* Expand an operation to extract from or store into a field.
2833    IS_STATIC is 1 iff the field is static.
2834    IS_PUTTING is 1 for putting into a field;  0 for getting from the field.
2835    FIELD_REF_INDEX is an index into the constant pool.  */
2836
2837 static void
2838 expand_java_field_op (int is_static, int is_putting, int field_ref_index)
2839 {
2840   tree self_type
2841     = get_class_constant (current_jcf,
2842                           COMPONENT_REF_CLASS_INDEX (&current_jcf->cpool,
2843                           field_ref_index));
2844   const char *self_name
2845     = IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (self_type)));
2846   tree field_name = COMPONENT_REF_NAME (&current_jcf->cpool, field_ref_index);
2847   tree field_signature = COMPONENT_REF_SIGNATURE (&current_jcf->cpool,
2848                                                   field_ref_index);
2849   tree field_type = get_type_from_signature (field_signature);
2850   tree new_value = is_putting ? pop_value (field_type) : NULL_TREE;
2851   tree field_ref;
2852   int is_error = 0;
2853   tree original_self_type = self_type;
2854   tree field_decl;
2855   tree modify_expr;
2856
2857   if (! CLASS_LOADED_P (self_type))
2858     load_class (self_type, 1);
2859   field_decl = lookup_field (&self_type, field_name);
2860   if (field_decl == error_mark_node)
2861     {
2862       is_error = 1;
2863     }
2864   else if (field_decl == NULL_TREE)
2865     {
2866       if (! flag_verify_invocations)
2867         {
2868           int flags = ACC_PUBLIC;
2869           if (is_static)
2870             flags |= ACC_STATIC;
2871           self_type = original_self_type;
2872           field_decl = add_field (original_self_type, field_name,
2873                                   field_type, flags);
2874           DECL_ARTIFICIAL (field_decl) = 1;
2875           DECL_IGNORED_P (field_decl) = 1;
2876 #if 0
2877           /* FIXME: We should be pessimistic about volatility.  We
2878              don't know one way or another, but this is safe.
2879              However, doing this has bad effects on code quality.  We
2880              need to look at better ways to do this.  */
2881           TREE_THIS_VOLATILE (field_decl) = 1;
2882 #endif
2883         }
2884       else
2885         {
2886           error ("missing field '%s' in '%s'",
2887                  IDENTIFIER_POINTER (field_name), self_name);
2888           is_error = 1;
2889       }
2890     }
2891   else if (build_java_signature (TREE_TYPE (field_decl)) != field_signature)
2892     {
2893       error ("mismatching signature for field '%s' in '%s'",
2894              IDENTIFIER_POINTER (field_name), self_name);
2895       is_error = 1;
2896     }
2897   field_ref = is_static ? NULL_TREE : pop_value (self_type);
2898   if (is_error)
2899     {
2900       if (! is_putting)
2901         push_value (convert (field_type, integer_zero_node));
2902       flush_quick_stack ();
2903       return;
2904     }
2905
2906   field_ref = build_field_ref (field_ref, self_type, field_name);
2907   if (is_static
2908       && ! flag_indirect_dispatch)
2909     {
2910       tree context = DECL_CONTEXT (field_ref);
2911       if (context != self_type && CLASS_INTERFACE (TYPE_NAME (context)))
2912         field_ref = build_class_init (context, field_ref);
2913       else
2914         field_ref = build_class_init (self_type, field_ref);
2915     }
2916   if (is_putting)
2917     {
2918       flush_quick_stack ();
2919       if (FIELD_FINAL (field_decl))
2920         {
2921           if (DECL_CONTEXT (field_decl) != current_class)
2922             error ("assignment to final field %q+D not in field%'s class",
2923                    field_decl);
2924           /* We used to check for assignments to final fields not
2925              occurring in the class initializer or in a constructor
2926              here.  However, this constraint doesn't seem to be
2927              enforced by the JVM.  */
2928         }
2929
2930       if (TREE_THIS_VOLATILE (field_decl))
2931         field_ref = java_modify_addr_for_volatile (field_ref);
2932
2933       modify_expr = build2 (MODIFY_EXPR, TREE_TYPE (field_ref),
2934                             field_ref, new_value);
2935
2936       if (TREE_THIS_VOLATILE (field_decl))
2937         java_add_stmt
2938           (build_call_expr (built_in_decls[BUILT_IN_SYNCHRONIZE], 0));
2939
2940       java_add_stmt (modify_expr);
2941     }
2942   else
2943     {
2944       tree temp = build_decl (input_location,
2945                               VAR_DECL, NULL_TREE, TREE_TYPE (field_ref));
2946       java_add_local_var (temp);
2947
2948       if (TREE_THIS_VOLATILE (field_decl))
2949         field_ref = java_modify_addr_for_volatile (field_ref);
2950
2951       modify_expr
2952         = build2 (MODIFY_EXPR, TREE_TYPE (field_ref), temp, field_ref);
2953       java_add_stmt (modify_expr);
2954
2955       if (TREE_THIS_VOLATILE (field_decl))
2956         java_add_stmt
2957           (build_call_expr (built_in_decls[BUILT_IN_SYNCHRONIZE], 0));
2958
2959       push_value (temp);
2960     }
2961   TREE_THIS_VOLATILE (field_ref) = TREE_THIS_VOLATILE (field_decl);
2962 }
2963
2964 static void
2965 load_type_state (int pc)
2966 {
2967   int i;
2968   tree vec = VEC_index (tree, type_states, pc);
2969   int cur_length = TREE_VEC_LENGTH (vec);
2970   stack_pointer = cur_length - DECL_MAX_LOCALS(current_function_decl);
2971   for (i = 0; i < cur_length; i++)
2972     type_map [i] = TREE_VEC_ELT (vec, i);
2973 }
2974
2975 /* Go over METHOD's bytecode and note instruction starts in
2976    instruction_bits[].  */
2977
2978 void
2979 note_instructions (JCF *jcf, tree method)
2980 {
2981   int PC;
2982   unsigned char* byte_ops;
2983   long length = DECL_CODE_LENGTH (method);
2984
2985   int saw_index;
2986   jint INT_temp;
2987
2988 #undef RET /* Defined by config/i386/i386.h */
2989 #undef PTR
2990 #define BCODE byte_ops
2991 #define BYTE_type_node byte_type_node
2992 #define SHORT_type_node short_type_node
2993 #define INT_type_node int_type_node
2994 #define LONG_type_node long_type_node
2995 #define CHAR_type_node char_type_node
2996 #define PTR_type_node ptr_type_node
2997 #define FLOAT_type_node float_type_node
2998 #define DOUBLE_type_node double_type_node
2999 #define VOID_type_node void_type_node
3000 #define CONST_INDEX_1 (saw_index = 1, IMMEDIATE_u1)
3001 #define CONST_INDEX_2 (saw_index = 1, IMMEDIATE_u2)
3002 #define VAR_INDEX_1 (saw_index = 1, IMMEDIATE_u1)
3003 #define VAR_INDEX_2 (saw_index = 1, IMMEDIATE_u2)
3004
3005 #define CHECK_PC_IN_RANGE(PC) ((void)1) /* Already handled by verifier. */
3006
3007   JCF_SEEK (jcf, DECL_CODE_OFFSET (method));
3008   byte_ops = jcf->read_ptr;
3009   instruction_bits = XRESIZEVAR (char, instruction_bits, length + 1);
3010   memset (instruction_bits, 0, length + 1);
3011   type_states = VEC_alloc (tree, gc, length + 1);
3012   VEC_safe_grow_cleared (tree, gc, type_states, length + 1);
3013
3014   /* This pass figures out which PC can be the targets of jumps. */
3015   for (PC = 0; PC < length;)
3016     {
3017       int oldpc = PC; /* PC at instruction start. */
3018       instruction_bits [PC] |=  BCODE_INSTRUCTION_START;
3019       switch (byte_ops[PC++])
3020         {
3021 #define JAVAOP(OPNAME, OPCODE, OPKIND, OPERAND_TYPE, OPERAND_VALUE) \
3022         case OPCODE: \
3023           PRE_##OPKIND(OPERAND_TYPE, OPERAND_VALUE); \
3024           break;
3025
3026 #define NOTE_LABEL(PC) note_label(oldpc, PC)
3027
3028 #define PRE_PUSHC(OPERAND_TYPE, OPERAND_VALUE) (void)(OPERAND_VALUE);
3029 #define PRE_LOAD(OPERAND_TYPE, OPERAND_VALUE) (void)(OPERAND_VALUE);
3030 #define PRE_STORE(OPERAND_TYPE, OPERAND_VALUE) (void)(OPERAND_VALUE);
3031 #define PRE_STACK(OPERAND_TYPE, OPERAND_VALUE) /* nothing */
3032 #define PRE_UNOP(OPERAND_TYPE, OPERAND_VALUE) /* nothing */
3033 #define PRE_BINOP(OPERAND_TYPE, OPERAND_VALUE) /* nothing */
3034 #define PRE_CONVERT(OPERAND_TYPE, OPERAND_VALUE) /* nothing */
3035 #define PRE_CONVERT2(OPERAND_TYPE, OPERAND_VALUE) /* nothing */
3036
3037 #define PRE_SPECIAL(OPERAND_TYPE, INSTRUCTION) \
3038   PRE_SPECIAL_##INSTRUCTION(OPERAND_TYPE)
3039 #define PRE_SPECIAL_IINC(OPERAND_TYPE) \
3040   ((void) IMMEDIATE_u1, (void) IMMEDIATE_s1)
3041 #define PRE_SPECIAL_ENTER(IGNORE) /* nothing */
3042 #define PRE_SPECIAL_EXIT(IGNORE) /* nothing */
3043 #define PRE_SPECIAL_THROW(IGNORE) /* nothing */
3044 #define PRE_SPECIAL_BREAK(IGNORE) /* nothing */
3045
3046 /* two forms of wide instructions */
3047 #define PRE_SPECIAL_WIDE(IGNORE) \
3048   { \
3049     int modified_opcode = IMMEDIATE_u1; \
3050     if (modified_opcode == OPCODE_iinc) \
3051       { \
3052         (void) IMMEDIATE_u2;    /* indexbyte1 and indexbyte2 */ \
3053         (void) IMMEDIATE_s2;    /* constbyte1 and constbyte2 */ \
3054       } \
3055     else \
3056       { \
3057         (void) IMMEDIATE_u2;    /* indexbyte1 and indexbyte2 */ \
3058       } \
3059   }
3060
3061 #define PRE_IMPL(IGNORE1, IGNORE2) /* nothing */
3062
3063 #define PRE_MONITOR(OPERAND_TYPE, OPERAND_VALUE) /* nothing */
3064
3065 #define PRE_RETURN(OPERAND_TYPE, OPERAND_VALUE) /* nothing */
3066 #define PRE_ARRAY(OPERAND_TYPE, SUBOP) \
3067           PRE_ARRAY_##SUBOP(OPERAND_TYPE)
3068 #define PRE_ARRAY_LOAD(TYPE) /* nothing */
3069 #define PRE_ARRAY_STORE(TYPE) /* nothing */
3070 #define PRE_ARRAY_LENGTH(TYPE) /* nothing */
3071 #define PRE_ARRAY_NEW(TYPE) PRE_ARRAY_NEW_##TYPE
3072 #define PRE_ARRAY_NEW_NUM ((void) IMMEDIATE_u1)
3073 #define PRE_ARRAY_NEW_PTR ((void) IMMEDIATE_u2)
3074 #define PRE_ARRAY_NEW_MULTI ((void) IMMEDIATE_u2, (void) IMMEDIATE_u1)
3075
3076 #define PRE_TEST(OPERAND_TYPE, OPERAND_VALUE) NOTE_LABEL (oldpc+IMMEDIATE_s2)
3077 #define PRE_COND(OPERAND_TYPE, OPERAND_VALUE) NOTE_LABEL (oldpc+IMMEDIATE_s2)
3078 #define PRE_BRANCH(OPERAND_TYPE, OPERAND_VALUE) \
3079   saw_index = 0;  INT_temp = (OPERAND_VALUE); \
3080   if (!saw_index)  NOTE_LABEL(oldpc + INT_temp);
3081 #define PRE_JSR(OPERAND_TYPE, OPERAND_VALUE) \
3082   saw_index = 0;  INT_temp = (OPERAND_VALUE); \
3083   NOTE_LABEL (PC); \
3084   if (!saw_index)  NOTE_LABEL(oldpc + INT_temp);
3085
3086 #define PRE_RET(OPERAND_TYPE, OPERAND_VALUE)  (void)(OPERAND_VALUE)
3087
3088 #define PRE_SWITCH(OPERAND_TYPE, TABLE_OR_LOOKUP) \
3089   PC = (PC + 3) / 4 * 4; PRE_##TABLE_OR_LOOKUP##_SWITCH
3090
3091 #define PRE_LOOKUP_SWITCH                                               \
3092   { jint default_offset = IMMEDIATE_s4;  jint npairs = IMMEDIATE_s4;    \
3093     NOTE_LABEL (default_offset+oldpc);                                  \
3094     if (npairs >= 0)                                                    \
3095       while (--npairs >= 0) {                                           \
3096        jint match ATTRIBUTE_UNUSED = IMMEDIATE_s4;                      \
3097        jint offset = IMMEDIATE_s4;                                      \
3098        NOTE_LABEL (offset+oldpc); }                                     \
3099   }
3100
3101 #define PRE_TABLE_SWITCH                                \
3102   { jint default_offset = IMMEDIATE_s4;                 \
3103     jint low = IMMEDIATE_s4; jint high = IMMEDIATE_s4;  \
3104     NOTE_LABEL (default_offset+oldpc);                  \
3105     if (low <= high)                                    \
3106      while (low++ <= high) {                            \
3107        jint offset = IMMEDIATE_s4;                      \
3108        NOTE_LABEL (offset+oldpc); }                     \
3109   }
3110
3111 #define PRE_FIELD(MAYBE_STATIC, PUT_OR_GET) (void)(IMMEDIATE_u2);
3112 #define PRE_OBJECT(MAYBE_STATIC, PUT_OR_GET) (void)(IMMEDIATE_u2);
3113 #define PRE_INVOKE(MAYBE_STATIC, IS_INTERFACE) \
3114   (void)(IMMEDIATE_u2); \
3115   PC += 2 * IS_INTERFACE /* for invokeinterface */;
3116
3117 #include "javaop.def"
3118 #undef JAVAOP
3119         }
3120     } /* for */
3121 }
3122
3123 void
3124 expand_byte_code (JCF *jcf, tree method)
3125 {
3126   int PC;
3127   int i;
3128   const unsigned char *linenumber_pointer;
3129   int dead_code_index = -1;
3130   unsigned char* byte_ops;
3131   long length = DECL_CODE_LENGTH (method);
3132   location_t max_location = input_location;
3133
3134   stack_pointer = 0;
3135   JCF_SEEK (jcf, DECL_CODE_OFFSET (method));
3136   byte_ops = jcf->read_ptr;
3137
3138   /* We make an initial pass of the line number table, to note
3139      which instructions have associated line number entries. */
3140   linenumber_pointer = linenumber_table;
3141   for (i = 0; i < linenumber_count; i++)
3142     {
3143       int pc = GET_u2 (linenumber_pointer);
3144       linenumber_pointer += 4;
3145       if (pc >= length)
3146         warning (0, "invalid PC in line number table");
3147       else
3148         {
3149           if ((instruction_bits[pc] & BCODE_HAS_LINENUMBER) != 0)
3150             instruction_bits[pc] |= BCODE_HAS_MULTI_LINENUMBERS;
3151           instruction_bits[pc] |= BCODE_HAS_LINENUMBER;
3152         }
3153     }
3154
3155   if (! verify_jvm_instructions_new (jcf, byte_ops, length))
3156     return;
3157
3158   promote_arguments ();
3159   cache_this_class_ref (method);
3160   cache_cpool_data_ref ();
3161
3162   /* Translate bytecodes.  */
3163   linenumber_pointer = linenumber_table;
3164   for (PC = 0; PC < length;)
3165     {
3166       if ((instruction_bits [PC] & BCODE_TARGET) != 0 || PC == 0)
3167         {
3168           tree label = lookup_label (PC);
3169           flush_quick_stack ();
3170           if ((instruction_bits [PC] & BCODE_TARGET) != 0)
3171             java_add_stmt (build1 (LABEL_EXPR, void_type_node, label));
3172           if ((instruction_bits[PC] & BCODE_VERIFIED) != 0)
3173             load_type_state (PC);
3174         }
3175
3176       if (! (instruction_bits [PC] & BCODE_VERIFIED))
3177         {
3178           if (dead_code_index == -1)
3179             {
3180               /* This is the start of a region of unreachable bytecodes.
3181                  They still need to be processed in order for EH ranges
3182                  to get handled correctly.  However, we can simply
3183                  replace these bytecodes with nops.  */
3184               dead_code_index = PC;
3185             }
3186
3187           /* Turn this bytecode into a nop.  */
3188           byte_ops[PC] = 0x0;
3189         }
3190        else
3191         {
3192           if (dead_code_index != -1)
3193             {
3194               /* We've just reached the end of a region of dead code.  */
3195               if (extra_warnings)
3196                 warning (0, "unreachable bytecode from %d to before %d",
3197                          dead_code_index, PC);
3198               dead_code_index = -1;
3199             }
3200         }
3201
3202       /* Handle possible line number entry for this PC.
3203
3204          This code handles out-of-order and multiple linenumbers per PC,
3205          but is optimized for the case of line numbers increasing
3206          monotonically with PC. */
3207       if ((instruction_bits[PC] & BCODE_HAS_LINENUMBER) != 0)
3208         {
3209           if ((instruction_bits[PC] & BCODE_HAS_MULTI_LINENUMBERS) != 0
3210               || GET_u2 (linenumber_pointer) != PC)
3211             linenumber_pointer = linenumber_table;
3212           while (linenumber_pointer < linenumber_table + linenumber_count * 4)
3213             {
3214               int pc = GET_u2 (linenumber_pointer);
3215               linenumber_pointer += 4;
3216               if (pc == PC)
3217                 {
3218                   int line = GET_u2 (linenumber_pointer - 2);
3219                   input_location = linemap_line_start (line_table, line, 1);
3220                   if (input_location > max_location)
3221                     max_location = input_location;
3222                   if (!(instruction_bits[PC] & BCODE_HAS_MULTI_LINENUMBERS))
3223                     break;
3224                 }
3225             }
3226         }
3227       maybe_pushlevels (PC);
3228       PC = process_jvm_instruction (PC, byte_ops, length);
3229       maybe_poplevels (PC);
3230     } /* for */
3231
3232   uncache_this_class_ref (method);
3233
3234   if (dead_code_index != -1)
3235     {
3236       /* We've just reached the end of a region of dead code.  */
3237       if (extra_warnings)
3238         warning (0, "unreachable bytecode from %d to the end of the method",
3239                  dead_code_index);
3240     }
3241
3242   DECL_FUNCTION_LAST_LINE (method) = max_location;
3243 }
3244
3245 static void
3246 java_push_constant_from_pool (JCF *jcf, int index)
3247 {
3248   tree c;
3249   if (JPOOL_TAG (jcf, index) == CONSTANT_String)
3250     {
3251       tree name;
3252       name = get_name_constant (jcf, JPOOL_USHORT1 (jcf, index));
3253       index = alloc_name_constant (CONSTANT_String, name);
3254       c = build_ref_from_constant_pool (index);
3255       c = convert (promote_type (string_type_node), c);
3256     }
3257   else if (JPOOL_TAG (jcf, index) == CONSTANT_Class
3258            || JPOOL_TAG (jcf, index) == CONSTANT_ResolvedClass)
3259     {
3260       tree record = get_class_constant (jcf, index);
3261       c = build_class_ref (record);
3262     }
3263   else
3264     c = get_constant (jcf, index);
3265   push_value (c);
3266 }
3267
3268 int
3269 process_jvm_instruction (int PC, const unsigned char* byte_ops,
3270                          long length ATTRIBUTE_UNUSED)
3271 {
3272   const char *opname; /* Temporary ??? */
3273   int oldpc = PC; /* PC at instruction start. */
3274
3275   /* If the instruction is at the beginning of an exception handler,
3276      replace the top of the stack with the thrown object reference.  */
3277   if (instruction_bits [PC] & BCODE_EXCEPTION_TARGET)
3278     {
3279       /* Note that the verifier will not emit a type map at all for
3280          dead exception handlers.  In this case we just ignore the
3281          situation.  */
3282       if ((instruction_bits[PC] & BCODE_VERIFIED) != 0)
3283         {
3284           tree type = pop_type (promote_type (throwable_type_node));
3285           push_value (build_exception_object_ref (type));
3286         }
3287     }
3288
3289   switch (byte_ops[PC++])
3290     {
3291 #define JAVAOP(OPNAME, OPCODE, OPKIND, OPERAND_TYPE, OPERAND_VALUE) \
3292     case OPCODE: \
3293       opname = #OPNAME; \
3294       OPKIND(OPERAND_TYPE, OPERAND_VALUE); \
3295       break;
3296
3297 #define RET(OPERAND_TYPE, OPERAND_VALUE)                                \
3298   {                                                                     \
3299     int saw_index = 0;                                                  \
3300     int index     = OPERAND_VALUE;                                      \
3301     (void) saw_index; /* Avoid set but not used warning.  */            \
3302     build_java_ret                                                      \
3303       (find_local_variable (index, return_address_type_node, oldpc));   \
3304   }
3305
3306 #define JSR(OPERAND_TYPE, OPERAND_VALUE) \
3307   {                                                 \
3308     /* OPERAND_VALUE may have side-effects on PC */ \
3309     int opvalue = OPERAND_VALUE;                    \
3310     build_java_jsr (oldpc + opvalue, PC);           \
3311   }
3312
3313 /* Push a constant onto the stack. */
3314 #define PUSHC(OPERAND_TYPE, OPERAND_VALUE) \
3315   { int saw_index = 0;  int ival = (OPERAND_VALUE); \
3316     if (saw_index) java_push_constant_from_pool (current_jcf, ival); \
3317     else expand_java_pushc (ival, OPERAND_TYPE##_type_node); }
3318
3319 /* internal macro added for use by the WIDE case */
3320 #define LOAD_INTERNAL(OPTYPE, OPVALUE) \
3321   expand_load_internal (OPVALUE, type_map[OPVALUE], oldpc);
3322
3323 /* Push local variable onto the opcode stack. */
3324 #define LOAD(OPERAND_TYPE, OPERAND_VALUE) \
3325   { \
3326     /* have to do this since OPERAND_VALUE may have side-effects */ \
3327     int opvalue = OPERAND_VALUE; \
3328     LOAD_INTERNAL(OPERAND_TYPE##_type_node, opvalue); \
3329   }
3330
3331 #define RETURN(OPERAND_TYPE, OPERAND_VALUE) \
3332   expand_java_return (OPERAND_TYPE##_type_node)
3333
3334 #define REM_EXPR TRUNC_MOD_EXPR
3335 #define BINOP(OPERAND_TYPE, OPERAND_VALUE) \
3336   expand_java_binop (OPERAND_TYPE##_type_node, OPERAND_VALUE##_EXPR)
3337
3338 #define FIELD(IS_STATIC, IS_PUT) \
3339   expand_java_field_op (IS_STATIC, IS_PUT, IMMEDIATE_u2)
3340
3341 #define TEST(OPERAND_TYPE, CONDITION) \
3342   expand_test (CONDITION##_EXPR, OPERAND_TYPE##_type_node, oldpc+IMMEDIATE_s2)
3343
3344 #define COND(OPERAND_TYPE, CONDITION) \
3345   expand_cond (CONDITION##_EXPR, OPERAND_TYPE##_type_node, oldpc+IMMEDIATE_s2)
3346
3347 #define BRANCH(OPERAND_TYPE, OPERAND_VALUE) \
3348   BRANCH_##OPERAND_TYPE (OPERAND_VALUE)
3349
3350 #define BRANCH_GOTO(OPERAND_VALUE) \
3351   expand_java_goto (oldpc + OPERAND_VALUE)
3352
3353 #define BRANCH_CALL(OPERAND_VALUE) \
3354   expand_java_call (oldpc + OPERAND_VALUE, oldpc)
3355
3356 #if 0
3357 #define BRANCH_RETURN(OPERAND_VALUE) \
3358   { \
3359     tree type = OPERAND_TYPE##_type_node; \
3360     tree value = find_local_variable (OPERAND_VALUE, type, oldpc); \
3361     expand_java_ret (value); \
3362   }
3363 #endif
3364
3365 #define NOT_IMPL(OPERAND_TYPE, OPERAND_VALUE) \
3366           fprintf (stderr, "%3d: %s ", oldpc, opname); \
3367           fprintf (stderr, "(not implemented)\n")
3368 #define NOT_IMPL1(OPERAND_VALUE) \
3369           fprintf (stderr, "%3d: %s ", oldpc, opname); \
3370           fprintf (stderr, "(not implemented)\n")
3371
3372 #define BRANCH_RETURN(OPERAND_VALUE) NOT_IMPL1(OPERAND_VALUE)
3373
3374 #define STACK(SUBOP, COUNT) STACK_##SUBOP (COUNT)
3375
3376 #define STACK_POP(COUNT) java_stack_pop (COUNT)
3377
3378 #define STACK_SWAP(COUNT) java_stack_swap()
3379
3380 #define STACK_DUP(COUNT) java_stack_dup (COUNT, 0)
3381 #define STACK_DUPx1(COUNT) java_stack_dup (COUNT, 1)
3382 #define STACK_DUPx2(COUNT) java_stack_dup (COUNT, 2)
3383
3384 #define SWITCH(OPERAND_TYPE, TABLE_OR_LOOKUP) \
3385   PC = (PC + 3) / 4 * 4; TABLE_OR_LOOKUP##_SWITCH
3386
3387 #define LOOKUP_SWITCH \
3388   { jint default_offset = IMMEDIATE_s4;  jint npairs = IMMEDIATE_s4; \
3389     tree selector = pop_value (INT_type_node); \
3390     tree switch_expr = expand_java_switch (selector, oldpc + default_offset); \
3391     while (--npairs >= 0) \
3392       { \
3393         jint match = IMMEDIATE_s4; jint offset = IMMEDIATE_s4; \
3394         expand_java_add_case (switch_expr, match, oldpc + offset); \
3395       } \
3396   }
3397
3398 #define TABLE_SWITCH \
3399   { jint default_offset = IMMEDIATE_s4; \
3400     jint low = IMMEDIATE_s4; jint high = IMMEDIATE_s4; \
3401     tree selector = pop_value (INT_type_node); \
3402     tree switch_expr = expand_java_switch (selector, oldpc + default_offset); \
3403     for (; low <= high; low++) \
3404       { \
3405         jint offset = IMMEDIATE_s4; \
3406         expand_java_add_case (switch_expr, low, oldpc + offset); \
3407       } \
3408   }
3409
3410 #define INVOKE(MAYBE_STATIC, IS_INTERFACE) \
3411   { int opcode = byte_ops[PC-1]; \
3412     int method_ref_index = IMMEDIATE_u2; \
3413     int nargs; \
3414     if (IS_INTERFACE) { nargs = IMMEDIATE_u1;  (void) IMMEDIATE_u1; } \
3415     else nargs = -1; \
3416     expand_invoke (opcode, method_ref_index, nargs); \
3417   }
3418
3419 /* Handle new, checkcast, instanceof */
3420 #define OBJECT(TYPE, OP) \
3421   expand_java_##OP (get_class_constant (current_jcf, IMMEDIATE_u2))
3422
3423 #define ARRAY(OPERAND_TYPE, SUBOP) ARRAY_##SUBOP(OPERAND_TYPE)
3424
3425 #define ARRAY_LOAD(OPERAND_TYPE)                        \
3426   {                                                     \
3427     expand_java_arrayload( OPERAND_TYPE##_type_node );  \
3428   }
3429
3430 #define ARRAY_STORE(OPERAND_TYPE)                       \
3431   {                                                     \
3432     expand_java_arraystore( OPERAND_TYPE##_type_node ); \
3433   }
3434
3435 #define ARRAY_LENGTH(OPERAND_TYPE) expand_java_array_length();
3436 #define ARRAY_NEW(OPERAND_TYPE) ARRAY_NEW_##OPERAND_TYPE()
3437 #define ARRAY_NEW_PTR()                                                 \
3438     push_value (build_anewarray (get_class_constant (current_jcf,       \
3439                                                      IMMEDIATE_u2),     \
3440                                  pop_value (int_type_node)));
3441 #define ARRAY_NEW_NUM()                         \
3442   {                                             \
3443     int atype = IMMEDIATE_u1;                   \
3444     push_value (build_newarray (atype, pop_value (int_type_node)));\
3445   }
3446 #define ARRAY_NEW_MULTI()                                       \
3447   {                                                             \
3448     tree klass = get_class_constant (current_jcf, IMMEDIATE_u2 );       \
3449     int  ndims = IMMEDIATE_u1;                                  \
3450     expand_java_multianewarray( klass, ndims );                 \
3451   }
3452
3453 #define UNOP(OPERAND_TYPE, OPERAND_VALUE) \
3454   push_value (fold_build1 (NEGATE_EXPR, OPERAND_TYPE##_type_node, \
3455                            pop_value (OPERAND_TYPE##_type_node)));
3456
3457 #define CONVERT2(FROM_TYPE, TO_TYPE)                                     \
3458   {                                                                      \
3459     push_value (build1 (NOP_EXPR, int_type_node,                         \
3460                         (convert (TO_TYPE##_type_node,                   \
3461                                   pop_value (FROM_TYPE##_type_node))))); \
3462   }
3463
3464 #define CONVERT(FROM_TYPE, TO_TYPE)                             \
3465   {                                                             \
3466     push_value (convert (TO_TYPE##_type_node,                   \
3467                          pop_value (FROM_TYPE##_type_node)));   \
3468   }
3469
3470 /* internal macro added for use by the WIDE case
3471    Added TREE_TYPE (decl) assignment, apbianco  */
3472 #define STORE_INTERNAL(OPTYPE, OPVALUE)                         \
3473   {                                                             \
3474     tree decl, value;                                           \
3475     int index = OPVALUE;                                        \
3476     tree type = OPTYPE;                                         \
3477     value = pop_value (type);                                   \
3478     type = TREE_TYPE (value);                                   \
3479     decl = find_local_variable (index, type, oldpc);            \
3480     set_local_type (index, type);                               \
3481     java_add_stmt (build2 (MODIFY_EXPR, type, decl, value));    \
3482   }
3483
3484 #define STORE(OPERAND_TYPE, OPERAND_VALUE) \
3485   { \
3486     /* have to do this since OPERAND_VALUE may have side-effects */ \
3487     int opvalue = OPERAND_VALUE; \
3488     STORE_INTERNAL(OPERAND_TYPE##_type_node, opvalue); \
3489   }
3490
3491 #define SPECIAL(OPERAND_TYPE, INSTRUCTION) \
3492   SPECIAL_##INSTRUCTION(OPERAND_TYPE)
3493
3494 #define SPECIAL_ENTER(IGNORED) MONITOR_OPERATION (soft_monitorenter_node)
3495 #define SPECIAL_EXIT(IGNORED)  MONITOR_OPERATION (soft_monitorexit_node)
3496
3497 #define MONITOR_OPERATION(call)                 \
3498   {                                             \
3499     tree o = pop_value (ptr_type_node);         \
3500     tree c;                                     \
3501     flush_quick_stack ();                       \
3502     c = build_java_monitor (call, o);           \
3503     TREE_SIDE_EFFECTS (c) = 1;                  \
3504     java_add_stmt (c);                          \
3505   }
3506
3507 #define SPECIAL_IINC(IGNORED) \
3508   { \
3509     unsigned int local_var_index = IMMEDIATE_u1; \
3510     int ival = IMMEDIATE_s1; \
3511     expand_iinc(local_var_index, ival, oldpc); \
3512   }
3513
3514 #define SPECIAL_WIDE(IGNORED) \
3515   { \
3516     int modified_opcode = IMMEDIATE_u1; \
3517     unsigned int local_var_index = IMMEDIATE_u2; \
3518     switch (modified_opcode) \
3519       { \
3520       case OPCODE_iinc: \
3521         { \
3522           int ival = IMMEDIATE_s2; \
3523           expand_iinc (local_var_index, ival, oldpc); \
3524           break; \
3525         } \
3526       case OPCODE_iload: \
3527       case OPCODE_lload: \
3528       case OPCODE_fload: \
3529       case OPCODE_dload: \
3530       case OPCODE_aload: \
3531         { \
3532           /* duplicate code from LOAD macro */ \
3533           LOAD_INTERNAL(operand_type[modified_opcode], local_var_index); \
3534           break; \
3535         } \
3536       case OPCODE_istore: \
3537       case OPCODE_lstore: \
3538       case OPCODE_fstore: \
3539       case OPCODE_dstore: \
3540       case OPCODE_astore: \
3541         { \
3542           STORE_INTERNAL(operand_type[modified_opcode], local_var_index); \
3543           break; \
3544         } \
3545       default: \
3546         error ("unrecogized wide sub-instruction"); \
3547       } \
3548   }
3549
3550 #define SPECIAL_THROW(IGNORED) \
3551   build_java_athrow (pop_value (throwable_type_node))
3552
3553 #define SPECIAL_BREAK NOT_IMPL1
3554 #define IMPL          NOT_IMPL
3555
3556 #include "javaop.def"
3557 #undef JAVAOP
3558    default:
3559     fprintf (stderr, "%3d: unknown(%3d)\n", oldpc, byte_ops[PC]);
3560   }
3561   return PC;
3562 }
3563
3564 /* Return the opcode at PC in the code section pointed to by
3565    CODE_OFFSET.  */
3566
3567 static unsigned char
3568 peek_opcode_at_pc (JCF *jcf, int code_offset, int pc)
3569 {
3570   unsigned char opcode;
3571   long absolute_offset = (long)JCF_TELL (jcf);
3572
3573   JCF_SEEK (jcf, code_offset);
3574   opcode = jcf->read_ptr [pc];
3575   JCF_SEEK (jcf, absolute_offset);
3576   return opcode;
3577 }
3578
3579 /* Some bytecode compilers are emitting accurate LocalVariableTable
3580    attributes. Here's an example:
3581
3582      PC   <t>store_<n>
3583      PC+1 ...
3584
3585      Attribute "LocalVariableTable"
3586      slot #<n>: ... (PC: PC+1 length: L)
3587
3588    This is accurate because the local in slot <n> really exists after
3589    the opcode at PC is executed, hence from PC+1 to PC+1+L.
3590
3591    This procedure recognizes this situation and extends the live range
3592    of the local in SLOT to START_PC-1 or START_PC-2 (depending on the
3593    length of the store instruction.)
3594
3595    This function is used by `give_name_to_locals' so that a local's
3596    DECL features a DECL_LOCAL_START_PC such that the first related
3597    store operation will use DECL as a destination, not an unrelated
3598    temporary created for the occasion.
3599
3600    This function uses a global (instruction_bits) `note_instructions' should
3601    have allocated and filled properly.  */
3602
3603 int
3604 maybe_adjust_start_pc (struct JCF *jcf, int code_offset,
3605                        int start_pc, int slot)
3606 {
3607   int first, index, opcode;
3608   int pc, insn_pc;
3609   int wide_found = 0;
3610
3611   if (!start_pc)
3612     return start_pc;
3613
3614   first = index = -1;
3615
3616   /* Find last previous instruction and remember it */
3617   for (pc = start_pc-1; pc; pc--)
3618     if (instruction_bits [pc] & BCODE_INSTRUCTION_START)
3619       break;
3620   insn_pc = pc;
3621
3622   /* Retrieve the instruction, handle `wide'. */
3623   opcode = (int) peek_opcode_at_pc (jcf, code_offset, pc++);
3624   if (opcode == OPCODE_wide)
3625     {
3626       wide_found = 1;
3627       opcode = (int) peek_opcode_at_pc (jcf, code_offset, pc++);
3628     }
3629
3630   switch (opcode)
3631     {
3632     case OPCODE_astore_0:
3633     case OPCODE_astore_1:
3634     case OPCODE_astore_2:
3635     case OPCODE_astore_3:
3636       first = OPCODE_astore_0;
3637       break;
3638
3639     case OPCODE_istore_0:
3640     case OPCODE_istore_1:
3641     case OPCODE_istore_2:
3642     case OPCODE_istore_3:
3643       first = OPCODE_istore_0;
3644       break;
3645
3646     case OPCODE_lstore_0:
3647     case OPCODE_lstore_1:
3648     case OPCODE_lstore_2:
3649     case OPCODE_lstore_3:
3650       first = OPCODE_lstore_0;
3651       break;
3652
3653     case OPCODE_fstore_0:
3654     case OPCODE_fstore_1:
3655     case OPCODE_fstore_2:
3656     case OPCODE_fstore_3:
3657       first = OPCODE_fstore_0;
3658       break;
3659
3660     case OPCODE_dstore_0:
3661     case OPCODE_dstore_1:
3662     case OPCODE_dstore_2:
3663     case OPCODE_dstore_3:
3664       first = OPCODE_dstore_0;
3665       break;
3666
3667     case OPCODE_astore:
3668     case OPCODE_istore:
3669     case OPCODE_lstore:
3670     case OPCODE_fstore:
3671     case OPCODE_dstore:
3672       index = peek_opcode_at_pc (jcf, code_offset, pc);
3673       if (wide_found)
3674         {
3675           int other = peek_opcode_at_pc (jcf, code_offset, ++pc);
3676           index = (other << 8) + index;
3677         }
3678       break;
3679     }
3680
3681   /* Now we decide: first >0 means we have a <t>store_<n>, index >0
3682      means we have a <t>store. */
3683   if ((first > 0 && opcode - first == slot) || (index > 0 && index == slot))
3684     start_pc = insn_pc;
3685
3686   return start_pc;
3687 }
3688
3689 /* Force the (direct) sub-operands of NODE to be evaluated in left-to-right
3690    order, as specified by Java Language Specification.
3691
3692    The problem is that while expand_expr will evaluate its sub-operands in
3693    left-to-right order, for variables it will just return an rtx (i.e.
3694    an lvalue) for the variable (rather than an rvalue).  So it is possible
3695    that a later sub-operand will change the register, and when the
3696    actual operation is done, it will use the new value, when it should
3697    have used the original value.
3698
3699    We fix this by using save_expr.  This forces the sub-operand to be
3700    copied into a fresh virtual register,
3701
3702    For method invocation, we modify the arguments so that a
3703    left-to-right order evaluation is performed. Saved expressions
3704    will, in CALL_EXPR order, be reused when the call will be expanded.
3705
3706    We also promote outgoing args if needed.  */
3707
3708 tree
3709 force_evaluation_order (tree node)
3710 {
3711   if (flag_syntax_only)
3712     return node;
3713   if (TREE_CODE (node) == CALL_EXPR
3714       || (TREE_CODE (node) == COMPOUND_EXPR
3715           && TREE_CODE (TREE_OPERAND (node, 0)) == CALL_EXPR
3716           && TREE_CODE (TREE_OPERAND (node, 1)) == SAVE_EXPR))
3717     {
3718       tree call, cmp;
3719       int i, nargs;
3720
3721       /* Account for wrapped around ctors.  */
3722       if (TREE_CODE (node) == COMPOUND_EXPR)
3723         call = TREE_OPERAND (node, 0);
3724       else
3725         call = node;
3726
3727       nargs = call_expr_nargs (call);
3728
3729       /* This reverses the evaluation order. This is a desired effect. */
3730       for (i = 0, cmp = NULL_TREE; i < nargs; i++)
3731         {
3732           tree arg = CALL_EXPR_ARG (call, i);
3733           /* Promote types smaller than integer.  This is required by
3734              some ABIs.  */
3735           tree type = TREE_TYPE (arg);
3736           tree saved;
3737           if (targetm.calls.promote_prototypes (type)
3738               && INTEGRAL_TYPE_P (type)
3739               && INT_CST_LT_UNSIGNED (TYPE_SIZE (type),
3740                                       TYPE_SIZE (integer_type_node)))
3741             arg = fold_convert (integer_type_node, arg);
3742
3743           saved = save_expr (force_evaluation_order (arg));
3744           cmp = (cmp == NULL_TREE ? saved :
3745                  build2 (COMPOUND_EXPR, void_type_node, cmp, saved));
3746
3747           CALL_EXPR_ARG (call, i) = saved;
3748         }
3749
3750       if (cmp && TREE_CODE (cmp) == COMPOUND_EXPR)
3751         TREE_SIDE_EFFECTS (cmp) = 1;
3752
3753       if (cmp)
3754         {
3755           cmp = build2 (COMPOUND_EXPR, TREE_TYPE (node), cmp, node);
3756           if (TREE_TYPE (cmp) != void_type_node)
3757             cmp = save_expr (cmp);
3758           TREE_SIDE_EFFECTS (cmp) = 1;
3759           node = cmp;
3760         }
3761     }
3762   return node;
3763 }
3764
3765 /* Build a node to represent empty statements and blocks. */
3766
3767 tree
3768 build_java_empty_stmt (void)
3769 {
3770   tree t = build_empty_stmt (input_location);
3771   return t;
3772 }
3773
3774 /* Promote all args of integral type before generating any code.  */
3775
3776 static void
3777 promote_arguments (void)
3778 {
3779   int i;
3780   tree arg;
3781   for (arg = DECL_ARGUMENTS (current_function_decl), i = 0;
3782        arg != NULL_TREE;  arg = DECL_CHAIN (arg), i++)
3783     {
3784       tree arg_type = TREE_TYPE (arg);
3785       if (INTEGRAL_TYPE_P (arg_type)
3786           && TYPE_PRECISION (arg_type) < 32)
3787         {
3788           tree copy = find_local_variable (i, integer_type_node, -1);
3789           java_add_stmt (build2 (MODIFY_EXPR, integer_type_node,
3790                                  copy,
3791                                  fold_convert (integer_type_node, arg)));
3792         }
3793       if (TYPE_IS_WIDE (arg_type))
3794         i++;
3795     }
3796 }
3797
3798 /* Create a local variable that points to the constant pool.  */
3799
3800 static void
3801 cache_cpool_data_ref (void)
3802 {
3803   if (optimize)
3804     {
3805       tree cpool;
3806       tree d = build_constant_data_ref (flag_indirect_classes);
3807       tree cpool_ptr = build_decl (input_location, VAR_DECL, NULL_TREE,
3808                                    build_pointer_type (TREE_TYPE (d)));
3809       java_add_local_var (cpool_ptr);
3810       TREE_CONSTANT (cpool_ptr) = 1;
3811
3812       java_add_stmt (build2 (MODIFY_EXPR, TREE_TYPE (cpool_ptr),
3813                              cpool_ptr, build_address_of (d)));
3814       cpool = build1 (INDIRECT_REF, TREE_TYPE (d), cpool_ptr);
3815       TREE_THIS_NOTRAP (cpool) = 1;
3816       TYPE_CPOOL_DATA_REF (output_class) = cpool;
3817     }
3818 }
3819
3820 #include "gt-java-expr.h"