Searched refs:SCCs (Results 1 – 3 of 3) sorted by relevance
342 assert(!SCCs.empty() && "Can't have an empty SCC!"); in verify()346 for (SCC *C : SCCs) { in verify()362 assert(SCCs[I] == C && "Index doesn't point to SCC!"); in verify()366 for (int I = 0, Size = SCCs.size(); I < Size; ++I) { in verify()367 SCC &SourceSCC = *SCCs[I]; in verify()384 for (SCC *C : SCCs) { in verify()517 SCCT &SourceSCC, SCCT &TargetSCC, PostorderSequenceT &SCCs, in updatePostorderSequenceForEdgeInsertion() argument534 SCCs.begin() + SourceIdx, SCCs.begin() + TargetIdx + 1, in updatePostorderSequenceForEdgeInsertion()537 SCCIndices.find(SCCs[I])->second = I; in updatePostorderSequenceForEdgeInsertion()542 assert(SourceI > (SCCs.begin() + SourceIdx) && in updatePostorderSequenceForEdgeInsertion()[all …]
86 std::vector<SccTy> SCCs; in propagate() local90 SCCs.push_back(*I); in propagate()95 for (auto &SCC : reverse(SCCs)) in propagate()
551 SmallVector<SCC *, 4> SCCs; variable561 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()