1 /* 2 * Copyright (c) 1997, 2016, 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 "gc/shared/barrierSet.hpp" 27 #include "gc/shared/c2/barrierSetC2.hpp" 28 #include "libadt/vectset.hpp" 29 #include "memory/allocation.inline.hpp" 30 #include "memory/resourceArea.hpp" 31 #include "opto/castnode.hpp" 32 #include "opto/cfgnode.hpp" 33 #include "opto/connode.hpp" 34 #include "opto/loopnode.hpp" 35 #include "opto/machnode.hpp" 36 #include "opto/matcher.hpp" 37 #include "opto/node.hpp" 38 #include "opto/opcodes.hpp" 39 #include "opto/regmask.hpp" 40 #include "opto/rootnode.hpp" 41 #include "opto/type.hpp" 42 #include "utilities/copy.hpp" 43 #include "utilities/macros.hpp" 44 45 class RegMask; 46 // #include "phase.hpp" 47 class PhaseTransform; 48 class PhaseGVN; 49 50 // Arena we are currently building Nodes in 51 const uint Node::NotAMachineReg = 0xffff0000; 52 53 #ifndef PRODUCT 54 extern int nodes_created; 55 #endif 56 #ifdef __clang__ 57 #pragma clang diagnostic push 58 #pragma GCC diagnostic ignored "-Wuninitialized" 59 #endif 60 61 #ifdef ASSERT 62 63 //-------------------------- construct_node------------------------------------ 64 // Set a breakpoint here to identify where a particular node index is built. 65 void Node::verify_construction() { 66 _debug_orig = NULL; 67 int old_debug_idx = Compile::debug_idx(); 68 int new_debug_idx = old_debug_idx+1; 69 if (new_debug_idx > 0) { 70 // Arrange that the lowest five decimal digits of _debug_idx 71 // will repeat those of _idx. In case this is somehow pathological, 72 // we continue to assign negative numbers (!) consecutively. 73 const int mod = 100000; 74 int bump = (int)(_idx - new_debug_idx) % mod; 75 if (bump < 0) bump += mod; 76 assert(bump >= 0 && bump < mod, ""); 77 new_debug_idx += bump; 78 } 79 Compile::set_debug_idx(new_debug_idx); 80 set_debug_idx( new_debug_idx ); 81 assert(Compile::current()->unique() < (INT_MAX - 1), "Node limit exceeded INT_MAX"); 82 assert(Compile::current()->live_nodes() < Compile::current()->max_node_limit(), "Live Node limit exceeded limit"); 83 if (BreakAtNode != 0 && (_debug_idx == BreakAtNode || (int)_idx == BreakAtNode)) { 84 tty->print_cr("BreakAtNode: _idx=%d _debug_idx=%d", _idx, _debug_idx); 85 BREAKPOINT; 86 } 87 #if OPTO_DU_ITERATOR_ASSERT 88 _last_del = NULL; 89 _del_tick = 0; 90 #endif 91 _hash_lock = 0; 92 } 93 94 95 // #ifdef ASSERT ... 96 97 #if OPTO_DU_ITERATOR_ASSERT 98 void DUIterator_Common::sample(const Node* node) { 99 _vdui = VerifyDUIterators; 100 _node = node; 101 _outcnt = node->_outcnt; 102 _del_tick = node->_del_tick; 103 _last = NULL; 104 } 105 106 void DUIterator_Common::verify(const Node* node, bool at_end_ok) { 107 assert(_node == node, "consistent iterator source"); 108 assert(_del_tick == node->_del_tick, "no unexpected deletions allowed"); 109 } 110 111 void DUIterator_Common::verify_resync() { 112 // Ensure that the loop body has just deleted the last guy produced. 113 const Node* node = _node; 114 // Ensure that at least one copy of the last-seen edge was deleted. 115 // Note: It is OK to delete multiple copies of the last-seen edge. 116 // Unfortunately, we have no way to verify that all the deletions delete 117 // that same edge. On this point we must use the Honor System. 118 assert(node->_del_tick >= _del_tick+1, "must have deleted an edge"); 119 assert(node->_last_del == _last, "must have deleted the edge just produced"); 120 // We liked this deletion, so accept the resulting outcnt and tick. 121 _outcnt = node->_outcnt; 122 _del_tick = node->_del_tick; 123 } 124 125 void DUIterator_Common::reset(const DUIterator_Common& that) { 126 if (this == &that) return; // ignore assignment to self 127 if (!_vdui) { 128 // We need to initialize everything, overwriting garbage values. 129 _last = that._last; 130 _vdui = that._vdui; 131 } 132 // Note: It is legal (though odd) for an iterator over some node x 133 // to be reassigned to iterate over another node y. Some doubly-nested 134 // progress loops depend on being able to do this. 135 const Node* node = that._node; 136 // Re-initialize everything, except _last. 137 _node = node; 138 _outcnt = node->_outcnt; 139 _del_tick = node->_del_tick; 140 } 141 142 void DUIterator::sample(const Node* node) { 143 DUIterator_Common::sample(node); // Initialize the assertion data. 144 _refresh_tick = 0; // No refreshes have happened, as yet. 145 } 146 147 void DUIterator::verify(const Node* node, bool at_end_ok) { 148 DUIterator_Common::verify(node, at_end_ok); 149 assert(_idx < node->_outcnt + (uint)at_end_ok, "idx in range"); 150 } 151 152 void DUIterator::verify_increment() { 153 if (_refresh_tick & 1) { 154 // We have refreshed the index during this loop. 155 // Fix up _idx to meet asserts. 156 if (_idx > _outcnt) _idx = _outcnt; 157 } 158 verify(_node, true); 159 } 160 161 void DUIterator::verify_resync() { 162 // Note: We do not assert on _outcnt, because insertions are OK here. 163 DUIterator_Common::verify_resync(); 164 // Make sure we are still in sync, possibly with no more out-edges: 165 verify(_node, true); 166 } 167 168 void DUIterator::reset(const DUIterator& that) { 169 if (this == &that) return; // self assignment is always a no-op 170 assert(that._refresh_tick == 0, "assign only the result of Node::outs()"); 171 assert(that._idx == 0, "assign only the result of Node::outs()"); 172 assert(_idx == that._idx, "already assigned _idx"); 173 if (!_vdui) { 174 // We need to initialize everything, overwriting garbage values. 175 sample(that._node); 176 } else { 177 DUIterator_Common::reset(that); 178 if (_refresh_tick & 1) { 179 _refresh_tick++; // Clear the "was refreshed" flag. 180 } 181 assert(_refresh_tick < 2*100000, "DU iteration must converge quickly"); 182 } 183 } 184 185 void DUIterator::refresh() { 186 DUIterator_Common::sample(_node); // Re-fetch assertion data. 187 _refresh_tick |= 1; // Set the "was refreshed" flag. 188 } 189 190 void DUIterator::verify_finish() { 191 // If the loop has killed the node, do not require it to re-run. 192 if (_node->_outcnt == 0) _refresh_tick &= ~1; 193 // If this assert triggers, it means that a loop used refresh_out_pos 194 // to re-synch an iteration index, but the loop did not correctly 195 // re-run itself, using a "while (progress)" construct. 196 // This iterator enforces the rule that you must keep trying the loop 197 // until it "runs clean" without any need for refreshing. 198 assert(!(_refresh_tick & 1), "the loop must run once with no refreshing"); 199 } 200 201 202 void DUIterator_Fast::verify(const Node* node, bool at_end_ok) { 203 DUIterator_Common::verify(node, at_end_ok); 204 Node** out = node->_out; 205 uint cnt = node->_outcnt; 206 assert(cnt == _outcnt, "no insertions allowed"); 207 assert(_outp >= out && _outp <= out + cnt - !at_end_ok, "outp in range"); 208 // This last check is carefully designed to work for NO_OUT_ARRAY. 209 } 210 211 void DUIterator_Fast::verify_limit() { 212 const Node* node = _node; 213 verify(node, true); 214 assert(_outp == node->_out + node->_outcnt, "limit still correct"); 215 } 216 217 void DUIterator_Fast::verify_resync() { 218 const Node* node = _node; 219 if (_outp == node->_out + _outcnt) { 220 // Note that the limit imax, not the pointer i, gets updated with the 221 // exact count of deletions. (For the pointer it's always "--i".) 222 assert(node->_outcnt+node->_del_tick == _outcnt+_del_tick, "no insertions allowed with deletion(s)"); 223 // This is a limit pointer, with a name like "imax". 224 // Fudge the _last field so that the common assert will be happy. 225 _last = (Node*) node->_last_del; 226 DUIterator_Common::verify_resync(); 227 } else { 228 assert(node->_outcnt < _outcnt, "no insertions allowed with deletion(s)"); 229 // A normal internal pointer. 230 DUIterator_Common::verify_resync(); 231 // Make sure we are still in sync, possibly with no more out-edges: 232 verify(node, true); 233 } 234 } 235 236 void DUIterator_Fast::verify_relimit(uint n) { 237 const Node* node = _node; 238 assert((int)n > 0, "use imax -= n only with a positive count"); 239 // This must be a limit pointer, with a name like "imax". 240 assert(_outp == node->_out + node->_outcnt, "apply -= only to a limit (imax)"); 241 // The reported number of deletions must match what the node saw. 242 assert(node->_del_tick == _del_tick + n, "must have deleted n edges"); 243 // Fudge the _last field so that the common assert will be happy. 244 _last = (Node*) node->_last_del; 245 DUIterator_Common::verify_resync(); 246 } 247 248 void DUIterator_Fast::reset(const DUIterator_Fast& that) { 249 assert(_outp == that._outp, "already assigned _outp"); 250 DUIterator_Common::reset(that); 251 } 252 253 void DUIterator_Last::verify(const Node* node, bool at_end_ok) { 254 // at_end_ok means the _outp is allowed to underflow by 1 255 _outp += at_end_ok; 256 DUIterator_Fast::verify(node, at_end_ok); // check _del_tick, etc. 257 _outp -= at_end_ok; 258 assert(_outp == (node->_out + node->_outcnt) - 1, "pointer must point to end of nodes"); 259 } 260 261 void DUIterator_Last::verify_limit() { 262 // Do not require the limit address to be resynched. 263 //verify(node, true); 264 assert(_outp == _node->_out, "limit still correct"); 265 } 266 267 void DUIterator_Last::verify_step(uint num_edges) { 268 assert((int)num_edges > 0, "need non-zero edge count for loop progress"); 269 _outcnt -= num_edges; 270 _del_tick += num_edges; 271 // Make sure we are still in sync, possibly with no more out-edges: 272 const Node* node = _node; 273 verify(node, true); 274 assert(node->_last_del == _last, "must have deleted the edge just produced"); 275 } 276 277 #endif //OPTO_DU_ITERATOR_ASSERT 278 279 280 #endif //ASSERT 281 282 283 // This constant used to initialize _out may be any non-null value. 284 // The value NULL is reserved for the top node only. 285 #define NO_OUT_ARRAY ((Node**)-1) 286 287 // Out-of-line code from node constructors. 288 // Executed only when extra debug info. is being passed around. 289 static void init_node_notes(Compile* C, int idx, Node_Notes* nn) { 290 C->set_node_notes_at(idx, nn); 291 } 292 293 // Shared initialization code. 294 inline int Node::Init(int req) { 295 Compile* C = Compile::current(); 296 int idx = C->next_unique(); 297 298 // Allocate memory for the necessary number of edges. 299 if (req > 0) { 300 // Allocate space for _in array to have double alignment. 301 _in = (Node **) ((char *) (C->node_arena()->Amalloc_D(req * sizeof(void*)))); 302 } 303 // If there are default notes floating around, capture them: 304 Node_Notes* nn = C->default_node_notes(); 305 if (nn != NULL) init_node_notes(C, idx, nn); 306 307 // Note: At this point, C is dead, 308 // and we begin to initialize the new Node. 309 310 _cnt = _max = req; 311 _outcnt = _outmax = 0; 312 _class_id = Class_Node; 313 _flags = 0; 314 _out = NO_OUT_ARRAY; 315 return idx; 316 } 317 318 //------------------------------Node------------------------------------------- 319 // Create a Node, with a given number of required edges. 320 Node::Node(uint req) 321 : _idx(Init(req)) 322 #ifdef ASSERT 323 , _parse_idx(_idx) 324 #endif 325 { 326 assert( req < Compile::current()->max_node_limit() - NodeLimitFudgeFactor, "Input limit exceeded" ); 327 debug_only( verify_construction() ); 328 NOT_PRODUCT(nodes_created++); 329 if (req == 0) { 330 _in = NULL; 331 } else { 332 Node** to = _in; 333 for(uint i = 0; i < req; i++) { 334 to[i] = NULL; 335 } 336 } 337 } 338 339 //------------------------------Node------------------------------------------- 340 Node::Node(Node *n0) 341 : _idx(Init(1)) 342 #ifdef ASSERT 343 , _parse_idx(_idx) 344 #endif 345 { 346 debug_only( verify_construction() ); 347 NOT_PRODUCT(nodes_created++); 348 assert( is_not_dead(n0), "can not use dead node"); 349 _in[0] = n0; if (n0 != NULL) n0->add_out((Node *)this); 350 } 351 352 //------------------------------Node------------------------------------------- 353 Node::Node(Node *n0, Node *n1) 354 : _idx(Init(2)) 355 #ifdef ASSERT 356 , _parse_idx(_idx) 357 #endif 358 { 359 debug_only( verify_construction() ); 360 NOT_PRODUCT(nodes_created++); 361 assert( is_not_dead(n0), "can not use dead node"); 362 assert( is_not_dead(n1), "can not use dead node"); 363 _in[0] = n0; if (n0 != NULL) n0->add_out((Node *)this); 364 _in[1] = n1; if (n1 != NULL) n1->add_out((Node *)this); 365 } 366 367 //------------------------------Node------------------------------------------- 368 Node::Node(Node *n0, Node *n1, Node *n2) 369 : _idx(Init(3)) 370 #ifdef ASSERT 371 , _parse_idx(_idx) 372 #endif 373 { 374 debug_only( verify_construction() ); 375 NOT_PRODUCT(nodes_created++); 376 assert( is_not_dead(n0), "can not use dead node"); 377 assert( is_not_dead(n1), "can not use dead node"); 378 assert( is_not_dead(n2), "can not use dead node"); 379 _in[0] = n0; if (n0 != NULL) n0->add_out((Node *)this); 380 _in[1] = n1; if (n1 != NULL) n1->add_out((Node *)this); 381 _in[2] = n2; if (n2 != NULL) n2->add_out((Node *)this); 382 } 383 384 //------------------------------Node------------------------------------------- 385 Node::Node(Node *n0, Node *n1, Node *n2, Node *n3) 386 : _idx(Init(4)) 387 #ifdef ASSERT 388 , _parse_idx(_idx) 389 #endif 390 { 391 debug_only( verify_construction() ); 392 NOT_PRODUCT(nodes_created++); 393 assert( is_not_dead(n0), "can not use dead node"); 394 assert( is_not_dead(n1), "can not use dead node"); 395 assert( is_not_dead(n2), "can not use dead node"); 396 assert( is_not_dead(n3), "can not use dead node"); 397 _in[0] = n0; if (n0 != NULL) n0->add_out((Node *)this); 398 _in[1] = n1; if (n1 != NULL) n1->add_out((Node *)this); 399 _in[2] = n2; if (n2 != NULL) n2->add_out((Node *)this); 400 _in[3] = n3; if (n3 != NULL) n3->add_out((Node *)this); 401 } 402 403 //------------------------------Node------------------------------------------- 404 Node::Node(Node *n0, Node *n1, Node *n2, Node *n3, Node *n4) 405 : _idx(Init(5)) 406 #ifdef ASSERT 407 , _parse_idx(_idx) 408 #endif 409 { 410 debug_only( verify_construction() ); 411 NOT_PRODUCT(nodes_created++); 412 assert( is_not_dead(n0), "can not use dead node"); 413 assert( is_not_dead(n1), "can not use dead node"); 414 assert( is_not_dead(n2), "can not use dead node"); 415 assert( is_not_dead(n3), "can not use dead node"); 416 assert( is_not_dead(n4), "can not use dead node"); 417 _in[0] = n0; if (n0 != NULL) n0->add_out((Node *)this); 418 _in[1] = n1; if (n1 != NULL) n1->add_out((Node *)this); 419 _in[2] = n2; if (n2 != NULL) n2->add_out((Node *)this); 420 _in[3] = n3; if (n3 != NULL) n3->add_out((Node *)this); 421 _in[4] = n4; if (n4 != NULL) n4->add_out((Node *)this); 422 } 423 424 //------------------------------Node------------------------------------------- 425 Node::Node(Node *n0, Node *n1, Node *n2, Node *n3, 426 Node *n4, Node *n5) 427 : _idx(Init(6)) 428 #ifdef ASSERT 429 , _parse_idx(_idx) 430 #endif 431 { 432 debug_only( verify_construction() ); 433 NOT_PRODUCT(nodes_created++); 434 assert( is_not_dead(n0), "can not use dead node"); 435 assert( is_not_dead(n1), "can not use dead node"); 436 assert( is_not_dead(n2), "can not use dead node"); 437 assert( is_not_dead(n3), "can not use dead node"); 438 assert( is_not_dead(n4), "can not use dead node"); 439 assert( is_not_dead(n5), "can not use dead node"); 440 _in[0] = n0; if (n0 != NULL) n0->add_out((Node *)this); 441 _in[1] = n1; if (n1 != NULL) n1->add_out((Node *)this); 442 _in[2] = n2; if (n2 != NULL) n2->add_out((Node *)this); 443 _in[3] = n3; if (n3 != NULL) n3->add_out((Node *)this); 444 _in[4] = n4; if (n4 != NULL) n4->add_out((Node *)this); 445 _in[5] = n5; if (n5 != NULL) n5->add_out((Node *)this); 446 } 447 448 //------------------------------Node------------------------------------------- 449 Node::Node(Node *n0, Node *n1, Node *n2, Node *n3, 450 Node *n4, Node *n5, Node *n6) 451 : _idx(Init(7)) 452 #ifdef ASSERT 453 , _parse_idx(_idx) 454 #endif 455 { 456 debug_only( verify_construction() ); 457 NOT_PRODUCT(nodes_created++); 458 assert( is_not_dead(n0), "can not use dead node"); 459 assert( is_not_dead(n1), "can not use dead node"); 460 assert( is_not_dead(n2), "can not use dead node"); 461 assert( is_not_dead(n3), "can not use dead node"); 462 assert( is_not_dead(n4), "can not use dead node"); 463 assert( is_not_dead(n5), "can not use dead node"); 464 assert( is_not_dead(n6), "can not use dead node"); 465 _in[0] = n0; if (n0 != NULL) n0->add_out((Node *)this); 466 _in[1] = n1; if (n1 != NULL) n1->add_out((Node *)this); 467 _in[2] = n2; if (n2 != NULL) n2->add_out((Node *)this); 468 _in[3] = n3; if (n3 != NULL) n3->add_out((Node *)this); 469 _in[4] = n4; if (n4 != NULL) n4->add_out((Node *)this); 470 _in[5] = n5; if (n5 != NULL) n5->add_out((Node *)this); 471 _in[6] = n6; if (n6 != NULL) n6->add_out((Node *)this); 472 } 473 474 #ifdef __clang__ 475 #pragma clang diagnostic pop 476 #endif 477 478 479 //------------------------------clone------------------------------------------ 480 // Clone a Node. 481 Node *Node::clone() const { 482 Compile* C = Compile::current(); 483 uint s = size_of(); // Size of inherited Node 484 Node *n = (Node*)C->node_arena()->Amalloc_D(size_of() + _max*sizeof(Node*)); 485 Copy::conjoint_words_to_lower((HeapWord*)this, (HeapWord*)n, s); 486 // Set the new input pointer array 487 n->_in = (Node**)(((char*)n)+s); 488 // Cannot share the old output pointer array, so kill it 489 n->_out = NO_OUT_ARRAY; 490 // And reset the counters to 0 491 n->_outcnt = 0; 492 n->_outmax = 0; 493 // Unlock this guy, since he is not in any hash table. 494 debug_only(n->_hash_lock = 0); 495 // Walk the old node's input list to duplicate its edges 496 uint i; 497 for( i = 0; i < len(); i++ ) { 498 Node *x = in(i); 499 n->_in[i] = x; 500 if (x != NULL) x->add_out(n); 501 } 502 if (is_macro()) 503 C->add_macro_node(n); 504 if (is_expensive()) 505 C->add_expensive_node(n); 506 BarrierSetC2* bs = BarrierSet::barrier_set()->barrier_set_c2(); 507 bs->register_potential_barrier_node(n); 508 // If the cloned node is a range check dependent CastII, add it to the list. 509 CastIINode* cast = n->isa_CastII(); 510 if (cast != NULL && cast->has_range_check()) { 511 C->add_range_check_cast(cast); 512 } 513 if (n->Opcode() == Op_Opaque4) { 514 C->add_opaque4_node(n); 515 } 516 517 n->set_idx(C->next_unique()); // Get new unique index as well 518 debug_only( n->verify_construction() ); 519 NOT_PRODUCT(nodes_created++); 520 // Do not patch over the debug_idx of a clone, because it makes it 521 // impossible to break on the clone's moment of creation. 522 //debug_only( n->set_debug_idx( debug_idx() ) ); 523 524 C->copy_node_notes_to(n, (Node*) this); 525 526 // MachNode clone 527 uint nopnds; 528 if (this->is_Mach() && (nopnds = this->as_Mach()->num_opnds()) > 0) { 529 MachNode *mach = n->as_Mach(); 530 MachNode *mthis = this->as_Mach(); 531 // Get address of _opnd_array. 532 // It should be the same offset since it is the clone of this node. 533 MachOper **from = mthis->_opnds; 534 MachOper **to = (MachOper **)((size_t)(&mach->_opnds) + 535 pointer_delta((const void*)from, 536 (const void*)(&mthis->_opnds), 1)); 537 mach->_opnds = to; 538 for ( uint i = 0; i < nopnds; ++i ) { 539 to[i] = from[i]->clone(); 540 } 541 } 542 // cloning CallNode may need to clone JVMState 543 if (n->is_Call()) { 544 n->as_Call()->clone_jvms(C); 545 } 546 if (n->is_SafePoint()) { 547 n->as_SafePoint()->clone_replaced_nodes(); 548 } 549 if (n->is_Load()) { 550 n->as_Load()->copy_barrier_info(this); 551 } 552 return n; // Return the clone 553 } 554 555 //---------------------------setup_is_top-------------------------------------- 556 // Call this when changing the top node, to reassert the invariants 557 // required by Node::is_top. See Compile::set_cached_top_node. 558 void Node::setup_is_top() { 559 if (this == (Node*)Compile::current()->top()) { 560 // This node has just become top. Kill its out array. 561 _outcnt = _outmax = 0; 562 _out = NULL; // marker value for top 563 assert(is_top(), "must be top"); 564 } else { 565 if (_out == NULL) _out = NO_OUT_ARRAY; 566 assert(!is_top(), "must not be top"); 567 } 568 } 569 570 //------------------------------~Node------------------------------------------ 571 // Fancy destructor; eagerly attempt to reclaim Node numberings and storage 572 void Node::destruct() { 573 // Eagerly reclaim unique Node numberings 574 Compile* compile = Compile::current(); 575 if ((uint)_idx+1 == compile->unique()) { 576 compile->set_unique(compile->unique()-1); 577 } 578 // Clear debug info: 579 Node_Notes* nn = compile->node_notes_at(_idx); 580 if (nn != NULL) nn->clear(); 581 // Walk the input array, freeing the corresponding output edges 582 _cnt = _max; // forget req/prec distinction 583 uint i; 584 for( i = 0; i < _max; i++ ) { 585 set_req(i, NULL); 586 //assert(def->out(def->outcnt()-1) == (Node *)this,"bad def-use hacking in reclaim"); 587 } 588 assert(outcnt() == 0, "deleting a node must not leave a dangling use"); 589 // See if the input array was allocated just prior to the object 590 int edge_size = _max*sizeof(void*); 591 int out_edge_size = _outmax*sizeof(void*); 592 char *edge_end = ((char*)_in) + edge_size; 593 char *out_array = (char*)(_out == NO_OUT_ARRAY? NULL: _out); 594 int node_size = size_of(); 595 596 // Free the output edge array 597 if (out_edge_size > 0) { 598 compile->node_arena()->Afree(out_array, out_edge_size); 599 } 600 601 // Free the input edge array and the node itself 602 if( edge_end == (char*)this ) { 603 // It was; free the input array and object all in one hit 604 #ifndef ASSERT 605 compile->node_arena()->Afree(_in,edge_size+node_size); 606 #endif 607 } else { 608 // Free just the input array 609 compile->node_arena()->Afree(_in,edge_size); 610 611 // Free just the object 612 #ifndef ASSERT 613 compile->node_arena()->Afree(this,node_size); 614 #endif 615 } 616 if (is_macro()) { 617 compile->remove_macro_node(this); 618 } 619 if (is_expensive()) { 620 compile->remove_expensive_node(this); 621 } 622 CastIINode* cast = isa_CastII(); 623 if (cast != NULL && cast->has_range_check()) { 624 compile->remove_range_check_cast(cast); 625 } 626 if (Opcode() == Op_Opaque4) { 627 compile->remove_opaque4_node(this); 628 } 629 630 if (is_SafePoint()) { 631 as_SafePoint()->delete_replaced_nodes(); 632 } 633 BarrierSetC2* bs = BarrierSet::barrier_set()->barrier_set_c2(); 634 bs->unregister_potential_barrier_node(this); 635 #ifdef ASSERT 636 // We will not actually delete the storage, but we'll make the node unusable. 637 *(address*)this = badAddress; // smash the C++ vtbl, probably 638 _in = _out = (Node**) badAddress; 639 _max = _cnt = _outmax = _outcnt = 0; 640 compile->remove_modified_node(this); 641 #endif 642 } 643 644 //------------------------------grow------------------------------------------- 645 // Grow the input array, making space for more edges 646 void Node::grow( uint len ) { 647 Arena* arena = Compile::current()->node_arena(); 648 uint new_max = _max; 649 if( new_max == 0 ) { 650 _max = 4; 651 _in = (Node**)arena->Amalloc(4*sizeof(Node*)); 652 Node** to = _in; 653 to[0] = NULL; 654 to[1] = NULL; 655 to[2] = NULL; 656 to[3] = NULL; 657 return; 658 } 659 while( new_max <= len ) new_max <<= 1; // Find next power-of-2 660 // Trimming to limit allows a uint8 to handle up to 255 edges. 661 // Previously I was using only powers-of-2 which peaked at 128 edges. 662 //if( new_max >= limit ) new_max = limit-1; 663 _in = (Node**)arena->Arealloc(_in, _max*sizeof(Node*), new_max*sizeof(Node*)); 664 Copy::zero_to_bytes(&_in[_max], (new_max-_max)*sizeof(Node*)); // NULL all new space 665 _max = new_max; // Record new max length 666 // This assertion makes sure that Node::_max is wide enough to 667 // represent the numerical value of new_max. 668 assert(_max == new_max && _max > len, "int width of _max is too small"); 669 } 670 671 //-----------------------------out_grow---------------------------------------- 672 // Grow the input array, making space for more edges 673 void Node::out_grow( uint len ) { 674 assert(!is_top(), "cannot grow a top node's out array"); 675 Arena* arena = Compile::current()->node_arena(); 676 uint new_max = _outmax; 677 if( new_max == 0 ) { 678 _outmax = 4; 679 _out = (Node **)arena->Amalloc(4*sizeof(Node*)); 680 return; 681 } 682 while( new_max <= len ) new_max <<= 1; // Find next power-of-2 683 // Trimming to limit allows a uint8 to handle up to 255 edges. 684 // Previously I was using only powers-of-2 which peaked at 128 edges. 685 //if( new_max >= limit ) new_max = limit-1; 686 assert(_out != NULL && _out != NO_OUT_ARRAY, "out must have sensible value"); 687 _out = (Node**)arena->Arealloc(_out,_outmax*sizeof(Node*),new_max*sizeof(Node*)); 688 //Copy::zero_to_bytes(&_out[_outmax], (new_max-_outmax)*sizeof(Node*)); // NULL all new space 689 _outmax = new_max; // Record new max length 690 // This assertion makes sure that Node::_max is wide enough to 691 // represent the numerical value of new_max. 692 assert(_outmax == new_max && _outmax > len, "int width of _outmax is too small"); 693 } 694 695 #ifdef ASSERT 696 //------------------------------is_dead---------------------------------------- 697 bool Node::is_dead() const { 698 // Mach and pinch point nodes may look like dead. 699 if( is_top() || is_Mach() || (Opcode() == Op_Node && _outcnt > 0) ) 700 return false; 701 for( uint i = 0; i < _max; i++ ) 702 if( _in[i] != NULL ) 703 return false; 704 dump(); 705 return true; 706 } 707 708 bool Node::is_reachable_from_root() const { 709 ResourceMark rm; 710 Unique_Node_List wq; 711 wq.push((Node*)this); 712 RootNode* root = Compile::current()->root(); 713 for (uint i = 0; i < wq.size(); i++) { 714 Node* m = wq.at(i); 715 if (m == root) { 716 return true; 717 } 718 for (DUIterator_Fast jmax, j = m->fast_outs(jmax); j < jmax; j++) { 719 Node* u = m->fast_out(j); 720 wq.push(u); 721 } 722 } 723 return false; 724 } 725 #endif 726 727 //------------------------------is_unreachable--------------------------------- 728 bool Node::is_unreachable(PhaseIterGVN &igvn) const { 729 assert(!is_Mach(), "doesn't work with MachNodes"); 730 return outcnt() == 0 || igvn.type(this) == Type::TOP || (in(0) != NULL && in(0)->is_top()); 731 } 732 733 //------------------------------add_req---------------------------------------- 734 // Add a new required input at the end 735 void Node::add_req( Node *n ) { 736 assert( is_not_dead(n), "can not use dead node"); 737 738 // Look to see if I can move precedence down one without reallocating 739 if( (_cnt >= _max) || (in(_max-1) != NULL) ) 740 grow( _max+1 ); 741 742 // Find a precedence edge to move 743 if( in(_cnt) != NULL ) { // Next precedence edge is busy? 744 uint i; 745 for( i=_cnt; i<_max; i++ ) 746 if( in(i) == NULL ) // Find the NULL at end of prec edge list 747 break; // There must be one, since we grew the array 748 _in[i] = in(_cnt); // Move prec over, making space for req edge 749 } 750 _in[_cnt++] = n; // Stuff over old prec edge 751 if (n != NULL) n->add_out((Node *)this); 752 } 753 754 //---------------------------add_req_batch------------------------------------- 755 // Add a new required input at the end 756 void Node::add_req_batch( Node *n, uint m ) { 757 assert( is_not_dead(n), "can not use dead node"); 758 // check various edge cases 759 if ((int)m <= 1) { 760 assert((int)m >= 0, "oob"); 761 if (m != 0) add_req(n); 762 return; 763 } 764 765 // Look to see if I can move precedence down one without reallocating 766 if( (_cnt+m) > _max || _in[_max-m] ) 767 grow( _max+m ); 768 769 // Find a precedence edge to move 770 if( _in[_cnt] != NULL ) { // Next precedence edge is busy? 771 uint i; 772 for( i=_cnt; i<_max; i++ ) 773 if( _in[i] == NULL ) // Find the NULL at end of prec edge list 774 break; // There must be one, since we grew the array 775 // Slide all the precs over by m positions (assume #prec << m). 776 Copy::conjoint_words_to_higher((HeapWord*)&_in[_cnt], (HeapWord*)&_in[_cnt+m], ((i-_cnt)*sizeof(Node*))); 777 } 778 779 // Stuff over the old prec edges 780 for(uint i=0; i<m; i++ ) { 781 _in[_cnt++] = n; 782 } 783 784 // Insert multiple out edges on the node. 785 if (n != NULL && !n->is_top()) { 786 for(uint i=0; i<m; i++ ) { 787 n->add_out((Node *)this); 788 } 789 } 790 } 791 792 //------------------------------del_req---------------------------------------- 793 // Delete the required edge and compact the edge array 794 void Node::del_req( uint idx ) { 795 assert( idx < _cnt, "oob"); 796 assert( !VerifyHashTableKeys || _hash_lock == 0, 797 "remove node from hash table before modifying it"); 798 // First remove corresponding def-use edge 799 Node *n = in(idx); 800 if (n != NULL) n->del_out((Node *)this); 801 _in[idx] = in(--_cnt); // Compact the array 802 // Avoid spec violation: Gap in prec edges. 803 close_prec_gap_at(_cnt); 804 Compile::current()->record_modified_node(this); 805 } 806 807 //------------------------------del_req_ordered-------------------------------- 808 // Delete the required edge and compact the edge array with preserved order 809 void Node::del_req_ordered( uint idx ) { 810 assert( idx < _cnt, "oob"); 811 assert( !VerifyHashTableKeys || _hash_lock == 0, 812 "remove node from hash table before modifying it"); 813 // First remove corresponding def-use edge 814 Node *n = in(idx); 815 if (n != NULL) n->del_out((Node *)this); 816 if (idx < --_cnt) { // Not last edge ? 817 Copy::conjoint_words_to_lower((HeapWord*)&_in[idx+1], (HeapWord*)&_in[idx], ((_cnt-idx)*sizeof(Node*))); 818 } 819 // Avoid spec violation: Gap in prec edges. 820 close_prec_gap_at(_cnt); 821 Compile::current()->record_modified_node(this); 822 } 823 824 //------------------------------ins_req---------------------------------------- 825 // Insert a new required input at the end 826 void Node::ins_req( uint idx, Node *n ) { 827 assert( is_not_dead(n), "can not use dead node"); 828 add_req(NULL); // Make space 829 assert( idx < _max, "Must have allocated enough space"); 830 // Slide over 831 if(_cnt-idx-1 > 0) { 832 Copy::conjoint_words_to_higher((HeapWord*)&_in[idx], (HeapWord*)&_in[idx+1], ((_cnt-idx-1)*sizeof(Node*))); 833 } 834 _in[idx] = n; // Stuff over old required edge 835 if (n != NULL) n->add_out((Node *)this); // Add reciprocal def-use edge 836 } 837 838 //-----------------------------find_edge--------------------------------------- 839 int Node::find_edge(Node* n) { 840 for (uint i = 0; i < len(); i++) { 841 if (_in[i] == n) return i; 842 } 843 return -1; 844 } 845 846 //----------------------------replace_edge------------------------------------- 847 int Node::replace_edge(Node* old, Node* neww) { 848 if (old == neww) return 0; // nothing to do 849 uint nrep = 0; 850 for (uint i = 0; i < len(); i++) { 851 if (in(i) == old) { 852 if (i < req()) { 853 set_req(i, neww); 854 } else { 855 assert(find_prec_edge(neww) == -1, "spec violation: duplicated prec edge (node %d -> %d)", _idx, neww->_idx); 856 set_prec(i, neww); 857 } 858 nrep++; 859 } 860 } 861 return nrep; 862 } 863 864 /** 865 * Replace input edges in the range pointing to 'old' node. 866 */ 867 int Node::replace_edges_in_range(Node* old, Node* neww, int start, int end) { 868 if (old == neww) return 0; // nothing to do 869 uint nrep = 0; 870 for (int i = start; i < end; i++) { 871 if (in(i) == old) { 872 set_req(i, neww); 873 nrep++; 874 } 875 } 876 return nrep; 877 } 878 879 //-------------------------disconnect_inputs----------------------------------- 880 // NULL out all inputs to eliminate incoming Def-Use edges. 881 // Return the number of edges between 'n' and 'this' 882 int Node::disconnect_inputs(Node *n, Compile* C) { 883 int edges_to_n = 0; 884 885 uint cnt = req(); 886 for( uint i = 0; i < cnt; ++i ) { 887 if( in(i) == 0 ) continue; 888 if( in(i) == n ) ++edges_to_n; 889 set_req(i, NULL); 890 } 891 // Remove precedence edges if any exist 892 // Note: Safepoints may have precedence edges, even during parsing 893 if( (req() != len()) && (in(req()) != NULL) ) { 894 uint max = len(); 895 for( uint i = 0; i < max; ++i ) { 896 if( in(i) == 0 ) continue; 897 if( in(i) == n ) ++edges_to_n; 898 set_prec(i, NULL); 899 } 900 } 901 902 // Node::destruct requires all out edges be deleted first 903 // debug_only(destruct();) // no reuse benefit expected 904 if (edges_to_n == 0) { 905 C->record_dead_node(_idx); 906 } 907 return edges_to_n; 908 } 909 910 //-----------------------------uncast--------------------------------------- 911 // %%% Temporary, until we sort out CheckCastPP vs. CastPP. 912 // Strip away casting. (It is depth-limited.) 913 // Optionally, keep casts with dependencies. 914 Node* Node::uncast(bool keep_deps) const { 915 // Should be inline: 916 //return is_ConstraintCast() ? uncast_helper(this) : (Node*) this; 917 if (is_ConstraintCast()) { 918 return uncast_helper(this, keep_deps); 919 } else { 920 return (Node*) this; 921 } 922 } 923 924 // Find out of current node that matches opcode. 925 Node* Node::find_out_with(int opcode) { 926 for (DUIterator_Fast imax, i = fast_outs(imax); i < imax; i++) { 927 Node* use = fast_out(i); 928 if (use->Opcode() == opcode) { 929 return use; 930 } 931 } 932 return NULL; 933 } 934 935 // Return true if the current node has an out that matches opcode. 936 bool Node::has_out_with(int opcode) { 937 return (find_out_with(opcode) != NULL); 938 } 939 940 // Return true if the current node has an out that matches any of the opcodes. 941 bool Node::has_out_with(int opcode1, int opcode2, int opcode3, int opcode4) { 942 for (DUIterator_Fast imax, i = fast_outs(imax); i < imax; i++) { 943 int opcode = fast_out(i)->Opcode(); 944 if (opcode == opcode1 || opcode == opcode2 || opcode == opcode3 || opcode == opcode4) { 945 return true; 946 } 947 } 948 return false; 949 } 950 951 952 //---------------------------uncast_helper------------------------------------- 953 Node* Node::uncast_helper(const Node* p, bool keep_deps) { 954 #ifdef ASSERT 955 uint depth_count = 0; 956 const Node* orig_p = p; 957 #endif 958 959 while (true) { 960 #ifdef ASSERT 961 if (depth_count >= K) { 962 orig_p->dump(4); 963 if (p != orig_p) 964 p->dump(1); 965 } 966 assert(depth_count++ < K, "infinite loop in Node::uncast_helper"); 967 #endif 968 if (p == NULL || p->req() != 2) { 969 break; 970 } else if (p->is_ConstraintCast()) { 971 if (keep_deps && p->as_ConstraintCast()->carry_dependency()) { 972 break; // stop at casts with dependencies 973 } 974 p = p->in(1); 975 } else { 976 break; 977 } 978 } 979 return (Node*) p; 980 } 981 982 //------------------------------add_prec--------------------------------------- 983 // Add a new precedence input. Precedence inputs are unordered, with 984 // duplicates removed and NULLs packed down at the end. 985 void Node::add_prec( Node *n ) { 986 assert( is_not_dead(n), "can not use dead node"); 987 988 // Check for NULL at end 989 if( _cnt >= _max || in(_max-1) ) 990 grow( _max+1 ); 991 992 // Find a precedence edge to move 993 uint i = _cnt; 994 while( in(i) != NULL ) { 995 if (in(i) == n) return; // Avoid spec violation: duplicated prec edge. 996 i++; 997 } 998 _in[i] = n; // Stuff prec edge over NULL 999 if ( n != NULL) n->add_out((Node *)this); // Add mirror edge 1000 1001 #ifdef ASSERT 1002 while ((++i)<_max) { assert(_in[i] == NULL, "spec violation: Gap in prec edges (node %d)", _idx); } 1003 #endif 1004 } 1005 1006 //------------------------------rm_prec---------------------------------------- 1007 // Remove a precedence input. Precedence inputs are unordered, with 1008 // duplicates removed and NULLs packed down at the end. 1009 void Node::rm_prec( uint j ) { 1010 assert(j < _max, "oob: i=%d, _max=%d", j, _max); 1011 assert(j >= _cnt, "not a precedence edge"); 1012 if (_in[j] == NULL) return; // Avoid spec violation: Gap in prec edges. 1013 _in[j]->del_out((Node *)this); 1014 close_prec_gap_at(j); 1015 } 1016 1017 //------------------------------size_of---------------------------------------- 1018 uint Node::size_of() const { return sizeof(*this); } 1019 1020 //------------------------------ideal_reg-------------------------------------- 1021 uint Node::ideal_reg() const { return 0; } 1022 1023 //------------------------------jvms------------------------------------------- 1024 JVMState* Node::jvms() const { return NULL; } 1025 1026 #ifdef ASSERT 1027 //------------------------------jvms------------------------------------------- 1028 bool Node::verify_jvms(const JVMState* using_jvms) const { 1029 for (JVMState* jvms = this->jvms(); jvms != NULL; jvms = jvms->caller()) { 1030 if (jvms == using_jvms) return true; 1031 } 1032 return false; 1033 } 1034 1035 //------------------------------init_NodeProperty------------------------------ 1036 void Node::init_NodeProperty() { 1037 assert(_max_classes <= max_jushort, "too many NodeProperty classes"); 1038 assert(_max_flags <= max_jushort, "too many NodeProperty flags"); 1039 } 1040 #endif 1041 1042 //------------------------------format----------------------------------------- 1043 // Print as assembly 1044 void Node::format( PhaseRegAlloc *, outputStream *st ) const {} 1045 //------------------------------emit------------------------------------------- 1046 // Emit bytes starting at parameter 'ptr'. 1047 void Node::emit(CodeBuffer &cbuf, PhaseRegAlloc *ra_) const {} 1048 //------------------------------size------------------------------------------- 1049 // Size of instruction in bytes 1050 uint Node::size(PhaseRegAlloc *ra_) const { return 0; } 1051 1052 //------------------------------CFG Construction------------------------------- 1053 // Nodes that end basic blocks, e.g. IfTrue/IfFalse, JumpProjNode, Root, 1054 // Goto and Return. 1055 const Node *Node::is_block_proj() const { return 0; } 1056 1057 // Minimum guaranteed type 1058 const Type *Node::bottom_type() const { return Type::BOTTOM; } 1059 1060 1061 //------------------------------raise_bottom_type------------------------------ 1062 // Get the worst-case Type output for this Node. 1063 void Node::raise_bottom_type(const Type* new_type) { 1064 if (is_Type()) { 1065 TypeNode *n = this->as_Type(); 1066 if (VerifyAliases) { 1067 assert(new_type->higher_equal_speculative(n->type()), "new type must refine old type"); 1068 } 1069 n->set_type(new_type); 1070 } else if (is_Load()) { 1071 LoadNode *n = this->as_Load(); 1072 if (VerifyAliases) { 1073 assert(new_type->higher_equal_speculative(n->type()), "new type must refine old type"); 1074 } 1075 n->set_type(new_type); 1076 } 1077 } 1078 1079 //------------------------------Identity--------------------------------------- 1080 // Return a node that the given node is equivalent to. 1081 Node* Node::Identity(PhaseGVN* phase) { 1082 return this; // Default to no identities 1083 } 1084 1085 //------------------------------Value------------------------------------------ 1086 // Compute a new Type for a node using the Type of the inputs. 1087 const Type* Node::Value(PhaseGVN* phase) const { 1088 return bottom_type(); // Default to worst-case Type 1089 } 1090 1091 //------------------------------Ideal------------------------------------------ 1092 // 1093 // 'Idealize' the graph rooted at this Node. 1094 // 1095 // In order to be efficient and flexible there are some subtle invariants 1096 // these Ideal calls need to hold. Running with '+VerifyIterativeGVN' checks 1097 // these invariants, although its too slow to have on by default. If you are 1098 // hacking an Ideal call, be sure to test with +VerifyIterativeGVN! 1099 // 1100 // The Ideal call almost arbitrarily reshape the graph rooted at the 'this' 1101 // pointer. If ANY change is made, it must return the root of the reshaped 1102 // graph - even if the root is the same Node. Example: swapping the inputs 1103 // to an AddINode gives the same answer and same root, but you still have to 1104 // return the 'this' pointer instead of NULL. 1105 // 1106 // You cannot return an OLD Node, except for the 'this' pointer. Use the 1107 // Identity call to return an old Node; basically if Identity can find 1108 // another Node have the Ideal call make no change and return NULL. 1109 // Example: AddINode::Ideal must check for add of zero; in this case it 1110 // returns NULL instead of doing any graph reshaping. 1111 // 1112 // You cannot modify any old Nodes except for the 'this' pointer. Due to 1113 // sharing there may be other users of the old Nodes relying on their current 1114 // semantics. Modifying them will break the other users. 1115 // Example: when reshape "(X+3)+4" into "X+7" you must leave the Node for 1116 // "X+3" unchanged in case it is shared. 1117 // 1118 // If you modify the 'this' pointer's inputs, you should use 1119 // 'set_req'. If you are making a new Node (either as the new root or 1120 // some new internal piece) you may use 'init_req' to set the initial 1121 // value. You can make a new Node with either 'new' or 'clone'. In 1122 // either case, def-use info is correctly maintained. 1123 // 1124 // Example: reshape "(X+3)+4" into "X+7": 1125 // set_req(1, in(1)->in(1)); 1126 // set_req(2, phase->intcon(7)); 1127 // return this; 1128 // Example: reshape "X*4" into "X<<2" 1129 // return new LShiftINode(in(1), phase->intcon(2)); 1130 // 1131 // You must call 'phase->transform(X)' on any new Nodes X you make, except 1132 // for the returned root node. Example: reshape "X*31" with "(X<<5)-X". 1133 // Node *shift=phase->transform(new LShiftINode(in(1),phase->intcon(5))); 1134 // return new AddINode(shift, in(1)); 1135 // 1136 // When making a Node for a constant use 'phase->makecon' or 'phase->intcon'. 1137 // These forms are faster than 'phase->transform(new ConNode())' and Do 1138 // The Right Thing with def-use info. 1139 // 1140 // You cannot bury the 'this' Node inside of a graph reshape. If the reshaped 1141 // graph uses the 'this' Node it must be the root. If you want a Node with 1142 // the same Opcode as the 'this' pointer use 'clone'. 1143 // 1144 Node *Node::Ideal(PhaseGVN *phase, bool can_reshape) { 1145 return NULL; // Default to being Ideal already 1146 } 1147 1148 // Some nodes have specific Ideal subgraph transformations only if they are 1149 // unique users of specific nodes. Such nodes should be put on IGVN worklist 1150 // for the transformations to happen. 1151 bool Node::has_special_unique_user() const { 1152 assert(outcnt() == 1, "match only for unique out"); 1153 Node* n = unique_out(); 1154 int op = Opcode(); 1155 if (this->is_Store()) { 1156 // Condition for back-to-back stores folding. 1157 return n->Opcode() == op && n->in(MemNode::Memory) == this; 1158 } else if (this->is_Load() || this->is_DecodeN() || this->is_Phi()) { 1159 // Condition for removing an unused LoadNode or DecodeNNode from the MemBarAcquire precedence input 1160 return n->Opcode() == Op_MemBarAcquire; 1161 } else if (op == Op_AddL) { 1162 // Condition for convL2I(addL(x,y)) ==> addI(convL2I(x),convL2I(y)) 1163 return n->Opcode() == Op_ConvL2I && n->in(1) == this; 1164 } else if (op == Op_SubI || op == Op_SubL) { 1165 // Condition for subI(x,subI(y,z)) ==> subI(addI(x,z),y) 1166 return n->Opcode() == op && n->in(2) == this; 1167 } else if (is_If() && (n->is_IfFalse() || n->is_IfTrue())) { 1168 // See IfProjNode::Identity() 1169 return true; 1170 } else { 1171 return BarrierSet::barrier_set()->barrier_set_c2()->has_special_unique_user(this); 1172 } 1173 }; 1174 1175 //--------------------------find_exact_control--------------------------------- 1176 // Skip Proj and CatchProj nodes chains. Check for Null and Top. 1177 Node* Node::find_exact_control(Node* ctrl) { 1178 if (ctrl == NULL && this->is_Region()) 1179 ctrl = this->as_Region()->is_copy(); 1180 1181 if (ctrl != NULL && ctrl->is_CatchProj()) { 1182 if (ctrl->as_CatchProj()->_con == CatchProjNode::fall_through_index) 1183 ctrl = ctrl->in(0); 1184 if (ctrl != NULL && !ctrl->is_top()) 1185 ctrl = ctrl->in(0); 1186 } 1187 1188 if (ctrl != NULL && ctrl->is_Proj()) 1189 ctrl = ctrl->in(0); 1190 1191 return ctrl; 1192 } 1193 1194 //--------------------------dominates------------------------------------------ 1195 // Helper function for MemNode::all_controls_dominate(). 1196 // Check if 'this' control node dominates or equal to 'sub' control node. 1197 // We already know that if any path back to Root or Start reaches 'this', 1198 // then all paths so, so this is a simple search for one example, 1199 // not an exhaustive search for a counterexample. 1200 bool Node::dominates(Node* sub, Node_List &nlist) { 1201 assert(this->is_CFG(), "expecting control"); 1202 assert(sub != NULL && sub->is_CFG(), "expecting control"); 1203 1204 // detect dead cycle without regions 1205 int iterations_without_region_limit = DominatorSearchLimit; 1206 1207 Node* orig_sub = sub; 1208 Node* dom = this; 1209 bool met_dom = false; 1210 nlist.clear(); 1211 1212 // Walk 'sub' backward up the chain to 'dom', watching for regions. 1213 // After seeing 'dom', continue up to Root or Start. 1214 // If we hit a region (backward split point), it may be a loop head. 1215 // Keep going through one of the region's inputs. If we reach the 1216 // same region again, go through a different input. Eventually we 1217 // will either exit through the loop head, or give up. 1218 // (If we get confused, break out and return a conservative 'false'.) 1219 while (sub != NULL) { 1220 if (sub->is_top()) break; // Conservative answer for dead code. 1221 if (sub == dom) { 1222 if (nlist.size() == 0) { 1223 // No Region nodes except loops were visited before and the EntryControl 1224 // path was taken for loops: it did not walk in a cycle. 1225 return true; 1226 } else if (met_dom) { 1227 break; // already met before: walk in a cycle 1228 } else { 1229 // Region nodes were visited. Continue walk up to Start or Root 1230 // to make sure that it did not walk in a cycle. 1231 met_dom = true; // first time meet 1232 iterations_without_region_limit = DominatorSearchLimit; // Reset 1233 } 1234 } 1235 if (sub->is_Start() || sub->is_Root()) { 1236 // Success if we met 'dom' along a path to Start or Root. 1237 // We assume there are no alternative paths that avoid 'dom'. 1238 // (This assumption is up to the caller to ensure!) 1239 return met_dom; 1240 } 1241 Node* up = sub->in(0); 1242 // Normalize simple pass-through regions and projections: 1243 up = sub->find_exact_control(up); 1244 // If sub == up, we found a self-loop. Try to push past it. 1245 if (sub == up && sub->is_Loop()) { 1246 // Take loop entry path on the way up to 'dom'. 1247 up = sub->in(1); // in(LoopNode::EntryControl); 1248 } else if (sub == up && sub->is_Region() && sub->req() == 2) { 1249 // Take in(1) path on the way up to 'dom' for regions with only one input 1250 up = sub->in(1); 1251 } else if (sub == up && sub->is_Region() && sub->req() == 3) { 1252 // Try both paths for Regions with 2 input paths (it may be a loop head). 1253 // It could give conservative 'false' answer without information 1254 // which region's input is the entry path. 1255 iterations_without_region_limit = DominatorSearchLimit; // Reset 1256 1257 bool region_was_visited_before = false; 1258 // Was this Region node visited before? 1259 // If so, we have reached it because we accidentally took a 1260 // loop-back edge from 'sub' back into the body of the loop, 1261 // and worked our way up again to the loop header 'sub'. 1262 // So, take the first unexplored path on the way up to 'dom'. 1263 for (int j = nlist.size() - 1; j >= 0; j--) { 1264 intptr_t ni = (intptr_t)nlist.at(j); 1265 Node* visited = (Node*)(ni & ~1); 1266 bool visited_twice_already = ((ni & 1) != 0); 1267 if (visited == sub) { 1268 if (visited_twice_already) { 1269 // Visited 2 paths, but still stuck in loop body. Give up. 1270 return false; 1271 } 1272 // The Region node was visited before only once. 1273 // (We will repush with the low bit set, below.) 1274 nlist.remove(j); 1275 // We will find a new edge and re-insert. 1276 region_was_visited_before = true; 1277 break; 1278 } 1279 } 1280 1281 // Find an incoming edge which has not been seen yet; walk through it. 1282 assert(up == sub, ""); 1283 uint skip = region_was_visited_before ? 1 : 0; 1284 for (uint i = 1; i < sub->req(); i++) { 1285 Node* in = sub->in(i); 1286 if (in != NULL && !in->is_top() && in != sub) { 1287 if (skip == 0) { 1288 up = in; 1289 break; 1290 } 1291 --skip; // skip this nontrivial input 1292 } 1293 } 1294 1295 // Set 0 bit to indicate that both paths were taken. 1296 nlist.push((Node*)((intptr_t)sub + (region_was_visited_before ? 1 : 0))); 1297 } 1298 1299 if (up == sub) { 1300 break; // some kind of tight cycle 1301 } 1302 if (up == orig_sub && met_dom) { 1303 // returned back after visiting 'dom' 1304 break; // some kind of cycle 1305 } 1306 if (--iterations_without_region_limit < 0) { 1307 break; // dead cycle 1308 } 1309 sub = up; 1310 } 1311 1312 // Did not meet Root or Start node in pred. chain. 1313 // Conservative answer for dead code. 1314 return false; 1315 } 1316 1317 //------------------------------remove_dead_region----------------------------- 1318 // This control node is dead. Follow the subgraph below it making everything 1319 // using it dead as well. This will happen normally via the usual IterGVN 1320 // worklist but this call is more efficient. Do not update use-def info 1321 // inside the dead region, just at the borders. 1322 static void kill_dead_code( Node *dead, PhaseIterGVN *igvn ) { 1323 // Con's are a popular node to re-hit in the hash table again. 1324 if( dead->is_Con() ) return; 1325 1326 ResourceMark rm; 1327 Node_List nstack(Thread::current()->resource_area()); 1328 1329 Node *top = igvn->C->top(); 1330 nstack.push(dead); 1331 bool has_irreducible_loop = igvn->C->has_irreducible_loop(); 1332 1333 while (nstack.size() > 0) { 1334 dead = nstack.pop(); 1335 if (dead->Opcode() == Op_SafePoint) { 1336 dead->as_SafePoint()->disconnect_from_root(igvn); 1337 } 1338 if (dead->outcnt() > 0) { 1339 // Keep dead node on stack until all uses are processed. 1340 nstack.push(dead); 1341 // For all Users of the Dead... ;-) 1342 for (DUIterator_Last kmin, k = dead->last_outs(kmin); k >= kmin; ) { 1343 Node* use = dead->last_out(k); 1344 igvn->hash_delete(use); // Yank from hash table prior to mod 1345 if (use->in(0) == dead) { // Found another dead node 1346 assert (!use->is_Con(), "Control for Con node should be Root node."); 1347 use->set_req(0, top); // Cut dead edge to prevent processing 1348 nstack.push(use); // the dead node again. 1349 } else if (!has_irreducible_loop && // Backedge could be alive in irreducible loop 1350 use->is_Loop() && !use->is_Root() && // Don't kill Root (RootNode extends LoopNode) 1351 use->in(LoopNode::EntryControl) == dead) { // Dead loop if its entry is dead 1352 use->set_req(LoopNode::EntryControl, top); // Cut dead edge to prevent processing 1353 use->set_req(0, top); // Cut self edge 1354 nstack.push(use); 1355 } else { // Else found a not-dead user 1356 // Dead if all inputs are top or null 1357 bool dead_use = !use->is_Root(); // Keep empty graph alive 1358 for (uint j = 1; j < use->req(); j++) { 1359 Node* in = use->in(j); 1360 if (in == dead) { // Turn all dead inputs into TOP 1361 use->set_req(j, top); 1362 } else if (in != NULL && !in->is_top()) { 1363 dead_use = false; 1364 } 1365 } 1366 if (dead_use) { 1367 if (use->is_Region()) { 1368 use->set_req(0, top); // Cut self edge 1369 } 1370 nstack.push(use); 1371 } else { 1372 igvn->_worklist.push(use); 1373 } 1374 } 1375 // Refresh the iterator, since any number of kills might have happened. 1376 k = dead->last_outs(kmin); 1377 } 1378 } else { // (dead->outcnt() == 0) 1379 // Done with outputs. 1380 igvn->hash_delete(dead); 1381 igvn->_worklist.remove(dead); 1382 igvn->C->remove_modified_node(dead); 1383 igvn->set_type(dead, Type::TOP); 1384 if (dead->is_macro()) { 1385 igvn->C->remove_macro_node(dead); 1386 } 1387 if (dead->is_expensive()) { 1388 igvn->C->remove_expensive_node(dead); 1389 } 1390 CastIINode* cast = dead->isa_CastII(); 1391 if (cast != NULL && cast->has_range_check()) { 1392 igvn->C->remove_range_check_cast(cast); 1393 } 1394 if (dead->Opcode() == Op_Opaque4) { 1395 igvn->C->remove_opaque4_node(dead); 1396 } 1397 BarrierSetC2* bs = BarrierSet::barrier_set()->barrier_set_c2(); 1398 bs->unregister_potential_barrier_node(dead); 1399 igvn->C->record_dead_node(dead->_idx); 1400 // Kill all inputs to the dead guy 1401 for (uint i=0; i < dead->req(); i++) { 1402 Node *n = dead->in(i); // Get input to dead guy 1403 if (n != NULL && !n->is_top()) { // Input is valid? 1404 dead->set_req(i, top); // Smash input away 1405 if (n->outcnt() == 0) { // Input also goes dead? 1406 if (!n->is_Con()) 1407 nstack.push(n); // Clear it out as well 1408 } else if (n->outcnt() == 1 && 1409 n->has_special_unique_user()) { 1410 igvn->add_users_to_worklist( n ); 1411 } else if (n->outcnt() <= 2 && n->is_Store()) { 1412 // Push store's uses on worklist to enable folding optimization for 1413 // store/store and store/load to the same address. 1414 // The restriction (outcnt() <= 2) is the same as in set_req_X() 1415 // and remove_globally_dead_node(). 1416 igvn->add_users_to_worklist( n ); 1417 } else { 1418 BarrierSet::barrier_set()->barrier_set_c2()->enqueue_useful_gc_barrier(igvn, n); 1419 } 1420 } 1421 } 1422 } // (dead->outcnt() == 0) 1423 } // while (nstack.size() > 0) for outputs 1424 return; 1425 } 1426 1427 //------------------------------remove_dead_region----------------------------- 1428 bool Node::remove_dead_region(PhaseGVN *phase, bool can_reshape) { 1429 Node *n = in(0); 1430 if( !n ) return false; 1431 // Lost control into this guy? I.e., it became unreachable? 1432 // Aggressively kill all unreachable code. 1433 if (can_reshape && n->is_top()) { 1434 kill_dead_code(this, phase->is_IterGVN()); 1435 return false; // Node is dead. 1436 } 1437 1438 if( n->is_Region() && n->as_Region()->is_copy() ) { 1439 Node *m = n->nonnull_req(); 1440 set_req(0, m); 1441 return true; 1442 } 1443 return false; 1444 } 1445 1446 //------------------------------hash------------------------------------------- 1447 // Hash function over Nodes. 1448 uint Node::hash() const { 1449 uint sum = 0; 1450 for( uint i=0; i<_cnt; i++ ) // Add in all inputs 1451 sum = (sum<<1)-(uintptr_t)in(i); // Ignore embedded NULLs 1452 return (sum>>2) + _cnt + Opcode(); 1453 } 1454 1455 //------------------------------cmp-------------------------------------------- 1456 // Compare special parts of simple Nodes 1457 bool Node::cmp( const Node &n ) const { 1458 return true; // Must be same 1459 } 1460 1461 //------------------------------rematerialize----------------------------------- 1462 // Should we clone rather than spill this instruction? 1463 bool Node::rematerialize() const { 1464 if ( is_Mach() ) 1465 return this->as_Mach()->rematerialize(); 1466 else 1467 return (_flags & Flag_rematerialize) != 0; 1468 } 1469 1470 //------------------------------needs_anti_dependence_check--------------------- 1471 // Nodes which use memory without consuming it, hence need antidependences. 1472 bool Node::needs_anti_dependence_check() const { 1473 if (req() < 2 || (_flags & Flag_needs_anti_dependence_check) == 0) { 1474 return false; 1475 } 1476 BarrierSetC2* bs = BarrierSet::barrier_set()->barrier_set_c2(); 1477 if (!bs->needs_anti_dependence_check(this)) { 1478 return false; 1479 } 1480 return in(1)->bottom_type()->has_memory(); 1481 } 1482 1483 // Get an integer constant from a ConNode (or CastIINode). 1484 // Return a default value if there is no apparent constant here. 1485 const TypeInt* Node::find_int_type() const { 1486 if (this->is_Type()) { 1487 return this->as_Type()->type()->isa_int(); 1488 } else if (this->is_Con()) { 1489 assert(is_Mach(), "should be ConNode(TypeNode) or else a MachNode"); 1490 return this->bottom_type()->isa_int(); 1491 } 1492 return NULL; 1493 } 1494 1495 // Get a pointer constant from a ConstNode. 1496 // Returns the constant if it is a pointer ConstNode 1497 intptr_t Node::get_ptr() const { 1498 assert( Opcode() == Op_ConP, "" ); 1499 return ((ConPNode*)this)->type()->is_ptr()->get_con(); 1500 } 1501 1502 // Get a narrow oop constant from a ConNNode. 1503 intptr_t Node::get_narrowcon() const { 1504 assert( Opcode() == Op_ConN, "" ); 1505 return ((ConNNode*)this)->type()->is_narrowoop()->get_con(); 1506 } 1507 1508 // Get a long constant from a ConNode. 1509 // Return a default value if there is no apparent constant here. 1510 const TypeLong* Node::find_long_type() const { 1511 if (this->is_Type()) { 1512 return this->as_Type()->type()->isa_long(); 1513 } else if (this->is_Con()) { 1514 assert(is_Mach(), "should be ConNode(TypeNode) or else a MachNode"); 1515 return this->bottom_type()->isa_long(); 1516 } 1517 return NULL; 1518 } 1519 1520 1521 /** 1522 * Return a ptr type for nodes which should have it. 1523 */ 1524 const TypePtr* Node::get_ptr_type() const { 1525 const TypePtr* tp = this->bottom_type()->make_ptr(); 1526 #ifdef ASSERT 1527 if (tp == NULL) { 1528 this->dump(1); 1529 assert((tp != NULL), "unexpected node type"); 1530 } 1531 #endif 1532 return tp; 1533 } 1534 1535 // Get a double constant from a ConstNode. 1536 // Returns the constant if it is a double ConstNode 1537 jdouble Node::getd() const { 1538 assert( Opcode() == Op_ConD, "" ); 1539 return ((ConDNode*)this)->type()->is_double_constant()->getd(); 1540 } 1541 1542 // Get a float constant from a ConstNode. 1543 // Returns the constant if it is a float ConstNode 1544 jfloat Node::getf() const { 1545 assert( Opcode() == Op_ConF, "" ); 1546 return ((ConFNode*)this)->type()->is_float_constant()->getf(); 1547 } 1548 1549 #ifndef PRODUCT 1550 1551 //------------------------------find------------------------------------------ 1552 // Find a neighbor of this Node with the given _idx 1553 // If idx is negative, find its absolute value, following both _in and _out. 1554 static void find_recur(Compile* C, Node* &result, Node *n, int idx, bool only_ctrl, 1555 VectorSet* old_space, VectorSet* new_space ) { 1556 int node_idx = (idx >= 0) ? idx : -idx; 1557 if (NotANode(n)) return; // Gracefully handle NULL, -1, 0xabababab, etc. 1558 // Contained in new_space or old_space? Check old_arena first since it's mostly empty. 1559 VectorSet *v = C->old_arena()->contains(n) ? old_space : new_space; 1560 if( v->test(n->_idx) ) return; 1561 if( (int)n->_idx == node_idx 1562 debug_only(|| n->debug_idx() == node_idx) ) { 1563 if (result != NULL) 1564 tty->print("find: " INTPTR_FORMAT " and " INTPTR_FORMAT " both have idx==%d\n", 1565 (uintptr_t)result, (uintptr_t)n, node_idx); 1566 result = n; 1567 } 1568 v->set(n->_idx); 1569 for( uint i=0; i<n->len(); i++ ) { 1570 if( only_ctrl && !(n->is_Region()) && (n->Opcode() != Op_Root) && (i != TypeFunc::Control) ) continue; 1571 find_recur(C, result, n->in(i), idx, only_ctrl, old_space, new_space ); 1572 } 1573 // Search along forward edges also: 1574 if (idx < 0 && !only_ctrl) { 1575 for( uint j=0; j<n->outcnt(); j++ ) { 1576 find_recur(C, result, n->raw_out(j), idx, only_ctrl, old_space, new_space ); 1577 } 1578 } 1579 #ifdef ASSERT 1580 // Search along debug_orig edges last, checking for cycles 1581 Node* orig = n->debug_orig(); 1582 if (orig != NULL) { 1583 do { 1584 if (NotANode(orig)) break; 1585 find_recur(C, result, orig, idx, only_ctrl, old_space, new_space ); 1586 orig = orig->debug_orig(); 1587 } while (orig != NULL && orig != n->debug_orig()); 1588 } 1589 #endif //ASSERT 1590 } 1591 1592 // call this from debugger: 1593 Node* find_node(Node* n, int idx) { 1594 return n->find(idx); 1595 } 1596 1597 //------------------------------find------------------------------------------- 1598 Node* Node::find(int idx) const { 1599 ResourceArea *area = Thread::current()->resource_area(); 1600 VectorSet old_space(area), new_space(area); 1601 Node* result = NULL; 1602 find_recur(Compile::current(), result, (Node*) this, idx, false, &old_space, &new_space ); 1603 return result; 1604 } 1605 1606 //------------------------------find_ctrl-------------------------------------- 1607 // Find an ancestor to this node in the control history with given _idx 1608 Node* Node::find_ctrl(int idx) const { 1609 ResourceArea *area = Thread::current()->resource_area(); 1610 VectorSet old_space(area), new_space(area); 1611 Node* result = NULL; 1612 find_recur(Compile::current(), result, (Node*) this, idx, true, &old_space, &new_space ); 1613 return result; 1614 } 1615 #endif 1616 1617 1618 1619 #ifndef PRODUCT 1620 1621 // -----------------------------Name------------------------------------------- 1622 extern const char *NodeClassNames[]; 1623 const char *Node::Name() const { return NodeClassNames[Opcode()]; } 1624 1625 static bool is_disconnected(const Node* n) { 1626 for (uint i = 0; i < n->req(); i++) { 1627 if (n->in(i) != NULL) return false; 1628 } 1629 return true; 1630 } 1631 1632 #ifdef ASSERT 1633 static void dump_orig(Node* orig, outputStream *st) { 1634 Compile* C = Compile::current(); 1635 if (NotANode(orig)) orig = NULL; 1636 if (orig != NULL && !C->node_arena()->contains(orig)) orig = NULL; 1637 if (orig == NULL) return; 1638 st->print(" !orig="); 1639 Node* fast = orig->debug_orig(); // tortoise & hare algorithm to detect loops 1640 if (NotANode(fast)) fast = NULL; 1641 while (orig != NULL) { 1642 bool discon = is_disconnected(orig); // if discon, print [123] else 123 1643 if (discon) st->print("["); 1644 if (!Compile::current()->node_arena()->contains(orig)) 1645 st->print("o"); 1646 st->print("%d", orig->_idx); 1647 if (discon) st->print("]"); 1648 orig = orig->debug_orig(); 1649 if (NotANode(orig)) orig = NULL; 1650 if (orig != NULL && !C->node_arena()->contains(orig)) orig = NULL; 1651 if (orig != NULL) st->print(","); 1652 if (fast != NULL) { 1653 // Step fast twice for each single step of orig: 1654 fast = fast->debug_orig(); 1655 if (NotANode(fast)) fast = NULL; 1656 if (fast != NULL && fast != orig) { 1657 fast = fast->debug_orig(); 1658 if (NotANode(fast)) fast = NULL; 1659 } 1660 if (fast == orig) { 1661 st->print("..."); 1662 break; 1663 } 1664 } 1665 } 1666 } 1667 1668 void Node::set_debug_orig(Node* orig) { 1669 _debug_orig = orig; 1670 if (BreakAtNode == 0) return; 1671 if (NotANode(orig)) orig = NULL; 1672 int trip = 10; 1673 while (orig != NULL) { 1674 if (orig->debug_idx() == BreakAtNode || (int)orig->_idx == BreakAtNode) { 1675 tty->print_cr("BreakAtNode: _idx=%d _debug_idx=%d orig._idx=%d orig._debug_idx=%d", 1676 this->_idx, this->debug_idx(), orig->_idx, orig->debug_idx()); 1677 BREAKPOINT; 1678 } 1679 orig = orig->debug_orig(); 1680 if (NotANode(orig)) orig = NULL; 1681 if (trip-- <= 0) break; 1682 } 1683 } 1684 #endif //ASSERT 1685 1686 //------------------------------dump------------------------------------------ 1687 // Dump a Node 1688 void Node::dump(const char* suffix, bool mark, outputStream *st) const { 1689 Compile* C = Compile::current(); 1690 bool is_new = C->node_arena()->contains(this); 1691 C->_in_dump_cnt++; 1692 st->print("%c%d%s\t%s\t=== ", is_new ? ' ' : 'o', _idx, mark ? " >" : "", Name()); 1693 1694 // Dump the required and precedence inputs 1695 dump_req(st); 1696 dump_prec(st); 1697 // Dump the outputs 1698 dump_out(st); 1699 1700 if (is_disconnected(this)) { 1701 #ifdef ASSERT 1702 st->print(" [%d]",debug_idx()); 1703 dump_orig(debug_orig(), st); 1704 #endif 1705 st->cr(); 1706 C->_in_dump_cnt--; 1707 return; // don't process dead nodes 1708 } 1709 1710 if (C->clone_map().value(_idx) != 0) { 1711 C->clone_map().dump(_idx); 1712 } 1713 // Dump node-specific info 1714 dump_spec(st); 1715 #ifdef ASSERT 1716 // Dump the non-reset _debug_idx 1717 if (Verbose && WizardMode) { 1718 st->print(" [%d]",debug_idx()); 1719 } 1720 #endif 1721 1722 const Type *t = bottom_type(); 1723 1724 if (t != NULL && (t->isa_instptr() || t->isa_klassptr())) { 1725 const TypeInstPtr *toop = t->isa_instptr(); 1726 const TypeKlassPtr *tkls = t->isa_klassptr(); 1727 ciKlass* klass = toop ? toop->klass() : (tkls ? tkls->klass() : NULL ); 1728 if (klass && klass->is_loaded() && klass->is_interface()) { 1729 st->print(" Interface:"); 1730 } else if (toop) { 1731 st->print(" Oop:"); 1732 } else if (tkls) { 1733 st->print(" Klass:"); 1734 } 1735 t->dump_on(st); 1736 } else if (t == Type::MEMORY) { 1737 st->print(" Memory:"); 1738 MemNode::dump_adr_type(this, adr_type(), st); 1739 } else if (Verbose || WizardMode) { 1740 st->print(" Type:"); 1741 if (t) { 1742 t->dump_on(st); 1743 } else { 1744 st->print("no type"); 1745 } 1746 } else if (t->isa_vect() && this->is_MachSpillCopy()) { 1747 // Dump MachSpillcopy vector type. 1748 t->dump_on(st); 1749 } 1750 if (is_new) { 1751 debug_only(dump_orig(debug_orig(), st)); 1752 Node_Notes* nn = C->node_notes_at(_idx); 1753 if (nn != NULL && !nn->is_clear()) { 1754 if (nn->jvms() != NULL) { 1755 st->print(" !jvms:"); 1756 nn->jvms()->dump_spec(st); 1757 } 1758 } 1759 } 1760 if (suffix) st->print("%s", suffix); 1761 C->_in_dump_cnt--; 1762 } 1763 1764 //------------------------------dump_req-------------------------------------- 1765 void Node::dump_req(outputStream *st) const { 1766 // Dump the required input edges 1767 for (uint i = 0; i < req(); i++) { // For all required inputs 1768 Node* d = in(i); 1769 if (d == NULL) { 1770 st->print("_ "); 1771 } else if (NotANode(d)) { 1772 st->print("NotANode "); // uninitialized, sentinel, garbage, etc. 1773 } else { 1774 st->print("%c%d ", Compile::current()->node_arena()->contains(d) ? ' ' : 'o', d->_idx); 1775 } 1776 } 1777 } 1778 1779 1780 //------------------------------dump_prec------------------------------------- 1781 void Node::dump_prec(outputStream *st) const { 1782 // Dump the precedence edges 1783 int any_prec = 0; 1784 for (uint i = req(); i < len(); i++) { // For all precedence inputs 1785 Node* p = in(i); 1786 if (p != NULL) { 1787 if (!any_prec++) st->print(" |"); 1788 if (NotANode(p)) { st->print("NotANode "); continue; } 1789 st->print("%c%d ", Compile::current()->node_arena()->contains(in(i)) ? ' ' : 'o', in(i)->_idx); 1790 } 1791 } 1792 } 1793 1794 //------------------------------dump_out-------------------------------------- 1795 void Node::dump_out(outputStream *st) const { 1796 // Delimit the output edges 1797 st->print(" [["); 1798 // Dump the output edges 1799 for (uint i = 0; i < _outcnt; i++) { // For all outputs 1800 Node* u = _out[i]; 1801 if (u == NULL) { 1802 st->print("_ "); 1803 } else if (NotANode(u)) { 1804 st->print("NotANode "); 1805 } else { 1806 st->print("%c%d ", Compile::current()->node_arena()->contains(u) ? ' ' : 'o', u->_idx); 1807 } 1808 } 1809 st->print("]] "); 1810 } 1811 1812 //----------------------------collect_nodes_i---------------------------------- 1813 // Collects nodes from an Ideal graph, starting from a given start node and 1814 // moving in a given direction until a certain depth (distance from the start 1815 // node) is reached. Duplicates are ignored. 1816 // Arguments: 1817 // nstack: the nodes are collected into this array. 1818 // start: the node at which to start collecting. 1819 // direction: if this is a positive number, collect input nodes; if it is 1820 // a negative number, collect output nodes. 1821 // depth: collect nodes up to this distance from the start node. 1822 // include_start: whether to include the start node in the result collection. 1823 // only_ctrl: whether to regard control edges only during traversal. 1824 // only_data: whether to regard data edges only during traversal. 1825 static void collect_nodes_i(GrowableArray<Node*> *nstack, const Node* start, int direction, uint depth, bool include_start, bool only_ctrl, bool only_data) { 1826 Node* s = (Node*) start; // remove const 1827 nstack->append(s); 1828 int begin = 0; 1829 int end = 0; 1830 for(uint i = 0; i < depth; i++) { 1831 end = nstack->length(); 1832 for(int j = begin; j < end; j++) { 1833 Node* tp = nstack->at(j); 1834 uint limit = direction > 0 ? tp->len() : tp->outcnt(); 1835 for(uint k = 0; k < limit; k++) { 1836 Node* n = direction > 0 ? tp->in(k) : tp->raw_out(k); 1837 1838 if (NotANode(n)) continue; 1839 // do not recurse through top or the root (would reach unrelated stuff) 1840 if (n->is_Root() || n->is_top()) continue; 1841 if (only_ctrl && !n->is_CFG()) continue; 1842 if (only_data && n->is_CFG()) continue; 1843 1844 bool on_stack = nstack->contains(n); 1845 if (!on_stack) { 1846 nstack->append(n); 1847 } 1848 } 1849 } 1850 begin = end; 1851 } 1852 if (!include_start) { 1853 nstack->remove(s); 1854 } 1855 } 1856 1857 //------------------------------dump_nodes------------------------------------- 1858 static void dump_nodes(const Node* start, int d, bool only_ctrl) { 1859 if (NotANode(start)) return; 1860 1861 GrowableArray <Node *> nstack(Compile::current()->live_nodes()); 1862 collect_nodes_i(&nstack, start, d, (uint) ABS(d), true, only_ctrl, false); 1863 1864 int end = nstack.length(); 1865 if (d > 0) { 1866 for(int j = end-1; j >= 0; j--) { 1867 nstack.at(j)->dump(); 1868 } 1869 } else { 1870 for(int j = 0; j < end; j++) { 1871 nstack.at(j)->dump(); 1872 } 1873 } 1874 } 1875 1876 //------------------------------dump------------------------------------------- 1877 void Node::dump(int d) const { 1878 dump_nodes(this, d, false); 1879 } 1880 1881 //------------------------------dump_ctrl-------------------------------------- 1882 // Dump a Node's control history to depth 1883 void Node::dump_ctrl(int d) const { 1884 dump_nodes(this, d, true); 1885 } 1886 1887 //-----------------------------dump_compact------------------------------------ 1888 void Node::dump_comp() const { 1889 this->dump_comp("\n"); 1890 } 1891 1892 //-----------------------------dump_compact------------------------------------ 1893 // Dump a Node in compact representation, i.e., just print its name and index. 1894 // Nodes can specify additional specifics to print in compact representation by 1895 // implementing dump_compact_spec. 1896 void Node::dump_comp(const char* suffix, outputStream *st) const { 1897 Compile* C = Compile::current(); 1898 C->_in_dump_cnt++; 1899 st->print("%s(%d)", Name(), _idx); 1900 this->dump_compact_spec(st); 1901 if (suffix) { 1902 st->print("%s", suffix); 1903 } 1904 C->_in_dump_cnt--; 1905 } 1906 1907 //----------------------------dump_related------------------------------------- 1908 // Dump a Node's related nodes - the notion of "related" depends on the Node at 1909 // hand and is determined by the implementation of the virtual method rel. 1910 void Node::dump_related() const { 1911 Compile* C = Compile::current(); 1912 GrowableArray <Node *> in_rel(C->unique()); 1913 GrowableArray <Node *> out_rel(C->unique()); 1914 this->related(&in_rel, &out_rel, false); 1915 for (int i = in_rel.length() - 1; i >= 0; i--) { 1916 in_rel.at(i)->dump(); 1917 } 1918 this->dump("\n", true); 1919 for (int i = 0; i < out_rel.length(); i++) { 1920 out_rel.at(i)->dump(); 1921 } 1922 } 1923 1924 //----------------------------dump_related------------------------------------- 1925 // Dump a Node's related nodes up to a given depth (distance from the start 1926 // node). 1927 // Arguments: 1928 // d_in: depth for input nodes. 1929 // d_out: depth for output nodes (note: this also is a positive number). 1930 void Node::dump_related(uint d_in, uint d_out) const { 1931 Compile* C = Compile::current(); 1932 GrowableArray <Node *> in_rel(C->unique()); 1933 GrowableArray <Node *> out_rel(C->unique()); 1934 1935 // call collect_nodes_i directly 1936 collect_nodes_i(&in_rel, this, 1, d_in, false, false, false); 1937 collect_nodes_i(&out_rel, this, -1, d_out, false, false, false); 1938 1939 for (int i = in_rel.length() - 1; i >= 0; i--) { 1940 in_rel.at(i)->dump(); 1941 } 1942 this->dump("\n", true); 1943 for (int i = 0; i < out_rel.length(); i++) { 1944 out_rel.at(i)->dump(); 1945 } 1946 } 1947 1948 //------------------------dump_related_compact--------------------------------- 1949 // Dump a Node's related nodes in compact representation. The notion of 1950 // "related" depends on the Node at hand and is determined by the implementation 1951 // of the virtual method rel. 1952 void Node::dump_related_compact() const { 1953 Compile* C = Compile::current(); 1954 GrowableArray <Node *> in_rel(C->unique()); 1955 GrowableArray <Node *> out_rel(C->unique()); 1956 this->related(&in_rel, &out_rel, true); 1957 int n_in = in_rel.length(); 1958 int n_out = out_rel.length(); 1959 1960 this->dump_comp(n_in == 0 ? "\n" : " "); 1961 for (int i = 0; i < n_in; i++) { 1962 in_rel.at(i)->dump_comp(i == n_in - 1 ? "\n" : " "); 1963 } 1964 for (int i = 0; i < n_out; i++) { 1965 out_rel.at(i)->dump_comp(i == n_out - 1 ? "\n" : " "); 1966 } 1967 } 1968 1969 //------------------------------related---------------------------------------- 1970 // Collect a Node's related nodes. The default behaviour just collects the 1971 // inputs and outputs at depth 1, including both control and data flow edges, 1972 // regardless of whether the presentation is compact or not. For data nodes, 1973 // the default is to collect all data inputs (till level 1 if compact), and 1974 // outputs till level 1. 1975 void Node::related(GrowableArray<Node*> *in_rel, GrowableArray<Node*> *out_rel, bool compact) const { 1976 if (this->is_CFG()) { 1977 collect_nodes_i(in_rel, this, 1, 1, false, false, false); 1978 collect_nodes_i(out_rel, this, -1, 1, false, false, false); 1979 } else { 1980 if (compact) { 1981 this->collect_nodes(in_rel, 1, false, true); 1982 } else { 1983 this->collect_nodes_in_all_data(in_rel, false); 1984 } 1985 this->collect_nodes(out_rel, -1, false, false); 1986 } 1987 } 1988 1989 //---------------------------collect_nodes------------------------------------- 1990 // An entry point to the low-level node collection facility, to start from a 1991 // given node in the graph. The start node is by default not included in the 1992 // result. 1993 // Arguments: 1994 // ns: collect the nodes into this data structure. 1995 // d: the depth (distance from start node) to which nodes should be 1996 // collected. A value >0 indicates input nodes, a value <0, output 1997 // nodes. 1998 // ctrl: include only control nodes. 1999 // data: include only data nodes. 2000 void Node::collect_nodes(GrowableArray<Node*> *ns, int d, bool ctrl, bool data) const { 2001 if (ctrl && data) { 2002 // ignore nonsensical combination 2003 return; 2004 } 2005 collect_nodes_i(ns, this, d, (uint) ABS(d), false, ctrl, data); 2006 } 2007 2008 //--------------------------collect_nodes_in----------------------------------- 2009 static void collect_nodes_in(Node* start, GrowableArray<Node*> *ns, bool primary_is_data, bool collect_secondary) { 2010 // The maximum depth is determined using a BFS that visits all primary (data 2011 // or control) inputs and increments the depth at each level. 2012 uint d_in = 0; 2013 GrowableArray<Node*> nodes(Compile::current()->unique()); 2014 nodes.push(start); 2015 int nodes_at_current_level = 1; 2016 int n_idx = 0; 2017 while (nodes_at_current_level > 0) { 2018 // Add all primary inputs reachable from the current level to the list, and 2019 // increase the depth if there were any. 2020 int nodes_at_next_level = 0; 2021 bool nodes_added = false; 2022 while (nodes_at_current_level > 0) { 2023 nodes_at_current_level--; 2024 Node* current = nodes.at(n_idx++); 2025 for (uint i = 0; i < current->len(); i++) { 2026 Node* n = current->in(i); 2027 if (NotANode(n)) { 2028 continue; 2029 } 2030 if ((primary_is_data && n->is_CFG()) || (!primary_is_data && !n->is_CFG())) { 2031 continue; 2032 } 2033 if (!nodes.contains(n)) { 2034 nodes.push(n); 2035 nodes_added = true; 2036 nodes_at_next_level++; 2037 } 2038 } 2039 } 2040 if (nodes_added) { 2041 d_in++; 2042 } 2043 nodes_at_current_level = nodes_at_next_level; 2044 } 2045 start->collect_nodes(ns, d_in, !primary_is_data, primary_is_data); 2046 if (collect_secondary) { 2047 // Now, iterate over the secondary nodes in ns and add the respective 2048 // boundary reachable from them. 2049 GrowableArray<Node*> sns(Compile::current()->unique()); 2050 for (GrowableArrayIterator<Node*> it = ns->begin(); it != ns->end(); ++it) { 2051 Node* n = *it; 2052 n->collect_nodes(&sns, 1, primary_is_data, !primary_is_data); 2053 for (GrowableArrayIterator<Node*> d = sns.begin(); d != sns.end(); ++d) { 2054 ns->append_if_missing(*d); 2055 } 2056 sns.clear(); 2057 } 2058 } 2059 } 2060 2061 //---------------------collect_nodes_in_all_data------------------------------- 2062 // Collect the entire data input graph. Include the control boundary if 2063 // requested. 2064 // Arguments: 2065 // ns: collect the nodes into this data structure. 2066 // ctrl: if true, include the control boundary. 2067 void Node::collect_nodes_in_all_data(GrowableArray<Node*> *ns, bool ctrl) const { 2068 collect_nodes_in((Node*) this, ns, true, ctrl); 2069 } 2070 2071 //--------------------------collect_nodes_in_all_ctrl-------------------------- 2072 // Collect the entire control input graph. Include the data boundary if 2073 // requested. 2074 // ns: collect the nodes into this data structure. 2075 // data: if true, include the control boundary. 2076 void Node::collect_nodes_in_all_ctrl(GrowableArray<Node*> *ns, bool data) const { 2077 collect_nodes_in((Node*) this, ns, false, data); 2078 } 2079 2080 //------------------collect_nodes_out_all_ctrl_boundary------------------------ 2081 // Collect the entire output graph until hitting control node boundaries, and 2082 // include those. 2083 void Node::collect_nodes_out_all_ctrl_boundary(GrowableArray<Node*> *ns) const { 2084 // Perform a BFS and stop at control nodes. 2085 GrowableArray<Node*> nodes(Compile::current()->unique()); 2086 nodes.push((Node*) this); 2087 while (nodes.length() > 0) { 2088 Node* current = nodes.pop(); 2089 if (NotANode(current)) { 2090 continue; 2091 } 2092 ns->append_if_missing(current); 2093 if (!current->is_CFG()) { 2094 for (DUIterator i = current->outs(); current->has_out(i); i++) { 2095 nodes.push(current->out(i)); 2096 } 2097 } 2098 } 2099 ns->remove((Node*) this); 2100 } 2101 2102 // VERIFICATION CODE 2103 // For each input edge to a node (ie - for each Use-Def edge), verify that 2104 // there is a corresponding Def-Use edge. 2105 //------------------------------verify_edges----------------------------------- 2106 void Node::verify_edges(Unique_Node_List &visited) { 2107 uint i, j, idx; 2108 int cnt; 2109 Node *n; 2110 2111 // Recursive termination test 2112 if (visited.member(this)) return; 2113 visited.push(this); 2114 2115 // Walk over all input edges, checking for correspondence 2116 for( i = 0; i < len(); i++ ) { 2117 n = in(i); 2118 if (n != NULL && !n->is_top()) { 2119 // Count instances of (Node *)this 2120 cnt = 0; 2121 for (idx = 0; idx < n->_outcnt; idx++ ) { 2122 if (n->_out[idx] == (Node *)this) cnt++; 2123 } 2124 assert( cnt > 0,"Failed to find Def-Use edge." ); 2125 // Check for duplicate edges 2126 // walk the input array downcounting the input edges to n 2127 for( j = 0; j < len(); j++ ) { 2128 if( in(j) == n ) cnt--; 2129 } 2130 assert( cnt == 0,"Mismatched edge count."); 2131 } else if (n == NULL) { 2132 assert(i >= req() || i == 0 || is_Region() || is_Phi(), "only regions or phis have null data edges"); 2133 } else { 2134 assert(n->is_top(), "sanity"); 2135 // Nothing to check. 2136 } 2137 } 2138 // Recursive walk over all input edges 2139 for( i = 0; i < len(); i++ ) { 2140 n = in(i); 2141 if( n != NULL ) 2142 in(i)->verify_edges(visited); 2143 } 2144 } 2145 2146 //------------------------------verify_recur----------------------------------- 2147 static const Node *unique_top = NULL; 2148 2149 void Node::verify_recur(const Node *n, int verify_depth, 2150 VectorSet &old_space, VectorSet &new_space) { 2151 if ( verify_depth == 0 ) return; 2152 if (verify_depth > 0) --verify_depth; 2153 2154 Compile* C = Compile::current(); 2155 2156 // Contained in new_space or old_space? 2157 VectorSet *v = C->node_arena()->contains(n) ? &new_space : &old_space; 2158 // Check for visited in the proper space. Numberings are not unique 2159 // across spaces so we need a separate VectorSet for each space. 2160 if( v->test_set(n->_idx) ) return; 2161 2162 if (n->is_Con() && n->bottom_type() == Type::TOP) { 2163 if (C->cached_top_node() == NULL) 2164 C->set_cached_top_node((Node*)n); 2165 assert(C->cached_top_node() == n, "TOP node must be unique"); 2166 } 2167 2168 for( uint i = 0; i < n->len(); i++ ) { 2169 Node *x = n->in(i); 2170 if (!x || x->is_top()) continue; 2171 2172 // Verify my input has a def-use edge to me 2173 if (true /*VerifyDefUse*/) { 2174 // Count use-def edges from n to x 2175 int cnt = 0; 2176 for( uint j = 0; j < n->len(); j++ ) 2177 if( n->in(j) == x ) 2178 cnt++; 2179 // Count def-use edges from x to n 2180 uint max = x->_outcnt; 2181 for( uint k = 0; k < max; k++ ) 2182 if (x->_out[k] == n) 2183 cnt--; 2184 assert( cnt == 0, "mismatched def-use edge counts" ); 2185 } 2186 2187 verify_recur(x, verify_depth, old_space, new_space); 2188 } 2189 2190 } 2191 2192 //------------------------------verify----------------------------------------- 2193 // Check Def-Use info for my subgraph 2194 void Node::verify() const { 2195 Compile* C = Compile::current(); 2196 Node* old_top = C->cached_top_node(); 2197 ResourceMark rm; 2198 ResourceArea *area = Thread::current()->resource_area(); 2199 VectorSet old_space(area), new_space(area); 2200 verify_recur(this, -1, old_space, new_space); 2201 C->set_cached_top_node(old_top); 2202 } 2203 #endif 2204 2205 2206 //------------------------------walk------------------------------------------- 2207 // Graph walk, with both pre-order and post-order functions 2208 void Node::walk(NFunc pre, NFunc post, void *env) { 2209 VectorSet visited(Thread::current()->resource_area()); // Setup for local walk 2210 walk_(pre, post, env, visited); 2211 } 2212 2213 void Node::walk_(NFunc pre, NFunc post, void *env, VectorSet &visited) { 2214 if( visited.test_set(_idx) ) return; 2215 pre(*this,env); // Call the pre-order walk function 2216 for( uint i=0; i<_max; i++ ) 2217 if( in(i) ) // Input exists and is not walked? 2218 in(i)->walk_(pre,post,env,visited); // Walk it with pre & post functions 2219 post(*this,env); // Call the post-order walk function 2220 } 2221 2222 void Node::nop(Node &, void*) {} 2223 2224 //------------------------------Registers-------------------------------------- 2225 // Do we Match on this edge index or not? Generally false for Control 2226 // and true for everything else. Weird for calls & returns. 2227 uint Node::match_edge(uint idx) const { 2228 return idx; // True for other than index 0 (control) 2229 } 2230 2231 static RegMask _not_used_at_all; 2232 // Register classes are defined for specific machines 2233 const RegMask &Node::out_RegMask() const { 2234 ShouldNotCallThis(); 2235 return _not_used_at_all; 2236 } 2237 2238 const RegMask &Node::in_RegMask(uint) const { 2239 ShouldNotCallThis(); 2240 return _not_used_at_all; 2241 } 2242 2243 //============================================================================= 2244 //----------------------------------------------------------------------------- 2245 void Node_Array::reset( Arena *new_arena ) { 2246 _a->Afree(_nodes,_max*sizeof(Node*)); 2247 _max = 0; 2248 _nodes = NULL; 2249 _a = new_arena; 2250 } 2251 2252 //------------------------------clear------------------------------------------ 2253 // Clear all entries in _nodes to NULL but keep storage 2254 void Node_Array::clear() { 2255 Copy::zero_to_bytes( _nodes, _max*sizeof(Node*) ); 2256 } 2257 2258 //----------------------------------------------------------------------------- 2259 void Node_Array::grow( uint i ) { 2260 if( !_max ) { 2261 _max = 1; 2262 _nodes = (Node**)_a->Amalloc( _max * sizeof(Node*) ); 2263 _nodes[0] = NULL; 2264 } 2265 uint old = _max; 2266 while( i >= _max ) _max <<= 1; // Double to fit 2267 _nodes = (Node**)_a->Arealloc( _nodes, old*sizeof(Node*),_max*sizeof(Node*)); 2268 Copy::zero_to_bytes( &_nodes[old], (_max-old)*sizeof(Node*) ); 2269 } 2270 2271 //----------------------------------------------------------------------------- 2272 void Node_Array::insert( uint i, Node *n ) { 2273 if( _nodes[_max-1] ) grow(_max); // Get more space if full 2274 Copy::conjoint_words_to_higher((HeapWord*)&_nodes[i], (HeapWord*)&_nodes[i+1], ((_max-i-1)*sizeof(Node*))); 2275 _nodes[i] = n; 2276 } 2277 2278 //----------------------------------------------------------------------------- 2279 void Node_Array::remove( uint i ) { 2280 Copy::conjoint_words_to_lower((HeapWord*)&_nodes[i+1], (HeapWord*)&_nodes[i], ((_max-i-1)*sizeof(Node*))); 2281 _nodes[_max-1] = NULL; 2282 } 2283 2284 //----------------------------------------------------------------------------- 2285 void Node_Array::sort( C_sort_func_t func) { 2286 qsort( _nodes, _max, sizeof( Node* ), func ); 2287 } 2288 2289 //----------------------------------------------------------------------------- 2290 void Node_Array::dump() const { 2291 #ifndef PRODUCT 2292 for( uint i = 0; i < _max; i++ ) { 2293 Node *nn = _nodes[i]; 2294 if( nn != NULL ) { 2295 tty->print("%5d--> ",i); nn->dump(); 2296 } 2297 } 2298 #endif 2299 } 2300 2301 //--------------------------is_iteratively_computed------------------------------ 2302 // Operation appears to be iteratively computed (such as an induction variable) 2303 // It is possible for this operation to return false for a loop-varying 2304 // value, if it appears (by local graph inspection) to be computed by a simple conditional. 2305 bool Node::is_iteratively_computed() { 2306 if (ideal_reg()) { // does operation have a result register? 2307 for (uint i = 1; i < req(); i++) { 2308 Node* n = in(i); 2309 if (n != NULL && n->is_Phi()) { 2310 for (uint j = 1; j < n->req(); j++) { 2311 if (n->in(j) == this) { 2312 return true; 2313 } 2314 } 2315 } 2316 } 2317 } 2318 return false; 2319 } 2320 2321 //--------------------------find_similar------------------------------ 2322 // Return a node with opcode "opc" and same inputs as "this" if one can 2323 // be found; Otherwise return NULL; 2324 Node* Node::find_similar(int opc) { 2325 if (req() >= 2) { 2326 Node* def = in(1); 2327 if (def && def->outcnt() >= 2) { 2328 for (DUIterator_Fast dmax, i = def->fast_outs(dmax); i < dmax; i++) { 2329 Node* use = def->fast_out(i); 2330 if (use != this && 2331 use->Opcode() == opc && 2332 use->req() == req()) { 2333 uint j; 2334 for (j = 0; j < use->req(); j++) { 2335 if (use->in(j) != in(j)) { 2336 break; 2337 } 2338 } 2339 if (j == use->req()) { 2340 return use; 2341 } 2342 } 2343 } 2344 } 2345 } 2346 return NULL; 2347 } 2348 2349 2350 //--------------------------unique_ctrl_out------------------------------ 2351 // Return the unique control out if only one. Null if none or more than one. 2352 Node* Node::unique_ctrl_out() const { 2353 Node* found = NULL; 2354 for (uint i = 0; i < outcnt(); i++) { 2355 Node* use = raw_out(i); 2356 if (use->is_CFG() && use != this) { 2357 if (found != NULL) return NULL; 2358 found = use; 2359 } 2360 } 2361 return found; 2362 } 2363 2364 void Node::ensure_control_or_add_prec(Node* c) { 2365 if (in(0) == NULL) { 2366 set_req(0, c); 2367 } else if (in(0) != c) { 2368 add_prec(c); 2369 } 2370 } 2371 2372 //============================================================================= 2373 //------------------------------yank------------------------------------------- 2374 // Find and remove 2375 void Node_List::yank( Node *n ) { 2376 uint i; 2377 for( i = 0; i < _cnt; i++ ) 2378 if( _nodes[i] == n ) 2379 break; 2380 2381 if( i < _cnt ) 2382 _nodes[i] = _nodes[--_cnt]; 2383 } 2384 2385 //------------------------------dump------------------------------------------- 2386 void Node_List::dump() const { 2387 #ifndef PRODUCT 2388 for( uint i = 0; i < _cnt; i++ ) 2389 if( _nodes[i] ) { 2390 tty->print("%5d--> ",i); 2391 _nodes[i]->dump(); 2392 } 2393 #endif 2394 } 2395 2396 void Node_List::dump_simple() const { 2397 #ifndef PRODUCT 2398 for( uint i = 0; i < _cnt; i++ ) 2399 if( _nodes[i] ) { 2400 tty->print(" %d", _nodes[i]->_idx); 2401 } else { 2402 tty->print(" NULL"); 2403 } 2404 #endif 2405 } 2406 2407 //============================================================================= 2408 //------------------------------remove----------------------------------------- 2409 void Unique_Node_List::remove( Node *n ) { 2410 if( _in_worklist[n->_idx] ) { 2411 for( uint i = 0; i < size(); i++ ) 2412 if( _nodes[i] == n ) { 2413 map(i,Node_List::pop()); 2414 _in_worklist >>= n->_idx; 2415 return; 2416 } 2417 ShouldNotReachHere(); 2418 } 2419 } 2420 2421 //-----------------------remove_useless_nodes---------------------------------- 2422 // Remove useless nodes from worklist 2423 void Unique_Node_List::remove_useless_nodes(VectorSet &useful) { 2424 2425 for( uint i = 0; i < size(); ++i ) { 2426 Node *n = at(i); 2427 assert( n != NULL, "Did not expect null entries in worklist"); 2428 if( ! useful.test(n->_idx) ) { 2429 _in_worklist >>= n->_idx; 2430 map(i,Node_List::pop()); 2431 // Node *replacement = Node_List::pop(); 2432 // if( i != size() ) { // Check if removing last entry 2433 // _nodes[i] = replacement; 2434 // } 2435 --i; // Visit popped node 2436 // If it was last entry, loop terminates since size() was also reduced 2437 } 2438 } 2439 } 2440 2441 //============================================================================= 2442 void Node_Stack::grow() { 2443 size_t old_top = pointer_delta(_inode_top,_inodes,sizeof(INode)); // save _top 2444 size_t old_max = pointer_delta(_inode_max,_inodes,sizeof(INode)); 2445 size_t max = old_max << 1; // max * 2 2446 _inodes = REALLOC_ARENA_ARRAY(_a, INode, _inodes, old_max, max); 2447 _inode_max = _inodes + max; 2448 _inode_top = _inodes + old_top; // restore _top 2449 } 2450 2451 // Node_Stack is used to map nodes. 2452 Node* Node_Stack::find(uint idx) const { 2453 uint sz = size(); 2454 for (uint i=0; i < sz; i++) { 2455 if (idx == index_at(i) ) 2456 return node_at(i); 2457 } 2458 return NULL; 2459 } 2460 2461 //============================================================================= 2462 uint TypeNode::size_of() const { return sizeof(*this); } 2463 #ifndef PRODUCT 2464 void TypeNode::dump_spec(outputStream *st) const { 2465 if( !Verbose && !WizardMode ) { 2466 // standard dump does this in Verbose and WizardMode 2467 st->print(" #"); _type->dump_on(st); 2468 } 2469 } 2470 2471 void TypeNode::dump_compact_spec(outputStream *st) const { 2472 st->print("#"); 2473 _type->dump_on(st); 2474 } 2475 #endif 2476 uint TypeNode::hash() const { 2477 return Node::hash() + _type->hash(); 2478 } 2479 bool TypeNode::cmp( const Node &n ) const 2480 { return !Type::cmp( _type, ((TypeNode&)n)._type ); } 2481 const Type *TypeNode::bottom_type() const { return _type; } 2482 const Type* TypeNode::Value(PhaseGVN* phase) const { return _type; } 2483 2484 //------------------------------ideal_reg-------------------------------------- 2485 uint TypeNode::ideal_reg() const { 2486 return _type->ideal_reg(); 2487 }