17template <
typename GraphT>
inline bool hasCycle(
const GraphT &G) {
18 for (llvm::scc_iterator<GraphT> I = llvm::scc_begin(G), E = llvm::scc_end(G); I != E; ++I) {
19 const std::vector<typename llvm::GraphTraits<GraphT>::NodeRef> &SCC = *I;
24 auto *N = SCC.front();
25 for (
auto *child : llvm::children<GraphT>(N)) {