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