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