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