187   auto getNextOnPath = [&](BlockSet &Path) -> const BasicBlock * {  in findDependencies()  argument
188     assert(Path.size());  in findDependencies()
189     auto &Neighbors = AdjacencyList[Path.back()];  in findDependencies()
190     if (Path.size() == 1) {  in findDependencies()
197       assert(Path.size() >= 2);  in findDependencies()
198       return Path.count(Neighbors[0]) ? Neighbors[1] : Neighbors[0];  in findDependencies()
209       BlockSet Path;  in findDependencies()  local
210       Path.insert(&BB);  in findDependencies()
211       while (const BasicBlock *Next = getNextOnPath(Path))  in findDependencies()
212         Path.insert(Next);  in findDependencies()
213       LLVM_DEBUG(dbgs() << "Found path: " << getBlockNames(Path) << "\n");  in findDependencies()
216       for (auto *BB : Path)  in findDependencies()
220       if (PredecessorDependencies[Path.front()].size()) {  in findDependencies()
221         for (auto *BB : Path)  in findDependencies()
222           if (BB != Path.back())  in findDependencies()
225         for (auto *BB : Path)  in findDependencies()
226           if (BB != Path.front())  in findDependencies()