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