Lines Matching defs:SCC
22 /// "SCC based value numbering" by L. Taylor Simpson) with one major difference:
178 // Tarjan's SCC finding algorithm with Nuutila's improvements
180 // It also wants to hand us SCC's that are unrelated to the phi node we ask
183 // This SCC finder is specialized to walk use-def chains, and only follows
248 // of SCC's, but not individual member order
1705 // In order to compute cycle-freeness, we do SCC finding on the instruction,
1706 // and see what kind of SCC it ends up in. If it is a singleton, it is
1713 auto &SCC = SCCFinder.getComponentFor(I);
1714 // It's cycle free if it's size 1 or the SCC is *only* phi nodes.
1715 if (SCC.size() == 1)
1718 bool AllPhis = llvm::all_of(SCC, [](const Value *V) {
1722 for (const auto *Member : SCC)