Home
last modified time | relevance | path

Searched refs:Worklist (Results 1 – 25 of 201) 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 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, const 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()
261 SmallVector<BasicBlock*, 32> Worklist; in isPotentiallyReachable() local
262 Worklist.append(succ_begin(BB), succ_end(BB)); in isPotentiallyReachable()
263 if (Worklist.empty()) { in isPotentiallyReachable()
[all …]
H A DLazyCallGraph.cpp259 Worklist.push_back(N); in verify()
260 while (!Worklist.empty()) { in verify()
317 } while (!Worklist.empty()); in isAncestorOf()
383 Worklist.push_back(N); in verify()
384 while (!Worklist.empty()) { in verify()
423 Worklist.push_back(this); in isAncestorOf()
437 } while (!Worklist.empty()); in isAncestorOf()
780 Worklist.swap(OldSCC.Nodes); in switchInternalEdgeToRef()
781 for (Node *N : Worklist) { in switchInternalEdgeToRef()
1049 Worklist.push_back(this); in insertIncomingRefEdge()
[all …]
H A DMustExecute.cpp430 Worklist.push_back(SuccBB); 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()
502 while (!Worklist.empty()) { in findForwardJoinPoint()
566 Worklist.push_back(PredBB); in findBackwardJoinPoint()
570 if (Worklist.empty()) in findBackwardJoinPoint()
574 if (Worklist.size() == 1) in findBackwardJoinPoint()
575 return Worklist[0]; in findBackwardJoinPoint()
[all …]
H A DGuardUtils.cpp120 SmallVector<Value *, 4> Worklist(1, Condition); in parseCondition() local
124 Value *Check = Worklist.pop_back_val(); in parseCondition()
128 Worklist.push_back(LHS); in parseCondition()
130 Worklist.push_back(RHS); in parseCondition()
135 } while (!Worklist.empty()); in parseCondition()
/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/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 …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLoopAccessAnalysisPrinter.cpp26 SmallPriorityWorklist<Loop *, 4> Worklist; in run() local
27 appendLoopsToWorklist(LI, Worklist); in run()
28 while (!Worklist.empty()) { in run()
29 Loop *L = Worklist.pop_back_val(); in run()
H A DLowerConstantIntrinsics.cpp64 SmallVector<WeakVH, 8> Worklist(UnsimplifiedUsers.begin(), in replaceConditionalBranchesOnConstant() local
67 for (auto &VH : Worklist) { in replaceConditionalBranchesOnConstant()
107 SmallVector<WeakTrackingVH, 8> Worklist; in lowerConstantIntrinsics() local
120 Worklist.push_back(WeakTrackingVH(&I)); in lowerConstantIntrinsics()
125 for (WeakTrackingVH &VH: Worklist) { in lowerConstantIntrinsics()
154 return !Worklist.empty(); in lowerConstantIntrinsics()
H A DBDCE.cpp91 SmallVector<Instruction*, 128> Worklist; in bitTrackingDCE() local
105 Worklist.push_back(&I); in bitTrackingDCE()
121 Worklist.push_back(SE); in bitTrackingDCE()
151 for (Instruction *&I : llvm::reverse(Worklist)) { in bitTrackingDCE()
156 for (Instruction *&I : Worklist) { in bitTrackingDCE()
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/RISCV/
H A DRISCVOptWInstrs.cpp115 Worklist.push_back(std::make_pair(&OrigMI, OrigBits)); in hasAllNBitUsers()
117 while (!Worklist.empty()) { in hasAllNBitUsers()
118 auto P = Worklist.pop_back_val(); in hasAllNBitUsers()
210 Worklist.push_back(std::make_pair(UserMI, Bits)); in hasAllNBitUsers()
216 Worklist.push_back(std::make_pair(UserMI, Bits)); in hasAllNBitUsers()
223 Worklist.push_back(std::make_pair(UserMI, Bits)); in hasAllNBitUsers()
237 Worklist.push_back(std::make_pair(UserMI, Bits)); in hasAllNBitUsers()
389 SmallVector<MachineInstr *, 4> Worklist; in isSignExtendedW() local
403 Worklist.push_back(SrcMI); in isSignExtendedW()
410 while (!Worklist.empty()) { in isSignExtendedW()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DSIWholeQuadMode.cpp310 Worklist.push_back(&MI); in markInstruction()
582 Worklist.push_back(MBB); in scanInstructions()
656 Worklist.push_back(MBB); in propagateInstruction()
667 Worklist.push_back(PrevMI); in propagateInstruction()
696 Worklist.push_back(LastMI); in propagateBlock()
708 Worklist.push_back(Pred); in propagateBlock()
718 Worklist.push_back(Succ); in propagateBlock()
723 std::vector<WorkItem> Worklist; in analyzeFunction() local
726 while (!Worklist.empty()) { in analyzeFunction()
727 WorkItem WI = Worklist.back(); in analyzeFunction()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Support/
H A DGenericIteratedDominanceFrontier.h146 SmallVector<DomTreeNodeBase<NodeTy> *, 32> Worklist; in calculate() local
167 assert(Worklist.empty()); in calculate()
168 Worklist.push_back(Root); in calculate()
170 while (!Worklist.empty()) { in calculate()
171 DomTreeNodeBase<NodeTy> *Node = Worklist.pop_back_val(); in calculate()
200 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/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()
613 SetVector<const BasicBlock *> Worklist; in recalculateBBsStates() local
617 Worklist.insert(BBI.first); in recalculateBBsStates()
[all …]
H A DEHPersonalities.cpp103 SmallVector<std::pair<BasicBlock *, BasicBlock *>, 16> Worklist; in colorEHFunclets() local
120 Worklist.push_back({EntryBlock, EntryBlock}); in colorEHFunclets()
122 while (!Worklist.empty()) { in colorEHFunclets()
125 std::tie(Visiting, Color) = Worklist.pop_back_val(); in colorEHFunclets()
157 Worklist.push_back({Succ, SuccColor}); in colorEHFunclets()
/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()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/InstCombine/
H A DInstCombineLoadStoreAlloca.cpp64 Worklist.emplace_back(V, false); in isOnlyCopiedFromConstantMemory()
65 while (!Worklist.empty()) { in isOnlyCopiedFromConstantMemory()
291 if (!Worklist.contains(Inst)) in collectUsers()
302 Worklist.insert(Load); in collectUsersRecursive()
319 Worklist.insert(PHI); in collectUsersRecursive()
332 Worklist.insert(SI); in collectUsersRecursive()
336 Worklist.insert(Inst); in collectUsersRecursive()
342 Worklist.insert(Inst); in collectUsersRecursive()
344 Worklist.insert(Inst); in collectUsersRecursive()
871 } while (!Worklist.empty()); in isObjectSizeLessThanOrEq()
[all …]
/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()
168 } while (!Worklist.empty()); in addBlockAndPredsToSet()
570 Worklist.push_back(OuterL); in simplifyOneLoop()
718 SmallVector<Loop *, 4> Worklist; in simplifyLoop() local
719 Worklist.push_back(L); in simplifyLoop()
725 Loop *L2 = Worklist[Idx]; in simplifyLoop()
726 Worklist.append(L2->begin(), L2->end()); in simplifyLoop()
729 while (!Worklist.empty()) 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()
/freebsd/contrib/llvm-project/llvm/lib/Target/SPIRV/
H A DSPIRVEmitIntrinsics.cpp173 Worklist.push(&I); in preprocessUndefs()
175 while (!Worklist.empty()) { in preprocessUndefs()
177 Worklist.pop(); in preprocessUndefs()
186 Worklist.push(IntrUndef); in preprocessUndefs()
196 Worklist.push(&I); in preprocessCompositeConstants()
198 while (!Worklist.empty()) { in preprocessCompositeConstants()
209 Worklist.push(CCI); in preprocessCompositeConstants()
231 Worklist.pop(); in preprocessCompositeConstants()
640 Worklist.push_back(&I); in runOnFunction()
642 for (auto &I : Worklist) { in runOnFunction()
[all …]
/freebsd/contrib/llvm-project/clang/lib/Analysis/
H A DIntervalPartition.cpp50 std::queue<const Node *> Worklist; in buildInterval() local
57 Worklist.push(S); in buildInterval()
70 while (!Worklist.empty()) { in buildInterval()
71 const auto *B = Worklist.front(); in buildInterval()
73 Worklist.pop(); in buildInterval()
88 Worklist.push(S); in buildInterval()

123456789