1 /*
   2  * Copyright (c) 1999, 2018, Oracle and/or its affiliates. All rights reserved.
   3  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   4  *
   5  * This code is free software; you can redistribute it and/or modify it
   6  * under the terms of the GNU General Public License version 2 only, as
   7  * published by the Free Software Foundation.
   8  *
   9  * This code is distributed in the hope that it will be useful, but WITHOUT
  10  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  11  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  12  * version 2 for more details (a copy is included in the LICENSE file that
  13  * accompanied this code).
  14  *
  15  * You should have received a copy of the GNU General Public License version
  16  * 2 along with this work; if not, write to the Free Software Foundation,
  17  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
  18  *
  19  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
  20  * or visit www.oracle.com if you need additional information or have any
  21  * questions.
  22  *
  23  */
  24 
  25 #include "precompiled.hpp"
  26 #include "c1/c1_CFGPrinter.hpp"
  27 #include "c1/c1_Canonicalizer.hpp"
  28 #include "c1/c1_Compilation.hpp"
  29 #include "c1/c1_GraphBuilder.hpp"
  30 #include "c1/c1_InstructionPrinter.hpp"
  31 #include "ci/ciCallSite.hpp"
  32 #include "ci/ciField.hpp"
  33 #include "ci/ciKlass.hpp"
  34 #include "ci/ciMemberName.hpp"
  35 #include "ci/ciUtilities.inline.hpp"
  36 #include "ci/ciValueKlass.hpp"
  37 #include "compiler/compileBroker.hpp"
  38 #include "interpreter/bytecode.hpp"
  39 #include "jfr/jfrEvents.hpp"
  40 #include "memory/resourceArea.hpp"
  41 #include "oops/oop.inline.hpp"
  42 #include "runtime/sharedRuntime.hpp"
  43 #include "runtime/compilationPolicy.hpp"
  44 #include "runtime/vm_version.hpp"
  45 #include "utilities/bitMap.inline.hpp"
  46 
  47 class BlockListBuilder {
  48  private:
  49   Compilation* _compilation;
  50   IRScope*     _scope;
  51 
  52   BlockList    _blocks;                // internal list of all blocks
  53   BlockList*   _bci2block;             // mapping from bci to blocks for GraphBuilder
  54 
  55   // fields used by mark_loops
  56   ResourceBitMap _active;              // for iteration of control flow graph
  57   ResourceBitMap _visited;             // for iteration of control flow graph
  58   intArray       _loop_map;            // caches the information if a block is contained in a loop
  59   int            _next_loop_index;     // next free loop number
  60   int            _next_block_number;   // for reverse postorder numbering of blocks
  61 
  62   // accessors
  63   Compilation*  compilation() const              { return _compilation; }
  64   IRScope*      scope() const                    { return _scope; }
  65   ciMethod*     method() const                   { return scope()->method(); }
  66   XHandlers*    xhandlers() const                { return scope()->xhandlers(); }
  67 
  68   // unified bailout support
  69   void          bailout(const char* msg) const   { compilation()->bailout(msg); }
  70   bool          bailed_out() const               { return compilation()->bailed_out(); }
  71 
  72   // helper functions
  73   BlockBegin* make_block_at(int bci, BlockBegin* predecessor);
  74   void handle_exceptions(BlockBegin* current, int cur_bci);
  75   void handle_jsr(BlockBegin* current, int sr_bci, int next_bci);
  76   void store_one(BlockBegin* current, int local);
  77   void store_two(BlockBegin* current, int local);
  78   void set_entries(int osr_bci);
  79   void set_leaders();
  80 
  81   void make_loop_header(BlockBegin* block);
  82   void mark_loops();
  83   int  mark_loops(BlockBegin* b, bool in_subroutine);
  84 
  85   // debugging
  86 #ifndef PRODUCT
  87   void print();
  88 #endif
  89 
  90  public:
  91   // creation
  92   BlockListBuilder(Compilation* compilation, IRScope* scope, int osr_bci);
  93 
  94   // accessors for GraphBuilder
  95   BlockList*    bci2block() const                { return _bci2block; }
  96 };
  97 
  98 
  99 // Implementation of BlockListBuilder
 100 
 101 BlockListBuilder::BlockListBuilder(Compilation* compilation, IRScope* scope, int osr_bci)
 102  : _compilation(compilation)
 103  , _scope(scope)
 104  , _blocks(16)
 105  , _bci2block(new BlockList(scope->method()->code_size(), NULL))
 106  , _active()         // size not known yet
 107  , _visited()        // size not known yet
 108  , _loop_map() // size not known yet
 109  , _next_loop_index(0)
 110  , _next_block_number(0)
 111 {
 112   set_entries(osr_bci);
 113   set_leaders();
 114   CHECK_BAILOUT();
 115 
 116   mark_loops();
 117   NOT_PRODUCT(if (PrintInitialBlockList) print());
 118 
 119 #ifndef PRODUCT
 120   if (PrintCFGToFile) {
 121     stringStream title;
 122     title.print("BlockListBuilder ");
 123     scope->method()->print_name(&title);
 124     CFGPrinter::print_cfg(_bci2block, title.as_string(), false, false);
 125   }
 126 #endif
 127 }
 128 
 129 
 130 void BlockListBuilder::set_entries(int osr_bci) {
 131   // generate start blocks
 132   BlockBegin* std_entry = make_block_at(0, NULL);
 133   if (scope()->caller() == NULL) {
 134     std_entry->set(BlockBegin::std_entry_flag);
 135   }
 136   if (osr_bci != -1) {
 137     BlockBegin* osr_entry = make_block_at(osr_bci, NULL);
 138     osr_entry->set(BlockBegin::osr_entry_flag);
 139   }
 140 
 141   // generate exception entry blocks
 142   XHandlers* list = xhandlers();
 143   const int n = list->length();
 144   for (int i = 0; i < n; i++) {
 145     XHandler* h = list->handler_at(i);
 146     BlockBegin* entry = make_block_at(h->handler_bci(), NULL);
 147     entry->set(BlockBegin::exception_entry_flag);
 148     h->set_entry_block(entry);
 149   }
 150 }
 151 
 152 
 153 BlockBegin* BlockListBuilder::make_block_at(int cur_bci, BlockBegin* predecessor) {
 154   assert(method()->bci_block_start().at(cur_bci), "wrong block starts of MethodLivenessAnalyzer");
 155 
 156   BlockBegin* block = _bci2block->at(cur_bci);
 157   if (block == NULL) {
 158     block = new BlockBegin(cur_bci);
 159     block->init_stores_to_locals(method()->max_locals());
 160     _bci2block->at_put(cur_bci, block);
 161     _blocks.append(block);
 162 
 163     assert(predecessor == NULL || predecessor->bci() < cur_bci, "targets for backward branches must already exist");
 164   }
 165 
 166   if (predecessor != NULL) {
 167     if (block->is_set(BlockBegin::exception_entry_flag)) {
 168       BAILOUT_("Exception handler can be reached by both normal and exceptional control flow", block);
 169     }
 170 
 171     predecessor->add_successor(block);
 172     block->increment_total_preds();
 173   }
 174 
 175   return block;
 176 }
 177 
 178 
 179 inline void BlockListBuilder::store_one(BlockBegin* current, int local) {
 180   current->stores_to_locals().set_bit(local);
 181 }
 182 inline void BlockListBuilder::store_two(BlockBegin* current, int local) {
 183   store_one(current, local);
 184   store_one(current, local + 1);
 185 }
 186 
 187 
 188 void BlockListBuilder::handle_exceptions(BlockBegin* current, int cur_bci) {
 189   // Draws edges from a block to its exception handlers
 190   XHandlers* list = xhandlers();
 191   const int n = list->length();
 192 
 193   for (int i = 0; i < n; i++) {
 194     XHandler* h = list->handler_at(i);
 195 
 196     if (h->covers(cur_bci)) {
 197       BlockBegin* entry = h->entry_block();
 198       assert(entry != NULL && entry == _bci2block->at(h->handler_bci()), "entry must be set");
 199       assert(entry->is_set(BlockBegin::exception_entry_flag), "flag must be set");
 200 
 201       // add each exception handler only once
 202       if (!current->is_successor(entry)) {
 203         current->add_successor(entry);
 204         entry->increment_total_preds();
 205       }
 206 
 207       // stop when reaching catchall
 208       if (h->catch_type() == 0) break;
 209     }
 210   }
 211 }
 212 
 213 void BlockListBuilder::handle_jsr(BlockBegin* current, int sr_bci, int next_bci) {
 214   // start a new block after jsr-bytecode and link this block into cfg
 215   make_block_at(next_bci, current);
 216 
 217   // start a new block at the subroutine entry at mark it with special flag
 218   BlockBegin* sr_block = make_block_at(sr_bci, current);
 219   if (!sr_block->is_set(BlockBegin::subroutine_entry_flag)) {
 220     sr_block->set(BlockBegin::subroutine_entry_flag);
 221   }
 222 }
 223 
 224 
 225 void BlockListBuilder::set_leaders() {
 226   bool has_xhandlers = xhandlers()->has_handlers();
 227   BlockBegin* current = NULL;
 228 
 229   // The information which bci starts a new block simplifies the analysis
 230   // Without it, backward branches could jump to a bci where no block was created
 231   // during bytecode iteration. This would require the creation of a new block at the
 232   // branch target and a modification of the successor lists.
 233   const BitMap& bci_block_start = method()->bci_block_start();
 234 
 235   ciBytecodeStream s(method());
 236   while (s.next() != ciBytecodeStream::EOBC()) {
 237     int cur_bci = s.cur_bci();
 238 
 239     if (bci_block_start.at(cur_bci)) {
 240       current = make_block_at(cur_bci, current);
 241     }
 242     assert(current != NULL, "must have current block");
 243 
 244     if (has_xhandlers && GraphBuilder::can_trap(method(), s.cur_bc())) {
 245       handle_exceptions(current, cur_bci);
 246     }
 247 
 248     switch (s.cur_bc()) {
 249       // track stores to local variables for selective creation of phi functions
 250       case Bytecodes::_iinc:     store_one(current, s.get_index()); break;
 251       case Bytecodes::_istore:   store_one(current, s.get_index()); break;
 252       case Bytecodes::_lstore:   store_two(current, s.get_index()); break;
 253       case Bytecodes::_fstore:   store_one(current, s.get_index()); break;
 254       case Bytecodes::_dstore:   store_two(current, s.get_index()); break;
 255       case Bytecodes::_astore:   store_one(current, s.get_index()); break;
 256       case Bytecodes::_istore_0: store_one(current, 0); break;
 257       case Bytecodes::_istore_1: store_one(current, 1); break;
 258       case Bytecodes::_istore_2: store_one(current, 2); break;
 259       case Bytecodes::_istore_3: store_one(current, 3); break;
 260       case Bytecodes::_lstore_0: store_two(current, 0); break;
 261       case Bytecodes::_lstore_1: store_two(current, 1); break;
 262       case Bytecodes::_lstore_2: store_two(current, 2); break;
 263       case Bytecodes::_lstore_3: store_two(current, 3); break;
 264       case Bytecodes::_fstore_0: store_one(current, 0); break;
 265       case Bytecodes::_fstore_1: store_one(current, 1); break;
 266       case Bytecodes::_fstore_2: store_one(current, 2); break;
 267       case Bytecodes::_fstore_3: store_one(current, 3); break;
 268       case Bytecodes::_dstore_0: store_two(current, 0); break;
 269       case Bytecodes::_dstore_1: store_two(current, 1); break;
 270       case Bytecodes::_dstore_2: store_two(current, 2); break;
 271       case Bytecodes::_dstore_3: store_two(current, 3); break;
 272       case Bytecodes::_astore_0: store_one(current, 0); break;
 273       case Bytecodes::_astore_1: store_one(current, 1); break;
 274       case Bytecodes::_astore_2: store_one(current, 2); break;
 275       case Bytecodes::_astore_3: store_one(current, 3); break;
 276 
 277       // track bytecodes that affect the control flow
 278       case Bytecodes::_athrow:  // fall through
 279       case Bytecodes::_ret:     // fall through
 280       case Bytecodes::_ireturn: // fall through
 281       case Bytecodes::_lreturn: // fall through
 282       case Bytecodes::_freturn: // fall through
 283       case Bytecodes::_dreturn: // fall through
 284       case Bytecodes::_areturn: // fall through
 285       case Bytecodes::_return:
 286         current = NULL;
 287         break;
 288 
 289       case Bytecodes::_ifeq:      // fall through
 290       case Bytecodes::_ifne:      // fall through
 291       case Bytecodes::_iflt:      // fall through
 292       case Bytecodes::_ifge:      // fall through
 293       case Bytecodes::_ifgt:      // fall through
 294       case Bytecodes::_ifle:      // fall through
 295       case Bytecodes::_if_icmpeq: // fall through
 296       case Bytecodes::_if_icmpne: // fall through
 297       case Bytecodes::_if_icmplt: // fall through
 298       case Bytecodes::_if_icmpge: // fall through
 299       case Bytecodes::_if_icmpgt: // fall through
 300       case Bytecodes::_if_icmple: // fall through
 301       case Bytecodes::_if_acmpeq: // fall through
 302       case Bytecodes::_if_acmpne: // fall through
 303       case Bytecodes::_ifnull:    // fall through
 304       case Bytecodes::_ifnonnull:
 305         make_block_at(s.next_bci(), current);
 306         make_block_at(s.get_dest(), current);
 307         current = NULL;
 308         break;
 309 
 310       case Bytecodes::_goto:
 311         make_block_at(s.get_dest(), current);
 312         current = NULL;
 313         break;
 314 
 315       case Bytecodes::_goto_w:
 316         make_block_at(s.get_far_dest(), current);
 317         current = NULL;
 318         break;
 319 
 320       case Bytecodes::_jsr:
 321         handle_jsr(current, s.get_dest(), s.next_bci());
 322         current = NULL;
 323         break;
 324 
 325       case Bytecodes::_jsr_w:
 326         handle_jsr(current, s.get_far_dest(), s.next_bci());
 327         current = NULL;
 328         break;
 329 
 330       case Bytecodes::_tableswitch: {
 331         // set block for each case
 332         Bytecode_tableswitch sw(&s);
 333         int l = sw.length();
 334         for (int i = 0; i < l; i++) {
 335           make_block_at(cur_bci + sw.dest_offset_at(i), current);
 336         }
 337         make_block_at(cur_bci + sw.default_offset(), current);
 338         current = NULL;
 339         break;
 340       }
 341 
 342       case Bytecodes::_lookupswitch: {
 343         // set block for each case
 344         Bytecode_lookupswitch sw(&s);
 345         int l = sw.number_of_pairs();
 346         for (int i = 0; i < l; i++) {
 347           make_block_at(cur_bci + sw.pair_at(i).offset(), current);
 348         }
 349         make_block_at(cur_bci + sw.default_offset(), current);
 350         current = NULL;
 351         break;
 352       }
 353 
 354       default:
 355         break;
 356     }
 357   }
 358 }
 359 
 360 
 361 void BlockListBuilder::mark_loops() {
 362   ResourceMark rm;
 363 
 364   _active.initialize(BlockBegin::number_of_blocks());
 365   _visited.initialize(BlockBegin::number_of_blocks());
 366   _loop_map = intArray(BlockBegin::number_of_blocks(), BlockBegin::number_of_blocks(), 0);
 367   _next_loop_index = 0;
 368   _next_block_number = _blocks.length();
 369 
 370   // recursively iterate the control flow graph
 371   mark_loops(_bci2block->at(0), false);
 372   assert(_next_block_number >= 0, "invalid block numbers");
 373 
 374   // Remove dangling Resource pointers before the ResourceMark goes out-of-scope.
 375   _active.resize(0);
 376   _visited.resize(0);
 377 }
 378 
 379 void BlockListBuilder::make_loop_header(BlockBegin* block) {
 380   if (block->is_set(BlockBegin::exception_entry_flag)) {
 381     // exception edges may look like loops but don't mark them as such
 382     // since it screws up block ordering.
 383     return;
 384   }
 385   if (!block->is_set(BlockBegin::parser_loop_header_flag)) {
 386     block->set(BlockBegin::parser_loop_header_flag);
 387 
 388     assert(_loop_map.at(block->block_id()) == 0, "must not be set yet");
 389     assert(0 <= _next_loop_index && _next_loop_index < BitsPerInt, "_next_loop_index is used as a bit-index in integer");
 390     _loop_map.at_put(block->block_id(), 1 << _next_loop_index);
 391     if (_next_loop_index < 31) _next_loop_index++;
 392   } else {
 393     // block already marked as loop header
 394     assert(is_power_of_2((unsigned int)_loop_map.at(block->block_id())), "exactly one bit must be set");
 395   }
 396 }
 397 
 398 int BlockListBuilder::mark_loops(BlockBegin* block, bool in_subroutine) {
 399   int block_id = block->block_id();
 400 
 401   if (_visited.at(block_id)) {
 402     if (_active.at(block_id)) {
 403       // reached block via backward branch
 404       make_loop_header(block);
 405     }
 406     // return cached loop information for this block
 407     return _loop_map.at(block_id);
 408   }
 409 
 410   if (block->is_set(BlockBegin::subroutine_entry_flag)) {
 411     in_subroutine = true;
 412   }
 413 
 414   // set active and visited bits before successors are processed
 415   _visited.set_bit(block_id);
 416   _active.set_bit(block_id);
 417 
 418   intptr_t loop_state = 0;
 419   for (int i = block->number_of_sux() - 1; i >= 0; i--) {
 420     // recursively process all successors
 421     loop_state |= mark_loops(block->sux_at(i), in_subroutine);
 422   }
 423 
 424   // clear active-bit after all successors are processed
 425   _active.clear_bit(block_id);
 426 
 427   // reverse-post-order numbering of all blocks
 428   block->set_depth_first_number(_next_block_number);
 429   _next_block_number--;
 430 
 431   if (loop_state != 0 || in_subroutine ) {
 432     // block is contained at least in one loop, so phi functions are necessary
 433     // phi functions are also necessary for all locals stored in a subroutine
 434     scope()->requires_phi_function().set_union(block->stores_to_locals());
 435   }
 436 
 437   if (block->is_set(BlockBegin::parser_loop_header_flag)) {
 438     int header_loop_state = _loop_map.at(block_id);
 439     assert(is_power_of_2((unsigned)header_loop_state), "exactly one bit must be set");
 440 
 441     // If the highest bit is set (i.e. when integer value is negative), the method
 442     // has 32 or more loops. This bit is never cleared because it is used for multiple loops
 443     if (header_loop_state >= 0) {
 444       clear_bits(loop_state, header_loop_state);
 445     }
 446   }
 447 
 448   // cache and return loop information for this block
 449   _loop_map.at_put(block_id, loop_state);
 450   return loop_state;
 451 }
 452 
 453 
 454 #ifndef PRODUCT
 455 
 456 int compare_depth_first(BlockBegin** a, BlockBegin** b) {
 457   return (*a)->depth_first_number() - (*b)->depth_first_number();
 458 }
 459 
 460 void BlockListBuilder::print() {
 461   tty->print("----- initial block list of BlockListBuilder for method ");
 462   method()->print_short_name();
 463   tty->cr();
 464 
 465   // better readability if blocks are sorted in processing order
 466   _blocks.sort(compare_depth_first);
 467 
 468   for (int i = 0; i < _blocks.length(); i++) {
 469     BlockBegin* cur = _blocks.at(i);
 470     tty->print("%4d: B%-4d bci: %-4d  preds: %-4d ", cur->depth_first_number(), cur->block_id(), cur->bci(), cur->total_preds());
 471 
 472     tty->print(cur->is_set(BlockBegin::std_entry_flag)               ? " std" : "    ");
 473     tty->print(cur->is_set(BlockBegin::osr_entry_flag)               ? " osr" : "    ");
 474     tty->print(cur->is_set(BlockBegin::exception_entry_flag)         ? " ex" : "   ");
 475     tty->print(cur->is_set(BlockBegin::subroutine_entry_flag)        ? " sr" : "   ");
 476     tty->print(cur->is_set(BlockBegin::parser_loop_header_flag)      ? " lh" : "   ");
 477 
 478     if (cur->number_of_sux() > 0) {
 479       tty->print("    sux: ");
 480       for (int j = 0; j < cur->number_of_sux(); j++) {
 481         BlockBegin* sux = cur->sux_at(j);
 482         tty->print("B%d ", sux->block_id());
 483       }
 484     }
 485     tty->cr();
 486   }
 487 }
 488 
 489 #endif
 490 
 491 
 492 // A simple growable array of Values indexed by ciFields
 493 class FieldBuffer: public CompilationResourceObj {
 494  private:
 495   GrowableArray<Value> _values;
 496 
 497  public:
 498   FieldBuffer() {}
 499 
 500   void kill() {
 501     _values.trunc_to(0);
 502   }
 503 
 504   Value at(ciField* field) {
 505     assert(field->holder()->is_loaded(), "must be a loaded field");
 506     int offset = field->offset();
 507     if (offset < _values.length()) {
 508       return _values.at(offset);
 509     } else {
 510       return NULL;
 511     }
 512   }
 513 
 514   void at_put(ciField* field, Value value) {
 515     assert(field->holder()->is_loaded(), "must be a loaded field");
 516     int offset = field->offset();
 517     _values.at_put_grow(offset, value, NULL);
 518   }
 519 
 520 };
 521 
 522 
 523 // MemoryBuffer is fairly simple model of the current state of memory.
 524 // It partitions memory into several pieces.  The first piece is
 525 // generic memory where little is known about the owner of the memory.
 526 // This is conceptually represented by the tuple <O, F, V> which says
 527 // that the field F of object O has value V.  This is flattened so
 528 // that F is represented by the offset of the field and the parallel
 529 // arrays _objects and _values are used for O and V.  Loads of O.F can
 530 // simply use V.  Newly allocated objects are kept in a separate list
 531 // along with a parallel array for each object which represents the
 532 // current value of its fields.  Stores of the default value to fields
 533 // which have never been stored to before are eliminated since they
 534 // are redundant.  Once newly allocated objects are stored into
 535 // another object or they are passed out of the current compile they
 536 // are treated like generic memory.
 537 
 538 class MemoryBuffer: public CompilationResourceObj {
 539  private:
 540   FieldBuffer                 _values;
 541   GrowableArray<Value>        _objects;
 542   GrowableArray<Value>        _newobjects;
 543   GrowableArray<FieldBuffer*> _fields;
 544 
 545  public:
 546   MemoryBuffer() {}
 547 
 548   StoreField* store(StoreField* st) {
 549     if (!EliminateFieldAccess) {
 550       return st;
 551     }
 552 
 553     Value object = st->obj();
 554     Value value = st->value();
 555     ciField* field = st->field();
 556     if (field->holder()->is_loaded()) {
 557       int offset = field->offset();
 558       int index = _newobjects.find(object);
 559       if (index != -1) {
 560         // newly allocated object with no other stores performed on this field
 561         FieldBuffer* buf = _fields.at(index);
 562         if (buf->at(field) == NULL && is_default_value(value)) {
 563 #ifndef PRODUCT
 564           if (PrintIRDuringConstruction && Verbose) {
 565             tty->print_cr("Eliminated store for object %d:", index);
 566             st->print_line();
 567           }
 568 #endif
 569           return NULL;
 570         } else {
 571           buf->at_put(field, value);
 572         }
 573       } else {
 574         _objects.at_put_grow(offset, object, NULL);
 575         _values.at_put(field, value);
 576       }
 577 
 578       store_value(value);
 579     } else {
 580       // if we held onto field names we could alias based on names but
 581       // we don't know what's being stored to so kill it all.
 582       kill();
 583     }
 584     return st;
 585   }
 586 
 587 
 588   // return true if this value correspond to the default value of a field.
 589   bool is_default_value(Value value) {
 590     Constant* con = value->as_Constant();
 591     if (con) {
 592       switch (con->type()->tag()) {
 593         case intTag:    return con->type()->as_IntConstant()->value() == 0;
 594         case longTag:   return con->type()->as_LongConstant()->value() == 0;
 595         case floatTag:  return jint_cast(con->type()->as_FloatConstant()->value()) == 0;
 596         case doubleTag: return jlong_cast(con->type()->as_DoubleConstant()->value()) == jlong_cast(0);
 597         case objectTag: return con->type() == objectNull;
 598         default:  ShouldNotReachHere();
 599       }
 600     }
 601     return false;
 602   }
 603 
 604 
 605   // return either the actual value of a load or the load itself
 606   Value load(LoadField* load) {
 607     if (!EliminateFieldAccess) {
 608       return load;
 609     }
 610 
 611     if (RoundFPResults && UseSSE < 2 && load->type()->is_float_kind()) {
 612       // can't skip load since value might get rounded as a side effect
 613       return load;
 614     }
 615 
 616     ciField* field = load->field();
 617     Value object   = load->obj();
 618     if (field->holder()->is_loaded() && !field->is_volatile()) {
 619       int offset = field->offset();
 620       Value result = NULL;
 621       int index = _newobjects.find(object);
 622       if (index != -1) {
 623         result = _fields.at(index)->at(field);
 624       } else if (_objects.at_grow(offset, NULL) == object) {
 625         result = _values.at(field);
 626       }
 627       if (result != NULL) {
 628 #ifndef PRODUCT
 629         if (PrintIRDuringConstruction && Verbose) {
 630           tty->print_cr("Eliminated load: ");
 631           load->print_line();
 632         }
 633 #endif
 634         assert(result->type()->tag() == load->type()->tag(), "wrong types");
 635         return result;
 636       }
 637     }
 638     return load;
 639   }
 640 
 641   // Record this newly allocated object
 642   void new_instance(NewInstance* object) {
 643     int index = _newobjects.length();
 644     _newobjects.append(object);
 645     if (_fields.at_grow(index, NULL) == NULL) {
 646       _fields.at_put(index, new FieldBuffer());
 647     } else {
 648       _fields.at(index)->kill();
 649     }
 650   }
 651 
 652   // Record this newly allocated object
 653   void new_instance(NewValueTypeInstance* object) {
 654     int index = _newobjects.length();
 655     _newobjects.append(object);
 656     if (_fields.at_grow(index, NULL) == NULL) {
 657       _fields.at_put(index, new FieldBuffer());
 658     } else {
 659       _fields.at(index)->kill();
 660     }
 661   }
 662 
 663   void store_value(Value value) {
 664     int index = _newobjects.find(value);
 665     if (index != -1) {
 666       // stored a newly allocated object into another object.
 667       // Assume we've lost track of it as separate slice of memory.
 668       // We could do better by keeping track of whether individual
 669       // fields could alias each other.
 670       _newobjects.remove_at(index);
 671       // pull out the field info and store it at the end up the list
 672       // of field info list to be reused later.
 673       _fields.append(_fields.at(index));
 674       _fields.remove_at(index);
 675     }
 676   }
 677 
 678   void kill() {
 679     _newobjects.trunc_to(0);
 680     _objects.trunc_to(0);
 681     _values.kill();
 682   }
 683 };
 684 
 685 
 686 // Implementation of GraphBuilder's ScopeData
 687 
 688 GraphBuilder::ScopeData::ScopeData(ScopeData* parent)
 689   : _parent(parent)
 690   , _bci2block(NULL)
 691   , _scope(NULL)
 692   , _has_handler(false)
 693   , _stream(NULL)
 694   , _work_list(NULL)
 695   , _caller_stack_size(-1)
 696   , _continuation(NULL)
 697   , _parsing_jsr(false)
 698   , _jsr_xhandlers(NULL)
 699   , _num_returns(0)
 700   , _cleanup_block(NULL)
 701   , _cleanup_return_prev(NULL)
 702   , _cleanup_state(NULL)
 703   , _ignore_return(false)
 704 {
 705   if (parent != NULL) {
 706     _max_inline_size = (intx) ((float) NestedInliningSizeRatio * (float) parent->max_inline_size() / 100.0f);
 707   } else {
 708     _max_inline_size = MaxInlineSize;
 709   }
 710   if (_max_inline_size < MaxTrivialSize) {
 711     _max_inline_size = MaxTrivialSize;
 712   }
 713 }
 714 
 715 
 716 void GraphBuilder::kill_all() {
 717   if (UseLocalValueNumbering) {
 718     vmap()->kill_all();
 719   }
 720   _memory->kill();
 721 }
 722 
 723 
 724 BlockBegin* GraphBuilder::ScopeData::block_at(int bci) {
 725   if (parsing_jsr()) {
 726     // It is necessary to clone all blocks associated with a
 727     // subroutine, including those for exception handlers in the scope
 728     // of the method containing the jsr (because those exception
 729     // handlers may contain ret instructions in some cases).
 730     BlockBegin* block = bci2block()->at(bci);
 731     if (block != NULL && block == parent()->bci2block()->at(bci)) {
 732       BlockBegin* new_block = new BlockBegin(block->bci());
 733       if (PrintInitialBlockList) {
 734         tty->print_cr("CFG: cloned block %d (bci %d) as block %d for jsr",
 735                       block->block_id(), block->bci(), new_block->block_id());
 736       }
 737       // copy data from cloned blocked
 738       new_block->set_depth_first_number(block->depth_first_number());
 739       if (block->is_set(BlockBegin::parser_loop_header_flag)) new_block->set(BlockBegin::parser_loop_header_flag);
 740       // Preserve certain flags for assertion checking
 741       if (block->is_set(BlockBegin::subroutine_entry_flag)) new_block->set(BlockBegin::subroutine_entry_flag);
 742       if (block->is_set(BlockBegin::exception_entry_flag))  new_block->set(BlockBegin::exception_entry_flag);
 743 
 744       // copy was_visited_flag to allow early detection of bailouts
 745       // if a block that is used in a jsr has already been visited before,
 746       // it is shared between the normal control flow and a subroutine
 747       // BlockBegin::try_merge returns false when the flag is set, this leads
 748       // to a compilation bailout
 749       if (block->is_set(BlockBegin::was_visited_flag))  new_block->set(BlockBegin::was_visited_flag);
 750 
 751       bci2block()->at_put(bci, new_block);
 752       block = new_block;
 753     }
 754     return block;
 755   } else {
 756     return bci2block()->at(bci);
 757   }
 758 }
 759 
 760 
 761 XHandlers* GraphBuilder::ScopeData::xhandlers() const {
 762   if (_jsr_xhandlers == NULL) {
 763     assert(!parsing_jsr(), "");
 764     return scope()->xhandlers();
 765   }
 766   assert(parsing_jsr(), "");
 767   return _jsr_xhandlers;
 768 }
 769 
 770 
 771 void GraphBuilder::ScopeData::set_scope(IRScope* scope) {
 772   _scope = scope;
 773   bool parent_has_handler = false;
 774   if (parent() != NULL) {
 775     parent_has_handler = parent()->has_handler();
 776   }
 777   _has_handler = parent_has_handler || scope->xhandlers()->has_handlers();
 778 }
 779 
 780 
 781 void GraphBuilder::ScopeData::set_inline_cleanup_info(BlockBegin* block,
 782                                                       Instruction* return_prev,
 783                                                       ValueStack* return_state) {
 784   _cleanup_block       = block;
 785   _cleanup_return_prev = return_prev;
 786   _cleanup_state       = return_state;
 787 }
 788 
 789 
 790 void GraphBuilder::ScopeData::add_to_work_list(BlockBegin* block) {
 791   if (_work_list == NULL) {
 792     _work_list = new BlockList();
 793   }
 794 
 795   if (!block->is_set(BlockBegin::is_on_work_list_flag)) {
 796     // Do not start parsing the continuation block while in a
 797     // sub-scope
 798     if (parsing_jsr()) {
 799       if (block == jsr_continuation()) {
 800         return;
 801       }
 802     } else {
 803       if (block == continuation()) {
 804         return;
 805       }
 806     }
 807     block->set(BlockBegin::is_on_work_list_flag);
 808     _work_list->push(block);
 809 
 810     sort_top_into_worklist(_work_list, block);
 811   }
 812 }
 813 
 814 
 815 void GraphBuilder::sort_top_into_worklist(BlockList* worklist, BlockBegin* top) {
 816   assert(worklist->top() == top, "");
 817   // sort block descending into work list
 818   const int dfn = top->depth_first_number();
 819   assert(dfn != -1, "unknown depth first number");
 820   int i = worklist->length()-2;
 821   while (i >= 0) {
 822     BlockBegin* b = worklist->at(i);
 823     if (b->depth_first_number() < dfn) {
 824       worklist->at_put(i+1, b);
 825     } else {
 826       break;
 827     }
 828     i --;
 829   }
 830   if (i >= -1) worklist->at_put(i + 1, top);
 831 }
 832 
 833 
 834 BlockBegin* GraphBuilder::ScopeData::remove_from_work_list() {
 835   if (is_work_list_empty()) {
 836     return NULL;
 837   }
 838   return _work_list->pop();
 839 }
 840 
 841 
 842 bool GraphBuilder::ScopeData::is_work_list_empty() const {
 843   return (_work_list == NULL || _work_list->length() == 0);
 844 }
 845 
 846 
 847 void GraphBuilder::ScopeData::setup_jsr_xhandlers() {
 848   assert(parsing_jsr(), "");
 849   // clone all the exception handlers from the scope
 850   XHandlers* handlers = new XHandlers(scope()->xhandlers());
 851   const int n = handlers->length();
 852   for (int i = 0; i < n; i++) {
 853     // The XHandlers need to be adjusted to dispatch to the cloned
 854     // handler block instead of the default one but the synthetic
 855     // unlocker needs to be handled specially.  The synthetic unlocker
 856     // should be left alone since there can be only one and all code
 857     // should dispatch to the same one.
 858     XHandler* h = handlers->handler_at(i);
 859     assert(h->handler_bci() != SynchronizationEntryBCI, "must be real");
 860     h->set_entry_block(block_at(h->handler_bci()));
 861   }
 862   _jsr_xhandlers = handlers;
 863 }
 864 
 865 
 866 int GraphBuilder::ScopeData::num_returns() {
 867   if (parsing_jsr()) {
 868     return parent()->num_returns();
 869   }
 870   return _num_returns;
 871 }
 872 
 873 
 874 void GraphBuilder::ScopeData::incr_num_returns() {
 875   if (parsing_jsr()) {
 876     parent()->incr_num_returns();
 877   } else {
 878     ++_num_returns;
 879   }
 880 }
 881 
 882 
 883 // Implementation of GraphBuilder
 884 
 885 #define INLINE_BAILOUT(msg)        { inline_bailout(msg); return false; }
 886 
 887 
 888 void GraphBuilder::load_constant() {
 889   ciConstant con = stream()->get_constant();
 890   if (con.basic_type() == T_ILLEGAL) {
 891     // FIXME: an unresolved Dynamic constant can get here,
 892     // and that should not terminate the whole compilation.
 893     BAILOUT("could not resolve a constant");
 894   } else {
 895     ValueType* t = illegalType;
 896     ValueStack* patch_state = NULL;
 897     switch (con.basic_type()) {
 898       case T_BOOLEAN: t = new IntConstant     (con.as_boolean()); break;
 899       case T_BYTE   : t = new IntConstant     (con.as_byte   ()); break;
 900       case T_CHAR   : t = new IntConstant     (con.as_char   ()); break;
 901       case T_SHORT  : t = new IntConstant     (con.as_short  ()); break;
 902       case T_INT    : t = new IntConstant     (con.as_int    ()); break;
 903       case T_LONG   : t = new LongConstant    (con.as_long   ()); break;
 904       case T_FLOAT  : t = new FloatConstant   (con.as_float  ()); break;
 905       case T_DOUBLE : t = new DoubleConstant  (con.as_double ()); break;
 906       case T_ARRAY  : t = new ArrayConstant   (con.as_object ()->as_array   ()); break;
 907       case T_OBJECT :
 908        {
 909         ciObject* obj = con.as_object();
 910         if (!obj->is_loaded()
 911             || (PatchALot && obj->klass() != ciEnv::current()->String_klass())) {
 912           // A Class, MethodType, MethodHandle, or String.
 913           // Unloaded condy nodes show up as T_ILLEGAL, above.
 914           patch_state = copy_state_before();
 915           t = new ObjectConstant(obj);
 916         } else {
 917           // Might be a Class, MethodType, MethodHandle, or Dynamic constant
 918           // result, which might turn out to be an array.
 919           if (obj->is_null_object())
 920             t = objectNull;
 921           else if (obj->is_array())
 922             t = new ArrayConstant(obj->as_array());
 923           else
 924             t = new InstanceConstant(obj->as_instance());
 925         }
 926         break;
 927        }
 928       default       : ShouldNotReachHere();
 929     }
 930     Value x;
 931     if (patch_state != NULL) {
 932       x = new Constant(t, patch_state);
 933     } else {
 934       x = new Constant(t);
 935     }
 936     push(t, append(x));
 937   }
 938 }
 939 
 940 
 941 void GraphBuilder::load_local(ValueType* type, int index) {
 942   Value x = state()->local_at(index);
 943   assert(x != NULL && !x->type()->is_illegal(), "access of illegal local variable");
 944   push(type, x);
 945 }
 946 
 947 
 948 void GraphBuilder::store_local(ValueType* type, int index) {
 949   Value x = pop(type);
 950   store_local(state(), x, index);
 951 }
 952 
 953 
 954 void GraphBuilder::store_local(ValueStack* state, Value x, int index) {
 955   if (parsing_jsr()) {
 956     // We need to do additional tracking of the location of the return
 957     // address for jsrs since we don't handle arbitrary jsr/ret
 958     // constructs. Here we are figuring out in which circumstances we
 959     // need to bail out.
 960     if (x->type()->is_address()) {
 961       scope_data()->set_jsr_return_address_local(index);
 962 
 963       // Also check parent jsrs (if any) at this time to see whether
 964       // they are using this local. We don't handle skipping over a
 965       // ret.
 966       for (ScopeData* cur_scope_data = scope_data()->parent();
 967            cur_scope_data != NULL && cur_scope_data->parsing_jsr() && cur_scope_data->scope() == scope();
 968            cur_scope_data = cur_scope_data->parent()) {
 969         if (cur_scope_data->jsr_return_address_local() == index) {
 970           BAILOUT("subroutine overwrites return address from previous subroutine");
 971         }
 972       }
 973     } else if (index == scope_data()->jsr_return_address_local()) {
 974       scope_data()->set_jsr_return_address_local(-1);
 975     }
 976   }
 977 
 978   state->store_local(index, round_fp(x));
 979 }
 980 
 981 
 982 void GraphBuilder::load_indexed(BasicType type) {
 983   // In case of in block code motion in range check elimination
 984   ValueStack* state_before = copy_state_indexed_access();
 985   compilation()->set_has_access_indexed(true);
 986   Value index = ipop();
 987   Value array = apop();
 988   Value length = NULL;
 989   if (CSEArrayLength ||
 990       (array->as_AccessField() && array->as_AccessField()->field()->is_constant()) ||
 991       (array->as_NewArray() && array->as_NewArray()->length() && array->as_NewArray()->length()->type()->is_constant())) {
 992     length = append(new ArrayLength(array, state_before));
 993   }
 994 
 995   if (array->is_flattened_array()) {
 996     ciType* array_type = array->declared_type();
 997     ciValueKlass* elem_klass = array_type->as_value_array_klass()->element_klass()->as_value_klass();
 998     NewValueTypeInstance* new_instance = new NewValueTypeInstance(elem_klass, state_before, false);
 999     _memory->new_instance(new_instance);
1000     apush(append_split(new_instance));
1001     LoadIndexed* load_indexed = new LoadIndexed(array, index, length, type, state_before);
1002     load_indexed->set_vt(new_instance);
1003     append(load_indexed);
1004   } else {
1005     push(as_ValueType(type), append(new LoadIndexed(array, index, length, type, state_before)));
1006   }
1007 }
1008 
1009 
1010 void GraphBuilder::store_indexed(BasicType type) {
1011   // In case of in block code motion in range check elimination
1012   ValueStack* state_before = copy_state_indexed_access();
1013   compilation()->set_has_access_indexed(true);
1014   Value value = pop(as_ValueType(type));
1015   Value index = ipop();
1016   Value array = apop();
1017   Value length = NULL;
1018   if (CSEArrayLength ||
1019       (array->as_AccessField() && array->as_AccessField()->field()->is_constant()) ||
1020       (array->as_NewArray() && array->as_NewArray()->length() && array->as_NewArray()->length()->type()->is_constant())) {
1021     length = append(new ArrayLength(array, state_before));
1022   }
1023   ciType* array_type = array->declared_type();
1024   bool check_boolean = false;
1025   if (array_type != NULL) {
1026     if (array_type->is_loaded() &&
1027       array_type->as_array_klass()->element_type()->basic_type() == T_BOOLEAN) {
1028       assert(type == T_BYTE, "boolean store uses bastore");
1029       Value mask = append(new Constant(new IntConstant(1)));
1030       value = append(new LogicOp(Bytecodes::_iand, value, mask));
1031     }
1032   } else if (type == T_BYTE) {
1033     check_boolean = true;
1034   }
1035   StoreIndexed* result = new StoreIndexed(array, index, length, type, value, state_before, check_boolean);
1036   append(result);
1037   _memory->store_value(value);
1038 
1039   if (type == T_OBJECT && is_profiling()) {
1040     // Note that we'd collect profile data in this method if we wanted it.
1041     compilation()->set_would_profile(true);
1042 
1043     if (profile_checkcasts()) {
1044       result->set_profiled_method(method());
1045       result->set_profiled_bci(bci());
1046       result->set_should_profile(true);
1047     }
1048   }
1049 }
1050 
1051 
1052 void GraphBuilder::stack_op(Bytecodes::Code code) {
1053   switch (code) {
1054     case Bytecodes::_pop:
1055       { state()->raw_pop();
1056       }
1057       break;
1058     case Bytecodes::_pop2:
1059       { state()->raw_pop();
1060         state()->raw_pop();
1061       }
1062       break;
1063     case Bytecodes::_dup:
1064       { Value w = state()->raw_pop();
1065         state()->raw_push(w);
1066         state()->raw_push(w);
1067       }
1068       break;
1069     case Bytecodes::_dup_x1:
1070       { Value w1 = state()->raw_pop();
1071         Value w2 = state()->raw_pop();
1072         state()->raw_push(w1);
1073         state()->raw_push(w2);
1074         state()->raw_push(w1);
1075       }
1076       break;
1077     case Bytecodes::_dup_x2:
1078       { Value w1 = state()->raw_pop();
1079         Value w2 = state()->raw_pop();
1080         Value w3 = state()->raw_pop();
1081         state()->raw_push(w1);
1082         state()->raw_push(w3);
1083         state()->raw_push(w2);
1084         state()->raw_push(w1);
1085       }
1086       break;
1087     case Bytecodes::_dup2:
1088       { Value w1 = state()->raw_pop();
1089         Value w2 = state()->raw_pop();
1090         state()->raw_push(w2);
1091         state()->raw_push(w1);
1092         state()->raw_push(w2);
1093         state()->raw_push(w1);
1094       }
1095       break;
1096     case Bytecodes::_dup2_x1:
1097       { Value w1 = state()->raw_pop();
1098         Value w2 = state()->raw_pop();
1099         Value w3 = state()->raw_pop();
1100         state()->raw_push(w2);
1101         state()->raw_push(w1);
1102         state()->raw_push(w3);
1103         state()->raw_push(w2);
1104         state()->raw_push(w1);
1105       }
1106       break;
1107     case Bytecodes::_dup2_x2:
1108       { Value w1 = state()->raw_pop();
1109         Value w2 = state()->raw_pop();
1110         Value w3 = state()->raw_pop();
1111         Value w4 = state()->raw_pop();
1112         state()->raw_push(w2);
1113         state()->raw_push(w1);
1114         state()->raw_push(w4);
1115         state()->raw_push(w3);
1116         state()->raw_push(w2);
1117         state()->raw_push(w1);
1118       }
1119       break;
1120     case Bytecodes::_swap:
1121       { Value w1 = state()->raw_pop();
1122         Value w2 = state()->raw_pop();
1123         state()->raw_push(w1);
1124         state()->raw_push(w2);
1125       }
1126       break;
1127     default:
1128       ShouldNotReachHere();
1129       break;
1130   }
1131 }
1132 
1133 
1134 void GraphBuilder::arithmetic_op(ValueType* type, Bytecodes::Code code, ValueStack* state_before) {
1135   Value y = pop(type);
1136   Value x = pop(type);
1137   // NOTE: strictfp can be queried from current method since we don't
1138   // inline methods with differing strictfp bits
1139   Value res = new ArithmeticOp(code, x, y, method()->is_strict(), state_before);
1140   // Note: currently single-precision floating-point rounding on Intel is handled at the LIRGenerator level
1141   res = append(res);
1142   if (method()->is_strict()) {
1143     res = round_fp(res);
1144   }
1145   push(type, res);
1146 }
1147 
1148 
1149 void GraphBuilder::negate_op(ValueType* type) {
1150   push(type, append(new NegateOp(pop(type))));
1151 }
1152 
1153 
1154 void GraphBuilder::shift_op(ValueType* type, Bytecodes::Code code) {
1155   Value s = ipop();
1156   Value x = pop(type);
1157   // try to simplify
1158   // Note: This code should go into the canonicalizer as soon as it can
1159   //       can handle canonicalized forms that contain more than one node.
1160   if (CanonicalizeNodes && code == Bytecodes::_iushr) {
1161     // pattern: x >>> s
1162     IntConstant* s1 = s->type()->as_IntConstant();
1163     if (s1 != NULL) {
1164       // pattern: x >>> s1, with s1 constant
1165       ShiftOp* l = x->as_ShiftOp();
1166       if (l != NULL && l->op() == Bytecodes::_ishl) {
1167         // pattern: (a << b) >>> s1
1168         IntConstant* s0 = l->y()->type()->as_IntConstant();
1169         if (s0 != NULL) {
1170           // pattern: (a << s0) >>> s1
1171           const int s0c = s0->value() & 0x1F; // only the low 5 bits are significant for shifts
1172           const int s1c = s1->value() & 0x1F; // only the low 5 bits are significant for shifts
1173           if (s0c == s1c) {
1174             if (s0c == 0) {
1175               // pattern: (a << 0) >>> 0 => simplify to: a
1176               ipush(l->x());
1177             } else {
1178               // pattern: (a << s0c) >>> s0c => simplify to: a & m, with m constant
1179               assert(0 < s0c && s0c < BitsPerInt, "adjust code below to handle corner cases");
1180               const int m = (1 << (BitsPerInt - s0c)) - 1;
1181               Value s = append(new Constant(new IntConstant(m)));
1182               ipush(append(new LogicOp(Bytecodes::_iand, l->x(), s)));
1183             }
1184             return;
1185           }
1186         }
1187       }
1188     }
1189   }
1190   // could not simplify
1191   push(type, append(new ShiftOp(code, x, s)));
1192 }
1193 
1194 
1195 void GraphBuilder::logic_op(ValueType* type, Bytecodes::Code code) {
1196   Value y = pop(type);
1197   Value x = pop(type);
1198   push(type, append(new LogicOp(code, x, y)));
1199 }
1200 
1201 
1202 void GraphBuilder::compare_op(ValueType* type, Bytecodes::Code code) {
1203   ValueStack* state_before = copy_state_before();
1204   Value y = pop(type);
1205   Value x = pop(type);
1206   ipush(append(new CompareOp(code, x, y, state_before)));
1207 }
1208 
1209 
1210 void GraphBuilder::convert(Bytecodes::Code op, BasicType from, BasicType to) {
1211   push(as_ValueType(to), append(new Convert(op, pop(as_ValueType(from)), as_ValueType(to))));
1212 }
1213 
1214 
1215 void GraphBuilder::increment() {
1216   int index = stream()->get_index();
1217   int delta = stream()->is_wide() ? (signed short)Bytes::get_Java_u2(stream()->cur_bcp() + 4) : (signed char)(stream()->cur_bcp()[2]);
1218   load_local(intType, index);
1219   ipush(append(new Constant(new IntConstant(delta))));
1220   arithmetic_op(intType, Bytecodes::_iadd);
1221   store_local(intType, index);
1222 }
1223 
1224 
1225 void GraphBuilder::_goto(int from_bci, int to_bci) {
1226   Goto *x = new Goto(block_at(to_bci), to_bci <= from_bci);
1227   if (is_profiling()) {
1228     compilation()->set_would_profile(true);
1229     x->set_profiled_bci(bci());
1230     if (profile_branches()) {
1231       x->set_profiled_method(method());
1232       x->set_should_profile(true);
1233     }
1234   }
1235   append(x);
1236 }
1237 
1238 
1239 void GraphBuilder::if_node(Value x, If::Condition cond, Value y, ValueStack* state_before) {
1240   BlockBegin* tsux = block_at(stream()->get_dest());
1241   BlockBegin* fsux = block_at(stream()->next_bci());
1242   bool is_bb = tsux->bci() < stream()->cur_bci() || fsux->bci() < stream()->cur_bci();
1243   // In case of loop invariant code motion or predicate insertion
1244   // before the body of a loop the state is needed
1245   Instruction *i = append(new If(x, cond, false, y, tsux, fsux, (is_bb || compilation()->is_optimistic()) ? state_before : NULL, is_bb));
1246 
1247   assert(i->as_Goto() == NULL ||
1248          (i->as_Goto()->sux_at(0) == tsux  && i->as_Goto()->is_safepoint() == tsux->bci() < stream()->cur_bci()) ||
1249          (i->as_Goto()->sux_at(0) == fsux  && i->as_Goto()->is_safepoint() == fsux->bci() < stream()->cur_bci()),
1250          "safepoint state of Goto returned by canonicalizer incorrect");
1251 
1252   if (is_profiling()) {
1253     If* if_node = i->as_If();
1254     if (if_node != NULL) {
1255       // Note that we'd collect profile data in this method if we wanted it.
1256       compilation()->set_would_profile(true);
1257       // At level 2 we need the proper bci to count backedges
1258       if_node->set_profiled_bci(bci());
1259       if (profile_branches()) {
1260         // Successors can be rotated by the canonicalizer, check for this case.
1261         if_node->set_profiled_method(method());
1262         if_node->set_should_profile(true);
1263         if (if_node->tsux() == fsux) {
1264           if_node->set_swapped(true);
1265         }
1266       }
1267       return;
1268     }
1269 
1270     // Check if this If was reduced to Goto.
1271     Goto *goto_node = i->as_Goto();
1272     if (goto_node != NULL) {
1273       compilation()->set_would_profile(true);
1274       goto_node->set_profiled_bci(bci());
1275       if (profile_branches()) {
1276         goto_node->set_profiled_method(method());
1277         goto_node->set_should_profile(true);
1278         // Find out which successor is used.
1279         if (goto_node->default_sux() == tsux) {
1280           goto_node->set_direction(Goto::taken);
1281         } else if (goto_node->default_sux() == fsux) {
1282           goto_node->set_direction(Goto::not_taken);
1283         } else {
1284           ShouldNotReachHere();
1285         }
1286       }
1287       return;
1288     }
1289   }
1290 }
1291 
1292 
1293 void GraphBuilder::if_zero(ValueType* type, If::Condition cond) {
1294   Value y = append(new Constant(intZero));
1295   ValueStack* state_before = copy_state_before();
1296   Value x = ipop();
1297   if_node(x, cond, y, state_before);
1298 }
1299 
1300 
1301 void GraphBuilder::if_null(ValueType* type, If::Condition cond) {
1302   Value y = append(new Constant(objectNull));
1303   ValueStack* state_before = copy_state_before();
1304   Value x = apop();
1305   if_node(x, cond, y, state_before);
1306 }
1307 
1308 
1309 void GraphBuilder::if_same(ValueType* type, If::Condition cond) {
1310   ValueStack* state_before = copy_state_before();
1311   Value y = pop(type);
1312   Value x = pop(type);
1313   if_node(x, cond, y, state_before);
1314 }
1315 
1316 
1317 void GraphBuilder::jsr(int dest) {
1318   // We only handle well-formed jsrs (those which are "block-structured").
1319   // If the bytecodes are strange (jumping out of a jsr block) then we
1320   // might end up trying to re-parse a block containing a jsr which
1321   // has already been activated. Watch for this case and bail out.
1322   for (ScopeData* cur_scope_data = scope_data();
1323        cur_scope_data != NULL && cur_scope_data->parsing_jsr() && cur_scope_data->scope() == scope();
1324        cur_scope_data = cur_scope_data->parent()) {
1325     if (cur_scope_data->jsr_entry_bci() == dest) {
1326       BAILOUT("too-complicated jsr/ret structure");
1327     }
1328   }
1329 
1330   push(addressType, append(new Constant(new AddressConstant(next_bci()))));
1331   if (!try_inline_jsr(dest)) {
1332     return; // bailed out while parsing and inlining subroutine
1333   }
1334 }
1335 
1336 
1337 void GraphBuilder::ret(int local_index) {
1338   if (!parsing_jsr()) BAILOUT("ret encountered while not parsing subroutine");
1339 
1340   if (local_index != scope_data()->jsr_return_address_local()) {
1341     BAILOUT("can not handle complicated jsr/ret constructs");
1342   }
1343 
1344   // Rets simply become (NON-SAFEPOINT) gotos to the jsr continuation
1345   append(new Goto(scope_data()->jsr_continuation(), false));
1346 }
1347 
1348 
1349 void GraphBuilder::table_switch() {
1350   Bytecode_tableswitch sw(stream());
1351   const int l = sw.length();
1352   if (CanonicalizeNodes && l == 1 && compilation()->env()->comp_level() != CompLevel_full_profile) {
1353     // total of 2 successors => use If instead of switch
1354     // Note: This code should go into the canonicalizer as soon as it can
1355     //       can handle canonicalized forms that contain more than one node.
1356     Value key = append(new Constant(new IntConstant(sw.low_key())));
1357     BlockBegin* tsux = block_at(bci() + sw.dest_offset_at(0));
1358     BlockBegin* fsux = block_at(bci() + sw.default_offset());
1359     bool is_bb = tsux->bci() < bci() || fsux->bci() < bci();
1360     // In case of loop invariant code motion or predicate insertion
1361     // before the body of a loop the state is needed
1362     ValueStack* state_before = copy_state_if_bb(is_bb);
1363     append(new If(ipop(), If::eql, true, key, tsux, fsux, state_before, is_bb));
1364   } else {
1365     // collect successors
1366     BlockList* sux = new BlockList(l + 1, NULL);
1367     int i;
1368     bool has_bb = false;
1369     for (i = 0; i < l; i++) {
1370       sux->at_put(i, block_at(bci() + sw.dest_offset_at(i)));
1371       if (sw.dest_offset_at(i) < 0) has_bb = true;
1372     }
1373     // add default successor
1374     if (sw.default_offset() < 0) has_bb = true;
1375     sux->at_put(i, block_at(bci() + sw.default_offset()));
1376     // In case of loop invariant code motion or predicate insertion
1377     // before the body of a loop the state is needed
1378     ValueStack* state_before = copy_state_if_bb(has_bb);
1379     Instruction* res = append(new TableSwitch(ipop(), sux, sw.low_key(), state_before, has_bb));
1380 #ifdef ASSERT
1381     if (res->as_Goto()) {
1382       for (i = 0; i < l; i++) {
1383         if (sux->at(i) == res->as_Goto()->sux_at(0)) {
1384           assert(res->as_Goto()->is_safepoint() == sw.dest_offset_at(i) < 0, "safepoint state of Goto returned by canonicalizer incorrect");
1385         }
1386       }
1387     }
1388 #endif
1389   }
1390 }
1391 
1392 
1393 void GraphBuilder::lookup_switch() {
1394   Bytecode_lookupswitch sw(stream());
1395   const int l = sw.number_of_pairs();
1396   if (CanonicalizeNodes && l == 1 && compilation()->env()->comp_level() != CompLevel_full_profile) {
1397     // total of 2 successors => use If instead of switch
1398     // Note: This code should go into the canonicalizer as soon as it can
1399     //       can handle canonicalized forms that contain more than one node.
1400     // simplify to If
1401     LookupswitchPair pair = sw.pair_at(0);
1402     Value key = append(new Constant(new IntConstant(pair.match())));
1403     BlockBegin* tsux = block_at(bci() + pair.offset());
1404     BlockBegin* fsux = block_at(bci() + sw.default_offset());
1405     bool is_bb = tsux->bci() < bci() || fsux->bci() < bci();
1406     // In case of loop invariant code motion or predicate insertion
1407     // before the body of a loop the state is needed
1408     ValueStack* state_before = copy_state_if_bb(is_bb);;
1409     append(new If(ipop(), If::eql, true, key, tsux, fsux, state_before, is_bb));
1410   } else {
1411     // collect successors & keys
1412     BlockList* sux = new BlockList(l + 1, NULL);
1413     intArray* keys = new intArray(l, l, 0);
1414     int i;
1415     bool has_bb = false;
1416     for (i = 0; i < l; i++) {
1417       LookupswitchPair pair = sw.pair_at(i);
1418       if (pair.offset() < 0) has_bb = true;
1419       sux->at_put(i, block_at(bci() + pair.offset()));
1420       keys->at_put(i, pair.match());
1421     }
1422     // add default successor
1423     if (sw.default_offset() < 0) has_bb = true;
1424     sux->at_put(i, block_at(bci() + sw.default_offset()));
1425     // In case of loop invariant code motion or predicate insertion
1426     // before the body of a loop the state is needed
1427     ValueStack* state_before = copy_state_if_bb(has_bb);
1428     Instruction* res = append(new LookupSwitch(ipop(), sux, keys, state_before, has_bb));
1429 #ifdef ASSERT
1430     if (res->as_Goto()) {
1431       for (i = 0; i < l; i++) {
1432         if (sux->at(i) == res->as_Goto()->sux_at(0)) {
1433           assert(res->as_Goto()->is_safepoint() == sw.pair_at(i).offset() < 0, "safepoint state of Goto returned by canonicalizer incorrect");
1434         }
1435       }
1436     }
1437 #endif
1438   }
1439 }
1440 
1441 void GraphBuilder::call_register_finalizer() {
1442   // If the receiver requires finalization then emit code to perform
1443   // the registration on return.
1444 
1445   // Gather some type information about the receiver
1446   Value receiver = state()->local_at(0);
1447   assert(receiver != NULL, "must have a receiver");
1448   ciType* declared_type = receiver->declared_type();
1449   ciType* exact_type = receiver->exact_type();
1450   if (exact_type == NULL &&
1451       receiver->as_Local() &&
1452       receiver->as_Local()->java_index() == 0) {
1453     ciInstanceKlass* ik = compilation()->method()->holder();
1454     if (ik->is_final()) {
1455       exact_type = ik;
1456     } else if (UseCHA && !(ik->has_subklass() || ik->is_interface())) {
1457       // test class is leaf class
1458       compilation()->dependency_recorder()->assert_leaf_type(ik);
1459       exact_type = ik;
1460     } else {
1461       declared_type = ik;
1462     }
1463   }
1464 
1465   // see if we know statically that registration isn't required
1466   bool needs_check = true;
1467   if (exact_type != NULL) {
1468     needs_check = exact_type->as_instance_klass()->has_finalizer();
1469   } else if (declared_type != NULL) {
1470     ciInstanceKlass* ik = declared_type->as_instance_klass();
1471     if (!Dependencies::has_finalizable_subclass(ik)) {
1472       compilation()->dependency_recorder()->assert_has_no_finalizable_subclasses(ik);
1473       needs_check = false;
1474     }
1475   }
1476 
1477   if (needs_check) {
1478     // Not a trivial method because C2 can do better with inlined check.
1479     compilation()->set_would_profile(true);
1480 
1481     // Perform the registration of finalizable objects.
1482     ValueStack* state_before = copy_state_for_exception();
1483     load_local(objectType, 0);
1484     append_split(new Intrinsic(voidType, vmIntrinsics::_Object_init,
1485                                state()->pop_arguments(1),
1486                                true, state_before, true));
1487   }
1488 }
1489 
1490 
1491 void GraphBuilder::method_return(Value x, bool ignore_return) {
1492   if (RegisterFinalizersAtInit &&
1493       method()->intrinsic_id() == vmIntrinsics::_Object_init) {
1494     call_register_finalizer();
1495   }
1496 
1497   bool need_mem_bar = false;
1498   if (method()->name() == ciSymbol::object_initializer_name() &&
1499       (scope()->wrote_final() || (AlwaysSafeConstructors && scope()->wrote_fields())
1500                               || (support_IRIW_for_not_multiple_copy_atomic_cpu && scope()->wrote_volatile())
1501      )){
1502     need_mem_bar = true;
1503   }
1504 
1505   BasicType bt = method()->return_type()->basic_type();
1506   switch (bt) {
1507     case T_BYTE:
1508     {
1509       Value shift = append(new Constant(new IntConstant(24)));
1510       x = append(new ShiftOp(Bytecodes::_ishl, x, shift));
1511       x = append(new ShiftOp(Bytecodes::_ishr, x, shift));
1512       break;
1513     }
1514     case T_SHORT:
1515     {
1516       Value shift = append(new Constant(new IntConstant(16)));
1517       x = append(new ShiftOp(Bytecodes::_ishl, x, shift));
1518       x = append(new ShiftOp(Bytecodes::_ishr, x, shift));
1519       break;
1520     }
1521     case T_CHAR:
1522     {
1523       Value mask = append(new Constant(new IntConstant(0xFFFF)));
1524       x = append(new LogicOp(Bytecodes::_iand, x, mask));
1525       break;
1526     }
1527     case T_BOOLEAN:
1528     {
1529       Value mask = append(new Constant(new IntConstant(1)));
1530       x = append(new LogicOp(Bytecodes::_iand, x, mask));
1531       break;
1532     }
1533     default:
1534       break;
1535   }
1536 
1537   // Check to see whether we are inlining. If so, Return
1538   // instructions become Gotos to the continuation point.
1539   if (continuation() != NULL) {
1540 
1541     int invoke_bci = state()->caller_state()->bci();
1542 
1543     if (x != NULL  && !ignore_return) {
1544       ciMethod* caller = state()->scope()->caller()->method();
1545       Bytecodes::Code invoke_raw_bc = caller->raw_code_at_bci(invoke_bci);
1546       if (invoke_raw_bc == Bytecodes::_invokehandle || invoke_raw_bc == Bytecodes::_invokedynamic) {
1547         ciType* declared_ret_type = caller->get_declared_signature_at_bci(invoke_bci)->return_type();
1548         if (declared_ret_type->is_klass() && x->exact_type() == NULL &&
1549             x->declared_type() != declared_ret_type && declared_ret_type != compilation()->env()->Object_klass()) {
1550           x = append(new TypeCast(declared_ret_type->as_klass(), x, copy_state_before()));
1551         }
1552       }
1553     }
1554 
1555     assert(!method()->is_synchronized() || InlineSynchronizedMethods, "can not inline synchronized methods yet");
1556 
1557     if (compilation()->env()->dtrace_method_probes()) {
1558       // Report exit from inline methods
1559       Values* args = new Values(1);
1560       args->push(append(new Constant(new MethodConstant(method()))));
1561       append(new RuntimeCall(voidType, "dtrace_method_exit", CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_method_exit), args));
1562     }
1563 
1564     // If the inlined method is synchronized, the monitor must be
1565     // released before we jump to the continuation block.
1566     if (method()->is_synchronized()) {
1567       assert(state()->locks_size() == 1, "receiver must be locked here");
1568       monitorexit(state()->lock_at(0), SynchronizationEntryBCI);
1569     }
1570 
1571     if (need_mem_bar) {
1572       append(new MemBar(lir_membar_storestore));
1573     }
1574 
1575     // State at end of inlined method is the state of the caller
1576     // without the method parameters on stack, including the
1577     // return value, if any, of the inlined method on operand stack.
1578     set_state(state()->caller_state()->copy_for_parsing());
1579     if (x != NULL) {
1580       if (!ignore_return) {
1581         state()->push(x->type(), x);
1582       }
1583       if (profile_return() && x->type()->is_object_kind()) {
1584         ciMethod* caller = state()->scope()->method();
1585         profile_return_type(x, method(), caller, invoke_bci);
1586       }
1587     }
1588     Goto* goto_callee = new Goto(continuation(), false);
1589 
1590     // See whether this is the first return; if so, store off some
1591     // of the state for later examination
1592     if (num_returns() == 0) {
1593       set_inline_cleanup_info();
1594     }
1595 
1596     // The current bci() is in the wrong scope, so use the bci() of
1597     // the continuation point.
1598     append_with_bci(goto_callee, scope_data()->continuation()->bci());
1599     incr_num_returns();
1600     return;
1601   }
1602 
1603   state()->truncate_stack(0);
1604   if (method()->is_synchronized()) {
1605     // perform the unlocking before exiting the method
1606     Value receiver;
1607     if (!method()->is_static()) {
1608       receiver = _initial_state->local_at(0);
1609     } else {
1610       receiver = append(new Constant(new ClassConstant(method()->holder())));
1611     }
1612     append_split(new MonitorExit(receiver, state()->unlock()));
1613   }
1614 
1615   if (need_mem_bar) {
1616       append(new MemBar(lir_membar_storestore));
1617   }
1618 
1619   assert(!ignore_return, "Ignoring return value works only for inlining");
1620   append(new Return(x));
1621 }
1622 
1623 Value GraphBuilder::make_constant(ciConstant field_value, ciField* field) {
1624   if (!field_value.is_valid())  return NULL;
1625 
1626   BasicType field_type = field_value.basic_type();
1627   ValueType* value = as_ValueType(field_value);
1628 
1629   // Attach dimension info to stable arrays.
1630   if (FoldStableValues &&
1631       field->is_stable() && field_type == T_ARRAY && !field_value.is_null_or_zero()) {
1632     ciArray* array = field_value.as_object()->as_array();
1633     jint dimension = field->type()->as_array_klass()->dimension();
1634     value = new StableArrayConstant(array, dimension);
1635   }
1636 
1637   switch (field_type) {
1638     case T_ARRAY:
1639     case T_OBJECT:
1640       if (field_value.as_object()->should_be_constant()) {
1641         return new Constant(value);
1642       }
1643       return NULL; // Not a constant.
1644     default:
1645       return new Constant(value);
1646   }
1647 }
1648 













