76 // The order in the returned sequence is the order of reaching defs in the
79 // The list ends at a reaching phi def, or when the reference from RefA is
82 // (1) Returning the sequence of reaching defs for a particular reference
84 // (2) Returning a partial sequence of reaching defs, where the final goal
120   // The initial queue should not have reaching defs for shadows. The  in getAllReachingDefs()
121   // whole point of a shadow is that it will have a reaching def that  in getAllReachingDefs()
122   // is not aliased to the reaching defs of the related shadows.  in getAllReachingDefs()
133   // Collect all the reaching defs, going up until a phi node is encountered,  in getAllReachingDefs()
134   // or there are no more reaching defs. From this set, the actual set of  in getAllReachingDefs()
135   // reaching defs will be selected.  in getAllReachingDefs()
148     // Get the next level of reaching defs. This will include multiple  in getAllReachingDefs()
149     // reaching defs for shadows.  in getAllReachingDefs()
153     // Don't visit sibling defs. They share the same reaching def (which  in getAllReachingDefs()
342     // Go over all phi uses and get the reaching defs for each use.  in getAllReachingDefsRecImpl()
471   // phi use -> (map: reaching phi -> set of registers defined in between)  in computePhiInfo()
550       // i.e. check if the set of its reaching uses intersects the set of  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()
587     // While traversing the list of reaching defs for each phi use, accumulate  in computePhiInfo()
589     // of the reaching def.  in computePhiInfo()
649   // When propagating uses up the phi chains, get the all reaching defs  in computePhiInfo()
651   // is covered, or until reaching the final phi. Only assume that the  in computePhiInfo()
803   // through the reaching defs of the corresponding phi uses.  in computeLiveIns()
822         // reaching defs will eventually lead to this phi.  in computeLiveIns()
823         // Any chain of reaching defs may fork at a phi node, but there  in computeLiveIns()
827         // For each reached "real" use, identify the set of reaching defs  in computeLiveIns()
837             // all reaching defs starting from the phi use, and treating  in computeLiveIns()
976 // Helper function to obtain the basic block containing the reaching def
987   // reaching defs of that register that are live on entry to the associated  in traverse()
1030   // Add reaching defs of phi uses that are live on exit from this block.  in traverse()
1043   // defs that are present in this block. Then we will add reaching defs of  in traverse()
1094         // Reaching defs are ordered in the upward direction.  in traverse()
1147   // are not dominated by their corresponding reaching defs.  in traverse()