Home
last modified time | relevance | path

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

/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DLazyCallGraph.h116 class EdgeSequence; variable
167 friend class LazyCallGraph::EdgeSequence;
185 class EdgeSequence {
296 EdgeSequence() = default;
349 EdgeSequence &operator*() const {
351 return const_cast<EdgeSequence &>(*Edges);
353 EdgeSequence *operator->() const { return &**this; }
367 EdgeSequence &populate() { in populate()
384 Optional<EdgeSequence> Edges;
391 EdgeSequence &populateSlow();
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/lib/Analysis/
H A DLazyCallGraph.cpp43 void LazyCallGraph::EdgeSequence::insertEdgeInternal(Node &TargetN, in insertEdgeInternal()
49 void LazyCallGraph::EdgeSequence::setEdgeKind(Node &TargetN, Edge::Kind EK) { in setEdgeKind()
53 bool LazyCallGraph::EdgeSequence::removeEdgeInternal(Node &TargetN) { in removeEdgeInternal()
73 LazyCallGraph::EdgeSequence &LazyCallGraph::Node::populateSlow() { in populateSlow()
79 Edges = EdgeSequence(); in populateSlow()
787 SmallVector<std::pair<Node *, EdgeSequence::call_iterator>, 16> DFSStack; in switchInternalEdgeToRef()
831 EdgeSequence::call_iterator I; in switchInternalEdgeToRef()
1234 SmallVector<std::pair<Node *, EdgeSequence::iterator>, 4> DFSStack; in removeInternalRefEdge()
1256 EdgeSequence::iterator I; in removeInternalRefEdge()
1913 [](EdgeSequence::call_iterator I) -> Node & { return I->getNode(); }, in buildSCCs()
[all …]