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