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