Searched refs:HasEdge (Results 1 – 4 of 4) sorted by relevance
35 const bool HasEdge = llvm::is_contained(successors(From), To); in isUpdateValid() local41 if (Kind == DominatorTree::Insert && !HasEdge) in isUpdateValid()45 if (Kind == DominatorTree::Delete && HasEdge) in isUpdateValid()
295 if (!graph_->HasEdge(ilhs, irhs)) continue; in TryAugment()386 ss << HasEdge(i, j); in DebugString()489 char matched = matrix.HasEdge(ilhs, irhs); in VerifyMatchMatrix()
6041 if (!graph_->HasEdge(ilhs, irhs)) { in RecurseInto()6099 EXPECT_TRUE(graph.HasEdge(ilhs, irhs)); in TEST_P()
3637 bool HasEdge(size_t ilhs, size_t irhs) const {