Lines Matching refs:live
29 #include "opto/live.hpp"
36 // Compute live-in/live-out. We use a totally incremental algorithm. The LIVE
39 // live-in from the block. Push these to the live-out sets of all predecessor
40 // blocks. At each predecessor, the new live-out values are ANDed with what is
41 // already live-out (extra stuff is added to the live-out sets). Then the
42 // remaining new live-out values are ANDed with what is locally defined.
43 // Leftover bits become the new live-in for the predecessor block, and the pred
45 // The locally live-in stuff is computed once and added to predecessor
46 // live-out sets. This separate compilation is done in the outer loop below.
54 // Init the sparse live arrays. This data is live on exit from here!
55 // The _live info is the live-out info.
82 // Outer loop: must compute local live-in sets and push into predecessors.
87 // Compute the local live-in set. Start with any new live-out bits.
122 // Push these live-in things to predecessors
127 // PhiNode uses go in the live-out set of prior blocks.
134 // Inner loop: blocks that picked up new live-out values to be propagated
144 // Add new-live-in to predecessors live-out sets
186 return delta; // Return set of new live-out items
218 // Add a live-out value to a given blocks live-out set. If it is new, then
221 IndexSet *live = &_live[p->_pre_order-1];
222 if( live->insert(r) ) { // If actually inserted...
223 // We extended the live-out set. See if the value is generated locally.
224 // If it is not, then we must extend the live-in set.
236 // Add a vector of live-out values to a given blocks live-out set.
238 IndexSet *live = &_live[p->_pre_order-1];
246 if( live->insert(r) && // If actually inserted...
248 delta->insert(r); // Then add to live-in set
264 // Dump the live-out set for a block
291 // Now scan for a live derived pointer