Searched refs:EdgeSequence (Results 1 – 2 of 2) sorted by relevance
113 class EdgeSequence; variable164 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 Optional<EdgeSequence> Edges;388 EdgeSequence &populateSlow();[all …]
45 void LazyCallGraph::EdgeSequence::insertEdgeInternal(Node &TargetN, in insertEdgeInternal()51 void LazyCallGraph::EdgeSequence::setEdgeKind(Node &TargetN, Edge::Kind EK) { in setEdgeKind()55 bool LazyCallGraph::EdgeSequence::removeEdgeInternal(Node &TargetN) { in removeEdgeInternal()75 LazyCallGraph::EdgeSequence &LazyCallGraph::Node::populateSlow() { in populateSlow()81 Edges = EdgeSequence(); in populateSlow()788 SmallVector<std::pair<Node *, EdgeSequence::call_iterator>, 16> DFSStack; in switchInternalEdgeToRef()832 EdgeSequence::call_iterator I; in switchInternalEdgeToRef()1235 SmallVector<std::pair<Node *, EdgeSequence::iterator>, 4> DFSStack; in removeInternalRefEdge()1257 EdgeSequence::iterator I; in removeInternalRefEdge()1901 [](EdgeSequence::call_iterator I) -> Node & { return I->getNode(); }, in buildSCCs()[all …]