| File: | jdk/src/hotspot/share/opto/block.cpp |
| Warning: | line 1249, column 11 Called C++ object pointer is null |
Press '?' to see keyboard shortcuts
Keyboard shortcuts:
| 1 | /* | ||||
| 2 | * Copyright (c) 1997, 2021, Oracle and/or its affiliates. All rights reserved. | ||||
| 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. | ||||
| 4 | * | ||||
| 5 | * This code is free software; you can redistribute it and/or modify it | ||||
| 6 | * under the terms of the GNU General Public License version 2 only, as | ||||
| 7 | * published by the Free Software Foundation. | ||||
| 8 | * | ||||
| 9 | * This code is distributed in the hope that it will be useful, but WITHOUT | ||||
| 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | ||||
| 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | ||||
| 12 | * version 2 for more details (a copy is included in the LICENSE file that | ||||
| 13 | * accompanied this code). | ||||
| 14 | * | ||||
| 15 | * You should have received a copy of the GNU General Public License version | ||||
| 16 | * 2 along with this work; if not, write to the Free Software Foundation, | ||||
| 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. | ||||
| 18 | * | ||||
| 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA | ||||
| 20 | * or visit www.oracle.com if you need additional information or have any | ||||
| 21 | * questions. | ||||
| 22 | * | ||||
| 23 | */ | ||||
| 24 | |||||
| 25 | #include "precompiled.hpp" | ||||
| 26 | #include "libadt/vectset.hpp" | ||||
| 27 | #include "memory/allocation.inline.hpp" | ||||
| 28 | #include "memory/resourceArea.hpp" | ||||
| 29 | #include "compiler/compilerDirectives.hpp" | ||||
| 30 | #include "opto/block.hpp" | ||||
| 31 | #include "opto/cfgnode.hpp" | ||||
| 32 | #include "opto/chaitin.hpp" | ||||
| 33 | #include "opto/loopnode.hpp" | ||||
| 34 | #include "opto/machnode.hpp" | ||||
| 35 | #include "opto/matcher.hpp" | ||||
| 36 | #include "opto/opcodes.hpp" | ||||
| 37 | #include "opto/rootnode.hpp" | ||||
| 38 | #include "utilities/copy.hpp" | ||||
| 39 | #include "utilities/powerOfTwo.hpp" | ||||
| 40 | |||||
| 41 | void Block_Array::grow( uint i ) { | ||||
| 42 | assert(i >= Max(), "must be an overflow")do { if (!(i >= Max())) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/block.cpp" , 42, "assert(" "i >= Max()" ") failed", "must be an overflow" ); ::breakpoint(); } } while (0); | ||||
| 43 | debug_only(_limit = i+1)_limit = i+1; | ||||
| 44 | if( i < _size ) return; | ||||
| 45 | if( !_size ) { | ||||
| 46 | _size = 1; | ||||
| 47 | _blocks = (Block**)_arena->Amalloc( _size * sizeof(Block*) ); | ||||
| 48 | _blocks[0] = NULL__null; | ||||
| 49 | } | ||||
| 50 | uint old = _size; | ||||
| 51 | _size = next_power_of_2(i); | ||||
| 52 | _blocks = (Block**)_arena->Arealloc( _blocks, old*sizeof(Block*),_size*sizeof(Block*)); | ||||
| 53 | Copy::zero_to_bytes( &_blocks[old], (_size-old)*sizeof(Block*) ); | ||||
| 54 | } | ||||
| 55 | |||||
| 56 | void Block_List::remove(uint i) { | ||||
| 57 | assert(i < _cnt, "index out of bounds")do { if (!(i < _cnt)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/block.cpp" , 57, "assert(" "i < _cnt" ") failed", "index out of bounds" ); ::breakpoint(); } } while (0); | ||||
| 58 | Copy::conjoint_words_to_lower((HeapWord*)&_blocks[i+1], (HeapWord*)&_blocks[i], ((_cnt-i-1)*sizeof(Block*))); | ||||
| 59 | pop(); // shrink list by one block | ||||
| 60 | } | ||||
| 61 | |||||
| 62 | void Block_List::insert(uint i, Block *b) { | ||||
| 63 | push(b); // grow list by one block | ||||
| 64 | Copy::conjoint_words_to_higher((HeapWord*)&_blocks[i], (HeapWord*)&_blocks[i+1], ((_cnt-i-1)*sizeof(Block*))); | ||||
| 65 | _blocks[i] = b; | ||||
| 66 | } | ||||
| 67 | |||||
| 68 | #ifndef PRODUCT | ||||
| 69 | void Block_List::print() { | ||||
| 70 | for (uint i=0; i < size(); i++) { | ||||
| 71 | tty->print("B%d ", _blocks[i]->_pre_order); | ||||
| 72 | } | ||||
| 73 | tty->print("size = %d\n", size()); | ||||
| 74 | } | ||||
| 75 | #endif | ||||
| 76 | |||||
| 77 | uint Block::code_alignment() const { | ||||
| 78 | // Check for Root block | ||||
| 79 | if (_pre_order == 0) return CodeEntryAlignment; | ||||
| 80 | // Check for Start block | ||||
| 81 | if (_pre_order == 1) return InteriorEntryAlignment; | ||||
| 82 | // Check for loop alignment | ||||
| 83 | if (has_loop_alignment()) return loop_alignment(); | ||||
| 84 | |||||
| 85 | return relocInfo::addr_unit(); // no particular alignment | ||||
| 86 | } | ||||
| 87 | |||||
| 88 | uint Block::compute_loop_alignment() { | ||||
| 89 | Node *h = head(); | ||||
| 90 | int unit_sz = relocInfo::addr_unit(); | ||||
| 91 | if (h->is_Loop() && h->as_Loop()->is_inner_loop()) { | ||||
| 92 | // Pre- and post-loops have low trip count so do not bother with | ||||
| 93 | // NOPs for align loop head. The constants are hidden from tuning | ||||
| 94 | // but only because my "divide by 4" heuristic surely gets nearly | ||||
| 95 | // all possible gain (a "do not align at all" heuristic has a | ||||
| 96 | // chance of getting a really tiny gain). | ||||
| 97 | if (h->is_CountedLoop() && (h->as_CountedLoop()->is_pre_loop() || | ||||
| 98 | h->as_CountedLoop()->is_post_loop())) { | ||||
| 99 | return (OptoLoopAlignment > 4*unit_sz) ? (OptoLoopAlignment>>2) : unit_sz; | ||||
| 100 | } | ||||
| 101 | // Loops with low backedge frequency should not be aligned. | ||||
| 102 | Node *n = h->in(LoopNode::LoopBackControl)->in(0); | ||||
| 103 | if (n->is_MachIf() && n->as_MachIf()->_prob < 0.01) { | ||||
| 104 | return unit_sz; // Loop does not loop, more often than not! | ||||
| 105 | } | ||||
| 106 | return OptoLoopAlignment; // Otherwise align loop head | ||||
| 107 | } | ||||
| 108 | |||||
| 109 | return unit_sz; // no particular alignment | ||||
| 110 | } | ||||
| 111 | |||||
| 112 | // Compute the size of first 'inst_cnt' instructions in this block. | ||||
| 113 | // Return the number of instructions left to compute if the block has | ||||
| 114 | // less then 'inst_cnt' instructions. Stop, and return 0 if sum_size | ||||
| 115 | // exceeds OptoLoopAlignment. | ||||
| 116 | uint Block::compute_first_inst_size(uint& sum_size, uint inst_cnt, | ||||
| 117 | PhaseRegAlloc* ra) { | ||||
| 118 | uint last_inst = number_of_nodes(); | ||||
| 119 | for( uint j = 0; j < last_inst && inst_cnt > 0; j++ ) { | ||||
| 120 | uint inst_size = get_node(j)->size(ra); | ||||
| 121 | if( inst_size > 0 ) { | ||||
| 122 | inst_cnt--; | ||||
| 123 | uint sz = sum_size + inst_size; | ||||
| 124 | if( sz <= (uint)OptoLoopAlignment ) { | ||||
| 125 | // Compute size of instructions which fit into fetch buffer only | ||||
| 126 | // since all inst_cnt instructions will not fit even if we align them. | ||||
| 127 | sum_size = sz; | ||||
| 128 | } else { | ||||
| 129 | return 0; | ||||
| 130 | } | ||||
| 131 | } | ||||
| 132 | } | ||||
| 133 | return inst_cnt; | ||||
| 134 | } | ||||
| 135 | |||||
| 136 | uint Block::find_node( const Node *n ) const { | ||||
| 137 | for( uint i = 0; i < number_of_nodes(); i++ ) { | ||||
| 138 | if( get_node(i) == n ) | ||||
| 139 | return i; | ||||
| 140 | } | ||||
| 141 | ShouldNotReachHere()do { (*g_assert_poison) = 'X';; report_should_not_reach_here( "/home/daniel/Projects/java/jdk/src/hotspot/share/opto/block.cpp" , 141); ::breakpoint(); } while (0); | ||||
| 142 | return 0; | ||||
| 143 | } | ||||
| 144 | |||||
| 145 | // Find and remove n from block list | ||||
| 146 | void Block::find_remove( const Node *n ) { | ||||
| 147 | remove_node(find_node(n)); | ||||
| 148 | } | ||||
| 149 | |||||
| 150 | bool Block::contains(const Node *n) const { | ||||
| 151 | return _nodes.contains(n); | ||||
| 152 | } | ||||
| 153 | |||||
| 154 | // Return empty status of a block. Empty blocks contain only the head, other | ||||
| 155 | // ideal nodes, and an optional trailing goto. | ||||
| 156 | int Block::is_Empty() const { | ||||
| 157 | |||||
| 158 | // Root or start block is not considered empty | ||||
| 159 | if (head()->is_Root() || head()->is_Start()) { | ||||
| 160 | return not_empty; | ||||
| 161 | } | ||||
| 162 | |||||
| 163 | int success_result = completely_empty; | ||||
| 164 | int end_idx = number_of_nodes() - 1; | ||||
| 165 | |||||
| 166 | // Check for ending goto | ||||
| 167 | if ((end_idx > 0) && (get_node(end_idx)->is_MachGoto())) { | ||||
| 168 | success_result = empty_with_goto; | ||||
| 169 | end_idx--; | ||||
| 170 | } | ||||
| 171 | |||||
| 172 | // Unreachable blocks are considered empty | ||||
| 173 | if (num_preds() <= 1) { | ||||
| 174 | return success_result; | ||||
| 175 | } | ||||
| 176 | |||||
| 177 | // Ideal nodes are allowable in empty blocks: skip them Only MachNodes | ||||
| 178 | // turn directly into code, because only MachNodes have non-trivial | ||||
| 179 | // emit() functions. | ||||
| 180 | while ((end_idx > 0) && !get_node(end_idx)->is_Mach()) { | ||||
| 181 | end_idx--; | ||||
| 182 | } | ||||
| 183 | |||||
| 184 | // No room for any interesting instructions? | ||||
| 185 | if (end_idx == 0) { | ||||
| 186 | return success_result; | ||||
| 187 | } | ||||
| 188 | |||||
| 189 | return not_empty; | ||||
| 190 | } | ||||
| 191 | |||||
| 192 | // Return true if the block's code implies that it is likely to be | ||||
| 193 | // executed infrequently. Check to see if the block ends in a Halt or | ||||
| 194 | // a low probability call. | ||||
| 195 | bool Block::has_uncommon_code() const { | ||||
| 196 | Node* en = end(); | ||||
| 197 | |||||
| 198 | if (en->is_MachGoto()) | ||||
| 199 | en = en->in(0); | ||||
| 200 | if (en->is_Catch()) | ||||
| 201 | en = en->in(0); | ||||
| 202 | if (en->is_MachProj() && en->in(0)->is_MachCall()) { | ||||
| 203 | MachCallNode* call = en->in(0)->as_MachCall(); | ||||
| 204 | if (call->cnt() != COUNT_UNKNOWN(-1.0f) && call->cnt() <= PROB_UNLIKELY_MAG(4)(1e-4f)) { | ||||
| 205 | // This is true for slow-path stubs like new_{instance,array}, | ||||
| 206 | // slow_arraycopy, complete_monitor_locking, uncommon_trap. | ||||
| 207 | // The magic number corresponds to the probability of an uncommon_trap, | ||||
| 208 | // even though it is a count not a probability. | ||||
| 209 | return true; | ||||
| 210 | } | ||||
| 211 | } | ||||
| 212 | |||||
| 213 | int op = en->is_Mach() ? en->as_Mach()->ideal_Opcode() : en->Opcode(); | ||||
| 214 | return op == Op_Halt; | ||||
| 215 | } | ||||
| 216 | |||||
| 217 | // True if block is low enough frequency or guarded by a test which | ||||
| 218 | // mostly does not go here. | ||||
| 219 | bool PhaseCFG::is_uncommon(const Block* block) { | ||||
| 220 | // Initial blocks must never be moved, so are never uncommon. | ||||
| 221 | if (block->head()->is_Root() || block->head()->is_Start()) return false; | ||||
| 222 | |||||
| 223 | // Check for way-low freq | ||||
| 224 | if(block->_freq < BLOCK_FREQUENCY(0.00001f)((0.00001f * (double) 1500) / FreqCountInvocations) ) return true; | ||||
| 225 | |||||
| 226 | // Look for code shape indicating uncommon_trap or slow path | ||||
| 227 | if (block->has_uncommon_code()) return true; | ||||
| 228 | |||||
| 229 | const float epsilon = 0.05f; | ||||
| 230 | const float guard_factor = PROB_UNLIKELY_MAG(4)(1e-4f) / (1.f - epsilon); | ||||
| 231 | uint uncommon_preds = 0; | ||||
| 232 | uint freq_preds = 0; | ||||
| 233 | uint uncommon_for_freq_preds = 0; | ||||
| 234 | |||||
| 235 | for( uint i=1; i< block->num_preds(); i++ ) { | ||||
| 236 | Block* guard = get_block_for_node(block->pred(i)); | ||||
| 237 | // Check to see if this block follows its guard 1 time out of 10000 | ||||
| 238 | // or less. | ||||
| 239 | // | ||||
| 240 | // See list of magnitude-4 unlikely probabilities in cfgnode.hpp which | ||||
| 241 | // we intend to be "uncommon", such as slow-path TLE allocation, | ||||
| 242 | // predicted call failure, and uncommon trap triggers. | ||||
| 243 | // | ||||
| 244 | // Use an epsilon value of 5% to allow for variability in frequency | ||||
| 245 | // predictions and floating point calculations. The net effect is | ||||
| 246 | // that guard_factor is set to 9500. | ||||
| 247 | // | ||||
| 248 | // Ignore low-frequency blocks. | ||||
| 249 | // The next check is (guard->_freq < 1.e-5 * 9500.). | ||||
| 250 | if(guard->_freq*BLOCK_FREQUENCY(guard_factor)((guard_factor * (double) 1500) / FreqCountInvocations) < BLOCK_FREQUENCY(0.00001f)((0.00001f * (double) 1500) / FreqCountInvocations)) { | ||||
| 251 | uncommon_preds++; | ||||
| 252 | } else { | ||||
| 253 | freq_preds++; | ||||
| 254 | if(block->_freq < guard->_freq * guard_factor ) { | ||||
| 255 | uncommon_for_freq_preds++; | ||||
| 256 | } | ||||
| 257 | } | ||||
| 258 | } | ||||
| 259 | if( block->num_preds() > 1 && | ||||
| 260 | // The block is uncommon if all preds are uncommon or | ||||
| 261 | (uncommon_preds == (block->num_preds()-1) || | ||||
| 262 | // it is uncommon for all frequent preds. | ||||
| 263 | uncommon_for_freq_preds == freq_preds) ) { | ||||
| 264 | return true; | ||||
| 265 | } | ||||
| 266 | return false; | ||||
| 267 | } | ||||
| 268 | |||||
| 269 | #ifndef PRODUCT | ||||
| 270 | void Block::dump_bidx(const Block* orig, outputStream* st) const { | ||||
| 271 | if (_pre_order) st->print("B%d", _pre_order); | ||||
| 272 | else st->print("N%d", head()->_idx); | ||||
| 273 | |||||
| 274 | if (Verbose && orig != this) { | ||||
| 275 | // Dump the original block's idx | ||||
| 276 | st->print(" ("); | ||||
| 277 | orig->dump_bidx(orig, st); | ||||
| 278 | st->print(")"); | ||||
| 279 | } | ||||
| 280 | } | ||||
| 281 | |||||
| 282 | void Block::dump_pred(const PhaseCFG* cfg, Block* orig, outputStream* st) const { | ||||
| 283 | if (is_connector()) { | ||||
| 284 | for (uint i=1; i<num_preds(); i++) { | ||||
| 285 | Block *p = cfg->get_block_for_node(pred(i)); | ||||
| 286 | p->dump_pred(cfg, orig, st); | ||||
| 287 | } | ||||
| 288 | } else { | ||||
| 289 | dump_bidx(orig, st); | ||||
| 290 | st->print(" "); | ||||
| 291 | } | ||||
| 292 | } | ||||
| 293 | |||||
| 294 | void Block::dump_head(const PhaseCFG* cfg, outputStream* st) const { | ||||
| 295 | // Print the basic block. | ||||
| 296 | dump_bidx(this, st); | ||||
| 297 | st->print(": "); | ||||
| 298 | |||||
| 299 | // Print the outgoing CFG edges. | ||||
| 300 | st->print("#\tout( "); | ||||
| 301 | for( uint i=0; i<_num_succs; i++ ) { | ||||
| 302 | non_connector_successor(i)->dump_bidx(_succs[i], st); | ||||
| 303 | st->print(" "); | ||||
| 304 | } | ||||
| 305 | |||||
| 306 | // Print the incoming CFG edges. | ||||
| 307 | st->print(") <- "); | ||||
| 308 | if( head()->is_block_start() ) { | ||||
| 309 | st->print("in( "); | ||||
| 310 | for (uint i=1; i<num_preds(); i++) { | ||||
| 311 | Node *s = pred(i); | ||||
| 312 | if (cfg != NULL__null) { | ||||
| 313 | Block *p = cfg->get_block_for_node(s); | ||||
| 314 | p->dump_pred(cfg, p, st); | ||||
| 315 | } else { | ||||
| 316 | while (!s->is_block_start()) { | ||||
| 317 | s = s->in(0); | ||||
| 318 | } | ||||
| 319 | st->print("N%d ", s->_idx ); | ||||
| 320 | } | ||||
| 321 | } | ||||
| 322 | st->print(") "); | ||||
| 323 | } else { | ||||
| 324 | st->print("BLOCK HEAD IS JUNK "); | ||||
| 325 | } | ||||
| 326 | |||||
| 327 | // Print loop, if any | ||||
| 328 | const Block *bhead = this; // Head of self-loop | ||||
| 329 | Node *bh = bhead->head(); | ||||
| 330 | |||||
| 331 | if ((cfg != NULL__null) && bh->is_Loop() && !head()->is_Root()) { | ||||
| 332 | LoopNode *loop = bh->as_Loop(); | ||||
| 333 | const Block *bx = cfg->get_block_for_node(loop->in(LoopNode::LoopBackControl)); | ||||
| 334 | while (bx->is_connector()) { | ||||
| 335 | bx = cfg->get_block_for_node(bx->pred(1)); | ||||
| 336 | } | ||||
| 337 | st->print("Loop( B%d-B%d ", bhead->_pre_order, bx->_pre_order); | ||||
| 338 | // Dump any loop-specific bits, especially for CountedLoops. | ||||
| 339 | loop->dump_spec(st); | ||||
| 340 | st->print(")"); | ||||
| 341 | } else if (has_loop_alignment()) { | ||||
| 342 | st->print("top-of-loop"); | ||||
| 343 | } | ||||
| 344 | |||||
| 345 | // Print frequency and other optimization-relevant information | ||||
| 346 | st->print(" Freq: %g",_freq); | ||||
| 347 | if( Verbose || WizardMode ) { | ||||
| 348 | st->print(" IDom: %d/#%d", _idom ? _idom->_pre_order : 0, _dom_depth); | ||||
| 349 | st->print(" RegPressure: %d",_reg_pressure); | ||||
| 350 | st->print(" IHRP Index: %d",_ihrp_index); | ||||
| 351 | st->print(" FRegPressure: %d",_freg_pressure); | ||||
| 352 | st->print(" FHRP Index: %d",_fhrp_index); | ||||
| 353 | } | ||||
| 354 | st->cr(); | ||||
| 355 | } | ||||
| 356 | |||||
| 357 | void Block::dump() const { | ||||
| 358 | dump(NULL__null); | ||||
| 359 | } | ||||
| 360 | |||||
| 361 | void Block::dump(const PhaseCFG* cfg) const { | ||||
| 362 | dump_head(cfg); | ||||
| 363 | for (uint i=0; i< number_of_nodes(); i++) { | ||||
| 364 | get_node(i)->dump(); | ||||
| 365 | } | ||||
| 366 | tty->print("\n"); | ||||
| 367 | } | ||||
| 368 | #endif | ||||
| 369 | |||||
| 370 | PhaseCFG::PhaseCFG(Arena* arena, RootNode* root, Matcher& matcher) | ||||
| 371 | : Phase(CFG) | ||||
| 372 | , _root(root) | ||||
| 373 | , _block_arena(arena) | ||||
| 374 | , _regalloc(NULL__null) | ||||
| 375 | , _scheduling_for_pressure(false) | ||||
| 376 | , _matcher(matcher) | ||||
| 377 | , _node_to_block_mapping(arena) | ||||
| 378 | , _node_latency(NULL__null) | ||||
| 379 | #ifndef PRODUCT | ||||
| 380 | , _trace_opto_pipelining(C->directive()->TraceOptoPipeliningOption) | ||||
| 381 | #endif | ||||
| 382 | #ifdef ASSERT1 | ||||
| 383 | , _raw_oops(arena) | ||||
| 384 | #endif | ||||
| 385 | { | ||||
| 386 | ResourceMark rm; | ||||
| 387 | // I'll need a few machine-specific GotoNodes. Make an Ideal GotoNode, | ||||
| 388 | // then Match it into a machine-specific Node. Then clone the machine | ||||
| 389 | // Node on demand. | ||||
| 390 | Node *x = new GotoNode(NULL__null); | ||||
| 391 | x->init_req(0, x); | ||||
| 392 | _goto = matcher.match_tree(x); | ||||
| 393 | assert(_goto != NULL, "")do { if (!(_goto != __null)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/block.cpp" , 393, "assert(" "_goto != __null" ") failed", ""); ::breakpoint (); } } while (0); | ||||
| 394 | _goto->set_req(0,_goto); | ||||
| 395 | |||||
| 396 | // Build the CFG in Reverse Post Order | ||||
| 397 | _number_of_blocks = build_cfg(); | ||||
| 398 | _root_block = get_block_for_node(_root); | ||||
| 399 | } | ||||
| 400 | |||||
| 401 | // Build a proper looking CFG. Make every block begin with either a StartNode | ||||
| 402 | // or a RegionNode. Make every block end with either a Goto, If or Return. | ||||
| 403 | // The RootNode both starts and ends it's own block. Do this with a recursive | ||||
| 404 | // backwards walk over the control edges. | ||||
| 405 | uint PhaseCFG::build_cfg() { | ||||
| 406 | VectorSet visited; | ||||
| 407 | |||||
| 408 | // Allocate stack with enough space to avoid frequent realloc | ||||
| 409 | Node_Stack nstack(C->live_nodes() >> 1); | ||||
| 410 | nstack.push(_root, 0); | ||||
| 411 | uint sum = 0; // Counter for blocks | ||||
| 412 | |||||
| 413 | while (nstack.is_nonempty()) { | ||||
| 414 | // node and in's index from stack's top | ||||
| 415 | // 'np' is _root (see above) or RegionNode, StartNode: we push on stack | ||||
| 416 | // only nodes which point to the start of basic block (see below). | ||||
| 417 | Node *np = nstack.node(); | ||||
| 418 | // idx > 0, except for the first node (_root) pushed on stack | ||||
| 419 | // at the beginning when idx == 0. | ||||
| 420 | // We will use the condition (idx == 0) later to end the build. | ||||
| 421 | uint idx = nstack.index(); | ||||
| 422 | Node *proj = np->in(idx); | ||||
| 423 | const Node *x = proj->is_block_proj(); | ||||
| 424 | // Does the block end with a proper block-ending Node? One of Return, | ||||
| 425 | // If or Goto? (This check should be done for visited nodes also). | ||||
| 426 | if (x == NULL__null) { // Does not end right... | ||||
| 427 | Node *g = _goto->clone(); // Force it to end in a Goto | ||||
| 428 | g->set_req(0, proj); | ||||
| 429 | np->set_req(idx, g); | ||||
| 430 | x = proj = g; | ||||
| 431 | } | ||||
| 432 | if (!visited.test_set(x->_idx)) { // Visit this block once | ||||
| 433 | // Skip any control-pinned middle'in stuff | ||||
| 434 | Node *p = proj; | ||||
| 435 | do { | ||||
| 436 | proj = p; // Update pointer to last Control | ||||
| 437 | p = p->in(0); // Move control forward | ||||
| 438 | } while( !p->is_block_proj() && | ||||
| 439 | !p->is_block_start() ); | ||||
| 440 | // Make the block begin with one of Region or StartNode. | ||||
| 441 | if( !p->is_block_start() ) { | ||||
| 442 | RegionNode *r = new RegionNode( 2 ); | ||||
| 443 | r->init_req(1, p); // Insert RegionNode in the way | ||||
| 444 | proj->set_req(0, r); // Insert RegionNode in the way | ||||
| 445 | p = r; | ||||
| 446 | } | ||||
| 447 | // 'p' now points to the start of this basic block | ||||
| 448 | |||||
| 449 | // Put self in array of basic blocks | ||||
| 450 | Block *bb = new (_block_arena) Block(_block_arena, p); | ||||
| 451 | map_node_to_block(p, bb); | ||||
| 452 | map_node_to_block(x, bb); | ||||
| 453 | if( x != p ) { // Only for root is x == p | ||||
| 454 | bb->push_node((Node*)x); | ||||
| 455 | } | ||||
| 456 | // Now handle predecessors | ||||
| 457 | ++sum; // Count 1 for self block | ||||
| 458 | uint cnt = bb->num_preds(); | ||||
| 459 | for (int i = (cnt - 1); i > 0; i-- ) { // For all predecessors | ||||
| 460 | Node *prevproj = p->in(i); // Get prior input | ||||
| 461 | assert( !prevproj->is_Con(), "dead input not removed" )do { if (!(!prevproj->is_Con())) { (*g_assert_poison) = 'X' ;; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/block.cpp" , 461, "assert(" "!prevproj->is_Con()" ") failed", "dead input not removed" ); ::breakpoint(); } } while (0); | ||||
| 462 | // Check to see if p->in(i) is a "control-dependent" CFG edge - | ||||
| 463 | // i.e., it splits at the source (via an IF or SWITCH) and merges | ||||
| 464 | // at the destination (via a many-input Region). | ||||
| 465 | // This breaks critical edges. The RegionNode to start the block | ||||
| 466 | // will be added when <p,i> is pulled off the node stack | ||||
| 467 | if ( cnt > 2 ) { // Merging many things? | ||||
| 468 | assert( prevproj== bb->pred(i),"")do { if (!(prevproj== bb->pred(i))) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/block.cpp" , 468, "assert(" "prevproj== bb->pred(i)" ") failed", ""); ::breakpoint(); } } while (0); | ||||
| 469 | if(prevproj->is_block_proj() != prevproj) { // Control-dependent edge? | ||||
| 470 | // Force a block on the control-dependent edge | ||||
| 471 | Node *g = _goto->clone(); // Force it to end in a Goto | ||||
| 472 | g->set_req(0,prevproj); | ||||
| 473 | p->set_req(i,g); | ||||
| 474 | } | ||||
| 475 | } | ||||
| 476 | nstack.push(p, i); // 'p' is RegionNode or StartNode | ||||
| 477 | } | ||||
| 478 | } else { // Post-processing visited nodes | ||||
| 479 | nstack.pop(); // remove node from stack | ||||
| 480 | // Check if it the fist node pushed on stack at the beginning. | ||||
| 481 | if (idx == 0) break; // end of the build | ||||
| 482 | // Find predecessor basic block | ||||
| 483 | Block *pb = get_block_for_node(x); | ||||
| 484 | // Insert into nodes array, if not already there | ||||
| 485 | if (!has_block(proj)) { | ||||
| 486 | assert( x != proj, "" )do { if (!(x != proj)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/block.cpp" , 486, "assert(" "x != proj" ") failed", ""); ::breakpoint(); } } while (0); | ||||
| 487 | // Map basic block of projection | ||||
| 488 | map_node_to_block(proj, pb); | ||||
| 489 | pb->push_node(proj); | ||||
| 490 | } | ||||
| 491 | // Insert self as a child of my predecessor block | ||||
| 492 | pb->_succs.map(pb->_num_succs++, get_block_for_node(np)); | ||||
| 493 | assert( pb->get_node(pb->number_of_nodes() - pb->_num_succs)->is_block_proj(),do { if (!(pb->get_node(pb->number_of_nodes() - pb-> _num_succs)->is_block_proj())) { (*g_assert_poison) = 'X'; ; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/block.cpp" , 494, "assert(" "pb->get_node(pb->number_of_nodes() - pb->_num_succs)->is_block_proj()" ") failed", "too many control users, not a CFG?"); ::breakpoint (); } } while (0) | ||||
| 494 | "too many control users, not a CFG?" )do { if (!(pb->get_node(pb->number_of_nodes() - pb-> _num_succs)->is_block_proj())) { (*g_assert_poison) = 'X'; ; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/block.cpp" , 494, "assert(" "pb->get_node(pb->number_of_nodes() - pb->_num_succs)->is_block_proj()" ") failed", "too many control users, not a CFG?"); ::breakpoint (); } } while (0); | ||||
| 495 | } | ||||
| 496 | } | ||||
| 497 | // Return number of basic blocks for all children and self | ||||
| 498 | return sum; | ||||
| 499 | } | ||||
| 500 | |||||
| 501 | // Inserts a goto & corresponding basic block between | ||||
| 502 | // block[block_no] and its succ_no'th successor block | ||||
| 503 | void PhaseCFG::insert_goto_at(uint block_no, uint succ_no) { | ||||
| 504 | // get block with block_no | ||||
| 505 | assert(block_no < number_of_blocks(), "illegal block number")do { if (!(block_no < number_of_blocks())) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/block.cpp" , 505, "assert(" "block_no < number_of_blocks()" ") failed" , "illegal block number"); ::breakpoint(); } } while (0); | ||||
| 506 | Block* in = get_block(block_no); | ||||
| 507 | // get successor block succ_no | ||||
| 508 | assert(succ_no < in->_num_succs, "illegal successor number")do { if (!(succ_no < in->_num_succs)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/block.cpp" , 508, "assert(" "succ_no < in->_num_succs" ") failed", "illegal successor number"); ::breakpoint(); } } while (0); | ||||
| 509 | Block* out = in->_succs[succ_no]; | ||||
| 510 | // Compute frequency of the new block. Do this before inserting | ||||
| 511 | // new block in case succ_prob() needs to infer the probability from | ||||
| 512 | // surrounding blocks. | ||||
| 513 | float freq = in->_freq * in->succ_prob(succ_no); | ||||
| 514 | // get ProjNode corresponding to the succ_no'th successor of the in block | ||||
| 515 | ProjNode* proj = in->get_node(in->number_of_nodes() - in->_num_succs + succ_no)->as_Proj(); | ||||
| 516 | // create region for basic block | ||||
| 517 | RegionNode* region = new RegionNode(2); | ||||
| 518 | region->init_req(1, proj); | ||||
| 519 | // setup corresponding basic block | ||||
| 520 | Block* block = new (_block_arena) Block(_block_arena, region); | ||||
| 521 | map_node_to_block(region, block); | ||||
| 522 | C->regalloc()->set_bad(region->_idx); | ||||
| 523 | // add a goto node | ||||
| 524 | Node* gto = _goto->clone(); // get a new goto node | ||||
| 525 | gto->set_req(0, region); | ||||
| 526 | // add it to the basic block | ||||
| 527 | block->push_node(gto); | ||||
| 528 | map_node_to_block(gto, block); | ||||
| 529 | C->regalloc()->set_bad(gto->_idx); | ||||
| 530 | // hook up successor block | ||||
| 531 | block->_succs.map(block->_num_succs++, out); | ||||
| 532 | // remap successor's predecessors if necessary | ||||
| 533 | for (uint i = 1; i < out->num_preds(); i++) { | ||||
| 534 | if (out->pred(i) == proj) out->head()->set_req(i, gto); | ||||
| 535 | } | ||||
| 536 | // remap predecessor's successor to new block | ||||
| 537 | in->_succs.map(succ_no, block); | ||||
| 538 | // Set the frequency of the new block | ||||
| 539 | block->_freq = freq; | ||||
| 540 | // add new basic block to basic block list | ||||
| 541 | add_block_at(block_no + 1, block); | ||||
| 542 | } | ||||
| 543 | |||||
| 544 | // Does this block end in a multiway branch that cannot have the default case | ||||
| 545 | // flipped for another case? | ||||
| 546 | static bool no_flip_branch(Block *b) { | ||||
| 547 | int branch_idx = b->number_of_nodes() - b->_num_succs-1; | ||||
| 548 | if (branch_idx < 1) { | ||||
| 549 | return false; | ||||
| 550 | } | ||||
| 551 | Node *branch = b->get_node(branch_idx); | ||||
| 552 | if (branch->is_Catch()) { | ||||
| 553 | return true; | ||||
| 554 | } | ||||
| 555 | if (branch->is_Mach()) { | ||||
| 556 | if (branch->is_MachNullCheck()) { | ||||
| 557 | return true; | ||||
| 558 | } | ||||
| 559 | int iop = branch->as_Mach()->ideal_Opcode(); | ||||
| 560 | if (iop == Op_FastLock || iop == Op_FastUnlock) { | ||||
| 561 | return true; | ||||
| 562 | } | ||||
| 563 | // Don't flip if branch has an implicit check. | ||||
| 564 | if (branch->as_Mach()->is_TrapBasedCheckNode()) { | ||||
| 565 | return true; | ||||
| 566 | } | ||||
| 567 | } | ||||
| 568 | return false; | ||||
| 569 | } | ||||
| 570 | |||||
| 571 | // Check for NeverBranch at block end. This needs to become a GOTO to the | ||||
| 572 | // true target. NeverBranch are treated as a conditional branch that always | ||||
| 573 | // goes the same direction for most of the optimizer and are used to give a | ||||
| 574 | // fake exit path to infinite loops. At this late stage they need to turn | ||||
| 575 | // into Goto's so that when you enter the infinite loop you indeed hang. | ||||
| 576 | void PhaseCFG::convert_NeverBranch_to_Goto(Block *b) { | ||||
| 577 | // Find true target | ||||
| 578 | int end_idx = b->end_idx(); | ||||
| 579 | int idx = b->get_node(end_idx+1)->as_Proj()->_con; | ||||
| 580 | Block *succ = b->_succs[idx]; | ||||
| 581 | Node* gto = _goto->clone(); // get a new goto node | ||||
| 582 | gto->set_req(0, b->head()); | ||||
| 583 | Node *bp = b->get_node(end_idx); | ||||
| 584 | b->map_node(gto, end_idx); // Slam over NeverBranch | ||||
| 585 | map_node_to_block(gto, b); | ||||
| 586 | C->regalloc()->set_bad(gto->_idx); | ||||
| 587 | b->pop_node(); // Yank projections | ||||
| 588 | b->pop_node(); // Yank projections | ||||
| 589 | b->_succs.map(0,succ); // Map only successor | ||||
| 590 | b->_num_succs = 1; | ||||
| 591 | // remap successor's predecessors if necessary | ||||
| 592 | uint j; | ||||
| 593 | for( j = 1; j < succ->num_preds(); j++) | ||||
| 594 | if( succ->pred(j)->in(0) == bp ) | ||||
| 595 | succ->head()->set_req(j, gto); | ||||
| 596 | // Kill alternate exit path | ||||
| 597 | Block *dead = b->_succs[1-idx]; | ||||
| 598 | for( j = 1; j < dead->num_preds(); j++) | ||||
| 599 | if( dead->pred(j)->in(0) == bp ) | ||||
| 600 | break; | ||||
| 601 | // Scan through block, yanking dead path from | ||||
| 602 | // all regions and phis. | ||||
| 603 | dead->head()->del_req(j); | ||||
| 604 | for( int k = 1; dead->get_node(k)->is_Phi(); k++ ) | ||||
| 605 | dead->get_node(k)->del_req(j); | ||||
| 606 | } | ||||
| 607 | |||||
| 608 | // Helper function to move block bx to the slot following b_index. Return | ||||
| 609 | // true if the move is successful, otherwise false | ||||
| 610 | bool PhaseCFG::move_to_next(Block* bx, uint b_index) { | ||||
| 611 | if (bx == NULL__null) return false; | ||||
| 612 | |||||
| 613 | // Return false if bx is already scheduled. | ||||
| 614 | uint bx_index = bx->_pre_order; | ||||
| 615 | if ((bx_index <= b_index) && (get_block(bx_index) == bx)) { | ||||
| 616 | return false; | ||||
| 617 | } | ||||
| 618 | |||||
| 619 | // Find the current index of block bx on the block list | ||||
| 620 | bx_index = b_index + 1; | ||||
| 621 | while (bx_index < number_of_blocks() && get_block(bx_index) != bx) { | ||||
| 622 | bx_index++; | ||||
| 623 | } | ||||
| 624 | assert(get_block(bx_index) == bx, "block not found")do { if (!(get_block(bx_index) == bx)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/block.cpp" , 624, "assert(" "get_block(bx_index) == bx" ") failed", "block not found" ); ::breakpoint(); } } while (0); | ||||
| 625 | |||||
| 626 | // If the previous block conditionally falls into bx, return false, | ||||
| 627 | // because moving bx will create an extra jump. | ||||
| 628 | for(uint k = 1; k < bx->num_preds(); k++ ) { | ||||
| 629 | Block* pred = get_block_for_node(bx->pred(k)); | ||||
| 630 | if (pred == get_block(bx_index - 1)) { | ||||
| 631 | if (pred->_num_succs != 1) { | ||||
| 632 | return false; | ||||
| 633 | } | ||||
| 634 | } | ||||
| 635 | } | ||||
| 636 | |||||
| 637 | // Reinsert bx just past block 'b' | ||||
| 638 | _blocks.remove(bx_index); | ||||
| 639 | _blocks.insert(b_index + 1, bx); | ||||
| 640 | return true; | ||||
| 641 | } | ||||
| 642 | |||||
| 643 | // Move empty and uncommon blocks to the end. | ||||
| 644 | void PhaseCFG::move_to_end(Block *b, uint i) { | ||||
| 645 | int e = b->is_Empty(); | ||||
| 646 | if (e != Block::not_empty) { | ||||
| 647 | if (e == Block::empty_with_goto) { | ||||
| 648 | // Remove the goto, but leave the block. | ||||
| 649 | b->pop_node(); | ||||
| 650 | } | ||||
| 651 | // Mark this block as a connector block, which will cause it to be | ||||
| 652 | // ignored in certain functions such as non_connector_successor(). | ||||
| 653 | b->set_connector(); | ||||
| 654 | } | ||||
| 655 | // Move the empty block to the end, and don't recheck. | ||||
| 656 | _blocks.remove(i); | ||||
| 657 | _blocks.push(b); | ||||
| 658 | } | ||||
| 659 | |||||
| 660 | // Set loop alignment for every block | ||||
| 661 | void PhaseCFG::set_loop_alignment() { | ||||
| 662 | uint last = number_of_blocks(); | ||||
| 663 | assert(get_block(0) == get_root_block(), "")do { if (!(get_block(0) == get_root_block())) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/block.cpp" , 663, "assert(" "get_block(0) == get_root_block()" ") failed" , ""); ::breakpoint(); } } while (0); | ||||
| 664 | |||||
| 665 | for (uint i = 1; i < last; i++) { | ||||
| 666 | Block* block = get_block(i); | ||||
| 667 | if (block->head()->is_Loop()) { | ||||
| 668 | block->set_loop_alignment(block); | ||||
| 669 | } | ||||
| 670 | } | ||||
| 671 | } | ||||
| 672 | |||||
| 673 | // Make empty basic blocks to be "connector" blocks, Move uncommon blocks | ||||
| 674 | // to the end. | ||||
| 675 | void PhaseCFG::remove_empty_blocks() { | ||||
| 676 | // Move uncommon blocks to the end | ||||
| 677 | uint last = number_of_blocks(); | ||||
| 678 | assert(get_block(0) == get_root_block(), "")do { if (!(get_block(0) == get_root_block())) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/block.cpp" , 678, "assert(" "get_block(0) == get_root_block()" ") failed" , ""); ::breakpoint(); } } while (0); | ||||
| 679 | |||||
| 680 | for (uint i = 1; i < last; i++) { | ||||
| 681 | Block* block = get_block(i); | ||||
| 682 | if (block->is_connector()) { | ||||
| 683 | break; | ||||
| 684 | } | ||||
| 685 | |||||
| 686 | // Check for NeverBranch at block end. This needs to become a GOTO to the | ||||
| 687 | // true target. NeverBranch are treated as a conditional branch that | ||||
| 688 | // always goes the same direction for most of the optimizer and are used | ||||
| 689 | // to give a fake exit path to infinite loops. At this late stage they | ||||
| 690 | // need to turn into Goto's so that when you enter the infinite loop you | ||||
| 691 | // indeed hang. | ||||
| 692 | if (block->get_node(block->end_idx())->Opcode() == Op_NeverBranch) { | ||||
| 693 | convert_NeverBranch_to_Goto(block); | ||||
| 694 | } | ||||
| 695 | |||||
| 696 | // Look for uncommon blocks and move to end. | ||||
| 697 | if (!C->do_freq_based_layout()) { | ||||
| 698 | if (is_uncommon(block)) { | ||||
| 699 | move_to_end(block, i); | ||||
| 700 | last--; // No longer check for being uncommon! | ||||
| 701 | if (no_flip_branch(block)) { // Fall-thru case must follow? | ||||
| 702 | // Find the fall-thru block | ||||
| 703 | block = get_block(i); | ||||
| 704 | move_to_end(block, i); | ||||
| 705 | last--; | ||||
| 706 | } | ||||
| 707 | // backup block counter post-increment | ||||
| 708 | i--; | ||||
| 709 | } | ||||
| 710 | } | ||||
| 711 | } | ||||
| 712 | |||||
| 713 | // Move empty blocks to the end | ||||
| 714 | last = number_of_blocks(); | ||||
| 715 | for (uint i = 1; i < last; i++) { | ||||
| 716 | Block* block = get_block(i); | ||||
| 717 | if (block->is_Empty() != Block::not_empty) { | ||||
| 718 | move_to_end(block, i); | ||||
| 719 | last--; | ||||
| 720 | i--; | ||||
| 721 | } | ||||
| 722 | } // End of for all blocks | ||||
| 723 | } | ||||
| 724 | |||||
| 725 | Block *PhaseCFG::fixup_trap_based_check(Node *branch, Block *block, int block_pos, Block *bnext) { | ||||
| 726 | // Trap based checks must fall through to the successor with | ||||
| 727 | // PROB_ALWAYS. | ||||
| 728 | // They should be an If with 2 successors. | ||||
| 729 | assert(branch->is_MachIf(), "must be If")do { if (!(branch->is_MachIf())) { (*g_assert_poison) = 'X' ;; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/block.cpp" , 729, "assert(" "branch->is_MachIf()" ") failed", "must be If" ); ::breakpoint(); } } while (0); | ||||
| 730 | assert(block->_num_succs == 2, "must have 2 successors")do { if (!(block->_num_succs == 2)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/block.cpp" , 730, "assert(" "block->_num_succs == 2" ") failed", "must have 2 successors" ); ::breakpoint(); } } while (0); | ||||
| 731 | |||||
| 732 | // Get the If node and the projection for the first successor. | ||||
| 733 | MachIfNode *iff = block->get_node(block->number_of_nodes()-3)->as_MachIf(); | ||||
| 734 | ProjNode *proj0 = block->get_node(block->number_of_nodes()-2)->as_Proj(); | ||||
| 735 | ProjNode *proj1 = block->get_node(block->number_of_nodes()-1)->as_Proj(); | ||||
| 736 | ProjNode *projt = (proj0->Opcode() == Op_IfTrue) ? proj0 : proj1; | ||||
| 737 | ProjNode *projf = (proj0->Opcode() == Op_IfFalse) ? proj0 : proj1; | ||||
| 738 | |||||
| 739 | // Assert that proj0 and succs[0] match up. Similarly for proj1 and succs[1]. | ||||
| 740 | assert(proj0->raw_out(0) == block->_succs[0]->head(), "Mismatch successor 0")do { if (!(proj0->raw_out(0) == block->_succs[0]->head ())) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/block.cpp" , 740, "assert(" "proj0->raw_out(0) == block->_succs[0]->head()" ") failed", "Mismatch successor 0"); ::breakpoint(); } } while (0); | ||||
| 741 | assert(proj1->raw_out(0) == block->_succs[1]->head(), "Mismatch successor 1")do { if (!(proj1->raw_out(0) == block->_succs[1]->head ())) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/block.cpp" , 741, "assert(" "proj1->raw_out(0) == block->_succs[1]->head()" ") failed", "Mismatch successor 1"); ::breakpoint(); } } while (0); | ||||
| 742 | |||||
| 743 | ProjNode *proj_always; | ||||
| 744 | ProjNode *proj_never; | ||||
| 745 | // We must negate the branch if the implicit check doesn't follow | ||||
| 746 | // the branch's TRUE path. Then, the new TRUE branch target will | ||||
| 747 | // be the old FALSE branch target. | ||||
| 748 | if (iff->_prob <= 2*PROB_NEVER(1e-6f)) { // There are small rounding errors. | ||||
| 749 | proj_never = projt; | ||||
| 750 | proj_always = projf; | ||||
| 751 | } else { | ||||
| 752 | // We must negate the branch if the trap doesn't follow the | ||||
| 753 | // branch's TRUE path. Then, the new TRUE branch target will | ||||
| 754 | // be the old FALSE branch target. | ||||
| 755 | proj_never = projf; | ||||
| 756 | proj_always = projt; | ||||
| 757 | iff->negate(); | ||||
| 758 | } | ||||
| 759 | assert(iff->_prob <= 2*PROB_NEVER, "Trap based checks are expected to trap never!")do { if (!(iff->_prob <= 2*(1e-6f))) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/block.cpp" , 759, "assert(" "iff->_prob <= 2*(1e-6f)" ") failed", "Trap based checks are expected to trap never!" ); ::breakpoint(); } } while (0); | ||||
| 760 | // Map the successors properly | ||||
| 761 | block->_succs.map(0, get_block_for_node(proj_never ->raw_out(0))); // The target of the trap. | ||||
| 762 | block->_succs.map(1, get_block_for_node(proj_always->raw_out(0))); // The fall through target. | ||||
| 763 | |||||
| 764 | if (block->get_node(block->number_of_nodes() - block->_num_succs + 1) != proj_always) { | ||||
| 765 | block->map_node(proj_never, block->number_of_nodes() - block->_num_succs + 0); | ||||
| 766 | block->map_node(proj_always, block->number_of_nodes() - block->_num_succs + 1); | ||||
| 767 | } | ||||
| 768 | |||||
| 769 | // Place the fall through block after this block. | ||||
| 770 | Block *bs1 = block->non_connector_successor(1); | ||||
| 771 | if (bs1 != bnext && move_to_next(bs1, block_pos)) { | ||||
| 772 | bnext = bs1; | ||||
| 773 | } | ||||
| 774 | // If the fall through block still is not the next block, insert a goto. | ||||
| 775 | if (bs1 != bnext) { | ||||
| 776 | insert_goto_at(block_pos, 1); | ||||
| 777 | } | ||||
| 778 | return bnext; | ||||
| 779 | } | ||||
| 780 | |||||
| 781 | // Fix up the final control flow for basic blocks. | ||||
| 782 | void PhaseCFG::fixup_flow() { | ||||
| 783 | // Fixup final control flow for the blocks. Remove jump-to-next | ||||
| 784 | // block. If neither arm of an IF follows the conditional branch, we | ||||
| 785 | // have to add a second jump after the conditional. We place the | ||||
| 786 | // TRUE branch target in succs[0] for both GOTOs and IFs. | ||||
| 787 | for (uint i = 0; i < number_of_blocks(); i++) { | ||||
| 788 | Block* block = get_block(i); | ||||
| 789 | block->_pre_order = i; // turn pre-order into block-index | ||||
| 790 | |||||
| 791 | // Connector blocks need no further processing. | ||||
| 792 | if (block->is_connector()) { | ||||
| 793 | assert((i+1) == number_of_blocks() || get_block(i + 1)->is_connector(), "All connector blocks should sink to the end")do { if (!((i+1) == number_of_blocks() || get_block(i + 1)-> is_connector())) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/block.cpp" , 793, "assert(" "(i+1) == number_of_blocks() || get_block(i + 1)->is_connector()" ") failed", "All connector blocks should sink to the end"); :: breakpoint(); } } while (0); | ||||
| 794 | continue; | ||||
| 795 | } | ||||
| 796 | assert(block->is_Empty() != Block::completely_empty, "Empty blocks should be connectors")do { if (!(block->is_Empty() != Block::completely_empty)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/block.cpp" , 796, "assert(" "block->is_Empty() != Block::completely_empty" ") failed", "Empty blocks should be connectors"); ::breakpoint (); } } while (0); | ||||
| 797 | |||||
| 798 | Block* bnext = (i < number_of_blocks() - 1) ? get_block(i + 1) : NULL__null; | ||||
| 799 | Block* bs0 = block->non_connector_successor(0); | ||||
| 800 | |||||
| 801 | // Check for multi-way branches where I cannot negate the test to | ||||
| 802 | // exchange the true and false targets. | ||||
| 803 | if (no_flip_branch(block)) { | ||||
| 804 | // Find fall through case - if must fall into its target. | ||||
| 805 | // Get the index of the branch's first successor. | ||||
| 806 | int branch_idx = block->number_of_nodes() - block->_num_succs; | ||||
| 807 | |||||
| 808 | // The branch is 1 before the branch's first successor. | ||||
| 809 | Node *branch = block->get_node(branch_idx-1); | ||||
| 810 | |||||
| 811 | // Handle no-flip branches which have implicit checks and which require | ||||
| 812 | // special block ordering and individual semantics of the 'fall through | ||||
| 813 | // case'. | ||||
| 814 | if ((TrapBasedNullChecks || TrapBasedRangeChecks) && | ||||
| 815 | branch->is_Mach() && branch->as_Mach()->is_TrapBasedCheckNode()) { | ||||
| 816 | bnext = fixup_trap_based_check(branch, block, i, bnext); | ||||
| 817 | } else { | ||||
| 818 | // Else, default handling for no-flip branches | ||||
| 819 | for (uint j2 = 0; j2 < block->_num_succs; j2++) { | ||||
| 820 | const ProjNode* p = block->get_node(branch_idx + j2)->as_Proj(); | ||||
| 821 | if (p->_con == 0) { | ||||
| 822 | // successor j2 is fall through case | ||||
| 823 | if (block->non_connector_successor(j2) != bnext) { | ||||
| 824 | // but it is not the next block => insert a goto | ||||
| 825 | insert_goto_at(i, j2); | ||||
| 826 | } | ||||
| 827 | // Put taken branch in slot 0 | ||||
| 828 | if (j2 == 0 && block->_num_succs == 2) { | ||||
| 829 | // Flip targets in succs map | ||||
| 830 | Block *tbs0 = block->_succs[0]; | ||||
| 831 | Block *tbs1 = block->_succs[1]; | ||||
| 832 | block->_succs.map(0, tbs1); | ||||
| 833 | block->_succs.map(1, tbs0); | ||||
| 834 | } | ||||
| 835 | break; | ||||
| 836 | } | ||||
| 837 | } | ||||
| 838 | } | ||||
| 839 | |||||
| 840 | // Remove all CatchProjs | ||||
| 841 | for (uint j = 0; j < block->_num_succs; j++) { | ||||
| 842 | block->pop_node(); | ||||
| 843 | } | ||||
| 844 | |||||
| 845 | } else if (block->_num_succs == 1) { | ||||
| 846 | // Block ends in a Goto? | ||||
| 847 | if (bnext == bs0) { | ||||
| 848 | // We fall into next block; remove the Goto | ||||
| 849 | block->pop_node(); | ||||
| 850 | } | ||||
| 851 | |||||
| 852 | } else if(block->_num_succs == 2) { // Block ends in a If? | ||||
| 853 | // Get opcode of 1st projection (matches _succs[0]) | ||||
| 854 | // Note: Since this basic block has 2 exits, the last 2 nodes must | ||||
| 855 | // be projections (in any order), the 3rd last node must be | ||||
| 856 | // the IfNode (we have excluded other 2-way exits such as | ||||
| 857 | // CatchNodes already). | ||||
| 858 | MachNode* iff = block->get_node(block->number_of_nodes() - 3)->as_Mach(); | ||||
| 859 | ProjNode* proj0 = block->get_node(block->number_of_nodes() - 2)->as_Proj(); | ||||
| 860 | ProjNode* proj1 = block->get_node(block->number_of_nodes() - 1)->as_Proj(); | ||||
| 861 | |||||
| 862 | // Assert that proj0 and succs[0] match up. Similarly for proj1 and succs[1]. | ||||
| 863 | assert(proj0->raw_out(0) == block->_succs[0]->head(), "Mismatch successor 0")do { if (!(proj0->raw_out(0) == block->_succs[0]->head ())) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/block.cpp" , 863, "assert(" "proj0->raw_out(0) == block->_succs[0]->head()" ") failed", "Mismatch successor 0"); ::breakpoint(); } } while (0); | ||||
| 864 | assert(proj1->raw_out(0) == block->_succs[1]->head(), "Mismatch successor 1")do { if (!(proj1->raw_out(0) == block->_succs[1]->head ())) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/block.cpp" , 864, "assert(" "proj1->raw_out(0) == block->_succs[1]->head()" ") failed", "Mismatch successor 1"); ::breakpoint(); } } while (0); | ||||
| 865 | |||||
| 866 | Block* bs1 = block->non_connector_successor(1); | ||||
| 867 | |||||
| 868 | // Check for neither successor block following the current | ||||
| 869 | // block ending in a conditional. If so, move one of the | ||||
| 870 | // successors after the current one, provided that the | ||||
| 871 | // successor was previously unscheduled, but moveable | ||||
| 872 | // (i.e., all paths to it involve a branch). | ||||
| 873 | if (!C->do_freq_based_layout() && bnext != bs0 && bnext != bs1) { | ||||
| 874 | // Choose the more common successor based on the probability | ||||
| 875 | // of the conditional branch. | ||||
| 876 | Block* bx = bs0; | ||||
| 877 | Block* by = bs1; | ||||
| 878 | |||||
| 879 | // _prob is the probability of taking the true path. Make | ||||
| 880 | // p the probability of taking successor #1. | ||||
| 881 | float p = iff->as_MachIf()->_prob; | ||||
| 882 | if (proj0->Opcode() == Op_IfTrue) { | ||||
| 883 | p = 1.0 - p; | ||||
| 884 | } | ||||
| 885 | |||||
| 886 | // Prefer successor #1 if p > 0.5 | ||||
| 887 | if (p > PROB_FAIR(0.5f)) { | ||||
| 888 | bx = bs1; | ||||
| 889 | by = bs0; | ||||
| 890 | } | ||||
| 891 | |||||
| 892 | // Attempt the more common successor first | ||||
| 893 | if (move_to_next(bx, i)) { | ||||
| 894 | bnext = bx; | ||||
| 895 | } else if (move_to_next(by, i)) { | ||||
| 896 | bnext = by; | ||||
| 897 | } | ||||
| 898 | } | ||||
| 899 | |||||
| 900 | // Check for conditional branching the wrong way. Negate | ||||
| 901 | // conditional, if needed, so it falls into the following block | ||||
| 902 | // and branches to the not-following block. | ||||
| 903 | |||||
| 904 | // Check for the next block being in succs[0]. We are going to branch | ||||
| 905 | // to succs[0], so we want the fall-thru case as the next block in | ||||
| 906 | // succs[1]. | ||||
| 907 | if (bnext == bs0) { | ||||
| 908 | // Fall-thru case in succs[0], should be in succs[1], so flip targets in _succs map | ||||
| 909 | Block* tbs0 = block->_succs[0]; | ||||
| 910 | Block* tbs1 = block->_succs[1]; | ||||
| 911 | block->_succs.map(0, tbs1); | ||||
| 912 | block->_succs.map(1, tbs0); | ||||
| 913 | // Flip projection for each target | ||||
| 914 | swap(proj0, proj1); | ||||
| 915 | } else if(bnext != bs1) { | ||||
| 916 | // Need a double-branch | ||||
| 917 | // The existing conditional branch need not change. | ||||
| 918 | // Add a unconditional branch to the false target. | ||||
| 919 | // Alas, it must appear in its own block and adding a | ||||
| 920 | // block this late in the game is complicated. Sigh. | ||||
| 921 | insert_goto_at(i, 1); | ||||
| 922 | } | ||||
| 923 | |||||
| 924 | // Make sure we TRUE branch to the target | ||||
| 925 | if (proj0->Opcode() == Op_IfFalse) { | ||||
| 926 | iff->as_MachIf()->negate(); | ||||
| 927 | } | ||||
| 928 | |||||
| 929 | block->pop_node(); // Remove IfFalse & IfTrue projections | ||||
| 930 | block->pop_node(); | ||||
| 931 | |||||
| 932 | } else { | ||||
| 933 | // Multi-exit block, e.g. a switch statement | ||||
| 934 | // But we don't need to do anything here | ||||
| 935 | } | ||||
| 936 | } // End of for all blocks | ||||
| 937 | } | ||||
| 938 | |||||
| 939 | |||||
| 940 | // postalloc_expand: Expand nodes after register allocation. | ||||
| 941 | // | ||||
| 942 | // postalloc_expand has to be called after register allocation, just | ||||
| 943 | // before output (i.e. scheduling). It only gets called if | ||||
| 944 | // Matcher::require_postalloc_expand is true. | ||||
| 945 | // | ||||
| 946 | // Background: | ||||
| 947 | // | ||||
| 948 | // Nodes that are expandend (one compound node requiring several | ||||
| 949 | // assembler instructions to be implemented split into two or more | ||||
| 950 | // non-compound nodes) after register allocation are not as nice as | ||||
| 951 | // the ones expanded before register allocation - they don't | ||||
| 952 | // participate in optimizations as global code motion. But after | ||||
| 953 | // register allocation we can expand nodes that use registers which | ||||
| 954 | // are not spillable or registers that are not allocated, because the | ||||
| 955 | // old compound node is simply replaced (in its location in the basic | ||||
| 956 | // block) by a new subgraph which does not contain compound nodes any | ||||
| 957 | // more. The scheduler called during output can later on process these | ||||
| 958 | // non-compound nodes. | ||||
| 959 | // | ||||
| 960 | // Implementation: | ||||
| 961 | // | ||||
| 962 | // Nodes requiring postalloc expand are specified in the ad file by using | ||||
| 963 | // a postalloc_expand statement instead of ins_encode. A postalloc_expand | ||||
| 964 | // contains a single call to an encoding, as does an ins_encode | ||||
| 965 | // statement. Instead of an emit() function a postalloc_expand() function | ||||
| 966 | // is generated that doesn't emit assembler but creates a new | ||||
| 967 | // subgraph. The code below calls this postalloc_expand function for each | ||||
| 968 | // node with the appropriate attribute. This function returns the new | ||||
| 969 | // nodes generated in an array passed in the call. The old node, | ||||
| 970 | // potential MachTemps before and potential Projs after it then get | ||||
| 971 | // disconnected and replaced by the new nodes. The instruction | ||||
| 972 | // generating the result has to be the last one in the array. In | ||||
| 973 | // general it is assumed that Projs after the node expanded are | ||||
| 974 | // kills. These kills are not required any more after expanding as | ||||
| 975 | // there are now explicitly visible def-use chains and the Projs are | ||||
| 976 | // removed. This does not hold for calls: They do not only have | ||||
| 977 | // kill-Projs but also Projs defining values. Therefore Projs after | ||||
| 978 | // the node expanded are removed for all but for calls. If a node is | ||||
| 979 | // to be reused, it must be added to the nodes list returned, and it | ||||
| 980 | // will be added again. | ||||
| 981 | // | ||||
| 982 | // Implementing the postalloc_expand function for a node in an enc_class | ||||
| 983 | // is rather tedious. It requires knowledge about many node details, as | ||||
| 984 | // the nodes and the subgraph must be hand crafted. To simplify this, | ||||
| 985 | // adlc generates some utility variables into the postalloc_expand function, | ||||
| 986 | // e.g., holding the operands as specified by the postalloc_expand encoding | ||||
| 987 | // specification, e.g.: | ||||
| 988 | // * unsigned idx_<par_name> holding the index of the node in the ins | ||||
| 989 | // * Node *n_<par_name> holding the node loaded from the ins | ||||
| 990 | // * MachOpnd *op_<par_name> holding the corresponding operand | ||||
| 991 | // | ||||
| 992 | // The ordering of operands can not be determined by looking at a | ||||
| 993 | // rule. Especially if a match rule matches several different trees, | ||||
| 994 | // several nodes are generated from one instruct specification with | ||||
| 995 | // different operand orderings. In this case the adlc generated | ||||
| 996 | // variables are the only way to access the ins and operands | ||||
| 997 | // deterministically. | ||||
| 998 | // | ||||
| 999 | // If assigning a register to a node that contains an oop, don't | ||||
| 1000 | // forget to call ra_->set_oop() for the node. | ||||
| 1001 | void PhaseCFG::postalloc_expand(PhaseRegAlloc* _ra) { | ||||
| 1002 | GrowableArray <Node *> new_nodes(32); // Array with new nodes filled by postalloc_expand function of node. | ||||
| 1003 | GrowableArray <Node *> remove(32); | ||||
| 1004 | GrowableArray <Node *> succs(32); | ||||
| 1005 | unsigned int max_idx = C->unique(); // Remember to distinguish new from old nodes. | ||||
| 1006 | DEBUG_ONLY(bool foundNode = false)bool foundNode = false; | ||||
| 1007 | |||||
| 1008 | // for all blocks | ||||
| 1009 | for (uint i = 0; i < number_of_blocks(); i++) { | ||||
| 1010 | Block *b = _blocks[i]; | ||||
| 1011 | // For all instructions in the current block. | ||||
| 1012 | for (uint j = 0; j < b->number_of_nodes(); j++) { | ||||
| 1013 | Node *n = b->get_node(j); | ||||
| 1014 | if (n->is_Mach() && n->as_Mach()->requires_postalloc_expand()) { | ||||
| 1015 | #ifdef ASSERT1 | ||||
| 1016 | if (TracePostallocExpand) { | ||||
| 1017 | if (!foundNode) { | ||||
| 1018 | foundNode = true; | ||||
| 1019 | tty->print("POSTALLOC EXPANDING %d %s\n", C->compile_id(), | ||||
| 1020 | C->method() ? C->method()->name()->as_utf8() : C->stub_name()); | ||||
| 1021 | } | ||||
| 1022 | tty->print(" postalloc expanding "); n->dump(); | ||||
| 1023 | if (Verbose) { | ||||
| 1024 | tty->print(" with ins:\n"); | ||||
| 1025 | for (uint k = 0; k < n->len(); ++k) { | ||||
| 1026 | if (n->in(k)) { tty->print(" "); n->in(k)->dump(); } | ||||
| 1027 | } | ||||
| 1028 | } | ||||
| 1029 | } | ||||
| 1030 | #endif | ||||
| 1031 | new_nodes.clear(); | ||||
| 1032 | // Collect nodes that have to be removed from the block later on. | ||||
| 1033 | uint req = n->req(); | ||||
| 1034 | remove.clear(); | ||||
| 1035 | for (uint k = 0; k < req; ++k) { | ||||
| 1036 | if (n->in(k) && n->in(k)->is_MachTemp()) { | ||||
| 1037 | remove.push(n->in(k)); // MachTemps which are inputs to the old node have to be removed. | ||||
| 1038 | n->in(k)->del_req(0); | ||||
| 1039 | j--; | ||||
| 1040 | } | ||||
| 1041 | } | ||||
| 1042 | |||||
| 1043 | // Check whether we can allocate enough nodes. We set a fix limit for | ||||
| 1044 | // the size of postalloc expands with this. | ||||
| 1045 | uint unique_limit = C->unique() + 40; | ||||
| 1046 | if (unique_limit >= _ra->node_regs_max_index()) { | ||||
| 1047 | Compile::current()->record_failure("out of nodes in postalloc expand"); | ||||
| 1048 | return; | ||||
| 1049 | } | ||||
| 1050 | |||||
| 1051 | // Emit (i.e. generate new nodes). | ||||
| 1052 | n->as_Mach()->postalloc_expand(&new_nodes, _ra); | ||||
| 1053 | |||||
| 1054 | assert(C->unique() < unique_limit, "You allocated too many nodes in your postalloc expand.")do { if (!(C->unique() < unique_limit)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/block.cpp" , 1054, "assert(" "C->unique() < unique_limit" ") failed" , "You allocated too many nodes in your postalloc expand."); :: breakpoint(); } } while (0); | ||||
| 1055 | |||||
| 1056 | // Disconnect the inputs of the old node. | ||||
| 1057 | // | ||||
| 1058 | // We reuse MachSpillCopy nodes. If we need to expand them, there | ||||
| 1059 | // are many, so reusing pays off. If reused, the node already | ||||
| 1060 | // has the new ins. n must be the last node on new_nodes list. | ||||
| 1061 | if (!n->is_MachSpillCopy()) { | ||||
| 1062 | for (int k = req - 1; k >= 0; --k) { | ||||
| 1063 | n->del_req(k); | ||||
| 1064 | } | ||||
| 1065 | } | ||||
| 1066 | |||||
| 1067 | #ifdef ASSERT1 | ||||
| 1068 | // Check that all nodes have proper operands. | ||||
| 1069 | for (int k = 0; k < new_nodes.length(); ++k) { | ||||
| 1070 | if (new_nodes.at(k)->_idx < max_idx || !new_nodes.at(k)->is_Mach()) continue; // old node, Proj ... | ||||
| 1071 | MachNode *m = new_nodes.at(k)->as_Mach(); | ||||
| 1072 | for (unsigned int l = 0; l < m->num_opnds(); ++l) { | ||||
| 1073 | if (MachOper::notAnOper(m->_opnds[l])) { | ||||
| 1074 | outputStream *os = tty; | ||||
| 1075 | os->print("Node %s ", m->Name()); | ||||
| 1076 | os->print("has invalid opnd %d: %p\n", l, m->_opnds[l]); | ||||
| 1077 | assert(0, "Invalid operands, see inline trace in hs_err_pid file.")do { if (!(0)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/block.cpp" , 1077, "assert(" "0" ") failed", "Invalid operands, see inline trace in hs_err_pid file." ); ::breakpoint(); } } while (0); | ||||
| 1078 | } | ||||
| 1079 | } | ||||
| 1080 | } | ||||
| 1081 | #endif | ||||
| 1082 | |||||
| 1083 | // Collect succs of old node in remove (for projections) and in succs (for | ||||
| 1084 | // all other nodes) do _not_ collect projections in remove (but in succs) | ||||
| 1085 | // in case the node is a call. We need the projections for calls as they are | ||||
| 1086 | // associated with registes (i.e. they are defs). | ||||
| 1087 | succs.clear(); | ||||
| 1088 | for (DUIterator k = n->outs(); n->has_out(k); k++) { | ||||
| 1089 | if (n->out(k)->is_Proj() && !n->is_MachCall() && !n->is_MachBranch()) { | ||||
| 1090 | remove.push(n->out(k)); | ||||
| 1091 | } else { | ||||
| 1092 | succs.push(n->out(k)); | ||||
| 1093 | } | ||||
| 1094 | } | ||||
| 1095 | // Replace old node n as input of its succs by last of the new nodes. | ||||
| 1096 | for (int k = 0; k < succs.length(); ++k) { | ||||
| 1097 | Node *succ = succs.at(k); | ||||
| 1098 | for (uint l = 0; l < succ->req(); ++l) { | ||||
| 1099 | if (succ->in(l) == n) { | ||||
| 1100 | succ->set_req(l, new_nodes.at(new_nodes.length() - 1)); | ||||
| 1101 | } | ||||
| 1102 | } | ||||
| 1103 | for (uint l = succ->req(); l < succ->len(); ++l) { | ||||
| 1104 | if (succ->in(l) == n) { | ||||
| 1105 | succ->set_prec(l, new_nodes.at(new_nodes.length() - 1)); | ||||
| 1106 | } | ||||
| 1107 | } | ||||
| 1108 | } | ||||
| 1109 | |||||
| 1110 | // Index of old node in block. | ||||
| 1111 | uint index = b->find_node(n); | ||||
| 1112 | // Insert new nodes into block and map them in nodes->blocks array | ||||
| 1113 | // and remember last node in n2. | ||||
| 1114 | Node *n2 = NULL__null; | ||||
| 1115 | for (int k = 0; k < new_nodes.length(); ++k) { | ||||
| 1116 | n2 = new_nodes.at(k); | ||||
| 1117 | b->insert_node(n2, ++index); | ||||
| 1118 | map_node_to_block(n2, b); | ||||
| 1119 | } | ||||
| 1120 | |||||
| 1121 | // Add old node n to remove and remove them all from block. | ||||
| 1122 | remove.push(n); | ||||
| 1123 | j--; | ||||
| 1124 | #ifdef ASSERT1 | ||||
| 1125 | if (TracePostallocExpand && Verbose) { | ||||
| 1126 | tty->print(" removing:\n"); | ||||
| 1127 | for (int k = 0; k < remove.length(); ++k) { | ||||
| 1128 | tty->print(" "); remove.at(k)->dump(); | ||||
| 1129 | } | ||||
| 1130 | tty->print(" inserting:\n"); | ||||
| 1131 | for (int k = 0; k < new_nodes.length(); ++k) { | ||||
| 1132 | tty->print(" "); new_nodes.at(k)->dump(); | ||||
| 1133 | } | ||||
| 1134 | } | ||||
| 1135 | #endif | ||||
| 1136 | for (int k = 0; k < remove.length(); ++k) { | ||||
| 1137 | if (b->contains(remove.at(k))) { | ||||
| 1138 | b->find_remove(remove.at(k)); | ||||
| 1139 | } else { | ||||
| 1140 | assert(remove.at(k)->is_Proj() && (remove.at(k)->in(0)->is_MachBranch()), "")do { if (!(remove.at(k)->is_Proj() && (remove.at(k )->in(0)->is_MachBranch()))) { (*g_assert_poison) = 'X' ;; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/block.cpp" , 1140, "assert(" "remove.at(k)->is_Proj() && (remove.at(k)->in(0)->is_MachBranch())" ") failed", ""); ::breakpoint(); } } while (0); | ||||
| 1141 | } | ||||
| 1142 | } | ||||
| 1143 | // If anything has been inserted (n2 != NULL), continue after last node inserted. | ||||
| 1144 | // This does not always work. Some postalloc expands don't insert any nodes, if they | ||||
| 1145 | // do optimizations (e.g., max(x,x)). In this case we decrement j accordingly. | ||||
| 1146 | j = n2 ? b->find_node(n2) : j; | ||||
| 1147 | } | ||||
| 1148 | } | ||||
| 1149 | } | ||||
| 1150 | |||||
| 1151 | #ifdef ASSERT1 | ||||
| 1152 | if (foundNode) { | ||||
| 1153 | tty->print("FINISHED %d %s\n", C->compile_id(), | ||||
| 1154 | C->method() ? C->method()->name()->as_utf8() : C->stub_name()); | ||||
| 1155 | tty->flush(); | ||||
| 1156 | } | ||||
| 1157 | #endif | ||||
| 1158 | } | ||||
| 1159 | |||||
| 1160 | |||||
| 1161 | //------------------------------dump------------------------------------------- | ||||
| 1162 | #ifndef PRODUCT | ||||
| 1163 | void PhaseCFG::_dump_cfg( const Node *end, VectorSet &visited ) const { | ||||
| 1164 | const Node *x = end->is_block_proj(); | ||||
| 1165 | assert( x, "not a CFG" )do { if (!(x)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/block.cpp" , 1165, "assert(" "x" ") failed", "not a CFG"); ::breakpoint( ); } } while (0); | ||||
| 1166 | |||||
| 1167 | // Do not visit this block again | ||||
| 1168 | if( visited.test_set(x->_idx) ) return; | ||||
| 1169 | |||||
| 1170 | // Skip through this block | ||||
| 1171 | const Node *p = x; | ||||
| 1172 | do { | ||||
| 1173 | p = p->in(0); // Move control forward | ||||
| 1174 | assert( !p->is_block_proj() || p->is_Root(), "not a CFG" )do { if (!(!p->is_block_proj() || p->is_Root())) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/block.cpp" , 1174, "assert(" "!p->is_block_proj() || p->is_Root()" ") failed", "not a CFG"); ::breakpoint(); } } while (0); | ||||
| 1175 | } while( !p->is_block_start() ); | ||||
| 1176 | |||||
| 1177 | // Recursively visit | ||||
| 1178 | for (uint i = 1; i < p->req(); i++) { | ||||
| 1179 | _dump_cfg(p->in(i), visited); | ||||
| 1180 | } | ||||
| 1181 | |||||
| 1182 | // Dump the block | ||||
| 1183 | get_block_for_node(p)->dump(this); | ||||
| 1184 | } | ||||
| 1185 | |||||
| 1186 | void PhaseCFG::dump( ) const { | ||||
| 1187 | tty->print("\n--- CFG --- %d BBs\n", number_of_blocks()); | ||||
| 1188 | if (_blocks.size()) { // Did we do basic-block layout? | ||||
| 1189 | for (uint i = 0; i < number_of_blocks(); i++) { | ||||
| 1190 | const Block* block = get_block(i); | ||||
| 1191 | block->dump(this); | ||||
| 1192 | } | ||||
| 1193 | } else { // Else do it with a DFS | ||||
| 1194 | VectorSet visited(_block_arena); | ||||
| 1195 | _dump_cfg(_root,visited); | ||||
| 1196 | } | ||||
| 1197 | } | ||||
| 1198 | |||||
| 1199 | void PhaseCFG::dump_headers() { | ||||
| 1200 | for (uint i = 0; i < number_of_blocks(); i++) { | ||||
| 1201 | Block* block = get_block(i); | ||||
| 1202 | if (block != NULL__null) { | ||||
| 1203 | block->dump_head(this); | ||||
| 1204 | } | ||||
| 1205 | } | ||||
| 1206 | } | ||||
| 1207 | #endif // !PRODUCT | ||||
| 1208 | |||||
| 1209 | #ifdef ASSERT1 | ||||
| 1210 | void PhaseCFG::verify_memory_writer_placement(const Block* b, const Node* n) const { | ||||
| 1211 | if (!n->is_memory_writer()) { | ||||
| 1212 | return; | ||||
| 1213 | } | ||||
| 1214 | CFGLoop* home_or_ancestor = find_block_for_node(n->in(0))->_loop; | ||||
| 1215 | bool found = false; | ||||
| 1216 | do { | ||||
| 1217 | if (b->_loop == home_or_ancestor) { | ||||
| 1218 | found = true; | ||||
| 1219 | break; | ||||
| 1220 | } | ||||
| 1221 | home_or_ancestor = home_or_ancestor->parent(); | ||||
| 1222 | } while (home_or_ancestor != NULL__null); | ||||
| 1223 | assert(found, "block b is not in n's home loop or an ancestor of it")do { if (!(found)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/block.cpp" , 1223, "assert(" "found" ") failed", "block b is not in n's home loop or an ancestor of it" ); ::breakpoint(); } } while (0); | ||||
| 1224 | } | ||||
| 1225 | |||||
| 1226 | void PhaseCFG::verify() const { | ||||
| 1227 | // Verify sane CFG | ||||
| 1228 | for (uint i = 0; i < number_of_blocks(); i++) { | ||||
| |||||
| 1229 | Block* block = get_block(i); | ||||
| 1230 | uint cnt = block->number_of_nodes(); | ||||
| 1231 | uint j; | ||||
| 1232 | for (j = 0; j < cnt; j++) { | ||||
| 1233 | Node *n = block->get_node(j); | ||||
| 1234 | assert(get_block_for_node(n) == block, "")do { if (!(get_block_for_node(n) == block)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/block.cpp" , 1234, "assert(" "get_block_for_node(n) == block" ") failed" , ""); ::breakpoint(); } } while (0); | ||||
| 1235 | if (j
| ||||
| 1236 | assert(j == 1 || block->get_node(j-1)->is_Phi(), "CreateEx must be first instruction in block")do { if (!(j == 1 || block->get_node(j-1)->is_Phi())) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/block.cpp" , 1236, "assert(" "j == 1 || block->get_node(j-1)->is_Phi()" ") failed", "CreateEx must be first instruction in block"); :: breakpoint(); } } while (0); | ||||
| 1237 | } | ||||
| 1238 | verify_memory_writer_placement(block, n); | ||||
| 1239 | if (n->needs_anti_dependence_check()) { | ||||
| 1240 | verify_anti_dependences(block, n); | ||||
| 1241 | } | ||||
| 1242 | for (uint k = 0; k < n->req(); k++) { | ||||
| 1243 | Node *def = n->in(k); | ||||
| 1244 | if (def && def != n) { | ||||
| 1245 | Block* def_block = get_block_for_node(def); | ||||
| 1246 | assert(def_block || def->is_Con(), "must have block; constants for debug info ok")do { if (!(def_block || def->is_Con())) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/block.cpp" , 1246, "assert(" "def_block || def->is_Con()" ") failed", "must have block; constants for debug info ok"); ::breakpoint (); } } while (0); | ||||
| 1247 | // Verify that all definitions dominate their uses (except for virtual | ||||
| 1248 | // instructions merging multiple definitions). | ||||
| 1249 | assert(n->is_Root() || n->is_Region() || n->is_Phi() || n->is_MachMerge() ||do { if (!(n->is_Root() || n->is_Region() || n->is_Phi () || n->is_MachMerge() || def_block->dominates(block)) ) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/block.cpp" , 1251, "assert(" "n->is_Root() || n->is_Region() || n->is_Phi() || n->is_MachMerge() || def_block->dominates(block)" ") failed", "uses must be dominated by definitions"); ::breakpoint (); } } while (0) | ||||
| |||||
| 1250 | def_block->dominates(block),do { if (!(n->is_Root() || n->is_Region() || n->is_Phi () || n->is_MachMerge() || def_block->dominates(block)) ) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/block.cpp" , 1251, "assert(" "n->is_Root() || n->is_Region() || n->is_Phi() || n->is_MachMerge() || def_block->dominates(block)" ") failed", "uses must be dominated by definitions"); ::breakpoint (); } } while (0) | ||||
| 1251 | "uses must be dominated by definitions")do { if (!(n->is_Root() || n->is_Region() || n->is_Phi () || n->is_MachMerge() || def_block->dominates(block)) ) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/block.cpp" , 1251, "assert(" "n->is_Root() || n->is_Region() || n->is_Phi() || n->is_MachMerge() || def_block->dominates(block)" ") failed", "uses must be dominated by definitions"); ::breakpoint (); } } while (0); | ||||
| 1252 | // Verify that instructions in the block are in correct order. | ||||
| 1253 | // Uses must follow their definition if they are at the same block. | ||||
| 1254 | // Mostly done to check that MachSpillCopy nodes are placed correctly | ||||
| 1255 | // when CreateEx node is moved in build_ifg_physical(). | ||||
| 1256 | if (def_block == block && !(block->head()->is_Loop() && n->is_Phi()) && | ||||
| 1257 | // See (+++) comment in reg_split.cpp | ||||
| 1258 | !(n->jvms() != NULL__null && n->jvms()->is_monitor_use(k))) { | ||||
| 1259 | bool is_loop = false; | ||||
| 1260 | if (n->is_Phi()) { | ||||
| 1261 | for (uint l = 1; l < def->req(); l++) { | ||||
| 1262 | if (n == def->in(l)) { | ||||
| 1263 | is_loop = true; | ||||
| 1264 | break; // Some kind of loop | ||||
| 1265 | } | ||||
| 1266 | } | ||||
| 1267 | } | ||||
| 1268 | assert(is_loop || block->find_node(def) < j, "uses must follow definitions")do { if (!(is_loop || block->find_node(def) < j)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/block.cpp" , 1268, "assert(" "is_loop || block->find_node(def) < j" ") failed", "uses must follow definitions"); ::breakpoint(); } } while (0); | ||||
| 1269 | } | ||||
| 1270 | } | ||||
| 1271 | } | ||||
| 1272 | if (n->is_Proj()) { | ||||
| 1273 | assert(j >= 1, "a projection cannot be the first instruction in a block")do { if (!(j >= 1)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/block.cpp" , 1273, "assert(" "j >= 1" ") failed", "a projection cannot be the first instruction in a block" ); ::breakpoint(); } } while (0); | ||||
| 1274 | Node* pred = block->get_node(j - 1); | ||||
| 1275 | Node* parent = n->in(0); | ||||
| 1276 | assert(parent != NULL, "projections must have a parent")do { if (!(parent != __null)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/block.cpp" , 1276, "assert(" "parent != __null" ") failed", "projections must have a parent" ); ::breakpoint(); } } while (0); | ||||
| 1277 | assert(pred == parent || (pred->is_Proj() && pred->in(0) == parent),do { if (!(pred == parent || (pred->is_Proj() && pred ->in(0) == parent))) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/block.cpp" , 1278, "assert(" "pred == parent || (pred->is_Proj() && pred->in(0) == parent)" ") failed", "projections must follow their parents or other sibling projections" ); ::breakpoint(); } } while (0) | ||||
| 1278 | "projections must follow their parents or other sibling projections")do { if (!(pred == parent || (pred->is_Proj() && pred ->in(0) == parent))) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/block.cpp" , 1278, "assert(" "pred == parent || (pred->is_Proj() && pred->in(0) == parent)" ") failed", "projections must follow their parents or other sibling projections" ); ::breakpoint(); } } while (0); | ||||
| 1279 | } | ||||
| 1280 | } | ||||
| 1281 | |||||
| 1282 | j = block->end_idx(); | ||||
| 1283 | Node* bp = (Node*)block->get_node(block->number_of_nodes() - 1)->is_block_proj(); | ||||
| 1284 | assert(bp, "last instruction must be a block proj")do { if (!(bp)) { (*g_assert_poison) = 'X';; report_vm_error( "/home/daniel/Projects/java/jdk/src/hotspot/share/opto/block.cpp" , 1284, "assert(" "bp" ") failed", "last instruction must be a block proj" ); ::breakpoint(); } } while (0); | ||||
| 1285 | assert(bp == block->get_node(j), "wrong number of successors for this block")do { if (!(bp == block->get_node(j))) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/block.cpp" , 1285, "assert(" "bp == block->get_node(j)" ") failed", "wrong number of successors for this block" ); ::breakpoint(); } } while (0); | ||||
| 1286 | if (bp->is_Catch()) { | ||||
| 1287 | while (block->get_node(--j)->is_MachProj()) { | ||||
| 1288 | ; | ||||
| 1289 | } | ||||
| 1290 | assert(block->get_node(j)->is_MachCall(), "CatchProj must follow call")do { if (!(block->get_node(j)->is_MachCall())) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/block.cpp" , 1290, "assert(" "block->get_node(j)->is_MachCall()" ") failed" , "CatchProj must follow call"); ::breakpoint(); } } while (0 ); | ||||
| 1291 | } else if (bp->is_Mach() && bp->as_Mach()->ideal_Opcode() == Op_If) { | ||||
| 1292 | assert(block->_num_succs == 2, "Conditional branch must have two targets")do { if (!(block->_num_succs == 2)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/block.cpp" , 1292, "assert(" "block->_num_succs == 2" ") failed", "Conditional branch must have two targets" ); ::breakpoint(); } } while (0); | ||||
| 1293 | } | ||||
| 1294 | } | ||||
| 1295 | } | ||||
| 1296 | #endif // ASSERT | ||||
| 1297 | |||||
| 1298 | UnionFind::UnionFind( uint max ) : _cnt(max), _max(max), _indices(NEW_RESOURCE_ARRAY(uint,max)(uint*) resource_allocate_bytes((max) * sizeof(uint))) { | ||||
| 1299 | Copy::zero_to_bytes( _indices, sizeof(uint)*max ); | ||||
| 1300 | } | ||||
| 1301 | |||||
| 1302 | void UnionFind::extend( uint from_idx, uint to_idx ) { | ||||
| 1303 | _nesting.check(); | ||||
| 1304 | if( from_idx >= _max ) { | ||||
| 1305 | uint size = 16; | ||||
| 1306 | while( size <= from_idx ) size <<=1; | ||||
| 1307 | _indices = REALLOC_RESOURCE_ARRAY( uint, _indices, _max, size )(uint*) resource_reallocate_bytes((char*)(_indices), (_max) * sizeof(uint), (size) * sizeof(uint)); | ||||
| 1308 | _max = size; | ||||
| 1309 | } | ||||
| 1310 | while( _cnt <= from_idx ) _indices[_cnt++] = 0; | ||||
| 1311 | _indices[from_idx] = to_idx; | ||||
| 1312 | } | ||||
| 1313 | |||||
| 1314 | void UnionFind::reset( uint max ) { | ||||
| 1315 | // Force the Union-Find mapping to be at least this large | ||||
| 1316 | extend(max,0); | ||||
| 1317 | // Initialize to be the ID mapping. | ||||
| 1318 | for( uint i=0; i<max; i++ ) map(i,i); | ||||
| 1319 | } | ||||
| 1320 | |||||
| 1321 | // Straight out of Tarjan's union-find algorithm | ||||
| 1322 | uint UnionFind::Find_compress( uint idx ) { | ||||
| 1323 | uint cur = idx; | ||||
| 1324 | uint next = lookup(cur); | ||||
| 1325 | while( next != cur ) { // Scan chain of equivalences | ||||
| 1326 | assert( next < cur, "always union smaller" )do { if (!(next < cur)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/block.cpp" , 1326, "assert(" "next < cur" ") failed", "always union smaller" ); ::breakpoint(); } } while (0); | ||||
| 1327 | cur = next; // until find a fixed-point | ||||
| 1328 | next = lookup(cur); | ||||
| 1329 | } | ||||
| 1330 | // Core of union-find algorithm: update chain of | ||||
| 1331 | // equivalences to be equal to the root. | ||||
| 1332 | while( idx != next ) { | ||||
| 1333 | uint tmp = lookup(idx); | ||||
| 1334 | map(idx, next); | ||||
| 1335 | idx = tmp; | ||||
| 1336 | } | ||||
| 1337 | return idx; | ||||
| 1338 | } | ||||
| 1339 | |||||
| 1340 | // Like Find above, but no path compress, so bad asymptotic behavior | ||||
| 1341 | uint UnionFind::Find_const( uint idx ) const { | ||||
| 1342 | if( idx == 0 ) return idx; // Ignore the zero idx | ||||
| 1343 | // Off the end? This can happen during debugging dumps | ||||
| 1344 | // when data structures have not finished being updated. | ||||
| 1345 | if( idx >= _max ) return idx; | ||||
| 1346 | uint next = lookup(idx); | ||||
| 1347 | while( next != idx ) { // Scan chain of equivalences | ||||
| 1348 | idx = next; // until find a fixed-point | ||||
| 1349 | next = lookup(idx); | ||||
| 1350 | } | ||||
| 1351 | return next; | ||||
| 1352 | } | ||||
| 1353 | |||||
| 1354 | // union 2 sets together. | ||||
| 1355 | void UnionFind::Union( uint idx1, uint idx2 ) { | ||||
| 1356 | uint src = Find(idx1); | ||||
| 1357 | uint dst = Find(idx2); | ||||
| 1358 | assert( src, "" )do { if (!(src)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/block.cpp" , 1358, "assert(" "src" ") failed", ""); ::breakpoint(); } } while (0); | ||||
| 1359 | assert( dst, "" )do { if (!(dst)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/block.cpp" , 1359, "assert(" "dst" ") failed", ""); ::breakpoint(); } } while (0); | ||||
| 1360 | assert( src < _max, "oob" )do { if (!(src < _max)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/block.cpp" , 1360, "assert(" "src < _max" ") failed", "oob"); ::breakpoint (); } } while (0); | ||||
| 1361 | assert( dst < _max, "oob" )do { if (!(dst < _max)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/block.cpp" , 1361, "assert(" "dst < _max" ") failed", "oob"); ::breakpoint (); } } while (0); | ||||
| 1362 | assert( src < dst, "always union smaller" )do { if (!(src < dst)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/block.cpp" , 1362, "assert(" "src < dst" ") failed", "always union smaller" ); ::breakpoint(); } } while (0); | ||||
| 1363 | map(dst,src); | ||||
| 1364 | } | ||||
| 1365 | |||||
| 1366 | #ifndef PRODUCT | ||||
| 1367 | void Trace::dump( ) const { | ||||
| 1368 | tty->print_cr("Trace (freq %f)", first_block()->_freq); | ||||
| 1369 | for (Block *b = first_block(); b != NULL__null; b = next(b)) { | ||||
| 1370 | tty->print(" B%d", b->_pre_order); | ||||
| 1371 | if (b->head()->is_Loop()) { | ||||
| 1372 | tty->print(" (L%d)", b->compute_loop_alignment()); | ||||
| 1373 | } | ||||
| 1374 | if (b->has_loop_alignment()) { | ||||
| 1375 | tty->print(" (T%d)", b->code_alignment()); | ||||
| 1376 | } | ||||
| 1377 | } | ||||
| 1378 | tty->cr(); | ||||
| 1379 | } | ||||
| 1380 | |||||
| 1381 | void CFGEdge::dump( ) const { | ||||
| 1382 | tty->print(" B%d --> B%d Freq: %f out:%3d%% in:%3d%% State: ", | ||||
| 1383 | from()->_pre_order, to()->_pre_order, freq(), _from_pct, _to_pct); | ||||
| 1384 | switch(state()) { | ||||
| 1385 | case connected: | ||||
| 1386 | tty->print("connected"); | ||||
| 1387 | break; | ||||
| 1388 | case open: | ||||
| 1389 | tty->print("open"); | ||||
| 1390 | break; | ||||
| 1391 | case interior: | ||||
| 1392 | tty->print("interior"); | ||||
| 1393 | break; | ||||
| 1394 | } | ||||
| 1395 | if (infrequent()) { | ||||
| 1396 | tty->print(" infrequent"); | ||||
| 1397 | } | ||||
| 1398 | tty->cr(); | ||||
| 1399 | } | ||||
| 1400 | #endif | ||||
| 1401 | |||||
| 1402 | // Comparison function for edges | ||||
| 1403 | static int edge_order(CFGEdge **e0, CFGEdge **e1) { | ||||
| 1404 | float freq0 = (*e0)->freq(); | ||||
| 1405 | float freq1 = (*e1)->freq(); | ||||
| 1406 | if (freq0 != freq1) { | ||||
| 1407 | return freq0 > freq1 ? -1 : 1; | ||||
| 1408 | } | ||||
| 1409 | |||||
| 1410 | int dist0 = (*e0)->to()->_rpo - (*e0)->from()->_rpo; | ||||
| 1411 | int dist1 = (*e1)->to()->_rpo - (*e1)->from()->_rpo; | ||||
| 1412 | |||||
| 1413 | return dist1 - dist0; | ||||
| 1414 | } | ||||
| 1415 | |||||
| 1416 | // Comparison function for edges | ||||
| 1417 | extern "C" int trace_frequency_order(const void *p0, const void *p1) { | ||||
| 1418 | Trace *tr0 = *(Trace **) p0; | ||||
| 1419 | Trace *tr1 = *(Trace **) p1; | ||||
| 1420 | Block *b0 = tr0->first_block(); | ||||
| 1421 | Block *b1 = tr1->first_block(); | ||||
| 1422 | |||||
| 1423 | // The trace of connector blocks goes at the end; | ||||
| 1424 | // we only expect one such trace | ||||
| 1425 | if (b0->is_connector() != b1->is_connector()) { | ||||
| 1426 | return b1->is_connector() ? -1 : 1; | ||||
| 1427 | } | ||||
| 1428 | |||||
| 1429 | // Pull more frequently executed blocks to the beginning | ||||
| 1430 | float freq0 = b0->_freq; | ||||
| 1431 | float freq1 = b1->_freq; | ||||
| 1432 | if (freq0 != freq1) { | ||||
| 1433 | return freq0 > freq1 ? -1 : 1; | ||||
| 1434 | } | ||||
| 1435 | |||||
| 1436 | int diff = tr0->first_block()->_rpo - tr1->first_block()->_rpo; | ||||
| 1437 | |||||
| 1438 | return diff; | ||||
| 1439 | } | ||||
| 1440 | |||||
| 1441 | // Find edges of interest, i.e, those which can fall through. Presumes that | ||||
| 1442 | // edges which don't fall through are of low frequency and can be generally | ||||
| 1443 | // ignored. Initialize the list of traces. | ||||
| 1444 | void PhaseBlockLayout::find_edges() { | ||||
| 1445 | // Walk the blocks, creating edges and Traces | ||||
| 1446 | uint i; | ||||
| 1447 | Trace *tr = NULL__null; | ||||
| 1448 | for (i = 0; i < _cfg.number_of_blocks(); i++) { | ||||
| 1449 | Block* b = _cfg.get_block(i); | ||||
| 1450 | tr = new Trace(b, next, prev); | ||||
| 1451 | traces[tr->id()] = tr; | ||||
| 1452 | |||||
| 1453 | // All connector blocks should be at the end of the list | ||||
| 1454 | if (b->is_connector()) break; | ||||
| 1455 | |||||
| 1456 | // If this block and the next one have a one-to-one successor | ||||
| 1457 | // predecessor relationship, simply append the next block | ||||
| 1458 | int nfallthru = b->num_fall_throughs(); | ||||
| 1459 | while (nfallthru == 1 && | ||||
| 1460 | b->succ_fall_through(0)) { | ||||
| 1461 | Block *n = b->_succs[0]; | ||||
| 1462 | |||||
| 1463 | // Skip over single-entry connector blocks, we don't want to | ||||
| 1464 | // add them to the trace. | ||||
| 1465 | while (n->is_connector() && n->num_preds() == 1) { | ||||
| 1466 | n = n->_succs[0]; | ||||
| 1467 | } | ||||
| 1468 | |||||
| 1469 | // We see a merge point, so stop search for the next block | ||||
| 1470 | if (n->num_preds() != 1) break; | ||||
| 1471 | |||||
| 1472 | i++; | ||||
| 1473 | assert(n == _cfg.get_block(i), "expecting next block")do { if (!(n == _cfg.get_block(i))) { (*g_assert_poison) = 'X' ;; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/block.cpp" , 1473, "assert(" "n == _cfg.get_block(i)" ") failed", "expecting next block" ); ::breakpoint(); } } while (0); | ||||
| 1474 | tr->append(n); | ||||
| 1475 | uf->map(n->_pre_order, tr->id()); | ||||
| 1476 | traces[n->_pre_order] = NULL__null; | ||||
| 1477 | nfallthru = b->num_fall_throughs(); | ||||
| 1478 | b = n; | ||||
| 1479 | } | ||||
| 1480 | |||||
| 1481 | if (nfallthru > 0) { | ||||
| 1482 | // Create a CFGEdge for each outgoing | ||||
| 1483 | // edge that could be a fall-through. | ||||
| 1484 | for (uint j = 0; j < b->_num_succs; j++ ) { | ||||
| 1485 | if (b->succ_fall_through(j)) { | ||||
| 1486 | Block *target = b->non_connector_successor(j); | ||||
| 1487 | float freq = b->_freq * b->succ_prob(j); | ||||
| 1488 | int from_pct = (int) ((100 * freq) / b->_freq); | ||||
| 1489 | int to_pct = (int) ((100 * freq) / target->_freq); | ||||
| 1490 | edges->append(new CFGEdge(b, target, freq, from_pct, to_pct)); | ||||
| 1491 | } | ||||
| 1492 | } | ||||
| 1493 | } | ||||
| 1494 | } | ||||
| 1495 | |||||
| 1496 | // Group connector blocks into one trace | ||||
| 1497 | for (i++; i < _cfg.number_of_blocks(); i++) { | ||||
| 1498 | Block *b = _cfg.get_block(i); | ||||
| 1499 | assert(b->is_connector(), "connector blocks at the end")do { if (!(b->is_connector())) { (*g_assert_poison) = 'X'; ; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/block.cpp" , 1499, "assert(" "b->is_connector()" ") failed", "connector blocks at the end" ); ::breakpoint(); } } while (0); | ||||
| 1500 | tr->append(b); | ||||
| 1501 | uf->map(b->_pre_order, tr->id()); | ||||
| 1502 | traces[b->_pre_order] = NULL__null; | ||||
| 1503 | } | ||||
| 1504 | } | ||||
| 1505 | |||||
| 1506 | // Union two traces together in uf, and null out the trace in the list | ||||
| 1507 | void PhaseBlockLayout::union_traces(Trace* updated_trace, Trace* old_trace) { | ||||
| 1508 | uint old_id = old_trace->id(); | ||||
| 1509 | uint updated_id = updated_trace->id(); | ||||
| 1510 | |||||
| 1511 | uint lo_id = updated_id; | ||||
| 1512 | uint hi_id = old_id; | ||||
| 1513 | |||||
| 1514 | // If from is greater than to, swap values to meet | ||||
| 1515 | // UnionFind guarantee. | ||||
| 1516 | if (updated_id > old_id) { | ||||
| 1517 | lo_id = old_id; | ||||
| 1518 | hi_id = updated_id; | ||||
| 1519 | |||||
| 1520 | // Fix up the trace ids | ||||
| 1521 | traces[lo_id] = traces[updated_id]; | ||||
| 1522 | updated_trace->set_id(lo_id); | ||||
| 1523 | } | ||||
| 1524 | |||||
| 1525 | // Union the lower with the higher and remove the pointer | ||||
| 1526 | // to the higher. | ||||
| 1527 | uf->Union(lo_id, hi_id); | ||||
| 1528 | traces[hi_id] = NULL__null; | ||||
| 1529 | } | ||||
| 1530 | |||||
| 1531 | // Append traces together via the most frequently executed edges | ||||
| 1532 | void PhaseBlockLayout::grow_traces() { | ||||
| 1533 | // Order the edges, and drive the growth of Traces via the most | ||||
| 1534 | // frequently executed edges. | ||||
| 1535 | edges->sort(edge_order); | ||||
| 1536 | for (int i = 0; i < edges->length(); i++) { | ||||
| 1537 | CFGEdge *e = edges->at(i); | ||||
| 1538 | |||||
| 1539 | if (e->state() != CFGEdge::open) continue; | ||||
| 1540 | |||||
| 1541 | Block *src_block = e->from(); | ||||
| 1542 | Block *targ_block = e->to(); | ||||
| 1543 | |||||
| 1544 | // Don't grow traces along backedges? | ||||
| 1545 | if (!BlockLayoutRotateLoops) { | ||||
| 1546 | if (targ_block->_rpo <= src_block->_rpo) { | ||||
| 1547 | targ_block->set_loop_alignment(targ_block); | ||||
| 1548 | continue; | ||||
| 1549 | } | ||||
| 1550 | } | ||||
| 1551 | |||||
| 1552 | Trace *src_trace = trace(src_block); | ||||
| 1553 | Trace *targ_trace = trace(targ_block); | ||||
| 1554 | |||||
| 1555 | // If the edge in question can join two traces at their ends, | ||||
| 1556 | // append one trace to the other. | ||||
| 1557 | if (src_trace->last_block() == src_block) { | ||||
| 1558 | if (src_trace == targ_trace) { | ||||
| 1559 | e->set_state(CFGEdge::interior); | ||||
| 1560 | if (targ_trace->backedge(e)) { | ||||
| 1561 | // Reset i to catch any newly eligible edge | ||||
| 1562 | // (Or we could remember the first "open" edge, and reset there) | ||||
| 1563 | i = 0; | ||||
| 1564 | } | ||||
| 1565 | } else if (targ_trace->first_block() == targ_block) { | ||||
| 1566 | e->set_state(CFGEdge::connected); | ||||
| 1567 | src_trace->append(targ_trace); | ||||
| 1568 | union_traces(src_trace, targ_trace); | ||||
| 1569 | } | ||||
| 1570 | } | ||||
| 1571 | } | ||||
| 1572 | } | ||||
| 1573 | |||||
| 1574 | // Embed one trace into another, if the fork or join points are sufficiently | ||||
| 1575 | // balanced. | ||||
| 1576 | void PhaseBlockLayout::merge_traces(bool fall_thru_only) { | ||||
| 1577 | // Walk the edge list a another time, looking at unprocessed edges. | ||||
| 1578 | // Fold in diamonds | ||||
| 1579 | for (int i = 0; i < edges->length(); i++) { | ||||
| 1580 | CFGEdge *e = edges->at(i); | ||||
| 1581 | |||||
| 1582 | if (e->state() != CFGEdge::open) continue; | ||||
| 1583 | if (fall_thru_only) { | ||||
| 1584 | if (e->infrequent()) continue; | ||||
| 1585 | } | ||||
| 1586 | |||||
| 1587 | Block *src_block = e->from(); | ||||
| 1588 | Trace *src_trace = trace(src_block); | ||||
| 1589 | bool src_at_tail = src_trace->last_block() == src_block; | ||||
| 1590 | |||||
| 1591 | Block *targ_block = e->to(); | ||||
| 1592 | Trace *targ_trace = trace(targ_block); | ||||
| 1593 | bool targ_at_start = targ_trace->first_block() == targ_block; | ||||
| 1594 | |||||
| 1595 | if (src_trace == targ_trace) { | ||||
| 1596 | // This may be a loop, but we can't do much about it. | ||||
| 1597 | e->set_state(CFGEdge::interior); | ||||
| 1598 | continue; | ||||
| 1599 | } | ||||
| 1600 | |||||
| 1601 | if (fall_thru_only) { | ||||
| 1602 | // If the edge links the middle of two traces, we can't do anything. | ||||
| 1603 | // Mark the edge and continue. | ||||
| 1604 | if (!src_at_tail & !targ_at_start) { | ||||
| 1605 | continue; | ||||
| 1606 | } | ||||
| 1607 | |||||
| 1608 | // Don't grow traces along backedges? | ||||
| 1609 | if (!BlockLayoutRotateLoops && (targ_block->_rpo <= src_block->_rpo)) { | ||||
| 1610 | continue; | ||||
| 1611 | } | ||||
| 1612 | |||||
| 1613 | // If both ends of the edge are available, why didn't we handle it earlier? | ||||
| 1614 | assert(src_at_tail ^ targ_at_start, "Should have caught this edge earlier.")do { if (!(src_at_tail ^ targ_at_start)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/block.cpp" , 1614, "assert(" "src_at_tail ^ targ_at_start" ") failed", "Should have caught this edge earlier." ); ::breakpoint(); } } while (0); | ||||
| 1615 | |||||
| 1616 | if (targ_at_start) { | ||||
| 1617 | // Insert the "targ" trace in the "src" trace if the insertion point | ||||
| 1618 | // is a two way branch. | ||||
| 1619 | // Better profitability check possible, but may not be worth it. | ||||
| 1620 | // Someday, see if the this "fork" has an associated "join"; | ||||
| 1621 | // then make a policy on merging this trace at the fork or join. | ||||
| 1622 | // For example, other things being equal, it may be better to place this | ||||
| 1623 | // trace at the join point if the "src" trace ends in a two-way, but | ||||
| 1624 | // the insertion point is one-way. | ||||
| 1625 | assert(src_block->num_fall_throughs() == 2, "unexpected diamond")do { if (!(src_block->num_fall_throughs() == 2)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/block.cpp" , 1625, "assert(" "src_block->num_fall_throughs() == 2" ") failed" , "unexpected diamond"); ::breakpoint(); } } while (0); | ||||
| 1626 | e->set_state(CFGEdge::connected); | ||||
| 1627 | src_trace->insert_after(src_block, targ_trace); | ||||
| 1628 | union_traces(src_trace, targ_trace); | ||||
| 1629 | } else if (src_at_tail) { | ||||
| 1630 | if (src_trace != trace(_cfg.get_root_block())) { | ||||
| 1631 | e->set_state(CFGEdge::connected); | ||||
| 1632 | targ_trace->insert_before(targ_block, src_trace); | ||||
| 1633 | union_traces(targ_trace, src_trace); | ||||
| 1634 | } | ||||
| 1635 | } | ||||
| 1636 | } else if (e->state() == CFGEdge::open) { | ||||
| 1637 | // Append traces, even without a fall-thru connection. | ||||
| 1638 | // But leave root entry at the beginning of the block list. | ||||
| 1639 | if (targ_trace != trace(_cfg.get_root_block())) { | ||||
| 1640 | e->set_state(CFGEdge::connected); | ||||
| 1641 | src_trace->append(targ_trace); | ||||
| 1642 | union_traces(src_trace, targ_trace); | ||||
| 1643 | } | ||||
| 1644 | } | ||||
| 1645 | } | ||||
| 1646 | } | ||||
| 1647 | |||||
| 1648 | // Order the sequence of the traces in some desirable way | ||||
| 1649 | void PhaseBlockLayout::reorder_traces(int count) { | ||||
| 1650 | ResourceArea *area = Thread::current()->resource_area(); | ||||
| 1651 | Trace ** new_traces = NEW_ARENA_ARRAY(area, Trace *, count)(Trace **) (area)->Amalloc((count) * sizeof(Trace *)); | ||||
| 1652 | Block_List worklist; | ||||
| 1653 | int new_count = 0; | ||||
| 1654 | |||||
| 1655 | // Compact the traces. | ||||
| 1656 | for (int i = 0; i < count; i++) { | ||||
| 1657 | Trace *tr = traces[i]; | ||||
| 1658 | if (tr != NULL__null) { | ||||
| 1659 | new_traces[new_count++] = tr; | ||||
| 1660 | } | ||||
| 1661 | } | ||||
| 1662 | |||||
| 1663 | // The entry block should be first on the new trace list. | ||||
| 1664 | Trace *tr = trace(_cfg.get_root_block()); | ||||
| 1665 | assert(tr == new_traces[0], "entry trace misplaced")do { if (!(tr == new_traces[0])) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/block.cpp" , 1665, "assert(" "tr == new_traces[0]" ") failed", "entry trace misplaced" ); ::breakpoint(); } } while (0); | ||||
| 1666 | |||||
| 1667 | // Sort the new trace list by frequency | ||||
| 1668 | qsort(new_traces + 1, new_count - 1, sizeof(new_traces[0]), trace_frequency_order); | ||||
| 1669 | |||||
| 1670 | // Collect all blocks from existing Traces | ||||
| 1671 | _cfg.clear_blocks(); | ||||
| 1672 | for (int i = 0; i < new_count; i++) { | ||||
| 1673 | Trace *tr = new_traces[i]; | ||||
| 1674 | if (tr != NULL__null) { | ||||
| 1675 | // push blocks onto the CFG list | ||||
| 1676 | for (Block* b = tr->first_block(); b != NULL__null; b = tr->next(b)) { | ||||
| 1677 | _cfg.add_block(b); | ||||
| 1678 | } | ||||
| 1679 | } | ||||
| 1680 | } | ||||
| 1681 | } | ||||
| 1682 | |||||
| 1683 | // Order basic blocks based on frequency | ||||
| 1684 | PhaseBlockLayout::PhaseBlockLayout(PhaseCFG &cfg) | ||||
| 1685 | : Phase(BlockLayout) | ||||
| 1686 | , _cfg(cfg) { | ||||
| 1687 | ResourceMark rm; | ||||
| 1688 | ResourceArea *area = Thread::current()->resource_area(); | ||||
| 1689 | |||||
| 1690 | // List of traces | ||||
| 1691 | int size = _cfg.number_of_blocks() + 1; | ||||
| 1692 | traces = NEW_ARENA_ARRAY(area, Trace *, size)(Trace **) (area)->Amalloc((size) * sizeof(Trace *)); | ||||
| 1693 | memset(traces, 0, size*sizeof(Trace*)); | ||||
| 1694 | next = NEW_ARENA_ARRAY(area, Block *, size)(Block **) (area)->Amalloc((size) * sizeof(Block *)); | ||||
| 1695 | memset(next, 0, size*sizeof(Block *)); | ||||
| 1696 | prev = NEW_ARENA_ARRAY(area, Block *, size)(Block **) (area)->Amalloc((size) * sizeof(Block *)); | ||||
| 1697 | memset(prev , 0, size*sizeof(Block *)); | ||||
| 1698 | |||||
| 1699 | // List of edges | ||||
| 1700 | edges = new GrowableArray<CFGEdge*>; | ||||
| 1701 | |||||
| 1702 | // Mapping block index --> block_trace | ||||
| 1703 | uf = new UnionFind(size); | ||||
| 1704 | uf->reset(size); | ||||
| 1705 | |||||
| 1706 | // Find edges and create traces. | ||||
| 1707 | find_edges(); | ||||
| 1708 | |||||
| 1709 | // Grow traces at their ends via most frequent edges. | ||||
| 1710 | grow_traces(); | ||||
| 1711 | |||||
| 1712 | // Merge one trace into another, but only at fall-through points. | ||||
| 1713 | // This may make diamonds and other related shapes in a trace. | ||||
| 1714 | merge_traces(true); | ||||
| 1715 | |||||
| 1716 | // Run merge again, allowing two traces to be catenated, even if | ||||
| 1717 | // one does not fall through into the other. This appends loosely | ||||
| 1718 | // related traces to be near each other. | ||||
| 1719 | merge_traces(false); | ||||
| 1720 | |||||
| 1721 | // Re-order all the remaining traces by frequency | ||||
| 1722 | reorder_traces(size); | ||||
| 1723 | |||||
| 1724 | assert(_cfg.number_of_blocks() >= (uint) (size - 1), "number of blocks can not shrink")do { if (!(_cfg.number_of_blocks() >= (uint) (size - 1))) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/block.cpp" , 1724, "assert(" "_cfg.number_of_blocks() >= (uint) (size - 1)" ") failed", "number of blocks can not shrink"); ::breakpoint (); } } while (0); | ||||
| 1725 | } | ||||
| 1726 | |||||
| 1727 | |||||
| 1728 | // Edge e completes a loop in a trace. If the target block is head of the | ||||
| 1729 | // loop, rotate the loop block so that the loop ends in a conditional branch. | ||||
| 1730 | bool Trace::backedge(CFGEdge *e) { | ||||
| 1731 | bool loop_rotated = false; | ||||
| 1732 | Block *src_block = e->from(); | ||||
| 1733 | Block *targ_block = e->to(); | ||||
| 1734 | |||||
| 1735 | assert(last_block() == src_block, "loop discovery at back branch")do { if (!(last_block() == src_block)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/block.cpp" , 1735, "assert(" "last_block() == src_block" ") failed", "loop discovery at back branch" ); ::breakpoint(); } } while (0); | ||||
| 1736 | if (first_block() == targ_block) { | ||||
| 1737 | if (BlockLayoutRotateLoops && last_block()->num_fall_throughs() < 2) { | ||||
| 1738 | // Find the last block in the trace that has a conditional | ||||
| 1739 | // branch. | ||||
| 1740 | Block *b; | ||||
| 1741 | for (b = last_block(); b != NULL__null; b = prev(b)) { | ||||
| 1742 | if (b->num_fall_throughs() == 2) { | ||||
| 1743 | break; | ||||
| 1744 | } | ||||
| 1745 | } | ||||
| 1746 | |||||
| 1747 | if (b != last_block() && b != NULL__null) { | ||||
| 1748 | loop_rotated = true; | ||||
| 1749 | |||||
| 1750 | // Rotate the loop by doing two-part linked-list surgery. | ||||
| 1751 | append(first_block()); | ||||
| 1752 | break_loop_after(b); | ||||
| 1753 | } | ||||
| 1754 | } | ||||
| 1755 | |||||
| 1756 | // Backbranch to the top of a trace | ||||
| 1757 | // Scroll forward through the trace from the targ_block. If we find | ||||
| 1758 | // a loop head before another loop top, use the the loop head alignment. | ||||
| 1759 | for (Block *b = targ_block; b != NULL__null; b = next(b)) { | ||||
| 1760 | if (b->has_loop_alignment()) { | ||||
| 1761 | break; | ||||
| 1762 | } | ||||
| 1763 | if (b->head()->is_Loop()) { | ||||
| 1764 | targ_block = b; | ||||
| 1765 | break; | ||||
| 1766 | } | ||||
| 1767 | } | ||||
| 1768 | |||||
| 1769 | first_block()->set_loop_alignment(targ_block); | ||||
| 1770 | |||||
| 1771 | } else { | ||||
| 1772 | // That loop may already have a loop top (we're reaching it again | ||||
| 1773 | // through the backedge of an outer loop) | ||||
| 1774 | Block* b = prev(targ_block); | ||||
| 1775 | bool has_top = targ_block->head()->is_Loop() && b->has_loop_alignment() && !b->head()->is_Loop(); | ||||
| 1776 | if (!has_top) { | ||||
| 1777 | // Backbranch into the middle of a trace | ||||
| 1778 | targ_block->set_loop_alignment(targ_block); | ||||
| 1779 | } | ||||
| 1780 | } | ||||
| 1781 | |||||
| 1782 | return loop_rotated; | ||||
| 1783 | } |
| 1 | /* |
| 2 | * Copyright (c) 1997, 2021, Oracle and/or its affiliates. All rights reserved. |
| 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
| 4 | * |
| 5 | * This code is free software; you can redistribute it and/or modify it |
| 6 | * under the terms of the GNU General Public License version 2 only, as |
| 7 | * published by the Free Software Foundation. |
| 8 | * |
| 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
| 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
| 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
| 12 | * version 2 for more details (a copy is included in the LICENSE file that |
| 13 | * accompanied this code). |
| 14 | * |
| 15 | * You should have received a copy of the GNU General Public License version |
| 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
| 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
| 18 | * |
| 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
| 20 | * or visit www.oracle.com if you need additional information or have any |
| 21 | * questions. |
| 22 | * |
| 23 | */ |
| 24 | |
| 25 | #ifndef SHARE_OPTO_NODE_HPP |
| 26 | #define SHARE_OPTO_NODE_HPP |
| 27 | |
| 28 | #include "libadt/vectset.hpp" |
| 29 | #include "opto/compile.hpp" |
| 30 | #include "opto/type.hpp" |
| 31 | #include "utilities/copy.hpp" |
| 32 | |
| 33 | // Portions of code courtesy of Clifford Click |
| 34 | |
| 35 | // Optimization - Graph Style |
| 36 | |
| 37 | |
| 38 | class AbstractLockNode; |
| 39 | class AddNode; |
| 40 | class AddPNode; |
| 41 | class AliasInfo; |
| 42 | class AllocateArrayNode; |
| 43 | class AllocateNode; |
| 44 | class ArrayCopyNode; |
| 45 | class BaseCountedLoopNode; |
| 46 | class BaseCountedLoopEndNode; |
| 47 | class BlackholeNode; |
| 48 | class Block; |
| 49 | class BoolNode; |
| 50 | class BoxLockNode; |
| 51 | class CMoveNode; |
| 52 | class CallDynamicJavaNode; |
| 53 | class CallJavaNode; |
| 54 | class CallLeafNode; |
| 55 | class CallLeafNoFPNode; |
| 56 | class CallNode; |
| 57 | class CallRuntimeNode; |
| 58 | class CallNativeNode; |
| 59 | class CallStaticJavaNode; |
| 60 | class CastFFNode; |
| 61 | class CastDDNode; |
| 62 | class CastVVNode; |
| 63 | class CastIINode; |
| 64 | class CastLLNode; |
| 65 | class CatchNode; |
| 66 | class CatchProjNode; |
| 67 | class CheckCastPPNode; |
| 68 | class ClearArrayNode; |
| 69 | class CmpNode; |
| 70 | class CodeBuffer; |
| 71 | class ConstraintCastNode; |
| 72 | class ConNode; |
| 73 | class CompareAndSwapNode; |
| 74 | class CompareAndExchangeNode; |
| 75 | class CountedLoopNode; |
| 76 | class CountedLoopEndNode; |
| 77 | class DecodeNarrowPtrNode; |
| 78 | class DecodeNNode; |
| 79 | class DecodeNKlassNode; |
| 80 | class EncodeNarrowPtrNode; |
| 81 | class EncodePNode; |
| 82 | class EncodePKlassNode; |
| 83 | class FastLockNode; |
| 84 | class FastUnlockNode; |
| 85 | class HaltNode; |
| 86 | class IfNode; |
| 87 | class IfProjNode; |
| 88 | class IfFalseNode; |
| 89 | class IfTrueNode; |
| 90 | class InitializeNode; |
| 91 | class JVMState; |
| 92 | class JumpNode; |
| 93 | class JumpProjNode; |
| 94 | class LoadNode; |
| 95 | class LoadStoreNode; |
| 96 | class LoadStoreConditionalNode; |
| 97 | class LockNode; |
| 98 | class LongCountedLoopNode; |
| 99 | class LongCountedLoopEndNode; |
| 100 | class LoopNode; |
| 101 | class LShiftNode; |
| 102 | class MachBranchNode; |
| 103 | class MachCallDynamicJavaNode; |
| 104 | class MachCallJavaNode; |
| 105 | class MachCallLeafNode; |
| 106 | class MachCallNode; |
| 107 | class MachCallNativeNode; |
| 108 | class MachCallRuntimeNode; |
| 109 | class MachCallStaticJavaNode; |
| 110 | class MachConstantBaseNode; |
| 111 | class MachConstantNode; |
| 112 | class MachGotoNode; |
| 113 | class MachIfNode; |
| 114 | class MachJumpNode; |
| 115 | class MachNode; |
| 116 | class MachNullCheckNode; |
| 117 | class MachProjNode; |
| 118 | class MachReturnNode; |
| 119 | class MachSafePointNode; |
| 120 | class MachSpillCopyNode; |
| 121 | class MachTempNode; |
| 122 | class MachMergeNode; |
| 123 | class MachMemBarNode; |
| 124 | class Matcher; |
| 125 | class MemBarNode; |
| 126 | class MemBarStoreStoreNode; |
| 127 | class MemNode; |
| 128 | class MergeMemNode; |
| 129 | class MoveNode; |
| 130 | class MulNode; |
| 131 | class MultiNode; |
| 132 | class MultiBranchNode; |
| 133 | class NeverBranchNode; |
| 134 | class Opaque1Node; |
| 135 | class OuterStripMinedLoopNode; |
| 136 | class OuterStripMinedLoopEndNode; |
| 137 | class Node; |
| 138 | class Node_Array; |
| 139 | class Node_List; |
| 140 | class Node_Stack; |
| 141 | class OopMap; |
| 142 | class ParmNode; |
| 143 | class PCTableNode; |
| 144 | class PhaseCCP; |
| 145 | class PhaseGVN; |
| 146 | class PhaseIterGVN; |
| 147 | class PhaseRegAlloc; |
| 148 | class PhaseTransform; |
| 149 | class PhaseValues; |
| 150 | class PhiNode; |
| 151 | class Pipeline; |
| 152 | class ProjNode; |
| 153 | class RangeCheckNode; |
| 154 | class RegMask; |
| 155 | class RegionNode; |
| 156 | class RootNode; |
| 157 | class SafePointNode; |
| 158 | class SafePointScalarObjectNode; |
| 159 | class StartNode; |
| 160 | class State; |
| 161 | class StoreNode; |
| 162 | class SubNode; |
| 163 | class SubTypeCheckNode; |
| 164 | class Type; |
| 165 | class TypeNode; |
| 166 | class UnlockNode; |
| 167 | class VectorNode; |
| 168 | class LoadVectorNode; |
| 169 | class LoadVectorMaskedNode; |
| 170 | class StoreVectorMaskedNode; |
| 171 | class LoadVectorGatherNode; |
| 172 | class StoreVectorNode; |
| 173 | class StoreVectorScatterNode; |
| 174 | class VectorMaskCmpNode; |
| 175 | class VectorUnboxNode; |
| 176 | class VectorSet; |
| 177 | class VectorReinterpretNode; |
| 178 | class ShiftVNode; |
| 179 | |
| 180 | // The type of all node counts and indexes. |
| 181 | // It must hold at least 16 bits, but must also be fast to load and store. |
| 182 | // This type, if less than 32 bits, could limit the number of possible nodes. |
| 183 | // (To make this type platform-specific, move to globalDefinitions_xxx.hpp.) |
| 184 | typedef unsigned int node_idx_t; |
| 185 | |
| 186 | |
| 187 | #ifndef OPTO_DU_ITERATOR_ASSERT1 |
| 188 | #ifdef ASSERT1 |
| 189 | #define OPTO_DU_ITERATOR_ASSERT1 1 |
| 190 | #else |
| 191 | #define OPTO_DU_ITERATOR_ASSERT1 0 |
| 192 | #endif |
| 193 | #endif //OPTO_DU_ITERATOR_ASSERT |
| 194 | |
| 195 | #if OPTO_DU_ITERATOR_ASSERT1 |
| 196 | class DUIterator; |
| 197 | class DUIterator_Fast; |
| 198 | class DUIterator_Last; |
| 199 | #else |
| 200 | typedef uint DUIterator; |
| 201 | typedef Node** DUIterator_Fast; |
| 202 | typedef Node** DUIterator_Last; |
| 203 | #endif |
| 204 | |
| 205 | // Node Sentinel |
| 206 | #define NodeSentinel(Node*)-1 (Node*)-1 |
| 207 | |
| 208 | // Unknown count frequency |
| 209 | #define COUNT_UNKNOWN(-1.0f) (-1.0f) |
| 210 | |
| 211 | //------------------------------Node------------------------------------------- |
| 212 | // Nodes define actions in the program. They create values, which have types. |
| 213 | // They are both vertices in a directed graph and program primitives. Nodes |
| 214 | // are labeled; the label is the "opcode", the primitive function in the lambda |
| 215 | // calculus sense that gives meaning to the Node. Node inputs are ordered (so |
| 216 | // that "a-b" is different from "b-a"). The inputs to a Node are the inputs to |
| 217 | // the Node's function. These inputs also define a Type equation for the Node. |
| 218 | // Solving these Type equations amounts to doing dataflow analysis. |
| 219 | // Control and data are uniformly represented in the graph. Finally, Nodes |
| 220 | // have a unique dense integer index which is used to index into side arrays |
| 221 | // whenever I have phase-specific information. |
| 222 | |
| 223 | class Node { |
| 224 | friend class VMStructs; |
| 225 | |
| 226 | // Lots of restrictions on cloning Nodes |
| 227 | NONCOPYABLE(Node)Node(Node const&) = delete; Node& operator=(Node const &) = delete; |
| 228 | |
| 229 | public: |
| 230 | friend class Compile; |
| 231 | #if OPTO_DU_ITERATOR_ASSERT1 |
| 232 | friend class DUIterator_Common; |
| 233 | friend class DUIterator; |
| 234 | friend class DUIterator_Fast; |
| 235 | friend class DUIterator_Last; |
| 236 | #endif |
| 237 | |
| 238 | // Because Nodes come and go, I define an Arena of Node structures to pull |
| 239 | // from. This should allow fast access to node creation & deletion. This |
| 240 | // field is a local cache of a value defined in some "program fragment" for |
| 241 | // which these Nodes are just a part of. |
| 242 | |
| 243 | inline void* operator new(size_t x) throw() { |
| 244 | Compile* C = Compile::current(); |
| 245 | Node* n = (Node*)C->node_arena()->AmallocWords(x); |
| 246 | return (void*)n; |
| 247 | } |
| 248 | |
| 249 | // Delete is a NOP |
| 250 | void operator delete( void *ptr ) {} |
| 251 | // Fancy destructor; eagerly attempt to reclaim Node numberings and storage |
| 252 | void destruct(PhaseValues* phase); |
| 253 | |
| 254 | // Create a new Node. Required is the number is of inputs required for |
| 255 | // semantic correctness. |
| 256 | Node( uint required ); |
| 257 | |
| 258 | // Create a new Node with given input edges. |
| 259 | // This version requires use of the "edge-count" new. |
| 260 | // E.g. new (C,3) FooNode( C, NULL, left, right ); |
| 261 | Node( Node *n0 ); |
| 262 | Node( Node *n0, Node *n1 ); |
| 263 | Node( Node *n0, Node *n1, Node *n2 ); |
| 264 | Node( Node *n0, Node *n1, Node *n2, Node *n3 ); |
| 265 | Node( Node *n0, Node *n1, Node *n2, Node *n3, Node *n4 ); |
| 266 | Node( Node *n0, Node *n1, Node *n2, Node *n3, Node *n4, Node *n5 ); |
| 267 | Node( Node *n0, Node *n1, Node *n2, Node *n3, |
| 268 | Node *n4, Node *n5, Node *n6 ); |
| 269 | |
| 270 | // Clone an inherited Node given only the base Node type. |
| 271 | Node* clone() const; |
| 272 | |
| 273 | // Clone a Node, immediately supplying one or two new edges. |
| 274 | // The first and second arguments, if non-null, replace in(1) and in(2), |
| 275 | // respectively. |
| 276 | Node* clone_with_data_edge(Node* in1, Node* in2 = NULL__null) const { |
| 277 | Node* nn = clone(); |
| 278 | if (in1 != NULL__null) nn->set_req(1, in1); |
| 279 | if (in2 != NULL__null) nn->set_req(2, in2); |
| 280 | return nn; |
| 281 | } |
| 282 | |
| 283 | private: |
| 284 | // Shared setup for the above constructors. |
| 285 | // Handles all interactions with Compile::current. |
| 286 | // Puts initial values in all Node fields except _idx. |
| 287 | // Returns the initial value for _idx, which cannot |
| 288 | // be initialized by assignment. |
| 289 | inline int Init(int req); |
| 290 | |
| 291 | //----------------- input edge handling |
| 292 | protected: |
| 293 | friend class PhaseCFG; // Access to address of _in array elements |
| 294 | Node **_in; // Array of use-def references to Nodes |
| 295 | Node **_out; // Array of def-use references to Nodes |
| 296 | |
| 297 | // Input edges are split into two categories. Required edges are required |
| 298 | // for semantic correctness; order is important and NULLs are allowed. |
| 299 | // Precedence edges are used to help determine execution order and are |
| 300 | // added, e.g., for scheduling purposes. They are unordered and not |
| 301 | // duplicated; they have no embedded NULLs. Edges from 0 to _cnt-1 |
| 302 | // are required, from _cnt to _max-1 are precedence edges. |
| 303 | node_idx_t _cnt; // Total number of required Node inputs. |
| 304 | |
| 305 | node_idx_t _max; // Actual length of input array. |
| 306 | |
| 307 | // Output edges are an unordered list of def-use edges which exactly |
| 308 | // correspond to required input edges which point from other nodes |
| 309 | // to this one. Thus the count of the output edges is the number of |
| 310 | // users of this node. |
| 311 | node_idx_t _outcnt; // Total number of Node outputs. |
| 312 | |
| 313 | node_idx_t _outmax; // Actual length of output array. |
| 314 | |
| 315 | // Grow the actual input array to the next larger power-of-2 bigger than len. |
| 316 | void grow( uint len ); |
| 317 | // Grow the output array to the next larger power-of-2 bigger than len. |
| 318 | void out_grow( uint len ); |
| 319 | |
| 320 | public: |
| 321 | // Each Node is assigned a unique small/dense number. This number is used |
| 322 | // to index into auxiliary arrays of data and bit vectors. |
| 323 | // The field _idx is declared constant to defend against inadvertent assignments, |
| 324 | // since it is used by clients as a naked field. However, the field's value can be |
| 325 | // changed using the set_idx() method. |
| 326 | // |
| 327 | // The PhaseRenumberLive phase renumbers nodes based on liveness information. |
| 328 | // Therefore, it updates the value of the _idx field. The parse-time _idx is |
| 329 | // preserved in _parse_idx. |
| 330 | const node_idx_t _idx; |
| 331 | DEBUG_ONLY(const node_idx_t _parse_idx;)const node_idx_t _parse_idx; |
| 332 | // IGV node identifier. Two nodes, possibly in different compilation phases, |
| 333 | // have the same IGV identifier if (and only if) they are the very same node |
| 334 | // (same memory address) or one is "derived" from the other (by e.g. |
| 335 | // renumbering or matching). This identifier makes it possible to follow the |
| 336 | // entire lifetime of a node in IGV even if its C2 identifier (_idx) changes. |
| 337 | NOT_PRODUCT(node_idx_t _igv_idx;)node_idx_t _igv_idx; |
| 338 | |
| 339 | // Get the (read-only) number of input edges |
| 340 | uint req() const { return _cnt; } |
| 341 | uint len() const { return _max; } |
| 342 | // Get the (read-only) number of output edges |
| 343 | uint outcnt() const { return _outcnt; } |
| 344 | |
| 345 | #if OPTO_DU_ITERATOR_ASSERT1 |
| 346 | // Iterate over the out-edges of this node. Deletions are illegal. |
| 347 | inline DUIterator outs() const; |
| 348 | // Use this when the out array might have changed to suppress asserts. |
| 349 | inline DUIterator& refresh_out_pos(DUIterator& i) const; |
| 350 | // Does the node have an out at this position? (Used for iteration.) |
| 351 | inline bool has_out(DUIterator& i) const; |
| 352 | inline Node* out(DUIterator& i) const; |
| 353 | // Iterate over the out-edges of this node. All changes are illegal. |
| 354 | inline DUIterator_Fast fast_outs(DUIterator_Fast& max) const; |
| 355 | inline Node* fast_out(DUIterator_Fast& i) const; |
| 356 | // Iterate over the out-edges of this node, deleting one at a time. |
| 357 | inline DUIterator_Last last_outs(DUIterator_Last& min) const; |
| 358 | inline Node* last_out(DUIterator_Last& i) const; |
| 359 | // The inline bodies of all these methods are after the iterator definitions. |
| 360 | #else |
| 361 | // Iterate over the out-edges of this node. Deletions are illegal. |
| 362 | // This iteration uses integral indexes, to decouple from array reallocations. |
| 363 | DUIterator outs() const { return 0; } |
| 364 | // Use this when the out array might have changed to suppress asserts. |
| 365 | DUIterator refresh_out_pos(DUIterator i) const { return i; } |
| 366 | |
| 367 | // Reference to the i'th output Node. Error if out of bounds. |
| 368 | Node* out(DUIterator i) const { assert(i < _outcnt, "oob")do { if (!(i < _outcnt)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/node.hpp" , 368, "assert(" "i < _outcnt" ") failed", "oob"); ::breakpoint (); } } while (0); return _out[i]; } |
| 369 | // Does the node have an out at this position? (Used for iteration.) |
| 370 | bool has_out(DUIterator i) const { return i < _outcnt; } |
| 371 | |
| 372 | // Iterate over the out-edges of this node. All changes are illegal. |
| 373 | // This iteration uses a pointer internal to the out array. |
| 374 | DUIterator_Fast fast_outs(DUIterator_Fast& max) const { |
| 375 | Node** out = _out; |
| 376 | // Assign a limit pointer to the reference argument: |
| 377 | max = out + (ptrdiff_t)_outcnt; |
| 378 | // Return the base pointer: |
| 379 | return out; |
| 380 | } |
| 381 | Node* fast_out(DUIterator_Fast i) const { return *i; } |
| 382 | // Iterate over the out-edges of this node, deleting one at a time. |
| 383 | // This iteration uses a pointer internal to the out array. |
| 384 | DUIterator_Last last_outs(DUIterator_Last& min) const { |
| 385 | Node** out = _out; |
| 386 | // Assign a limit pointer to the reference argument: |
| 387 | min = out; |
| 388 | // Return the pointer to the start of the iteration: |
| 389 | return out + (ptrdiff_t)_outcnt - 1; |
| 390 | } |
| 391 | Node* last_out(DUIterator_Last i) const { return *i; } |
| 392 | #endif |
| 393 | |
| 394 | // Reference to the i'th input Node. Error if out of bounds. |
| 395 | Node* in(uint i) const { assert(i < _max, "oob: i=%d, _max=%d", i, _max)do { if (!(i < _max)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/node.hpp" , 395, "assert(" "i < _max" ") failed", "oob: i=%d, _max=%d" , i, _max); ::breakpoint(); } } while (0); return _in[i]; } |
| 396 | // Reference to the i'th input Node. NULL if out of bounds. |
| 397 | Node* lookup(uint i) const { return ((i < _max) ? _in[i] : NULL__null); } |
| 398 | // Reference to the i'th output Node. Error if out of bounds. |
| 399 | // Use this accessor sparingly. We are going trying to use iterators instead. |
| 400 | Node* raw_out(uint i) const { assert(i < _outcnt,"oob")do { if (!(i < _outcnt)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/node.hpp" , 400, "assert(" "i < _outcnt" ") failed", "oob"); ::breakpoint (); } } while (0); return _out[i]; } |
| 401 | // Return the unique out edge. |
| 402 | Node* unique_out() const { assert(_outcnt==1,"not unique")do { if (!(_outcnt==1)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/node.hpp" , 402, "assert(" "_outcnt==1" ") failed", "not unique"); ::breakpoint (); } } while (0); return _out[0]; } |
| 403 | // Delete out edge at position 'i' by moving last out edge to position 'i' |
| 404 | void raw_del_out(uint i) { |
| 405 | assert(i < _outcnt,"oob")do { if (!(i < _outcnt)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/node.hpp" , 405, "assert(" "i < _outcnt" ") failed", "oob"); ::breakpoint (); } } while (0); |
| 406 | assert(_outcnt > 0,"oob")do { if (!(_outcnt > 0)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/node.hpp" , 406, "assert(" "_outcnt > 0" ") failed", "oob"); ::breakpoint (); } } while (0); |
| 407 | #if OPTO_DU_ITERATOR_ASSERT1 |
| 408 | // Record that a change happened here. |
| 409 | debug_only(_last_del = _out[i]; ++_del_tick)_last_del = _out[i]; ++_del_tick; |
| 410 | #endif |
| 411 | _out[i] = _out[--_outcnt]; |
| 412 | // Smash the old edge so it can't be used accidentally. |
| 413 | debug_only(_out[_outcnt] = (Node *)(uintptr_t)0xdeadbeef)_out[_outcnt] = (Node *)(uintptr_t)0xdeadbeef; |
| 414 | } |
| 415 | |
| 416 | #ifdef ASSERT1 |
| 417 | bool is_dead() const; |
| 418 | #define is_not_dead(n)((n) == __null || !VerifyIterativeGVN || !((n)->is_dead()) ) ((n) == NULL__null || !VerifyIterativeGVN || !((n)->is_dead())) |
| 419 | bool is_reachable_from_root() const; |
| 420 | #endif |
| 421 | // Check whether node has become unreachable |
| 422 | bool is_unreachable(PhaseIterGVN &igvn) const; |
| 423 | |
| 424 | // Set a required input edge, also updates corresponding output edge |
| 425 | void add_req( Node *n ); // Append a NEW required input |
| 426 | void add_req( Node *n0, Node *n1 ) { |
| 427 | add_req(n0); add_req(n1); } |
| 428 | void add_req( Node *n0, Node *n1, Node *n2 ) { |
| 429 | add_req(n0); add_req(n1); add_req(n2); } |
| 430 | void add_req_batch( Node* n, uint m ); // Append m NEW required inputs (all n). |
| 431 | void del_req( uint idx ); // Delete required edge & compact |
| 432 | void del_req_ordered( uint idx ); // Delete required edge & compact with preserved order |
| 433 | void ins_req( uint i, Node *n ); // Insert a NEW required input |
| 434 | void set_req( uint i, Node *n ) { |
| 435 | assert( is_not_dead(n), "can not use dead node")do { if (!(((n) == __null || !VerifyIterativeGVN || !((n)-> is_dead())))) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/node.hpp" , 435, "assert(" "((n) == __null || !VerifyIterativeGVN || !((n)->is_dead()))" ") failed", "can not use dead node"); ::breakpoint(); } } while (0); |
| 436 | assert( i < _cnt, "oob: i=%d, _cnt=%d", i, _cnt)do { if (!(i < _cnt)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/node.hpp" , 436, "assert(" "i < _cnt" ") failed", "oob: i=%d, _cnt=%d" , i, _cnt); ::breakpoint(); } } while (0); |
| 437 | assert( !VerifyHashTableKeys || _hash_lock == 0,do { if (!(!VerifyHashTableKeys || _hash_lock == 0)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/node.hpp" , 438, "assert(" "!VerifyHashTableKeys || _hash_lock == 0" ") failed" , "remove node from hash table before modifying it"); ::breakpoint (); } } while (0) |
| 438 | "remove node from hash table before modifying it")do { if (!(!VerifyHashTableKeys || _hash_lock == 0)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/node.hpp" , 438, "assert(" "!VerifyHashTableKeys || _hash_lock == 0" ") failed" , "remove node from hash table before modifying it"); ::breakpoint (); } } while (0); |
| 439 | Node** p = &_in[i]; // cache this._in, across the del_out call |
| 440 | if (*p != NULL__null) (*p)->del_out((Node *)this); |
| 441 | (*p) = n; |
| 442 | if (n != NULL__null) n->add_out((Node *)this); |
| 443 | Compile::current()->record_modified_node(this); |
| 444 | } |
| 445 | // Light version of set_req() to init inputs after node creation. |
| 446 | void init_req( uint i, Node *n ) { |
| 447 | assert( i == 0 && this == n ||do { if (!(i == 0 && this == n || ((n) == __null || ! VerifyIterativeGVN || !((n)->is_dead())))) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/node.hpp" , 448, "assert(" "i == 0 && this == n || ((n) == __null || !VerifyIterativeGVN || !((n)->is_dead()))" ") failed", "can not use dead node"); ::breakpoint(); } } while (0) |
| 448 | is_not_dead(n), "can not use dead node")do { if (!(i == 0 && this == n || ((n) == __null || ! VerifyIterativeGVN || !((n)->is_dead())))) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/node.hpp" , 448, "assert(" "i == 0 && this == n || ((n) == __null || !VerifyIterativeGVN || !((n)->is_dead()))" ") failed", "can not use dead node"); ::breakpoint(); } } while (0); |
| 449 | assert( i < _cnt, "oob")do { if (!(i < _cnt)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/node.hpp" , 449, "assert(" "i < _cnt" ") failed", "oob"); ::breakpoint (); } } while (0); |
| 450 | assert( !VerifyHashTableKeys || _hash_lock == 0,do { if (!(!VerifyHashTableKeys || _hash_lock == 0)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/node.hpp" , 451, "assert(" "!VerifyHashTableKeys || _hash_lock == 0" ") failed" , "remove node from hash table before modifying it"); ::breakpoint (); } } while (0) |
| 451 | "remove node from hash table before modifying it")do { if (!(!VerifyHashTableKeys || _hash_lock == 0)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/node.hpp" , 451, "assert(" "!VerifyHashTableKeys || _hash_lock == 0" ") failed" , "remove node from hash table before modifying it"); ::breakpoint (); } } while (0); |
| 452 | assert( _in[i] == NULL, "sanity")do { if (!(_in[i] == __null)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/node.hpp" , 452, "assert(" "_in[i] == __null" ") failed", "sanity"); :: breakpoint(); } } while (0); |
| 453 | _in[i] = n; |
| 454 | if (n != NULL__null) n->add_out((Node *)this); |
| 455 | Compile::current()->record_modified_node(this); |
| 456 | } |
| 457 | // Find first occurrence of n among my edges: |
| 458 | int find_edge(Node* n); |
| 459 | int find_prec_edge(Node* n) { |
| 460 | for (uint i = req(); i < len(); i++) { |
| 461 | if (_in[i] == n) return i; |
| 462 | if (_in[i] == NULL__null) { |
| 463 | DEBUG_ONLY( while ((++i) < len()) assert(_in[i] == NULL, "Gap in prec edges!"); )while ((++i) < len()) do { if (!(_in[i] == __null)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/node.hpp" , 463, "assert(" "_in[i] == __null" ") failed", "Gap in prec edges!" ); ::breakpoint(); } } while (0); |
| 464 | break; |
| 465 | } |
| 466 | } |
| 467 | return -1; |
| 468 | } |
| 469 | int replace_edge(Node* old, Node* neww, PhaseGVN* gvn = NULL__null); |
| 470 | int replace_edges_in_range(Node* old, Node* neww, int start, int end, PhaseGVN* gvn); |
| 471 | // NULL out all inputs to eliminate incoming Def-Use edges. |
| 472 | void disconnect_inputs(Compile* C); |
| 473 | |
| 474 | // Quickly, return true if and only if I am Compile::current()->top(). |
| 475 | bool is_top() const { |
| 476 | assert((this == (Node*) Compile::current()->top()) == (_out == NULL), "")do { if (!((this == (Node*) Compile::current()->top()) == ( _out == __null))) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/node.hpp" , 476, "assert(" "(this == (Node*) Compile::current()->top()) == (_out == __null)" ") failed", ""); ::breakpoint(); } } while (0); |
| 477 | return (_out == NULL__null); |
| 478 | } |
| 479 | // Reaffirm invariants for is_top. (Only from Compile::set_cached_top_node.) |
| 480 | void setup_is_top(); |
| 481 | |
| 482 | // Strip away casting. (It is depth-limited.) |
| 483 | Node* uncast(bool keep_deps = false) const; |
| 484 | // Return whether two Nodes are equivalent, after stripping casting. |
| 485 | bool eqv_uncast(const Node* n, bool keep_deps = false) const { |
| 486 | return (this->uncast(keep_deps) == n->uncast(keep_deps)); |
| 487 | } |
| 488 | |
| 489 | // Find out of current node that matches opcode. |
| 490 | Node* find_out_with(int opcode); |
| 491 | // Return true if the current node has an out that matches opcode. |
| 492 | bool has_out_with(int opcode); |
| 493 | // Return true if the current node has an out that matches any of the opcodes. |
| 494 | bool has_out_with(int opcode1, int opcode2, int opcode3, int opcode4); |
| 495 | |
| 496 | private: |
| 497 | static Node* uncast_helper(const Node* n, bool keep_deps); |
| 498 | |
| 499 | // Add an output edge to the end of the list |
| 500 | void add_out( Node *n ) { |
| 501 | if (is_top()) return; |
| 502 | if( _outcnt == _outmax ) out_grow(_outcnt); |
| 503 | _out[_outcnt++] = n; |
| 504 | } |
| 505 | // Delete an output edge |
| 506 | void del_out( Node *n ) { |
| 507 | if (is_top()) return; |
| 508 | Node** outp = &_out[_outcnt]; |
| 509 | // Find and remove n |
| 510 | do { |
| 511 | assert(outp > _out, "Missing Def-Use edge")do { if (!(outp > _out)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/node.hpp" , 511, "assert(" "outp > _out" ") failed", "Missing Def-Use edge" ); ::breakpoint(); } } while (0); |
| 512 | } while (*--outp != n); |
| 513 | *outp = _out[--_outcnt]; |
| 514 | // Smash the old edge so it can't be used accidentally. |
| 515 | debug_only(_out[_outcnt] = (Node *)(uintptr_t)0xdeadbeef)_out[_outcnt] = (Node *)(uintptr_t)0xdeadbeef; |
| 516 | // Record that a change happened here. |
| 517 | #if OPTO_DU_ITERATOR_ASSERT1 |
| 518 | debug_only(_last_del = n; ++_del_tick)_last_del = n; ++_del_tick; |
| 519 | #endif |
| 520 | } |
| 521 | // Close gap after removing edge. |
| 522 | void close_prec_gap_at(uint gap) { |
| 523 | assert(_cnt <= gap && gap < _max, "no valid prec edge")do { if (!(_cnt <= gap && gap < _max)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/node.hpp" , 523, "assert(" "_cnt <= gap && gap < _max" ") failed" , "no valid prec edge"); ::breakpoint(); } } while (0); |
| 524 | uint i = gap; |
| 525 | Node *last = NULL__null; |
| 526 | for (; i < _max-1; ++i) { |
| 527 | Node *next = _in[i+1]; |
| 528 | if (next == NULL__null) break; |
| 529 | last = next; |
| 530 | } |
| 531 | _in[gap] = last; // Move last slot to empty one. |
| 532 | _in[i] = NULL__null; // NULL out last slot. |
| 533 | } |
| 534 | |
| 535 | public: |
| 536 | // Globally replace this node by a given new node, updating all uses. |
| 537 | void replace_by(Node* new_node); |
| 538 | // Globally replace this node by a given new node, updating all uses |
| 539 | // and cutting input edges of old node. |
| 540 | void subsume_by(Node* new_node, Compile* c) { |
| 541 | replace_by(new_node); |
| 542 | disconnect_inputs(c); |
| 543 | } |
| 544 | void set_req_X(uint i, Node *n, PhaseIterGVN *igvn); |
| 545 | void set_req_X(uint i, Node *n, PhaseGVN *gvn); |
| 546 | // Find the one non-null required input. RegionNode only |
| 547 | Node *nonnull_req() const; |
| 548 | // Add or remove precedence edges |
| 549 | void add_prec( Node *n ); |
| 550 | void rm_prec( uint i ); |
| 551 | |
| 552 | // Note: prec(i) will not necessarily point to n if edge already exists. |
| 553 | void set_prec( uint i, Node *n ) { |
| 554 | assert(i < _max, "oob: i=%d, _max=%d", i, _max)do { if (!(i < _max)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/node.hpp" , 554, "assert(" "i < _max" ") failed", "oob: i=%d, _max=%d" , i, _max); ::breakpoint(); } } while (0); |
| 555 | assert(is_not_dead(n), "can not use dead node")do { if (!(((n) == __null || !VerifyIterativeGVN || !((n)-> is_dead())))) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/node.hpp" , 555, "assert(" "((n) == __null || !VerifyIterativeGVN || !((n)->is_dead()))" ") failed", "can not use dead node"); ::breakpoint(); } } while (0); |
| 556 | assert(i >= _cnt, "not a precedence edge")do { if (!(i >= _cnt)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/node.hpp" , 556, "assert(" "i >= _cnt" ") failed", "not a precedence edge" ); ::breakpoint(); } } while (0); |
| 557 | // Avoid spec violation: duplicated prec edge. |
| 558 | if (_in[i] == n) return; |
| 559 | if (n == NULL__null || find_prec_edge(n) != -1) { |
| 560 | rm_prec(i); |
| 561 | return; |
| 562 | } |
| 563 | if (_in[i] != NULL__null) _in[i]->del_out((Node *)this); |
| 564 | _in[i] = n; |
| 565 | n->add_out((Node *)this); |
| 566 | } |
| 567 | |
| 568 | // Set this node's index, used by cisc_version to replace current node |
| 569 | void set_idx(uint new_idx) { |
| 570 | const node_idx_t* ref = &_idx; |
| 571 | *(node_idx_t*)ref = new_idx; |
| 572 | } |
| 573 | // Swap input edge order. (Edge indexes i1 and i2 are usually 1 and 2.) |
| 574 | void swap_edges(uint i1, uint i2) { |
| 575 | debug_only(uint check_hash = (VerifyHashTableKeys && _hash_lock) ? hash() : NO_HASH)uint check_hash = (VerifyHashTableKeys && _hash_lock) ? hash() : NO_HASH; |
| 576 | // Def-Use info is unchanged |
| 577 | Node* n1 = in(i1); |
| 578 | Node* n2 = in(i2); |
| 579 | _in[i1] = n2; |
| 580 | _in[i2] = n1; |
| 581 | // If this node is in the hash table, make sure it doesn't need a rehash. |
| 582 | assert(check_hash == NO_HASH || check_hash == hash(), "edge swap must preserve hash code")do { if (!(check_hash == NO_HASH || check_hash == hash())) { ( *g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/node.hpp" , 582, "assert(" "check_hash == NO_HASH || check_hash == hash()" ") failed", "edge swap must preserve hash code"); ::breakpoint (); } } while (0); |
| 583 | } |
| 584 | |
| 585 | // Iterators over input Nodes for a Node X are written as: |
| 586 | // for( i = 0; i < X.req(); i++ ) ... X[i] ... |
| 587 | // NOTE: Required edges can contain embedded NULL pointers. |
| 588 | |
| 589 | //----------------- Other Node Properties |
| 590 | |
| 591 | // Generate class IDs for (some) ideal nodes so that it is possible to determine |
| 592 | // the type of a node using a non-virtual method call (the method is_<Node>() below). |
| 593 | // |
| 594 | // A class ID of an ideal node is a set of bits. In a class ID, a single bit determines |
| 595 | // the type of the node the ID represents; another subset of an ID's bits are reserved |
| 596 | // for the superclasses of the node represented by the ID. |
| 597 | // |
| 598 | // By design, if A is a supertype of B, A.is_B() returns true and B.is_A() |
| 599 | // returns false. A.is_A() returns true. |
| 600 | // |
| 601 | // If two classes, A and B, have the same superclass, a different bit of A's class id |
| 602 | // is reserved for A's type than for B's type. That bit is specified by the third |
| 603 | // parameter in the macro DEFINE_CLASS_ID. |
| 604 | // |
| 605 | // By convention, classes with deeper hierarchy are declared first. Moreover, |
| 606 | // classes with the same hierarchy depth are sorted by usage frequency. |
| 607 | // |
| 608 | // The query method masks the bits to cut off bits of subclasses and then compares |
| 609 | // the result with the class id (see the macro DEFINE_CLASS_QUERY below). |
| 610 | // |
| 611 | // Class_MachCall=30, ClassMask_MachCall=31 |
| 612 | // 12 8 4 0 |
| 613 | // 0 0 0 0 0 0 0 0 1 1 1 1 0 |
| 614 | // | | | | |
| 615 | // | | | Bit_Mach=2 |
| 616 | // | | Bit_MachReturn=4 |
| 617 | // | Bit_MachSafePoint=8 |
| 618 | // Bit_MachCall=16 |
| 619 | // |
| 620 | // Class_CountedLoop=56, ClassMask_CountedLoop=63 |
| 621 | // 12 8 4 0 |
| 622 | // 0 0 0 0 0 0 0 1 1 1 0 0 0 |
| 623 | // | | | |
| 624 | // | | Bit_Region=8 |
| 625 | // | Bit_Loop=16 |
| 626 | // Bit_CountedLoop=32 |
| 627 | |
| 628 | #define DEFINE_CLASS_ID(cl, supcl, subn) \ |
| 629 | Bit_##cl = (Class_##supcl == 0) ? 1 << subn : (Bit_##supcl) << (1 + subn) , \ |
| 630 | Class_##cl = Class_##supcl + Bit_##cl , \ |
| 631 | ClassMask_##cl = ((Bit_##cl << 1) - 1) , |
| 632 | |
| 633 | // This enum is used only for C2 ideal and mach nodes with is_<node>() methods |
| 634 | // so that its values fit into 32 bits. |
| 635 | enum NodeClasses { |
| 636 | Bit_Node = 0x00000000, |
| 637 | Class_Node = 0x00000000, |
| 638 | ClassMask_Node = 0xFFFFFFFF, |
| 639 | |
| 640 | DEFINE_CLASS_ID(Multi, Node, 0) |
| 641 | DEFINE_CLASS_ID(SafePoint, Multi, 0) |
| 642 | DEFINE_CLASS_ID(Call, SafePoint, 0) |
| 643 | DEFINE_CLASS_ID(CallJava, Call, 0) |
| 644 | DEFINE_CLASS_ID(CallStaticJava, CallJava, 0) |
| 645 | DEFINE_CLASS_ID(CallDynamicJava, CallJava, 1) |
| 646 | DEFINE_CLASS_ID(CallRuntime, Call, 1) |
| 647 | DEFINE_CLASS_ID(CallLeaf, CallRuntime, 0) |
| 648 | DEFINE_CLASS_ID(CallLeafNoFP, CallLeaf, 0) |
| 649 | DEFINE_CLASS_ID(Allocate, Call, 2) |
| 650 | DEFINE_CLASS_ID(AllocateArray, Allocate, 0) |
| 651 | DEFINE_CLASS_ID(AbstractLock, Call, 3) |
| 652 | DEFINE_CLASS_ID(Lock, AbstractLock, 0) |
| 653 | DEFINE_CLASS_ID(Unlock, AbstractLock, 1) |
| 654 | DEFINE_CLASS_ID(ArrayCopy, Call, 4) |
| 655 | DEFINE_CLASS_ID(CallNative, Call, 5) |
| 656 | DEFINE_CLASS_ID(MultiBranch, Multi, 1) |
| 657 | DEFINE_CLASS_ID(PCTable, MultiBranch, 0) |
| 658 | DEFINE_CLASS_ID(Catch, PCTable, 0) |
| 659 | DEFINE_CLASS_ID(Jump, PCTable, 1) |
| 660 | DEFINE_CLASS_ID(If, MultiBranch, 1) |
| 661 | DEFINE_CLASS_ID(BaseCountedLoopEnd, If, 0) |
| 662 | DEFINE_CLASS_ID(CountedLoopEnd, BaseCountedLoopEnd, 0) |
| 663 | DEFINE_CLASS_ID(LongCountedLoopEnd, BaseCountedLoopEnd, 1) |
| 664 | DEFINE_CLASS_ID(RangeCheck, If, 1) |
| 665 | DEFINE_CLASS_ID(OuterStripMinedLoopEnd, If, 2) |
| 666 | DEFINE_CLASS_ID(NeverBranch, MultiBranch, 2) |
| 667 | DEFINE_CLASS_ID(Start, Multi, 2) |
| 668 | DEFINE_CLASS_ID(MemBar, Multi, 3) |
| 669 | DEFINE_CLASS_ID(Initialize, MemBar, 0) |
| 670 | DEFINE_CLASS_ID(MemBarStoreStore, MemBar, 1) |
| 671 | |
| 672 | DEFINE_CLASS_ID(Mach, Node, 1) |
| 673 | DEFINE_CLASS_ID(MachReturn, Mach, 0) |
| 674 | DEFINE_CLASS_ID(MachSafePoint, MachReturn, 0) |
| 675 | DEFINE_CLASS_ID(MachCall, MachSafePoint, 0) |
| 676 | DEFINE_CLASS_ID(MachCallJava, MachCall, 0) |
| 677 | DEFINE_CLASS_ID(MachCallStaticJava, MachCallJava, 0) |
| 678 | DEFINE_CLASS_ID(MachCallDynamicJava, MachCallJava, 1) |
| 679 | DEFINE_CLASS_ID(MachCallRuntime, MachCall, 1) |
| 680 | DEFINE_CLASS_ID(MachCallLeaf, MachCallRuntime, 0) |
| 681 | DEFINE_CLASS_ID(MachCallNative, MachCall, 2) |
| 682 | DEFINE_CLASS_ID(MachBranch, Mach, 1) |
| 683 | DEFINE_CLASS_ID(MachIf, MachBranch, 0) |
| 684 | DEFINE_CLASS_ID(MachGoto, MachBranch, 1) |
| 685 | DEFINE_CLASS_ID(MachNullCheck, MachBranch, 2) |
| 686 | DEFINE_CLASS_ID(MachSpillCopy, Mach, 2) |
| 687 | DEFINE_CLASS_ID(MachTemp, Mach, 3) |
| 688 | DEFINE_CLASS_ID(MachConstantBase, Mach, 4) |
| 689 | DEFINE_CLASS_ID(MachConstant, Mach, 5) |
| 690 | DEFINE_CLASS_ID(MachJump, MachConstant, 0) |
| 691 | DEFINE_CLASS_ID(MachMerge, Mach, 6) |
| 692 | DEFINE_CLASS_ID(MachMemBar, Mach, 7) |
| 693 | |
| 694 | DEFINE_CLASS_ID(Type, Node, 2) |
| 695 | DEFINE_CLASS_ID(Phi, Type, 0) |
| 696 | DEFINE_CLASS_ID(ConstraintCast, Type, 1) |
| 697 | DEFINE_CLASS_ID(CastII, ConstraintCast, 0) |
| 698 | DEFINE_CLASS_ID(CheckCastPP, ConstraintCast, 1) |
| 699 | DEFINE_CLASS_ID(CastLL, ConstraintCast, 2) |
| 700 | DEFINE_CLASS_ID(CastFF, ConstraintCast, 3) |
| 701 | DEFINE_CLASS_ID(CastDD, ConstraintCast, 4) |
| 702 | DEFINE_CLASS_ID(CastVV, ConstraintCast, 5) |
| 703 | DEFINE_CLASS_ID(CMove, Type, 3) |
| 704 | DEFINE_CLASS_ID(SafePointScalarObject, Type, 4) |
| 705 | DEFINE_CLASS_ID(DecodeNarrowPtr, Type, 5) |
| 706 | DEFINE_CLASS_ID(DecodeN, DecodeNarrowPtr, 0) |
| 707 | DEFINE_CLASS_ID(DecodeNKlass, DecodeNarrowPtr, 1) |
| 708 | DEFINE_CLASS_ID(EncodeNarrowPtr, Type, 6) |
| 709 | DEFINE_CLASS_ID(EncodeP, EncodeNarrowPtr, 0) |
| 710 | DEFINE_CLASS_ID(EncodePKlass, EncodeNarrowPtr, 1) |
| 711 | DEFINE_CLASS_ID(Vector, Type, 7) |
| 712 | DEFINE_CLASS_ID(VectorMaskCmp, Vector, 0) |
| 713 | DEFINE_CLASS_ID(VectorUnbox, Vector, 1) |
| 714 | DEFINE_CLASS_ID(VectorReinterpret, Vector, 2) |
| 715 | DEFINE_CLASS_ID(ShiftV, Vector, 3) |
| 716 | |
| 717 | DEFINE_CLASS_ID(Proj, Node, 3) |
| 718 | DEFINE_CLASS_ID(CatchProj, Proj, 0) |
| 719 | DEFINE_CLASS_ID(JumpProj, Proj, 1) |
| 720 | DEFINE_CLASS_ID(IfProj, Proj, 2) |
| 721 | DEFINE_CLASS_ID(IfTrue, IfProj, 0) |
| 722 | DEFINE_CLASS_ID(IfFalse, IfProj, 1) |
| 723 | DEFINE_CLASS_ID(Parm, Proj, 4) |
| 724 | DEFINE_CLASS_ID(MachProj, Proj, 5) |
| 725 | |
| 726 | DEFINE_CLASS_ID(Mem, Node, 4) |
| 727 | DEFINE_CLASS_ID(Load, Mem, 0) |
| 728 | DEFINE_CLASS_ID(LoadVector, Load, 0) |
| 729 | DEFINE_CLASS_ID(LoadVectorGather, LoadVector, 0) |
| 730 | DEFINE_CLASS_ID(LoadVectorMasked, LoadVector, 1) |
| 731 | DEFINE_CLASS_ID(Store, Mem, 1) |
| 732 | DEFINE_CLASS_ID(StoreVector, Store, 0) |
| 733 | DEFINE_CLASS_ID(StoreVectorScatter, StoreVector, 0) |
| 734 | DEFINE_CLASS_ID(StoreVectorMasked, StoreVector, 1) |
| 735 | DEFINE_CLASS_ID(LoadStore, Mem, 2) |
| 736 | DEFINE_CLASS_ID(LoadStoreConditional, LoadStore, 0) |
| 737 | DEFINE_CLASS_ID(CompareAndSwap, LoadStoreConditional, 0) |
| 738 | DEFINE_CLASS_ID(CompareAndExchangeNode, LoadStore, 1) |
| 739 | |
| 740 | DEFINE_CLASS_ID(Region, Node, 5) |
| 741 | DEFINE_CLASS_ID(Loop, Region, 0) |
| 742 | DEFINE_CLASS_ID(Root, Loop, 0) |
| 743 | DEFINE_CLASS_ID(BaseCountedLoop, Loop, 1) |
| 744 | DEFINE_CLASS_ID(CountedLoop, BaseCountedLoop, 0) |
| 745 | DEFINE_CLASS_ID(LongCountedLoop, BaseCountedLoop, 1) |
| 746 | DEFINE_CLASS_ID(OuterStripMinedLoop, Loop, 2) |
| 747 | |
| 748 | DEFINE_CLASS_ID(Sub, Node, 6) |
| 749 | DEFINE_CLASS_ID(Cmp, Sub, 0) |
| 750 | DEFINE_CLASS_ID(FastLock, Cmp, 0) |
| 751 | DEFINE_CLASS_ID(FastUnlock, Cmp, 1) |
| 752 | DEFINE_CLASS_ID(SubTypeCheck,Cmp, 2) |
| 753 | |
| 754 | DEFINE_CLASS_ID(MergeMem, Node, 7) |
| 755 | DEFINE_CLASS_ID(Bool, Node, 8) |
| 756 | DEFINE_CLASS_ID(AddP, Node, 9) |
| 757 | DEFINE_CLASS_ID(BoxLock, Node, 10) |
| 758 | DEFINE_CLASS_ID(Add, Node, 11) |
| 759 | DEFINE_CLASS_ID(Mul, Node, 12) |
| 760 | DEFINE_CLASS_ID(ClearArray, Node, 14) |
| 761 | DEFINE_CLASS_ID(Halt, Node, 15) |
| 762 | DEFINE_CLASS_ID(Opaque1, Node, 16) |
| 763 | DEFINE_CLASS_ID(Move, Node, 17) |
| 764 | DEFINE_CLASS_ID(LShift, Node, 18) |
| 765 | |
| 766 | _max_classes = ClassMask_Move |
| 767 | }; |
| 768 | #undef DEFINE_CLASS_ID |
| 769 | |
| 770 | // Flags are sorted by usage frequency. |
| 771 | enum NodeFlags { |
| 772 | Flag_is_Copy = 1 << 0, // should be first bit to avoid shift |
| 773 | Flag_rematerialize = 1 << 1, |
| 774 | Flag_needs_anti_dependence_check = 1 << 2, |
| 775 | Flag_is_macro = 1 << 3, |
| 776 | Flag_is_Con = 1 << 4, |
| 777 | Flag_is_cisc_alternate = 1 << 5, |
| 778 | Flag_is_dead_loop_safe = 1 << 6, |
| 779 | Flag_may_be_short_branch = 1 << 7, |
| 780 | Flag_avoid_back_to_back_before = 1 << 8, |
| 781 | Flag_avoid_back_to_back_after = 1 << 9, |
| 782 | Flag_has_call = 1 << 10, |
| 783 | Flag_is_reduction = 1 << 11, |
| 784 | Flag_is_scheduled = 1 << 12, |
| 785 | Flag_has_vector_mask_set = 1 << 13, |
| 786 | Flag_is_expensive = 1 << 14, |
| 787 | Flag_is_predicated_vector = 1 << 15, |
| 788 | Flag_for_post_loop_opts_igvn = 1 << 16, |
| 789 | _last_flag = Flag_for_post_loop_opts_igvn |
| 790 | }; |
| 791 | |
| 792 | class PD; |
| 793 | |
| 794 | private: |
| 795 | juint _class_id; |
| 796 | juint _flags; |
| 797 | |
| 798 | static juint max_flags(); |
| 799 | |
| 800 | protected: |
| 801 | // These methods should be called from constructors only. |
| 802 | void init_class_id(juint c) { |
| 803 | _class_id = c; // cast out const |
| 804 | } |
| 805 | void init_flags(uint fl) { |
| 806 | assert(fl <= max_flags(), "invalid node flag")do { if (!(fl <= max_flags())) { (*g_assert_poison) = 'X'; ; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/node.hpp" , 806, "assert(" "fl <= max_flags()" ") failed", "invalid node flag" ); ::breakpoint(); } } while (0); |
| 807 | _flags |= fl; |
| 808 | } |
| 809 | void clear_flag(uint fl) { |
| 810 | assert(fl <= max_flags(), "invalid node flag")do { if (!(fl <= max_flags())) { (*g_assert_poison) = 'X'; ; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/node.hpp" , 810, "assert(" "fl <= max_flags()" ") failed", "invalid node flag" ); ::breakpoint(); } } while (0); |
| 811 | _flags &= ~fl; |
| 812 | } |
| 813 | |
| 814 | public: |
| 815 | const juint class_id() const { return _class_id; } |
| 816 | |
| 817 | const juint flags() const { return _flags; } |
| 818 | |
| 819 | void add_flag(juint fl) { init_flags(fl); } |
| 820 | |
| 821 | void remove_flag(juint fl) { clear_flag(fl); } |
| 822 | |
| 823 | // Return a dense integer opcode number |
| 824 | virtual int Opcode() const; |
| 825 | |
| 826 | // Virtual inherited Node size |
| 827 | virtual uint size_of() const; |
| 828 | |
| 829 | // Other interesting Node properties |
| 830 | #define DEFINE_CLASS_QUERY(type) \ |
| 831 | bool is_##type() const { \ |
| 832 | return ((_class_id & ClassMask_##type) == Class_##type); \ |
| 833 | } \ |
| 834 | type##Node *as_##type() const { \ |
| 835 | assert(is_##type(), "invalid node class: %s", Name())do { if (!(is_##type())) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/node.hpp" , 835, "assert(" "is_##type()" ") failed", "invalid node class: %s" , Name()); ::breakpoint(); } } while (0); \ |
| 836 | return (type##Node*)this; \ |
| 837 | } \ |
| 838 | type##Node* isa_##type() const { \ |
| 839 | return (is_##type()) ? as_##type() : NULL__null; \ |
| 840 | } |
| 841 | |
| 842 | DEFINE_CLASS_QUERY(AbstractLock) |
| 843 | DEFINE_CLASS_QUERY(Add) |
| 844 | DEFINE_CLASS_QUERY(AddP) |
| 845 | DEFINE_CLASS_QUERY(Allocate) |
| 846 | DEFINE_CLASS_QUERY(AllocateArray) |
| 847 | DEFINE_CLASS_QUERY(ArrayCopy) |
| 848 | DEFINE_CLASS_QUERY(BaseCountedLoop) |
| 849 | DEFINE_CLASS_QUERY(BaseCountedLoopEnd) |
| 850 | DEFINE_CLASS_QUERY(Bool) |
| 851 | DEFINE_CLASS_QUERY(BoxLock) |
| 852 | DEFINE_CLASS_QUERY(Call) |
| 853 | DEFINE_CLASS_QUERY(CallNative) |
| 854 | DEFINE_CLASS_QUERY(CallDynamicJava) |
| 855 | DEFINE_CLASS_QUERY(CallJava) |
| 856 | DEFINE_CLASS_QUERY(CallLeaf) |
| 857 | DEFINE_CLASS_QUERY(CallLeafNoFP) |
| 858 | DEFINE_CLASS_QUERY(CallRuntime) |
| 859 | DEFINE_CLASS_QUERY(CallStaticJava) |
| 860 | DEFINE_CLASS_QUERY(Catch) |
| 861 | DEFINE_CLASS_QUERY(CatchProj) |
| 862 | DEFINE_CLASS_QUERY(CheckCastPP) |
| 863 | DEFINE_CLASS_QUERY(CastII) |
| 864 | DEFINE_CLASS_QUERY(CastLL) |
| 865 | DEFINE_CLASS_QUERY(ConstraintCast) |
| 866 | DEFINE_CLASS_QUERY(ClearArray) |
| 867 | DEFINE_CLASS_QUERY(CMove) |
| 868 | DEFINE_CLASS_QUERY(Cmp) |
| 869 | DEFINE_CLASS_QUERY(CountedLoop) |
| 870 | DEFINE_CLASS_QUERY(CountedLoopEnd) |
| 871 | DEFINE_CLASS_QUERY(DecodeNarrowPtr) |
| 872 | DEFINE_CLASS_QUERY(DecodeN) |
| 873 | DEFINE_CLASS_QUERY(DecodeNKlass) |
| 874 | DEFINE_CLASS_QUERY(EncodeNarrowPtr) |
| 875 | DEFINE_CLASS_QUERY(EncodeP) |
| 876 | DEFINE_CLASS_QUERY(EncodePKlass) |
| 877 | DEFINE_CLASS_QUERY(FastLock) |
| 878 | DEFINE_CLASS_QUERY(FastUnlock) |
| 879 | DEFINE_CLASS_QUERY(Halt) |
| 880 | DEFINE_CLASS_QUERY(If) |
| 881 | DEFINE_CLASS_QUERY(RangeCheck) |
| 882 | DEFINE_CLASS_QUERY(IfProj) |
| 883 | DEFINE_CLASS_QUERY(IfFalse) |
| 884 | DEFINE_CLASS_QUERY(IfTrue) |
| 885 | DEFINE_CLASS_QUERY(Initialize) |
| 886 | DEFINE_CLASS_QUERY(Jump) |
| 887 | DEFINE_CLASS_QUERY(JumpProj) |
| 888 | DEFINE_CLASS_QUERY(LongCountedLoop) |
| 889 | DEFINE_CLASS_QUERY(LongCountedLoopEnd) |
| 890 | DEFINE_CLASS_QUERY(Load) |
| 891 | DEFINE_CLASS_QUERY(LoadStore) |
| 892 | DEFINE_CLASS_QUERY(LoadStoreConditional) |
| 893 | DEFINE_CLASS_QUERY(Lock) |
| 894 | DEFINE_CLASS_QUERY(Loop) |
| 895 | DEFINE_CLASS_QUERY(LShift) |
| 896 | DEFINE_CLASS_QUERY(Mach) |
| 897 | DEFINE_CLASS_QUERY(MachBranch) |
| 898 | DEFINE_CLASS_QUERY(MachCall) |
| 899 | DEFINE_CLASS_QUERY(MachCallNative) |
| 900 | DEFINE_CLASS_QUERY(MachCallDynamicJava) |
| 901 | DEFINE_CLASS_QUERY(MachCallJava) |
| 902 | DEFINE_CLASS_QUERY(MachCallLeaf) |
| 903 | DEFINE_CLASS_QUERY(MachCallRuntime) |
| 904 | DEFINE_CLASS_QUERY(MachCallStaticJava) |
| 905 | DEFINE_CLASS_QUERY(MachConstantBase) |
| 906 | DEFINE_CLASS_QUERY(MachConstant) |
| 907 | DEFINE_CLASS_QUERY(MachGoto) |
| 908 | DEFINE_CLASS_QUERY(MachIf) |
| 909 | DEFINE_CLASS_QUERY(MachJump) |
| 910 | DEFINE_CLASS_QUERY(MachNullCheck) |
| 911 | DEFINE_CLASS_QUERY(MachProj) |
| 912 | DEFINE_CLASS_QUERY(MachReturn) |
| 913 | DEFINE_CLASS_QUERY(MachSafePoint) |
| 914 | DEFINE_CLASS_QUERY(MachSpillCopy) |
| 915 | DEFINE_CLASS_QUERY(MachTemp) |
| 916 | DEFINE_CLASS_QUERY(MachMemBar) |
| 917 | DEFINE_CLASS_QUERY(MachMerge) |
| 918 | DEFINE_CLASS_QUERY(Mem) |
| 919 | DEFINE_CLASS_QUERY(MemBar) |
| 920 | DEFINE_CLASS_QUERY(MemBarStoreStore) |
| 921 | DEFINE_CLASS_QUERY(MergeMem) |
| 922 | DEFINE_CLASS_QUERY(Move) |
| 923 | DEFINE_CLASS_QUERY(Mul) |
| 924 | DEFINE_CLASS_QUERY(Multi) |
| 925 | DEFINE_CLASS_QUERY(MultiBranch) |
| 926 | DEFINE_CLASS_QUERY(Opaque1) |
| 927 | DEFINE_CLASS_QUERY(OuterStripMinedLoop) |
| 928 | DEFINE_CLASS_QUERY(OuterStripMinedLoopEnd) |
| 929 | DEFINE_CLASS_QUERY(Parm) |
| 930 | DEFINE_CLASS_QUERY(PCTable) |
| 931 | DEFINE_CLASS_QUERY(Phi) |
| 932 | DEFINE_CLASS_QUERY(Proj) |
| 933 | DEFINE_CLASS_QUERY(Region) |
| 934 | DEFINE_CLASS_QUERY(Root) |
| 935 | DEFINE_CLASS_QUERY(SafePoint) |
| 936 | DEFINE_CLASS_QUERY(SafePointScalarObject) |
| 937 | DEFINE_CLASS_QUERY(Start) |
| 938 | DEFINE_CLASS_QUERY(Store) |
| 939 | DEFINE_CLASS_QUERY(Sub) |
| 940 | DEFINE_CLASS_QUERY(SubTypeCheck) |
| 941 | DEFINE_CLASS_QUERY(Type) |
| 942 | DEFINE_CLASS_QUERY(Vector) |
| 943 | DEFINE_CLASS_QUERY(VectorMaskCmp) |
| 944 | DEFINE_CLASS_QUERY(VectorUnbox) |
| 945 | DEFINE_CLASS_QUERY(VectorReinterpret); |
| 946 | DEFINE_CLASS_QUERY(LoadVector) |
| 947 | DEFINE_CLASS_QUERY(LoadVectorGather) |
| 948 | DEFINE_CLASS_QUERY(StoreVector) |
| 949 | DEFINE_CLASS_QUERY(StoreVectorScatter) |
| 950 | DEFINE_CLASS_QUERY(ShiftV) |
| 951 | DEFINE_CLASS_QUERY(Unlock) |
| 952 | |
| 953 | #undef DEFINE_CLASS_QUERY |
| 954 | |
| 955 | // duplicate of is_MachSpillCopy() |
| 956 | bool is_SpillCopy () const { |
| 957 | return ((_class_id & ClassMask_MachSpillCopy) == Class_MachSpillCopy); |
| 958 | } |
| 959 | |
| 960 | bool is_Con () const { return (_flags & Flag_is_Con) != 0; } |
| 961 | // The data node which is safe to leave in dead loop during IGVN optimization. |
| 962 | bool is_dead_loop_safe() const; |
| 963 | |
| 964 | // is_Copy() returns copied edge index (0 or 1) |
| 965 | uint is_Copy() const { return (_flags & Flag_is_Copy); } |
| 966 | |
| 967 | virtual bool is_CFG() const { return false; } |
| 968 | |
| 969 | // If this node is control-dependent on a test, can it be |
| 970 | // rerouted to a dominating equivalent test? This is usually |
| 971 | // true of non-CFG nodes, but can be false for operations which |
| 972 | // depend for their correct sequencing on more than one test. |
| 973 | // (In that case, hoisting to a dominating test may silently |
| 974 | // skip some other important test.) |
| 975 | virtual bool depends_only_on_test() const { assert(!is_CFG(), "")do { if (!(!is_CFG())) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/node.hpp" , 975, "assert(" "!is_CFG()" ") failed", ""); ::breakpoint(); } } while (0); return true; }; |
| 976 | |
| 977 | // When building basic blocks, I need to have a notion of block beginning |
| 978 | // Nodes, next block selector Nodes (block enders), and next block |
| 979 | // projections. These calls need to work on their machine equivalents. The |
| 980 | // Ideal beginning Nodes are RootNode, RegionNode and StartNode. |
| 981 | bool is_block_start() const { |
| 982 | if ( is_Region() ) |
| 983 | return this == (const Node*)in(0); |
| 984 | else |
| 985 | return is_Start(); |
| 986 | } |
| 987 | |
| 988 | // The Ideal control projection Nodes are IfTrue/IfFalse, JumpProjNode, Root, |
| 989 | // Goto and Return. This call also returns the block ending Node. |
| 990 | virtual const Node *is_block_proj() const; |
| 991 | |
| 992 | // The node is a "macro" node which needs to be expanded before matching |
| 993 | bool is_macro() const { return (_flags & Flag_is_macro) != 0; } |
| 994 | // The node is expensive: the best control is set during loop opts |
| 995 | bool is_expensive() const { return (_flags & Flag_is_expensive) != 0 && in(0) != NULL__null; } |
| 996 | |
| 997 | // An arithmetic node which accumulates a data in a loop. |
| 998 | // It must have the loop's phi as input and provide a def to the phi. |
| 999 | bool is_reduction() const { return (_flags & Flag_is_reduction) != 0; } |
| 1000 | |
| 1001 | bool is_predicated_vector() const { return (_flags & Flag_is_predicated_vector) != 0; } |
| 1002 | |
| 1003 | // The node is a CountedLoopEnd with a mask annotation so as to emit a restore context |
| 1004 | bool has_vector_mask_set() const { return (_flags & Flag_has_vector_mask_set) != 0; } |
| 1005 | |
| 1006 | // Used in lcm to mark nodes that have scheduled |
| 1007 | bool is_scheduled() const { return (_flags & Flag_is_scheduled) != 0; } |
| 1008 | |
| 1009 | bool for_post_loop_opts_igvn() const { return (_flags & Flag_for_post_loop_opts_igvn) != 0; } |
| 1010 | |
| 1011 | //----------------- Optimization |
| 1012 | |
| 1013 | // Get the worst-case Type output for this Node. |
| 1014 | virtual const class Type *bottom_type() const; |
| 1015 | |
| 1016 | // If we find a better type for a node, try to record it permanently. |
| 1017 | // Return true if this node actually changed. |
| 1018 | // Be sure to do the hash_delete game in the "rehash" variant. |
| 1019 | void raise_bottom_type(const Type* new_type); |
| 1020 | |
| 1021 | // Get the address type with which this node uses and/or defs memory, |
| 1022 | // or NULL if none. The address type is conservatively wide. |
| 1023 | // Returns non-null for calls, membars, loads, stores, etc. |
| 1024 | // Returns TypePtr::BOTTOM if the node touches memory "broadly". |
| 1025 | virtual const class TypePtr *adr_type() const { return NULL__null; } |
| 1026 | |
| 1027 | // Return an existing node which computes the same function as this node. |
| 1028 | // The optimistic combined algorithm requires this to return a Node which |
| 1029 | // is a small number of steps away (e.g., one of my inputs). |
| 1030 | virtual Node* Identity(PhaseGVN* phase); |
| 1031 | |
| 1032 | // Return the set of values this Node can take on at runtime. |
| 1033 | virtual const Type* Value(PhaseGVN* phase) const; |
| 1034 | |
| 1035 | // Return a node which is more "ideal" than the current node. |
| 1036 | // The invariants on this call are subtle. If in doubt, read the |
| 1037 | // treatise in node.cpp above the default implemention AND TEST WITH |
| 1038 | // +VerifyIterativeGVN! |
| 1039 | virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); |
| 1040 | |
| 1041 | // Some nodes have specific Ideal subgraph transformations only if they are |
| 1042 | // unique users of specific nodes. Such nodes should be put on IGVN worklist |
| 1043 | // for the transformations to happen. |
| 1044 | bool has_special_unique_user() const; |
| 1045 | |
| 1046 | // Skip Proj and CatchProj nodes chains. Check for Null and Top. |
| 1047 | Node* find_exact_control(Node* ctrl); |
| 1048 | |
| 1049 | // Check if 'this' node dominates or equal to 'sub'. |
| 1050 | bool dominates(Node* sub, Node_List &nlist); |
| 1051 | |
| 1052 | protected: |
| 1053 | bool remove_dead_region(PhaseGVN *phase, bool can_reshape); |
| 1054 | public: |
| 1055 | |
| 1056 | // See if there is valid pipeline info |
| 1057 | static const Pipeline *pipeline_class(); |
| 1058 | virtual const Pipeline *pipeline() const; |
| 1059 | |
| 1060 | // Compute the latency from the def to this instruction of the ith input node |
| 1061 | uint latency(uint i); |
| 1062 | |
| 1063 | // Hash & compare functions, for pessimistic value numbering |
| 1064 | |
| 1065 | // If the hash function returns the special sentinel value NO_HASH, |
| 1066 | // the node is guaranteed never to compare equal to any other node. |
| 1067 | // If we accidentally generate a hash with value NO_HASH the node |
| 1068 | // won't go into the table and we'll lose a little optimization. |
| 1069 | static const uint NO_HASH = 0; |
| 1070 | virtual uint hash() const; |
| 1071 | virtual bool cmp( const Node &n ) const; |
| 1072 | |
| 1073 | // Operation appears to be iteratively computed (such as an induction variable) |
| 1074 | // It is possible for this operation to return false for a loop-varying |
| 1075 | // value, if it appears (by local graph inspection) to be computed by a simple conditional. |
| 1076 | bool is_iteratively_computed(); |
| 1077 | |
| 1078 | // Determine if a node is a counted loop induction variable. |
| 1079 | // NOTE: The method is defined in "loopnode.cpp". |
| 1080 | bool is_cloop_ind_var() const; |
| 1081 | |
| 1082 | // Return a node with opcode "opc" and same inputs as "this" if one can |
| 1083 | // be found; Otherwise return NULL; |
| 1084 | Node* find_similar(int opc); |
| 1085 | |
| 1086 | // Return the unique control out if only one. Null if none or more than one. |
| 1087 | Node* unique_ctrl_out() const; |
| 1088 | |
| 1089 | // Set control or add control as precedence edge |
| 1090 | void ensure_control_or_add_prec(Node* c); |
| 1091 | |
| 1092 | //----------------- Code Generation |
| 1093 | |
| 1094 | // Ideal register class for Matching. Zero means unmatched instruction |
| 1095 | // (these are cloned instead of converted to machine nodes). |
| 1096 | virtual uint ideal_reg() const; |
| 1097 | |
| 1098 | static const uint NotAMachineReg; // must be > max. machine register |
| 1099 | |
| 1100 | // Do we Match on this edge index or not? Generally false for Control |
| 1101 | // and true for everything else. Weird for calls & returns. |
| 1102 | virtual uint match_edge(uint idx) const; |
| 1103 | |
| 1104 | // Register class output is returned in |
| 1105 | virtual const RegMask &out_RegMask() const; |
| 1106 | // Register class input is expected in |
| 1107 | virtual const RegMask &in_RegMask(uint) const; |
| 1108 | // Should we clone rather than spill this instruction? |
| 1109 | bool rematerialize() const; |
| 1110 | |
| 1111 | // Return JVM State Object if this Node carries debug info, or NULL otherwise |
| 1112 | virtual JVMState* jvms() const; |
| 1113 | |
| 1114 | // Print as assembly |
| 1115 | virtual void format( PhaseRegAlloc *, outputStream* st = tty ) const; |
| 1116 | // Emit bytes starting at parameter 'ptr' |
| 1117 | // Bump 'ptr' by the number of output bytes |
| 1118 | virtual void emit(CodeBuffer &cbuf, PhaseRegAlloc *ra_) const; |
| 1119 | // Size of instruction in bytes |
| 1120 | virtual uint size(PhaseRegAlloc *ra_) const; |
| 1121 | |
| 1122 | // Convenience function to extract an integer constant from a node. |
| 1123 | // If it is not an integer constant (either Con, CastII, or Mach), |
| 1124 | // return value_if_unknown. |
| 1125 | jint find_int_con(jint value_if_unknown) const { |
| 1126 | const TypeInt* t = find_int_type(); |
| 1127 | return (t != NULL__null && t->is_con()) ? t->get_con() : value_if_unknown; |
| 1128 | } |
| 1129 | // Return the constant, knowing it is an integer constant already |
| 1130 | jint get_int() const { |
| 1131 | const TypeInt* t = find_int_type(); |
| 1132 | guarantee(t != NULL, "must be con")do { if (!(t != __null)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/node.hpp" , 1132, "guarantee(" "t != NULL" ") failed", "must be con"); :: breakpoint(); } } while (0); |
| 1133 | return t->get_con(); |
| 1134 | } |
| 1135 | // Here's where the work is done. Can produce non-constant int types too. |
| 1136 | const TypeInt* find_int_type() const; |
| 1137 | const TypeInteger* find_integer_type(BasicType bt) const; |
| 1138 | |
| 1139 | // Same thing for long (and intptr_t, via type.hpp): |
| 1140 | jlong get_long() const { |
| 1141 | const TypeLong* t = find_long_type(); |
| 1142 | guarantee(t != NULL, "must be con")do { if (!(t != __null)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/node.hpp" , 1142, "guarantee(" "t != NULL" ") failed", "must be con"); :: breakpoint(); } } while (0); |
| 1143 | return t->get_con(); |
| 1144 | } |
| 1145 | jlong find_long_con(jint value_if_unknown) const { |
| 1146 | const TypeLong* t = find_long_type(); |
| 1147 | return (t != NULL__null && t->is_con()) ? t->get_con() : value_if_unknown; |
| 1148 | } |
| 1149 | const TypeLong* find_long_type() const; |
| 1150 | |
| 1151 | jlong get_integer_as_long(BasicType bt) const { |
| 1152 | const TypeInteger* t = find_integer_type(bt); |
| 1153 | guarantee(t != NULL, "must be con")do { if (!(t != __null)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/node.hpp" , 1153, "guarantee(" "t != NULL" ") failed", "must be con"); :: breakpoint(); } } while (0); |
| 1154 | return t->get_con_as_long(bt); |
| 1155 | } |
| 1156 | const TypePtr* get_ptr_type() const; |
| 1157 | |
| 1158 | // These guys are called by code generated by ADLC: |
| 1159 | intptr_t get_ptr() const; |
| 1160 | intptr_t get_narrowcon() const; |
| 1161 | jdouble getd() const; |
| 1162 | jfloat getf() const; |
| 1163 | |
| 1164 | // Nodes which are pinned into basic blocks |
| 1165 | virtual bool pinned() const { return false; } |
| 1166 | |
| 1167 | // Nodes which use memory without consuming it, hence need antidependences |
| 1168 | // More specifically, needs_anti_dependence_check returns true iff the node |
| 1169 | // (a) does a load, and (b) does not perform a store (except perhaps to a |
| 1170 | // stack slot or some other unaliased location). |
| 1171 | bool needs_anti_dependence_check() const; |
| 1172 | |
| 1173 | // Return which operand this instruction may cisc-spill. In other words, |
| 1174 | // return operand position that can convert from reg to memory access |
| 1175 | virtual int cisc_operand() const { return AdlcVMDeps::Not_cisc_spillable; } |
| 1176 | bool is_cisc_alternate() const { return (_flags & Flag_is_cisc_alternate) != 0; } |
| 1177 | |
| 1178 | // Whether this is a memory-writing machine node. |
| 1179 | bool is_memory_writer() const { return is_Mach() && bottom_type()->has_memory(); } |
| 1180 | |
| 1181 | //----------------- Printing, etc |
| 1182 | #ifndef PRODUCT |
| 1183 | private: |
| 1184 | int _indent; |
| 1185 | |
| 1186 | public: |
| 1187 | void set_indent(int indent) { _indent = indent; } |
| 1188 | |
| 1189 | private: |
| 1190 | static bool add_to_worklist(Node* n, Node_List* worklist, Arena* old_arena, VectorSet* old_space, VectorSet* new_space); |
| 1191 | public: |
| 1192 | Node* find(int idx, bool only_ctrl = false); // Search the graph for the given idx. |
| 1193 | Node* find_ctrl(int idx); // Search control ancestors for the given idx. |
| 1194 | void dump() const { dump("\n"); } // Print this node. |
| 1195 | void dump(const char* suffix, bool mark = false, outputStream *st = tty) const; // Print this node. |
| 1196 | void dump(int depth) const; // Print this node, recursively to depth d |
| 1197 | void dump_ctrl(int depth) const; // Print control nodes, to depth d |
| 1198 | void dump_comp() const; // Print this node in compact representation. |
| 1199 | // Print this node in compact representation. |
| 1200 | void dump_comp(const char* suffix, outputStream *st = tty) const; |
| 1201 | virtual void dump_req(outputStream *st = tty) const; // Print required-edge info |
| 1202 | virtual void dump_prec(outputStream *st = tty) const; // Print precedence-edge info |
| 1203 | virtual void dump_out(outputStream *st = tty) const; // Print the output edge info |
| 1204 | virtual void dump_spec(outputStream *st) const {}; // Print per-node info |
| 1205 | // Print compact per-node info |
| 1206 | virtual void dump_compact_spec(outputStream *st) const { dump_spec(st); } |
| 1207 | void dump_related() const; // Print related nodes (depends on node at hand). |
| 1208 | // Print related nodes up to given depths for input and output nodes. |
| 1209 | void dump_related(uint d_in, uint d_out) const; |
| 1210 | void dump_related_compact() const; // Print related nodes in compact representation. |
| 1211 | // Collect related nodes. |
| 1212 | virtual void related(GrowableArray<Node*> *in_rel, GrowableArray<Node*> *out_rel, bool compact) const; |
| 1213 | // Collect nodes starting from this node, explicitly including/excluding control and data links. |
| 1214 | void collect_nodes(GrowableArray<Node*> *ns, int d, bool ctrl, bool data) const; |
| 1215 | |
| 1216 | // Node collectors, to be used in implementations of Node::rel(). |
| 1217 | // Collect the entire data input graph. Include control inputs if requested. |
| 1218 | void collect_nodes_in_all_data(GrowableArray<Node*> *ns, bool ctrl) const; |
| 1219 | // Collect the entire control input graph. Include data inputs if requested. |
| 1220 | void collect_nodes_in_all_ctrl(GrowableArray<Node*> *ns, bool data) const; |
| 1221 | // Collect the entire output graph until hitting and including control nodes. |
| 1222 | void collect_nodes_out_all_ctrl_boundary(GrowableArray<Node*> *ns) const; |
| 1223 | |
| 1224 | void verify_edges(Unique_Node_List &visited); // Verify bi-directional edges |
| 1225 | static void verify(int verify_depth, VectorSet& visited, Node_List& worklist); |
| 1226 | |
| 1227 | // This call defines a class-unique string used to identify class instances |
| 1228 | virtual const char *Name() const; |
| 1229 | |
| 1230 | void dump_format(PhaseRegAlloc *ra) const; // debug access to MachNode::format(...) |
| 1231 | // RegMask Print Functions |
| 1232 | void dump_in_regmask(int idx) { in_RegMask(idx).dump(); } |
| 1233 | void dump_out_regmask() { out_RegMask().dump(); } |
| 1234 | static bool in_dump() { return Compile::current()->_in_dump_cnt > 0; } |
| 1235 | void fast_dump() const { |
| 1236 | tty->print("%4d: %-17s", _idx, Name()); |
| 1237 | for (uint i = 0; i < len(); i++) |
| 1238 | if (in(i)) |
| 1239 | tty->print(" %4d", in(i)->_idx); |
| 1240 | else |
| 1241 | tty->print(" NULL"); |
| 1242 | tty->print("\n"); |
| 1243 | } |
| 1244 | #endif |
| 1245 | #ifdef ASSERT1 |
| 1246 | void verify_construction(); |
| 1247 | bool verify_jvms(const JVMState* jvms) const; |
| 1248 | int _debug_idx; // Unique value assigned to every node. |
| 1249 | int debug_idx() const { return _debug_idx; } |
| 1250 | void set_debug_idx( int debug_idx ) { _debug_idx = debug_idx; } |
| 1251 | |
| 1252 | Node* _debug_orig; // Original version of this, if any. |
| 1253 | Node* debug_orig() const { return _debug_orig; } |
| 1254 | void set_debug_orig(Node* orig); // _debug_orig = orig |
| 1255 | void dump_orig(outputStream *st, bool print_key = true) const; |
| 1256 | |
| 1257 | int _hash_lock; // Barrier to modifications of nodes in the hash table |
| 1258 | void enter_hash_lock() { ++_hash_lock; assert(_hash_lock < 99, "in too many hash tables?")do { if (!(_hash_lock < 99)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/node.hpp" , 1258, "assert(" "_hash_lock < 99" ") failed", "in too many hash tables?" ); ::breakpoint(); } } while (0); } |
| 1259 | void exit_hash_lock() { --_hash_lock; assert(_hash_lock >= 0, "mispaired hash locks")do { if (!(_hash_lock >= 0)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/node.hpp" , 1259, "assert(" "_hash_lock >= 0" ") failed", "mispaired hash locks" ); ::breakpoint(); } } while (0); } |
| 1260 | |
| 1261 | static void init_NodeProperty(); |
| 1262 | |
| 1263 | #if OPTO_DU_ITERATOR_ASSERT1 |
| 1264 | const Node* _last_del; // The last deleted node. |
| 1265 | uint _del_tick; // Bumped when a deletion happens.. |
| 1266 | #endif |
| 1267 | #endif |
| 1268 | }; |
| 1269 | |
| 1270 | inline bool not_a_node(const Node* n) { |
| 1271 | if (n == NULL__null) return true; |
| 1272 | if (((intptr_t)n & 1) != 0) return true; // uninitialized, etc. |
| 1273 | if (*(address*)n == badAddress((address)::badAddressVal)) return true; // kill by Node::destruct |
| 1274 | return false; |
| 1275 | } |
| 1276 | |
| 1277 | //----------------------------------------------------------------------------- |
| 1278 | // Iterators over DU info, and associated Node functions. |
| 1279 | |
| 1280 | #if OPTO_DU_ITERATOR_ASSERT1 |
| 1281 | |
| 1282 | // Common code for assertion checking on DU iterators. |
| 1283 | class DUIterator_Common { |
| 1284 | #ifdef ASSERT1 |
| 1285 | protected: |
| 1286 | bool _vdui; // cached value of VerifyDUIterators |
| 1287 | const Node* _node; // the node containing the _out array |
| 1288 | uint _outcnt; // cached node->_outcnt |
| 1289 | uint _del_tick; // cached node->_del_tick |
| 1290 | Node* _last; // last value produced by the iterator |
| 1291 | |
| 1292 | void sample(const Node* node); // used by c'tor to set up for verifies |
| 1293 | void verify(const Node* node, bool at_end_ok = false); |
| 1294 | void verify_resync(); |
| 1295 | void reset(const DUIterator_Common& that); |
| 1296 | |
| 1297 | // The VDUI_ONLY macro protects code conditionalized on VerifyDUIterators |
| 1298 | #define I_VDUI_ONLY(i,x) { if ((i)._vdui) { x; } } |
| 1299 | #else |
| 1300 | #define I_VDUI_ONLY(i,x) { } |
| 1301 | #endif //ASSERT |
| 1302 | }; |
| 1303 | |
| 1304 | #define VDUI_ONLY(x) I_VDUI_ONLY(*this, x) |
| 1305 | |
| 1306 | // Default DU iterator. Allows appends onto the out array. |
| 1307 | // Allows deletion from the out array only at the current point. |
| 1308 | // Usage: |
| 1309 | // for (DUIterator i = x->outs(); x->has_out(i); i++) { |
| 1310 | // Node* y = x->out(i); |
| 1311 | // ... |
| 1312 | // } |
| 1313 | // Compiles in product mode to a unsigned integer index, which indexes |
| 1314 | // onto a repeatedly reloaded base pointer of x->_out. The loop predicate |
| 1315 | // also reloads x->_outcnt. If you delete, you must perform "--i" just |
| 1316 | // before continuing the loop. You must delete only the last-produced |
| 1317 | // edge. You must delete only a single copy of the last-produced edge, |
| 1318 | // or else you must delete all copies at once (the first time the edge |
| 1319 | // is produced by the iterator). |
| 1320 | class DUIterator : public DUIterator_Common { |
| 1321 | friend class Node; |
| 1322 | |
| 1323 | // This is the index which provides the product-mode behavior. |
| 1324 | // Whatever the product-mode version of the system does to the |
| 1325 | // DUI index is done to this index. All other fields in |
| 1326 | // this class are used only for assertion checking. |
| 1327 | uint _idx; |
| 1328 | |
| 1329 | #ifdef ASSERT1 |
| 1330 | uint _refresh_tick; // Records the refresh activity. |
| 1331 | |
| 1332 | void sample(const Node* node); // Initialize _refresh_tick etc. |
| 1333 | void verify(const Node* node, bool at_end_ok = false); |
| 1334 | void verify_increment(); // Verify an increment operation. |
| 1335 | void verify_resync(); // Verify that we can back up over a deletion. |
| 1336 | void verify_finish(); // Verify that the loop terminated properly. |
| 1337 | void refresh(); // Resample verification info. |
| 1338 | void reset(const DUIterator& that); // Resample after assignment. |
| 1339 | #endif |
| 1340 | |
| 1341 | DUIterator(const Node* node, int dummy_to_avoid_conversion) |
| 1342 | { _idx = 0; debug_only(sample(node))sample(node); } |
| 1343 | |
| 1344 | public: |
| 1345 | // initialize to garbage; clear _vdui to disable asserts |
| 1346 | DUIterator() |
| 1347 | { /*initialize to garbage*/ debug_only(_vdui = false)_vdui = false; } |
| 1348 | |
| 1349 | DUIterator(const DUIterator& that) |
| 1350 | { _idx = that._idx; debug_only(_vdui = false; reset(that))_vdui = false; reset(that); } |
| 1351 | |
| 1352 | void operator++(int dummy_to_specify_postfix_op) |
| 1353 | { _idx++; VDUI_ONLY(verify_increment()); } |
| 1354 | |
| 1355 | void operator--() |
| 1356 | { VDUI_ONLY(verify_resync()); --_idx; } |
| 1357 | |
| 1358 | ~DUIterator() |
| 1359 | { VDUI_ONLY(verify_finish()); } |
| 1360 | |
| 1361 | void operator=(const DUIterator& that) |
| 1362 | { _idx = that._idx; debug_only(reset(that))reset(that); } |
| 1363 | }; |
| 1364 | |
| 1365 | DUIterator Node::outs() const |
| 1366 | { return DUIterator(this, 0); } |
| 1367 | DUIterator& Node::refresh_out_pos(DUIterator& i) const |
| 1368 | { I_VDUI_ONLY(i, i.refresh()); return i; } |
| 1369 | bool Node::has_out(DUIterator& i) const |
| 1370 | { I_VDUI_ONLY(i, i.verify(this,true));return i._idx < _outcnt; } |
| 1371 | Node* Node::out(DUIterator& i) const |
| 1372 | { I_VDUI_ONLY(i, i.verify(this)); return debug_only(i._last=)i._last= _out[i._idx]; } |
| 1373 | |
| 1374 | |
| 1375 | // Faster DU iterator. Disallows insertions into the out array. |
| 1376 | // Allows deletion from the out array only at the current point. |
| 1377 | // Usage: |
| 1378 | // for (DUIterator_Fast imax, i = x->fast_outs(imax); i < imax; i++) { |
| 1379 | // Node* y = x->fast_out(i); |
| 1380 | // ... |
| 1381 | // } |
| 1382 | // Compiles in product mode to raw Node** pointer arithmetic, with |
| 1383 | // no reloading of pointers from the original node x. If you delete, |
| 1384 | // you must perform "--i; --imax" just before continuing the loop. |
| 1385 | // If you delete multiple copies of the same edge, you must decrement |
| 1386 | // imax, but not i, multiple times: "--i, imax -= num_edges". |
| 1387 | class DUIterator_Fast : public DUIterator_Common { |
| 1388 | friend class Node; |
| 1389 | friend class DUIterator_Last; |
| 1390 | |
| 1391 | // This is the pointer which provides the product-mode behavior. |
| 1392 | // Whatever the product-mode version of the system does to the |
| 1393 | // DUI pointer is done to this pointer. All other fields in |
| 1394 | // this class are used only for assertion checking. |
| 1395 | Node** _outp; |
| 1396 | |
| 1397 | #ifdef ASSERT1 |
| 1398 | void verify(const Node* node, bool at_end_ok = false); |
| 1399 | void verify_limit(); |
| 1400 | void verify_resync(); |
| 1401 | void verify_relimit(uint n); |
| 1402 | void reset(const DUIterator_Fast& that); |
| 1403 | #endif |
| 1404 | |
| 1405 | // Note: offset must be signed, since -1 is sometimes passed |
| 1406 | DUIterator_Fast(const Node* node, ptrdiff_t offset) |
| 1407 | { _outp = node->_out + offset; debug_only(sample(node))sample(node); } |
| 1408 | |
| 1409 | public: |
| 1410 | // initialize to garbage; clear _vdui to disable asserts |
| 1411 | DUIterator_Fast() |
| 1412 | { /*initialize to garbage*/ debug_only(_vdui = false)_vdui = false; } |
| 1413 | |
| 1414 | DUIterator_Fast(const DUIterator_Fast& that) |
| 1415 | { _outp = that._outp; debug_only(_vdui = false; reset(that))_vdui = false; reset(that); } |
| 1416 | |
| 1417 | void operator++(int dummy_to_specify_postfix_op) |
| 1418 | { _outp++; VDUI_ONLY(verify(_node, true)); } |
| 1419 | |
| 1420 | void operator--() |
| 1421 | { VDUI_ONLY(verify_resync()); --_outp; } |
| 1422 | |
| 1423 | void operator-=(uint n) // applied to the limit only |
| 1424 | { _outp -= n; VDUI_ONLY(verify_relimit(n)); } |
| 1425 | |
| 1426 | bool operator<(DUIterator_Fast& limit) { |
| 1427 | I_VDUI_ONLY(*this, this->verify(_node, true)); |
| 1428 | I_VDUI_ONLY(limit, limit.verify_limit()); |
| 1429 | return _outp < limit._outp; |
| 1430 | } |
| 1431 | |
| 1432 | void operator=(const DUIterator_Fast& that) |
| 1433 | { _outp = that._outp; debug_only(reset(that))reset(that); } |
| 1434 | }; |
| 1435 | |
| 1436 | DUIterator_Fast Node::fast_outs(DUIterator_Fast& imax) const { |
| 1437 | // Assign a limit pointer to the reference argument: |
| 1438 | imax = DUIterator_Fast(this, (ptrdiff_t)_outcnt); |
| 1439 | // Return the base pointer: |
| 1440 | return DUIterator_Fast(this, 0); |
| 1441 | } |
| 1442 | Node* Node::fast_out(DUIterator_Fast& i) const { |
| 1443 | I_VDUI_ONLY(i, i.verify(this)); |
| 1444 | return debug_only(i._last=)i._last= *i._outp; |
| 1445 | } |
| 1446 | |
| 1447 | |
| 1448 | // Faster DU iterator. Requires each successive edge to be removed. |
| 1449 | // Does not allow insertion of any edges. |
| 1450 | // Usage: |
| 1451 | // for (DUIterator_Last imin, i = x->last_outs(imin); i >= imin; i -= num_edges) { |
| 1452 | // Node* y = x->last_out(i); |
| 1453 | // ... |
| 1454 | // } |
| 1455 | // Compiles in product mode to raw Node** pointer arithmetic, with |
| 1456 | // no reloading of pointers from the original node x. |
| 1457 | class DUIterator_Last : private DUIterator_Fast { |
| 1458 | friend class Node; |
| 1459 | |
| 1460 | #ifdef ASSERT1 |
| 1461 | void verify(const Node* node, bool at_end_ok = false); |
| 1462 | void verify_limit(); |
| 1463 | void verify_step(uint num_edges); |
| 1464 | #endif |
| 1465 | |
| 1466 | // Note: offset must be signed, since -1 is sometimes passed |
| 1467 | DUIterator_Last(const Node* node, ptrdiff_t offset) |
| 1468 | : DUIterator_Fast(node, offset) { } |
| 1469 | |
| 1470 | void operator++(int dummy_to_specify_postfix_op) {} // do not use |
| 1471 | void operator<(int) {} // do not use |
| 1472 | |
| 1473 | public: |
| 1474 | DUIterator_Last() { } |
| 1475 | // initialize to garbage |
| 1476 | |
| 1477 | DUIterator_Last(const DUIterator_Last& that) = default; |
| 1478 | |
| 1479 | void operator--() |
| 1480 | { _outp--; VDUI_ONLY(verify_step(1)); } |
| 1481 | |
| 1482 | void operator-=(uint n) |
| 1483 | { _outp -= n; VDUI_ONLY(verify_step(n)); } |
| 1484 | |
| 1485 | bool operator>=(DUIterator_Last& limit) { |
| 1486 | I_VDUI_ONLY(*this, this->verify(_node, true)); |
| 1487 | I_VDUI_ONLY(limit, limit.verify_limit()); |
| 1488 | return _outp >= limit._outp; |
| 1489 | } |
| 1490 | |
| 1491 | DUIterator_Last& operator=(const DUIterator_Last& that) = default; |
| 1492 | }; |
| 1493 | |
| 1494 | DUIterator_Last Node::last_outs(DUIterator_Last& imin) const { |
| 1495 | // Assign a limit pointer to the reference argument: |
| 1496 | imin = DUIterator_Last(this, 0); |
| 1497 | // Return the initial pointer: |
| 1498 | return DUIterator_Last(this, (ptrdiff_t)_outcnt - 1); |
| 1499 | } |
| 1500 | Node* Node::last_out(DUIterator_Last& i) const { |
| 1501 | I_VDUI_ONLY(i, i.verify(this)); |
| 1502 | return debug_only(i._last=)i._last= *i._outp; |
| 1503 | } |
| 1504 | |
| 1505 | #endif //OPTO_DU_ITERATOR_ASSERT |
| 1506 | |
| 1507 | #undef I_VDUI_ONLY |
| 1508 | #undef VDUI_ONLY |
| 1509 | |
| 1510 | // An Iterator that truly follows the iterator pattern. Doesn't |
| 1511 | // support deletion but could be made to. |
| 1512 | // |
| 1513 | // for (SimpleDUIterator i(n); i.has_next(); i.next()) { |
| 1514 | // Node* m = i.get(); |
| 1515 | // |
| 1516 | class SimpleDUIterator : public StackObj { |
| 1517 | private: |
| 1518 | Node* node; |
| 1519 | DUIterator_Fast i; |
| 1520 | DUIterator_Fast imax; |
| 1521 | public: |
| 1522 | SimpleDUIterator(Node* n): node(n), i(n->fast_outs(imax)) {} |
| 1523 | bool has_next() { return i < imax; } |
| 1524 | void next() { i++; } |
| 1525 | Node* get() { return node->fast_out(i); } |
| 1526 | }; |
| 1527 | |
| 1528 | |
| 1529 | //----------------------------------------------------------------------------- |
| 1530 | // Map dense integer indices to Nodes. Uses classic doubling-array trick. |
| 1531 | // Abstractly provides an infinite array of Node*'s, initialized to NULL. |
| 1532 | // Note that the constructor just zeros things, and since I use Arena |
| 1533 | // allocation I do not need a destructor to reclaim storage. |
| 1534 | class Node_Array : public ResourceObj { |
| 1535 | friend class VMStructs; |
| 1536 | protected: |
| 1537 | Arena* _a; // Arena to allocate in |
| 1538 | uint _max; |
| 1539 | Node** _nodes; |
| 1540 | void grow( uint i ); // Grow array node to fit |
| 1541 | public: |
| 1542 | Node_Array(Arena* a, uint max = OptoNodeListSize) : _a(a), _max(max) { |
| 1543 | _nodes = NEW_ARENA_ARRAY(a, Node*, max)(Node**) (a)->Amalloc((max) * sizeof(Node*)); |
| 1544 | clear(); |
| 1545 | } |
| 1546 | |
| 1547 | Node_Array(Node_Array* na) : _a(na->_a), _max(na->_max), _nodes(na->_nodes) {} |
| 1548 | Node *operator[] ( uint i ) const // Lookup, or NULL for not mapped |
| 1549 | { return (i<_max) ? _nodes[i] : (Node*)NULL__null; } |
| 1550 | Node* at(uint i) const { assert(i<_max,"oob")do { if (!(i<_max)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/node.hpp" , 1550, "assert(" "i<_max" ") failed", "oob"); ::breakpoint (); } } while (0); return _nodes[i]; } |
| 1551 | Node** adr() { return _nodes; } |
| 1552 | // Extend the mapping: index i maps to Node *n. |
| 1553 | void map( uint i, Node *n ) { if( i>=_max ) grow(i); _nodes[i] = n; } |
| 1554 | void insert( uint i, Node *n ); |
| 1555 | void remove( uint i ); // Remove, preserving order |
| 1556 | // Clear all entries in _nodes to NULL but keep storage |
| 1557 | void clear() { |
| 1558 | Copy::zero_to_bytes(_nodes, _max * sizeof(Node*)); |
| 1559 | } |
| 1560 | |
| 1561 | uint Size() const { return _max; } |
| 1562 | void dump() const; |
| 1563 | }; |
| 1564 | |
| 1565 | class Node_List : public Node_Array { |
| 1566 | friend class VMStructs; |
| 1567 | uint _cnt; |
| 1568 | public: |
| 1569 | Node_List(uint max = OptoNodeListSize) : Node_Array(Thread::current()->resource_area(), max), _cnt(0) {} |
| 1570 | Node_List(Arena *a, uint max = OptoNodeListSize) : Node_Array(a, max), _cnt(0) {} |
| 1571 | bool contains(const Node* n) const { |
| 1572 | for (uint e = 0; e < size(); e++) { |
| 1573 | if (at(e) == n) return true; |
| 1574 | } |
| 1575 | return false; |
| 1576 | } |
| 1577 | void insert( uint i, Node *n ) { Node_Array::insert(i,n); _cnt++; } |
| 1578 | void remove( uint i ) { Node_Array::remove(i); _cnt--; } |
| 1579 | void push( Node *b ) { map(_cnt++,b); } |
| 1580 | void yank( Node *n ); // Find and remove |
| 1581 | Node *pop() { return _nodes[--_cnt]; } |
| 1582 | void clear() { _cnt = 0; Node_Array::clear(); } // retain storage |
| 1583 | void copy(const Node_List& from) { |
| 1584 | if (from._max > _max) { |
| 1585 | grow(from._max); |
| 1586 | } |
| 1587 | _cnt = from._cnt; |
| 1588 | Copy::conjoint_words_to_higher((HeapWord*)&from._nodes[0], (HeapWord*)&_nodes[0], from._max * sizeof(Node*)); |
| 1589 | } |
| 1590 | |
| 1591 | uint size() const { return _cnt; } |
| 1592 | void dump() const; |
| 1593 | void dump_simple() const; |
| 1594 | }; |
| 1595 | |
| 1596 | //------------------------------Unique_Node_List------------------------------- |
| 1597 | class Unique_Node_List : public Node_List { |
| 1598 | friend class VMStructs; |
| 1599 | VectorSet _in_worklist; |
| 1600 | uint _clock_index; // Index in list where to pop from next |
| 1601 | public: |
| 1602 | Unique_Node_List() : Node_List(), _clock_index(0) {} |
| 1603 | Unique_Node_List(Arena *a) : Node_List(a), _in_worklist(a), _clock_index(0) {} |
| 1604 | |
| 1605 | void remove( Node *n ); |
| 1606 | bool member( Node *n ) { return _in_worklist.test(n->_idx) != 0; } |
| 1607 | VectorSet& member_set(){ return _in_worklist; } |
| 1608 | |
| 1609 | void push(Node* b) { |
| 1610 | if( !_in_worklist.test_set(b->_idx) ) |
| 1611 | Node_List::push(b); |
| 1612 | } |
| 1613 | Node *pop() { |
| 1614 | if( _clock_index >= size() ) _clock_index = 0; |
| 1615 | Node *b = at(_clock_index); |
| 1616 | map( _clock_index, Node_List::pop()); |
| 1617 | if (size() != 0) _clock_index++; // Always start from 0 |
| 1618 | _in_worklist.remove(b->_idx); |
| 1619 | return b; |
| 1620 | } |
| 1621 | Node *remove(uint i) { |
| 1622 | Node *b = Node_List::at(i); |
| 1623 | _in_worklist.remove(b->_idx); |
| 1624 | map(i,Node_List::pop()); |
| 1625 | return b; |
| 1626 | } |
| 1627 | void yank(Node *n) { |
| 1628 | _in_worklist.remove(n->_idx); |
| 1629 | Node_List::yank(n); |
| 1630 | } |
| 1631 | void clear() { |
| 1632 | _in_worklist.clear(); // Discards storage but grows automatically |
| 1633 | Node_List::clear(); |
| 1634 | _clock_index = 0; |
| 1635 | } |
| 1636 | |
| 1637 | // Used after parsing to remove useless nodes before Iterative GVN |
| 1638 | void remove_useless_nodes(VectorSet& useful); |
| 1639 | |
| 1640 | bool contains(const Node* n) const { |
| 1641 | fatal("use faster member() instead")do { (*g_assert_poison) = 'X';; report_fatal(INTERNAL_ERROR, "/home/daniel/Projects/java/jdk/src/hotspot/share/opto/node.hpp" , 1641, "use faster member() instead"); ::breakpoint(); } while (0); |
| 1642 | return false; |
| 1643 | } |
| 1644 | |
| 1645 | #ifndef PRODUCT |
| 1646 | void print_set() const { _in_worklist.print(); } |
| 1647 | #endif |
| 1648 | }; |
| 1649 | |
| 1650 | // Inline definition of Compile::record_for_igvn must be deferred to this point. |
| 1651 | inline void Compile::record_for_igvn(Node* n) { |
| 1652 | _for_igvn->push(n); |
| 1653 | } |
| 1654 | |
| 1655 | //------------------------------Node_Stack------------------------------------- |
| 1656 | class Node_Stack { |
| 1657 | friend class VMStructs; |
| 1658 | protected: |
| 1659 | struct INode { |
| 1660 | Node *node; // Processed node |
| 1661 | uint indx; // Index of next node's child |
| 1662 | }; |
| 1663 | INode *_inode_top; // tos, stack grows up |
| 1664 | INode *_inode_max; // End of _inodes == _inodes + _max |
| 1665 | INode *_inodes; // Array storage for the stack |
| 1666 | Arena *_a; // Arena to allocate in |
| 1667 | void grow(); |
| 1668 | public: |
| 1669 | Node_Stack(int size) { |
| 1670 | size_t max = (size > OptoNodeListSize) ? size : OptoNodeListSize; |
| 1671 | _a = Thread::current()->resource_area(); |
| 1672 | _inodes = NEW_ARENA_ARRAY( _a, INode, max )(INode*) (_a)->Amalloc((max) * sizeof(INode)); |
| 1673 | _inode_max = _inodes + max; |
| 1674 | _inode_top = _inodes - 1; // stack is empty |
| 1675 | } |
| 1676 | |
| 1677 | Node_Stack(Arena *a, int size) : _a(a) { |
| 1678 | size_t max = (size > OptoNodeListSize) ? size : OptoNodeListSize; |
| 1679 | _inodes = NEW_ARENA_ARRAY( _a, INode, max )(INode*) (_a)->Amalloc((max) * sizeof(INode)); |
| 1680 | _inode_max = _inodes + max; |
| 1681 | _inode_top = _inodes - 1; // stack is empty |
| 1682 | } |
| 1683 | |
| 1684 | void pop() { |
| 1685 | assert(_inode_top >= _inodes, "node stack underflow")do { if (!(_inode_top >= _inodes)) { (*g_assert_poison) = 'X' ;; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/node.hpp" , 1685, "assert(" "_inode_top >= _inodes" ") failed", "node stack underflow" ); ::breakpoint(); } } while (0); |
| 1686 | --_inode_top; |
| 1687 | } |
| 1688 | void push(Node *n, uint i) { |
| 1689 | ++_inode_top; |
| 1690 | if (_inode_top >= _inode_max) grow(); |
| 1691 | INode *top = _inode_top; // optimization |
| 1692 | top->node = n; |
| 1693 | top->indx = i; |
| 1694 | } |
| 1695 | Node *node() const { |
| 1696 | return _inode_top->node; |
| 1697 | } |
| 1698 | Node* node_at(uint i) const { |
| 1699 | assert(_inodes + i <= _inode_top, "in range")do { if (!(_inodes + i <= _inode_top)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/node.hpp" , 1699, "assert(" "_inodes + i <= _inode_top" ") failed", "in range" ); ::breakpoint(); } } while (0); |
| 1700 | return _inodes[i].node; |
| 1701 | } |
| 1702 | uint index() const { |
| 1703 | return _inode_top->indx; |
| 1704 | } |
| 1705 | uint index_at(uint i) const { |
| 1706 | assert(_inodes + i <= _inode_top, "in range")do { if (!(_inodes + i <= _inode_top)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/node.hpp" , 1706, "assert(" "_inodes + i <= _inode_top" ") failed", "in range" ); ::breakpoint(); } } while (0); |
| 1707 | return _inodes[i].indx; |
| 1708 | } |
| 1709 | void set_node(Node *n) { |
| 1710 | _inode_top->node = n; |
| 1711 | } |
| 1712 | void set_index(uint i) { |
| 1713 | _inode_top->indx = i; |
| 1714 | } |
| 1715 | uint size_max() const { return (uint)pointer_delta(_inode_max, _inodes, sizeof(INode)); } // Max size |
| 1716 | uint size() const { return (uint)pointer_delta((_inode_top+1), _inodes, sizeof(INode)); } // Current size |
| 1717 | bool is_nonempty() const { return (_inode_top >= _inodes); } |
| 1718 | bool is_empty() const { return (_inode_top < _inodes); } |
| 1719 | void clear() { _inode_top = _inodes - 1; } // retain storage |
| 1720 | |
| 1721 | // Node_Stack is used to map nodes. |
| 1722 | Node* find(uint idx) const; |
| 1723 | }; |
| 1724 | |
| 1725 | |
| 1726 | //-----------------------------Node_Notes-------------------------------------- |
| 1727 | // Debugging or profiling annotations loosely and sparsely associated |
| 1728 | // with some nodes. See Compile::node_notes_at for the accessor. |
| 1729 | class Node_Notes { |
| 1730 | friend class VMStructs; |
| 1731 | JVMState* _jvms; |
| 1732 | |
| 1733 | public: |
| 1734 | Node_Notes(JVMState* jvms = NULL__null) { |
| 1735 | _jvms = jvms; |
| 1736 | } |
| 1737 | |
| 1738 | JVMState* jvms() { return _jvms; } |
| 1739 | void set_jvms(JVMState* x) { _jvms = x; } |
| 1740 | |
| 1741 | // True if there is nothing here. |
| 1742 | bool is_clear() { |
| 1743 | return (_jvms == NULL__null); |
| 1744 | } |
| 1745 | |
| 1746 | // Make there be nothing here. |
| 1747 | void clear() { |
| 1748 | _jvms = NULL__null; |
| 1749 | } |
| 1750 | |
| 1751 | // Make a new, clean node notes. |
| 1752 | static Node_Notes* make(Compile* C) { |
| 1753 | Node_Notes* nn = NEW_ARENA_ARRAY(C->comp_arena(), Node_Notes, 1)(Node_Notes*) (C->comp_arena())->Amalloc((1) * sizeof(Node_Notes )); |
| 1754 | nn->clear(); |
| 1755 | return nn; |
| 1756 | } |
| 1757 | |
| 1758 | Node_Notes* clone(Compile* C) { |
| 1759 | Node_Notes* nn = NEW_ARENA_ARRAY(C->comp_arena(), Node_Notes, 1)(Node_Notes*) (C->comp_arena())->Amalloc((1) * sizeof(Node_Notes )); |
| 1760 | (*nn) = (*this); |
| 1761 | return nn; |
| 1762 | } |
| 1763 | |
| 1764 | // Absorb any information from source. |
| 1765 | bool update_from(Node_Notes* source) { |
| 1766 | bool changed = false; |
| 1767 | if (source != NULL__null) { |
| 1768 | if (source->jvms() != NULL__null) { |
| 1769 | set_jvms(source->jvms()); |
| 1770 | changed = true; |
| 1771 | } |
| 1772 | } |
| 1773 | return changed; |
| 1774 | } |
| 1775 | }; |
| 1776 | |
| 1777 | // Inlined accessors for Compile::node_nodes that require the preceding class: |
| 1778 | inline Node_Notes* |
| 1779 | Compile::locate_node_notes(GrowableArray<Node_Notes*>* arr, |
| 1780 | int idx, bool can_grow) { |
| 1781 | assert(idx >= 0, "oob")do { if (!(idx >= 0)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/node.hpp" , 1781, "assert(" "idx >= 0" ") failed", "oob"); ::breakpoint (); } } while (0); |
| 1782 | int block_idx = (idx >> _log2_node_notes_block_size); |
| 1783 | int grow_by = (block_idx - (arr == NULL__null? 0: arr->length())); |
| 1784 | if (grow_by >= 0) { |
| 1785 | if (!can_grow) return NULL__null; |
| 1786 | grow_node_notes(arr, grow_by + 1); |
| 1787 | } |
| 1788 | if (arr == NULL__null) return NULL__null; |
| 1789 | // (Every element of arr is a sub-array of length _node_notes_block_size.) |
| 1790 | return arr->at(block_idx) + (idx & (_node_notes_block_size-1)); |
| 1791 | } |
| 1792 | |
| 1793 | inline bool |
| 1794 | Compile::set_node_notes_at(int idx, Node_Notes* value) { |
| 1795 | if (value == NULL__null || value->is_clear()) |
| 1796 | return false; // nothing to write => write nothing |
| 1797 | Node_Notes* loc = locate_node_notes(_node_note_array, idx, true); |
| 1798 | assert(loc != NULL, "")do { if (!(loc != __null)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/node.hpp" , 1798, "assert(" "loc != __null" ") failed", ""); ::breakpoint (); } } while (0); |
| 1799 | return loc->update_from(value); |
| 1800 | } |
| 1801 | |
| 1802 | |
| 1803 | //------------------------------TypeNode--------------------------------------- |
| 1804 | // Node with a Type constant. |
| 1805 | class TypeNode : public Node { |
| 1806 | protected: |
| 1807 | virtual uint hash() const; // Check the type |
| 1808 | virtual bool cmp( const Node &n ) const; |
| 1809 | virtual uint size_of() const; // Size is bigger |
| 1810 | const Type* const _type; |
| 1811 | public: |
| 1812 | void set_type(const Type* t) { |
| 1813 | assert(t != NULL, "sanity")do { if (!(t != __null)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/node.hpp" , 1813, "assert(" "t != __null" ") failed", "sanity"); ::breakpoint (); } } while (0); |
| 1814 | debug_only(uint check_hash = (VerifyHashTableKeys && _hash_lock) ? hash() : NO_HASH)uint check_hash = (VerifyHashTableKeys && _hash_lock) ? hash() : NO_HASH; |
| 1815 | *(const Type**)&_type = t; // cast away const-ness |
| 1816 | // If this node is in the hash table, make sure it doesn't need a rehash. |
| 1817 | assert(check_hash == NO_HASH || check_hash == hash(), "type change must preserve hash code")do { if (!(check_hash == NO_HASH || check_hash == hash())) { ( *g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/node.hpp" , 1817, "assert(" "check_hash == NO_HASH || check_hash == hash()" ") failed", "type change must preserve hash code"); ::breakpoint (); } } while (0); |
| 1818 | } |
| 1819 | const Type* type() const { assert(_type != NULL, "sanity")do { if (!(_type != __null)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/node.hpp" , 1819, "assert(" "_type != __null" ") failed", "sanity"); :: breakpoint(); } } while (0); return _type; }; |
| 1820 | TypeNode( const Type *t, uint required ) : Node(required), _type(t) { |
| 1821 | init_class_id(Class_Type); |
| 1822 | } |
| 1823 | virtual const Type* Value(PhaseGVN* phase) const; |
| 1824 | virtual const Type *bottom_type() const; |
| 1825 | virtual uint ideal_reg() const; |
| 1826 | #ifndef PRODUCT |
| 1827 | virtual void dump_spec(outputStream *st) const; |
| 1828 | virtual void dump_compact_spec(outputStream *st) const; |
| 1829 | #endif |
| 1830 | }; |
| 1831 | |
| 1832 | #include "opto/opcodes.hpp" |
| 1833 | |
| 1834 | #define Op_IL(op)inline int Op_op(BasicType bt) { do { if (!(bt == T_INT || bt == T_LONG)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/node.hpp" , 1834, "assert(" "bt == T_INT || bt == T_LONG" ") failed", "only for int or longs" ); ::breakpoint(); } } while (0); if (bt == T_INT) { return Op_opI ; } return Op_opL; } \ |
| 1835 | inline int Op_ ## op(BasicType bt) { \ |
| 1836 | assert(bt == T_INT || bt == T_LONG, "only for int or longs")do { if (!(bt == T_INT || bt == T_LONG)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/node.hpp" , 1836, "assert(" "bt == T_INT || bt == T_LONG" ") failed", "only for int or longs" ); ::breakpoint(); } } while (0); \ |
| 1837 | if (bt == T_INT) { \ |
| 1838 | return Op_## op ## I; \ |
| 1839 | } \ |
| 1840 | return Op_## op ## L; \ |
| 1841 | } |
| 1842 | |
| 1843 | Op_IL(Add)inline int Op_Add(BasicType bt) { do { if (!(bt == T_INT || bt == T_LONG)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/node.hpp" , 1843, "assert(" "bt == T_INT || bt == T_LONG" ") failed", "only for int or longs" ); ::breakpoint(); } } while (0); if (bt == T_INT) { return Op_AddI ; } return Op_AddL; } |
| 1844 | Op_IL(Sub)inline int Op_Sub(BasicType bt) { do { if (!(bt == T_INT || bt == T_LONG)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/node.hpp" , 1844, "assert(" "bt == T_INT || bt == T_LONG" ") failed", "only for int or longs" ); ::breakpoint(); } } while (0); if (bt == T_INT) { return Op_SubI ; } return Op_SubL; } |
| 1845 | Op_IL(Mul)inline int Op_Mul(BasicType bt) { do { if (!(bt == T_INT || bt == T_LONG)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/node.hpp" , 1845, "assert(" "bt == T_INT || bt == T_LONG" ") failed", "only for int or longs" ); ::breakpoint(); } } while (0); if (bt == T_INT) { return Op_MulI ; } return Op_MulL; } |
| 1846 | Op_IL(URShift)inline int Op_URShift(BasicType bt) { do { if (!(bt == T_INT || bt == T_LONG)) { (*g_assert_poison) = 'X';; report_vm_error( "/home/daniel/Projects/java/jdk/src/hotspot/share/opto/node.hpp" , 1846, "assert(" "bt == T_INT || bt == T_LONG" ") failed", "only for int or longs" ); ::breakpoint(); } } while (0); if (bt == T_INT) { return Op_URShiftI ; } return Op_URShiftL; } |
| 1847 | Op_IL(LShift)inline int Op_LShift(BasicType bt) { do { if (!(bt == T_INT || bt == T_LONG)) { (*g_assert_poison) = 'X';; report_vm_error( "/home/daniel/Projects/java/jdk/src/hotspot/share/opto/node.hpp" , 1847, "assert(" "bt == T_INT || bt == T_LONG" ") failed", "only for int or longs" ); ::breakpoint(); } } while (0); if (bt == T_INT) { return Op_LShiftI ; } return Op_LShiftL; } |
| 1848 | Op_IL(Xor)inline int Op_Xor(BasicType bt) { do { if (!(bt == T_INT || bt == T_LONG)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/node.hpp" , 1848, "assert(" "bt == T_INT || bt == T_LONG" ") failed", "only for int or longs" ); ::breakpoint(); } } while (0); if (bt == T_INT) { return Op_XorI ; } return Op_XorL; } |
| 1849 | Op_IL(Cmp)inline int Op_Cmp(BasicType bt) { do { if (!(bt == T_INT || bt == T_LONG)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/node.hpp" , 1849, "assert(" "bt == T_INT || bt == T_LONG" ") failed", "only for int or longs" ); ::breakpoint(); } } while (0); if (bt == T_INT) { return Op_CmpI ; } return Op_CmpL; } |
| 1850 | |
| 1851 | inline int Op_Cmp_unsigned(BasicType bt) { |
| 1852 | assert(bt == T_INT || bt == T_LONG, "only for int or longs")do { if (!(bt == T_INT || bt == T_LONG)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/node.hpp" , 1852, "assert(" "bt == T_INT || bt == T_LONG" ") failed", "only for int or longs" ); ::breakpoint(); } } while (0); |
| 1853 | if (bt == T_INT) { |
| 1854 | return Op_CmpU; |
| 1855 | } |
| 1856 | return Op_CmpUL; |
| 1857 | } |
| 1858 | |
| 1859 | inline int Op_Cast(BasicType bt) { |
| 1860 | assert(bt == T_INT || bt == T_LONG, "only for int or longs")do { if (!(bt == T_INT || bt == T_LONG)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/node.hpp" , 1860, "assert(" "bt == T_INT || bt == T_LONG" ") failed", "only for int or longs" ); ::breakpoint(); } } while (0); |
| 1861 | if (bt == T_INT) { |
| 1862 | return Op_CastII; |
| 1863 | } |
| 1864 | return Op_CastLL; |
| 1865 | } |
| 1866 | |
| 1867 | #endif // SHARE_OPTO_NODE_HPP |