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