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

References

lib/Analysis/LazyCallGraph.cpp
  238     assert(OuterRefSCC->G->lookupSCC(*N) == this &&
  256       if (OuterRefSCC->G->lookupSCC(E.getNode()) == &C)
  267   LazyCallGraph &G = *OuterRefSCC->G;
  307   assert(G && "Can't have a null graph!");
  340         SCC &TargetSCC = *G->lookupSCC(E.getNode());
  359         if (G->lookupRefSCC(E.getNode()) == &RC)
  381           auto *ChildRC = G->lookupRefSCC(E.getNode());
  542   SCC &SourceSCC = *G->lookupSCC(SourceN);
  543   SCC &TargetSCC = *G->lookupSCC(TargetN);
  576           if (ConnectedSet.count(G->lookupSCC(E.getNode())))
  607           SCC &EdgeC = *G->lookupSCC(E.getNode());
  659       G->SCCMap[N] = &TargetSCC;
  689   assert(G->lookupRefSCC(SourceN) == this &&
  691   assert(G->lookupRefSCC(TargetN) == this &&
  693   assert(G->lookupSCC(SourceN) != G->lookupSCC(TargetN) &&
  693   assert(G->lookupSCC(SourceN) != G->lookupSCC(TargetN) &&
  711   assert(G->lookupRefSCC(SourceN) == this &&
  713   assert(G->lookupRefSCC(TargetN) == this &&
  716   SCC &TargetSCC = *G->lookupSCC(TargetN);
  717   assert(G->lookupSCC(SourceN) == &TargetSCC && "Source and Target must be in "
  746     G->SCCMap.erase(N);
  759   G->SCCMap[&TargetN] = &OldSCC;
  791           assert(!G->SCCMap.count(&ChildN) &&
  802           if (G->lookupSCC(ChildN) == &OldSCC) {
  815               G->SCCMap[&N] = &OldSCC;
  862       NewSCCs.push_back(G->createSCC(*this, SCCNodes));
  865         G->SCCMap[&N] = NewSCCs.back();
  891   assert(G->lookupRefSCC(SourceN) == this && "Source must be in this RefSCC.");
  892   assert(G->lookupRefSCC(TargetN) != this &&
  913   assert(G->lookupRefSCC(SourceN) == this && "Source must be in this RefSCC.");
  914   assert(G->lookupRefSCC(TargetN) != this &&
  933   assert(G->lookupRefSCC(SourceN) == this && "Source must be in this RefSCC.");
  934   assert(G->lookupRefSCC(TargetN) == this && "Target must be in this RefSCC.");
  949   assert(G->lookupRefSCC(SourceN) == this && "Source must be in this RefSCC.");
  951   assert(G->lookupRefSCC(TargetN) != this &&
  966   assert(G->lookupRefSCC(TargetN) == this && "Target must be in this RefSCC.");
  967   RefSCC &SourceC = *G->lookupRefSCC(SourceN);
  983   int SourceIdx = G->RefSCCIndices[&SourceC];
  984   int TargetIdx = G->RefSCCIndices[this];
 1001             if (Set.count(G->lookupRefSCC(E.getNode())))
 1007     for (RefSCC *C : make_range(G->PostOrderRefSCCs.begin() + SourceIdx + 1,
 1008                                 G->PostOrderRefSCCs.begin() + TargetIdx + 1))
 1026             RefSCC &EdgeRC = *G->lookupRefSCC(E.getNode());
 1027             if (G->getRefSCCIndex(EdgeRC) <= SourceIdx)
 1043           SourceC, *this, G->PostOrderRefSCCs, G->RefSCCIndices,
 1043           SourceC, *this, G->PostOrderRefSCCs, G->RefSCCIndices,
 1069         G->SCCMap[&N] = &InnerC;
 1090     G->RefSCCIndices.erase(RC);
 1093       G->PostOrderRefSCCs.erase(MergeRange.begin(), MergeRange.end());
 1094   for (RefSCC *RC : make_range(EraseEnd, G->PostOrderRefSCCs.end()))
 1095     G->RefSCCIndices[RC] -= IndexOffset;
 1109   assert(G->lookupRefSCC(SourceN) == this &&
 1111   assert(G->lookupRefSCC(TargetN) != this &&
 1141     if (G)
 1163   SCC &SourceC = *G->lookupSCC(SourceN);
 1165         return G->lookupSCC(*TargetN) == &SourceC;
 1314     Result.push_back(G->createRefSCC(*G));
 1314     Result.push_back(G->createRefSCC(*G));
 1323   int Idx = G->getRefSCCIndex(*this);
 1324   G->PostOrderRefSCCs.erase(G->PostOrderRefSCCs.begin() + Idx);
 1324   G->PostOrderRefSCCs.erase(G->PostOrderRefSCCs.begin() + Idx);
 1325   G->PostOrderRefSCCs.insert(G->PostOrderRefSCCs.begin() + Idx, Result.begin(),
 1325   G->PostOrderRefSCCs.insert(G->PostOrderRefSCCs.begin() + Idx, Result.begin(),
 1327   for (int i : seq<int>(Idx, G->PostOrderRefSCCs.size()))
 1328     G->RefSCCIndices[G->PostOrderRefSCCs[i]] = i;
 1328     G->RefSCCIndices[G->PostOrderRefSCCs[i]] = i;
 1350   G = nullptr;
 1370   assert(G->lookupRefSCC(SourceN) == this && "Source must be in this RefSCC.");
 1371   RefSCC &TargetRC = *G->lookupRefSCC(TargetN);
 1452   assert(G->lookupRefSCC(N) == this &&
 1455   assert(G->NodeMap.find(&NewF) == G->NodeMap.end() &&
 1455   assert(G->NodeMap.find(&NewF) == G->NodeMap.end() &&
 1472   G->NodeMap.erase(&OldF);
 1473   G->NodeMap[&NewF] = &N;
 1550   RC.G = nullptr;
 1567     RC->G = this;