1649 void GraphBuilder::access_field(Bytecodes::Code code) {
1650   bool will_link;
1651   ciField* field = stream()->get_field(will_link);
1652   ciInstanceKlass* holder = field->holder();
1653   BasicType field_type = field->type()->basic_type();
1654   ValueType* type = as_ValueType(field_type);
1655   // call will_link again to determine if the field is valid.
1656   const bool needs_patching = !holder->is_loaded() ||
1657                               !field->will_link(method(), code) ||
1658                               PatchALot;
1659 
1660   ValueStack* state_before = NULL;
1661   if (!holder->is_initialized() || needs_patching) {
1662     // save state before instruction for debug info when
1663     // deoptimization happens during patching
1664     state_before = copy_state_before();
1665   }
1666 
1667   Value obj = NULL;
1668   if (code == Bytecodes::_getstatic || code == Bytecodes::_putstatic) {
1669     if (state_before != NULL) {
1670       // build a patching constant
1671       obj = new Constant(new InstanceConstant(holder->java_mirror()), state_before);
1672     } else {
1673       obj = new Constant(new InstanceConstant(holder->java_mirror()));
1674     }
1675   }
1676 
1677   if (field->is_final() && (code == Bytecodes::_putfield)) {
1678     scope()->set_wrote_final();
1679   }
1680 
1681   if (code == Bytecodes::_putfield) {
1682     scope()->set_wrote_fields();
1683     if (field->is_volatile()) {
1684       scope()->set_wrote_volatile();
1685     }
1686   }
1687 
1688   const int offset = !needs_patching ? field->offset() : -1;
1689   switch (code) {
1690     case Bytecodes::_getstatic: {
1691       // check for compile-time constants, i.e., initialized static final fields
1692       Value constant = NULL;
1693       if (field->is_static_constant() && !PatchALot) {
1694         ciConstant field_value = field->constant_value();
1695         assert(!field->is_stable() || !field_value.is_null_or_zero(),
1696                "stable static w/ default value shouldn't be a constant");
1697         constant = make_constant(field_value, field);
1698       }
1699       if (constant != NULL) {
1700         push(type, append(constant));
1701       } else {
1702         if (state_before == NULL) {
1703           state_before = copy_state_for_exception();
1704         }
1705         push(type, append(new LoadField(append(obj), offset, field, true,
1706                                         state_before, needs_patching)));
1707       }
1708       break;
1709     }
1710     case Bytecodes::_putstatic: {
1711       Value val = pop(type);
1712       if (state_before == NULL) {
1713         state_before = copy_state_for_exception();
1714       }
1715       if (field->type()->basic_type() == T_BOOLEAN) {
1716         Value mask = append(new Constant(new IntConstant(1)));
1717         val = append(new LogicOp(Bytecodes::_iand, val, mask));
1718       }
1719       append(new StoreField(append(obj), offset, field, val, true, state_before, needs_patching));
1720       break;
1721     }
1722     case Bytecodes::_getfield: {
1723       // Check for compile-time constants, i.e., trusted final non-static fields.
1724       Value constant = NULL;
1725       obj = apop();
1726       ObjectType* obj_type = obj->type()->as_ObjectType();
1727       if (field->is_constant() && !field->is_flattened() && obj_type->is_constant() && !PatchALot) {
1728         ciObject* const_oop = obj_type->constant_value();
1729         if (!const_oop->is_null_object() && const_oop->is_loaded()) {
1730           ciConstant field_value = field->constant_value_of(const_oop);
1731           if (field_value.is_valid()) {
1732             constant = make_constant(field_value, field);
1733             // For CallSite objects add a dependency for invalidation of the optimization.
1734             if (field->is_call_site_target()) {
1735               ciCallSite* call_site = const_oop->as_call_site();
1736               if (!call_site->is_constant_call_site()) {
1737                 ciMethodHandle* target = field_value.as_object()->as_method_handle();
1738                 dependency_recorder()->assert_call_site_target_value(call_site, target);
1739               }
1740             }
1741           }
1742         }
1743       }
1744       if (constant != NULL) {
1745         push(type, append(constant));
1746       } else {
1747         if (state_before == NULL) {
1748           state_before = copy_state_for_exception();
1749         }
1750         // Pb with test below, is_flattened() can return true for fields that are not value types
1751         // (initialization issue of ciField?)
1752         if (!(field->type()->is_valuetype() && field->is_flattened())) {
1753           LoadField* load = new LoadField(obj, offset, field, false, state_before, needs_patching);
1754           Value replacement = !needs_patching ? _memory->load(load) : load;
1755           if (replacement != load) {
1756             assert(replacement->is_linked() || !replacement->can_be_linked(), "should already by linked");
1757             push(type, replacement);
1758           } else {
1759             push(type, append(load));
1760           }
1761         } else { // flattened field, not optimized solution: re-instantiate the flattened value

1762           ciValueKlass* value_klass = field->type()->as_value_klass();
1763           int flattening_offset = field->offset() - value_klass->first_field_offset();
1764           assert(field->type()->is_valuetype(), "Sanity check");
1765           scope()->set_wrote_final();
1766           scope()->set_wrote_fields();
1767           NewValueTypeInstance* new_instance = new NewValueTypeInstance(value_klass, state_before, false);
1768           _memory->new_instance(new_instance);
1769           apush(append_split(new_instance));
1770           for (int i = 0; i < holder->nof_nonstatic_fields(); i++) {
1771             ciField* inner_field = holder->nonstatic_field_at(i);
1772             int off = inner_field->offset();
1773             LoadField* load = new LoadField(obj, off + flattening_offset, inner_field, false, state_before, needs_patching);
1774             Value replacement = append(load);
1775             StoreField* store = new StoreField(new_instance, off, inner_field, replacement, false, state_before, needs_patching);
1776             append(store);
1777           }
1778         }
1779       }
1780       break;
1781     }
1782     case Bytecodes::_putfield: {
1783       Value val = pop(type);
1784       obj = apop();
1785       if (state_before == NULL) {
1786         state_before = copy_state_for_exception();
1787       }
1788       if (field->type()->basic_type() == T_BOOLEAN) {
1789         Value mask = append(new Constant(new IntConstant(1)));
1790         val = append(new LogicOp(Bytecodes::_iand, val, mask));
1791       }
1792       // Pb with test below, is_flattened() can return true for fields that are not value types
1793       // (initialization issue of ciField?) <---- FIXME
1794       if (!(field->type()->is_valuetype() && field->is_flattened())) {
1795         StoreField* store = new StoreField(obj, offset, field, val, false, state_before, needs_patching);
1796         if (!needs_patching) store = _memory->store(store);
1797         if (store != NULL) {
1798           append(store);
1799         }
1800       } else {

1801         ciValueKlass* value_klass = field->type()->as_value_klass();
1802         int flattening_offset = field->offset() - value_klass->first_field_offset();
1803         for (int i = 0; i < holder->nof_nonstatic_fields(); i++) {
1804           ciField* inner_field = holder->nonstatic_field_at(i);
1805           int off = inner_field->offset();
1806           LoadField* load = new LoadField(val, off, inner_field, false, state_before, needs_patching);
1807           Value replacement = append(load);
1808           StoreField* store = new StoreField(obj, off + flattening_offset, inner_field, replacement, false, state_before, needs_patching);
1809           append(store);
1810         }
1811       }
1812       break;
1813     }
1814     default:
1815       ShouldNotReachHere();
1816       break;
1817   }
1818 }
1819 
1820 // Baseline version of withfield, allocate every time
1821 void GraphBuilder::withfield(int field_index)
1822 {
1823   bool will_link;
1824   ciField* field_modify = stream()->get_field(will_link);
1825   ciInstanceKlass* holder = field_modify->holder();
1826   assert(holder->is_valuetype(), "must be a value klass");
1827   BasicType field_type = field_modify->type()->basic_type();
1828   ValueType* type = as_ValueType(field_type);
1829 
1830   // call will_link again to determine if the field is valid.
1831   const bool needs_patching = !holder->is_loaded() ||
1832                               !field_modify->will_link(method(), Bytecodes::_withfield) ||
1833                               PatchALot;
1834 
1835 
1836   scope()->set_wrote_final();
1837   scope()->set_wrote_fields();
1838 
1839   const int offset = !needs_patching ? field_modify->offset() : -1;
1840   Value val = pop(type);
1841   Value obj = apop();
1842 
1843   ValueStack* state_before = copy_state_for_exception();
1844 
1845   NewValueTypeInstance* new_instance = new NewValueTypeInstance(holder->as_value_klass(), state_before, false);
1846   _memory->new_instance(new_instance);
1847   apush(append_split(new_instance));
1848 
1849   for (int i = 0; i < holder->nof_nonstatic_fields(); i++) {
1850     ciField* field = holder->nonstatic_field_at(i);
1851     int off = field->offset();
1852 
1853     if (field->offset() != offset) {






1854       // Only load those fields who are not modified
1855       LoadField* load = new LoadField(obj, off, field, false, state_before, needs_patching);
1856       Value replacement = append(load);
1857 
1858       StoreField* store = new StoreField(new_instance, off, field, replacement, false, state_before, needs_patching);
1859       append(store);
1860     }
1861   }

1862 
1863   // Field to modify
1864   if (field_modify->type()->basic_type() == T_BOOLEAN) {
1865     Value mask = append(new Constant(new IntConstant(1)));
1866     val = append(new LogicOp(Bytecodes::_iand, val, mask));
1867   }





1868   StoreField* store = new StoreField(new_instance, offset, field_modify, val, false, state_before, needs_patching);
1869   append(store);

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