Home
last modified time | relevance | path

Searched refs:findNode (Results 1 – 5 of 5) sorted by relevance

/llvm-project-15.0.7/llvm/include/llvm/ADT/
H A DDirectedGraph.h207 const_iterator findNode(const NodeType &N) const { in findNode() function
211 iterator findNode(const NodeType &N) { in findNode() function
213 static_cast<const DGraphType &>(*this).findNode(N)); in findNode()
218 if (findNode(N) != Nodes.end()) in addNode()
244 iterator IT = findNode(N); in removeNode()
266 assert(findNode(Src) != Nodes.end() && "Src node should be present."); in connect()
267 assert(findNode(Dst) != Nodes.end() && "Dst node should be present."); in connect()
/llvm-project-15.0.7/llvm/unittests/ADT/
H A DDirectedGraphTest.cpp126 EXPECT_NE(DG.findNode(N3), DG.end()); in TEST()
130 EXPECT_EQ(DG.findNode(N4), DG.end()); in TEST()
231 EXPECT_EQ(DG.findNode(N1), DG.end()); in TEST()
/llvm-project-15.0.7/clang/unittests/StaticAnalyzer/
H A DReusables.h23 const T *findNode(const Decl *Where, MatcherT What) { in findNode() function
38 return findNode<T>(Where, namedDecl(hasName(Name))); in findDeclByName()
H A DStoreTest.cpp119 const auto *CL = findNode<CompoundLiteralExpr>(D, compoundLiteralExpr()); in performTest()
H A DCallDescriptionTest.cpp88 const Expr *E = findNode<T>(D, MatcherCreator()); in performTest()