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