Searched refs:RefSCC (Results 1 – 10 of 10) sorted by relevance
115 class RefSCC; variable165 friend class LazyCallGraph::RefSCC;185 friend class LazyCallGraph::RefSCC;317 friend class LazyCallGraph::RefSCC;423 RefSCC *OuterRefSCC;536 class RefSCC {550 RefSCC(LazyCallGraph &G);881 RefSCC *RC = nullptr;977 RefSCC *lookupRefSCC(Node &N) const { in lookupRefSCC()1137 DenseMap<RefSCC *, int> RefSCCIndices;[all …]
242 SmallPriorityWorklist<LazyCallGraph::RefSCC *, 1> &RCWorklist;265 SmallPtrSetImpl<LazyCallGraph::RefSCC *> &InvalidatedRefSCCs;
329 LazyCallGraph::RefSCC::RefSCC(LazyCallGraph &G) : G(&G) {} in RefSCC() function in LazyCallGraph::RefSCC338 void LazyCallGraph::RefSCC::verify() { in verify()408 bool LazyCallGraph::RefSCC::isParentOf(const RefSCC &RC) const { in isParentOf()422 bool LazyCallGraph::RefSCC::isAncestorOf(const RefSCC &RC) const { in isAncestorOf()1102 for (RefSCC *RC : MergeRange) { in insertIncomingRefEdge()1134 for (RefSCC *RC : MergeRange) in insertIncomingRefEdge()1174 SmallVector<RefSCC *, 1> Result; in removeInternalRefEdge()1399 for (RefSCC *RC : Result) in removeInternalRefEdge()1534 RefSCC &RC = C.getOuterRefSCC(); in removeDeadFunction()1639 RefSCC *NewRC = OriginalRC; in addSplitFunction()[all …]
160 SmallPtrSet<LazyCallGraph::RefSCC *, 4> InvalidRefSCCSet; in run()177 for (LazyCallGraph::RefSCC &RC : in run()897 using RefSCC = LazyCallGraph::RefSCC; in updateCGAndAnalysisManagerForPass() typedef899 RefSCC &InitialRC = InitialC.getOuterRefSCC(); in updateCGAndAnalysisManagerForPass()901 RefSCC *RC = &InitialRC; in updateCGAndAnalysisManagerForPass()978 RefSCC &TargetRC = TargetC.getOuterRefSCC(); in updateCGAndAnalysisManagerForPass()991 RefSCC &TargetRC = TargetC.getOuterRefSCC(); in updateCGAndAnalysisManagerForPass()1019 RefSCC &TargetRC = TargetC.getOuterRefSCC(); in updateCGAndAnalysisManagerForPass()1037 RefSCC &TargetRC = TargetC.getOuterRefSCC(); in updateCGAndAnalysisManagerForPass()1085 RefSCC &TargetRC = TargetC.getOuterRefSCC(); in updateCGAndAnalysisManagerForPass()[all …]
258 ; CHECK-LABEL: RefSCC with 1 call SCCs:262 ; CHECK-LABEL: RefSCC with 1 call SCCs:266 ; CHECK-LABEL: RefSCC with 1 call SCCs:270 ; CHECK-LABEL: RefSCC with 1 call SCCs:274 ; CHECK-LABEL: RefSCC with 1 call SCCs:278 ; CHECK-LABEL: RefSCC with 1 call SCCs:282 ; CHECK-LABEL: RefSCC with 1 call SCCs:286 ; CHECK-LABEL: RefSCC with 1 call SCCs:290 ; CHECK-LABEL: RefSCC with 1 call SCCs:294 ; CHECK-LABEL: RefSCC with 1 call SCCs:[all …]
11 ; CHECK: RefSCC with 1 call SCCs:15 ; CHECK: RefSCC with 1 call SCCs:
325 LazyCallGraph::RefSCC &D = *J++; in TEST()341 LazyCallGraph::RefSCC &B = *J++; in TEST()357 LazyCallGraph::RefSCC &C = *J++; in TEST()375 LazyCallGraph::RefSCC &A = *J++; in TEST()475 LazyCallGraph::RefSCC &RC = *I++; in TEST()560 LazyCallGraph::RefSCC &RC = *I++; in TEST()1240 LazyCallGraph::RefSCC &RC = *I++; in TEST()1334 LazyCallGraph::RefSCC &RC = *I; in TEST()1412 LazyCallGraph::RefSCC &RC = *I; in TEST()1479 LazyCallGraph::RefSCC &RC = *I; in TEST()[all …]
3 ; We want to run passes on every SCC in a RefSCC without bailing even if one of the SCCs becomes a …6 ; SCCs in the RefSCC become their own RefSCC as passes run on them. Otherwise we7 ; end up visiting the huge RefSCC the number of times that an SCC is split out
68 ; splitting the SCCs while leaving the RefSCC intact. This is accomplished by
13 ; CHECK: Running an SCC pass across the RefSCC: [(test1_a, test1_b, test1_c)]16 ; CHECK: Enqueuing a new RefSCC in the update worklist: [(test1_b)]