Home
last modified time | relevance | path

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

1234567

/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/CodeGen/GlobalISel/
H A DGISelWorkList.h29 SmallVector<MachineInstr *, N> Worklist; variable
52 Worklist.push_back(I); in deferred_insert()
64 if (Worklist.size() > N) in finalize()
65 WorklistMap.reserve(Worklist.size()); in finalize()
66 for (unsigned i = 0; i < Worklist.size(); ++i) in finalize()
67 if (!WorklistMap.try_emplace(Worklist[i], i).second) in finalize()
77 if (WorklistMap.try_emplace(I, Worklist.size()).second) in insert()
78 Worklist.push_back(I); in insert()
89 Worklist[It->second] = nullptr; in remove()
95 Worklist.clear(); in clear()
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/AggressiveInstCombine/
H A DTruncInstCombine.cpp84 while (!Worklist.empty()) { in buildTruncExpressionDag()
88 Worklist.pop_back(); in buildTruncExpressionDag()
99 Worklist.pop_back(); in buildTruncExpressionDag()
107 Worklist.pop_back(); in buildTruncExpressionDag()
162 Worklist.push_back(Src); in getMinBitWidth()
165 while (!Worklist.empty()) { in getMinBitWidth()
169 Worklist.pop_back(); in getMinBitWidth()
184 Worklist.pop_back(); in getMinBitWidth()
210 Worklist.push_back(IOp); in getMinBitWidth()
415 Worklist.push_back(CI); in run()
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/lib/Analysis/
H A DCodeMetrics.cpp30 SmallVectorImpl<const Value *> &Worklist) { in appendSpeculatableOperands() argument
38 Worklist.push_back(Operand); in appendSpeculatableOperands()
51 for (int i = 0; i < (int)Worklist.size(); ++i) { in completeEphemeralValues()
52 const Value *V = Worklist[i]; in completeEphemeralValues()
65 appendSpeculatableOperands(V, Visited, Worklist); in completeEphemeralValues()
74 SmallVector<const Value *, 16> Worklist; in collectEphemeralValues() local
88 appendSpeculatableOperands(I, Visited, Worklist); in collectEphemeralValues()
91 completeEphemeralValues(Visited, Worklist, EphValues); in collectEphemeralValues()
98 SmallVector<const Value *, 16> Worklist; in collectEphemeralValues() local
108 appendSpeculatableOperands(I, Visited, Worklist); in collectEphemeralValues()
[all …]
H A DCFG.cpp138 SmallVectorImpl<BasicBlock *> &Worklist, BasicBlock *StopBB, in isPotentiallyReachableFromMany() argument
167 BasicBlock *BB = Worklist.pop_back_val(); in isPotentiallyReachableFromMany()
200 Outer->getExitBlocks(Worklist); in isPotentiallyReachableFromMany()
202 Worklist.append(succ_begin(BB), succ_end(BB)); in isPotentiallyReachableFromMany()
204 } while (!Worklist.empty()); in isPotentiallyReachableFromMany()
229 SmallVector<BasicBlock*, 32> Worklist; in isPotentiallyReachable() local
230 Worklist.push_back(const_cast<BasicBlock*>(A)); in isPotentiallyReachable()
266 SmallVector<BasicBlock*, 32> Worklist; in isPotentiallyReachable() local
267 Worklist.append(succ_begin(BB), succ_end(BB)); in isPotentiallyReachable()
268 if (Worklist.empty()) { in isPotentiallyReachable()
[all …]
H A DLazyCallGraph.cpp264 Worklist.push_back(N); in verify()
265 while (!Worklist.empty()) { in verify()
322 } while (!Worklist.empty()); in isAncestorOf()
390 Worklist.push_back(N); in verify()
391 while (!Worklist.empty()) { in verify()
430 Worklist.push_back(this); in isAncestorOf()
444 } while (!Worklist.empty()); in isAncestorOf()
793 Worklist.swap(OldSCC.Nodes); in switchInternalEdgeToRef()
794 for (Node *N : Worklist) { in switchInternalEdgeToRef()
1064 Worklist.push_back(this); in insertIncomingRefEdge()
[all …]
H A DMustExecute.cpp528 Worklist.push_back(SuccBB); in findForwardJoinPoint()
533 if (Worklist.empty()) in findForwardJoinPoint()
537 if (Worklist.size() == 1) in findForwardJoinPoint()
538 return Worklist[0]; in findForwardJoinPoint()
549 if (!JoinBB && Worklist.size() == 2) { in findForwardJoinPoint()
600 while (!Worklist.empty()) { in findForwardJoinPoint()
664 Worklist.push_back(PredBB); in findBackwardJoinPoint()
668 if (Worklist.empty()) in findBackwardJoinPoint()
672 if (Worklist.size() == 1) in findBackwardJoinPoint()
673 return Worklist[0]; in findBackwardJoinPoint()
[all …]
H A DLegacyDivergenceAnalysis.cpp122 std::vector<Value *> Worklist; // Stack for DFS. member in __anon26534a8c0111::DivergencePropagator
129 Worklist.clear(); in populateWithSourcesOfDivergence()
134 Worklist.push_back(&I); in populateWithSourcesOfDivergence()
140 Worklist.push_back(&Arg); in populateWithSourcesOfDivergence()
176 Worklist.push_back(&*I); in exploreSyncDependency()
224 Worklist.push_back(UserInst); in findUsersOutsideInfluenceRegion()
263 Worklist.push_back(U); in exploreDataDependency()
269 while (!Worklist.empty()) { in propagate()
270 Value *V = Worklist.back(); in propagate()
271 Worklist.pop_back(); in propagate()
H A DEHPersonalities.cpp82 SmallVector<std::pair<BasicBlock *, BasicBlock *>, 16> Worklist; in colorEHFunclets() local
99 Worklist.push_back({EntryBlock, EntryBlock}); in colorEHFunclets()
101 while (!Worklist.empty()) { in colorEHFunclets()
104 std::tie(Visiting, Color) = Worklist.pop_back_val(); in colorEHFunclets()
136 Worklist.push_back({Succ, SuccColor}); in colorEHFunclets()
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Transforms/InstCombine/
H A DInstCombineWorklist.h28 SmallVector<Instruction *, 256> Worklist; variable
41 bool isEmpty() const { return Worklist.empty() && Deferred.empty(); } in isEmpty()
64 if (WorklistMap.insert(std::make_pair(I, Worklist.size())).second) { in push()
66 Worklist.push_back(I); in push()
82 Worklist.reserve(Size + 16); in reserve()
91 Worklist[It->second] = nullptr; in remove()
99 if (Worklist.empty()) in removeOne()
101 Instruction *I = Worklist.pop_back_val(); in removeOne()
H A DInstCombiner.h60 InstCombineWorklist &Worklist;
84 InstCombiner(InstCombineWorklist &Worklist, BuilderTy &Builder, in InstCombiner() argument
90 : TTI(TTI), Builder(Builder), Worklist(Worklist), in InstCombiner()
365 void addToWorklist(Instruction *I) { Worklist.push(I); } in addToWorklist()
400 Worklist.push(New); in InsertNewInstBefore()
422 Worklist.pushUsersToWorkList(I); // Add all modified instrs to worklist. in replaceInstUsesWith()
438 Worklist.addValue(I.getOperand(OpNum)); in replaceOperand()
445 Worklist.addValue(U); in replaceUse()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DVPlanPredicator.cpp85 VPValue *VPlanPredicator::genPredicateTree(std::list<VPValue *> &Worklist) { in genPredicateTree() argument
86 if (Worklist.empty()) in genPredicateTree()
91 while (Worklist.size() >= 2) { in genPredicateTree()
93 VPValue *LHS = Worklist.front(); in genPredicateTree()
94 Worklist.pop_front(); in genPredicateTree()
95 VPValue *RHS = Worklist.front(); in genPredicateTree()
96 Worklist.pop_front(); in genPredicateTree()
102 Worklist.push_back(Or); in genPredicateTree()
105 assert(Worklist.size() == 1 && "Expected 1 item in worklist"); in genPredicateTree()
108 VPValue *Root = Worklist.front(); in genPredicateTree()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLowerConstantIntrinsics.cpp58 SmallSetVector<Instruction *, 8> Worklist; in replaceConditionalBranchesOnConstant() local
60 &Worklist); in replaceConditionalBranchesOnConstant()
61 for (auto I : Worklist) { in replaceConditionalBranchesOnConstant()
101 SmallVector<WeakTrackingVH, 8> Worklist; in lowerConstantIntrinsics() local
114 Worklist.push_back(WeakTrackingVH(&I)); in lowerConstantIntrinsics()
119 for (WeakTrackingVH &VH: Worklist) { in lowerConstantIntrinsics()
146 return !Worklist.empty(); in lowerConstantIntrinsics()
H A DLoopUnswitch.cpp1521 llvm::erase_value(Worklist, I); in removeFromWorklist()
1534 Worklist.push_back(Use); in replaceUsesOfWith()
1539 removeFromWorklist(I, Worklist); in replaceUsesOfWith()
1584 Worklist.push_back(UI); in rewriteLoopBodyWithConditionConstant()
1587 for (Instruction *UI : Worklist) in rewriteLoopBodyWithConditionConstant()
1590 simplifyCode(Worklist, L); in rewriteLoopBodyWithConditionConstant()
1620 Worklist.push_back(UI); in rewriteLoopBodyWithConditionConstant()
1680 simplifyCode(Worklist, L); in rewriteLoopBodyWithConditionConstant()
1693 while (!Worklist.empty()) { in simplifyCode()
1695 Worklist.pop_back(); in simplifyCode()
[all …]
H A DLoopPassManager.cpp225 SmallPriorityWorklist<Loop *, 4> Worklist; in run() local
229 LPMUpdater Updater(Worklist, LAM, LoopNestMode); in run()
234 appendLoopsToWorklist(LI, Worklist); in run()
237 Worklist.insert(L); in run()
258 Loop *L = Worklist.pop_back_val(); in run()
310 } while (!Worklist.empty()); in run()
H A DBDCE.cpp94 SmallVector<Instruction*, 128> Worklist; in bitTrackingDCE() local
110 Worklist.push_back(&I); in bitTrackingDCE()
127 Worklist.push_back(SE); in bitTrackingDCE()
158 for (Instruction *&I : Worklist) { in bitTrackingDCE()
H A DPlaceSafepoints.cpp270 std::vector<BasicBlock *> &Worklist) { in scanOneBB() argument
287 Worklist.push_back(Succ); in scanOneBB()
298 std::vector<BasicBlock *> Worklist; in scanInlinedCode() local
300 scanOneBB(Start, End, Calls, Seen, Worklist); in scanInlinedCode()
301 while (!Worklist.empty()) { in scanInlinedCode()
302 BasicBlock *BB = Worklist.back(); in scanInlinedCode()
303 Worklist.pop_back(); in scanInlinedCode()
304 scanOneBB(&*BB->begin(), End, Calls, Seen, Worklist); in scanInlinedCode()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DSIWholeQuadMode.cpp311 Worklist.push_back(&MI); in markInstruction()
558 Worklist.push_back(&MBB); in scanInstructions()
632 Worklist.push_back(MBB); in propagateInstruction()
643 Worklist.push_back(PrevMI); in propagateInstruction()
672 Worklist.push_back(LastMI); in propagateBlock()
684 Worklist.push_back(Pred); in propagateBlock()
694 Worklist.push_back(Succ); in propagateBlock()
699 std::vector<WorkItem> Worklist; in analyzeFunction() local
702 while (!Worklist.empty()) { in analyzeFunction()
703 WorkItem WI = Worklist.back(); in analyzeFunction()
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/ARM/
H A DMVELaneInterleavingPass.cpp162 std::vector<Instruction *> Worklist; in tryInterleave() local
163 Worklist.push_back(Start); in tryInterleave()
164 Worklist.push_back(cast<Instruction>(Start->getOperand(0))); in tryInterleave()
171 while (!Worklist.empty()) { in tryInterleave()
172 Instruction *I = Worklist.back(); in tryInterleave()
173 Worklist.pop_back(); in tryInterleave()
192 Worklist.push_back(cast<Instruction>(Use)); in tryInterleave()
246 Worklist.push_back(cast<Instruction>(&Op)); in tryInterleave()
252 Worklist.push_back(cast<Instruction>(Use)); in tryInterleave()
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Support/
H A DGenericIteratedDominanceFrontier.h147 SmallVector<DomTreeNodeBase<NodeTy> *, 32> Worklist; in calculate() local
168 assert(Worklist.empty()); in calculate()
169 Worklist.push_back(Root); in calculate()
171 while (!Worklist.empty()) { in calculate()
172 DomTreeNodeBase<NodeTy> *Node = Worklist.pop_back_val(); in calculate()
201 Worklist.push_back(DomChild); in calculate()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/ObjCARC/
H A DProvenanceAnalysis.cpp83 SmallVector<const Value *, 8> Worklist; in IsStoredObjCPointer() local
84 Worklist.push_back(P); in IsStoredObjCPointer()
87 P = Worklist.pop_back_val(); in IsStoredObjCPointer()
104 Worklist.push_back(Ur); in IsStoredObjCPointer()
106 } while (!Worklist.empty()); in IsStoredObjCPointer()
H A DDependencyAnalysis.cpp218 SmallVector<std::pair<BasicBlock *, BasicBlock::iterator>, 4> Worklist; in findDependencies() local
219 Worklist.push_back(std::make_pair(StartBB, StartPos)); in findDependencies()
222 Worklist.pop_back_val(); in findDependencies()
236 Worklist.push_back(std::make_pair(PredBB, PredBB->end())); in findDependencies()
247 } while (!Worklist.empty()); in findDependencies()
/freebsd-13.1/contrib/llvm-project/llvm/lib/IR/
H A DSafepointIRVerifier.cpp330 SmallVector<const Value *, 32> Worklist; in getBaseType() local
333 Worklist.push_back(Val); in getBaseType()
337 while(!Worklist.empty()) { in getBaseType()
338 const Value *V = Worklist.pop_back_val(); in getBaseType()
343 Worklist.push_back(CI->stripPointerCasts()); in getBaseType()
347 Worklist.push_back(GEP->getPointerOperand()); in getBaseType()
358 Worklist.push_back(SI->getTrueValue()); in getBaseType()
359 Worklist.push_back(SI->getFalseValue()); in getBaseType()
606 SetVector<const BasicBlock *> Worklist; in recalculateBBsStates() local
610 Worklist.insert(BBI.first); in recalculateBBsStates()
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DLoopSimplify.cpp165 SmallVector<BasicBlock *, 8> Worklist; in addBlockAndPredsToSet() local
166 Worklist.push_back(InputBB); in addBlockAndPredsToSet()
168 BasicBlock *BB = Worklist.pop_back_val(); in addBlockAndPredsToSet()
173 } while (!Worklist.empty()); in addBlockAndPredsToSet()
577 Worklist.push_back(OuterL); in simplifyOneLoop()
736 SmallVector<Loop *, 4> Worklist; in simplifyLoop() local
737 Worklist.push_back(L); in simplifyLoop()
743 Loop *L2 = Worklist[Idx]; in simplifyLoop()
744 Worklist.append(L2->begin(), L2->end()); in simplifyLoop()
747 while (!Worklist.empty()) in simplifyLoop()
[all …]
H A DLCSSA.cpp79 bool llvm::formLCSSAForInstructions(SmallVectorImpl<Instruction *> &Worklist, in formLCSSAForInstructions() argument
95 while (!Worklist.empty()) { in formLCSSAForInstructions()
98 Instruction *I = Worklist.pop_back_val(); in formLCSSAForInstructions()
264 Worklist.push_back(PostProcessPN); in formLCSSAForInstructions()
360 SmallVector<Instruction *, 8> Worklist; in formLCSSA() local
384 Worklist.push_back(&I); in formLCSSA()
389 Changed = formLCSSAForInstructions(Worklist, DT, *LI, SE, Builder); in formLCSSA()
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Transforms/Scalar/
H A DLoopPassManager.h289 Worklist.insert(CurrentL);
298 appendLoopsToWorklist(NewChildLoops, Worklist);
319 Worklist.insert(NewSibLoops);
321 appendLoopsToWorklist(NewSibLoops, Worklist);
337 Worklist.insert(CurrentL);
344 SmallPriorityWorklist<Loop *, 4> &Worklist;
359 LPMUpdater(SmallPriorityWorklist<Loop *, 4> &Worklist,
361 : Worklist(Worklist), LAM(LAM), LoopNestMode(LoopNestMode) {}

1234567