Home
last modified time | relevance | path

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

12345678

/llvm-project-15.0.7/llvm/include/llvm/CodeGen/GlobalISel/
H A DGISelWorkList.h28 SmallVector<MachineInstr *, N> Worklist; variable
51 Worklist.push_back(I); in deferred_insert()
63 if (Worklist.size() > N) in finalize()
64 WorklistMap.reserve(Worklist.size()); in finalize()
65 for (unsigned i = 0; i < Worklist.size(); ++i) in finalize()
66 if (!WorklistMap.try_emplace(Worklist[i], i).second) in finalize()
78 if (WorklistMap.try_emplace(I, Worklist.size()).second) in insert()
79 Worklist.push_back(I); in insert()
92 Worklist[It->second] = nullptr; in remove()
98 Worklist.clear(); in clear()
[all …]
/llvm-project-15.0.7/llvm/lib/Analysis/
H A DCodeMetrics.cpp29 SmallVectorImpl<const Value *> &Worklist) { in appendSpeculatableOperands() argument
38 Worklist.push_back(I); 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.cpp134 SmallVectorImpl<BasicBlock *> &Worklist, BasicBlock *StopBB, in isPotentiallyReachableFromMany() argument
163 BasicBlock *BB = Worklist.pop_back_val(); in isPotentiallyReachableFromMany()
196 Outer->getExitBlocks(Worklist); in isPotentiallyReachableFromMany()
198 Worklist.append(succ_begin(BB), succ_end(BB)); in isPotentiallyReachableFromMany()
200 } while (!Worklist.empty()); in isPotentiallyReachableFromMany()
225 SmallVector<BasicBlock*, 32> Worklist; in isPotentiallyReachable() local
226 Worklist.push_back(const_cast<BasicBlock*>(A)); in isPotentiallyReachable()
262 SmallVector<BasicBlock*, 32> Worklist; in isPotentiallyReachable() local
263 Worklist.append(succ_begin(BB), succ_end(BB)); in isPotentiallyReachable()
264 if (Worklist.empty()) { in isPotentiallyReachable()
[all …]
H A DLazyCallGraph.cpp265 Worklist.push_back(N); in verify()
266 while (!Worklist.empty()) { in verify()
323 } while (!Worklist.empty()); in isAncestorOf()
391 Worklist.push_back(N); in verify()
392 while (!Worklist.empty()) { in verify()
431 Worklist.push_back(this); in isAncestorOf()
445 } while (!Worklist.empty()); in isAncestorOf()
794 Worklist.swap(OldSCC.Nodes); in switchInternalEdgeToRef()
795 for (Node *N : Worklist) { in switchInternalEdgeToRef()
1065 Worklist.push_back(this); in insertIncomingRefEdge()
[all …]
H A DMustExecute.cpp525 Worklist.push_back(SuccBB); in findForwardJoinPoint()
530 if (Worklist.empty()) in findForwardJoinPoint()
534 if (Worklist.size() == 1) in findForwardJoinPoint()
535 return Worklist[0]; in findForwardJoinPoint()
546 if (!JoinBB && Worklist.size() == 2) { in findForwardJoinPoint()
597 while (!Worklist.empty()) { in findForwardJoinPoint()
661 Worklist.push_back(PredBB); in findBackwardJoinPoint()
665 if (Worklist.empty()) in findBackwardJoinPoint()
669 if (Worklist.size() == 1) in findBackwardJoinPoint()
670 return Worklist[0]; in findBackwardJoinPoint()
[all …]
H A DLegacyDivergenceAnalysis.cpp123 std::vector<Value *> Worklist; // Stack for DFS. member in __anon278c5f880111::DivergencePropagator
130 Worklist.clear(); in populateWithSourcesOfDivergence()
135 Worklist.push_back(&I); in populateWithSourcesOfDivergence()
141 Worklist.push_back(&Arg); in populateWithSourcesOfDivergence()
177 Worklist.push_back(&*I); in exploreSyncDependency()
225 Worklist.push_back(UserInst); in findUsersOutsideInfluenceRegion()
264 Worklist.push_back(U); in exploreDataDependency()
270 while (!Worklist.empty()) { in propagate()
271 Value *V = Worklist.back(); in propagate()
272 Worklist.pop_back(); in propagate()
H A DEHPersonalities.cpp86 SmallVector<std::pair<BasicBlock *, BasicBlock *>, 16> Worklist; in colorEHFunclets() local
103 Worklist.push_back({EntryBlock, EntryBlock}); in colorEHFunclets()
105 while (!Worklist.empty()) { in colorEHFunclets()
108 std::tie(Visiting, Color) = Worklist.pop_back_val(); in colorEHFunclets()
140 Worklist.push_back({Succ, SuccColor}); in colorEHFunclets()
H A DFunctionPropertiesAnalysis.cpp73 std::deque<const Loop *> Worklist; in updateAggregateStats() local
74 llvm::append_range(Worklist, LI); in updateAggregateStats()
75 while (!Worklist.empty()) { in updateAggregateStats()
76 const auto *L = Worklist.front(); in updateAggregateStats()
79 Worklist.pop_front(); in updateAggregateStats()
80 llvm::append_range(Worklist, L->getSubLoops()); in updateAggregateStats()
/llvm-project-15.0.7/llvm/include/llvm/Transforms/Utils/
H A DInstructionWorklist.h26 SmallVector<Instruction *, 256> Worklist; variable
39 bool isEmpty() const { return Worklist.empty() && Deferred.empty(); } in isEmpty()
62 if (WorklistMap.insert(std::make_pair(I, Worklist.size())).second) { in push()
64 Worklist.push_back(I); in push()
80 Worklist.reserve(Size + 16); in reserve()
89 Worklist[It->second] = nullptr; in remove()
97 if (Worklist.empty()) in removeOne()
99 Instruction *I = Worklist.pop_back_val(); in removeOne()
/llvm-project-15.0.7/llvm/lib/Transforms/AggressiveInstCombine/
H A DTruncInstCombine.cpp96 while (!Worklist.empty()) { in buildTruncExpressionGraph()
100 Worklist.pop_back(); in buildTruncExpressionGraph()
111 Worklist.pop_back(); in buildTruncExpressionGraph()
119 Worklist.pop_back(); in buildTruncExpressionGraph()
161 Worklist.push_back(Op); in buildTruncExpressionGraph()
188 Worklist.push_back(Src); in getMinBitWidth()
191 while (!Worklist.empty()) { in getMinBitWidth()
195 Worklist.pop_back(); in getMinBitWidth()
210 Worklist.pop_back(); in getMinBitWidth()
236 Worklist.push_back(IOp); in getMinBitWidth()
[all …]
/llvm-project-15.0.7/llvm/lib/Target/RISCV/
H A DRISCVSExtWRemoval.cpp68 Worklist.push_back(User); in addUses()
82 addUses(OrigMI, Worklist, MRI); in isAllUsesReadW()
84 while (!Worklist.empty()) { in isAllUsesReadW()
131 addUses(*MI, Worklist, MRI); in isAllUsesReadW()
136 addUses(*MI, Worklist, MRI); in isAllUsesReadW()
141 addUses(*MI, Worklist, MRI); in isAllUsesReadW()
179 addUses(*MI, Worklist, MRI); in isAllUsesReadW()
299 Worklist.push_back(&OrigMI); in isSignExtendedW()
301 while (!Worklist.empty()) { in isSignExtendedW()
330 Worklist.push_back(SrcMI); in isSignExtendedW()
[all …]
/llvm-project-15.0.7/llvm/lib/Target/AMDGPU/
H A DSIWholeQuadMode.cpp311 Worklist.push_back(&MI); in markInstruction()
585 Worklist.push_back(MBB); in scanInstructions()
659 Worklist.push_back(MBB); in propagateInstruction()
670 Worklist.push_back(PrevMI); in propagateInstruction()
699 Worklist.push_back(LastMI); in propagateBlock()
711 Worklist.push_back(Pred); in propagateBlock()
721 Worklist.push_back(Succ); in propagateBlock()
726 std::vector<WorkItem> Worklist; in analyzeFunction() local
729 while (!Worklist.empty()) { in analyzeFunction()
730 WorkItem WI = Worklist.back(); in analyzeFunction()
[all …]
H A DAMDGPUSetWavePriority.cpp101 SmallVector<const MachineBasicBlock *, 16> Worklist; in runOnMachineFunction() local
104 Worklist.push_back(&MBB); in runOnMachineFunction()
108 while (!Worklist.empty()) { in runOnMachineFunction()
109 const MachineBasicBlock *MBB = Worklist.pop_back_val(); in runOnMachineFunction()
113 Worklist.append(MBB->pred_begin(), MBB->pred_end()); in runOnMachineFunction()
/llvm-project-15.0.7/polly/include/polly/
H A DScopPass.h196 SPMUpdater(SmallPriorityWorklist<Region *, 4> &Worklist,
198 : InvalidateCurrentScop(false), Worklist(Worklist), SAM(SAM) {}
206 Worklist.erase(&S.getRegion());
213 SmallPriorityWorklist<Region *, 4> &Worklist;
238 SmallPriorityWorklist<Region *, 4> Worklist;
241 Worklist.insert(S.first);
253 SPMUpdater Updater{Worklist, SAM};
255 while (!Worklist.empty()) {
256 Region *R = Worklist.pop_back_val();
/llvm-project-15.0.7/llvm/tools/llvm-reduce/deltas/
H A DReduceOperandsSkip.cpp27 std::deque<Value *> Worklist; in collectReferencedValues() local
28 Worklist.push_back(Root); in collectReferencedValues()
30 while (!Worklist.empty()) { in collectReferencedValues()
31 Value *Val = Worklist.front(); in collectReferencedValues()
32 Worklist.pop_front(); in collectReferencedValues()
38 Worklist.push_back(Op.get()); in collectReferencedValues()
/llvm-project-15.0.7/llvm/lib/Target/ARM/
H A DMVELaneInterleavingPass.cpp163 std::vector<Instruction *> Worklist; in tryInterleave() local
164 Worklist.push_back(Start); in tryInterleave()
165 Worklist.push_back(cast<Instruction>(Start->getOperand(0))); in tryInterleave()
172 while (!Worklist.empty()) { in tryInterleave()
173 Instruction *I = Worklist.back(); in tryInterleave()
174 Worklist.pop_back(); in tryInterleave()
192 Worklist.push_back(cast<Instruction>(Use)); in tryInterleave()
245 Worklist.push_back(cast<Instruction>(&Op)); in tryInterleave()
251 Worklist.push_back(cast<Instruction>(Use)); in tryInterleave()
/llvm-project-15.0.7/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()
/llvm-project-15.0.7/llvm/lib/Transforms/Scalar/
H A DLowerConstantIntrinsics.cpp62 SmallVector<WeakVH, 8> Worklist(UnsimplifiedUsers.begin(), in replaceConditionalBranchesOnConstant() local
65 for (auto &VH : Worklist) { in replaceConditionalBranchesOnConstant()
105 SmallVector<WeakTrackingVH, 8> Worklist; in lowerConstantIntrinsics() local
118 Worklist.push_back(WeakTrackingVH(&I)); in lowerConstantIntrinsics()
123 for (WeakTrackingVH &VH: Worklist) { in lowerConstantIntrinsics()
150 return !Worklist.empty(); in lowerConstantIntrinsics()
H A DFloat2Int.cpp185 std::deque<Instruction*> Worklist(Roots.begin(), Roots.end()); in walkBackwards() local
186 while (!Worklist.empty()) { in walkBackwards()
187 Instruction *I = Worklist.back(); in walkBackwards()
188 Worklist.pop_back(); in walkBackwards()
228 Worklist.push_back(OI); in walkBackwards()
329 std::deque<Instruction *> Worklist; in walkForwards() local
332 Worklist.push_back(Pair.first); in walkForwards()
334 while (!Worklist.empty()) { in walkForwards()
335 Instruction *I = Worklist.back(); in walkForwards()
336 Worklist.pop_back(); in walkForwards()
[all …]
H A DBDCE.cpp94 SmallVector<Instruction*, 128> Worklist; in bitTrackingDCE() local
108 Worklist.push_back(&I); in bitTrackingDCE()
124 Worklist.push_back(SE); in bitTrackingDCE()
155 for (Instruction *&I : llvm::reverse(Worklist)) { in bitTrackingDCE()
160 for (Instruction *&I : Worklist) { in bitTrackingDCE()
/llvm-project-15.0.7/llvm/lib/Target/WebAssembly/
H A DWebAssemblyAddMissingPrototypes.cpp91 SmallVector<Value *> Worklist; in runOnModule() local
92 Worklist.push_back(&F); in runOnModule()
93 while (!Worklist.empty()) { in runOnModule()
94 Value *V = Worklist.pop_back_val(); in runOnModule()
97 Worklist.push_back(BC); in runOnModule()
/llvm-project-15.0.7/llvm/lib/IR/
H A DSafepointIRVerifier.cpp328 SmallVector<const Value *, 32> Worklist; in getBaseType() local
331 Worklist.push_back(Val); in getBaseType()
335 while(!Worklist.empty()) { in getBaseType()
336 const Value *V = Worklist.pop_back_val(); in getBaseType()
341 Worklist.push_back(CI->stripPointerCasts()); in getBaseType()
356 Worklist.push_back(SI->getTrueValue()); in getBaseType()
357 Worklist.push_back(SI->getFalseValue()); in getBaseType()
368 Worklist.push_back(FI->getOperand(0)); in getBaseType()
615 SetVector<const BasicBlock *> Worklist; in recalculateBBsStates() local
619 Worklist.insert(BBI.first); in recalculateBBsStates()
[all …]
/llvm-project-15.0.7/bolt/lib/Passes/
H A DBinaryFunctionCallGraph.cpp47 std::stack<NodeId> Worklist; in buildTraversalOrder() local
51 Worklist.push(Id); in buildTraversalOrder()
55 while (!Worklist.empty()) { in buildTraversalOrder()
56 const NodeId FuncId = Worklist.top(); in buildTraversalOrder()
57 Worklist.pop(); in buildTraversalOrder()
70 Worklist.push(FuncId); in buildTraversalOrder()
74 Worklist.push(Callee); in buildTraversalOrder()
/llvm-project-15.0.7/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()
/llvm-project-15.0.7/llvm/lib/Transforms/Utils/
H A DLoopSimplify.cpp160 SmallVector<BasicBlock *, 8> Worklist; in addBlockAndPredsToSet() local
161 Worklist.push_back(InputBB); in addBlockAndPredsToSet()
163 BasicBlock *BB = Worklist.pop_back_val(); in addBlockAndPredsToSet()
168 } while (!Worklist.empty()); in addBlockAndPredsToSet()
571 Worklist.push_back(OuterL); in simplifyOneLoop()
730 SmallVector<Loop *, 4> Worklist; in simplifyLoop() local
731 Worklist.push_back(L); in simplifyLoop()
737 Loop *L2 = Worklist[Idx]; in simplifyLoop()
738 Worklist.append(L2->begin(), L2->end()); in simplifyLoop()
741 while (!Worklist.empty()) in simplifyLoop()
[all …]

12345678