Patch by Enna1!
Differential Revision: https://reviews.llvm.org/D58756
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@355715
91177308-0d34-0410-b5e6-
96231b3b80d8
for (unsigned I = 0, E = ValueInfo.getNumLevels(); I < E; ++I) {
auto Src = InstantiatedValue{Val, I};
// If there's an assignment edge from X to Y, it means Y is reachable from
- // X at S2 and X is reachable from Y at S1
+ // X at S3 and X is reachable from Y at S1
for (auto &Edge : ValueInfo.getNodeInfoAtLevel(I).Edges) {
propagate(Edge.Other, Src, MatchState::FlowFromReadOnly, ReachSet,
WorkList);