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