1 /* 2 * Copyright (c) 1997, 2014, Oracle and/or its affiliates. All rights reserved. 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 4 * 5 * This code is free software; you can redistribute it and/or modify it 6 * under the terms of the GNU General Public License version 2 only, as 7 * published by the Free Software Foundation. 8 * 9 * This code is distributed in the hope that it will be useful, but WITHOUT 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 12 * version 2 for more details (a copy is included in the LICENSE file that 13 * accompanied this code). 14 * 15 * You should have received a copy of the GNU General Public License version 16 * 2 along with this work; if not, write to the Free Software Foundation, 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 18 * 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 20 * or visit www.oracle.com if you need additional information or have any 21 * questions. 22 * 23 */ 24 25 #include "precompiled.hpp" 26 #include "memory/allocation.inline.hpp" 27 #include "opto/block.hpp" 28 #include "opto/callnode.hpp" 29 #include "opto/cfgnode.hpp" 30 #include "opto/idealGraphPrinter.hpp" 31 #include "opto/loopnode.hpp" 32 #include "opto/machnode.hpp" 33 #include "opto/opcodes.hpp" 34 #include "opto/phaseX.hpp" 35 #include "opto/regalloc.hpp" 36 #include "opto/rootnode.hpp" 37 38 //============================================================================= 39 #define NODE_HASH_MINIMUM_SIZE 255 40 //------------------------------NodeHash--------------------------------------- 41 NodeHash::NodeHash(uint est_max_size) : 42 _max( round_up(est_max_size < NODE_HASH_MINIMUM_SIZE ? NODE_HASH_MINIMUM_SIZE : est_max_size) ), 43 _a(Thread::current()->resource_area()), 44 _table( NEW_ARENA_ARRAY( _a , Node* , _max ) ), // (Node**)_a->Amalloc(_max * sizeof(Node*)) ), 45 _inserts(0), _insert_limit( insert_limit() ) 46 #ifndef PRODUCT 47 ,_look_probes(0), _lookup_hits(0), _lookup_misses(0), 48 _delete_probes(0), _delete_hits(0), _delete_misses(0), 49 _total_insert_probes(0), _total_inserts(0), 50 _insert_probes(0), _grows(0) 51 #endif 52 { 53 // _sentinel must be in the current node space 54 _sentinel = new ProjNode(NULL, TypeFunc::Control); 55 memset(_table,0,sizeof(Node*)*_max); 56 } 57 58 //------------------------------NodeHash--------------------------------------- 59 NodeHash::NodeHash(Arena *arena, uint est_max_size) : 60 _max( round_up(est_max_size < NODE_HASH_MINIMUM_SIZE ? NODE_HASH_MINIMUM_SIZE : est_max_size) ), 61 _a(arena), 62 _table( NEW_ARENA_ARRAY( _a , Node* , _max ) ), 63 _inserts(0), _insert_limit( insert_limit() ) 64 #ifndef PRODUCT 65 ,_look_probes(0), _lookup_hits(0), _lookup_misses(0), 66 _delete_probes(0), _delete_hits(0), _delete_misses(0), 67 _total_insert_probes(0), _total_inserts(0), 68 _insert_probes(0), _grows(0) 69 #endif 70 { 71 // _sentinel must be in the current node space 72 _sentinel = new ProjNode(NULL, TypeFunc::Control); 73 memset(_table,0,sizeof(Node*)*_max); 74 } 75 76 //------------------------------NodeHash--------------------------------------- 77 NodeHash::NodeHash(NodeHash *nh) { 78 debug_only(_table = (Node**)badAddress); // interact correctly w/ operator= 79 // just copy in all the fields 80 *this = *nh; 81 // nh->_sentinel must be in the current node space 82 } 83 84 void NodeHash::replace_with(NodeHash *nh) { 85 debug_only(_table = (Node**)badAddress); // interact correctly w/ operator= 86 // just copy in all the fields 87 *this = *nh; 88 // nh->_sentinel must be in the current node space 89 } 90 91 //------------------------------hash_find-------------------------------------- 92 // Find in hash table 93 Node *NodeHash::hash_find( const Node *n ) { 94 // ((Node*)n)->set_hash( n->hash() ); 95 uint hash = n->hash(); 96 if (hash == Node::NO_HASH) { 97 NOT_PRODUCT( _lookup_misses++ ); 98 return NULL; 99 } 100 uint key = hash & (_max-1); 101 uint stride = key | 0x01; 102 NOT_PRODUCT( _look_probes++ ); 103 Node *k = _table[key]; // Get hashed value 104 if( !k ) { // ?Miss? 105 NOT_PRODUCT( _lookup_misses++ ); 106 return NULL; // Miss! 107 } 108 109 int op = n->Opcode(); 110 uint req = n->req(); 111 while( 1 ) { // While probing hash table 112 if( k->req() == req && // Same count of inputs 113 k->Opcode() == op ) { // Same Opcode 114 for( uint i=0; i<req; i++ ) 115 if( n->in(i)!=k->in(i)) // Different inputs? 116 goto collision; // "goto" is a speed hack... 117 if( n->cmp(*k) ) { // Check for any special bits 118 NOT_PRODUCT( _lookup_hits++ ); 119 return k; // Hit! 120 } 121 } 122 collision: 123 NOT_PRODUCT( _look_probes++ ); 124 key = (key + stride/*7*/) & (_max-1); // Stride through table with relative prime 125 k = _table[key]; // Get hashed value 126 if( !k ) { // ?Miss? 127 NOT_PRODUCT( _lookup_misses++ ); 128 return NULL; // Miss! 129 } 130 } 131 ShouldNotReachHere(); 132 return NULL; 133 } 134 135 //------------------------------hash_find_insert------------------------------- 136 // Find in hash table, insert if not already present 137 // Used to preserve unique entries in hash table 138 Node *NodeHash::hash_find_insert( Node *n ) { 139 // n->set_hash( ); 140 uint hash = n->hash(); 141 if (hash == Node::NO_HASH) { 142 NOT_PRODUCT( _lookup_misses++ ); 143 return NULL; 144 } 145 uint key = hash & (_max-1); 146 uint stride = key | 0x01; // stride must be relatively prime to table siz 147 uint first_sentinel = 0; // replace a sentinel if seen. 148 NOT_PRODUCT( _look_probes++ ); 149 Node *k = _table[key]; // Get hashed value 150 if( !k ) { // ?Miss? 151 NOT_PRODUCT( _lookup_misses++ ); 152 _table[key] = n; // Insert into table! 153 debug_only(n->enter_hash_lock()); // Lock down the node while in the table. 154 check_grow(); // Grow table if insert hit limit 155 return NULL; // Miss! 156 } 157 else if( k == _sentinel ) { 158 first_sentinel = key; // Can insert here 159 } 160 161 int op = n->Opcode(); 162 uint req = n->req(); 163 while( 1 ) { // While probing hash table 164 if( k->req() == req && // Same count of inputs 165 k->Opcode() == op ) { // Same Opcode 166 for( uint i=0; i<req; i++ ) 167 if( n->in(i)!=k->in(i)) // Different inputs? 168 goto collision; // "goto" is a speed hack... 169 if( n->cmp(*k) ) { // Check for any special bits 170 NOT_PRODUCT( _lookup_hits++ ); 171 return k; // Hit! 172 } 173 } 174 collision: 175 NOT_PRODUCT( _look_probes++ ); 176 key = (key + stride) & (_max-1); // Stride through table w/ relative prime 177 k = _table[key]; // Get hashed value 178 if( !k ) { // ?Miss? 179 NOT_PRODUCT( _lookup_misses++ ); 180 key = (first_sentinel == 0) ? key : first_sentinel; // ?saw sentinel? 181 _table[key] = n; // Insert into table! 182 debug_only(n->enter_hash_lock()); // Lock down the node while in the table. 183 check_grow(); // Grow table if insert hit limit 184 return NULL; // Miss! 185 } 186 else if( first_sentinel == 0 && k == _sentinel ) { 187 first_sentinel = key; // Can insert here 188 } 189 190 } 191 ShouldNotReachHere(); 192 return NULL; 193 } 194 195 //------------------------------hash_insert------------------------------------ 196 // Insert into hash table 197 void NodeHash::hash_insert( Node *n ) { 198 // // "conflict" comments -- print nodes that conflict 199 // bool conflict = false; 200 // n->set_hash(); 201 uint hash = n->hash(); 202 if (hash == Node::NO_HASH) { 203 return; 204 } 205 check_grow(); 206 uint key = hash & (_max-1); 207 uint stride = key | 0x01; 208 209 while( 1 ) { // While probing hash table 210 NOT_PRODUCT( _insert_probes++ ); 211 Node *k = _table[key]; // Get hashed value 212 if( !k || (k == _sentinel) ) break; // Found a slot 213 assert( k != n, "already inserted" ); 214 // if( PrintCompilation && PrintOptoStatistics && Verbose ) { tty->print(" conflict: "); k->dump(); conflict = true; } 215 key = (key + stride) & (_max-1); // Stride through table w/ relative prime 216 } 217 _table[key] = n; // Insert into table! 218 debug_only(n->enter_hash_lock()); // Lock down the node while in the table. 219 // if( conflict ) { n->dump(); } 220 } 221 222 //------------------------------hash_delete------------------------------------ 223 // Replace in hash table with sentinel 224 bool NodeHash::hash_delete( const Node *n ) { 225 Node *k; 226 uint hash = n->hash(); 227 if (hash == Node::NO_HASH) { 228 NOT_PRODUCT( _delete_misses++ ); 229 return false; 230 } 231 uint key = hash & (_max-1); 232 uint stride = key | 0x01; 233 debug_only( uint counter = 0; ); 234 for( ; /* (k != NULL) && (k != _sentinel) */; ) { 235 debug_only( counter++ ); 236 NOT_PRODUCT( _delete_probes++ ); 237 k = _table[key]; // Get hashed value 238 if( !k ) { // Miss? 239 NOT_PRODUCT( _delete_misses++ ); 240 #ifdef ASSERT 241 if( VerifyOpto ) { 242 for( uint i=0; i < _max; i++ ) 243 assert( _table[i] != n, "changed edges with rehashing" ); 244 } 245 #endif 246 return false; // Miss! Not in chain 247 } 248 else if( n == k ) { 249 NOT_PRODUCT( _delete_hits++ ); 250 _table[key] = _sentinel; // Hit! Label as deleted entry 251 debug_only(((Node*)n)->exit_hash_lock()); // Unlock the node upon removal from table. 252 return true; 253 } 254 else { 255 // collision: move through table with prime offset 256 key = (key + stride/*7*/) & (_max-1); 257 assert( counter <= _insert_limit, "Cycle in hash-table"); 258 } 259 } 260 ShouldNotReachHere(); 261 return false; 262 } 263 264 //------------------------------round_up--------------------------------------- 265 // Round up to nearest power of 2 266 uint NodeHash::round_up( uint x ) { 267 x += (x>>2); // Add 25% slop 268 if( x <16 ) return 16; // Small stuff 269 uint i=16; 270 while( i < x ) i <<= 1; // Double to fit 271 return i; // Return hash table size 272 } 273 274 //------------------------------grow------------------------------------------- 275 // Grow _table to next power of 2 and insert old entries 276 void NodeHash::grow() { 277 // Record old state 278 uint old_max = _max; 279 Node **old_table = _table; 280 // Construct new table with twice the space 281 #ifndef PRODUCT 282 _grows++; 283 _total_inserts += _inserts; 284 _total_insert_probes += _insert_probes; 285 _insert_probes = 0; 286 #endif 287 _inserts = 0; 288 _max = _max << 1; 289 _table = NEW_ARENA_ARRAY( _a , Node* , _max ); // (Node**)_a->Amalloc( _max * sizeof(Node*) ); 290 memset(_table,0,sizeof(Node*)*_max); 291 _insert_limit = insert_limit(); 292 // Insert old entries into the new table 293 for( uint i = 0; i < old_max; i++ ) { 294 Node *m = *old_table++; 295 if( !m || m == _sentinel ) continue; 296 debug_only(m->exit_hash_lock()); // Unlock the node upon removal from old table. 297 hash_insert(m); 298 } 299 } 300 301 //------------------------------clear------------------------------------------ 302 // Clear all entries in _table to NULL but keep storage 303 void NodeHash::clear() { 304 #ifdef ASSERT 305 // Unlock all nodes upon removal from table. 306 for (uint i = 0; i < _max; i++) { 307 Node* n = _table[i]; 308 if (!n || n == _sentinel) continue; 309 n->exit_hash_lock(); 310 } 311 #endif 312 313 memset( _table, 0, _max * sizeof(Node*) ); 314 } 315 316 //-----------------------remove_useless_nodes---------------------------------- 317 // Remove useless nodes from value table, 318 // implementation does not depend on hash function 319 void NodeHash::remove_useless_nodes(VectorSet &useful) { 320 321 // Dead nodes in the hash table inherited from GVN should not replace 322 // existing nodes, remove dead nodes. 323 uint max = size(); 324 Node *sentinel_node = sentinel(); 325 for( uint i = 0; i < max; ++i ) { 326 Node *n = at(i); 327 if(n != NULL && n != sentinel_node && !useful.test(n->_idx)) { 328 debug_only(n->exit_hash_lock()); // Unlock the node when removed 329 _table[i] = sentinel_node; // Replace with placeholder 330 } 331 } 332 } 333 334 335 void NodeHash::check_no_speculative_types() { 336 #ifdef ASSERT 337 uint max = size(); 338 Node *sentinel_node = sentinel(); 339 for (uint i = 0; i < max; ++i) { 340 Node *n = at(i); 341 if(n != NULL && n != sentinel_node && n->is_Type() && n->outcnt() > 0) { 342 TypeNode* tn = n->as_Type(); 343 const Type* t = tn->type(); 344 const Type* t_no_spec = t->remove_speculative(); 345 assert(t == t_no_spec, "dead node in hash table or missed node during speculative cleanup"); 346 } 347 } 348 #endif 349 } 350 351 #ifndef PRODUCT 352 //------------------------------dump------------------------------------------- 353 // Dump statistics for the hash table 354 void NodeHash::dump() { 355 _total_inserts += _inserts; 356 _total_insert_probes += _insert_probes; 357 if (PrintCompilation && PrintOptoStatistics && Verbose && (_inserts > 0)) { 358 if (WizardMode) { 359 for (uint i=0; i<_max; i++) { 360 if (_table[i]) 361 tty->print("%d/%d/%d ",i,_table[i]->hash()&(_max-1),_table[i]->_idx); 362 } 363 } 364 tty->print("\nGVN Hash stats: %d grows to %d max_size\n", _grows, _max); 365 tty->print(" %d/%d (%8.1f%% full)\n", _inserts, _max, (double)_inserts/_max*100.0); 366 tty->print(" %dp/(%dh+%dm) (%8.2f probes/lookup)\n", _look_probes, _lookup_hits, _lookup_misses, (double)_look_probes/(_lookup_hits+_lookup_misses)); 367 tty->print(" %dp/%di (%8.2f probes/insert)\n", _total_insert_probes, _total_inserts, (double)_total_insert_probes/_total_inserts); 368 // sentinels increase lookup cost, but not insert cost 369 assert((_lookup_misses+_lookup_hits)*4+100 >= _look_probes, "bad hash function"); 370 assert( _inserts+(_inserts>>3) < _max, "table too full" ); 371 assert( _inserts*3+100 >= _insert_probes, "bad hash function" ); 372 } 373 } 374 375 Node *NodeHash::find_index(uint idx) { // For debugging 376 // Find an entry by its index value 377 for( uint i = 0; i < _max; i++ ) { 378 Node *m = _table[i]; 379 if( !m || m == _sentinel ) continue; 380 if( m->_idx == (uint)idx ) return m; 381 } 382 return NULL; 383 } 384 #endif 385 386 #ifdef ASSERT 387 NodeHash::~NodeHash() { 388 // Unlock all nodes upon destruction of table. 389 if (_table != (Node**)badAddress) clear(); 390 } 391 392 void NodeHash::operator=(const NodeHash& nh) { 393 // Unlock all nodes upon replacement of table. 394 if (&nh == this) return; 395 if (_table != (Node**)badAddress) clear(); 396 memcpy(this, &nh, sizeof(*this)); 397 // Do not increment hash_lock counts again. 398 // Instead, be sure we never again use the source table. 399 ((NodeHash*)&nh)->_table = (Node**)badAddress; 400 } 401 402 403 #endif 404 405 406 //============================================================================= 407 //------------------------------PhaseRemoveUseless----------------------------- 408 // 1) Use a breadthfirst walk to collect useful nodes reachable from root. 409 PhaseRemoveUseless::PhaseRemoveUseless( PhaseGVN *gvn, Unique_Node_List *worklist ) : Phase(Remove_Useless), 410 _useful(Thread::current()->resource_area()) { 411 412 // Implementation requires 'UseLoopSafepoints == true' and an edge from root 413 // to each SafePointNode at a backward branch. Inserted in add_safepoint(). 414 if( !UseLoopSafepoints || !OptoRemoveUseless ) return; 415 416 // Identify nodes that are reachable from below, useful. 417 C->identify_useful_nodes(_useful); 418 // Update dead node list 419 C->update_dead_node_list(_useful); 420 421 // Remove all useless nodes from PhaseValues' recorded types 422 // Must be done before disconnecting nodes to preserve hash-table-invariant 423 gvn->remove_useless_nodes(_useful.member_set()); 424 425 // Remove all useless nodes from future worklist 426 worklist->remove_useless_nodes(_useful.member_set()); 427 428 // Disconnect 'useless' nodes that are adjacent to useful nodes 429 C->remove_useless_nodes(_useful); 430 431 // Remove edges from "root" to each SafePoint at a backward branch. 432 // They were inserted during parsing (see add_safepoint()) to make infinite 433 // loops without calls or exceptions visible to root, i.e., useful. 434 Node *root = C->root(); 435 if( root != NULL ) { 436 for( uint i = root->req(); i < root->len(); ++i ) { 437 Node *n = root->in(i); 438 if( n != NULL && n->is_SafePoint() ) { 439 root->rm_prec(i); 440 --i; 441 } 442 } 443 } 444 } 445 446 447 //============================================================================= 448 //------------------------------PhaseTransform--------------------------------- 449 PhaseTransform::PhaseTransform( PhaseNumber pnum ) : Phase(pnum), 450 _arena(Thread::current()->resource_area()), 451 _nodes(_arena), 452 _types(_arena) 453 { 454 init_con_caches(); 455 #ifndef PRODUCT 456 clear_progress(); 457 clear_transforms(); 458 set_allow_progress(true); 459 #endif 460 // Force allocation for currently existing nodes 461 _types.map(C->unique(), NULL); 462 } 463 464 //------------------------------PhaseTransform--------------------------------- 465 PhaseTransform::PhaseTransform( Arena *arena, PhaseNumber pnum ) : Phase(pnum), 466 _arena(arena), 467 _nodes(arena), 468 _types(arena) 469 { 470 init_con_caches(); 471 #ifndef PRODUCT 472 clear_progress(); 473 clear_transforms(); 474 set_allow_progress(true); 475 #endif 476 // Force allocation for currently existing nodes 477 _types.map(C->unique(), NULL); 478 } 479 480 //------------------------------PhaseTransform--------------------------------- 481 // Initialize with previously generated type information 482 PhaseTransform::PhaseTransform( PhaseTransform *pt, PhaseNumber pnum ) : Phase(pnum), 483 _arena(pt->_arena), 484 _nodes(pt->_nodes), 485 _types(pt->_types) 486 { 487 init_con_caches(); 488 #ifndef PRODUCT 489 clear_progress(); 490 clear_transforms(); 491 set_allow_progress(true); 492 #endif 493 } 494 495 void PhaseTransform::init_con_caches() { 496 memset(_icons,0,sizeof(_icons)); 497 memset(_lcons,0,sizeof(_lcons)); 498 memset(_zcons,0,sizeof(_zcons)); 499 } 500 501 502 //--------------------------------find_int_type-------------------------------- 503 const TypeInt* PhaseTransform::find_int_type(Node* n) { 504 if (n == NULL) return NULL; 505 // Call type_or_null(n) to determine node's type since we might be in 506 // parse phase and call n->Value() may return wrong type. 507 // (For example, a phi node at the beginning of loop parsing is not ready.) 508 const Type* t = type_or_null(n); 509 if (t == NULL) return NULL; 510 return t->isa_int(); 511 } 512 513 514 //-------------------------------find_long_type-------------------------------- 515 const TypeLong* PhaseTransform::find_long_type(Node* n) { 516 if (n == NULL) return NULL; 517 // (See comment above on type_or_null.) 518 const Type* t = type_or_null(n); 519 if (t == NULL) return NULL; 520 return t->isa_long(); 521 } 522 523 524 #ifndef PRODUCT 525 void PhaseTransform::dump_old2new_map() const { 526 _nodes.dump(); 527 } 528 529 void PhaseTransform::dump_new( uint nidx ) const { 530 for( uint i=0; i<_nodes.Size(); i++ ) 531 if( _nodes[i] && _nodes[i]->_idx == nidx ) { 532 _nodes[i]->dump(); 533 tty->cr(); 534 tty->print_cr("Old index= %d",i); 535 return; 536 } 537 tty->print_cr("Node %d not found in the new indices", nidx); 538 } 539 540 //------------------------------dump_types------------------------------------- 541 void PhaseTransform::dump_types( ) const { 542 _types.dump(); 543 } 544 545 //------------------------------dump_nodes_and_types--------------------------- 546 void PhaseTransform::dump_nodes_and_types(const Node *root, uint depth, bool only_ctrl) { 547 VectorSet visited(Thread::current()->resource_area()); 548 dump_nodes_and_types_recur( root, depth, only_ctrl, visited ); 549 } 550 551 //------------------------------dump_nodes_and_types_recur--------------------- 552 void PhaseTransform::dump_nodes_and_types_recur( const Node *n, uint depth, bool only_ctrl, VectorSet &visited) { 553 if( !n ) return; 554 if( depth == 0 ) return; 555 if( visited.test_set(n->_idx) ) return; 556 for( uint i=0; i<n->len(); i++ ) { 557 if( only_ctrl && !(n->is_Region()) && i != TypeFunc::Control ) continue; 558 dump_nodes_and_types_recur( n->in(i), depth-1, only_ctrl, visited ); 559 } 560 n->dump(); 561 if (type_or_null(n) != NULL) { 562 tty->print(" "); type(n)->dump(); tty->cr(); 563 } 564 } 565 566 #endif 567 568 569 //============================================================================= 570 //------------------------------PhaseValues------------------------------------ 571 // Set minimum table size to "255" 572 PhaseValues::PhaseValues( Arena *arena, uint est_max_size ) : PhaseTransform(arena, GVN), _table(arena, est_max_size) { 573 NOT_PRODUCT( clear_new_values(); ) 574 } 575 576 //------------------------------PhaseValues------------------------------------ 577 // Set minimum table size to "255" 578 PhaseValues::PhaseValues( PhaseValues *ptv ) : PhaseTransform( ptv, GVN ), 579 _table(&ptv->_table) { 580 NOT_PRODUCT( clear_new_values(); ) 581 } 582 583 //------------------------------PhaseValues------------------------------------ 584 // Used by +VerifyOpto. Clear out hash table but copy _types array. 585 PhaseValues::PhaseValues( PhaseValues *ptv, const char *dummy ) : PhaseTransform( ptv, GVN ), 586 _table(ptv->arena(),ptv->_table.size()) { 587 NOT_PRODUCT( clear_new_values(); ) 588 } 589 590 //------------------------------~PhaseValues----------------------------------- 591 #ifndef PRODUCT 592 PhaseValues::~PhaseValues() { 593 _table.dump(); 594 595 // Statistics for value progress and efficiency 596 if( PrintCompilation && Verbose && WizardMode ) { 597 tty->print("\n%sValues: %d nodes ---> %d/%d (%d)", 598 is_IterGVN() ? "Iter" : " ", C->unique(), made_progress(), made_transforms(), made_new_values()); 599 if( made_transforms() != 0 ) { 600 tty->print_cr(" ratio %f", made_progress()/(float)made_transforms() ); 601 } else { 602 tty->cr(); 603 } 604 } 605 } 606 #endif 607 608 //------------------------------makecon---------------------------------------- 609 ConNode* PhaseTransform::makecon(const Type *t) { 610 assert(t->singleton(), "must be a constant"); 611 assert(!t->empty() || t == Type::TOP, "must not be vacuous range"); 612 switch (t->base()) { // fast paths 613 case Type::Half: 614 case Type::Top: return (ConNode*) C->top(); 615 case Type::Int: return intcon( t->is_int()->get_con() ); 616 case Type::Long: return longcon( t->is_long()->get_con() ); 617 } 618 if (t->is_zero_type()) 619 return zerocon(t->basic_type()); 620 return uncached_makecon(t); 621 } 622 623 //--------------------------uncached_makecon----------------------------------- 624 // Make an idealized constant - one of ConINode, ConPNode, etc. 625 ConNode* PhaseValues::uncached_makecon(const Type *t) { 626 assert(t->singleton(), "must be a constant"); 627 ConNode* x = ConNode::make(t); 628 ConNode* k = (ConNode*)hash_find_insert(x); // Value numbering 629 if (k == NULL) { 630 set_type(x, t); // Missed, provide type mapping 631 GrowableArray<Node_Notes*>* nna = C->node_note_array(); 632 if (nna != NULL) { 633 Node_Notes* loc = C->locate_node_notes(nna, x->_idx, true); 634 loc->clear(); // do not put debug info on constants 635 } 636 } else { 637 x->destruct(); // Hit, destroy duplicate constant 638 x = k; // use existing constant 639 } 640 return x; 641 } 642 643 //------------------------------intcon----------------------------------------- 644 // Fast integer constant. Same as "transform(new ConINode(TypeInt::make(i)))" 645 ConINode* PhaseTransform::intcon(int i) { 646 // Small integer? Check cache! Check that cached node is not dead 647 if (i >= _icon_min && i <= _icon_max) { 648 ConINode* icon = _icons[i-_icon_min]; 649 if (icon != NULL && icon->in(TypeFunc::Control) != NULL) 650 return icon; 651 } 652 ConINode* icon = (ConINode*) uncached_makecon(TypeInt::make(i)); 653 assert(icon->is_Con(), ""); 654 if (i >= _icon_min && i <= _icon_max) 655 _icons[i-_icon_min] = icon; // Cache small integers 656 return icon; 657 } 658 659 //------------------------------longcon---------------------------------------- 660 // Fast long constant. 661 ConLNode* PhaseTransform::longcon(jlong l) { 662 // Small integer? Check cache! Check that cached node is not dead 663 if (l >= _lcon_min && l <= _lcon_max) { 664 ConLNode* lcon = _lcons[l-_lcon_min]; 665 if (lcon != NULL && lcon->in(TypeFunc::Control) != NULL) 666 return lcon; 667 } 668 ConLNode* lcon = (ConLNode*) uncached_makecon(TypeLong::make(l)); 669 assert(lcon->is_Con(), ""); 670 if (l >= _lcon_min && l <= _lcon_max) 671 _lcons[l-_lcon_min] = lcon; // Cache small integers 672 return lcon; 673 } 674 675 //------------------------------zerocon----------------------------------------- 676 // Fast zero or null constant. Same as "transform(ConNode::make(Type::get_zero_type(bt)))" 677 ConNode* PhaseTransform::zerocon(BasicType bt) { 678 assert((uint)bt <= _zcon_max, "domain check"); 679 ConNode* zcon = _zcons[bt]; 680 if (zcon != NULL && zcon->in(TypeFunc::Control) != NULL) 681 return zcon; 682 zcon = (ConNode*) uncached_makecon(Type::get_zero_type(bt)); 683 _zcons[bt] = zcon; 684 return zcon; 685 } 686 687 688 689 //============================================================================= 690 //------------------------------transform-------------------------------------- 691 // Return a node which computes the same function as this node, but in a 692 // faster or cheaper fashion. 693 Node *PhaseGVN::transform( Node *n ) { 694 return transform_no_reclaim(n); 695 } 696 697 //------------------------------transform-------------------------------------- 698 // Return a node which computes the same function as this node, but 699 // in a faster or cheaper fashion. 700 Node *PhaseGVN::transform_no_reclaim( Node *n ) { 701 NOT_PRODUCT( set_transforms(); ) 702 703 // Apply the Ideal call in a loop until it no longer applies 704 Node *k = n; 705 NOT_PRODUCT( uint loop_count = 0; ) 706 while( 1 ) { 707 Node *i = k->Ideal(this, /*can_reshape=*/false); 708 if( !i ) break; 709 assert( i->_idx >= k->_idx, "Idealize should return new nodes, use Identity to return old nodes" ); 710 k = i; 711 assert(loop_count++ < K, "infinite loop in PhaseGVN::transform"); 712 } 713 NOT_PRODUCT( if( loop_count != 0 ) { set_progress(); } ) 714 715 716 // If brand new node, make space in type array. 717 ensure_type_or_null(k); 718 719 // Since I just called 'Value' to compute the set of run-time values 720 // for this Node, and 'Value' is non-local (and therefore expensive) I'll 721 // cache Value. Later requests for the local phase->type of this Node can 722 // use the cached Value instead of suffering with 'bottom_type'. 723 const Type *t = k->Value(this); // Get runtime Value set 724 assert(t != NULL, "value sanity"); 725 if (type_or_null(k) != t) { 726 #ifndef PRODUCT 727 // Do not count initial visit to node as a transformation 728 if (type_or_null(k) == NULL) { 729 inc_new_values(); 730 set_progress(); 731 } 732 #endif 733 set_type(k, t); 734 // If k is a TypeNode, capture any more-precise type permanently into Node 735 k->raise_bottom_type(t); 736 } 737 738 if( t->singleton() && !k->is_Con() ) { 739 NOT_PRODUCT( set_progress(); ) 740 return makecon(t); // Turn into a constant 741 } 742 743 // Now check for Identities 744 Node *i = k->Identity(this); // Look for a nearby replacement 745 if( i != k ) { // Found? Return replacement! 746 NOT_PRODUCT( set_progress(); ) 747 return i; 748 } 749 750 // Global Value Numbering 751 i = hash_find_insert(k); // Insert if new 752 if( i && (i != k) ) { 753 // Return the pre-existing node 754 NOT_PRODUCT( set_progress(); ) 755 return i; 756 } 757 758 // Return Idealized original 759 return k; 760 } 761 762 #ifdef ASSERT 763 //------------------------------dead_loop_check-------------------------------- 764 // Check for a simple dead loop when a data node references itself directly 765 // or through an other data node excluding cons and phis. 766 void PhaseGVN::dead_loop_check( Node *n ) { 767 // Phi may reference itself in a loop 768 if (n != NULL && !n->is_dead_loop_safe() && !n->is_CFG()) { 769 // Do 2 levels check and only data inputs. 770 bool no_dead_loop = true; 771 uint cnt = n->req(); 772 for (uint i = 1; i < cnt && no_dead_loop; i++) { 773 Node *in = n->in(i); 774 if (in == n) { 775 no_dead_loop = false; 776 } else if (in != NULL && !in->is_dead_loop_safe()) { 777 uint icnt = in->req(); 778 for (uint j = 1; j < icnt && no_dead_loop; j++) { 779 if (in->in(j) == n || in->in(j) == in) 780 no_dead_loop = false; 781 } 782 } 783 } 784 if (!no_dead_loop) n->dump(3); 785 assert(no_dead_loop, "dead loop detected"); 786 } 787 } 788 #endif 789 790 //============================================================================= 791 //------------------------------PhaseIterGVN----------------------------------- 792 // Initialize hash table to fresh and clean for +VerifyOpto 793 PhaseIterGVN::PhaseIterGVN( PhaseIterGVN *igvn, const char *dummy ) : PhaseGVN(igvn,dummy), _worklist( ), 794 _stack(C->live_nodes() >> 1), 795 _delay_transform(false) { 796 } 797 798 //------------------------------PhaseIterGVN----------------------------------- 799 // Initialize with previous PhaseIterGVN info; used by PhaseCCP 800 PhaseIterGVN::PhaseIterGVN( PhaseIterGVN *igvn ) : PhaseGVN(igvn), 801 _worklist( igvn->_worklist ), 802 _stack( igvn->_stack ), 803 _delay_transform(igvn->_delay_transform) 804 { 805 } 806 807 //------------------------------PhaseIterGVN----------------------------------- 808 // Initialize with previous PhaseGVN info from Parser 809 PhaseIterGVN::PhaseIterGVN( PhaseGVN *gvn ) : PhaseGVN(gvn), 810 _worklist(*C->for_igvn()), 811 // TODO: Before incremental inlining it was allocated only once and it was fine. Now that 812 // the constructor is used in incremental inlining, this consumes too much memory: 813 // _stack(C->live_nodes() >> 1), 814 // So, as a band-aid, we replace this by: 815 _stack(C->comp_arena(), 32), 816 _delay_transform(false) 817 { 818 uint max; 819 820 // Dead nodes in the hash table inherited from GVN were not treated as 821 // roots during def-use info creation; hence they represent an invisible 822 // use. Clear them out. 823 max = _table.size(); 824 for( uint i = 0; i < max; ++i ) { 825 Node *n = _table.at(i); 826 if(n != NULL && n != _table.sentinel() && n->outcnt() == 0) { 827 if( n->is_top() ) continue; 828 assert( false, "Parse::remove_useless_nodes missed this node"); 829 hash_delete(n); 830 } 831 } 832 833 // Any Phis or Regions on the worklist probably had uses that could not 834 // make more progress because the uses were made while the Phis and Regions 835 // were in half-built states. Put all uses of Phis and Regions on worklist. 836 max = _worklist.size(); 837 for( uint j = 0; j < max; j++ ) { 838 Node *n = _worklist.at(j); 839 uint uop = n->Opcode(); 840 if( uop == Op_Phi || uop == Op_Region || 841 n->is_Type() || 842 n->is_Mem() ) 843 add_users_to_worklist(n); 844 } 845 } 846 847 /** 848 * Initialize worklist for each node. 849 */ 850 void PhaseIterGVN::init_worklist(Node* first) { 851 Unique_Node_List to_process; 852 to_process.push(first); 853 854 while (to_process.size() > 0) { 855 Node* n = to_process.pop(); 856 if (!_worklist.member(n)) { 857 _worklist.push(n); 858 859 uint cnt = n->req(); 860 for(uint i = 0; i < cnt; i++) { 861 Node* m = n->in(i); 862 if (m != NULL) { 863 to_process.push(m); 864 } 865 } 866 } 867 } 868 } 869 870 #ifndef PRODUCT 871 void PhaseIterGVN::verify_step(Node* n) { 872 if (VerifyIterativeGVN) { 873 _verify_window[_verify_counter % _verify_window_size] = n; 874 ++_verify_counter; 875 ResourceMark rm; 876 ResourceArea* area = Thread::current()->resource_area(); 877 VectorSet old_space(area), new_space(area); 878 if (C->unique() < 1000 || 879 0 == _verify_counter % (C->unique() < 10000 ? 10 : 100)) { 880 ++_verify_full_passes; 881 Node::verify_recur(C->root(), -1, old_space, new_space); 882 } 883 const int verify_depth = 4; 884 for ( int i = 0; i < _verify_window_size; i++ ) { 885 Node* n = _verify_window[i]; 886 if ( n == NULL ) continue; 887 if( n->in(0) == NodeSentinel ) { // xform_idom 888 _verify_window[i] = n->in(1); 889 --i; continue; 890 } 891 // Typical fanout is 1-2, so this call visits about 6 nodes. 892 Node::verify_recur(n, verify_depth, old_space, new_space); 893 } 894 } 895 } 896 897 void PhaseIterGVN::trace_PhaseIterGVN(Node* n, Node* nn, const Type* oldtype) { 898 if (TraceIterativeGVN) { 899 uint wlsize = _worklist.size(); 900 const Type* newtype = type_or_null(n); 901 if (nn != n) { 902 // print old node 903 tty->print("< "); 904 if (oldtype != newtype && oldtype != NULL) { 905 oldtype->dump(); 906 } 907 do { tty->print("\t"); } while (tty->position() < 16); 908 tty->print("<"); 909 n->dump(); 910 } 911 if (oldtype != newtype || nn != n) { 912 // print new node and/or new type 913 if (oldtype == NULL) { 914 tty->print("* "); 915 } else if (nn != n) { 916 tty->print("> "); 917 } else { 918 tty->print("= "); 919 } 920 if (newtype == NULL) { 921 tty->print("null"); 922 } else { 923 newtype->dump(); 924 } 925 do { tty->print("\t"); } while (tty->position() < 16); 926 nn->dump(); 927 } 928 if (Verbose && wlsize < _worklist.size()) { 929 tty->print(" Push {"); 930 while (wlsize != _worklist.size()) { 931 Node* pushed = _worklist.at(wlsize++); 932 tty->print(" %d", pushed->_idx); 933 } 934 tty->print_cr(" }"); 935 } 936 if (nn != n) { 937 // ignore n, it might be subsumed 938 verify_step((Node*) NULL); 939 } 940 } 941 } 942 943 void PhaseIterGVN::init_verifyPhaseIterGVN() { 944 _verify_counter = 0; 945 _verify_full_passes = 0; 946 for (int i = 0; i < _verify_window_size; i++) { 947 _verify_window[i] = NULL; 948 } 949 #ifdef ASSERT 950 // Verify that all modified nodes are on _worklist 951 Unique_Node_List* modified_list = C->modified_nodes(); 952 while (modified_list != NULL && modified_list->size()) { 953 Node* n = modified_list->pop(); 954 if (n->outcnt() != 0 && !n->is_Con() && !_worklist.member(n)) { 955 n->dump(); 956 assert(false, "modified node is not on IGVN._worklist"); 957 } 958 } 959 #endif 960 } 961 962 void PhaseIterGVN::verify_PhaseIterGVN() { 963 #ifdef ASSERT 964 // Verify nodes with changed inputs. 965 Unique_Node_List* modified_list = C->modified_nodes(); 966 while (modified_list != NULL && modified_list->size()) { 967 Node* n = modified_list->pop(); 968 if (n->outcnt() != 0 && !n->is_Con()) { // skip dead and Con nodes 969 n->dump(); 970 assert(false, "modified node was not processed by IGVN.transform_old()"); 971 } 972 } 973 #endif 974 975 C->verify_graph_edges(); 976 if( VerifyOpto && allow_progress() ) { 977 // Must turn off allow_progress to enable assert and break recursion 978 C->root()->verify(); 979 { // Check if any progress was missed using IterGVN 980 // Def-Use info enables transformations not attempted in wash-pass 981 // e.g. Region/Phi cleanup, ... 982 // Null-check elision -- may not have reached fixpoint 983 // do not propagate to dominated nodes 984 ResourceMark rm; 985 PhaseIterGVN igvn2(this,"Verify"); // Fresh and clean! 986 // Fill worklist completely 987 igvn2.init_worklist(C->root()); 988 989 igvn2.set_allow_progress(false); 990 igvn2.optimize(); 991 igvn2.set_allow_progress(true); 992 } 993 } 994 if (VerifyIterativeGVN && PrintOpto) { 995 if (_verify_counter == _verify_full_passes) { 996 tty->print_cr("VerifyIterativeGVN: %d transforms and verify passes", 997 (int) _verify_full_passes); 998 } else { 999 tty->print_cr("VerifyIterativeGVN: %d transforms, %d full verify passes", 1000 (int) _verify_counter, (int) _verify_full_passes); 1001 } 1002 } 1003 1004 #ifdef ASSERT 1005 while (modified_list->size()) { 1006 Node* n = modified_list->pop(); 1007 n->dump(); 1008 assert(false, "VerifyIterativeGVN: new modified node was added"); 1009 } 1010 #endif 1011 } 1012 #endif /* PRODUCT */ 1013 1014 #ifdef ASSERT 1015 /** 1016 * Dumps information that can help to debug the problem. A debug 1017 * build fails with an assert. 1018 */ 1019 void PhaseIterGVN::dump_infinite_loop_info(Node* n) { 1020 n->dump(4); 1021 _worklist.dump(); 1022 assert(false, "infinite loop in PhaseIterGVN::optimize"); 1023 } 1024 1025 /** 1026 * Prints out information about IGVN if the 'verbose' option is used. 1027 */ 1028 void PhaseIterGVN::trace_PhaseIterGVN_verbose(Node* n, int num_processed) { 1029 if (TraceIterativeGVN && Verbose) { 1030 tty->print(" Pop "); 1031 n->dump(); 1032 if ((num_processed % 100) == 0) { 1033 _worklist.print_set(); 1034 } 1035 } 1036 } 1037 #endif /* ASSERT */ 1038 1039 void PhaseIterGVN::optimize() { 1040 DEBUG_ONLY(uint num_processed = 0;) 1041 NOT_PRODUCT(init_verifyPhaseIterGVN();) 1042 1043 uint loop_count = 0; 1044 // Pull from worklist and transform the node. If the node has changed, 1045 // update edge info and put uses on worklist. 1046 while(_worklist.size()) { 1047 if (C->check_node_count(NodeLimitFudgeFactor * 2, "Out of nodes")) { 1048 return; 1049 } 1050 Node* n = _worklist.pop(); 1051 if (++loop_count >= K * C->live_nodes()) { 1052 DEBUG_ONLY(dump_infinite_loop_info(n);) 1053 C->record_method_not_compilable("infinite loop in PhaseIterGVN::optimize"); 1054 return; 1055 } 1056 DEBUG_ONLY(trace_PhaseIterGVN_verbose(n, num_processed++);) 1057 if (n->outcnt() != 0) { 1058 NOT_PRODUCT(const Type* oldtype = type_or_null(n)); 1059 // Do the transformation 1060 Node* nn = transform_old(n); 1061 NOT_PRODUCT(trace_PhaseIterGVN(n, nn, oldtype);) 1062 } else if (!n->is_top()) { 1063 remove_dead_node(n); 1064 } 1065 } 1066 NOT_PRODUCT(verify_PhaseIterGVN();) 1067 } 1068 1069 1070 /** 1071 * Register a new node with the optimizer. Update the types array, the def-use 1072 * info. Put on worklist. 1073 */ 1074 Node* PhaseIterGVN::register_new_node_with_optimizer(Node* n, Node* orig) { 1075 set_type_bottom(n); 1076 _worklist.push(n); 1077 if (orig != NULL) C->copy_node_notes_to(n, orig); 1078 return n; 1079 } 1080 1081 //------------------------------transform-------------------------------------- 1082 // Non-recursive: idealize Node 'n' with respect to its inputs and its value 1083 Node *PhaseIterGVN::transform( Node *n ) { 1084 if (_delay_transform) { 1085 // Register the node but don't optimize for now 1086 register_new_node_with_optimizer(n); 1087 return n; 1088 } 1089 1090 // If brand new node, make space in type array, and give it a type. 1091 ensure_type_or_null(n); 1092 if (type_or_null(n) == NULL) { 1093 set_type_bottom(n); 1094 } 1095 1096 return transform_old(n); 1097 } 1098 1099 Node *PhaseIterGVN::transform_old(Node* n) { 1100 DEBUG_ONLY(uint loop_count = 0;); 1101 NOT_PRODUCT(set_transforms()); 1102 1103 // Remove 'n' from hash table in case it gets modified 1104 _table.hash_delete(n); 1105 if (VerifyIterativeGVN) { 1106 assert(!_table.find_index(n->_idx), "found duplicate entry in table"); 1107 } 1108 1109 // Apply the Ideal call in a loop until it no longer applies 1110 Node* k = n; 1111 DEBUG_ONLY(dead_loop_check(k);) 1112 DEBUG_ONLY(bool is_new = (k->outcnt() == 0);) 1113 C->remove_modified_node(k); 1114 Node* i = k->Ideal(this, /*can_reshape=*/true); 1115 assert(i != k || is_new || i->outcnt() > 0, "don't return dead nodes"); 1116 #ifndef PRODUCT 1117 verify_step(k); 1118 if (i && VerifyOpto ) { 1119 if (!allow_progress()) { 1120 if (i->is_Add() && (i->outcnt() == 1)) { 1121 // Switched input to left side because this is the only use 1122 } else if (i->is_If() && (i->in(0) == NULL)) { 1123 // This IF is dead because it is dominated by an equivalent IF When 1124 // dominating if changed, info is not propagated sparsely to 'this' 1125 // Propagating this info further will spuriously identify other 1126 // progress. 1127 return i; 1128 } else 1129 set_progress(); 1130 } else { 1131 set_progress(); 1132 } 1133 } 1134 #endif 1135 1136 while (i != NULL) { 1137 #ifdef ASSERT 1138 if (loop_count >= K) { 1139 dump_infinite_loop_info(i); 1140 } 1141 loop_count++; 1142 #endif 1143 assert((i->_idx >= k->_idx) || i->is_top(), "Idealize should return new nodes, use Identity to return old nodes"); 1144 // Made a change; put users of original Node on worklist 1145 add_users_to_worklist(k); 1146 // Replacing root of transform tree? 1147 if (k != i) { 1148 // Make users of old Node now use new. 1149 subsume_node(k, i); 1150 k = i; 1151 } 1152 DEBUG_ONLY(dead_loop_check(k);) 1153 // Try idealizing again 1154 DEBUG_ONLY(is_new = (k->outcnt() == 0);) 1155 C->remove_modified_node(k); 1156 i = k->Ideal(this, /*can_reshape=*/true); 1157 assert(i != k || is_new || (i->outcnt() > 0), "don't return dead nodes"); 1158 #ifndef PRODUCT 1159 verify_step(k); 1160 if (i && VerifyOpto) { 1161 set_progress(); 1162 } 1163 #endif 1164 } 1165 1166 // If brand new node, make space in type array. 1167 ensure_type_or_null(k); 1168 1169 // See what kind of values 'k' takes on at runtime 1170 const Type* t = k->Value(this); 1171 assert(t != NULL, "value sanity"); 1172 1173 // Since I just called 'Value' to compute the set of run-time values 1174 // for this Node, and 'Value' is non-local (and therefore expensive) I'll 1175 // cache Value. Later requests for the local phase->type of this Node can 1176 // use the cached Value instead of suffering with 'bottom_type'. 1177 if (type_or_null(k) != t) { 1178 #ifndef PRODUCT 1179 inc_new_values(); 1180 set_progress(); 1181 #endif 1182 set_type(k, t); 1183 // If k is a TypeNode, capture any more-precise type permanently into Node 1184 k->raise_bottom_type(t); 1185 // Move users of node to worklist 1186 add_users_to_worklist(k); 1187 } 1188 // If 'k' computes a constant, replace it with a constant 1189 if (t->singleton() && !k->is_Con()) { 1190 NOT_PRODUCT(set_progress();) 1191 Node* con = makecon(t); // Make a constant 1192 add_users_to_worklist(k); 1193 subsume_node(k, con); // Everybody using k now uses con 1194 return con; 1195 } 1196 1197 // Now check for Identities 1198 i = k->Identity(this); // Look for a nearby replacement 1199 if (i != k) { // Found? Return replacement! 1200 NOT_PRODUCT(set_progress();) 1201 add_users_to_worklist(k); 1202 subsume_node(k, i); // Everybody using k now uses i 1203 return i; 1204 } 1205 1206 // Global Value Numbering 1207 i = hash_find_insert(k); // Check for pre-existing node 1208 if (i && (i != k)) { 1209 // Return the pre-existing node if it isn't dead 1210 NOT_PRODUCT(set_progress();) 1211 add_users_to_worklist(k); 1212 subsume_node(k, i); // Everybody using k now uses i 1213 return i; 1214 } 1215 1216 // Return Idealized original 1217 return k; 1218 } 1219 1220 //---------------------------------saturate------------------------------------ 1221 const Type* PhaseIterGVN::saturate(const Type* new_type, const Type* old_type, 1222 const Type* limit_type) const { 1223 return new_type->narrow(old_type); 1224 } 1225 1226 //------------------------------remove_globally_dead_node---------------------- 1227 // Kill a globally dead Node. All uses are also globally dead and are 1228 // aggressively trimmed. 1229 void PhaseIterGVN::remove_globally_dead_node( Node *dead ) { 1230 enum DeleteProgress { 1231 PROCESS_INPUTS, 1232 PROCESS_OUTPUTS 1233 }; 1234 assert(_stack.is_empty(), "not empty"); 1235 _stack.push(dead, PROCESS_INPUTS); 1236 1237 while (_stack.is_nonempty()) { 1238 dead = _stack.node(); 1239 uint progress_state = _stack.index(); 1240 assert(dead != C->root(), "killing root, eh?"); 1241 assert(!dead->is_top(), "add check for top when pushing"); 1242 NOT_PRODUCT( set_progress(); ) 1243 if (progress_state == PROCESS_INPUTS) { 1244 // After following inputs, continue to outputs 1245 _stack.set_index(PROCESS_OUTPUTS); 1246 if (!dead->is_Con()) { // Don't kill cons but uses 1247 bool recurse = false; 1248 // Remove from hash table 1249 _table.hash_delete( dead ); 1250 // Smash all inputs to 'dead', isolating him completely 1251 for (uint i = 0; i < dead->req(); i++) { 1252 Node *in = dead->in(i); 1253 if (in != NULL && in != C->top()) { // Points to something? 1254 int nrep = dead->replace_edge(in, NULL); // Kill edges 1255 assert((nrep > 0), "sanity"); 1256 if (in->outcnt() == 0) { // Made input go dead? 1257 _stack.push(in, PROCESS_INPUTS); // Recursively remove 1258 recurse = true; 1259 } else if (in->outcnt() == 1 && 1260 in->has_special_unique_user()) { 1261 _worklist.push(in->unique_out()); 1262 } else if (in->outcnt() <= 2 && dead->is_Phi()) { 1263 if (in->Opcode() == Op_Region) { 1264 _worklist.push(in); 1265 } else if (in->is_Store()) { 1266 DUIterator_Fast imax, i = in->fast_outs(imax); 1267 _worklist.push(in->fast_out(i)); 1268 i++; 1269 if (in->outcnt() == 2) { 1270 _worklist.push(in->fast_out(i)); 1271 i++; 1272 } 1273 assert(!(i < imax), "sanity"); 1274 } 1275 } 1276 if (ReduceFieldZeroing && dead->is_Load() && i == MemNode::Memory && 1277 in->is_Proj() && in->in(0) != NULL && in->in(0)->is_Initialize()) { 1278 // A Load that directly follows an InitializeNode is 1279 // going away. The Stores that follow are candidates 1280 // again to be captured by the InitializeNode. 1281 for (DUIterator_Fast jmax, j = in->fast_outs(jmax); j < jmax; j++) { 1282 Node *n = in->fast_out(j); 1283 if (n->is_Store()) { 1284 _worklist.push(n); 1285 } 1286 } 1287 } 1288 } // if (in != NULL && in != C->top()) 1289 } // for (uint i = 0; i < dead->req(); i++) 1290 if (recurse) { 1291 continue; 1292 } 1293 } // if (!dead->is_Con()) 1294 } // if (progress_state == PROCESS_INPUTS) 1295 1296 // Aggressively kill globally dead uses 1297 // (Rather than pushing all the outs at once, we push one at a time, 1298 // plus the parent to resume later, because of the indefinite number 1299 // of edge deletions per loop trip.) 1300 if (dead->outcnt() > 0) { 1301 // Recursively remove output edges 1302 _stack.push(dead->raw_out(0), PROCESS_INPUTS); 1303 } else { 1304 // Finished disconnecting all input and output edges. 1305 _stack.pop(); 1306 // Remove dead node from iterative worklist 1307 _worklist.remove(dead); 1308 C->remove_modified_node(dead); 1309 // Constant node that has no out-edges and has only one in-edge from 1310 // root is usually dead. However, sometimes reshaping walk makes 1311 // it reachable by adding use edges. So, we will NOT count Con nodes 1312 // as dead to be conservative about the dead node count at any 1313 // given time. 1314 if (!dead->is_Con()) { 1315 C->record_dead_node(dead->_idx); 1316 } 1317 if (dead->is_macro()) { 1318 C->remove_macro_node(dead); 1319 } 1320 if (dead->is_expensive()) { 1321 C->remove_expensive_node(dead); 1322 } 1323 } 1324 } // while (_stack.is_nonempty()) 1325 } 1326 1327 //------------------------------subsume_node----------------------------------- 1328 // Remove users from node 'old' and add them to node 'nn'. 1329 void PhaseIterGVN::subsume_node( Node *old, Node *nn ) { 1330 assert( old != hash_find(old), "should already been removed" ); 1331 assert( old != C->top(), "cannot subsume top node"); 1332 // Copy debug or profile information to the new version: 1333 C->copy_node_notes_to(nn, old); 1334 // Move users of node 'old' to node 'nn' 1335 for (DUIterator_Last imin, i = old->last_outs(imin); i >= imin; ) { 1336 Node* use = old->last_out(i); // for each use... 1337 // use might need re-hashing (but it won't if it's a new node) 1338 rehash_node_delayed(use); 1339 // Update use-def info as well 1340 // We remove all occurrences of old within use->in, 1341 // so as to avoid rehashing any node more than once. 1342 // The hash table probe swamps any outer loop overhead. 1343 uint num_edges = 0; 1344 for (uint jmax = use->len(), j = 0; j < jmax; j++) { 1345 if (use->in(j) == old) { 1346 use->set_req(j, nn); 1347 ++num_edges; 1348 } 1349 } 1350 i -= num_edges; // we deleted 1 or more copies of this edge 1351 } 1352 1353 // Smash all inputs to 'old', isolating him completely 1354 Node *temp = new Node(1); 1355 temp->init_req(0,nn); // Add a use to nn to prevent him from dying 1356 remove_dead_node( old ); 1357 temp->del_req(0); // Yank bogus edge 1358 #ifndef PRODUCT 1359 if( VerifyIterativeGVN ) { 1360 for ( int i = 0; i < _verify_window_size; i++ ) { 1361 if ( _verify_window[i] == old ) 1362 _verify_window[i] = nn; 1363 } 1364 } 1365 #endif 1366 _worklist.remove(temp); // this can be necessary 1367 temp->destruct(); // reuse the _idx of this little guy 1368 } 1369 1370 //------------------------------add_users_to_worklist-------------------------- 1371 void PhaseIterGVN::add_users_to_worklist0( Node *n ) { 1372 for (DUIterator_Fast imax, i = n->fast_outs(imax); i < imax; i++) { 1373 _worklist.push(n->fast_out(i)); // Push on worklist 1374 } 1375 } 1376 1377 void PhaseIterGVN::add_users_to_worklist( Node *n ) { 1378 add_users_to_worklist0(n); 1379 1380 // Move users of node to worklist 1381 for (DUIterator_Fast imax, i = n->fast_outs(imax); i < imax; i++) { 1382 Node* use = n->fast_out(i); // Get use 1383 1384 if( use->is_Multi() || // Multi-definer? Push projs on worklist 1385 use->is_Store() ) // Enable store/load same address 1386 add_users_to_worklist0(use); 1387 1388 // If we changed the receiver type to a call, we need to revisit 1389 // the Catch following the call. It's looking for a non-NULL 1390 // receiver to know when to enable the regular fall-through path 1391 // in addition to the NullPtrException path. 1392 if (use->is_CallDynamicJava() && n == use->in(TypeFunc::Parms)) { 1393 Node* p = use->as_CallDynamicJava()->proj_out(TypeFunc::Control); 1394 if (p != NULL) { 1395 add_users_to_worklist0(p); 1396 } 1397 } 1398 1399 uint use_op = use->Opcode(); 1400 if(use->is_Cmp()) { // Enable CMP/BOOL optimization 1401 add_users_to_worklist(use); // Put Bool on worklist 1402 if (use->outcnt() > 0) { 1403 Node* bol = use->raw_out(0); 1404 if (bol->outcnt() > 0) { 1405 Node* iff = bol->raw_out(0); 1406 if (use_op == Op_CmpI && 1407 iff->is_CountedLoopEnd()) { 1408 CountedLoopEndNode* cle = iff->as_CountedLoopEnd(); 1409 if (cle->limit() == n && cle->phi() != NULL) { 1410 // If an opaque node feeds into the limit condition of a 1411 // CountedLoop, we need to process the Phi node for the 1412 // induction variable when the opaque node is removed: 1413 // the range of values taken by the Phi is now known and 1414 // so its type is also known. 1415 _worklist.push(cle->phi()); 1416 } 1417 } else if (iff->outcnt() == 2) { 1418 // Look for the 'is_x2logic' pattern: "x ? : 0 : 1" and put the 1419 // phi merging either 0 or 1 onto the worklist 1420 Node* ifproj0 = iff->raw_out(0); 1421 Node* ifproj1 = iff->raw_out(1); 1422 if (ifproj0->outcnt() > 0 && ifproj1->outcnt() > 0) { 1423 Node* region0 = ifproj0->raw_out(0); 1424 Node* region1 = ifproj1->raw_out(0); 1425 if( region0 == region1 ) 1426 add_users_to_worklist0(region0); 1427 } 1428 } 1429 } 1430 } 1431 if (use_op == Op_CmpI) { 1432 Node* in1 = use->in(1); 1433 for (uint i = 0; i < in1->outcnt(); i++) { 1434 if (in1->raw_out(i)->Opcode() == Op_CastII) { 1435 Node* castii = in1->raw_out(i); 1436 if (castii->in(0) != NULL && castii->in(0)->in(0) != NULL && castii->in(0)->in(0)->is_If()) { 1437 Node* ifnode = castii->in(0)->in(0); 1438 if (ifnode->in(1) != NULL && ifnode->in(1)->is_Bool() && ifnode->in(1)->in(1) == use) { 1439 // Reprocess a CastII node that may depend on an 1440 // opaque node value when the opaque node is 1441 // removed. In case it carries a dependency we can do 1442 // a better job of computing its type. 1443 _worklist.push(castii); 1444 } 1445 } 1446 } 1447 } 1448 } 1449 } 1450 1451 // If changed Cast input, check Phi users for simple cycles 1452 if( use->is_ConstraintCast() || use->is_CheckCastPP() ) { 1453 for (DUIterator_Fast i2max, i2 = use->fast_outs(i2max); i2 < i2max; i2++) { 1454 Node* u = use->fast_out(i2); 1455 if (u->is_Phi()) 1456 _worklist.push(u); 1457 } 1458 } 1459 // If changed LShift inputs, check RShift users for useless sign-ext 1460 if( use_op == Op_LShiftI ) { 1461 for (DUIterator_Fast i2max, i2 = use->fast_outs(i2max); i2 < i2max; i2++) { 1462 Node* u = use->fast_out(i2); 1463 if (u->Opcode() == Op_RShiftI) 1464 _worklist.push(u); 1465 } 1466 } 1467 // If changed AddI/SubI inputs, check CmpU for range check optimization. 1468 if (use_op == Op_AddI || use_op == Op_SubI) { 1469 for (DUIterator_Fast i2max, i2 = use->fast_outs(i2max); i2 < i2max; i2++) { 1470 Node* u = use->fast_out(i2); 1471 if (u->is_Cmp() && (u->Opcode() == Op_CmpU)) { 1472 _worklist.push(u); 1473 } 1474 } 1475 } 1476 // If changed AddP inputs, check Stores for loop invariant 1477 if( use_op == Op_AddP ) { 1478 for (DUIterator_Fast i2max, i2 = use->fast_outs(i2max); i2 < i2max; i2++) { 1479 Node* u = use->fast_out(i2); 1480 if (u->is_Mem()) 1481 _worklist.push(u); 1482 } 1483 } 1484 // If changed initialization activity, check dependent Stores 1485 if (use_op == Op_Allocate || use_op == Op_AllocateArray) { 1486 InitializeNode* init = use->as_Allocate()->initialization(); 1487 if (init != NULL) { 1488 Node* imem = init->proj_out(TypeFunc::Memory); 1489 if (imem != NULL) add_users_to_worklist0(imem); 1490 } 1491 } 1492 if (use_op == Op_Initialize) { 1493 Node* imem = use->as_Initialize()->proj_out(TypeFunc::Memory); 1494 if (imem != NULL) add_users_to_worklist0(imem); 1495 } 1496 } 1497 } 1498 1499 /** 1500 * Remove the speculative part of all types that we know of 1501 */ 1502 void PhaseIterGVN::remove_speculative_types() { 1503 assert(UseTypeSpeculation, "speculation is off"); 1504 for (uint i = 0; i < _types.Size(); i++) { 1505 const Type* t = _types.fast_lookup(i); 1506 if (t != NULL) { 1507 _types.map(i, t->remove_speculative()); 1508 } 1509 } 1510 _table.check_no_speculative_types(); 1511 } 1512 1513 //============================================================================= 1514 #ifndef PRODUCT 1515 uint PhaseCCP::_total_invokes = 0; 1516 uint PhaseCCP::_total_constants = 0; 1517 #endif 1518 //------------------------------PhaseCCP--------------------------------------- 1519 // Conditional Constant Propagation, ala Wegman & Zadeck 1520 PhaseCCP::PhaseCCP( PhaseIterGVN *igvn ) : PhaseIterGVN(igvn) { 1521 NOT_PRODUCT( clear_constants(); ) 1522 assert( _worklist.size() == 0, "" ); 1523 // Clear out _nodes from IterGVN. Must be clear to transform call. 1524 _nodes.clear(); // Clear out from IterGVN 1525 analyze(); 1526 } 1527 1528 #ifndef PRODUCT 1529 //------------------------------~PhaseCCP-------------------------------------- 1530 PhaseCCP::~PhaseCCP() { 1531 inc_invokes(); 1532 _total_constants += count_constants(); 1533 } 1534 #endif 1535 1536 1537 #ifdef ASSERT 1538 static bool ccp_type_widens(const Type* t, const Type* t0) { 1539 assert(t->meet(t0) == t, "Not monotonic"); 1540 switch (t->base() == t0->base() ? t->base() : Type::Top) { 1541 case Type::Int: 1542 assert(t0->isa_int()->_widen <= t->isa_int()->_widen, "widen increases"); 1543 break; 1544 case Type::Long: 1545 assert(t0->isa_long()->_widen <= t->isa_long()->_widen, "widen increases"); 1546 break; 1547 } 1548 return true; 1549 } 1550 #endif //ASSERT 1551 1552 //------------------------------analyze---------------------------------------- 1553 void PhaseCCP::analyze() { 1554 // Initialize all types to TOP, optimistic analysis 1555 for (int i = C->unique() - 1; i >= 0; i--) { 1556 _types.map(i,Type::TOP); 1557 } 1558 1559 // Push root onto worklist 1560 Unique_Node_List worklist; 1561 worklist.push(C->root()); 1562 1563 // Pull from worklist; compute new value; push changes out. 1564 // This loop is the meat of CCP. 1565 while( worklist.size() ) { 1566 Node *n = worklist.pop(); 1567 const Type *t = n->Value(this); 1568 if (t != type(n)) { 1569 assert(ccp_type_widens(t, type(n)), "ccp type must widen"); 1570 #ifndef PRODUCT 1571 if( TracePhaseCCP ) { 1572 t->dump(); 1573 do { tty->print("\t"); } while (tty->position() < 16); 1574 n->dump(); 1575 } 1576 #endif 1577 set_type(n, t); 1578 for (DUIterator_Fast imax, i = n->fast_outs(imax); i < imax; i++) { 1579 Node* m = n->fast_out(i); // Get user 1580 if (m->is_Region()) { // New path to Region? Must recheck Phis too 1581 for (DUIterator_Fast i2max, i2 = m->fast_outs(i2max); i2 < i2max; i2++) { 1582 Node* p = m->fast_out(i2); // Propagate changes to uses 1583 if (p->bottom_type() != type(p)) { // If not already bottomed out 1584 worklist.push(p); // Propagate change to user 1585 } 1586 } 1587 } 1588 // If we changed the receiver type to a call, we need to revisit 1589 // the Catch following the call. It's looking for a non-NULL 1590 // receiver to know when to enable the regular fall-through path 1591 // in addition to the NullPtrException path 1592 if (m->is_Call()) { 1593 for (DUIterator_Fast i2max, i2 = m->fast_outs(i2max); i2 < i2max; i2++) { 1594 Node* p = m->fast_out(i2); // Propagate changes to uses 1595 if (p->is_Proj() && p->as_Proj()->_con == TypeFunc::Control && p->outcnt() == 1) { 1596 worklist.push(p->unique_out()); 1597 } 1598 } 1599 } 1600 if (m->bottom_type() != type(m)) { // If not already bottomed out 1601 worklist.push(m); // Propagate change to user 1602 } 1603 1604 // CmpU nodes can get their type information from two nodes up in the 1605 // graph (instead of from the nodes immediately above). Make sure they 1606 // are added to the worklist if nodes they depend on are updated, since 1607 // they could be missed and get wrong types otherwise. 1608 uint m_op = m->Opcode(); 1609 if (m_op == Op_AddI || m_op == Op_SubI) { 1610 for (DUIterator_Fast i2max, i2 = m->fast_outs(i2max); i2 < i2max; i2++) { 1611 Node* p = m->fast_out(i2); // Propagate changes to uses 1612 if (p->Opcode() == Op_CmpU) { 1613 // Got a CmpU which might need the new type information from node n. 1614 if(p->bottom_type() != type(p)) { // If not already bottomed out 1615 worklist.push(p); // Propagate change to user 1616 } 1617 } 1618 } 1619 } 1620 } 1621 } 1622 } 1623 } 1624 1625 //------------------------------do_transform----------------------------------- 1626 // Top level driver for the recursive transformer 1627 void PhaseCCP::do_transform() { 1628 // Correct leaves of new-space Nodes; they point to old-space. 1629 C->set_root( transform(C->root())->as_Root() ); 1630 assert( C->top(), "missing TOP node" ); 1631 assert( C->root(), "missing root" ); 1632 } 1633 1634 //------------------------------transform-------------------------------------- 1635 // Given a Node in old-space, clone him into new-space. 1636 // Convert any of his old-space children into new-space children. 1637 Node *PhaseCCP::transform( Node *n ) { 1638 Node *new_node = _nodes[n->_idx]; // Check for transformed node 1639 if( new_node != NULL ) 1640 return new_node; // Been there, done that, return old answer 1641 new_node = transform_once(n); // Check for constant 1642 _nodes.map( n->_idx, new_node ); // Flag as having been cloned 1643 1644 // Allocate stack of size _nodes.Size()/2 to avoid frequent realloc 1645 GrowableArray <Node *> trstack(C->live_nodes() >> 1); 1646 1647 trstack.push(new_node); // Process children of cloned node 1648 while ( trstack.is_nonempty() ) { 1649 Node *clone = trstack.pop(); 1650 uint cnt = clone->req(); 1651 for( uint i = 0; i < cnt; i++ ) { // For all inputs do 1652 Node *input = clone->in(i); 1653 if( input != NULL ) { // Ignore NULLs 1654 Node *new_input = _nodes[input->_idx]; // Check for cloned input node 1655 if( new_input == NULL ) { 1656 new_input = transform_once(input); // Check for constant 1657 _nodes.map( input->_idx, new_input );// Flag as having been cloned 1658 trstack.push(new_input); 1659 } 1660 assert( new_input == clone->in(i), "insanity check"); 1661 } 1662 } 1663 } 1664 return new_node; 1665 } 1666 1667 1668 //------------------------------transform_once--------------------------------- 1669 // For PhaseCCP, transformation is IDENTITY unless Node computed a constant. 1670 Node *PhaseCCP::transform_once( Node *n ) { 1671 const Type *t = type(n); 1672 // Constant? Use constant Node instead 1673 if( t->singleton() ) { 1674 Node *nn = n; // Default is to return the original constant 1675 if( t == Type::TOP ) { 1676 // cache my top node on the Compile instance 1677 if( C->cached_top_node() == NULL || C->cached_top_node()->in(0) == NULL ) { 1678 C->set_cached_top_node(ConNode::make(Type::TOP)); 1679 set_type(C->top(), Type::TOP); 1680 } 1681 nn = C->top(); 1682 } 1683 if( !n->is_Con() ) { 1684 if( t != Type::TOP ) { 1685 nn = makecon(t); // ConNode::make(t); 1686 NOT_PRODUCT( inc_constants(); ) 1687 } else if( n->is_Region() ) { // Unreachable region 1688 // Note: nn == C->top() 1689 n->set_req(0, NULL); // Cut selfreference 1690 // Eagerly remove dead phis to avoid phis copies creation. 1691 for (DUIterator i = n->outs(); n->has_out(i); i++) { 1692 Node* m = n->out(i); 1693 if( m->is_Phi() ) { 1694 assert(type(m) == Type::TOP, "Unreachable region should not have live phis."); 1695 replace_node(m, nn); 1696 --i; // deleted this phi; rescan starting with next position 1697 } 1698 } 1699 } 1700 replace_node(n,nn); // Update DefUse edges for new constant 1701 } 1702 return nn; 1703 } 1704 1705 // If x is a TypeNode, capture any more-precise type permanently into Node 1706 if (t != n->bottom_type()) { 1707 hash_delete(n); // changing bottom type may force a rehash 1708 n->raise_bottom_type(t); 1709 _worklist.push(n); // n re-enters the hash table via the worklist 1710 } 1711 1712 // TEMPORARY fix to ensure that 2nd GVN pass eliminates NULL checks 1713 switch( n->Opcode() ) { 1714 case Op_FastLock: // Revisit FastLocks for lock coarsening 1715 case Op_If: 1716 case Op_CountedLoopEnd: 1717 case Op_Region: 1718 case Op_Loop: 1719 case Op_CountedLoop: 1720 case Op_Conv2B: 1721 case Op_Opaque1: 1722 case Op_Opaque2: 1723 _worklist.push(n); 1724 break; 1725 default: 1726 break; 1727 } 1728 1729 return n; 1730 } 1731 1732 //---------------------------------saturate------------------------------------ 1733 const Type* PhaseCCP::saturate(const Type* new_type, const Type* old_type, 1734 const Type* limit_type) const { 1735 const Type* wide_type = new_type->widen(old_type, limit_type); 1736 if (wide_type != new_type) { // did we widen? 1737 // If so, we may have widened beyond the limit type. Clip it back down. 1738 new_type = wide_type->filter(limit_type); 1739 } 1740 return new_type; 1741 } 1742 1743 //------------------------------print_statistics------------------------------- 1744 #ifndef PRODUCT 1745 void PhaseCCP::print_statistics() { 1746 tty->print_cr("CCP: %d constants found: %d", _total_invokes, _total_constants); 1747 } 1748 #endif 1749 1750 1751 //============================================================================= 1752 #ifndef PRODUCT 1753 uint PhasePeephole::_total_peepholes = 0; 1754 #endif 1755 //------------------------------PhasePeephole---------------------------------- 1756 // Conditional Constant Propagation, ala Wegman & Zadeck 1757 PhasePeephole::PhasePeephole( PhaseRegAlloc *regalloc, PhaseCFG &cfg ) 1758 : PhaseTransform(Peephole), _regalloc(regalloc), _cfg(cfg) { 1759 NOT_PRODUCT( clear_peepholes(); ) 1760 } 1761 1762 #ifndef PRODUCT 1763 //------------------------------~PhasePeephole--------------------------------- 1764 PhasePeephole::~PhasePeephole() { 1765 _total_peepholes += count_peepholes(); 1766 } 1767 #endif 1768 1769 //------------------------------transform-------------------------------------- 1770 Node *PhasePeephole::transform( Node *n ) { 1771 ShouldNotCallThis(); 1772 return NULL; 1773 } 1774 1775 //------------------------------do_transform----------------------------------- 1776 void PhasePeephole::do_transform() { 1777 bool method_name_not_printed = true; 1778 1779 // Examine each basic block 1780 for (uint block_number = 1; block_number < _cfg.number_of_blocks(); ++block_number) { 1781 Block* block = _cfg.get_block(block_number); 1782 bool block_not_printed = true; 1783 1784 // and each instruction within a block 1785 uint end_index = block->number_of_nodes(); 1786 // block->end_idx() not valid after PhaseRegAlloc 1787 for( uint instruction_index = 1; instruction_index < end_index; ++instruction_index ) { 1788 Node *n = block->get_node(instruction_index); 1789 if( n->is_Mach() ) { 1790 MachNode *m = n->as_Mach(); 1791 int deleted_count = 0; 1792 // check for peephole opportunities 1793 MachNode *m2 = m->peephole(block, instruction_index, _regalloc, deleted_count); 1794 if( m2 != NULL ) { 1795 #ifndef PRODUCT 1796 if( PrintOptoPeephole ) { 1797 // Print method, first time only 1798 if( C->method() && method_name_not_printed ) { 1799 C->method()->print_short_name(); tty->cr(); 1800 method_name_not_printed = false; 1801 } 1802 // Print this block 1803 if( Verbose && block_not_printed) { 1804 tty->print_cr("in block"); 1805 block->dump(); 1806 block_not_printed = false; 1807 } 1808 // Print instructions being deleted 1809 for( int i = (deleted_count - 1); i >= 0; --i ) { 1810 block->get_node(instruction_index-i)->as_Mach()->format(_regalloc); tty->cr(); 1811 } 1812 tty->print_cr("replaced with"); 1813 // Print new instruction 1814 m2->format(_regalloc); 1815 tty->print("\n\n"); 1816 } 1817 #endif 1818 // Remove old nodes from basic block and update instruction_index 1819 // (old nodes still exist and may have edges pointing to them 1820 // as register allocation info is stored in the allocator using 1821 // the node index to live range mappings.) 1822 uint safe_instruction_index = (instruction_index - deleted_count); 1823 for( ; (instruction_index > safe_instruction_index); --instruction_index ) { 1824 block->remove_node( instruction_index ); 1825 } 1826 // install new node after safe_instruction_index 1827 block->insert_node(m2, safe_instruction_index + 1); 1828 end_index = block->number_of_nodes() - 1; // Recompute new block size 1829 NOT_PRODUCT( inc_peepholes(); ) 1830 } 1831 } 1832 } 1833 } 1834 } 1835 1836 //------------------------------print_statistics------------------------------- 1837 #ifndef PRODUCT 1838 void PhasePeephole::print_statistics() { 1839 tty->print_cr("Peephole: peephole rules applied: %d", _total_peepholes); 1840 } 1841 #endif 1842 1843 1844 //============================================================================= 1845 //------------------------------set_req_X-------------------------------------- 1846 void Node::set_req_X( uint i, Node *n, PhaseIterGVN *igvn ) { 1847 assert( is_not_dead(n), "can not use dead node"); 1848 assert( igvn->hash_find(this) != this, "Need to remove from hash before changing edges" ); 1849 Node *old = in(i); 1850 set_req(i, n); 1851 1852 // old goes dead? 1853 if( old ) { 1854 switch (old->outcnt()) { 1855 case 0: 1856 // Put into the worklist to kill later. We do not kill it now because the 1857 // recursive kill will delete the current node (this) if dead-loop exists 1858 if (!old->is_top()) 1859 igvn->_worklist.push( old ); 1860 break; 1861 case 1: 1862 if( old->is_Store() || old->has_special_unique_user() ) 1863 igvn->add_users_to_worklist( old ); 1864 break; 1865 case 2: 1866 if( old->is_Store() ) 1867 igvn->add_users_to_worklist( old ); 1868 if( old->Opcode() == Op_Region ) 1869 igvn->_worklist.push(old); 1870 break; 1871 case 3: 1872 if( old->Opcode() == Op_Region ) { 1873 igvn->_worklist.push(old); 1874 igvn->add_users_to_worklist( old ); 1875 } 1876 break; 1877 default: 1878 break; 1879 } 1880 } 1881 1882 } 1883 1884 //-------------------------------replace_by----------------------------------- 1885 // Using def-use info, replace one node for another. Follow the def-use info 1886 // to all users of the OLD node. Then make all uses point to the NEW node. 1887 void Node::replace_by(Node *new_node) { 1888 assert(!is_top(), "top node has no DU info"); 1889 for (DUIterator_Last imin, i = last_outs(imin); i >= imin; ) { 1890 Node* use = last_out(i); 1891 uint uses_found = 0; 1892 for (uint j = 0; j < use->len(); j++) { 1893 if (use->in(j) == this) { 1894 if (j < use->req()) 1895 use->set_req(j, new_node); 1896 else use->set_prec(j, new_node); 1897 uses_found++; 1898 } 1899 } 1900 i -= uses_found; // we deleted 1 or more copies of this edge 1901 } 1902 } 1903 1904 //============================================================================= 1905 //----------------------------------------------------------------------------- 1906 void Type_Array::grow( uint i ) { 1907 if( !_max ) { 1908 _max = 1; 1909 _types = (const Type**)_a->Amalloc( _max * sizeof(Type*) ); 1910 _types[0] = NULL; 1911 } 1912 uint old = _max; 1913 while( i >= _max ) _max <<= 1; // Double to fit 1914 _types = (const Type**)_a->Arealloc( _types, old*sizeof(Type*),_max*sizeof(Type*)); 1915 memset( &_types[old], 0, (_max-old)*sizeof(Type*) ); 1916 } 1917 1918 //------------------------------dump------------------------------------------- 1919 #ifndef PRODUCT 1920 void Type_Array::dump() const { 1921 uint max = Size(); 1922 for( uint i = 0; i < max; i++ ) { 1923 if( _types[i] != NULL ) { 1924 tty->print(" %d\t== ", i); _types[i]->dump(); tty->cr(); 1925 } 1926 } 1927 } 1928 #endif