Home
last modified time | relevance | path

Searched refs:Worklist (Results 1 – 25 of 68) sorted by relevance

123

/NextBSD/contrib/llvm/include/llvm/Transforms/InstCombine/
HDInstCombineWorklist.h27 SmallVector<Instruction*, 256> Worklist; variable
36 : Worklist(std::move(Arg.Worklist)), in InstCombineWorklist()
39 Worklist = std::move(RHS.Worklist);
44 bool isEmpty() const { return Worklist.empty(); } in isEmpty()
49 if (WorklistMap.insert(std::make_pair(I, Worklist.size())).second) { in Add()
51 Worklist.push_back(I); in Add()
64 assert(Worklist.empty() && "Worklist must be empty to add initial group"); in AddInitialGroup()
65 Worklist.reserve(NumEntries+16); in AddInitialGroup()
71 Worklist.push_back(I); in AddInitialGroup()
81 Worklist[It->second] = nullptr; in Remove()
[all …]
HDInstCombine.h28 InstCombineWorklist Worklist; variable
35 InstCombinePass(InstCombinePass &&Arg) : Worklist(std::move(Arg.Worklist)) {} in InstCombinePass()
37 Worklist = std::move(RHS.Worklist);
/NextBSD/contrib/llvm/lib/Transforms/Scalar/
HDADCE.cpp57 SmallVector<Instruction*, 128> Worklist; in runOnFunction() local
64 Worklist.push_back(&I); in runOnFunction()
69 while (!Worklist.empty()) { in runOnFunction()
70 Instruction *Curr = Worklist.pop_back_val(); in runOnFunction()
74 Worklist.push_back(Inst); in runOnFunction()
84 Worklist.push_back(&I); in runOnFunction()
89 for (Instruction *&I : Worklist) { in runOnFunction()
94 return !Worklist.empty(); in runOnFunction()
HDLoopUnswitch.cpp231 void SimplifyCode(std::vector<Instruction*> &Worklist, Loop *L);
1000 std::vector<Instruction*> &Worklist) { in RemoveFromWorklist() argument
1002 Worklist.erase(std::remove(Worklist.begin(), Worklist.end(), I), in RemoveFromWorklist()
1003 Worklist.end()); in RemoveFromWorklist()
1009 std::vector<Instruction*> &Worklist, in ReplaceUsesOfWith() argument
1016 Worklist.push_back(Use); in ReplaceUsesOfWith()
1020 Worklist.push_back(cast<Instruction>(U)); in ReplaceUsesOfWith()
1022 RemoveFromWorklist(I, Worklist); in ReplaceUsesOfWith()
1045 std::vector<Instruction*> Worklist; in RewriteLoopBodyWithConditionConstant() local
1063 Worklist.push_back(UI); in RewriteLoopBodyWithConditionConstant()
[all …]
HDBDCE.cpp269 SmallVector<Instruction*, 128> Worklist; in runOnFunction() local
287 Worklist.push_back(&I); in runOnFunction()
298 Worklist.push_back(J); in runOnFunction()
308 while (!Worklist.empty()) { in runOnFunction()
309 Instruction *UserI = Worklist.pop_back_val(); in runOnFunction()
354 Worklist.push_back(I); in runOnFunction()
357 Worklist.push_back(I); in runOnFunction()
394 Worklist.push_back(&I); in runOnFunction()
399 for (Instruction *&I : Worklist) { in runOnFunction()
HDLoopDistribute.cpp103 SmallVector<Instruction *, 8> Worklist(Set.begin(), Set.end()); in populateUsedSet() local
104 while (!Worklist.empty()) { in populateUsedSet()
105 Instruction *I = Worklist.pop_back_val(); in populateUsedSet()
110 Worklist.push_back(I); in populateUsedSet()
604 SmallVector<Loop *, 8> Worklist; in runOnFunction() local
610 Worklist.push_back(L); in runOnFunction()
614 for (Loop *L : Worklist) in runOnFunction()
/NextBSD/contrib/llvm/lib/Analysis/
HDCFG.cpp130 SmallVectorImpl<BasicBlock *> &Worklist, BasicBlock *StopBB, in isPotentiallyReachableFromMany() argument
142 BasicBlock *BB = Worklist.pop_back_val(); in isPotentiallyReachableFromMany()
162 Outer->getExitBlocks(Worklist); in isPotentiallyReachableFromMany()
164 Worklist.append(succ_begin(BB), succ_end(BB)); in isPotentiallyReachableFromMany()
166 } while (!Worklist.empty()); in isPotentiallyReachableFromMany()
178 SmallVector<BasicBlock*, 32> Worklist; in isPotentiallyReachable() local
179 Worklist.push_back(const_cast<BasicBlock*>(A)); in isPotentiallyReachable()
181 return isPotentiallyReachableFromMany(Worklist, const_cast<BasicBlock *>(B), in isPotentiallyReachable()
190 SmallVector<BasicBlock*, 32> Worklist; in isPotentiallyReachable() local
217 Worklist.append(succ_begin(BB), succ_end(BB)); in isPotentiallyReachable()
[all …]
HDLazyCallGraph.cpp24 SmallVectorImpl<Constant *> &Worklist, SmallPtrSetImpl<Constant *> &Visited, in findCallees() argument
27 while (!Worklist.empty()) { in findCallees()
28 Constant *C = Worklist.pop_back_val(); in findCallees()
52 Worklist.push_back(cast<Constant>(Op)); in findCallees()
61 SmallVector<Constant *, 16> Worklist; in Node() local
70 Worklist.push_back(C); in Node()
75 findCallees(Worklist, Visited, Callees, CalleeIndexMap); in Node()
112 SmallVector<Constant *, 16> Worklist; in LazyCallGraph() local
117 Worklist.push_back(GV.getInitializer()); in LazyCallGraph()
121 findCallees(Worklist, Visited, EntryNodes, EntryIndexMap); in LazyCallGraph()
[all …]
HDDivergenceAnalysis.cpp155 std::vector<Value *> Worklist; // Stack for DFS. member in __anon4ec144720211::DivergencePropagator
160 Worklist.clear(); in populateWithSourcesOfDivergence()
164 Worklist.push_back(&I); in populateWithSourcesOfDivergence()
170 Worklist.push_back(&Arg); in populateWithSourcesOfDivergence()
195 Worklist.push_back(I); in exploreSyncDependency()
240 Worklist.push_back(UserInst); in findUsersOutsideInfluenceRegion()
268 Worklist.push_back(UserInst); in exploreDataDependency()
274 while (!Worklist.empty()) { in propagate()
275 Value *V = Worklist.back(); in propagate()
276 Worklist.pop_back(); in propagate()
HDIteratedDominanceFrontier.cpp42 SmallVector<DomTreeNode *, 32> Worklist; in calculate() local
57 Worklist.clear(); in calculate()
58 Worklist.push_back(Root); in calculate()
61 while (!Worklist.empty()) { in calculate()
62 DomTreeNode *Node = Worklist.pop_back_val(); in calculate()
91 Worklist.push_back(DomChild); in calculate()
HDCaptureTracking.cpp158 SmallVector<BasicBlock*, 32> Worklist; in isSafeToPrune() local
159 Worklist.append(succ_begin(BB), succ_end(BB)); in isSafeToPrune()
160 if (!isPotentiallyReachableFromMany(Worklist, BB, DT)) in isSafeToPrune()
266 SmallVector<const Use *, Threshold> Worklist; in PointerMayBeCaptured() local
278 Worklist.push_back(&U); in PointerMayBeCaptured()
281 while (!Worklist.empty()) { in PointerMayBeCaptured()
282 const Use *U = Worklist.pop_back_val(); in PointerMayBeCaptured()
339 Worklist.push_back(&UU); in PointerMayBeCaptured()
HDCFLAliasAnalysis.cpp895 SmallVector<ConstantExpr *, 4> Worklist; in constexprToEdges() local
896 Worklist.push_back(&CExprToCollapse); in constexprToEdges()
900 while (!Worklist.empty()) { in constexprToEdges()
901 auto *CExpr = Worklist.pop_back_val(); in constexprToEdges()
911 Worklist.push_back(Nested); in constexprToEdges()
915 Worklist.push_back(Nested); in constexprToEdges()
1035 SmallVector<GraphT::Node, 16> Worklist; in buildSetsFrom() local
1037 Worklist.clear(); in buildSetsFrom()
1042 Worklist.push_back(InitialNode); in buildSetsFrom()
1043 while (!Worklist.empty()) { in buildSetsFrom()
[all …]
/NextBSD/contrib/llvm/lib/Transforms/Utils/
HDLoopSimplify.cpp193 SmallVector<BasicBlock *, 8> Worklist; in addBlockAndPredsToSet() local
194 Worklist.push_back(InputBB); in addBlockAndPredsToSet()
196 BasicBlock *BB = Worklist.pop_back_val(); in addBlockAndPredsToSet()
202 Worklist.push_back(WBB); in addBlockAndPredsToSet()
204 } while (!Worklist.empty()); in addBlockAndPredsToSet()
478 static bool simplifyOneLoop(Loop *L, SmallVectorImpl<Loop *> &Worklist, in simplifyOneLoop() argument
592 Worklist.push_back(OuterL); in simplifyOneLoop()
725 SmallVector<Loop *, 4> Worklist; in simplifyLoop() local
726 Worklist.push_back(L); in simplifyLoop()
731 for (unsigned Idx = 0; Idx != Worklist.size(); ++Idx) { in simplifyLoop()
[all …]
HDLoopUtils.cpp72 SmallVector<Instruction *, 8> Worklist; in AddReductionVar() local
73 Worklist.push_back(Phi); in AddReductionVar()
90 while (!Worklist.empty()) { in AddReductionVar()
91 Instruction *Cur = Worklist.back(); in AddReductionVar()
92 Worklist.pop_back(); in AddReductionVar()
183 Worklist.append(PHIs.begin(), PHIs.end()); in AddReductionVar()
184 Worklist.append(NonPHIs.begin(), NonPHIs.end()); in AddReductionVar()
/NextBSD/contrib/llvm/lib/Transforms/ObjCARC/
HDProvenanceAnalysis.cpp78 SmallVector<const Value *, 8> Worklist; in IsStoredObjCPointer() local
79 Worklist.push_back(P); in IsStoredObjCPointer()
82 P = Worklist.pop_back_val(); in IsStoredObjCPointer()
99 Worklist.push_back(Ur); in IsStoredObjCPointer()
101 } while (!Worklist.empty()); in IsStoredObjCPointer()
HDDependencyAnalysis.cpp231 SmallVector<std::pair<BasicBlock *, BasicBlock::iterator>, 4> Worklist; in FindDependencies() local
232 Worklist.push_back(std::make_pair(StartBB, StartPos)); in FindDependencies()
235 Worklist.pop_back_val(); in FindDependencies()
250 Worklist.push_back(std::make_pair(PredBB, PredBB->end())); in FindDependencies()
261 } while (!Worklist.empty()); in FindDependencies()
/NextBSD/contrib/llvm/include/llvm/Support/
HDGenericDomTreeConstruction.h57 typename GraphT::ChildIteratorType>, 32> Worklist; in DFSPass() local
58 Worklist.push_back(std::make_pair(V, GraphT::child_begin(V))); in DFSPass()
59 while (!Worklist.empty()) { in DFSPass()
60 typename GraphT::NodeType* BB = Worklist.back().first; in DFSPass()
61 typename GraphT::ChildIteratorType NextSucc = Worklist.back().second; in DFSPass()
85 Worklist.pop_back(); in DFSPass()
90 ++Worklist.back().second; in DFSPass()
99 Worklist.push_back(std::make_pair(Succ, GraphT::child_begin(Succ))); in DFSPass()
/NextBSD/contrib/llvm/lib/Transforms/InstCombine/
HDInstCombineInternal.h142 InstCombineWorklist &Worklist; variable
147 : Worklist(WL), AC(AC) {} in InstCombineIRInserter()
152 Worklist.Add(I); in InsertHelper()
170 InstCombineWorklist &Worklist;
197 InstCombiner(InstCombineWorklist &Worklist, BuilderTy *Builder, in InstCombiner() argument
201 : Worklist(Worklist), Builder(Builder), MinimizeSize(MinimizeSize), in InstCombiner()
397 Worklist.Add(New); in InsertNewInstBefore()
418 Worklist.AddUsersToWorkList(I); // Add all modified instrs to worklist. in ReplaceInstUsesWith()
456 Worklist.Add(Op); in EraseInstFromFunction()
458 Worklist.Remove(&I); in EraseInstFromFunction()
HDInstructionCombining.cpp1173 Worklist.Add(Parent.first); in Descale()
1191 Worklist.Add(Ancestor); in Descale()
1832 SmallVector<Instruction*, 4> Worklist; in isAllocSiteRemovable() local
1833 Worklist.push_back(AI); in isAllocSiteRemovable()
1836 Instruction *PI = Worklist.pop_back_val(); in isAllocSiteRemovable()
1847 Worklist.push_back(I); in isAllocSiteRemovable()
1902 } while (!Worklist.empty()); in isAllocSiteRemovable()
2085 Worklist.Add(Cond); in visitBranchInst()
2101 Worklist.Add(Cond); in visitBranchInst()
2163 Worklist.Add(I); in visitSwitchInst()
[all …]
HDInstCombineLoadStoreAlloca.cpp548 SmallVector<Value *, 4> Worklist(1, V); in isObjectSizeLessThanOrEq() local
551 Value *P = Worklist.pop_back_val(); in isObjectSizeLessThanOrEq()
558 Worklist.push_back(SI->getTrueValue()); in isObjectSizeLessThanOrEq()
559 Worklist.push_back(SI->getFalseValue()); in isObjectSizeLessThanOrEq()
565 Worklist.push_back(IncValue); in isObjectSizeLessThanOrEq()
572 Worklist.push_back(GA->getAliasee()); in isObjectSizeLessThanOrEq()
605 } while (!Worklist.empty()); in isObjectSizeLessThanOrEq()
737 Worklist.Add(NewGEPI); in visitLoadInst()
970 Worklist.Add(NewGEPI); in visitStoreInst()
1041 Worklist.Add(U); // Dropped a use. in visitStoreInst()
/NextBSD/contrib/llvm/lib/Transforms/IPO/
HDMergeFunctions.cpp1102 bool doSanityCheck(std::vector<WeakVH> &Worklist);
1155 bool MergeFunctions::doSanityCheck(std::vector<WeakVH> &Worklist) { in doSanityCheck() argument
1163 for (std::vector<WeakVH>::iterator I = Worklist.begin(), E = Worklist.end(); in doSanityCheck()
1236 std::vector<WeakVH> Worklist; in runOnModule() local
1237 Deferred.swap(Worklist); in runOnModule()
1239 DEBUG(doSanityCheck(Worklist)); in runOnModule()
1242 DEBUG(dbgs() << "size of worklist: " << Worklist.size() << '\n'); in runOnModule()
1246 for (std::vector<WeakVH>::iterator I = Worklist.begin(), in runOnModule()
1247 E = Worklist.end(); I != E; ++I) { in runOnModule()
1260 for (std::vector<WeakVH>::iterator I = Worklist.begin(), in runOnModule()
[all …]
/NextBSD/contrib/llvm/tools/llvm-rtdyld/
HDllvm-rtdyld.cpp484 WorklistT Worklist; in remapSectionsAndSymbols() local
487 Worklist.push_back(std::make_pair(CodeSection.base(), CodeSection.size())); in remapSectionsAndSymbols()
489 Worklist.push_back(std::make_pair(DataSection.base(), DataSection.size())); in remapSectionsAndSymbols()
503 for (WorklistT::iterator I = Worklist.begin(), E = Worklist.end(); in remapSectionsAndSymbols()
511 Worklist.erase(Tmp); in remapSectionsAndSymbols()
527 while (!Worklist.empty()) { in remapSectionsAndSymbols()
528 std::pair<void*, uint64_t> CurEntry = Worklist.front(); in remapSectionsAndSymbols()
529 Worklist.pop_front(); in remapSectionsAndSymbols()
/NextBSD/contrib/llvm/include/llvm/Analysis/
HDPtrUseVisitor.h124 SmallVector<UseToVisit, 8> Worklist; variable
217 while (!Worklist.empty()) { in visitPtr()
218 UseToVisit ToVisit = Worklist.pop_back_val(); in visitPtr()
/NextBSD/contrib/llvm/lib/Target/AMDGPU/
HDSIInstrInfo.h42 unsigned split64BitImm(SmallVectorImpl<MachineInstr *> &Worklist,
50 void splitScalar64BitUnaryOp(SmallVectorImpl<MachineInstr *> &Worklist,
53 void splitScalar64BitBinaryOp(SmallVectorImpl<MachineInstr *> &Worklist,
56 void splitScalar64BitBCNT(SmallVectorImpl<MachineInstr *> &Worklist,
58 void splitScalar64BitBFE(SmallVectorImpl<MachineInstr *> &Worklist,
/NextBSD/contrib/llvm/lib/Support/
HDDAGDeltaAlgorithm.cpp202 std::vector<change_ty> Worklist(Roots.begin(), Roots.end()); in DAGDeltaAlgorithmImpl() local
203 while (!Worklist.empty()) { in DAGDeltaAlgorithmImpl()
204 change_ty Change = Worklist.back(); in DAGDeltaAlgorithmImpl()
205 Worklist.pop_back(); in DAGDeltaAlgorithmImpl()
212 Worklist.push_back(*it); in DAGDeltaAlgorithmImpl()

123