Searched refs:EdgeSequence (Results 1 – 2 of 2) sorted by relevance
115 class EdgeSequence; variable168 friend class LazyCallGraph::EdgeSequence;186 class EdgeSequence {298 EdgeSequence() = default;358 EdgeSequence &operator*() const {360 return const_cast<EdgeSequence &>(*Edges);362 EdgeSequence *operator->() const { return &**this; }376 EdgeSequence &populate() { in populate()393 Optional<EdgeSequence> Edges;400 EdgeSequence &populateSlow();[all …]
43 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()724 SmallVector<std::pair<Node *, EdgeSequence::call_iterator>, 16> DFSStack; in switchInternalEdgeToRef()768 EdgeSequence::call_iterator I; in switchInternalEdgeToRef()1179 SmallVector<std::pair<Node *, EdgeSequence::iterator>, 4> DFSStack; in removeInternalRefEdge()1201 EdgeSequence::iterator I; in removeInternalRefEdge()1673 [](EdgeSequence::call_iterator I) -> Node & { return I->getNode(); }, in buildSCCs()[all …]