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