rev 11908 : 8160543: C1: Crash in java.lang.String.indexOf in some java.sql tests
Summary: C1 must use unverified entry point for unloaded methods.
Reviewed-by:

   1 /*
   2  * Copyright (c) 1999, 2016, Oracle and/or its affiliates. All rights reserved.
   3  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   4  *
   5  * This code is free software; you can redistribute it and/or modify it
   6  * under the terms of the GNU General Public License version 2 only, as
   7  * published by the Free Software Foundation.
   8  *
   9  * This code is distributed in the hope that it will be useful, but WITHOUT
  10  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  11  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  12  * version 2 for more details (a copy is included in the LICENSE file that
  13  * accompanied this code).
  14  *
  15  * You should have received a copy of the GNU General Public License version
  16  * 2 along with this work; if not, write to the Free Software Foundation,
  17  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
  18  *
  19  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
  20  * or visit www.oracle.com if you need additional information or have any
  21  * questions.
  22  *
  23  */
  24 
  25 #include "precompiled.hpp"
  26 #include "c1/c1_CFGPrinter.hpp"
  27 #include "c1/c1_Canonicalizer.hpp"
  28 #include "c1/c1_Compilation.hpp"
  29 #include "c1/c1_GraphBuilder.hpp"
  30 #include "c1/c1_InstructionPrinter.hpp"
  31 #include "ci/ciCallSite.hpp"
  32 #include "ci/ciField.hpp"
  33 #include "ci/ciKlass.hpp"
  34 #include "ci/ciMemberName.hpp"
  35 #include "compiler/compileBroker.hpp"
  36 #include "interpreter/bytecode.hpp"
  37 #include "memory/resourceArea.hpp"
  38 #include "oops/oop.inline.hpp"
  39 #include "runtime/sharedRuntime.hpp"
  40 #include "runtime/compilationPolicy.hpp"
  41 #include "runtime/vm_version.hpp"
  42 #include "utilities/bitMap.inline.hpp"
  43 
  44 class BlockListBuilder VALUE_OBJ_CLASS_SPEC {
  45  private:
  46   Compilation* _compilation;
  47   IRScope*     _scope;
  48 
  49   BlockList    _blocks;                // internal list of all blocks
  50   BlockList*   _bci2block;             // mapping from bci to blocks for GraphBuilder
  51 
  52   // fields used by mark_loops
  53   ResourceBitMap _active;              // for iteration of control flow graph
  54   ResourceBitMap _visited;             // for iteration of control flow graph
  55   intArray       _loop_map;            // caches the information if a block is contained in a loop
  56   int            _next_loop_index;     // next free loop number
  57   int            _next_block_number;   // for reverse postorder numbering of blocks
  58 
  59   // accessors
  60   Compilation*  compilation() const              { return _compilation; }
  61   IRScope*      scope() const                    { return _scope; }
  62   ciMethod*     method() const                   { return scope()->method(); }
  63   XHandlers*    xhandlers() const                { return scope()->xhandlers(); }
  64 
  65   // unified bailout support
  66   void          bailout(const char* msg) const   { compilation()->bailout(msg); }
  67   bool          bailed_out() const               { return compilation()->bailed_out(); }
  68 
  69   // helper functions
  70   BlockBegin* make_block_at(int bci, BlockBegin* predecessor);
  71   void handle_exceptions(BlockBegin* current, int cur_bci);
  72   void handle_jsr(BlockBegin* current, int sr_bci, int next_bci);
  73   void store_one(BlockBegin* current, int local);
  74   void store_two(BlockBegin* current, int local);
  75   void set_entries(int osr_bci);
  76   void set_leaders();
  77 
  78   void make_loop_header(BlockBegin* block);
  79   void mark_loops();
  80   int  mark_loops(BlockBegin* b, bool in_subroutine);
  81 
  82   // debugging
  83 #ifndef PRODUCT
  84   void print();
  85 #endif
  86 
  87  public:
  88   // creation
  89   BlockListBuilder(Compilation* compilation, IRScope* scope, int osr_bci);
  90 
  91   // accessors for GraphBuilder
  92   BlockList*    bci2block() const                { return _bci2block; }
  93 };
  94 
  95 
  96 // Implementation of BlockListBuilder
  97 
  98 BlockListBuilder::BlockListBuilder(Compilation* compilation, IRScope* scope, int osr_bci)
  99  : _compilation(compilation)
 100  , _scope(scope)
 101  , _blocks(16)
 102  , _bci2block(new BlockList(scope->method()->code_size(), NULL))
 103  , _next_block_number(0)
 104  , _active()         // size not known yet
 105  , _visited()        // size not known yet
 106  , _next_loop_index(0)
 107  , _loop_map() // size not known yet
 108 {
 109   set_entries(osr_bci);
 110   set_leaders();
 111   CHECK_BAILOUT();
 112 
 113   mark_loops();
 114   NOT_PRODUCT(if (PrintInitialBlockList) print());
 115 
 116 #ifndef PRODUCT
 117   if (PrintCFGToFile) {
 118     stringStream title;
 119     title.print("BlockListBuilder ");
 120     scope->method()->print_name(&title);
 121     CFGPrinter::print_cfg(_bci2block, title.as_string(), false, false);
 122   }
 123 #endif
 124 }
 125 
 126 
 127 void BlockListBuilder::set_entries(int osr_bci) {
 128   // generate start blocks
 129   BlockBegin* std_entry = make_block_at(0, NULL);
 130   if (scope()->caller() == NULL) {
 131     std_entry->set(BlockBegin::std_entry_flag);
 132   }
 133   if (osr_bci != -1) {
 134     BlockBegin* osr_entry = make_block_at(osr_bci, NULL);
 135     osr_entry->set(BlockBegin::osr_entry_flag);
 136   }
 137 
 138   // generate exception entry blocks
 139   XHandlers* list = xhandlers();
 140   const int n = list->length();
 141   for (int i = 0; i < n; i++) {
 142     XHandler* h = list->handler_at(i);
 143     BlockBegin* entry = make_block_at(h->handler_bci(), NULL);
 144     entry->set(BlockBegin::exception_entry_flag);
 145     h->set_entry_block(entry);
 146   }
 147 }
 148 
 149 
 150 BlockBegin* BlockListBuilder::make_block_at(int cur_bci, BlockBegin* predecessor) {
 151   assert(method()->bci_block_start().at(cur_bci), "wrong block starts of MethodLivenessAnalyzer");
 152 
 153   BlockBegin* block = _bci2block->at(cur_bci);
 154   if (block == NULL) {
 155     block = new BlockBegin(cur_bci);
 156     block->init_stores_to_locals(method()->max_locals());
 157     _bci2block->at_put(cur_bci, block);
 158     _blocks.append(block);
 159 
 160     assert(predecessor == NULL || predecessor->bci() < cur_bci, "targets for backward branches must already exist");
 161   }
 162 
 163   if (predecessor != NULL) {
 164     if (block->is_set(BlockBegin::exception_entry_flag)) {
 165       BAILOUT_("Exception handler can be reached by both normal and exceptional control flow", block);
 166     }
 167 
 168     predecessor->add_successor(block);
 169     block->increment_total_preds();
 170   }
 171 
 172   return block;
 173 }
 174 
 175 
 176 inline void BlockListBuilder::store_one(BlockBegin* current, int local) {
 177   current->stores_to_locals().set_bit(local);
 178 }
 179 inline void BlockListBuilder::store_two(BlockBegin* current, int local) {
 180   store_one(current, local);
 181   store_one(current, local + 1);
 182 }
 183 
 184 
 185 void BlockListBuilder::handle_exceptions(BlockBegin* current, int cur_bci) {
 186   // Draws edges from a block to its exception handlers
 187   XHandlers* list = xhandlers();
 188   const int n = list->length();
 189 
 190   for (int i = 0; i < n; i++) {
 191     XHandler* h = list->handler_at(i);
 192 
 193     if (h->covers(cur_bci)) {
 194       BlockBegin* entry = h->entry_block();
 195       assert(entry != NULL && entry == _bci2block->at(h->handler_bci()), "entry must be set");
 196       assert(entry->is_set(BlockBegin::exception_entry_flag), "flag must be set");
 197 
 198       // add each exception handler only once
 199       if (!current->is_successor(entry)) {
 200         current->add_successor(entry);
 201         entry->increment_total_preds();
 202       }
 203 
 204       // stop when reaching catchall
 205       if (h->catch_type() == 0) break;
 206     }
 207   }
 208 }
 209 
 210 void BlockListBuilder::handle_jsr(BlockBegin* current, int sr_bci, int next_bci) {
 211   // start a new block after jsr-bytecode and link this block into cfg
 212   make_block_at(next_bci, current);
 213 
 214   // start a new block at the subroutine entry at mark it with special flag
 215   BlockBegin* sr_block = make_block_at(sr_bci, current);
 216   if (!sr_block->is_set(BlockBegin::subroutine_entry_flag)) {
 217     sr_block->set(BlockBegin::subroutine_entry_flag);
 218   }
 219 }
 220 
 221 
 222 void BlockListBuilder::set_leaders() {
 223   bool has_xhandlers = xhandlers()->has_handlers();
 224   BlockBegin* current = NULL;
 225 
 226   // The information which bci starts a new block simplifies the analysis
 227   // Without it, backward branches could jump to a bci where no block was created
 228   // during bytecode iteration. This would require the creation of a new block at the
 229   // branch target and a modification of the successor lists.
 230   const BitMap& bci_block_start = method()->bci_block_start();
 231 
 232   ciBytecodeStream s(method());
 233   while (s.next() != ciBytecodeStream::EOBC()) {
 234     int cur_bci = s.cur_bci();
 235 
 236     if (bci_block_start.at(cur_bci)) {
 237       current = make_block_at(cur_bci, current);
 238     }
 239     assert(current != NULL, "must have current block");
 240 
 241     if (has_xhandlers && GraphBuilder::can_trap(method(), s.cur_bc())) {
 242       handle_exceptions(current, cur_bci);
 243     }
 244 
 245     switch (s.cur_bc()) {
 246       // track stores to local variables for selective creation of phi functions
 247       case Bytecodes::_iinc:     store_one(current, s.get_index()); break;
 248       case Bytecodes::_istore:   store_one(current, s.get_index()); break;
 249       case Bytecodes::_lstore:   store_two(current, s.get_index()); break;
 250       case Bytecodes::_fstore:   store_one(current, s.get_index()); break;
 251       case Bytecodes::_dstore:   store_two(current, s.get_index()); break;
 252       case Bytecodes::_astore:   store_one(current, s.get_index()); break;
 253       case Bytecodes::_istore_0: store_one(current, 0); break;
 254       case Bytecodes::_istore_1: store_one(current, 1); break;
 255       case Bytecodes::_istore_2: store_one(current, 2); break;
 256       case Bytecodes::_istore_3: store_one(current, 3); break;
 257       case Bytecodes::_lstore_0: store_two(current, 0); break;
 258       case Bytecodes::_lstore_1: store_two(current, 1); break;
 259       case Bytecodes::_lstore_2: store_two(current, 2); break;
 260       case Bytecodes::_lstore_3: store_two(current, 3); break;
 261       case Bytecodes::_fstore_0: store_one(current, 0); break;
 262       case Bytecodes::_fstore_1: store_one(current, 1); break;
 263       case Bytecodes::_fstore_2: store_one(current, 2); break;
 264       case Bytecodes::_fstore_3: store_one(current, 3); break;
 265       case Bytecodes::_dstore_0: store_two(current, 0); break;
 266       case Bytecodes::_dstore_1: store_two(current, 1); break;
 267       case Bytecodes::_dstore_2: store_two(current, 2); break;
 268       case Bytecodes::_dstore_3: store_two(current, 3); break;
 269       case Bytecodes::_astore_0: store_one(current, 0); break;
 270       case Bytecodes::_astore_1: store_one(current, 1); break;
 271       case Bytecodes::_astore_2: store_one(current, 2); break;
 272       case Bytecodes::_astore_3: store_one(current, 3); break;
 273 
 274       // track bytecodes that affect the control flow
 275       case Bytecodes::_athrow:  // fall through
 276       case Bytecodes::_ret:     // fall through
 277       case Bytecodes::_ireturn: // fall through
 278       case Bytecodes::_lreturn: // fall through
 279       case Bytecodes::_freturn: // fall through
 280       case Bytecodes::_dreturn: // fall through
 281       case Bytecodes::_areturn: // fall through
 282       case Bytecodes::_return:
 283         current = NULL;
 284         break;
 285 
 286       case Bytecodes::_ifeq:      // fall through
 287       case Bytecodes::_ifne:      // fall through
 288       case Bytecodes::_iflt:      // fall through
 289       case Bytecodes::_ifge:      // fall through
 290       case Bytecodes::_ifgt:      // fall through
 291       case Bytecodes::_ifle:      // fall through
 292       case Bytecodes::_if_icmpeq: // fall through
 293       case Bytecodes::_if_icmpne: // fall through
 294       case Bytecodes::_if_icmplt: // fall through
 295       case Bytecodes::_if_icmpge: // fall through
 296       case Bytecodes::_if_icmpgt: // fall through
 297       case Bytecodes::_if_icmple: // fall through
 298       case Bytecodes::_if_acmpeq: // fall through
 299       case Bytecodes::_if_acmpne: // fall through
 300       case Bytecodes::_ifnull:    // fall through
 301       case Bytecodes::_ifnonnull:
 302         make_block_at(s.next_bci(), current);
 303         make_block_at(s.get_dest(), current);
 304         current = NULL;
 305         break;
 306 
 307       case Bytecodes::_goto:
 308         make_block_at(s.get_dest(), current);
 309         current = NULL;
 310         break;
 311 
 312       case Bytecodes::_goto_w:
 313         make_block_at(s.get_far_dest(), current);
 314         current = NULL;
 315         break;
 316 
 317       case Bytecodes::_jsr:
 318         handle_jsr(current, s.get_dest(), s.next_bci());
 319         current = NULL;
 320         break;
 321 
 322       case Bytecodes::_jsr_w:
 323         handle_jsr(current, s.get_far_dest(), s.next_bci());
 324         current = NULL;
 325         break;
 326 
 327       case Bytecodes::_tableswitch: {
 328         // set block for each case
 329         Bytecode_tableswitch sw(&s);
 330         int l = sw.length();
 331         for (int i = 0; i < l; i++) {
 332           make_block_at(cur_bci + sw.dest_offset_at(i), current);
 333         }
 334         make_block_at(cur_bci + sw.default_offset(), current);
 335         current = NULL;
 336         break;
 337       }
 338 
 339       case Bytecodes::_lookupswitch: {
 340         // set block for each case
 341         Bytecode_lookupswitch sw(&s);
 342         int l = sw.number_of_pairs();
 343         for (int i = 0; i < l; i++) {
 344           make_block_at(cur_bci + sw.pair_at(i).offset(), current);
 345         }
 346         make_block_at(cur_bci + sw.default_offset(), current);
 347         current = NULL;
 348         break;
 349       }
 350     }
 351   }
 352 }
 353 
 354 
 355 void BlockListBuilder::mark_loops() {
 356   ResourceMark rm;
 357 
 358   _active.initialize(BlockBegin::number_of_blocks());
 359   _visited.initialize(BlockBegin::number_of_blocks());
 360   _loop_map = intArray(BlockBegin::number_of_blocks(), BlockBegin::number_of_blocks(), 0);
 361   _next_loop_index = 0;
 362   _next_block_number = _blocks.length();
 363 
 364   // recursively iterate the control flow graph
 365   mark_loops(_bci2block->at(0), false);
 366   assert(_next_block_number >= 0, "invalid block numbers");
 367 
 368   // Remove dangling Resource pointers before the ResourceMark goes out-of-scope.
 369   _active.resize(0);
 370   _visited.resize(0);
 371 }
 372 
 373 void BlockListBuilder::make_loop_header(BlockBegin* block) {
 374   if (block->is_set(BlockBegin::exception_entry_flag)) {
 375     // exception edges may look like loops but don't mark them as such
 376     // since it screws up block ordering.
 377     return;
 378   }
 379   if (!block->is_set(BlockBegin::parser_loop_header_flag)) {
 380     block->set(BlockBegin::parser_loop_header_flag);
 381 
 382     assert(_loop_map.at(block->block_id()) == 0, "must not be set yet");
 383     assert(0 <= _next_loop_index && _next_loop_index < BitsPerInt, "_next_loop_index is used as a bit-index in integer");
 384     _loop_map.at_put(block->block_id(), 1 << _next_loop_index);
 385     if (_next_loop_index < 31) _next_loop_index++;
 386   } else {
 387     // block already marked as loop header
 388     assert(is_power_of_2((unsigned int)_loop_map.at(block->block_id())), "exactly one bit must be set");
 389   }
 390 }
 391 
 392 int BlockListBuilder::mark_loops(BlockBegin* block, bool in_subroutine) {
 393   int block_id = block->block_id();
 394 
 395   if (_visited.at(block_id)) {
 396     if (_active.at(block_id)) {
 397       // reached block via backward branch
 398       make_loop_header(block);
 399     }
 400     // return cached loop information for this block
 401     return _loop_map.at(block_id);
 402   }
 403 
 404   if (block->is_set(BlockBegin::subroutine_entry_flag)) {
 405     in_subroutine = true;
 406   }
 407 
 408   // set active and visited bits before successors are processed
 409   _visited.set_bit(block_id);
 410   _active.set_bit(block_id);
 411 
 412   intptr_t loop_state = 0;
 413   for (int i = block->number_of_sux() - 1; i >= 0; i--) {
 414     // recursively process all successors
 415     loop_state |= mark_loops(block->sux_at(i), in_subroutine);
 416   }
 417 
 418   // clear active-bit after all successors are processed
 419   _active.clear_bit(block_id);
 420 
 421   // reverse-post-order numbering of all blocks
 422   block->set_depth_first_number(_next_block_number);
 423   _next_block_number--;
 424 
 425   if (loop_state != 0 || in_subroutine ) {
 426     // block is contained at least in one loop, so phi functions are necessary
 427     // phi functions are also necessary for all locals stored in a subroutine
 428     scope()->requires_phi_function().set_union(block->stores_to_locals());
 429   }
 430 
 431   if (block->is_set(BlockBegin::parser_loop_header_flag)) {
 432     int header_loop_state = _loop_map.at(block_id);
 433     assert(is_power_of_2((unsigned)header_loop_state), "exactly one bit must be set");
 434 
 435     // If the highest bit is set (i.e. when integer value is negative), the method
 436     // has 32 or more loops. This bit is never cleared because it is used for multiple loops
 437     if (header_loop_state >= 0) {
 438       clear_bits(loop_state, header_loop_state);
 439     }
 440   }
 441 
 442   // cache and return loop information for this block
 443   _loop_map.at_put(block_id, loop_state);
 444   return loop_state;
 445 }
 446 
 447 
 448 #ifndef PRODUCT
 449 
 450 int compare_depth_first(BlockBegin** a, BlockBegin** b) {
 451   return (*a)->depth_first_number() - (*b)->depth_first_number();
 452 }
 453 
 454 void BlockListBuilder::print() {
 455   tty->print("----- initial block list of BlockListBuilder for method ");
 456   method()->print_short_name();
 457   tty->cr();
 458 
 459   // better readability if blocks are sorted in processing order
 460   _blocks.sort(compare_depth_first);
 461 
 462   for (int i = 0; i < _blocks.length(); i++) {
 463     BlockBegin* cur = _blocks.at(i);
 464     tty->print("%4d: B%-4d bci: %-4d  preds: %-4d ", cur->depth_first_number(), cur->block_id(), cur->bci(), cur->total_preds());
 465 
 466     tty->print(cur->is_set(BlockBegin::std_entry_flag)               ? " std" : "    ");
 467     tty->print(cur->is_set(BlockBegin::osr_entry_flag)               ? " osr" : "    ");
 468     tty->print(cur->is_set(BlockBegin::exception_entry_flag)         ? " ex" : "   ");
 469     tty->print(cur->is_set(BlockBegin::subroutine_entry_flag)        ? " sr" : "   ");
 470     tty->print(cur->is_set(BlockBegin::parser_loop_header_flag)      ? " lh" : "   ");
 471 
 472     if (cur->number_of_sux() > 0) {
 473       tty->print("    sux: ");
 474       for (int j = 0; j < cur->number_of_sux(); j++) {
 475         BlockBegin* sux = cur->sux_at(j);
 476         tty->print("B%d ", sux->block_id());
 477       }
 478     }
 479     tty->cr();
 480   }
 481 }
 482 
 483 #endif
 484 
 485 
 486 // A simple growable array of Values indexed by ciFields
 487 class FieldBuffer: public CompilationResourceObj {
 488  private:
 489   GrowableArray<Value> _values;
 490 
 491  public:
 492   FieldBuffer() {}
 493 
 494   void kill() {
 495     _values.trunc_to(0);
 496   }
 497 
 498   Value at(ciField* field) {
 499     assert(field->holder()->is_loaded(), "must be a loaded field");
 500     int offset = field->offset();
 501     if (offset < _values.length()) {
 502       return _values.at(offset);
 503     } else {
 504       return NULL;
 505     }
 506   }
 507 
 508   void at_put(ciField* field, Value value) {
 509     assert(field->holder()->is_loaded(), "must be a loaded field");
 510     int offset = field->offset();
 511     _values.at_put_grow(offset, value, NULL);
 512   }
 513 
 514 };
 515 
 516 
 517 // MemoryBuffer is fairly simple model of the current state of memory.
 518 // It partitions memory into several pieces.  The first piece is
 519 // generic memory where little is known about the owner of the memory.
 520 // This is conceptually represented by the tuple <O, F, V> which says
 521 // that the field F of object O has value V.  This is flattened so
 522 // that F is represented by the offset of the field and the parallel
 523 // arrays _objects and _values are used for O and V.  Loads of O.F can
 524 // simply use V.  Newly allocated objects are kept in a separate list
 525 // along with a parallel array for each object which represents the
 526 // current value of its fields.  Stores of the default value to fields
 527 // which have never been stored to before are eliminated since they
 528 // are redundant.  Once newly allocated objects are stored into
 529 // another object or they are passed out of the current compile they
 530 // are treated like generic memory.
 531 
 532 class MemoryBuffer: public CompilationResourceObj {
 533  private:
 534   FieldBuffer                 _values;
 535   GrowableArray<Value>        _objects;
 536   GrowableArray<Value>        _newobjects;
 537   GrowableArray<FieldBuffer*> _fields;
 538 
 539  public:
 540   MemoryBuffer() {}
 541 
 542   StoreField* store(StoreField* st) {
 543     if (!EliminateFieldAccess) {
 544       return st;
 545     }
 546 
 547     Value object = st->obj();
 548     Value value = st->value();
 549     ciField* field = st->field();
 550     if (field->holder()->is_loaded()) {
 551       int offset = field->offset();
 552       int index = _newobjects.find(object);
 553       if (index != -1) {
 554         // newly allocated object with no other stores performed on this field
 555         FieldBuffer* buf = _fields.at(index);
 556         if (buf->at(field) == NULL && is_default_value(value)) {
 557 #ifndef PRODUCT
 558           if (PrintIRDuringConstruction && Verbose) {
 559             tty->print_cr("Eliminated store for object %d:", index);
 560             st->print_line();
 561           }
 562 #endif
 563           return NULL;
 564         } else {
 565           buf->at_put(field, value);
 566         }
 567       } else {
 568         _objects.at_put_grow(offset, object, NULL);
 569         _values.at_put(field, value);
 570       }
 571 
 572       store_value(value);
 573     } else {
 574       // if we held onto field names we could alias based on names but
 575       // we don't know what's being stored to so kill it all.
 576       kill();
 577     }
 578     return st;
 579   }
 580 
 581 
 582   // return true if this value correspond to the default value of a field.
 583   bool is_default_value(Value value) {
 584     Constant* con = value->as_Constant();
 585     if (con) {
 586       switch (con->type()->tag()) {
 587         case intTag:    return con->type()->as_IntConstant()->value() == 0;
 588         case longTag:   return con->type()->as_LongConstant()->value() == 0;
 589         case floatTag:  return jint_cast(con->type()->as_FloatConstant()->value()) == 0;
 590         case doubleTag: return jlong_cast(con->type()->as_DoubleConstant()->value()) == jlong_cast(0);
 591         case objectTag: return con->type() == objectNull;
 592         default:  ShouldNotReachHere();
 593       }
 594     }
 595     return false;
 596   }
 597 
 598 
 599   // return either the actual value of a load or the load itself
 600   Value load(LoadField* load) {
 601     if (!EliminateFieldAccess) {
 602       return load;
 603     }
 604 
 605     if (RoundFPResults && UseSSE < 2 && load->type()->is_float_kind()) {
 606       // can't skip load since value might get rounded as a side effect
 607       return load;
 608     }
 609 
 610     ciField* field = load->field();
 611     Value object   = load->obj();
 612     if (field->holder()->is_loaded() && !field->is_volatile()) {
 613       int offset = field->offset();
 614       Value result = NULL;
 615       int index = _newobjects.find(object);
 616       if (index != -1) {
 617         result = _fields.at(index)->at(field);
 618       } else if (_objects.at_grow(offset, NULL) == object) {
 619         result = _values.at(field);
 620       }
 621       if (result != NULL) {
 622 #ifndef PRODUCT
 623         if (PrintIRDuringConstruction && Verbose) {
 624           tty->print_cr("Eliminated load: ");
 625           load->print_line();
 626         }
 627 #endif
 628         assert(result->type()->tag() == load->type()->tag(), "wrong types");
 629         return result;
 630       }
 631     }
 632     return load;
 633   }
 634 
 635   // Record this newly allocated object
 636   void new_instance(NewInstance* object) {
 637     int index = _newobjects.length();
 638     _newobjects.append(object);
 639     if (_fields.at_grow(index, NULL) == NULL) {
 640       _fields.at_put(index, new FieldBuffer());
 641     } else {
 642       _fields.at(index)->kill();
 643     }
 644   }
 645 
 646   void store_value(Value value) {
 647     int index = _newobjects.find(value);
 648     if (index != -1) {
 649       // stored a newly allocated object into another object.
 650       // Assume we've lost track of it as separate slice of memory.
 651       // We could do better by keeping track of whether individual
 652       // fields could alias each other.
 653       _newobjects.remove_at(index);
 654       // pull out the field info and store it at the end up the list
 655       // of field info list to be reused later.
 656       _fields.append(_fields.at(index));
 657       _fields.remove_at(index);
 658     }
 659   }
 660 
 661   void kill() {
 662     _newobjects.trunc_to(0);
 663     _objects.trunc_to(0);
 664     _values.kill();
 665   }
 666 };
 667 
 668 
 669 // Implementation of GraphBuilder's ScopeData
 670 
 671 GraphBuilder::ScopeData::ScopeData(ScopeData* parent)
 672   : _parent(parent)
 673   , _bci2block(NULL)
 674   , _scope(NULL)
 675   , _has_handler(false)
 676   , _stream(NULL)
 677   , _work_list(NULL)
 678   , _parsing_jsr(false)
 679   , _jsr_xhandlers(NULL)
 680   , _caller_stack_size(-1)
 681   , _continuation(NULL)
 682   , _num_returns(0)
 683   , _cleanup_block(NULL)
 684   , _cleanup_return_prev(NULL)
 685   , _cleanup_state(NULL)
 686   , _ignore_return(false)
 687 {
 688   if (parent != NULL) {
 689     _max_inline_size = (intx) ((float) NestedInliningSizeRatio * (float) parent->max_inline_size() / 100.0f);
 690   } else {
 691     _max_inline_size = MaxInlineSize;
 692   }
 693   if (_max_inline_size < MaxTrivialSize) {
 694     _max_inline_size = MaxTrivialSize;
 695   }
 696 }
 697 
 698 
 699 void GraphBuilder::kill_all() {
 700   if (UseLocalValueNumbering) {
 701     vmap()->kill_all();
 702   }
 703   _memory->kill();
 704 }
 705 
 706 
 707 BlockBegin* GraphBuilder::ScopeData::block_at(int bci) {
 708   if (parsing_jsr()) {
 709     // It is necessary to clone all blocks associated with a
 710     // subroutine, including those for exception handlers in the scope
 711     // of the method containing the jsr (because those exception
 712     // handlers may contain ret instructions in some cases).
 713     BlockBegin* block = bci2block()->at(bci);
 714     if (block != NULL && block == parent()->bci2block()->at(bci)) {
 715       BlockBegin* new_block = new BlockBegin(block->bci());
 716       if (PrintInitialBlockList) {
 717         tty->print_cr("CFG: cloned block %d (bci %d) as block %d for jsr",
 718                       block->block_id(), block->bci(), new_block->block_id());
 719       }
 720       // copy data from cloned blocked
 721       new_block->set_depth_first_number(block->depth_first_number());
 722       if (block->is_set(BlockBegin::parser_loop_header_flag)) new_block->set(BlockBegin::parser_loop_header_flag);
 723       // Preserve certain flags for assertion checking
 724       if (block->is_set(BlockBegin::subroutine_entry_flag)) new_block->set(BlockBegin::subroutine_entry_flag);
 725       if (block->is_set(BlockBegin::exception_entry_flag))  new_block->set(BlockBegin::exception_entry_flag);
 726 
 727       // copy was_visited_flag to allow early detection of bailouts
 728       // if a block that is used in a jsr has already been visited before,
 729       // it is shared between the normal control flow and a subroutine
 730       // BlockBegin::try_merge returns false when the flag is set, this leads
 731       // to a compilation bailout
 732       if (block->is_set(BlockBegin::was_visited_flag))  new_block->set(BlockBegin::was_visited_flag);
 733 
 734       bci2block()->at_put(bci, new_block);
 735       block = new_block;
 736     }
 737     return block;
 738   } else {
 739     return bci2block()->at(bci);
 740   }
 741 }
 742 
 743 
 744 XHandlers* GraphBuilder::ScopeData::xhandlers() const {
 745   if (_jsr_xhandlers == NULL) {
 746     assert(!parsing_jsr(), "");
 747     return scope()->xhandlers();
 748   }
 749   assert(parsing_jsr(), "");
 750   return _jsr_xhandlers;
 751 }
 752 
 753 
 754 void GraphBuilder::ScopeData::set_scope(IRScope* scope) {
 755   _scope = scope;
 756   bool parent_has_handler = false;
 757   if (parent() != NULL) {
 758     parent_has_handler = parent()->has_handler();
 759   }
 760   _has_handler = parent_has_handler || scope->xhandlers()->has_handlers();
 761 }
 762 
 763 
 764 void GraphBuilder::ScopeData::set_inline_cleanup_info(BlockBegin* block,
 765                                                       Instruction* return_prev,
 766                                                       ValueStack* return_state) {
 767   _cleanup_block       = block;
 768   _cleanup_return_prev = return_prev;
 769   _cleanup_state       = return_state;
 770 }
 771 
 772 
 773 void GraphBuilder::ScopeData::add_to_work_list(BlockBegin* block) {
 774   if (_work_list == NULL) {
 775     _work_list = new BlockList();
 776   }
 777 
 778   if (!block->is_set(BlockBegin::is_on_work_list_flag)) {
 779     // Do not start parsing the continuation block while in a
 780     // sub-scope
 781     if (parsing_jsr()) {
 782       if (block == jsr_continuation()) {
 783         return;
 784       }
 785     } else {
 786       if (block == continuation()) {
 787         return;
 788       }
 789     }
 790     block->set(BlockBegin::is_on_work_list_flag);
 791     _work_list->push(block);
 792 
 793     sort_top_into_worklist(_work_list, block);
 794   }
 795 }
 796 
 797 
 798 void GraphBuilder::sort_top_into_worklist(BlockList* worklist, BlockBegin* top) {
 799   assert(worklist->top() == top, "");
 800   // sort block descending into work list
 801   const int dfn = top->depth_first_number();
 802   assert(dfn != -1, "unknown depth first number");
 803   int i = worklist->length()-2;
 804   while (i >= 0) {
 805     BlockBegin* b = worklist->at(i);
 806     if (b->depth_first_number() < dfn) {
 807       worklist->at_put(i+1, b);
 808     } else {
 809       break;
 810     }
 811     i --;
 812   }
 813   if (i >= -1) worklist->at_put(i + 1, top);
 814 }
 815 
 816 
 817 BlockBegin* GraphBuilder::ScopeData::remove_from_work_list() {
 818   if (is_work_list_empty()) {
 819     return NULL;
 820   }
 821   return _work_list->pop();
 822 }
 823 
 824 
 825 bool GraphBuilder::ScopeData::is_work_list_empty() const {
 826   return (_work_list == NULL || _work_list->length() == 0);
 827 }
 828 
 829 
 830 void GraphBuilder::ScopeData::setup_jsr_xhandlers() {
 831   assert(parsing_jsr(), "");
 832   // clone all the exception handlers from the scope
 833   XHandlers* handlers = new XHandlers(scope()->xhandlers());
 834   const int n = handlers->length();
 835   for (int i = 0; i < n; i++) {
 836     // The XHandlers need to be adjusted to dispatch to the cloned
 837     // handler block instead of the default one but the synthetic
 838     // unlocker needs to be handled specially.  The synthetic unlocker
 839     // should be left alone since there can be only one and all code
 840     // should dispatch to the same one.
 841     XHandler* h = handlers->handler_at(i);
 842     assert(h->handler_bci() != SynchronizationEntryBCI, "must be real");
 843     h->set_entry_block(block_at(h->handler_bci()));
 844   }
 845   _jsr_xhandlers = handlers;
 846 }
 847 
 848 
 849 int GraphBuilder::ScopeData::num_returns() {
 850   if (parsing_jsr()) {
 851     return parent()->num_returns();
 852   }
 853   return _num_returns;
 854 }
 855 
 856 
 857 void GraphBuilder::ScopeData::incr_num_returns() {
 858   if (parsing_jsr()) {
 859     parent()->incr_num_returns();
 860   } else {
 861     ++_num_returns;
 862   }
 863 }
 864 
 865 
 866 // Implementation of GraphBuilder
 867 
 868 #define INLINE_BAILOUT(msg)        { inline_bailout(msg); return false; }
 869 
 870 
 871 void GraphBuilder::load_constant() {
 872   ciConstant con = stream()->get_constant();
 873   if (con.basic_type() == T_ILLEGAL) {
 874     BAILOUT("could not resolve a constant");
 875   } else {
 876     ValueType* t = illegalType;
 877     ValueStack* patch_state = NULL;
 878     switch (con.basic_type()) {
 879       case T_BOOLEAN: t = new IntConstant     (con.as_boolean()); break;
 880       case T_BYTE   : t = new IntConstant     (con.as_byte   ()); break;
 881       case T_CHAR   : t = new IntConstant     (con.as_char   ()); break;
 882       case T_SHORT  : t = new IntConstant     (con.as_short  ()); break;
 883       case T_INT    : t = new IntConstant     (con.as_int    ()); break;
 884       case T_LONG   : t = new LongConstant    (con.as_long   ()); break;
 885       case T_FLOAT  : t = new FloatConstant   (con.as_float  ()); break;
 886       case T_DOUBLE : t = new DoubleConstant  (con.as_double ()); break;
 887       case T_ARRAY  : t = new ArrayConstant   (con.as_object ()->as_array   ()); break;
 888       case T_OBJECT :
 889        {
 890         ciObject* obj = con.as_object();
 891         if (!obj->is_loaded()
 892             || (PatchALot && obj->klass() != ciEnv::current()->String_klass())) {
 893           patch_state = copy_state_before();
 894           t = new ObjectConstant(obj);
 895         } else {
 896           assert(obj->is_instance(), "must be java_mirror of klass");
 897           t = new InstanceConstant(obj->as_instance());
 898         }
 899         break;
 900        }
 901       default       : ShouldNotReachHere();
 902     }
 903     Value x;
 904     if (patch_state != NULL) {
 905       x = new Constant(t, patch_state);
 906     } else {
 907       x = new Constant(t);
 908     }
 909     push(t, append(x));
 910   }
 911 }
 912 
 913 
 914 void GraphBuilder::load_local(ValueType* type, int index) {
 915   Value x = state()->local_at(index);
 916   assert(x != NULL && !x->type()->is_illegal(), "access of illegal local variable");
 917   push(type, x);
 918 }
 919 
 920 
 921 void GraphBuilder::store_local(ValueType* type, int index) {
 922   Value x = pop(type);
 923   store_local(state(), x, index);
 924 }
 925 
 926 
 927 void GraphBuilder::store_local(ValueStack* state, Value x, int index) {
 928   if (parsing_jsr()) {
 929     // We need to do additional tracking of the location of the return
 930     // address for jsrs since we don't handle arbitrary jsr/ret
 931     // constructs. Here we are figuring out in which circumstances we
 932     // need to bail out.
 933     if (x->type()->is_address()) {
 934       scope_data()->set_jsr_return_address_local(index);
 935 
 936       // Also check parent jsrs (if any) at this time to see whether
 937       // they are using this local. We don't handle skipping over a
 938       // ret.
 939       for (ScopeData* cur_scope_data = scope_data()->parent();
 940            cur_scope_data != NULL && cur_scope_data->parsing_jsr() && cur_scope_data->scope() == scope();
 941            cur_scope_data = cur_scope_data->parent()) {
 942         if (cur_scope_data->jsr_return_address_local() == index) {
 943           BAILOUT("subroutine overwrites return address from previous subroutine");
 944         }
 945       }
 946     } else if (index == scope_data()->jsr_return_address_local()) {
 947       scope_data()->set_jsr_return_address_local(-1);
 948     }
 949   }
 950 
 951   state->store_local(index, round_fp(x));
 952 }
 953 
 954 
 955 void GraphBuilder::load_indexed(BasicType type) {
 956   // In case of in block code motion in range check elimination
 957   ValueStack* state_before = copy_state_indexed_access();
 958   compilation()->set_has_access_indexed(true);
 959   Value index = ipop();
 960   Value array = apop();
 961   Value length = NULL;
 962   if (CSEArrayLength ||
 963       (array->as_AccessField() && array->as_AccessField()->field()->is_constant()) ||
 964       (array->as_NewArray() && array->as_NewArray()->length() && array->as_NewArray()->length()->type()->is_constant())) {
 965     length = append(new ArrayLength(array, state_before));
 966   }
 967   push(as_ValueType(type), append(new LoadIndexed(array, index, length, type, state_before)));
 968 }
 969 
 970 
 971 void GraphBuilder::store_indexed(BasicType type) {
 972   // In case of in block code motion in range check elimination
 973   ValueStack* state_before = copy_state_indexed_access();
 974   compilation()->set_has_access_indexed(true);
 975   Value value = pop(as_ValueType(type));
 976   Value index = ipop();
 977   Value array = apop();
 978   Value length = NULL;
 979   if (CSEArrayLength ||
 980       (array->as_AccessField() && array->as_AccessField()->field()->is_constant()) ||
 981       (array->as_NewArray() && array->as_NewArray()->length() && array->as_NewArray()->length()->type()->is_constant())) {
 982     length = append(new ArrayLength(array, state_before));
 983   }
 984   ciType* array_type = array->declared_type();
 985   bool check_boolean = false;
 986   if (array_type != NULL) {
 987     if (array_type->is_loaded() &&
 988       array_type->as_array_klass()->element_type()->basic_type() == T_BOOLEAN) {
 989       assert(type == T_BYTE, "boolean store uses bastore");
 990       Value mask = append(new Constant(new IntConstant(1)));
 991       value = append(new LogicOp(Bytecodes::_iand, value, mask));
 992     }
 993   } else if (type == T_BYTE) {
 994     check_boolean = true;
 995   }
 996   StoreIndexed* result = new StoreIndexed(array, index, length, type, value, state_before, check_boolean);
 997   append(result);
 998   _memory->store_value(value);
 999 
1000   if (type == T_OBJECT && is_profiling()) {
1001     // Note that we'd collect profile data in this method if we wanted it.
1002     compilation()->set_would_profile(true);
1003 
1004     if (profile_checkcasts()) {
1005       result->set_profiled_method(method());
1006       result->set_profiled_bci(bci());
1007       result->set_should_profile(true);
1008     }
1009   }
1010 }
1011 
1012 
1013 void GraphBuilder::stack_op(Bytecodes::Code code) {
1014   switch (code) {
1015     case Bytecodes::_pop:
1016       { state()->raw_pop();
1017       }
1018       break;
1019     case Bytecodes::_pop2:
1020       { state()->raw_pop();
1021         state()->raw_pop();
1022       }
1023       break;
1024     case Bytecodes::_dup:
1025       { Value w = state()->raw_pop();
1026         state()->raw_push(w);
1027         state()->raw_push(w);
1028       }
1029       break;
1030     case Bytecodes::_dup_x1:
1031       { Value w1 = state()->raw_pop();
1032         Value w2 = state()->raw_pop();
1033         state()->raw_push(w1);
1034         state()->raw_push(w2);
1035         state()->raw_push(w1);
1036       }
1037       break;
1038     case Bytecodes::_dup_x2:
1039       { Value w1 = state()->raw_pop();
1040         Value w2 = state()->raw_pop();
1041         Value w3 = state()->raw_pop();
1042         state()->raw_push(w1);
1043         state()->raw_push(w3);
1044         state()->raw_push(w2);
1045         state()->raw_push(w1);
1046       }
1047       break;
1048     case Bytecodes::_dup2:
1049       { Value w1 = state()->raw_pop();
1050         Value w2 = state()->raw_pop();
1051         state()->raw_push(w2);
1052         state()->raw_push(w1);
1053         state()->raw_push(w2);
1054         state()->raw_push(w1);
1055       }
1056       break;
1057     case Bytecodes::_dup2_x1:
1058       { Value w1 = state()->raw_pop();
1059         Value w2 = state()->raw_pop();
1060         Value w3 = state()->raw_pop();
1061         state()->raw_push(w2);
1062         state()->raw_push(w1);
1063         state()->raw_push(w3);
1064         state()->raw_push(w2);
1065         state()->raw_push(w1);
1066       }
1067       break;
1068     case Bytecodes::_dup2_x2:
1069       { Value w1 = state()->raw_pop();
1070         Value w2 = state()->raw_pop();
1071         Value w3 = state()->raw_pop();
1072         Value w4 = state()->raw_pop();
1073         state()->raw_push(w2);
1074         state()->raw_push(w1);
1075         state()->raw_push(w4);
1076         state()->raw_push(w3);
1077         state()->raw_push(w2);
1078         state()->raw_push(w1);
1079       }
1080       break;
1081     case Bytecodes::_swap:
1082       { Value w1 = state()->raw_pop();
1083         Value w2 = state()->raw_pop();
1084         state()->raw_push(w1);
1085         state()->raw_push(w2);
1086       }
1087       break;
1088     default:
1089       ShouldNotReachHere();
1090       break;
1091   }
1092 }
1093 
1094 
1095 void GraphBuilder::arithmetic_op(ValueType* type, Bytecodes::Code code, ValueStack* state_before) {
1096   Value y = pop(type);
1097   Value x = pop(type);
1098   // NOTE: strictfp can be queried from current method since we don't
1099   // inline methods with differing strictfp bits
1100   Value res = new ArithmeticOp(code, x, y, method()->is_strict(), state_before);
1101   // Note: currently single-precision floating-point rounding on Intel is handled at the LIRGenerator level
1102   res = append(res);
1103   if (method()->is_strict()) {
1104     res = round_fp(res);
1105   }
1106   push(type, res);
1107 }
1108 
1109 
1110 void GraphBuilder::negate_op(ValueType* type) {
1111   push(type, append(new NegateOp(pop(type))));
1112 }
1113 
1114 
1115 void GraphBuilder::shift_op(ValueType* type, Bytecodes::Code code) {
1116   Value s = ipop();
1117   Value x = pop(type);
1118   // try to simplify
1119   // Note: This code should go into the canonicalizer as soon as it can
1120   //       can handle canonicalized forms that contain more than one node.
1121   if (CanonicalizeNodes && code == Bytecodes::_iushr) {
1122     // pattern: x >>> s
1123     IntConstant* s1 = s->type()->as_IntConstant();
1124     if (s1 != NULL) {
1125       // pattern: x >>> s1, with s1 constant
1126       ShiftOp* l = x->as_ShiftOp();
1127       if (l != NULL && l->op() == Bytecodes::_ishl) {
1128         // pattern: (a << b) >>> s1
1129         IntConstant* s0 = l->y()->type()->as_IntConstant();
1130         if (s0 != NULL) {
1131           // pattern: (a << s0) >>> s1
1132           const int s0c = s0->value() & 0x1F; // only the low 5 bits are significant for shifts
1133           const int s1c = s1->value() & 0x1F; // only the low 5 bits are significant for shifts
1134           if (s0c == s1c) {
1135             if (s0c == 0) {
1136               // pattern: (a << 0) >>> 0 => simplify to: a
1137               ipush(l->x());
1138             } else {
1139               // pattern: (a << s0c) >>> s0c => simplify to: a & m, with m constant
1140               assert(0 < s0c && s0c < BitsPerInt, "adjust code below to handle corner cases");
1141               const int m = (1 << (BitsPerInt - s0c)) - 1;
1142               Value s = append(new Constant(new IntConstant(m)));
1143               ipush(append(new LogicOp(Bytecodes::_iand, l->x(), s)));
1144             }
1145             return;
1146           }
1147         }
1148       }
1149     }
1150   }
1151   // could not simplify
1152   push(type, append(new ShiftOp(code, x, s)));
1153 }
1154 
1155 
1156 void GraphBuilder::logic_op(ValueType* type, Bytecodes::Code code) {
1157   Value y = pop(type);
1158   Value x = pop(type);
1159   push(type, append(new LogicOp(code, x, y)));
1160 }
1161 
1162 
1163 void GraphBuilder::compare_op(ValueType* type, Bytecodes::Code code) {
1164   ValueStack* state_before = copy_state_before();
1165   Value y = pop(type);
1166   Value x = pop(type);
1167   ipush(append(new CompareOp(code, x, y, state_before)));
1168 }
1169 
1170 
1171 void GraphBuilder::convert(Bytecodes::Code op, BasicType from, BasicType to) {
1172   push(as_ValueType(to), append(new Convert(op, pop(as_ValueType(from)), as_ValueType(to))));
1173 }
1174 
1175 
1176 void GraphBuilder::increment() {
1177   int index = stream()->get_index();
1178   int delta = stream()->is_wide() ? (signed short)Bytes::get_Java_u2(stream()->cur_bcp() + 4) : (signed char)(stream()->cur_bcp()[2]);
1179   load_local(intType, index);
1180   ipush(append(new Constant(new IntConstant(delta))));
1181   arithmetic_op(intType, Bytecodes::_iadd);
1182   store_local(intType, index);
1183 }
1184 
1185 
1186 void GraphBuilder::_goto(int from_bci, int to_bci) {
1187   Goto *x = new Goto(block_at(to_bci), to_bci <= from_bci);
1188   if (is_profiling()) {
1189     compilation()->set_would_profile(true);
1190     x->set_profiled_bci(bci());
1191     if (profile_branches()) {
1192       x->set_profiled_method(method());
1193       x->set_should_profile(true);
1194     }
1195   }
1196   append(x);
1197 }
1198 
1199 
1200 void GraphBuilder::if_node(Value x, If::Condition cond, Value y, ValueStack* state_before) {
1201   BlockBegin* tsux = block_at(stream()->get_dest());
1202   BlockBegin* fsux = block_at(stream()->next_bci());
1203   bool is_bb = tsux->bci() < stream()->cur_bci() || fsux->bci() < stream()->cur_bci();
1204   // In case of loop invariant code motion or predicate insertion
1205   // before the body of a loop the state is needed
1206   Instruction *i = append(new If(x, cond, false, y, tsux, fsux, (is_bb || compilation()->is_optimistic()) ? state_before : NULL, is_bb));
1207 
1208   assert(i->as_Goto() == NULL ||
1209          (i->as_Goto()->sux_at(0) == tsux  && i->as_Goto()->is_safepoint() == tsux->bci() < stream()->cur_bci()) ||
1210          (i->as_Goto()->sux_at(0) == fsux  && i->as_Goto()->is_safepoint() == fsux->bci() < stream()->cur_bci()),
1211          "safepoint state of Goto returned by canonicalizer incorrect");
1212 
1213   if (is_profiling()) {
1214     If* if_node = i->as_If();
1215     if (if_node != NULL) {
1216       // Note that we'd collect profile data in this method if we wanted it.
1217       compilation()->set_would_profile(true);
1218       // At level 2 we need the proper bci to count backedges
1219       if_node->set_profiled_bci(bci());
1220       if (profile_branches()) {
1221         // Successors can be rotated by the canonicalizer, check for this case.
1222         if_node->set_profiled_method(method());
1223         if_node->set_should_profile(true);
1224         if (if_node->tsux() == fsux) {
1225           if_node->set_swapped(true);
1226         }
1227       }
1228       return;
1229     }
1230 
1231     // Check if this If was reduced to Goto.
1232     Goto *goto_node = i->as_Goto();
1233     if (goto_node != NULL) {
1234       compilation()->set_would_profile(true);
1235       goto_node->set_profiled_bci(bci());
1236       if (profile_branches()) {
1237         goto_node->set_profiled_method(method());
1238         goto_node->set_should_profile(true);
1239         // Find out which successor is used.
1240         if (goto_node->default_sux() == tsux) {
1241           goto_node->set_direction(Goto::taken);
1242         } else if (goto_node->default_sux() == fsux) {
1243           goto_node->set_direction(Goto::not_taken);
1244         } else {
1245           ShouldNotReachHere();
1246         }
1247       }
1248       return;
1249     }
1250   }
1251 }
1252 
1253 
1254 void GraphBuilder::if_zero(ValueType* type, If::Condition cond) {
1255   Value y = append(new Constant(intZero));
1256   ValueStack* state_before = copy_state_before();
1257   Value x = ipop();
1258   if_node(x, cond, y, state_before);
1259 }
1260 
1261 
1262 void GraphBuilder::if_null(ValueType* type, If::Condition cond) {
1263   Value y = append(new Constant(objectNull));
1264   ValueStack* state_before = copy_state_before();
1265   Value x = apop();
1266   if_node(x, cond, y, state_before);
1267 }
1268 
1269 
1270 void GraphBuilder::if_same(ValueType* type, If::Condition cond) {
1271   ValueStack* state_before = copy_state_before();
1272   Value y = pop(type);
1273   Value x = pop(type);
1274   if_node(x, cond, y, state_before);
1275 }
1276 
1277 
1278 void GraphBuilder::jsr(int dest) {
1279   // We only handle well-formed jsrs (those which are "block-structured").
1280   // If the bytecodes are strange (jumping out of a jsr block) then we
1281   // might end up trying to re-parse a block containing a jsr which
1282   // has already been activated. Watch for this case and bail out.
1283   for (ScopeData* cur_scope_data = scope_data();
1284        cur_scope_data != NULL && cur_scope_data->parsing_jsr() && cur_scope_data->scope() == scope();
1285        cur_scope_data = cur_scope_data->parent()) {
1286     if (cur_scope_data->jsr_entry_bci() == dest) {
1287       BAILOUT("too-complicated jsr/ret structure");
1288     }
1289   }
1290 
1291   push(addressType, append(new Constant(new AddressConstant(next_bci()))));
1292   if (!try_inline_jsr(dest)) {
1293     return; // bailed out while parsing and inlining subroutine
1294   }
1295 }
1296 
1297 
1298 void GraphBuilder::ret(int local_index) {
1299   if (!parsing_jsr()) BAILOUT("ret encountered while not parsing subroutine");
1300 
1301   if (local_index != scope_data()->jsr_return_address_local()) {
1302     BAILOUT("can not handle complicated jsr/ret constructs");
1303   }
1304 
1305   // Rets simply become (NON-SAFEPOINT) gotos to the jsr continuation
1306   append(new Goto(scope_data()->jsr_continuation(), false));
1307 }
1308 
1309 
1310 void GraphBuilder::table_switch() {
1311   Bytecode_tableswitch sw(stream());
1312   const int l = sw.length();
1313   if (CanonicalizeNodes && l == 1) {
1314     // total of 2 successors => use If instead of switch
1315     // Note: This code should go into the canonicalizer as soon as it can
1316     //       can handle canonicalized forms that contain more than one node.
1317     Value key = append(new Constant(new IntConstant(sw.low_key())));
1318     BlockBegin* tsux = block_at(bci() + sw.dest_offset_at(0));
1319     BlockBegin* fsux = block_at(bci() + sw.default_offset());
1320     bool is_bb = tsux->bci() < bci() || fsux->bci() < bci();
1321     // In case of loop invariant code motion or predicate insertion
1322     // before the body of a loop the state is needed
1323     ValueStack* state_before = copy_state_if_bb(is_bb);
1324     append(new If(ipop(), If::eql, true, key, tsux, fsux, state_before, is_bb));
1325   } else {
1326     // collect successors
1327     BlockList* sux = new BlockList(l + 1, NULL);
1328     int i;
1329     bool has_bb = false;
1330     for (i = 0; i < l; i++) {
1331       sux->at_put(i, block_at(bci() + sw.dest_offset_at(i)));
1332       if (sw.dest_offset_at(i) < 0) has_bb = true;
1333     }
1334     // add default successor
1335     if (sw.default_offset() < 0) has_bb = true;
1336     sux->at_put(i, block_at(bci() + sw.default_offset()));
1337     // In case of loop invariant code motion or predicate insertion
1338     // before the body of a loop the state is needed
1339     ValueStack* state_before = copy_state_if_bb(has_bb);
1340     Instruction* res = append(new TableSwitch(ipop(), sux, sw.low_key(), state_before, has_bb));
1341 #ifdef ASSERT
1342     if (res->as_Goto()) {
1343       for (i = 0; i < l; i++) {
1344         if (sux->at(i) == res->as_Goto()->sux_at(0)) {
1345           assert(res->as_Goto()->is_safepoint() == sw.dest_offset_at(i) < 0, "safepoint state of Goto returned by canonicalizer incorrect");
1346         }
1347       }
1348     }
1349 #endif
1350   }
1351 }
1352 
1353 
1354 void GraphBuilder::lookup_switch() {
1355   Bytecode_lookupswitch sw(stream());
1356   const int l = sw.number_of_pairs();
1357   if (CanonicalizeNodes && l == 1) {
1358     // total of 2 successors => use If instead of switch
1359     // Note: This code should go into the canonicalizer as soon as it can
1360     //       can handle canonicalized forms that contain more than one node.
1361     // simplify to If
1362     LookupswitchPair pair = sw.pair_at(0);
1363     Value key = append(new Constant(new IntConstant(pair.match())));
1364     BlockBegin* tsux = block_at(bci() + pair.offset());
1365     BlockBegin* fsux = block_at(bci() + sw.default_offset());
1366     bool is_bb = tsux->bci() < bci() || fsux->bci() < bci();
1367     // In case of loop invariant code motion or predicate insertion
1368     // before the body of a loop the state is needed
1369     ValueStack* state_before = copy_state_if_bb(is_bb);;
1370     append(new If(ipop(), If::eql, true, key, tsux, fsux, state_before, is_bb));
1371   } else {
1372     // collect successors & keys
1373     BlockList* sux = new BlockList(l + 1, NULL);
1374     intArray* keys = new intArray(l, l, 0);
1375     int i;
1376     bool has_bb = false;
1377     for (i = 0; i < l; i++) {
1378       LookupswitchPair pair = sw.pair_at(i);
1379       if (pair.offset() < 0) has_bb = true;
1380       sux->at_put(i, block_at(bci() + pair.offset()));
1381       keys->at_put(i, pair.match());
1382     }
1383     // add default successor
1384     if (sw.default_offset() < 0) has_bb = true;
1385     sux->at_put(i, block_at(bci() + sw.default_offset()));
1386     // In case of loop invariant code motion or predicate insertion
1387     // before the body of a loop the state is needed
1388     ValueStack* state_before = copy_state_if_bb(has_bb);
1389     Instruction* res = append(new LookupSwitch(ipop(), sux, keys, state_before, has_bb));
1390 #ifdef ASSERT
1391     if (res->as_Goto()) {
1392       for (i = 0; i < l; i++) {
1393         if (sux->at(i) == res->as_Goto()->sux_at(0)) {
1394           assert(res->as_Goto()->is_safepoint() == sw.pair_at(i).offset() < 0, "safepoint state of Goto returned by canonicalizer incorrect");
1395         }
1396       }
1397     }
1398 #endif
1399   }
1400 }
1401 
1402 void GraphBuilder::call_register_finalizer() {
1403   // If the receiver requires finalization then emit code to perform
1404   // the registration on return.
1405 
1406   // Gather some type information about the receiver
1407   Value receiver = state()->local_at(0);
1408   assert(receiver != NULL, "must have a receiver");
1409   ciType* declared_type = receiver->declared_type();
1410   ciType* exact_type = receiver->exact_type();
1411   if (exact_type == NULL &&
1412       receiver->as_Local() &&
1413       receiver->as_Local()->java_index() == 0) {
1414     ciInstanceKlass* ik = compilation()->method()->holder();
1415     if (ik->is_final()) {
1416       exact_type = ik;
1417     } else if (UseCHA && !(ik->has_subklass() || ik->is_interface())) {
1418       // test class is leaf class
1419       compilation()->dependency_recorder()->assert_leaf_type(ik);
1420       exact_type = ik;
1421     } else {
1422       declared_type = ik;
1423     }
1424   }
1425 
1426   // see if we know statically that registration isn't required
1427   bool needs_check = true;
1428   if (exact_type != NULL) {
1429     needs_check = exact_type->as_instance_klass()->has_finalizer();
1430   } else if (declared_type != NULL) {
1431     ciInstanceKlass* ik = declared_type->as_instance_klass();
1432     if (!Dependencies::has_finalizable_subclass(ik)) {
1433       compilation()->dependency_recorder()->assert_has_no_finalizable_subclasses(ik);
1434       needs_check = false;
1435     }
1436   }
1437 
1438   if (needs_check) {
1439     // Perform the registration of finalizable objects.
1440     ValueStack* state_before = copy_state_for_exception();
1441     load_local(objectType, 0);
1442     append_split(new Intrinsic(voidType, vmIntrinsics::_Object_init,
1443                                state()->pop_arguments(1),
1444                                true, state_before, true));
1445   }
1446 }
1447 
1448 
1449 void GraphBuilder::method_return(Value x, bool ignore_return) {
1450   if (RegisterFinalizersAtInit &&
1451       method()->intrinsic_id() == vmIntrinsics::_Object_init) {
1452     call_register_finalizer();
1453   }
1454 
1455   bool need_mem_bar = false;
1456   if (method()->name() == ciSymbol::object_initializer_name() &&
1457       (scope()->wrote_final() || (AlwaysSafeConstructors && scope()->wrote_fields())
1458                               || (support_IRIW_for_not_multiple_copy_atomic_cpu && scope()->wrote_volatile())
1459      )){
1460     need_mem_bar = true;
1461   }
1462 
1463   BasicType bt = method()->return_type()->basic_type();
1464   switch (bt) {
1465     case T_BYTE:
1466     {
1467       Value shift = append(new Constant(new IntConstant(24)));
1468       x = append(new ShiftOp(Bytecodes::_ishl, x, shift));
1469       x = append(new ShiftOp(Bytecodes::_ishr, x, shift));
1470       break;
1471     }
1472     case T_SHORT:
1473     {
1474       Value shift = append(new Constant(new IntConstant(16)));
1475       x = append(new ShiftOp(Bytecodes::_ishl, x, shift));
1476       x = append(new ShiftOp(Bytecodes::_ishr, x, shift));
1477       break;
1478     }
1479     case T_CHAR:
1480     {
1481       Value mask = append(new Constant(new IntConstant(0xFFFF)));
1482       x = append(new LogicOp(Bytecodes::_iand, x, mask));
1483       break;
1484     }
1485     case T_BOOLEAN:
1486     {
1487       Value mask = append(new Constant(new IntConstant(1)));
1488       x = append(new LogicOp(Bytecodes::_iand, x, mask));
1489       break;
1490     }
1491   }
1492 
1493   // Check to see whether we are inlining. If so, Return
1494   // instructions become Gotos to the continuation point.
1495   if (continuation() != NULL) {
1496     assert(!method()->is_synchronized() || InlineSynchronizedMethods, "can not inline synchronized methods yet");
1497 
1498     if (compilation()->env()->dtrace_method_probes()) {
1499       // Report exit from inline methods
1500       Values* args = new Values(1);
1501       args->push(append(new Constant(new MethodConstant(method()))));
1502       append(new RuntimeCall(voidType, "dtrace_method_exit", CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_method_exit), args));
1503     }
1504 
1505     // If the inlined method is synchronized, the monitor must be
1506     // released before we jump to the continuation block.
1507     if (method()->is_synchronized()) {
1508       assert(state()->locks_size() == 1, "receiver must be locked here");
1509       monitorexit(state()->lock_at(0), SynchronizationEntryBCI);
1510     }
1511 
1512     if (need_mem_bar) {
1513       append(new MemBar(lir_membar_storestore));
1514     }
1515 
1516     // State at end of inlined method is the state of the caller
1517     // without the method parameters on stack, including the
1518     // return value, if any, of the inlined method on operand stack.
1519     int invoke_bci = state()->caller_state()->bci();
1520     set_state(state()->caller_state()->copy_for_parsing());
1521     if (x != NULL) {
1522       if (!ignore_return) {
1523         state()->push(x->type(), x);
1524       }
1525       if (profile_return() && x->type()->is_object_kind()) {
1526         ciMethod* caller = state()->scope()->method();
1527         ciMethodData* md = caller->method_data_or_null();
1528         ciProfileData* data = md->bci_to_data(invoke_bci);
1529         if (data->is_CallTypeData() || data->is_VirtualCallTypeData()) {
1530           bool has_return = data->is_CallTypeData() ? ((ciCallTypeData*)data)->has_return() : ((ciVirtualCallTypeData*)data)->has_return();
1531           // May not be true in case of an inlined call through a method handle intrinsic.
1532           if (has_return) {
1533             profile_return_type(x, method(), caller, invoke_bci);
1534           }
1535         }
1536       }
1537     }
1538     Goto* goto_callee = new Goto(continuation(), false);
1539 
1540     // See whether this is the first return; if so, store off some
1541     // of the state for later examination
1542     if (num_returns() == 0) {
1543       set_inline_cleanup_info();
1544     }
1545 
1546     // The current bci() is in the wrong scope, so use the bci() of
1547     // the continuation point.
1548     append_with_bci(goto_callee, scope_data()->continuation()->bci());
1549     incr_num_returns();
1550     return;
1551   }
1552 
1553   state()->truncate_stack(0);
1554   if (method()->is_synchronized()) {
1555     // perform the unlocking before exiting the method
1556     Value receiver;
1557     if (!method()->is_static()) {
1558       receiver = _initial_state->local_at(0);
1559     } else {
1560       receiver = append(new Constant(new ClassConstant(method()->holder())));
1561     }
1562     append_split(new MonitorExit(receiver, state()->unlock()));
1563   }
1564 
1565   if (need_mem_bar) {
1566       append(new MemBar(lir_membar_storestore));
1567   }
1568 
1569   assert(!ignore_return, "Ignoring return value works only for inlining");
1570   append(new Return(x));
1571 }
1572 
1573 Value GraphBuilder::make_constant(ciConstant field_value, ciField* field) {
1574   if (!field_value.is_valid())  return NULL;
1575 
1576   BasicType field_type = field_value.basic_type();
1577   ValueType* value = as_ValueType(field_value);
1578 
1579   // Attach dimension info to stable arrays.
1580   if (FoldStableValues &&
1581       field->is_stable() && field_type == T_ARRAY && !field_value.is_null_or_zero()) {
1582     ciArray* array = field_value.as_object()->as_array();
1583     jint dimension = field->type()->as_array_klass()->dimension();
1584     value = new StableArrayConstant(array, dimension);
1585   }
1586 
1587   switch (field_type) {
1588     case T_ARRAY:
1589     case T_OBJECT:
1590       if (field_value.as_object()->should_be_constant()) {
1591         return new Constant(value);
1592       }
1593       return NULL; // Not a constant.
1594     default:
1595       return new Constant(value);
1596   }
1597 }
1598 
1599 void GraphBuilder::access_field(Bytecodes::Code code) {
1600   bool will_link;
1601   ciField* field = stream()->get_field(will_link);
1602   ciInstanceKlass* holder = field->holder();
1603   BasicType field_type = field->type()->basic_type();
1604   ValueType* type = as_ValueType(field_type);
1605   // call will_link again to determine if the field is valid.
1606   const bool needs_patching = !holder->is_loaded() ||
1607                               !field->will_link(method(), code) ||
1608                               PatchALot;
1609 
1610   ValueStack* state_before = NULL;
1611   if (!holder->is_initialized() || needs_patching) {
1612     // save state before instruction for debug info when
1613     // deoptimization happens during patching
1614     state_before = copy_state_before();
1615   }
1616 
1617   Value obj = NULL;
1618   if (code == Bytecodes::_getstatic || code == Bytecodes::_putstatic) {
1619     if (state_before != NULL) {
1620       // build a patching constant
1621       obj = new Constant(new InstanceConstant(holder->java_mirror()), state_before);
1622     } else {
1623       obj = new Constant(new InstanceConstant(holder->java_mirror()));
1624     }
1625   }
1626 
1627   if (field->is_final() && (code == Bytecodes::_putfield)) {
1628     scope()->set_wrote_final();
1629   }
1630 
1631   if (code == Bytecodes::_putfield) {
1632     scope()->set_wrote_fields();
1633     if (field->is_volatile()) {
1634       scope()->set_wrote_volatile();
1635     }
1636   }
1637 
1638   const int offset = !needs_patching ? field->offset() : -1;
1639   switch (code) {
1640     case Bytecodes::_getstatic: {
1641       // check for compile-time constants, i.e., initialized static final fields
1642       Value constant = NULL;
1643       if (field->is_static_constant() && !PatchALot) {
1644         ciConstant field_value = field->constant_value();
1645         assert(!field->is_stable() || !field_value.is_null_or_zero(),
1646                "stable static w/ default value shouldn't be a constant");
1647         constant = make_constant(field_value, field);
1648       }
1649       if (constant != NULL) {
1650         push(type, append(constant));
1651       } else {
1652         if (state_before == NULL) {
1653           state_before = copy_state_for_exception();
1654         }
1655         push(type, append(new LoadField(append(obj), offset, field, true,
1656                                         state_before, needs_patching)));
1657       }
1658       break;
1659     }
1660     case Bytecodes::_putstatic: {
1661       Value val = pop(type);
1662       if (state_before == NULL) {
1663         state_before = copy_state_for_exception();
1664       }
1665       if (field->type()->basic_type() == T_BOOLEAN) {
1666         Value mask = append(new Constant(new IntConstant(1)));
1667         val = append(new LogicOp(Bytecodes::_iand, val, mask));
1668       }
1669       append(new StoreField(append(obj), offset, field, val, true, state_before, needs_patching));
1670       break;
1671     }
1672     case Bytecodes::_getfield: {
1673       // Check for compile-time constants, i.e., trusted final non-static fields.
1674       Value constant = NULL;
1675       obj = apop();
1676       ObjectType* obj_type = obj->type()->as_ObjectType();
1677       if (field->is_constant() && obj_type->is_constant() && !PatchALot) {
1678         ciObject* const_oop = obj_type->constant_value();
1679         if (!const_oop->is_null_object() && const_oop->is_loaded()) {
1680           ciConstant field_value = field->constant_value_of(const_oop);
1681           if (field_value.is_valid()) {
1682             constant = make_constant(field_value, field);
1683             // For CallSite objects add a dependency for invalidation of the optimization.
1684             if (field->is_call_site_target()) {
1685               ciCallSite* call_site = const_oop->as_call_site();
1686               if (!call_site->is_constant_call_site()) {
1687                 ciMethodHandle* target = field_value.as_object()->as_method_handle();
1688                 dependency_recorder()->assert_call_site_target_value(call_site, target);
1689               }
1690             }
1691           }
1692         }
1693       }
1694       if (constant != NULL) {
1695         push(type, append(constant));
1696       } else {
1697         if (state_before == NULL) {
1698           state_before = copy_state_for_exception();
1699         }
1700         LoadField* load = new LoadField(obj, offset, field, false, state_before, needs_patching);
1701         Value replacement = !needs_patching ? _memory->load(load) : load;
1702         if (replacement != load) {
1703           assert(replacement->is_linked() || !replacement->can_be_linked(), "should already by linked");
1704           push(type, replacement);
1705         } else {
1706           push(type, append(load));
1707         }
1708       }
1709       break;
1710     }
1711     case Bytecodes::_putfield: {
1712       Value val = pop(type);
1713       obj = apop();
1714       if (state_before == NULL) {
1715         state_before = copy_state_for_exception();
1716       }
1717       if (field->type()->basic_type() == T_BOOLEAN) {
1718         Value mask = append(new Constant(new IntConstant(1)));
1719         val = append(new LogicOp(Bytecodes::_iand, val, mask));
1720       }
1721       StoreField* store = new StoreField(obj, offset, field, val, false, state_before, needs_patching);
1722       if (!needs_patching) store = _memory->store(store);
1723       if (store != NULL) {
1724         append(store);
1725       }
1726       break;
1727     }
1728     default:
1729       ShouldNotReachHere();
1730       break;
1731   }
1732 }
1733 
1734 
1735 Dependencies* GraphBuilder::dependency_recorder() const {
1736   assert(DeoptC1, "need debug information");
1737   return compilation()->dependency_recorder();
1738 }
1739 
1740 // How many arguments do we want to profile?
1741 Values* GraphBuilder::args_list_for_profiling(ciMethod* target, int& start, bool may_have_receiver) {
1742   int n = 0;
1743   bool has_receiver = may_have_receiver && Bytecodes::has_receiver(method()->java_code_at_bci(bci()));
1744   start = has_receiver ? 1 : 0;
1745   if (profile_arguments()) {
1746     ciProfileData* data = method()->method_data()->bci_to_data(bci());
1747     if (data->is_CallTypeData() || data->is_VirtualCallTypeData()) {
1748       n = data->is_CallTypeData() ? data->as_CallTypeData()->number_of_arguments() : data->as_VirtualCallTypeData()->number_of_arguments();
1749     }
1750   }
1751   // If we are inlining then we need to collect arguments to profile parameters for the target
1752   if (profile_parameters() && target != NULL) {
1753     if (target->method_data() != NULL && target->method_data()->parameters_type_data() != NULL) {
1754       // The receiver is profiled on method entry so it's included in
1755       // the number of parameters but here we're only interested in
1756       // actual arguments.
1757       n = MAX2(n, target->method_data()->parameters_type_data()->number_of_parameters() - start);
1758     }
1759   }
1760   if (n > 0) {
1761     return new Values(n);
1762   }
1763   return NULL;
1764 }
1765 
1766 void GraphBuilder::check_args_for_profiling(Values* obj_args, int expected) {
1767 #ifdef ASSERT
1768   bool ignored_will_link;
1769   ciSignature* declared_signature = NULL;
1770   ciMethod* real_target = method()->get_method_at_bci(bci(), ignored_will_link, &declared_signature);
1771   assert(expected == obj_args->max_length() || real_target->is_method_handle_intrinsic(), "missed on arg?");
1772 #endif
1773 }
1774 
1775 // Collect arguments that we want to profile in a list
1776 Values* GraphBuilder::collect_args_for_profiling(Values* args, ciMethod* target, bool may_have_receiver) {
1777   int start = 0;
1778   Values* obj_args = args_list_for_profiling(target, start, may_have_receiver);
1779   if (obj_args == NULL) {
1780     return NULL;
1781   }
1782   int s = obj_args->max_length();
1783   // if called through method handle invoke, some arguments may have been popped
1784   for (int i = start, j = 0; j < s && i < args->length(); i++) {
1785     if (args->at(i)->type()->is_object_kind()) {
1786       obj_args->push(args->at(i));
1787       j++;
1788     }
1789   }
1790   check_args_for_profiling(obj_args, s);
1791   return obj_args;
1792 }
1793 
1794 
1795 void GraphBuilder::invoke(Bytecodes::Code code) {
1796   bool will_link;
1797   ciSignature* declared_signature = NULL;
1798   ciMethod*             target = stream()->get_method(will_link, &declared_signature);
1799   ciKlass*              holder = stream()->get_declared_method_holder();
1800   const Bytecodes::Code bc_raw = stream()->cur_bc_raw();
1801   assert(declared_signature != NULL, "cannot be null");

1802 
1803   ciInstanceKlass* klass = target->holder();
1804 
1805   // Make sure there are no evident problems with linking the instruction.
1806   bool is_resolved = true;
1807   if (klass->is_loaded() && !target->is_loaded()) {
1808     is_resolved = false; // method not found
1809   }
1810 
1811   // check if CHA possible: if so, change the code to invoke_special
1812   ciInstanceKlass* calling_klass = method()->holder();
1813   ciInstanceKlass* callee_holder = ciEnv::get_instance_klass_for_declared_method_holder(holder);
1814   ciInstanceKlass* actual_recv = callee_holder;
1815 




1816   CompileLog* log = compilation()->log();
1817   if (log != NULL)
1818       log->elem("call method='%d' instr='%s'",
1819                 log->identify(target),
1820                 Bytecodes::name(code));
1821 
1822   // Some methods are obviously bindable without any type checks so
1823   // convert them directly to an invokespecial or invokestatic.
1824   if (target->is_loaded() && !target->is_abstract() && target->can_be_statically_bound()) {
1825     switch (bc_raw) {
1826     case Bytecodes::_invokevirtual:
1827       code = Bytecodes::_invokespecial;
1828       break;
1829     case Bytecodes::_invokehandle:
1830       code = target->is_static() ? Bytecodes::_invokestatic : Bytecodes::_invokespecial;
1831       break;
1832     }
1833   } else {
1834     if (bc_raw == Bytecodes::_invokehandle) {
1835       assert(!will_link, "should come here only for unlinked call");
1836       code = Bytecodes::_invokespecial;
1837     }
1838   }
1839 
1840   // Push appendix argument (MethodType, CallSite, etc.), if one.
1841   bool patch_for_appendix = false;
1842   int patching_appendix_arg = 0;
1843   if (Bytecodes::has_optional_appendix(bc_raw) && (!will_link || PatchALot)) {
1844     Value arg = append(new Constant(new ObjectConstant(compilation()->env()->unloaded_ciinstance()), copy_state_before()));
1845     apush(arg);
1846     patch_for_appendix = true;
1847     patching_appendix_arg = (will_link && stream()->has_appendix()) ? 0 : 1;
1848   } else if (stream()->has_appendix()) {
1849     ciObject* appendix = stream()->get_appendix();
1850     Value arg = append(new Constant(new ObjectConstant(appendix)));
1851     apush(arg);
1852   }
1853 
1854   ciMethod* cha_monomorphic_target = NULL;
1855   ciMethod* exact_target = NULL;
1856   Value better_receiver = NULL;
1857   if (UseCHA && DeoptC1 && klass->is_loaded() && target->is_loaded() &&
1858       !(// %%% FIXME: Are both of these relevant?
1859         target->is_method_handle_intrinsic() ||
1860         target->is_compiled_lambda_form()) &&
1861       !patch_for_appendix) {
1862     Value receiver = NULL;
1863     ciInstanceKlass* receiver_klass = NULL;
1864     bool type_is_exact = false;
1865     // try to find a precise receiver type
1866     if (will_link && !target->is_static()) {
1867       int index = state()->stack_size() - (target->arg_size_no_receiver() + 1);
1868       receiver = state()->stack_at(index);
1869       ciType* type = receiver->exact_type();
1870       if (type != NULL && type->is_loaded() &&
1871           type->is_instance_klass() && !type->as_instance_klass()->is_interface()) {
1872         receiver_klass = (ciInstanceKlass*) type;
1873         type_is_exact = true;
1874       }
1875       if (type == NULL) {
1876         type = receiver->declared_type();
1877         if (type != NULL && type->is_loaded() &&
1878             type->is_instance_klass() && !type->as_instance_klass()->is_interface()) {
1879           receiver_klass = (ciInstanceKlass*) type;
1880           if (receiver_klass->is_leaf_type() && !receiver_klass->is_final()) {
1881             // Insert a dependency on this type since
1882             // find_monomorphic_target may assume it's already done.
1883             dependency_recorder()->assert_leaf_type(receiver_klass);
1884             type_is_exact = true;
1885           }
1886         }
1887       }
1888     }
1889     if (receiver_klass != NULL && type_is_exact &&
1890         receiver_klass->is_loaded() && code != Bytecodes::_invokespecial) {
1891       // If we have the exact receiver type we can bind directly to
1892       // the method to call.
1893       exact_target = target->resolve_invoke(calling_klass, receiver_klass);
1894       if (exact_target != NULL) {
1895         target = exact_target;
1896         code = Bytecodes::_invokespecial;
1897       }
1898     }
1899     if (receiver_klass != NULL &&
1900         receiver_klass->is_subtype_of(actual_recv) &&
1901         actual_recv->is_initialized()) {
1902       actual_recv = receiver_klass;
1903     }
1904 
1905     if ((code == Bytecodes::_invokevirtual && callee_holder->is_initialized()) ||
1906         (code == Bytecodes::_invokeinterface && callee_holder->is_initialized() && !actual_recv->is_interface())) {
1907       // Use CHA on the receiver to select a more precise method.
1908       cha_monomorphic_target = target->find_monomorphic_target(calling_klass, callee_holder, actual_recv);
1909     } else if (code == Bytecodes::_invokeinterface && callee_holder->is_loaded() && receiver != NULL) {
1910       // if there is only one implementor of this interface then we
1911       // may be able bind this invoke directly to the implementing
1912       // klass but we need both a dependence on the single interface
1913       // and on the method we bind to.  Additionally since all we know
1914       // about the receiver type is the it's supposed to implement the
1915       // interface we have to insert a check that it's the class we
1916       // expect.  Interface types are not checked by the verifier so
1917       // they are roughly equivalent to Object.
1918       ciInstanceKlass* singleton = NULL;
1919       if (target->holder()->nof_implementors() == 1) {
1920         singleton = target->holder()->implementor();
1921         assert(singleton != NULL && singleton != target->holder(),
1922                "just checking");
1923 
1924         assert(holder->is_interface(), "invokeinterface to non interface?");
1925         ciInstanceKlass* decl_interface = (ciInstanceKlass*)holder;
1926         // the number of implementors for decl_interface is less or
1927         // equal to the number of implementors for target->holder() so
1928         // if number of implementors of target->holder() == 1 then
1929         // number of implementors for decl_interface is 0 or 1. If
1930         // it's 0 then no class implements decl_interface and there's
1931         // no point in inlining.
1932         if (!holder->is_loaded() || decl_interface->nof_implementors() != 1 || decl_interface->has_default_methods()) {
1933           singleton = NULL;
1934         }
1935       }
1936       if (singleton) {
1937         cha_monomorphic_target = target->find_monomorphic_target(calling_klass, target->holder(), singleton);
1938         if (cha_monomorphic_target != NULL) {
1939           // If CHA is able to bind this invoke then update the class
1940           // to match that class, otherwise klass will refer to the
1941           // interface.
1942           klass = cha_monomorphic_target->holder();
1943           actual_recv = target->holder();
1944 
1945           // insert a check it's really the expected class.
1946           CheckCast* c = new CheckCast(klass, receiver, copy_state_for_exception());
1947           c->set_incompatible_class_change_check();
1948           c->set_direct_compare(klass->is_final());
1949           // pass the result of the checkcast so that the compiler has
1950           // more accurate type info in the inlinee
1951           better_receiver = append_split(c);
1952         }
1953       }
1954     }
1955   }
1956 
1957   if (cha_monomorphic_target != NULL) {
1958     if (cha_monomorphic_target->is_abstract()) {
1959       // Do not optimize for abstract methods
1960       cha_monomorphic_target = NULL;
1961     }
1962   }
1963 
1964   if (cha_monomorphic_target != NULL) {
1965     if (!(target->is_final_method())) {
1966       // If we inlined because CHA revealed only a single target method,
1967       // then we are dependent on that target method not getting overridden
1968       // by dynamic class loading.  Be sure to test the "static" receiver
1969       // dest_method here, as opposed to the actual receiver, which may
1970       // falsely lead us to believe that the receiver is final or private.
1971       dependency_recorder()->assert_unique_concrete_method(actual_recv, cha_monomorphic_target);
1972     }
1973     code = Bytecodes::_invokespecial;
1974   }
1975 
1976   // check if we could do inlining
1977   if (!PatchALot && Inline && is_resolved &&
1978       klass->is_loaded() && target->is_loaded() &&
1979       (klass->is_initialized() || klass->is_interface() && target->holder()->is_initialized())
1980       && !patch_for_appendix) {
1981     // callee is known => check if we have static binding
1982     if (code == Bytecodes::_invokestatic  ||
1983         code == Bytecodes::_invokespecial ||
1984         code == Bytecodes::_invokevirtual && target->is_final_method() ||
1985         code == Bytecodes::_invokedynamic) {
1986       ciMethod* inline_target = (cha_monomorphic_target != NULL) ? cha_monomorphic_target : target;
1987       // static binding => check if callee is ok
1988       bool success = try_inline(inline_target, (cha_monomorphic_target != NULL) || (exact_target != NULL), false, code, better_receiver);
1989 
1990       CHECK_BAILOUT();
1991       clear_inline_bailout();
1992 
1993       if (success) {
1994         // Register dependence if JVMTI has either breakpoint
1995         // setting or hotswapping of methods capabilities since they may
1996         // cause deoptimization.
1997         if (compilation()->env()->jvmti_can_hotswap_or_post_breakpoint()) {
1998           dependency_recorder()->assert_evol_method(inline_target);
1999         }
2000         return;
2001       }
2002     } else {
2003       print_inlining(target, "no static binding", /*success*/ false);
2004     }
2005   } else {
2006     print_inlining(target, "not inlineable", /*success*/ false);
2007   }
2008 
2009   // If we attempted an inline which did not succeed because of a
2010   // bailout during construction of the callee graph, the entire
2011   // compilation has to be aborted. This is fairly rare and currently
2012   // seems to only occur for jasm-generated classes which contain
2013   // jsr/ret pairs which are not associated with finally clauses and
2014   // do not have exception handlers in the containing method, and are
2015   // therefore not caught early enough to abort the inlining without
2016   // corrupting the graph. (We currently bail out with a non-empty
2017   // stack at a ret in these situations.)
2018   CHECK_BAILOUT();
2019 
2020   // inlining not successful => standard invoke
2021   bool is_loaded = target->is_loaded();
2022   ValueType* result_type = as_ValueType(declared_signature->return_type());
2023   ValueStack* state_before = copy_state_exhandling();
2024 
2025   // The bytecode (code) might change in this method so we are checking this very late.
2026   const bool has_receiver =
2027     code == Bytecodes::_invokespecial   ||
2028     code == Bytecodes::_invokevirtual   ||
2029     code == Bytecodes::_invokeinterface;
2030   Values* args = state()->pop_arguments(target->arg_size_no_receiver() + patching_appendix_arg);
2031   Value recv = has_receiver ? apop() : NULL;
2032   int vtable_index = Method::invalid_vtable_index;
2033 
2034 #ifdef SPARC
2035   // Currently only supported on Sparc.
2036   // The UseInlineCaches only controls dispatch to invokevirtuals for
2037   // loaded classes which we weren't able to statically bind.
2038   if (!UseInlineCaches && is_resolved && is_loaded && code == Bytecodes::_invokevirtual
2039       && !target->can_be_statically_bound()) {
2040     // Find a vtable index if one is available
2041     // For arrays, callee_holder is Object. Resolving the call with
2042     // Object would allow an illegal call to finalize() on an
2043     // array. We use holder instead: illegal calls to finalize() won't
2044     // be compiled as vtable calls (IC call resolution will catch the
2045     // illegal call) and the few legal calls on array types won't be
2046     // either.
2047     vtable_index = target->resolve_vtable_index(calling_klass, holder);
2048   }
2049 #endif
2050 
2051   if (is_resolved) {
2052     // invokespecial always needs a NULL check. invokevirtual where the target is
2053     // final or where it's not known whether the target is final requires a NULL check.
2054     // Otherwise normal invokevirtual will perform the null check during the lookup
2055     // logic or the unverified entry point.  Profiling of calls requires that
2056     // the null check is performed in all cases.

2057     bool do_null_check = (recv != NULL) &&
2058         (code == Bytecodes::_invokespecial || !is_loaded || target->is_final() || (is_profiling() && profile_calls()));
2059 
2060     if (do_null_check) {
2061       null_check(recv);
2062     }
2063 
2064     if (is_profiling()) {
2065       // Note that we'd collect profile data in this method if we wanted it.
2066       compilation()->set_would_profile(true);
2067 
2068       if (profile_calls()) {
2069         assert(cha_monomorphic_target == NULL || exact_target == NULL, "both can not be set");
2070         ciKlass* target_klass = NULL;
2071         if (cha_monomorphic_target != NULL) {
2072           target_klass = cha_monomorphic_target->holder();
2073         } else if (exact_target != NULL) {
2074           target_klass = exact_target->holder();
2075         }
2076         profile_call(target, recv, target_klass, collect_args_for_profiling(args, NULL, false), false);
2077       }
2078     }
2079   } else {
2080     // No need in null check or profiling: linkage error will be thrown at runtime
2081     // during resolution.
2082   }
2083 
2084   Invoke* result = new Invoke(code, result_type, recv, args, vtable_index, target, state_before);
2085   // push result
2086   append_split(result);
2087 
2088   if (result_type != voidType) {
2089     if (method()->is_strict()) {
2090       push(result_type, round_fp(result));
2091     } else {
2092       push(result_type, result);
2093     }
2094   }
2095   if (profile_return() && result_type->is_object_kind()) {
2096     profile_return_type(result, target);
2097   }
2098 }
2099 
2100 
2101 void GraphBuilder::new_instance(int klass_index) {
2102   ValueStack* state_before = copy_state_exhandling();
2103   bool will_link;
2104   ciKlass* klass = stream()->get_klass(will_link);
2105   assert(klass->is_instance_klass(), "must be an instance klass");
2106   NewInstance* new_instance = new NewInstance(klass->as_instance_klass(), state_before, stream()->is_unresolved_klass());
2107   _memory->new_instance(new_instance);
2108   apush(append_split(new_instance));
2109 }
2110 
2111 
2112 void GraphBuilder::new_type_array() {
2113   ValueStack* state_before = copy_state_exhandling();
2114   apush(append_split(new NewTypeArray(ipop(), (BasicType)stream()->get_index(), state_before)));
2115 }
2116 
2117 
2118 void GraphBuilder::new_object_array() {
2119   bool will_link;
2120   ciKlass* klass = stream()->get_klass(will_link);
2121   ValueStack* state_before = !klass->is_loaded() || PatchALot ? copy_state_before() : copy_state_exhandling();
2122   NewArray* n = new NewObjectArray(klass, ipop(), state_before);
2123   apush(append_split(n));
2124 }
2125 
2126 
2127 bool GraphBuilder::direct_compare(ciKlass* k) {
2128   if (k->is_loaded() && k->is_instance_klass() && !UseSlowPath) {
2129     ciInstanceKlass* ik = k->as_instance_klass();
2130     if (ik->is_final()) {
2131       return true;
2132     } else {
2133       if (DeoptC1 && UseCHA && !(ik->has_subklass() || ik->is_interface())) {
2134         // test class is leaf class
2135         dependency_recorder()->assert_leaf_type(ik);
2136         return true;
2137       }
2138     }
2139   }
2140   return false;
2141 }
2142 
2143 
2144 void GraphBuilder::check_cast(int klass_index) {
2145   bool will_link;
2146   ciKlass* klass = stream()->get_klass(will_link);
2147   ValueStack* state_before = !klass->is_loaded() || PatchALot ? copy_state_before() : copy_state_for_exception();
2148   CheckCast* c = new CheckCast(klass, apop(), state_before);
2149   apush(append_split(c));
2150   c->set_direct_compare(direct_compare(klass));
2151 
2152   if (is_profiling()) {
2153     // Note that we'd collect profile data in this method if we wanted it.
2154     compilation()->set_would_profile(true);
2155 
2156     if (profile_checkcasts()) {
2157       c->set_profiled_method(method());
2158       c->set_profiled_bci(bci());
2159       c->set_should_profile(true);
2160     }
2161   }
2162 }
2163 
2164 
2165 void GraphBuilder::instance_of(int klass_index) {
2166   bool will_link;
2167   ciKlass* klass = stream()->get_klass(will_link);
2168   ValueStack* state_before = !klass->is_loaded() || PatchALot ? copy_state_before() : copy_state_exhandling();
2169   InstanceOf* i = new InstanceOf(klass, apop(), state_before);
2170   ipush(append_split(i));
2171   i->set_direct_compare(direct_compare(klass));
2172 
2173   if (is_profiling()) {
2174     // Note that we'd collect profile data in this method if we wanted it.
2175     compilation()->set_would_profile(true);
2176 
2177     if (profile_checkcasts()) {
2178       i->set_profiled_method(method());
2179       i->set_profiled_bci(bci());
2180       i->set_should_profile(true);
2181     }
2182   }
2183 }
2184 
2185 
2186 void GraphBuilder::monitorenter(Value x, int bci) {
2187   // save state before locking in case of deoptimization after a NullPointerException
2188   ValueStack* state_before = copy_state_for_exception_with_bci(bci);
2189   append_with_bci(new MonitorEnter(x, state()->lock(x), state_before), bci);
2190   kill_all();
2191 }
2192 
2193 
2194 void GraphBuilder::monitorexit(Value x, int bci) {
2195   append_with_bci(new MonitorExit(x, state()->unlock()), bci);
2196   kill_all();
2197 }
2198 
2199 
2200 void GraphBuilder::new_multi_array(int dimensions) {
2201   bool will_link;
2202   ciKlass* klass = stream()->get_klass(will_link);
2203   ValueStack* state_before = !klass->is_loaded() || PatchALot ? copy_state_before() : copy_state_exhandling();
2204 
2205   Values* dims = new Values(dimensions, dimensions, NULL);
2206   // fill in all dimensions
2207   int i = dimensions;
2208   while (i-- > 0) dims->at_put(i, ipop());
2209   // create array
2210   NewArray* n = new NewMultiArray(klass, dims, state_before);
2211   apush(append_split(n));
2212 }
2213 
2214 
2215 void GraphBuilder::throw_op(int bci) {
2216   // We require that the debug info for a Throw be the "state before"
2217   // the Throw (i.e., exception oop is still on TOS)
2218   ValueStack* state_before = copy_state_before_with_bci(bci);
2219   Throw* t = new Throw(apop(), state_before);
2220   // operand stack not needed after a throw
2221   state()->truncate_stack(0);
2222   append_with_bci(t, bci);
2223 }
2224 
2225 
2226 Value GraphBuilder::round_fp(Value fp_value) {
2227   // no rounding needed if SSE2 is used
2228   if (RoundFPResults && UseSSE < 2) {
2229     // Must currently insert rounding node for doubleword values that
2230     // are results of expressions (i.e., not loads from memory or
2231     // constants)
2232     if (fp_value->type()->tag() == doubleTag &&
2233         fp_value->as_Constant() == NULL &&
2234         fp_value->as_Local() == NULL &&       // method parameters need no rounding
2235         fp_value->as_RoundFP() == NULL) {
2236       return append(new RoundFP(fp_value));
2237     }
2238   }
2239   return fp_value;
2240 }
2241 
2242 
2243 Instruction* GraphBuilder::append_with_bci(Instruction* instr, int bci) {
2244   Canonicalizer canon(compilation(), instr, bci);
2245   Instruction* i1 = canon.canonical();
2246   if (i1->is_linked() || !i1->can_be_linked()) {
2247     // Canonicalizer returned an instruction which was already
2248     // appended so simply return it.
2249     return i1;
2250   }
2251 
2252   if (UseLocalValueNumbering) {
2253     // Lookup the instruction in the ValueMap and add it to the map if
2254     // it's not found.
2255     Instruction* i2 = vmap()->find_insert(i1);
2256     if (i2 != i1) {
2257       // found an entry in the value map, so just return it.
2258       assert(i2->is_linked(), "should already be linked");
2259       return i2;
2260     }
2261     ValueNumberingEffects vne(vmap());
2262     i1->visit(&vne);
2263   }
2264 
2265   // i1 was not eliminated => append it
2266   assert(i1->next() == NULL, "shouldn't already be linked");
2267   _last = _last->set_next(i1, canon.bci());
2268 
2269   if (++_instruction_count >= InstructionCountCutoff && !bailed_out()) {
2270     // set the bailout state but complete normal processing.  We
2271     // might do a little more work before noticing the bailout so we
2272     // want processing to continue normally until it's noticed.
2273     bailout("Method and/or inlining is too large");
2274   }
2275 
2276 #ifndef PRODUCT
2277   if (PrintIRDuringConstruction) {
2278     InstructionPrinter ip;
2279     ip.print_line(i1);
2280     if (Verbose) {
2281       state()->print();
2282     }
2283   }
2284 #endif
2285 
2286   // save state after modification of operand stack for StateSplit instructions
2287   StateSplit* s = i1->as_StateSplit();
2288   if (s != NULL) {
2289     if (EliminateFieldAccess) {
2290       Intrinsic* intrinsic = s->as_Intrinsic();
2291       if (s->as_Invoke() != NULL || (intrinsic && !intrinsic->preserves_state())) {
2292         _memory->kill();
2293       }
2294     }
2295     s->set_state(state()->copy(ValueStack::StateAfter, canon.bci()));
2296   }
2297 
2298   // set up exception handlers for this instruction if necessary
2299   if (i1->can_trap()) {
2300     i1->set_exception_handlers(handle_exception(i1));
2301     assert(i1->exception_state() != NULL || !i1->needs_exception_state() || bailed_out(), "handle_exception must set exception state");
2302   }
2303   return i1;
2304 }
2305 
2306 
2307 Instruction* GraphBuilder::append(Instruction* instr) {
2308   assert(instr->as_StateSplit() == NULL || instr->as_BlockEnd() != NULL, "wrong append used");
2309   return append_with_bci(instr, bci());
2310 }
2311 
2312 
2313 Instruction* GraphBuilder::append_split(StateSplit* instr) {
2314   return append_with_bci(instr, bci());
2315 }
2316 
2317 
2318 void GraphBuilder::null_check(Value value) {
2319   if (value->as_NewArray() != NULL || value->as_NewInstance() != NULL) {
2320     return;
2321   } else {
2322     Constant* con = value->as_Constant();
2323     if (con) {
2324       ObjectType* c = con->type()->as_ObjectType();
2325       if (c && c->is_loaded()) {
2326         ObjectConstant* oc = c->as_ObjectConstant();
2327         if (!oc || !oc->value()->is_null_object()) {
2328           return;
2329         }
2330       }
2331     }
2332   }
2333   append(new NullCheck(value, copy_state_for_exception()));
2334 }
2335 
2336 
2337 
2338 XHandlers* GraphBuilder::handle_exception(Instruction* instruction) {
2339   if (!has_handler() && (!instruction->needs_exception_state() || instruction->exception_state() != NULL)) {
2340     assert(instruction->exception_state() == NULL
2341            || instruction->exception_state()->kind() == ValueStack::EmptyExceptionState
2342            || (instruction->exception_state()->kind() == ValueStack::ExceptionState && _compilation->env()->should_retain_local_variables()),
2343            "exception_state should be of exception kind");
2344     return new XHandlers();
2345   }
2346 
2347   XHandlers*  exception_handlers = new XHandlers();
2348   ScopeData*  cur_scope_data = scope_data();
2349   ValueStack* cur_state = instruction->state_before();
2350   ValueStack* prev_state = NULL;
2351   int scope_count = 0;
2352 
2353   assert(cur_state != NULL, "state_before must be set");
2354   do {
2355     int cur_bci = cur_state->bci();
2356     assert(cur_scope_data->scope() == cur_state->scope(), "scopes do not match");
2357     assert(cur_bci == SynchronizationEntryBCI || cur_bci == cur_scope_data->stream()->cur_bci(), "invalid bci");
2358 
2359     // join with all potential exception handlers
2360     XHandlers* list = cur_scope_data->xhandlers();
2361     const int n = list->length();
2362     for (int i = 0; i < n; i++) {
2363       XHandler* h = list->handler_at(i);
2364       if (h->covers(cur_bci)) {
2365         // h is a potential exception handler => join it
2366         compilation()->set_has_exception_handlers(true);
2367 
2368         BlockBegin* entry = h->entry_block();
2369         if (entry == block()) {
2370           // It's acceptable for an exception handler to cover itself
2371           // but we don't handle that in the parser currently.  It's
2372           // very rare so we bailout instead of trying to handle it.
2373           BAILOUT_("exception handler covers itself", exception_handlers);
2374         }
2375         assert(entry->bci() == h->handler_bci(), "must match");
2376         assert(entry->bci() == -1 || entry == cur_scope_data->block_at(entry->bci()), "blocks must correspond");
2377 
2378         // previously this was a BAILOUT, but this is not necessary
2379         // now because asynchronous exceptions are not handled this way.
2380         assert(entry->state() == NULL || cur_state->total_locks_size() == entry->state()->total_locks_size(), "locks do not match");
2381 
2382         // xhandler start with an empty expression stack
2383         if (cur_state->stack_size() != 0) {
2384           cur_state = cur_state->copy(ValueStack::ExceptionState, cur_state->bci());
2385         }
2386         if (instruction->exception_state() == NULL) {
2387           instruction->set_exception_state(cur_state);
2388         }
2389 
2390         // Note: Usually this join must work. However, very
2391         // complicated jsr-ret structures where we don't ret from
2392         // the subroutine can cause the objects on the monitor
2393         // stacks to not match because blocks can be parsed twice.
2394         // The only test case we've seen so far which exhibits this
2395         // problem is caught by the infinite recursion test in
2396         // GraphBuilder::jsr() if the join doesn't work.
2397         if (!entry->try_merge(cur_state)) {
2398           BAILOUT_("error while joining with exception handler, prob. due to complicated jsr/rets", exception_handlers);
2399         }
2400 
2401         // add current state for correct handling of phi functions at begin of xhandler
2402         int phi_operand = entry->add_exception_state(cur_state);
2403 
2404         // add entry to the list of xhandlers of this block
2405         _block->add_exception_handler(entry);
2406 
2407         // add back-edge from xhandler entry to this block
2408         if (!entry->is_predecessor(_block)) {
2409           entry->add_predecessor(_block);
2410         }
2411 
2412         // clone XHandler because phi_operand and scope_count can not be shared
2413         XHandler* new_xhandler = new XHandler(h);
2414         new_xhandler->set_phi_operand(phi_operand);
2415         new_xhandler->set_scope_count(scope_count);
2416         exception_handlers->append(new_xhandler);
2417 
2418         // fill in exception handler subgraph lazily
2419         assert(!entry->is_set(BlockBegin::was_visited_flag), "entry must not be visited yet");
2420         cur_scope_data->add_to_work_list(entry);
2421 
2422         // stop when reaching catchall
2423         if (h->catch_type() == 0) {
2424           return exception_handlers;
2425         }
2426       }
2427     }
2428 
2429     if (exception_handlers->length() == 0) {
2430       // This scope and all callees do not handle exceptions, so the local
2431       // variables of this scope are not needed. However, the scope itself is
2432       // required for a correct exception stack trace -> clear out the locals.
2433       if (_compilation->env()->should_retain_local_variables()) {
2434         cur_state = cur_state->copy(ValueStack::ExceptionState, cur_state->bci());
2435       } else {
2436         cur_state = cur_state->copy(ValueStack::EmptyExceptionState, cur_state->bci());
2437       }
2438       if (prev_state != NULL) {
2439         prev_state->set_caller_state(cur_state);
2440       }
2441       if (instruction->exception_state() == NULL) {
2442         instruction->set_exception_state(cur_state);
2443       }
2444     }
2445 
2446     // Set up iteration for next time.
2447     // If parsing a jsr, do not grab exception handlers from the
2448     // parent scopes for this method (already got them, and they
2449     // needed to be cloned)
2450 
2451     while (cur_scope_data->parsing_jsr()) {
2452       cur_scope_data = cur_scope_data->parent();
2453     }
2454 
2455     assert(cur_scope_data->scope() == cur_state->scope(), "scopes do not match");
2456     assert(cur_state->locks_size() == 0 || cur_state->locks_size() == 1, "unlocking must be done in a catchall exception handler");
2457 
2458     prev_state = cur_state;
2459     cur_state = cur_state->caller_state();
2460     cur_scope_data = cur_scope_data->parent();
2461     scope_count++;
2462   } while (cur_scope_data != NULL);
2463 
2464   return exception_handlers;
2465 }
2466 
2467 
2468 // Helper class for simplifying Phis.
2469 class PhiSimplifier : public BlockClosure {
2470  private:
2471   bool _has_substitutions;
2472   Value simplify(Value v);
2473 
2474  public:
2475   PhiSimplifier(BlockBegin* start) : _has_substitutions(false) {
2476     start->iterate_preorder(this);
2477     if (_has_substitutions) {
2478       SubstitutionResolver sr(start);
2479     }
2480   }
2481   void block_do(BlockBegin* b);
2482   bool has_substitutions() const { return _has_substitutions; }
2483 };
2484 
2485 
2486 Value PhiSimplifier::simplify(Value v) {
2487   Phi* phi = v->as_Phi();
2488 
2489   if (phi == NULL) {
2490     // no phi function
2491     return v;
2492   } else if (v->has_subst()) {
2493     // already substituted; subst can be phi itself -> simplify
2494     return simplify(v->subst());
2495   } else if (phi->is_set(Phi::cannot_simplify)) {
2496     // already tried to simplify phi before
2497     return phi;
2498   } else if (phi->is_set(Phi::visited)) {
2499     // break cycles in phi functions
2500     return phi;
2501   } else if (phi->type()->is_illegal()) {
2502     // illegal phi functions are ignored anyway
2503     return phi;
2504 
2505   } else {
2506     // mark phi function as processed to break cycles in phi functions
2507     phi->set(Phi::visited);
2508 
2509     // simplify x = [y, x] and x = [y, y] to y
2510     Value subst = NULL;
2511     int opd_count = phi->operand_count();
2512     for (int i = 0; i < opd_count; i++) {
2513       Value opd = phi->operand_at(i);
2514       assert(opd != NULL, "Operand must exist!");
2515 
2516       if (opd->type()->is_illegal()) {
2517         // if one operand is illegal, the entire phi function is illegal
2518         phi->make_illegal();
2519         phi->clear(Phi::visited);
2520         return phi;
2521       }
2522 
2523       Value new_opd = simplify(opd);
2524       assert(new_opd != NULL, "Simplified operand must exist!");
2525 
2526       if (new_opd != phi && new_opd != subst) {
2527         if (subst == NULL) {
2528           subst = new_opd;
2529         } else {
2530           // no simplification possible
2531           phi->set(Phi::cannot_simplify);
2532           phi->clear(Phi::visited);
2533           return phi;
2534         }
2535       }
2536     }
2537 
2538     // sucessfully simplified phi function
2539     assert(subst != NULL, "illegal phi function");
2540     _has_substitutions = true;
2541     phi->clear(Phi::visited);
2542     phi->set_subst(subst);
2543 
2544 #ifndef PRODUCT
2545     if (PrintPhiFunctions) {
2546       tty->print_cr("simplified phi function %c%d to %c%d (Block B%d)", phi->type()->tchar(), phi->id(), subst->type()->tchar(), subst->id(), phi->block()->block_id());
2547     }
2548 #endif
2549 
2550     return subst;
2551   }
2552 }
2553 
2554 
2555 void PhiSimplifier::block_do(BlockBegin* b) {
2556   for_each_phi_fun(b, phi,
2557     simplify(phi);
2558   );
2559 
2560 #ifdef ASSERT
2561   for_each_phi_fun(b, phi,
2562                    assert(phi->operand_count() != 1 || phi->subst() != phi, "missed trivial simplification");
2563   );
2564 
2565   ValueStack* state = b->state()->caller_state();
2566   for_each_state_value(state, value,
2567     Phi* phi = value->as_Phi();
2568     assert(phi == NULL || phi->block() != b, "must not have phi function to simplify in caller state");
2569   );
2570 #endif
2571 }
2572 
2573 // This method is called after all blocks are filled with HIR instructions
2574 // It eliminates all Phi functions of the form x = [y, y] and x = [y, x]
2575 void GraphBuilder::eliminate_redundant_phis(BlockBegin* start) {
2576   PhiSimplifier simplifier(start);
2577 }
2578 
2579 
2580 void GraphBuilder::connect_to_end(BlockBegin* beg) {
2581   // setup iteration
2582   kill_all();
2583   _block = beg;
2584   _state = beg->state()->copy_for_parsing();
2585   _last  = beg;
2586   iterate_bytecodes_for_block(beg->bci());
2587 }
2588 
2589 
2590 BlockEnd* GraphBuilder::iterate_bytecodes_for_block(int bci) {
2591 #ifndef PRODUCT
2592   if (PrintIRDuringConstruction) {
2593     tty->cr();
2594     InstructionPrinter ip;
2595     ip.print_instr(_block); tty->cr();
2596     ip.print_stack(_block->state()); tty->cr();
2597     ip.print_inline_level(_block);
2598     ip.print_head();
2599     tty->print_cr("locals size: %d stack size: %d", state()->locals_size(), state()->stack_size());
2600   }
2601 #endif
2602   _skip_block = false;
2603   assert(state() != NULL, "ValueStack missing!");
2604   CompileLog* log = compilation()->log();
2605   ciBytecodeStream s(method());
2606   s.reset_to_bci(bci);
2607   int prev_bci = bci;
2608   scope_data()->set_stream(&s);
2609   // iterate
2610   Bytecodes::Code code = Bytecodes::_illegal;
2611   bool push_exception = false;
2612 
2613   if (block()->is_set(BlockBegin::exception_entry_flag) && block()->next() == NULL) {
2614     // first thing in the exception entry block should be the exception object.
2615     push_exception = true;
2616   }
2617 
2618   bool ignore_return = scope_data()->ignore_return();
2619 
2620   while (!bailed_out() && last()->as_BlockEnd() == NULL &&
2621          (code = stream()->next()) != ciBytecodeStream::EOBC() &&
2622          (block_at(s.cur_bci()) == NULL || block_at(s.cur_bci()) == block())) {
2623     assert(state()->kind() == ValueStack::Parsing, "invalid state kind");
2624 
2625     if (log != NULL)
2626       log->set_context("bc code='%d' bci='%d'", (int)code, s.cur_bci());
2627 
2628     // Check for active jsr during OSR compilation
2629     if (compilation()->is_osr_compile()
2630         && scope()->is_top_scope()
2631         && parsing_jsr()
2632         && s.cur_bci() == compilation()->osr_bci()) {
2633       bailout("OSR not supported while a jsr is active");
2634     }
2635 
2636     if (push_exception) {
2637       apush(append(new ExceptionObject()));
2638       push_exception = false;
2639     }
2640 
2641     // handle bytecode
2642     switch (code) {
2643       case Bytecodes::_nop            : /* nothing to do */ break;
2644       case Bytecodes::_aconst_null    : apush(append(new Constant(objectNull            ))); break;
2645       case Bytecodes::_iconst_m1      : ipush(append(new Constant(new IntConstant   (-1)))); break;
2646       case Bytecodes::_iconst_0       : ipush(append(new Constant(intZero               ))); break;
2647       case Bytecodes::_iconst_1       : ipush(append(new Constant(intOne                ))); break;
2648       case Bytecodes::_iconst_2       : ipush(append(new Constant(new IntConstant   ( 2)))); break;
2649       case Bytecodes::_iconst_3       : ipush(append(new Constant(new IntConstant   ( 3)))); break;
2650       case Bytecodes::_iconst_4       : ipush(append(new Constant(new IntConstant   ( 4)))); break;
2651       case Bytecodes::_iconst_5       : ipush(append(new Constant(new IntConstant   ( 5)))); break;
2652       case Bytecodes::_lconst_0       : lpush(append(new Constant(new LongConstant  ( 0)))); break;
2653       case Bytecodes::_lconst_1       : lpush(append(new Constant(new LongConstant  ( 1)))); break;
2654       case Bytecodes::_fconst_0       : fpush(append(new Constant(new FloatConstant ( 0)))); break;
2655       case Bytecodes::_fconst_1       : fpush(append(new Constant(new FloatConstant ( 1)))); break;
2656       case Bytecodes::_fconst_2       : fpush(append(new Constant(new FloatConstant ( 2)))); break;
2657       case Bytecodes::_dconst_0       : dpush(append(new Constant(new DoubleConstant( 0)))); break;
2658       case Bytecodes::_dconst_1       : dpush(append(new Constant(new DoubleConstant( 1)))); break;
2659       case Bytecodes::_bipush         : ipush(append(new Constant(new IntConstant(((signed char*)s.cur_bcp())[1])))); break;
2660       case Bytecodes::_sipush         : ipush(append(new Constant(new IntConstant((short)Bytes::get_Java_u2(s.cur_bcp()+1))))); break;
2661       case Bytecodes::_ldc            : // fall through
2662       case Bytecodes::_ldc_w          : // fall through
2663       case Bytecodes::_ldc2_w         : load_constant(); break;
2664       case Bytecodes::_iload          : load_local(intType     , s.get_index()); break;
2665       case Bytecodes::_lload          : load_local(longType    , s.get_index()); break;
2666       case Bytecodes::_fload          : load_local(floatType   , s.get_index()); break;
2667       case Bytecodes::_dload          : load_local(doubleType  , s.get_index()); break;
2668       case Bytecodes::_aload          : load_local(instanceType, s.get_index()); break;
2669       case Bytecodes::_iload_0        : load_local(intType   , 0); break;
2670       case Bytecodes::_iload_1        : load_local(intType   , 1); break;
2671       case Bytecodes::_iload_2        : load_local(intType   , 2); break;
2672       case Bytecodes::_iload_3        : load_local(intType   , 3); break;
2673       case Bytecodes::_lload_0        : load_local(longType  , 0); break;
2674       case Bytecodes::_lload_1        : load_local(longType  , 1); break;
2675       case Bytecodes::_lload_2        : load_local(longType  , 2); break;
2676       case Bytecodes::_lload_3        : load_local(longType  , 3); break;
2677       case Bytecodes::_fload_0        : load_local(floatType , 0); break;
2678       case Bytecodes::_fload_1        : load_local(floatType , 1); break;
2679       case Bytecodes::_fload_2        : load_local(floatType , 2); break;
2680       case Bytecodes::_fload_3        : load_local(floatType , 3); break;
2681       case Bytecodes::_dload_0        : load_local(doubleType, 0); break;
2682       case Bytecodes::_dload_1        : load_local(doubleType, 1); break;
2683       case Bytecodes::_dload_2        : load_local(doubleType, 2); break;
2684       case Bytecodes::_dload_3        : load_local(doubleType, 3); break;
2685       case Bytecodes::_aload_0        : load_local(objectType, 0); break;
2686       case Bytecodes::_aload_1        : load_local(objectType, 1); break;
2687       case Bytecodes::_aload_2        : load_local(objectType, 2); break;
2688       case Bytecodes::_aload_3        : load_local(objectType, 3); break;
2689       case Bytecodes::_iaload         : load_indexed(T_INT   ); break;
2690       case Bytecodes::_laload         : load_indexed(T_LONG  ); break;
2691       case Bytecodes::_faload         : load_indexed(T_FLOAT ); break;
2692       case Bytecodes::_daload         : load_indexed(T_DOUBLE); break;
2693       case Bytecodes::_aaload         : load_indexed(T_OBJECT); break;
2694       case Bytecodes::_baload         : load_indexed(T_BYTE  ); break;
2695       case Bytecodes::_caload         : load_indexed(T_CHAR  ); break;
2696       case Bytecodes::_saload         : load_indexed(T_SHORT ); break;
2697       case Bytecodes::_istore         : store_local(intType   , s.get_index()); break;
2698       case Bytecodes::_lstore         : store_local(longType  , s.get_index()); break;
2699       case Bytecodes::_fstore         : store_local(floatType , s.get_index()); break;
2700       case Bytecodes::_dstore         : store_local(doubleType, s.get_index()); break;
2701       case Bytecodes::_astore         : store_local(objectType, s.get_index()); break;
2702       case Bytecodes::_istore_0       : store_local(intType   , 0); break;
2703       case Bytecodes::_istore_1       : store_local(intType   , 1); break;
2704       case Bytecodes::_istore_2       : store_local(intType   , 2); break;
2705       case Bytecodes::_istore_3       : store_local(intType   , 3); break;
2706       case Bytecodes::_lstore_0       : store_local(longType  , 0); break;
2707       case Bytecodes::_lstore_1       : store_local(longType  , 1); break;
2708       case Bytecodes::_lstore_2       : store_local(longType  , 2); break;
2709       case Bytecodes::_lstore_3       : store_local(longType  , 3); break;
2710       case Bytecodes::_fstore_0       : store_local(floatType , 0); break;
2711       case Bytecodes::_fstore_1       : store_local(floatType , 1); break;
2712       case Bytecodes::_fstore_2       : store_local(floatType , 2); break;
2713       case Bytecodes::_fstore_3       : store_local(floatType , 3); break;
2714       case Bytecodes::_dstore_0       : store_local(doubleType, 0); break;
2715       case Bytecodes::_dstore_1       : store_local(doubleType, 1); break;
2716       case Bytecodes::_dstore_2       : store_local(doubleType, 2); break;
2717       case Bytecodes::_dstore_3       : store_local(doubleType, 3); break;
2718       case Bytecodes::_astore_0       : store_local(objectType, 0); break;
2719       case Bytecodes::_astore_1       : store_local(objectType, 1); break;
2720       case Bytecodes::_astore_2       : store_local(objectType, 2); break;
2721       case Bytecodes::_astore_3       : store_local(objectType, 3); break;
2722       case Bytecodes::_iastore        : store_indexed(T_INT   ); break;
2723       case Bytecodes::_lastore        : store_indexed(T_LONG  ); break;
2724       case Bytecodes::_fastore        : store_indexed(T_FLOAT ); break;
2725       case Bytecodes::_dastore        : store_indexed(T_DOUBLE); break;
2726       case Bytecodes::_aastore        : store_indexed(T_OBJECT); break;
2727       case Bytecodes::_bastore        : store_indexed(T_BYTE  ); break;
2728       case Bytecodes::_castore        : store_indexed(T_CHAR  ); break;
2729       case Bytecodes::_sastore        : store_indexed(T_SHORT ); break;
2730       case Bytecodes::_pop            : // fall through
2731       case Bytecodes::_pop2           : // fall through
2732       case Bytecodes::_dup            : // fall through
2733       case Bytecodes::_dup_x1         : // fall through
2734       case Bytecodes::_dup_x2         : // fall through
2735       case Bytecodes::_dup2           : // fall through
2736       case Bytecodes::_dup2_x1        : // fall through
2737       case Bytecodes::_dup2_x2        : // fall through
2738       case Bytecodes::_swap           : stack_op(code); break;
2739       case Bytecodes::_iadd           : arithmetic_op(intType   , code); break;
2740       case Bytecodes::_ladd           : arithmetic_op(longType  , code); break;
2741       case Bytecodes::_fadd           : arithmetic_op(floatType , code); break;
2742       case Bytecodes::_dadd           : arithmetic_op(doubleType, code); break;
2743       case Bytecodes::_isub           : arithmetic_op(intType   , code); break;
2744       case Bytecodes::_lsub           : arithmetic_op(longType  , code); break;
2745       case Bytecodes::_fsub           : arithmetic_op(floatType , code); break;
2746       case Bytecodes::_dsub           : arithmetic_op(doubleType, code); break;
2747       case Bytecodes::_imul           : arithmetic_op(intType   , code); break;
2748       case Bytecodes::_lmul           : arithmetic_op(longType  , code); break;
2749       case Bytecodes::_fmul           : arithmetic_op(floatType , code); break;
2750       case Bytecodes::_dmul           : arithmetic_op(doubleType, code); break;
2751       case Bytecodes::_idiv           : arithmetic_op(intType   , code, copy_state_for_exception()); break;
2752       case Bytecodes::_ldiv           : arithmetic_op(longType  , code, copy_state_for_exception()); break;
2753       case Bytecodes::_fdiv           : arithmetic_op(floatType , code); break;
2754       case Bytecodes::_ddiv           : arithmetic_op(doubleType, code); break;
2755       case Bytecodes::_irem           : arithmetic_op(intType   , code, copy_state_for_exception()); break;
2756       case Bytecodes::_lrem           : arithmetic_op(longType  , code, copy_state_for_exception()); break;
2757       case Bytecodes::_frem           : arithmetic_op(floatType , code); break;
2758       case Bytecodes::_drem           : arithmetic_op(doubleType, code); break;
2759       case Bytecodes::_ineg           : negate_op(intType   ); break;
2760       case Bytecodes::_lneg           : negate_op(longType  ); break;
2761       case Bytecodes::_fneg           : negate_op(floatType ); break;
2762       case Bytecodes::_dneg           : negate_op(doubleType); break;
2763       case Bytecodes::_ishl           : shift_op(intType , code); break;
2764       case Bytecodes::_lshl           : shift_op(longType, code); break;
2765       case Bytecodes::_ishr           : shift_op(intType , code); break;
2766       case Bytecodes::_lshr           : shift_op(longType, code); break;
2767       case Bytecodes::_iushr          : shift_op(intType , code); break;
2768       case Bytecodes::_lushr          : shift_op(longType, code); break;
2769       case Bytecodes::_iand           : logic_op(intType , code); break;
2770       case Bytecodes::_land           : logic_op(longType, code); break;
2771       case Bytecodes::_ior            : logic_op(intType , code); break;
2772       case Bytecodes::_lor            : logic_op(longType, code); break;
2773       case Bytecodes::_ixor           : logic_op(intType , code); break;
2774       case Bytecodes::_lxor           : logic_op(longType, code); break;
2775       case Bytecodes::_iinc           : increment(); break;
2776       case Bytecodes::_i2l            : convert(code, T_INT   , T_LONG  ); break;
2777       case Bytecodes::_i2f            : convert(code, T_INT   , T_FLOAT ); break;
2778       case Bytecodes::_i2d            : convert(code, T_INT   , T_DOUBLE); break;
2779       case Bytecodes::_l2i            : convert(code, T_LONG  , T_INT   ); break;
2780       case Bytecodes::_l2f            : convert(code, T_LONG  , T_FLOAT ); break;
2781       case Bytecodes::_l2d            : convert(code, T_LONG  , T_DOUBLE); break;
2782       case Bytecodes::_f2i            : convert(code, T_FLOAT , T_INT   ); break;
2783       case Bytecodes::_f2l            : convert(code, T_FLOAT , T_LONG  ); break;
2784       case Bytecodes::_f2d            : convert(code, T_FLOAT , T_DOUBLE); break;
2785       case Bytecodes::_d2i            : convert(code, T_DOUBLE, T_INT   ); break;
2786       case Bytecodes::_d2l            : convert(code, T_DOUBLE, T_LONG  ); break;
2787       case Bytecodes::_d2f            : convert(code, T_DOUBLE, T_FLOAT ); break;
2788       case Bytecodes::_i2b            : convert(code, T_INT   , T_BYTE  ); break;
2789       case Bytecodes::_i2c            : convert(code, T_INT   , T_CHAR  ); break;
2790       case Bytecodes::_i2s            : convert(code, T_INT   , T_SHORT ); break;
2791       case Bytecodes::_lcmp           : compare_op(longType  , code); break;
2792       case Bytecodes::_fcmpl          : compare_op(floatType , code); break;
2793       case Bytecodes::_fcmpg          : compare_op(floatType , code); break;
2794       case Bytecodes::_dcmpl          : compare_op(doubleType, code); break;
2795       case Bytecodes::_dcmpg          : compare_op(doubleType, code); break;
2796       case Bytecodes::_ifeq           : if_zero(intType   , If::eql); break;
2797       case Bytecodes::_ifne           : if_zero(intType   , If::neq); break;
2798       case Bytecodes::_iflt           : if_zero(intType   , If::lss); break;
2799       case Bytecodes::_ifge           : if_zero(intType   , If::geq); break;
2800       case Bytecodes::_ifgt           : if_zero(intType   , If::gtr); break;
2801       case Bytecodes::_ifle           : if_zero(intType   , If::leq); break;
2802       case Bytecodes::_if_icmpeq      : if_same(intType   , If::eql); break;
2803       case Bytecodes::_if_icmpne      : if_same(intType   , If::neq); break;
2804       case Bytecodes::_if_icmplt      : if_same(intType   , If::lss); break;
2805       case Bytecodes::_if_icmpge      : if_same(intType   , If::geq); break;
2806       case Bytecodes::_if_icmpgt      : if_same(intType   , If::gtr); break;
2807       case Bytecodes::_if_icmple      : if_same(intType   , If::leq); break;
2808       case Bytecodes::_if_acmpeq      : if_same(objectType, If::eql); break;
2809       case Bytecodes::_if_acmpne      : if_same(objectType, If::neq); break;
2810       case Bytecodes::_goto           : _goto(s.cur_bci(), s.get_dest()); break;
2811       case Bytecodes::_jsr            : jsr(s.get_dest()); break;
2812       case Bytecodes::_ret            : ret(s.get_index()); break;
2813       case Bytecodes::_tableswitch    : table_switch(); break;
2814       case Bytecodes::_lookupswitch   : lookup_switch(); break;
2815       case Bytecodes::_ireturn        : method_return(ipop(), ignore_return); break;
2816       case Bytecodes::_lreturn        : method_return(lpop(), ignore_return); break;
2817       case Bytecodes::_freturn        : method_return(fpop(), ignore_return); break;
2818       case Bytecodes::_dreturn        : method_return(dpop(), ignore_return); break;
2819       case Bytecodes::_areturn        : method_return(apop(), ignore_return); break;
2820       case Bytecodes::_return         : method_return(NULL  , ignore_return); break;
2821       case Bytecodes::_getstatic      : // fall through
2822       case Bytecodes::_putstatic      : // fall through
2823       case Bytecodes::_getfield       : // fall through
2824       case Bytecodes::_putfield       : access_field(code); break;
2825       case Bytecodes::_invokevirtual  : // fall through
2826       case Bytecodes::_invokespecial  : // fall through
2827       case Bytecodes::_invokestatic   : // fall through
2828       case Bytecodes::_invokedynamic  : // fall through
2829       case Bytecodes::_invokeinterface: invoke(code); break;
2830       case Bytecodes::_new            : new_instance(s.get_index_u2()); break;
2831       case Bytecodes::_newarray       : new_type_array(); break;
2832       case Bytecodes::_anewarray      : new_object_array(); break;
2833       case Bytecodes::_arraylength    : { ValueStack* state_before = copy_state_for_exception(); ipush(append(new ArrayLength(apop(), state_before))); break; }
2834       case Bytecodes::_athrow         : throw_op(s.cur_bci()); break;
2835       case Bytecodes::_checkcast      : check_cast(s.get_index_u2()); break;
2836       case Bytecodes::_instanceof     : instance_of(s.get_index_u2()); break;
2837       case Bytecodes::_monitorenter   : monitorenter(apop(), s.cur_bci()); break;
2838       case Bytecodes::_monitorexit    : monitorexit (apop(), s.cur_bci()); break;
2839       case Bytecodes::_wide           : ShouldNotReachHere(); break;
2840       case Bytecodes::_multianewarray : new_multi_array(s.cur_bcp()[3]); break;
2841       case Bytecodes::_ifnull         : if_null(objectType, If::eql); break;
2842       case Bytecodes::_ifnonnull      : if_null(objectType, If::neq); break;
2843       case Bytecodes::_goto_w         : _goto(s.cur_bci(), s.get_far_dest()); break;
2844       case Bytecodes::_jsr_w          : jsr(s.get_far_dest()); break;
2845       case Bytecodes::_breakpoint     : BAILOUT_("concurrent setting of breakpoint", NULL);
2846       default                         : ShouldNotReachHere(); break;
2847     }
2848 
2849     if (log != NULL)
2850       log->clear_context(); // skip marker if nothing was printed
2851 
2852     // save current bci to setup Goto at the end
2853     prev_bci = s.cur_bci();
2854 
2855   }
2856   CHECK_BAILOUT_(NULL);
2857   // stop processing of this block (see try_inline_full)
2858   if (_skip_block) {
2859     _skip_block = false;
2860     assert(_last && _last->as_BlockEnd(), "");
2861     return _last->as_BlockEnd();
2862   }
2863   // if there are any, check if last instruction is a BlockEnd instruction
2864   BlockEnd* end = last()->as_BlockEnd();
2865   if (end == NULL) {
2866     // all blocks must end with a BlockEnd instruction => add a Goto
2867     end = new Goto(block_at(s.cur_bci()), false);
2868     append(end);
2869   }
2870   assert(end == last()->as_BlockEnd(), "inconsistency");
2871 
2872   assert(end->state() != NULL, "state must already be present");
2873   assert(end->as_Return() == NULL || end->as_Throw() == NULL || end->state()->stack_size() == 0, "stack not needed for return and throw");
2874 
2875   // connect to begin & set state
2876   // NOTE that inlining may have changed the block we are parsing
2877   block()->set_end(end);
2878   // propagate state
2879   for (int i = end->number_of_sux() - 1; i >= 0; i--) {
2880     BlockBegin* sux = end->sux_at(i);
2881     assert(sux->is_predecessor(block()), "predecessor missing");
2882     // be careful, bailout if bytecodes are strange
2883     if (!sux->try_merge(end->state())) BAILOUT_("block join failed", NULL);
2884     scope_data()->add_to_work_list(end->sux_at(i));
2885   }
2886 
2887   scope_data()->set_stream(NULL);
2888 
2889   // done
2890   return end;
2891 }
2892 
2893 
2894 void GraphBuilder::iterate_all_blocks(bool start_in_current_block_for_inlining) {
2895   do {
2896     if (start_in_current_block_for_inlining && !bailed_out()) {
2897       iterate_bytecodes_for_block(0);
2898       start_in_current_block_for_inlining = false;
2899     } else {
2900       BlockBegin* b;
2901       while ((b = scope_data()->remove_from_work_list()) != NULL) {
2902         if (!b->is_set(BlockBegin::was_visited_flag)) {
2903           if (b->is_set(BlockBegin::osr_entry_flag)) {
2904             // we're about to parse the osr entry block, so make sure
2905             // we setup the OSR edge leading into this block so that
2906             // Phis get setup correctly.
2907             setup_osr_entry_block();
2908             // this is no longer the osr entry block, so clear it.
2909             b->clear(BlockBegin::osr_entry_flag);
2910           }
2911           b->set(BlockBegin::was_visited_flag);
2912           connect_to_end(b);
2913         }
2914       }
2915     }
2916   } while (!bailed_out() && !scope_data()->is_work_list_empty());
2917 }
2918 
2919 
2920 bool GraphBuilder::_can_trap      [Bytecodes::number_of_java_codes];
2921 
2922 void GraphBuilder::initialize() {
2923   // the following bytecodes are assumed to potentially
2924   // throw exceptions in compiled code - note that e.g.
2925   // monitorexit & the return bytecodes do not throw
2926   // exceptions since monitor pairing proved that they
2927   // succeed (if monitor pairing succeeded)
2928   Bytecodes::Code can_trap_list[] =
2929     { Bytecodes::_ldc
2930     , Bytecodes::_ldc_w
2931     , Bytecodes::_ldc2_w
2932     , Bytecodes::_iaload
2933     , Bytecodes::_laload
2934     , Bytecodes::_faload
2935     , Bytecodes::_daload
2936     , Bytecodes::_aaload
2937     , Bytecodes::_baload
2938     , Bytecodes::_caload
2939     , Bytecodes::_saload
2940     , Bytecodes::_iastore
2941     , Bytecodes::_lastore
2942     , Bytecodes::_fastore
2943     , Bytecodes::_dastore
2944     , Bytecodes::_aastore
2945     , Bytecodes::_bastore
2946     , Bytecodes::_castore
2947     , Bytecodes::_sastore
2948     , Bytecodes::_idiv
2949     , Bytecodes::_ldiv
2950     , Bytecodes::_irem
2951     , Bytecodes::_lrem
2952     , Bytecodes::_getstatic
2953     , Bytecodes::_putstatic
2954     , Bytecodes::_getfield
2955     , Bytecodes::_putfield
2956     , Bytecodes::_invokevirtual
2957     , Bytecodes::_invokespecial
2958     , Bytecodes::_invokestatic
2959     , Bytecodes::_invokedynamic
2960     , Bytecodes::_invokeinterface
2961     , Bytecodes::_new
2962     , Bytecodes::_newarray
2963     , Bytecodes::_anewarray
2964     , Bytecodes::_arraylength
2965     , Bytecodes::_athrow
2966     , Bytecodes::_checkcast
2967     , Bytecodes::_instanceof
2968     , Bytecodes::_monitorenter
2969     , Bytecodes::_multianewarray
2970     };
2971 
2972   // inititialize trap tables
2973   for (int i = 0; i < Bytecodes::number_of_java_codes; i++) {
2974     _can_trap[i] = false;
2975   }
2976   // set standard trap info
2977   for (uint j = 0; j < ARRAY_SIZE(can_trap_list); j++) {
2978     _can_trap[can_trap_list[j]] = true;
2979   }
2980 }
2981 
2982 
2983 BlockBegin* GraphBuilder::header_block(BlockBegin* entry, BlockBegin::Flag f, ValueStack* state) {
2984   assert(entry->is_set(f), "entry/flag mismatch");
2985   // create header block
2986   BlockBegin* h = new BlockBegin(entry->bci());
2987   h->set_depth_first_number(0);
2988 
2989   Value l = h;
2990   BlockEnd* g = new Goto(entry, false);
2991   l->set_next(g, entry->bci());
2992   h->set_end(g);
2993   h->set(f);
2994   // setup header block end state
2995   ValueStack* s = state->copy(ValueStack::StateAfter, entry->bci()); // can use copy since stack is empty (=> no phis)
2996   assert(s->stack_is_empty(), "must have empty stack at entry point");
2997   g->set_state(s);
2998   return h;
2999 }
3000 
3001 
3002 
3003 BlockBegin* GraphBuilder::setup_start_block(int osr_bci, BlockBegin* std_entry, BlockBegin* osr_entry, ValueStack* state) {
3004   BlockBegin* start = new BlockBegin(0);
3005 
3006   // This code eliminates the empty start block at the beginning of
3007   // each method.  Previously, each method started with the
3008   // start-block created below, and this block was followed by the
3009   // header block that was always empty.  This header block is only
3010   // necesary if std_entry is also a backward branch target because
3011   // then phi functions may be necessary in the header block.  It's
3012   // also necessary when profiling so that there's a single block that
3013   // can increment the interpreter_invocation_count.
3014   BlockBegin* new_header_block;
3015   if (std_entry->number_of_preds() > 0 || count_invocations() || count_backedges()) {
3016     new_header_block = header_block(std_entry, BlockBegin::std_entry_flag, state);
3017   } else {
3018     new_header_block = std_entry;
3019   }
3020 
3021   // setup start block (root for the IR graph)
3022   Base* base =
3023     new Base(
3024       new_header_block,
3025       osr_entry
3026     );
3027   start->set_next(base, 0);
3028   start->set_end(base);
3029   // create & setup state for start block
3030   start->set_state(state->copy(ValueStack::StateAfter, std_entry->bci()));
3031   base->set_state(state->copy(ValueStack::StateAfter, std_entry->bci()));
3032 
3033   if (base->std_entry()->state() == NULL) {
3034     // setup states for header blocks
3035     base->std_entry()->merge(state);
3036   }
3037 
3038   assert(base->std_entry()->state() != NULL, "");
3039   return start;
3040 }
3041 
3042 
3043 void GraphBuilder::setup_osr_entry_block() {
3044   assert(compilation()->is_osr_compile(), "only for osrs");
3045 
3046   int osr_bci = compilation()->osr_bci();
3047   ciBytecodeStream s(method());
3048   s.reset_to_bci(osr_bci);
3049   s.next();
3050   scope_data()->set_stream(&s);
3051 
3052   // create a new block to be the osr setup code
3053   _osr_entry = new BlockBegin(osr_bci);
3054   _osr_entry->set(BlockBegin::osr_entry_flag);
3055   _osr_entry->set_depth_first_number(0);
3056   BlockBegin* target = bci2block()->at(osr_bci);
3057   assert(target != NULL && target->is_set(BlockBegin::osr_entry_flag), "must be there");
3058   // the osr entry has no values for locals
3059   ValueStack* state = target->state()->copy();
3060   _osr_entry->set_state(state);
3061 
3062   kill_all();
3063   _block = _osr_entry;
3064   _state = _osr_entry->state()->copy();
3065   assert(_state->bci() == osr_bci, "mismatch");
3066   _last  = _osr_entry;
3067   Value e = append(new OsrEntry());
3068   e->set_needs_null_check(false);
3069 
3070   // OSR buffer is
3071   //
3072   // locals[nlocals-1..0]
3073   // monitors[number_of_locks-1..0]
3074   //
3075   // locals is a direct copy of the interpreter frame so in the osr buffer
3076   // so first slot in the local array is the last local from the interpreter
3077   // and last slot is local[0] (receiver) from the interpreter
3078   //
3079   // Similarly with locks. The first lock slot in the osr buffer is the nth lock
3080   // from the interpreter frame, the nth lock slot in the osr buffer is 0th lock
3081   // in the interpreter frame (the method lock if a sync method)
3082 
3083   // Initialize monitors in the compiled activation.
3084 
3085   int index;
3086   Value local;
3087 
3088   // find all the locals that the interpreter thinks contain live oops
3089   const ResourceBitMap live_oops = method()->live_local_oops_at_bci(osr_bci);
3090 
3091   // compute the offset into the locals so that we can treat the buffer
3092   // as if the locals were still in the interpreter frame
3093   int locals_offset = BytesPerWord * (method()->max_locals() - 1);
3094   for_each_local_value(state, index, local) {
3095     int offset = locals_offset - (index + local->type()->size() - 1) * BytesPerWord;
3096     Value get;
3097     if (local->type()->is_object_kind() && !live_oops.at(index)) {
3098       // The interpreter thinks this local is dead but the compiler
3099       // doesn't so pretend that the interpreter passed in null.
3100       get = append(new Constant(objectNull));
3101     } else {
3102       get = append(new UnsafeGetRaw(as_BasicType(local->type()), e,
3103                                     append(new Constant(new IntConstant(offset))),
3104                                     0,
3105                                     true /*unaligned*/, true /*wide*/));
3106     }
3107     _state->store_local(index, get);
3108   }
3109 
3110   // the storage for the OSR buffer is freed manually in the LIRGenerator.
3111 
3112   assert(state->caller_state() == NULL, "should be top scope");
3113   state->clear_locals();
3114   Goto* g = new Goto(target, false);
3115   append(g);
3116   _osr_entry->set_end(g);
3117   target->merge(_osr_entry->end()->state());
3118 
3119   scope_data()->set_stream(NULL);
3120 }
3121 
3122 
3123 ValueStack* GraphBuilder::state_at_entry() {
3124   ValueStack* state = new ValueStack(scope(), NULL);
3125 
3126   // Set up locals for receiver
3127   int idx = 0;
3128   if (!method()->is_static()) {
3129     // we should always see the receiver
3130     state->store_local(idx, new Local(method()->holder(), objectType, idx, true));
3131     idx = 1;
3132   }
3133 
3134   // Set up locals for incoming arguments
3135   ciSignature* sig = method()->signature();
3136   for (int i = 0; i < sig->count(); i++) {
3137     ciType* type = sig->type_at(i);
3138     BasicType basic_type = type->basic_type();
3139     // don't allow T_ARRAY to propagate into locals types
3140     if (basic_type == T_ARRAY) basic_type = T_OBJECT;
3141     ValueType* vt = as_ValueType(basic_type);
3142     state->store_local(idx, new Local(type, vt, idx, false));
3143     idx += type->size();
3144   }
3145 
3146   // lock synchronized method
3147   if (method()->is_synchronized()) {
3148     state->lock(NULL);
3149   }
3150 
3151   return state;
3152 }
3153 
3154 
3155 GraphBuilder::GraphBuilder(Compilation* compilation, IRScope* scope)
3156   : _scope_data(NULL)
3157   , _instruction_count(0)
3158   , _osr_entry(NULL)
3159   , _memory(new MemoryBuffer())
3160   , _compilation(compilation)
3161   , _inline_bailout_msg(NULL)
3162 {
3163   int osr_bci = compilation->osr_bci();
3164 
3165   // determine entry points and bci2block mapping
3166   BlockListBuilder blm(compilation, scope, osr_bci);
3167   CHECK_BAILOUT();
3168 
3169   BlockList* bci2block = blm.bci2block();
3170   BlockBegin* start_block = bci2block->at(0);
3171 
3172   push_root_scope(scope, bci2block, start_block);
3173 
3174   // setup state for std entry
3175   _initial_state = state_at_entry();
3176   start_block->merge(_initial_state);
3177 
3178   // complete graph
3179   _vmap        = new ValueMap();
3180   switch (scope->method()->intrinsic_id()) {
3181   case vmIntrinsics::_dabs          : // fall through
3182   case vmIntrinsics::_dsqrt         : // fall through
3183   case vmIntrinsics::_dsin          : // fall through
3184   case vmIntrinsics::_dcos          : // fall through
3185   case vmIntrinsics::_dtan          : // fall through
3186   case vmIntrinsics::_dlog          : // fall through
3187   case vmIntrinsics::_dlog10        : // fall through
3188   case vmIntrinsics::_dexp          : // fall through
3189   case vmIntrinsics::_dpow          : // fall through
3190     {
3191       // Compiles where the root method is an intrinsic need a special
3192       // compilation environment because the bytecodes for the method
3193       // shouldn't be parsed during the compilation, only the special
3194       // Intrinsic node should be emitted.  If this isn't done the the
3195       // code for the inlined version will be different than the root
3196       // compiled version which could lead to monotonicity problems on
3197       // intel.
3198       if (CheckIntrinsics && !scope->method()->intrinsic_candidate()) {
3199         BAILOUT("failed to inline intrinsic, method not annotated");
3200       }
3201 
3202       // Set up a stream so that appending instructions works properly.
3203       ciBytecodeStream s(scope->method());
3204       s.reset_to_bci(0);
3205       scope_data()->set_stream(&s);
3206       s.next();
3207 
3208       // setup the initial block state
3209       _block = start_block;
3210       _state = start_block->state()->copy_for_parsing();
3211       _last  = start_block;
3212       load_local(doubleType, 0);
3213       if (scope->method()->intrinsic_id() == vmIntrinsics::_dpow) {
3214         load_local(doubleType, 2);
3215       }
3216 
3217       // Emit the intrinsic node.
3218       bool result = try_inline_intrinsics(scope->method());
3219       if (!result) BAILOUT("failed to inline intrinsic");
3220       method_return(dpop());
3221 
3222       // connect the begin and end blocks and we're all done.
3223       BlockEnd* end = last()->as_BlockEnd();
3224       block()->set_end(end);
3225       break;
3226     }
3227 
3228   case vmIntrinsics::_Reference_get:
3229     {
3230       {
3231         // With java.lang.ref.reference.get() we must go through the
3232         // intrinsic - when G1 is enabled - even when get() is the root
3233         // method of the compile so that, if necessary, the value in
3234         // the referent field of the reference object gets recorded by
3235         // the pre-barrier code.
3236         // Specifically, if G1 is enabled, the value in the referent
3237         // field is recorded by the G1 SATB pre barrier. This will
3238         // result in the referent being marked live and the reference
3239         // object removed from the list of discovered references during
3240         // reference processing.
3241         if (CheckIntrinsics && !scope->method()->intrinsic_candidate()) {
3242           BAILOUT("failed to inline intrinsic, method not annotated");
3243         }
3244 
3245         // Also we need intrinsic to prevent commoning reads from this field
3246         // across safepoint since GC can change its value.
3247 
3248         // Set up a stream so that appending instructions works properly.
3249         ciBytecodeStream s(scope->method());
3250         s.reset_to_bci(0);
3251         scope_data()->set_stream(&s);
3252         s.next();
3253 
3254         // setup the initial block state
3255         _block = start_block;
3256         _state = start_block->state()->copy_for_parsing();
3257         _last  = start_block;
3258         load_local(objectType, 0);
3259 
3260         // Emit the intrinsic node.
3261         bool result = try_inline_intrinsics(scope->method());
3262         if (!result) BAILOUT("failed to inline intrinsic");
3263         method_return(apop());
3264 
3265         // connect the begin and end blocks and we're all done.
3266         BlockEnd* end = last()->as_BlockEnd();
3267         block()->set_end(end);
3268         break;
3269       }
3270       // Otherwise, fall thru
3271     }
3272 
3273   default:
3274     scope_data()->add_to_work_list(start_block);
3275     iterate_all_blocks();
3276     break;
3277   }
3278   CHECK_BAILOUT();
3279 
3280   _start = setup_start_block(osr_bci, start_block, _osr_entry, _initial_state);
3281 
3282   eliminate_redundant_phis(_start);
3283 
3284   NOT_PRODUCT(if (PrintValueNumbering && Verbose) print_stats());
3285   // for osr compile, bailout if some requirements are not fulfilled
3286   if (osr_bci != -1) {
3287     BlockBegin* osr_block = blm.bci2block()->at(osr_bci);
3288     assert(osr_block->is_set(BlockBegin::was_visited_flag),"osr entry must have been visited for osr compile");
3289 
3290     // check if osr entry point has empty stack - we cannot handle non-empty stacks at osr entry points
3291     if (!osr_block->state()->stack_is_empty()) {
3292       BAILOUT("stack not empty at OSR entry point");
3293     }
3294   }
3295 #ifndef PRODUCT
3296   if (PrintCompilation && Verbose) tty->print_cr("Created %d Instructions", _instruction_count);
3297 #endif
3298 }
3299 
3300 
3301 ValueStack* GraphBuilder::copy_state_before() {
3302   return copy_state_before_with_bci(bci());
3303 }
3304 
3305 ValueStack* GraphBuilder::copy_state_exhandling() {
3306   return copy_state_exhandling_with_bci(bci());
3307 }
3308 
3309 ValueStack* GraphBuilder::copy_state_for_exception() {
3310   return copy_state_for_exception_with_bci(bci());
3311 }
3312 
3313 ValueStack* GraphBuilder::copy_state_before_with_bci(int bci) {
3314   return state()->copy(ValueStack::StateBefore, bci);
3315 }
3316 
3317 ValueStack* GraphBuilder::copy_state_exhandling_with_bci(int bci) {
3318   if (!has_handler()) return NULL;
3319   return state()->copy(ValueStack::StateBefore, bci);
3320 }
3321 
3322 ValueStack* GraphBuilder::copy_state_for_exception_with_bci(int bci) {
3323   ValueStack* s = copy_state_exhandling_with_bci(bci);
3324   if (s == NULL) {
3325     if (_compilation->env()->should_retain_local_variables()) {
3326       s = state()->copy(ValueStack::ExceptionState, bci);
3327     } else {
3328       s = state()->copy(ValueStack::EmptyExceptionState, bci);
3329     }
3330   }
3331   return s;
3332 }
3333 
3334 int GraphBuilder::recursive_inline_level(ciMethod* cur_callee) const {
3335   int recur_level = 0;
3336   for (IRScope* s = scope(); s != NULL; s = s->caller()) {
3337     if (s->method() == cur_callee) {
3338       ++recur_level;
3339     }
3340   }
3341   return recur_level;
3342 }
3343 
3344 
3345 bool GraphBuilder::try_inline(ciMethod* callee, bool holder_known, bool ignore_return, Bytecodes::Code bc, Value receiver) {
3346   const char* msg = NULL;
3347 
3348   // clear out any existing inline bailout condition
3349   clear_inline_bailout();
3350 
3351   // exclude methods we don't want to inline
3352   msg = should_not_inline(callee);
3353   if (msg != NULL) {
3354     print_inlining(callee, msg, /*success*/ false);
3355     return false;
3356   }
3357 
3358   // method handle invokes
3359   if (callee->is_method_handle_intrinsic()) {
3360     if (try_method_handle_inline(callee, ignore_return)) {
3361       if (callee->has_reserved_stack_access()) {
3362         compilation()->set_has_reserved_stack_access(true);
3363       }
3364       return true;
3365     }
3366     return false;
3367   }
3368 
3369   // handle intrinsics
3370   if (callee->intrinsic_id() != vmIntrinsics::_none &&
3371       (CheckIntrinsics ? callee->intrinsic_candidate() : true)) {
3372     if (try_inline_intrinsics(callee, ignore_return)) {
3373       print_inlining(callee, "intrinsic");
3374       if (callee->has_reserved_stack_access()) {
3375         compilation()->set_has_reserved_stack_access(true);
3376       }
3377       return true;
3378     }
3379     // try normal inlining
3380   }
3381 
3382   // certain methods cannot be parsed at all
3383   msg = check_can_parse(callee);
3384   if (msg != NULL) {
3385     print_inlining(callee, msg, /*success*/ false);
3386     return false;
3387   }
3388 
3389   // If bytecode not set use the current one.
3390   if (bc == Bytecodes::_illegal) {
3391     bc = code();
3392   }
3393   if (try_inline_full(callee, holder_known, ignore_return, bc, receiver)) {
3394     if (callee->has_reserved_stack_access()) {
3395       compilation()->set_has_reserved_stack_access(true);
3396     }
3397     return true;
3398   }
3399 
3400   // Entire compilation could fail during try_inline_full call.
3401   // In that case printing inlining decision info is useless.
3402   if (!bailed_out())
3403     print_inlining(callee, _inline_bailout_msg, /*success*/ false);
3404 
3405   return false;
3406 }
3407 
3408 
3409 const char* GraphBuilder::check_can_parse(ciMethod* callee) const {
3410   // Certain methods cannot be parsed at all:
3411   if ( callee->is_native())            return "native method";
3412   if ( callee->is_abstract())          return "abstract method";
3413   if (!callee->can_be_compiled())      return "not compilable (disabled)";
3414   return NULL;
3415 }
3416 
3417 // negative filter: should callee NOT be inlined?  returns NULL, ok to inline, or rejection msg
3418 const char* GraphBuilder::should_not_inline(ciMethod* callee) const {
3419   if ( compilation()->directive()->should_not_inline(callee)) return "disallowed by CompileCommand";
3420   if ( callee->dont_inline())          return "don't inline by annotation";
3421   return NULL;
3422 }
3423 
3424 void GraphBuilder::build_graph_for_intrinsic(ciMethod* callee, bool ignore_return) {
3425   vmIntrinsics::ID id = callee->intrinsic_id();
3426   assert(id != vmIntrinsics::_none, "must be a VM intrinsic");
3427 
3428   // Some intrinsics need special IR nodes.
3429   switch(id) {
3430   case vmIntrinsics::_getObject          : append_unsafe_get_obj(callee, T_OBJECT,  false); return;
3431   case vmIntrinsics::_getBoolean         : append_unsafe_get_obj(callee, T_BOOLEAN, false); return;
3432   case vmIntrinsics::_getByte            : append_unsafe_get_obj(callee, T_BYTE,    false); return;
3433   case vmIntrinsics::_getShort           : append_unsafe_get_obj(callee, T_SHORT,   false); return;
3434   case vmIntrinsics::_getChar            : append_unsafe_get_obj(callee, T_CHAR,    false); return;
3435   case vmIntrinsics::_getInt             : append_unsafe_get_obj(callee, T_INT,     false); return;
3436   case vmIntrinsics::_getLong            : append_unsafe_get_obj(callee, T_LONG,    false); return;
3437   case vmIntrinsics::_getFloat           : append_unsafe_get_obj(callee, T_FLOAT,   false); return;
3438   case vmIntrinsics::_getDouble          : append_unsafe_get_obj(callee, T_DOUBLE,  false); return;
3439   case vmIntrinsics::_putObject          : append_unsafe_put_obj(callee, T_OBJECT,  false); return;
3440   case vmIntrinsics::_putBoolean         : append_unsafe_put_obj(callee, T_BOOLEAN, false); return;
3441   case vmIntrinsics::_putByte            : append_unsafe_put_obj(callee, T_BYTE,    false); return;
3442   case vmIntrinsics::_putShort           : append_unsafe_put_obj(callee, T_SHORT,   false); return;
3443   case vmIntrinsics::_putChar            : append_unsafe_put_obj(callee, T_CHAR,    false); return;
3444   case vmIntrinsics::_putInt             : append_unsafe_put_obj(callee, T_INT,     false); return;
3445   case vmIntrinsics::_putLong            : append_unsafe_put_obj(callee, T_LONG,    false); return;
3446   case vmIntrinsics::_putFloat           : append_unsafe_put_obj(callee, T_FLOAT,   false); return;
3447   case vmIntrinsics::_putDouble          : append_unsafe_put_obj(callee, T_DOUBLE,  false); return;
3448   case vmIntrinsics::_getShortUnaligned  : append_unsafe_get_obj(callee, T_SHORT,   false); return;
3449   case vmIntrinsics::_getCharUnaligned   : append_unsafe_get_obj(callee, T_CHAR,    false); return;
3450   case vmIntrinsics::_getIntUnaligned    : append_unsafe_get_obj(callee, T_INT,     false); return;
3451   case vmIntrinsics::_getLongUnaligned   : append_unsafe_get_obj(callee, T_LONG,    false); return;
3452   case vmIntrinsics::_putShortUnaligned  : append_unsafe_put_obj(callee, T_SHORT,   false); return;
3453   case vmIntrinsics::_putCharUnaligned   : append_unsafe_put_obj(callee, T_CHAR,    false); return;
3454   case vmIntrinsics::_putIntUnaligned    : append_unsafe_put_obj(callee, T_INT,     false); return;
3455   case vmIntrinsics::_putLongUnaligned   : append_unsafe_put_obj(callee, T_LONG,    false); return;
3456   case vmIntrinsics::_getObjectVolatile  : append_unsafe_get_obj(callee, T_OBJECT,  true); return;
3457   case vmIntrinsics::_getBooleanVolatile : append_unsafe_get_obj(callee, T_BOOLEAN, true); return;
3458   case vmIntrinsics::_getByteVolatile    : append_unsafe_get_obj(callee, T_BYTE,    true); return;
3459   case vmIntrinsics::_getShortVolatile   : append_unsafe_get_obj(callee, T_SHORT,   true); return;
3460   case vmIntrinsics::_getCharVolatile    : append_unsafe_get_obj(callee, T_CHAR,    true); return;
3461   case vmIntrinsics::_getIntVolatile     : append_unsafe_get_obj(callee, T_INT,     true); return;
3462   case vmIntrinsics::_getLongVolatile    : append_unsafe_get_obj(callee, T_LONG,    true); return;
3463   case vmIntrinsics::_getFloatVolatile   : append_unsafe_get_obj(callee, T_FLOAT,   true); return;
3464   case vmIntrinsics::_getDoubleVolatile  : append_unsafe_get_obj(callee, T_DOUBLE,  true); return;
3465   case vmIntrinsics::_putObjectVolatile  : append_unsafe_put_obj(callee, T_OBJECT,  true); return;
3466   case vmIntrinsics::_putBooleanVolatile : append_unsafe_put_obj(callee, T_BOOLEAN, true); return;
3467   case vmIntrinsics::_putByteVolatile    : append_unsafe_put_obj(callee, T_BYTE,    true); return;
3468   case vmIntrinsics::_putShortVolatile   : append_unsafe_put_obj(callee, T_SHORT,   true); return;
3469   case vmIntrinsics::_putCharVolatile    : append_unsafe_put_obj(callee, T_CHAR,    true); return;
3470   case vmIntrinsics::_putIntVolatile     : append_unsafe_put_obj(callee, T_INT,     true); return;
3471   case vmIntrinsics::_putLongVolatile    : append_unsafe_put_obj(callee, T_LONG,    true); return;
3472   case vmIntrinsics::_putFloatVolatile   : append_unsafe_put_obj(callee, T_FLOAT,   true); return;
3473   case vmIntrinsics::_putDoubleVolatile  : append_unsafe_put_obj(callee, T_DOUBLE,  true); return;
3474   case vmIntrinsics::_compareAndSwapLong:
3475   case vmIntrinsics::_compareAndSwapInt:
3476   case vmIntrinsics::_compareAndSwapObject: append_unsafe_CAS(callee); return;
3477   case vmIntrinsics::_getAndAddInt:
3478   case vmIntrinsics::_getAndAddLong      : append_unsafe_get_and_set_obj(callee, true); return;
3479   case vmIntrinsics::_getAndSetInt       :
3480   case vmIntrinsics::_getAndSetLong      :
3481   case vmIntrinsics::_getAndSetObject    : append_unsafe_get_and_set_obj(callee, false); return;
3482   case vmIntrinsics::_getCharStringU     : append_char_access(callee, false); return;
3483   case vmIntrinsics::_putCharStringU     : append_char_access(callee, true); return;
3484   default:
3485     break;
3486   }
3487 
3488   // create intrinsic node
3489   const bool has_receiver = !callee->is_static();
3490   ValueType* result_type = as_ValueType(callee->return_type());
3491   ValueStack* state_before = copy_state_for_exception();
3492 
3493   Values* args = state()->pop_arguments(callee->arg_size());
3494 
3495   if (is_profiling()) {
3496     // Don't profile in the special case where the root method
3497     // is the intrinsic
3498     if (callee != method()) {
3499       // Note that we'd collect profile data in this method if we wanted it.
3500       compilation()->set_would_profile(true);
3501       if (profile_calls()) {
3502         Value recv = NULL;
3503         if (has_receiver) {
3504           recv = args->at(0);
3505           null_check(recv);
3506         }
3507         profile_call(callee, recv, NULL, collect_args_for_profiling(args, callee, true), true);
3508       }
3509     }
3510   }
3511 
3512   Intrinsic* result = new Intrinsic(result_type, callee->intrinsic_id(),
3513                                     args, has_receiver, state_before,
3514                                     vmIntrinsics::preserves_state(id),
3515                                     vmIntrinsics::can_trap(id));
3516   // append instruction & push result
3517   Value value = append_split(result);
3518   if (result_type != voidType && !ignore_return) {
3519     push(result_type, value);
3520   }
3521 
3522   if (callee != method() && profile_return() && result_type->is_object_kind()) {
3523     profile_return_type(result, callee);
3524   }
3525 }
3526 
3527 bool GraphBuilder::try_inline_intrinsics(ciMethod* callee, bool ignore_return) {
3528   // For calling is_intrinsic_available we need to transition to
3529   // the '_thread_in_vm' state because is_intrinsic_available()
3530   // accesses critical VM-internal data.
3531   bool is_available = false;
3532   {
3533     VM_ENTRY_MARK;
3534     methodHandle mh(THREAD, callee->get_Method());
3535     is_available = _compilation->compiler()->is_intrinsic_available(mh, _compilation->directive());
3536   }
3537 
3538   if (!is_available) {
3539     if (!InlineNatives) {
3540       // Return false and also set message that the inlining of
3541       // intrinsics has been disabled in general.
3542       INLINE_BAILOUT("intrinsic method inlining disabled");
3543     } else {
3544       return false;
3545     }
3546   }
3547   build_graph_for_intrinsic(callee, ignore_return);
3548   return true;
3549 }
3550 
3551 
3552 bool GraphBuilder::try_inline_jsr(int jsr_dest_bci) {
3553   // Introduce a new callee continuation point - all Ret instructions
3554   // will be replaced with Gotos to this point.
3555   BlockBegin* cont = block_at(next_bci());
3556   assert(cont != NULL, "continuation must exist (BlockListBuilder starts a new block after a jsr");
3557 
3558   // Note: can not assign state to continuation yet, as we have to
3559   // pick up the state from the Ret instructions.
3560 
3561   // Push callee scope
3562   push_scope_for_jsr(cont, jsr_dest_bci);
3563 
3564   // Temporarily set up bytecode stream so we can append instructions
3565   // (only using the bci of this stream)
3566   scope_data()->set_stream(scope_data()->parent()->stream());
3567 
3568   BlockBegin* jsr_start_block = block_at(jsr_dest_bci);
3569   assert(jsr_start_block != NULL, "jsr start block must exist");
3570   assert(!jsr_start_block->is_set(BlockBegin::was_visited_flag), "should not have visited jsr yet");
3571   Goto* goto_sub = new Goto(jsr_start_block, false);
3572   // Must copy state to avoid wrong sharing when parsing bytecodes
3573   assert(jsr_start_block->state() == NULL, "should have fresh jsr starting block");
3574   jsr_start_block->set_state(copy_state_before_with_bci(jsr_dest_bci));
3575   append(goto_sub);
3576   _block->set_end(goto_sub);
3577   _last = _block = jsr_start_block;
3578 
3579   // Clear out bytecode stream
3580   scope_data()->set_stream(NULL);
3581 
3582   scope_data()->add_to_work_list(jsr_start_block);
3583 
3584   // Ready to resume parsing in subroutine
3585   iterate_all_blocks();
3586 
3587   // If we bailed out during parsing, return immediately (this is bad news)
3588   CHECK_BAILOUT_(false);
3589 
3590   // Detect whether the continuation can actually be reached. If not,
3591   // it has not had state set by the join() operations in
3592   // iterate_bytecodes_for_block()/ret() and we should not touch the
3593   // iteration state. The calling activation of
3594   // iterate_bytecodes_for_block will then complete normally.
3595   if (cont->state() != NULL) {
3596     if (!cont->is_set(BlockBegin::was_visited_flag)) {
3597       // add continuation to work list instead of parsing it immediately
3598       scope_data()->parent()->add_to_work_list(cont);
3599     }
3600   }
3601 
3602   assert(jsr_continuation() == cont, "continuation must not have changed");
3603   assert(!jsr_continuation()->is_set(BlockBegin::was_visited_flag) ||
3604          jsr_continuation()->is_set(BlockBegin::parser_loop_header_flag),
3605          "continuation can only be visited in case of backward branches");
3606   assert(_last && _last->as_BlockEnd(), "block must have end");
3607 
3608   // continuation is in work list, so end iteration of current block
3609   _skip_block = true;
3610   pop_scope_for_jsr();
3611 
3612   return true;
3613 }
3614 
3615 
3616 // Inline the entry of a synchronized method as a monitor enter and
3617 // register the exception handler which releases the monitor if an
3618 // exception is thrown within the callee. Note that the monitor enter
3619 // cannot throw an exception itself, because the receiver is
3620 // guaranteed to be non-null by the explicit null check at the
3621 // beginning of inlining.
3622 void GraphBuilder::inline_sync_entry(Value lock, BlockBegin* sync_handler) {
3623   assert(lock != NULL && sync_handler != NULL, "lock or handler missing");
3624 
3625   monitorenter(lock, SynchronizationEntryBCI);
3626   assert(_last->as_MonitorEnter() != NULL, "monitor enter expected");
3627   _last->set_needs_null_check(false);
3628 
3629   sync_handler->set(BlockBegin::exception_entry_flag);
3630   sync_handler->set(BlockBegin::is_on_work_list_flag);
3631 
3632   ciExceptionHandler* desc = new ciExceptionHandler(method()->holder(), 0, method()->code_size(), -1, 0);
3633   XHandler* h = new XHandler(desc);
3634   h->set_entry_block(sync_handler);
3635   scope_data()->xhandlers()->append(h);
3636   scope_data()->set_has_handler();
3637 }
3638 
3639 
3640 // If an exception is thrown and not handled within an inlined
3641 // synchronized method, the monitor must be released before the
3642 // exception is rethrown in the outer scope. Generate the appropriate
3643 // instructions here.
3644 void GraphBuilder::fill_sync_handler(Value lock, BlockBegin* sync_handler, bool default_handler) {
3645   BlockBegin* orig_block = _block;
3646   ValueStack* orig_state = _state;
3647   Instruction* orig_last = _last;
3648   _last = _block = sync_handler;
3649   _state = sync_handler->state()->copy();
3650 
3651   assert(sync_handler != NULL, "handler missing");
3652   assert(!sync_handler->is_set(BlockBegin::was_visited_flag), "is visited here");
3653 
3654   assert(lock != NULL || default_handler, "lock or handler missing");
3655 
3656   XHandler* h = scope_data()->xhandlers()->remove_last();
3657   assert(h->entry_block() == sync_handler, "corrupt list of handlers");
3658 
3659   block()->set(BlockBegin::was_visited_flag);
3660   Value exception = append_with_bci(new ExceptionObject(), SynchronizationEntryBCI);
3661   assert(exception->is_pinned(), "must be");
3662 
3663   int bci = SynchronizationEntryBCI;
3664   if (compilation()->env()->dtrace_method_probes()) {
3665     // Report exit from inline methods.  We don't have a stream here
3666     // so pass an explicit bci of SynchronizationEntryBCI.
3667     Values* args = new Values(1);
3668     args->push(append_with_bci(new Constant(new MethodConstant(method())), bci));
3669     append_with_bci(new RuntimeCall(voidType, "dtrace_method_exit", CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_method_exit), args), bci);
3670   }
3671 
3672   if (lock) {
3673     assert(state()->locks_size() > 0 && state()->lock_at(state()->locks_size() - 1) == lock, "lock is missing");
3674     if (!lock->is_linked()) {
3675       lock = append_with_bci(lock, bci);
3676     }
3677 
3678     // exit the monitor in the context of the synchronized method
3679     monitorexit(lock, bci);
3680 
3681     // exit the context of the synchronized method
3682     if (!default_handler) {
3683       pop_scope();
3684       bci = _state->caller_state()->bci();
3685       _state = _state->caller_state()->copy_for_parsing();
3686     }
3687   }
3688 
3689   // perform the throw as if at the the call site
3690   apush(exception);
3691   throw_op(bci);
3692 
3693   BlockEnd* end = last()->as_BlockEnd();
3694   block()->set_end(end);
3695 
3696   _block = orig_block;
3697   _state = orig_state;
3698   _last = orig_last;
3699 }
3700 
3701 
3702 bool GraphBuilder::try_inline_full(ciMethod* callee, bool holder_known, bool ignore_return, Bytecodes::Code bc, Value receiver) {
3703   assert(!callee->is_native(), "callee must not be native");
3704   if (CompilationPolicy::policy()->should_not_inline(compilation()->env(), callee)) {
3705     INLINE_BAILOUT("inlining prohibited by policy");
3706   }
3707   // first perform tests of things it's not possible to inline
3708   if (callee->has_exception_handlers() &&
3709       !InlineMethodsWithExceptionHandlers) INLINE_BAILOUT("callee has exception handlers");
3710   if (callee->is_synchronized() &&
3711       !InlineSynchronizedMethods         ) INLINE_BAILOUT("callee is synchronized");
3712   if (!callee->holder()->is_initialized()) INLINE_BAILOUT("callee's klass not initialized yet");
3713   if (!callee->has_balanced_monitors())    INLINE_BAILOUT("callee's monitors do not match");
3714 
3715   // Proper inlining of methods with jsrs requires a little more work.
3716   if (callee->has_jsrs()                 ) INLINE_BAILOUT("jsrs not handled properly by inliner yet");
3717 
3718   // When SSE2 is used on intel, then no special handling is needed
3719   // for strictfp because the enum-constant is fixed at compile time,
3720   // the check for UseSSE2 is needed here
3721   if (strict_fp_requires_explicit_rounding && UseSSE < 2 && method()->is_strict() != callee->is_strict()) {
3722     INLINE_BAILOUT("caller and callee have different strict fp requirements");
3723   }
3724 
3725   if (is_profiling() && !callee->ensure_method_data()) {
3726     INLINE_BAILOUT("mdo allocation failed");
3727   }
3728 
3729   // now perform tests that are based on flag settings
3730   bool inlinee_by_directive = compilation()->directive()->should_inline(callee);
3731   if (callee->force_inline() || inlinee_by_directive) {
3732     if (inline_level() > MaxForceInlineLevel                    ) INLINE_BAILOUT("MaxForceInlineLevel");
3733     if (recursive_inline_level(callee) > MaxRecursiveInlineLevel) INLINE_BAILOUT("recursive inlining too deep");
3734 
3735     const char* msg = "";
3736     if (callee->force_inline())  msg = "force inline by annotation";
3737     if (inlinee_by_directive)    msg = "force inline by CompileCommand";
3738     print_inlining(callee, msg);
3739   } else {
3740     // use heuristic controls on inlining
3741     if (inline_level() > MaxInlineLevel                         ) INLINE_BAILOUT("inlining too deep");
3742     if (recursive_inline_level(callee) > MaxRecursiveInlineLevel) INLINE_BAILOUT("recursive inlining too deep");
3743     if (callee->code_size_for_inlining() > max_inline_size()    ) INLINE_BAILOUT("callee is too large");
3744 
3745     // don't inline throwable methods unless the inlining tree is rooted in a throwable class
3746     if (callee->name() == ciSymbol::object_initializer_name() &&
3747         callee->holder()->is_subclass_of(ciEnv::current()->Throwable_klass())) {
3748       // Throwable constructor call
3749       IRScope* top = scope();
3750       while (top->caller() != NULL) {
3751         top = top->caller();
3752       }
3753       if (!top->method()->holder()->is_subclass_of(ciEnv::current()->Throwable_klass())) {
3754         INLINE_BAILOUT("don't inline Throwable constructors");
3755       }
3756     }
3757 
3758     if (compilation()->env()->num_inlined_bytecodes() > DesiredMethodLimit) {
3759       INLINE_BAILOUT("total inlining greater than DesiredMethodLimit");
3760     }
3761     // printing
3762     print_inlining(callee);
3763   }
3764 
3765   // NOTE: Bailouts from this point on, which occur at the
3766   // GraphBuilder level, do not cause bailout just of the inlining but
3767   // in fact of the entire compilation.
3768 
3769   BlockBegin* orig_block = block();
3770 
3771   const bool is_invokedynamic = bc == Bytecodes::_invokedynamic;
3772   const bool has_receiver = (bc != Bytecodes::_invokestatic && !is_invokedynamic);
3773 
3774   const int args_base = state()->stack_size() - callee->arg_size();
3775   assert(args_base >= 0, "stack underflow during inlining");
3776 
3777   // Insert null check if necessary
3778   Value recv = NULL;
3779   if (has_receiver) {
3780     // note: null check must happen even if first instruction of callee does
3781     //       an implicit null check since the callee is in a different scope
3782     //       and we must make sure exception handling does the right thing
3783     assert(!callee->is_static(), "callee must not be static");
3784     assert(callee->arg_size() > 0, "must have at least a receiver");
3785     recv = state()->stack_at(args_base);
3786     null_check(recv);
3787   }
3788 
3789   if (is_profiling()) {
3790     // Note that we'd collect profile data in this method if we wanted it.
3791     // this may be redundant here...
3792     compilation()->set_would_profile(true);
3793 
3794     if (profile_calls()) {
3795       int start = 0;
3796       Values* obj_args = args_list_for_profiling(callee, start, has_receiver);
3797       if (obj_args != NULL) {
3798         int s = obj_args->max_length();
3799         // if called through method handle invoke, some arguments may have been popped
3800         for (int i = args_base+start, j = 0; j < obj_args->max_length() && i < state()->stack_size(); ) {
3801           Value v = state()->stack_at_inc(i);
3802           if (v->type()->is_object_kind()) {
3803             obj_args->push(v);
3804             j++;
3805           }
3806         }
3807         check_args_for_profiling(obj_args, s);
3808       }
3809       profile_call(callee, recv, holder_known ? callee->holder() : NULL, obj_args, true);
3810     }
3811   }
3812 
3813   // Introduce a new callee continuation point - if the callee has
3814   // more than one return instruction or the return does not allow
3815   // fall-through of control flow, all return instructions of the
3816   // callee will need to be replaced by Goto's pointing to this
3817   // continuation point.
3818   BlockBegin* cont = block_at(next_bci());
3819   bool continuation_existed = true;
3820   if (cont == NULL) {
3821     cont = new BlockBegin(next_bci());
3822     // low number so that continuation gets parsed as early as possible
3823     cont->set_depth_first_number(0);
3824     if (PrintInitialBlockList) {
3825       tty->print_cr("CFG: created block %d (bci %d) as continuation for inline at bci %d",
3826                     cont->block_id(), cont->bci(), bci());
3827     }
3828     continuation_existed = false;
3829   }
3830   // Record number of predecessors of continuation block before
3831   // inlining, to detect if inlined method has edges to its
3832   // continuation after inlining.
3833   int continuation_preds = cont->number_of_preds();
3834 
3835   // Push callee scope
3836   push_scope(callee, cont);
3837 
3838   // the BlockListBuilder for the callee could have bailed out
3839   if (bailed_out())
3840       return false;
3841 
3842   // Temporarily set up bytecode stream so we can append instructions
3843   // (only using the bci of this stream)
3844   scope_data()->set_stream(scope_data()->parent()->stream());
3845 
3846   // Pass parameters into callee state: add assignments
3847   // note: this will also ensure that all arguments are computed before being passed
3848   ValueStack* callee_state = state();
3849   ValueStack* caller_state = state()->caller_state();
3850   for (int i = args_base; i < caller_state->stack_size(); ) {
3851     const int arg_no = i - args_base;
3852     Value arg = caller_state->stack_at_inc(i);
3853     store_local(callee_state, arg, arg_no);
3854   }
3855 
3856   // Remove args from stack.
3857   // Note that we preserve locals state in case we can use it later
3858   // (see use of pop_scope() below)
3859   caller_state->truncate_stack(args_base);
3860   assert(callee_state->stack_size() == 0, "callee stack must be empty");
3861 
3862   Value lock = NULL;
3863   BlockBegin* sync_handler = NULL;
3864 
3865   // Inline the locking of the receiver if the callee is synchronized
3866   if (callee->is_synchronized()) {
3867     lock = callee->is_static() ? append(new Constant(new InstanceConstant(callee->holder()->java_mirror())))
3868                                : state()->local_at(0);
3869     sync_handler = new BlockBegin(SynchronizationEntryBCI);
3870     inline_sync_entry(lock, sync_handler);
3871   }
3872 
3873   if (compilation()->env()->dtrace_method_probes()) {
3874     Values* args = new Values(1);
3875     args->push(append(new Constant(new MethodConstant(method()))));
3876     append(new RuntimeCall(voidType, "dtrace_method_entry", CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_method_entry), args));
3877   }
3878 
3879   if (profile_inlined_calls()) {
3880     profile_invocation(callee, copy_state_before_with_bci(SynchronizationEntryBCI));
3881   }
3882 
3883   BlockBegin* callee_start_block = block_at(0);
3884   if (callee_start_block != NULL) {
3885     assert(callee_start_block->is_set(BlockBegin::parser_loop_header_flag), "must be loop header");
3886     Goto* goto_callee = new Goto(callee_start_block, false);
3887     // The state for this goto is in the scope of the callee, so use
3888     // the entry bci for the callee instead of the call site bci.
3889     append_with_bci(goto_callee, 0);
3890     _block->set_end(goto_callee);
3891     callee_start_block->merge(callee_state);
3892 
3893     _last = _block = callee_start_block;
3894 
3895     scope_data()->add_to_work_list(callee_start_block);
3896   }
3897 
3898   // Clear out bytecode stream
3899   scope_data()->set_stream(NULL);
3900   scope_data()->set_ignore_return(ignore_return);
3901 
3902   CompileLog* log = compilation()->log();
3903   if (log != NULL) log->head("parse method='%d'", log->identify(callee));
3904 
3905   // Ready to resume parsing in callee (either in the same block we
3906   // were in before or in the callee's start block)
3907   iterate_all_blocks(callee_start_block == NULL);
3908 
3909   if (log != NULL) log->done("parse");
3910 
3911   // If we bailed out during parsing, return immediately (this is bad news)
3912   if (bailed_out())
3913       return false;
3914 
3915   // iterate_all_blocks theoretically traverses in random order; in
3916   // practice, we have only traversed the continuation if we are
3917   // inlining into a subroutine
3918   assert(continuation_existed ||
3919          !continuation()->is_set(BlockBegin::was_visited_flag),
3920          "continuation should not have been parsed yet if we created it");
3921 
3922   // At this point we are almost ready to return and resume parsing of
3923   // the caller back in the GraphBuilder. The only thing we want to do
3924   // first is an optimization: during parsing of the callee we
3925   // generated at least one Goto to the continuation block. If we
3926   // generated exactly one, and if the inlined method spanned exactly
3927   // one block (and we didn't have to Goto its entry), then we snip
3928   // off the Goto to the continuation, allowing control to fall
3929   // through back into the caller block and effectively performing
3930   // block merging. This allows load elimination and CSE to take place
3931   // across multiple callee scopes if they are relatively simple, and
3932   // is currently essential to making inlining profitable.
3933   if (num_returns() == 1
3934       && block() == orig_block
3935       && block() == inline_cleanup_block()) {
3936     _last  = inline_cleanup_return_prev();
3937     _state = inline_cleanup_state();
3938   } else if (continuation_preds == cont->number_of_preds()) {
3939     // Inlining caused that the instructions after the invoke in the
3940     // caller are not reachable any more. So skip filling this block
3941     // with instructions!
3942     assert(cont == continuation(), "");
3943     assert(_last && _last->as_BlockEnd(), "");
3944     _skip_block = true;
3945   } else {
3946     // Resume parsing in continuation block unless it was already parsed.
3947     // Note that if we don't change _last here, iteration in
3948     // iterate_bytecodes_for_block will stop when we return.
3949     if (!continuation()->is_set(BlockBegin::was_visited_flag)) {
3950       // add continuation to work list instead of parsing it immediately
3951       assert(_last && _last->as_BlockEnd(), "");
3952       scope_data()->parent()->add_to_work_list(continuation());
3953       _skip_block = true;
3954     }
3955   }
3956 
3957   // Fill the exception handler for synchronized methods with instructions
3958   if (callee->is_synchronized() && sync_handler->state() != NULL) {
3959     fill_sync_handler(lock, sync_handler);
3960   } else {
3961     pop_scope();
3962   }
3963 
3964   compilation()->notice_inlined_method(callee);
3965 
3966   return true;
3967 }
3968 
3969 
3970 bool GraphBuilder::try_method_handle_inline(ciMethod* callee, bool ignore_return) {
3971   ValueStack* state_before = copy_state_before();
3972   vmIntrinsics::ID iid = callee->intrinsic_id();
3973   switch (iid) {
3974   case vmIntrinsics::_invokeBasic:
3975     {
3976       // get MethodHandle receiver
3977       const int args_base = state()->stack_size() - callee->arg_size();
3978       ValueType* type = state()->stack_at(args_base)->type();
3979       if (type->is_constant()) {
3980         ciMethod* target = type->as_ObjectType()->constant_value()->as_method_handle()->get_vmtarget();
3981         // We don't do CHA here so only inline static and statically bindable methods.
3982         if (target->is_static() || target->can_be_statically_bound()) {
3983           Bytecodes::Code bc = target->is_static() ? Bytecodes::_invokestatic : Bytecodes::_invokevirtual;
3984           ignore_return = ignore_return || (callee->return_type()->is_void() && !target->return_type()->is_void());
3985           if (try_inline(target, /*holder_known*/ true, ignore_return, bc)) {
3986             return true;
3987           }
3988         } else {
3989           print_inlining(target, "not static or statically bindable", /*success*/ false);
3990         }
3991       } else {
3992         print_inlining(callee, "receiver not constant", /*success*/ false);
3993       }
3994     }
3995     break;
3996 
3997   case vmIntrinsics::_linkToVirtual:
3998   case vmIntrinsics::_linkToStatic:
3999   case vmIntrinsics::_linkToSpecial:
4000   case vmIntrinsics::_linkToInterface:
4001     {
4002       // pop MemberName argument
4003       const int args_base = state()->stack_size() - callee->arg_size();
4004       ValueType* type = apop()->type();
4005       if (type->is_constant()) {
4006         ciMethod* target = type->as_ObjectType()->constant_value()->as_member_name()->get_vmtarget();
4007         ignore_return = ignore_return || (callee->return_type()->is_void() && !target->return_type()->is_void());
4008         // If the target is another method handle invoke, try to recursively get
4009         // a better target.
4010         if (target->is_method_handle_intrinsic()) {
4011           if (try_method_handle_inline(target, ignore_return)) {
4012             return true;
4013           }
4014         } else {
4015           ciSignature* signature = target->signature();
4016           const int receiver_skip = target->is_static() ? 0 : 1;
4017           // Cast receiver to its type.
4018           if (!target->is_static()) {
4019             ciKlass* tk = signature->accessing_klass();
4020             Value obj = state()->stack_at(args_base);
4021             if (obj->exact_type() == NULL &&
4022                 obj->declared_type() != tk && tk != compilation()->env()->Object_klass()) {
4023               TypeCast* c = new TypeCast(tk, obj, state_before);
4024               append(c);
4025               state()->stack_at_put(args_base, c);
4026             }
4027           }
4028           // Cast reference arguments to its type.
4029           for (int i = 0, j = 0; i < signature->count(); i++) {
4030             ciType* t = signature->type_at(i);
4031             if (t->is_klass()) {
4032               ciKlass* tk = t->as_klass();
4033               Value obj = state()->stack_at(args_base + receiver_skip + j);
4034               if (obj->exact_type() == NULL &&
4035                   obj->declared_type() != tk && tk != compilation()->env()->Object_klass()) {
4036                 TypeCast* c = new TypeCast(t, obj, state_before);
4037                 append(c);
4038                 state()->stack_at_put(args_base + receiver_skip + j, c);
4039               }
4040             }
4041             j += t->size();  // long and double take two slots
4042           }
4043           // We don't do CHA here so only inline static and statically bindable methods.
4044           if (target->is_static() || target->can_be_statically_bound()) {
4045             Bytecodes::Code bc = target->is_static() ? Bytecodes::_invokestatic : Bytecodes::_invokevirtual;
4046             if (try_inline(target, /*holder_known*/ true, ignore_return, bc)) {
4047               return true;
4048             }
4049           } else {
4050             print_inlining(target, "not static or statically bindable", /*success*/ false);
4051           }
4052         }
4053       } else {
4054         print_inlining(callee, "MemberName not constant", /*success*/ false);
4055       }
4056     }
4057     break;
4058 
4059   default:
4060     fatal("unexpected intrinsic %d: %s", iid, vmIntrinsics::name_at(iid));
4061     break;
4062   }
4063   set_state(state_before->copy_for_parsing());
4064   return false;
4065 }
4066 
4067 
4068 void GraphBuilder::inline_bailout(const char* msg) {
4069   assert(msg != NULL, "inline bailout msg must exist");
4070   _inline_bailout_msg = msg;
4071 }
4072 
4073 
4074 void GraphBuilder::clear_inline_bailout() {
4075   _inline_bailout_msg = NULL;
4076 }
4077 
4078 
4079 void GraphBuilder::push_root_scope(IRScope* scope, BlockList* bci2block, BlockBegin* start) {
4080   ScopeData* data = new ScopeData(NULL);
4081   data->set_scope(scope);
4082   data->set_bci2block(bci2block);
4083   _scope_data = data;
4084   _block = start;
4085 }
4086 
4087 
4088 void GraphBuilder::push_scope(ciMethod* callee, BlockBegin* continuation) {
4089   IRScope* callee_scope = new IRScope(compilation(), scope(), bci(), callee, -1, false);
4090   scope()->add_callee(callee_scope);
4091 
4092   BlockListBuilder blb(compilation(), callee_scope, -1);
4093   CHECK_BAILOUT();
4094 
4095   if (!blb.bci2block()->at(0)->is_set(BlockBegin::parser_loop_header_flag)) {
4096     // this scope can be inlined directly into the caller so remove
4097     // the block at bci 0.
4098     blb.bci2block()->at_put(0, NULL);
4099   }
4100 
4101   set_state(new ValueStack(callee_scope, state()->copy(ValueStack::CallerState, bci())));
4102 
4103   ScopeData* data = new ScopeData(scope_data());
4104   data->set_scope(callee_scope);
4105   data->set_bci2block(blb.bci2block());
4106   data->set_continuation(continuation);
4107   _scope_data = data;
4108 }
4109 
4110 
4111 void GraphBuilder::push_scope_for_jsr(BlockBegin* jsr_continuation, int jsr_dest_bci) {
4112   ScopeData* data = new ScopeData(scope_data());
4113   data->set_parsing_jsr();
4114   data->set_jsr_entry_bci(jsr_dest_bci);
4115   data->set_jsr_return_address_local(-1);
4116   // Must clone bci2block list as we will be mutating it in order to
4117   // properly clone all blocks in jsr region as well as exception
4118   // handlers containing rets
4119   BlockList* new_bci2block = new BlockList(bci2block()->length());
4120   new_bci2block->appendAll(bci2block());
4121   data->set_bci2block(new_bci2block);
4122   data->set_scope(scope());
4123   data->setup_jsr_xhandlers();
4124   data->set_continuation(continuation());
4125   data->set_jsr_continuation(jsr_continuation);
4126   _scope_data = data;
4127 }
4128 
4129 
4130 void GraphBuilder::pop_scope() {
4131   int number_of_locks = scope()->number_of_locks();
4132   _scope_data = scope_data()->parent();
4133   // accumulate minimum number of monitor slots to be reserved
4134   scope()->set_min_number_of_locks(number_of_locks);
4135 }
4136 
4137 
4138 void GraphBuilder::pop_scope_for_jsr() {
4139   _scope_data = scope_data()->parent();
4140 }
4141 
4142 void GraphBuilder::append_unsafe_get_obj(ciMethod* callee, BasicType t, bool is_volatile) {
4143   Values* args = state()->pop_arguments(callee->arg_size());
4144   null_check(args->at(0));
4145   Instruction* offset = args->at(2);
4146 #ifndef _LP64
4147   offset = append(new Convert(Bytecodes::_l2i, offset, as_ValueType(T_INT)));
4148 #endif
4149   Instruction* op = append(new UnsafeGetObject(t, args->at(1), offset, is_volatile));
4150   push(op->type(), op);
4151   compilation()->set_has_unsafe_access(true);
4152 }
4153 
4154 
4155 void GraphBuilder::append_unsafe_put_obj(ciMethod* callee, BasicType t, bool is_volatile) {
4156   Values* args = state()->pop_arguments(callee->arg_size());
4157   null_check(args->at(0));
4158   Instruction* offset = args->at(2);
4159 #ifndef _LP64
4160   offset = append(new Convert(Bytecodes::_l2i, offset, as_ValueType(T_INT)));
4161 #endif
4162   Value val = args->at(3);
4163   if (t == T_BOOLEAN) {
4164     Value mask = append(new Constant(new IntConstant(1)));
4165     val = append(new LogicOp(Bytecodes::_iand, val, mask));
4166   }
4167   Instruction* op = append(new UnsafePutObject(t, args->at(1), offset, val, is_volatile));
4168   compilation()->set_has_unsafe_access(true);
4169   kill_all();
4170 }
4171 
4172 
4173 void GraphBuilder::append_unsafe_get_raw(ciMethod* callee, BasicType t) {
4174   Values* args = state()->pop_arguments(callee->arg_size());
4175   null_check(args->at(0));
4176   Instruction* op = append(new UnsafeGetRaw(t, args->at(1), false));
4177   push(op->type(), op);
4178   compilation()->set_has_unsafe_access(true);
4179 }
4180 
4181 
4182 void GraphBuilder::append_unsafe_put_raw(ciMethod* callee, BasicType t) {
4183   Values* args = state()->pop_arguments(callee->arg_size());
4184   null_check(args->at(0));
4185   Instruction* op = append(new UnsafePutRaw(t, args->at(1), args->at(2)));
4186   compilation()->set_has_unsafe_access(true);
4187 }
4188 
4189 
4190 void GraphBuilder::append_unsafe_CAS(ciMethod* callee) {
4191   ValueStack* state_before = copy_state_for_exception();
4192   ValueType* result_type = as_ValueType(callee->return_type());
4193   assert(result_type->is_int(), "int result");
4194   Values* args = state()->pop_arguments(callee->arg_size());
4195 
4196   // Pop off some args to specially handle, then push back
4197   Value newval = args->pop();
4198   Value cmpval = args->pop();
4199   Value offset = args->pop();
4200   Value src = args->pop();
4201   Value unsafe_obj = args->pop();
4202 
4203   // Separately handle the unsafe arg. It is not needed for code
4204   // generation, but must be null checked
4205   null_check(unsafe_obj);
4206 
4207 #ifndef _LP64
4208   offset = append(new Convert(Bytecodes::_l2i, offset, as_ValueType(T_INT)));
4209 #endif
4210 
4211   args->push(src);
4212   args->push(offset);
4213   args->push(cmpval);
4214   args->push(newval);
4215 
4216   // An unsafe CAS can alias with other field accesses, but we don't
4217   // know which ones so mark the state as no preserved.  This will
4218   // cause CSE to invalidate memory across it.
4219   bool preserves_state = false;
4220   Intrinsic* result = new Intrinsic(result_type, callee->intrinsic_id(), args, false, state_before, preserves_state);
4221   append_split(result);
4222   push(result_type, result);
4223   compilation()->set_has_unsafe_access(true);
4224 }
4225 
4226 void GraphBuilder::append_char_access(ciMethod* callee, bool is_store) {
4227   // This intrinsic accesses byte[] array as char[] array. Computing the offsets
4228   // correctly requires matched array shapes.
4229   assert (arrayOopDesc::base_offset_in_bytes(T_CHAR) == arrayOopDesc::base_offset_in_bytes(T_BYTE),
4230           "sanity: byte[] and char[] bases agree");
4231   assert (type2aelembytes(T_CHAR) == type2aelembytes(T_BYTE)*2,
4232           "sanity: byte[] and char[] scales agree");
4233 
4234   ValueStack* state_before = copy_state_indexed_access();
4235   compilation()->set_has_access_indexed(true);
4236   Values* args = state()->pop_arguments(callee->arg_size());
4237   Value array = args->at(0);
4238   Value index = args->at(1);
4239   if (is_store) {
4240     Value value = args->at(2);
4241     Instruction* store = append(new StoreIndexed(array, index, NULL, T_CHAR, value, state_before, false, true));
4242     store->set_flag(Instruction::NeedsRangeCheckFlag, false);
4243     _memory->store_value(value);
4244   } else {
4245     Instruction* load = append(new LoadIndexed(array, index, NULL, T_CHAR, state_before, true));
4246     load->set_flag(Instruction::NeedsRangeCheckFlag, false);
4247     push(load->type(), load);
4248   }
4249 }
4250 
4251 void GraphBuilder::print_inlining(ciMethod* callee, const char* msg, bool success) {
4252   CompileLog* log = compilation()->log();
4253   if (log != NULL) {
4254     if (success) {
4255       if (msg != NULL)
4256         log->inline_success(msg);
4257       else
4258         log->inline_success("receiver is statically known");
4259     } else {
4260       if (msg != NULL)
4261         log->inline_fail(msg);
4262       else
4263         log->inline_fail("reason unknown");
4264     }
4265   }
4266 #if INCLUDE_TRACE
4267   EventCompilerInlining event;
4268   if (event.should_commit()) {
4269     event.set_compileId(compilation()->env()->task()->compile_id());
4270     event.set_message(msg);
4271     event.set_succeeded(success);
4272     event.set_bci(bci());
4273     event.set_caller(method()->get_Method());
4274     event.set_callee(callee->to_trace_struct());
4275     event.commit();
4276   }
4277 #endif // INCLUDE_TRACE
4278 
4279   if (!compilation()->directive()->PrintInliningOption) {
4280     return;
4281   }
4282   CompileTask::print_inlining_tty(callee, scope()->level(), bci(), msg);
4283   if (success && CIPrintMethodCodes) {
4284     callee->print_codes();
4285   }
4286 }
4287 
4288 void GraphBuilder::append_unsafe_get_and_set_obj(ciMethod* callee, bool is_add) {
4289   Values* args = state()->pop_arguments(callee->arg_size());
4290   BasicType t = callee->return_type()->basic_type();
4291   null_check(args->at(0));
4292   Instruction* offset = args->at(2);
4293 #ifndef _LP64
4294   offset = append(new Convert(Bytecodes::_l2i, offset, as_ValueType(T_INT)));
4295 #endif
4296   Instruction* op = append(new UnsafeGetAndSetObject(t, args->at(1), offset, args->at(3), is_add));
4297   compilation()->set_has_unsafe_access(true);
4298   kill_all();
4299   push(op->type(), op);
4300 }
4301 
4302 #ifndef PRODUCT
4303 void GraphBuilder::print_stats() {
4304   vmap()->print();
4305 }
4306 #endif // PRODUCT
4307 
4308 void GraphBuilder::profile_call(ciMethod* callee, Value recv, ciKlass* known_holder, Values* obj_args, bool inlined) {
4309   assert(known_holder == NULL || (known_holder->is_instance_klass() &&
4310                                   (!known_holder->is_interface() ||
4311                                    ((ciInstanceKlass*)known_holder)->has_default_methods())), "should be default method");
4312   if (known_holder != NULL) {
4313     if (known_holder->exact_klass() == NULL) {
4314       known_holder = compilation()->cha_exact_type(known_holder);
4315     }
4316   }
4317 
4318   append(new ProfileCall(method(), bci(), callee, recv, known_holder, obj_args, inlined));
4319 }
4320 
4321 void GraphBuilder::profile_return_type(Value ret, ciMethod* callee, ciMethod* m, int invoke_bci) {
4322   assert((m == NULL) == (invoke_bci < 0), "invalid method and invalid bci together");
4323   if (m == NULL) {
4324     m = method();
4325   }
4326   if (invoke_bci < 0) {
4327     invoke_bci = bci();
4328   }
4329   ciMethodData* md = m->method_data_or_null();
4330   ciProfileData* data = md->bci_to_data(invoke_bci);
4331   if (data->is_CallTypeData() || data->is_VirtualCallTypeData()) {
4332     append(new ProfileReturnType(m , invoke_bci, callee, ret));
4333   }
4334 }
4335 
4336 void GraphBuilder::profile_invocation(ciMethod* callee, ValueStack* state) {
4337   append(new ProfileInvoke(callee, state));
4338 }
--- EOF ---