Home
last modified time | relevance | path

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

123456789

/freebsd/contrib/llvm-project/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 …]
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DCFG.cpp134 static bool isReachableImpl(SmallVectorImpl<BasicBlock *> &Worklist, in isReachableImpl() argument
176 BasicBlock *BB = Worklist.pop_back_val(); in isReachableImpl()
213 Outer->getExitBlocks(Worklist); in isReachableImpl()
215 Worklist.append(succ_begin(BB), succ_end(BB)); in isReachableImpl()
217 } while (!Worklist.empty()); in isReachableImpl()
240 SmallVectorImpl<BasicBlock *> &Worklist, const BasicBlock *StopBB, in isPotentiallyReachableFromMany() argument
244 Worklist, SingleEntrySet<const BasicBlock *>(StopBB), ExclusionSet, DT, in isPotentiallyReachableFromMany()
249 SmallVectorImpl<BasicBlock *> &Worklist, in isManyPotentiallyReachableFromMany() argument
254 Worklist, StopSet, ExclusionSet, DT, LI); in isManyPotentiallyReachableFromMany()
275 SmallVector<BasicBlock*, 32> Worklist; in isPotentiallyReachable() local
[all …]
H A DCodeMetrics.cpp30 SmallVectorImpl<const Value *> &Worklist) { in appendSpeculatableOperands() argument
39 Worklist.push_back(I); in appendSpeculatableOperands()
43 SmallVectorImpl<const Value *> &Worklist, in completeEphemeralValues() argument
52 for (int i = 0; i < (int)Worklist.size(); ++i) { in completeEphemeralValues()
53 const Value *V = Worklist[i]; in completeEphemeralValues()
66 appendSpeculatableOperands(V, Visited, Worklist); in completeEphemeralValues()
75 SmallVector<const Value *, 16> Worklist; in collectEphemeralValues() local
89 appendSpeculatableOperands(I, Visited, Worklist); in collectEphemeralValues()
92 completeEphemeralValues(Visited, Worklist, EphValues); in collectEphemeralValues()
99 SmallVector<const Value *, 16> Worklist; in collectEphemeralValues() local
[all …]
H A DLazyCallGraph.cpp78 SmallVector<Constant *, 16> Worklist; in populateSlow() local
112 Worklist.push_back(C); in populateSlow()
118 visitReferences(Worklist, Visited, [&](Function &F) { in populateSlow()
191 SmallVector<Constant *, 16> Worklist; in LazyCallGraph() local
196 Worklist.push_back(GV.getInitializer()); in LazyCallGraph()
201 visitReferences(Worklist, Visited, [&](Function &F) { in LazyCallGraph()
265 SmallVector<Node *, 4> Worklist; in verify() local
267 Worklist.push_back(N); in verify()
268 while (!Worklist.empty()) { in verify()
269 Node *VisitingNode = Worklist.pop_back_val(); in verify()
[all …]
H A DMustExecute.cpp424 SmallVector<const BasicBlock *, 8> Worklist; in findForwardJoinPoint() local
430 Worklist.push_back(SuccBB); in findForwardJoinPoint()
432 LLVM_DEBUG(dbgs() << "\t\t#Worklist: " << Worklist.size() << "\n"); in findForwardJoinPoint()
435 if (Worklist.empty()) in findForwardJoinPoint()
439 if (Worklist.size() == 1) in findForwardJoinPoint()
440 return Worklist[0]; in findForwardJoinPoint()
451 if (!JoinBB && Worklist.size() == 2) { in findForwardJoinPoint()
452 const BasicBlock *Succ0 = Worklist[0]; in findForwardJoinPoint()
453 const BasicBlock *Succ1 = Worklist[1]; in findForwardJoinPoint()
502 while (!Worklist.empty()) { in findForwardJoinPoint()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/AggressiveInstCombine/
H A DTruncInstCombine.cpp89 SmallVector<Value *, 8> Worklist; in buildTruncExpressionGraph() local
94 Worklist.push_back(CurrentTruncInst->getOperand(0)); in buildTruncExpressionGraph()
96 while (!Worklist.empty()) { in buildTruncExpressionGraph()
97 Value *Curr = Worklist.back(); in buildTruncExpressionGraph()
100 Worklist.pop_back(); in buildTruncExpressionGraph()
110 // Worklist and the Stack, and add it to the instruction info map. in buildTruncExpressionGraph()
111 Worklist.pop_back(); in buildTruncExpressionGraph()
119 Worklist.pop_back(); in buildTruncExpressionGraph()
152 append_range(Worklist, Operands); in buildTruncExpressionGraph()
161 Worklist in buildTruncExpressionGraph()
176 SmallVector<Value *, 8> Worklist; getMinBitWidth() local
[all...]
/freebsd/contrib/llvm-project/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()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLoopAccessAnalysisPrinter.cpp26 SmallPriorityWorklist<Loop *, 4> Worklist; in run()
27 appendLoopsToWorklist(LI, Worklist); in run()
28 while (!Worklist.empty()) { in run()
29 Loop *L = Worklist.pop_back_val(); in run()
25 SmallPriorityWorklist<Loop *, 4> Worklist; run() local
H A DBDCE.cpp97 SmallVector<Instruction*, 128> Worklist; in bitTrackingDCE() local
111 Worklist.push_back(&I); in bitTrackingDCE()
127 Worklist.push_back(SE); in bitTrackingDCE()
157 Worklist.push_back(BO); in bitTrackingDCE()
189 for (Instruction *&I : llvm::reverse(Worklist)) { in bitTrackingDCE()
194 for (Instruction *&I : Worklist) { in bitTrackingDCE()
H A DLowerConstantIntrinsics.cpp64 SmallVector<WeakVH, 8> Worklist(UnsimplifiedUsers.begin(), in replaceConditionalBranchesOnConstant() local
67 for (auto &VH : Worklist) { in replaceConditionalBranchesOnConstant()
110 SmallVector<WeakTrackingVH, 8> Worklist; in lowerConstantIntrinsics() local
123 Worklist.push_back(WeakTrackingVH(&I)); in lowerConstantIntrinsics()
128 for (WeakTrackingVH &VH: Worklist) { in lowerConstantIntrinsics()
157 return !Worklist.empty(); in lowerConstantIntrinsics()
H A DFloat2Int.cpp153 std::deque<Instruction*> Worklist(Roots.begin(), Roots.end()); in walkBackwards() local
154 while (!Worklist.empty()) { in walkBackwards()
155 Instruction *I = Worklist.back(); in walkBackwards()
156 Worklist.pop_back(); in walkBackwards()
196 Worklist.push_back(OI); in walkBackwards()
297 std::deque<Instruction *> Worklist; in walkForwards() local
300 Worklist.push_back(Pair.first); in walkForwards()
302 while (!Worklist.empty()) { in walkForwards()
303 Instruction *I = Worklist.back(); in walkForwards()
304 Worklist.pop_back(); in walkForwards()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DSIWholeQuadMode.cpp185 std::vector<WorkItem> &Worklist);
187 unsigned SubReg, char Flag, std::vector<WorkItem> &Worklist);
189 std::vector<WorkItem> &Worklist);
191 std::vector<WorkItem> &Worklist);
192 char scanInstructions(MachineFunction &MF, std::vector<WorkItem> &Worklist);
193 void propagateInstruction(MachineInstr &MI, std::vector<WorkItem> &Worklist);
194 void propagateBlock(MachineBasicBlock &MBB, std::vector<WorkItem> &Worklist);
293 std::vector<WorkItem> &Worklist) { in markInstruction() argument
311 Worklist.emplace_back(&MI); in markInstruction()
317 std::vector<WorkItem> &Worklist) { in markDefs() argument
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/RISCV/
H A DRISCVOptWInstrs.cpp124 SmallVector<std::pair<const MachineInstr *, unsigned>, 4> Worklist; in hasAllNBitUsers() local
126 Worklist.push_back(std::make_pair(&OrigMI, OrigBits)); in hasAllNBitUsers()
128 while (!Worklist.empty()) { in hasAllNBitUsers()
129 auto P = Worklist.pop_back_val(); in hasAllNBitUsers()
210 Worklist.push_back(std::make_pair(UserMI, Bits - ShAmt)); in hasAllNBitUsers()
221 Worklist.push_back(std::make_pair(UserMI, Bits)); in hasAllNBitUsers()
227 Worklist.push_back(std::make_pair(UserMI, Bits)); in hasAllNBitUsers()
234 Worklist.push_back(std::make_pair(UserMI, Bits)); in hasAllNBitUsers()
248 Worklist.push_back(std::make_pair(UserMI, Bits)); in hasAllNBitUsers()
267 Worklist.push_back(std::make_pair(UserMI, Bits)); in hasAllNBitUsers()
[all …]
/freebsd/contrib/llvm-project/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()
345 Worklist.push_back(GEP->getPointerOperand()); in getBaseType()
351 append_range(Worklist, PN->incoming_values()); in getBaseType()
356 Worklist.push_back(SI->getTrueValue()); in getBaseType()
357 Worklist.push_back(SI->getFalseValue()); in getBaseType()
363 Worklist.push_back(GCRelocate->getDerivedPtr()); in getBaseType()
[all …]
H A DEHPersonalities.cpp106 SmallVector<std::pair<BasicBlock *, BasicBlock *>, 16> Worklist; in colorEHFunclets() local
123 Worklist.push_back({EntryBlock, EntryBlock}); in colorEHFunclets()
125 while (!Worklist.empty()) { in colorEHFunclets()
128 std::tie(Visiting, Color) = Worklist.pop_back_val(); in colorEHFunclets()
160 Worklist.push_back({Succ, SuccColor}); in colorEHFunclets()
/freebsd/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/contrib/llvm-project/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()
/freebsd/contrib/llvm-project/llvm/lib/Target/LoongArch/
H A DLoongArchOptWInstrs.cpp103 SmallVector<std::pair<const MachineInstr *, unsigned>, 4> Worklist; in hasAllNBitUsers() local
105 Worklist.push_back(std::make_pair(&OrigMI, OrigBits)); in hasAllNBitUsers()
107 while (!Worklist.empty()) { in hasAllNBitUsers()
108 auto P = Worklist.pop_back_val(); in hasAllNBitUsers()
192 Worklist.push_back(std::make_pair(UserMI, Bits - ShAmt)); in hasAllNBitUsers()
203 Worklist.push_back(std::make_pair(UserMI, Bits)); in hasAllNBitUsers()
209 Worklist.push_back(std::make_pair(UserMI, Bits)); in hasAllNBitUsers()
216 Worklist.push_back(std::make_pair(UserMI, Bits)); in hasAllNBitUsers()
227 Worklist.push_back(std::make_pair(UserMI, Bits)); in hasAllNBitUsers()
299 Worklist.push_back(std::make_pair(UserMI, Bits)); in hasAllNBitUsers()
[all …]
/freebsd/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()
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()
252 Worklist.push_back(cast<Instruction>(&Op)); in tryInterleave()
258 Worklist.push_back(cast<Instruction>(Use)); in tryInterleave()
/freebsd/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.cpp213 SmallVector<std::pair<BasicBlock *, BasicBlock::iterator>, 4> Worklist; in findDependencies() local
214 Worklist.push_back(std::make_pair(StartBB, StartPos)); in findDependencies()
217 Worklist.pop_back_val(); in findDependencies()
229 Worklist.push_back(std::make_pair(PredBB, PredBB->end())); in findDependencies()
239 } while (!Worklist.empty()); in findDependencies()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/InstCombine/
H A DInstCombineLoadStoreAlloca.cpp62 SmallVector<ValueAndIsOffset, 32> Worklist; in isOnlyCopiedFromConstantMemory() local
64 Worklist.emplace_back(V, false); in isOnlyCopiedFromConstantMemory()
65 while (!Worklist.empty()) { in isOnlyCopiedFromConstantMemory()
66 ValueAndIsOffset Elem = Worklist.pop_back_val(); in isOnlyCopiedFromConstantMemory()
86 Worklist.emplace_back(I, true); in isOnlyCopiedFromConstantMemory()
91 Worklist.emplace_back(I, IsOffset); in isOnlyCopiedFromConstantMemory()
97 Worklist.emplace_back(I, IsOffset || !GEP->hasAllZeroIndices()); in isOnlyCopiedFromConstantMemory()
262 return I == &Root || Worklist.contains(I); in isAvailable()
275 SmallSetVector<Instruction *, 4> Worklist; member in __anond4d3796c0111::PointerReplacer
291 if (!Worklist.contains(Inst)) in collectUsers()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Scalar/
H A DLoopPassManager.h275 Worklist.insert(CurrentL);
284 appendLoopsToWorklist(NewChildLoops, Worklist);
305 Worklist.insert(NewSibLoops);
307 appendLoopsToWorklist(NewSibLoops, Worklist);
323 Worklist.insert(CurrentL);
340 SmallPriorityWorklist<Loop *, 4> &Worklist;
356 LPMUpdater(SmallPriorityWorklist<Loop *, 4> &Worklist,
359 : Worklist(Worklist), LAM(LAM), LoopNestMode(LoopNestMode),
/freebsd/contrib/llvm-project/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()
167 append_range(Worklist, predecessors(BB)); in addBlockAndPredsToSet()
168 } while (!Worklist.empty()); in addBlockAndPredsToSet()
478 static bool simplifyOneLoop(Loop *L, SmallVectorImpl<Loop *> &Worklist, in simplifyOneLoop() argument
570 Worklist.push_back(OuterL); in simplifyOneLoop()
717 SmallVector<Loop *, 4> Worklist; in simplifyLoop() local
718 Worklist.push_back(L); in simplifyLoop()
723 for (unsigned Idx = 0; Idx != Worklist.size(); ++Idx) { in simplifyLoop()
[all …]
H A DGlobalStatus.cpp44 SmallVector<const Constant *, 8> Worklist; in isSafeToDestroyConstant() local
46 Worklist.push_back(C); in isSafeToDestroyConstant()
47 while (!Worklist.empty()) { in isSafeToDestroyConstant()
48 const Constant *C = Worklist.pop_back_val(); in isSafeToDestroyConstant()
56 Worklist.push_back(CU); in isSafeToDestroyConstant()

123456789