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