reference, declarationdefinition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced

References

include/llvm/Analysis/LazyCallGraph.h
  564       SCCs.clear();
  583           OS << "..., " << *RC.SCCs.back();
  619     iterator begin() const { return SCCs.begin(); }
  620     iterator end() const { return SCCs.end(); }
  622     ssize_t size() const { return SCCs.size(); }
  624     SCC &operator[](int Idx) { return *SCCs[Idx]; }
  627       return SCCs.begin() + SCCIndices.find(&C)->second;
lib/Analysis/LazyCallGraph.cpp
  308   assert(!SCCs.empty() && "Can't have an empty SCC!");
  312   for (SCC *C : SCCs) {
  330     assert(SCCs[i] == C && "Index doesn't point to SCC!");
  334   for (int i = 0, Size = SCCs.size(); i < Size; ++i) {
  335     SCC &SourceSCC = *SCCs[i];
  583          make_range(SCCs.begin() + SourceIdx + 1, SCCs.begin() + TargetIdx + 1))
  583          make_range(SCCs.begin() + SourceIdx + 1, SCCs.begin() + TargetIdx + 1))
  626       SourceSCC, TargetSCC, SCCs, SCCIndices, ComputeSourceConnectedSet,
  667   auto EraseEnd = SCCs.erase(MergeRange.begin(), MergeRange.end());
  668   for (SCC *C : make_range(EraseEnd, SCCs.end()))
  876   SCCs.insert(SCCs.begin() + OldIdx, NewSCCs.begin(), NewSCCs.end());
  876   SCCs.insert(SCCs.begin() + OldIdx, NewSCCs.begin(), NewSCCs.end());
  880   for (int Idx = OldIdx, Size = SCCs.size(); Idx < Size; ++Idx)
  881     SCCIndices[SCCs[Idx]] = Idx;
  883   return make_range(SCCs.begin() + OldIdx,
  884                     SCCs.begin() + OldIdx + NewSCCs.size());
 1075       MergedSCCs = std::move(RC->SCCs);
 1077       MergedSCCs.append(RC->SCCs.begin(), RC->SCCs.end());
 1077       MergedSCCs.append(RC->SCCs.begin(), RC->SCCs.end());
 1078     RC->SCCs.clear();
 1085   MergedSCCs.append(SCCs.begin(), SCCs.end());
 1085   MergedSCCs.append(SCCs.begin(), SCCs.end());
 1086   SCCs = std::move(MergedSCCs);
 1180   for (SCC *C : SCCs) {
 1330   for (SCC *C : SCCs) {
 1342     int SCCIndex = RC.SCCs.size();
 1343     RC.SCCs.push_back(C);
 1351   SCCs.clear();
 1667   assert(RC.SCCs.empty() && "Already built SCCs!");
 1688         RC.SCCs.push_back(createSCC(RC, Nodes));
 1689         for (Node &N : *RC.SCCs.back()) {
 1691           SCCMap[&N] = RC.SCCs.back();
 1696   for (int i = 0, Size = RC.SCCs.size(); i < Size; ++i)
 1697     RC.SCCIndices[RC.SCCs[i]] = i;