output.cpp revision 6761:739468857ffb
1/* 2 * Copyright (c) 1998, 2014, 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 "asm/assembler.inline.hpp" 27#include "code/compiledIC.hpp" 28#include "code/debugInfo.hpp" 29#include "code/debugInfoRec.hpp" 30#include "compiler/compileBroker.hpp" 31#include "compiler/oopMap.hpp" 32#include "memory/allocation.inline.hpp" 33#include "opto/ad.hpp" 34#include "opto/callnode.hpp" 35#include "opto/cfgnode.hpp" 36#include "opto/locknode.hpp" 37#include "opto/machnode.hpp" 38#include "opto/optoreg.hpp" 39#include "opto/output.hpp" 40#include "opto/regalloc.hpp" 41#include "opto/runtime.hpp" 42#include "opto/subnode.hpp" 43#include "opto/type.hpp" 44#include "runtime/handles.inline.hpp" 45#include "utilities/xmlstream.hpp" 46 47#ifndef PRODUCT 48#define DEBUG_ARG(x) , x 49#else 50#define DEBUG_ARG(x) 51#endif 52 53// Convert Nodes to instruction bits and pass off to the VM 54void Compile::Output() { 55 // RootNode goes 56 assert( _cfg->get_root_block()->number_of_nodes() == 0, "" ); 57 58 // The number of new nodes (mostly MachNop) is proportional to 59 // the number of java calls and inner loops which are aligned. 60 if ( C->check_node_count((NodeLimitFudgeFactor + C->java_calls()*3 + 61 C->inner_loops()*(OptoLoopAlignment-1)), 62 "out of nodes before code generation" ) ) { 63 return; 64 } 65 // Make sure I can find the Start Node 66 Block *entry = _cfg->get_block(1); 67 Block *broot = _cfg->get_root_block(); 68 69 const StartNode *start = entry->head()->as_Start(); 70 71 // Replace StartNode with prolog 72 MachPrologNode *prolog = new MachPrologNode(); 73 entry->map_node(prolog, 0); 74 _cfg->map_node_to_block(prolog, entry); 75 _cfg->unmap_node_from_block(start); // start is no longer in any block 76 77 // Virtual methods need an unverified entry point 78 79 if( is_osr_compilation() ) { 80 if( PoisonOSREntry ) { 81 // TODO: Should use a ShouldNotReachHereNode... 82 _cfg->insert( broot, 0, new MachBreakpointNode() ); 83 } 84 } else { 85 if( _method && !_method->flags().is_static() ) { 86 // Insert unvalidated entry point 87 _cfg->insert( broot, 0, new MachUEPNode() ); 88 } 89 90 } 91 92 93 // Break before main entry point 94 if( (_method && _method->break_at_execute()) 95#ifndef PRODUCT 96 ||(OptoBreakpoint && is_method_compilation()) 97 ||(OptoBreakpointOSR && is_osr_compilation()) 98 ||(OptoBreakpointC2R && !_method) 99#endif 100 ) { 101 // checking for _method means that OptoBreakpoint does not apply to 102 // runtime stubs or frame converters 103 _cfg->insert( entry, 1, new MachBreakpointNode() ); 104 } 105 106 // Insert epilogs before every return 107 for (uint i = 0; i < _cfg->number_of_blocks(); i++) { 108 Block* block = _cfg->get_block(i); 109 if (!block->is_connector() && block->non_connector_successor(0) == _cfg->get_root_block()) { // Found a program exit point? 110 Node* m = block->end(); 111 if (m->is_Mach() && m->as_Mach()->ideal_Opcode() != Op_Halt) { 112 MachEpilogNode* epilog = new MachEpilogNode(m->as_Mach()->ideal_Opcode() == Op_Return); 113 block->add_inst(epilog); 114 _cfg->map_node_to_block(epilog, block); 115 } 116 } 117 } 118 119# ifdef ENABLE_ZAP_DEAD_LOCALS 120 if (ZapDeadCompiledLocals) { 121 Insert_zap_nodes(); 122 } 123# endif 124 125 uint* blk_starts = NEW_RESOURCE_ARRAY(uint, _cfg->number_of_blocks() + 1); 126 blk_starts[0] = 0; 127 128 // Initialize code buffer and process short branches. 129 CodeBuffer* cb = init_buffer(blk_starts); 130 131 if (cb == NULL || failing()) { 132 return; 133 } 134 135 ScheduleAndBundle(); 136 137#ifndef PRODUCT 138 if (trace_opto_output()) { 139 tty->print("\n---- After ScheduleAndBundle ----\n"); 140 for (uint i = 0; i < _cfg->number_of_blocks(); i++) { 141 tty->print("\nBB#%03d:\n", i); 142 Block* block = _cfg->get_block(i); 143 for (uint j = 0; j < block->number_of_nodes(); j++) { 144 Node* n = block->get_node(j); 145 OptoReg::Name reg = _regalloc->get_reg_first(n); 146 tty->print(" %-6s ", reg >= 0 && reg < REG_COUNT ? Matcher::regName[reg] : ""); 147 n->dump(); 148 } 149 } 150 } 151#endif 152 153 if (failing()) { 154 return; 155 } 156 157 BuildOopMaps(); 158 159 if (failing()) { 160 return; 161 } 162 163 fill_buffer(cb, blk_starts); 164} 165 166bool Compile::need_stack_bang(int frame_size_in_bytes) const { 167 // Determine if we need to generate a stack overflow check. 168 // Do it if the method is not a stub function and 169 // has java calls or has frame size > vm_page_size/8. 170 // The debug VM checks that deoptimization doesn't trigger an 171 // unexpected stack overflow (compiled method stack banging should 172 // guarantee it doesn't happen) so we always need the stack bang in 173 // a debug VM. 174 return (UseStackBanging && stub_function() == NULL && 175 (has_java_calls() || frame_size_in_bytes > os::vm_page_size()>>3 176 DEBUG_ONLY(|| true))); 177} 178 179bool Compile::need_register_stack_bang() const { 180 // Determine if we need to generate a register stack overflow check. 181 // This is only used on architectures which have split register 182 // and memory stacks (ie. IA64). 183 // Bang if the method is not a stub function and has java calls 184 return (stub_function() == NULL && has_java_calls()); 185} 186 187# ifdef ENABLE_ZAP_DEAD_LOCALS 188 189 190// In order to catch compiler oop-map bugs, we have implemented 191// a debugging mode called ZapDeadCompilerLocals. 192// This mode causes the compiler to insert a call to a runtime routine, 193// "zap_dead_locals", right before each place in compiled code 194// that could potentially be a gc-point (i.e., a safepoint or oop map point). 195// The runtime routine checks that locations mapped as oops are really 196// oops, that locations mapped as values do not look like oops, 197// and that locations mapped as dead are not used later 198// (by zapping them to an invalid address). 199 200int Compile::_CompiledZap_count = 0; 201 202void Compile::Insert_zap_nodes() { 203 bool skip = false; 204 205 206 // Dink with static counts because code code without the extra 207 // runtime calls is MUCH faster for debugging purposes 208 209 if ( CompileZapFirst == 0 ) ; // nothing special 210 else if ( CompileZapFirst > CompiledZap_count() ) skip = true; 211 else if ( CompileZapFirst == CompiledZap_count() ) 212 warning("starting zap compilation after skipping"); 213 214 if ( CompileZapLast == -1 ) ; // nothing special 215 else if ( CompileZapLast < CompiledZap_count() ) skip = true; 216 else if ( CompileZapLast == CompiledZap_count() ) 217 warning("about to compile last zap"); 218 219 ++_CompiledZap_count; // counts skipped zaps, too 220 221 if ( skip ) return; 222 223 224 if ( _method == NULL ) 225 return; // no safepoints/oopmaps emitted for calls in stubs,so we don't care 226 227 // Insert call to zap runtime stub before every node with an oop map 228 for( uint i=0; i<_cfg->number_of_blocks(); i++ ) { 229 Block *b = _cfg->get_block(i); 230 for ( uint j = 0; j < b->number_of_nodes(); ++j ) { 231 Node *n = b->get_node(j); 232 233 // Determining if we should insert a zap-a-lot node in output. 234 // We do that for all nodes that has oopmap info, except for calls 235 // to allocation. Calls to allocation passes in the old top-of-eden pointer 236 // and expect the C code to reset it. Hence, there can be no safepoints between 237 // the inlined-allocation and the call to new_Java, etc. 238 // We also cannot zap monitor calls, as they must hold the microlock 239 // during the call to Zap, which also wants to grab the microlock. 240 bool insert = n->is_MachSafePoint() && (n->as_MachSafePoint()->oop_map() != NULL); 241 if ( insert ) { // it is MachSafePoint 242 if ( !n->is_MachCall() ) { 243 insert = false; 244 } else if ( n->is_MachCall() ) { 245 MachCallNode* call = n->as_MachCall(); 246 if (call->entry_point() == OptoRuntime::new_instance_Java() || 247 call->entry_point() == OptoRuntime::new_array_Java() || 248 call->entry_point() == OptoRuntime::multianewarray2_Java() || 249 call->entry_point() == OptoRuntime::multianewarray3_Java() || 250 call->entry_point() == OptoRuntime::multianewarray4_Java() || 251 call->entry_point() == OptoRuntime::multianewarray5_Java() || 252 call->entry_point() == OptoRuntime::slow_arraycopy_Java() || 253 call->entry_point() == OptoRuntime::complete_monitor_locking_Java() 254 ) { 255 insert = false; 256 } 257 } 258 if (insert) { 259 Node *zap = call_zap_node(n->as_MachSafePoint(), i); 260 b->insert_node(zap, j); 261 _cfg->map_node_to_block(zap, b); 262 ++j; 263 } 264 } 265 } 266 } 267} 268 269 270Node* Compile::call_zap_node(MachSafePointNode* node_to_check, int block_no) { 271 const TypeFunc *tf = OptoRuntime::zap_dead_locals_Type(); 272 CallStaticJavaNode* ideal_node = 273 new CallStaticJavaNode( tf, 274 OptoRuntime::zap_dead_locals_stub(_method->flags().is_native()), 275 "call zap dead locals stub", 0, TypePtr::BOTTOM); 276 // We need to copy the OopMap from the site we're zapping at. 277 // We have to make a copy, because the zap site might not be 278 // a call site, and zap_dead is a call site. 279 OopMap* clone = node_to_check->oop_map()->deep_copy(); 280 281 // Add the cloned OopMap to the zap node 282 ideal_node->set_oop_map(clone); 283 return _matcher->match_sfpt(ideal_node); 284} 285 286bool Compile::is_node_getting_a_safepoint( Node* n) { 287 // This code duplicates the logic prior to the call of add_safepoint 288 // below in this file. 289 if( n->is_MachSafePoint() ) return true; 290 return false; 291} 292 293# endif // ENABLE_ZAP_DEAD_LOCALS 294 295// Compute the size of first NumberOfLoopInstrToAlign instructions at the top 296// of a loop. When aligning a loop we need to provide enough instructions 297// in cpu's fetch buffer to feed decoders. The loop alignment could be 298// avoided if we have enough instructions in fetch buffer at the head of a loop. 299// By default, the size is set to 999999 by Block's constructor so that 300// a loop will be aligned if the size is not reset here. 301// 302// Note: Mach instructions could contain several HW instructions 303// so the size is estimated only. 304// 305void Compile::compute_loop_first_inst_sizes() { 306 // The next condition is used to gate the loop alignment optimization. 307 // Don't aligned a loop if there are enough instructions at the head of a loop 308 // or alignment padding is larger then MaxLoopPad. By default, MaxLoopPad 309 // is equal to OptoLoopAlignment-1 except on new Intel cpus, where it is 310 // equal to 11 bytes which is the largest address NOP instruction. 311 if (MaxLoopPad < OptoLoopAlignment - 1) { 312 uint last_block = _cfg->number_of_blocks() - 1; 313 for (uint i = 1; i <= last_block; i++) { 314 Block* block = _cfg->get_block(i); 315 // Check the first loop's block which requires an alignment. 316 if (block->loop_alignment() > (uint)relocInfo::addr_unit()) { 317 uint sum_size = 0; 318 uint inst_cnt = NumberOfLoopInstrToAlign; 319 inst_cnt = block->compute_first_inst_size(sum_size, inst_cnt, _regalloc); 320 321 // Check subsequent fallthrough blocks if the loop's first 322 // block(s) does not have enough instructions. 323 Block *nb = block; 324 while(inst_cnt > 0 && 325 i < last_block && 326 !_cfg->get_block(i + 1)->has_loop_alignment() && 327 !nb->has_successor(block)) { 328 i++; 329 nb = _cfg->get_block(i); 330 inst_cnt = nb->compute_first_inst_size(sum_size, inst_cnt, _regalloc); 331 } // while( inst_cnt > 0 && i < last_block ) 332 333 block->set_first_inst_size(sum_size); 334 } // f( b->head()->is_Loop() ) 335 } // for( i <= last_block ) 336 } // if( MaxLoopPad < OptoLoopAlignment-1 ) 337} 338 339// The architecture description provides short branch variants for some long 340// branch instructions. Replace eligible long branches with short branches. 341void Compile::shorten_branches(uint* blk_starts, int& code_size, int& reloc_size, int& stub_size) { 342 // Compute size of each block, method size, and relocation information size 343 uint nblocks = _cfg->number_of_blocks(); 344 345 uint* jmp_offset = NEW_RESOURCE_ARRAY(uint,nblocks); 346 uint* jmp_size = NEW_RESOURCE_ARRAY(uint,nblocks); 347 int* jmp_nidx = NEW_RESOURCE_ARRAY(int ,nblocks); 348 349 // Collect worst case block paddings 350 int* block_worst_case_pad = NEW_RESOURCE_ARRAY(int, nblocks); 351 memset(block_worst_case_pad, 0, nblocks * sizeof(int)); 352 353 DEBUG_ONLY( uint *jmp_target = NEW_RESOURCE_ARRAY(uint,nblocks); ) 354 DEBUG_ONLY( uint *jmp_rule = NEW_RESOURCE_ARRAY(uint,nblocks); ) 355 356 bool has_short_branch_candidate = false; 357 358 // Initialize the sizes to 0 359 code_size = 0; // Size in bytes of generated code 360 stub_size = 0; // Size in bytes of all stub entries 361 // Size in bytes of all relocation entries, including those in local stubs. 362 // Start with 2-bytes of reloc info for the unvalidated entry point 363 reloc_size = 1; // Number of relocation entries 364 365 // Make three passes. The first computes pessimistic blk_starts, 366 // relative jmp_offset and reloc_size information. The second performs 367 // short branch substitution using the pessimistic sizing. The 368 // third inserts nops where needed. 369 370 // Step one, perform a pessimistic sizing pass. 371 uint last_call_adr = max_juint; 372 uint last_avoid_back_to_back_adr = max_juint; 373 uint nop_size = (new MachNopNode())->size(_regalloc); 374 for (uint i = 0; i < nblocks; i++) { // For all blocks 375 Block* block = _cfg->get_block(i); 376 377 // During short branch replacement, we store the relative (to blk_starts) 378 // offset of jump in jmp_offset, rather than the absolute offset of jump. 379 // This is so that we do not need to recompute sizes of all nodes when 380 // we compute correct blk_starts in our next sizing pass. 381 jmp_offset[i] = 0; 382 jmp_size[i] = 0; 383 jmp_nidx[i] = -1; 384 DEBUG_ONLY( jmp_target[i] = 0; ) 385 DEBUG_ONLY( jmp_rule[i] = 0; ) 386 387 // Sum all instruction sizes to compute block size 388 uint last_inst = block->number_of_nodes(); 389 uint blk_size = 0; 390 for (uint j = 0; j < last_inst; j++) { 391 Node* nj = block->get_node(j); 392 // Handle machine instruction nodes 393 if (nj->is_Mach()) { 394 MachNode *mach = nj->as_Mach(); 395 blk_size += (mach->alignment_required() - 1) * relocInfo::addr_unit(); // assume worst case padding 396 reloc_size += mach->reloc(); 397 if (mach->is_MachCall()) { 398 // add size information for trampoline stub 399 // class CallStubImpl is platform-specific and defined in the *.ad files. 400 stub_size += CallStubImpl::size_call_trampoline(); 401 reloc_size += CallStubImpl::reloc_call_trampoline(); 402 403 MachCallNode *mcall = mach->as_MachCall(); 404 // This destination address is NOT PC-relative 405 406 mcall->method_set((intptr_t)mcall->entry_point()); 407 408 if (mcall->is_MachCallJava() && mcall->as_MachCallJava()->_method) { 409 stub_size += CompiledStaticCall::to_interp_stub_size(); 410 reloc_size += CompiledStaticCall::reloc_to_interp_stub(); 411 } 412 } else if (mach->is_MachSafePoint()) { 413 // If call/safepoint are adjacent, account for possible 414 // nop to disambiguate the two safepoints. 415 // ScheduleAndBundle() can rearrange nodes in a block, 416 // check for all offsets inside this block. 417 if (last_call_adr >= blk_starts[i]) { 418 blk_size += nop_size; 419 } 420 } 421 if (mach->avoid_back_to_back(MachNode::AVOID_BEFORE)) { 422 // Nop is inserted between "avoid back to back" instructions. 423 // ScheduleAndBundle() can rearrange nodes in a block, 424 // check for all offsets inside this block. 425 if (last_avoid_back_to_back_adr >= blk_starts[i]) { 426 blk_size += nop_size; 427 } 428 } 429 if (mach->may_be_short_branch()) { 430 if (!nj->is_MachBranch()) { 431#ifndef PRODUCT 432 nj->dump(3); 433#endif 434 Unimplemented(); 435 } 436 assert(jmp_nidx[i] == -1, "block should have only one branch"); 437 jmp_offset[i] = blk_size; 438 jmp_size[i] = nj->size(_regalloc); 439 jmp_nidx[i] = j; 440 has_short_branch_candidate = true; 441 } 442 } 443 blk_size += nj->size(_regalloc); 444 // Remember end of call offset 445 if (nj->is_MachCall() && !nj->is_MachCallLeaf()) { 446 last_call_adr = blk_starts[i]+blk_size; 447 } 448 // Remember end of avoid_back_to_back offset 449 if (nj->is_Mach() && nj->as_Mach()->avoid_back_to_back(MachNode::AVOID_AFTER)) { 450 last_avoid_back_to_back_adr = blk_starts[i]+blk_size; 451 } 452 } 453 454 // When the next block starts a loop, we may insert pad NOP 455 // instructions. Since we cannot know our future alignment, 456 // assume the worst. 457 if (i < nblocks - 1) { 458 Block* nb = _cfg->get_block(i + 1); 459 int max_loop_pad = nb->code_alignment()-relocInfo::addr_unit(); 460 if (max_loop_pad > 0) { 461 assert(is_power_of_2(max_loop_pad+relocInfo::addr_unit()), ""); 462 // Adjust last_call_adr and/or last_avoid_back_to_back_adr. 463 // If either is the last instruction in this block, bump by 464 // max_loop_pad in lock-step with blk_size, so sizing 465 // calculations in subsequent blocks still can conservatively 466 // detect that it may the last instruction in this block. 467 if (last_call_adr == blk_starts[i]+blk_size) { 468 last_call_adr += max_loop_pad; 469 } 470 if (last_avoid_back_to_back_adr == blk_starts[i]+blk_size) { 471 last_avoid_back_to_back_adr += max_loop_pad; 472 } 473 blk_size += max_loop_pad; 474 block_worst_case_pad[i + 1] = max_loop_pad; 475 } 476 } 477 478 // Save block size; update total method size 479 blk_starts[i+1] = blk_starts[i]+blk_size; 480 } 481 482 // Step two, replace eligible long jumps. 483 bool progress = true; 484 uint last_may_be_short_branch_adr = max_juint; 485 while (has_short_branch_candidate && progress) { 486 progress = false; 487 has_short_branch_candidate = false; 488 int adjust_block_start = 0; 489 for (uint i = 0; i < nblocks; i++) { 490 Block* block = _cfg->get_block(i); 491 int idx = jmp_nidx[i]; 492 MachNode* mach = (idx == -1) ? NULL: block->get_node(idx)->as_Mach(); 493 if (mach != NULL && mach->may_be_short_branch()) { 494#ifdef ASSERT 495 assert(jmp_size[i] > 0 && mach->is_MachBranch(), "sanity"); 496 int j; 497 // Find the branch; ignore trailing NOPs. 498 for (j = block->number_of_nodes()-1; j>=0; j--) { 499 Node* n = block->get_node(j); 500 if (!n->is_Mach() || n->as_Mach()->ideal_Opcode() != Op_Con) 501 break; 502 } 503 assert(j >= 0 && j == idx && block->get_node(j) == (Node*)mach, "sanity"); 504#endif 505 int br_size = jmp_size[i]; 506 int br_offs = blk_starts[i] + jmp_offset[i]; 507 508 // This requires the TRUE branch target be in succs[0] 509 uint bnum = block->non_connector_successor(0)->_pre_order; 510 int offset = blk_starts[bnum] - br_offs; 511 if (bnum > i) { // adjust following block's offset 512 offset -= adjust_block_start; 513 } 514 515 // This block can be a loop header, account for the padding 516 // in the previous block. 517 int block_padding = block_worst_case_pad[i]; 518 assert(i == 0 || block_padding == 0 || br_offs >= block_padding, "Should have at least a padding on top"); 519 // In the following code a nop could be inserted before 520 // the branch which will increase the backward distance. 521 bool needs_padding = ((uint)(br_offs - block_padding) == last_may_be_short_branch_adr); 522 assert(!needs_padding || jmp_offset[i] == 0, "padding only branches at the beginning of block"); 523 524 if (needs_padding && offset <= 0) 525 offset -= nop_size; 526 527 if (_matcher->is_short_branch_offset(mach->rule(), br_size, offset)) { 528 // We've got a winner. Replace this branch. 529 MachNode* replacement = mach->as_MachBranch()->short_branch_version(this); 530 531 // Update the jmp_size. 532 int new_size = replacement->size(_regalloc); 533 int diff = br_size - new_size; 534 assert(diff >= (int)nop_size, "short_branch size should be smaller"); 535 // Conservatively take into account padding between 536 // avoid_back_to_back branches. Previous branch could be 537 // converted into avoid_back_to_back branch during next 538 // rounds. 539 if (needs_padding && replacement->avoid_back_to_back(MachNode::AVOID_BEFORE)) { 540 jmp_offset[i] += nop_size; 541 diff -= nop_size; 542 } 543 adjust_block_start += diff; 544 block->map_node(replacement, idx); 545 mach->subsume_by(replacement, C); 546 mach = replacement; 547 progress = true; 548 549 jmp_size[i] = new_size; 550 DEBUG_ONLY( jmp_target[i] = bnum; ); 551 DEBUG_ONLY( jmp_rule[i] = mach->rule(); ); 552 } else { 553 // The jump distance is not short, try again during next iteration. 554 has_short_branch_candidate = true; 555 } 556 } // (mach->may_be_short_branch()) 557 if (mach != NULL && (mach->may_be_short_branch() || 558 mach->avoid_back_to_back(MachNode::AVOID_AFTER))) { 559 last_may_be_short_branch_adr = blk_starts[i] + jmp_offset[i] + jmp_size[i]; 560 } 561 blk_starts[i+1] -= adjust_block_start; 562 } 563 } 564 565#ifdef ASSERT 566 for (uint i = 0; i < nblocks; i++) { // For all blocks 567 if (jmp_target[i] != 0) { 568 int br_size = jmp_size[i]; 569 int offset = blk_starts[jmp_target[i]]-(blk_starts[i] + jmp_offset[i]); 570 if (!_matcher->is_short_branch_offset(jmp_rule[i], br_size, offset)) { 571 tty->print_cr("target (%d) - jmp_offset(%d) = offset (%d), jump_size(%d), jmp_block B%d, target_block B%d", blk_starts[jmp_target[i]], blk_starts[i] + jmp_offset[i], offset, br_size, i, jmp_target[i]); 572 } 573 assert(_matcher->is_short_branch_offset(jmp_rule[i], br_size, offset), "Displacement too large for short jmp"); 574 } 575 } 576#endif 577 578 // Step 3, compute the offsets of all blocks, will be done in fill_buffer() 579 // after ScheduleAndBundle(). 580 581 // ------------------ 582 // Compute size for code buffer 583 code_size = blk_starts[nblocks]; 584 585 // Relocation records 586 reloc_size += 1; // Relo entry for exception handler 587 588 // Adjust reloc_size to number of record of relocation info 589 // Min is 2 bytes, max is probably 6 or 8, with a tax up to 25% for 590 // a relocation index. 591 // The CodeBuffer will expand the locs array if this estimate is too low. 592 reloc_size *= 10 / sizeof(relocInfo); 593} 594 595//------------------------------FillLocArray----------------------------------- 596// Create a bit of debug info and append it to the array. The mapping is from 597// Java local or expression stack to constant, register or stack-slot. For 598// doubles, insert 2 mappings and return 1 (to tell the caller that the next 599// entry has been taken care of and caller should skip it). 600static LocationValue *new_loc_value( PhaseRegAlloc *ra, OptoReg::Name regnum, Location::Type l_type ) { 601 // This should never have accepted Bad before 602 assert(OptoReg::is_valid(regnum), "location must be valid"); 603 return (OptoReg::is_reg(regnum)) 604 ? new LocationValue(Location::new_reg_loc(l_type, OptoReg::as_VMReg(regnum)) ) 605 : new LocationValue(Location::new_stk_loc(l_type, ra->reg2offset(regnum))); 606} 607 608 609ObjectValue* 610Compile::sv_for_node_id(GrowableArray<ScopeValue*> *objs, int id) { 611 for (int i = 0; i < objs->length(); i++) { 612 assert(objs->at(i)->is_object(), "corrupt object cache"); 613 ObjectValue* sv = (ObjectValue*) objs->at(i); 614 if (sv->id() == id) { 615 return sv; 616 } 617 } 618 // Otherwise.. 619 return NULL; 620} 621 622void Compile::set_sv_for_object_node(GrowableArray<ScopeValue*> *objs, 623 ObjectValue* sv ) { 624 assert(sv_for_node_id(objs, sv->id()) == NULL, "Precondition"); 625 objs->append(sv); 626} 627 628 629void Compile::FillLocArray( int idx, MachSafePointNode* sfpt, Node *local, 630 GrowableArray<ScopeValue*> *array, 631 GrowableArray<ScopeValue*> *objs ) { 632 assert( local, "use _top instead of null" ); 633 if (array->length() != idx) { 634 assert(array->length() == idx + 1, "Unexpected array count"); 635 // Old functionality: 636 // return 637 // New functionality: 638 // Assert if the local is not top. In product mode let the new node 639 // override the old entry. 640 assert(local == top(), "LocArray collision"); 641 if (local == top()) { 642 return; 643 } 644 array->pop(); 645 } 646 const Type *t = local->bottom_type(); 647 648 // Is it a safepoint scalar object node? 649 if (local->is_SafePointScalarObject()) { 650 SafePointScalarObjectNode* spobj = local->as_SafePointScalarObject(); 651 652 ObjectValue* sv = Compile::sv_for_node_id(objs, spobj->_idx); 653 if (sv == NULL) { 654 ciKlass* cik = t->is_oopptr()->klass(); 655 assert(cik->is_instance_klass() || 656 cik->is_array_klass(), "Not supported allocation."); 657 sv = new ObjectValue(spobj->_idx, 658 new ConstantOopWriteValue(cik->java_mirror()->constant_encoding())); 659 Compile::set_sv_for_object_node(objs, sv); 660 661 uint first_ind = spobj->first_index(sfpt->jvms()); 662 for (uint i = 0; i < spobj->n_fields(); i++) { 663 Node* fld_node = sfpt->in(first_ind+i); 664 (void)FillLocArray(sv->field_values()->length(), sfpt, fld_node, sv->field_values(), objs); 665 } 666 } 667 array->append(sv); 668 return; 669 } 670 671 // Grab the register number for the local 672 OptoReg::Name regnum = _regalloc->get_reg_first(local); 673 if( OptoReg::is_valid(regnum) ) {// Got a register/stack? 674 // Record the double as two float registers. 675 // The register mask for such a value always specifies two adjacent 676 // float registers, with the lower register number even. 677 // Normally, the allocation of high and low words to these registers 678 // is irrelevant, because nearly all operations on register pairs 679 // (e.g., StoreD) treat them as a single unit. 680 // Here, we assume in addition that the words in these two registers 681 // stored "naturally" (by operations like StoreD and double stores 682 // within the interpreter) such that the lower-numbered register 683 // is written to the lower memory address. This may seem like 684 // a machine dependency, but it is not--it is a requirement on 685 // the author of the <arch>.ad file to ensure that, for every 686 // even/odd double-register pair to which a double may be allocated, 687 // the word in the even single-register is stored to the first 688 // memory word. (Note that register numbers are completely 689 // arbitrary, and are not tied to any machine-level encodings.) 690#ifdef _LP64 691 if( t->base() == Type::DoubleBot || t->base() == Type::DoubleCon ) { 692 array->append(new ConstantIntValue(0)); 693 array->append(new_loc_value( _regalloc, regnum, Location::dbl )); 694 } else if ( t->base() == Type::Long ) { 695 array->append(new ConstantIntValue(0)); 696 array->append(new_loc_value( _regalloc, regnum, Location::lng )); 697 } else if ( t->base() == Type::RawPtr ) { 698 // jsr/ret return address which must be restored into a the full 699 // width 64-bit stack slot. 700 array->append(new_loc_value( _regalloc, regnum, Location::lng )); 701 } 702#else //_LP64 703#ifdef SPARC 704 if (t->base() == Type::Long && OptoReg::is_reg(regnum)) { 705 // For SPARC we have to swap high and low words for 706 // long values stored in a single-register (g0-g7). 707 array->append(new_loc_value( _regalloc, regnum , Location::normal )); 708 array->append(new_loc_value( _regalloc, OptoReg::add(regnum,1), Location::normal )); 709 } else 710#endif //SPARC 711 if( t->base() == Type::DoubleBot || t->base() == Type::DoubleCon || t->base() == Type::Long ) { 712 // Repack the double/long as two jints. 713 // The convention the interpreter uses is that the second local 714 // holds the first raw word of the native double representation. 715 // This is actually reasonable, since locals and stack arrays 716 // grow downwards in all implementations. 717 // (If, on some machine, the interpreter's Java locals or stack 718 // were to grow upwards, the embedded doubles would be word-swapped.) 719 array->append(new_loc_value( _regalloc, OptoReg::add(regnum,1), Location::normal )); 720 array->append(new_loc_value( _regalloc, regnum , Location::normal )); 721 } 722#endif //_LP64 723 else if( (t->base() == Type::FloatBot || t->base() == Type::FloatCon) && 724 OptoReg::is_reg(regnum) ) { 725 array->append(new_loc_value( _regalloc, regnum, Matcher::float_in_double() 726 ? Location::float_in_dbl : Location::normal )); 727 } else if( t->base() == Type::Int && OptoReg::is_reg(regnum) ) { 728 array->append(new_loc_value( _regalloc, regnum, Matcher::int_in_long 729 ? Location::int_in_long : Location::normal )); 730 } else if( t->base() == Type::NarrowOop ) { 731 array->append(new_loc_value( _regalloc, regnum, Location::narrowoop )); 732 } else { 733 array->append(new_loc_value( _regalloc, regnum, _regalloc->is_oop(local) ? Location::oop : Location::normal )); 734 } 735 return; 736 } 737 738 // No register. It must be constant data. 739 switch (t->base()) { 740 case Type::Half: // Second half of a double 741 ShouldNotReachHere(); // Caller should skip 2nd halves 742 break; 743 case Type::AnyPtr: 744 array->append(new ConstantOopWriteValue(NULL)); 745 break; 746 case Type::AryPtr: 747 case Type::InstPtr: // fall through 748 array->append(new ConstantOopWriteValue(t->isa_oopptr()->const_oop()->constant_encoding())); 749 break; 750 case Type::NarrowOop: 751 if (t == TypeNarrowOop::NULL_PTR) { 752 array->append(new ConstantOopWriteValue(NULL)); 753 } else { 754 array->append(new ConstantOopWriteValue(t->make_ptr()->isa_oopptr()->const_oop()->constant_encoding())); 755 } 756 break; 757 case Type::Int: 758 array->append(new ConstantIntValue(t->is_int()->get_con())); 759 break; 760 case Type::RawPtr: 761 // A return address (T_ADDRESS). 762 assert((intptr_t)t->is_ptr()->get_con() < (intptr_t)0x10000, "must be a valid BCI"); 763#ifdef _LP64 764 // Must be restored to the full-width 64-bit stack slot. 765 array->append(new ConstantLongValue(t->is_ptr()->get_con())); 766#else 767 array->append(new ConstantIntValue(t->is_ptr()->get_con())); 768#endif 769 break; 770 case Type::FloatCon: { 771 float f = t->is_float_constant()->getf(); 772 array->append(new ConstantIntValue(jint_cast(f))); 773 break; 774 } 775 case Type::DoubleCon: { 776 jdouble d = t->is_double_constant()->getd(); 777#ifdef _LP64 778 array->append(new ConstantIntValue(0)); 779 array->append(new ConstantDoubleValue(d)); 780#else 781 // Repack the double as two jints. 782 // The convention the interpreter uses is that the second local 783 // holds the first raw word of the native double representation. 784 // This is actually reasonable, since locals and stack arrays 785 // grow downwards in all implementations. 786 // (If, on some machine, the interpreter's Java locals or stack 787 // were to grow upwards, the embedded doubles would be word-swapped.) 788 jint *dp = (jint*)&d; 789 array->append(new ConstantIntValue(dp[1])); 790 array->append(new ConstantIntValue(dp[0])); 791#endif 792 break; 793 } 794 case Type::Long: { 795 jlong d = t->is_long()->get_con(); 796#ifdef _LP64 797 array->append(new ConstantIntValue(0)); 798 array->append(new ConstantLongValue(d)); 799#else 800 // Repack the long as two jints. 801 // The convention the interpreter uses is that the second local 802 // holds the first raw word of the native double representation. 803 // This is actually reasonable, since locals and stack arrays 804 // grow downwards in all implementations. 805 // (If, on some machine, the interpreter's Java locals or stack 806 // were to grow upwards, the embedded doubles would be word-swapped.) 807 jint *dp = (jint*)&d; 808 array->append(new ConstantIntValue(dp[1])); 809 array->append(new ConstantIntValue(dp[0])); 810#endif 811 break; 812 } 813 case Type::Top: // Add an illegal value here 814 array->append(new LocationValue(Location())); 815 break; 816 default: 817 ShouldNotReachHere(); 818 break; 819 } 820} 821 822// Determine if this node starts a bundle 823bool Compile::starts_bundle(const Node *n) const { 824 return (_node_bundling_limit > n->_idx && 825 _node_bundling_base[n->_idx].starts_bundle()); 826} 827 828//--------------------------Process_OopMap_Node-------------------------------- 829void Compile::Process_OopMap_Node(MachNode *mach, int current_offset) { 830 831 // Handle special safepoint nodes for synchronization 832 MachSafePointNode *sfn = mach->as_MachSafePoint(); 833 MachCallNode *mcall; 834 835#ifdef ENABLE_ZAP_DEAD_LOCALS 836 assert( is_node_getting_a_safepoint(mach), "logic does not match; false negative"); 837#endif 838 839 int safepoint_pc_offset = current_offset; 840 bool is_method_handle_invoke = false; 841 bool return_oop = false; 842 843 // Add the safepoint in the DebugInfoRecorder 844 if( !mach->is_MachCall() ) { 845 mcall = NULL; 846 debug_info()->add_safepoint(safepoint_pc_offset, sfn->_oop_map); 847 } else { 848 mcall = mach->as_MachCall(); 849 850 // Is the call a MethodHandle call? 851 if (mcall->is_MachCallJava()) { 852 if (mcall->as_MachCallJava()->_method_handle_invoke) { 853 assert(has_method_handle_invokes(), "must have been set during call generation"); 854 is_method_handle_invoke = true; 855 } 856 } 857 858 // Check if a call returns an object. 859 if (mcall->return_value_is_used() && 860 mcall->tf()->range()->field_at(TypeFunc::Parms)->isa_ptr()) { 861 return_oop = true; 862 } 863 safepoint_pc_offset += mcall->ret_addr_offset(); 864 debug_info()->add_safepoint(safepoint_pc_offset, mcall->_oop_map); 865 } 866 867 // Loop over the JVMState list to add scope information 868 // Do not skip safepoints with a NULL method, they need monitor info 869 JVMState* youngest_jvms = sfn->jvms(); 870 int max_depth = youngest_jvms->depth(); 871 872 // Allocate the object pool for scalar-replaced objects -- the map from 873 // small-integer keys (which can be recorded in the local and ostack 874 // arrays) to descriptions of the object state. 875 GrowableArray<ScopeValue*> *objs = new GrowableArray<ScopeValue*>(); 876 877 // Visit scopes from oldest to youngest. 878 for (int depth = 1; depth <= max_depth; depth++) { 879 JVMState* jvms = youngest_jvms->of_depth(depth); 880 int idx; 881 ciMethod* method = jvms->has_method() ? jvms->method() : NULL; 882 // Safepoints that do not have method() set only provide oop-map and monitor info 883 // to support GC; these do not support deoptimization. 884 int num_locs = (method == NULL) ? 0 : jvms->loc_size(); 885 int num_exps = (method == NULL) ? 0 : jvms->stk_size(); 886 int num_mon = jvms->nof_monitors(); 887 assert(method == NULL || jvms->bci() < 0 || num_locs == method->max_locals(), 888 "JVMS local count must match that of the method"); 889 890 // Add Local and Expression Stack Information 891 892 // Insert locals into the locarray 893 GrowableArray<ScopeValue*> *locarray = new GrowableArray<ScopeValue*>(num_locs); 894 for( idx = 0; idx < num_locs; idx++ ) { 895 FillLocArray( idx, sfn, sfn->local(jvms, idx), locarray, objs ); 896 } 897 898 // Insert expression stack entries into the exparray 899 GrowableArray<ScopeValue*> *exparray = new GrowableArray<ScopeValue*>(num_exps); 900 for( idx = 0; idx < num_exps; idx++ ) { 901 FillLocArray( idx, sfn, sfn->stack(jvms, idx), exparray, objs ); 902 } 903 904 // Add in mappings of the monitors 905 assert( !method || 906 !method->is_synchronized() || 907 method->is_native() || 908 num_mon > 0 || 909 !GenerateSynchronizationCode, 910 "monitors must always exist for synchronized methods"); 911 912 // Build the growable array of ScopeValues for exp stack 913 GrowableArray<MonitorValue*> *monarray = new GrowableArray<MonitorValue*>(num_mon); 914 915 // Loop over monitors and insert into array 916 for (idx = 0; idx < num_mon; idx++) { 917 // Grab the node that defines this monitor 918 Node* box_node = sfn->monitor_box(jvms, idx); 919 Node* obj_node = sfn->monitor_obj(jvms, idx); 920 921 // Create ScopeValue for object 922 ScopeValue *scval = NULL; 923 924 if (obj_node->is_SafePointScalarObject()) { 925 SafePointScalarObjectNode* spobj = obj_node->as_SafePointScalarObject(); 926 scval = Compile::sv_for_node_id(objs, spobj->_idx); 927 if (scval == NULL) { 928 const Type *t = spobj->bottom_type(); 929 ciKlass* cik = t->is_oopptr()->klass(); 930 assert(cik->is_instance_klass() || 931 cik->is_array_klass(), "Not supported allocation."); 932 ObjectValue* sv = new ObjectValue(spobj->_idx, 933 new ConstantOopWriteValue(cik->java_mirror()->constant_encoding())); 934 Compile::set_sv_for_object_node(objs, sv); 935 936 uint first_ind = spobj->first_index(youngest_jvms); 937 for (uint i = 0; i < spobj->n_fields(); i++) { 938 Node* fld_node = sfn->in(first_ind+i); 939 (void)FillLocArray(sv->field_values()->length(), sfn, fld_node, sv->field_values(), objs); 940 } 941 scval = sv; 942 } 943 } else if (!obj_node->is_Con()) { 944 OptoReg::Name obj_reg = _regalloc->get_reg_first(obj_node); 945 if( obj_node->bottom_type()->base() == Type::NarrowOop ) { 946 scval = new_loc_value( _regalloc, obj_reg, Location::narrowoop ); 947 } else { 948 scval = new_loc_value( _regalloc, obj_reg, Location::oop ); 949 } 950 } else { 951 const TypePtr *tp = obj_node->get_ptr_type(); 952 scval = new ConstantOopWriteValue(tp->is_oopptr()->const_oop()->constant_encoding()); 953 } 954 955 OptoReg::Name box_reg = BoxLockNode::reg(box_node); 956 Location basic_lock = Location::new_stk_loc(Location::normal,_regalloc->reg2offset(box_reg)); 957 bool eliminated = (box_node->is_BoxLock() && box_node->as_BoxLock()->is_eliminated()); 958 monarray->append(new MonitorValue(scval, basic_lock, eliminated)); 959 } 960 961 // We dump the object pool first, since deoptimization reads it in first. 962 debug_info()->dump_object_pool(objs); 963 964 // Build first class objects to pass to scope 965 DebugToken *locvals = debug_info()->create_scope_values(locarray); 966 DebugToken *expvals = debug_info()->create_scope_values(exparray); 967 DebugToken *monvals = debug_info()->create_monitor_values(monarray); 968 969 // Make method available for all Safepoints 970 ciMethod* scope_method = method ? method : _method; 971 // Describe the scope here 972 assert(jvms->bci() >= InvocationEntryBci && jvms->bci() <= 0x10000, "must be a valid or entry BCI"); 973 assert(!jvms->should_reexecute() || depth == max_depth, "reexecute allowed only for the youngest"); 974 // Now we can describe the scope. 975 debug_info()->describe_scope(safepoint_pc_offset, scope_method, jvms->bci(), jvms->should_reexecute(), is_method_handle_invoke, return_oop, locvals, expvals, monvals); 976 } // End jvms loop 977 978 // Mark the end of the scope set. 979 debug_info()->end_safepoint(safepoint_pc_offset); 980} 981 982 983 984// A simplified version of Process_OopMap_Node, to handle non-safepoints. 985class NonSafepointEmitter { 986 Compile* C; 987 JVMState* _pending_jvms; 988 int _pending_offset; 989 990 void emit_non_safepoint(); 991 992 public: 993 NonSafepointEmitter(Compile* compile) { 994 this->C = compile; 995 _pending_jvms = NULL; 996 _pending_offset = 0; 997 } 998 999 void observe_instruction(Node* n, int pc_offset) { 1000 if (!C->debug_info()->recording_non_safepoints()) return; 1001 1002 Node_Notes* nn = C->node_notes_at(n->_idx); 1003 if (nn == NULL || nn->jvms() == NULL) return; 1004 if (_pending_jvms != NULL && 1005 _pending_jvms->same_calls_as(nn->jvms())) { 1006 // Repeated JVMS? Stretch it up here. 1007 _pending_offset = pc_offset; 1008 } else { 1009 if (_pending_jvms != NULL && 1010 _pending_offset < pc_offset) { 1011 emit_non_safepoint(); 1012 } 1013 _pending_jvms = NULL; 1014 if (pc_offset > C->debug_info()->last_pc_offset()) { 1015 // This is the only way _pending_jvms can become non-NULL: 1016 _pending_jvms = nn->jvms(); 1017 _pending_offset = pc_offset; 1018 } 1019 } 1020 } 1021 1022 // Stay out of the way of real safepoints: 1023 void observe_safepoint(JVMState* jvms, int pc_offset) { 1024 if (_pending_jvms != NULL && 1025 !_pending_jvms->same_calls_as(jvms) && 1026 _pending_offset < pc_offset) { 1027 emit_non_safepoint(); 1028 } 1029 _pending_jvms = NULL; 1030 } 1031 1032 void flush_at_end() { 1033 if (_pending_jvms != NULL) { 1034 emit_non_safepoint(); 1035 } 1036 _pending_jvms = NULL; 1037 } 1038}; 1039 1040void NonSafepointEmitter::emit_non_safepoint() { 1041 JVMState* youngest_jvms = _pending_jvms; 1042 int pc_offset = _pending_offset; 1043 1044 // Clear it now: 1045 _pending_jvms = NULL; 1046 1047 DebugInformationRecorder* debug_info = C->debug_info(); 1048 assert(debug_info->recording_non_safepoints(), "sanity"); 1049 1050 debug_info->add_non_safepoint(pc_offset); 1051 int max_depth = youngest_jvms->depth(); 1052 1053 // Visit scopes from oldest to youngest. 1054 for (int depth = 1; depth <= max_depth; depth++) { 1055 JVMState* jvms = youngest_jvms->of_depth(depth); 1056 ciMethod* method = jvms->has_method() ? jvms->method() : NULL; 1057 assert(!jvms->should_reexecute() || depth==max_depth, "reexecute allowed only for the youngest"); 1058 debug_info->describe_scope(pc_offset, method, jvms->bci(), jvms->should_reexecute()); 1059 } 1060 1061 // Mark the end of the scope set. 1062 debug_info->end_non_safepoint(pc_offset); 1063} 1064 1065//------------------------------init_buffer------------------------------------ 1066CodeBuffer* Compile::init_buffer(uint* blk_starts) { 1067 1068 // Set the initially allocated size 1069 int code_req = initial_code_capacity; 1070 int locs_req = initial_locs_capacity; 1071 int stub_req = TraceJumps ? initial_stub_capacity * 10 : initial_stub_capacity; 1072 int const_req = initial_const_capacity; 1073 1074 int pad_req = NativeCall::instruction_size; 1075 // The extra spacing after the code is necessary on some platforms. 1076 // Sometimes we need to patch in a jump after the last instruction, 1077 // if the nmethod has been deoptimized. (See 4932387, 4894843.) 1078 1079 // Compute the byte offset where we can store the deopt pc. 1080 if (fixed_slots() != 0) { 1081 _orig_pc_slot_offset_in_bytes = _regalloc->reg2offset(OptoReg::stack2reg(_orig_pc_slot)); 1082 } 1083 1084 // Compute prolog code size 1085 _method_size = 0; 1086 _frame_slots = OptoReg::reg2stack(_matcher->_old_SP)+_regalloc->_framesize; 1087#if defined(IA64) && !defined(AIX) 1088 if (save_argument_registers()) { 1089 // 4815101: this is a stub with implicit and unknown precision fp args. 1090 // The usual spill mechanism can only generate stfd's in this case, which 1091 // doesn't work if the fp reg to spill contains a single-precision denorm. 1092 // Instead, we hack around the normal spill mechanism using stfspill's and 1093 // ldffill's in the MachProlog and MachEpilog emit methods. We allocate 1094 // space here for the fp arg regs (f8-f15) we're going to thusly spill. 1095 // 1096 // If we ever implement 16-byte 'registers' == stack slots, we can 1097 // get rid of this hack and have SpillCopy generate stfspill/ldffill 1098 // instead of stfd/stfs/ldfd/ldfs. 1099 _frame_slots += 8*(16/BytesPerInt); 1100 } 1101#endif 1102 assert(_frame_slots >= 0 && _frame_slots < 1000000, "sanity check"); 1103 1104 if (has_mach_constant_base_node()) { 1105 uint add_size = 0; 1106 // Fill the constant table. 1107 // Note: This must happen before shorten_branches. 1108 for (uint i = 0; i < _cfg->number_of_blocks(); i++) { 1109 Block* b = _cfg->get_block(i); 1110 1111 for (uint j = 0; j < b->number_of_nodes(); j++) { 1112 Node* n = b->get_node(j); 1113 1114 // If the node is a MachConstantNode evaluate the constant 1115 // value section. 1116 if (n->is_MachConstant()) { 1117 MachConstantNode* machcon = n->as_MachConstant(); 1118 machcon->eval_constant(C); 1119 } else if (n->is_Mach()) { 1120 // On Power there are more nodes that issue constants. 1121 add_size += (n->as_Mach()->ins_num_consts() * 8); 1122 } 1123 } 1124 } 1125 1126 // Calculate the offsets of the constants and the size of the 1127 // constant table (including the padding to the next section). 1128 constant_table().calculate_offsets_and_size(); 1129 const_req = constant_table().size() + add_size; 1130 } 1131 1132 // Initialize the space for the BufferBlob used to find and verify 1133 // instruction size in MachNode::emit_size() 1134 init_scratch_buffer_blob(const_req); 1135 if (failing()) return NULL; // Out of memory 1136 1137 // Pre-compute the length of blocks and replace 1138 // long branches with short if machine supports it. 1139 shorten_branches(blk_starts, code_req, locs_req, stub_req); 1140 1141 // nmethod and CodeBuffer count stubs & constants as part of method's code. 1142 // class HandlerImpl is platform-specific and defined in the *.ad files. 1143 int exception_handler_req = HandlerImpl::size_exception_handler() + MAX_stubs_size; // add marginal slop for handler 1144 int deopt_handler_req = HandlerImpl::size_deopt_handler() + MAX_stubs_size; // add marginal slop for handler 1145 stub_req += MAX_stubs_size; // ensure per-stub margin 1146 code_req += MAX_inst_size; // ensure per-instruction margin 1147 1148 if (StressCodeBuffers) 1149 code_req = const_req = stub_req = exception_handler_req = deopt_handler_req = 0x10; // force expansion 1150 1151 int total_req = 1152 const_req + 1153 code_req + 1154 pad_req + 1155 stub_req + 1156 exception_handler_req + 1157 deopt_handler_req; // deopt handler 1158 1159 if (has_method_handle_invokes()) 1160 total_req += deopt_handler_req; // deopt MH handler 1161 1162 CodeBuffer* cb = code_buffer(); 1163 cb->initialize(total_req, locs_req); 1164 1165 // Have we run out of code space? 1166 if ((cb->blob() == NULL) || (!CompileBroker::should_compile_new_jobs())) { 1167 C->record_failure("CodeCache is full"); 1168 CompileBroker::handle_full_code_cache(); 1169 return NULL; 1170 } 1171 // Configure the code buffer. 1172 cb->initialize_consts_size(const_req); 1173 cb->initialize_stubs_size(stub_req); 1174 cb->initialize_oop_recorder(env()->oop_recorder()); 1175 1176 // fill in the nop array for bundling computations 1177 MachNode *_nop_list[Bundle::_nop_count]; 1178 Bundle::initialize_nops(_nop_list, this); 1179 1180 return cb; 1181} 1182 1183//------------------------------fill_buffer------------------------------------ 1184void Compile::fill_buffer(CodeBuffer* cb, uint* blk_starts) { 1185 // blk_starts[] contains offsets calculated during short branches processing, 1186 // offsets should not be increased during following steps. 1187 1188 // Compute the size of first NumberOfLoopInstrToAlign instructions at head 1189 // of a loop. It is used to determine the padding for loop alignment. 1190 compute_loop_first_inst_sizes(); 1191 1192 // Create oopmap set. 1193 _oop_map_set = new OopMapSet(); 1194 1195 // !!!!! This preserves old handling of oopmaps for now 1196 debug_info()->set_oopmaps(_oop_map_set); 1197 1198 uint nblocks = _cfg->number_of_blocks(); 1199 // Count and start of implicit null check instructions 1200 uint inct_cnt = 0; 1201 uint *inct_starts = NEW_RESOURCE_ARRAY(uint, nblocks+1); 1202 1203 // Count and start of calls 1204 uint *call_returns = NEW_RESOURCE_ARRAY(uint, nblocks+1); 1205 1206 uint return_offset = 0; 1207 int nop_size = (new MachNopNode())->size(_regalloc); 1208 1209 int previous_offset = 0; 1210 int current_offset = 0; 1211 int last_call_offset = -1; 1212 int last_avoid_back_to_back_offset = -1; 1213#ifdef ASSERT 1214 uint* jmp_target = NEW_RESOURCE_ARRAY(uint,nblocks); 1215 uint* jmp_offset = NEW_RESOURCE_ARRAY(uint,nblocks); 1216 uint* jmp_size = NEW_RESOURCE_ARRAY(uint,nblocks); 1217 uint* jmp_rule = NEW_RESOURCE_ARRAY(uint,nblocks); 1218#endif 1219 1220 // Create an array of unused labels, one for each basic block, if printing is enabled 1221#ifndef PRODUCT 1222 int *node_offsets = NULL; 1223 uint node_offset_limit = unique(); 1224 1225 if (print_assembly()) 1226 node_offsets = NEW_RESOURCE_ARRAY(int, node_offset_limit); 1227#endif 1228 1229 NonSafepointEmitter non_safepoints(this); // emit non-safepoints lazily 1230 1231 // Emit the constant table. 1232 if (has_mach_constant_base_node()) { 1233 constant_table().emit(*cb); 1234 } 1235 1236 // Create an array of labels, one for each basic block 1237 Label *blk_labels = NEW_RESOURCE_ARRAY(Label, nblocks+1); 1238 for (uint i=0; i <= nblocks; i++) { 1239 blk_labels[i].init(); 1240 } 1241 1242 // ------------------ 1243 // Now fill in the code buffer 1244 Node *delay_slot = NULL; 1245 1246 for (uint i = 0; i < nblocks; i++) { 1247 Block* block = _cfg->get_block(i); 1248 Node* head = block->head(); 1249 1250 // If this block needs to start aligned (i.e, can be reached other 1251 // than by falling-thru from the previous block), then force the 1252 // start of a new bundle. 1253 if (Pipeline::requires_bundling() && starts_bundle(head)) { 1254 cb->flush_bundle(true); 1255 } 1256 1257#ifdef ASSERT 1258 if (!block->is_connector()) { 1259 stringStream st; 1260 block->dump_head(_cfg, &st); 1261 MacroAssembler(cb).block_comment(st.as_string()); 1262 } 1263 jmp_target[i] = 0; 1264 jmp_offset[i] = 0; 1265 jmp_size[i] = 0; 1266 jmp_rule[i] = 0; 1267#endif 1268 int blk_offset = current_offset; 1269 1270 // Define the label at the beginning of the basic block 1271 MacroAssembler(cb).bind(blk_labels[block->_pre_order]); 1272 1273 uint last_inst = block->number_of_nodes(); 1274 1275 // Emit block normally, except for last instruction. 1276 // Emit means "dump code bits into code buffer". 1277 for (uint j = 0; j<last_inst; j++) { 1278 1279 // Get the node 1280 Node* n = block->get_node(j); 1281 1282 // See if delay slots are supported 1283 if (valid_bundle_info(n) && 1284 node_bundling(n)->used_in_unconditional_delay()) { 1285 assert(delay_slot == NULL, "no use of delay slot node"); 1286 assert(n->size(_regalloc) == Pipeline::instr_unit_size(), "delay slot instruction wrong size"); 1287 1288 delay_slot = n; 1289 continue; 1290 } 1291 1292 // If this starts a new instruction group, then flush the current one 1293 // (but allow split bundles) 1294 if (Pipeline::requires_bundling() && starts_bundle(n)) 1295 cb->flush_bundle(false); 1296 1297 // The following logic is duplicated in the code ifdeffed for 1298 // ENABLE_ZAP_DEAD_LOCALS which appears above in this file. It 1299 // should be factored out. Or maybe dispersed to the nodes? 1300 1301 // Special handling for SafePoint/Call Nodes 1302 bool is_mcall = false; 1303 if (n->is_Mach()) { 1304 MachNode *mach = n->as_Mach(); 1305 is_mcall = n->is_MachCall(); 1306 bool is_sfn = n->is_MachSafePoint(); 1307 1308 // If this requires all previous instructions be flushed, then do so 1309 if (is_sfn || is_mcall || mach->alignment_required() != 1) { 1310 cb->flush_bundle(true); 1311 current_offset = cb->insts_size(); 1312 } 1313 1314 // A padding may be needed again since a previous instruction 1315 // could be moved to delay slot. 1316 1317 // align the instruction if necessary 1318 int padding = mach->compute_padding(current_offset); 1319 // Make sure safepoint node for polling is distinct from a call's 1320 // return by adding a nop if needed. 1321 if (is_sfn && !is_mcall && padding == 0 && current_offset == last_call_offset) { 1322 padding = nop_size; 1323 } 1324 if (padding == 0 && mach->avoid_back_to_back(MachNode::AVOID_BEFORE) && 1325 current_offset == last_avoid_back_to_back_offset) { 1326 // Avoid back to back some instructions. 1327 padding = nop_size; 1328 } 1329 1330 if(padding > 0) { 1331 assert((padding % nop_size) == 0, "padding is not a multiple of NOP size"); 1332 int nops_cnt = padding / nop_size; 1333 MachNode *nop = new MachNopNode(nops_cnt); 1334 block->insert_node(nop, j++); 1335 last_inst++; 1336 _cfg->map_node_to_block(nop, block); 1337 nop->emit(*cb, _regalloc); 1338 cb->flush_bundle(true); 1339 current_offset = cb->insts_size(); 1340 } 1341 1342 // Remember the start of the last call in a basic block 1343 if (is_mcall) { 1344 MachCallNode *mcall = mach->as_MachCall(); 1345 1346 // This destination address is NOT PC-relative 1347 mcall->method_set((intptr_t)mcall->entry_point()); 1348 1349 // Save the return address 1350 call_returns[block->_pre_order] = current_offset + mcall->ret_addr_offset(); 1351 1352 if (mcall->is_MachCallLeaf()) { 1353 is_mcall = false; 1354 is_sfn = false; 1355 } 1356 } 1357 1358 // sfn will be valid whenever mcall is valid now because of inheritance 1359 if (is_sfn || is_mcall) { 1360 1361 // Handle special safepoint nodes for synchronization 1362 if (!is_mcall) { 1363 MachSafePointNode *sfn = mach->as_MachSafePoint(); 1364 // !!!!! Stubs only need an oopmap right now, so bail out 1365 if (sfn->jvms()->method() == NULL) { 1366 // Write the oopmap directly to the code blob??!! 1367# ifdef ENABLE_ZAP_DEAD_LOCALS 1368 assert( !is_node_getting_a_safepoint(sfn), "logic does not match; false positive"); 1369# endif 1370 continue; 1371 } 1372 } // End synchronization 1373 1374 non_safepoints.observe_safepoint(mach->as_MachSafePoint()->jvms(), 1375 current_offset); 1376 Process_OopMap_Node(mach, current_offset); 1377 } // End if safepoint 1378 1379 // If this is a null check, then add the start of the previous instruction to the list 1380 else if( mach->is_MachNullCheck() ) { 1381 inct_starts[inct_cnt++] = previous_offset; 1382 } 1383 1384 // If this is a branch, then fill in the label with the target BB's label 1385 else if (mach->is_MachBranch()) { 1386 // This requires the TRUE branch target be in succs[0] 1387 uint block_num = block->non_connector_successor(0)->_pre_order; 1388 1389 // Try to replace long branch if delay slot is not used, 1390 // it is mostly for back branches since forward branch's 1391 // distance is not updated yet. 1392 bool delay_slot_is_used = valid_bundle_info(n) && 1393 node_bundling(n)->use_unconditional_delay(); 1394 if (!delay_slot_is_used && mach->may_be_short_branch()) { 1395 assert(delay_slot == NULL, "not expecting delay slot node"); 1396 int br_size = n->size(_regalloc); 1397 int offset = blk_starts[block_num] - current_offset; 1398 if (block_num >= i) { 1399 // Current and following block's offset are not 1400 // finalized yet, adjust distance by the difference 1401 // between calculated and final offsets of current block. 1402 offset -= (blk_starts[i] - blk_offset); 1403 } 1404 // In the following code a nop could be inserted before 1405 // the branch which will increase the backward distance. 1406 bool needs_padding = (current_offset == last_avoid_back_to_back_offset); 1407 if (needs_padding && offset <= 0) 1408 offset -= nop_size; 1409 1410 if (_matcher->is_short_branch_offset(mach->rule(), br_size, offset)) { 1411 // We've got a winner. Replace this branch. 1412 MachNode* replacement = mach->as_MachBranch()->short_branch_version(this); 1413 1414 // Update the jmp_size. 1415 int new_size = replacement->size(_regalloc); 1416 assert((br_size - new_size) >= (int)nop_size, "short_branch size should be smaller"); 1417 // Insert padding between avoid_back_to_back branches. 1418 if (needs_padding && replacement->avoid_back_to_back(MachNode::AVOID_BEFORE)) { 1419 MachNode *nop = new MachNopNode(); 1420 block->insert_node(nop, j++); 1421 _cfg->map_node_to_block(nop, block); 1422 last_inst++; 1423 nop->emit(*cb, _regalloc); 1424 cb->flush_bundle(true); 1425 current_offset = cb->insts_size(); 1426 } 1427#ifdef ASSERT 1428 jmp_target[i] = block_num; 1429 jmp_offset[i] = current_offset - blk_offset; 1430 jmp_size[i] = new_size; 1431 jmp_rule[i] = mach->rule(); 1432#endif 1433 block->map_node(replacement, j); 1434 mach->subsume_by(replacement, C); 1435 n = replacement; 1436 mach = replacement; 1437 } 1438 } 1439 mach->as_MachBranch()->label_set( &blk_labels[block_num], block_num ); 1440 } else if (mach->ideal_Opcode() == Op_Jump) { 1441 for (uint h = 0; h < block->_num_succs; h++) { 1442 Block* succs_block = block->_succs[h]; 1443 for (uint j = 1; j < succs_block->num_preds(); j++) { 1444 Node* jpn = succs_block->pred(j); 1445 if (jpn->is_JumpProj() && jpn->in(0) == mach) { 1446 uint block_num = succs_block->non_connector()->_pre_order; 1447 Label *blkLabel = &blk_labels[block_num]; 1448 mach->add_case_label(jpn->as_JumpProj()->proj_no(), blkLabel); 1449 } 1450 } 1451 } 1452 } 1453#ifdef ASSERT 1454 // Check that oop-store precedes the card-mark 1455 else if (mach->ideal_Opcode() == Op_StoreCM) { 1456 uint storeCM_idx = j; 1457 int count = 0; 1458 for (uint prec = mach->req(); prec < mach->len(); prec++) { 1459 Node *oop_store = mach->in(prec); // Precedence edge 1460 if (oop_store == NULL) continue; 1461 count++; 1462 uint i4; 1463 for (i4 = 0; i4 < last_inst; ++i4) { 1464 if (block->get_node(i4) == oop_store) { 1465 break; 1466 } 1467 } 1468 // Note: This test can provide a false failure if other precedence 1469 // edges have been added to the storeCMNode. 1470 assert(i4 == last_inst || i4 < storeCM_idx, "CM card-mark executes before oop-store"); 1471 } 1472 assert(count > 0, "storeCM expects at least one precedence edge"); 1473 } 1474#endif 1475 else if (!n->is_Proj()) { 1476 // Remember the beginning of the previous instruction, in case 1477 // it's followed by a flag-kill and a null-check. Happens on 1478 // Intel all the time, with add-to-memory kind of opcodes. 1479 previous_offset = current_offset; 1480 } 1481 1482 // Not an else-if! 1483 // If this is a trap based cmp then add its offset to the list. 1484 if (mach->is_TrapBasedCheckNode()) { 1485 inct_starts[inct_cnt++] = current_offset; 1486 } 1487 } 1488 1489 // Verify that there is sufficient space remaining 1490 cb->insts()->maybe_expand_to_ensure_remaining(MAX_inst_size); 1491 if ((cb->blob() == NULL) || (!CompileBroker::should_compile_new_jobs())) { 1492 C->record_failure("CodeCache is full"); 1493 CompileBroker::handle_full_code_cache(); 1494 return; 1495 } 1496 1497 // Save the offset for the listing 1498#ifndef PRODUCT 1499 if (node_offsets && n->_idx < node_offset_limit) 1500 node_offsets[n->_idx] = cb->insts_size(); 1501#endif 1502 1503 // "Normal" instruction case 1504 DEBUG_ONLY( uint instr_offset = cb->insts_size(); ) 1505 n->emit(*cb, _regalloc); 1506 current_offset = cb->insts_size(); 1507 1508#ifdef ASSERT 1509 if (n->size(_regalloc) < (current_offset-instr_offset)) { 1510 n->dump(); 1511 assert(false, "wrong size of mach node"); 1512 } 1513#endif 1514 non_safepoints.observe_instruction(n, current_offset); 1515 1516 // mcall is last "call" that can be a safepoint 1517 // record it so we can see if a poll will directly follow it 1518 // in which case we'll need a pad to make the PcDesc sites unique 1519 // see 5010568. This can be slightly inaccurate but conservative 1520 // in the case that return address is not actually at current_offset. 1521 // This is a small price to pay. 1522 1523 if (is_mcall) { 1524 last_call_offset = current_offset; 1525 } 1526 1527 if (n->is_Mach() && n->as_Mach()->avoid_back_to_back(MachNode::AVOID_AFTER)) { 1528 // Avoid back to back some instructions. 1529 last_avoid_back_to_back_offset = current_offset; 1530 } 1531 1532 // See if this instruction has a delay slot 1533 if (valid_bundle_info(n) && node_bundling(n)->use_unconditional_delay()) { 1534 assert(delay_slot != NULL, "expecting delay slot node"); 1535 1536 // Back up 1 instruction 1537 cb->set_insts_end(cb->insts_end() - Pipeline::instr_unit_size()); 1538 1539 // Save the offset for the listing 1540#ifndef PRODUCT 1541 if (node_offsets && delay_slot->_idx < node_offset_limit) 1542 node_offsets[delay_slot->_idx] = cb->insts_size(); 1543#endif 1544 1545 // Support a SafePoint in the delay slot 1546 if (delay_slot->is_MachSafePoint()) { 1547 MachNode *mach = delay_slot->as_Mach(); 1548 // !!!!! Stubs only need an oopmap right now, so bail out 1549 if (!mach->is_MachCall() && mach->as_MachSafePoint()->jvms()->method() == NULL) { 1550 // Write the oopmap directly to the code blob??!! 1551# ifdef ENABLE_ZAP_DEAD_LOCALS 1552 assert( !is_node_getting_a_safepoint(mach), "logic does not match; false positive"); 1553# endif 1554 delay_slot = NULL; 1555 continue; 1556 } 1557 1558 int adjusted_offset = current_offset - Pipeline::instr_unit_size(); 1559 non_safepoints.observe_safepoint(mach->as_MachSafePoint()->jvms(), 1560 adjusted_offset); 1561 // Generate an OopMap entry 1562 Process_OopMap_Node(mach, adjusted_offset); 1563 } 1564 1565 // Insert the delay slot instruction 1566 delay_slot->emit(*cb, _regalloc); 1567 1568 // Don't reuse it 1569 delay_slot = NULL; 1570 } 1571 1572 } // End for all instructions in block 1573 1574 // If the next block is the top of a loop, pad this block out to align 1575 // the loop top a little. Helps prevent pipe stalls at loop back branches. 1576 if (i < nblocks-1) { 1577 Block *nb = _cfg->get_block(i + 1); 1578 int padding = nb->alignment_padding(current_offset); 1579 if( padding > 0 ) { 1580 MachNode *nop = new MachNopNode(padding / nop_size); 1581 block->insert_node(nop, block->number_of_nodes()); 1582 _cfg->map_node_to_block(nop, block); 1583 nop->emit(*cb, _regalloc); 1584 current_offset = cb->insts_size(); 1585 } 1586 } 1587 // Verify that the distance for generated before forward 1588 // short branches is still valid. 1589 guarantee((int)(blk_starts[i+1] - blk_starts[i]) >= (current_offset - blk_offset), "shouldn't increase block size"); 1590 1591 // Save new block start offset 1592 blk_starts[i] = blk_offset; 1593 } // End of for all blocks 1594 blk_starts[nblocks] = current_offset; 1595 1596 non_safepoints.flush_at_end(); 1597 1598 // Offset too large? 1599 if (failing()) return; 1600 1601 // Define a pseudo-label at the end of the code 1602 MacroAssembler(cb).bind( blk_labels[nblocks] ); 1603 1604 // Compute the size of the first block 1605 _first_block_size = blk_labels[1].loc_pos() - blk_labels[0].loc_pos(); 1606 1607 assert(cb->insts_size() < 500000, "method is unreasonably large"); 1608 1609#ifdef ASSERT 1610 for (uint i = 0; i < nblocks; i++) { // For all blocks 1611 if (jmp_target[i] != 0) { 1612 int br_size = jmp_size[i]; 1613 int offset = blk_starts[jmp_target[i]]-(blk_starts[i] + jmp_offset[i]); 1614 if (!_matcher->is_short_branch_offset(jmp_rule[i], br_size, offset)) { 1615 tty->print_cr("target (%d) - jmp_offset(%d) = offset (%d), jump_size(%d), jmp_block B%d, target_block B%d", blk_starts[jmp_target[i]], blk_starts[i] + jmp_offset[i], offset, br_size, i, jmp_target[i]); 1616 assert(false, "Displacement too large for short jmp"); 1617 } 1618 } 1619 } 1620#endif 1621 1622#ifndef PRODUCT 1623 // Information on the size of the method, without the extraneous code 1624 Scheduling::increment_method_size(cb->insts_size()); 1625#endif 1626 1627 // ------------------ 1628 // Fill in exception table entries. 1629 FillExceptionTables(inct_cnt, call_returns, inct_starts, blk_labels); 1630 1631 // Only java methods have exception handlers and deopt handlers 1632 // class HandlerImpl is platform-specific and defined in the *.ad files. 1633 if (_method) { 1634 // Emit the exception handler code. 1635 _code_offsets.set_value(CodeOffsets::Exceptions, HandlerImpl::emit_exception_handler(*cb)); 1636 // Emit the deopt handler code. 1637 _code_offsets.set_value(CodeOffsets::Deopt, HandlerImpl::emit_deopt_handler(*cb)); 1638 1639 // Emit the MethodHandle deopt handler code (if required). 1640 if (has_method_handle_invokes()) { 1641 // We can use the same code as for the normal deopt handler, we 1642 // just need a different entry point address. 1643 _code_offsets.set_value(CodeOffsets::DeoptMH, HandlerImpl::emit_deopt_handler(*cb)); 1644 } 1645 } 1646 1647 // One last check for failed CodeBuffer::expand: 1648 if ((cb->blob() == NULL) || (!CompileBroker::should_compile_new_jobs())) { 1649 C->record_failure("CodeCache is full"); 1650 CompileBroker::handle_full_code_cache(); 1651 return; 1652 } 1653 1654#ifndef PRODUCT 1655 // Dump the assembly code, including basic-block numbers 1656 if (print_assembly()) { 1657 ttyLocker ttyl; // keep the following output all in one block 1658 if (!VMThread::should_terminate()) { // test this under the tty lock 1659 // This output goes directly to the tty, not the compiler log. 1660 // To enable tools to match it up with the compilation activity, 1661 // be sure to tag this tty output with the compile ID. 1662 if (xtty != NULL) { 1663 xtty->head("opto_assembly compile_id='%d'%s", compile_id(), 1664 is_osr_compilation() ? " compile_kind='osr'" : 1665 ""); 1666 } 1667 if (method() != NULL) { 1668 method()->print_metadata(); 1669 } 1670 dump_asm(node_offsets, node_offset_limit); 1671 if (xtty != NULL) { 1672 xtty->tail("opto_assembly"); 1673 } 1674 } 1675 } 1676#endif 1677 1678} 1679 1680void Compile::FillExceptionTables(uint cnt, uint *call_returns, uint *inct_starts, Label *blk_labels) { 1681 _inc_table.set_size(cnt); 1682 1683 uint inct_cnt = 0; 1684 for (uint i = 0; i < _cfg->number_of_blocks(); i++) { 1685 Block* block = _cfg->get_block(i); 1686 Node *n = NULL; 1687 int j; 1688 1689 // Find the branch; ignore trailing NOPs. 1690 for (j = block->number_of_nodes() - 1; j >= 0; j--) { 1691 n = block->get_node(j); 1692 if (!n->is_Mach() || n->as_Mach()->ideal_Opcode() != Op_Con) { 1693 break; 1694 } 1695 } 1696 1697 // If we didn't find anything, continue 1698 if (j < 0) { 1699 continue; 1700 } 1701 1702 // Compute ExceptionHandlerTable subtable entry and add it 1703 // (skip empty blocks) 1704 if (n->is_Catch()) { 1705 1706 // Get the offset of the return from the call 1707 uint call_return = call_returns[block->_pre_order]; 1708#ifdef ASSERT 1709 assert( call_return > 0, "no call seen for this basic block" ); 1710 while (block->get_node(--j)->is_MachProj()) ; 1711 assert(block->get_node(j)->is_MachCall(), "CatchProj must follow call"); 1712#endif 1713 // last instruction is a CatchNode, find it's CatchProjNodes 1714 int nof_succs = block->_num_succs; 1715 // allocate space 1716 GrowableArray<intptr_t> handler_bcis(nof_succs); 1717 GrowableArray<intptr_t> handler_pcos(nof_succs); 1718 // iterate through all successors 1719 for (int j = 0; j < nof_succs; j++) { 1720 Block* s = block->_succs[j]; 1721 bool found_p = false; 1722 for (uint k = 1; k < s->num_preds(); k++) { 1723 Node* pk = s->pred(k); 1724 if (pk->is_CatchProj() && pk->in(0) == n) { 1725 const CatchProjNode* p = pk->as_CatchProj(); 1726 found_p = true; 1727 // add the corresponding handler bci & pco information 1728 if (p->_con != CatchProjNode::fall_through_index) { 1729 // p leads to an exception handler (and is not fall through) 1730 assert(s == _cfg->get_block(s->_pre_order), "bad numbering"); 1731 // no duplicates, please 1732 if (!handler_bcis.contains(p->handler_bci())) { 1733 uint block_num = s->non_connector()->_pre_order; 1734 handler_bcis.append(p->handler_bci()); 1735 handler_pcos.append(blk_labels[block_num].loc_pos()); 1736 } 1737 } 1738 } 1739 } 1740 assert(found_p, "no matching predecessor found"); 1741 // Note: Due to empty block removal, one block may have 1742 // several CatchProj inputs, from the same Catch. 1743 } 1744 1745 // Set the offset of the return from the call 1746 _handler_table.add_subtable(call_return, &handler_bcis, NULL, &handler_pcos); 1747 continue; 1748 } 1749 1750 // Handle implicit null exception table updates 1751 if (n->is_MachNullCheck()) { 1752 uint block_num = block->non_connector_successor(0)->_pre_order; 1753 _inc_table.append(inct_starts[inct_cnt++], blk_labels[block_num].loc_pos()); 1754 continue; 1755 } 1756 // Handle implicit exception table updates: trap instructions. 1757 if (n->is_Mach() && n->as_Mach()->is_TrapBasedCheckNode()) { 1758 uint block_num = block->non_connector_successor(0)->_pre_order; 1759 _inc_table.append(inct_starts[inct_cnt++], blk_labels[block_num].loc_pos()); 1760 continue; 1761 } 1762 } // End of for all blocks fill in exception table entries 1763} 1764 1765// Static Variables 1766#ifndef PRODUCT 1767uint Scheduling::_total_nop_size = 0; 1768uint Scheduling::_total_method_size = 0; 1769uint Scheduling::_total_branches = 0; 1770uint Scheduling::_total_unconditional_delays = 0; 1771uint Scheduling::_total_instructions_per_bundle[Pipeline::_max_instrs_per_cycle+1]; 1772#endif 1773 1774// Initializer for class Scheduling 1775 1776Scheduling::Scheduling(Arena *arena, Compile &compile) 1777 : _arena(arena), 1778 _cfg(compile.cfg()), 1779 _regalloc(compile.regalloc()), 1780 _reg_node(arena), 1781 _bundle_instr_count(0), 1782 _bundle_cycle_number(0), 1783 _scheduled(arena), 1784 _available(arena), 1785 _next_node(NULL), 1786 _bundle_use(0, 0, resource_count, &_bundle_use_elements[0]), 1787 _pinch_free_list(arena) 1788#ifndef PRODUCT 1789 , _branches(0) 1790 , _unconditional_delays(0) 1791#endif 1792{ 1793 // Create a MachNopNode 1794 _nop = new MachNopNode(); 1795 1796 // Now that the nops are in the array, save the count 1797 // (but allow entries for the nops) 1798 _node_bundling_limit = compile.unique(); 1799 uint node_max = _regalloc->node_regs_max_index(); 1800 1801 compile.set_node_bundling_limit(_node_bundling_limit); 1802 1803 // This one is persistent within the Compile class 1804 _node_bundling_base = NEW_ARENA_ARRAY(compile.comp_arena(), Bundle, node_max); 1805 1806 // Allocate space for fixed-size arrays 1807 _node_latency = NEW_ARENA_ARRAY(arena, unsigned short, node_max); 1808 _uses = NEW_ARENA_ARRAY(arena, short, node_max); 1809 _current_latency = NEW_ARENA_ARRAY(arena, unsigned short, node_max); 1810 1811 // Clear the arrays 1812 memset(_node_bundling_base, 0, node_max * sizeof(Bundle)); 1813 memset(_node_latency, 0, node_max * sizeof(unsigned short)); 1814 memset(_uses, 0, node_max * sizeof(short)); 1815 memset(_current_latency, 0, node_max * sizeof(unsigned short)); 1816 1817 // Clear the bundling information 1818 memcpy(_bundle_use_elements, Pipeline_Use::elaborated_elements, sizeof(Pipeline_Use::elaborated_elements)); 1819 1820 // Get the last node 1821 Block* block = _cfg->get_block(_cfg->number_of_blocks() - 1); 1822 1823 _next_node = block->get_node(block->number_of_nodes() - 1); 1824} 1825 1826#ifndef PRODUCT 1827// Scheduling destructor 1828Scheduling::~Scheduling() { 1829 _total_branches += _branches; 1830 _total_unconditional_delays += _unconditional_delays; 1831} 1832#endif 1833 1834// Step ahead "i" cycles 1835void Scheduling::step(uint i) { 1836 1837 Bundle *bundle = node_bundling(_next_node); 1838 bundle->set_starts_bundle(); 1839 1840 // Update the bundle record, but leave the flags information alone 1841 if (_bundle_instr_count > 0) { 1842 bundle->set_instr_count(_bundle_instr_count); 1843 bundle->set_resources_used(_bundle_use.resourcesUsed()); 1844 } 1845 1846 // Update the state information 1847 _bundle_instr_count = 0; 1848 _bundle_cycle_number += i; 1849 _bundle_use.step(i); 1850} 1851 1852void Scheduling::step_and_clear() { 1853 Bundle *bundle = node_bundling(_next_node); 1854 bundle->set_starts_bundle(); 1855 1856 // Update the bundle record 1857 if (_bundle_instr_count > 0) { 1858 bundle->set_instr_count(_bundle_instr_count); 1859 bundle->set_resources_used(_bundle_use.resourcesUsed()); 1860 1861 _bundle_cycle_number += 1; 1862 } 1863 1864 // Clear the bundling information 1865 _bundle_instr_count = 0; 1866 _bundle_use.reset(); 1867 1868 memcpy(_bundle_use_elements, 1869 Pipeline_Use::elaborated_elements, 1870 sizeof(Pipeline_Use::elaborated_elements)); 1871} 1872 1873// Perform instruction scheduling and bundling over the sequence of 1874// instructions in backwards order. 1875void Compile::ScheduleAndBundle() { 1876 1877 // Don't optimize this if it isn't a method 1878 if (!_method) 1879 return; 1880 1881 // Don't optimize this if scheduling is disabled 1882 if (!do_scheduling()) 1883 return; 1884 1885 // Scheduling code works only with pairs (8 bytes) maximum. 1886 if (max_vector_size() > 8) 1887 return; 1888 1889 NOT_PRODUCT( TracePhase t2("isched", &_t_instrSched, TimeCompiler); ) 1890 1891 // Create a data structure for all the scheduling information 1892 Scheduling scheduling(Thread::current()->resource_area(), *this); 1893 1894 // Walk backwards over each basic block, computing the needed alignment 1895 // Walk over all the basic blocks 1896 scheduling.DoScheduling(); 1897} 1898 1899// Compute the latency of all the instructions. This is fairly simple, 1900// because we already have a legal ordering. Walk over the instructions 1901// from first to last, and compute the latency of the instruction based 1902// on the latency of the preceding instruction(s). 1903void Scheduling::ComputeLocalLatenciesForward(const Block *bb) { 1904#ifndef PRODUCT 1905 if (_cfg->C->trace_opto_output()) 1906 tty->print("# -> ComputeLocalLatenciesForward\n"); 1907#endif 1908 1909 // Walk over all the schedulable instructions 1910 for( uint j=_bb_start; j < _bb_end; j++ ) { 1911 1912 // This is a kludge, forcing all latency calculations to start at 1. 1913 // Used to allow latency 0 to force an instruction to the beginning 1914 // of the bb 1915 uint latency = 1; 1916 Node *use = bb->get_node(j); 1917 uint nlen = use->len(); 1918 1919 // Walk over all the inputs 1920 for ( uint k=0; k < nlen; k++ ) { 1921 Node *def = use->in(k); 1922 if (!def) 1923 continue; 1924 1925 uint l = _node_latency[def->_idx] + use->latency(k); 1926 if (latency < l) 1927 latency = l; 1928 } 1929 1930 _node_latency[use->_idx] = latency; 1931 1932#ifndef PRODUCT 1933 if (_cfg->C->trace_opto_output()) { 1934 tty->print("# latency %4d: ", latency); 1935 use->dump(); 1936 } 1937#endif 1938 } 1939 1940#ifndef PRODUCT 1941 if (_cfg->C->trace_opto_output()) 1942 tty->print("# <- ComputeLocalLatenciesForward\n"); 1943#endif 1944 1945} // end ComputeLocalLatenciesForward 1946 1947// See if this node fits into the present instruction bundle 1948bool Scheduling::NodeFitsInBundle(Node *n) { 1949 uint n_idx = n->_idx; 1950 1951 // If this is the unconditional delay instruction, then it fits 1952 if (n == _unconditional_delay_slot) { 1953#ifndef PRODUCT 1954 if (_cfg->C->trace_opto_output()) 1955 tty->print("# NodeFitsInBundle [%4d]: TRUE; is in unconditional delay slot\n", n->_idx); 1956#endif 1957 return (true); 1958 } 1959 1960 // If the node cannot be scheduled this cycle, skip it 1961 if (_current_latency[n_idx] > _bundle_cycle_number) { 1962#ifndef PRODUCT 1963 if (_cfg->C->trace_opto_output()) 1964 tty->print("# NodeFitsInBundle [%4d]: FALSE; latency %4d > %d\n", 1965 n->_idx, _current_latency[n_idx], _bundle_cycle_number); 1966#endif 1967 return (false); 1968 } 1969 1970 const Pipeline *node_pipeline = n->pipeline(); 1971 1972 uint instruction_count = node_pipeline->instructionCount(); 1973 if (node_pipeline->mayHaveNoCode() && n->size(_regalloc) == 0) 1974 instruction_count = 0; 1975 else if (node_pipeline->hasBranchDelay() && !_unconditional_delay_slot) 1976 instruction_count++; 1977 1978 if (_bundle_instr_count + instruction_count > Pipeline::_max_instrs_per_cycle) { 1979#ifndef PRODUCT 1980 if (_cfg->C->trace_opto_output()) 1981 tty->print("# NodeFitsInBundle [%4d]: FALSE; too many instructions: %d > %d\n", 1982 n->_idx, _bundle_instr_count + instruction_count, Pipeline::_max_instrs_per_cycle); 1983#endif 1984 return (false); 1985 } 1986 1987 // Don't allow non-machine nodes to be handled this way 1988 if (!n->is_Mach() && instruction_count == 0) 1989 return (false); 1990 1991 // See if there is any overlap 1992 uint delay = _bundle_use.full_latency(0, node_pipeline->resourceUse()); 1993 1994 if (delay > 0) { 1995#ifndef PRODUCT 1996 if (_cfg->C->trace_opto_output()) 1997 tty->print("# NodeFitsInBundle [%4d]: FALSE; functional units overlap\n", n_idx); 1998#endif 1999 return false; 2000 } 2001 2002#ifndef PRODUCT 2003 if (_cfg->C->trace_opto_output()) 2004 tty->print("# NodeFitsInBundle [%4d]: TRUE\n", n_idx); 2005#endif 2006 2007 return true; 2008} 2009 2010Node * Scheduling::ChooseNodeToBundle() { 2011 uint siz = _available.size(); 2012 2013 if (siz == 0) { 2014 2015#ifndef PRODUCT 2016 if (_cfg->C->trace_opto_output()) 2017 tty->print("# ChooseNodeToBundle: NULL\n"); 2018#endif 2019 return (NULL); 2020 } 2021 2022 // Fast path, if only 1 instruction in the bundle 2023 if (siz == 1) { 2024#ifndef PRODUCT 2025 if (_cfg->C->trace_opto_output()) { 2026 tty->print("# ChooseNodeToBundle (only 1): "); 2027 _available[0]->dump(); 2028 } 2029#endif 2030 return (_available[0]); 2031 } 2032 2033 // Don't bother, if the bundle is already full 2034 if (_bundle_instr_count < Pipeline::_max_instrs_per_cycle) { 2035 for ( uint i = 0; i < siz; i++ ) { 2036 Node *n = _available[i]; 2037 2038 // Skip projections, we'll handle them another way 2039 if (n->is_Proj()) 2040 continue; 2041 2042 // This presupposed that instructions are inserted into the 2043 // available list in a legality order; i.e. instructions that 2044 // must be inserted first are at the head of the list 2045 if (NodeFitsInBundle(n)) { 2046#ifndef PRODUCT 2047 if (_cfg->C->trace_opto_output()) { 2048 tty->print("# ChooseNodeToBundle: "); 2049 n->dump(); 2050 } 2051#endif 2052 return (n); 2053 } 2054 } 2055 } 2056 2057 // Nothing fits in this bundle, choose the highest priority 2058#ifndef PRODUCT 2059 if (_cfg->C->trace_opto_output()) { 2060 tty->print("# ChooseNodeToBundle: "); 2061 _available[0]->dump(); 2062 } 2063#endif 2064 2065 return _available[0]; 2066} 2067 2068void Scheduling::AddNodeToAvailableList(Node *n) { 2069 assert( !n->is_Proj(), "projections never directly made available" ); 2070#ifndef PRODUCT 2071 if (_cfg->C->trace_opto_output()) { 2072 tty->print("# AddNodeToAvailableList: "); 2073 n->dump(); 2074 } 2075#endif 2076 2077 int latency = _current_latency[n->_idx]; 2078 2079 // Insert in latency order (insertion sort) 2080 uint i; 2081 for ( i=0; i < _available.size(); i++ ) 2082 if (_current_latency[_available[i]->_idx] > latency) 2083 break; 2084 2085 // Special Check for compares following branches 2086 if( n->is_Mach() && _scheduled.size() > 0 ) { 2087 int op = n->as_Mach()->ideal_Opcode(); 2088 Node *last = _scheduled[0]; 2089 if( last->is_MachIf() && last->in(1) == n && 2090 ( op == Op_CmpI || 2091 op == Op_CmpU || 2092 op == Op_CmpP || 2093 op == Op_CmpF || 2094 op == Op_CmpD || 2095 op == Op_CmpL ) ) { 2096 2097 // Recalculate position, moving to front of same latency 2098 for ( i=0 ; i < _available.size(); i++ ) 2099 if (_current_latency[_available[i]->_idx] >= latency) 2100 break; 2101 } 2102 } 2103 2104 // Insert the node in the available list 2105 _available.insert(i, n); 2106 2107#ifndef PRODUCT 2108 if (_cfg->C->trace_opto_output()) 2109 dump_available(); 2110#endif 2111} 2112 2113void Scheduling::DecrementUseCounts(Node *n, const Block *bb) { 2114 for ( uint i=0; i < n->len(); i++ ) { 2115 Node *def = n->in(i); 2116 if (!def) continue; 2117 if( def->is_Proj() ) // If this is a machine projection, then 2118 def = def->in(0); // propagate usage thru to the base instruction 2119 2120 if(_cfg->get_block_for_node(def) != bb) { // Ignore if not block-local 2121 continue; 2122 } 2123 2124 // Compute the latency 2125 uint l = _bundle_cycle_number + n->latency(i); 2126 if (_current_latency[def->_idx] < l) 2127 _current_latency[def->_idx] = l; 2128 2129 // If this does not have uses then schedule it 2130 if ((--_uses[def->_idx]) == 0) 2131 AddNodeToAvailableList(def); 2132 } 2133} 2134 2135void Scheduling::AddNodeToBundle(Node *n, const Block *bb) { 2136#ifndef PRODUCT 2137 if (_cfg->C->trace_opto_output()) { 2138 tty->print("# AddNodeToBundle: "); 2139 n->dump(); 2140 } 2141#endif 2142 2143 // Remove this from the available list 2144 uint i; 2145 for (i = 0; i < _available.size(); i++) 2146 if (_available[i] == n) 2147 break; 2148 assert(i < _available.size(), "entry in _available list not found"); 2149 _available.remove(i); 2150 2151 // See if this fits in the current bundle 2152 const Pipeline *node_pipeline = n->pipeline(); 2153 const Pipeline_Use& node_usage = node_pipeline->resourceUse(); 2154 2155 // Check for instructions to be placed in the delay slot. We 2156 // do this before we actually schedule the current instruction, 2157 // because the delay slot follows the current instruction. 2158 if (Pipeline::_branch_has_delay_slot && 2159 node_pipeline->hasBranchDelay() && 2160 !_unconditional_delay_slot) { 2161 2162 uint siz = _available.size(); 2163 2164 // Conditional branches can support an instruction that 2165 // is unconditionally executed and not dependent by the 2166 // branch, OR a conditionally executed instruction if 2167 // the branch is taken. In practice, this means that 2168 // the first instruction at the branch target is 2169 // copied to the delay slot, and the branch goes to 2170 // the instruction after that at the branch target 2171 if ( n->is_MachBranch() ) { 2172 2173 assert( !n->is_MachNullCheck(), "should not look for delay slot for Null Check" ); 2174 assert( !n->is_Catch(), "should not look for delay slot for Catch" ); 2175 2176#ifndef PRODUCT 2177 _branches++; 2178#endif 2179 2180 // At least 1 instruction is on the available list 2181 // that is not dependent on the branch 2182 for (uint i = 0; i < siz; i++) { 2183 Node *d = _available[i]; 2184 const Pipeline *avail_pipeline = d->pipeline(); 2185 2186 // Don't allow safepoints in the branch shadow, that will 2187 // cause a number of difficulties 2188 if ( avail_pipeline->instructionCount() == 1 && 2189 !avail_pipeline->hasMultipleBundles() && 2190 !avail_pipeline->hasBranchDelay() && 2191 Pipeline::instr_has_unit_size() && 2192 d->size(_regalloc) == Pipeline::instr_unit_size() && 2193 NodeFitsInBundle(d) && 2194 !node_bundling(d)->used_in_delay()) { 2195 2196 if (d->is_Mach() && !d->is_MachSafePoint()) { 2197 // A node that fits in the delay slot was found, so we need to 2198 // set the appropriate bits in the bundle pipeline information so 2199 // that it correctly indicates resource usage. Later, when we 2200 // attempt to add this instruction to the bundle, we will skip 2201 // setting the resource usage. 2202 _unconditional_delay_slot = d; 2203 node_bundling(n)->set_use_unconditional_delay(); 2204 node_bundling(d)->set_used_in_unconditional_delay(); 2205 _bundle_use.add_usage(avail_pipeline->resourceUse()); 2206 _current_latency[d->_idx] = _bundle_cycle_number; 2207 _next_node = d; 2208 ++_bundle_instr_count; 2209#ifndef PRODUCT 2210 _unconditional_delays++; 2211#endif 2212 break; 2213 } 2214 } 2215 } 2216 } 2217 2218 // No delay slot, add a nop to the usage 2219 if (!_unconditional_delay_slot) { 2220 // See if adding an instruction in the delay slot will overflow 2221 // the bundle. 2222 if (!NodeFitsInBundle(_nop)) { 2223#ifndef PRODUCT 2224 if (_cfg->C->trace_opto_output()) 2225 tty->print("# *** STEP(1 instruction for delay slot) ***\n"); 2226#endif 2227 step(1); 2228 } 2229 2230 _bundle_use.add_usage(_nop->pipeline()->resourceUse()); 2231 _next_node = _nop; 2232 ++_bundle_instr_count; 2233 } 2234 2235 // See if the instruction in the delay slot requires a 2236 // step of the bundles 2237 if (!NodeFitsInBundle(n)) { 2238#ifndef PRODUCT 2239 if (_cfg->C->trace_opto_output()) 2240 tty->print("# *** STEP(branch won't fit) ***\n"); 2241#endif 2242 // Update the state information 2243 _bundle_instr_count = 0; 2244 _bundle_cycle_number += 1; 2245 _bundle_use.step(1); 2246 } 2247 } 2248 2249 // Get the number of instructions 2250 uint instruction_count = node_pipeline->instructionCount(); 2251 if (node_pipeline->mayHaveNoCode() && n->size(_regalloc) == 0) 2252 instruction_count = 0; 2253 2254 // Compute the latency information 2255 uint delay = 0; 2256 2257 if (instruction_count > 0 || !node_pipeline->mayHaveNoCode()) { 2258 int relative_latency = _current_latency[n->_idx] - _bundle_cycle_number; 2259 if (relative_latency < 0) 2260 relative_latency = 0; 2261 2262 delay = _bundle_use.full_latency(relative_latency, node_usage); 2263 2264 // Does not fit in this bundle, start a new one 2265 if (delay > 0) { 2266 step(delay); 2267 2268#ifndef PRODUCT 2269 if (_cfg->C->trace_opto_output()) 2270 tty->print("# *** STEP(%d) ***\n", delay); 2271#endif 2272 } 2273 } 2274 2275 // If this was placed in the delay slot, ignore it 2276 if (n != _unconditional_delay_slot) { 2277 2278 if (delay == 0) { 2279 if (node_pipeline->hasMultipleBundles()) { 2280#ifndef PRODUCT 2281 if (_cfg->C->trace_opto_output()) 2282 tty->print("# *** STEP(multiple instructions) ***\n"); 2283#endif 2284 step(1); 2285 } 2286 2287 else if (instruction_count + _bundle_instr_count > Pipeline::_max_instrs_per_cycle) { 2288#ifndef PRODUCT 2289 if (_cfg->C->trace_opto_output()) 2290 tty->print("# *** STEP(%d >= %d instructions) ***\n", 2291 instruction_count + _bundle_instr_count, 2292 Pipeline::_max_instrs_per_cycle); 2293#endif 2294 step(1); 2295 } 2296 } 2297 2298 if (node_pipeline->hasBranchDelay() && !_unconditional_delay_slot) 2299 _bundle_instr_count++; 2300 2301 // Set the node's latency 2302 _current_latency[n->_idx] = _bundle_cycle_number; 2303 2304 // Now merge the functional unit information 2305 if (instruction_count > 0 || !node_pipeline->mayHaveNoCode()) 2306 _bundle_use.add_usage(node_usage); 2307 2308 // Increment the number of instructions in this bundle 2309 _bundle_instr_count += instruction_count; 2310 2311 // Remember this node for later 2312 if (n->is_Mach()) 2313 _next_node = n; 2314 } 2315 2316 // It's possible to have a BoxLock in the graph and in the _bbs mapping but 2317 // not in the bb->_nodes array. This happens for debug-info-only BoxLocks. 2318 // 'Schedule' them (basically ignore in the schedule) but do not insert them 2319 // into the block. All other scheduled nodes get put in the schedule here. 2320 int op = n->Opcode(); 2321 if( (op == Op_Node && n->req() == 0) || // anti-dependence node OR 2322 (op != Op_Node && // Not an unused antidepedence node and 2323 // not an unallocated boxlock 2324 (OptoReg::is_valid(_regalloc->get_reg_first(n)) || op != Op_BoxLock)) ) { 2325 2326 // Push any trailing projections 2327 if( bb->get_node(bb->number_of_nodes()-1) != n ) { 2328 for (DUIterator_Fast imax, i = n->fast_outs(imax); i < imax; i++) { 2329 Node *foi = n->fast_out(i); 2330 if( foi->is_Proj() ) 2331 _scheduled.push(foi); 2332 } 2333 } 2334 2335 // Put the instruction in the schedule list 2336 _scheduled.push(n); 2337 } 2338 2339#ifndef PRODUCT 2340 if (_cfg->C->trace_opto_output()) 2341 dump_available(); 2342#endif 2343 2344 // Walk all the definitions, decrementing use counts, and 2345 // if a definition has a 0 use count, place it in the available list. 2346 DecrementUseCounts(n,bb); 2347} 2348 2349// This method sets the use count within a basic block. We will ignore all 2350// uses outside the current basic block. As we are doing a backwards walk, 2351// any node we reach that has a use count of 0 may be scheduled. This also 2352// avoids the problem of cyclic references from phi nodes, as long as phi 2353// nodes are at the front of the basic block. This method also initializes 2354// the available list to the set of instructions that have no uses within this 2355// basic block. 2356void Scheduling::ComputeUseCount(const Block *bb) { 2357#ifndef PRODUCT 2358 if (_cfg->C->trace_opto_output()) 2359 tty->print("# -> ComputeUseCount\n"); 2360#endif 2361 2362 // Clear the list of available and scheduled instructions, just in case 2363 _available.clear(); 2364 _scheduled.clear(); 2365 2366 // No delay slot specified 2367 _unconditional_delay_slot = NULL; 2368 2369#ifdef ASSERT 2370 for( uint i=0; i < bb->number_of_nodes(); i++ ) 2371 assert( _uses[bb->get_node(i)->_idx] == 0, "_use array not clean" ); 2372#endif 2373 2374 // Force the _uses count to never go to zero for unscheduable pieces 2375 // of the block 2376 for( uint k = 0; k < _bb_start; k++ ) 2377 _uses[bb->get_node(k)->_idx] = 1; 2378 for( uint l = _bb_end; l < bb->number_of_nodes(); l++ ) 2379 _uses[bb->get_node(l)->_idx] = 1; 2380 2381 // Iterate backwards over the instructions in the block. Don't count the 2382 // branch projections at end or the block header instructions. 2383 for( uint j = _bb_end-1; j >= _bb_start; j-- ) { 2384 Node *n = bb->get_node(j); 2385 if( n->is_Proj() ) continue; // Projections handled another way 2386 2387 // Account for all uses 2388 for ( uint k = 0; k < n->len(); k++ ) { 2389 Node *inp = n->in(k); 2390 if (!inp) continue; 2391 assert(inp != n, "no cycles allowed" ); 2392 if (_cfg->get_block_for_node(inp) == bb) { // Block-local use? 2393 if (inp->is_Proj()) { // Skip through Proj's 2394 inp = inp->in(0); 2395 } 2396 ++_uses[inp->_idx]; // Count 1 block-local use 2397 } 2398 } 2399 2400 // If this instruction has a 0 use count, then it is available 2401 if (!_uses[n->_idx]) { 2402 _current_latency[n->_idx] = _bundle_cycle_number; 2403 AddNodeToAvailableList(n); 2404 } 2405 2406#ifndef PRODUCT 2407 if (_cfg->C->trace_opto_output()) { 2408 tty->print("# uses: %3d: ", _uses[n->_idx]); 2409 n->dump(); 2410 } 2411#endif 2412 } 2413 2414#ifndef PRODUCT 2415 if (_cfg->C->trace_opto_output()) 2416 tty->print("# <- ComputeUseCount\n"); 2417#endif 2418} 2419 2420// This routine performs scheduling on each basic block in reverse order, 2421// using instruction latencies and taking into account function unit 2422// availability. 2423void Scheduling::DoScheduling() { 2424#ifndef PRODUCT 2425 if (_cfg->C->trace_opto_output()) 2426 tty->print("# -> DoScheduling\n"); 2427#endif 2428 2429 Block *succ_bb = NULL; 2430 Block *bb; 2431 2432 // Walk over all the basic blocks in reverse order 2433 for (int i = _cfg->number_of_blocks() - 1; i >= 0; succ_bb = bb, i--) { 2434 bb = _cfg->get_block(i); 2435 2436#ifndef PRODUCT 2437 if (_cfg->C->trace_opto_output()) { 2438 tty->print("# Schedule BB#%03d (initial)\n", i); 2439 for (uint j = 0; j < bb->number_of_nodes(); j++) { 2440 bb->get_node(j)->dump(); 2441 } 2442 } 2443#endif 2444 2445 // On the head node, skip processing 2446 if (bb == _cfg->get_root_block()) { 2447 continue; 2448 } 2449 2450 // Skip empty, connector blocks 2451 if (bb->is_connector()) 2452 continue; 2453 2454 // If the following block is not the sole successor of 2455 // this one, then reset the pipeline information 2456 if (bb->_num_succs != 1 || bb->non_connector_successor(0) != succ_bb) { 2457#ifndef PRODUCT 2458 if (_cfg->C->trace_opto_output()) { 2459 tty->print("*** bundle start of next BB, node %d, for %d instructions\n", 2460 _next_node->_idx, _bundle_instr_count); 2461 } 2462#endif 2463 step_and_clear(); 2464 } 2465 2466 // Leave untouched the starting instruction, any Phis, a CreateEx node 2467 // or Top. bb->get_node(_bb_start) is the first schedulable instruction. 2468 _bb_end = bb->number_of_nodes()-1; 2469 for( _bb_start=1; _bb_start <= _bb_end; _bb_start++ ) { 2470 Node *n = bb->get_node(_bb_start); 2471 // Things not matched, like Phinodes and ProjNodes don't get scheduled. 2472 // Also, MachIdealNodes do not get scheduled 2473 if( !n->is_Mach() ) continue; // Skip non-machine nodes 2474 MachNode *mach = n->as_Mach(); 2475 int iop = mach->ideal_Opcode(); 2476 if( iop == Op_CreateEx ) continue; // CreateEx is pinned 2477 if( iop == Op_Con ) continue; // Do not schedule Top 2478 if( iop == Op_Node && // Do not schedule PhiNodes, ProjNodes 2479 mach->pipeline() == MachNode::pipeline_class() && 2480 !n->is_SpillCopy() ) // Breakpoints, Prolog, etc 2481 continue; 2482 break; // Funny loop structure to be sure... 2483 } 2484 // Compute last "interesting" instruction in block - last instruction we 2485 // might schedule. _bb_end points just after last schedulable inst. We 2486 // normally schedule conditional branches (despite them being forced last 2487 // in the block), because they have delay slots we can fill. Calls all 2488 // have their delay slots filled in the template expansions, so we don't 2489 // bother scheduling them. 2490 Node *last = bb->get_node(_bb_end); 2491 // Ignore trailing NOPs. 2492 while (_bb_end > 0 && last->is_Mach() && 2493 last->as_Mach()->ideal_Opcode() == Op_Con) { 2494 last = bb->get_node(--_bb_end); 2495 } 2496 assert(!last->is_Mach() || last->as_Mach()->ideal_Opcode() != Op_Con, ""); 2497 if( last->is_Catch() || 2498 // Exclude unreachable path case when Halt node is in a separate block. 2499 (_bb_end > 1 && last->is_Mach() && last->as_Mach()->ideal_Opcode() == Op_Halt) ) { 2500 // There must be a prior call. Skip it. 2501 while( !bb->get_node(--_bb_end)->is_MachCall() ) { 2502 assert( bb->get_node(_bb_end)->is_MachProj(), "skipping projections after expected call" ); 2503 } 2504 } else if( last->is_MachNullCheck() ) { 2505 // Backup so the last null-checked memory instruction is 2506 // outside the schedulable range. Skip over the nullcheck, 2507 // projection, and the memory nodes. 2508 Node *mem = last->in(1); 2509 do { 2510 _bb_end--; 2511 } while (mem != bb->get_node(_bb_end)); 2512 } else { 2513 // Set _bb_end to point after last schedulable inst. 2514 _bb_end++; 2515 } 2516 2517 assert( _bb_start <= _bb_end, "inverted block ends" ); 2518 2519 // Compute the register antidependencies for the basic block 2520 ComputeRegisterAntidependencies(bb); 2521 if (_cfg->C->failing()) return; // too many D-U pinch points 2522 2523 // Compute intra-bb latencies for the nodes 2524 ComputeLocalLatenciesForward(bb); 2525 2526 // Compute the usage within the block, and set the list of all nodes 2527 // in the block that have no uses within the block. 2528 ComputeUseCount(bb); 2529 2530 // Schedule the remaining instructions in the block 2531 while ( _available.size() > 0 ) { 2532 Node *n = ChooseNodeToBundle(); 2533 guarantee(n != NULL, "no nodes available"); 2534 AddNodeToBundle(n,bb); 2535 } 2536 2537 assert( _scheduled.size() == _bb_end - _bb_start, "wrong number of instructions" ); 2538#ifdef ASSERT 2539 for( uint l = _bb_start; l < _bb_end; l++ ) { 2540 Node *n = bb->get_node(l); 2541 uint m; 2542 for( m = 0; m < _bb_end-_bb_start; m++ ) 2543 if( _scheduled[m] == n ) 2544 break; 2545 assert( m < _bb_end-_bb_start, "instruction missing in schedule" ); 2546 } 2547#endif 2548 2549 // Now copy the instructions (in reverse order) back to the block 2550 for ( uint k = _bb_start; k < _bb_end; k++ ) 2551 bb->map_node(_scheduled[_bb_end-k-1], k); 2552 2553#ifndef PRODUCT 2554 if (_cfg->C->trace_opto_output()) { 2555 tty->print("# Schedule BB#%03d (final)\n", i); 2556 uint current = 0; 2557 for (uint j = 0; j < bb->number_of_nodes(); j++) { 2558 Node *n = bb->get_node(j); 2559 if( valid_bundle_info(n) ) { 2560 Bundle *bundle = node_bundling(n); 2561 if (bundle->instr_count() > 0 || bundle->flags() > 0) { 2562 tty->print("*** Bundle: "); 2563 bundle->dump(); 2564 } 2565 n->dump(); 2566 } 2567 } 2568 } 2569#endif 2570#ifdef ASSERT 2571 verify_good_schedule(bb,"after block local scheduling"); 2572#endif 2573 } 2574 2575#ifndef PRODUCT 2576 if (_cfg->C->trace_opto_output()) 2577 tty->print("# <- DoScheduling\n"); 2578#endif 2579 2580 // Record final node-bundling array location 2581 _regalloc->C->set_node_bundling_base(_node_bundling_base); 2582 2583} // end DoScheduling 2584 2585// Verify that no live-range used in the block is killed in the block by a 2586// wrong DEF. This doesn't verify live-ranges that span blocks. 2587 2588// Check for edge existence. Used to avoid adding redundant precedence edges. 2589static bool edge_from_to( Node *from, Node *to ) { 2590 for( uint i=0; i<from->len(); i++ ) 2591 if( from->in(i) == to ) 2592 return true; 2593 return false; 2594} 2595 2596#ifdef ASSERT 2597void Scheduling::verify_do_def( Node *n, OptoReg::Name def, const char *msg ) { 2598 // Check for bad kills 2599 if( OptoReg::is_valid(def) ) { // Ignore stores & control flow 2600 Node *prior_use = _reg_node[def]; 2601 if( prior_use && !edge_from_to(prior_use,n) ) { 2602 tty->print("%s = ",OptoReg::as_VMReg(def)->name()); 2603 n->dump(); 2604 tty->print_cr("..."); 2605 prior_use->dump(); 2606 assert(edge_from_to(prior_use,n),msg); 2607 } 2608 _reg_node.map(def,NULL); // Kill live USEs 2609 } 2610} 2611 2612void Scheduling::verify_good_schedule( Block *b, const char *msg ) { 2613 2614 // Zap to something reasonable for the verify code 2615 _reg_node.clear(); 2616 2617 // Walk over the block backwards. Check to make sure each DEF doesn't 2618 // kill a live value (other than the one it's supposed to). Add each 2619 // USE to the live set. 2620 for( uint i = b->number_of_nodes()-1; i >= _bb_start; i-- ) { 2621 Node *n = b->get_node(i); 2622 int n_op = n->Opcode(); 2623 if( n_op == Op_MachProj && n->ideal_reg() == MachProjNode::fat_proj ) { 2624 // Fat-proj kills a slew of registers 2625 RegMask rm = n->out_RegMask();// Make local copy 2626 while( rm.is_NotEmpty() ) { 2627 OptoReg::Name kill = rm.find_first_elem(); 2628 rm.Remove(kill); 2629 verify_do_def( n, kill, msg ); 2630 } 2631 } else if( n_op != Op_Node ) { // Avoid brand new antidependence nodes 2632 // Get DEF'd registers the normal way 2633 verify_do_def( n, _regalloc->get_reg_first(n), msg ); 2634 verify_do_def( n, _regalloc->get_reg_second(n), msg ); 2635 } 2636 2637 // Now make all USEs live 2638 for( uint i=1; i<n->req(); i++ ) { 2639 Node *def = n->in(i); 2640 assert(def != 0, "input edge required"); 2641 OptoReg::Name reg_lo = _regalloc->get_reg_first(def); 2642 OptoReg::Name reg_hi = _regalloc->get_reg_second(def); 2643 if( OptoReg::is_valid(reg_lo) ) { 2644 assert(!_reg_node[reg_lo] || edge_from_to(_reg_node[reg_lo],def), msg); 2645 _reg_node.map(reg_lo,n); 2646 } 2647 if( OptoReg::is_valid(reg_hi) ) { 2648 assert(!_reg_node[reg_hi] || edge_from_to(_reg_node[reg_hi],def), msg); 2649 _reg_node.map(reg_hi,n); 2650 } 2651 } 2652 2653 } 2654 2655 // Zap to something reasonable for the Antidependence code 2656 _reg_node.clear(); 2657} 2658#endif 2659 2660// Conditionally add precedence edges. Avoid putting edges on Projs. 2661static void add_prec_edge_from_to( Node *from, Node *to ) { 2662 if( from->is_Proj() ) { // Put precedence edge on Proj's input 2663 assert( from->req() == 1 && (from->len() == 1 || from->in(1)==0), "no precedence edges on projections" ); 2664 from = from->in(0); 2665 } 2666 if( from != to && // No cycles (for things like LD L0,[L0+4] ) 2667 !edge_from_to( from, to ) ) // Avoid duplicate edge 2668 from->add_prec(to); 2669} 2670 2671void Scheduling::anti_do_def( Block *b, Node *def, OptoReg::Name def_reg, int is_def ) { 2672 if( !OptoReg::is_valid(def_reg) ) // Ignore stores & control flow 2673 return; 2674 2675 Node *pinch = _reg_node[def_reg]; // Get pinch point 2676 if ((pinch == NULL) || _cfg->get_block_for_node(pinch) != b || // No pinch-point yet? 2677 is_def ) { // Check for a true def (not a kill) 2678 _reg_node.map(def_reg,def); // Record def/kill as the optimistic pinch-point 2679 return; 2680 } 2681 2682 Node *kill = def; // Rename 'def' to more descriptive 'kill' 2683 debug_only( def = (Node*)0xdeadbeef; ) 2684 2685 // After some number of kills there _may_ be a later def 2686 Node *later_def = NULL; 2687 2688 // Finding a kill requires a real pinch-point. 2689 // Check for not already having a pinch-point. 2690 // Pinch points are Op_Node's. 2691 if( pinch->Opcode() != Op_Node ) { // Or later-def/kill as pinch-point? 2692 later_def = pinch; // Must be def/kill as optimistic pinch-point 2693 if ( _pinch_free_list.size() > 0) { 2694 pinch = _pinch_free_list.pop(); 2695 } else { 2696 pinch = new Node(1); // Pinch point to-be 2697 } 2698 if (pinch->_idx >= _regalloc->node_regs_max_index()) { 2699 _cfg->C->record_method_not_compilable("too many D-U pinch points"); 2700 return; 2701 } 2702 _cfg->map_node_to_block(pinch, b); // Pretend it's valid in this block (lazy init) 2703 _reg_node.map(def_reg,pinch); // Record pinch-point 2704 //_regalloc->set_bad(pinch->_idx); // Already initialized this way. 2705 if( later_def->outcnt() == 0 || later_def->ideal_reg() == MachProjNode::fat_proj ) { // Distinguish def from kill 2706 pinch->init_req(0, _cfg->C->top()); // set not NULL for the next call 2707 add_prec_edge_from_to(later_def,pinch); // Add edge from kill to pinch 2708 later_def = NULL; // and no later def 2709 } 2710 pinch->set_req(0,later_def); // Hook later def so we can find it 2711 } else { // Else have valid pinch point 2712 if( pinch->in(0) ) // If there is a later-def 2713 later_def = pinch->in(0); // Get it 2714 } 2715 2716 // Add output-dependence edge from later def to kill 2717 if( later_def ) // If there is some original def 2718 add_prec_edge_from_to(later_def,kill); // Add edge from def to kill 2719 2720 // See if current kill is also a use, and so is forced to be the pinch-point. 2721 if( pinch->Opcode() == Op_Node ) { 2722 Node *uses = kill->is_Proj() ? kill->in(0) : kill; 2723 for( uint i=1; i<uses->req(); i++ ) { 2724 if( _regalloc->get_reg_first(uses->in(i)) == def_reg || 2725 _regalloc->get_reg_second(uses->in(i)) == def_reg ) { 2726 // Yes, found a use/kill pinch-point 2727 pinch->set_req(0,NULL); // 2728 pinch->replace_by(kill); // Move anti-dep edges up 2729 pinch = kill; 2730 _reg_node.map(def_reg,pinch); 2731 return; 2732 } 2733 } 2734 } 2735 2736 // Add edge from kill to pinch-point 2737 add_prec_edge_from_to(kill,pinch); 2738} 2739 2740void Scheduling::anti_do_use( Block *b, Node *use, OptoReg::Name use_reg ) { 2741 if( !OptoReg::is_valid(use_reg) ) // Ignore stores & control flow 2742 return; 2743 Node *pinch = _reg_node[use_reg]; // Get pinch point 2744 // Check for no later def_reg/kill in block 2745 if ((pinch != NULL) && _cfg->get_block_for_node(pinch) == b && 2746 // Use has to be block-local as well 2747 _cfg->get_block_for_node(use) == b) { 2748 if( pinch->Opcode() == Op_Node && // Real pinch-point (not optimistic?) 2749 pinch->req() == 1 ) { // pinch not yet in block? 2750 pinch->del_req(0); // yank pointer to later-def, also set flag 2751 // Insert the pinch-point in the block just after the last use 2752 b->insert_node(pinch, b->find_node(use) + 1); 2753 _bb_end++; // Increase size scheduled region in block 2754 } 2755 2756 add_prec_edge_from_to(pinch,use); 2757 } 2758} 2759 2760// We insert antidependences between the reads and following write of 2761// allocated registers to prevent illegal code motion. Hopefully, the 2762// number of added references should be fairly small, especially as we 2763// are only adding references within the current basic block. 2764void Scheduling::ComputeRegisterAntidependencies(Block *b) { 2765 2766#ifdef ASSERT 2767 verify_good_schedule(b,"before block local scheduling"); 2768#endif 2769 2770 // A valid schedule, for each register independently, is an endless cycle 2771 // of: a def, then some uses (connected to the def by true dependencies), 2772 // then some kills (defs with no uses), finally the cycle repeats with a new 2773 // def. The uses are allowed to float relative to each other, as are the 2774 // kills. No use is allowed to slide past a kill (or def). This requires 2775 // antidependencies between all uses of a single def and all kills that 2776 // follow, up to the next def. More edges are redundant, because later defs 2777 // & kills are already serialized with true or antidependencies. To keep 2778 // the edge count down, we add a 'pinch point' node if there's more than 2779 // one use or more than one kill/def. 2780 2781 // We add dependencies in one bottom-up pass. 2782 2783 // For each instruction we handle it's DEFs/KILLs, then it's USEs. 2784 2785 // For each DEF/KILL, we check to see if there's a prior DEF/KILL for this 2786 // register. If not, we record the DEF/KILL in _reg_node, the 2787 // register-to-def mapping. If there is a prior DEF/KILL, we insert a 2788 // "pinch point", a new Node that's in the graph but not in the block. 2789 // We put edges from the prior and current DEF/KILLs to the pinch point. 2790 // We put the pinch point in _reg_node. If there's already a pinch point 2791 // we merely add an edge from the current DEF/KILL to the pinch point. 2792 2793 // After doing the DEF/KILLs, we handle USEs. For each used register, we 2794 // put an edge from the pinch point to the USE. 2795 2796 // To be expedient, the _reg_node array is pre-allocated for the whole 2797 // compilation. _reg_node is lazily initialized; it either contains a NULL, 2798 // or a valid def/kill/pinch-point, or a leftover node from some prior 2799 // block. Leftover node from some prior block is treated like a NULL (no 2800 // prior def, so no anti-dependence needed). Valid def is distinguished by 2801 // it being in the current block. 2802 bool fat_proj_seen = false; 2803 uint last_safept = _bb_end-1; 2804 Node* end_node = (_bb_end-1 >= _bb_start) ? b->get_node(last_safept) : NULL; 2805 Node* last_safept_node = end_node; 2806 for( uint i = _bb_end-1; i >= _bb_start; i-- ) { 2807 Node *n = b->get_node(i); 2808 int is_def = n->outcnt(); // def if some uses prior to adding precedence edges 2809 if( n->is_MachProj() && n->ideal_reg() == MachProjNode::fat_proj ) { 2810 // Fat-proj kills a slew of registers 2811 // This can add edges to 'n' and obscure whether or not it was a def, 2812 // hence the is_def flag. 2813 fat_proj_seen = true; 2814 RegMask rm = n->out_RegMask();// Make local copy 2815 while( rm.is_NotEmpty() ) { 2816 OptoReg::Name kill = rm.find_first_elem(); 2817 rm.Remove(kill); 2818 anti_do_def( b, n, kill, is_def ); 2819 } 2820 } else { 2821 // Get DEF'd registers the normal way 2822 anti_do_def( b, n, _regalloc->get_reg_first(n), is_def ); 2823 anti_do_def( b, n, _regalloc->get_reg_second(n), is_def ); 2824 } 2825 2826 // Kill projections on a branch should appear to occur on the 2827 // branch, not afterwards, so grab the masks from the projections 2828 // and process them. 2829 if (n->is_MachBranch() || n->is_Mach() && n->as_Mach()->ideal_Opcode() == Op_Jump) { 2830 for (DUIterator_Fast imax, i = n->fast_outs(imax); i < imax; i++) { 2831 Node* use = n->fast_out(i); 2832 if (use->is_Proj()) { 2833 RegMask rm = use->out_RegMask();// Make local copy 2834 while( rm.is_NotEmpty() ) { 2835 OptoReg::Name kill = rm.find_first_elem(); 2836 rm.Remove(kill); 2837 anti_do_def( b, n, kill, false ); 2838 } 2839 } 2840 } 2841 } 2842 2843 // Check each register used by this instruction for a following DEF/KILL 2844 // that must occur afterward and requires an anti-dependence edge. 2845 for( uint j=0; j<n->req(); j++ ) { 2846 Node *def = n->in(j); 2847 if( def ) { 2848 assert( !def->is_MachProj() || def->ideal_reg() != MachProjNode::fat_proj, "" ); 2849 anti_do_use( b, n, _regalloc->get_reg_first(def) ); 2850 anti_do_use( b, n, _regalloc->get_reg_second(def) ); 2851 } 2852 } 2853 // Do not allow defs of new derived values to float above GC 2854 // points unless the base is definitely available at the GC point. 2855 2856 Node *m = b->get_node(i); 2857 2858 // Add precedence edge from following safepoint to use of derived pointer 2859 if( last_safept_node != end_node && 2860 m != last_safept_node) { 2861 for (uint k = 1; k < m->req(); k++) { 2862 const Type *t = m->in(k)->bottom_type(); 2863 if( t->isa_oop_ptr() && 2864 t->is_ptr()->offset() != 0 ) { 2865 last_safept_node->add_prec( m ); 2866 break; 2867 } 2868 } 2869 } 2870 2871 if( n->jvms() ) { // Precedence edge from derived to safept 2872 // Check if last_safept_node was moved by pinch-point insertion in anti_do_use() 2873 if( b->get_node(last_safept) != last_safept_node ) { 2874 last_safept = b->find_node(last_safept_node); 2875 } 2876 for( uint j=last_safept; j > i; j-- ) { 2877 Node *mach = b->get_node(j); 2878 if( mach->is_Mach() && mach->as_Mach()->ideal_Opcode() == Op_AddP ) 2879 mach->add_prec( n ); 2880 } 2881 last_safept = i; 2882 last_safept_node = m; 2883 } 2884 } 2885 2886 if (fat_proj_seen) { 2887 // Garbage collect pinch nodes that were not consumed. 2888 // They are usually created by a fat kill MachProj for a call. 2889 garbage_collect_pinch_nodes(); 2890 } 2891} 2892 2893// Garbage collect pinch nodes for reuse by other blocks. 2894// 2895// The block scheduler's insertion of anti-dependence 2896// edges creates many pinch nodes when the block contains 2897// 2 or more Calls. A pinch node is used to prevent a 2898// combinatorial explosion of edges. If a set of kills for a 2899// register is anti-dependent on a set of uses (or defs), rather 2900// than adding an edge in the graph between each pair of kill 2901// and use (or def), a pinch is inserted between them: 2902// 2903// use1 use2 use3 2904// \ | / 2905// \ | / 2906// pinch 2907// / | \ 2908// / | \ 2909// kill1 kill2 kill3 2910// 2911// One pinch node is created per register killed when 2912// the second call is encountered during a backwards pass 2913// over the block. Most of these pinch nodes are never 2914// wired into the graph because the register is never 2915// used or def'ed in the block. 2916// 2917void Scheduling::garbage_collect_pinch_nodes() { 2918#ifndef PRODUCT 2919 if (_cfg->C->trace_opto_output()) tty->print("Reclaimed pinch nodes:"); 2920#endif 2921 int trace_cnt = 0; 2922 for (uint k = 0; k < _reg_node.Size(); k++) { 2923 Node* pinch = _reg_node[k]; 2924 if ((pinch != NULL) && pinch->Opcode() == Op_Node && 2925 // no predecence input edges 2926 (pinch->req() == pinch->len() || pinch->in(pinch->req()) == NULL) ) { 2927 cleanup_pinch(pinch); 2928 _pinch_free_list.push(pinch); 2929 _reg_node.map(k, NULL); 2930#ifndef PRODUCT 2931 if (_cfg->C->trace_opto_output()) { 2932 trace_cnt++; 2933 if (trace_cnt > 40) { 2934 tty->print("\n"); 2935 trace_cnt = 0; 2936 } 2937 tty->print(" %d", pinch->_idx); 2938 } 2939#endif 2940 } 2941 } 2942#ifndef PRODUCT 2943 if (_cfg->C->trace_opto_output()) tty->print("\n"); 2944#endif 2945} 2946 2947// Clean up a pinch node for reuse. 2948void Scheduling::cleanup_pinch( Node *pinch ) { 2949 assert (pinch && pinch->Opcode() == Op_Node && pinch->req() == 1, "just checking"); 2950 2951 for (DUIterator_Last imin, i = pinch->last_outs(imin); i >= imin; ) { 2952 Node* use = pinch->last_out(i); 2953 uint uses_found = 0; 2954 for (uint j = use->req(); j < use->len(); j++) { 2955 if (use->in(j) == pinch) { 2956 use->rm_prec(j); 2957 uses_found++; 2958 } 2959 } 2960 assert(uses_found > 0, "must be a precedence edge"); 2961 i -= uses_found; // we deleted 1 or more copies of this edge 2962 } 2963 // May have a later_def entry 2964 pinch->set_req(0, NULL); 2965} 2966 2967#ifndef PRODUCT 2968 2969void Scheduling::dump_available() const { 2970 tty->print("#Availist "); 2971 for (uint i = 0; i < _available.size(); i++) 2972 tty->print(" N%d/l%d", _available[i]->_idx,_current_latency[_available[i]->_idx]); 2973 tty->cr(); 2974} 2975 2976// Print Scheduling Statistics 2977void Scheduling::print_statistics() { 2978 // Print the size added by nops for bundling 2979 tty->print("Nops added %d bytes to total of %d bytes", 2980 _total_nop_size, _total_method_size); 2981 if (_total_method_size > 0) 2982 tty->print(", for %.2f%%", 2983 ((double)_total_nop_size) / ((double) _total_method_size) * 100.0); 2984 tty->print("\n"); 2985 2986 // Print the number of branch shadows filled 2987 if (Pipeline::_branch_has_delay_slot) { 2988 tty->print("Of %d branches, %d had unconditional delay slots filled", 2989 _total_branches, _total_unconditional_delays); 2990 if (_total_branches > 0) 2991 tty->print(", for %.2f%%", 2992 ((double)_total_unconditional_delays) / ((double)_total_branches) * 100.0); 2993 tty->print("\n"); 2994 } 2995 2996 uint total_instructions = 0, total_bundles = 0; 2997 2998 for (uint i = 1; i <= Pipeline::_max_instrs_per_cycle; i++) { 2999 uint bundle_count = _total_instructions_per_bundle[i]; 3000 total_instructions += bundle_count * i; 3001 total_bundles += bundle_count; 3002 } 3003 3004 if (total_bundles > 0) 3005 tty->print("Average ILP (excluding nops) is %.2f\n", 3006 ((double)total_instructions) / ((double)total_bundles)); 3007} 3008#endif 3009