342     // Go over all phi uses and get the reaching defs for each use.  in getAllReachingDefsRecImpl()
416   NodeSet Uses;  in getAllReachedUses()  local
419   // defs, no more uses can be reached.  in getAllReachedUses()
421     return Uses;  in getAllReachedUses()
423   // Add all directly reached uses.  in getAllReachedUses()
432         Uses.insert(U);  in getAllReachedUses()
455     Uses.insert(T.begin(), T.end());  in getAllReachedUses()
457   return Uses;  in getAllReachedUses()
479     // Go over all defs and collect the reached uses that are non-phi uses  in computePhiInfo()
480     // (i.e. the "real uses").  in computePhiInfo()
484     // Have a work queue of defs whose reached uses need to be found.  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()
501     // This set of uses will later be trimmed to only contain these uses that  in computePhiInfo()
505       // Visit all reached uses. Phi defs should not really have the "dead"  in computePhiInfo()
519       // override some of the uses collected here, but that will be handled  in computePhiInfo()
535     // Filter out these uses that appear to be reachable, but really  in computePhiInfo()
546     //                        defs and uses from d1 will lead here.  in computePhiInfo()
549       // uses of it. For each such use, check if it is reached by this phi,  in computePhiInfo()
550       // i.e. check if the set of its reaching uses intersects the set of  in computePhiInfo()
552       NodeRefSet Uses = UI->second;  in computePhiInfo()  local
554       for (std::pair<NodeId, LaneBitmask> I : Uses) {  in computePhiInfo()
558         RegisterRef UseR(UI->first, I.second); // Ref from Uses  in computePhiInfo()
559         // R = intersection of the ref from the phi and the ref from Uses  in computePhiInfo()
580     // If this phi reaches some "real" uses, add it to the queue for upward  in computePhiInfo()
585     // Go over all phi uses and check if the reaching def is another phi.  in computePhiInfo()
586     // Collect the phis that are among the reaching defs of these uses.  in computePhiInfo()
649   // When propagating uses up the phi chains, get the all reaching defs  in computePhiInfo()
684         // Collect the set PropUp of uses that are reached by the current  in computePhiInfo()
703           // reach a whole variety of uses that are not related to the  in computePhiInfo()
802   // "real" uses. Propagate this set backwards into the block predecessors  in computeLiveIns()
803   // through the reaching defs of the corresponding phi uses.  in computeLiveIns()
819         // Each phi has some set (possibly empty) of reached "real" uses,  in computeLiveIns()
820         // that is, uses that are part of the compiled program. Such a use  in computeLiveIns()
826         // uses may have definitions joining in from multiple predecessors.  in computeLiveIns()
853       } // for U : phi uses  in computeLiveIns()
1030   // Add reaching defs of phi uses that are live on exit from this block.  in traverse()
1044   // all upward-exposed uses.  in traverse()
1125   // Scan the block for upward-exposed uses and add them to the tracking set.  in traverse()
1141     dbgs() << "after uses in block\n";  in traverse()
1146   // Phi uses should not be propagated up the dominator tree, since they  in traverse()
1158     dbgs() << "after phi uses in block\n";  in traverse()