Searched refs:SCCs (Results 1 – 4 of 4) sorted by relevance
308 assert(!SCCs.empty() && "Can't have an empty SCC!"); in verify()312 for (SCC *C : SCCs) { in verify()330 assert(SCCs[i] == C && "Index doesn't point to SCC!"); in verify()334 for (int i = 0, Size = SCCs.size(); i < Size; ++i) { in verify()335 SCC &SourceSCC = *SCCs[i]; in verify()460 SCCT &SourceSCC, SCCT &TargetSCC, PostorderSequenceT &SCCs, in updatePostorderSequenceForEdgeInsertion() argument477 SCCs.begin() + SourceIdx, SCCs.begin() + TargetIdx + 1, in updatePostorderSequenceForEdgeInsertion()480 SCCIndices.find(SCCs[i])->second = i; in updatePostorderSequenceForEdgeInsertion()485 assert(SourceI > (SCCs.begin() + SourceIdx) && in updatePostorderSequenceForEdgeInsertion()495 assert(SCCs[TargetIdx] == &TargetSCC && in updatePostorderSequenceForEdgeInsertion()[all …]
90 std::vector<SccTy> SCCs; in propagate() local94 SCCs.push_back(*I); in propagate()99 for (auto &SCC : reverse(SCCs)) in propagate()
554 SmallVector<SCC *, 4> SCCs; variable564 SCCs.clear(); in clear()583 OS << "..., " << *RC.SCCs.back();619 iterator begin() const { return SCCs.begin(); } in begin()620 iterator end() const { return SCCs.end(); } in end()622 ssize_t size() const { return SCCs.size(); } in size()624 SCC &operator[](int Idx) { return *SCCs[Idx]; }627 return SCCs.begin() + SCCIndices.find(&C)->second; in find()
218 \code{insert()} every time there is an edge connecting two SCCs in the507 all the vertices in another SCC when the two SCCs are adjacent in the520 // Add edges between all the vertices in two adjacent SCCs752 % LocalWords: typedef iterator adjacency SCC num scc CG cg resize SCCs di ch