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