1 /*
   2  * Copyright (c) 1999, 2021, Oracle and/or its affiliates. All rights reserved.
   3  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   4  *
   5  * This code is free software; you can redistribute it and/or modify it
   6  * under the terms of the GNU General Public License version 2 only, as
   7  * published by the Free Software Foundation.
   8  *
   9  * This code is distributed in the hope that it will be useful, but WITHOUT
  10  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  11  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  12  * version 2 for more details (a copy is included in the LICENSE file that
  13  * accompanied this code).
  14  *
  15  * You should have received a copy of the GNU General Public License version
  16  * 2 along with this work; if not, write to the Free Software Foundation,
  17  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
  18  *
  19  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
  20  * or visit www.oracle.com if you need additional information or have any
  21  * questions.
  22  *
  23  */
  24 
  25 #include "precompiled.hpp"
  26 #include "c1/c1_CFGPrinter.hpp"
  27 #include "c1/c1_Canonicalizer.hpp"
  28 #include "c1/c1_Compilation.hpp"
  29 #include "c1/c1_GraphBuilder.hpp"
  30 #include "c1/c1_InstructionPrinter.hpp"
  31 #include "ci/ciCallSite.hpp"
  32 #include "ci/ciField.hpp"
  33 #include "ci/ciKlass.hpp"
  34 #include "ci/ciMemberName.hpp"
  35 #include "ci/ciSymbols.hpp"
  36 #include "ci/ciUtilities.inline.hpp"
  37 #include "compiler/compilationPolicy.hpp"
  38 #include "compiler/compileBroker.hpp"
  39 #include "compiler/compilerEvent.hpp"
  40 #include "interpreter/bytecode.hpp"
  41 #include "jfr/jfrEvents.hpp"
  42 #include "memory/resourceArea.hpp"
  43 #include "oops/oop.inline.hpp"
  44 #include "runtime/sharedRuntime.hpp"
  45 #include "runtime/vm_version.hpp"
  46 #include "utilities/bitMap.inline.hpp"
  47 #include "utilities/powerOfTwo.hpp"
  48 
  49 class BlockListBuilder {
  50  private:
  51   Compilation* _compilation;
  52   IRScope*     _scope;
  53 
  54   BlockList    _blocks;                // internal list of all blocks
  55   BlockList*   _bci2block;             // mapping from bci to blocks for GraphBuilder
  56 
  57   // fields used by mark_loops
  58   ResourceBitMap _active;              // for iteration of control flow graph
  59   ResourceBitMap _visited;             // for iteration of control flow graph
  60   intArray       _loop_map;            // caches the information if a block is contained in a loop
  61   int            _next_loop_index;     // next free loop number
  62   int            _next_block_number;   // for reverse postorder numbering of blocks
  63 
  64   // accessors
  65   Compilation*  compilation() const              { return _compilation; }
  66   IRScope*      scope() const                    { return _scope; }
  67   ciMethod*     method() const                   { return scope()->method(); }
  68   XHandlers*    xhandlers() const                { return scope()->xhandlers(); }
  69 
  70   // unified bailout support
  71   void          bailout(const char* msg) const   { compilation()->bailout(msg); }
  72   bool          bailed_out() const               { return compilation()->bailed_out(); }
  73 
  74   // helper functions
  75   BlockBegin* make_block_at(int bci, BlockBegin* predecessor);
  76   void handle_exceptions(BlockBegin* current, int cur_bci);
  77   void handle_jsr(BlockBegin* current, int sr_bci, int next_bci);
  78   void store_one(BlockBegin* current, int local);
  79   void store_two(BlockBegin* current, int local);
  80   void set_entries(int osr_bci);
  81   void set_leaders();
  82 
  83   void make_loop_header(BlockBegin* block);
  84   void mark_loops();
  85   int  mark_loops(BlockBegin* b, bool in_subroutine);
  86 
  87   // debugging
  88 #ifndef PRODUCT
  89   void print();
  90 #endif
  91 
  92  public:
  93   // creation
  94   BlockListBuilder(Compilation* compilation, IRScope* scope, int osr_bci);
  95 
  96   // accessors for GraphBuilder
  97   BlockList*    bci2block() const                { return _bci2block; }
  98 };
  99 
 100 
 101 // Implementation of BlockListBuilder
 102 
 103 BlockListBuilder::BlockListBuilder(Compilation* compilation, IRScope* scope, int osr_bci)
 104  : _compilation(compilation)
 105  , _scope(scope)
 106  , _blocks(16)
 107  , _bci2block(new BlockList(scope->method()->code_size(), NULL))
 108  , _active()         // size not known yet
 109  , _visited()        // size not known yet
 110  , _loop_map() // size not known yet
 111  , _next_loop_index(0)
 112  , _next_block_number(0)
 113 {
 114   set_entries(osr_bci);
 115   set_leaders();
 116   CHECK_BAILOUT();
 117 
 118   mark_loops();
 119   NOT_PRODUCT(if (PrintInitialBlockList) print());
 120 
 121 #ifndef PRODUCT
 122   if (PrintCFGToFile) {
 123     stringStream title;
 124     title.print("BlockListBuilder ");
 125     scope->method()->print_name(&title);
 126     CFGPrinter::print_cfg(_bci2block, title.as_string(), false, false);
 127   }
 128 #endif
 129 }
 130 
 131 
 132 void BlockListBuilder::set_entries(int osr_bci) {
 133   // generate start blocks
 134   BlockBegin* std_entry = make_block_at(0, NULL);
 135   if (scope()->caller() == NULL) {
 136     std_entry->set(BlockBegin::std_entry_flag);
 137   }
 138   if (osr_bci != -1) {
 139     BlockBegin* osr_entry = make_block_at(osr_bci, NULL);
 140     osr_entry->set(BlockBegin::osr_entry_flag);
 141   }
 142 
 143   // generate exception entry blocks
 144   XHandlers* list = xhandlers();
 145   const int n = list->length();
 146   for (int i = 0; i < n; i++) {
 147     XHandler* h = list->handler_at(i);
 148     BlockBegin* entry = make_block_at(h->handler_bci(), NULL);
 149     entry->set(BlockBegin::exception_entry_flag);
 150     h->set_entry_block(entry);
 151   }
 152 }
 153 
 154 
 155 BlockBegin* BlockListBuilder::make_block_at(int cur_bci, BlockBegin* predecessor) {
 156   assert(method()->bci_block_start().at(cur_bci), "wrong block starts of MethodLivenessAnalyzer");
 157 
 158   BlockBegin* block = _bci2block->at(cur_bci);
 159   if (block == NULL) {
 160     block = new BlockBegin(cur_bci);
 161     block->init_stores_to_locals(method()->max_locals());
 162     _bci2block->at_put(cur_bci, block);
 163     _blocks.append(block);
 164 
 165     assert(predecessor == NULL || predecessor->bci() < cur_bci, "targets for backward branches must already exist");
 166   }
 167 
 168   if (predecessor != NULL) {
 169     if (block->is_set(BlockBegin::exception_entry_flag)) {
 170       BAILOUT_("Exception handler can be reached by both normal and exceptional control flow", block);
 171     }
 172 
 173     predecessor->add_successor(block);
 174     block->increment_total_preds();
 175   }
 176 
 177   return block;
 178 }
 179 
 180 
 181 inline void BlockListBuilder::store_one(BlockBegin* current, int local) {
 182   current->stores_to_locals().set_bit(local);
 183 }
 184 inline void BlockListBuilder::store_two(BlockBegin* current, int local) {
 185   store_one(current, local);
 186   store_one(current, local + 1);
 187 }
 188 
 189 
 190 void BlockListBuilder::handle_exceptions(BlockBegin* current, int cur_bci) {
 191   // Draws edges from a block to its exception handlers
 192   XHandlers* list = xhandlers();
 193   const int n = list->length();
 194 
 195   for (int i = 0; i < n; i++) {
 196     XHandler* h = list->handler_at(i);
 197 
 198     if (h->covers(cur_bci)) {
 199       BlockBegin* entry = h->entry_block();
 200       assert(entry != NULL && entry == _bci2block->at(h->handler_bci()), "entry must be set");
 201       assert(entry->is_set(BlockBegin::exception_entry_flag), "flag must be set");
 202 
 203       // add each exception handler only once
 204       if (!current->is_successor(entry)) {
 205         current->add_successor(entry);
 206         entry->increment_total_preds();
 207       }
 208 
 209       // stop when reaching catchall
 210       if (h->catch_type() == 0) break;
 211     }
 212   }
 213 }
 214 
 215 void BlockListBuilder::handle_jsr(BlockBegin* current, int sr_bci, int next_bci) {
 216   // start a new block after jsr-bytecode and link this block into cfg
 217   make_block_at(next_bci, current);
 218 
 219   // start a new block at the subroutine entry at mark it with special flag
 220   BlockBegin* sr_block = make_block_at(sr_bci, current);
 221   if (!sr_block->is_set(BlockBegin::subroutine_entry_flag)) {
 222     sr_block->set(BlockBegin::subroutine_entry_flag);
 223   }
 224 }
 225 
 226 
 227 void BlockListBuilder::set_leaders() {
 228   bool has_xhandlers = xhandlers()->has_handlers();
 229   BlockBegin* current = NULL;
 230 
 231   // The information which bci starts a new block simplifies the analysis
 232   // Without it, backward branches could jump to a bci where no block was created
 233   // during bytecode iteration. This would require the creation of a new block at the
 234   // branch target and a modification of the successor lists.
 235   const BitMap& bci_block_start = method()->bci_block_start();
 236 
 237   ciBytecodeStream s(method());
 238   while (s.next() != ciBytecodeStream::EOBC()) {
 239     int cur_bci = s.cur_bci();
 240 
 241     if (bci_block_start.at(cur_bci)) {
 242       current = make_block_at(cur_bci, current);
 243     }
 244     assert(current != NULL, "must have current block");
 245 
 246     if (has_xhandlers && GraphBuilder::can_trap(method(), s.cur_bc())) {
 247       handle_exceptions(current, cur_bci);
 248     }
 249 
 250     switch (s.cur_bc()) {
 251       // track stores to local variables for selective creation of phi functions
 252       case Bytecodes::_iinc:     store_one(current, s.get_index()); break;
 253       case Bytecodes::_istore:   store_one(current, s.get_index()); break;
 254       case Bytecodes::_lstore:   store_two(current, s.get_index()); break;
 255       case Bytecodes::_fstore:   store_one(current, s.get_index()); break;
 256       case Bytecodes::_dstore:   store_two(current, s.get_index()); break;
 257       case Bytecodes::_astore:   store_one(current, s.get_index()); break;
 258       case Bytecodes::_istore_0: store_one(current, 0); break;
 259       case Bytecodes::_istore_1: store_one(current, 1); break;
 260       case Bytecodes::_istore_2: store_one(current, 2); break;
 261       case Bytecodes::_istore_3: store_one(current, 3); break;
 262       case Bytecodes::_lstore_0: store_two(current, 0); break;
 263       case Bytecodes::_lstore_1: store_two(current, 1); break;
 264       case Bytecodes::_lstore_2: store_two(current, 2); break;
 265       case Bytecodes::_lstore_3: store_two(current, 3); break;
 266       case Bytecodes::_fstore_0: store_one(current, 0); break;
 267       case Bytecodes::_fstore_1: store_one(current, 1); break;
 268       case Bytecodes::_fstore_2: store_one(current, 2); break;
 269       case Bytecodes::_fstore_3: store_one(current, 3); break;
 270       case Bytecodes::_dstore_0: store_two(current, 0); break;
 271       case Bytecodes::_dstore_1: store_two(current, 1); break;
 272       case Bytecodes::_dstore_2: store_two(current, 2); break;
 273       case Bytecodes::_dstore_3: store_two(current, 3); break;
 274       case Bytecodes::_astore_0: store_one(current, 0); break;
 275       case Bytecodes::_astore_1: store_one(current, 1); break;
 276       case Bytecodes::_astore_2: store_one(current, 2); break;
 277       case Bytecodes::_astore_3: store_one(current, 3); break;
 278 
 279       // track bytecodes that affect the control flow
 280       case Bytecodes::_athrow:  // fall through
 281       case Bytecodes::_ret:     // fall through
 282       case Bytecodes::_ireturn: // fall through
 283       case Bytecodes::_lreturn: // fall through
 284       case Bytecodes::_freturn: // fall through
 285       case Bytecodes::_dreturn: // fall through
 286       case Bytecodes::_areturn: // fall through
 287       case Bytecodes::_return:
 288         current = NULL;
 289         break;
 290 
 291       case Bytecodes::_ifeq:      // fall through
 292       case Bytecodes::_ifne:      // fall through
 293       case Bytecodes::_iflt:      // fall through
 294       case Bytecodes::_ifge:      // fall through
 295       case Bytecodes::_ifgt:      // fall through
 296       case Bytecodes::_ifle:      // fall through
 297       case Bytecodes::_if_icmpeq: // fall through
 298       case Bytecodes::_if_icmpne: // fall through
 299       case Bytecodes::_if_icmplt: // fall through
 300       case Bytecodes::_if_icmpge: // fall through
 301       case Bytecodes::_if_icmpgt: // fall through
 302       case Bytecodes::_if_icmple: // fall through
 303       case Bytecodes::_if_acmpeq: // fall through
 304       case Bytecodes::_if_acmpne: // fall through
 305       case Bytecodes::_ifnull:    // fall through
 306       case Bytecodes::_ifnonnull:
 307         make_block_at(s.next_bci(), current);
 308         make_block_at(s.get_dest(), current);
 309         current = NULL;
 310         break;
 311 
 312       case Bytecodes::_goto:
 313         make_block_at(s.get_dest(), current);
 314         current = NULL;
 315         break;
 316 
 317       case Bytecodes::_goto_w:
 318         make_block_at(s.get_far_dest(), current);
 319         current = NULL;
 320         break;
 321 
 322       case Bytecodes::_jsr:
 323         handle_jsr(current, s.get_dest(), s.next_bci());
 324         current = NULL;
 325         break;
 326 
 327       case Bytecodes::_jsr_w:
 328         handle_jsr(current, s.get_far_dest(), s.next_bci());
 329         current = NULL;
 330         break;
 331 
 332       case Bytecodes::_tableswitch: {
 333         // set block for each case
 334         Bytecode_tableswitch sw(&s);
 335         int l = sw.length();
 336         for (int i = 0; i < l; i++) {
 337           make_block_at(cur_bci + sw.dest_offset_at(i), current);
 338         }
 339         make_block_at(cur_bci + sw.default_offset(), current);
 340         current = NULL;
 341         break;
 342       }
 343 
 344       case Bytecodes::_lookupswitch: {
 345         // set block for each case
 346         Bytecode_lookupswitch sw(&s);
 347         int l = sw.number_of_pairs();
 348         for (int i = 0; i < l; i++) {
 349           make_block_at(cur_bci + sw.pair_at(i).offset(), current);
 350         }
 351         make_block_at(cur_bci + sw.default_offset(), current);
 352         current = NULL;
 353         break;
 354       }
 355 
 356       default:
 357         break;
 358     }
 359   }
 360 }
 361 
 362 
 363 void BlockListBuilder::mark_loops() {
 364   ResourceMark rm;
 365 
 366   _active.initialize(BlockBegin::number_of_blocks());
 367   _visited.initialize(BlockBegin::number_of_blocks());
 368   _loop_map = intArray(BlockBegin::number_of_blocks(), BlockBegin::number_of_blocks(), 0);
 369   _next_loop_index = 0;
 370   _next_block_number = _blocks.length();
 371 
 372   // recursively iterate the control flow graph
 373   mark_loops(_bci2block->at(0), false);
 374   assert(_next_block_number >= 0, "invalid block numbers");
 375 
 376   // Remove dangling Resource pointers before the ResourceMark goes out-of-scope.
 377   _active.resize(0);
 378   _visited.resize(0);
 379 }
 380 
 381 void BlockListBuilder::make_loop_header(BlockBegin* block) {
 382   if (block->is_set(BlockBegin::exception_entry_flag)) {
 383     // exception edges may look like loops but don't mark them as such
 384     // since it screws up block ordering.
 385     return;
 386   }
 387   if (!block->is_set(BlockBegin::parser_loop_header_flag)) {
 388     block->set(BlockBegin::parser_loop_header_flag);
 389 
 390     assert(_loop_map.at(block->block_id()) == 0, "must not be set yet");
 391     assert(0 <= _next_loop_index && _next_loop_index < BitsPerInt, "_next_loop_index is used as a bit-index in integer");
 392     _loop_map.at_put(block->block_id(), 1 << _next_loop_index);
 393     if (_next_loop_index < 31) _next_loop_index++;
 394   } else {
 395     // block already marked as loop header
 396     assert(is_power_of_2((unsigned int)_loop_map.at(block->block_id())), "exactly one bit must be set");
 397   }
 398 }
 399 
 400 int BlockListBuilder::mark_loops(BlockBegin* block, bool in_subroutine) {
 401   int block_id = block->block_id();
 402 
 403   if (_visited.at(block_id)) {
 404     if (_active.at(block_id)) {
 405       // reached block via backward branch
 406       make_loop_header(block);
 407     }
 408     // return cached loop information for this block
 409     return _loop_map.at(block_id);
 410   }
 411 
 412   if (block->is_set(BlockBegin::subroutine_entry_flag)) {
 413     in_subroutine = true;
 414   }
 415 
 416   // set active and visited bits before successors are processed
 417   _visited.set_bit(block_id);
 418   _active.set_bit(block_id);
 419 
 420   intptr_t loop_state = 0;
 421   for (int i = block->number_of_sux() - 1; i >= 0; i--) {
 422     // recursively process all successors
 423     loop_state |= mark_loops(block->sux_at(i), in_subroutine);
 424   }
 425 
 426   // clear active-bit after all successors are processed
 427   _active.clear_bit(block_id);
 428 
 429   // reverse-post-order numbering of all blocks
 430   block->set_depth_first_number(_next_block_number);
 431   _next_block_number--;
 432 
 433   if (loop_state != 0 || in_subroutine ) {
 434     // block is contained at least in one loop, so phi functions are necessary
 435     // phi functions are also necessary for all locals stored in a subroutine
 436     scope()->requires_phi_function().set_union(block->stores_to_locals());
 437   }
 438 
 439   if (block->is_set(BlockBegin::parser_loop_header_flag)) {
 440     int header_loop_state = _loop_map.at(block_id);
 441     assert(is_power_of_2((unsigned)header_loop_state), "exactly one bit must be set");
 442 
 443     // If the highest bit is set (i.e. when integer value is negative), the method
 444     // has 32 or more loops. This bit is never cleared because it is used for multiple loops
 445     if (header_loop_state >= 0) {
 446       clear_bits(loop_state, header_loop_state);
 447     }
 448   }
 449 
 450   // cache and return loop information for this block
 451   _loop_map.at_put(block_id, loop_state);
 452   return loop_state;
 453 }
 454 
 455 
 456 #ifndef PRODUCT
 457 
 458 int compare_depth_first(BlockBegin** a, BlockBegin** b) {
 459   return (*a)->depth_first_number() - (*b)->depth_first_number();
 460 }
 461 
 462 void BlockListBuilder::print() {
 463   tty->print("----- initial block list of BlockListBuilder for method ");
 464   method()->print_short_name();
 465   tty->cr();
 466 
 467   // better readability if blocks are sorted in processing order
 468   _blocks.sort(compare_depth_first);
 469 
 470   for (int i = 0; i < _blocks.length(); i++) {
 471     BlockBegin* cur = _blocks.at(i);
 472     tty->print("%4d: B%-4d bci: %-4d  preds: %-4d ", cur->depth_first_number(), cur->block_id(), cur->bci(), cur->total_preds());
 473 
 474     tty->print(cur->is_set(BlockBegin::std_entry_flag)               ? " std" : "    ");
 475     tty->print(cur->is_set(BlockBegin::osr_entry_flag)               ? " osr" : "    ");
 476     tty->print(cur->is_set(BlockBegin::exception_entry_flag)         ? " ex" : "   ");
 477     tty->print(cur->is_set(BlockBegin::subroutine_entry_flag)        ? " sr" : "   ");
 478     tty->print(cur->is_set(BlockBegin::parser_loop_header_flag)      ? " lh" : "   ");
 479 
 480     if (cur->number_of_sux() > 0) {
 481       tty->print("    sux: ");
 482       for (int j = 0; j < cur->number_of_sux(); j++) {
 483         BlockBegin* sux = cur->sux_at(j);
 484         tty->print("B%d ", sux->block_id());
 485       }
 486     }
 487     tty->cr();
 488   }
 489 }
 490 
 491 #endif
 492 
 493 
 494 // A simple growable array of Values indexed by ciFields
 495 class FieldBuffer: public CompilationResourceObj {
 496  private:
 497   GrowableArray<Value> _values;
 498 
 499  public:
 500   FieldBuffer() {}
 501 
 502   void kill() {
 503     _values.trunc_to(0);
 504   }
 505 
 506   Value at(ciField* field) {
 507     assert(field->holder()->is_loaded(), "must be a loaded field");
 508     int offset = field->offset();
 509     if (offset < _values.length()) {
 510       return _values.at(offset);
 511     } else {
 512       return NULL;
 513     }
 514   }
 515 
 516   void at_put(ciField* field, Value value) {
 517     assert(field->holder()->is_loaded(), "must be a loaded field");
 518     int offset = field->offset();
 519     _values.at_put_grow(offset, value, NULL);
 520   }
 521 
 522 };
 523 
 524 
 525 // MemoryBuffer is fairly simple model of the current state of memory.
 526 // It partitions memory into several pieces.  The first piece is
 527 // generic memory where little is known about the owner of the memory.
 528 // This is conceptually represented by the tuple <O, F, V> which says
 529 // that the field F of object O has value V.  This is flattened so
 530 // that F is represented by the offset of the field and the parallel
 531 // arrays _objects and _values are used for O and V.  Loads of O.F can
 532 // simply use V.  Newly allocated objects are kept in a separate list
 533 // along with a parallel array for each object which represents the
 534 // current value of its fields.  Stores of the default value to fields
 535 // which have never been stored to before are eliminated since they
 536 // are redundant.  Once newly allocated objects are stored into
 537 // another object or they are passed out of the current compile they
 538 // are treated like generic memory.
 539 
 540 class MemoryBuffer: public CompilationResourceObj {
 541  private:
 542   FieldBuffer                 _values;
 543   GrowableArray<Value>        _objects;
 544   GrowableArray<Value>        _newobjects;
 545   GrowableArray<FieldBuffer*> _fields;
 546 
 547  public:
 548   MemoryBuffer() {}
 549 
 550   StoreField* store(StoreField* st) {
 551     if (!EliminateFieldAccess) {
 552       return st;
 553     }
 554 
 555     Value object = st->obj();
 556     Value value = st->value();
 557     ciField* field = st->field();
 558     if (field->holder()->is_loaded()) {
 559       int offset = field->offset();
 560       int index = _newobjects.find(object);
 561       if (index != -1) {
 562         // newly allocated object with no other stores performed on this field
 563         FieldBuffer* buf = _fields.at(index);
 564         if (buf->at(field) == NULL && is_default_value(value)) {
 565 #ifndef PRODUCT
 566           if (PrintIRDuringConstruction && Verbose) {
 567             tty->print_cr("Eliminated store for object %d:", index);
 568             st->print_line();
 569           }
 570 #endif
 571           return NULL;
 572         } else {
 573           buf->at_put(field, value);
 574         }
 575       } else {
 576         _objects.at_put_grow(offset, object, NULL);
 577         _values.at_put(field, value);
 578       }
 579 
 580       store_value(value);
 581     } else {
 582       // if we held onto field names we could alias based on names but
 583       // we don't know what's being stored to so kill it all.
 584       kill();
 585     }
 586     return st;
 587   }
 588 
 589 
 590   // return true if this value correspond to the default value of a field.
 591   bool is_default_value(Value value) {
 592     Constant* con = value->as_Constant();
 593     if (con) {
 594       switch (con->type()->tag()) {
 595         case intTag:    return con->type()->as_IntConstant()->value() == 0;
 596         case longTag:   return con->type()->as_LongConstant()->value() == 0;
 597         case floatTag:  return jint_cast(con->type()->as_FloatConstant()->value()) == 0;
 598         case doubleTag: return jlong_cast(con->type()->as_DoubleConstant()->value()) == jlong_cast(0);
 599         case objectTag: return con->type() == objectNull;
 600         default:  ShouldNotReachHere();
 601       }
 602     }
 603     return false;
 604   }
 605 
 606 
 607   // return either the actual value of a load or the load itself
 608   Value load(LoadField* load) {
 609     if (!EliminateFieldAccess) {
 610       return load;
 611     }
 612 
 613     if (strict_fp_requires_explicit_rounding && load->type()->is_float_kind()) {
 614 #ifdef IA32
 615       if (UseSSE < 2) {
 616         // can't skip load since value might get rounded as a side effect
 617         return load;
 618       }
 619 #else
 620       Unimplemented();
 621 #endif // IA32
 622     }
 623 
 624     ciField* field = load->field();
 625     Value object   = load->obj();
 626     if (field->holder()->is_loaded() && !field->is_volatile()) {
 627       int offset = field->offset();
 628       Value result = NULL;
 629       int index = _newobjects.find(object);
 630       if (index != -1) {
 631         result = _fields.at(index)->at(field);
 632       } else if (_objects.at_grow(offset, NULL) == object) {
 633         result = _values.at(field);
 634       }
 635       if (result != NULL) {
 636 #ifndef PRODUCT
 637         if (PrintIRDuringConstruction && Verbose) {
 638           tty->print_cr("Eliminated load: ");
 639           load->print_line();
 640         }
 641 #endif
 642         assert(result->type()->tag() == load->type()->tag(), "wrong types");
 643         return result;
 644       }
 645     }
 646     return load;
 647   }
 648 
 649   // Record this newly allocated object
 650   void new_instance(NewInstance* object) {
 651     int index = _newobjects.length();
 652     _newobjects.append(object);
 653     if (_fields.at_grow(index, NULL) == NULL) {
 654       _fields.at_put(index, new FieldBuffer());
 655     } else {
 656       _fields.at(index)->kill();
 657     }
 658   }
 659 
 660   void store_value(Value value) {
 661     int index = _newobjects.find(value);
 662     if (index != -1) {
 663       // stored a newly allocated object into another object.
 664       // Assume we've lost track of it as separate slice of memory.
 665       // We could do better by keeping track of whether individual
 666       // fields could alias each other.
 667       _newobjects.remove_at(index);
 668       // pull out the field info and store it at the end up the list
 669       // of field info list to be reused later.
 670       _fields.append(_fields.at(index));
 671       _fields.remove_at(index);
 672     }
 673   }
 674 
 675   void kill() {
 676     _newobjects.trunc_to(0);
 677     _objects.trunc_to(0);
 678     _values.kill();
 679   }
 680 };
 681 
 682 
 683 // Implementation of GraphBuilder's ScopeData
 684 
 685 GraphBuilder::ScopeData::ScopeData(ScopeData* parent)
 686   : _parent(parent)
 687   , _bci2block(NULL)
 688   , _scope(NULL)
 689   , _has_handler(false)
 690   , _stream(NULL)
 691   , _work_list(NULL)
 692   , _caller_stack_size(-1)
 693   , _continuation(NULL)
 694   , _parsing_jsr(false)
 695   , _jsr_xhandlers(NULL)
 696   , _num_returns(0)
 697   , _cleanup_block(NULL)
 698   , _cleanup_return_prev(NULL)
 699   , _cleanup_state(NULL)
 700   , _ignore_return(false)
 701 {
 702   if (parent != NULL) {
 703     _max_inline_size = (intx) ((float) NestedInliningSizeRatio * (float) parent->max_inline_size() / 100.0f);
 704   } else {
 705     _max_inline_size = C1MaxInlineSize;
 706   }
 707   if (_max_inline_size < C1MaxTrivialSize) {
 708     _max_inline_size = C1MaxTrivialSize;
 709   }
 710 }
 711 
 712 
 713 void GraphBuilder::kill_all() {
 714   if (UseLocalValueNumbering) {
 715     vmap()->kill_all();
 716   }
 717   _memory->kill();
 718 }
 719 
 720 
 721 BlockBegin* GraphBuilder::ScopeData::block_at(int bci) {
 722   if (parsing_jsr()) {
 723     // It is necessary to clone all blocks associated with a
 724     // subroutine, including those for exception handlers in the scope
 725     // of the method containing the jsr (because those exception
 726     // handlers may contain ret instructions in some cases).
 727     BlockBegin* block = bci2block()->at(bci);
 728     if (block != NULL && block == parent()->bci2block()->at(bci)) {
 729       BlockBegin* new_block = new BlockBegin(block->bci());
 730       if (PrintInitialBlockList) {
 731         tty->print_cr("CFG: cloned block %d (bci %d) as block %d for jsr",
 732                       block->block_id(), block->bci(), new_block->block_id());
 733       }
 734       // copy data from cloned blocked
 735       new_block->set_depth_first_number(block->depth_first_number());
 736       if (block->is_set(BlockBegin::parser_loop_header_flag)) new_block->set(BlockBegin::parser_loop_header_flag);
 737       // Preserve certain flags for assertion checking
 738       if (block->is_set(BlockBegin::subroutine_entry_flag)) new_block->set(BlockBegin::subroutine_entry_flag);
 739       if (block->is_set(BlockBegin::exception_entry_flag))  new_block->set(BlockBegin::exception_entry_flag);
 740 
 741       // copy was_visited_flag to allow early detection of bailouts
 742       // if a block that is used in a jsr has already been visited before,
 743       // it is shared between the normal control flow and a subroutine
 744       // BlockBegin::try_merge returns false when the flag is set, this leads
 745       // to a compilation bailout
 746       if (block->is_set(BlockBegin::was_visited_flag))  new_block->set(BlockBegin::was_visited_flag);
 747 
 748       bci2block()->at_put(bci, new_block);
 749       block = new_block;
 750     }
 751     return block;
 752   } else {
 753     return bci2block()->at(bci);
 754   }
 755 }
 756 
 757 
 758 XHandlers* GraphBuilder::ScopeData::xhandlers() const {
 759   if (_jsr_xhandlers == NULL) {
 760     assert(!parsing_jsr(), "");
 761     return scope()->xhandlers();
 762   }
 763   assert(parsing_jsr(), "");
 764   return _jsr_xhandlers;
 765 }
 766 
 767 
 768 void GraphBuilder::ScopeData::set_scope(IRScope* scope) {
 769   _scope = scope;
 770   bool parent_has_handler = false;
 771   if (parent() != NULL) {
 772     parent_has_handler = parent()->has_handler();
 773   }
 774   _has_handler = parent_has_handler || scope->xhandlers()->has_handlers();
 775 }
 776 
 777 
 778 void GraphBuilder::ScopeData::set_inline_cleanup_info(BlockBegin* block,
 779                                                       Instruction* return_prev,
 780                                                       ValueStack* return_state) {
 781   _cleanup_block       = block;
 782   _cleanup_return_prev = return_prev;
 783   _cleanup_state       = return_state;
 784 }
 785 
 786 
 787 void GraphBuilder::ScopeData::add_to_work_list(BlockBegin* block) {
 788   if (_work_list == NULL) {
 789     _work_list = new BlockList();
 790   }
 791 
 792   if (!block->is_set(BlockBegin::is_on_work_list_flag)) {
 793     // Do not start parsing the continuation block while in a
 794     // sub-scope
 795     if (parsing_jsr()) {
 796       if (block == jsr_continuation()) {
 797         return;
 798       }
 799     } else {
 800       if (block == continuation()) {
 801         return;
 802       }
 803     }
 804     block->set(BlockBegin::is_on_work_list_flag);
 805     _work_list->push(block);
 806 
 807     sort_top_into_worklist(_work_list, block);
 808   }
 809 }
 810 
 811 
 812 void GraphBuilder::sort_top_into_worklist(BlockList* worklist, BlockBegin* top) {
 813   assert(worklist->top() == top, "");
 814   // sort block descending into work list
 815   const int dfn = top->depth_first_number();
 816   assert(dfn != -1, "unknown depth first number");
 817   int i = worklist->length()-2;
 818   while (i >= 0) {
 819     BlockBegin* b = worklist->at(i);
 820     if (b->depth_first_number() < dfn) {
 821       worklist->at_put(i+1, b);
 822     } else {
 823       break;
 824     }
 825     i --;
 826   }
 827   if (i >= -1) worklist->at_put(i + 1, top);
 828 }
 829 
 830 
 831 BlockBegin* GraphBuilder::ScopeData::remove_from_work_list() {
 832   if (is_work_list_empty()) {
 833     return NULL;
 834   }
 835   return _work_list->pop();
 836 }
 837 
 838 
 839 bool GraphBuilder::ScopeData::is_work_list_empty() const {
 840   return (_work_list == NULL || _work_list->length() == 0);
 841 }
 842 
 843 
 844 void GraphBuilder::ScopeData::setup_jsr_xhandlers() {
 845   assert(parsing_jsr(), "");
 846   // clone all the exception handlers from the scope
 847   XHandlers* handlers = new XHandlers(scope()->xhandlers());
 848   const int n = handlers->length();
 849   for (int i = 0; i < n; i++) {
 850     // The XHandlers need to be adjusted to dispatch to the cloned
 851     // handler block instead of the default one but the synthetic
 852     // unlocker needs to be handled specially.  The synthetic unlocker
 853     // should be left alone since there can be only one and all code
 854     // should dispatch to the same one.
 855     XHandler* h = handlers->handler_at(i);
 856     assert(h->handler_bci() != SynchronizationEntryBCI, "must be real");
 857     h->set_entry_block(block_at(h->handler_bci()));
 858   }
 859   _jsr_xhandlers = handlers;
 860 }
 861 
 862 
 863 int GraphBuilder::ScopeData::num_returns() {
 864   if (parsing_jsr()) {
 865     return parent()->num_returns();
 866   }
 867   return _num_returns;
 868 }
 869 
 870 
 871 void GraphBuilder::ScopeData::incr_num_returns() {
 872   if (parsing_jsr()) {
 873     parent()->incr_num_returns();
 874   } else {
 875     ++_num_returns;
 876   }
 877 }
 878 
 879 
 880 // Implementation of GraphBuilder
 881 
 882 #define INLINE_BAILOUT(msg)        { inline_bailout(msg); return false; }
 883 
 884 
 885 void GraphBuilder::load_constant() {
 886   ciConstant con = stream()->get_constant();
 887   if (con.basic_type() == T_ILLEGAL) {
 888     // FIXME: an unresolved Dynamic constant can get here,
 889     // and that should not terminate the whole compilation.
 890     BAILOUT("could not resolve a constant");
 891   } else {
 892     ValueType* t = illegalType;
 893     ValueStack* patch_state = NULL;
 894     switch (con.basic_type()) {
 895       case T_BOOLEAN: t = new IntConstant     (con.as_boolean()); break;
 896       case T_BYTE   : t = new IntConstant     (con.as_byte   ()); break;
 897       case T_CHAR   : t = new IntConstant     (con.as_char   ()); break;
 898       case T_SHORT  : t = new IntConstant     (con.as_short  ()); break;
 899       case T_INT    : t = new IntConstant     (con.as_int    ()); break;
 900       case T_LONG   : t = new LongConstant    (con.as_long   ()); break;
 901       case T_FLOAT  : t = new FloatConstant   (con.as_float  ()); break;
 902       case T_DOUBLE : t = new DoubleConstant  (con.as_double ()); break;
 903       case T_ARRAY  : t = new ArrayConstant   (con.as_object ()->as_array   ()); break;
 904       case T_OBJECT :
 905        {
 906         ciObject* obj = con.as_object();
 907         if (!obj->is_loaded()
 908             || (PatchALot && obj->klass() != ciEnv::current()->String_klass())) {
 909           // A Class, MethodType, MethodHandle, or String.
 910           // Unloaded condy nodes show up as T_ILLEGAL, above.
 911           patch_state = copy_state_before();
 912           t = new ObjectConstant(obj);
 913         } else {
 914           // Might be a Class, MethodType, MethodHandle, or Dynamic constant
 915           // result, which might turn out to be an array.
 916           if (obj->is_null_object())
 917             t = objectNull;
 918           else if (obj->is_array())
 919             t = new ArrayConstant(obj->as_array());
 920           else
 921             t = new InstanceConstant(obj->as_instance());
 922         }
 923         break;
 924        }
 925       default       : ShouldNotReachHere();
 926     }
 927     Value x;
 928     if (patch_state != NULL) {
 929       x = new Constant(t, patch_state);
 930     } else {
 931       x = new Constant(t);
 932     }
 933     push(t, append(x));
 934   }
 935 }
 936 
 937 
 938 void GraphBuilder::load_local(ValueType* type, int index) {
 939   Value x = state()->local_at(index);
 940   assert(x != NULL && !x->type()->is_illegal(), "access of illegal local variable");
 941   push(type, x);
 942 }
 943 
 944 
 945 void GraphBuilder::store_local(ValueType* type, int index) {
 946   Value x = pop(type);
 947   store_local(state(), x, index);
 948 }
 949 
 950 
 951 void GraphBuilder::store_local(ValueStack* state, Value x, int index) {
 952   if (parsing_jsr()) {
 953     // We need to do additional tracking of the location of the return
 954     // address for jsrs since we don't handle arbitrary jsr/ret
 955     // constructs. Here we are figuring out in which circumstances we
 956     // need to bail out.
 957     if (x->type()->is_address()) {
 958       scope_data()->set_jsr_return_address_local(index);
 959 
 960       // Also check parent jsrs (if any) at this time to see whether
 961       // they are using this local. We don't handle skipping over a
 962       // ret.
 963       for (ScopeData* cur_scope_data = scope_data()->parent();
 964            cur_scope_data != NULL && cur_scope_data->parsing_jsr() && cur_scope_data->scope() == scope();
 965            cur_scope_data = cur_scope_data->parent()) {
 966         if (cur_scope_data->jsr_return_address_local() == index) {
 967           BAILOUT("subroutine overwrites return address from previous subroutine");
 968         }
 969       }
 970     } else if (index == scope_data()->jsr_return_address_local()) {
 971       scope_data()->set_jsr_return_address_local(-1);
 972     }
 973   }
 974 
 975   state->store_local(index, round_fp(x));
 976 }
 977 
 978 
 979 void GraphBuilder::load_indexed(BasicType type) {
 980   // In case of in block code motion in range check elimination
 981   ValueStack* state_before = copy_state_indexed_access();
 982   compilation()->set_has_access_indexed(true);
 983   Value index = ipop();
 984   Value array = apop();
 985   Value length = NULL;
 986   if (CSEArrayLength ||
 987       (array->as_Constant() != NULL) ||
 988       (array->as_AccessField() && array->as_AccessField()->field()->is_constant()) ||
 989       (array->as_NewArray() && array->as_NewArray()->length() && array->as_NewArray()->length()->type()->is_constant()) ||
 990       (array->as_NewMultiArray() && array->as_NewMultiArray()->dims()->at(0)->type()->is_constant())) {
 991     length = append(new ArrayLength(array, state_before));
 992   }
 993   push(as_ValueType(type), append(new LoadIndexed(array, index, length, type, state_before)));
 994 }
 995 
 996 
 997 void GraphBuilder::store_indexed(BasicType type) {
 998   // In case of in block code motion in range check elimination
 999   ValueStack* state_before = copy_state_indexed_access();
1000   compilation()->set_has_access_indexed(true);
1001   Value value = pop(as_ValueType(type));
1002   Value index = ipop();
1003   Value array = apop();
1004   Value length = NULL;
1005   if (CSEArrayLength ||
1006       (array->as_Constant() != NULL) ||
1007       (array->as_AccessField() && array->as_AccessField()->field()->is_constant()) ||
1008       (array->as_NewArray() && array->as_NewArray()->length() && array->as_NewArray()->length()->type()->is_constant()) ||
1009       (array->as_NewMultiArray() && array->as_NewMultiArray()->dims()->at(0)->type()->is_constant())) {
1010     length = append(new ArrayLength(array, state_before));
1011   }
1012   ciType* array_type = array->declared_type();
1013   bool check_boolean = false;
1014   if (array_type != NULL) {
1015     if (array_type->is_loaded() &&
1016       array_type->as_array_klass()->element_type()->basic_type() == T_BOOLEAN) {
1017       assert(type == T_BYTE, "boolean store uses bastore");
1018       Value mask = append(new Constant(new IntConstant(1)));
1019       value = append(new LogicOp(Bytecodes::_iand, value, mask));
1020     }
1021   } else if (type == T_BYTE) {
1022     check_boolean = true;
1023   }
1024   StoreIndexed* result = new StoreIndexed(array, index, length, type, value, state_before, check_boolean);
1025   append(result);
1026   _memory->store_value(value);
1027 
1028   if (type == T_OBJECT && is_profiling()) {
1029     // Note that we'd collect profile data in this method if we wanted it.
1030     compilation()->set_would_profile(true);
1031 
1032     if (profile_checkcasts()) {
1033       result->set_profiled_method(method());
1034       result->set_profiled_bci(bci());
1035       result->set_should_profile(true);
1036     }
1037   }
1038 }
1039 
1040 
1041 void GraphBuilder::stack_op(Bytecodes::Code code) {
1042   switch (code) {
1043     case Bytecodes::_pop:
1044       { state()->raw_pop();
1045       }
1046       break;
1047     case Bytecodes::_pop2:
1048       { state()->raw_pop();
1049         state()->raw_pop();
1050       }
1051       break;
1052     case Bytecodes::_dup:
1053       { Value w = state()->raw_pop();
1054         state()->raw_push(w);
1055         state()->raw_push(w);
1056       }
1057       break;
1058     case Bytecodes::_dup_x1:
1059       { Value w1 = state()->raw_pop();
1060         Value w2 = state()->raw_pop();
1061         state()->raw_push(w1);
1062         state()->raw_push(w2);
1063         state()->raw_push(w1);
1064       }
1065       break;
1066     case Bytecodes::_dup_x2:
1067       { Value w1 = state()->raw_pop();
1068         Value w2 = state()->raw_pop();
1069         Value w3 = state()->raw_pop();
1070         state()->raw_push(w1);
1071         state()->raw_push(w3);
1072         state()->raw_push(w2);
1073         state()->raw_push(w1);
1074       }
1075       break;
1076     case Bytecodes::_dup2:
1077       { Value w1 = state()->raw_pop();
1078         Value w2 = state()->raw_pop();
1079         state()->raw_push(w2);
1080         state()->raw_push(w1);
1081         state()->raw_push(w2);
1082         state()->raw_push(w1);
1083       }
1084       break;
1085     case Bytecodes::_dup2_x1:
1086       { Value w1 = state()->raw_pop();
1087         Value w2 = state()->raw_pop();
1088         Value w3 = state()->raw_pop();
1089         state()->raw_push(w2);
1090         state()->raw_push(w1);
1091         state()->raw_push(w3);
1092         state()->raw_push(w2);
1093         state()->raw_push(w1);
1094       }
1095       break;
1096     case Bytecodes::_dup2_x2:
1097       { Value w1 = state()->raw_pop();
1098         Value w2 = state()->raw_pop();
1099         Value w3 = state()->raw_pop();
1100         Value w4 = state()->raw_pop();
1101         state()->raw_push(w2);
1102         state()->raw_push(w1);
1103         state()->raw_push(w4);
1104         state()->raw_push(w3);
1105         state()->raw_push(w2);
1106         state()->raw_push(w1);
1107       }
1108       break;
1109     case Bytecodes::_swap:
1110       { Value w1 = state()->raw_pop();
1111         Value w2 = state()->raw_pop();
1112         state()->raw_push(w1);
1113         state()->raw_push(w2);
1114       }
1115       break;
1116     default:
1117       ShouldNotReachHere();
1118       break;
1119   }
1120 }
1121 
1122 
1123 void GraphBuilder::arithmetic_op(ValueType* type, Bytecodes::Code code, ValueStack* state_before) {
1124   Value y = pop(type);
1125   Value x = pop(type);
1126   Value res = new ArithmeticOp(code, x, y, state_before);
1127   // Note: currently single-precision floating-point rounding on Intel is handled at the LIRGenerator level
1128   res = append(res);
1129   res = round_fp(res);
1130   push(type, res);
1131 }
1132 
1133 
1134 void GraphBuilder::negate_op(ValueType* type) {
1135   push(type, append(new NegateOp(pop(type))));
1136 }
1137 
1138 
1139 void GraphBuilder::shift_op(ValueType* type, Bytecodes::Code code) {
1140   Value s = ipop();
1141   Value x = pop(type);
1142   // try to simplify
1143   // Note: This code should go into the canonicalizer as soon as it can
1144   //       can handle canonicalized forms that contain more than one node.
1145   if (CanonicalizeNodes && code == Bytecodes::_iushr) {
1146     // pattern: x >>> s
1147     IntConstant* s1 = s->type()->as_IntConstant();
1148     if (s1 != NULL) {
1149       // pattern: x >>> s1, with s1 constant
1150       ShiftOp* l = x->as_ShiftOp();
1151       if (l != NULL && l->op() == Bytecodes::_ishl) {
1152         // pattern: (a << b) >>> s1
1153         IntConstant* s0 = l->y()->type()->as_IntConstant();
1154         if (s0 != NULL) {
1155           // pattern: (a << s0) >>> s1
1156           const int s0c = s0->value() & 0x1F; // only the low 5 bits are significant for shifts
1157           const int s1c = s1->value() & 0x1F; // only the low 5 bits are significant for shifts
1158           if (s0c == s1c) {
1159             if (s0c == 0) {
1160               // pattern: (a << 0) >>> 0 => simplify to: a
1161               ipush(l->x());
1162             } else {
1163               // pattern: (a << s0c) >>> s0c => simplify to: a & m, with m constant
1164               assert(0 < s0c && s0c < BitsPerInt, "adjust code below to handle corner cases");
1165               const int m = (1 << (BitsPerInt - s0c)) - 1;
1166               Value s = append(new Constant(new IntConstant(m)));
1167               ipush(append(new LogicOp(Bytecodes::_iand, l->x(), s)));
1168             }
1169             return;
1170           }
1171         }
1172       }
1173     }
1174   }
1175   // could not simplify
1176   push(type, append(new ShiftOp(code, x, s)));
1177 }
1178 
1179 
1180 void GraphBuilder::logic_op(ValueType* type, Bytecodes::Code code) {
1181   Value y = pop(type);
1182   Value x = pop(type);
1183   push(type, append(new LogicOp(code, x, y)));
1184 }
1185 
1186 
1187 void GraphBuilder::compare_op(ValueType* type, Bytecodes::Code code) {
1188   ValueStack* state_before = copy_state_before();
1189   Value y = pop(type);
1190   Value x = pop(type);
1191   ipush(append(new CompareOp(code, x, y, state_before)));
1192 }
1193 
1194 
1195 void GraphBuilder::convert(Bytecodes::Code op, BasicType from, BasicType to) {
1196   push(as_ValueType(to), append(new Convert(op, pop(as_ValueType(from)), as_ValueType(to))));
1197 }
1198 
1199 
1200 void GraphBuilder::increment() {
1201   int index = stream()->get_index();
1202   int delta = stream()->is_wide() ? (signed short)Bytes::get_Java_u2(stream()->cur_bcp() + 4) : (signed char)(stream()->cur_bcp()[2]);
1203   load_local(intType, index);
1204   ipush(append(new Constant(new IntConstant(delta))));
1205   arithmetic_op(intType, Bytecodes::_iadd);
1206   store_local(intType, index);
1207 }
1208 
1209 
1210 void GraphBuilder::_goto(int from_bci, int to_bci) {
1211   Goto *x = new Goto(block_at(to_bci), to_bci <= from_bci);
1212   if (is_profiling()) {
1213     compilation()->set_would_profile(true);
1214     x->set_profiled_bci(bci());
1215     if (profile_branches()) {
1216       x->set_profiled_method(method());
1217       x->set_should_profile(true);
1218     }
1219   }
1220   append(x);
1221 }
1222 
1223 
1224 void GraphBuilder::if_node(Value x, If::Condition cond, Value y, ValueStack* state_before) {
1225   BlockBegin* tsux = block_at(stream()->get_dest());
1226   BlockBegin* fsux = block_at(stream()->next_bci());
1227   bool is_bb = tsux->bci() < stream()->cur_bci() || fsux->bci() < stream()->cur_bci();
1228   // In case of loop invariant code motion or predicate insertion
1229   // before the body of a loop the state is needed
1230   Instruction *i = append(new If(x, cond, false, y, tsux, fsux, (is_bb || compilation()->is_optimistic()) ? state_before : NULL, is_bb));
1231 
1232   assert(i->as_Goto() == NULL ||
1233          (i->as_Goto()->sux_at(0) == tsux  && i->as_Goto()->is_safepoint() == tsux->bci() < stream()->cur_bci()) ||
1234          (i->as_Goto()->sux_at(0) == fsux  && i->as_Goto()->is_safepoint() == fsux->bci() < stream()->cur_bci()),
1235          "safepoint state of Goto returned by canonicalizer incorrect");
1236 
1237   if (is_profiling()) {
1238     If* if_node = i->as_If();
1239     if (if_node != NULL) {
1240       // Note that we'd collect profile data in this method if we wanted it.
1241       compilation()->set_would_profile(true);
1242       // At level 2 we need the proper bci to count backedges
1243       if_node->set_profiled_bci(bci());
1244       if (profile_branches()) {
1245         // Successors can be rotated by the canonicalizer, check for this case.
1246         if_node->set_profiled_method(method());
1247         if_node->set_should_profile(true);
1248         if (if_node->tsux() == fsux) {
1249           if_node->set_swapped(true);
1250         }
1251       }
1252       return;
1253     }
1254 
1255     // Check if this If was reduced to Goto.
1256     Goto *goto_node = i->as_Goto();
1257     if (goto_node != NULL) {
1258       compilation()->set_would_profile(true);
1259       goto_node->set_profiled_bci(bci());
1260       if (profile_branches()) {
1261         goto_node->set_profiled_method(method());
1262         goto_node->set_should_profile(true);
1263         // Find out which successor is used.
1264         if (goto_node->default_sux() == tsux) {
1265           goto_node->set_direction(Goto::taken);
1266         } else if (goto_node->default_sux() == fsux) {
1267           goto_node->set_direction(Goto::not_taken);
1268         } else {
1269           ShouldNotReachHere();
1270         }
1271       }
1272       return;
1273     }
1274   }
1275 }
1276 
1277 
1278 void GraphBuilder::if_zero(ValueType* type, If::Condition cond) {
1279   Value y = append(new Constant(intZero));
1280   ValueStack* state_before = copy_state_before();
1281   Value x = ipop();
1282   if_node(x, cond, y, state_before);
1283 }
1284 
1285 
1286 void GraphBuilder::if_null(ValueType* type, If::Condition cond) {
1287   Value y = append(new Constant(objectNull));
1288   ValueStack* state_before = copy_state_before();
1289   Value x = apop();
1290   if_node(x, cond, y, state_before);
1291 }
1292 
1293 
1294 void GraphBuilder::if_same(ValueType* type, If::Condition cond) {
1295   ValueStack* state_before = copy_state_before();
1296   Value y = pop(type);
1297   Value x = pop(type);
1298   if_node(x, cond, y, state_before);
1299 }
1300 
1301 
1302 void GraphBuilder::jsr(int dest) {
1303   // We only handle well-formed jsrs (those which are "block-structured").
1304   // If the bytecodes are strange (jumping out of a jsr block) then we
1305   // might end up trying to re-parse a block containing a jsr which
1306   // has already been activated. Watch for this case and bail out.
1307   for (ScopeData* cur_scope_data = scope_data();
1308        cur_scope_data != NULL && cur_scope_data->parsing_jsr() && cur_scope_data->scope() == scope();
1309        cur_scope_data = cur_scope_data->parent()) {
1310     if (cur_scope_data->jsr_entry_bci() == dest) {
1311       BAILOUT("too-complicated jsr/ret structure");
1312     }
1313   }
1314 
1315   push(addressType, append(new Constant(new AddressConstant(next_bci()))));
1316   if (!try_inline_jsr(dest)) {
1317     return; // bailed out while parsing and inlining subroutine
1318   }
1319 }
1320 
1321 
1322 void GraphBuilder::ret(int local_index) {
1323   if (!parsing_jsr()) BAILOUT("ret encountered while not parsing subroutine");
1324 
1325   if (local_index != scope_data()->jsr_return_address_local()) {
1326     BAILOUT("can not handle complicated jsr/ret constructs");
1327   }
1328 
1329   // Rets simply become (NON-SAFEPOINT) gotos to the jsr continuation
1330   append(new Goto(scope_data()->jsr_continuation(), false));
1331 }
1332 
1333 
1334 void GraphBuilder::table_switch() {
1335   Bytecode_tableswitch sw(stream());
1336   const int l = sw.length();
1337   if (CanonicalizeNodes && l == 1 && compilation()->env()->comp_level() != CompLevel_full_profile) {
1338     // total of 2 successors => use If instead of switch
1339     // Note: This code should go into the canonicalizer as soon as it can
1340     //       can handle canonicalized forms that contain more than one node.
1341     Value key = append(new Constant(new IntConstant(sw.low_key())));
1342     BlockBegin* tsux = block_at(bci() + sw.dest_offset_at(0));
1343     BlockBegin* fsux = block_at(bci() + sw.default_offset());
1344     bool is_bb = tsux->bci() < bci() || fsux->bci() < bci();
1345     // In case of loop invariant code motion or predicate insertion
1346     // before the body of a loop the state is needed
1347     ValueStack* state_before = copy_state_if_bb(is_bb);
1348     append(new If(ipop(), If::eql, true, key, tsux, fsux, state_before, is_bb));
1349   } else {
1350     // collect successors
1351     BlockList* sux = new BlockList(l + 1, NULL);
1352     int i;
1353     bool has_bb = false;
1354     for (i = 0; i < l; i++) {
1355       sux->at_put(i, block_at(bci() + sw.dest_offset_at(i)));
1356       if (sw.dest_offset_at(i) < 0) has_bb = true;
1357     }
1358     // add default successor
1359     if (sw.default_offset() < 0) has_bb = true;
1360     sux->at_put(i, block_at(bci() + sw.default_offset()));
1361     // In case of loop invariant code motion or predicate insertion
1362     // before the body of a loop the state is needed
1363     ValueStack* state_before = copy_state_if_bb(has_bb);
1364     Instruction* res = append(new TableSwitch(ipop(), sux, sw.low_key(), state_before, has_bb));
1365 #ifdef ASSERT
1366     if (res->as_Goto()) {
1367       for (i = 0; i < l; i++) {
1368         if (sux->at(i) == res->as_Goto()->sux_at(0)) {
1369           assert(res->as_Goto()->is_safepoint() == sw.dest_offset_at(i) < 0, "safepoint state of Goto returned by canonicalizer incorrect");
1370         }
1371       }
1372     }
1373 #endif
1374   }
1375 }
1376 
1377 
1378 void GraphBuilder::lookup_switch() {
1379   Bytecode_lookupswitch sw(stream());
1380   const int l = sw.number_of_pairs();
1381   if (CanonicalizeNodes && l == 1 && compilation()->env()->comp_level() != CompLevel_full_profile) {
1382     // total of 2 successors => use If instead of switch
1383     // Note: This code should go into the canonicalizer as soon as it can
1384     //       can handle canonicalized forms that contain more than one node.
1385     // simplify to If
1386     LookupswitchPair pair = sw.pair_at(0);
1387     Value key = append(new Constant(new IntConstant(pair.match())));
1388     BlockBegin* tsux = block_at(bci() + pair.offset());
1389     BlockBegin* fsux = block_at(bci() + sw.default_offset());
1390     bool is_bb = tsux->bci() < bci() || fsux->bci() < bci();
1391     // In case of loop invariant code motion or predicate insertion
1392     // before the body of a loop the state is needed
1393     ValueStack* state_before = copy_state_if_bb(is_bb);;
1394     append(new If(ipop(), If::eql, true, key, tsux, fsux, state_before, is_bb));
1395   } else {
1396     // collect successors & keys
1397     BlockList* sux = new BlockList(l + 1, NULL);
1398     intArray* keys = new intArray(l, l, 0);
1399     int i;
1400     bool has_bb = false;
1401     for (i = 0; i < l; i++) {
1402       LookupswitchPair pair = sw.pair_at(i);
1403       if (pair.offset() < 0) has_bb = true;
1404       sux->at_put(i, block_at(bci() + pair.offset()));
1405       keys->at_put(i, pair.match());
1406     }
1407     // add default successor
1408     if (sw.default_offset() < 0) has_bb = true;
1409     sux->at_put(i, block_at(bci() + sw.default_offset()));
1410     // In case of loop invariant code motion or predicate insertion
1411     // before the body of a loop the state is needed
1412     ValueStack* state_before = copy_state_if_bb(has_bb);
1413     Instruction* res = append(new LookupSwitch(ipop(), sux, keys, state_before, has_bb));
1414 #ifdef ASSERT
1415     if (res->as_Goto()) {
1416       for (i = 0; i < l; i++) {
1417         if (sux->at(i) == res->as_Goto()->sux_at(0)) {
1418           assert(res->as_Goto()->is_safepoint() == sw.pair_at(i).offset() < 0, "safepoint state of Goto returned by canonicalizer incorrect");
1419         }
1420       }
1421     }
1422 #endif
1423   }
1424 }
1425 
1426 void GraphBuilder::call_register_finalizer() {
1427   // If the receiver requires finalization then emit code to perform
1428   // the registration on return.
1429 
1430   // Gather some type information about the receiver
1431   Value receiver = state()->local_at(0);
1432   assert(receiver != NULL, "must have a receiver");
1433   ciType* declared_type = receiver->declared_type();
1434   ciType* exact_type = receiver->exact_type();
1435   if (exact_type == NULL &&
1436       receiver->as_Local() &&
1437       receiver->as_Local()->java_index() == 0) {
1438     ciInstanceKlass* ik = compilation()->method()->holder();
1439     if (ik->is_final()) {
1440       exact_type = ik;
1441     } else if (UseCHA && !(ik->has_subklass() || ik->is_interface())) {
1442       // test class is leaf class
1443       compilation()->dependency_recorder()->assert_leaf_type(ik);
1444       exact_type = ik;
1445     } else {
1446       declared_type = ik;
1447     }
1448   }
1449 
1450   // see if we know statically that registration isn't required
1451   bool needs_check = true;
1452   if (exact_type != NULL) {
1453     needs_check = exact_type->as_instance_klass()->has_finalizer();
1454   } else if (declared_type != NULL) {
1455     ciInstanceKlass* ik = declared_type->as_instance_klass();
1456     if (!Dependencies::has_finalizable_subclass(ik)) {
1457       compilation()->dependency_recorder()->assert_has_no_finalizable_subclasses(ik);
1458       needs_check = false;
1459     }
1460   }
1461 
1462   if (needs_check) {
1463     // Perform the registration of finalizable objects.
1464     ValueStack* state_before = copy_state_for_exception();
1465     load_local(objectType, 0);
1466     append_split(new Intrinsic(voidType, vmIntrinsics::_Object_init,
1467                                state()->pop_arguments(1),
1468                                true, state_before, true));
1469   }
1470 }
1471 
1472 
1473 void GraphBuilder::method_return(Value x, bool ignore_return) {
1474   if (RegisterFinalizersAtInit &&
1475       method()->intrinsic_id() == vmIntrinsics::_Object_init) {
1476     call_register_finalizer();
1477   }
1478 
1479   // The conditions for a memory barrier are described in Parse::do_exits().
1480   bool need_mem_bar = false;
1481   if (method()->name() == ciSymbols::object_initializer_name() &&
1482        (scope()->wrote_final() ||
1483          (AlwaysSafeConstructors && scope()->wrote_fields()) ||
1484          (support_IRIW_for_not_multiple_copy_atomic_cpu && scope()->wrote_volatile()))) {
1485     need_mem_bar = true;
1486   }
1487 
1488   BasicType bt = method()->return_type()->basic_type();
1489   switch (bt) {
1490     case T_BYTE:
1491     {
1492       Value shift = append(new Constant(new IntConstant(24)));
1493       x = append(new ShiftOp(Bytecodes::_ishl, x, shift));
1494       x = append(new ShiftOp(Bytecodes::_ishr, x, shift));
1495       break;
1496     }
1497     case T_SHORT:
1498     {
1499       Value shift = append(new Constant(new IntConstant(16)));
1500       x = append(new ShiftOp(Bytecodes::_ishl, x, shift));
1501       x = append(new ShiftOp(Bytecodes::_ishr, x, shift));
1502       break;
1503     }
1504     case T_CHAR:
1505     {
1506       Value mask = append(new Constant(new IntConstant(0xFFFF)));
1507       x = append(new LogicOp(Bytecodes::_iand, x, mask));
1508       break;
1509     }
1510     case T_BOOLEAN:
1511     {
1512       Value mask = append(new Constant(new IntConstant(1)));
1513       x = append(new LogicOp(Bytecodes::_iand, x, mask));
1514       break;
1515     }
1516     default:
1517       break;
1518   }
1519 
1520   // Check to see whether we are inlining. If so, Return
1521   // instructions become Gotos to the continuation point.
1522   if (continuation() != NULL) {
1523 
1524     int invoke_bci = state()->caller_state()->bci();
1525 
1526     if (x != NULL  && !ignore_return) {
1527       ciMethod* caller = state()->scope()->caller()->method();
1528       Bytecodes::Code invoke_raw_bc = caller->raw_code_at_bci(invoke_bci);
1529       if (invoke_raw_bc == Bytecodes::_invokehandle || invoke_raw_bc == Bytecodes::_invokedynamic) {
1530         ciType* declared_ret_type = caller->get_declared_signature_at_bci(invoke_bci)->return_type();
1531         if (declared_ret_type->is_klass() && x->exact_type() == NULL &&
1532             x->declared_type() != declared_ret_type && declared_ret_type != compilation()->env()->Object_klass()) {
1533           x = append(new TypeCast(declared_ret_type->as_klass(), x, copy_state_before()));
1534         }
1535       }
1536     }
1537 
1538     assert(!method()->is_synchronized() || InlineSynchronizedMethods, "can not inline synchronized methods yet");
1539 
1540     if (compilation()->env()->dtrace_method_probes()) {
1541       // Report exit from inline methods
1542       Values* args = new Values(1);
1543       args->push(append(new Constant(new MethodConstant(method()))));
1544       append(new RuntimeCall(voidType, "dtrace_method_exit", CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_method_exit), args));
1545     }
1546 
1547     // If the inlined method is synchronized, the monitor must be
1548     // released before we jump to the continuation block.
1549     if (method()->is_synchronized()) {
1550       assert(state()->locks_size() == 1, "receiver must be locked here");
1551       monitorexit(state()->lock_at(0), SynchronizationEntryBCI);
1552     }
1553 
1554     if (need_mem_bar) {
1555       append(new MemBar(lir_membar_storestore));
1556     }
1557 
1558     // State at end of inlined method is the state of the caller
1559     // without the method parameters on stack, including the
1560     // return value, if any, of the inlined method on operand stack.
1561     set_state(state()->caller_state()->copy_for_parsing());
1562     if (x != NULL) {
1563       if (!ignore_return) {
1564         state()->push(x->type(), x);
1565       }
1566       if (profile_return() && x->type()->is_object_kind()) {
1567         ciMethod* caller = state()->scope()->method();
1568         profile_return_type(x, method(), caller, invoke_bci);
1569       }
1570     }
1571     Goto* goto_callee = new Goto(continuation(), false);
1572 
1573     // See whether this is the first return; if so, store off some
1574     // of the state for later examination
1575     if (num_returns() == 0) {
1576       set_inline_cleanup_info();
1577     }
1578 
1579     // The current bci() is in the wrong scope, so use the bci() of
1580     // the continuation point.
1581     append_with_bci(goto_callee, scope_data()->continuation()->bci());
1582     incr_num_returns();
1583     return;
1584   }
1585 
1586   state()->truncate_stack(0);
1587   if (method()->is_synchronized()) {
1588     // perform the unlocking before exiting the method
1589     Value receiver;
1590     if (!method()->is_static()) {
1591       receiver = _initial_state->local_at(0);
1592     } else {
1593       receiver = append(new Constant(new ClassConstant(method()->holder())));
1594     }
1595     append_split(new MonitorExit(receiver, state()->unlock()));
1596   }
1597 
1598   if (need_mem_bar) {
1599       append(new MemBar(lir_membar_storestore));
1600   }
1601 
1602   assert(!ignore_return, "Ignoring return value works only for inlining");
1603   append(new Return(x));
1604 }
1605 
1606 Value GraphBuilder::make_constant(ciConstant field_value, ciField* field) {
1607   if (!field_value.is_valid())  return NULL;
1608 
1609   BasicType field_type = field_value.basic_type();
1610   ValueType* value = as_ValueType(field_value);
1611 
1612   // Attach dimension info to stable arrays.
1613   if (FoldStableValues &&
1614       field->is_stable() && field_type == T_ARRAY && !field_value.is_null_or_zero()) {
1615     ciArray* array = field_value.as_object()->as_array();
1616     jint dimension = field->type()->as_array_klass()->dimension();
1617     value = new StableArrayConstant(array, dimension);
1618   }
1619 
1620   switch (field_type) {
1621     case T_ARRAY:
1622     case T_OBJECT:
1623       if (field_value.as_object()->should_be_constant()) {
1624         return new Constant(value);
1625       }
1626       return NULL; // Not a constant.
1627     default:
1628       return new Constant(value);
1629   }
1630 }
1631 
1632 void GraphBuilder::access_field(Bytecodes::Code code) {
1633   bool will_link;
1634   ciField* field = stream()->get_field(will_link);
1635   ciInstanceKlass* holder = field->holder();
1636   BasicType field_type = field->type()->basic_type();
1637   ValueType* type = as_ValueType(field_type);
1638   // call will_link again to determine if the field is valid.
1639   const bool needs_patching = !holder->is_loaded() ||
1640                               !field->will_link(method(), code) ||
1641                               PatchALot;
1642 
1643   ValueStack* state_before = NULL;
1644   if (!holder->is_initialized() || needs_patching) {
1645     // save state before instruction for debug info when
1646     // deoptimization happens during patching
1647     state_before = copy_state_before();
1648   }
1649 
1650   Value obj = NULL;
1651   if (code == Bytecodes::_getstatic || code == Bytecodes::_putstatic) {
1652     if (state_before != NULL) {
1653       // build a patching constant
1654       obj = new Constant(new InstanceConstant(holder->java_mirror()), state_before);
1655     } else {
1656       obj = new Constant(new InstanceConstant(holder->java_mirror()));
1657     }
1658   }
1659 
1660   if (field->is_final() && (code == Bytecodes::_putfield)) {
1661     scope()->set_wrote_final();
1662   }
1663 
1664   if (code == Bytecodes::_putfield) {
1665     scope()->set_wrote_fields();
1666     if (field->is_volatile()) {
1667       scope()->set_wrote_volatile();
1668     }
1669   }
1670 
1671   const int offset = !needs_patching ? field->offset() : -1;
1672   switch (code) {
1673     case Bytecodes::_getstatic: {
1674       // check for compile-time constants, i.e., initialized static final fields
1675       Value constant = NULL;
1676       if (field->is_static_constant() && !PatchALot) {
1677         ciConstant field_value = field->constant_value();
1678         assert(!field->is_stable() || !field_value.is_null_or_zero(),
1679                "stable static w/ default value shouldn't be a constant");
1680         constant = make_constant(field_value, field);
1681       }
1682       if (constant != NULL) {
1683         push(type, append(constant));
1684       } else {
1685         if (state_before == NULL) {
1686           state_before = copy_state_for_exception();
1687         }
1688         push(type, append(new LoadField(append(obj), offset, field, true,
1689                                         state_before, needs_patching)));
1690       }
1691       break;
1692     }
1693     case Bytecodes::_putstatic: {
1694       Value val = pop(type);
1695       if (state_before == NULL) {
1696         state_before = copy_state_for_exception();
1697       }
1698       if (field->type()->basic_type() == T_BOOLEAN) {
1699         Value mask = append(new Constant(new IntConstant(1)));
1700         val = append(new LogicOp(Bytecodes::_iand, val, mask));
1701       }
1702       append(new StoreField(append(obj), offset, field, val, true, state_before, needs_patching));
1703       break;
1704     }
1705     case Bytecodes::_getfield: {
1706       // Check for compile-time constants, i.e., trusted final non-static fields.
1707       Value constant = NULL;
1708       obj = apop();
1709       ObjectType* obj_type = obj->type()->as_ObjectType();
1710       if (field->is_constant() && obj_type->is_constant() && !PatchALot) {
1711         ciObject* const_oop = obj_type->constant_value();
1712         if (!const_oop->is_null_object() && const_oop->is_loaded()) {
1713           ciConstant field_value = field->constant_value_of(const_oop);
1714           if (field_value.is_valid()) {
1715             constant = make_constant(field_value, field);
1716             // For CallSite objects add a dependency for invalidation of the optimization.
1717             if (field->is_call_site_target()) {
1718               ciCallSite* call_site = const_oop->as_call_site();
1719               if (!call_site->is_fully_initialized_constant_call_site()) {
1720                 ciMethodHandle* target = field_value.as_object()->as_method_handle();
1721                 dependency_recorder()->assert_call_site_target_value(call_site, target);
1722               }
1723             }
1724           }
1725         }
1726       }
1727       if (constant != NULL) {
1728         push(type, append(constant));
1729       } else {
1730         if (state_before == NULL) {
1731           state_before = copy_state_for_exception();
1732         }
1733         LoadField* load = new LoadField(obj, offset, field, false, state_before, needs_patching);
1734         Value replacement = !needs_patching ? _memory->load(load) : load;
1735         if (replacement != load) {
1736           assert(replacement->is_linked() || !replacement->can_be_linked(), "should already by linked");
1737           // Writing an (integer) value to a boolean, byte, char or short field includes an implicit narrowing
1738           // conversion. Emit an explicit conversion here to get the correct field value after the write.
1739           BasicType bt = field->type()->basic_type();
1740           switch (bt) {
1741           case T_BOOLEAN:
1742           case T_BYTE:
1743             replacement = append(new Convert(Bytecodes::_i2b, replacement, as_ValueType(bt)));
1744             break;
1745           case T_CHAR:
1746             replacement = append(new Convert(Bytecodes::_i2c, replacement, as_ValueType(bt)));
1747             break;
1748           case T_SHORT:
1749             replacement = append(new Convert(Bytecodes::_i2s, replacement, as_ValueType(bt)));
1750             break;
1751           default:
1752             break;
1753           }
1754           push(type, replacement);
1755         } else {
1756           push(type, append(load));
1757         }
1758       }
1759       break;
1760     }
1761     case Bytecodes::_putfield: {
1762       Value val = pop(type);
1763       obj = apop();
1764       if (state_before == NULL) {
1765         state_before = copy_state_for_exception();
1766       }
1767       if (field->type()->basic_type() == T_BOOLEAN) {
1768         Value mask = append(new Constant(new IntConstant(1)));
1769         val = append(new LogicOp(Bytecodes::_iand, val, mask));
1770       }
1771       StoreField* store = new StoreField(obj, offset, field, val, false, state_before, needs_patching);
1772       if (!needs_patching) store = _memory->store(store);
1773       if (store != NULL) {
1774         append(store);
1775       }
1776       break;
1777     }
1778     default:
1779       ShouldNotReachHere();
1780       break;
1781   }
1782 }
1783 
1784 
1785 Dependencies* GraphBuilder::dependency_recorder() const {
1786   assert(DeoptC1, "need debug information");
1787   return compilation()->dependency_recorder();
1788 }
1789 
1790 // How many arguments do we want to profile?
1791 Values* GraphBuilder::args_list_for_profiling(ciMethod* target, int& start, bool may_have_receiver) {
1792   int n = 0;
1793   bool has_receiver = may_have_receiver && Bytecodes::has_receiver(method()->java_code_at_bci(bci()));
1794   start = has_receiver ? 1 : 0;
1795   if (profile_arguments()) {
1796     ciProfileData* data = method()->method_data()->bci_to_data(bci());
1797     if (data != NULL && (data->is_CallTypeData() || data->is_VirtualCallTypeData())) {
1798       n = data->is_CallTypeData() ? data->as_CallTypeData()->number_of_arguments() : data->as_VirtualCallTypeData()->number_of_arguments();
1799     }
1800   }
1801   // If we are inlining then we need to collect arguments to profile parameters for the target
1802   if (profile_parameters() && target != NULL) {
1803     if (target->method_data() != NULL && target->method_data()->parameters_type_data() != NULL) {
1804       // The receiver is profiled on method entry so it's included in
1805       // the number of parameters but here we're only interested in
1806       // actual arguments.
1807       n = MAX2(n, target->method_data()->parameters_type_data()->number_of_parameters() - start);
1808     }
1809   }
1810   if (n > 0) {
1811     return new Values(n);
1812   }
1813   return NULL;
1814 }
1815 
1816 void GraphBuilder::check_args_for_profiling(Values* obj_args, int expected) {
1817 #ifdef ASSERT
1818   bool ignored_will_link;
1819   ciSignature* declared_signature = NULL;
1820   ciMethod* real_target = method()->get_method_at_bci(bci(), ignored_will_link, &declared_signature);
1821   assert(expected == obj_args->max_length() || real_target->is_method_handle_intrinsic(), "missed on arg?");
1822 #endif
1823 }
1824 
1825 // Collect arguments that we want to profile in a list
1826 Values* GraphBuilder::collect_args_for_profiling(Values* args, ciMethod* target, bool may_have_receiver) {
1827   int start = 0;
1828   Values* obj_args = args_list_for_profiling(target, start, may_have_receiver);
1829   if (obj_args == NULL) {
1830     return NULL;
1831   }
1832   int s = obj_args->max_length();
1833   // if called through method handle invoke, some arguments may have been popped
1834   for (int i = start, j = 0; j < s && i < args->length(); i++) {
1835     if (args->at(i)->type()->is_object_kind()) {
1836       obj_args->push(args->at(i));
1837       j++;
1838     }
1839   }
1840   check_args_for_profiling(obj_args, s);
1841   return obj_args;
1842 }
1843 
1844 
1845 void GraphBuilder::invoke(Bytecodes::Code code) {
1846   bool will_link;
1847   ciSignature* declared_signature = NULL;
1848   ciMethod*             target = stream()->get_method(will_link, &declared_signature);
1849   ciKlass*              holder = stream()->get_declared_method_holder();
1850   const Bytecodes::Code bc_raw = stream()->cur_bc_raw();
1851   assert(declared_signature != NULL, "cannot be null");
1852   assert(will_link == target->is_loaded(), "");
1853 
1854   ciInstanceKlass* klass = target->holder();
1855   assert(!target->is_loaded() || klass->is_loaded(), "loaded target must imply loaded klass");
1856 
1857   // check if CHA possible: if so, change the code to invoke_special
1858   ciInstanceKlass* calling_klass = method()->holder();
1859   ciInstanceKlass* callee_holder = ciEnv::get_instance_klass_for_declared_method_holder(holder);
1860   ciInstanceKlass* actual_recv = callee_holder;
1861 
1862   CompileLog* log = compilation()->log();
1863   if (log != NULL)
1864       log->elem("call method='%d' instr='%s'",
1865                 log->identify(target),
1866                 Bytecodes::name(code));
1867 
1868   // invoke-special-super
1869   if (bc_raw == Bytecodes::_invokespecial && !target->is_object_initializer()) {
1870     ciInstanceKlass* sender_klass = calling_klass;
1871     if (sender_klass->is_interface()) {
1872       int index = state()->stack_size() - (target->arg_size_no_receiver() + 1);
1873       Value receiver = state()->stack_at(index);
1874       CheckCast* c = new CheckCast(sender_klass, receiver, copy_state_before());
1875       c->set_invokespecial_receiver_check();
1876       state()->stack_at_put(index, append_split(c));
1877     }
1878   }
1879 
1880   // Some methods are obviously bindable without any type checks so
1881   // convert them directly to an invokespecial or invokestatic.
1882   if (target->is_loaded() && !target->is_abstract() && target->can_be_statically_bound()) {
1883     switch (bc_raw) {
1884     case Bytecodes::_invokevirtual:
1885       code = Bytecodes::_invokespecial;
1886       break;
1887     case Bytecodes::_invokehandle:
1888       code = target->is_static() ? Bytecodes::_invokestatic : Bytecodes::_invokespecial;
1889       break;
1890     default:
1891       break;
1892     }
1893   } else {
1894     if (bc_raw == Bytecodes::_invokehandle) {
1895       assert(!will_link, "should come here only for unlinked call");
1896       code = Bytecodes::_invokespecial;
1897     }
1898   }
1899 
1900   // Push appendix argument (MethodType, CallSite, etc.), if one.
1901   bool patch_for_appendix = false;
1902   int patching_appendix_arg = 0;
1903   if (Bytecodes::has_optional_appendix(bc_raw) && (!will_link || PatchALot)) {
1904     Value arg = append(new Constant(new ObjectConstant(compilation()->env()->unloaded_ciinstance()), copy_state_before()));
1905     apush(arg);
1906     patch_for_appendix = true;
1907     patching_appendix_arg = (will_link && stream()->has_appendix()) ? 0 : 1;
1908   } else if (stream()->has_appendix()) {
1909     ciObject* appendix = stream()->get_appendix();
1910     Value arg = append(new Constant(new ObjectConstant(appendix)));
1911     apush(arg);
1912   }
1913 
1914   ciMethod* cha_monomorphic_target = NULL;
1915   ciMethod* exact_target = NULL;
1916   Value better_receiver = NULL;
1917   if (UseCHA && DeoptC1 && target->is_loaded() &&
1918       !(// %%% FIXME: Are both of these relevant?
1919         target->is_method_handle_intrinsic() ||
1920         target->is_compiled_lambda_form()) &&
1921       !patch_for_appendix) {
1922     Value receiver = NULL;
1923     ciInstanceKlass* receiver_klass = NULL;
1924     bool type_is_exact = false;
1925     // try to find a precise receiver type
1926     if (will_link && !target->is_static()) {
1927       int index = state()->stack_size() - (target->arg_size_no_receiver() + 1);
1928       receiver = state()->stack_at(index);
1929       ciType* type = receiver->exact_type();
1930       if (type != NULL && type->is_loaded() &&
1931           type->is_instance_klass() && !type->as_instance_klass()->is_interface()) {
1932         receiver_klass = (ciInstanceKlass*) type;
1933         type_is_exact = true;
1934       }
1935       if (type == NULL) {
1936         type = receiver->declared_type();
1937         if (type != NULL && type->is_loaded() &&
1938             type->is_instance_klass() && !type->as_instance_klass()->is_interface()) {
1939           receiver_klass = (ciInstanceKlass*) type;
1940           if (receiver_klass->is_leaf_type() && !receiver_klass->is_final()) {
1941             // Insert a dependency on this type since
1942             // find_monomorphic_target may assume it's already done.
1943             dependency_recorder()->assert_leaf_type(receiver_klass);
1944             type_is_exact = true;
1945           }
1946         }
1947       }
1948     }
1949     if (receiver_klass != NULL && type_is_exact &&
1950         receiver_klass->is_loaded() && code != Bytecodes::_invokespecial) {
1951       // If we have the exact receiver type we can bind directly to
1952       // the method to call.
1953       exact_target = target->resolve_invoke(calling_klass, receiver_klass);
1954       if (exact_target != NULL) {
1955         target = exact_target;
1956         code = Bytecodes::_invokespecial;
1957       }
1958     }
1959     if (receiver_klass != NULL &&
1960         receiver_klass->is_subtype_of(actual_recv) &&
1961         actual_recv->is_initialized()) {
1962       actual_recv = receiver_klass;
1963     }
1964 
1965     if ((code == Bytecodes::_invokevirtual && callee_holder->is_initialized()) ||
1966         (code == Bytecodes::_invokeinterface && callee_holder->is_initialized() && !actual_recv->is_interface())) {
1967       // Use CHA on the receiver to select a more precise method.
1968       cha_monomorphic_target = target->find_monomorphic_target(calling_klass, callee_holder, actual_recv);
1969     } else if (code == Bytecodes::_invokeinterface && callee_holder->is_loaded() && receiver != NULL) {
1970       assert(callee_holder->is_interface(), "invokeinterface to non interface?");
1971       // If there is only one implementor of this interface then we
1972       // may be able bind this invoke directly to the implementing
1973       // klass but we need both a dependence on the single interface
1974       // and on the method we bind to.  Additionally since all we know
1975       // about the receiver type is the it's supposed to implement the
1976       // interface we have to insert a check that it's the class we
1977       // expect.  Interface types are not checked by the verifier so
1978       // they are roughly equivalent to Object.
1979       // The number of implementors for declared_interface is less or
1980       // equal to the number of implementors for target->holder() so
1981       // if number of implementors of target->holder() == 1 then
1982       // number of implementors for decl_interface is 0 or 1. If
1983       // it's 0 then no class implements decl_interface and there's
1984       // no point in inlining.
1985       ciInstanceKlass* declared_interface = callee_holder;
1986       ciInstanceKlass* singleton = declared_interface->unique_implementor();
1987       if (singleton != NULL) {
1988         assert(singleton != declared_interface, "not a unique implementor");
1989         cha_monomorphic_target = target->find_monomorphic_target(calling_klass, declared_interface, singleton);
1990         if (cha_monomorphic_target != NULL) {
1991           if (cha_monomorphic_target->holder() != compilation()->env()->Object_klass()) {
1992             // If CHA is able to bind this invoke then update the class
1993             // to match that class, otherwise klass will refer to the
1994             // interface.
1995             klass = cha_monomorphic_target->holder();
1996             actual_recv = declared_interface;
1997 
1998             // insert a check it's really the expected class.
1999             CheckCast* c = new CheckCast(klass, receiver, copy_state_for_exception());
2000             c->set_incompatible_class_change_check();
2001             c->set_direct_compare(klass->is_final());
2002             // pass the result of the checkcast so that the compiler has
2003             // more accurate type info in the inlinee
2004             better_receiver = append_split(c);
2005           } else {
2006             cha_monomorphic_target = NULL; // subtype check against Object is useless
2007           }
2008         }
2009       }
2010     }
2011   }
2012 
2013   if (cha_monomorphic_target != NULL) {
2014     assert(!target->can_be_statically_bound() || target == cha_monomorphic_target, "");
2015     assert(!cha_monomorphic_target->is_abstract(), "");
2016     if (!cha_monomorphic_target->can_be_statically_bound(actual_recv)) {
2017       // If we inlined because CHA revealed only a single target method,
2018       // then we are dependent on that target method not getting overridden
2019       // by dynamic class loading.  Be sure to test the "static" receiver
2020       // dest_method here, as opposed to the actual receiver, which may
2021       // falsely lead us to believe that the receiver is final or private.
2022       dependency_recorder()->assert_unique_concrete_method(actual_recv, cha_monomorphic_target, callee_holder, target);
2023     }
2024     code = Bytecodes::_invokespecial;
2025   }
2026 
2027   // check if we could do inlining
2028   if (!PatchALot && Inline && target->is_loaded() && callee_holder->is_linked() && !patch_for_appendix) {
2029     // callee is known => check if we have static binding
2030     if ((code == Bytecodes::_invokestatic && callee_holder->is_initialized()) || // invokestatic involves an initialization barrier on resolved klass
2031         code == Bytecodes::_invokespecial ||
2032         (code == Bytecodes::_invokevirtual && target->is_final_method()) ||
2033         code == Bytecodes::_invokedynamic) {
2034       // static binding => check if callee is ok
2035       ciMethod* inline_target = (cha_monomorphic_target != NULL) ? cha_monomorphic_target : target;
2036       bool holder_known = (cha_monomorphic_target != NULL) || (exact_target != NULL);
2037       bool success = try_inline(inline_target, holder_known, false /* ignore_return */, code, better_receiver);
2038 
2039       CHECK_BAILOUT();
2040       clear_inline_bailout();
2041 
2042       if (success) {
2043         // Register dependence if JVMTI has either breakpoint
2044         // setting or hotswapping of methods capabilities since they may
2045         // cause deoptimization.
2046         if (compilation()->env()->jvmti_can_hotswap_or_post_breakpoint()) {
2047           dependency_recorder()->assert_evol_method(inline_target);
2048         }
2049         return;
2050       }
2051     } else {
2052       print_inlining(target, "no static binding", /*success*/ false);
2053     }
2054   } else {
2055     print_inlining(target, "not inlineable", /*success*/ false);
2056   }
2057 
2058   // If we attempted an inline which did not succeed because of a
2059   // bailout during construction of the callee graph, the entire
2060   // compilation has to be aborted. This is fairly rare and currently
2061   // seems to only occur for jasm-generated classes which contain
2062   // jsr/ret pairs which are not associated with finally clauses and
2063   // do not have exception handlers in the containing method, and are
2064   // therefore not caught early enough to abort the inlining without
2065   // corrupting the graph. (We currently bail out with a non-empty
2066   // stack at a ret in these situations.)
2067   CHECK_BAILOUT();
2068 
2069   // inlining not successful => standard invoke
2070   ValueType* result_type = as_ValueType(declared_signature->return_type());
2071   ValueStack* state_before = copy_state_exhandling();
2072 
2073   // The bytecode (code) might change in this method so we are checking this very late.
2074   const bool has_receiver =
2075     code == Bytecodes::_invokespecial   ||
2076     code == Bytecodes::_invokevirtual   ||
2077     code == Bytecodes::_invokeinterface;
2078   Values* args = state()->pop_arguments(target->arg_size_no_receiver() + patching_appendix_arg);
2079   Value recv = has_receiver ? apop() : NULL;
2080 
2081   // A null check is required here (when there is a receiver) for any of the following cases
2082   // - invokespecial, always need a null check.
2083   // - invokevirtual, when the target is final and loaded. Calls to final targets will become optimized
2084   //   and require null checking. If the target is loaded a null check is emitted here.
2085   //   If the target isn't loaded the null check must happen after the call resolution. We achieve that
2086   //   by using the target methods unverified entry point (see CompiledIC::compute_monomorphic_entry).
2087   //   (The JVM specification requires that LinkageError must be thrown before a NPE. An unloaded target may
2088   //   potentially fail, and can't have the null check before the resolution.)
2089   // - A call that will be profiled. (But we can't add a null check when the target is unloaded, by the same
2090   //   reason as above, so calls with a receiver to unloaded targets can't be profiled.)
2091   //
2092   // Normal invokevirtual will perform the null check during lookup
2093 
2094   bool need_null_check = (code == Bytecodes::_invokespecial) ||
2095       (target->is_loaded() && (target->is_final_method() || (is_profiling() && profile_calls())));
2096 
2097   if (need_null_check) {
2098     if (recv != NULL) {
2099       null_check(recv);
2100     }
2101 
2102     if (is_profiling()) {
2103       // Note that we'd collect profile data in this method if we wanted it.
2104       compilation()->set_would_profile(true);
2105 
2106       if (profile_calls()) {
2107         assert(cha_monomorphic_target == NULL || exact_target == NULL, "both can not be set");
2108         ciKlass* target_klass = NULL;
2109         if (cha_monomorphic_target != NULL) {
2110           target_klass = cha_monomorphic_target->holder();
2111         } else if (exact_target != NULL) {
2112           target_klass = exact_target->holder();
2113         }
2114         profile_call(target, recv, target_klass, collect_args_for_profiling(args, NULL, false), false);
2115       }
2116     }
2117   }
2118 
2119   Invoke* result = new Invoke(code, result_type, recv, args, target, state_before);
2120   // push result
2121   append_split(result);
2122 
2123   if (result_type != voidType) {
2124     push(result_type, round_fp(result));
2125   }
2126   if (profile_return() && result_type->is_object_kind()) {
2127     profile_return_type(result, target);
2128   }
2129 }
2130 
2131 
2132 void GraphBuilder::new_instance(int klass_index) {
2133   ValueStack* state_before = copy_state_exhandling();
2134   bool will_link;
2135   ciKlass* klass = stream()->get_klass(will_link);
2136   assert(klass->is_instance_klass(), "must be an instance klass");
2137   NewInstance* new_instance = new NewInstance(klass->as_instance_klass(), state_before, stream()->is_unresolved_klass());
2138   _memory->new_instance(new_instance);
2139   apush(append_split(new_instance));
2140 }
2141 
2142 
2143 void GraphBuilder::new_type_array() {
2144   ValueStack* state_before = copy_state_exhandling();
2145   apush(append_split(new NewTypeArray(ipop(), (BasicType)stream()->get_index(), state_before)));
2146 }
2147 
2148 
2149 void GraphBuilder::new_object_array() {
2150   bool will_link;
2151   ciKlass* klass = stream()->get_klass(will_link);
2152   ValueStack* state_before = !klass->is_loaded() || PatchALot ? copy_state_before() : copy_state_exhandling();
2153   NewArray* n = new NewObjectArray(klass, ipop(), state_before);
2154   apush(append_split(n));
2155 }
2156 
2157 
2158 bool GraphBuilder::direct_compare(ciKlass* k) {
2159   if (k->is_loaded() && k->is_instance_klass() && !UseSlowPath) {
2160     ciInstanceKlass* ik = k->as_instance_klass();
2161     if (ik->is_final()) {
2162       return true;
2163     } else {
2164       if (DeoptC1 && UseCHA && !(ik->has_subklass() || ik->is_interface())) {
2165         // test class is leaf class
2166         dependency_recorder()->assert_leaf_type(ik);
2167         return true;
2168       }
2169     }
2170   }
2171   return false;
2172 }
2173 
2174 
2175 void GraphBuilder::check_cast(int klass_index) {
2176   bool will_link;
2177   ciKlass* klass = stream()->get_klass(will_link);
2178   ValueStack* state_before = !klass->is_loaded() || PatchALot ? copy_state_before() : copy_state_for_exception();
2179   CheckCast* c = new CheckCast(klass, apop(), state_before);
2180   apush(append_split(c));
2181   c->set_direct_compare(direct_compare(klass));
2182 
2183   if (is_profiling()) {
2184     // Note that we'd collect profile data in this method if we wanted it.
2185     compilation()->set_would_profile(true);
2186 
2187     if (profile_checkcasts()) {
2188       c->set_profiled_method(method());
2189       c->set_profiled_bci(bci());
2190       c->set_should_profile(true);
2191     }
2192   }
2193 }
2194 
2195 
2196 void GraphBuilder::instance_of(int klass_index) {
2197   bool will_link;
2198   ciKlass* klass = stream()->get_klass(will_link);
2199   ValueStack* state_before = !klass->is_loaded() || PatchALot ? copy_state_before() : copy_state_exhandling();
2200   InstanceOf* i = new InstanceOf(klass, apop(), state_before);
2201   ipush(append_split(i));
2202   i->set_direct_compare(direct_compare(klass));
2203 
2204   if (is_profiling()) {
2205     // Note that we'd collect profile data in this method if we wanted it.
2206     compilation()->set_would_profile(true);
2207 
2208     if (profile_checkcasts()) {
2209       i->set_profiled_method(method());
2210       i->set_profiled_bci(bci());
2211       i->set_should_profile(true);
2212     }
2213   }
2214 }
2215 
2216 
2217 void GraphBuilder::monitorenter(Value x, int bci) {
2218   // save state before locking in case of deoptimization after a NullPointerException
2219   ValueStack* state_before = copy_state_for_exception_with_bci(bci);

2220   append_with_bci(new MonitorEnter(x, state()->lock(x), state_before), bci);
2221   kill_all();
2222 }
2223 
2224 
2225 void GraphBuilder::monitorexit(Value x, int bci) {
2226   append_with_bci(new MonitorExit(x, state()->unlock()), bci);
2227   kill_all();
2228 }
2229 
2230 
2231 void GraphBuilder::new_multi_array(int dimensions) {
2232   bool will_link;
2233   ciKlass* klass = stream()->get_klass(will_link);
2234   ValueStack* state_before = !klass->is_loaded() || PatchALot ? copy_state_before() : copy_state_exhandling();
2235 
2236   Values* dims = new Values(dimensions, dimensions, NULL);
2237   // fill in all dimensions
2238   int i = dimensions;
2239   while (i-- > 0) dims->at_put(i, ipop());
2240   // create array
2241   NewArray* n = new NewMultiArray(klass, dims, state_before);
2242   apush(append_split(n));
2243 }
2244 
2245 
2246 void GraphBuilder::throw_op(int bci) {
2247   // We require that the debug info for a Throw be the "state before"
2248   // the Throw (i.e., exception oop is still on TOS)
2249   ValueStack* state_before = copy_state_before_with_bci(bci);
2250   Throw* t = new Throw(apop(), state_before);
2251   // operand stack not needed after a throw
2252   state()->truncate_stack(0);
2253   append_with_bci(t, bci);
2254 }
2255 
2256 
2257 Value GraphBuilder::round_fp(Value fp_value) {
2258   if (strict_fp_requires_explicit_rounding) {
2259 #ifdef IA32
2260     // no rounding needed if SSE2 is used
2261     if (UseSSE < 2) {
2262       // Must currently insert rounding node for doubleword values that
2263       // are results of expressions (i.e., not loads from memory or
2264       // constants)
2265       if (fp_value->type()->tag() == doubleTag &&
2266           fp_value->as_Constant() == NULL &&
2267           fp_value->as_Local() == NULL &&       // method parameters need no rounding
2268           fp_value->as_RoundFP() == NULL) {
2269         return append(new RoundFP(fp_value));
2270       }
2271     }
2272 #else
2273     Unimplemented();
2274 #endif // IA32
2275   }
2276   return fp_value;
2277 }
2278 
2279 
2280 Instruction* GraphBuilder::append_with_bci(Instruction* instr, int bci) {
2281   Canonicalizer canon(compilation(), instr, bci);
2282   Instruction* i1 = canon.canonical();
2283   if (i1->is_linked() || !i1->can_be_linked()) {
2284     // Canonicalizer returned an instruction which was already
2285     // appended so simply return it.
2286     return i1;
2287   }
2288 
2289   if (UseLocalValueNumbering) {
2290     // Lookup the instruction in the ValueMap and add it to the map if
2291     // it's not found.
2292     Instruction* i2 = vmap()->find_insert(i1);
2293     if (i2 != i1) {
2294       // found an entry in the value map, so just return it.
2295       assert(i2->is_linked(), "should already be linked");
2296       return i2;
2297     }
2298     ValueNumberingEffects vne(vmap());
2299     i1->visit(&vne);
2300   }
2301 
2302   // i1 was not eliminated => append it
2303   assert(i1->next() == NULL, "shouldn't already be linked");
2304   _last = _last->set_next(i1, canon.bci());
2305 
2306   if (++_instruction_count >= InstructionCountCutoff && !bailed_out()) {
2307     // set the bailout state but complete normal processing.  We
2308     // might do a little more work before noticing the bailout so we
2309     // want processing to continue normally until it's noticed.
2310     bailout("Method and/or inlining is too large");
2311   }
2312 
2313 #ifndef PRODUCT
2314   if (PrintIRDuringConstruction) {
2315     InstructionPrinter ip;
2316     ip.print_line(i1);
2317     if (Verbose) {
2318       state()->print();
2319     }
2320   }
2321 #endif
2322 
2323   // save state after modification of operand stack for StateSplit instructions
2324   StateSplit* s = i1->as_StateSplit();
2325   if (s != NULL) {
2326     if (EliminateFieldAccess) {
2327       Intrinsic* intrinsic = s->as_Intrinsic();
2328       if (s->as_Invoke() != NULL || (intrinsic && !intrinsic->preserves_state())) {
2329         _memory->kill();
2330       }
2331     }
2332     s->set_state(state()->copy(ValueStack::StateAfter, canon.bci()));
2333   }
2334 
2335   // set up exception handlers for this instruction if necessary
2336   if (i1->can_trap()) {
2337     i1->set_exception_handlers(handle_exception(i1));
2338     assert(i1->exception_state() != NULL || !i1->needs_exception_state() || bailed_out(), "handle_exception must set exception state");
2339   }
2340   return i1;
2341 }
2342 
2343 
2344 Instruction* GraphBuilder::append(Instruction* instr) {
2345   assert(instr->as_StateSplit() == NULL || instr->as_BlockEnd() != NULL, "wrong append used");
2346   return append_with_bci(instr, bci());
2347 }
2348 
2349 
2350 Instruction* GraphBuilder::append_split(StateSplit* instr) {
2351   return append_with_bci(instr, bci());
2352 }
2353 
2354 
2355 void GraphBuilder::null_check(Value value) {
2356   if (value->as_NewArray() != NULL || value->as_NewInstance() != NULL) {
2357     return;
2358   } else {
2359     Constant* con = value->as_Constant();
2360     if (con) {
2361       ObjectType* c = con->type()->as_ObjectType();
2362       if (c && c->is_loaded()) {
2363         ObjectConstant* oc = c->as_ObjectConstant();
2364         if (!oc || !oc->value()->is_null_object()) {
2365           return;
2366         }
2367       }
2368     }
2369   }
2370   append(new NullCheck(value, copy_state_for_exception()));
2371 }
2372 
2373 
2374 
2375 XHandlers* GraphBuilder::handle_exception(Instruction* instruction) {
2376   if (!has_handler() && (!instruction->needs_exception_state() || instruction->exception_state() != NULL)) {
2377     assert(instruction->exception_state() == NULL
2378            || instruction->exception_state()->kind() == ValueStack::EmptyExceptionState
2379            || (instruction->exception_state()->kind() == ValueStack::ExceptionState && _compilation->env()->should_retain_local_variables()),
2380            "exception_state should be of exception kind");
2381     return new XHandlers();
2382   }
2383 
2384   XHandlers*  exception_handlers = new XHandlers();
2385   ScopeData*  cur_scope_data = scope_data();
2386   ValueStack* cur_state = instruction->state_before();
2387   ValueStack* prev_state = NULL;
2388   int scope_count = 0;
2389 
2390   assert(cur_state != NULL, "state_before must be set");
2391   do {
2392     int cur_bci = cur_state->bci();
2393     assert(cur_scope_data->scope() == cur_state->scope(), "scopes do not match");
2394     assert(cur_bci == SynchronizationEntryBCI || cur_bci == cur_scope_data->stream()->cur_bci(), "invalid bci");
2395 
2396     // join with all potential exception handlers
2397     XHandlers* list = cur_scope_data->xhandlers();
2398     const int n = list->length();
2399     for (int i = 0; i < n; i++) {
2400       XHandler* h = list->handler_at(i);
2401       if (h->covers(cur_bci)) {
2402         // h is a potential exception handler => join it
2403         compilation()->set_has_exception_handlers(true);
2404 
2405         BlockBegin* entry = h->entry_block();
2406         if (entry == block()) {
2407           // It's acceptable for an exception handler to cover itself
2408           // but we don't handle that in the parser currently.  It's
2409           // very rare so we bailout instead of trying to handle it.
2410           BAILOUT_("exception handler covers itself", exception_handlers);
2411         }
2412         assert(entry->bci() == h->handler_bci(), "must match");
2413         assert(entry->bci() == -1 || entry == cur_scope_data->block_at(entry->bci()), "blocks must correspond");
2414 
2415         // previously this was a BAILOUT, but this is not necessary
2416         // now because asynchronous exceptions are not handled this way.
2417         assert(entry->state() == NULL || cur_state->total_locks_size() == entry->state()->total_locks_size(), "locks do not match");
2418 
2419         // xhandler start with an empty expression stack
2420         if (cur_state->stack_size() != 0) {
2421           cur_state = cur_state->copy(ValueStack::ExceptionState, cur_state->bci());
2422         }
2423         if (instruction->exception_state() == NULL) {
2424           instruction->set_exception_state(cur_state);
2425         }
2426 
2427         // Note: Usually this join must work. However, very
2428         // complicated jsr-ret structures where we don't ret from
2429         // the subroutine can cause the objects on the monitor
2430         // stacks to not match because blocks can be parsed twice.
2431         // The only test case we've seen so far which exhibits this
2432         // problem is caught by the infinite recursion test in
2433         // GraphBuilder::jsr() if the join doesn't work.
2434         if (!entry->try_merge(cur_state)) {
2435           BAILOUT_("error while joining with exception handler, prob. due to complicated jsr/rets", exception_handlers);
2436         }
2437 
2438         // add current state for correct handling of phi functions at begin of xhandler
2439         int phi_operand = entry->add_exception_state(cur_state);
2440 
2441         // add entry to the list of xhandlers of this block
2442         _block->add_exception_handler(entry);
2443 
2444         // add back-edge from xhandler entry to this block
2445         if (!entry->is_predecessor(_block)) {
2446           entry->add_predecessor(_block);
2447         }
2448 
2449         // clone XHandler because phi_operand and scope_count can not be shared
2450         XHandler* new_xhandler = new XHandler(h);
2451         new_xhandler->set_phi_operand(phi_operand);
2452         new_xhandler->set_scope_count(scope_count);
2453         exception_handlers->append(new_xhandler);
2454 
2455         // fill in exception handler subgraph lazily
2456         assert(!entry->is_set(BlockBegin::was_visited_flag), "entry must not be visited yet");
2457         cur_scope_data->add_to_work_list(entry);
2458 
2459         // stop when reaching catchall
2460         if (h->catch_type() == 0) {
2461           return exception_handlers;
2462         }
2463       }
2464     }
2465 
2466     if (exception_handlers->length() == 0) {
2467       // This scope and all callees do not handle exceptions, so the local
2468       // variables of this scope are not needed. However, the scope itself is
2469       // required for a correct exception stack trace -> clear out the locals.
2470       if (_compilation->env()->should_retain_local_variables()) {
2471         cur_state = cur_state->copy(ValueStack::ExceptionState, cur_state->bci());
2472       } else {
2473         cur_state = cur_state->copy(ValueStack::EmptyExceptionState, cur_state->bci());
2474       }
2475       if (prev_state != NULL) {
2476         prev_state->set_caller_state(cur_state);
2477       }
2478       if (instruction->exception_state() == NULL) {
2479         instruction->set_exception_state(cur_state);
2480       }
2481     }
2482 
2483     // Set up iteration for next time.
2484     // If parsing a jsr, do not grab exception handlers from the
2485     // parent scopes for this method (already got them, and they
2486     // needed to be cloned)
2487 
2488     while (cur_scope_data->parsing_jsr()) {
2489       cur_scope_data = cur_scope_data->parent();
2490     }
2491 
2492     assert(cur_scope_data->scope() == cur_state->scope(), "scopes do not match");
2493     assert(cur_state->locks_size() == 0 || cur_state->locks_size() == 1, "unlocking must be done in a catchall exception handler");
2494 
2495     prev_state = cur_state;
2496     cur_state = cur_state->caller_state();
2497     cur_scope_data = cur_scope_data->parent();
2498     scope_count++;
2499   } while (cur_scope_data != NULL);
2500 
2501   return exception_handlers;
2502 }
2503 
2504 
2505 // Helper class for simplifying Phis.
2506 class PhiSimplifier : public BlockClosure {
2507  private:
2508   bool _has_substitutions;
2509   Value simplify(Value v);
2510 
2511  public:
2512   PhiSimplifier(BlockBegin* start) : _has_substitutions(false) {
2513     start->iterate_preorder(this);
2514     if (_has_substitutions) {
2515       SubstitutionResolver sr(start);
2516     }
2517   }
2518   void block_do(BlockBegin* b);
2519   bool has_substitutions() const { return _has_substitutions; }
2520 };
2521 
2522 
2523 Value PhiSimplifier::simplify(Value v) {
2524   Phi* phi = v->as_Phi();
2525 
2526   if (phi == NULL) {
2527     // no phi function
2528     return v;
2529   } else if (v->has_subst()) {
2530     // already substituted; subst can be phi itself -> simplify
2531     return simplify(v->subst());
2532   } else if (phi->is_set(Phi::cannot_simplify)) {
2533     // already tried to simplify phi before
2534     return phi;
2535   } else if (phi->is_set(Phi::visited)) {
2536     // break cycles in phi functions
2537     return phi;
2538   } else if (phi->type()->is_illegal()) {
2539     // illegal phi functions are ignored anyway
2540     return phi;
2541 
2542   } else {
2543     // mark phi function as processed to break cycles in phi functions
2544     phi->set(Phi::visited);
2545 
2546     // simplify x = [y, x] and x = [y, y] to y
2547     Value subst = NULL;
2548     int opd_count = phi->operand_count();
2549     for (int i = 0; i < opd_count; i++) {
2550       Value opd = phi->operand_at(i);
2551       assert(opd != NULL, "Operand must exist!");
2552 
2553       if (opd->type()->is_illegal()) {
2554         // if one operand is illegal, the entire phi function is illegal
2555         phi->make_illegal();
2556         phi->clear(Phi::visited);
2557         return phi;
2558       }
2559 
2560       Value new_opd = simplify(opd);
2561       assert(new_opd != NULL, "Simplified operand must exist!");
2562 
2563       if (new_opd != phi && new_opd != subst) {
2564         if (subst == NULL) {
2565           subst = new_opd;
2566         } else {
2567           // no simplification possible
2568           phi->set(Phi::cannot_simplify);
2569           phi->clear(Phi::visited);
2570           return phi;
2571         }
2572       }
2573     }
2574 
2575     // sucessfully simplified phi function
2576     assert(subst != NULL, "illegal phi function");
2577     _has_substitutions = true;
2578     phi->clear(Phi::visited);
2579     phi->set_subst(subst);
2580 
2581 #ifndef PRODUCT
2582     if (PrintPhiFunctions) {
2583       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());
2584     }
2585 #endif
2586 
2587     return subst;
2588   }
2589 }
2590 
2591 
2592 void PhiSimplifier::block_do(BlockBegin* b) {
2593   for_each_phi_fun(b, phi,
2594     simplify(phi);
2595   );
2596 
2597 #ifdef ASSERT
2598   for_each_phi_fun(b, phi,
2599                    assert(phi->operand_count() != 1 || phi->subst() != phi || phi->is_illegal(), "missed trivial simplification");
2600   );
2601 
2602   ValueStack* state = b->state()->caller_state();
2603   for_each_state_value(state, value,
2604     Phi* phi = value->as_Phi();
2605     assert(phi == NULL || phi->block() != b, "must not have phi function to simplify in caller state");
2606   );
2607 #endif
2608 }
2609 
2610 // This method is called after all blocks are filled with HIR instructions
2611 // It eliminates all Phi functions of the form x = [y, y] and x = [y, x]
2612 void GraphBuilder::eliminate_redundant_phis(BlockBegin* start) {
2613   PhiSimplifier simplifier(start);
2614 }
2615 
2616 
2617 void GraphBuilder::connect_to_end(BlockBegin* beg) {
2618   // setup iteration
2619   kill_all();
2620   _block = beg;
2621   _state = beg->state()->copy_for_parsing();
2622   _last  = beg;
2623   iterate_bytecodes_for_block(beg->bci());
2624 }
2625 
2626 
2627 BlockEnd* GraphBuilder::iterate_bytecodes_for_block(int bci) {
2628 #ifndef PRODUCT
2629   if (PrintIRDuringConstruction) {
2630     tty->cr();
2631     InstructionPrinter ip;
2632     ip.print_instr(_block); tty->cr();
2633     ip.print_stack(_block->state()); tty->cr();
2634     ip.print_inline_level(_block);
2635     ip.print_head();
2636     tty->print_cr("locals size: %d stack size: %d", state()->locals_size(), state()->stack_size());
2637   }
2638 #endif
2639   _skip_block = false;
2640   assert(state() != NULL, "ValueStack missing!");
2641   CompileLog* log = compilation()->log();
2642   ciBytecodeStream s(method());
2643   s.reset_to_bci(bci);
2644   int prev_bci = bci;
2645   scope_data()->set_stream(&s);
2646   // iterate
2647   Bytecodes::Code code = Bytecodes::_illegal;
2648   bool push_exception = false;
2649 
2650   if (block()->is_set(BlockBegin::exception_entry_flag) && block()->next() == NULL) {
2651     // first thing in the exception entry block should be the exception object.
2652     push_exception = true;
2653   }
2654 
2655   bool ignore_return = scope_data()->ignore_return();
2656 
2657   while (!bailed_out() && last()->as_BlockEnd() == NULL &&
2658          (code = stream()->next()) != ciBytecodeStream::EOBC() &&
2659          (block_at(s.cur_bci()) == NULL || block_at(s.cur_bci()) == block())) {
2660     assert(state()->kind() == ValueStack::Parsing, "invalid state kind");
2661 
2662     if (log != NULL)
2663       log->set_context("bc code='%d' bci='%d'", (int)code, s.cur_bci());
2664 
2665     // Check for active jsr during OSR compilation
2666     if (compilation()->is_osr_compile()
2667         && scope()->is_top_scope()
2668         && parsing_jsr()
2669         && s.cur_bci() == compilation()->osr_bci()) {
2670       bailout("OSR not supported while a jsr is active");
2671     }
2672 
2673     if (push_exception) {
2674       apush(append(new ExceptionObject()));
2675       push_exception = false;
2676     }
2677 
2678     // handle bytecode
2679     switch (code) {
2680       case Bytecodes::_nop            : /* nothing to do */ break;
2681       case Bytecodes::_aconst_null    : apush(append(new Constant(objectNull            ))); break;
2682       case Bytecodes::_iconst_m1      : ipush(append(new Constant(new IntConstant   (-1)))); break;
2683       case Bytecodes::_iconst_0       : ipush(append(new Constant(intZero               ))); break;
2684       case Bytecodes::_iconst_1       : ipush(append(new Constant(intOne                ))); break;
2685       case Bytecodes::_iconst_2       : ipush(append(new Constant(new IntConstant   ( 2)))); break;
2686       case Bytecodes::_iconst_3       : ipush(append(new Constant(new IntConstant   ( 3)))); break;
2687       case Bytecodes::_iconst_4       : ipush(append(new Constant(new IntConstant   ( 4)))); break;
2688       case Bytecodes::_iconst_5       : ipush(append(new Constant(new IntConstant   ( 5)))); break;
2689       case Bytecodes::_lconst_0       : lpush(append(new Constant(new LongConstant  ( 0)))); break;
2690       case Bytecodes::_lconst_1       : lpush(append(new Constant(new LongConstant  ( 1)))); break;
2691       case Bytecodes::_fconst_0       : fpush(append(new Constant(new FloatConstant ( 0)))); break;
2692       case Bytecodes::_fconst_1       : fpush(append(new Constant(new FloatConstant ( 1)))); break;
2693       case Bytecodes::_fconst_2       : fpush(append(new Constant(new FloatConstant ( 2)))); break;
2694       case Bytecodes::_dconst_0       : dpush(append(new Constant(new DoubleConstant( 0)))); break;
2695       case Bytecodes::_dconst_1       : dpush(append(new Constant(new DoubleConstant( 1)))); break;
2696       case Bytecodes::_bipush         : ipush(append(new Constant(new IntConstant(((signed char*)s.cur_bcp())[1])))); break;
2697       case Bytecodes::_sipush         : ipush(append(new Constant(new IntConstant((short)Bytes::get_Java_u2(s.cur_bcp()+1))))); break;
2698       case Bytecodes::_ldc            : // fall through
2699       case Bytecodes::_ldc_w          : // fall through
2700       case Bytecodes::_ldc2_w         : load_constant(); break;
2701       case Bytecodes::_iload          : load_local(intType     , s.get_index()); break;
2702       case Bytecodes::_lload          : load_local(longType    , s.get_index()); break;
2703       case Bytecodes::_fload          : load_local(floatType   , s.get_index()); break;
2704       case Bytecodes::_dload          : load_local(doubleType  , s.get_index()); break;
2705       case Bytecodes::_aload          : load_local(instanceType, s.get_index()); break;
2706       case Bytecodes::_iload_0        : load_local(intType   , 0); break;
2707       case Bytecodes::_iload_1        : load_local(intType   , 1); break;
2708       case Bytecodes::_iload_2        : load_local(intType   , 2); break;
2709       case Bytecodes::_iload_3        : load_local(intType   , 3); break;
2710       case Bytecodes::_lload_0        : load_local(longType  , 0); break;
2711       case Bytecodes::_lload_1        : load_local(longType  , 1); break;
2712       case Bytecodes::_lload_2        : load_local(longType  , 2); break;
2713       case Bytecodes::_lload_3        : load_local(longType  , 3); break;
2714       case Bytecodes::_fload_0        : load_local(floatType , 0); break;
2715       case Bytecodes::_fload_1        : load_local(floatType , 1); break;
2716       case Bytecodes::_fload_2        : load_local(floatType , 2); break;
2717       case Bytecodes::_fload_3        : load_local(floatType , 3); break;
2718       case Bytecodes::_dload_0        : load_local(doubleType, 0); break;
2719       case Bytecodes::_dload_1        : load_local(doubleType, 1); break;
2720       case Bytecodes::_dload_2        : load_local(doubleType, 2); break;
2721       case Bytecodes::_dload_3        : load_local(doubleType, 3); break;
2722       case Bytecodes::_aload_0        : load_local(objectType, 0); break;
2723       case Bytecodes::_aload_1        : load_local(objectType, 1); break;
2724       case Bytecodes::_aload_2        : load_local(objectType, 2); break;
2725       case Bytecodes::_aload_3        : load_local(objectType, 3); break;
2726       case Bytecodes::_iaload         : load_indexed(T_INT   ); break;
2727       case Bytecodes::_laload         : load_indexed(T_LONG  ); break;
2728       case Bytecodes::_faload         : load_indexed(T_FLOAT ); break;
2729       case Bytecodes::_daload         : load_indexed(T_DOUBLE); break;
2730       case Bytecodes::_aaload         : load_indexed(T_OBJECT); break;
2731       case Bytecodes::_baload         : load_indexed(T_BYTE  ); break;
2732       case Bytecodes::_caload         : load_indexed(T_CHAR  ); break;
2733       case Bytecodes::_saload         : load_indexed(T_SHORT ); break;
2734       case Bytecodes::_istore         : store_local(intType   , s.get_index()); break;
2735       case Bytecodes::_lstore         : store_local(longType  , s.get_index()); break;
2736       case Bytecodes::_fstore         : store_local(floatType , s.get_index()); break;
2737       case Bytecodes::_dstore         : store_local(doubleType, s.get_index()); break;
2738       case Bytecodes::_astore         : store_local(objectType, s.get_index()); break;
2739       case Bytecodes::_istore_0       : store_local(intType   , 0); break;
2740       case Bytecodes::_istore_1       : store_local(intType   , 1); break;
2741       case Bytecodes::_istore_2       : store_local(intType   , 2); break;
2742       case Bytecodes::_istore_3       : store_local(intType   , 3); break;
2743       case Bytecodes::_lstore_0       : store_local(longType  , 0); break;
2744       case Bytecodes::_lstore_1       : store_local(longType  , 1); break;
2745       case Bytecodes::_lstore_2       : store_local(longType  , 2); break;
2746       case Bytecodes::_lstore_3       : store_local(longType  , 3); break;
2747       case Bytecodes::_fstore_0       : store_local(floatType , 0); break;
2748       case Bytecodes::_fstore_1       : store_local(floatType , 1); break;
2749       case Bytecodes::_fstore_2       : store_local(floatType , 2); break;
2750       case Bytecodes::_fstore_3       : store_local(floatType , 3); break;
2751       case Bytecodes::_dstore_0       : store_local(doubleType, 0); break;
2752       case Bytecodes::_dstore_1       : store_local(doubleType, 1); break;
2753       case Bytecodes::_dstore_2       : store_local(doubleType, 2); break;
2754       case Bytecodes::_dstore_3       : store_local(doubleType, 3); break;
2755       case Bytecodes::_astore_0       : store_local(objectType, 0); break;
2756       case Bytecodes::_astore_1       : store_local(objectType, 1); break;
2757       case Bytecodes::_astore_2       : store_local(objectType, 2); break;
2758       case Bytecodes::_astore_3       : store_local(objectType, 3); break;
2759       case Bytecodes::_iastore        : store_indexed(T_INT   ); break;
2760       case Bytecodes::_lastore        : store_indexed(T_LONG  ); break;
2761       case Bytecodes::_fastore        : store_indexed(T_FLOAT ); break;
2762       case Bytecodes::_dastore        : store_indexed(T_DOUBLE); break;
2763       case Bytecodes::_aastore        : store_indexed(T_OBJECT); break;
2764       case Bytecodes::_bastore        : store_indexed(T_BYTE  ); break;
2765       case Bytecodes::_castore        : store_indexed(T_CHAR  ); break;
2766       case Bytecodes::_sastore        : store_indexed(T_SHORT ); break;
2767       case Bytecodes::_pop            : // fall through
2768       case Bytecodes::_pop2           : // fall through
2769       case Bytecodes::_dup            : // fall through
2770       case Bytecodes::_dup_x1         : // fall through
2771       case Bytecodes::_dup_x2         : // fall through
2772       case Bytecodes::_dup2           : // fall through
2773       case Bytecodes::_dup2_x1        : // fall through
2774       case Bytecodes::_dup2_x2        : // fall through
2775       case Bytecodes::_swap           : stack_op(code); break;
2776       case Bytecodes::_iadd           : arithmetic_op(intType   , code); break;
2777       case Bytecodes::_ladd           : arithmetic_op(longType  , code); break;
2778       case Bytecodes::_fadd           : arithmetic_op(floatType , code); break;
2779       case Bytecodes::_dadd           : arithmetic_op(doubleType, code); break;
2780       case Bytecodes::_isub           : arithmetic_op(intType   , code); break;
2781       case Bytecodes::_lsub           : arithmetic_op(longType  , code); break;
2782       case Bytecodes::_fsub           : arithmetic_op(floatType , code); break;
2783       case Bytecodes::_dsub           : arithmetic_op(doubleType, code); break;
2784       case Bytecodes::_imul           : arithmetic_op(intType   , code); break;
2785       case Bytecodes::_lmul           : arithmetic_op(longType  , code); break;
2786       case Bytecodes::_fmul           : arithmetic_op(floatType , code); break;
2787       case Bytecodes::_dmul           : arithmetic_op(doubleType, code); break;
2788       case Bytecodes::_idiv           : arithmetic_op(intType   , code, copy_state_for_exception()); break;
2789       case Bytecodes::_ldiv           : arithmetic_op(longType  , code, copy_state_for_exception()); break;
2790       case Bytecodes::_fdiv           : arithmetic_op(floatType , code); break;
2791       case Bytecodes::_ddiv           : arithmetic_op(doubleType, code); break;
2792       case Bytecodes::_irem           : arithmetic_op(intType   , code, copy_state_for_exception()); break;
2793       case Bytecodes::_lrem           : arithmetic_op(longType  , code, copy_state_for_exception()); break;
2794       case Bytecodes::_frem           : arithmetic_op(floatType , code); break;
2795       case Bytecodes::_drem           : arithmetic_op(doubleType, code); break;
2796       case Bytecodes::_ineg           : negate_op(intType   ); break;
2797       case Bytecodes::_lneg           : negate_op(longType  ); break;
2798       case Bytecodes::_fneg           : negate_op(floatType ); break;
2799       case Bytecodes::_dneg           : negate_op(doubleType); break;
2800       case Bytecodes::_ishl           : shift_op(intType , code); break;
2801       case Bytecodes::_lshl           : shift_op(longType, code); break;
2802       case Bytecodes::_ishr           : shift_op(intType , code); break;
2803       case Bytecodes::_lshr           : shift_op(longType, code); break;
2804       case Bytecodes::_iushr          : shift_op(intType , code); break;
2805       case Bytecodes::_lushr          : shift_op(longType, code); break;
2806       case Bytecodes::_iand           : logic_op(intType , code); break;
2807       case Bytecodes::_land           : logic_op(longType, code); break;
2808       case Bytecodes::_ior            : logic_op(intType , code); break;
2809       case Bytecodes::_lor            : logic_op(longType, code); break;
2810       case Bytecodes::_ixor           : logic_op(intType , code); break;
2811       case Bytecodes::_lxor           : logic_op(longType, code); break;
2812       case Bytecodes::_iinc           : increment(); break;
2813       case Bytecodes::_i2l            : convert(code, T_INT   , T_LONG  ); break;
2814       case Bytecodes::_i2f            : convert(code, T_INT   , T_FLOAT ); break;
2815       case Bytecodes::_i2d            : convert(code, T_INT   , T_DOUBLE); break;
2816       case Bytecodes::_l2i            : convert(code, T_LONG  , T_INT   ); break;
2817       case Bytecodes::_l2f            : convert(code, T_LONG  , T_FLOAT ); break;
2818       case Bytecodes::_l2d            : convert(code, T_LONG  , T_DOUBLE); break;
2819       case Bytecodes::_f2i            : convert(code, T_FLOAT , T_INT   ); break;
2820       case Bytecodes::_f2l            : convert(code, T_FLOAT , T_LONG  ); break;
2821       case Bytecodes::_f2d            : convert(code, T_FLOAT , T_DOUBLE); break;
2822       case Bytecodes::_d2i            : convert(code, T_DOUBLE, T_INT   ); break;
2823       case Bytecodes::_d2l            : convert(code, T_DOUBLE, T_LONG  ); break;
2824       case Bytecodes::_d2f            : convert(code, T_DOUBLE, T_FLOAT ); break;
2825       case Bytecodes::_i2b            : convert(code, T_INT   , T_BYTE  ); break;
2826       case Bytecodes::_i2c            : convert(code, T_INT   , T_CHAR  ); break;
2827       case Bytecodes::_i2s            : convert(code, T_INT   , T_SHORT ); break;
2828       case Bytecodes::_lcmp           : compare_op(longType  , code); break;
2829       case Bytecodes::_fcmpl          : compare_op(floatType , code); break;
2830       case Bytecodes::_fcmpg          : compare_op(floatType , code); break;
2831       case Bytecodes::_dcmpl          : compare_op(doubleType, code); break;
2832       case Bytecodes::_dcmpg          : compare_op(doubleType, code); break;
2833       case Bytecodes::_ifeq           : if_zero(intType   , If::eql); break;
2834       case Bytecodes::_ifne           : if_zero(intType   , If::neq); break;
2835       case Bytecodes::_iflt           : if_zero(intType   , If::lss); break;
2836       case Bytecodes::_ifge           : if_zero(intType   , If::geq); break;
2837       case Bytecodes::_ifgt           : if_zero(intType   , If::gtr); break;
2838       case Bytecodes::_ifle           : if_zero(intType   , If::leq); break;
2839       case Bytecodes::_if_icmpeq      : if_same(intType   , If::eql); break;
2840       case Bytecodes::_if_icmpne      : if_same(intType   , If::neq); break;
2841       case Bytecodes::_if_icmplt      : if_same(intType   , If::lss); break;
2842       case Bytecodes::_if_icmpge      : if_same(intType   , If::geq); break;
2843       case Bytecodes::_if_icmpgt      : if_same(intType   , If::gtr); break;
2844       case Bytecodes::_if_icmple      : if_same(intType   , If::leq); break;
2845       case Bytecodes::_if_acmpeq      : if_same(objectType, If::eql); break;
2846       case Bytecodes::_if_acmpne      : if_same(objectType, If::neq); break;
2847       case Bytecodes::_goto           : _goto(s.cur_bci(), s.get_dest()); break;
2848       case Bytecodes::_jsr            : jsr(s.get_dest()); break;
2849       case Bytecodes::_ret            : ret(s.get_index()); break;
2850       case Bytecodes::_tableswitch    : table_switch(); break;
2851       case Bytecodes::_lookupswitch   : lookup_switch(); break;
2852       case Bytecodes::_ireturn        : method_return(ipop(), ignore_return); break;
2853       case Bytecodes::_lreturn        : method_return(lpop(), ignore_return); break;
2854       case Bytecodes::_freturn        : method_return(fpop(), ignore_return); break;
2855       case Bytecodes::_dreturn        : method_return(dpop(), ignore_return); break;
2856       case Bytecodes::_areturn        : method_return(apop(), ignore_return); break;
2857       case Bytecodes::_return         : method_return(NULL  , ignore_return); break;
2858       case Bytecodes::_getstatic      : // fall through
2859       case Bytecodes::_putstatic      : // fall through
2860       case Bytecodes::_getfield       : // fall through
2861       case Bytecodes::_putfield       : access_field(code); break;
2862       case Bytecodes::_invokevirtual  : // fall through
2863       case Bytecodes::_invokespecial  : // fall through
2864       case Bytecodes::_invokestatic   : // fall through
2865       case Bytecodes::_invokedynamic  : // fall through
2866       case Bytecodes::_invokeinterface: invoke(code); break;
2867       case Bytecodes::_new            : new_instance(s.get_index_u2()); break;
2868       case Bytecodes::_newarray       : new_type_array(); break;
2869       case Bytecodes::_anewarray      : new_object_array(); break;
2870       case Bytecodes::_arraylength    : { ValueStack* state_before = copy_state_for_exception(); ipush(append(new ArrayLength(apop(), state_before))); break; }
2871       case Bytecodes::_athrow         : throw_op(s.cur_bci()); break;
2872       case Bytecodes::_checkcast      : check_cast(s.get_index_u2()); break;
2873       case Bytecodes::_instanceof     : instance_of(s.get_index_u2()); break;
2874       case Bytecodes::_monitorenter   : monitorenter(apop(), s.cur_bci()); break;
2875       case Bytecodes::_monitorexit    : monitorexit (apop(), s.cur_bci()); break;
2876       case Bytecodes::_wide           : ShouldNotReachHere(); break;
2877       case Bytecodes::_multianewarray : new_multi_array(s.cur_bcp()[3]); break;
2878       case Bytecodes::_ifnull         : if_null(objectType, If::eql); break;
2879       case Bytecodes::_ifnonnull      : if_null(objectType, If::neq); break;
2880       case Bytecodes::_goto_w         : _goto(s.cur_bci(), s.get_far_dest()); break;
2881       case Bytecodes::_jsr_w          : jsr(s.get_far_dest()); break;
2882       case Bytecodes::_breakpoint     : BAILOUT_("concurrent setting of breakpoint", NULL);
2883       default                         : ShouldNotReachHere(); break;
2884     }
2885 
2886     if (log != NULL)
2887       log->clear_context(); // skip marker if nothing was printed
2888 
2889     // save current bci to setup Goto at the end
2890     prev_bci = s.cur_bci();
2891 
2892   }
2893   CHECK_BAILOUT_(NULL);
2894   // stop processing of this block (see try_inline_full)
2895   if (_skip_block) {
2896     _skip_block = false;
2897     assert(_last && _last->as_BlockEnd(), "");
2898     return _last->as_BlockEnd();
2899   }
2900   // if there are any, check if last instruction is a BlockEnd instruction
2901   BlockEnd* end = last()->as_BlockEnd();
2902   if (end == NULL) {
2903     // all blocks must end with a BlockEnd instruction => add a Goto
2904     end = new Goto(block_at(s.cur_bci()), false);
2905     append(end);
2906   }
2907   assert(end == last()->as_BlockEnd(), "inconsistency");
2908 
2909   assert(end->state() != NULL, "state must already be present");
2910   assert(end->as_Return() == NULL || end->as_Throw() == NULL || end->state()->stack_size() == 0, "stack not needed for return and throw");
2911 
2912   // connect to begin & set state
2913   // NOTE that inlining may have changed the block we are parsing
2914   block()->set_end(end);
2915   // propagate state
2916   for (int i = end->number_of_sux() - 1; i >= 0; i--) {
2917     BlockBegin* sux = end->sux_at(i);
2918     assert(sux->is_predecessor(block()), "predecessor missing");
2919     // be careful, bailout if bytecodes are strange
2920     if (!sux->try_merge(end->state())) BAILOUT_("block join failed", NULL);
2921     scope_data()->add_to_work_list(end->sux_at(i));
2922   }
2923 
2924   scope_data()->set_stream(NULL);
2925 
2926   // done
2927   return end;
2928 }
2929 
2930 
2931 void GraphBuilder::iterate_all_blocks(bool start_in_current_block_for_inlining) {
2932   do {
2933     if (start_in_current_block_for_inlining && !bailed_out()) {
2934       iterate_bytecodes_for_block(0);
2935       start_in_current_block_for_inlining = false;
2936     } else {
2937       BlockBegin* b;
2938       while ((b = scope_data()->remove_from_work_list()) != NULL) {
2939         if (!b->is_set(BlockBegin::was_visited_flag)) {
2940           if (b->is_set(BlockBegin::osr_entry_flag)) {
2941             // we're about to parse the osr entry block, so make sure
2942             // we setup the OSR edge leading into this block so that
2943             // Phis get setup correctly.
2944             setup_osr_entry_block();
2945             // this is no longer the osr entry block, so clear it.
2946             b->clear(BlockBegin::osr_entry_flag);
2947           }
2948           b->set(BlockBegin::was_visited_flag);
2949           connect_to_end(b);
2950         }
2951       }
2952     }
2953   } while (!bailed_out() && !scope_data()->is_work_list_empty());
2954 }
2955 
2956 
2957 bool GraphBuilder::_can_trap      [Bytecodes::number_of_java_codes];
2958 
2959 void GraphBuilder::initialize() {
2960   // the following bytecodes are assumed to potentially
2961   // throw exceptions in compiled code - note that e.g.
2962   // monitorexit & the return bytecodes do not throw
2963   // exceptions since monitor pairing proved that they
2964   // succeed (if monitor pairing succeeded)
2965   Bytecodes::Code can_trap_list[] =
2966     { Bytecodes::_ldc
2967     , Bytecodes::_ldc_w
2968     , Bytecodes::_ldc2_w
2969     , Bytecodes::_iaload
2970     , Bytecodes::_laload
2971     , Bytecodes::_faload
2972     , Bytecodes::_daload
2973     , Bytecodes::_aaload
2974     , Bytecodes::_baload
2975     , Bytecodes::_caload
2976     , Bytecodes::_saload
2977     , Bytecodes::_iastore
2978     , Bytecodes::_lastore
2979     , Bytecodes::_fastore
2980     , Bytecodes::_dastore
2981     , Bytecodes::_aastore
2982     , Bytecodes::_bastore
2983     , Bytecodes::_castore
2984     , Bytecodes::_sastore
2985     , Bytecodes::_idiv
2986     , Bytecodes::_ldiv
2987     , Bytecodes::_irem
2988     , Bytecodes::_lrem
2989     , Bytecodes::_getstatic
2990     , Bytecodes::_putstatic
2991     , Bytecodes::_getfield
2992     , Bytecodes::_putfield
2993     , Bytecodes::_invokevirtual
2994     , Bytecodes::_invokespecial
2995     , Bytecodes::_invokestatic
2996     , Bytecodes::_invokedynamic
2997     , Bytecodes::_invokeinterface
2998     , Bytecodes::_new
2999     , Bytecodes::_newarray
3000     , Bytecodes::_anewarray
3001     , Bytecodes::_arraylength
3002     , Bytecodes::_athrow
3003     , Bytecodes::_checkcast
3004     , Bytecodes::_instanceof
3005     , Bytecodes::_monitorenter
3006     , Bytecodes::_multianewarray
3007     };
3008 
3009   // inititialize trap tables
3010   for (int i = 0; i < Bytecodes::number_of_java_codes; i++) {
3011     _can_trap[i] = false;
3012   }
3013   // set standard trap info
3014   for (uint j = 0; j < ARRAY_SIZE(can_trap_list); j++) {
3015     _can_trap[can_trap_list[j]] = true;
3016   }
3017 }
3018 
3019 
3020 BlockBegin* GraphBuilder::header_block(BlockBegin* entry, BlockBegin::Flag f, ValueStack* state) {
3021   assert(entry->is_set(f), "entry/flag mismatch");
3022   // create header block
3023   BlockBegin* h = new BlockBegin(entry->bci());
3024   h->set_depth_first_number(0);
3025 
3026   Value l = h;
3027   BlockEnd* g = new Goto(entry, false);
3028   l->set_next(g, entry->bci());
3029   h->set_end(g);
3030   h->set(f);
3031   // setup header block end state
3032   ValueStack* s = state->copy(ValueStack::StateAfter, entry->bci()); // can use copy since stack is empty (=> no phis)
3033   assert(s->stack_is_empty(), "must have empty stack at entry point");
3034   g->set_state(s);
3035   return h;
3036 }
3037 
3038 
3039 
3040 BlockBegin* GraphBuilder::setup_start_block(int osr_bci, BlockBegin* std_entry, BlockBegin* osr_entry, ValueStack* state) {
3041   BlockBegin* start = new BlockBegin(0);
3042 
3043   // This code eliminates the empty start block at the beginning of
3044   // each method.  Previously, each method started with the
3045   // start-block created below, and this block was followed by the
3046   // header block that was always empty.  This header block is only
3047   // necesary if std_entry is also a backward branch target because
3048   // then phi functions may be necessary in the header block.  It's
3049   // also necessary when profiling so that there's a single block that
3050   // can increment the the counters.
3051   // In addition, with range check elimination, we may need a valid block
3052   // that dominates all the rest to insert range predicates.
3053   BlockBegin* new_header_block;
3054   if (std_entry->number_of_preds() > 0 || is_profiling() || RangeCheckElimination) {
3055     new_header_block = header_block(std_entry, BlockBegin::std_entry_flag, state);
3056   } else {
3057     new_header_block = std_entry;
3058   }
3059 
3060   // setup start block (root for the IR graph)
3061   Base* base =
3062     new Base(
3063       new_header_block,
3064       osr_entry
3065     );
3066   start->set_next(base, 0);
3067   start->set_end(base);
3068   // create & setup state for start block
3069   start->set_state(state->copy(ValueStack::StateAfter, std_entry->bci()));
3070   base->set_state(state->copy(ValueStack::StateAfter, std_entry->bci()));
3071 
3072   if (base->std_entry()->state() == NULL) {
3073     // setup states for header blocks
3074     base->std_entry()->merge(state);
3075   }
3076 
3077   assert(base->std_entry()->state() != NULL, "");
3078   return start;
3079 }
3080 
3081 
3082 void GraphBuilder::setup_osr_entry_block() {
3083   assert(compilation()->is_osr_compile(), "only for osrs");
3084 
3085   int osr_bci = compilation()->osr_bci();
3086   ciBytecodeStream s(method());
3087   s.reset_to_bci(osr_bci);
3088   s.next();
3089   scope_data()->set_stream(&s);
3090 
3091   // create a new block to be the osr setup code
3092   _osr_entry = new BlockBegin(osr_bci);
3093   _osr_entry->set(BlockBegin::osr_entry_flag);
3094   _osr_entry->set_depth_first_number(0);
3095   BlockBegin* target = bci2block()->at(osr_bci);
3096   assert(target != NULL && target->is_set(BlockBegin::osr_entry_flag), "must be there");
3097   // the osr entry has no values for locals
3098   ValueStack* state = target->state()->copy();
3099   _osr_entry->set_state(state);
3100 
3101   kill_all();
3102   _block = _osr_entry;
3103   _state = _osr_entry->state()->copy();
3104   assert(_state->bci() == osr_bci, "mismatch");
3105   _last  = _osr_entry;
3106   Value e = append(new OsrEntry());
3107   e->set_needs_null_check(false);
3108 
3109   // OSR buffer is
3110   //
3111   // locals[nlocals-1..0]
3112   // monitors[number_of_locks-1..0]
3113   //
3114   // locals is a direct copy of the interpreter frame so in the osr buffer
3115   // so first slot in the local array is the last local from the interpreter
3116   // and last slot is local[0] (receiver) from the interpreter
3117   //
3118   // Similarly with locks. The first lock slot in the osr buffer is the nth lock
3119   // from the interpreter frame, the nth lock slot in the osr buffer is 0th lock
3120   // in the interpreter frame (the method lock if a sync method)
3121 
3122   // Initialize monitors in the compiled activation.
3123 
3124   int index;
3125   Value local;
3126 
3127   // find all the locals that the interpreter thinks contain live oops
3128   const ResourceBitMap live_oops = method()->live_local_oops_at_bci(osr_bci);
3129 
3130   // compute the offset into the locals so that we can treat the buffer
3131   // as if the locals were still in the interpreter frame
3132   int locals_offset = BytesPerWord * (method()->max_locals() - 1);
3133   for_each_local_value(state, index, local) {
3134     int offset = locals_offset - (index + local->type()->size() - 1) * BytesPerWord;
3135     Value get;
3136     if (local->type()->is_object_kind() && !live_oops.at(index)) {
3137       // The interpreter thinks this local is dead but the compiler
3138       // doesn't so pretend that the interpreter passed in null.
3139       get = append(new Constant(objectNull));
3140     } else {
3141       Value off_val = append(new Constant(new IntConstant(offset)));
3142       get = append(new UnsafeGet(as_BasicType(local->type()), e,
3143                                  off_val,
3144                                  false/*is_volatile*/,
3145                                  true/*is_raw*/));
3146     }
3147     _state->store_local(index, get);
3148   }
3149 
3150   // the storage for the OSR buffer is freed manually in the LIRGenerator.
3151 
3152   assert(state->caller_state() == NULL, "should be top scope");
3153   state->clear_locals();
3154   Goto* g = new Goto(target, false);
3155   append(g);
3156   _osr_entry->set_end(g);
3157   target->merge(_osr_entry->end()->state());
3158 
3159   scope_data()->set_stream(NULL);
3160 }
3161 
3162 
3163 ValueStack* GraphBuilder::state_at_entry() {
3164   ValueStack* state = new ValueStack(scope(), NULL);
3165 
3166   // Set up locals for receiver
3167   int idx = 0;
3168   if (!method()->is_static()) {
3169     // we should always see the receiver
3170     state->store_local(idx, new Local(method()->holder(), objectType, idx, true));
3171     idx = 1;
3172   }
3173 
3174   // Set up locals for incoming arguments
3175   ciSignature* sig = method()->signature();
3176   for (int i = 0; i < sig->count(); i++) {
3177     ciType* type = sig->type_at(i);
3178     BasicType basic_type = type->basic_type();
3179     // don't allow T_ARRAY to propagate into locals types
3180     if (is_reference_type(basic_type)) basic_type = T_OBJECT;
3181     ValueType* vt = as_ValueType(basic_type);
3182     state->store_local(idx, new Local(type, vt, idx, false));
3183     idx += type->size();
3184   }
3185 
3186   // lock synchronized method
3187   if (method()->is_synchronized()) {
3188     state->lock(NULL);
3189   }
3190 
3191   return state;
3192 }
3193 
3194 
3195 GraphBuilder::GraphBuilder(Compilation* compilation, IRScope* scope)
3196   : _scope_data(NULL)
3197   , _compilation(compilation)
3198   , _memory(new MemoryBuffer())
3199   , _inline_bailout_msg(NULL)
3200   , _instruction_count(0)
3201   , _osr_entry(NULL)
3202 {
3203   int osr_bci = compilation->osr_bci();
3204 
3205   // determine entry points and bci2block mapping
3206   BlockListBuilder blm(compilation, scope, osr_bci);
3207   CHECK_BAILOUT();
3208 
3209   BlockList* bci2block = blm.bci2block();
3210   BlockBegin* start_block = bci2block->at(0);
3211 
3212   push_root_scope(scope, bci2block, start_block);
3213 
3214   // setup state for std entry
3215   _initial_state = state_at_entry();
3216   start_block->merge(_initial_state);
3217 
3218   // complete graph
3219   _vmap        = new ValueMap();
3220   switch (scope->method()->intrinsic_id()) {
3221   case vmIntrinsics::_dabs          : // fall through
3222   case vmIntrinsics::_dsqrt         : // fall through
3223   case vmIntrinsics::_dsqrt_strict  : // fall through
3224   case vmIntrinsics::_dsin          : // fall through
3225   case vmIntrinsics::_dcos          : // fall through
3226   case vmIntrinsics::_dtan          : // fall through
3227   case vmIntrinsics::_dlog          : // fall through
3228   case vmIntrinsics::_dlog10        : // fall through
3229   case vmIntrinsics::_dexp          : // fall through
3230   case vmIntrinsics::_dpow          : // fall through
3231     {
3232       // Compiles where the root method is an intrinsic need a special
3233       // compilation environment because the bytecodes for the method
3234       // shouldn't be parsed during the compilation, only the special
3235       // Intrinsic node should be emitted.  If this isn't done the the
3236       // code for the inlined version will be different than the root
3237       // compiled version which could lead to monotonicity problems on
3238       // intel.
3239       if (CheckIntrinsics && !scope->method()->intrinsic_candidate()) {
3240         BAILOUT("failed to inline intrinsic, method not annotated");
3241       }
3242 
3243       // Set up a stream so that appending instructions works properly.
3244       ciBytecodeStream s(scope->method());
3245       s.reset_to_bci(0);
3246       scope_data()->set_stream(&s);
3247       s.next();
3248 
3249       // setup the initial block state
3250       _block = start_block;
3251       _state = start_block->state()->copy_for_parsing();
3252       _last  = start_block;
3253       load_local(doubleType, 0);
3254       if (scope->method()->intrinsic_id() == vmIntrinsics::_dpow) {
3255         load_local(doubleType, 2);
3256       }
3257 
3258       // Emit the intrinsic node.
3259       bool result = try_inline_intrinsics(scope->method());
3260       if (!result) BAILOUT("failed to inline intrinsic");
3261       method_return(dpop());
3262 
3263       // connect the begin and end blocks and we're all done.
3264       BlockEnd* end = last()->as_BlockEnd();
3265       block()->set_end(end);
3266       break;
3267     }
3268 
3269   case vmIntrinsics::_Reference_get:
3270     {
3271       {
3272         // With java.lang.ref.reference.get() we must go through the
3273         // intrinsic - when G1 is enabled - even when get() is the root
3274         // method of the compile so that, if necessary, the value in
3275         // the referent field of the reference object gets recorded by
3276         // the pre-barrier code.
3277         // Specifically, if G1 is enabled, the value in the referent
3278         // field is recorded by the G1 SATB pre barrier. This will
3279         // result in the referent being marked live and the reference
3280         // object removed from the list of discovered references during
3281         // reference processing.
3282         if (CheckIntrinsics && !scope->method()->intrinsic_candidate()) {
3283           BAILOUT("failed to inline intrinsic, method not annotated");
3284         }
3285 
3286         // Also we need intrinsic to prevent commoning reads from this field
3287         // across safepoint since GC can change its value.
3288 
3289         // Set up a stream so that appending instructions works properly.
3290         ciBytecodeStream s(scope->method());
3291         s.reset_to_bci(0);
3292         scope_data()->set_stream(&s);
3293         s.next();
3294 
3295         // setup the initial block state
3296         _block = start_block;
3297         _state = start_block->state()->copy_for_parsing();
3298         _last  = start_block;
3299         load_local(objectType, 0);
3300 
3301         // Emit the intrinsic node.
3302         bool result = try_inline_intrinsics(scope->method());
3303         if (!result) BAILOUT("failed to inline intrinsic");
3304         method_return(apop());
3305 
3306         // connect the begin and end blocks and we're all done.
3307         BlockEnd* end = last()->as_BlockEnd();
3308         block()->set_end(end);
3309         break;
3310       }
3311       // Otherwise, fall thru
3312     }
3313 
3314   default:
3315     scope_data()->add_to_work_list(start_block);
3316     iterate_all_blocks();
3317     break;
3318   }
3319   CHECK_BAILOUT();
3320 
3321   _start = setup_start_block(osr_bci, start_block, _osr_entry, _initial_state);
3322 
3323   eliminate_redundant_phis(_start);
3324 
3325   NOT_PRODUCT(if (PrintValueNumbering && Verbose) print_stats());
3326   // for osr compile, bailout if some requirements are not fulfilled
3327   if (osr_bci != -1) {
3328     BlockBegin* osr_block = blm.bci2block()->at(osr_bci);
3329     if (!osr_block->is_set(BlockBegin::was_visited_flag)) {
3330       BAILOUT("osr entry must have been visited for osr compile");
3331     }
3332 
3333     // check if osr entry point has empty stack - we cannot handle non-empty stacks at osr entry points
3334     if (!osr_block->state()->stack_is_empty()) {
3335       BAILOUT("stack not empty at OSR entry point");
3336     }
3337   }
3338 #ifndef PRODUCT
3339   if (PrintCompilation && Verbose) tty->print_cr("Created %d Instructions", _instruction_count);
3340 #endif
3341 }
3342 
3343 
3344 ValueStack* GraphBuilder::copy_state_before() {
3345   return copy_state_before_with_bci(bci());
3346 }
3347 
3348 ValueStack* GraphBuilder::copy_state_exhandling() {
3349   return copy_state_exhandling_with_bci(bci());
3350 }
3351 
3352 ValueStack* GraphBuilder::copy_state_for_exception() {
3353   return copy_state_for_exception_with_bci(bci());
3354 }
3355 
3356 ValueStack* GraphBuilder::copy_state_before_with_bci(int bci) {
3357   return state()->copy(ValueStack::StateBefore, bci);
3358 }
3359 
3360 ValueStack* GraphBuilder::copy_state_exhandling_with_bci(int bci) {
3361   if (!has_handler()) return NULL;
3362   return state()->copy(ValueStack::StateBefore, bci);
3363 }
3364 
3365 ValueStack* GraphBuilder::copy_state_for_exception_with_bci(int bci) {
3366   ValueStack* s = copy_state_exhandling_with_bci(bci);
3367   if (s == NULL) {
3368     if (_compilation->env()->should_retain_local_variables()) {
3369       s = state()->copy(ValueStack::ExceptionState, bci);
3370     } else {
3371       s = state()->copy(ValueStack::EmptyExceptionState, bci);
3372     }
3373   }
3374   return s;
3375 }
3376 
3377 int GraphBuilder::recursive_inline_level(ciMethod* cur_callee) const {
3378   int recur_level = 0;
3379   for (IRScope* s = scope(); s != NULL; s = s->caller()) {
3380     if (s->method() == cur_callee) {
3381       ++recur_level;
3382     }
3383   }
3384   return recur_level;
3385 }
3386 
3387 
3388 bool GraphBuilder::try_inline(ciMethod* callee, bool holder_known, bool ignore_return, Bytecodes::Code bc, Value receiver) {
3389   const char* msg = NULL;
3390 
3391   // clear out any existing inline bailout condition
3392   clear_inline_bailout();
3393 
3394   // exclude methods we don't want to inline
3395   msg = should_not_inline(callee);
3396   if (msg != NULL) {
3397     print_inlining(callee, msg, /*success*/ false);
3398     return false;
3399   }
3400 
3401   // method handle invokes
3402   if (callee->is_method_handle_intrinsic()) {
3403     if (try_method_handle_inline(callee, ignore_return)) {
3404       if (callee->has_reserved_stack_access()) {
3405         compilation()->set_has_reserved_stack_access(true);
3406       }
3407       return true;
3408     }
3409     return false;
3410   }
3411 
3412   // handle intrinsics
3413   if (callee->intrinsic_id() != vmIntrinsics::_none &&
3414       callee->check_intrinsic_candidate()) {
3415     if (try_inline_intrinsics(callee, ignore_return)) {
3416       print_inlining(callee, "intrinsic");
3417       if (callee->has_reserved_stack_access()) {
3418         compilation()->set_has_reserved_stack_access(true);
3419       }
3420       return true;
3421     }
3422     // try normal inlining
3423   }
3424 
3425   // certain methods cannot be parsed at all
3426   msg = check_can_parse(callee);
3427   if (msg != NULL) {
3428     print_inlining(callee, msg, /*success*/ false);
3429     return false;
3430   }
3431 
3432   // If bytecode not set use the current one.
3433   if (bc == Bytecodes::_illegal) {
3434     bc = code();
3435   }
3436   if (try_inline_full(callee, holder_known, ignore_return, bc, receiver)) {
3437     if (callee->has_reserved_stack_access()) {
3438       compilation()->set_has_reserved_stack_access(true);
3439     }
3440     return true;
3441   }
3442 
3443   // Entire compilation could fail during try_inline_full call.
3444   // In that case printing inlining decision info is useless.
3445   if (!bailed_out())
3446     print_inlining(callee, _inline_bailout_msg, /*success*/ false);
3447 
3448   return false;
3449 }
3450 
3451 
3452 const char* GraphBuilder::check_can_parse(ciMethod* callee) const {
3453   // Certain methods cannot be parsed at all:
3454   if ( callee->is_native())            return "native method";
3455   if ( callee->is_abstract())          return "abstract method";
3456   if (!callee->can_be_parsed())        return "cannot be parsed";
3457   return NULL;
3458 }
3459 
3460 // negative filter: should callee NOT be inlined?  returns NULL, ok to inline, or rejection msg
3461 const char* GraphBuilder::should_not_inline(ciMethod* callee) const {
3462   if ( compilation()->directive()->should_not_inline(callee)) return "disallowed by CompileCommand";
3463   if ( callee->dont_inline())          return "don't inline by annotation";
3464   return NULL;
3465 }
3466 
3467 void GraphBuilder::build_graph_for_intrinsic(ciMethod* callee, bool ignore_return) {
3468   vmIntrinsics::ID id = callee->intrinsic_id();
3469   assert(id != vmIntrinsics::_none, "must be a VM intrinsic");
3470 
3471   // Some intrinsics need special IR nodes.
3472   switch(id) {
3473   case vmIntrinsics::_getReference           : append_unsafe_get(callee, T_OBJECT,  false); return;
3474   case vmIntrinsics::_getBoolean             : append_unsafe_get(callee, T_BOOLEAN, false); return;
3475   case vmIntrinsics::_getByte                : append_unsafe_get(callee, T_BYTE,    false); return;
3476   case vmIntrinsics::_getShort               : append_unsafe_get(callee, T_SHORT,   false); return;
3477   case vmIntrinsics::_getChar                : append_unsafe_get(callee, T_CHAR,    false); return;
3478   case vmIntrinsics::_getInt                 : append_unsafe_get(callee, T_INT,     false); return;
3479   case vmIntrinsics::_getLong                : append_unsafe_get(callee, T_LONG,    false); return;
3480   case vmIntrinsics::_getFloat               : append_unsafe_get(callee, T_FLOAT,   false); return;
3481   case vmIntrinsics::_getDouble              : append_unsafe_get(callee, T_DOUBLE,  false); return;
3482   case vmIntrinsics::_putReference           : append_unsafe_put(callee, T_OBJECT,  false); return;
3483   case vmIntrinsics::_putBoolean             : append_unsafe_put(callee, T_BOOLEAN, false); return;
3484   case vmIntrinsics::_putByte                : append_unsafe_put(callee, T_BYTE,    false); return;
3485   case vmIntrinsics::_putShort               : append_unsafe_put(callee, T_SHORT,   false); return;
3486   case vmIntrinsics::_putChar                : append_unsafe_put(callee, T_CHAR,    false); return;
3487   case vmIntrinsics::_putInt                 : append_unsafe_put(callee, T_INT,     false); return;
3488   case vmIntrinsics::_putLong                : append_unsafe_put(callee, T_LONG,    false); return;
3489   case vmIntrinsics::_putFloat               : append_unsafe_put(callee, T_FLOAT,   false); return;
3490   case vmIntrinsics::_putDouble              : append_unsafe_put(callee, T_DOUBLE,  false); return;
3491   case vmIntrinsics::_getShortUnaligned      : append_unsafe_get(callee, T_SHORT,   false); return;
3492   case vmIntrinsics::_getCharUnaligned       : append_unsafe_get(callee, T_CHAR,    false); return;
3493   case vmIntrinsics::_getIntUnaligned        : append_unsafe_get(callee, T_INT,     false); return;
3494   case vmIntrinsics::_getLongUnaligned       : append_unsafe_get(callee, T_LONG,    false); return;
3495   case vmIntrinsics::_putShortUnaligned      : append_unsafe_put(callee, T_SHORT,   false); return;
3496   case vmIntrinsics::_putCharUnaligned       : append_unsafe_put(callee, T_CHAR,    false); return;
3497   case vmIntrinsics::_putIntUnaligned        : append_unsafe_put(callee, T_INT,     false); return;
3498   case vmIntrinsics::_putLongUnaligned       : append_unsafe_put(callee, T_LONG,    false); return;
3499   case vmIntrinsics::_getReferenceVolatile   : append_unsafe_get(callee, T_OBJECT,  true); return;
3500   case vmIntrinsics::_getBooleanVolatile     : append_unsafe_get(callee, T_BOOLEAN, true); return;
3501   case vmIntrinsics::_getByteVolatile        : append_unsafe_get(callee, T_BYTE,    true); return;
3502   case vmIntrinsics::_getShortVolatile       : append_unsafe_get(callee, T_SHORT,   true); return;
3503   case vmIntrinsics::_getCharVolatile        : append_unsafe_get(callee, T_CHAR,    true); return;
3504   case vmIntrinsics::_getIntVolatile         : append_unsafe_get(callee, T_INT,     true); return;
3505   case vmIntrinsics::_getLongVolatile        : append_unsafe_get(callee, T_LONG,    true); return;
3506   case vmIntrinsics::_getFloatVolatile       : append_unsafe_get(callee, T_FLOAT,   true); return;
3507   case vmIntrinsics::_getDoubleVolatile      : append_unsafe_get(callee, T_DOUBLE,  true); return;
3508   case vmIntrinsics::_putReferenceVolatile   : append_unsafe_put(callee, T_OBJECT,  true); return;
3509   case vmIntrinsics::_putBooleanVolatile     : append_unsafe_put(callee, T_BOOLEAN, true); return;
3510   case vmIntrinsics::_putByteVolatile        : append_unsafe_put(callee, T_BYTE,    true); return;
3511   case vmIntrinsics::_putShortVolatile       : append_unsafe_put(callee, T_SHORT,   true); return;
3512   case vmIntrinsics::_putCharVolatile        : append_unsafe_put(callee, T_CHAR,    true); return;
3513   case vmIntrinsics::_putIntVolatile         : append_unsafe_put(callee, T_INT,     true); return;
3514   case vmIntrinsics::_putLongVolatile        : append_unsafe_put(callee, T_LONG,    true); return;
3515   case vmIntrinsics::_putFloatVolatile       : append_unsafe_put(callee, T_FLOAT,   true); return;
3516   case vmIntrinsics::_putDoubleVolatile      : append_unsafe_put(callee, T_DOUBLE,  true); return;
3517   case vmIntrinsics::_compareAndSetLong:
3518   case vmIntrinsics::_compareAndSetInt:
3519   case vmIntrinsics::_compareAndSetReference : append_unsafe_CAS(callee); return;
3520   case vmIntrinsics::_getAndAddInt:
3521   case vmIntrinsics::_getAndAddLong          : append_unsafe_get_and_set(callee, true); return;
3522   case vmIntrinsics::_getAndSetInt           :
3523   case vmIntrinsics::_getAndSetLong          :
3524   case vmIntrinsics::_getAndSetReference     : append_unsafe_get_and_set(callee, false); return;
3525   case vmIntrinsics::_getCharStringU         : append_char_access(callee, false); return;
3526   case vmIntrinsics::_putCharStringU         : append_char_access(callee, true); return;
3527   default:
3528     break;
3529   }
3530 
3531   // create intrinsic node
3532   const bool has_receiver = !callee->is_static();
3533   ValueType* result_type = as_ValueType(callee->return_type());
3534   ValueStack* state_before = copy_state_for_exception();
3535 
3536   Values* args = state()->pop_arguments(callee->arg_size());
3537 
3538   if (is_profiling()) {
3539     // Don't profile in the special case where the root method
3540     // is the intrinsic
3541     if (callee != method()) {
3542       // Note that we'd collect profile data in this method if we wanted it.
3543       compilation()->set_would_profile(true);
3544       if (profile_calls()) {
3545         Value recv = NULL;
3546         if (has_receiver) {
3547           recv = args->at(0);
3548           null_check(recv);
3549         }
3550         profile_call(callee, recv, NULL, collect_args_for_profiling(args, callee, true), true);
3551       }
3552     }
3553   }
3554 
3555   Intrinsic* result = new Intrinsic(result_type, callee->intrinsic_id(),
3556                                     args, has_receiver, state_before,
3557                                     vmIntrinsics::preserves_state(id),
3558                                     vmIntrinsics::can_trap(id));
3559   // append instruction & push result
3560   Value value = append_split(result);
3561   if (result_type != voidType && !ignore_return) {
3562     push(result_type, value);
3563   }
3564 
3565   if (callee != method() && profile_return() && result_type->is_object_kind()) {
3566     profile_return_type(result, callee);
3567   }
3568 }
3569 
3570 bool GraphBuilder::try_inline_intrinsics(ciMethod* callee, bool ignore_return) {
3571   // For calling is_intrinsic_available we need to transition to
3572   // the '_thread_in_vm' state because is_intrinsic_available()
3573   // accesses critical VM-internal data.
3574   bool is_available = false;
3575   {
3576     VM_ENTRY_MARK;
3577     methodHandle mh(THREAD, callee->get_Method());
3578     is_available = _compilation->compiler()->is_intrinsic_available(mh, _compilation->directive());
3579   }
3580 
3581   if (!is_available) {
3582     if (!InlineNatives) {
3583       // Return false and also set message that the inlining of
3584       // intrinsics has been disabled in general.
3585       INLINE_BAILOUT("intrinsic method inlining disabled");
3586     } else {
3587       return false;
3588     }
3589   }
3590   build_graph_for_intrinsic(callee, ignore_return);
3591   return true;
3592 }
3593 
3594 
3595 bool GraphBuilder::try_inline_jsr(int jsr_dest_bci) {
3596   // Introduce a new callee continuation point - all Ret instructions
3597   // will be replaced with Gotos to this point.
3598   BlockBegin* cont = block_at(next_bci());
3599   assert(cont != NULL, "continuation must exist (BlockListBuilder starts a new block after a jsr");
3600 
3601   // Note: can not assign state to continuation yet, as we have to
3602   // pick up the state from the Ret instructions.
3603 
3604   // Push callee scope
3605   push_scope_for_jsr(cont, jsr_dest_bci);
3606 
3607   // Temporarily set up bytecode stream so we can append instructions
3608   // (only using the bci of this stream)
3609   scope_data()->set_stream(scope_data()->parent()->stream());
3610 
3611   BlockBegin* jsr_start_block = block_at(jsr_dest_bci);
3612   assert(jsr_start_block != NULL, "jsr start block must exist");
3613   assert(!jsr_start_block->is_set(BlockBegin::was_visited_flag), "should not have visited jsr yet");
3614   Goto* goto_sub = new Goto(jsr_start_block, false);
3615   // Must copy state to avoid wrong sharing when parsing bytecodes
3616   assert(jsr_start_block->state() == NULL, "should have fresh jsr starting block");
3617   jsr_start_block->set_state(copy_state_before_with_bci(jsr_dest_bci));
3618   append(goto_sub);
3619   _block->set_end(goto_sub);
3620   _last = _block = jsr_start_block;
3621 
3622   // Clear out bytecode stream
3623   scope_data()->set_stream(NULL);
3624 
3625   scope_data()->add_to_work_list(jsr_start_block);
3626 
3627   // Ready to resume parsing in subroutine
3628   iterate_all_blocks();
3629 
3630   // If we bailed out during parsing, return immediately (this is bad news)
3631   CHECK_BAILOUT_(false);
3632 
3633   // Detect whether the continuation can actually be reached. If not,
3634   // it has not had state set by the join() operations in
3635   // iterate_bytecodes_for_block()/ret() and we should not touch the
3636   // iteration state. The calling activation of
3637   // iterate_bytecodes_for_block will then complete normally.
3638   if (cont->state() != NULL) {
3639     if (!cont->is_set(BlockBegin::was_visited_flag)) {
3640       // add continuation to work list instead of parsing it immediately
3641       scope_data()->parent()->add_to_work_list(cont);
3642     }
3643   }
3644 
3645   assert(jsr_continuation() == cont, "continuation must not have changed");
3646   assert(!jsr_continuation()->is_set(BlockBegin::was_visited_flag) ||
3647          jsr_continuation()->is_set(BlockBegin::parser_loop_header_flag),
3648          "continuation can only be visited in case of backward branches");
3649   assert(_last && _last->as_BlockEnd(), "block must have end");
3650 
3651   // continuation is in work list, so end iteration of current block
3652   _skip_block = true;
3653   pop_scope_for_jsr();
3654 
3655   return true;
3656 }
3657 
3658 
3659 // Inline the entry of a synchronized method as a monitor enter and
3660 // register the exception handler which releases the monitor if an
3661 // exception is thrown within the callee. Note that the monitor enter
3662 // cannot throw an exception itself, because the receiver is
3663 // guaranteed to be non-null by the explicit null check at the
3664 // beginning of inlining.
3665 void GraphBuilder::inline_sync_entry(Value lock, BlockBegin* sync_handler) {
3666   assert(lock != NULL && sync_handler != NULL, "lock or handler missing");
3667 
3668   monitorenter(lock, SynchronizationEntryBCI);
3669   assert(_last->as_MonitorEnter() != NULL, "monitor enter expected");
3670   _last->set_needs_null_check(false);
3671 
3672   sync_handler->set(BlockBegin::exception_entry_flag);
3673   sync_handler->set(BlockBegin::is_on_work_list_flag);
3674 
3675   ciExceptionHandler* desc = new ciExceptionHandler(method()->holder(), 0, method()->code_size(), -1, 0);
3676   XHandler* h = new XHandler(desc);
3677   h->set_entry_block(sync_handler);
3678   scope_data()->xhandlers()->append(h);
3679   scope_data()->set_has_handler();
3680 }
3681 
3682 
3683 // If an exception is thrown and not handled within an inlined
3684 // synchronized method, the monitor must be released before the
3685 // exception is rethrown in the outer scope. Generate the appropriate
3686 // instructions here.
3687 void GraphBuilder::fill_sync_handler(Value lock, BlockBegin* sync_handler, bool default_handler) {
3688   BlockBegin* orig_block = _block;
3689   ValueStack* orig_state = _state;
3690   Instruction* orig_last = _last;
3691   _last = _block = sync_handler;
3692   _state = sync_handler->state()->copy();
3693 
3694   assert(sync_handler != NULL, "handler missing");
3695   assert(!sync_handler->is_set(BlockBegin::was_visited_flag), "is visited here");
3696 
3697   assert(lock != NULL || default_handler, "lock or handler missing");
3698 
3699   XHandler* h = scope_data()->xhandlers()->remove_last();
3700   assert(h->entry_block() == sync_handler, "corrupt list of handlers");
3701 
3702   block()->set(BlockBegin::was_visited_flag);
3703   Value exception = append_with_bci(new ExceptionObject(), SynchronizationEntryBCI);
3704   assert(exception->is_pinned(), "must be");
3705 
3706   int bci = SynchronizationEntryBCI;
3707   if (compilation()->env()->dtrace_method_probes()) {
3708     // Report exit from inline methods.  We don't have a stream here
3709     // so pass an explicit bci of SynchronizationEntryBCI.
3710     Values* args = new Values(1);
3711     args->push(append_with_bci(new Constant(new MethodConstant(method())), bci));
3712     append_with_bci(new RuntimeCall(voidType, "dtrace_method_exit", CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_method_exit), args), bci);
3713   }
3714 
3715   if (lock) {
3716     assert(state()->locks_size() > 0 && state()->lock_at(state()->locks_size() - 1) == lock, "lock is missing");
3717     if (!lock->is_linked()) {
3718       lock = append_with_bci(lock, bci);
3719     }
3720 
3721     // exit the monitor in the context of the synchronized method
3722     monitorexit(lock, bci);
3723 
3724     // exit the context of the synchronized method
3725     if (!default_handler) {
3726       pop_scope();
3727       bci = _state->caller_state()->bci();
3728       _state = _state->caller_state()->copy_for_parsing();
3729     }
3730   }
3731 
3732   // perform the throw as if at the the call site
3733   apush(exception);
3734   throw_op(bci);
3735 
3736   BlockEnd* end = last()->as_BlockEnd();
3737   block()->set_end(end);
3738 
3739   _block = orig_block;
3740   _state = orig_state;
3741   _last = orig_last;
3742 }
3743 
3744 
3745 bool GraphBuilder::try_inline_full(ciMethod* callee, bool holder_known, bool ignore_return, Bytecodes::Code bc, Value receiver) {
3746   assert(!callee->is_native(), "callee must not be native");
3747   if (CompilationPolicy::should_not_inline(compilation()->env(), callee)) {
3748     INLINE_BAILOUT("inlining prohibited by policy");
3749   }
3750   // first perform tests of things it's not possible to inline
3751   if (callee->has_exception_handlers() &&
3752       !InlineMethodsWithExceptionHandlers) INLINE_BAILOUT("callee has exception handlers");
3753   if (callee->is_synchronized() &&
3754       !InlineSynchronizedMethods         ) INLINE_BAILOUT("callee is synchronized");
3755   if (!callee->holder()->is_linked())      INLINE_BAILOUT("callee's klass not linked yet");
3756   if (bc == Bytecodes::_invokestatic &&
3757       !callee->holder()->is_initialized()) INLINE_BAILOUT("callee's klass not initialized yet");
3758   if (!callee->has_balanced_monitors())    INLINE_BAILOUT("callee's monitors do not match");
3759 
3760   // Proper inlining of methods with jsrs requires a little more work.
3761   if (callee->has_jsrs()                 ) INLINE_BAILOUT("jsrs not handled properly by inliner yet");
3762 
3763   if (is_profiling() && !callee->ensure_method_data()) {
3764     INLINE_BAILOUT("mdo allocation failed");
3765   }
3766 
3767   const bool is_invokedynamic = (bc == Bytecodes::_invokedynamic);
3768   const bool has_receiver = (bc != Bytecodes::_invokestatic && !is_invokedynamic);
3769 
3770   const int args_base = state()->stack_size() - callee->arg_size();
3771   assert(args_base >= 0, "stack underflow during inlining");
3772 
3773   Value recv = NULL;
3774   if (has_receiver) {
3775     assert(!callee->is_static(), "callee must not be static");
3776     assert(callee->arg_size() > 0, "must have at least a receiver");
3777 
3778     recv = state()->stack_at(args_base);
3779     if (recv->is_null_obj()) {
3780       INLINE_BAILOUT("receiver is always null");
3781     }
3782   }
3783 
3784   // now perform tests that are based on flag settings
3785   bool inlinee_by_directive = compilation()->directive()->should_inline(callee);
3786   if (callee->force_inline() || inlinee_by_directive) {
3787     if (inline_level() > MaxForceInlineLevel                      ) INLINE_BAILOUT("MaxForceInlineLevel");
3788     if (recursive_inline_level(callee) > C1MaxRecursiveInlineLevel) INLINE_BAILOUT("recursive inlining too deep");
3789 
3790     const char* msg = "";
3791     if (callee->force_inline())  msg = "force inline by annotation";
3792     if (inlinee_by_directive)    msg = "force inline by CompileCommand";
3793     print_inlining(callee, msg);
3794   } else {
3795     // use heuristic controls on inlining
3796     if (inline_level() > C1MaxInlineLevel                       ) INLINE_BAILOUT("inlining too deep");
3797     int callee_recursive_level = recursive_inline_level(callee);
3798     if (callee_recursive_level > C1MaxRecursiveInlineLevel      ) INLINE_BAILOUT("recursive inlining too deep");
3799     if (callee->code_size_for_inlining() > max_inline_size()    ) INLINE_BAILOUT("callee is too large");
3800     // Additional condition to limit stack usage for non-recursive calls.
3801     if ((callee_recursive_level == 0) &&
3802         (callee->max_stack() + callee->max_locals() - callee->size_of_parameters() > C1InlineStackLimit)) {
3803       INLINE_BAILOUT("callee uses too much stack");
3804     }
3805 
3806     // don't inline throwable methods unless the inlining tree is rooted in a throwable class
3807     if (callee->name() == ciSymbols::object_initializer_name() &&
3808         callee->holder()->is_subclass_of(ciEnv::current()->Throwable_klass())) {
3809       // Throwable constructor call
3810       IRScope* top = scope();
3811       while (top->caller() != NULL) {
3812         top = top->caller();
3813       }
3814       if (!top->method()->holder()->is_subclass_of(ciEnv::current()->Throwable_klass())) {
3815         INLINE_BAILOUT("don't inline Throwable constructors");
3816       }
3817     }
3818 
3819     if (compilation()->env()->num_inlined_bytecodes() > DesiredMethodLimit) {
3820       INLINE_BAILOUT("total inlining greater than DesiredMethodLimit");
3821     }
3822     // printing
3823     print_inlining(callee, "inline", /*success*/ true);
3824   }
3825 
3826   assert(bc != Bytecodes::_invokestatic || callee->holder()->is_initialized(), "required");
3827 
3828   // NOTE: Bailouts from this point on, which occur at the
3829   // GraphBuilder level, do not cause bailout just of the inlining but
3830   // in fact of the entire compilation.
3831 
3832   BlockBegin* orig_block = block();
3833 
3834   // Insert null check if necessary
3835   if (has_receiver) {
3836     // note: null check must happen even if first instruction of callee does
3837     //       an implicit null check since the callee is in a different scope
3838     //       and we must make sure exception handling does the right thing
3839     null_check(recv);
3840   }
3841 
3842   if (is_profiling()) {
3843     // Note that we'd collect profile data in this method if we wanted it.
3844     // this may be redundant here...
3845     compilation()->set_would_profile(true);
3846 
3847     if (profile_calls()) {
3848       int start = 0;
3849       Values* obj_args = args_list_for_profiling(callee, start, has_receiver);
3850       if (obj_args != NULL) {
3851         int s = obj_args->max_length();
3852         // if called through method handle invoke, some arguments may have been popped
3853         for (int i = args_base+start, j = 0; j < obj_args->max_length() && i < state()->stack_size(); ) {
3854           Value v = state()->stack_at_inc(i);
3855           if (v->type()->is_object_kind()) {
3856             obj_args->push(v);
3857             j++;
3858           }
3859         }
3860         check_args_for_profiling(obj_args, s);
3861       }
3862       profile_call(callee, recv, holder_known ? callee->holder() : NULL, obj_args, true);
3863     }
3864   }
3865 
3866   // Introduce a new callee continuation point - if the callee has
3867   // more than one return instruction or the return does not allow
3868   // fall-through of control flow, all return instructions of the
3869   // callee will need to be replaced by Goto's pointing to this
3870   // continuation point.
3871   BlockBegin* cont = block_at(next_bci());
3872   bool continuation_existed = true;
3873   if (cont == NULL) {
3874     cont = new BlockBegin(next_bci());
3875     // low number so that continuation gets parsed as early as possible
3876     cont->set_depth_first_number(0);
3877     if (PrintInitialBlockList) {
3878       tty->print_cr("CFG: created block %d (bci %d) as continuation for inline at bci %d",
3879                     cont->block_id(), cont->bci(), bci());
3880     }
3881     continuation_existed = false;
3882   }
3883   // Record number of predecessors of continuation block before
3884   // inlining, to detect if inlined method has edges to its
3885   // continuation after inlining.
3886   int continuation_preds = cont->number_of_preds();
3887 
3888   // Push callee scope
3889   push_scope(callee, cont);
3890 
3891   // the BlockListBuilder for the callee could have bailed out
3892   if (bailed_out())
3893       return false;
3894 
3895   // Temporarily set up bytecode stream so we can append instructions
3896   // (only using the bci of this stream)
3897   scope_data()->set_stream(scope_data()->parent()->stream());
3898 
3899   // Pass parameters into callee state: add assignments
3900   // note: this will also ensure that all arguments are computed before being passed
3901   ValueStack* callee_state = state();
3902   ValueStack* caller_state = state()->caller_state();
3903   for (int i = args_base; i < caller_state->stack_size(); ) {
3904     const int arg_no = i - args_base;
3905     Value arg = caller_state->stack_at_inc(i);
3906     store_local(callee_state, arg, arg_no);
3907   }
3908 
3909   // Remove args from stack.
3910   // Note that we preserve locals state in case we can use it later
3911   // (see use of pop_scope() below)
3912   caller_state->truncate_stack(args_base);
3913   assert(callee_state->stack_size() == 0, "callee stack must be empty");
3914 
3915   Value lock = NULL;
3916   BlockBegin* sync_handler = NULL;
3917 
3918   // Inline the locking of the receiver if the callee is synchronized
3919   if (callee->is_synchronized()) {
3920     lock = callee->is_static() ? append(new Constant(new InstanceConstant(callee->holder()->java_mirror())))
3921                                : state()->local_at(0);
3922     sync_handler = new BlockBegin(SynchronizationEntryBCI);
3923     inline_sync_entry(lock, sync_handler);
3924   }
3925 
3926   if (compilation()->env()->dtrace_method_probes()) {
3927     Values* args = new Values(1);
3928     args->push(append(new Constant(new MethodConstant(method()))));
3929     append(new RuntimeCall(voidType, "dtrace_method_entry", CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_method_entry), args));
3930   }
3931 
3932   if (profile_inlined_calls()) {
3933     profile_invocation(callee, copy_state_before_with_bci(SynchronizationEntryBCI));
3934   }
3935 
3936   BlockBegin* callee_start_block = block_at(0);
3937   if (callee_start_block != NULL) {
3938     assert(callee_start_block->is_set(BlockBegin::parser_loop_header_flag), "must be loop header");
3939     Goto* goto_callee = new Goto(callee_start_block, false);
3940     // The state for this goto is in the scope of the callee, so use
3941     // the entry bci for the callee instead of the call site bci.
3942     append_with_bci(goto_callee, 0);
3943     _block->set_end(goto_callee);
3944     callee_start_block->merge(callee_state);
3945 
3946     _last = _block = callee_start_block;
3947 
3948     scope_data()->add_to_work_list(callee_start_block);
3949   }
3950 
3951   // Clear out bytecode stream
3952   scope_data()->set_stream(NULL);
3953   scope_data()->set_ignore_return(ignore_return);
3954 
3955   CompileLog* log = compilation()->log();
3956   if (log != NULL) log->head("parse method='%d'", log->identify(callee));
3957 
3958   // Ready to resume parsing in callee (either in the same block we
3959   // were in before or in the callee's start block)
3960   iterate_all_blocks(callee_start_block == NULL);
3961 
3962   if (log != NULL) log->done("parse");
3963 
3964   // If we bailed out during parsing, return immediately (this is bad news)
3965   if (bailed_out())
3966       return false;
3967 
3968   // iterate_all_blocks theoretically traverses in random order; in
3969   // practice, we have only traversed the continuation if we are
3970   // inlining into a subroutine
3971   assert(continuation_existed ||
3972          !continuation()->is_set(BlockBegin::was_visited_flag),
3973          "continuation should not have been parsed yet if we created it");
3974 
3975   // At this point we are almost ready to return and resume parsing of
3976   // the caller back in the GraphBuilder. The only thing we want to do
3977   // first is an optimization: during parsing of the callee we
3978   // generated at least one Goto to the continuation block. If we
3979   // generated exactly one, and if the inlined method spanned exactly
3980   // one block (and we didn't have to Goto its entry), then we snip
3981   // off the Goto to the continuation, allowing control to fall
3982   // through back into the caller block and effectively performing
3983   // block merging. This allows load elimination and CSE to take place
3984   // across multiple callee scopes if they are relatively simple, and
3985   // is currently essential to making inlining profitable.
3986   if (num_returns() == 1
3987       && block() == orig_block
3988       && block() == inline_cleanup_block()) {
3989     _last  = inline_cleanup_return_prev();
3990     _state = inline_cleanup_state();
3991   } else if (continuation_preds == cont->number_of_preds()) {
3992     // Inlining caused that the instructions after the invoke in the
3993     // caller are not reachable any more. So skip filling this block
3994     // with instructions!
3995     assert(cont == continuation(), "");
3996     assert(_last && _last->as_BlockEnd(), "");
3997     _skip_block = true;
3998   } else {
3999     // Resume parsing in continuation block unless it was already parsed.
4000     // Note that if we don't change _last here, iteration in
4001     // iterate_bytecodes_for_block will stop when we return.
4002     if (!continuation()->is_set(BlockBegin::was_visited_flag)) {
4003       // add continuation to work list instead of parsing it immediately
4004       assert(_last && _last->as_BlockEnd(), "");
4005       scope_data()->parent()->add_to_work_list(continuation());
4006       _skip_block = true;
4007     }
4008   }
4009 
4010   // Fill the exception handler for synchronized methods with instructions
4011   if (callee->is_synchronized() && sync_handler->state() != NULL) {
4012     fill_sync_handler(lock, sync_handler);
4013   } else {
4014     pop_scope();
4015   }
4016 
4017   compilation()->notice_inlined_method(callee);
4018 
4019   return true;
4020 }
4021 
4022 
4023 bool GraphBuilder::try_method_handle_inline(ciMethod* callee, bool ignore_return) {
4024   ValueStack* state_before = copy_state_before();
4025   vmIntrinsics::ID iid = callee->intrinsic_id();
4026   switch (iid) {
4027   case vmIntrinsics::_invokeBasic:
4028     {
4029       // get MethodHandle receiver
4030       const int args_base = state()->stack_size() - callee->arg_size();
4031       ValueType* type = state()->stack_at(args_base)->type();
4032       if (type->is_constant()) {
4033         ciMethod* target = type->as_ObjectType()->constant_value()->as_method_handle()->get_vmtarget();
4034         // We don't do CHA here so only inline static and statically bindable methods.
4035         if (target->is_static() || target->can_be_statically_bound()) {
4036           if (ciMethod::is_consistent_info(callee, target)) {
4037             Bytecodes::Code bc = target->is_static() ? Bytecodes::_invokestatic : Bytecodes::_invokevirtual;
4038             ignore_return = ignore_return || (callee->return_type()->is_void() && !target->return_type()->is_void());
4039             if (try_inline(target, /*holder_known*/ !callee->is_static(), ignore_return, bc)) {
4040               return true;
4041             }
4042           } else {
4043             print_inlining(target, "signatures mismatch", /*success*/ false);
4044           }
4045         } else {
4046           print_inlining(target, "not static or statically bindable", /*success*/ false);
4047         }
4048       } else {
4049         print_inlining(callee, "receiver not constant", /*success*/ false);
4050       }
4051     }
4052     break;
4053 
4054   case vmIntrinsics::_linkToVirtual:
4055   case vmIntrinsics::_linkToStatic:
4056   case vmIntrinsics::_linkToSpecial:
4057   case vmIntrinsics::_linkToInterface:
4058     {
4059       // pop MemberName argument
4060       const int args_base = state()->stack_size() - callee->arg_size();
4061       ValueType* type = apop()->type();
4062       if (type->is_constant()) {
4063         ciMethod* target = type->as_ObjectType()->constant_value()->as_member_name()->get_vmtarget();
4064         ignore_return = ignore_return || (callee->return_type()->is_void() && !target->return_type()->is_void());
4065         // If the target is another method handle invoke, try to recursively get
4066         // a better target.
4067         if (target->is_method_handle_intrinsic()) {
4068           if (try_method_handle_inline(target, ignore_return)) {
4069             return true;
4070           }
4071         } else if (!ciMethod::is_consistent_info(callee, target)) {
4072           print_inlining(target, "signatures mismatch", /*success*/ false);
4073         } else {
4074           ciSignature* signature = target->signature();
4075           const int receiver_skip = target->is_static() ? 0 : 1;
4076           // Cast receiver to its type.
4077           if (!target->is_static()) {
4078             ciKlass* tk = signature->accessing_klass();
4079             Value obj = state()->stack_at(args_base);
4080             if (obj->exact_type() == NULL &&
4081                 obj->declared_type() != tk && tk != compilation()->env()->Object_klass()) {
4082               TypeCast* c = new TypeCast(tk, obj, state_before);
4083               append(c);
4084               state()->stack_at_put(args_base, c);
4085             }
4086           }
4087           // Cast reference arguments to its type.
4088           for (int i = 0, j = 0; i < signature->count(); i++) {
4089             ciType* t = signature->type_at(i);
4090             if (t->is_klass()) {
4091               ciKlass* tk = t->as_klass();
4092               Value obj = state()->stack_at(args_base + receiver_skip + j);
4093               if (obj->exact_type() == NULL &&
4094                   obj->declared_type() != tk && tk != compilation()->env()->Object_klass()) {
4095                 TypeCast* c = new TypeCast(t, obj, state_before);
4096                 append(c);
4097                 state()->stack_at_put(args_base + receiver_skip + j, c);
4098               }
4099             }
4100             j += t->size();  // long and double take two slots
4101           }
4102           // We don't do CHA here so only inline static and statically bindable methods.
4103           if (target->is_static() || target->can_be_statically_bound()) {
4104             Bytecodes::Code bc = target->is_static() ? Bytecodes::_invokestatic : Bytecodes::_invokevirtual;
4105             if (try_inline(target, /*holder_known*/ !callee->is_static(), ignore_return, bc)) {
4106               return true;
4107             }
4108           } else {
4109             print_inlining(target, "not static or statically bindable", /*success*/ false);
4110           }
4111         }
4112       } else {
4113         print_inlining(callee, "MemberName not constant", /*success*/ false);
4114       }
4115     }
4116     break;
4117 
4118   case vmIntrinsics::_linkToNative:
4119     break; // TODO: NYI
4120 
4121   default:
4122     fatal("unexpected intrinsic %d: %s", vmIntrinsics::as_int(iid), vmIntrinsics::name_at(iid));
4123     break;
4124   }
4125   set_state(state_before->copy_for_parsing());
4126   return false;
4127 }
4128 
4129 
4130 void GraphBuilder::inline_bailout(const char* msg) {
4131   assert(msg != NULL, "inline bailout msg must exist");
4132   _inline_bailout_msg = msg;
4133 }
4134 
4135 
4136 void GraphBuilder::clear_inline_bailout() {
4137   _inline_bailout_msg = NULL;
4138 }
4139 
4140 
4141 void GraphBuilder::push_root_scope(IRScope* scope, BlockList* bci2block, BlockBegin* start) {
4142   ScopeData* data = new ScopeData(NULL);
4143   data->set_scope(scope);
4144   data->set_bci2block(bci2block);
4145   _scope_data = data;
4146   _block = start;
4147 }
4148 
4149 
4150 void GraphBuilder::push_scope(ciMethod* callee, BlockBegin* continuation) {
4151   IRScope* callee_scope = new IRScope(compilation(), scope(), bci(), callee, -1, false);
4152   scope()->add_callee(callee_scope);
4153 
4154   BlockListBuilder blb(compilation(), callee_scope, -1);
4155   CHECK_BAILOUT();
4156 
4157   if (!blb.bci2block()->at(0)->is_set(BlockBegin::parser_loop_header_flag)) {
4158     // this scope can be inlined directly into the caller so remove
4159     // the block at bci 0.
4160     blb.bci2block()->at_put(0, NULL);
4161   }
4162 
4163   set_state(new ValueStack(callee_scope, state()->copy(ValueStack::CallerState, bci())));
4164 
4165   ScopeData* data = new ScopeData(scope_data());
4166   data->set_scope(callee_scope);
4167   data->set_bci2block(blb.bci2block());
4168   data->set_continuation(continuation);
4169   _scope_data = data;
4170 }
4171 
4172 
4173 void GraphBuilder::push_scope_for_jsr(BlockBegin* jsr_continuation, int jsr_dest_bci) {
4174   ScopeData* data = new ScopeData(scope_data());
4175   data->set_parsing_jsr();
4176   data->set_jsr_entry_bci(jsr_dest_bci);
4177   data->set_jsr_return_address_local(-1);
4178   // Must clone bci2block list as we will be mutating it in order to
4179   // properly clone all blocks in jsr region as well as exception
4180   // handlers containing rets
4181   BlockList* new_bci2block = new BlockList(bci2block()->length());
4182   new_bci2block->appendAll(bci2block());
4183   data->set_bci2block(new_bci2block);
4184   data->set_scope(scope());
4185   data->setup_jsr_xhandlers();
4186   data->set_continuation(continuation());
4187   data->set_jsr_continuation(jsr_continuation);
4188   _scope_data = data;
4189 }
4190 
4191 
4192 void GraphBuilder::pop_scope() {
4193   int number_of_locks = scope()->number_of_locks();
4194   _scope_data = scope_data()->parent();
4195   // accumulate minimum number of monitor slots to be reserved
4196   scope()->set_min_number_of_locks(number_of_locks);
4197 }
4198 
4199 
4200 void GraphBuilder::pop_scope_for_jsr() {
4201   _scope_data = scope_data()->parent();
4202 }
4203 
4204 void GraphBuilder::append_unsafe_get(ciMethod* callee, BasicType t, bool is_volatile) {
4205   Values* args = state()->pop_arguments(callee->arg_size());
4206   null_check(args->at(0));
4207   Instruction* offset = args->at(2);
4208 #ifndef _LP64
4209   offset = append(new Convert(Bytecodes::_l2i, offset, as_ValueType(T_INT)));
4210 #endif
4211   Instruction* op = append(new UnsafeGet(t, args->at(1), offset, is_volatile));
4212   push(op->type(), op);
4213   compilation()->set_has_unsafe_access(true);
4214 }
4215 
4216 
4217 void GraphBuilder::append_unsafe_put(ciMethod* callee, BasicType t, bool is_volatile) {
4218   Values* args = state()->pop_arguments(callee->arg_size());
4219   null_check(args->at(0));
4220   Instruction* offset = args->at(2);
4221 #ifndef _LP64
4222   offset = append(new Convert(Bytecodes::_l2i, offset, as_ValueType(T_INT)));
4223 #endif
4224   Value val = args->at(3);
4225   if (t == T_BOOLEAN) {
4226     Value mask = append(new Constant(new IntConstant(1)));
4227     val = append(new LogicOp(Bytecodes::_iand, val, mask));
4228   }
4229   Instruction* op = append(new UnsafePut(t, args->at(1), offset, val, is_volatile));
4230   compilation()->set_has_unsafe_access(true);
4231   kill_all();
4232 }
4233 
4234 void GraphBuilder::append_unsafe_CAS(ciMethod* callee) {
4235   ValueStack* state_before = copy_state_for_exception();
4236   ValueType* result_type = as_ValueType(callee->return_type());
4237   assert(result_type->is_int(), "int result");
4238   Values* args = state()->pop_arguments(callee->arg_size());
4239 
4240   // Pop off some args to specially handle, then push back
4241   Value newval = args->pop();
4242   Value cmpval = args->pop();
4243   Value offset = args->pop();
4244   Value src = args->pop();
4245   Value unsafe_obj = args->pop();
4246 
4247   // Separately handle the unsafe arg. It is not needed for code
4248   // generation, but must be null checked
4249   null_check(unsafe_obj);
4250 
4251 #ifndef _LP64
4252   offset = append(new Convert(Bytecodes::_l2i, offset, as_ValueType(T_INT)));
4253 #endif
4254 
4255   args->push(src);
4256   args->push(offset);
4257   args->push(cmpval);
4258   args->push(newval);
4259 
4260   // An unsafe CAS can alias with other field accesses, but we don't
4261   // know which ones so mark the state as no preserved.  This will
4262   // cause CSE to invalidate memory across it.
4263   bool preserves_state = false;
4264   Intrinsic* result = new Intrinsic(result_type, callee->intrinsic_id(), args, false, state_before, preserves_state);
4265   append_split(result);
4266   push(result_type, result);
4267   compilation()->set_has_unsafe_access(true);
4268 }
4269 
4270 void GraphBuilder::append_char_access(ciMethod* callee, bool is_store) {
4271   // This intrinsic accesses byte[] array as char[] array. Computing the offsets
4272   // correctly requires matched array shapes.
4273   assert (arrayOopDesc::base_offset_in_bytes(T_CHAR) == arrayOopDesc::base_offset_in_bytes(T_BYTE),
4274           "sanity: byte[] and char[] bases agree");
4275   assert (type2aelembytes(T_CHAR) == type2aelembytes(T_BYTE)*2,
4276           "sanity: byte[] and char[] scales agree");
4277 
4278   ValueStack* state_before = copy_state_indexed_access();
4279   compilation()->set_has_access_indexed(true);
4280   Values* args = state()->pop_arguments(callee->arg_size());
4281   Value array = args->at(0);
4282   Value index = args->at(1);
4283   if (is_store) {
4284     Value value = args->at(2);
4285     Instruction* store = append(new StoreIndexed(array, index, NULL, T_CHAR, value, state_before, false, true));
4286     store->set_flag(Instruction::NeedsRangeCheckFlag, false);
4287     _memory->store_value(value);
4288   } else {
4289     Instruction* load = append(new LoadIndexed(array, index, NULL, T_CHAR, state_before, true));
4290     load->set_flag(Instruction::NeedsRangeCheckFlag, false);
4291     push(load->type(), load);
4292   }
4293 }
4294 
4295 void GraphBuilder::print_inlining(ciMethod* callee, const char* msg, bool success) {
4296   CompileLog* log = compilation()->log();
4297   if (log != NULL) {
4298     assert(msg != NULL, "inlining msg should not be null!");
4299     if (success) {
4300       log->inline_success(msg);
4301     } else {
4302       log->inline_fail(msg);
4303     }
4304   }
4305   EventCompilerInlining event;
4306   if (event.should_commit()) {
4307     CompilerEvent::InlineEvent::post(event, compilation()->env()->task()->compile_id(), method()->get_Method(), callee, success, msg, bci());
4308   }
4309 
4310   CompileTask::print_inlining_ul(callee, scope()->level(), bci(), msg);
4311 
4312   if (!compilation()->directive()->PrintInliningOption) {
4313     return;
4314   }
4315   CompileTask::print_inlining_tty(callee, scope()->level(), bci(), msg);
4316   if (success && CIPrintMethodCodes) {
4317     callee->print_codes();
4318   }
4319 }
4320 
4321 void GraphBuilder::append_unsafe_get_and_set(ciMethod* callee, bool is_add) {
4322   Values* args = state()->pop_arguments(callee->arg_size());
4323   BasicType t = callee->return_type()->basic_type();
4324   null_check(args->at(0));
4325   Instruction* offset = args->at(2);
4326 #ifndef _LP64
4327   offset = append(new Convert(Bytecodes::_l2i, offset, as_ValueType(T_INT)));
4328 #endif
4329   Instruction* op = append(new UnsafeGetAndSet(t, args->at(1), offset, args->at(3), is_add));
4330   compilation()->set_has_unsafe_access(true);
4331   kill_all();
4332   push(op->type(), op);
4333 }
4334 
4335 #ifndef PRODUCT
4336 void GraphBuilder::print_stats() {
4337   vmap()->print();
4338 }
4339 #endif // PRODUCT
4340 
4341 void GraphBuilder::profile_call(ciMethod* callee, Value recv, ciKlass* known_holder, Values* obj_args, bool inlined) {
4342   assert(known_holder == NULL || (known_holder->is_instance_klass() &&
4343                                   (!known_holder->is_interface() ||
4344                                    ((ciInstanceKlass*)known_holder)->has_nonstatic_concrete_methods())), "should be non-static concrete method");
4345   if (known_holder != NULL) {
4346     if (known_holder->exact_klass() == NULL) {
4347       known_holder = compilation()->cha_exact_type(known_holder);
4348     }
4349   }
4350 
4351   append(new ProfileCall(method(), bci(), callee, recv, known_holder, obj_args, inlined));
4352 }
4353 
4354 void GraphBuilder::profile_return_type(Value ret, ciMethod* callee, ciMethod* m, int invoke_bci) {
4355   assert((m == NULL) == (invoke_bci < 0), "invalid method and invalid bci together");
4356   if (m == NULL) {
4357     m = method();
4358   }
4359   if (invoke_bci < 0) {
4360     invoke_bci = bci();
4361   }
4362   ciMethodData* md = m->method_data_or_null();
4363   ciProfileData* data = md->bci_to_data(invoke_bci);
4364   if (data != NULL && (data->is_CallTypeData() || data->is_VirtualCallTypeData())) {
4365     bool has_return = data->is_CallTypeData() ? ((ciCallTypeData*)data)->has_return() : ((ciVirtualCallTypeData*)data)->has_return();
4366     if (has_return) {
4367       append(new ProfileReturnType(m , invoke_bci, callee, ret));
4368     }
4369   }
4370 }
4371 
4372 void GraphBuilder::profile_invocation(ciMethod* callee, ValueStack* state) {
4373   append(new ProfileInvoke(callee, state));
4374 }
--- EOF ---