274       // for cases where the reached use is not covered by any of the defs  in getAllReachingDefs()
419   // defs, no more uses can be reached.  in getAllReachedUses()
423   // Add all directly reached uses.  in getAllReachedUses()
437   // Traverse all reached defs. This time dead defs cannot be ignored.  in getAllReachedUses()
479     // Go over all defs and collect the reached uses that are non-phi uses  in computePhiInfo()
484     // Have a work queue of defs whose reached uses need to be found.  in computePhiInfo()
485     // For each def, add to the queue all reached (non-phi) defs.  in computePhiInfo()
498     // Collect the super-set of all possible reached uses. This set will  in computePhiInfo()
499     // contain all uses reached from this phi, either directly from the  in computePhiInfo()
500     // phi defs, or (recursively) via non-phi defs reached by the phi defs.  in computePhiInfo()
502     // are actually reached by the phi defs.  in computePhiInfo()
505       // Visit all reached uses. Phi defs should not really have the "dead"  in computePhiInfo()
518       // Visit all reached defs, and add them to the queue. These defs may  in computePhiInfo()
526           // Must traverse the reached-def chain. Consider:  in computePhiInfo()
539     //      = R1:0     u2     Reached by d1.  in computePhiInfo()
541     //      = R1:0     u4     Still reached by d1: indirectly through  in computePhiInfo()
544     //      = R1:0     u6     Not reached by d1 (covered collectively  in computePhiInfo()
545     //                        by d3 and d5), but following reached  in computePhiInfo()
548       // For each reached register UI->first, there is a set UI->second, of  in computePhiInfo()
549       // uses of it. For each such use, check if it is reached by this phi,  in computePhiInfo()
563         // Calculate the exposed part of the reached use.  in computePhiInfo()
631   // Propagate the reached registers up in the phi chain.  in computePhiInfo()
645   // the phi node (1). However, the use u4 is not reached by phi (1),  in computePhiInfo()
684         // Collect the set PropUp of uses that are reached by the current  in computePhiInfo()
696         //   for each (R,U) : U is use node of R, U is reached by PA  in computePhiInfo()
801   // Build the phi live-on-exit map. Each phi node has some set of reached  in computeLiveIns()
819         // Each phi has some set (possibly empty) of reached "real" uses,  in computeLiveIns()
825         // chain will need to fork at this phi, since some of the reached  in computeLiveIns()
827         // For each reached "real" use, identify the set of reaching defs  in computeLiveIns()
1096           // We have reached past the beginning of B, and the accumulated  in traverse()