Searched refs:HasEdge (Results 1 - 4 of 4) sorted by relevance

/freebsd-current/contrib/llvm-project/llvm/lib/Analysis/
H A DDomTreeUpdater.cpp36 const bool HasEdge = llvm::is_contained(successors(From), To); local
42 if (Kind == DominatorTree::Insert && !HasEdge)
46 if (Kind == DominatorTree::Delete && HasEdge)
/freebsd-current/contrib/googletest/googlemock/src/
H A Dgmock-matchers.cc187 if (!graph_->HasEdge(ilhs, irhs)) continue;
276 ss << HasEdge(i, j);
396 char matched = matrix.HasEdge(ilhs, irhs);
/freebsd-current/contrib/googletest/googlemock/test/
H A Dgmock-matchers-misc_test.cc458 if (!graph_->HasEdge(ilhs, irhs)) {
514 EXPECT_TRUE(graph.HasEdge(ilhs, irhs));
/freebsd-current/contrib/googletest/googlemock/include/gmock/
H A Dgmock-matchers.h3523 bool HasEdge(size_t ilhs, size_t irhs) const { function in class:testing::internal::MatchMatrix

Completed in 183 milliseconds