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