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