Home
last modified time | relevance | path

Searched refs:HasEdge (Results 1 – 3 of 3) sorted by relevance

/llvm-project-15.0.7/llvm/utils/unittest/googlemock/src/
H A Dgmock-matchers.cc185 if (!graph_->HasEdge(ilhs, irhs)) continue; in TryAugment()
276 ss << HasEdge(i, j); in DebugString()
379 char matched = matrix.HasEdge(ilhs, irhs); in VerifyMatchMatrix()
/llvm-project-15.0.7/llvm/lib/Analysis/
H A DDomTreeUpdater.cpp36 const bool HasEdge = llvm::is_contained(successors(From), To); in isUpdateValid() local
42 if (Kind == DominatorTree::Insert && !HasEdge) in isUpdateValid()
46 if (Kind == DominatorTree::Delete && HasEdge) in isUpdateValid()
/llvm-project-15.0.7/llvm/utils/unittest/googlemock/include/gmock/
H A Dgmock-matchers.h2869 bool HasEdge(size_t ilhs, size_t irhs) const {