Home
last modified time | relevance | path

Searched refs:SCCs (Results 1 – 3 of 3) sorted by relevance

/freebsd-14.2/contrib/llvm-project/llvm/lib/Analysis/
H A DLazyCallGraph.cpp338 for (SCC *C : SCCs) { in verify()
376 for (SCC *C : SCCs) { in verify()
526 SCCs.begin() + SourceIdx, SCCs.begin() + TargetIdx + 1, in updatePostorderSequenceForEdgeInsertion()
560 SCCs.begin() + SourceIdx + 1, SCCs.begin() + TargetIdx + 1, in updatePostorderSequenceForEdgeInsertion()
573 return make_range(SCCs.begin() + SourceIdx, SCCs.begin() + TargetIdx); in updatePostorderSequenceForEdgeInsertion()
911 SCCs.insert(SCCs.begin() + OldIdx, NewSCCs.begin(), NewSCCs.end()); in switchInternalEdgeToRef()
1106 MergedSCCs.append(RC->SCCs.begin(), RC->SCCs.end()); in insertIncomingRefEdge()
1107 RC->SCCs.clear(); in insertIncomingRefEdge()
1114 MergedSCCs.append(SCCs.begin(), SCCs.end()); in insertIncomingRefEdge()
1376 SCCs.clear(); in removeInternalRefEdge()
[all …]
H A DSyntheticCountsUtils.cpp86 std::vector<SccTy> SCCs; in propagate() local
90 SCCs.push_back(*I); in propagate()
95 for (auto &SCC : reverse(SCCs)) in propagate()
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DLazyCallGraph.h551 SmallVector<SCC *, 4> SCCs; variable
561 SCCs.clear(); in clear()
580 OS << "..., " << *RC.SCCs.back();
612 iterator begin() const { return SCCs.begin(); } in begin()
613 iterator end() const { return SCCs.end(); } in end()
615 ssize_t size() const { return SCCs.size(); } in size()
617 SCC &operator[](int Idx) { return *SCCs[Idx]; }
620 return SCCs.begin() + SCCIndices.find(&C)->second; in find()