Home
last modified time | relevance | path

Searched refs:EdgeSequence (Results 1 – 2 of 2) sorted by relevance

/openbsd-src/gnu/llvm/llvm/include/llvm/Analysis/
H A DLazyCallGraph.h113 class EdgeSequence; variable
164 friend class LazyCallGraph::EdgeSequence;
182 class EdgeSequence {
293 EdgeSequence() = default;
346 EdgeSequence &operator*() const {
348 return const_cast<EdgeSequence &>(*Edges);
350 EdgeSequence *operator->() const { return &**this; }
364 EdgeSequence &populate() { in populate()
381 std::optional<EdgeSequence> Edges;
388 EdgeSequence &populateSlow();
[all …]
/openbsd-src/gnu/llvm/llvm/lib/Analysis/
H A DLazyCallGraph.cpp40 void LazyCallGraph::EdgeSequence::insertEdgeInternal(Node &TargetN, in insertEdgeInternal()
46 void LazyCallGraph::EdgeSequence::setEdgeKind(Node &TargetN, Edge::Kind EK) { in setEdgeKind()
50 bool LazyCallGraph::EdgeSequence::removeEdgeInternal(Node &TargetN) { in removeEdgeInternal()
70 LazyCallGraph::EdgeSequence &LazyCallGraph::Node::populateSlow() { in populateSlow()
76 Edges = EdgeSequence(); in populateSlow()
774 SmallVector<std::pair<Node *, EdgeSequence::call_iterator>, 16> DFSStack; in switchInternalEdgeToRef()
1219 SmallVector<std::pair<Node *, EdgeSequence::iterator>, 4> DFSStack; in removeInternalRefEdge()
1908 [](EdgeSequence::call_iterator I) -> Node & { return I->getNode(); }, in buildSCCs()
1942 [](EdgeSequence::iterator I) -> Node & { return I->getNode(); }, in buildRefSCCs()