annotate src/share/vm/opto/block.cpp @ 17467:55fb97c4c58d hs25-b65

8029233: Update copyright year to match last edit in jdk8 hotspot repository for 2013 Summary: Copyright year updated for files modified during 2013 Reviewed-by: twisti, iveresov
author mikael
date Tue, 24 Dec 2013 11:48:39 -0800
parents 4b078f877b56
children abec000618bf
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
rev   line source
0
a61af66fc99e Initial load
duke
parents:
diff changeset
1 /*
17467
55fb97c4c58d 8029233: Update copyright year to match last edit in jdk8 hotspot repository for 2013
mikael
parents: 12171
diff changeset
2 * Copyright (c) 1997, 2013, Oracle and/or its affiliates. All rights reserved.
0
a61af66fc99e Initial load
duke
parents:
diff changeset
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
a61af66fc99e Initial load
duke
parents:
diff changeset
4 *
a61af66fc99e Initial load
duke
parents:
diff changeset
5 * This code is free software; you can redistribute it and/or modify it
a61af66fc99e Initial load
duke
parents:
diff changeset
6 * under the terms of the GNU General Public License version 2 only, as
a61af66fc99e Initial load
duke
parents:
diff changeset
7 * published by the Free Software Foundation.
a61af66fc99e Initial load
duke
parents:
diff changeset
8 *
a61af66fc99e Initial load
duke
parents:
diff changeset
9 * This code is distributed in the hope that it will be useful, but WITHOUT
a61af66fc99e Initial load
duke
parents:
diff changeset
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
a61af66fc99e Initial load
duke
parents:
diff changeset
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
a61af66fc99e Initial load
duke
parents:
diff changeset
12 * version 2 for more details (a copy is included in the LICENSE file that
a61af66fc99e Initial load
duke
parents:
diff changeset
13 * accompanied this code).
a61af66fc99e Initial load
duke
parents:
diff changeset
14 *
a61af66fc99e Initial load
duke
parents:
diff changeset
15 * You should have received a copy of the GNU General Public License version
a61af66fc99e Initial load
duke
parents:
diff changeset
16 * 2 along with this work; if not, write to the Free Software Foundation,
a61af66fc99e Initial load
duke
parents:
diff changeset
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
a61af66fc99e Initial load
duke
parents:
diff changeset
18 *
1552
c18cbe5936b8 6941466: Oracle rebranding changes for Hotspot repositories
trims
parents: 893
diff changeset
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
c18cbe5936b8 6941466: Oracle rebranding changes for Hotspot repositories
trims
parents: 893
diff changeset
20 * or visit www.oracle.com if you need additional information or have any
c18cbe5936b8 6941466: Oracle rebranding changes for Hotspot repositories
trims
parents: 893
diff changeset
21 * questions.
0
a61af66fc99e Initial load
duke
parents:
diff changeset
22 *
a61af66fc99e Initial load
duke
parents:
diff changeset
23 */
a61af66fc99e Initial load
duke
parents:
diff changeset
24
1972
f95d63e2154a 6989984: Use standard include model for Hospot
stefank
parents: 1685
diff changeset
25 #include "precompiled.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot
stefank
parents: 1685
diff changeset
26 #include "libadt/vectset.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot
stefank
parents: 1685
diff changeset
27 #include "memory/allocation.inline.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot
stefank
parents: 1685
diff changeset
28 #include "opto/block.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot
stefank
parents: 1685
diff changeset
29 #include "opto/cfgnode.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot
stefank
parents: 1685
diff changeset
30 #include "opto/chaitin.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot
stefank
parents: 1685
diff changeset
31 #include "opto/loopnode.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot
stefank
parents: 1685
diff changeset
32 #include "opto/machnode.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot
stefank
parents: 1685
diff changeset
33 #include "opto/matcher.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot
stefank
parents: 1685
diff changeset
34 #include "opto/opcodes.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot
stefank
parents: 1685
diff changeset
35 #include "opto/rootnode.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot
stefank
parents: 1685
diff changeset
36 #include "utilities/copy.hpp"
0
a61af66fc99e Initial load
duke
parents:
diff changeset
37
a61af66fc99e Initial load
duke
parents:
diff changeset
38 void Block_Array::grow( uint i ) {
a61af66fc99e Initial load
duke
parents:
diff changeset
39 assert(i >= Max(), "must be an overflow");
a61af66fc99e Initial load
duke
parents:
diff changeset
40 debug_only(_limit = i+1);
a61af66fc99e Initial load
duke
parents:
diff changeset
41 if( i < _size ) return;
a61af66fc99e Initial load
duke
parents:
diff changeset
42 if( !_size ) {
a61af66fc99e Initial load
duke
parents:
diff changeset
43 _size = 1;
a61af66fc99e Initial load
duke
parents:
diff changeset
44 _blocks = (Block**)_arena->Amalloc( _size * sizeof(Block*) );
a61af66fc99e Initial load
duke
parents:
diff changeset
45 _blocks[0] = NULL;
a61af66fc99e Initial load
duke
parents:
diff changeset
46 }
a61af66fc99e Initial load
duke
parents:
diff changeset
47 uint old = _size;
a61af66fc99e Initial load
duke
parents:
diff changeset
48 while( i >= _size ) _size <<= 1; // Double to fit
a61af66fc99e Initial load
duke
parents:
diff changeset
49 _blocks = (Block**)_arena->Arealloc( _blocks, old*sizeof(Block*),_size*sizeof(Block*));
a61af66fc99e Initial load
duke
parents:
diff changeset
50 Copy::zero_to_bytes( &_blocks[old], (_size-old)*sizeof(Block*) );
a61af66fc99e Initial load
duke
parents:
diff changeset
51 }
a61af66fc99e Initial load
duke
parents:
diff changeset
52
a61af66fc99e Initial load
duke
parents:
diff changeset
53 void Block_List::remove(uint i) {
a61af66fc99e Initial load
duke
parents:
diff changeset
54 assert(i < _cnt, "index out of bounds");
a61af66fc99e Initial load
duke
parents:
diff changeset
55 Copy::conjoint_words_to_lower((HeapWord*)&_blocks[i+1], (HeapWord*)&_blocks[i], ((_cnt-i-1)*sizeof(Block*)));
a61af66fc99e Initial load
duke
parents:
diff changeset
56 pop(); // shrink list by one block
a61af66fc99e Initial load
duke
parents:
diff changeset
57 }
a61af66fc99e Initial load
duke
parents:
diff changeset
58
a61af66fc99e Initial load
duke
parents:
diff changeset
59 void Block_List::insert(uint i, Block *b) {
a61af66fc99e Initial load
duke
parents:
diff changeset
60 push(b); // grow list by one block
a61af66fc99e Initial load
duke
parents:
diff changeset
61 Copy::conjoint_words_to_higher((HeapWord*)&_blocks[i], (HeapWord*)&_blocks[i+1], ((_cnt-i-1)*sizeof(Block*)));
a61af66fc99e Initial load
duke
parents:
diff changeset
62 _blocks[i] = b;
a61af66fc99e Initial load
duke
parents:
diff changeset
63 }
a61af66fc99e Initial load
duke
parents:
diff changeset
64
418
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
65 #ifndef PRODUCT
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
66 void Block_List::print() {
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
67 for (uint i=0; i < size(); i++) {
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
68 tty->print("B%d ", _blocks[i]->_pre_order);
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
69 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
70 tty->print("size = %d\n", size());
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
71 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
72 #endif
0
a61af66fc99e Initial load
duke
parents:
diff changeset
73
a61af66fc99e Initial load
duke
parents:
diff changeset
74 uint Block::code_alignment() {
a61af66fc99e Initial load
duke
parents:
diff changeset
75 // Check for Root block
3851
95134e034042 7063629: use cbcond in C2 generated code on T4
kvn
parents: 3842
diff changeset
76 if (_pre_order == 0) return CodeEntryAlignment;
0
a61af66fc99e Initial load
duke
parents:
diff changeset
77 // Check for Start block
3851
95134e034042 7063629: use cbcond in C2 generated code on T4
kvn
parents: 3842
diff changeset
78 if (_pre_order == 1) return InteriorEntryAlignment;
0
a61af66fc99e Initial load
duke
parents:
diff changeset
79 // Check for loop alignment
3851
95134e034042 7063629: use cbcond in C2 generated code on T4
kvn
parents: 3842
diff changeset
80 if (has_loop_alignment()) return loop_alignment();
418
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
81
3851
95134e034042 7063629: use cbcond in C2 generated code on T4
kvn
parents: 3842
diff changeset
82 return relocInfo::addr_unit(); // no particular alignment
418
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
83 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
84
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
85 uint Block::compute_loop_alignment() {
0
a61af66fc99e Initial load
duke
parents:
diff changeset
86 Node *h = head();
3851
95134e034042 7063629: use cbcond in C2 generated code on T4
kvn
parents: 3842
diff changeset
87 int unit_sz = relocInfo::addr_unit();
95134e034042 7063629: use cbcond in C2 generated code on T4
kvn
parents: 3842
diff changeset
88 if (h->is_Loop() && h->as_Loop()->is_inner_loop()) {
0
a61af66fc99e Initial load
duke
parents:
diff changeset
89 // Pre- and post-loops have low trip count so do not bother with
a61af66fc99e Initial load
duke
parents:
diff changeset
90 // NOPs for align loop head. The constants are hidden from tuning
a61af66fc99e Initial load
duke
parents:
diff changeset
91 // but only because my "divide by 4" heuristic surely gets nearly
a61af66fc99e Initial load
duke
parents:
diff changeset
92 // all possible gain (a "do not align at all" heuristic has a
a61af66fc99e Initial load
duke
parents:
diff changeset
93 // chance of getting a really tiny gain).
3851
95134e034042 7063629: use cbcond in C2 generated code on T4
kvn
parents: 3842
diff changeset
94 if (h->is_CountedLoop() && (h->as_CountedLoop()->is_pre_loop() ||
95134e034042 7063629: use cbcond in C2 generated code on T4
kvn
parents: 3842
diff changeset
95 h->as_CountedLoop()->is_post_loop())) {
95134e034042 7063629: use cbcond in C2 generated code on T4
kvn
parents: 3842
diff changeset
96 return (OptoLoopAlignment > 4*unit_sz) ? (OptoLoopAlignment>>2) : unit_sz;
95134e034042 7063629: use cbcond in C2 generated code on T4
kvn
parents: 3842
diff changeset
97 }
0
a61af66fc99e Initial load
duke
parents:
diff changeset
98 // Loops with low backedge frequency should not be aligned.
a61af66fc99e Initial load
duke
parents:
diff changeset
99 Node *n = h->in(LoopNode::LoopBackControl)->in(0);
3851
95134e034042 7063629: use cbcond in C2 generated code on T4
kvn
parents: 3842
diff changeset
100 if (n->is_MachIf() && n->as_MachIf()->_prob < 0.01) {
95134e034042 7063629: use cbcond in C2 generated code on T4
kvn
parents: 3842
diff changeset
101 return unit_sz; // Loop does not loop, more often than not!
0
a61af66fc99e Initial load
duke
parents:
diff changeset
102 }
a61af66fc99e Initial load
duke
parents:
diff changeset
103 return OptoLoopAlignment; // Otherwise align loop head
a61af66fc99e Initial load
duke
parents:
diff changeset
104 }
418
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
105
3851
95134e034042 7063629: use cbcond in C2 generated code on T4
kvn
parents: 3842
diff changeset
106 return unit_sz; // no particular alignment
0
a61af66fc99e Initial load
duke
parents:
diff changeset
107 }
a61af66fc99e Initial load
duke
parents:
diff changeset
108
a61af66fc99e Initial load
duke
parents:
diff changeset
109 // Compute the size of first 'inst_cnt' instructions in this block.
a61af66fc99e Initial load
duke
parents:
diff changeset
110 // Return the number of instructions left to compute if the block has
418
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
111 // less then 'inst_cnt' instructions. Stop, and return 0 if sum_size
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
112 // exceeds OptoLoopAlignment.
0
a61af66fc99e Initial load
duke
parents:
diff changeset
113 uint Block::compute_first_inst_size(uint& sum_size, uint inst_cnt,
a61af66fc99e Initial load
duke
parents:
diff changeset
114 PhaseRegAlloc* ra) {
12167
650868c062a9 8023691: Create interface for nodes in class Block
adlertz
parents: 12071
diff changeset
115 uint last_inst = number_of_nodes();
0
a61af66fc99e Initial load
duke
parents:
diff changeset
116 for( uint j = 0; j < last_inst && inst_cnt > 0; j++ ) {
12167
650868c062a9 8023691: Create interface for nodes in class Block
adlertz
parents: 12071
diff changeset
117 uint inst_size = get_node(j)->size(ra);
0
a61af66fc99e Initial load
duke
parents:
diff changeset
118 if( inst_size > 0 ) {
a61af66fc99e Initial load
duke
parents:
diff changeset
119 inst_cnt--;
a61af66fc99e Initial load
duke
parents:
diff changeset
120 uint sz = sum_size + inst_size;
a61af66fc99e Initial load
duke
parents:
diff changeset
121 if( sz <= (uint)OptoLoopAlignment ) {
a61af66fc99e Initial load
duke
parents:
diff changeset
122 // Compute size of instructions which fit into fetch buffer only
a61af66fc99e Initial load
duke
parents:
diff changeset
123 // since all inst_cnt instructions will not fit even if we align them.
a61af66fc99e Initial load
duke
parents:
diff changeset
124 sum_size = sz;
a61af66fc99e Initial load
duke
parents:
diff changeset
125 } else {
a61af66fc99e Initial load
duke
parents:
diff changeset
126 return 0;
a61af66fc99e Initial load
duke
parents:
diff changeset
127 }
a61af66fc99e Initial load
duke
parents:
diff changeset
128 }
a61af66fc99e Initial load
duke
parents:
diff changeset
129 }
a61af66fc99e Initial load
duke
parents:
diff changeset
130 return inst_cnt;
a61af66fc99e Initial load
duke
parents:
diff changeset
131 }
a61af66fc99e Initial load
duke
parents:
diff changeset
132
a61af66fc99e Initial load
duke
parents:
diff changeset
133 uint Block::find_node( const Node *n ) const {
12167
650868c062a9 8023691: Create interface for nodes in class Block
adlertz
parents: 12071
diff changeset
134 for( uint i = 0; i < number_of_nodes(); i++ ) {
650868c062a9 8023691: Create interface for nodes in class Block
adlertz
parents: 12071
diff changeset
135 if( get_node(i) == n )
0
a61af66fc99e Initial load
duke
parents:
diff changeset
136 return i;
a61af66fc99e Initial load
duke
parents:
diff changeset
137 }
a61af66fc99e Initial load
duke
parents:
diff changeset
138 ShouldNotReachHere();
a61af66fc99e Initial load
duke
parents:
diff changeset
139 return 0;
a61af66fc99e Initial load
duke
parents:
diff changeset
140 }
a61af66fc99e Initial load
duke
parents:
diff changeset
141
a61af66fc99e Initial load
duke
parents:
diff changeset
142 // Find and remove n from block list
a61af66fc99e Initial load
duke
parents:
diff changeset
143 void Block::find_remove( const Node *n ) {
12167
650868c062a9 8023691: Create interface for nodes in class Block
adlertz
parents: 12071
diff changeset
144 remove_node(find_node(n));
0
a61af66fc99e Initial load
duke
parents:
diff changeset
145 }
a61af66fc99e Initial load
duke
parents:
diff changeset
146
a61af66fc99e Initial load
duke
parents:
diff changeset
147 // Return empty status of a block. Empty blocks contain only the head, other
a61af66fc99e Initial load
duke
parents:
diff changeset
148 // ideal nodes, and an optional trailing goto.
a61af66fc99e Initial load
duke
parents:
diff changeset
149 int Block::is_Empty() const {
a61af66fc99e Initial load
duke
parents:
diff changeset
150
a61af66fc99e Initial load
duke
parents:
diff changeset
151 // Root or start block is not considered empty
a61af66fc99e Initial load
duke
parents:
diff changeset
152 if (head()->is_Root() || head()->is_Start()) {
a61af66fc99e Initial load
duke
parents:
diff changeset
153 return not_empty;
a61af66fc99e Initial load
duke
parents:
diff changeset
154 }
a61af66fc99e Initial load
duke
parents:
diff changeset
155
a61af66fc99e Initial load
duke
parents:
diff changeset
156 int success_result = completely_empty;
12167
650868c062a9 8023691: Create interface for nodes in class Block
adlertz
parents: 12071
diff changeset
157 int end_idx = number_of_nodes() - 1;
0
a61af66fc99e Initial load
duke
parents:
diff changeset
158
a61af66fc99e Initial load
duke
parents:
diff changeset
159 // Check for ending goto
12167
650868c062a9 8023691: Create interface for nodes in class Block
adlertz
parents: 12071
diff changeset
160 if ((end_idx > 0) && (get_node(end_idx)->is_MachGoto())) {
0
a61af66fc99e Initial load
duke
parents:
diff changeset
161 success_result = empty_with_goto;
a61af66fc99e Initial load
duke
parents:
diff changeset
162 end_idx--;
a61af66fc99e Initial load
duke
parents:
diff changeset
163 }
a61af66fc99e Initial load
duke
parents:
diff changeset
164
a61af66fc99e Initial load
duke
parents:
diff changeset
165 // Unreachable blocks are considered empty
a61af66fc99e Initial load
duke
parents:
diff changeset
166 if (num_preds() <= 1) {
a61af66fc99e Initial load
duke
parents:
diff changeset
167 return success_result;
a61af66fc99e Initial load
duke
parents:
diff changeset
168 }
a61af66fc99e Initial load
duke
parents:
diff changeset
169
a61af66fc99e Initial load
duke
parents:
diff changeset
170 // Ideal nodes are allowable in empty blocks: skip them Only MachNodes
a61af66fc99e Initial load
duke
parents:
diff changeset
171 // turn directly into code, because only MachNodes have non-trivial
a61af66fc99e Initial load
duke
parents:
diff changeset
172 // emit() functions.
12167
650868c062a9 8023691: Create interface for nodes in class Block
adlertz
parents: 12071
diff changeset
173 while ((end_idx > 0) && !get_node(end_idx)->is_Mach()) {
0
a61af66fc99e Initial load
duke
parents:
diff changeset
174 end_idx--;
a61af66fc99e Initial load
duke
parents:
diff changeset
175 }
a61af66fc99e Initial load
duke
parents:
diff changeset
176
a61af66fc99e Initial load
duke
parents:
diff changeset
177 // No room for any interesting instructions?
a61af66fc99e Initial load
duke
parents:
diff changeset
178 if (end_idx == 0) {
a61af66fc99e Initial load
duke
parents:
diff changeset
179 return success_result;
a61af66fc99e Initial load
duke
parents:
diff changeset
180 }
a61af66fc99e Initial load
duke
parents:
diff changeset
181
a61af66fc99e Initial load
duke
parents:
diff changeset
182 return not_empty;
a61af66fc99e Initial load
duke
parents:
diff changeset
183 }
a61af66fc99e Initial load
duke
parents:
diff changeset
184
605
98cb887364d3 6810672: Comment typos
twisti
parents: 601
diff changeset
185 // Return true if the block's code implies that it is likely to be
0
a61af66fc99e Initial load
duke
parents:
diff changeset
186 // executed infrequently. Check to see if the block ends in a Halt or
a61af66fc99e Initial load
duke
parents:
diff changeset
187 // a low probability call.
a61af66fc99e Initial load
duke
parents:
diff changeset
188 bool Block::has_uncommon_code() const {
a61af66fc99e Initial load
duke
parents:
diff changeset
189 Node* en = end();
a61af66fc99e Initial load
duke
parents:
diff changeset
190
3842
c7b60b601eb4 7069452: Cleanup NodeFlags
kvn
parents: 1972
diff changeset
191 if (en->is_MachGoto())
0
a61af66fc99e Initial load
duke
parents:
diff changeset
192 en = en->in(0);
a61af66fc99e Initial load
duke
parents:
diff changeset
193 if (en->is_Catch())
a61af66fc99e Initial load
duke
parents:
diff changeset
194 en = en->in(0);
3842
c7b60b601eb4 7069452: Cleanup NodeFlags
kvn
parents: 1972
diff changeset
195 if (en->is_MachProj() && en->in(0)->is_MachCall()) {
0
a61af66fc99e Initial load
duke
parents:
diff changeset
196 MachCallNode* call = en->in(0)->as_MachCall();
a61af66fc99e Initial load
duke
parents:
diff changeset
197 if (call->cnt() != COUNT_UNKNOWN && call->cnt() <= PROB_UNLIKELY_MAG(4)) {
a61af66fc99e Initial load
duke
parents:
diff changeset
198 // This is true for slow-path stubs like new_{instance,array},
a61af66fc99e Initial load
duke
parents:
diff changeset
199 // slow_arraycopy, complete_monitor_locking, uncommon_trap.
a61af66fc99e Initial load
duke
parents:
diff changeset
200 // The magic number corresponds to the probability of an uncommon_trap,
a61af66fc99e Initial load
duke
parents:
diff changeset
201 // even though it is a count not a probability.
a61af66fc99e Initial load
duke
parents:
diff changeset
202 return true;
a61af66fc99e Initial load
duke
parents:
diff changeset
203 }
a61af66fc99e Initial load
duke
parents:
diff changeset
204 }
a61af66fc99e Initial load
duke
parents:
diff changeset
205
a61af66fc99e Initial load
duke
parents:
diff changeset
206 int op = en->is_Mach() ? en->as_Mach()->ideal_Opcode() : en->Opcode();
a61af66fc99e Initial load
duke
parents:
diff changeset
207 return op == Op_Halt;
a61af66fc99e Initial load
duke
parents:
diff changeset
208 }
a61af66fc99e Initial load
duke
parents:
diff changeset
209
a61af66fc99e Initial load
duke
parents:
diff changeset
210 // True if block is low enough frequency or guarded by a test which
a61af66fc99e Initial load
duke
parents:
diff changeset
211 // mostly does not go here.
12171
4b078f877b56 8023988: Move local scheduling of nodes to the CFG creation and code motion phase (PhaseCFG)
adlertz
parents: 12167
diff changeset
212 bool PhaseCFG::is_uncommon(const Block* block) {
0
a61af66fc99e Initial load
duke
parents:
diff changeset
213 // Initial blocks must never be moved, so are never uncommon.
12171
4b078f877b56 8023988: Move local scheduling of nodes to the CFG creation and code motion phase (PhaseCFG)
adlertz
parents: 12167
diff changeset
214 if (block->head()->is_Root() || block->head()->is_Start()) return false;
0
a61af66fc99e Initial load
duke
parents:
diff changeset
215
a61af66fc99e Initial load
duke
parents:
diff changeset
216 // Check for way-low freq
12171
4b078f877b56 8023988: Move local scheduling of nodes to the CFG creation and code motion phase (PhaseCFG)
adlertz
parents: 12167
diff changeset
217 if(block->_freq < BLOCK_FREQUENCY(0.00001f) ) return true;
0
a61af66fc99e Initial load
duke
parents:
diff changeset
218
a61af66fc99e Initial load
duke
parents:
diff changeset
219 // Look for code shape indicating uncommon_trap or slow path
12171
4b078f877b56 8023988: Move local scheduling of nodes to the CFG creation and code motion phase (PhaseCFG)
adlertz
parents: 12167
diff changeset
220 if (block->has_uncommon_code()) return true;
0
a61af66fc99e Initial load
duke
parents:
diff changeset
221
a61af66fc99e Initial load
duke
parents:
diff changeset
222 const float epsilon = 0.05f;
a61af66fc99e Initial load
duke
parents:
diff changeset
223 const float guard_factor = PROB_UNLIKELY_MAG(4) / (1.f - epsilon);
a61af66fc99e Initial load
duke
parents:
diff changeset
224 uint uncommon_preds = 0;
a61af66fc99e Initial load
duke
parents:
diff changeset
225 uint freq_preds = 0;
a61af66fc99e Initial load
duke
parents:
diff changeset
226 uint uncommon_for_freq_preds = 0;
a61af66fc99e Initial load
duke
parents:
diff changeset
227
12171
4b078f877b56 8023988: Move local scheduling of nodes to the CFG creation and code motion phase (PhaseCFG)
adlertz
parents: 12167
diff changeset
228 for( uint i=1; i< block->num_preds(); i++ ) {
4b078f877b56 8023988: Move local scheduling of nodes to the CFG creation and code motion phase (PhaseCFG)
adlertz
parents: 12167
diff changeset
229 Block* guard = get_block_for_node(block->pred(i));
0
a61af66fc99e Initial load
duke
parents:
diff changeset
230 // Check to see if this block follows its guard 1 time out of 10000
a61af66fc99e Initial load
duke
parents:
diff changeset
231 // or less.
a61af66fc99e Initial load
duke
parents:
diff changeset
232 //
a61af66fc99e Initial load
duke
parents:
diff changeset
233 // See list of magnitude-4 unlikely probabilities in cfgnode.hpp which
a61af66fc99e Initial load
duke
parents:
diff changeset
234 // we intend to be "uncommon", such as slow-path TLE allocation,
a61af66fc99e Initial load
duke
parents:
diff changeset
235 // predicted call failure, and uncommon trap triggers.
a61af66fc99e Initial load
duke
parents:
diff changeset
236 //
a61af66fc99e Initial load
duke
parents:
diff changeset
237 // Use an epsilon value of 5% to allow for variability in frequency
a61af66fc99e Initial load
duke
parents:
diff changeset
238 // predictions and floating point calculations. The net effect is
a61af66fc99e Initial load
duke
parents:
diff changeset
239 // that guard_factor is set to 9500.
a61af66fc99e Initial load
duke
parents:
diff changeset
240 //
a61af66fc99e Initial load
duke
parents:
diff changeset
241 // Ignore low-frequency blocks.
a61af66fc99e Initial load
duke
parents:
diff changeset
242 // The next check is (guard->_freq < 1.e-5 * 9500.).
a61af66fc99e Initial load
duke
parents:
diff changeset
243 if(guard->_freq*BLOCK_FREQUENCY(guard_factor) < BLOCK_FREQUENCY(0.00001f)) {
a61af66fc99e Initial load
duke
parents:
diff changeset
244 uncommon_preds++;
a61af66fc99e Initial load
duke
parents:
diff changeset
245 } else {
a61af66fc99e Initial load
duke
parents:
diff changeset
246 freq_preds++;
12171
4b078f877b56 8023988: Move local scheduling of nodes to the CFG creation and code motion phase (PhaseCFG)
adlertz
parents: 12167
diff changeset
247 if(block->_freq < guard->_freq * guard_factor ) {
0
a61af66fc99e Initial load
duke
parents:
diff changeset
248 uncommon_for_freq_preds++;
a61af66fc99e Initial load
duke
parents:
diff changeset
249 }
a61af66fc99e Initial load
duke
parents:
diff changeset
250 }
a61af66fc99e Initial load
duke
parents:
diff changeset
251 }
12171
4b078f877b56 8023988: Move local scheduling of nodes to the CFG creation and code motion phase (PhaseCFG)
adlertz
parents: 12167
diff changeset
252 if( block->num_preds() > 1 &&
0
a61af66fc99e Initial load
duke
parents:
diff changeset
253 // The block is uncommon if all preds are uncommon or
12171
4b078f877b56 8023988: Move local scheduling of nodes to the CFG creation and code motion phase (PhaseCFG)
adlertz
parents: 12167
diff changeset
254 (uncommon_preds == (block->num_preds()-1) ||
0
a61af66fc99e Initial load
duke
parents:
diff changeset
255 // it is uncommon for all frequent preds.
a61af66fc99e Initial load
duke
parents:
diff changeset
256 uncommon_for_freq_preds == freq_preds) ) {
a61af66fc99e Initial load
duke
parents:
diff changeset
257 return true;
a61af66fc99e Initial load
duke
parents:
diff changeset
258 }
a61af66fc99e Initial load
duke
parents:
diff changeset
259 return false;
a61af66fc99e Initial load
duke
parents:
diff changeset
260 }
a61af66fc99e Initial load
duke
parents:
diff changeset
261
a61af66fc99e Initial load
duke
parents:
diff changeset
262 #ifndef PRODUCT
3851
95134e034042 7063629: use cbcond in C2 generated code on T4
kvn
parents: 3842
diff changeset
263 void Block::dump_bidx(const Block* orig, outputStream* st) const {
95134e034042 7063629: use cbcond in C2 generated code on T4
kvn
parents: 3842
diff changeset
264 if (_pre_order) st->print("B%d",_pre_order);
95134e034042 7063629: use cbcond in C2 generated code on T4
kvn
parents: 3842
diff changeset
265 else st->print("N%d", head()->_idx);
0
a61af66fc99e Initial load
duke
parents:
diff changeset
266
a61af66fc99e Initial load
duke
parents:
diff changeset
267 if (Verbose && orig != this) {
a61af66fc99e Initial load
duke
parents:
diff changeset
268 // Dump the original block's idx
3851
95134e034042 7063629: use cbcond in C2 generated code on T4
kvn
parents: 3842
diff changeset
269 st->print(" (");
95134e034042 7063629: use cbcond in C2 generated code on T4
kvn
parents: 3842
diff changeset
270 orig->dump_bidx(orig, st);
95134e034042 7063629: use cbcond in C2 generated code on T4
kvn
parents: 3842
diff changeset
271 st->print(")");
0
a61af66fc99e Initial load
duke
parents:
diff changeset
272 }
a61af66fc99e Initial load
duke
parents:
diff changeset
273 }
a61af66fc99e Initial load
duke
parents:
diff changeset
274
12023
d1034bd8cefc 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 9060
diff changeset
275 void Block::dump_pred(const PhaseCFG* cfg, Block* orig, outputStream* st) const {
0
a61af66fc99e Initial load
duke
parents:
diff changeset
276 if (is_connector()) {
a61af66fc99e Initial load
duke
parents:
diff changeset
277 for (uint i=1; i<num_preds(); i++) {
12023
d1034bd8cefc 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 9060
diff changeset
278 Block *p = cfg->get_block_for_node(pred(i));
d1034bd8cefc 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 9060
diff changeset
279 p->dump_pred(cfg, orig, st);
0
a61af66fc99e Initial load
duke
parents:
diff changeset
280 }
a61af66fc99e Initial load
duke
parents:
diff changeset
281 } else {
3851
95134e034042 7063629: use cbcond in C2 generated code on T4
kvn
parents: 3842
diff changeset
282 dump_bidx(orig, st);
95134e034042 7063629: use cbcond in C2 generated code on T4
kvn
parents: 3842
diff changeset
283 st->print(" ");
0
a61af66fc99e Initial load
duke
parents:
diff changeset
284 }
a61af66fc99e Initial load
duke
parents:
diff changeset
285 }
a61af66fc99e Initial load
duke
parents:
diff changeset
286
12023
d1034bd8cefc 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 9060
diff changeset
287 void Block::dump_head(const PhaseCFG* cfg, outputStream* st) const {
0
a61af66fc99e Initial load
duke
parents:
diff changeset
288 // Print the basic block
3851
95134e034042 7063629: use cbcond in C2 generated code on T4
kvn
parents: 3842
diff changeset
289 dump_bidx(this, st);
95134e034042 7063629: use cbcond in C2 generated code on T4
kvn
parents: 3842
diff changeset
290 st->print(": #\t");
0
a61af66fc99e Initial load
duke
parents:
diff changeset
291
a61af66fc99e Initial load
duke
parents:
diff changeset
292 // Print the incoming CFG edges and the outgoing CFG edges
a61af66fc99e Initial load
duke
parents:
diff changeset
293 for( uint i=0; i<_num_succs; i++ ) {
3851
95134e034042 7063629: use cbcond in C2 generated code on T4
kvn
parents: 3842
diff changeset
294 non_connector_successor(i)->dump_bidx(_succs[i], st);
95134e034042 7063629: use cbcond in C2 generated code on T4
kvn
parents: 3842
diff changeset
295 st->print(" ");
0
a61af66fc99e Initial load
duke
parents:
diff changeset
296 }
3851
95134e034042 7063629: use cbcond in C2 generated code on T4
kvn
parents: 3842
diff changeset
297 st->print("<- ");
0
a61af66fc99e Initial load
duke
parents:
diff changeset
298 if( head()->is_block_start() ) {
a61af66fc99e Initial load
duke
parents:
diff changeset
299 for (uint i=1; i<num_preds(); i++) {
a61af66fc99e Initial load
duke
parents:
diff changeset
300 Node *s = pred(i);
12023
d1034bd8cefc 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 9060
diff changeset
301 if (cfg != NULL) {
d1034bd8cefc 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 9060
diff changeset
302 Block *p = cfg->get_block_for_node(s);
d1034bd8cefc 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 9060
diff changeset
303 p->dump_pred(cfg, p, st);
0
a61af66fc99e Initial load
duke
parents:
diff changeset
304 } else {
a61af66fc99e Initial load
duke
parents:
diff changeset
305 while (!s->is_block_start())
a61af66fc99e Initial load
duke
parents:
diff changeset
306 s = s->in(0);
3851
95134e034042 7063629: use cbcond in C2 generated code on T4
kvn
parents: 3842
diff changeset
307 st->print("N%d ", s->_idx );
0
a61af66fc99e Initial load
duke
parents:
diff changeset
308 }
a61af66fc99e Initial load
duke
parents:
diff changeset
309 }
12023
d1034bd8cefc 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 9060
diff changeset
310 } else {
3851
95134e034042 7063629: use cbcond in C2 generated code on T4
kvn
parents: 3842
diff changeset
311 st->print("BLOCK HEAD IS JUNK ");
12023
d1034bd8cefc 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 9060
diff changeset
312 }
0
a61af66fc99e Initial load
duke
parents:
diff changeset
313
a61af66fc99e Initial load
duke
parents:
diff changeset
314 // Print loop, if any
a61af66fc99e Initial load
duke
parents:
diff changeset
315 const Block *bhead = this; // Head of self-loop
a61af66fc99e Initial load
duke
parents:
diff changeset
316 Node *bh = bhead->head();
12023
d1034bd8cefc 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 9060
diff changeset
317
d1034bd8cefc 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 9060
diff changeset
318 if ((cfg != NULL) && bh->is_Loop() && !head()->is_Root()) {
0
a61af66fc99e Initial load
duke
parents:
diff changeset
319 LoopNode *loop = bh->as_Loop();
12023
d1034bd8cefc 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 9060
diff changeset
320 const Block *bx = cfg->get_block_for_node(loop->in(LoopNode::LoopBackControl));
0
a61af66fc99e Initial load
duke
parents:
diff changeset
321 while (bx->is_connector()) {
12023
d1034bd8cefc 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 9060
diff changeset
322 bx = cfg->get_block_for_node(bx->pred(1));
0
a61af66fc99e Initial load
duke
parents:
diff changeset
323 }
3851
95134e034042 7063629: use cbcond in C2 generated code on T4
kvn
parents: 3842
diff changeset
324 st->print("\tLoop: B%d-B%d ", bhead->_pre_order, bx->_pre_order);
0
a61af66fc99e Initial load
duke
parents:
diff changeset
325 // Dump any loop-specific bits, especially for CountedLoops.
3851
95134e034042 7063629: use cbcond in C2 generated code on T4
kvn
parents: 3842
diff changeset
326 loop->dump_spec(st);
418
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
327 } else if (has_loop_alignment()) {
3851
95134e034042 7063629: use cbcond in C2 generated code on T4
kvn
parents: 3842
diff changeset
328 st->print(" top-of-loop");
0
a61af66fc99e Initial load
duke
parents:
diff changeset
329 }
3851
95134e034042 7063629: use cbcond in C2 generated code on T4
kvn
parents: 3842
diff changeset
330 st->print(" Freq: %g",_freq);
0
a61af66fc99e Initial load
duke
parents:
diff changeset
331 if( Verbose || WizardMode ) {
3851
95134e034042 7063629: use cbcond in C2 generated code on T4
kvn
parents: 3842
diff changeset
332 st->print(" IDom: %d/#%d", _idom ? _idom->_pre_order : 0, _dom_depth);
95134e034042 7063629: use cbcond in C2 generated code on T4
kvn
parents: 3842
diff changeset
333 st->print(" RegPressure: %d",_reg_pressure);
95134e034042 7063629: use cbcond in C2 generated code on T4
kvn
parents: 3842
diff changeset
334 st->print(" IHRP Index: %d",_ihrp_index);
95134e034042 7063629: use cbcond in C2 generated code on T4
kvn
parents: 3842
diff changeset
335 st->print(" FRegPressure: %d",_freg_pressure);
95134e034042 7063629: use cbcond in C2 generated code on T4
kvn
parents: 3842
diff changeset
336 st->print(" FHRP Index: %d",_fhrp_index);
0
a61af66fc99e Initial load
duke
parents:
diff changeset
337 }
3851
95134e034042 7063629: use cbcond in C2 generated code on T4
kvn
parents: 3842
diff changeset
338 st->print_cr("");
0
a61af66fc99e Initial load
duke
parents:
diff changeset
339 }
a61af66fc99e Initial load
duke
parents:
diff changeset
340
12023
d1034bd8cefc 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 9060
diff changeset
341 void Block::dump() const {
d1034bd8cefc 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 9060
diff changeset
342 dump(NULL);
d1034bd8cefc 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 9060
diff changeset
343 }
0
a61af66fc99e Initial load
duke
parents:
diff changeset
344
12023
d1034bd8cefc 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 9060
diff changeset
345 void Block::dump(const PhaseCFG* cfg) const {
d1034bd8cefc 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 9060
diff changeset
346 dump_head(cfg);
12167
650868c062a9 8023691: Create interface for nodes in class Block
adlertz
parents: 12071
diff changeset
347 for (uint i=0; i< number_of_nodes(); i++) {
650868c062a9 8023691: Create interface for nodes in class Block
adlertz
parents: 12071
diff changeset
348 get_node(i)->dump();
12023
d1034bd8cefc 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 9060
diff changeset
349 }
0
a61af66fc99e Initial load
duke
parents:
diff changeset
350 tty->print("\n");
a61af66fc99e Initial load
duke
parents:
diff changeset
351 }
a61af66fc99e Initial load
duke
parents:
diff changeset
352 #endif
a61af66fc99e Initial load
duke
parents:
diff changeset
353
12023
d1034bd8cefc 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 9060
diff changeset
354 PhaseCFG::PhaseCFG(Arena* arena, RootNode* root, Matcher& matcher)
d1034bd8cefc 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 9060
diff changeset
355 : Phase(CFG)
d1034bd8cefc 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 9060
diff changeset
356 , _block_arena(arena)
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
357 , _root(root)
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
358 , _matcher(matcher)
12023
d1034bd8cefc 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 9060
diff changeset
359 , _node_to_block_mapping(arena)
d1034bd8cefc 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 9060
diff changeset
360 , _node_latency(NULL)
0
a61af66fc99e Initial load
duke
parents:
diff changeset
361 #ifndef PRODUCT
12023
d1034bd8cefc 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 9060
diff changeset
362 , _trace_opto_pipelining(TraceOptoPipelining || C->method_has_option("TraceOptoPipelining"))
0
a61af66fc99e Initial load
duke
parents:
diff changeset
363 #endif
833
acba6af809c8 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 628
diff changeset
364 #ifdef ASSERT
12023
d1034bd8cefc 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 9060
diff changeset
365 , _raw_oops(arena)
833
acba6af809c8 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 628
diff changeset
366 #endif
0
a61af66fc99e Initial load
duke
parents:
diff changeset
367 {
a61af66fc99e Initial load
duke
parents:
diff changeset
368 ResourceMark rm;
a61af66fc99e Initial load
duke
parents:
diff changeset
369 // I'll need a few machine-specific GotoNodes. Make an Ideal GotoNode,
a61af66fc99e Initial load
duke
parents:
diff changeset
370 // then Match it into a machine-specific Node. Then clone the machine
a61af66fc99e Initial load
duke
parents:
diff changeset
371 // Node on demand.
6804
e626685e9f6c 7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents: 4115
diff changeset
372 Node *x = new (C) GotoNode(NULL);
0
a61af66fc99e Initial load
duke
parents:
diff changeset
373 x->init_req(0, x);
12023
d1034bd8cefc 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 9060
diff changeset
374 _goto = matcher.match_tree(x);
0
a61af66fc99e Initial load
duke
parents:
diff changeset
375 assert(_goto != NULL, "");
a61af66fc99e Initial load
duke
parents:
diff changeset
376 _goto->set_req(0,_goto);
a61af66fc99e Initial load
duke
parents:
diff changeset
377
a61af66fc99e Initial load
duke
parents:
diff changeset
378 // Build the CFG in Reverse Post Order
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
379 _number_of_blocks = build_cfg();
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
380 _root_block = get_block_for_node(_root);
0
a61af66fc99e Initial load
duke
parents:
diff changeset
381 }
a61af66fc99e Initial load
duke
parents:
diff changeset
382
a61af66fc99e Initial load
duke
parents:
diff changeset
383 // Build a proper looking CFG. Make every block begin with either a StartNode
a61af66fc99e Initial load
duke
parents:
diff changeset
384 // or a RegionNode. Make every block end with either a Goto, If or Return.
a61af66fc99e Initial load
duke
parents:
diff changeset
385 // The RootNode both starts and ends it's own block. Do this with a recursive
a61af66fc99e Initial load
duke
parents:
diff changeset
386 // backwards walk over the control edges.
a61af66fc99e Initial load
duke
parents:
diff changeset
387 uint PhaseCFG::build_cfg() {
a61af66fc99e Initial load
duke
parents:
diff changeset
388 Arena *a = Thread::current()->resource_area();
a61af66fc99e Initial load
duke
parents:
diff changeset
389 VectorSet visited(a);
a61af66fc99e Initial load
duke
parents:
diff changeset
390
a61af66fc99e Initial load
duke
parents:
diff changeset
391 // Allocate stack with enough space to avoid frequent realloc
a61af66fc99e Initial load
duke
parents:
diff changeset
392 Node_Stack nstack(a, C->unique() >> 1);
a61af66fc99e Initial load
duke
parents:
diff changeset
393 nstack.push(_root, 0);
a61af66fc99e Initial load
duke
parents:
diff changeset
394 uint sum = 0; // Counter for blocks
a61af66fc99e Initial load
duke
parents:
diff changeset
395
a61af66fc99e Initial load
duke
parents:
diff changeset
396 while (nstack.is_nonempty()) {
a61af66fc99e Initial load
duke
parents:
diff changeset
397 // node and in's index from stack's top
a61af66fc99e Initial load
duke
parents:
diff changeset
398 // 'np' is _root (see above) or RegionNode, StartNode: we push on stack
a61af66fc99e Initial load
duke
parents:
diff changeset
399 // only nodes which point to the start of basic block (see below).
a61af66fc99e Initial load
duke
parents:
diff changeset
400 Node *np = nstack.node();
a61af66fc99e Initial load
duke
parents:
diff changeset
401 // idx > 0, except for the first node (_root) pushed on stack
a61af66fc99e Initial load
duke
parents:
diff changeset
402 // at the beginning when idx == 0.
a61af66fc99e Initial load
duke
parents:
diff changeset
403 // We will use the condition (idx == 0) later to end the build.
a61af66fc99e Initial load
duke
parents:
diff changeset
404 uint idx = nstack.index();
a61af66fc99e Initial load
duke
parents:
diff changeset
405 Node *proj = np->in(idx);
a61af66fc99e Initial load
duke
parents:
diff changeset
406 const Node *x = proj->is_block_proj();
a61af66fc99e Initial load
duke
parents:
diff changeset
407 // Does the block end with a proper block-ending Node? One of Return,
a61af66fc99e Initial load
duke
parents:
diff changeset
408 // If or Goto? (This check should be done for visited nodes also).
a61af66fc99e Initial load
duke
parents:
diff changeset
409 if (x == NULL) { // Does not end right...
a61af66fc99e Initial load
duke
parents:
diff changeset
410 Node *g = _goto->clone(); // Force it to end in a Goto
a61af66fc99e Initial load
duke
parents:
diff changeset
411 g->set_req(0, proj);
a61af66fc99e Initial load
duke
parents:
diff changeset
412 np->set_req(idx, g);
a61af66fc99e Initial load
duke
parents:
diff changeset
413 x = proj = g;
a61af66fc99e Initial load
duke
parents:
diff changeset
414 }
a61af66fc99e Initial load
duke
parents:
diff changeset
415 if (!visited.test_set(x->_idx)) { // Visit this block once
a61af66fc99e Initial load
duke
parents:
diff changeset
416 // Skip any control-pinned middle'in stuff
a61af66fc99e Initial load
duke
parents:
diff changeset
417 Node *p = proj;
a61af66fc99e Initial load
duke
parents:
diff changeset
418 do {
a61af66fc99e Initial load
duke
parents:
diff changeset
419 proj = p; // Update pointer to last Control
a61af66fc99e Initial load
duke
parents:
diff changeset
420 p = p->in(0); // Move control forward
a61af66fc99e Initial load
duke
parents:
diff changeset
421 } while( !p->is_block_proj() &&
a61af66fc99e Initial load
duke
parents:
diff changeset
422 !p->is_block_start() );
a61af66fc99e Initial load
duke
parents:
diff changeset
423 // Make the block begin with one of Region or StartNode.
a61af66fc99e Initial load
duke
parents:
diff changeset
424 if( !p->is_block_start() ) {
6804
e626685e9f6c 7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents: 4115
diff changeset
425 RegionNode *r = new (C) RegionNode( 2 );
0
a61af66fc99e Initial load
duke
parents:
diff changeset
426 r->init_req(1, p); // Insert RegionNode in the way
a61af66fc99e Initial load
duke
parents:
diff changeset
427 proj->set_req(0, r); // Insert RegionNode in the way
a61af66fc99e Initial load
duke
parents:
diff changeset
428 p = r;
a61af66fc99e Initial load
duke
parents:
diff changeset
429 }
a61af66fc99e Initial load
duke
parents:
diff changeset
430 // 'p' now points to the start of this basic block
a61af66fc99e Initial load
duke
parents:
diff changeset
431
a61af66fc99e Initial load
duke
parents:
diff changeset
432 // Put self in array of basic blocks
12023
d1034bd8cefc 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 9060
diff changeset
433 Block *bb = new (_block_arena) Block(_block_arena, p);
d1034bd8cefc 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 9060
diff changeset
434 map_node_to_block(p, bb);
d1034bd8cefc 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 9060
diff changeset
435 map_node_to_block(x, bb);
3851
95134e034042 7063629: use cbcond in C2 generated code on T4
kvn
parents: 3842
diff changeset
436 if( x != p ) { // Only for root is x == p
12167
650868c062a9 8023691: Create interface for nodes in class Block
adlertz
parents: 12071
diff changeset
437 bb->push_node((Node*)x);
3851
95134e034042 7063629: use cbcond in C2 generated code on T4
kvn
parents: 3842
diff changeset
438 }
0
a61af66fc99e Initial load
duke
parents:
diff changeset
439 // Now handle predecessors
a61af66fc99e Initial load
duke
parents:
diff changeset
440 ++sum; // Count 1 for self block
a61af66fc99e Initial load
duke
parents:
diff changeset
441 uint cnt = bb->num_preds();
a61af66fc99e Initial load
duke
parents:
diff changeset
442 for (int i = (cnt - 1); i > 0; i-- ) { // For all predecessors
a61af66fc99e Initial load
duke
parents:
diff changeset
443 Node *prevproj = p->in(i); // Get prior input
a61af66fc99e Initial load
duke
parents:
diff changeset
444 assert( !prevproj->is_Con(), "dead input not removed" );
a61af66fc99e Initial load
duke
parents:
diff changeset
445 // Check to see if p->in(i) is a "control-dependent" CFG edge -
a61af66fc99e Initial load
duke
parents:
diff changeset
446 // i.e., it splits at the source (via an IF or SWITCH) and merges
a61af66fc99e Initial load
duke
parents:
diff changeset
447 // at the destination (via a many-input Region).
a61af66fc99e Initial load
duke
parents:
diff changeset
448 // This breaks critical edges. The RegionNode to start the block
a61af66fc99e Initial load
duke
parents:
diff changeset
449 // will be added when <p,i> is pulled off the node stack
a61af66fc99e Initial load
duke
parents:
diff changeset
450 if ( cnt > 2 ) { // Merging many things?
a61af66fc99e Initial load
duke
parents:
diff changeset
451 assert( prevproj== bb->pred(i),"");
a61af66fc99e Initial load
duke
parents:
diff changeset
452 if(prevproj->is_block_proj() != prevproj) { // Control-dependent edge?
a61af66fc99e Initial load
duke
parents:
diff changeset
453 // Force a block on the control-dependent edge
a61af66fc99e Initial load
duke
parents:
diff changeset
454 Node *g = _goto->clone(); // Force it to end in a Goto
a61af66fc99e Initial load
duke
parents:
diff changeset
455 g->set_req(0,prevproj);
a61af66fc99e Initial load
duke
parents:
diff changeset
456 p->set_req(i,g);
a61af66fc99e Initial load
duke
parents:
diff changeset
457 }
a61af66fc99e Initial load
duke
parents:
diff changeset
458 }
a61af66fc99e Initial load
duke
parents:
diff changeset
459 nstack.push(p, i); // 'p' is RegionNode or StartNode
a61af66fc99e Initial load
duke
parents:
diff changeset
460 }
a61af66fc99e Initial load
duke
parents:
diff changeset
461 } else { // Post-processing visited nodes
a61af66fc99e Initial load
duke
parents:
diff changeset
462 nstack.pop(); // remove node from stack
a61af66fc99e Initial load
duke
parents:
diff changeset
463 // Check if it the fist node pushed on stack at the beginning.
a61af66fc99e Initial load
duke
parents:
diff changeset
464 if (idx == 0) break; // end of the build
a61af66fc99e Initial load
duke
parents:
diff changeset
465 // Find predecessor basic block
12023
d1034bd8cefc 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 9060
diff changeset
466 Block *pb = get_block_for_node(x);
0
a61af66fc99e Initial load
duke
parents:
diff changeset
467 // Insert into nodes array, if not already there
12023
d1034bd8cefc 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 9060
diff changeset
468 if (!has_block(proj)) {
0
a61af66fc99e Initial load
duke
parents:
diff changeset
469 assert( x != proj, "" );
a61af66fc99e Initial load
duke
parents:
diff changeset
470 // Map basic block of projection
12023
d1034bd8cefc 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 9060
diff changeset
471 map_node_to_block(proj, pb);
12167
650868c062a9 8023691: Create interface for nodes in class Block
adlertz
parents: 12071
diff changeset
472 pb->push_node(proj);
0
a61af66fc99e Initial load
duke
parents:
diff changeset
473 }
a61af66fc99e Initial load
duke
parents:
diff changeset
474 // Insert self as a child of my predecessor block
12023
d1034bd8cefc 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 9060
diff changeset
475 pb->_succs.map(pb->_num_succs++, get_block_for_node(np));
12167
650868c062a9 8023691: Create interface for nodes in class Block
adlertz
parents: 12071
diff changeset
476 assert( pb->get_node(pb->number_of_nodes() - pb->_num_succs)->is_block_proj(),
0
a61af66fc99e Initial load
duke
parents:
diff changeset
477 "too many control users, not a CFG?" );
a61af66fc99e Initial load
duke
parents:
diff changeset
478 }
a61af66fc99e Initial load
duke
parents:
diff changeset
479 }
a61af66fc99e Initial load
duke
parents:
diff changeset
480 // Return number of basic blocks for all children and self
a61af66fc99e Initial load
duke
parents:
diff changeset
481 return sum;
a61af66fc99e Initial load
duke
parents:
diff changeset
482 }
a61af66fc99e Initial load
duke
parents:
diff changeset
483
a61af66fc99e Initial load
duke
parents:
diff changeset
484 // Inserts a goto & corresponding basic block between
a61af66fc99e Initial load
duke
parents:
diff changeset
485 // block[block_no] and its succ_no'th successor block
a61af66fc99e Initial load
duke
parents:
diff changeset
486 void PhaseCFG::insert_goto_at(uint block_no, uint succ_no) {
a61af66fc99e Initial load
duke
parents:
diff changeset
487 // get block with block_no
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
488 assert(block_no < number_of_blocks(), "illegal block number");
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
489 Block* in = get_block(block_no);
0
a61af66fc99e Initial load
duke
parents:
diff changeset
490 // get successor block succ_no
a61af66fc99e Initial load
duke
parents:
diff changeset
491 assert(succ_no < in->_num_succs, "illegal successor number");
a61af66fc99e Initial load
duke
parents:
diff changeset
492 Block* out = in->_succs[succ_no];
308
756b58154237 6611837: block frequency is zero
rasbold
parents: 0
diff changeset
493 // Compute frequency of the new block. Do this before inserting
756b58154237 6611837: block frequency is zero
rasbold
parents: 0
diff changeset
494 // new block in case succ_prob() needs to infer the probability from
756b58154237 6611837: block frequency is zero
rasbold
parents: 0
diff changeset
495 // surrounding blocks.
756b58154237 6611837: block frequency is zero
rasbold
parents: 0
diff changeset
496 float freq = in->_freq * in->succ_prob(succ_no);
0
a61af66fc99e Initial load
duke
parents:
diff changeset
497 // get ProjNode corresponding to the succ_no'th successor of the in block
12167
650868c062a9 8023691: Create interface for nodes in class Block
adlertz
parents: 12071
diff changeset
498 ProjNode* proj = in->get_node(in->number_of_nodes() - in->_num_succs + succ_no)->as_Proj();
0
a61af66fc99e Initial load
duke
parents:
diff changeset
499 // create region for basic block
6804
e626685e9f6c 7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents: 4115
diff changeset
500 RegionNode* region = new (C) RegionNode(2);
0
a61af66fc99e Initial load
duke
parents:
diff changeset
501 region->init_req(1, proj);
a61af66fc99e Initial load
duke
parents:
diff changeset
502 // setup corresponding basic block
12023
d1034bd8cefc 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 9060
diff changeset
503 Block* block = new (_block_arena) Block(_block_arena, region);
d1034bd8cefc 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 9060
diff changeset
504 map_node_to_block(region, block);
0
a61af66fc99e Initial load
duke
parents:
diff changeset
505 C->regalloc()->set_bad(region->_idx);
a61af66fc99e Initial load
duke
parents:
diff changeset
506 // add a goto node
a61af66fc99e Initial load
duke
parents:
diff changeset
507 Node* gto = _goto->clone(); // get a new goto node
a61af66fc99e Initial load
duke
parents:
diff changeset
508 gto->set_req(0, region);
a61af66fc99e Initial load
duke
parents:
diff changeset
509 // add it to the basic block
12167
650868c062a9 8023691: Create interface for nodes in class Block
adlertz
parents: 12071
diff changeset
510 block->push_node(gto);
12023
d1034bd8cefc 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 9060
diff changeset
511 map_node_to_block(gto, block);
0
a61af66fc99e Initial load
duke
parents:
diff changeset
512 C->regalloc()->set_bad(gto->_idx);
a61af66fc99e Initial load
duke
parents:
diff changeset
513 // hook up successor block
a61af66fc99e Initial load
duke
parents:
diff changeset
514 block->_succs.map(block->_num_succs++, out);
a61af66fc99e Initial load
duke
parents:
diff changeset
515 // remap successor's predecessors if necessary
a61af66fc99e Initial load
duke
parents:
diff changeset
516 for (uint i = 1; i < out->num_preds(); i++) {
a61af66fc99e Initial load
duke
parents:
diff changeset
517 if (out->pred(i) == proj) out->head()->set_req(i, gto);
a61af66fc99e Initial load
duke
parents:
diff changeset
518 }
a61af66fc99e Initial load
duke
parents:
diff changeset
519 // remap predecessor's successor to new block
a61af66fc99e Initial load
duke
parents:
diff changeset
520 in->_succs.map(succ_no, block);
308
756b58154237 6611837: block frequency is zero
rasbold
parents: 0
diff changeset
521 // Set the frequency of the new block
756b58154237 6611837: block frequency is zero
rasbold
parents: 0
diff changeset
522 block->_freq = freq;
0
a61af66fc99e Initial load
duke
parents:
diff changeset
523 // add new basic block to basic block list
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
524 add_block_at(block_no + 1, block);
0
a61af66fc99e Initial load
duke
parents:
diff changeset
525 }
a61af66fc99e Initial load
duke
parents:
diff changeset
526
a61af66fc99e Initial load
duke
parents:
diff changeset
527 // Does this block end in a multiway branch that cannot have the default case
a61af66fc99e Initial load
duke
parents:
diff changeset
528 // flipped for another case?
a61af66fc99e Initial load
duke
parents:
diff changeset
529 static bool no_flip_branch( Block *b ) {
12167
650868c062a9 8023691: Create interface for nodes in class Block
adlertz
parents: 12071
diff changeset
530 int branch_idx = b->number_of_nodes() - b->_num_succs-1;
0
a61af66fc99e Initial load
duke
parents:
diff changeset
531 if( branch_idx < 1 ) return false;
12167
650868c062a9 8023691: Create interface for nodes in class Block
adlertz
parents: 12071
diff changeset
532 Node *bra = b->get_node(branch_idx);
418
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
533 if( bra->is_Catch() )
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
534 return true;
0
a61af66fc99e Initial load
duke
parents:
diff changeset
535 if( bra->is_Mach() ) {
418
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
536 if( bra->is_MachNullCheck() )
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
537 return true;
0
a61af66fc99e Initial load
duke
parents:
diff changeset
538 int iop = bra->as_Mach()->ideal_Opcode();
a61af66fc99e Initial load
duke
parents:
diff changeset
539 if( iop == Op_FastLock || iop == Op_FastUnlock )
a61af66fc99e Initial load
duke
parents:
diff changeset
540 return true;
a61af66fc99e Initial load
duke
parents:
diff changeset
541 }
a61af66fc99e Initial load
duke
parents:
diff changeset
542 return false;
a61af66fc99e Initial load
duke
parents:
diff changeset
543 }
a61af66fc99e Initial load
duke
parents:
diff changeset
544
a61af66fc99e Initial load
duke
parents:
diff changeset
545 // Check for NeverBranch at block end. This needs to become a GOTO to the
a61af66fc99e Initial load
duke
parents:
diff changeset
546 // true target. NeverBranch are treated as a conditional branch that always
a61af66fc99e Initial load
duke
parents:
diff changeset
547 // goes the same direction for most of the optimizer and are used to give a
a61af66fc99e Initial load
duke
parents:
diff changeset
548 // fake exit path to infinite loops. At this late stage they need to turn
a61af66fc99e Initial load
duke
parents:
diff changeset
549 // into Goto's so that when you enter the infinite loop you indeed hang.
a61af66fc99e Initial load
duke
parents:
diff changeset
550 void PhaseCFG::convert_NeverBranch_to_Goto(Block *b) {
a61af66fc99e Initial load
duke
parents:
diff changeset
551 // Find true target
a61af66fc99e Initial load
duke
parents:
diff changeset
552 int end_idx = b->end_idx();
12167
650868c062a9 8023691: Create interface for nodes in class Block
adlertz
parents: 12071
diff changeset
553 int idx = b->get_node(end_idx+1)->as_Proj()->_con;
0
a61af66fc99e Initial load
duke
parents:
diff changeset
554 Block *succ = b->_succs[idx];
a61af66fc99e Initial load
duke
parents:
diff changeset
555 Node* gto = _goto->clone(); // get a new goto node
a61af66fc99e Initial load
duke
parents:
diff changeset
556 gto->set_req(0, b->head());
12167
650868c062a9 8023691: Create interface for nodes in class Block
adlertz
parents: 12071
diff changeset
557 Node *bp = b->get_node(end_idx);
650868c062a9 8023691: Create interface for nodes in class Block
adlertz
parents: 12071
diff changeset
558 b->map_node(gto, end_idx); // Slam over NeverBranch
12023
d1034bd8cefc 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 9060
diff changeset
559 map_node_to_block(gto, b);
0
a61af66fc99e Initial load
duke
parents:
diff changeset
560 C->regalloc()->set_bad(gto->_idx);
12167
650868c062a9 8023691: Create interface for nodes in class Block
adlertz
parents: 12071
diff changeset
561 b->pop_node(); // Yank projections
650868c062a9 8023691: Create interface for nodes in class Block
adlertz
parents: 12071
diff changeset
562 b->pop_node(); // Yank projections
0
a61af66fc99e Initial load
duke
parents:
diff changeset
563 b->_succs.map(0,succ); // Map only successor
a61af66fc99e Initial load
duke
parents:
diff changeset
564 b->_num_succs = 1;
a61af66fc99e Initial load
duke
parents:
diff changeset
565 // remap successor's predecessors if necessary
a61af66fc99e Initial load
duke
parents:
diff changeset
566 uint j;
a61af66fc99e Initial load
duke
parents:
diff changeset
567 for( j = 1; j < succ->num_preds(); j++)
a61af66fc99e Initial load
duke
parents:
diff changeset
568 if( succ->pred(j)->in(0) == bp )
a61af66fc99e Initial load
duke
parents:
diff changeset
569 succ->head()->set_req(j, gto);
a61af66fc99e Initial load
duke
parents:
diff changeset
570 // Kill alternate exit path
a61af66fc99e Initial load
duke
parents:
diff changeset
571 Block *dead = b->_succs[1-idx];
a61af66fc99e Initial load
duke
parents:
diff changeset
572 for( j = 1; j < dead->num_preds(); j++)
a61af66fc99e Initial load
duke
parents:
diff changeset
573 if( dead->pred(j)->in(0) == bp )
a61af66fc99e Initial load
duke
parents:
diff changeset
574 break;
a61af66fc99e Initial load
duke
parents:
diff changeset
575 // Scan through block, yanking dead path from
a61af66fc99e Initial load
duke
parents:
diff changeset
576 // all regions and phis.
a61af66fc99e Initial load
duke
parents:
diff changeset
577 dead->head()->del_req(j);
12167
650868c062a9 8023691: Create interface for nodes in class Block
adlertz
parents: 12071
diff changeset
578 for( int k = 1; dead->get_node(k)->is_Phi(); k++ )
650868c062a9 8023691: Create interface for nodes in class Block
adlertz
parents: 12071
diff changeset
579 dead->get_node(k)->del_req(j);
0
a61af66fc99e Initial load
duke
parents:
diff changeset
580 }
a61af66fc99e Initial load
duke
parents:
diff changeset
581
a61af66fc99e Initial load
duke
parents:
diff changeset
582 // Helper function to move block bx to the slot following b_index. Return
a61af66fc99e Initial load
duke
parents:
diff changeset
583 // true if the move is successful, otherwise false
418
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
584 bool PhaseCFG::move_to_next(Block* bx, uint b_index) {
0
a61af66fc99e Initial load
duke
parents:
diff changeset
585 if (bx == NULL) return false;
a61af66fc99e Initial load
duke
parents:
diff changeset
586
a61af66fc99e Initial load
duke
parents:
diff changeset
587 // Return false if bx is already scheduled.
a61af66fc99e Initial load
duke
parents:
diff changeset
588 uint bx_index = bx->_pre_order;
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
589 if ((bx_index <= b_index) && (get_block(bx_index) == bx)) {
0
a61af66fc99e Initial load
duke
parents:
diff changeset
590 return false;
a61af66fc99e Initial load
duke
parents:
diff changeset
591 }
a61af66fc99e Initial load
duke
parents:
diff changeset
592
a61af66fc99e Initial load
duke
parents:
diff changeset
593 // Find the current index of block bx on the block list
a61af66fc99e Initial load
duke
parents:
diff changeset
594 bx_index = b_index + 1;
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
595 while (bx_index < number_of_blocks() && get_block(bx_index) != bx) {
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
596 bx_index++;
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
597 }
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
598 assert(get_block(bx_index) == bx, "block not found");
0
a61af66fc99e Initial load
duke
parents:
diff changeset
599
a61af66fc99e Initial load
duke
parents:
diff changeset
600 // If the previous block conditionally falls into bx, return false,
a61af66fc99e Initial load
duke
parents:
diff changeset
601 // because moving bx will create an extra jump.
a61af66fc99e Initial load
duke
parents:
diff changeset
602 for(uint k = 1; k < bx->num_preds(); k++ ) {
12023
d1034bd8cefc 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 9060
diff changeset
603 Block* pred = get_block_for_node(bx->pred(k));
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
604 if (pred == get_block(bx_index - 1)) {
0
a61af66fc99e Initial load
duke
parents:
diff changeset
605 if (pred->_num_succs != 1) {
a61af66fc99e Initial load
duke
parents:
diff changeset
606 return false;
a61af66fc99e Initial load
duke
parents:
diff changeset
607 }
a61af66fc99e Initial load
duke
parents:
diff changeset
608 }
a61af66fc99e Initial load
duke
parents:
diff changeset
609 }
a61af66fc99e Initial load
duke
parents:
diff changeset
610
a61af66fc99e Initial load
duke
parents:
diff changeset
611 // Reinsert bx just past block 'b'
a61af66fc99e Initial load
duke
parents:
diff changeset
612 _blocks.remove(bx_index);
a61af66fc99e Initial load
duke
parents:
diff changeset
613 _blocks.insert(b_index + 1, bx);
a61af66fc99e Initial load
duke
parents:
diff changeset
614 return true;
a61af66fc99e Initial load
duke
parents:
diff changeset
615 }
a61af66fc99e Initial load
duke
parents:
diff changeset
616
a61af66fc99e Initial load
duke
parents:
diff changeset
617 // Move empty and uncommon blocks to the end.
418
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
618 void PhaseCFG::move_to_end(Block *b, uint i) {
0
a61af66fc99e Initial load
duke
parents:
diff changeset
619 int e = b->is_Empty();
a61af66fc99e Initial load
duke
parents:
diff changeset
620 if (e != Block::not_empty) {
a61af66fc99e Initial load
duke
parents:
diff changeset
621 if (e == Block::empty_with_goto) {
a61af66fc99e Initial load
duke
parents:
diff changeset
622 // Remove the goto, but leave the block.
12167
650868c062a9 8023691: Create interface for nodes in class Block
adlertz
parents: 12071
diff changeset
623 b->pop_node();
0
a61af66fc99e Initial load
duke
parents:
diff changeset
624 }
a61af66fc99e Initial load
duke
parents:
diff changeset
625 // Mark this block as a connector block, which will cause it to be
a61af66fc99e Initial load
duke
parents:
diff changeset
626 // ignored in certain functions such as non_connector_successor().
a61af66fc99e Initial load
duke
parents:
diff changeset
627 b->set_connector();
a61af66fc99e Initial load
duke
parents:
diff changeset
628 }
a61af66fc99e Initial load
duke
parents:
diff changeset
629 // Move the empty block to the end, and don't recheck.
a61af66fc99e Initial load
duke
parents:
diff changeset
630 _blocks.remove(i);
a61af66fc99e Initial load
duke
parents:
diff changeset
631 _blocks.push(b);
a61af66fc99e Initial load
duke
parents:
diff changeset
632 }
a61af66fc99e Initial load
duke
parents:
diff changeset
633
418
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
634 // Set loop alignment for every block
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
635 void PhaseCFG::set_loop_alignment() {
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
636 uint last = number_of_blocks();
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
637 assert(get_block(0) == get_root_block(), "");
418
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
638
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
639 for (uint i = 1; i < last; i++) {
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
640 Block* block = get_block(i);
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
641 if (block->head()->is_Loop()) {
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
642 block->set_loop_alignment(block);
418
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
643 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
644 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
645 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
646
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
647 // Make empty basic blocks to be "connector" blocks, Move uncommon blocks
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
648 // to the end.
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
649 void PhaseCFG::remove_empty_blocks() {
0
a61af66fc99e Initial load
duke
parents:
diff changeset
650 // Move uncommon blocks to the end
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
651 uint last = number_of_blocks();
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
652 assert(get_block(0) == get_root_block(), "");
418
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
653
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
654 for (uint i = 1; i < last; i++) {
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
655 Block* block = get_block(i);
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
656 if (block->is_connector()) {
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
657 break;
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
658 }
0
a61af66fc99e Initial load
duke
parents:
diff changeset
659
a61af66fc99e Initial load
duke
parents:
diff changeset
660 // Check for NeverBranch at block end. This needs to become a GOTO to the
a61af66fc99e Initial load
duke
parents:
diff changeset
661 // true target. NeverBranch are treated as a conditional branch that
a61af66fc99e Initial load
duke
parents:
diff changeset
662 // always goes the same direction for most of the optimizer and are used
a61af66fc99e Initial load
duke
parents:
diff changeset
663 // to give a fake exit path to infinite loops. At this late stage they
a61af66fc99e Initial load
duke
parents:
diff changeset
664 // need to turn into Goto's so that when you enter the infinite loop you
a61af66fc99e Initial load
duke
parents:
diff changeset
665 // indeed hang.
12167
650868c062a9 8023691: Create interface for nodes in class Block
adlertz
parents: 12071
diff changeset
666 if (block->get_node(block->end_idx())->Opcode() == Op_NeverBranch) {
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
667 convert_NeverBranch_to_Goto(block);
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
668 }
0
a61af66fc99e Initial load
duke
parents:
diff changeset
669
a61af66fc99e Initial load
duke
parents:
diff changeset
670 // Look for uncommon blocks and move to end.
418
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
671 if (!C->do_freq_based_layout()) {
12171
4b078f877b56 8023988: Move local scheduling of nodes to the CFG creation and code motion phase (PhaseCFG)
adlertz
parents: 12167
diff changeset
672 if (is_uncommon(block)) {
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
673 move_to_end(block, i);
418
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
674 last--; // No longer check for being uncommon!
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
675 if (no_flip_branch(block)) { // Fall-thru case must follow?
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
676 // Find the fall-thru block
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
677 block = get_block(i);
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
678 move_to_end(block, i);
418
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
679 last--;
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
680 }
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
681 // backup block counter post-increment
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
682 i--;
0
a61af66fc99e Initial load
duke
parents:
diff changeset
683 }
a61af66fc99e Initial load
duke
parents:
diff changeset
684 }
a61af66fc99e Initial load
duke
parents:
diff changeset
685 }
a61af66fc99e Initial load
duke
parents:
diff changeset
686
418
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
687 // Move empty blocks to the end
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
688 last = number_of_blocks();
418
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
689 for (uint i = 1; i < last; i++) {
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
690 Block* block = get_block(i);
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
691 if (block->is_Empty() != Block::not_empty) {
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
692 move_to_end(block, i);
418
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
693 last--;
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
694 i--;
0
a61af66fc99e Initial load
duke
parents:
diff changeset
695 }
a61af66fc99e Initial load
duke
parents:
diff changeset
696 } // End of for all blocks
418
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
697 }
0
a61af66fc99e Initial load
duke
parents:
diff changeset
698
418
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
699 // Fix up the final control flow for basic blocks.
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
700 void PhaseCFG::fixup_flow() {
0
a61af66fc99e Initial load
duke
parents:
diff changeset
701 // Fixup final control flow for the blocks. Remove jump-to-next
a61af66fc99e Initial load
duke
parents:
diff changeset
702 // block. If neither arm of a IF follows the conditional branch, we
a61af66fc99e Initial load
duke
parents:
diff changeset
703 // have to add a second jump after the conditional. We place the
a61af66fc99e Initial load
duke
parents:
diff changeset
704 // TRUE branch target in succs[0] for both GOTOs and IFs.
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
705 for (uint i = 0; i < number_of_blocks(); i++) {
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
706 Block* block = get_block(i);
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
707 block->_pre_order = i; // turn pre-order into block-index
0
a61af66fc99e Initial load
duke
parents:
diff changeset
708
a61af66fc99e Initial load
duke
parents:
diff changeset
709 // Connector blocks need no further processing.
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
710 if (block->is_connector()) {
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
711 assert((i+1) == number_of_blocks() || get_block(i + 1)->is_connector(), "All connector blocks should sink to the end");
0
a61af66fc99e Initial load
duke
parents:
diff changeset
712 continue;
a61af66fc99e Initial load
duke
parents:
diff changeset
713 }
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
714 assert(block->is_Empty() != Block::completely_empty, "Empty blocks should be connectors");
0
a61af66fc99e Initial load
duke
parents:
diff changeset
715
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
716 Block* bnext = (i < number_of_blocks() - 1) ? get_block(i + 1) : NULL;
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
717 Block* bs0 = block->non_connector_successor(0);
0
a61af66fc99e Initial load
duke
parents:
diff changeset
718
a61af66fc99e Initial load
duke
parents:
diff changeset
719 // Check for multi-way branches where I cannot negate the test to
a61af66fc99e Initial load
duke
parents:
diff changeset
720 // exchange the true and false targets.
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
721 if (no_flip_branch(block)) {
0
a61af66fc99e Initial load
duke
parents:
diff changeset
722 // Find fall through case - if must fall into its target
12167
650868c062a9 8023691: Create interface for nodes in class Block
adlertz
parents: 12071
diff changeset
723 int branch_idx = block->number_of_nodes() - block->_num_succs;
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
724 for (uint j2 = 0; j2 < block->_num_succs; j2++) {
12167
650868c062a9 8023691: Create interface for nodes in class Block
adlertz
parents: 12071
diff changeset
725 const ProjNode* p = block->get_node(branch_idx + j2)->as_Proj();
0
a61af66fc99e Initial load
duke
parents:
diff changeset
726 if (p->_con == 0) {
a61af66fc99e Initial load
duke
parents:
diff changeset
727 // successor j2 is fall through case
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
728 if (block->non_connector_successor(j2) != bnext) {
0
a61af66fc99e Initial load
duke
parents:
diff changeset
729 // but it is not the next block => insert a goto
a61af66fc99e Initial load
duke
parents:
diff changeset
730 insert_goto_at(i, j2);
a61af66fc99e Initial load
duke
parents:
diff changeset
731 }
a61af66fc99e Initial load
duke
parents:
diff changeset
732 // Put taken branch in slot 0
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
733 if (j2 == 0 && block->_num_succs == 2) {
0
a61af66fc99e Initial load
duke
parents:
diff changeset
734 // Flip targets in succs map
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
735 Block *tbs0 = block->_succs[0];
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
736 Block *tbs1 = block->_succs[1];
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
737 block->_succs.map(0, tbs1);
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
738 block->_succs.map(1, tbs0);
0
a61af66fc99e Initial load
duke
parents:
diff changeset
739 }
a61af66fc99e Initial load
duke
parents:
diff changeset
740 break;
a61af66fc99e Initial load
duke
parents:
diff changeset
741 }
a61af66fc99e Initial load
duke
parents:
diff changeset
742 }
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
743
0
a61af66fc99e Initial load
duke
parents:
diff changeset
744 // Remove all CatchProjs
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
745 for (uint j = 0; j < block->_num_succs; j++) {
12167
650868c062a9 8023691: Create interface for nodes in class Block
adlertz
parents: 12071
diff changeset
746 block->pop_node();
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
747 }
0
a61af66fc99e Initial load
duke
parents:
diff changeset
748
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
749 } else if (block->_num_succs == 1) {
0
a61af66fc99e Initial load
duke
parents:
diff changeset
750 // Block ends in a Goto?
a61af66fc99e Initial load
duke
parents:
diff changeset
751 if (bnext == bs0) {
a61af66fc99e Initial load
duke
parents:
diff changeset
752 // We fall into next block; remove the Goto
12167
650868c062a9 8023691: Create interface for nodes in class Block
adlertz
parents: 12071
diff changeset
753 block->pop_node();
0
a61af66fc99e Initial load
duke
parents:
diff changeset
754 }
a61af66fc99e Initial load
duke
parents:
diff changeset
755
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
756 } else if(block->_num_succs == 2) { // Block ends in a If?
0
a61af66fc99e Initial load
duke
parents:
diff changeset
757 // Get opcode of 1st projection (matches _succs[0])
a61af66fc99e Initial load
duke
parents:
diff changeset
758 // Note: Since this basic block has 2 exits, the last 2 nodes must
a61af66fc99e Initial load
duke
parents:
diff changeset
759 // be projections (in any order), the 3rd last node must be
a61af66fc99e Initial load
duke
parents:
diff changeset
760 // the IfNode (we have excluded other 2-way exits such as
a61af66fc99e Initial load
duke
parents:
diff changeset
761 // CatchNodes already).
12167
650868c062a9 8023691: Create interface for nodes in class Block
adlertz
parents: 12071
diff changeset
762 MachNode* iff = block->get_node(block->number_of_nodes() - 3)->as_Mach();
650868c062a9 8023691: Create interface for nodes in class Block
adlertz
parents: 12071
diff changeset
763 ProjNode* proj0 = block->get_node(block->number_of_nodes() - 2)->as_Proj();
650868c062a9 8023691: Create interface for nodes in class Block
adlertz
parents: 12071
diff changeset
764 ProjNode* proj1 = block->get_node(block->number_of_nodes() - 1)->as_Proj();
0
a61af66fc99e Initial load
duke
parents:
diff changeset
765
a61af66fc99e Initial load
duke
parents:
diff changeset
766 // Assert that proj0 and succs[0] match up. Similarly for proj1 and succs[1].
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
767 assert(proj0->raw_out(0) == block->_succs[0]->head(), "Mismatch successor 0");
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
768 assert(proj1->raw_out(0) == block->_succs[1]->head(), "Mismatch successor 1");
0
a61af66fc99e Initial load
duke
parents:
diff changeset
769
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
770 Block* bs1 = block->non_connector_successor(1);
0
a61af66fc99e Initial load
duke
parents:
diff changeset
771
a61af66fc99e Initial load
duke
parents:
diff changeset
772 // Check for neither successor block following the current
a61af66fc99e Initial load
duke
parents:
diff changeset
773 // block ending in a conditional. If so, move one of the
a61af66fc99e Initial load
duke
parents:
diff changeset
774 // successors after the current one, provided that the
a61af66fc99e Initial load
duke
parents:
diff changeset
775 // successor was previously unscheduled, but moveable
a61af66fc99e Initial load
duke
parents:
diff changeset
776 // (i.e., all paths to it involve a branch).
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
777 if (!C->do_freq_based_layout() && bnext != bs0 && bnext != bs1) {
0
a61af66fc99e Initial load
duke
parents:
diff changeset
778 // Choose the more common successor based on the probability
a61af66fc99e Initial load
duke
parents:
diff changeset
779 // of the conditional branch.
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
780 Block* bx = bs0;
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
781 Block* by = bs1;
0
a61af66fc99e Initial load
duke
parents:
diff changeset
782
a61af66fc99e Initial load
duke
parents:
diff changeset
783 // _prob is the probability of taking the true path. Make
a61af66fc99e Initial load
duke
parents:
diff changeset
784 // p the probability of taking successor #1.
a61af66fc99e Initial load
duke
parents:
diff changeset
785 float p = iff->as_MachIf()->_prob;
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
786 if (proj0->Opcode() == Op_IfTrue) {
0
a61af66fc99e Initial load
duke
parents:
diff changeset
787 p = 1.0 - p;
a61af66fc99e Initial load
duke
parents:
diff changeset
788 }
a61af66fc99e Initial load
duke
parents:
diff changeset
789
a61af66fc99e Initial load
duke
parents:
diff changeset
790 // Prefer successor #1 if p > 0.5
a61af66fc99e Initial load
duke
parents:
diff changeset
791 if (p > PROB_FAIR) {
a61af66fc99e Initial load
duke
parents:
diff changeset
792 bx = bs1;
a61af66fc99e Initial load
duke
parents:
diff changeset
793 by = bs0;
a61af66fc99e Initial load
duke
parents:
diff changeset
794 }
a61af66fc99e Initial load
duke
parents:
diff changeset
795
a61af66fc99e Initial load
duke
parents:
diff changeset
796 // Attempt the more common successor first
418
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
797 if (move_to_next(bx, i)) {
0
a61af66fc99e Initial load
duke
parents:
diff changeset
798 bnext = bx;
418
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
799 } else if (move_to_next(by, i)) {
0
a61af66fc99e Initial load
duke
parents:
diff changeset
800 bnext = by;
a61af66fc99e Initial load
duke
parents:
diff changeset
801 }
a61af66fc99e Initial load
duke
parents:
diff changeset
802 }
a61af66fc99e Initial load
duke
parents:
diff changeset
803
a61af66fc99e Initial load
duke
parents:
diff changeset
804 // Check for conditional branching the wrong way. Negate
a61af66fc99e Initial load
duke
parents:
diff changeset
805 // conditional, if needed, so it falls into the following block
a61af66fc99e Initial load
duke
parents:
diff changeset
806 // and branches to the not-following block.
a61af66fc99e Initial load
duke
parents:
diff changeset
807
a61af66fc99e Initial load
duke
parents:
diff changeset
808 // Check for the next block being in succs[0]. We are going to branch
a61af66fc99e Initial load
duke
parents:
diff changeset
809 // to succs[0], so we want the fall-thru case as the next block in
a61af66fc99e Initial load
duke
parents:
diff changeset
810 // succs[1].
a61af66fc99e Initial load
duke
parents:
diff changeset
811 if (bnext == bs0) {
a61af66fc99e Initial load
duke
parents:
diff changeset
812 // Fall-thru case in succs[0], so flip targets in succs map
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
813 Block* tbs0 = block->_succs[0];
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
814 Block* tbs1 = block->_succs[1];
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
815 block->_succs.map(0, tbs1);
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
816 block->_succs.map(1, tbs0);
0
a61af66fc99e Initial load
duke
parents:
diff changeset
817 // Flip projection for each target
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
818 ProjNode* tmp = proj0;
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
819 proj0 = proj1;
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
820 proj1 = tmp;
0
a61af66fc99e Initial load
duke
parents:
diff changeset
821
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
822 } else if(bnext != bs1) {
418
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
823 // Need a double-branch
0
a61af66fc99e Initial load
duke
parents:
diff changeset
824 // The existing conditional branch need not change.
a61af66fc99e Initial load
duke
parents:
diff changeset
825 // Add a unconditional branch to the false target.
a61af66fc99e Initial load
duke
parents:
diff changeset
826 // Alas, it must appear in its own block and adding a
a61af66fc99e Initial load
duke
parents:
diff changeset
827 // block this late in the game is complicated. Sigh.
a61af66fc99e Initial load
duke
parents:
diff changeset
828 insert_goto_at(i, 1);
a61af66fc99e Initial load
duke
parents:
diff changeset
829 }
a61af66fc99e Initial load
duke
parents:
diff changeset
830
a61af66fc99e Initial load
duke
parents:
diff changeset
831 // Make sure we TRUE branch to the target
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
832 if (proj0->Opcode() == Op_IfFalse) {
3853
11211f7cb5a0 7079317: Incorrect branch's destination block in PrintoOptoAssembly output
kvn
parents: 3851
diff changeset
833 iff->as_MachIf()->negate();
418
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
834 }
0
a61af66fc99e Initial load
duke
parents:
diff changeset
835
12167
650868c062a9 8023691: Create interface for nodes in class Block
adlertz
parents: 12071
diff changeset
836 block->pop_node(); // Remove IfFalse & IfTrue projections
650868c062a9 8023691: Create interface for nodes in class Block
adlertz
parents: 12071
diff changeset
837 block->pop_node();
0
a61af66fc99e Initial load
duke
parents:
diff changeset
838
a61af66fc99e Initial load
duke
parents:
diff changeset
839 } else {
a61af66fc99e Initial load
duke
parents:
diff changeset
840 // Multi-exit block, e.g. a switch statement
a61af66fc99e Initial load
duke
parents:
diff changeset
841 // But we don't need to do anything here
a61af66fc99e Initial load
duke
parents:
diff changeset
842 }
a61af66fc99e Initial load
duke
parents:
diff changeset
843 } // End of for all blocks
a61af66fc99e Initial load
duke
parents:
diff changeset
844 }
a61af66fc99e Initial load
duke
parents:
diff changeset
845
a61af66fc99e Initial load
duke
parents:
diff changeset
846
a61af66fc99e Initial load
duke
parents:
diff changeset
847 #ifndef PRODUCT
a61af66fc99e Initial load
duke
parents:
diff changeset
848 void PhaseCFG::_dump_cfg( const Node *end, VectorSet &visited ) const {
a61af66fc99e Initial load
duke
parents:
diff changeset
849 const Node *x = end->is_block_proj();
a61af66fc99e Initial load
duke
parents:
diff changeset
850 assert( x, "not a CFG" );
a61af66fc99e Initial load
duke
parents:
diff changeset
851
a61af66fc99e Initial load
duke
parents:
diff changeset
852 // Do not visit this block again
a61af66fc99e Initial load
duke
parents:
diff changeset
853 if( visited.test_set(x->_idx) ) return;
a61af66fc99e Initial load
duke
parents:
diff changeset
854
a61af66fc99e Initial load
duke
parents:
diff changeset
855 // Skip through this block
a61af66fc99e Initial load
duke
parents:
diff changeset
856 const Node *p = x;
a61af66fc99e Initial load
duke
parents:
diff changeset
857 do {
a61af66fc99e Initial load
duke
parents:
diff changeset
858 p = p->in(0); // Move control forward
a61af66fc99e Initial load
duke
parents:
diff changeset
859 assert( !p->is_block_proj() || p->is_Root(), "not a CFG" );
a61af66fc99e Initial load
duke
parents:
diff changeset
860 } while( !p->is_block_start() );
a61af66fc99e Initial load
duke
parents:
diff changeset
861
a61af66fc99e Initial load
duke
parents:
diff changeset
862 // Recursively visit
12023
d1034bd8cefc 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 9060
diff changeset
863 for (uint i = 1; i < p->req(); i++) {
d1034bd8cefc 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 9060
diff changeset
864 _dump_cfg(p->in(i), visited);
d1034bd8cefc 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 9060
diff changeset
865 }
0
a61af66fc99e Initial load
duke
parents:
diff changeset
866
a61af66fc99e Initial load
duke
parents:
diff changeset
867 // Dump the block
12023
d1034bd8cefc 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 9060
diff changeset
868 get_block_for_node(p)->dump(this);
0
a61af66fc99e Initial load
duke
parents:
diff changeset
869 }
a61af66fc99e Initial load
duke
parents:
diff changeset
870
a61af66fc99e Initial load
duke
parents:
diff changeset
871 void PhaseCFG::dump( ) const {
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
872 tty->print("\n--- CFG --- %d BBs\n", number_of_blocks());
12023
d1034bd8cefc 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 9060
diff changeset
873 if (_blocks.size()) { // Did we do basic-block layout?
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
874 for (uint i = 0; i < number_of_blocks(); i++) {
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
875 const Block* block = get_block(i);
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
876 block->dump(this);
12023
d1034bd8cefc 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 9060
diff changeset
877 }
0
a61af66fc99e Initial load
duke
parents:
diff changeset
878 } else { // Else do it with a DFS
12023
d1034bd8cefc 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 9060
diff changeset
879 VectorSet visited(_block_arena);
0
a61af66fc99e Initial load
duke
parents:
diff changeset
880 _dump_cfg(_root,visited);
a61af66fc99e Initial load
duke
parents:
diff changeset
881 }
a61af66fc99e Initial load
duke
parents:
diff changeset
882 }
a61af66fc99e Initial load
duke
parents:
diff changeset
883
a61af66fc99e Initial load
duke
parents:
diff changeset
884 void PhaseCFG::dump_headers() {
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
885 for (uint i = 0; i < number_of_blocks(); i++) {
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
886 Block* block = get_block(i);
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
887 if (block != NULL) {
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
888 block->dump_head(this);
12023
d1034bd8cefc 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 9060
diff changeset
889 }
0
a61af66fc99e Initial load
duke
parents:
diff changeset
890 }
a61af66fc99e Initial load
duke
parents:
diff changeset
891 }
a61af66fc99e Initial load
duke
parents:
diff changeset
892
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
893 void PhaseCFG::verify() const {
566
91263420e1c6 6791852: assert(b->_nodes[insidx] == n,"got insidx set incorrectly")
kvn
parents: 418
diff changeset
894 #ifdef ASSERT
0
a61af66fc99e Initial load
duke
parents:
diff changeset
895 // Verify sane CFG
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
896 for (uint i = 0; i < number_of_blocks(); i++) {
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
897 Block* block = get_block(i);
12167
650868c062a9 8023691: Create interface for nodes in class Block
adlertz
parents: 12071
diff changeset
898 uint cnt = block->number_of_nodes();
0
a61af66fc99e Initial load
duke
parents:
diff changeset
899 uint j;
4115
1bd45abaa507 6890673: Eliminate allocations immediately after EA
kvn
parents: 3929
diff changeset
900 for (j = 0; j < cnt; j++) {
12167
650868c062a9 8023691: Create interface for nodes in class Block
adlertz
parents: 12071
diff changeset
901 Node *n = block->get_node(j);
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
902 assert(get_block_for_node(n) == block, "");
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
903 if (j >= 1 && n->is_Mach() && n->as_Mach()->ideal_Opcode() == Op_CreateEx) {
12167
650868c062a9 8023691: Create interface for nodes in class Block
adlertz
parents: 12071
diff changeset
904 assert(j == 1 || block->get_node(j-1)->is_Phi(), "CreateEx must be first instruction in block");
0
a61af66fc99e Initial load
duke
parents:
diff changeset
905 }
4115
1bd45abaa507 6890673: Eliminate allocations immediately after EA
kvn
parents: 3929
diff changeset
906 for (uint k = 0; k < n->req(); k++) {
566
91263420e1c6 6791852: assert(b->_nodes[insidx] == n,"got insidx set incorrectly")
kvn
parents: 418
diff changeset
907 Node *def = n->in(k);
4115
1bd45abaa507 6890673: Eliminate allocations immediately after EA
kvn
parents: 3929
diff changeset
908 if (def && def != n) {
12023
d1034bd8cefc 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 9060
diff changeset
909 assert(get_block_for_node(def) || def->is_Con(), "must have block; constants for debug info ok");
566
91263420e1c6 6791852: assert(b->_nodes[insidx] == n,"got insidx set incorrectly")
kvn
parents: 418
diff changeset
910 // Verify that instructions in the block is in correct order.
91263420e1c6 6791852: assert(b->_nodes[insidx] == n,"got insidx set incorrectly")
kvn
parents: 418
diff changeset
911 // Uses must follow their definition if they are at the same block.
91263420e1c6 6791852: assert(b->_nodes[insidx] == n,"got insidx set incorrectly")
kvn
parents: 418
diff changeset
912 // Mostly done to check that MachSpillCopy nodes are placed correctly
91263420e1c6 6791852: assert(b->_nodes[insidx] == n,"got insidx set incorrectly")
kvn
parents: 418
diff changeset
913 // when CreateEx node is moved in build_ifg_physical().
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
914 if (get_block_for_node(def) == block && !(block->head()->is_Loop() && n->is_Phi()) &&
566
91263420e1c6 6791852: assert(b->_nodes[insidx] == n,"got insidx set incorrectly")
kvn
parents: 418
diff changeset
915 // See (+++) comment in reg_split.cpp
4115
1bd45abaa507 6890673: Eliminate allocations immediately after EA
kvn
parents: 3929
diff changeset
916 !(n->jvms() != NULL && n->jvms()->is_monitor_use(k))) {
893
dd0a4e1e219b 6851386: assert(b->find_node(def) < j,"uses must follow definitions")
kvn
parents: 833
diff changeset
917 bool is_loop = false;
dd0a4e1e219b 6851386: assert(b->find_node(def) < j,"uses must follow definitions")
kvn
parents: 833
diff changeset
918 if (n->is_Phi()) {
4115
1bd45abaa507 6890673: Eliminate allocations immediately after EA
kvn
parents: 3929
diff changeset
919 for (uint l = 1; l < def->req(); l++) {
893
dd0a4e1e219b 6851386: assert(b->find_node(def) < j,"uses must follow definitions")
kvn
parents: 833
diff changeset
920 if (n == def->in(l)) {
dd0a4e1e219b 6851386: assert(b->find_node(def) < j,"uses must follow definitions")
kvn
parents: 833
diff changeset
921 is_loop = true;
dd0a4e1e219b 6851386: assert(b->find_node(def) < j,"uses must follow definitions")
kvn
parents: 833
diff changeset
922 break; // Some kind of loop
dd0a4e1e219b 6851386: assert(b->find_node(def) < j,"uses must follow definitions")
kvn
parents: 833
diff changeset
923 }
dd0a4e1e219b 6851386: assert(b->find_node(def) < j,"uses must follow definitions")
kvn
parents: 833
diff changeset
924 }
dd0a4e1e219b 6851386: assert(b->find_node(def) < j,"uses must follow definitions")
kvn
parents: 833
diff changeset
925 }
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
926 assert(is_loop || block->find_node(def) < j, "uses must follow definitions");
601
523ded093c31 6809798: SafePointScalarObject node placed into incorrect block during GCM
kvn
parents: 566
diff changeset
927 }
0
a61af66fc99e Initial load
duke
parents:
diff changeset
928 }
a61af66fc99e Initial load
duke
parents:
diff changeset
929 }
a61af66fc99e Initial load
duke
parents:
diff changeset
930 }
a61af66fc99e Initial load
duke
parents:
diff changeset
931
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
932 j = block->end_idx();
12167
650868c062a9 8023691: Create interface for nodes in class Block
adlertz
parents: 12071
diff changeset
933 Node* bp = (Node*)block->get_node(block->number_of_nodes() - 1)->is_block_proj();
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
934 assert(bp, "last instruction must be a block proj");
12167
650868c062a9 8023691: Create interface for nodes in class Block
adlertz
parents: 12071
diff changeset
935 assert(bp == block->get_node(j), "wrong number of successors for this block");
4115
1bd45abaa507 6890673: Eliminate allocations immediately after EA
kvn
parents: 3929
diff changeset
936 if (bp->is_Catch()) {
12167
650868c062a9 8023691: Create interface for nodes in class Block
adlertz
parents: 12071
diff changeset
937 while (block->get_node(--j)->is_MachProj()) {
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
938 ;
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
939 }
12167
650868c062a9 8023691: Create interface for nodes in class Block
adlertz
parents: 12071
diff changeset
940 assert(block->get_node(j)->is_MachCall(), "CatchProj must follow call");
4115
1bd45abaa507 6890673: Eliminate allocations immediately after EA
kvn
parents: 3929
diff changeset
941 } else if (bp->is_Mach() && bp->as_Mach()->ideal_Opcode() == Op_If) {
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
942 assert(block->_num_succs == 2, "Conditional branch must have two targets");
0
a61af66fc99e Initial load
duke
parents:
diff changeset
943 }
a61af66fc99e Initial load
duke
parents:
diff changeset
944 }
566
91263420e1c6 6791852: assert(b->_nodes[insidx] == n,"got insidx set incorrectly")
kvn
parents: 418
diff changeset
945 #endif
0
a61af66fc99e Initial load
duke
parents:
diff changeset
946 }
a61af66fc99e Initial load
duke
parents:
diff changeset
947 #endif
a61af66fc99e Initial load
duke
parents:
diff changeset
948
a61af66fc99e Initial load
duke
parents:
diff changeset
949 UnionFind::UnionFind( uint max ) : _cnt(max), _max(max), _indices(NEW_RESOURCE_ARRAY(uint,max)) {
a61af66fc99e Initial load
duke
parents:
diff changeset
950 Copy::zero_to_bytes( _indices, sizeof(uint)*max );
a61af66fc99e Initial load
duke
parents:
diff changeset
951 }
a61af66fc99e Initial load
duke
parents:
diff changeset
952
a61af66fc99e Initial load
duke
parents:
diff changeset
953 void UnionFind::extend( uint from_idx, uint to_idx ) {
a61af66fc99e Initial load
duke
parents:
diff changeset
954 _nesting.check();
a61af66fc99e Initial load
duke
parents:
diff changeset
955 if( from_idx >= _max ) {
a61af66fc99e Initial load
duke
parents:
diff changeset
956 uint size = 16;
a61af66fc99e Initial load
duke
parents:
diff changeset
957 while( size <= from_idx ) size <<=1;
a61af66fc99e Initial load
duke
parents:
diff changeset
958 _indices = REALLOC_RESOURCE_ARRAY( uint, _indices, _max, size );
a61af66fc99e Initial load
duke
parents:
diff changeset
959 _max = size;
a61af66fc99e Initial load
duke
parents:
diff changeset
960 }
a61af66fc99e Initial load
duke
parents:
diff changeset
961 while( _cnt <= from_idx ) _indices[_cnt++] = 0;
a61af66fc99e Initial load
duke
parents:
diff changeset
962 _indices[from_idx] = to_idx;
a61af66fc99e Initial load
duke
parents:
diff changeset
963 }
a61af66fc99e Initial load
duke
parents:
diff changeset
964
a61af66fc99e Initial load
duke
parents:
diff changeset
965 void UnionFind::reset( uint max ) {
a61af66fc99e Initial load
duke
parents:
diff changeset
966 assert( max <= max_uint, "Must fit within uint" );
a61af66fc99e Initial load
duke
parents:
diff changeset
967 // Force the Union-Find mapping to be at least this large
a61af66fc99e Initial load
duke
parents:
diff changeset
968 extend(max,0);
a61af66fc99e Initial load
duke
parents:
diff changeset
969 // Initialize to be the ID mapping.
418
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
970 for( uint i=0; i<max; i++ ) map(i,i);
0
a61af66fc99e Initial load
duke
parents:
diff changeset
971 }
a61af66fc99e Initial load
duke
parents:
diff changeset
972
a61af66fc99e Initial load
duke
parents:
diff changeset
973 // Straight out of Tarjan's union-find algorithm
a61af66fc99e Initial load
duke
parents:
diff changeset
974 uint UnionFind::Find_compress( uint idx ) {
a61af66fc99e Initial load
duke
parents:
diff changeset
975 uint cur = idx;
a61af66fc99e Initial load
duke
parents:
diff changeset
976 uint next = lookup(cur);
a61af66fc99e Initial load
duke
parents:
diff changeset
977 while( next != cur ) { // Scan chain of equivalences
a61af66fc99e Initial load
duke
parents:
diff changeset
978 assert( next < cur, "always union smaller" );
a61af66fc99e Initial load
duke
parents:
diff changeset
979 cur = next; // until find a fixed-point
a61af66fc99e Initial load
duke
parents:
diff changeset
980 next = lookup(cur);
a61af66fc99e Initial load
duke
parents:
diff changeset
981 }
a61af66fc99e Initial load
duke
parents:
diff changeset
982 // Core of union-find algorithm: update chain of
a61af66fc99e Initial load
duke
parents:
diff changeset
983 // equivalences to be equal to the root.
a61af66fc99e Initial load
duke
parents:
diff changeset
984 while( idx != next ) {
a61af66fc99e Initial load
duke
parents:
diff changeset
985 uint tmp = lookup(idx);
a61af66fc99e Initial load
duke
parents:
diff changeset
986 map(idx, next);
a61af66fc99e Initial load
duke
parents:
diff changeset
987 idx = tmp;
a61af66fc99e Initial load
duke
parents:
diff changeset
988 }
a61af66fc99e Initial load
duke
parents:
diff changeset
989 return idx;
a61af66fc99e Initial load
duke
parents:
diff changeset
990 }
a61af66fc99e Initial load
duke
parents:
diff changeset
991
a61af66fc99e Initial load
duke
parents:
diff changeset
992 // Like Find above, but no path compress, so bad asymptotic behavior
a61af66fc99e Initial load
duke
parents:
diff changeset
993 uint UnionFind::Find_const( uint idx ) const {
a61af66fc99e Initial load
duke
parents:
diff changeset
994 if( idx == 0 ) return idx; // Ignore the zero idx
a61af66fc99e Initial load
duke
parents:
diff changeset
995 // Off the end? This can happen during debugging dumps
a61af66fc99e Initial load
duke
parents:
diff changeset
996 // when data structures have not finished being updated.
a61af66fc99e Initial load
duke
parents:
diff changeset
997 if( idx >= _max ) return idx;
a61af66fc99e Initial load
duke
parents:
diff changeset
998 uint next = lookup(idx);
a61af66fc99e Initial load
duke
parents:
diff changeset
999 while( next != idx ) { // Scan chain of equivalences
a61af66fc99e Initial load
duke
parents:
diff changeset
1000 idx = next; // until find a fixed-point
a61af66fc99e Initial load
duke
parents:
diff changeset
1001 next = lookup(idx);
a61af66fc99e Initial load
duke
parents:
diff changeset
1002 }
a61af66fc99e Initial load
duke
parents:
diff changeset
1003 return next;
a61af66fc99e Initial load
duke
parents:
diff changeset
1004 }
a61af66fc99e Initial load
duke
parents:
diff changeset
1005
a61af66fc99e Initial load
duke
parents:
diff changeset
1006 // union 2 sets together.
a61af66fc99e Initial load
duke
parents:
diff changeset
1007 void UnionFind::Union( uint idx1, uint idx2 ) {
a61af66fc99e Initial load
duke
parents:
diff changeset
1008 uint src = Find(idx1);
a61af66fc99e Initial load
duke
parents:
diff changeset
1009 uint dst = Find(idx2);
a61af66fc99e Initial load
duke
parents:
diff changeset
1010 assert( src, "" );
a61af66fc99e Initial load
duke
parents:
diff changeset
1011 assert( dst, "" );
a61af66fc99e Initial load
duke
parents:
diff changeset
1012 assert( src < _max, "oob" );
a61af66fc99e Initial load
duke
parents:
diff changeset
1013 assert( dst < _max, "oob" );
a61af66fc99e Initial load
duke
parents:
diff changeset
1014 assert( src < dst, "always union smaller" );
a61af66fc99e Initial load
duke
parents:
diff changeset
1015 map(dst,src);
a61af66fc99e Initial load
duke
parents:
diff changeset
1016 }
418
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1017
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1018 #ifndef PRODUCT
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1019 void Trace::dump( ) const {
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1020 tty->print_cr("Trace (freq %f)", first_block()->_freq);
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1021 for (Block *b = first_block(); b != NULL; b = next(b)) {
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1022 tty->print(" B%d", b->_pre_order);
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1023 if (b->head()->is_Loop()) {
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1024 tty->print(" (L%d)", b->compute_loop_alignment());
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1025 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1026 if (b->has_loop_alignment()) {
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1027 tty->print(" (T%d)", b->code_alignment());
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1028 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1029 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1030 tty->cr();
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1031 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1032
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1033 void CFGEdge::dump( ) const {
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1034 tty->print(" B%d --> B%d Freq: %f out:%3d%% in:%3d%% State: ",
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1035 from()->_pre_order, to()->_pre_order, freq(), _from_pct, _to_pct);
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1036 switch(state()) {
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1037 case connected:
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1038 tty->print("connected");
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1039 break;
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1040 case open:
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1041 tty->print("open");
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1042 break;
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1043 case interior:
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1044 tty->print("interior");
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1045 break;
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1046 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1047 if (infrequent()) {
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1048 tty->print(" infrequent");
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1049 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1050 tty->cr();
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1051 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1052 #endif
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1053
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1054 // Comparison function for edges
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1055 static int edge_order(CFGEdge **e0, CFGEdge **e1) {
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1056 float freq0 = (*e0)->freq();
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1057 float freq1 = (*e1)->freq();
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1058 if (freq0 != freq1) {
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1059 return freq0 > freq1 ? -1 : 1;
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1060 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1061
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1062 int dist0 = (*e0)->to()->_rpo - (*e0)->from()->_rpo;
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1063 int dist1 = (*e1)->to()->_rpo - (*e1)->from()->_rpo;
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1064
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1065 return dist1 - dist0;
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1066 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1067
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1068 // Comparison function for edges
3929
f94227b6117b 7090259: Fix hotspot sources to build with old compilers
kvn
parents: 3853
diff changeset
1069 extern "C" int trace_frequency_order(const void *p0, const void *p1) {
418
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1070 Trace *tr0 = *(Trace **) p0;
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1071 Trace *tr1 = *(Trace **) p1;
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1072 Block *b0 = tr0->first_block();
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1073 Block *b1 = tr1->first_block();
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1074
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1075 // The trace of connector blocks goes at the end;
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1076 // we only expect one such trace
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1077 if (b0->is_connector() != b1->is_connector()) {
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1078 return b1->is_connector() ? -1 : 1;
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1079 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1080
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1081 // Pull more frequently executed blocks to the beginning
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1082 float freq0 = b0->_freq;
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1083 float freq1 = b1->_freq;
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1084 if (freq0 != freq1) {
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1085 return freq0 > freq1 ? -1 : 1;
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1086 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1087
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1088 int diff = tr0->first_block()->_rpo - tr1->first_block()->_rpo;
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1089
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1090 return diff;
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1091 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1092
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1093 // Find edges of interest, i.e, those which can fall through. Presumes that
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1094 // edges which don't fall through are of low frequency and can be generally
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1095 // ignored. Initialize the list of traces.
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
1096 void PhaseBlockLayout::find_edges() {
418
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1097 // Walk the blocks, creating edges and Traces
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1098 uint i;
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1099 Trace *tr = NULL;
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
1100 for (i = 0; i < _cfg.number_of_blocks(); i++) {
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
1101 Block* b = _cfg.get_block(i);
418
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1102 tr = new Trace(b, next, prev);
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1103 traces[tr->id()] = tr;
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1104
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1105 // All connector blocks should be at the end of the list
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1106 if (b->is_connector()) break;
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1107
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1108 // If this block and the next one have a one-to-one successor
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1109 // predecessor relationship, simply append the next block
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1110 int nfallthru = b->num_fall_throughs();
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1111 while (nfallthru == 1 &&
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1112 b->succ_fall_through(0)) {
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1113 Block *n = b->_succs[0];
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1114
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1115 // Skip over single-entry connector blocks, we don't want to
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1116 // add them to the trace.
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1117 while (n->is_connector() && n->num_preds() == 1) {
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1118 n = n->_succs[0];
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1119 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1120
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1121 // We see a merge point, so stop search for the next block
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1122 if (n->num_preds() != 1) break;
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1123
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1124 i++;
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
1125 assert(n = _cfg.get_block(i), "expecting next block");
418
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1126 tr->append(n);
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1127 uf->map(n->_pre_order, tr->id());
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1128 traces[n->_pre_order] = NULL;
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1129 nfallthru = b->num_fall_throughs();
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1130 b = n;
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1131 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1132
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1133 if (nfallthru > 0) {
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1134 // Create a CFGEdge for each outgoing
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1135 // edge that could be a fall-through.
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1136 for (uint j = 0; j < b->_num_succs; j++ ) {
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1137 if (b->succ_fall_through(j)) {
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1138 Block *target = b->non_connector_successor(j);
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1139 float freq = b->_freq * b->succ_prob(j);
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1140 int from_pct = (int) ((100 * freq) / b->_freq);
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1141 int to_pct = (int) ((100 * freq) / target->_freq);
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1142 edges->append(new CFGEdge(b, target, freq, from_pct, to_pct));
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1143 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1144 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1145 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1146 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1147
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1148 // Group connector blocks into one trace
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
1149 for (i++; i < _cfg.number_of_blocks(); i++) {
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
1150 Block *b = _cfg.get_block(i);
418
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1151 assert(b->is_connector(), "connector blocks at the end");
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1152 tr->append(b);
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1153 uf->map(b->_pre_order, tr->id());
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1154 traces[b->_pre_order] = NULL;
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1155 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1156 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1157
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1158 // Union two traces together in uf, and null out the trace in the list
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
1159 void PhaseBlockLayout::union_traces(Trace* updated_trace, Trace* old_trace) {
418
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1160 uint old_id = old_trace->id();
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1161 uint updated_id = updated_trace->id();
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1162
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1163 uint lo_id = updated_id;
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1164 uint hi_id = old_id;
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1165
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1166 // If from is greater than to, swap values to meet
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1167 // UnionFind guarantee.
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1168 if (updated_id > old_id) {
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1169 lo_id = old_id;
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1170 hi_id = updated_id;
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1171
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1172 // Fix up the trace ids
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1173 traces[lo_id] = traces[updated_id];
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1174 updated_trace->set_id(lo_id);
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1175 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1176
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1177 // Union the lower with the higher and remove the pointer
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1178 // to the higher.
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1179 uf->Union(lo_id, hi_id);
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1180 traces[hi_id] = NULL;
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1181 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1182
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1183 // Append traces together via the most frequently executed edges
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
1184 void PhaseBlockLayout::grow_traces() {
418
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1185 // Order the edges, and drive the growth of Traces via the most
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1186 // frequently executed edges.
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1187 edges->sort(edge_order);
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1188 for (int i = 0; i < edges->length(); i++) {
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1189 CFGEdge *e = edges->at(i);
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1190
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1191 if (e->state() != CFGEdge::open) continue;
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1192
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1193 Block *src_block = e->from();
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1194 Block *targ_block = e->to();
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1195
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1196 // Don't grow traces along backedges?
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1197 if (!BlockLayoutRotateLoops) {
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1198 if (targ_block->_rpo <= src_block->_rpo) {
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1199 targ_block->set_loop_alignment(targ_block);
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1200 continue;
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1201 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1202 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1203
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1204 Trace *src_trace = trace(src_block);
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1205 Trace *targ_trace = trace(targ_block);
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1206
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1207 // If the edge in question can join two traces at their ends,
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1208 // append one trace to the other.
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1209 if (src_trace->last_block() == src_block) {
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1210 if (src_trace == targ_trace) {
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1211 e->set_state(CFGEdge::interior);
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1212 if (targ_trace->backedge(e)) {
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1213 // Reset i to catch any newly eligible edge
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1214 // (Or we could remember the first "open" edge, and reset there)
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1215 i = 0;
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1216 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1217 } else if (targ_trace->first_block() == targ_block) {
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1218 e->set_state(CFGEdge::connected);
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1219 src_trace->append(targ_trace);
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1220 union_traces(src_trace, targ_trace);
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1221 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1222 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1223 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1224 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1225
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1226 // Embed one trace into another, if the fork or join points are sufficiently
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1227 // balanced.
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
1228 void PhaseBlockLayout::merge_traces(bool fall_thru_only) {
418
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1229 // Walk the edge list a another time, looking at unprocessed edges.
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1230 // Fold in diamonds
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1231 for (int i = 0; i < edges->length(); i++) {
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1232 CFGEdge *e = edges->at(i);
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1233
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1234 if (e->state() != CFGEdge::open) continue;
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1235 if (fall_thru_only) {
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1236 if (e->infrequent()) continue;
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1237 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1238
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1239 Block *src_block = e->from();
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1240 Trace *src_trace = trace(src_block);
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1241 bool src_at_tail = src_trace->last_block() == src_block;
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1242
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1243 Block *targ_block = e->to();
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1244 Trace *targ_trace = trace(targ_block);
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1245 bool targ_at_start = targ_trace->first_block() == targ_block;
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1246
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1247 if (src_trace == targ_trace) {
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1248 // This may be a loop, but we can't do much about it.
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1249 e->set_state(CFGEdge::interior);
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1250 continue;
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1251 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1252
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1253 if (fall_thru_only) {
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1254 // If the edge links the middle of two traces, we can't do anything.
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1255 // Mark the edge and continue.
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1256 if (!src_at_tail & !targ_at_start) {
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1257 continue;
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1258 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1259
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1260 // Don't grow traces along backedges?
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1261 if (!BlockLayoutRotateLoops && (targ_block->_rpo <= src_block->_rpo)) {
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1262 continue;
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1263 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1264
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1265 // If both ends of the edge are available, why didn't we handle it earlier?
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1266 assert(src_at_tail ^ targ_at_start, "Should have caught this edge earlier.");
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1267
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1268 if (targ_at_start) {
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1269 // Insert the "targ" trace in the "src" trace if the insertion point
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1270 // is a two way branch.
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1271 // Better profitability check possible, but may not be worth it.
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1272 // Someday, see if the this "fork" has an associated "join";
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1273 // then make a policy on merging this trace at the fork or join.
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1274 // For example, other things being equal, it may be better to place this
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1275 // trace at the join point if the "src" trace ends in a two-way, but
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1276 // the insertion point is one-way.
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1277 assert(src_block->num_fall_throughs() == 2, "unexpected diamond");
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1278 e->set_state(CFGEdge::connected);
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1279 src_trace->insert_after(src_block, targ_trace);
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1280 union_traces(src_trace, targ_trace);
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1281 } else if (src_at_tail) {
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
1282 if (src_trace != trace(_cfg.get_root_block())) {
418
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1283 e->set_state(CFGEdge::connected);
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1284 targ_trace->insert_before(targ_block, src_trace);
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1285 union_traces(targ_trace, src_trace);
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1286 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1287 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1288 } else if (e->state() == CFGEdge::open) {
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1289 // Append traces, even without a fall-thru connection.
605
98cb887364d3 6810672: Comment typos
twisti
parents: 601
diff changeset
1290 // But leave root entry at the beginning of the block list.
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
1291 if (targ_trace != trace(_cfg.get_root_block())) {
418
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1292 e->set_state(CFGEdge::connected);
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1293 src_trace->append(targ_trace);
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1294 union_traces(src_trace, targ_trace);
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1295 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1296 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1297 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1298 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1299
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1300 // Order the sequence of the traces in some desirable way, and fixup the
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1301 // jumps at the end of each block.
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
1302 void PhaseBlockLayout::reorder_traces(int count) {
418
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1303 ResourceArea *area = Thread::current()->resource_area();
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1304 Trace ** new_traces = NEW_ARENA_ARRAY(area, Trace *, count);
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1305 Block_List worklist;
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1306 int new_count = 0;
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1307
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1308 // Compact the traces.
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1309 for (int i = 0; i < count; i++) {
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1310 Trace *tr = traces[i];
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1311 if (tr != NULL) {
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1312 new_traces[new_count++] = tr;
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1313 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1314 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1315
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1316 // The entry block should be first on the new trace list.
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
1317 Trace *tr = trace(_cfg.get_root_block());
418
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1318 assert(tr == new_traces[0], "entry trace misplaced");
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1319
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1320 // Sort the new trace list by frequency
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1321 qsort(new_traces + 1, new_count - 1, sizeof(new_traces[0]), trace_frequency_order);
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1322
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1323 // Patch up the successor blocks
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
1324 _cfg.clear_blocks();
418
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1325 for (int i = 0; i < new_count; i++) {
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1326 Trace *tr = new_traces[i];
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1327 if (tr != NULL) {
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1328 tr->fixup_blocks(_cfg);
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1329 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1330 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1331 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1332
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1333 // Order basic blocks based on frequency
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
1334 PhaseBlockLayout::PhaseBlockLayout(PhaseCFG &cfg)
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
1335 : Phase(BlockLayout)
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
1336 , _cfg(cfg) {
418
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1337 ResourceMark rm;
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1338 ResourceArea *area = Thread::current()->resource_area();
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1339
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1340 // List of traces
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
1341 int size = _cfg.number_of_blocks() + 1;
418
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1342 traces = NEW_ARENA_ARRAY(area, Trace *, size);
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1343 memset(traces, 0, size*sizeof(Trace*));
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1344 next = NEW_ARENA_ARRAY(area, Block *, size);
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1345 memset(next, 0, size*sizeof(Block *));
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1346 prev = NEW_ARENA_ARRAY(area, Block *, size);
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1347 memset(prev , 0, size*sizeof(Block *));
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1348
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1349 // List of edges
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1350 edges = new GrowableArray<CFGEdge*>;
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1351
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1352 // Mapping block index --> block_trace
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1353 uf = new UnionFind(size);
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1354 uf->reset(size);
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1355
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1356 // Find edges and create traces.
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1357 find_edges();
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1358
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1359 // Grow traces at their ends via most frequent edges.
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1360 grow_traces();
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1361
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1362 // Merge one trace into another, but only at fall-through points.
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1363 // This may make diamonds and other related shapes in a trace.
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1364 merge_traces(true);
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1365
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1366 // Run merge again, allowing two traces to be catenated, even if
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1367 // one does not fall through into the other. This appends loosely
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1368 // related traces to be near each other.
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1369 merge_traces(false);
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1370
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1371 // Re-order all the remaining traces by frequency
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1372 reorder_traces(size);
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1373
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
1374 assert(_cfg.number_of_blocks() >= (uint) (size - 1), "number of blocks can not shrink");
418
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1375 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1376
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1377
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1378 // Edge e completes a loop in a trace. If the target block is head of the
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1379 // loop, rotate the loop block so that the loop ends in a conditional branch.
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1380 bool Trace::backedge(CFGEdge *e) {
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1381 bool loop_rotated = false;
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1382 Block *src_block = e->from();
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1383 Block *targ_block = e->to();
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1384
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1385 assert(last_block() == src_block, "loop discovery at back branch");
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1386 if (first_block() == targ_block) {
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1387 if (BlockLayoutRotateLoops && last_block()->num_fall_throughs() < 2) {
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1388 // Find the last block in the trace that has a conditional
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1389 // branch.
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1390 Block *b;
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1391 for (b = last_block(); b != NULL; b = prev(b)) {
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1392 if (b->num_fall_throughs() == 2) {
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1393 break;
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1394 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1395 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1396
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1397 if (b != last_block() && b != NULL) {
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1398 loop_rotated = true;
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1399
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1400 // Rotate the loop by doing two-part linked-list surgery.
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1401 append(first_block());
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1402 break_loop_after(b);
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1403 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1404 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1405
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1406 // Backbranch to the top of a trace
605
98cb887364d3 6810672: Comment typos
twisti
parents: 601
diff changeset
1407 // Scroll forward through the trace from the targ_block. If we find
418
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1408 // a loop head before another loop top, use the the loop head alignment.
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1409 for (Block *b = targ_block; b != NULL; b = next(b)) {
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1410 if (b->has_loop_alignment()) {
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1411 break;
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1412 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1413 if (b->head()->is_Loop()) {
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1414 targ_block = b;
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1415 break;
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1416 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1417 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1418
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1419 first_block()->set_loop_alignment(targ_block);
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1420
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1421 } else {
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1422 // Backbranch into the middle of a trace
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1423 targ_block->set_loop_alignment(targ_block);
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1424 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1425
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1426 return loop_rotated;
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1427 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1428
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1429 // push blocks onto the CFG list
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1430 // ensure that blocks have the correct two-way branch sense
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1431 void Trace::fixup_blocks(PhaseCFG &cfg) {
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1432 Block *last = last_block();
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1433 for (Block *b = first_block(); b != NULL; b = next(b)) {
12071
adb9a7d94cb5 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 12023
diff changeset
1434 cfg.add_block(b);
418
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1435 if (!b->is_connector()) {
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1436 int nfallthru = b->num_fall_throughs();
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1437 if (b != last) {
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1438 if (nfallthru == 2) {
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1439 // Ensure that the sense of the branch is correct
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1440 Block *bnext = next(b);
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1441 Block *bs0 = b->non_connector_successor(0);
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1442
12167
650868c062a9 8023691: Create interface for nodes in class Block
adlertz
parents: 12071
diff changeset
1443 MachNode *iff = b->get_node(b->number_of_nodes() - 3)->as_Mach();
650868c062a9 8023691: Create interface for nodes in class Block
adlertz
parents: 12071
diff changeset
1444 ProjNode *proj0 = b->get_node(b->number_of_nodes() - 2)->as_Proj();
650868c062a9 8023691: Create interface for nodes in class Block
adlertz
parents: 12071
diff changeset
1445 ProjNode *proj1 = b->get_node(b->number_of_nodes() - 1)->as_Proj();
418
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1446
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1447 if (bnext == bs0) {
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1448 // Fall-thru case in succs[0], should be in succs[1]
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1449
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1450 // Flip targets in _succs map
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1451 Block *tbs0 = b->_succs[0];
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1452 Block *tbs1 = b->_succs[1];
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1453 b->_succs.map( 0, tbs1 );
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1454 b->_succs.map( 1, tbs0 );
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1455
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1456 // Flip projections to match targets
12167
650868c062a9 8023691: Create interface for nodes in class Block
adlertz
parents: 12071
diff changeset
1457 b->map_node(proj1, b->number_of_nodes() - 2);
650868c062a9 8023691: Create interface for nodes in class Block
adlertz
parents: 12071
diff changeset
1458 b->map_node(proj0, b->number_of_nodes() - 1);
418
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1459 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1460 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1461 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1462 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1463 }
72c5366e5d86 6743900: frequency based block layout
rasbold
parents: 337
diff changeset
1464 }