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