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