1 /*
   2  * Copyright (c) 1999, 2018, 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       default:
 352         break;
 353     }
 354   }
 355 }
 356 
 357 
 358 void BlockListBuilder::mark_loops() {
 359   ResourceMark rm;
 360 
 361   _active.initialize(BlockBegin::number_of_blocks());
 362   _visited.initialize(BlockBegin::number_of_blocks());
 363   _loop_map = intArray(BlockBegin::number_of_blocks(), BlockBegin::number_of_blocks(), 0);
 364   _next_loop_index = 0;
 365   _next_block_number = _blocks.length();
 366 
 367   // recursively iterate the control flow graph
 368   mark_loops(_bci2block->at(0), false);
 369   assert(_next_block_number >= 0, "invalid block numbers");
 370 
 371   // Remove dangling Resource pointers before the ResourceMark goes out-of-scope.
 372   _active.resize(0);
 373   _visited.resize(0);
 374 }
 375 
 376 void BlockListBuilder::make_loop_header(BlockBegin* block) {
 377   if (block->is_set(BlockBegin::exception_entry_flag)) {
 378     // exception edges may look like loops but don't mark them as such
 379     // since it screws up block ordering.
 380     return;
 381   }
 382   if (!block->is_set(BlockBegin::parser_loop_header_flag)) {
 383     block->set(BlockBegin::parser_loop_header_flag);
 384 
 385     assert(_loop_map.at(block->block_id()) == 0, "must not be set yet");
 386     assert(0 <= _next_loop_index && _next_loop_index < BitsPerInt, "_next_loop_index is used as a bit-index in integer");
 387     _loop_map.at_put(block->block_id(), 1 << _next_loop_index);
 388     if (_next_loop_index < 31) _next_loop_index++;
 389   } else {
 390     // block already marked as loop header
 391     assert(is_power_of_2((unsigned int)_loop_map.at(block->block_id())), "exactly one bit must be set");
 392   }
 393 }
 394 
 395 int BlockListBuilder::mark_loops(BlockBegin* block, bool in_subroutine) {
 396   int block_id = block->block_id();
 397 
 398   if (_visited.at(block_id)) {
 399     if (_active.at(block_id)) {
 400       // reached block via backward branch
 401       make_loop_header(block);
 402     }
 403     // return cached loop information for this block
 404     return _loop_map.at(block_id);
 405   }
 406 
 407   if (block->is_set(BlockBegin::subroutine_entry_flag)) {
 408     in_subroutine = true;
 409   }
 410 
 411   // set active and visited bits before successors are processed
 412   _visited.set_bit(block_id);
 413   _active.set_bit(block_id);
 414 
 415   intptr_t loop_state = 0;
 416   for (int i = block->number_of_sux() - 1; i >= 0; i--) {
 417     // recursively process all successors
 418     loop_state |= mark_loops(block->sux_at(i), in_subroutine);
 419   }
 420 
 421   // clear active-bit after all successors are processed
 422   _active.clear_bit(block_id);
 423 
 424   // reverse-post-order numbering of all blocks
 425   block->set_depth_first_number(_next_block_number);
 426   _next_block_number--;
 427 
 428   if (loop_state != 0 || in_subroutine ) {
 429     // block is contained at least in one loop, so phi functions are necessary
 430     // phi functions are also necessary for all locals stored in a subroutine
 431     scope()->requires_phi_function().set_union(block->stores_to_locals());
 432   }
 433 
 434   if (block->is_set(BlockBegin::parser_loop_header_flag)) {
 435     int header_loop_state = _loop_map.at(block_id);
 436     assert(is_power_of_2((unsigned)header_loop_state), "exactly one bit must be set");
 437 
 438     // If the highest bit is set (i.e. when integer value is negative), the method
 439     // has 32 or more loops. This bit is never cleared because it is used for multiple loops
 440     if (header_loop_state >= 0) {
 441       clear_bits(loop_state, header_loop_state);
 442     }
 443   }
 444 
 445   // cache and return loop information for this block
 446   _loop_map.at_put(block_id, loop_state);
 447   return loop_state;
 448 }
 449 
 450 
 451 #ifndef PRODUCT
 452 
 453 int compare_depth_first(BlockBegin** a, BlockBegin** b) {
 454   return (*a)->depth_first_number() - (*b)->depth_first_number();
 455 }
 456 
 457 void BlockListBuilder::print() {
 458   tty->print("----- initial block list of BlockListBuilder for method ");
 459   method()->print_short_name();
 460   tty->cr();
 461 
 462   // better readability if blocks are sorted in processing order
 463   _blocks.sort(compare_depth_first);
 464 
 465   for (int i = 0; i < _blocks.length(); i++) {
 466     BlockBegin* cur = _blocks.at(i);
 467     tty->print("%4d: B%-4d bci: %-4d  preds: %-4d ", cur->depth_first_number(), cur->block_id(), cur->bci(), cur->total_preds());
 468 
 469     tty->print(cur->is_set(BlockBegin::std_entry_flag)               ? " std" : "    ");
 470     tty->print(cur->is_set(BlockBegin::osr_entry_flag)               ? " osr" : "    ");
 471     tty->print(cur->is_set(BlockBegin::exception_entry_flag)         ? " ex" : "   ");
 472     tty->print(cur->is_set(BlockBegin::subroutine_entry_flag)        ? " sr" : "   ");
 473     tty->print(cur->is_set(BlockBegin::parser_loop_header_flag)      ? " lh" : "   ");
 474 
 475     if (cur->number_of_sux() > 0) {
 476       tty->print("    sux: ");
 477       for (int j = 0; j < cur->number_of_sux(); j++) {
 478         BlockBegin* sux = cur->sux_at(j);
 479         tty->print("B%d ", sux->block_id());
 480       }
 481     }
 482     tty->cr();
 483   }
 484 }
 485 
 486 #endif
 487 
 488 
 489 // A simple growable array of Values indexed by ciFields
 490 class FieldBuffer: public CompilationResourceObj {
 491  private:
 492   GrowableArray<Value> _values;
 493 
 494  public:
 495   FieldBuffer() {}
 496 
 497   void kill() {
 498     _values.trunc_to(0);
 499   }
 500 
 501   Value at(ciField* field) {
 502     assert(field->holder()->is_loaded(), "must be a loaded field");
 503     int offset = field->offset();
 504     if (offset < _values.length()) {
 505       return _values.at(offset);
 506     } else {
 507       return NULL;
 508     }
 509   }
 510 
 511   void at_put(ciField* field, Value value) {
 512     assert(field->holder()->is_loaded(), "must be a loaded field");
 513     int offset = field->offset();
 514     _values.at_put_grow(offset, value, NULL);
 515   }
 516 
 517 };
 518 
 519 
 520 // MemoryBuffer is fairly simple model of the current state of memory.
 521 // It partitions memory into several pieces.  The first piece is
 522 // generic memory where little is known about the owner of the memory.
 523 // This is conceptually represented by the tuple <O, F, V> which says
 524 // that the field F of object O has value V.  This is flattened so
 525 // that F is represented by the offset of the field and the parallel
 526 // arrays _objects and _values are used for O and V.  Loads of O.F can
 527 // simply use V.  Newly allocated objects are kept in a separate list
 528 // along with a parallel array for each object which represents the
 529 // current value of its fields.  Stores of the default value to fields
 530 // which have never been stored to before are eliminated since they
 531 // are redundant.  Once newly allocated objects are stored into
 532 // another object or they are passed out of the current compile they
 533 // are treated like generic memory.
 534 
 535 class MemoryBuffer: public CompilationResourceObj {
 536  private:
 537   FieldBuffer                 _values;
 538   GrowableArray<Value>        _objects;
 539   GrowableArray<Value>        _newobjects;
 540   GrowableArray<FieldBuffer*> _fields;
 541 
 542  public:
 543   MemoryBuffer() {}
 544 
 545   StoreField* store(StoreField* st) {
 546     if (!EliminateFieldAccess) {
 547       return st;
 548     }
 549 
 550     Value object = st->obj();
 551     Value value = st->value();
 552     ciField* field = st->field();
 553     if (field->holder()->is_loaded()) {
 554       int offset = field->offset();
 555       int index = _newobjects.find(object);
 556       if (index != -1) {
 557         // newly allocated object with no other stores performed on this field
 558         FieldBuffer* buf = _fields.at(index);
 559         if (buf->at(field) == NULL && is_default_value(value)) {
 560 #ifndef PRODUCT
 561           if (PrintIRDuringConstruction && Verbose) {
 562             tty->print_cr("Eliminated store for object %d:", index);
 563             st->print_line();
 564           }
 565 #endif
 566           return NULL;
 567         } else {
 568           buf->at_put(field, value);
 569         }
 570       } else {
 571         _objects.at_put_grow(offset, object, NULL);
 572         _values.at_put(field, value);
 573       }
 574 
 575       store_value(value);
 576     } else {
 577       // if we held onto field names we could alias based on names but
 578       // we don't know what's being stored to so kill it all.
 579       kill();
 580     }
 581     return st;
 582   }
 583 
 584 
 585   // return true if this value correspond to the default value of a field.
 586   bool is_default_value(Value value) {
 587     Constant* con = value->as_Constant();
 588     if (con) {
 589       switch (con->type()->tag()) {
 590         case intTag:    return con->type()->as_IntConstant()->value() == 0;
 591         case longTag:   return con->type()->as_LongConstant()->value() == 0;
 592         case floatTag:  return jint_cast(con->type()->as_FloatConstant()->value()) == 0;
 593         case doubleTag: return jlong_cast(con->type()->as_DoubleConstant()->value()) == jlong_cast(0);
 594         case objectTag: return con->type() == objectNull;
 595         default:  ShouldNotReachHere();
 596       }
 597     }
 598     return false;
 599   }
 600 
 601 
 602   // return either the actual value of a load or the load itself
 603   Value load(LoadField* load) {
 604     if (!EliminateFieldAccess) {
 605       return load;
 606     }
 607 
 608     if (RoundFPResults && UseSSE < 2 && load->type()->is_float_kind()) {
 609       // can't skip load since value might get rounded as a side effect
 610       return load;
 611     }
 612 
 613     ciField* field = load->field();
 614     Value object   = load->obj();
 615     if (field->holder()->is_loaded() && !field->is_volatile()) {
 616       int offset = field->offset();
 617       Value result = NULL;
 618       int index = _newobjects.find(object);
 619       if (index != -1) {
 620         result = _fields.at(index)->at(field);
 621       } else if (_objects.at_grow(offset, NULL) == object) {
 622         result = _values.at(field);
 623       }
 624       if (result != NULL) {
 625 #ifndef PRODUCT
 626         if (PrintIRDuringConstruction && Verbose) {
 627           tty->print_cr("Eliminated load: ");
 628           load->print_line();
 629         }
 630 #endif
 631         assert(result->type()->tag() == load->type()->tag(), "wrong types");
 632         return result;
 633       }
 634     }
 635     return load;
 636   }
 637 
 638   // Record this newly allocated object
 639   void new_instance(NewInstance* object) {
 640     int index = _newobjects.length();
 641     _newobjects.append(object);
 642     if (_fields.at_grow(index, NULL) == NULL) {
 643       _fields.at_put(index, new FieldBuffer());
 644     } else {
 645       _fields.at(index)->kill();
 646     }
 647   }
 648 
 649   void store_value(Value value) {
 650     int index = _newobjects.find(value);
 651     if (index != -1) {
 652       // stored a newly allocated object into another object.
 653       // Assume we've lost track of it as separate slice of memory.
 654       // We could do better by keeping track of whether individual
 655       // fields could alias each other.
 656       _newobjects.remove_at(index);
 657       // pull out the field info and store it at the end up the list
 658       // of field info list to be reused later.
 659       _fields.append(_fields.at(index));
 660       _fields.remove_at(index);
 661     }
 662   }
 663 
 664   void kill() {
 665     _newobjects.trunc_to(0);
 666     _objects.trunc_to(0);
 667     _values.kill();
 668   }
 669 };
 670 
 671 
 672 // Implementation of GraphBuilder's ScopeData
 673 
 674 GraphBuilder::ScopeData::ScopeData(ScopeData* parent)
 675   : _parent(parent)
 676   , _bci2block(NULL)
 677   , _scope(NULL)
 678   , _has_handler(false)
 679   , _stream(NULL)
 680   , _work_list(NULL)
 681   , _parsing_jsr(false)
 682   , _jsr_xhandlers(NULL)
 683   , _caller_stack_size(-1)
 684   , _continuation(NULL)
 685   , _num_returns(0)
 686   , _cleanup_block(NULL)
 687   , _cleanup_return_prev(NULL)
 688   , _cleanup_state(NULL)
 689   , _ignore_return(false)
 690 {
 691   if (parent != NULL) {
 692     _max_inline_size = (intx) ((float) NestedInliningSizeRatio * (float) parent->max_inline_size() / 100.0f);
 693   } else {
 694     _max_inline_size = MaxInlineSize;
 695   }
 696   if (_max_inline_size < MaxTrivialSize) {
 697     _max_inline_size = MaxTrivialSize;
 698   }
 699 }
 700 
 701 
 702 void GraphBuilder::kill_all() {
 703   if (UseLocalValueNumbering) {
 704     vmap()->kill_all();
 705   }
 706   _memory->kill();
 707 }
 708 
 709 
 710 BlockBegin* GraphBuilder::ScopeData::block_at(int bci) {
 711   if (parsing_jsr()) {
 712     // It is necessary to clone all blocks associated with a
 713     // subroutine, including those for exception handlers in the scope
 714     // of the method containing the jsr (because those exception
 715     // handlers may contain ret instructions in some cases).
 716     BlockBegin* block = bci2block()->at(bci);
 717     if (block != NULL && block == parent()->bci2block()->at(bci)) {
 718       BlockBegin* new_block = new BlockBegin(block->bci());
 719       if (PrintInitialBlockList) {
 720         tty->print_cr("CFG: cloned block %d (bci %d) as block %d for jsr",
 721                       block->block_id(), block->bci(), new_block->block_id());
 722       }
 723       // copy data from cloned blocked
 724       new_block->set_depth_first_number(block->depth_first_number());
 725       if (block->is_set(BlockBegin::parser_loop_header_flag)) new_block->set(BlockBegin::parser_loop_header_flag);
 726       // Preserve certain flags for assertion checking
 727       if (block->is_set(BlockBegin::subroutine_entry_flag)) new_block->set(BlockBegin::subroutine_entry_flag);
 728       if (block->is_set(BlockBegin::exception_entry_flag))  new_block->set(BlockBegin::exception_entry_flag);
 729 
 730       // copy was_visited_flag to allow early detection of bailouts
 731       // if a block that is used in a jsr has already been visited before,
 732       // it is shared between the normal control flow and a subroutine
 733       // BlockBegin::try_merge returns false when the flag is set, this leads
 734       // to a compilation bailout
 735       if (block->is_set(BlockBegin::was_visited_flag))  new_block->set(BlockBegin::was_visited_flag);
 736 
 737       bci2block()->at_put(bci, new_block);
 738       block = new_block;
 739     }
 740     return block;
 741   } else {
 742     return bci2block()->at(bci);
 743   }
 744 }
 745 
 746 
 747 XHandlers* GraphBuilder::ScopeData::xhandlers() const {
 748   if (_jsr_xhandlers == NULL) {
 749     assert(!parsing_jsr(), "");
 750     return scope()->xhandlers();
 751   }
 752   assert(parsing_jsr(), "");
 753   return _jsr_xhandlers;
 754 }
 755 
 756 
 757 void GraphBuilder::ScopeData::set_scope(IRScope* scope) {
 758   _scope = scope;
 759   bool parent_has_handler = false;
 760   if (parent() != NULL) {
 761     parent_has_handler = parent()->has_handler();
 762   }
 763   _has_handler = parent_has_handler || scope->xhandlers()->has_handlers();
 764 }
 765 
 766 
 767 void GraphBuilder::ScopeData::set_inline_cleanup_info(BlockBegin* block,
 768                                                       Instruction* return_prev,
 769                                                       ValueStack* return_state) {
 770   _cleanup_block       = block;
 771   _cleanup_return_prev = return_prev;
 772   _cleanup_state       = return_state;
 773 }
 774 
 775 
 776 void GraphBuilder::ScopeData::add_to_work_list(BlockBegin* block) {
 777   if (_work_list == NULL) {
 778     _work_list = new BlockList();
 779   }
 780 
 781   if (!block->is_set(BlockBegin::is_on_work_list_flag)) {
 782     // Do not start parsing the continuation block while in a
 783     // sub-scope
 784     if (parsing_jsr()) {
 785       if (block == jsr_continuation()) {
 786         return;
 787       }
 788     } else {
 789       if (block == continuation()) {
 790         return;
 791       }
 792     }
 793     block->set(BlockBegin::is_on_work_list_flag);
 794     _work_list->push(block);
 795 
 796     sort_top_into_worklist(_work_list, block);
 797   }
 798 }
 799 
 800 
 801 void GraphBuilder::sort_top_into_worklist(BlockList* worklist, BlockBegin* top) {
 802   assert(worklist->top() == top, "");
 803   // sort block descending into work list
 804   const int dfn = top->depth_first_number();
 805   assert(dfn != -1, "unknown depth first number");
 806   int i = worklist->length()-2;
 807   while (i >= 0) {
 808     BlockBegin* b = worklist->at(i);
 809     if (b->depth_first_number() < dfn) {
 810       worklist->at_put(i+1, b);
 811     } else {
 812       break;
 813     }
 814     i --;
 815   }
 816   if (i >= -1) worklist->at_put(i + 1, top);
 817 }
 818 
 819 
 820 BlockBegin* GraphBuilder::ScopeData::remove_from_work_list() {
 821   if (is_work_list_empty()) {
 822     return NULL;
 823   }
 824   return _work_list->pop();
 825 }
 826 
 827 
 828 bool GraphBuilder::ScopeData::is_work_list_empty() const {
 829   return (_work_list == NULL || _work_list->length() == 0);
 830 }
 831 
 832 
 833 void GraphBuilder::ScopeData::setup_jsr_xhandlers() {
 834   assert(parsing_jsr(), "");
 835   // clone all the exception handlers from the scope
 836   XHandlers* handlers = new XHandlers(scope()->xhandlers());
 837   const int n = handlers->length();
 838   for (int i = 0; i < n; i++) {
 839     // The XHandlers need to be adjusted to dispatch to the cloned
 840     // handler block instead of the default one but the synthetic
 841     // unlocker needs to be handled specially.  The synthetic unlocker
 842     // should be left alone since there can be only one and all code
 843     // should dispatch to the same one.
 844     XHandler* h = handlers->handler_at(i);
 845     assert(h->handler_bci() != SynchronizationEntryBCI, "must be real");
 846     h->set_entry_block(block_at(h->handler_bci()));
 847   }
 848   _jsr_xhandlers = handlers;
 849 }
 850 
 851 
 852 int GraphBuilder::ScopeData::num_returns() {
 853   if (parsing_jsr()) {
 854     return parent()->num_returns();
 855   }
 856   return _num_returns;
 857 }
 858 
 859 
 860 void GraphBuilder::ScopeData::incr_num_returns() {
 861   if (parsing_jsr()) {
 862     parent()->incr_num_returns();
 863   } else {
 864     ++_num_returns;
 865   }
 866 }
 867 
 868 
 869 // Implementation of GraphBuilder
 870 
 871 #define INLINE_BAILOUT(msg)        { inline_bailout(msg); return false; }
 872 
 873 
 874 void GraphBuilder::load_constant() {
 875   ciConstant con = stream()->get_constant();
 876   if (con.basic_type() == T_ILLEGAL) {
 877     // FIXME: an unresolved Dynamic constant can get here,
 878     // and that should not terminate the whole compilation.
 879     BAILOUT("could not resolve a constant");
 880   } else {
 881     ValueType* t = illegalType;
 882     ValueStack* patch_state = NULL;
 883     switch (con.basic_type()) {
 884       case T_BOOLEAN: t = new IntConstant     (con.as_boolean()); break;
 885       case T_BYTE   : t = new IntConstant     (con.as_byte   ()); break;
 886       case T_CHAR   : t = new IntConstant     (con.as_char   ()); break;
 887       case T_SHORT  : t = new IntConstant     (con.as_short  ()); break;
 888       case T_INT    : t = new IntConstant     (con.as_int    ()); break;
 889       case T_LONG   : t = new LongConstant    (con.as_long   ()); break;
 890       case T_FLOAT  : t = new FloatConstant   (con.as_float  ()); break;
 891       case T_DOUBLE : t = new DoubleConstant  (con.as_double ()); break;
 892       case T_ARRAY  : t = new ArrayConstant   (con.as_object ()->as_array   ()); break;
 893       case T_OBJECT :
 894        {
 895         ciObject* obj = con.as_object();
 896         if (!obj->is_loaded()
 897             || (PatchALot && obj->klass() != ciEnv::current()->String_klass())) {
 898           // A Class, MethodType, MethodHandle, or String.
 899           // Unloaded condy nodes show up as T_ILLEGAL, above.
 900           patch_state = copy_state_before();
 901           t = new ObjectConstant(obj);
 902         } else {
 903           // Might be a Class, MethodType, MethodHandle, or Dynamic constant
 904           // result, which might turn out to be an array.
 905           if (obj->is_null_object())
 906             t = objectNull;
 907           else if (obj->is_array())
 908             t = new ArrayConstant(obj->as_array());
 909           else
 910             t = new InstanceConstant(obj->as_instance());
 911         }
 912         break;
 913        }
 914       default       : ShouldNotReachHere();
 915     }
 916     Value x;
 917     if (patch_state != NULL) {
 918       x = new Constant(t, patch_state);
 919     } else {
 920       x = new Constant(t);
 921     }
 922     push(t, append(x));
 923   }
 924 }
 925 
 926 
 927 void GraphBuilder::load_local(ValueType* type, int index) {
 928   Value x = state()->local_at(index);
 929   assert(x != NULL && !x->type()->is_illegal(), "access of illegal local variable");
 930   push(type, x);
 931 }
 932 
 933 
 934 void GraphBuilder::store_local(ValueType* type, int index) {
 935   Value x = pop(type);
 936   store_local(state(), x, index);
 937 }
 938 
 939 
 940 void GraphBuilder::store_local(ValueStack* state, Value x, int index) {
 941   if (parsing_jsr()) {
 942     // We need to do additional tracking of the location of the return
 943     // address for jsrs since we don't handle arbitrary jsr/ret
 944     // constructs. Here we are figuring out in which circumstances we
 945     // need to bail out.
 946     if (x->type()->is_address()) {
 947       scope_data()->set_jsr_return_address_local(index);
 948 
 949       // Also check parent jsrs (if any) at this time to see whether
 950       // they are using this local. We don't handle skipping over a
 951       // ret.
 952       for (ScopeData* cur_scope_data = scope_data()->parent();
 953            cur_scope_data != NULL && cur_scope_data->parsing_jsr() && cur_scope_data->scope() == scope();
 954            cur_scope_data = cur_scope_data->parent()) {
 955         if (cur_scope_data->jsr_return_address_local() == index) {
 956           BAILOUT("subroutine overwrites return address from previous subroutine");
 957         }
 958       }
 959     } else if (index == scope_data()->jsr_return_address_local()) {
 960       scope_data()->set_jsr_return_address_local(-1);
 961     }
 962   }
 963 
 964   state->store_local(index, round_fp(x));
 965 }
 966 
 967 
 968 void GraphBuilder::load_indexed(BasicType type) {
 969   // In case of in block code motion in range check elimination
 970   ValueStack* state_before = copy_state_indexed_access();
 971   compilation()->set_has_access_indexed(true);
 972   Value index = ipop();
 973   Value array = apop();
 974   Value length = NULL;
 975   if (CSEArrayLength ||
 976       (array->as_AccessField() && array->as_AccessField()->field()->is_constant()) ||
 977       (array->as_NewArray() && array->as_NewArray()->length() && array->as_NewArray()->length()->type()->is_constant())) {
 978     length = append(new ArrayLength(array, state_before));
 979   }
 980   push(as_ValueType(type), append(new LoadIndexed(array, index, length, type, state_before)));
 981 }
 982 
 983 
 984 void GraphBuilder::store_indexed(BasicType type) {
 985   // In case of in block code motion in range check elimination
 986   ValueStack* state_before = copy_state_indexed_access();
 987   compilation()->set_has_access_indexed(true);
 988   Value value = pop(as_ValueType(type));
 989   Value index = ipop();
 990   Value array = apop();
 991   Value length = NULL;
 992   if (CSEArrayLength ||
 993       (array->as_AccessField() && array->as_AccessField()->field()->is_constant()) ||
 994       (array->as_NewArray() && array->as_NewArray()->length() && array->as_NewArray()->length()->type()->is_constant())) {
 995     length = append(new ArrayLength(array, state_before));
 996   }
 997   ciType* array_type = array->declared_type();
 998   bool check_boolean = false;
 999   if (array_type != NULL) {
1000     if (array_type->is_loaded() &&
1001       array_type->as_array_klass()->element_type()->basic_type() == T_BOOLEAN) {
1002       assert(type == T_BYTE, "boolean store uses bastore");
1003       Value mask = append(new Constant(new IntConstant(1)));
1004       value = append(new LogicOp(Bytecodes::_iand, value, mask));
1005     }
1006   } else if (type == T_BYTE) {
1007     check_boolean = true;
1008   }
1009   StoreIndexed* result = new StoreIndexed(array, index, length, type, value, state_before, check_boolean);
1010   append(result);
1011   _memory->store_value(value);
1012 
1013   if (type == T_OBJECT && is_profiling()) {
1014     // Note that we'd collect profile data in this method if we wanted it.
1015     compilation()->set_would_profile(true);
1016 
1017     if (profile_checkcasts()) {
1018       result->set_profiled_method(method());
1019       result->set_profiled_bci(bci());
1020       result->set_should_profile(true);
1021     }
1022   }
1023 }
1024 
1025 
1026 void GraphBuilder::stack_op(Bytecodes::Code code) {
1027   switch (code) {
1028     case Bytecodes::_pop:
1029       { state()->raw_pop();
1030       }
1031       break;
1032     case Bytecodes::_pop2:
1033       { state()->raw_pop();
1034         state()->raw_pop();
1035       }
1036       break;
1037     case Bytecodes::_dup:
1038       { Value w = state()->raw_pop();
1039         state()->raw_push(w);
1040         state()->raw_push(w);
1041       }
1042       break;
1043     case Bytecodes::_dup_x1:
1044       { Value w1 = state()->raw_pop();
1045         Value w2 = state()->raw_pop();
1046         state()->raw_push(w1);
1047         state()->raw_push(w2);
1048         state()->raw_push(w1);
1049       }
1050       break;
1051     case Bytecodes::_dup_x2:
1052       { Value w1 = state()->raw_pop();
1053         Value w2 = state()->raw_pop();
1054         Value w3 = state()->raw_pop();
1055         state()->raw_push(w1);
1056         state()->raw_push(w3);
1057         state()->raw_push(w2);
1058         state()->raw_push(w1);
1059       }
1060       break;
1061     case Bytecodes::_dup2:
1062       { Value w1 = state()->raw_pop();
1063         Value w2 = state()->raw_pop();
1064         state()->raw_push(w2);
1065         state()->raw_push(w1);
1066         state()->raw_push(w2);
1067         state()->raw_push(w1);
1068       }
1069       break;
1070     case Bytecodes::_dup2_x1:
1071       { Value w1 = state()->raw_pop();
1072         Value w2 = state()->raw_pop();
1073         Value w3 = state()->raw_pop();
1074         state()->raw_push(w2);
1075         state()->raw_push(w1);
1076         state()->raw_push(w3);
1077         state()->raw_push(w2);
1078         state()->raw_push(w1);
1079       }
1080       break;
1081     case Bytecodes::_dup2_x2:
1082       { Value w1 = state()->raw_pop();
1083         Value w2 = state()->raw_pop();
1084         Value w3 = state()->raw_pop();
1085         Value w4 = state()->raw_pop();
1086         state()->raw_push(w2);
1087         state()->raw_push(w1);
1088         state()->raw_push(w4);
1089         state()->raw_push(w3);
1090         state()->raw_push(w2);
1091         state()->raw_push(w1);
1092       }
1093       break;
1094     case Bytecodes::_swap:
1095       { Value w1 = state()->raw_pop();
1096         Value w2 = state()->raw_pop();
1097         state()->raw_push(w1);
1098         state()->raw_push(w2);
1099       }
1100       break;
1101     default:
1102       ShouldNotReachHere();
1103       break;
1104   }
1105 }
1106 
1107 
1108 void GraphBuilder::arithmetic_op(ValueType* type, Bytecodes::Code code, ValueStack* state_before) {
1109   Value y = pop(type);
1110   Value x = pop(type);
1111   // NOTE: strictfp can be queried from current method since we don't
1112   // inline methods with differing strictfp bits
1113   Value res = new ArithmeticOp(code, x, y, method()->is_strict(), state_before);
1114   // Note: currently single-precision floating-point rounding on Intel is handled at the LIRGenerator level
1115   res = append(res);
1116   if (method()->is_strict()) {
1117     res = round_fp(res);
1118   }
1119   push(type, res);
1120 }
1121 
1122 
1123 void GraphBuilder::negate_op(ValueType* type) {
1124   push(type, append(new NegateOp(pop(type))));
1125 }
1126 
1127 
1128 void GraphBuilder::shift_op(ValueType* type, Bytecodes::Code code) {
1129   Value s = ipop();
1130   Value x = pop(type);
1131   // try to simplify
1132   // Note: This code should go into the canonicalizer as soon as it can
1133   //       can handle canonicalized forms that contain more than one node.
1134   if (CanonicalizeNodes && code == Bytecodes::_iushr) {
1135     // pattern: x >>> s
1136     IntConstant* s1 = s->type()->as_IntConstant();
1137     if (s1 != NULL) {
1138       // pattern: x >>> s1, with s1 constant
1139       ShiftOp* l = x->as_ShiftOp();
1140       if (l != NULL && l->op() == Bytecodes::_ishl) {
1141         // pattern: (a << b) >>> s1
1142         IntConstant* s0 = l->y()->type()->as_IntConstant();
1143         if (s0 != NULL) {
1144           // pattern: (a << s0) >>> s1
1145           const int s0c = s0->value() & 0x1F; // only the low 5 bits are significant for shifts
1146           const int s1c = s1->value() & 0x1F; // only the low 5 bits are significant for shifts
1147           if (s0c == s1c) {
1148             if (s0c == 0) {
1149               // pattern: (a << 0) >>> 0 => simplify to: a
1150               ipush(l->x());
1151             } else {
1152               // pattern: (a << s0c) >>> s0c => simplify to: a & m, with m constant
1153               assert(0 < s0c && s0c < BitsPerInt, "adjust code below to handle corner cases");
1154               const int m = (1 << (BitsPerInt - s0c)) - 1;
1155               Value s = append(new Constant(new IntConstant(m)));
1156               ipush(append(new LogicOp(Bytecodes::_iand, l->x(), s)));
1157             }
1158             return;
1159           }
1160         }
1161       }
1162     }
1163   }
1164   // could not simplify
1165   push(type, append(new ShiftOp(code, x, s)));
1166 }
1167 
1168 
1169 void GraphBuilder::logic_op(ValueType* type, Bytecodes::Code code) {
1170   Value y = pop(type);
1171   Value x = pop(type);
1172   push(type, append(new LogicOp(code, x, y)));
1173 }
1174 
1175 
1176 void GraphBuilder::compare_op(ValueType* type, Bytecodes::Code code) {
1177   ValueStack* state_before = copy_state_before();
1178   Value y = pop(type);
1179   Value x = pop(type);
1180   ipush(append(new CompareOp(code, x, y, state_before)));
1181 }
1182 
1183 
1184 void GraphBuilder::convert(Bytecodes::Code op, BasicType from, BasicType to) {
1185   push(as_ValueType(to), append(new Convert(op, pop(as_ValueType(from)), as_ValueType(to))));
1186 }
1187 
1188 
1189 void GraphBuilder::increment() {
1190   int index = stream()->get_index();
1191   int delta = stream()->is_wide() ? (signed short)Bytes::get_Java_u2(stream()->cur_bcp() + 4) : (signed char)(stream()->cur_bcp()[2]);
1192   load_local(intType, index);
1193   ipush(append(new Constant(new IntConstant(delta))));
1194   arithmetic_op(intType, Bytecodes::_iadd);
1195   store_local(intType, index);
1196 }
1197 
1198 
1199 void GraphBuilder::_goto(int from_bci, int to_bci) {
1200   Goto *x = new Goto(block_at(to_bci), to_bci <= from_bci);
1201   if (is_profiling()) {
1202     compilation()->set_would_profile(true);
1203     x->set_profiled_bci(bci());
1204     if (profile_branches()) {
1205       x->set_profiled_method(method());
1206       x->set_should_profile(true);
1207     }
1208   }
1209   append(x);
1210 }
1211 
1212 
1213 void GraphBuilder::if_node(Value x, If::Condition cond, Value y, ValueStack* state_before) {
1214   BlockBegin* tsux = block_at(stream()->get_dest());
1215   BlockBegin* fsux = block_at(stream()->next_bci());
1216   bool is_bb = tsux->bci() < stream()->cur_bci() || fsux->bci() < stream()->cur_bci();
1217   // In case of loop invariant code motion or predicate insertion
1218   // before the body of a loop the state is needed
1219   Instruction *i = append(new If(x, cond, false, y, tsux, fsux, (is_bb || compilation()->is_optimistic()) ? state_before : NULL, is_bb));
1220 
1221   assert(i->as_Goto() == NULL ||
1222          (i->as_Goto()->sux_at(0) == tsux  && i->as_Goto()->is_safepoint() == tsux->bci() < stream()->cur_bci()) ||
1223          (i->as_Goto()->sux_at(0) == fsux  && i->as_Goto()->is_safepoint() == fsux->bci() < stream()->cur_bci()),
1224          "safepoint state of Goto returned by canonicalizer incorrect");
1225 
1226   if (is_profiling()) {
1227     If* if_node = i->as_If();
1228     if (if_node != NULL) {
1229       // Note that we'd collect profile data in this method if we wanted it.
1230       compilation()->set_would_profile(true);
1231       // At level 2 we need the proper bci to count backedges
1232       if_node->set_profiled_bci(bci());
1233       if (profile_branches()) {
1234         // Successors can be rotated by the canonicalizer, check for this case.
1235         if_node->set_profiled_method(method());
1236         if_node->set_should_profile(true);
1237         if (if_node->tsux() == fsux) {
1238           if_node->set_swapped(true);
1239         }
1240       }
1241       return;
1242     }
1243 
1244     // Check if this If was reduced to Goto.
1245     Goto *goto_node = i->as_Goto();
1246     if (goto_node != NULL) {
1247       compilation()->set_would_profile(true);
1248       goto_node->set_profiled_bci(bci());
1249       if (profile_branches()) {
1250         goto_node->set_profiled_method(method());
1251         goto_node->set_should_profile(true);
1252         // Find out which successor is used.
1253         if (goto_node->default_sux() == tsux) {
1254           goto_node->set_direction(Goto::taken);
1255         } else if (goto_node->default_sux() == fsux) {
1256           goto_node->set_direction(Goto::not_taken);
1257         } else {
1258           ShouldNotReachHere();
1259         }
1260       }
1261       return;
1262     }
1263   }
1264 }
1265 
1266 
1267 void GraphBuilder::if_zero(ValueType* type, If::Condition cond) {
1268   Value y = append(new Constant(intZero));
1269   ValueStack* state_before = copy_state_before();
1270   Value x = ipop();
1271   if_node(x, cond, y, state_before);
1272 }
1273 
1274 
1275 void GraphBuilder::if_null(ValueType* type, If::Condition cond) {
1276   Value y = append(new Constant(objectNull));
1277   ValueStack* state_before = copy_state_before();
1278   Value x = apop();
1279   if_node(x, cond, y, state_before);
1280 }
1281 
1282 
1283 void GraphBuilder::if_same(ValueType* type, If::Condition cond) {
1284   ValueStack* state_before = copy_state_before();
1285   Value y = pop(type);
1286   Value x = pop(type);
1287   if_node(x, cond, y, state_before);
1288 }
1289 
1290 
1291 void GraphBuilder::jsr(int dest) {
1292   // We only handle well-formed jsrs (those which are "block-structured").
1293   // If the bytecodes are strange (jumping out of a jsr block) then we
1294   // might end up trying to re-parse a block containing a jsr which
1295   // has already been activated. Watch for this case and bail out.
1296   for (ScopeData* cur_scope_data = scope_data();
1297        cur_scope_data != NULL && cur_scope_data->parsing_jsr() && cur_scope_data->scope() == scope();
1298        cur_scope_data = cur_scope_data->parent()) {
1299     if (cur_scope_data->jsr_entry_bci() == dest) {
1300       BAILOUT("too-complicated jsr/ret structure");
1301     }
1302   }
1303 
1304   push(addressType, append(new Constant(new AddressConstant(next_bci()))));
1305   if (!try_inline_jsr(dest)) {
1306     return; // bailed out while parsing and inlining subroutine
1307   }
1308 }
1309 
1310 
1311 void GraphBuilder::ret(int local_index) {
1312   if (!parsing_jsr()) BAILOUT("ret encountered while not parsing subroutine");
1313 
1314   if (local_index != scope_data()->jsr_return_address_local()) {
1315     BAILOUT("can not handle complicated jsr/ret constructs");
1316   }
1317 
1318   // Rets simply become (NON-SAFEPOINT) gotos to the jsr continuation
1319   append(new Goto(scope_data()->jsr_continuation(), false));
1320 }
1321 
1322 
1323 void GraphBuilder::table_switch() {
1324   Bytecode_tableswitch sw(stream());
1325   const int l = sw.length();
1326   if (CanonicalizeNodes && l == 1) {
1327     // total of 2 successors => use If instead of switch
1328     // Note: This code should go into the canonicalizer as soon as it can
1329     //       can handle canonicalized forms that contain more than one node.
1330     Value key = append(new Constant(new IntConstant(sw.low_key())));
1331     BlockBegin* tsux = block_at(bci() + sw.dest_offset_at(0));
1332     BlockBegin* fsux = block_at(bci() + sw.default_offset());
1333     bool is_bb = tsux->bci() < bci() || fsux->bci() < bci();
1334     // In case of loop invariant code motion or predicate insertion
1335     // before the body of a loop the state is needed
1336     ValueStack* state_before = copy_state_if_bb(is_bb);
1337     append(new If(ipop(), If::eql, true, key, tsux, fsux, state_before, is_bb));
1338   } else {
1339     // collect successors
1340     BlockList* sux = new BlockList(l + 1, NULL);
1341     int i;
1342     bool has_bb = false;
1343     for (i = 0; i < l; i++) {
1344       sux->at_put(i, block_at(bci() + sw.dest_offset_at(i)));
1345       if (sw.dest_offset_at(i) < 0) has_bb = true;
1346     }
1347     // add default successor
1348     if (sw.default_offset() < 0) has_bb = true;
1349     sux->at_put(i, block_at(bci() + sw.default_offset()));
1350     // In case of loop invariant code motion or predicate insertion
1351     // before the body of a loop the state is needed
1352     ValueStack* state_before = copy_state_if_bb(has_bb);
1353     Instruction* res = append(new TableSwitch(ipop(), sux, sw.low_key(), state_before, has_bb));
1354 #ifdef ASSERT
1355     if (res->as_Goto()) {
1356       for (i = 0; i < l; i++) {
1357         if (sux->at(i) == res->as_Goto()->sux_at(0)) {
1358           assert(res->as_Goto()->is_safepoint() == sw.dest_offset_at(i) < 0, "safepoint state of Goto returned by canonicalizer incorrect");
1359         }
1360       }
1361     }
1362 #endif
1363   }
1364 }
1365 
1366 
1367 void GraphBuilder::lookup_switch() {
1368   Bytecode_lookupswitch sw(stream());
1369   const int l = sw.number_of_pairs();
1370   if (CanonicalizeNodes && l == 1) {
1371     // total of 2 successors => use If instead of switch
1372     // Note: This code should go into the canonicalizer as soon as it can
1373     //       can handle canonicalized forms that contain more than one node.
1374     // simplify to If
1375     LookupswitchPair pair = sw.pair_at(0);
1376     Value key = append(new Constant(new IntConstant(pair.match())));
1377     BlockBegin* tsux = block_at(bci() + pair.offset());
1378     BlockBegin* fsux = block_at(bci() + sw.default_offset());
1379     bool is_bb = tsux->bci() < bci() || fsux->bci() < bci();
1380     // In case of loop invariant code motion or predicate insertion
1381     // before the body of a loop the state is needed
1382     ValueStack* state_before = copy_state_if_bb(is_bb);;
1383     append(new If(ipop(), If::eql, true, key, tsux, fsux, state_before, is_bb));
1384   } else {
1385     // collect successors & keys
1386     BlockList* sux = new BlockList(l + 1, NULL);
1387     intArray* keys = new intArray(l, l, 0);
1388     int i;
1389     bool has_bb = false;
1390     for (i = 0; i < l; i++) {
1391       LookupswitchPair pair = sw.pair_at(i);
1392       if (pair.offset() < 0) has_bb = true;
1393       sux->at_put(i, block_at(bci() + pair.offset()));
1394       keys->at_put(i, pair.match());
1395     }
1396     // add default successor
1397     if (sw.default_offset() < 0) has_bb = true;
1398     sux->at_put(i, block_at(bci() + sw.default_offset()));
1399     // In case of loop invariant code motion or predicate insertion
1400     // before the body of a loop the state is needed
1401     ValueStack* state_before = copy_state_if_bb(has_bb);
1402     Instruction* res = append(new LookupSwitch(ipop(), sux, keys, state_before, has_bb));
1403 #ifdef ASSERT
1404     if (res->as_Goto()) {
1405       for (i = 0; i < l; i++) {
1406         if (sux->at(i) == res->as_Goto()->sux_at(0)) {
1407           assert(res->as_Goto()->is_safepoint() == sw.pair_at(i).offset() < 0, "safepoint state of Goto returned by canonicalizer incorrect");
1408         }
1409       }
1410     }
1411 #endif
1412   }
1413 }
1414 
1415 void GraphBuilder::call_register_finalizer() {
1416   // If the receiver requires finalization then emit code to perform
1417   // the registration on return.
1418 
1419   // Gather some type information about the receiver
1420   Value receiver = state()->local_at(0);
1421   assert(receiver != NULL, "must have a receiver");
1422   ciType* declared_type = receiver->declared_type();
1423   ciType* exact_type = receiver->exact_type();
1424   if (exact_type == NULL &&
1425       receiver->as_Local() &&
1426       receiver->as_Local()->java_index() == 0) {
1427     ciInstanceKlass* ik = compilation()->method()->holder();
1428     if (ik->is_final()) {
1429       exact_type = ik;
1430     } else if (UseCHA && !(ik->has_subklass() || ik->is_interface())) {
1431       // test class is leaf class
1432       compilation()->dependency_recorder()->assert_leaf_type(ik);
1433       exact_type = ik;
1434     } else {
1435       declared_type = ik;
1436     }
1437   }
1438 
1439   // see if we know statically that registration isn't required
1440   bool needs_check = true;
1441   if (exact_type != NULL) {
1442     needs_check = exact_type->as_instance_klass()->has_finalizer();
1443   } else if (declared_type != NULL) {
1444     ciInstanceKlass* ik = declared_type->as_instance_klass();
1445     if (!Dependencies::has_finalizable_subclass(ik)) {
1446       compilation()->dependency_recorder()->assert_has_no_finalizable_subclasses(ik);
1447       needs_check = false;
1448     }
1449   }
1450 
1451   if (needs_check) {
1452     // Not a trivial method because C2 can do better with inlined check.
1453     compilation()->set_would_profile(true);
1454 
1455     // Perform the registration of finalizable objects.
1456     ValueStack* state_before = copy_state_for_exception();
1457     load_local(objectType, 0);
1458     append_split(new Intrinsic(voidType, vmIntrinsics::_Object_init,
1459                                state()->pop_arguments(1),
1460                                true, state_before, true));
1461   }
1462 }
1463 
1464 
1465 void GraphBuilder::method_return(Value x, bool ignore_return) {
1466   if (RegisterFinalizersAtInit &&
1467       method()->intrinsic_id() == vmIntrinsics::_Object_init) {
1468     call_register_finalizer();
1469   }
1470 
1471   bool need_mem_bar = false;
1472   if (method()->name() == ciSymbol::object_initializer_name() &&
1473       (scope()->wrote_final() || (AlwaysSafeConstructors && scope()->wrote_fields())
1474                               || (support_IRIW_for_not_multiple_copy_atomic_cpu && scope()->wrote_volatile())
1475      )){
1476     need_mem_bar = true;
1477   }
1478 
1479   BasicType bt = method()->return_type()->basic_type();
1480   switch (bt) {
1481     case T_BYTE:
1482     {
1483       Value shift = append(new Constant(new IntConstant(24)));
1484       x = append(new ShiftOp(Bytecodes::_ishl, x, shift));
1485       x = append(new ShiftOp(Bytecodes::_ishr, x, shift));
1486       break;
1487     }
1488     case T_SHORT:
1489     {
1490       Value shift = append(new Constant(new IntConstant(16)));
1491       x = append(new ShiftOp(Bytecodes::_ishl, x, shift));
1492       x = append(new ShiftOp(Bytecodes::_ishr, x, shift));
1493       break;
1494     }
1495     case T_CHAR:
1496     {
1497       Value mask = append(new Constant(new IntConstant(0xFFFF)));
1498       x = append(new LogicOp(Bytecodes::_iand, x, mask));
1499       break;
1500     }
1501     case T_BOOLEAN:
1502     {
1503       Value mask = append(new Constant(new IntConstant(1)));
1504       x = append(new LogicOp(Bytecodes::_iand, x, mask));
1505       break;
1506     }
1507     default:
1508       break;
1509   }
1510 
1511   // Check to see whether we are inlining. If so, Return
1512   // instructions become Gotos to the continuation point.
1513   if (continuation() != NULL) {
1514 
1515     int invoke_bci = state()->caller_state()->bci();
1516 
1517     if (x != NULL  && !ignore_return) {
1518       ciMethod* caller = state()->scope()->caller()->method();
1519       Bytecodes::Code invoke_raw_bc = caller->raw_code_at_bci(invoke_bci);
1520       if (invoke_raw_bc == Bytecodes::_invokehandle || invoke_raw_bc == Bytecodes::_invokedynamic) {
1521         ciType* declared_ret_type = caller->get_declared_signature_at_bci(invoke_bci)->return_type();
1522         if (declared_ret_type->is_klass() && x->exact_type() == NULL &&
1523             x->declared_type() != declared_ret_type && declared_ret_type != compilation()->env()->Object_klass()) {
1524           x = append(new TypeCast(declared_ret_type->as_klass(), x, copy_state_before()));
1525         }
1526       }
1527     }
1528 
1529     assert(!method()->is_synchronized() || InlineSynchronizedMethods, "can not inline synchronized methods yet");
1530 
1531     if (compilation()->env()->dtrace_method_probes()) {
1532       // Report exit from inline methods
1533       Values* args = new Values(1);
1534       args->push(append(new Constant(new MethodConstant(method()))));
1535       append(new RuntimeCall(voidType, "dtrace_method_exit", CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_method_exit), args));
1536     }
1537 
1538     // If the inlined method is synchronized, the monitor must be
1539     // released before we jump to the continuation block.
1540     if (method()->is_synchronized()) {
1541       assert(state()->locks_size() == 1, "receiver must be locked here");
1542       monitorexit(state()->lock_at(0), SynchronizationEntryBCI);
1543     }
1544 
1545     if (need_mem_bar) {
1546       append(new MemBar(lir_membar_storestore));
1547     }
1548 
1549     // State at end of inlined method is the state of the caller
1550     // without the method parameters on stack, including the
1551     // return value, if any, of the inlined method on operand stack.
1552     set_state(state()->caller_state()->copy_for_parsing());
1553     if (x != NULL) {
1554       if (!ignore_return) {
1555         state()->push(x->type(), x);
1556       }
1557       if (profile_return() && x->type()->is_object_kind()) {
1558         ciMethod* caller = state()->scope()->method();
1559         profile_return_type(x, method(), caller, invoke_bci);
1560       }
1561     }
1562     Goto* goto_callee = new Goto(continuation(), false);
1563 
1564     // See whether this is the first return; if so, store off some
1565     // of the state for later examination
1566     if (num_returns() == 0) {
1567       set_inline_cleanup_info();
1568     }
1569 
1570     // The current bci() is in the wrong scope, so use the bci() of
1571     // the continuation point.
1572     append_with_bci(goto_callee, scope_data()->continuation()->bci());
1573     incr_num_returns();
1574     return;
1575   }
1576 
1577   state()->truncate_stack(0);
1578   if (method()->is_synchronized()) {
1579     // perform the unlocking before exiting the method
1580     Value receiver;
1581     if (!method()->is_static()) {
1582       receiver = _initial_state->local_at(0);
1583     } else {
1584       receiver = append(new Constant(new ClassConstant(method()->holder())));
1585     }
1586     append_split(new MonitorExit(receiver, state()->unlock()));
1587   }
1588 
1589   if (need_mem_bar) {
1590       append(new MemBar(lir_membar_storestore));
1591   }
1592 
1593   assert(!ignore_return, "Ignoring return value works only for inlining");
1594   append(new Return(x));
1595 }
1596 
1597 Value GraphBuilder::make_constant(ciConstant field_value, ciField* field) {
1598   if (!field_value.is_valid())  return NULL;
1599 
1600   BasicType field_type = field_value.basic_type();
1601   ValueType* value = as_ValueType(field_value);
1602 
1603   // Attach dimension info to stable arrays.
1604   if (FoldStableValues &&
1605       field->is_stable() && field_type == T_ARRAY && !field_value.is_null_or_zero()) {
1606     ciArray* array = field_value.as_object()->as_array();
1607     jint dimension = field->type()->as_array_klass()->dimension();
1608     value = new StableArrayConstant(array, dimension);
1609   }
1610 
1611   switch (field_type) {
1612     case T_ARRAY:
1613     case T_OBJECT:
1614       if (field_value.as_object()->should_be_constant()) {
1615         return new Constant(value);
1616       }
1617       return NULL; // Not a constant.
1618     default:
1619       return new Constant(value);
1620   }
1621 }
1622 
1623 void GraphBuilder::access_field(Bytecodes::Code code) {
1624   bool will_link;
1625   ciField* field = stream()->get_field(will_link);
1626   ciInstanceKlass* holder = field->holder();
1627   BasicType field_type = field->type()->basic_type();
1628   ValueType* type = as_ValueType(field_type);
1629   // call will_link again to determine if the field is valid.
1630   const bool needs_patching = !holder->is_loaded() ||
1631                               !field->will_link(method(), code) ||
1632                               PatchALot;
1633 
1634   ValueStack* state_before = NULL;
1635   if (!holder->is_initialized() || needs_patching) {
1636     // save state before instruction for debug info when
1637     // deoptimization happens during patching
1638     state_before = copy_state_before();
1639   }
1640 
1641   Value obj = NULL;
1642   if (code == Bytecodes::_getstatic || code == Bytecodes::_putstatic) {
1643     if (state_before != NULL) {
1644       // build a patching constant
1645       obj = new Constant(new InstanceConstant(holder->java_mirror()), state_before);
1646     } else {
1647       obj = new Constant(new InstanceConstant(holder->java_mirror()));
1648     }
1649   }
1650 
1651   if (field->is_final() && (code == Bytecodes::_putfield)) {
1652     scope()->set_wrote_final();
1653   }
1654 
1655   if (code == Bytecodes::_putfield) {
1656     scope()->set_wrote_fields();
1657     if (field->is_volatile()) {
1658       scope()->set_wrote_volatile();
1659     }
1660   }
1661 
1662   const int offset = !needs_patching ? field->offset() : -1;
1663   switch (code) {
1664     case Bytecodes::_getstatic: {
1665       // check for compile-time constants, i.e., initialized static final fields
1666       Value constant = NULL;
1667       if (field->is_static_constant() && !PatchALot) {
1668         ciConstant field_value = field->constant_value();
1669         assert(!field->is_stable() || !field_value.is_null_or_zero(),
1670                "stable static w/ default value shouldn't be a constant");
1671         constant = make_constant(field_value, field);
1672       }
1673       if (constant != NULL) {
1674         push(type, append(constant));
1675       } else {
1676         if (state_before == NULL) {
1677           state_before = copy_state_for_exception();
1678         }
1679         push(type, append(new LoadField(append(obj), offset, field, true,
1680                                         state_before, needs_patching)));
1681       }
1682       break;
1683     }
1684     case Bytecodes::_putstatic: {
1685       Value val = pop(type);
1686       if (state_before == NULL) {
1687         state_before = copy_state_for_exception();
1688       }
1689       if (field->type()->basic_type() == T_BOOLEAN) {
1690         Value mask = append(new Constant(new IntConstant(1)));
1691         val = append(new LogicOp(Bytecodes::_iand, val, mask));
1692       }
1693       append(new StoreField(append(obj), offset, field, val, true, state_before, needs_patching));
1694       break;
1695     }
1696     case Bytecodes::_getfield: {
1697       // Check for compile-time constants, i.e., trusted final non-static fields.
1698       Value constant = NULL;
1699       obj = apop();
1700       ObjectType* obj_type = obj->type()->as_ObjectType();
1701       if (field->is_constant() && obj_type->is_constant() && !PatchALot) {
1702         ciObject* const_oop = obj_type->constant_value();
1703         if (!const_oop->is_null_object() && const_oop->is_loaded()) {
1704           ciConstant field_value = field->constant_value_of(const_oop);
1705           if (field_value.is_valid()) {
1706             constant = make_constant(field_value, field);
1707             // For CallSite objects add a dependency for invalidation of the optimization.
1708             if (field->is_call_site_target()) {
1709               ciCallSite* call_site = const_oop->as_call_site();
1710               if (!call_site->is_constant_call_site()) {
1711                 ciMethodHandle* target = field_value.as_object()->as_method_handle();
1712                 dependency_recorder()->assert_call_site_target_value(call_site, target);
1713               }
1714             }
1715           }
1716         }
1717       }
1718       if (constant != NULL) {
1719         push(type, append(constant));
1720       } else {
1721         if (state_before == NULL) {
1722           state_before = copy_state_for_exception();
1723         }
1724         LoadField* load = new LoadField(obj, offset, field, false, state_before, needs_patching);
1725         Value replacement = !needs_patching ? _memory->load(load) : load;
1726         if (replacement != load) {
1727           assert(replacement->is_linked() || !replacement->can_be_linked(), "should already by linked");
1728           push(type, replacement);
1729         } else {
1730           push(type, append(load));
1731         }
1732       }
1733       break;
1734     }
1735     case Bytecodes::_putfield: {
1736       Value val = pop(type);
1737       obj = apop();
1738       if (state_before == NULL) {
1739         state_before = copy_state_for_exception();
1740       }
1741       if (field->type()->basic_type() == T_BOOLEAN) {
1742         Value mask = append(new Constant(new IntConstant(1)));
1743         val = append(new LogicOp(Bytecodes::_iand, val, mask));
1744       }
1745       StoreField* store = new StoreField(obj, offset, field, val, false, state_before, needs_patching);
1746       if (!needs_patching) store = _memory->store(store);
1747       if (store != NULL) {
1748         append(store);
1749       }
1750       break;
1751     }
1752     default:
1753       ShouldNotReachHere();
1754       break;
1755   }
1756 }
1757 
1758 
1759 Dependencies* GraphBuilder::dependency_recorder() const {
1760   assert(DeoptC1, "need debug information");
1761   return compilation()->dependency_recorder();
1762 }
1763 
1764 // How many arguments do we want to profile?
1765 Values* GraphBuilder::args_list_for_profiling(ciMethod* target, int& start, bool may_have_receiver) {
1766   int n = 0;
1767   bool has_receiver = may_have_receiver && Bytecodes::has_receiver(method()->java_code_at_bci(bci()));
1768   start = has_receiver ? 1 : 0;
1769   if (profile_arguments()) {
1770     ciProfileData* data = method()->method_data()->bci_to_data(bci());
1771     if (data != NULL && (data->is_CallTypeData() || data->is_VirtualCallTypeData())) {
1772       n = data->is_CallTypeData() ? data->as_CallTypeData()->number_of_arguments() : data->as_VirtualCallTypeData()->number_of_arguments();
1773     }
1774   }
1775   // If we are inlining then we need to collect arguments to profile parameters for the target
1776   if (profile_parameters() && target != NULL) {
1777     if (target->method_data() != NULL && target->method_data()->parameters_type_data() != NULL) {
1778       // The receiver is profiled on method entry so it's included in
1779       // the number of parameters but here we're only interested in
1780       // actual arguments.
1781       n = MAX2(n, target->method_data()->parameters_type_data()->number_of_parameters() - start);
1782     }
1783   }
1784   if (n > 0) {
1785     return new Values(n);
1786   }
1787   return NULL;
1788 }
1789 
1790 void GraphBuilder::check_args_for_profiling(Values* obj_args, int expected) {
1791 #ifdef ASSERT
1792   bool ignored_will_link;
1793   ciSignature* declared_signature = NULL;
1794   ciMethod* real_target = method()->get_method_at_bci(bci(), ignored_will_link, &declared_signature);
1795   assert(expected == obj_args->max_length() || real_target->is_method_handle_intrinsic(), "missed on arg?");
1796 #endif
1797 }
1798 
1799 // Collect arguments that we want to profile in a list
1800 Values* GraphBuilder::collect_args_for_profiling(Values* args, ciMethod* target, bool may_have_receiver) {
1801   int start = 0;
1802   Values* obj_args = args_list_for_profiling(target, start, may_have_receiver);
1803   if (obj_args == NULL) {
1804     return NULL;
1805   }
1806   int s = obj_args->max_length();
1807   // if called through method handle invoke, some arguments may have been popped
1808   for (int i = start, j = 0; j < s && i < args->length(); i++) {
1809     if (args->at(i)->type()->is_object_kind()) {
1810       obj_args->push(args->at(i));
1811       j++;
1812     }
1813   }
1814   check_args_for_profiling(obj_args, s);
1815   return obj_args;
1816 }
1817 
1818 
1819 void GraphBuilder::invoke(Bytecodes::Code code) {
1820   bool will_link;
1821   ciSignature* declared_signature = NULL;
1822   ciMethod*             target = stream()->get_method(will_link, &declared_signature);
1823   ciKlass*              holder = stream()->get_declared_method_holder();
1824   const Bytecodes::Code bc_raw = stream()->cur_bc_raw();
1825   assert(declared_signature != NULL, "cannot be null");
1826   assert(will_link == target->is_loaded(), "");
1827 
1828   ciInstanceKlass* klass = target->holder();
1829   assert(!target->is_loaded() || klass->is_loaded(), "loaded target must imply loaded klass");
1830 
1831   // check if CHA possible: if so, change the code to invoke_special
1832   ciInstanceKlass* calling_klass = method()->holder();
1833   ciInstanceKlass* callee_holder = ciEnv::get_instance_klass_for_declared_method_holder(holder);
1834   ciInstanceKlass* actual_recv = callee_holder;
1835 
1836   CompileLog* log = compilation()->log();
1837   if (log != NULL)
1838       log->elem("call method='%d' instr='%s'",
1839                 log->identify(target),
1840                 Bytecodes::name(code));
1841 
1842   // invoke-special-super
1843   if (bc_raw == Bytecodes::_invokespecial && !target->is_object_initializer()) {
1844     ciInstanceKlass* sender_klass =
1845           calling_klass->is_anonymous() ? calling_klass->host_klass() :
1846                                           calling_klass;
1847     if (sender_klass->is_interface()) {
1848       int index = state()->stack_size() - (target->arg_size_no_receiver() + 1);
1849       Value receiver = state()->stack_at(index);
1850       CheckCast* c = new CheckCast(sender_klass, receiver, copy_state_before());
1851       c->set_invokespecial_receiver_check();
1852       state()->stack_at_put(index, append_split(c));
1853     }
1854   }
1855 
1856   // Some methods are obviously bindable without any type checks so
1857   // convert them directly to an invokespecial or invokestatic.
1858   if (target->is_loaded() && !target->is_abstract() && target->can_be_statically_bound()) {
1859     switch (bc_raw) {
1860     case Bytecodes::_invokevirtual:
1861       code = Bytecodes::_invokespecial;
1862       break;
1863     case Bytecodes::_invokehandle:
1864       code = target->is_static() ? Bytecodes::_invokestatic : Bytecodes::_invokespecial;
1865       break;
1866     default:
1867       break;
1868     }
1869   } else {
1870     if (bc_raw == Bytecodes::_invokehandle) {
1871       assert(!will_link, "should come here only for unlinked call");
1872       code = Bytecodes::_invokespecial;
1873     }
1874   }
1875 
1876   // Push appendix argument (MethodType, CallSite, etc.), if one.
1877   bool patch_for_appendix = false;
1878   int patching_appendix_arg = 0;
1879   if (Bytecodes::has_optional_appendix(bc_raw) && (!will_link || PatchALot)) {
1880     Value arg = append(new Constant(new ObjectConstant(compilation()->env()->unloaded_ciinstance()), copy_state_before()));
1881     apush(arg);
1882     patch_for_appendix = true;
1883     patching_appendix_arg = (will_link && stream()->has_appendix()) ? 0 : 1;
1884   } else if (stream()->has_appendix()) {
1885     ciObject* appendix = stream()->get_appendix();
1886     Value arg = append(new Constant(new ObjectConstant(appendix)));
1887     apush(arg);
1888   }
1889 
1890   ciMethod* cha_monomorphic_target = NULL;
1891   ciMethod* exact_target = NULL;
1892   Value better_receiver = NULL;
1893   if (UseCHA && DeoptC1 && target->is_loaded() &&
1894       !(// %%% FIXME: Are both of these relevant?
1895         target->is_method_handle_intrinsic() ||
1896         target->is_compiled_lambda_form()) &&
1897       !patch_for_appendix) {
1898     Value receiver = NULL;
1899     ciInstanceKlass* receiver_klass = NULL;
1900     bool type_is_exact = false;
1901     // try to find a precise receiver type
1902     if (will_link && !target->is_static()) {
1903       int index = state()->stack_size() - (target->arg_size_no_receiver() + 1);
1904       receiver = state()->stack_at(index);
1905       ciType* type = receiver->exact_type();
1906       if (type != NULL && type->is_loaded() &&
1907           type->is_instance_klass() && !type->as_instance_klass()->is_interface()) {
1908         receiver_klass = (ciInstanceKlass*) type;
1909         type_is_exact = true;
1910       }
1911       if (type == NULL) {
1912         type = receiver->declared_type();
1913         if (type != NULL && type->is_loaded() &&
1914             type->is_instance_klass() && !type->as_instance_klass()->is_interface()) {
1915           receiver_klass = (ciInstanceKlass*) type;
1916           if (receiver_klass->is_leaf_type() && !receiver_klass->is_final()) {
1917             // Insert a dependency on this type since
1918             // find_monomorphic_target may assume it's already done.
1919             dependency_recorder()->assert_leaf_type(receiver_klass);
1920             type_is_exact = true;
1921           }
1922         }
1923       }
1924     }
1925     if (receiver_klass != NULL && type_is_exact &&
1926         receiver_klass->is_loaded() && code != Bytecodes::_invokespecial) {
1927       // If we have the exact receiver type we can bind directly to
1928       // the method to call.
1929       exact_target = target->resolve_invoke(calling_klass, receiver_klass);
1930       if (exact_target != NULL) {
1931         target = exact_target;
1932         code = Bytecodes::_invokespecial;
1933       }
1934     }
1935     if (receiver_klass != NULL &&
1936         receiver_klass->is_subtype_of(actual_recv) &&
1937         actual_recv->is_initialized()) {
1938       actual_recv = receiver_klass;
1939     }
1940 
1941     if ((code == Bytecodes::_invokevirtual && callee_holder->is_initialized()) ||
1942         (code == Bytecodes::_invokeinterface && callee_holder->is_initialized() && !actual_recv->is_interface())) {
1943       // Use CHA on the receiver to select a more precise method.
1944       cha_monomorphic_target = target->find_monomorphic_target(calling_klass, callee_holder, actual_recv);
1945     } else if (code == Bytecodes::_invokeinterface && callee_holder->is_loaded() && receiver != NULL) {
1946       // if there is only one implementor of this interface then we
1947       // may be able bind this invoke directly to the implementing
1948       // klass but we need both a dependence on the single interface
1949       // and on the method we bind to.  Additionally since all we know
1950       // about the receiver type is the it's supposed to implement the
1951       // interface we have to insert a check that it's the class we
1952       // expect.  Interface types are not checked by the verifier so
1953       // they are roughly equivalent to Object.
1954       ciInstanceKlass* singleton = NULL;
1955       if (target->holder()->nof_implementors() == 1) {
1956         singleton = target->holder()->implementor();
1957         assert(singleton != NULL && singleton != target->holder(),
1958                "just checking");
1959 
1960         assert(holder->is_interface(), "invokeinterface to non interface?");
1961         ciInstanceKlass* decl_interface = (ciInstanceKlass*)holder;
1962         // the number of implementors for decl_interface is less or
1963         // equal to the number of implementors for target->holder() so
1964         // if number of implementors of target->holder() == 1 then
1965         // number of implementors for decl_interface is 0 or 1. If
1966         // it's 0 then no class implements decl_interface and there's
1967         // no point in inlining.
1968         if (!holder->is_loaded() || decl_interface->nof_implementors() != 1 || decl_interface->has_nonstatic_concrete_methods()) {
1969           singleton = NULL;
1970         }
1971       }
1972       if (singleton) {
1973         cha_monomorphic_target = target->find_monomorphic_target(calling_klass, target->holder(), singleton);
1974         if (cha_monomorphic_target != NULL) {
1975           // If CHA is able to bind this invoke then update the class
1976           // to match that class, otherwise klass will refer to the
1977           // interface.
1978           klass = cha_monomorphic_target->holder();
1979           actual_recv = target->holder();
1980 
1981           // insert a check it's really the expected class.
1982           CheckCast* c = new CheckCast(klass, receiver, copy_state_for_exception());
1983           c->set_incompatible_class_change_check();
1984           c->set_direct_compare(klass->is_final());
1985           // pass the result of the checkcast so that the compiler has
1986           // more accurate type info in the inlinee
1987           better_receiver = append_split(c);
1988         }
1989       }
1990     }
1991   }
1992 
1993   if (cha_monomorphic_target != NULL) {
1994     if (cha_monomorphic_target->is_abstract()) {
1995       // Do not optimize for abstract methods
1996       cha_monomorphic_target = NULL;
1997     }
1998   }
1999 
2000   if (cha_monomorphic_target != NULL) {
2001     if (!(target->is_final_method())) {
2002       // If we inlined because CHA revealed only a single target method,
2003       // then we are dependent on that target method not getting overridden
2004       // by dynamic class loading.  Be sure to test the "static" receiver
2005       // dest_method here, as opposed to the actual receiver, which may
2006       // falsely lead us to believe that the receiver is final or private.
2007       dependency_recorder()->assert_unique_concrete_method(actual_recv, cha_monomorphic_target);
2008     }
2009     code = Bytecodes::_invokespecial;
2010   }
2011 
2012   // check if we could do inlining
2013   if (!PatchALot && Inline && target->is_loaded() &&
2014       (klass->is_initialized() || (klass->is_interface() && target->holder()->is_initialized()))
2015       && !patch_for_appendix) {
2016     // callee is known => check if we have static binding
2017     if (code == Bytecodes::_invokestatic  ||
2018         code == Bytecodes::_invokespecial ||
2019         (code == Bytecodes::_invokevirtual && target->is_final_method()) ||
2020         code == Bytecodes::_invokedynamic) {
2021       ciMethod* inline_target = (cha_monomorphic_target != NULL) ? cha_monomorphic_target : target;
2022       // static binding => check if callee is ok
2023       bool success = try_inline(inline_target, (cha_monomorphic_target != NULL) || (exact_target != NULL), false, code, better_receiver);
2024 
2025       CHECK_BAILOUT();
2026       clear_inline_bailout();
2027 
2028       if (success) {
2029         // Register dependence if JVMTI has either breakpoint
2030         // setting or hotswapping of methods capabilities since they may
2031         // cause deoptimization.
2032         if (compilation()->env()->jvmti_can_hotswap_or_post_breakpoint()) {
2033           dependency_recorder()->assert_evol_method(inline_target);
2034         }
2035         return;
2036       }
2037     } else {
2038       print_inlining(target, "no static binding", /*success*/ false);
2039     }
2040   } else {
2041     print_inlining(target, "not inlineable", /*success*/ false);
2042   }
2043 
2044   // If we attempted an inline which did not succeed because of a
2045   // bailout during construction of the callee graph, the entire
2046   // compilation has to be aborted. This is fairly rare and currently
2047   // seems to only occur for jasm-generated classes which contain
2048   // jsr/ret pairs which are not associated with finally clauses and
2049   // do not have exception handlers in the containing method, and are
2050   // therefore not caught early enough to abort the inlining without
2051   // corrupting the graph. (We currently bail out with a non-empty
2052   // stack at a ret in these situations.)
2053   CHECK_BAILOUT();
2054 
2055   // inlining not successful => standard invoke
2056   ValueType* result_type = as_ValueType(declared_signature->return_type());
2057   ValueStack* state_before = copy_state_exhandling();
2058 
2059   // The bytecode (code) might change in this method so we are checking this very late.
2060   const bool has_receiver =
2061     code == Bytecodes::_invokespecial   ||
2062     code == Bytecodes::_invokevirtual   ||
2063     code == Bytecodes::_invokeinterface;
2064   Values* args = state()->pop_arguments(target->arg_size_no_receiver() + patching_appendix_arg);
2065   Value recv = has_receiver ? apop() : NULL;
2066   int vtable_index = Method::invalid_vtable_index;
2067 
2068 #ifdef SPARC
2069   // Currently only supported on Sparc.
2070   // The UseInlineCaches only controls dispatch to invokevirtuals for
2071   // loaded classes which we weren't able to statically bind.
2072   if (!UseInlineCaches && target->is_loaded() && code == Bytecodes::_invokevirtual
2073       && !target->can_be_statically_bound()) {
2074     // Find a vtable index if one is available
2075     // For arrays, callee_holder is Object. Resolving the call with
2076     // Object would allow an illegal call to finalize() on an
2077     // array. We use holder instead: illegal calls to finalize() won't
2078     // be compiled as vtable calls (IC call resolution will catch the
2079     // illegal call) and the few legal calls on array types won't be
2080     // either.
2081     vtable_index = target->resolve_vtable_index(calling_klass, holder);
2082   }
2083 #endif
2084 
2085   // A null check is required here (when there is a receiver) for any of the following cases
2086   // - invokespecial, always need a null check.
2087   // - invokevirtual, when the target is final and loaded. Calls to final targets will become optimized
2088   //   and require null checking. If the target is loaded a null check is emitted here.
2089   //   If the target isn't loaded the null check must happen after the call resolution. We achieve that
2090   //   by using the target methods unverified entry point (see CompiledIC::compute_monomorphic_entry).
2091   //   (The JVM specification requires that LinkageError must be thrown before a NPE. An unloaded target may
2092   //   potentially fail, and can't have the null check before the resolution.)
2093   // - A call that will be profiled. (But we can't add a null check when the target is unloaded, by the same
2094   //   reason as above, so calls with a receiver to unloaded targets can't be profiled.)
2095   //
2096   // Normal invokevirtual will perform the null check during lookup
2097 
2098   bool need_null_check = (code == Bytecodes::_invokespecial) ||
2099       (target->is_loaded() && (target->is_final_method() || (is_profiling() && profile_calls())));
2100 
2101   if (need_null_check) {
2102     if (recv != NULL) {
2103       null_check(recv);
2104     }
2105 
2106     if (is_profiling()) {
2107       // Note that we'd collect profile data in this method if we wanted it.
2108       compilation()->set_would_profile(true);
2109 
2110       if (profile_calls()) {
2111         assert(cha_monomorphic_target == NULL || exact_target == NULL, "both can not be set");
2112         ciKlass* target_klass = NULL;
2113         if (cha_monomorphic_target != NULL) {
2114           target_klass = cha_monomorphic_target->holder();
2115         } else if (exact_target != NULL) {
2116           target_klass = exact_target->holder();
2117         }
2118         profile_call(target, recv, target_klass, collect_args_for_profiling(args, NULL, false), false);
2119       }
2120     }
2121   }
2122 
2123   Invoke* result = new Invoke(code, result_type, recv, args, vtable_index, target, state_before);
2124   // push result
2125   append_split(result);
2126 
2127   if (result_type != voidType) {
2128     if (method()->is_strict()) {
2129       push(result_type, round_fp(result));
2130     } else {
2131       push(result_type, result);
2132     }
2133   }
2134   if (profile_return() && result_type->is_object_kind()) {
2135     profile_return_type(result, target);
2136   }
2137 }
2138 
2139 
2140 void GraphBuilder::new_instance(int klass_index) {
2141   ValueStack* state_before = copy_state_exhandling();
2142   bool will_link;
2143   ciKlass* klass = stream()->get_klass(will_link);
2144   assert(klass->is_instance_klass(), "must be an instance klass");
2145   NewInstance* new_instance = new NewInstance(klass->as_instance_klass(), state_before, stream()->is_unresolved_klass());
2146   _memory->new_instance(new_instance);
2147   apush(append_split(new_instance));
2148 }
2149 
2150 
2151 void GraphBuilder::new_type_array() {
2152   ValueStack* state_before = copy_state_exhandling();
2153   apush(append_split(new NewTypeArray(ipop(), (BasicType)stream()->get_index(), state_before)));
2154 }
2155 
2156 
2157 void GraphBuilder::new_object_array() {
2158   bool will_link;
2159   ciKlass* klass = stream()->get_klass(will_link);
2160   ValueStack* state_before = !klass->is_loaded() || PatchALot ? copy_state_before() : copy_state_exhandling();
2161   NewArray* n = new NewObjectArray(klass, ipop(), state_before);
2162   apush(append_split(n));
2163 }
2164 
2165 
2166 bool GraphBuilder::direct_compare(ciKlass* k) {
2167   if (k->is_loaded() && k->is_instance_klass() && !UseSlowPath) {
2168     ciInstanceKlass* ik = k->as_instance_klass();
2169     if (ik->is_final()) {
2170       return true;
2171     } else {
2172       if (DeoptC1 && UseCHA && !(ik->has_subklass() || ik->is_interface())) {
2173         // test class is leaf class
2174         dependency_recorder()->assert_leaf_type(ik);
2175         return true;
2176       }
2177     }
2178   }
2179   return false;
2180 }
2181 
2182 
2183 void GraphBuilder::check_cast(int klass_index) {
2184   bool will_link;
2185   ciKlass* klass = stream()->get_klass(will_link);
2186   ValueStack* state_before = !klass->is_loaded() || PatchALot ? copy_state_before() : copy_state_for_exception();
2187   CheckCast* c = new CheckCast(klass, apop(), state_before);
2188   apush(append_split(c));
2189   c->set_direct_compare(direct_compare(klass));
2190 
2191   if (is_profiling()) {
2192     // Note that we'd collect profile data in this method if we wanted it.
2193     compilation()->set_would_profile(true);
2194 
2195     if (profile_checkcasts()) {
2196       c->set_profiled_method(method());
2197       c->set_profiled_bci(bci());
2198       c->set_should_profile(true);
2199     }
2200   }
2201 }
2202 
2203 
2204 void GraphBuilder::instance_of(int klass_index) {
2205   bool will_link;
2206   ciKlass* klass = stream()->get_klass(will_link);
2207   ValueStack* state_before = !klass->is_loaded() || PatchALot ? copy_state_before() : copy_state_exhandling();
2208   InstanceOf* i = new InstanceOf(klass, apop(), state_before);
2209   ipush(append_split(i));
2210   i->set_direct_compare(direct_compare(klass));
2211 
2212   if (is_profiling()) {
2213     // Note that we'd collect profile data in this method if we wanted it.
2214     compilation()->set_would_profile(true);
2215 
2216     if (profile_checkcasts()) {
2217       i->set_profiled_method(method());
2218       i->set_profiled_bci(bci());
2219       i->set_should_profile(true);
2220     }
2221   }
2222 }
2223 
2224 
2225 void GraphBuilder::monitorenter(Value x, int bci) {
2226   // save state before locking in case of deoptimization after a NullPointerException
2227   ValueStack* state_before = copy_state_for_exception_with_bci(bci);
2228   append_with_bci(new MonitorEnter(x, state()->lock(x), state_before), bci);
2229   kill_all();
2230 }
2231 
2232 
2233 void GraphBuilder::monitorexit(Value x, int bci) {
2234   append_with_bci(new MonitorExit(x, state()->unlock()), bci);
2235   kill_all();
2236 }
2237 
2238 
2239 void GraphBuilder::new_multi_array(int dimensions) {
2240   bool will_link;
2241   ciKlass* klass = stream()->get_klass(will_link);
2242   ValueStack* state_before = !klass->is_loaded() || PatchALot ? copy_state_before() : copy_state_exhandling();
2243 
2244   Values* dims = new Values(dimensions, dimensions, NULL);
2245   // fill in all dimensions
2246   int i = dimensions;
2247   while (i-- > 0) dims->at_put(i, ipop());
2248   // create array
2249   NewArray* n = new NewMultiArray(klass, dims, state_before);
2250   apush(append_split(n));
2251 }
2252 
2253 
2254 void GraphBuilder::throw_op(int bci) {
2255   // We require that the debug info for a Throw be the "state before"
2256   // the Throw (i.e., exception oop is still on TOS)
2257   ValueStack* state_before = copy_state_before_with_bci(bci);
2258   Throw* t = new Throw(apop(), state_before);
2259   // operand stack not needed after a throw
2260   state()->truncate_stack(0);
2261   append_with_bci(t, bci);
2262 }
2263 
2264 
2265 Value GraphBuilder::round_fp(Value fp_value) {
2266   // no rounding needed if SSE2 is used
2267   if (RoundFPResults && UseSSE < 2) {
2268     // Must currently insert rounding node for doubleword values that
2269     // are results of expressions (i.e., not loads from memory or
2270     // constants)
2271     if (fp_value->type()->tag() == doubleTag &&
2272         fp_value->as_Constant() == NULL &&
2273         fp_value->as_Local() == NULL &&       // method parameters need no rounding
2274         fp_value->as_RoundFP() == NULL) {
2275       return append(new RoundFP(fp_value));
2276     }
2277   }
2278   return fp_value;
2279 }
2280 
2281 
2282 Instruction* GraphBuilder::append_with_bci(Instruction* instr, int bci) {
2283   Canonicalizer canon(compilation(), instr, bci);
2284   Instruction* i1 = canon.canonical();
2285   if (i1->is_linked() || !i1->can_be_linked()) {
2286     // Canonicalizer returned an instruction which was already
2287     // appended so simply return it.
2288     return i1;
2289   }
2290 
2291   if (UseLocalValueNumbering) {
2292     // Lookup the instruction in the ValueMap and add it to the map if
2293     // it's not found.
2294     Instruction* i2 = vmap()->find_insert(i1);
2295     if (i2 != i1) {
2296       // found an entry in the value map, so just return it.
2297       assert(i2->is_linked(), "should already be linked");
2298       return i2;
2299     }
2300     ValueNumberingEffects vne(vmap());
2301     i1->visit(&vne);
2302   }
2303 
2304   // i1 was not eliminated => append it
2305   assert(i1->next() == NULL, "shouldn't already be linked");
2306   _last = _last->set_next(i1, canon.bci());
2307 
2308   if (++_instruction_count >= InstructionCountCutoff && !bailed_out()) {
2309     // set the bailout state but complete normal processing.  We
2310     // might do a little more work before noticing the bailout so we
2311     // want processing to continue normally until it's noticed.
2312     bailout("Method and/or inlining is too large");
2313   }
2314 
2315 #ifndef PRODUCT
2316   if (PrintIRDuringConstruction) {
2317     InstructionPrinter ip;
2318     ip.print_line(i1);
2319     if (Verbose) {
2320       state()->print();
2321     }
2322   }
2323 #endif
2324 
2325   // save state after modification of operand stack for StateSplit instructions
2326   StateSplit* s = i1->as_StateSplit();
2327   if (s != NULL) {
2328     if (EliminateFieldAccess) {
2329       Intrinsic* intrinsic = s->as_Intrinsic();
2330       if (s->as_Invoke() != NULL || (intrinsic && !intrinsic->preserves_state())) {
2331         _memory->kill();
2332       }
2333     }
2334     s->set_state(state()->copy(ValueStack::StateAfter, canon.bci()));
2335   }
2336 
2337   // set up exception handlers for this instruction if necessary
2338   if (i1->can_trap()) {
2339     i1->set_exception_handlers(handle_exception(i1));
2340     assert(i1->exception_state() != NULL || !i1->needs_exception_state() || bailed_out(), "handle_exception must set exception state");
2341   }
2342   return i1;
2343 }
2344 
2345 
2346 Instruction* GraphBuilder::append(Instruction* instr) {
2347   assert(instr->as_StateSplit() == NULL || instr->as_BlockEnd() != NULL, "wrong append used");
2348   return append_with_bci(instr, bci());
2349 }
2350 
2351 
2352 Instruction* GraphBuilder::append_split(StateSplit* instr) {
2353   return append_with_bci(instr, bci());
2354 }
2355 
2356 
2357 void GraphBuilder::null_check(Value value) {
2358   if (value->as_NewArray() != NULL || value->as_NewInstance() != NULL) {
2359     return;
2360   } else {
2361     Constant* con = value->as_Constant();
2362     if (con) {
2363       ObjectType* c = con->type()->as_ObjectType();
2364       if (c && c->is_loaded()) {
2365         ObjectConstant* oc = c->as_ObjectConstant();
2366         if (!oc || !oc->value()->is_null_object()) {
2367           return;
2368         }
2369       }
2370     }
2371   }
2372   append(new NullCheck(value, copy_state_for_exception()));
2373 }
2374 
2375 
2376 
2377 XHandlers* GraphBuilder::handle_exception(Instruction* instruction) {
2378   if (!has_handler() && (!instruction->needs_exception_state() || instruction->exception_state() != NULL)) {
2379     assert(instruction->exception_state() == NULL
2380            || instruction->exception_state()->kind() == ValueStack::EmptyExceptionState
2381            || (instruction->exception_state()->kind() == ValueStack::ExceptionState && _compilation->env()->should_retain_local_variables()),
2382            "exception_state should be of exception kind");
2383     return new XHandlers();
2384   }
2385 
2386   XHandlers*  exception_handlers = new XHandlers();
2387   ScopeData*  cur_scope_data = scope_data();
2388   ValueStack* cur_state = instruction->state_before();
2389   ValueStack* prev_state = NULL;
2390   int scope_count = 0;
2391 
2392   assert(cur_state != NULL, "state_before must be set");
2393   do {
2394     int cur_bci = cur_state->bci();
2395     assert(cur_scope_data->scope() == cur_state->scope(), "scopes do not match");
2396     assert(cur_bci == SynchronizationEntryBCI || cur_bci == cur_scope_data->stream()->cur_bci(), "invalid bci");
2397 
2398     // join with all potential exception handlers
2399     XHandlers* list = cur_scope_data->xhandlers();
2400     const int n = list->length();
2401     for (int i = 0; i < n; i++) {
2402       XHandler* h = list->handler_at(i);
2403       if (h->covers(cur_bci)) {
2404         // h is a potential exception handler => join it
2405         compilation()->set_has_exception_handlers(true);
2406 
2407         BlockBegin* entry = h->entry_block();
2408         if (entry == block()) {
2409           // It's acceptable for an exception handler to cover itself
2410           // but we don't handle that in the parser currently.  It's
2411           // very rare so we bailout instead of trying to handle it.
2412           BAILOUT_("exception handler covers itself", exception_handlers);
2413         }
2414         assert(entry->bci() == h->handler_bci(), "must match");
2415         assert(entry->bci() == -1 || entry == cur_scope_data->block_at(entry->bci()), "blocks must correspond");
2416 
2417         // previously this was a BAILOUT, but this is not necessary
2418         // now because asynchronous exceptions are not handled this way.
2419         assert(entry->state() == NULL || cur_state->total_locks_size() == entry->state()->total_locks_size(), "locks do not match");
2420 
2421         // xhandler start with an empty expression stack
2422         if (cur_state->stack_size() != 0) {
2423           cur_state = cur_state->copy(ValueStack::ExceptionState, cur_state->bci());
2424         }
2425         if (instruction->exception_state() == NULL) {
2426           instruction->set_exception_state(cur_state);
2427         }
2428 
2429         // Note: Usually this join must work. However, very
2430         // complicated jsr-ret structures where we don't ret from
2431         // the subroutine can cause the objects on the monitor
2432         // stacks to not match because blocks can be parsed twice.
2433         // The only test case we've seen so far which exhibits this
2434         // problem is caught by the infinite recursion test in
2435         // GraphBuilder::jsr() if the join doesn't work.
2436         if (!entry->try_merge(cur_state)) {
2437           BAILOUT_("error while joining with exception handler, prob. due to complicated jsr/rets", exception_handlers);
2438         }
2439 
2440         // add current state for correct handling of phi functions at begin of xhandler
2441         int phi_operand = entry->add_exception_state(cur_state);
2442 
2443         // add entry to the list of xhandlers of this block
2444         _block->add_exception_handler(entry);
2445 
2446         // add back-edge from xhandler entry to this block
2447         if (!entry->is_predecessor(_block)) {
2448           entry->add_predecessor(_block);
2449         }
2450 
2451         // clone XHandler because phi_operand and scope_count can not be shared
2452         XHandler* new_xhandler = new XHandler(h);
2453         new_xhandler->set_phi_operand(phi_operand);
2454         new_xhandler->set_scope_count(scope_count);
2455         exception_handlers->append(new_xhandler);
2456 
2457         // fill in exception handler subgraph lazily
2458         assert(!entry->is_set(BlockBegin::was_visited_flag), "entry must not be visited yet");
2459         cur_scope_data->add_to_work_list(entry);
2460 
2461         // stop when reaching catchall
2462         if (h->catch_type() == 0) {
2463           return exception_handlers;
2464         }
2465       }
2466     }
2467 
2468     if (exception_handlers->length() == 0) {
2469       // This scope and all callees do not handle exceptions, so the local
2470       // variables of this scope are not needed. However, the scope itself is
2471       // required for a correct exception stack trace -> clear out the locals.
2472       if (_compilation->env()->should_retain_local_variables()) {
2473         cur_state = cur_state->copy(ValueStack::ExceptionState, cur_state->bci());
2474       } else {
2475         cur_state = cur_state->copy(ValueStack::EmptyExceptionState, cur_state->bci());
2476       }
2477       if (prev_state != NULL) {
2478         prev_state->set_caller_state(cur_state);
2479       }
2480       if (instruction->exception_state() == NULL) {
2481         instruction->set_exception_state(cur_state);
2482       }
2483     }
2484 
2485     // Set up iteration for next time.
2486     // If parsing a jsr, do not grab exception handlers from the
2487     // parent scopes for this method (already got them, and they
2488     // needed to be cloned)
2489 
2490     while (cur_scope_data->parsing_jsr()) {
2491       cur_scope_data = cur_scope_data->parent();
2492     }
2493 
2494     assert(cur_scope_data->scope() == cur_state->scope(), "scopes do not match");
2495     assert(cur_state->locks_size() == 0 || cur_state->locks_size() == 1, "unlocking must be done in a catchall exception handler");
2496 
2497     prev_state = cur_state;
2498     cur_state = cur_state->caller_state();
2499     cur_scope_data = cur_scope_data->parent();
2500     scope_count++;
2501   } while (cur_scope_data != NULL);
2502 
2503   return exception_handlers;
2504 }
2505 
2506 
2507 // Helper class for simplifying Phis.
2508 class PhiSimplifier : public BlockClosure {
2509  private:
2510   bool _has_substitutions;
2511   Value simplify(Value v);
2512 
2513  public:
2514   PhiSimplifier(BlockBegin* start) : _has_substitutions(false) {
2515     start->iterate_preorder(this);
2516     if (_has_substitutions) {
2517       SubstitutionResolver sr(start);
2518     }
2519   }
2520   void block_do(BlockBegin* b);
2521   bool has_substitutions() const { return _has_substitutions; }
2522 };
2523 
2524 
2525 Value PhiSimplifier::simplify(Value v) {
2526   Phi* phi = v->as_Phi();
2527 
2528   if (phi == NULL) {
2529     // no phi function
2530     return v;
2531   } else if (v->has_subst()) {
2532     // already substituted; subst can be phi itself -> simplify
2533     return simplify(v->subst());
2534   } else if (phi->is_set(Phi::cannot_simplify)) {
2535     // already tried to simplify phi before
2536     return phi;
2537   } else if (phi->is_set(Phi::visited)) {
2538     // break cycles in phi functions
2539     return phi;
2540   } else if (phi->type()->is_illegal()) {
2541     // illegal phi functions are ignored anyway
2542     return phi;
2543 
2544   } else {
2545     // mark phi function as processed to break cycles in phi functions
2546     phi->set(Phi::visited);
2547 
2548     // simplify x = [y, x] and x = [y, y] to y
2549     Value subst = NULL;
2550     int opd_count = phi->operand_count();
2551     for (int i = 0; i < opd_count; i++) {
2552       Value opd = phi->operand_at(i);
2553       assert(opd != NULL, "Operand must exist!");
2554 
2555       if (opd->type()->is_illegal()) {
2556         // if one operand is illegal, the entire phi function is illegal
2557         phi->make_illegal();
2558         phi->clear(Phi::visited);
2559         return phi;
2560       }
2561 
2562       Value new_opd = simplify(opd);
2563       assert(new_opd != NULL, "Simplified operand must exist!");
2564 
2565       if (new_opd != phi && new_opd != subst) {
2566         if (subst == NULL) {
2567           subst = new_opd;
2568         } else {
2569           // no simplification possible
2570           phi->set(Phi::cannot_simplify);
2571           phi->clear(Phi::visited);
2572           return phi;
2573         }
2574       }
2575     }
2576 
2577     // sucessfully simplified phi function
2578     assert(subst != NULL, "illegal phi function");
2579     _has_substitutions = true;
2580     phi->clear(Phi::visited);
2581     phi->set_subst(subst);
2582 
2583 #ifndef PRODUCT
2584     if (PrintPhiFunctions) {
2585       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());
2586     }
2587 #endif
2588 
2589     return subst;
2590   }
2591 }
2592 
2593 
2594 void PhiSimplifier::block_do(BlockBegin* b) {
2595   for_each_phi_fun(b, phi,
2596     simplify(phi);
2597   );
2598 
2599 #ifdef ASSERT
2600   for_each_phi_fun(b, phi,
2601                    assert(phi->operand_count() != 1 || phi->subst() != phi, "missed trivial simplification");
2602   );
2603 
2604   ValueStack* state = b->state()->caller_state();
2605   for_each_state_value(state, value,
2606     Phi* phi = value->as_Phi();
2607     assert(phi == NULL || phi->block() != b, "must not have phi function to simplify in caller state");
2608   );
2609 #endif
2610 }
2611 
2612 // This method is called after all blocks are filled with HIR instructions
2613 // It eliminates all Phi functions of the form x = [y, y] and x = [y, x]
2614 void GraphBuilder::eliminate_redundant_phis(BlockBegin* start) {
2615   PhiSimplifier simplifier(start);
2616 }
2617 
2618 
2619 void GraphBuilder::connect_to_end(BlockBegin* beg) {
2620   // setup iteration
2621   kill_all();
2622   _block = beg;
2623   _state = beg->state()->copy_for_parsing();
2624   _last  = beg;
2625   iterate_bytecodes_for_block(beg->bci());
2626 }
2627 
2628 
2629 BlockEnd* GraphBuilder::iterate_bytecodes_for_block(int bci) {
2630 #ifndef PRODUCT
2631   if (PrintIRDuringConstruction) {
2632     tty->cr();
2633     InstructionPrinter ip;
2634     ip.print_instr(_block); tty->cr();
2635     ip.print_stack(_block->state()); tty->cr();
2636     ip.print_inline_level(_block);
2637     ip.print_head();
2638     tty->print_cr("locals size: %d stack size: %d", state()->locals_size(), state()->stack_size());
2639   }
2640 #endif
2641   _skip_block = false;
2642   assert(state() != NULL, "ValueStack missing!");
2643   CompileLog* log = compilation()->log();
2644   ciBytecodeStream s(method());
2645   s.reset_to_bci(bci);
2646   int prev_bci = bci;
2647   scope_data()->set_stream(&s);
2648   // iterate
2649   Bytecodes::Code code = Bytecodes::_illegal;
2650   bool push_exception = false;
2651 
2652   if (block()->is_set(BlockBegin::exception_entry_flag) && block()->next() == NULL) {
2653     // first thing in the exception entry block should be the exception object.
2654     push_exception = true;
2655   }
2656 
2657   bool ignore_return = scope_data()->ignore_return();
2658 
2659   while (!bailed_out() && last()->as_BlockEnd() == NULL &&
2660          (code = stream()->next()) != ciBytecodeStream::EOBC() &&
2661          (block_at(s.cur_bci()) == NULL || block_at(s.cur_bci()) == block())) {
2662     assert(state()->kind() == ValueStack::Parsing, "invalid state kind");
2663 
2664     if (log != NULL)
2665       log->set_context("bc code='%d' bci='%d'", (int)code, s.cur_bci());
2666 
2667     // Check for active jsr during OSR compilation
2668     if (compilation()->is_osr_compile()
2669         && scope()->is_top_scope()
2670         && parsing_jsr()
2671         && s.cur_bci() == compilation()->osr_bci()) {
2672       bailout("OSR not supported while a jsr is active");
2673     }
2674 
2675     if (push_exception) {
2676       apush(append(new ExceptionObject()));
2677       push_exception = false;
2678     }
2679 
2680     // handle bytecode
2681     switch (code) {
2682       case Bytecodes::_nop            : /* nothing to do */ break;
2683       case Bytecodes::_aconst_null    : apush(append(new Constant(objectNull            ))); break;
2684       case Bytecodes::_iconst_m1      : ipush(append(new Constant(new IntConstant   (-1)))); break;
2685       case Bytecodes::_iconst_0       : ipush(append(new Constant(intZero               ))); break;
2686       case Bytecodes::_iconst_1       : ipush(append(new Constant(intOne                ))); break;
2687       case Bytecodes::_iconst_2       : ipush(append(new Constant(new IntConstant   ( 2)))); break;
2688       case Bytecodes::_iconst_3       : ipush(append(new Constant(new IntConstant   ( 3)))); break;
2689       case Bytecodes::_iconst_4       : ipush(append(new Constant(new IntConstant   ( 4)))); break;
2690       case Bytecodes::_iconst_5       : ipush(append(new Constant(new IntConstant   ( 5)))); break;
2691       case Bytecodes::_lconst_0       : lpush(append(new Constant(new LongConstant  ( 0)))); break;
2692       case Bytecodes::_lconst_1       : lpush(append(new Constant(new LongConstant  ( 1)))); break;
2693       case Bytecodes::_fconst_0       : fpush(append(new Constant(new FloatConstant ( 0)))); break;
2694       case Bytecodes::_fconst_1       : fpush(append(new Constant(new FloatConstant ( 1)))); break;
2695       case Bytecodes::_fconst_2       : fpush(append(new Constant(new FloatConstant ( 2)))); break;
2696       case Bytecodes::_dconst_0       : dpush(append(new Constant(new DoubleConstant( 0)))); break;
2697       case Bytecodes::_dconst_1       : dpush(append(new Constant(new DoubleConstant( 1)))); break;
2698       case Bytecodes::_bipush         : ipush(append(new Constant(new IntConstant(((signed char*)s.cur_bcp())[1])))); break;
2699       case Bytecodes::_sipush         : ipush(append(new Constant(new IntConstant((short)Bytes::get_Java_u2(s.cur_bcp()+1))))); break;
2700       case Bytecodes::_ldc            : // fall through
2701       case Bytecodes::_ldc_w          : // fall through
2702       case Bytecodes::_ldc2_w         : load_constant(); break;
2703       case Bytecodes::_iload          : load_local(intType     , s.get_index()); break;
2704       case Bytecodes::_lload          : load_local(longType    , s.get_index()); break;
2705       case Bytecodes::_fload          : load_local(floatType   , s.get_index()); break;
2706       case Bytecodes::_dload          : load_local(doubleType  , s.get_index()); break;
2707       case Bytecodes::_aload          : load_local(instanceType, s.get_index()); break;
2708       case Bytecodes::_iload_0        : load_local(intType   , 0); break;
2709       case Bytecodes::_iload_1        : load_local(intType   , 1); break;
2710       case Bytecodes::_iload_2        : load_local(intType   , 2); break;
2711       case Bytecodes::_iload_3        : load_local(intType   , 3); break;
2712       case Bytecodes::_lload_0        : load_local(longType  , 0); break;
2713       case Bytecodes::_lload_1        : load_local(longType  , 1); break;
2714       case Bytecodes::_lload_2        : load_local(longType  , 2); break;
2715       case Bytecodes::_lload_3        : load_local(longType  , 3); break;
2716       case Bytecodes::_fload_0        : load_local(floatType , 0); break;
2717       case Bytecodes::_fload_1        : load_local(floatType , 1); break;
2718       case Bytecodes::_fload_2        : load_local(floatType , 2); break;
2719       case Bytecodes::_fload_3        : load_local(floatType , 3); break;
2720       case Bytecodes::_dload_0        : load_local(doubleType, 0); break;
2721       case Bytecodes::_dload_1        : load_local(doubleType, 1); break;
2722       case Bytecodes::_dload_2        : load_local(doubleType, 2); break;
2723       case Bytecodes::_dload_3        : load_local(doubleType, 3); break;
2724       case Bytecodes::_aload_0        : load_local(objectType, 0); break;
2725       case Bytecodes::_aload_1        : load_local(objectType, 1); break;
2726       case Bytecodes::_aload_2        : load_local(objectType, 2); break;
2727       case Bytecodes::_aload_3        : load_local(objectType, 3); break;
2728       case Bytecodes::_iaload         : load_indexed(T_INT   ); break;
2729       case Bytecodes::_laload         : load_indexed(T_LONG  ); break;
2730       case Bytecodes::_faload         : load_indexed(T_FLOAT ); break;
2731       case Bytecodes::_daload         : load_indexed(T_DOUBLE); break;
2732       case Bytecodes::_aaload         : load_indexed(T_OBJECT); break;
2733       case Bytecodes::_baload         : load_indexed(T_BYTE  ); break;
2734       case Bytecodes::_caload         : load_indexed(T_CHAR  ); break;
2735       case Bytecodes::_saload         : load_indexed(T_SHORT ); break;
2736       case Bytecodes::_istore         : store_local(intType   , s.get_index()); break;
2737       case Bytecodes::_lstore         : store_local(longType  , s.get_index()); break;
2738       case Bytecodes::_fstore         : store_local(floatType , s.get_index()); break;
2739       case Bytecodes::_dstore         : store_local(doubleType, s.get_index()); break;
2740       case Bytecodes::_astore         : store_local(objectType, s.get_index()); break;
2741       case Bytecodes::_istore_0       : store_local(intType   , 0); break;
2742       case Bytecodes::_istore_1       : store_local(intType   , 1); break;
2743       case Bytecodes::_istore_2       : store_local(intType   , 2); break;
2744       case Bytecodes::_istore_3       : store_local(intType   , 3); break;
2745       case Bytecodes::_lstore_0       : store_local(longType  , 0); break;
2746       case Bytecodes::_lstore_1       : store_local(longType  , 1); break;
2747       case Bytecodes::_lstore_2       : store_local(longType  , 2); break;
2748       case Bytecodes::_lstore_3       : store_local(longType  , 3); break;
2749       case Bytecodes::_fstore_0       : store_local(floatType , 0); break;
2750       case Bytecodes::_fstore_1       : store_local(floatType , 1); break;
2751       case Bytecodes::_fstore_2       : store_local(floatType , 2); break;
2752       case Bytecodes::_fstore_3       : store_local(floatType , 3); break;
2753       case Bytecodes::_dstore_0       : store_local(doubleType, 0); break;
2754       case Bytecodes::_dstore_1       : store_local(doubleType, 1); break;
2755       case Bytecodes::_dstore_2       : store_local(doubleType, 2); break;
2756       case Bytecodes::_dstore_3       : store_local(doubleType, 3); break;
2757       case Bytecodes::_astore_0       : store_local(objectType, 0); break;
2758       case Bytecodes::_astore_1       : store_local(objectType, 1); break;
2759       case Bytecodes::_astore_2       : store_local(objectType, 2); break;
2760       case Bytecodes::_astore_3       : store_local(objectType, 3); break;
2761       case Bytecodes::_iastore        : store_indexed(T_INT   ); break;
2762       case Bytecodes::_lastore        : store_indexed(T_LONG  ); break;
2763       case Bytecodes::_fastore        : store_indexed(T_FLOAT ); break;
2764       case Bytecodes::_dastore        : store_indexed(T_DOUBLE); break;
2765       case Bytecodes::_aastore        : store_indexed(T_OBJECT); break;
2766       case Bytecodes::_bastore        : store_indexed(T_BYTE  ); break;
2767       case Bytecodes::_castore        : store_indexed(T_CHAR  ); break;
2768       case Bytecodes::_sastore        : store_indexed(T_SHORT ); break;
2769       case Bytecodes::_pop            : // fall through
2770       case Bytecodes::_pop2           : // fall through
2771       case Bytecodes::_dup            : // fall through
2772       case Bytecodes::_dup_x1         : // fall through
2773       case Bytecodes::_dup_x2         : // fall through
2774       case Bytecodes::_dup2           : // fall through
2775       case Bytecodes::_dup2_x1        : // fall through
2776       case Bytecodes::_dup2_x2        : // fall through
2777       case Bytecodes::_swap           : stack_op(code); break;
2778       case Bytecodes::_iadd           : arithmetic_op(intType   , code); break;
2779       case Bytecodes::_ladd           : arithmetic_op(longType  , code); break;
2780       case Bytecodes::_fadd           : arithmetic_op(floatType , code); break;
2781       case Bytecodes::_dadd           : arithmetic_op(doubleType, code); break;
2782       case Bytecodes::_isub           : arithmetic_op(intType   , code); break;
2783       case Bytecodes::_lsub           : arithmetic_op(longType  , code); break;
2784       case Bytecodes::_fsub           : arithmetic_op(floatType , code); break;
2785       case Bytecodes::_dsub           : arithmetic_op(doubleType, code); break;
2786       case Bytecodes::_imul           : arithmetic_op(intType   , code); break;
2787       case Bytecodes::_lmul           : arithmetic_op(longType  , code); break;
2788       case Bytecodes::_fmul           : arithmetic_op(floatType , code); break;
2789       case Bytecodes::_dmul           : arithmetic_op(doubleType, code); break;
2790       case Bytecodes::_idiv           : arithmetic_op(intType   , code, copy_state_for_exception()); break;
2791       case Bytecodes::_ldiv           : arithmetic_op(longType  , code, copy_state_for_exception()); break;
2792       case Bytecodes::_fdiv           : arithmetic_op(floatType , code); break;
2793       case Bytecodes::_ddiv           : arithmetic_op(doubleType, code); break;
2794       case Bytecodes::_irem           : arithmetic_op(intType   , code, copy_state_for_exception()); break;
2795       case Bytecodes::_lrem           : arithmetic_op(longType  , code, copy_state_for_exception()); break;
2796       case Bytecodes::_frem           : arithmetic_op(floatType , code); break;
2797       case Bytecodes::_drem           : arithmetic_op(doubleType, code); break;
2798       case Bytecodes::_ineg           : negate_op(intType   ); break;
2799       case Bytecodes::_lneg           : negate_op(longType  ); break;
2800       case Bytecodes::_fneg           : negate_op(floatType ); break;
2801       case Bytecodes::_dneg           : negate_op(doubleType); break;
2802       case Bytecodes::_ishl           : shift_op(intType , code); break;
2803       case Bytecodes::_lshl           : shift_op(longType, code); break;
2804       case Bytecodes::_ishr           : shift_op(intType , code); break;
2805       case Bytecodes::_lshr           : shift_op(longType, code); break;
2806       case Bytecodes::_iushr          : shift_op(intType , code); break;
2807       case Bytecodes::_lushr          : shift_op(longType, code); break;
2808       case Bytecodes::_iand           : logic_op(intType , code); break;
2809       case Bytecodes::_land           : logic_op(longType, code); break;
2810       case Bytecodes::_ior            : logic_op(intType , code); break;
2811       case Bytecodes::_lor            : logic_op(longType, code); break;
2812       case Bytecodes::_ixor           : logic_op(intType , code); break;
2813       case Bytecodes::_lxor           : logic_op(longType, code); break;
2814       case Bytecodes::_iinc           : increment(); break;
2815       case Bytecodes::_i2l            : convert(code, T_INT   , T_LONG  ); break;
2816       case Bytecodes::_i2f            : convert(code, T_INT   , T_FLOAT ); break;
2817       case Bytecodes::_i2d            : convert(code, T_INT   , T_DOUBLE); break;
2818       case Bytecodes::_l2i            : convert(code, T_LONG  , T_INT   ); break;
2819       case Bytecodes::_l2f            : convert(code, T_LONG  , T_FLOAT ); break;
2820       case Bytecodes::_l2d            : convert(code, T_LONG  , T_DOUBLE); break;
2821       case Bytecodes::_f2i            : convert(code, T_FLOAT , T_INT   ); break;
2822       case Bytecodes::_f2l            : convert(code, T_FLOAT , T_LONG  ); break;
2823       case Bytecodes::_f2d            : convert(code, T_FLOAT , T_DOUBLE); break;
2824       case Bytecodes::_d2i            : convert(code, T_DOUBLE, T_INT   ); break;
2825       case Bytecodes::_d2l            : convert(code, T_DOUBLE, T_LONG  ); break;
2826       case Bytecodes::_d2f            : convert(code, T_DOUBLE, T_FLOAT ); break;
2827       case Bytecodes::_i2b            : convert(code, T_INT   , T_BYTE  ); break;
2828       case Bytecodes::_i2c            : convert(code, T_INT   , T_CHAR  ); break;
2829       case Bytecodes::_i2s            : convert(code, T_INT   , T_SHORT ); break;
2830       case Bytecodes::_lcmp           : compare_op(longType  , code); break;
2831       case Bytecodes::_fcmpl          : compare_op(floatType , code); break;
2832       case Bytecodes::_fcmpg          : compare_op(floatType , code); break;
2833       case Bytecodes::_dcmpl          : compare_op(doubleType, code); break;
2834       case Bytecodes::_dcmpg          : compare_op(doubleType, code); break;
2835       case Bytecodes::_ifeq           : if_zero(intType   , If::eql); break;
2836       case Bytecodes::_ifne           : if_zero(intType   , If::neq); break;
2837       case Bytecodes::_iflt           : if_zero(intType   , If::lss); break;
2838       case Bytecodes::_ifge           : if_zero(intType   , If::geq); break;
2839       case Bytecodes::_ifgt           : if_zero(intType   , If::gtr); break;
2840       case Bytecodes::_ifle           : if_zero(intType   , If::leq); break;
2841       case Bytecodes::_if_icmpeq      : if_same(intType   , If::eql); break;
2842       case Bytecodes::_if_icmpne      : if_same(intType   , If::neq); break;
2843       case Bytecodes::_if_icmplt      : if_same(intType   , If::lss); break;
2844       case Bytecodes::_if_icmpge      : if_same(intType   , If::geq); break;
2845       case Bytecodes::_if_icmpgt      : if_same(intType   , If::gtr); break;
2846       case Bytecodes::_if_icmple      : if_same(intType   , If::leq); break;
2847       case Bytecodes::_if_acmpeq      : if_same(objectType, If::eql); break;
2848       case Bytecodes::_if_acmpne      : if_same(objectType, If::neq); break;
2849       case Bytecodes::_goto           : _goto(s.cur_bci(), s.get_dest()); break;
2850       case Bytecodes::_jsr            : jsr(s.get_dest()); break;
2851       case Bytecodes::_ret            : ret(s.get_index()); break;
2852       case Bytecodes::_tableswitch    : table_switch(); break;
2853       case Bytecodes::_lookupswitch   : lookup_switch(); break;
2854       case Bytecodes::_ireturn        : method_return(ipop(), ignore_return); break;
2855       case Bytecodes::_lreturn        : method_return(lpop(), ignore_return); break;
2856       case Bytecodes::_freturn        : method_return(fpop(), ignore_return); break;
2857       case Bytecodes::_dreturn        : method_return(dpop(), ignore_return); break;
2858       case Bytecodes::_areturn        : method_return(apop(), ignore_return); break;
2859       case Bytecodes::_return         : method_return(NULL  , ignore_return); break;
2860       case Bytecodes::_getstatic      : // fall through
2861       case Bytecodes::_putstatic      : // fall through
2862       case Bytecodes::_getfield       : // fall through
2863       case Bytecodes::_putfield       : access_field(code); break;
2864       case Bytecodes::_invokevirtual  : // fall through
2865       case Bytecodes::_invokespecial  : // fall through
2866       case Bytecodes::_invokestatic   : // fall through
2867       case Bytecodes::_invokedynamic  : // fall through
2868       case Bytecodes::_invokeinterface: invoke(code); break;
2869       case Bytecodes::_new            : new_instance(s.get_index_u2()); break;
2870       case Bytecodes::_newarray       : new_type_array(); break;
2871       case Bytecodes::_anewarray      : new_object_array(); break;
2872       case Bytecodes::_arraylength    : { ValueStack* state_before = copy_state_for_exception(); ipush(append(new ArrayLength(apop(), state_before))); break; }
2873       case Bytecodes::_athrow         : throw_op(s.cur_bci()); break;
2874       case Bytecodes::_checkcast      : check_cast(s.get_index_u2()); break;
2875       case Bytecodes::_instanceof     : instance_of(s.get_index_u2()); break;
2876       case Bytecodes::_monitorenter   : monitorenter(apop(), s.cur_bci()); break;
2877       case Bytecodes::_monitorexit    : monitorexit (apop(), s.cur_bci()); break;
2878       case Bytecodes::_wide           : ShouldNotReachHere(); break;
2879       case Bytecodes::_multianewarray : new_multi_array(s.cur_bcp()[3]); break;
2880       case Bytecodes::_ifnull         : if_null(objectType, If::eql); break;
2881       case Bytecodes::_ifnonnull      : if_null(objectType, If::neq); break;
2882       case Bytecodes::_goto_w         : _goto(s.cur_bci(), s.get_far_dest()); break;
2883       case Bytecodes::_jsr_w          : jsr(s.get_far_dest()); break;
2884       case Bytecodes::_breakpoint     : BAILOUT_("concurrent setting of breakpoint", NULL);
2885       default                         : ShouldNotReachHere(); break;
2886     }
2887 
2888     if (log != NULL)
2889       log->clear_context(); // skip marker if nothing was printed
2890 
2891     // save current bci to setup Goto at the end
2892     prev_bci = s.cur_bci();
2893 
2894   }
2895   CHECK_BAILOUT_(NULL);
2896   // stop processing of this block (see try_inline_full)
2897   if (_skip_block) {
2898     _skip_block = false;
2899     assert(_last && _last->as_BlockEnd(), "");
2900     return _last->as_BlockEnd();
2901   }
2902   // if there are any, check if last instruction is a BlockEnd instruction
2903   BlockEnd* end = last()->as_BlockEnd();
2904   if (end == NULL) {
2905     // all blocks must end with a BlockEnd instruction => add a Goto
2906     end = new Goto(block_at(s.cur_bci()), false);
2907     append(end);
2908   }
2909   assert(end == last()->as_BlockEnd(), "inconsistency");
2910 
2911   assert(end->state() != NULL, "state must already be present");
2912   assert(end->as_Return() == NULL || end->as_Throw() == NULL || end->state()->stack_size() == 0, "stack not needed for return and throw");
2913 
2914   // connect to begin & set state
2915   // NOTE that inlining may have changed the block we are parsing
2916   block()->set_end(end);
2917   // propagate state
2918   for (int i = end->number_of_sux() - 1; i >= 0; i--) {
2919     BlockBegin* sux = end->sux_at(i);
2920     assert(sux->is_predecessor(block()), "predecessor missing");
2921     // be careful, bailout if bytecodes are strange
2922     if (!sux->try_merge(end->state())) BAILOUT_("block join failed", NULL);
2923     scope_data()->add_to_work_list(end->sux_at(i));
2924   }
2925 
2926   scope_data()->set_stream(NULL);
2927 
2928   // done
2929   return end;
2930 }
2931 
2932 
2933 void GraphBuilder::iterate_all_blocks(bool start_in_current_block_for_inlining) {
2934   do {
2935     if (start_in_current_block_for_inlining && !bailed_out()) {
2936       iterate_bytecodes_for_block(0);
2937       start_in_current_block_for_inlining = false;
2938     } else {
2939       BlockBegin* b;
2940       while ((b = scope_data()->remove_from_work_list()) != NULL) {
2941         if (!b->is_set(BlockBegin::was_visited_flag)) {
2942           if (b->is_set(BlockBegin::osr_entry_flag)) {
2943             // we're about to parse the osr entry block, so make sure
2944             // we setup the OSR edge leading into this block so that
2945             // Phis get setup correctly.
2946             setup_osr_entry_block();
2947             // this is no longer the osr entry block, so clear it.
2948             b->clear(BlockBegin::osr_entry_flag);
2949           }
2950           b->set(BlockBegin::was_visited_flag);
2951           connect_to_end(b);
2952         }
2953       }
2954     }
2955   } while (!bailed_out() && !scope_data()->is_work_list_empty());
2956 }
2957 
2958 
2959 bool GraphBuilder::_can_trap      [Bytecodes::number_of_java_codes];
2960 
2961 void GraphBuilder::initialize() {
2962   // the following bytecodes are assumed to potentially
2963   // throw exceptions in compiled code - note that e.g.
2964   // monitorexit & the return bytecodes do not throw
2965   // exceptions since monitor pairing proved that they
2966   // succeed (if monitor pairing succeeded)
2967   Bytecodes::Code can_trap_list[] =
2968     { Bytecodes::_ldc
2969     , Bytecodes::_ldc_w
2970     , Bytecodes::_ldc2_w
2971     , Bytecodes::_iaload
2972     , Bytecodes::_laload
2973     , Bytecodes::_faload
2974     , Bytecodes::_daload
2975     , Bytecodes::_aaload
2976     , Bytecodes::_baload
2977     , Bytecodes::_caload
2978     , Bytecodes::_saload
2979     , Bytecodes::_iastore
2980     , Bytecodes::_lastore
2981     , Bytecodes::_fastore
2982     , Bytecodes::_dastore
2983     , Bytecodes::_aastore
2984     , Bytecodes::_bastore
2985     , Bytecodes::_castore
2986     , Bytecodes::_sastore
2987     , Bytecodes::_idiv
2988     , Bytecodes::_ldiv
2989     , Bytecodes::_irem
2990     , Bytecodes::_lrem
2991     , Bytecodes::_getstatic
2992     , Bytecodes::_putstatic
2993     , Bytecodes::_getfield
2994     , Bytecodes::_putfield
2995     , Bytecodes::_invokevirtual
2996     , Bytecodes::_invokespecial
2997     , Bytecodes::_invokestatic
2998     , Bytecodes::_invokedynamic
2999     , Bytecodes::_invokeinterface
3000     , Bytecodes::_new
3001     , Bytecodes::_newarray
3002     , Bytecodes::_anewarray
3003     , Bytecodes::_arraylength
3004     , Bytecodes::_athrow
3005     , Bytecodes::_checkcast
3006     , Bytecodes::_instanceof
3007     , Bytecodes::_monitorenter
3008     , Bytecodes::_multianewarray
3009     };
3010 
3011   // inititialize trap tables
3012   for (int i = 0; i < Bytecodes::number_of_java_codes; i++) {
3013     _can_trap[i] = false;
3014   }
3015   // set standard trap info
3016   for (uint j = 0; j < ARRAY_SIZE(can_trap_list); j++) {
3017     _can_trap[can_trap_list[j]] = true;
3018   }
3019 }
3020 
3021 
3022 BlockBegin* GraphBuilder::header_block(BlockBegin* entry, BlockBegin::Flag f, ValueStack* state) {
3023   assert(entry->is_set(f), "entry/flag mismatch");
3024   // create header block
3025   BlockBegin* h = new BlockBegin(entry->bci());
3026   h->set_depth_first_number(0);
3027 
3028   Value l = h;
3029   BlockEnd* g = new Goto(entry, false);
3030   l->set_next(g, entry->bci());
3031   h->set_end(g);
3032   h->set(f);
3033   // setup header block end state
3034   ValueStack* s = state->copy(ValueStack::StateAfter, entry->bci()); // can use copy since stack is empty (=> no phis)
3035   assert(s->stack_is_empty(), "must have empty stack at entry point");
3036   g->set_state(s);
3037   return h;
3038 }
3039 
3040 
3041 
3042 BlockBegin* GraphBuilder::setup_start_block(int osr_bci, BlockBegin* std_entry, BlockBegin* osr_entry, ValueStack* state) {
3043   BlockBegin* start = new BlockBegin(0);
3044 
3045   // This code eliminates the empty start block at the beginning of
3046   // each method.  Previously, each method started with the
3047   // start-block created below, and this block was followed by the
3048   // header block that was always empty.  This header block is only
3049   // necesary if std_entry is also a backward branch target because
3050   // then phi functions may be necessary in the header block.  It's
3051   // also necessary when profiling so that there's a single block that
3052   // can increment the interpreter_invocation_count.
3053   BlockBegin* new_header_block;
3054   if (std_entry->number_of_preds() > 0 || count_invocations() || count_backedges()) {
3055     new_header_block = header_block(std_entry, BlockBegin::std_entry_flag, state);
3056   } else {
3057     new_header_block = std_entry;
3058   }
3059 
3060   // setup start block (root for the IR graph)
3061   Base* base =
3062     new Base(
3063       new_header_block,
3064       osr_entry
3065     );
3066   start->set_next(base, 0);
3067   start->set_end(base);
3068   // create & setup state for start block
3069   start->set_state(state->copy(ValueStack::StateAfter, std_entry->bci()));
3070   base->set_state(state->copy(ValueStack::StateAfter, std_entry->bci()));
3071 
3072   if (base->std_entry()->state() == NULL) {
3073     // setup states for header blocks
3074     base->std_entry()->merge(state);
3075   }
3076 
3077   assert(base->std_entry()->state() != NULL, "");
3078   return start;
3079 }
3080 
3081 
3082 void GraphBuilder::setup_osr_entry_block() {
3083   assert(compilation()->is_osr_compile(), "only for osrs");
3084 
3085   int osr_bci = compilation()->osr_bci();
3086   ciBytecodeStream s(method());
3087   s.reset_to_bci(osr_bci);
3088   s.next();
3089   scope_data()->set_stream(&s);
3090 
3091   // create a new block to be the osr setup code
3092   _osr_entry = new BlockBegin(osr_bci);
3093   _osr_entry->set(BlockBegin::osr_entry_flag);
3094   _osr_entry->set_depth_first_number(0);
3095   BlockBegin* target = bci2block()->at(osr_bci);
3096   assert(target != NULL && target->is_set(BlockBegin::osr_entry_flag), "must be there");
3097   // the osr entry has no values for locals
3098   ValueStack* state = target->state()->copy();
3099   _osr_entry->set_state(state);
3100 
3101   kill_all();
3102   _block = _osr_entry;
3103   _state = _osr_entry->state()->copy();
3104   assert(_state->bci() == osr_bci, "mismatch");
3105   _last  = _osr_entry;
3106   Value e = append(new OsrEntry());
3107   e->set_needs_null_check(false);
3108 
3109   // OSR buffer is
3110   //
3111   // locals[nlocals-1..0]
3112   // monitors[number_of_locks-1..0]
3113   //
3114   // locals is a direct copy of the interpreter frame so in the osr buffer
3115   // so first slot in the local array is the last local from the interpreter
3116   // and last slot is local[0] (receiver) from the interpreter
3117   //
3118   // Similarly with locks. The first lock slot in the osr buffer is the nth lock
3119   // from the interpreter frame, the nth lock slot in the osr buffer is 0th lock
3120   // in the interpreter frame (the method lock if a sync method)
3121 
3122   // Initialize monitors in the compiled activation.
3123 
3124   int index;
3125   Value local;
3126 
3127   // find all the locals that the interpreter thinks contain live oops
3128   const ResourceBitMap live_oops = method()->live_local_oops_at_bci(osr_bci);
3129 
3130   // compute the offset into the locals so that we can treat the buffer
3131   // as if the locals were still in the interpreter frame
3132   int locals_offset = BytesPerWord * (method()->max_locals() - 1);
3133   for_each_local_value(state, index, local) {
3134     int offset = locals_offset - (index + local->type()->size() - 1) * BytesPerWord;
3135     Value get;
3136     if (local->type()->is_object_kind() && !live_oops.at(index)) {
3137       // The interpreter thinks this local is dead but the compiler
3138       // doesn't so pretend that the interpreter passed in null.
3139       get = append(new Constant(objectNull));
3140     } else {
3141       get = append(new UnsafeGetRaw(as_BasicType(local->type()), e,
3142                                     append(new Constant(new IntConstant(offset))),
3143                                     0,
3144                                     true /*unaligned*/, true /*wide*/));
3145     }
3146     _state->store_local(index, get);
3147   }
3148 
3149   // the storage for the OSR buffer is freed manually in the LIRGenerator.
3150 
3151   assert(state->caller_state() == NULL, "should be top scope");
3152   state->clear_locals();
3153   Goto* g = new Goto(target, false);
3154   append(g);
3155   _osr_entry->set_end(g);
3156   target->merge(_osr_entry->end()->state());
3157 
3158   scope_data()->set_stream(NULL);
3159 }
3160 
3161 
3162 ValueStack* GraphBuilder::state_at_entry() {
3163   ValueStack* state = new ValueStack(scope(), NULL);
3164 
3165   // Set up locals for receiver
3166   int idx = 0;
3167   if (!method()->is_static()) {
3168     // we should always see the receiver
3169     state->store_local(idx, new Local(method()->holder(), objectType, idx, true));
3170     idx = 1;
3171   }
3172 
3173   // Set up locals for incoming arguments
3174   ciSignature* sig = method()->signature();
3175   for (int i = 0; i < sig->count(); i++) {
3176     ciType* type = sig->type_at(i);
3177     BasicType basic_type = type->basic_type();
3178     // don't allow T_ARRAY to propagate into locals types
3179     if (basic_type == T_ARRAY) basic_type = T_OBJECT;
3180     ValueType* vt = as_ValueType(basic_type);
3181     state->store_local(idx, new Local(type, vt, idx, false));
3182     idx += type->size();
3183   }
3184 
3185   // lock synchronized method
3186   if (method()->is_synchronized()) {
3187     state->lock(NULL);
3188   }
3189 
3190   return state;
3191 }
3192 
3193 
3194 GraphBuilder::GraphBuilder(Compilation* compilation, IRScope* scope)
3195   : _scope_data(NULL)
3196   , _instruction_count(0)
3197   , _osr_entry(NULL)
3198   , _memory(new MemoryBuffer())
3199   , _compilation(compilation)
3200   , _inline_bailout_msg(NULL)
3201 {
3202   int osr_bci = compilation->osr_bci();
3203 
3204   // determine entry points and bci2block mapping
3205   BlockListBuilder blm(compilation, scope, osr_bci);
3206   CHECK_BAILOUT();
3207 
3208   BlockList* bci2block = blm.bci2block();
3209   BlockBegin* start_block = bci2block->at(0);
3210 
3211   push_root_scope(scope, bci2block, start_block);
3212 
3213   // setup state for std entry
3214   _initial_state = state_at_entry();
3215   start_block->merge(_initial_state);
3216 
3217   // complete graph
3218   _vmap        = new ValueMap();
3219   switch (scope->method()->intrinsic_id()) {
3220   case vmIntrinsics::_dabs          : // fall through
3221   case vmIntrinsics::_dsqrt         : // fall through
3222   case vmIntrinsics::_dsin          : // fall through
3223   case vmIntrinsics::_dcos          : // fall through
3224   case vmIntrinsics::_dtan          : // fall through
3225   case vmIntrinsics::_dlog          : // fall through
3226   case vmIntrinsics::_dlog10        : // fall through
3227   case vmIntrinsics::_dexp          : // fall through
3228   case vmIntrinsics::_dpow          : // fall through
3229     {
3230       // Compiles where the root method is an intrinsic need a special
3231       // compilation environment because the bytecodes for the method
3232       // shouldn't be parsed during the compilation, only the special
3233       // Intrinsic node should be emitted.  If this isn't done the the
3234       // code for the inlined version will be different than the root
3235       // compiled version which could lead to monotonicity problems on
3236       // intel.
3237       if (CheckIntrinsics && !scope->method()->intrinsic_candidate()) {
3238         BAILOUT("failed to inline intrinsic, method not annotated");
3239       }
3240 
3241       // Set up a stream so that appending instructions works properly.
3242       ciBytecodeStream s(scope->method());
3243       s.reset_to_bci(0);
3244       scope_data()->set_stream(&s);
3245       s.next();
3246 
3247       // setup the initial block state
3248       _block = start_block;
3249       _state = start_block->state()->copy_for_parsing();
3250       _last  = start_block;
3251       load_local(doubleType, 0);
3252       if (scope->method()->intrinsic_id() == vmIntrinsics::_dpow) {
3253         load_local(doubleType, 2);
3254       }
3255 
3256       // Emit the intrinsic node.
3257       bool result = try_inline_intrinsics(scope->method());
3258       if (!result) BAILOUT("failed to inline intrinsic");
3259       method_return(dpop());
3260 
3261       // connect the begin and end blocks and we're all done.
3262       BlockEnd* end = last()->as_BlockEnd();
3263       block()->set_end(end);
3264       break;
3265     }
3266 
3267   case vmIntrinsics::_Reference_get:
3268     {
3269       {
3270         // With java.lang.ref.reference.get() we must go through the
3271         // intrinsic - when G1 is enabled - even when get() is the root
3272         // method of the compile so that, if necessary, the value in
3273         // the referent field of the reference object gets recorded by
3274         // the pre-barrier code.
3275         // Specifically, if G1 is enabled, the value in the referent
3276         // field is recorded by the G1 SATB pre barrier. This will
3277         // result in the referent being marked live and the reference
3278         // object removed from the list of discovered references during
3279         // reference processing.
3280         if (CheckIntrinsics && !scope->method()->intrinsic_candidate()) {
3281           BAILOUT("failed to inline intrinsic, method not annotated");
3282         }
3283 
3284         // Also we need intrinsic to prevent commoning reads from this field
3285         // across safepoint since GC can change its value.
3286 
3287         // Set up a stream so that appending instructions works properly.
3288         ciBytecodeStream s(scope->method());
3289         s.reset_to_bci(0);
3290         scope_data()->set_stream(&s);
3291         s.next();
3292 
3293         // setup the initial block state
3294         _block = start_block;
3295         _state = start_block->state()->copy_for_parsing();
3296         _last  = start_block;
3297         load_local(objectType, 0);
3298 
3299         // Emit the intrinsic node.
3300         bool result = try_inline_intrinsics(scope->method());
3301         if (!result) BAILOUT("failed to inline intrinsic");
3302         method_return(apop());
3303 
3304         // connect the begin and end blocks and we're all done.
3305         BlockEnd* end = last()->as_BlockEnd();
3306         block()->set_end(end);
3307         break;
3308       }
3309       // Otherwise, fall thru
3310     }
3311 
3312   default:
3313     scope_data()->add_to_work_list(start_block);
3314     iterate_all_blocks();
3315     break;
3316   }
3317   CHECK_BAILOUT();
3318 
3319   _start = setup_start_block(osr_bci, start_block, _osr_entry, _initial_state);
3320 
3321   eliminate_redundant_phis(_start);
3322 
3323   NOT_PRODUCT(if (PrintValueNumbering && Verbose) print_stats());
3324   // for osr compile, bailout if some requirements are not fulfilled
3325   if (osr_bci != -1) {
3326     BlockBegin* osr_block = blm.bci2block()->at(osr_bci);
3327     if (!osr_block->is_set(BlockBegin::was_visited_flag)) {
3328       BAILOUT("osr entry must have been visited for osr compile");
3329     }
3330 
3331     // check if osr entry point has empty stack - we cannot handle non-empty stacks at osr entry points
3332     if (!osr_block->state()->stack_is_empty()) {
3333       BAILOUT("stack not empty at OSR entry point");
3334     }
3335   }
3336 #ifndef PRODUCT
3337   if (PrintCompilation && Verbose) tty->print_cr("Created %d Instructions", _instruction_count);
3338 #endif
3339 }
3340 
3341 
3342 ValueStack* GraphBuilder::copy_state_before() {
3343   return copy_state_before_with_bci(bci());
3344 }
3345 
3346 ValueStack* GraphBuilder::copy_state_exhandling() {
3347   return copy_state_exhandling_with_bci(bci());
3348 }
3349 
3350 ValueStack* GraphBuilder::copy_state_for_exception() {
3351   return copy_state_for_exception_with_bci(bci());
3352 }
3353 
3354 ValueStack* GraphBuilder::copy_state_before_with_bci(int bci) {
3355   return state()->copy(ValueStack::StateBefore, bci);
3356 }
3357 
3358 ValueStack* GraphBuilder::copy_state_exhandling_with_bci(int bci) {
3359   if (!has_handler()) return NULL;
3360   return state()->copy(ValueStack::StateBefore, bci);
3361 }
3362 
3363 ValueStack* GraphBuilder::copy_state_for_exception_with_bci(int bci) {
3364   ValueStack* s = copy_state_exhandling_with_bci(bci);
3365   if (s == NULL) {
3366     if (_compilation->env()->should_retain_local_variables()) {
3367       s = state()->copy(ValueStack::ExceptionState, bci);
3368     } else {
3369       s = state()->copy(ValueStack::EmptyExceptionState, bci);
3370     }
3371   }
3372   return s;
3373 }
3374 
3375 int GraphBuilder::recursive_inline_level(ciMethod* cur_callee) const {
3376   int recur_level = 0;
3377   for (IRScope* s = scope(); s != NULL; s = s->caller()) {
3378     if (s->method() == cur_callee) {
3379       ++recur_level;
3380     }
3381   }
3382   return recur_level;
3383 }
3384 
3385 
3386 bool GraphBuilder::try_inline(ciMethod* callee, bool holder_known, bool ignore_return, Bytecodes::Code bc, Value receiver) {
3387   const char* msg = NULL;
3388 
3389   // clear out any existing inline bailout condition
3390   clear_inline_bailout();
3391 
3392   // exclude methods we don't want to inline
3393   msg = should_not_inline(callee);
3394   if (msg != NULL) {
3395     print_inlining(callee, msg, /*success*/ false);
3396     return false;
3397   }
3398 
3399   // method handle invokes
3400   if (callee->is_method_handle_intrinsic()) {
3401     if (try_method_handle_inline(callee, ignore_return)) {
3402       if (callee->has_reserved_stack_access()) {
3403         compilation()->set_has_reserved_stack_access(true);
3404       }
3405       return true;
3406     }
3407     return false;
3408   }
3409 
3410   // handle intrinsics
3411   if (callee->intrinsic_id() != vmIntrinsics::_none &&
3412       (CheckIntrinsics ? callee->intrinsic_candidate() : true)) {
3413     if (try_inline_intrinsics(callee, ignore_return)) {
3414       print_inlining(callee, "intrinsic");
3415       if (callee->has_reserved_stack_access()) {
3416         compilation()->set_has_reserved_stack_access(true);
3417       }
3418       return true;
3419     }
3420     // try normal inlining
3421   }
3422 
3423   // certain methods cannot be parsed at all
3424   msg = check_can_parse(callee);
3425   if (msg != NULL) {
3426     print_inlining(callee, msg, /*success*/ false);
3427     return false;
3428   }
3429 
3430   // If bytecode not set use the current one.
3431   if (bc == Bytecodes::_illegal) {
3432     bc = code();
3433   }
3434   if (try_inline_full(callee, holder_known, ignore_return, bc, receiver)) {
3435     if (callee->has_reserved_stack_access()) {
3436       compilation()->set_has_reserved_stack_access(true);
3437     }
3438     return true;
3439   }
3440 
3441   // Entire compilation could fail during try_inline_full call.
3442   // In that case printing inlining decision info is useless.
3443   if (!bailed_out())
3444     print_inlining(callee, _inline_bailout_msg, /*success*/ false);
3445 
3446   return false;
3447 }
3448 
3449 
3450 const char* GraphBuilder::check_can_parse(ciMethod* callee) const {
3451   // Certain methods cannot be parsed at all:
3452   if ( callee->is_native())            return "native method";
3453   if ( callee->is_abstract())          return "abstract method";
3454   if (!callee->can_be_compiled())      return "not compilable (disabled)";
3455   if (!callee->can_be_parsed())        return "cannot be parsed";
3456   return NULL;
3457 }
3458 
3459 // negative filter: should callee NOT be inlined?  returns NULL, ok to inline, or rejection msg
3460 const char* GraphBuilder::should_not_inline(ciMethod* callee) const {
3461   if ( compilation()->directive()->should_not_inline(callee)) return "disallowed by CompileCommand";
3462   if ( callee->dont_inline())          return "don't inline by annotation";
3463   return NULL;
3464 }
3465 
3466 void GraphBuilder::build_graph_for_intrinsic(ciMethod* callee, bool ignore_return) {
3467   vmIntrinsics::ID id = callee->intrinsic_id();
3468   assert(id != vmIntrinsics::_none, "must be a VM intrinsic");
3469 
3470   // Some intrinsics need special IR nodes.
3471   switch(id) {
3472   case vmIntrinsics::_getObject          : append_unsafe_get_obj(callee, T_OBJECT,  false); return;
3473   case vmIntrinsics::_getBoolean         : append_unsafe_get_obj(callee, T_BOOLEAN, false); return;
3474   case vmIntrinsics::_getByte            : append_unsafe_get_obj(callee, T_BYTE,    false); return;
3475   case vmIntrinsics::_getShort           : append_unsafe_get_obj(callee, T_SHORT,   false); return;
3476   case vmIntrinsics::_getChar            : append_unsafe_get_obj(callee, T_CHAR,    false); return;
3477   case vmIntrinsics::_getInt             : append_unsafe_get_obj(callee, T_INT,     false); return;
3478   case vmIntrinsics::_getLong            : append_unsafe_get_obj(callee, T_LONG,    false); return;
3479   case vmIntrinsics::_getFloat           : append_unsafe_get_obj(callee, T_FLOAT,   false); return;
3480   case vmIntrinsics::_getDouble          : append_unsafe_get_obj(callee, T_DOUBLE,  false); return;
3481   case vmIntrinsics::_putObject          : append_unsafe_put_obj(callee, T_OBJECT,  false); return;
3482   case vmIntrinsics::_putBoolean         : append_unsafe_put_obj(callee, T_BOOLEAN, false); return;
3483   case vmIntrinsics::_putByte            : append_unsafe_put_obj(callee, T_BYTE,    false); return;
3484   case vmIntrinsics::_putShort           : append_unsafe_put_obj(callee, T_SHORT,   false); return;
3485   case vmIntrinsics::_putChar            : append_unsafe_put_obj(callee, T_CHAR,    false); return;
3486   case vmIntrinsics::_putInt             : append_unsafe_put_obj(callee, T_INT,     false); return;
3487   case vmIntrinsics::_putLong            : append_unsafe_put_obj(callee, T_LONG,    false); return;
3488   case vmIntrinsics::_putFloat           : append_unsafe_put_obj(callee, T_FLOAT,   false); return;
3489   case vmIntrinsics::_putDouble          : append_unsafe_put_obj(callee, T_DOUBLE,  false); return;
3490   case vmIntrinsics::_getShortUnaligned  : append_unsafe_get_obj(callee, T_SHORT,   false); return;
3491   case vmIntrinsics::_getCharUnaligned   : append_unsafe_get_obj(callee, T_CHAR,    false); return;
3492   case vmIntrinsics::_getIntUnaligned    : append_unsafe_get_obj(callee, T_INT,     false); return;
3493   case vmIntrinsics::_getLongUnaligned   : append_unsafe_get_obj(callee, T_LONG,    false); return;
3494   case vmIntrinsics::_putShortUnaligned  : append_unsafe_put_obj(callee, T_SHORT,   false); return;
3495   case vmIntrinsics::_putCharUnaligned   : append_unsafe_put_obj(callee, T_CHAR,    false); return;
3496   case vmIntrinsics::_putIntUnaligned    : append_unsafe_put_obj(callee, T_INT,     false); return;
3497   case vmIntrinsics::_putLongUnaligned   : append_unsafe_put_obj(callee, T_LONG,    false); return;
3498   case vmIntrinsics::_getObjectVolatile  : append_unsafe_get_obj(callee, T_OBJECT,  true); return;
3499   case vmIntrinsics::_getBooleanVolatile : append_unsafe_get_obj(callee, T_BOOLEAN, true); return;
3500   case vmIntrinsics::_getByteVolatile    : append_unsafe_get_obj(callee, T_BYTE,    true); return;
3501   case vmIntrinsics::_getShortVolatile   : append_unsafe_get_obj(callee, T_SHORT,   true); return;
3502   case vmIntrinsics::_getCharVolatile    : append_unsafe_get_obj(callee, T_CHAR,    true); return;
3503   case vmIntrinsics::_getIntVolatile     : append_unsafe_get_obj(callee, T_INT,     true); return;
3504   case vmIntrinsics::_getLongVolatile    : append_unsafe_get_obj(callee, T_LONG,    true); return;
3505   case vmIntrinsics::_getFloatVolatile   : append_unsafe_get_obj(callee, T_FLOAT,   true); return;
3506   case vmIntrinsics::_getDoubleVolatile  : append_unsafe_get_obj(callee, T_DOUBLE,  true); return;
3507   case vmIntrinsics::_putObjectVolatile  : append_unsafe_put_obj(callee, T_OBJECT,  true); return;
3508   case vmIntrinsics::_putBooleanVolatile : append_unsafe_put_obj(callee, T_BOOLEAN, true); return;
3509   case vmIntrinsics::_putByteVolatile    : append_unsafe_put_obj(callee, T_BYTE,    true); return;
3510   case vmIntrinsics::_putShortVolatile   : append_unsafe_put_obj(callee, T_SHORT,   true); return;
3511   case vmIntrinsics::_putCharVolatile    : append_unsafe_put_obj(callee, T_CHAR,    true); return;
3512   case vmIntrinsics::_putIntVolatile     : append_unsafe_put_obj(callee, T_INT,     true); return;
3513   case vmIntrinsics::_putLongVolatile    : append_unsafe_put_obj(callee, T_LONG,    true); return;
3514   case vmIntrinsics::_putFloatVolatile   : append_unsafe_put_obj(callee, T_FLOAT,   true); return;
3515   case vmIntrinsics::_putDoubleVolatile  : append_unsafe_put_obj(callee, T_DOUBLE,  true); return;
3516   case vmIntrinsics::_compareAndSetLong:
3517   case vmIntrinsics::_compareAndSetInt:
3518   case vmIntrinsics::_compareAndSetObject: append_unsafe_CAS(callee); return;
3519   case vmIntrinsics::_getAndAddInt:
3520   case vmIntrinsics::_getAndAddLong      : append_unsafe_get_and_set_obj(callee, true); return;
3521   case vmIntrinsics::_getAndSetInt       :
3522   case vmIntrinsics::_getAndSetLong      :
3523   case vmIntrinsics::_getAndSetObject    : append_unsafe_get_and_set_obj(callee, false); return;
3524   case vmIntrinsics::_getCharStringU     : append_char_access(callee, false); return;
3525   case vmIntrinsics::_putCharStringU     : append_char_access(callee, true); return;
3526   default:
3527     break;
3528   }
3529 
3530   // create intrinsic node
3531   const bool has_receiver = !callee->is_static();
3532   ValueType* result_type = as_ValueType(callee->return_type());
3533   ValueStack* state_before = copy_state_for_exception();
3534 
3535   Values* args = state()->pop_arguments(callee->arg_size());
3536 
3537   if (is_profiling()) {
3538     // Don't profile in the special case where the root method
3539     // is the intrinsic
3540     if (callee != method()) {
3541       // Note that we'd collect profile data in this method if we wanted it.
3542       compilation()->set_would_profile(true);
3543       if (profile_calls()) {
3544         Value recv = NULL;
3545         if (has_receiver) {
3546           recv = args->at(0);
3547           null_check(recv);
3548         }
3549         profile_call(callee, recv, NULL, collect_args_for_profiling(args, callee, true), true);
3550       }
3551     }
3552   }
3553 
3554   Intrinsic* result = new Intrinsic(result_type, callee->intrinsic_id(),
3555                                     args, has_receiver, state_before,
3556                                     vmIntrinsics::preserves_state(id),
3557                                     vmIntrinsics::can_trap(id));
3558   // append instruction & push result
3559   Value value = append_split(result);
3560   if (result_type != voidType && !ignore_return) {
3561     push(result_type, value);
3562   }
3563 
3564   if (callee != method() && profile_return() && result_type->is_object_kind()) {
3565     profile_return_type(result, callee);
3566   }
3567 }
3568 
3569 bool GraphBuilder::try_inline_intrinsics(ciMethod* callee, bool ignore_return) {
3570   // Not a trivial method because C2 may do intrinsics better.
3571   compilation()->set_would_profile(true);
3572 
3573   // For calling is_intrinsic_available we need to transition to
3574   // the '_thread_in_vm' state because is_intrinsic_available()
3575   // accesses critical VM-internal data.
3576   bool is_available = false;
3577   {
3578     VM_ENTRY_MARK;
3579     methodHandle mh(THREAD, callee->get_Method());
3580     is_available = _compilation->compiler()->is_intrinsic_available(mh, _compilation->directive());
3581   }
3582 
3583   if (!is_available) {
3584     if (!InlineNatives) {
3585       // Return false and also set message that the inlining of
3586       // intrinsics has been disabled in general.
3587       INLINE_BAILOUT("intrinsic method inlining disabled");
3588     } else {
3589       return false;
3590     }
3591   }
3592   build_graph_for_intrinsic(callee, ignore_return);
3593   return true;
3594 }
3595 
3596 
3597 bool GraphBuilder::try_inline_jsr(int jsr_dest_bci) {
3598   // Introduce a new callee continuation point - all Ret instructions
3599   // will be replaced with Gotos to this point.
3600   BlockBegin* cont = block_at(next_bci());
3601   assert(cont != NULL, "continuation must exist (BlockListBuilder starts a new block after a jsr");
3602 
3603   // Note: can not assign state to continuation yet, as we have to
3604   // pick up the state from the Ret instructions.
3605 
3606   // Push callee scope
3607   push_scope_for_jsr(cont, jsr_dest_bci);
3608 
3609   // Temporarily set up bytecode stream so we can append instructions
3610   // (only using the bci of this stream)
3611   scope_data()->set_stream(scope_data()->parent()->stream());
3612 
3613   BlockBegin* jsr_start_block = block_at(jsr_dest_bci);
3614   assert(jsr_start_block != NULL, "jsr start block must exist");
3615   assert(!jsr_start_block->is_set(BlockBegin::was_visited_flag), "should not have visited jsr yet");
3616   Goto* goto_sub = new Goto(jsr_start_block, false);
3617   // Must copy state to avoid wrong sharing when parsing bytecodes
3618   assert(jsr_start_block->state() == NULL, "should have fresh jsr starting block");
3619   jsr_start_block->set_state(copy_state_before_with_bci(jsr_dest_bci));
3620   append(goto_sub);
3621   _block->set_end(goto_sub);
3622   _last = _block = jsr_start_block;
3623 
3624   // Clear out bytecode stream
3625   scope_data()->set_stream(NULL);
3626 
3627   scope_data()->add_to_work_list(jsr_start_block);
3628 
3629   // Ready to resume parsing in subroutine
3630   iterate_all_blocks();
3631 
3632   // If we bailed out during parsing, return immediately (this is bad news)
3633   CHECK_BAILOUT_(false);
3634 
3635   // Detect whether the continuation can actually be reached. If not,
3636   // it has not had state set by the join() operations in
3637   // iterate_bytecodes_for_block()/ret() and we should not touch the
3638   // iteration state. The calling activation of
3639   // iterate_bytecodes_for_block will then complete normally.
3640   if (cont->state() != NULL) {
3641     if (!cont->is_set(BlockBegin::was_visited_flag)) {
3642       // add continuation to work list instead of parsing it immediately
3643       scope_data()->parent()->add_to_work_list(cont);
3644     }
3645   }
3646 
3647   assert(jsr_continuation() == cont, "continuation must not have changed");
3648   assert(!jsr_continuation()->is_set(BlockBegin::was_visited_flag) ||
3649          jsr_continuation()->is_set(BlockBegin::parser_loop_header_flag),
3650          "continuation can only be visited in case of backward branches");
3651   assert(_last && _last->as_BlockEnd(), "block must have end");
3652 
3653   // continuation is in work list, so end iteration of current block
3654   _skip_block = true;
3655   pop_scope_for_jsr();
3656 
3657   return true;
3658 }
3659 
3660 
3661 // Inline the entry of a synchronized method as a monitor enter and
3662 // register the exception handler which releases the monitor if an
3663 // exception is thrown within the callee. Note that the monitor enter
3664 // cannot throw an exception itself, because the receiver is
3665 // guaranteed to be non-null by the explicit null check at the
3666 // beginning of inlining.
3667 void GraphBuilder::inline_sync_entry(Value lock, BlockBegin* sync_handler) {
3668   assert(lock != NULL && sync_handler != NULL, "lock or handler missing");
3669 
3670   monitorenter(lock, SynchronizationEntryBCI);
3671   assert(_last->as_MonitorEnter() != NULL, "monitor enter expected");
3672   _last->set_needs_null_check(false);
3673 
3674   sync_handler->set(BlockBegin::exception_entry_flag);
3675   sync_handler->set(BlockBegin::is_on_work_list_flag);
3676 
3677   ciExceptionHandler* desc = new ciExceptionHandler(method()->holder(), 0, method()->code_size(), -1, 0);
3678   XHandler* h = new XHandler(desc);
3679   h->set_entry_block(sync_handler);
3680   scope_data()->xhandlers()->append(h);
3681   scope_data()->set_has_handler();
3682 }
3683 
3684 
3685 // If an exception is thrown and not handled within an inlined
3686 // synchronized method, the monitor must be released before the
3687 // exception is rethrown in the outer scope. Generate the appropriate
3688 // instructions here.
3689 void GraphBuilder::fill_sync_handler(Value lock, BlockBegin* sync_handler, bool default_handler) {
3690   BlockBegin* orig_block = _block;
3691   ValueStack* orig_state = _state;
3692   Instruction* orig_last = _last;
3693   _last = _block = sync_handler;
3694   _state = sync_handler->state()->copy();
3695 
3696   assert(sync_handler != NULL, "handler missing");
3697   assert(!sync_handler->is_set(BlockBegin::was_visited_flag), "is visited here");
3698 
3699   assert(lock != NULL || default_handler, "lock or handler missing");
3700 
3701   XHandler* h = scope_data()->xhandlers()->remove_last();
3702   assert(h->entry_block() == sync_handler, "corrupt list of handlers");
3703 
3704   block()->set(BlockBegin::was_visited_flag);
3705   Value exception = append_with_bci(new ExceptionObject(), SynchronizationEntryBCI);
3706   assert(exception->is_pinned(), "must be");
3707 
3708   int bci = SynchronizationEntryBCI;
3709   if (compilation()->env()->dtrace_method_probes()) {
3710     // Report exit from inline methods.  We don't have a stream here
3711     // so pass an explicit bci of SynchronizationEntryBCI.
3712     Values* args = new Values(1);
3713     args->push(append_with_bci(new Constant(new MethodConstant(method())), bci));
3714     append_with_bci(new RuntimeCall(voidType, "dtrace_method_exit", CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_method_exit), args), bci);
3715   }
3716 
3717   if (lock) {
3718     assert(state()->locks_size() > 0 && state()->lock_at(state()->locks_size() - 1) == lock, "lock is missing");
3719     if (!lock->is_linked()) {
3720       lock = append_with_bci(lock, bci);
3721     }
3722 
3723     // exit the monitor in the context of the synchronized method
3724     monitorexit(lock, bci);
3725 
3726     // exit the context of the synchronized method
3727     if (!default_handler) {
3728       pop_scope();
3729       bci = _state->caller_state()->bci();
3730       _state = _state->caller_state()->copy_for_parsing();
3731     }
3732   }
3733 
3734   // perform the throw as if at the the call site
3735   apush(exception);
3736   throw_op(bci);
3737 
3738   BlockEnd* end = last()->as_BlockEnd();
3739   block()->set_end(end);
3740 
3741   _block = orig_block;
3742   _state = orig_state;
3743   _last = orig_last;
3744 }
3745 
3746 
3747 bool GraphBuilder::try_inline_full(ciMethod* callee, bool holder_known, bool ignore_return, Bytecodes::Code bc, Value receiver) {
3748   assert(!callee->is_native(), "callee must not be native");
3749   if (CompilationPolicy::policy()->should_not_inline(compilation()->env(), callee)) {
3750     INLINE_BAILOUT("inlining prohibited by policy");
3751   }
3752   // first perform tests of things it's not possible to inline
3753   if (callee->has_exception_handlers() &&
3754       !InlineMethodsWithExceptionHandlers) INLINE_BAILOUT("callee has exception handlers");
3755   if (callee->is_synchronized() &&
3756       !InlineSynchronizedMethods         ) INLINE_BAILOUT("callee is synchronized");
3757   if (!callee->holder()->is_initialized()) INLINE_BAILOUT("callee's klass not initialized yet");
3758   if (!callee->has_balanced_monitors())    INLINE_BAILOUT("callee's monitors do not match");
3759 
3760   // Proper inlining of methods with jsrs requires a little more work.
3761   if (callee->has_jsrs()                 ) INLINE_BAILOUT("jsrs not handled properly by inliner yet");
3762 
3763   // When SSE2 is used on intel, then no special handling is needed
3764   // for strictfp because the enum-constant is fixed at compile time,
3765   // the check for UseSSE2 is needed here
3766   if (strict_fp_requires_explicit_rounding && UseSSE < 2 && method()->is_strict() != callee->is_strict()) {
3767     INLINE_BAILOUT("caller and callee have different strict fp requirements");
3768   }
3769 
3770   if (is_profiling() && !callee->ensure_method_data()) {
3771     INLINE_BAILOUT("mdo allocation failed");
3772   }
3773 
3774   // now perform tests that are based on flag settings
3775   bool inlinee_by_directive = compilation()->directive()->should_inline(callee);
3776   if (callee->force_inline() || inlinee_by_directive) {
3777     if (inline_level() > MaxForceInlineLevel                    ) INLINE_BAILOUT("MaxForceInlineLevel");
3778     if (recursive_inline_level(callee) > MaxRecursiveInlineLevel) INLINE_BAILOUT("recursive inlining too deep");
3779 
3780     const char* msg = "";
3781     if (callee->force_inline())  msg = "force inline by annotation";
3782     if (inlinee_by_directive)    msg = "force inline by CompileCommand";
3783     print_inlining(callee, msg);
3784   } else {
3785     // use heuristic controls on inlining
3786     if (inline_level() > MaxInlineLevel                         ) INLINE_BAILOUT("inlining too deep");
3787     if (recursive_inline_level(callee) > MaxRecursiveInlineLevel) INLINE_BAILOUT("recursive inlining too deep");
3788     if (callee->code_size_for_inlining() > max_inline_size()    ) INLINE_BAILOUT("callee is too large");
3789 
3790     // don't inline throwable methods unless the inlining tree is rooted in a throwable class
3791     if (callee->name() == ciSymbol::object_initializer_name() &&
3792         callee->holder()->is_subclass_of(ciEnv::current()->Throwable_klass())) {
3793       // Throwable constructor call
3794       IRScope* top = scope();
3795       while (top->caller() != NULL) {
3796         top = top->caller();
3797       }
3798       if (!top->method()->holder()->is_subclass_of(ciEnv::current()->Throwable_klass())) {
3799         INLINE_BAILOUT("don't inline Throwable constructors");
3800       }
3801     }
3802 
3803     if (compilation()->env()->num_inlined_bytecodes() > DesiredMethodLimit) {
3804       INLINE_BAILOUT("total inlining greater than DesiredMethodLimit");
3805     }
3806     // printing
3807     print_inlining(callee);
3808   }
3809 
3810   // NOTE: Bailouts from this point on, which occur at the
3811   // GraphBuilder level, do not cause bailout just of the inlining but
3812   // in fact of the entire compilation.
3813 
3814   BlockBegin* orig_block = block();
3815 
3816   const bool is_invokedynamic = bc == Bytecodes::_invokedynamic;
3817   const bool has_receiver = (bc != Bytecodes::_invokestatic && !is_invokedynamic);
3818 
3819   const int args_base = state()->stack_size() - callee->arg_size();
3820   assert(args_base >= 0, "stack underflow during inlining");
3821 
3822   // Insert null check if necessary
3823   Value recv = NULL;
3824   if (has_receiver) {
3825     // note: null check must happen even if first instruction of callee does
3826     //       an implicit null check since the callee is in a different scope
3827     //       and we must make sure exception handling does the right thing
3828     assert(!callee->is_static(), "callee must not be static");
3829     assert(callee->arg_size() > 0, "must have at least a receiver");
3830     recv = state()->stack_at(args_base);
3831     null_check(recv);
3832   }
3833 
3834   if (is_profiling()) {
3835     // Note that we'd collect profile data in this method if we wanted it.
3836     // this may be redundant here...
3837     compilation()->set_would_profile(true);
3838 
3839     if (profile_calls()) {
3840       int start = 0;
3841       Values* obj_args = args_list_for_profiling(callee, start, has_receiver);
3842       if (obj_args != NULL) {
3843         int s = obj_args->max_length();
3844         // if called through method handle invoke, some arguments may have been popped
3845         for (int i = args_base+start, j = 0; j < obj_args->max_length() && i < state()->stack_size(); ) {
3846           Value v = state()->stack_at_inc(i);
3847           if (v->type()->is_object_kind()) {
3848             obj_args->push(v);
3849             j++;
3850           }
3851         }
3852         check_args_for_profiling(obj_args, s);
3853       }
3854       profile_call(callee, recv, holder_known ? callee->holder() : NULL, obj_args, true);
3855     }
3856   }
3857 
3858   // Introduce a new callee continuation point - if the callee has
3859   // more than one return instruction or the return does not allow
3860   // fall-through of control flow, all return instructions of the
3861   // callee will need to be replaced by Goto's pointing to this
3862   // continuation point.
3863   BlockBegin* cont = block_at(next_bci());
3864   bool continuation_existed = true;
3865   if (cont == NULL) {
3866     cont = new BlockBegin(next_bci());
3867     // low number so that continuation gets parsed as early as possible
3868     cont->set_depth_first_number(0);
3869     if (PrintInitialBlockList) {
3870       tty->print_cr("CFG: created block %d (bci %d) as continuation for inline at bci %d",
3871                     cont->block_id(), cont->bci(), bci());
3872     }
3873     continuation_existed = false;
3874   }
3875   // Record number of predecessors of continuation block before
3876   // inlining, to detect if inlined method has edges to its
3877   // continuation after inlining.
3878   int continuation_preds = cont->number_of_preds();
3879 
3880   // Push callee scope
3881   push_scope(callee, cont);
3882 
3883   // the BlockListBuilder for the callee could have bailed out
3884   if (bailed_out())
3885       return false;
3886 
3887   // Temporarily set up bytecode stream so we can append instructions
3888   // (only using the bci of this stream)
3889   scope_data()->set_stream(scope_data()->parent()->stream());
3890 
3891   // Pass parameters into callee state: add assignments
3892   // note: this will also ensure that all arguments are computed before being passed
3893   ValueStack* callee_state = state();
3894   ValueStack* caller_state = state()->caller_state();
3895   for (int i = args_base; i < caller_state->stack_size(); ) {
3896     const int arg_no = i - args_base;
3897     Value arg = caller_state->stack_at_inc(i);
3898     store_local(callee_state, arg, arg_no);
3899   }
3900 
3901   // Remove args from stack.
3902   // Note that we preserve locals state in case we can use it later
3903   // (see use of pop_scope() below)
3904   caller_state->truncate_stack(args_base);
3905   assert(callee_state->stack_size() == 0, "callee stack must be empty");
3906 
3907   Value lock = NULL;
3908   BlockBegin* sync_handler = NULL;
3909 
3910   // Inline the locking of the receiver if the callee is synchronized
3911   if (callee->is_synchronized()) {
3912     lock = callee->is_static() ? append(new Constant(new InstanceConstant(callee->holder()->java_mirror())))
3913                                : state()->local_at(0);
3914     sync_handler = new BlockBegin(SynchronizationEntryBCI);
3915     inline_sync_entry(lock, sync_handler);
3916   }
3917 
3918   if (compilation()->env()->dtrace_method_probes()) {
3919     Values* args = new Values(1);
3920     args->push(append(new Constant(new MethodConstant(method()))));
3921     append(new RuntimeCall(voidType, "dtrace_method_entry", CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_method_entry), args));
3922   }
3923 
3924   if (profile_inlined_calls()) {
3925     profile_invocation(callee, copy_state_before_with_bci(SynchronizationEntryBCI));
3926   }
3927 
3928   BlockBegin* callee_start_block = block_at(0);
3929   if (callee_start_block != NULL) {
3930     assert(callee_start_block->is_set(BlockBegin::parser_loop_header_flag), "must be loop header");
3931     Goto* goto_callee = new Goto(callee_start_block, false);
3932     // The state for this goto is in the scope of the callee, so use
3933     // the entry bci for the callee instead of the call site bci.
3934     append_with_bci(goto_callee, 0);
3935     _block->set_end(goto_callee);
3936     callee_start_block->merge(callee_state);
3937 
3938     _last = _block = callee_start_block;
3939 
3940     scope_data()->add_to_work_list(callee_start_block);
3941   }
3942 
3943   // Clear out bytecode stream
3944   scope_data()->set_stream(NULL);
3945   scope_data()->set_ignore_return(ignore_return);
3946 
3947   CompileLog* log = compilation()->log();
3948   if (log != NULL) log->head("parse method='%d'", log->identify(callee));
3949 
3950   // Ready to resume parsing in callee (either in the same block we
3951   // were in before or in the callee's start block)
3952   iterate_all_blocks(callee_start_block == NULL);
3953 
3954   if (log != NULL) log->done("parse");
3955 
3956   // If we bailed out during parsing, return immediately (this is bad news)
3957   if (bailed_out())
3958       return false;
3959 
3960   // iterate_all_blocks theoretically traverses in random order; in
3961   // practice, we have only traversed the continuation if we are
3962   // inlining into a subroutine
3963   assert(continuation_existed ||
3964          !continuation()->is_set(BlockBegin::was_visited_flag),
3965          "continuation should not have been parsed yet if we created it");
3966 
3967   // At this point we are almost ready to return and resume parsing of
3968   // the caller back in the GraphBuilder. The only thing we want to do
3969   // first is an optimization: during parsing of the callee we
3970   // generated at least one Goto to the continuation block. If we
3971   // generated exactly one, and if the inlined method spanned exactly
3972   // one block (and we didn't have to Goto its entry), then we snip
3973   // off the Goto to the continuation, allowing control to fall
3974   // through back into the caller block and effectively performing
3975   // block merging. This allows load elimination and CSE to take place
3976   // across multiple callee scopes if they are relatively simple, and
3977   // is currently essential to making inlining profitable.
3978   if (num_returns() == 1
3979       && block() == orig_block
3980       && block() == inline_cleanup_block()) {
3981     _last  = inline_cleanup_return_prev();
3982     _state = inline_cleanup_state();
3983   } else if (continuation_preds == cont->number_of_preds()) {
3984     // Inlining caused that the instructions after the invoke in the
3985     // caller are not reachable any more. So skip filling this block
3986     // with instructions!
3987     assert(cont == continuation(), "");
3988     assert(_last && _last->as_BlockEnd(), "");
3989     _skip_block = true;
3990   } else {
3991     // Resume parsing in continuation block unless it was already parsed.
3992     // Note that if we don't change _last here, iteration in
3993     // iterate_bytecodes_for_block will stop when we return.
3994     if (!continuation()->is_set(BlockBegin::was_visited_flag)) {
3995       // add continuation to work list instead of parsing it immediately
3996       assert(_last && _last->as_BlockEnd(), "");
3997       scope_data()->parent()->add_to_work_list(continuation());
3998       _skip_block = true;
3999     }
4000   }
4001 
4002   // Fill the exception handler for synchronized methods with instructions
4003   if (callee->is_synchronized() && sync_handler->state() != NULL) {
4004     fill_sync_handler(lock, sync_handler);
4005   } else {
4006     pop_scope();
4007   }
4008 
4009   compilation()->notice_inlined_method(callee);
4010 
4011   return true;
4012 }
4013 
4014 
4015 bool GraphBuilder::try_method_handle_inline(ciMethod* callee, bool ignore_return) {
4016   ValueStack* state_before = copy_state_before();
4017   vmIntrinsics::ID iid = callee->intrinsic_id();
4018   switch (iid) {
4019   case vmIntrinsics::_invokeBasic:
4020     {
4021       // get MethodHandle receiver
4022       const int args_base = state()->stack_size() - callee->arg_size();
4023       ValueType* type = state()->stack_at(args_base)->type();
4024       if (type->is_constant()) {
4025         ciMethod* target = type->as_ObjectType()->constant_value()->as_method_handle()->get_vmtarget();
4026         // We don't do CHA here so only inline static and statically bindable methods.
4027         if (target->is_static() || target->can_be_statically_bound()) {
4028           if (ciMethod::is_consistent_info(callee, target)) {
4029             Bytecodes::Code bc = target->is_static() ? Bytecodes::_invokestatic : Bytecodes::_invokevirtual;
4030             ignore_return = ignore_return || (callee->return_type()->is_void() && !target->return_type()->is_void());
4031             if (try_inline(target, /*holder_known*/ true, ignore_return, bc)) {
4032               return true;
4033             }
4034           } else {
4035             print_inlining(target, "signatures mismatch", /*success*/ false);
4036           }
4037         } else {
4038           print_inlining(target, "not static or statically bindable", /*success*/ false);
4039         }
4040       } else {
4041         print_inlining(callee, "receiver not constant", /*success*/ false);
4042       }
4043     }
4044     break;
4045 
4046   case vmIntrinsics::_linkToVirtual:
4047   case vmIntrinsics::_linkToStatic:
4048   case vmIntrinsics::_linkToSpecial:
4049   case vmIntrinsics::_linkToInterface:
4050     {
4051       // pop MemberName argument
4052       const int args_base = state()->stack_size() - callee->arg_size();
4053       ValueType* type = apop()->type();
4054       if (type->is_constant()) {
4055         ciMethod* target = type->as_ObjectType()->constant_value()->as_member_name()->get_vmtarget();
4056         ignore_return = ignore_return || (callee->return_type()->is_void() && !target->return_type()->is_void());
4057         // If the target is another method handle invoke, try to recursively get
4058         // a better target.
4059         if (target->is_method_handle_intrinsic()) {
4060           if (try_method_handle_inline(target, ignore_return)) {
4061             return true;
4062           }
4063         } else if (!ciMethod::is_consistent_info(callee, target)) {
4064           print_inlining(target, "signatures mismatch", /*success*/ false);
4065         } else {
4066           ciSignature* signature = target->signature();
4067           const int receiver_skip = target->is_static() ? 0 : 1;
4068           // Cast receiver to its type.
4069           if (!target->is_static()) {
4070             ciKlass* tk = signature->accessing_klass();
4071             Value obj = state()->stack_at(args_base);
4072             if (obj->exact_type() == NULL &&
4073                 obj->declared_type() != tk && tk != compilation()->env()->Object_klass()) {
4074               TypeCast* c = new TypeCast(tk, obj, state_before);
4075               append(c);
4076               state()->stack_at_put(args_base, c);
4077             }
4078           }
4079           // Cast reference arguments to its type.
4080           for (int i = 0, j = 0; i < signature->count(); i++) {
4081             ciType* t = signature->type_at(i);
4082             if (t->is_klass()) {
4083               ciKlass* tk = t->as_klass();
4084               Value obj = state()->stack_at(args_base + receiver_skip + j);
4085               if (obj->exact_type() == NULL &&
4086                   obj->declared_type() != tk && tk != compilation()->env()->Object_klass()) {
4087                 TypeCast* c = new TypeCast(t, obj, state_before);
4088                 append(c);
4089                 state()->stack_at_put(args_base + receiver_skip + j, c);
4090               }
4091             }
4092             j += t->size();  // long and double take two slots
4093           }
4094           // We don't do CHA here so only inline static and statically bindable methods.
4095           if (target->is_static() || target->can_be_statically_bound()) {
4096             Bytecodes::Code bc = target->is_static() ? Bytecodes::_invokestatic : Bytecodes::_invokevirtual;
4097             if (try_inline(target, /*holder_known*/ true, ignore_return, bc)) {
4098               return true;
4099             }
4100           } else {
4101             print_inlining(target, "not static or statically bindable", /*success*/ false);
4102           }
4103         }
4104       } else {
4105         print_inlining(callee, "MemberName not constant", /*success*/ false);
4106       }
4107     }
4108     break;
4109 
4110   default:
4111     fatal("unexpected intrinsic %d: %s", iid, vmIntrinsics::name_at(iid));
4112     break;
4113   }
4114   set_state(state_before->copy_for_parsing());
4115   return false;
4116 }
4117 
4118 
4119 void GraphBuilder::inline_bailout(const char* msg) {
4120   assert(msg != NULL, "inline bailout msg must exist");
4121   _inline_bailout_msg = msg;
4122 }
4123 
4124 
4125 void GraphBuilder::clear_inline_bailout() {
4126   _inline_bailout_msg = NULL;
4127 }
4128 
4129 
4130 void GraphBuilder::push_root_scope(IRScope* scope, BlockList* bci2block, BlockBegin* start) {
4131   ScopeData* data = new ScopeData(NULL);
4132   data->set_scope(scope);
4133   data->set_bci2block(bci2block);
4134   _scope_data = data;
4135   _block = start;
4136 }
4137 
4138 
4139 void GraphBuilder::push_scope(ciMethod* callee, BlockBegin* continuation) {
4140   IRScope* callee_scope = new IRScope(compilation(), scope(), bci(), callee, -1, false);
4141   scope()->add_callee(callee_scope);
4142 
4143   BlockListBuilder blb(compilation(), callee_scope, -1);
4144   CHECK_BAILOUT();
4145 
4146   if (!blb.bci2block()->at(0)->is_set(BlockBegin::parser_loop_header_flag)) {
4147     // this scope can be inlined directly into the caller so remove
4148     // the block at bci 0.
4149     blb.bci2block()->at_put(0, NULL);
4150   }
4151 
4152   set_state(new ValueStack(callee_scope, state()->copy(ValueStack::CallerState, bci())));
4153 
4154   ScopeData* data = new ScopeData(scope_data());
4155   data->set_scope(callee_scope);
4156   data->set_bci2block(blb.bci2block());
4157   data->set_continuation(continuation);
4158   _scope_data = data;
4159 }
4160 
4161 
4162 void GraphBuilder::push_scope_for_jsr(BlockBegin* jsr_continuation, int jsr_dest_bci) {
4163   ScopeData* data = new ScopeData(scope_data());
4164   data->set_parsing_jsr();
4165   data->set_jsr_entry_bci(jsr_dest_bci);
4166   data->set_jsr_return_address_local(-1);
4167   // Must clone bci2block list as we will be mutating it in order to
4168   // properly clone all blocks in jsr region as well as exception
4169   // handlers containing rets
4170   BlockList* new_bci2block = new BlockList(bci2block()->length());
4171   new_bci2block->appendAll(bci2block());
4172   data->set_bci2block(new_bci2block);
4173   data->set_scope(scope());
4174   data->setup_jsr_xhandlers();
4175   data->set_continuation(continuation());
4176   data->set_jsr_continuation(jsr_continuation);
4177   _scope_data = data;
4178 }
4179 
4180 
4181 void GraphBuilder::pop_scope() {
4182   int number_of_locks = scope()->number_of_locks();
4183   _scope_data = scope_data()->parent();
4184   // accumulate minimum number of monitor slots to be reserved
4185   scope()->set_min_number_of_locks(number_of_locks);
4186 }
4187 
4188 
4189 void GraphBuilder::pop_scope_for_jsr() {
4190   _scope_data = scope_data()->parent();
4191 }
4192 
4193 void GraphBuilder::append_unsafe_get_obj(ciMethod* callee, BasicType t, bool is_volatile) {
4194   Values* args = state()->pop_arguments(callee->arg_size());
4195   null_check(args->at(0));
4196   Instruction* offset = args->at(2);
4197 #ifndef _LP64
4198   offset = append(new Convert(Bytecodes::_l2i, offset, as_ValueType(T_INT)));
4199 #endif
4200   Instruction* op = append(new UnsafeGetObject(t, args->at(1), offset, is_volatile));
4201   push(op->type(), op);
4202   compilation()->set_has_unsafe_access(true);
4203 }
4204 
4205 
4206 void GraphBuilder::append_unsafe_put_obj(ciMethod* callee, BasicType t, bool is_volatile) {
4207   Values* args = state()->pop_arguments(callee->arg_size());
4208   null_check(args->at(0));
4209   Instruction* offset = args->at(2);
4210 #ifndef _LP64
4211   offset = append(new Convert(Bytecodes::_l2i, offset, as_ValueType(T_INT)));
4212 #endif
4213   Value val = args->at(3);
4214   if (t == T_BOOLEAN) {
4215     Value mask = append(new Constant(new IntConstant(1)));
4216     val = append(new LogicOp(Bytecodes::_iand, val, mask));
4217   }
4218   Instruction* op = append(new UnsafePutObject(t, args->at(1), offset, val, is_volatile));
4219   compilation()->set_has_unsafe_access(true);
4220   kill_all();
4221 }
4222 
4223 
4224 void GraphBuilder::append_unsafe_get_raw(ciMethod* callee, BasicType t) {
4225   Values* args = state()->pop_arguments(callee->arg_size());
4226   null_check(args->at(0));
4227   Instruction* op = append(new UnsafeGetRaw(t, args->at(1), false));
4228   push(op->type(), op);
4229   compilation()->set_has_unsafe_access(true);
4230 }
4231 
4232 
4233 void GraphBuilder::append_unsafe_put_raw(ciMethod* callee, BasicType t) {
4234   Values* args = state()->pop_arguments(callee->arg_size());
4235   null_check(args->at(0));
4236   Instruction* op = append(new UnsafePutRaw(t, args->at(1), args->at(2)));
4237   compilation()->set_has_unsafe_access(true);
4238 }
4239 
4240 
4241 void GraphBuilder::append_unsafe_CAS(ciMethod* callee) {
4242   ValueStack* state_before = copy_state_for_exception();
4243   ValueType* result_type = as_ValueType(callee->return_type());
4244   assert(result_type->is_int(), "int result");
4245   Values* args = state()->pop_arguments(callee->arg_size());
4246 
4247   // Pop off some args to specially handle, then push back
4248   Value newval = args->pop();
4249   Value cmpval = args->pop();
4250   Value offset = args->pop();
4251   Value src = args->pop();
4252   Value unsafe_obj = args->pop();
4253 
4254   // Separately handle the unsafe arg. It is not needed for code
4255   // generation, but must be null checked
4256   null_check(unsafe_obj);
4257 
4258 #ifndef _LP64
4259   offset = append(new Convert(Bytecodes::_l2i, offset, as_ValueType(T_INT)));
4260 #endif
4261 
4262   args->push(src);
4263   args->push(offset);
4264   args->push(cmpval);
4265   args->push(newval);
4266 
4267   // An unsafe CAS can alias with other field accesses, but we don't
4268   // know which ones so mark the state as no preserved.  This will
4269   // cause CSE to invalidate memory across it.
4270   bool preserves_state = false;
4271   Intrinsic* result = new Intrinsic(result_type, callee->intrinsic_id(), args, false, state_before, preserves_state);
4272   append_split(result);
4273   push(result_type, result);
4274   compilation()->set_has_unsafe_access(true);
4275 }
4276 
4277 void GraphBuilder::append_char_access(ciMethod* callee, bool is_store) {
4278   // This intrinsic accesses byte[] array as char[] array. Computing the offsets
4279   // correctly requires matched array shapes.
4280   assert (arrayOopDesc::base_offset_in_bytes(T_CHAR) == arrayOopDesc::base_offset_in_bytes(T_BYTE),
4281           "sanity: byte[] and char[] bases agree");
4282   assert (type2aelembytes(T_CHAR) == type2aelembytes(T_BYTE)*2,
4283           "sanity: byte[] and char[] scales agree");
4284 
4285   ValueStack* state_before = copy_state_indexed_access();
4286   compilation()->set_has_access_indexed(true);
4287   Values* args = state()->pop_arguments(callee->arg_size());
4288   Value array = args->at(0);
4289   Value index = args->at(1);
4290   if (is_store) {
4291     Value value = args->at(2);
4292     Instruction* store = append(new StoreIndexed(array, index, NULL, T_CHAR, value, state_before, false, true));
4293     store->set_flag(Instruction::NeedsRangeCheckFlag, false);
4294     _memory->store_value(value);
4295   } else {
4296     Instruction* load = append(new LoadIndexed(array, index, NULL, T_CHAR, state_before, true));
4297     load->set_flag(Instruction::NeedsRangeCheckFlag, false);
4298     push(load->type(), load);
4299   }
4300 }
4301 
4302 void GraphBuilder::print_inlining(ciMethod* callee, const char* msg, bool success) {
4303   CompileLog* log = compilation()->log();
4304   if (log != NULL) {
4305     if (success) {
4306       if (msg != NULL)
4307         log->inline_success(msg);
4308       else
4309         log->inline_success("receiver is statically known");
4310     } else {
4311       if (msg != NULL)
4312         log->inline_fail(msg);
4313       else
4314         log->inline_fail("reason unknown");
4315     }
4316   }
4317 #if INCLUDE_TRACE
4318   EventCompilerInlining event;
4319   if (event.should_commit()) {
4320     event.set_compileId(compilation()->env()->task()->compile_id());
4321     event.set_message(msg);
4322     event.set_succeeded(success);
4323     event.set_bci(bci());
4324     event.set_caller(method()->get_Method());
4325     event.set_callee(callee->to_trace_struct());
4326     event.commit();
4327   }
4328 #endif // INCLUDE_TRACE
4329 
4330   CompileTask::print_inlining_ul(callee, scope()->level(), bci(), msg);
4331 
4332   if (!compilation()->directive()->PrintInliningOption) {
4333     return;
4334   }
4335   CompileTask::print_inlining_tty(callee, scope()->level(), bci(), msg);
4336   if (success && CIPrintMethodCodes) {
4337     callee->print_codes();
4338   }
4339 }
4340 
4341 void GraphBuilder::append_unsafe_get_and_set_obj(ciMethod* callee, bool is_add) {
4342   Values* args = state()->pop_arguments(callee->arg_size());
4343   BasicType t = callee->return_type()->basic_type();
4344   null_check(args->at(0));
4345   Instruction* offset = args->at(2);
4346 #ifndef _LP64
4347   offset = append(new Convert(Bytecodes::_l2i, offset, as_ValueType(T_INT)));
4348 #endif
4349   Instruction* op = append(new UnsafeGetAndSetObject(t, args->at(1), offset, args->at(3), is_add));
4350   compilation()->set_has_unsafe_access(true);
4351   kill_all();
4352   push(op->type(), op);
4353 }
4354 
4355 #ifndef PRODUCT
4356 void GraphBuilder::print_stats() {
4357   vmap()->print();
4358 }
4359 #endif // PRODUCT
4360 
4361 void GraphBuilder::profile_call(ciMethod* callee, Value recv, ciKlass* known_holder, Values* obj_args, bool inlined) {
4362   assert(known_holder == NULL || (known_holder->is_instance_klass() &&
4363                                   (!known_holder->is_interface() ||
4364                                    ((ciInstanceKlass*)known_holder)->has_nonstatic_concrete_methods())), "should be non-static concrete method");
4365   if (known_holder != NULL) {
4366     if (known_holder->exact_klass() == NULL) {
4367       known_holder = compilation()->cha_exact_type(known_holder);
4368     }
4369   }
4370 
4371   append(new ProfileCall(method(), bci(), callee, recv, known_holder, obj_args, inlined));
4372 }
4373 
4374 void GraphBuilder::profile_return_type(Value ret, ciMethod* callee, ciMethod* m, int invoke_bci) {
4375   assert((m == NULL) == (invoke_bci < 0), "invalid method and invalid bci together");
4376   if (m == NULL) {
4377     m = method();
4378   }
4379   if (invoke_bci < 0) {
4380     invoke_bci = bci();
4381   }
4382   ciMethodData* md = m->method_data_or_null();
4383   ciProfileData* data = md->bci_to_data(invoke_bci);
4384   if (data != NULL && (data->is_CallTypeData() || data->is_VirtualCallTypeData())) {
4385     bool has_return = data->is_CallTypeData() ? ((ciCallTypeData*)data)->has_return() : ((ciVirtualCallTypeData*)data)->has_return();
4386     if (has_return) {
4387       append(new ProfileReturnType(m , invoke_bci, callee, ret));
4388     }
4389   }
4390 }
4391 
4392 void GraphBuilder::profile_invocation(ciMethod* callee, ValueStack* state) {
4393   append(new ProfileInvoke(callee, state));
4394 }
--- EOF ---