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