Home
last modified time | relevance | path

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

12345678910

/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.cpp135 static bool isReachableImpl(SmallVectorImpl<BasicBlock *> &Worklist, in isReachableImpl() argument
177 BasicBlock *BB = Worklist.pop_back_val(); in isReachableImpl()
214 Outer->getExitBlocks(Worklist); in isReachableImpl()
216 Worklist.append(succ_begin(BB), succ_end(BB)); in isReachableImpl()
218 } while (!Worklist.empty()); in isReachableImpl()
241 SmallVectorImpl<BasicBlock *> &Worklist, const BasicBlock *StopBB, in isPotentiallyReachableFromMany() argument
245 Worklist, SingleEntrySet<const BasicBlock *>(StopBB), ExclusionSet, DT, in isPotentiallyReachableFromMany()
250 SmallVectorImpl<BasicBlock *> &Worklist, in isManyPotentiallyReachableFromMany() argument
255 Worklist, StopSet, ExclusionSet, DT, LI); in isManyPotentiallyReachableFromMany()
276 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.cpp80 SmallVector<Constant *, 16> Worklist; in populateSlow() local
114 Worklist.push_back(C); in populateSlow()
120 visitReferences(Worklist, Visited, [&](Function &F) { in populateSlow()
193 SmallVector<Constant *, 16> Worklist; in LazyCallGraph() local
198 Worklist.push_back(GV.getInitializer()); in LazyCallGraph()
203 visitReferences(Worklist, Visited, [&](Function &F) { in LazyCallGraph()
267 SmallVector<Node *, 4> Worklist; in verify() local
269 Worklist.push_back(N); in verify()
270 while (!Worklist.empty()) { in verify()
271 Node *VisitingNode = Worklist.pop_back_val(); in verify()
[all …]
H A DMustExecute.cpp432 SmallVector<const BasicBlock *, 8> Worklist; in findForwardJoinPoint() local
438 Worklist.push_back(SuccBB); in findForwardJoinPoint()
440 LLVM_DEBUG(dbgs() << "\t\t#Worklist: " << Worklist.size() << "\n"); in findForwardJoinPoint()
443 if (Worklist.empty()) in findForwardJoinPoint()
447 if (Worklist.size() == 1) in findForwardJoinPoint()
448 return Worklist[0]; in findForwardJoinPoint()
459 if (!JoinBB && Worklist.size() == 2) { in findForwardJoinPoint()
460 const BasicBlock *Succ0 = Worklist[0]; in findForwardJoinPoint()
461 const BasicBlock *Succ1 = Worklist[1]; in findForwardJoinPoint()
510 while (!Worklist.empty()) { in findForwardJoinPoint()
[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/AggressiveInstCombine/
H A DTruncInstCombine.cpp88 SmallVector<Value *, 8> Worklist; in buildTruncExpressionGraph() local
93 Worklist.push_back(CurrentTruncInst->getOperand(0)); in buildTruncExpressionGraph()
95 while (!Worklist.empty()) { in buildTruncExpressionGraph()
96 Value *Curr = Worklist.back(); in buildTruncExpressionGraph()
99 Worklist.pop_back(); in buildTruncExpressionGraph()
110 Worklist.pop_back(); in buildTruncExpressionGraph()
118 Worklist.pop_back(); in buildTruncExpressionGraph()
151 append_range(Worklist, Operands); in buildTruncExpressionGraph()
160 Worklist.push_back(Op); in buildTruncExpressionGraph()
175 SmallVector<Value *, 8> Worklist; in getMinBitWidth() local
[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.cpp63 SmallVector<WeakVH, 8> Worklist(UnsimplifiedUsers.begin(), in replaceConditionalBranchesOnConstant() local
66 for (auto &VH : Worklist) { in replaceConditionalBranchesOnConstant()
109 SmallVector<WeakTrackingVH, 8> Worklist; in lowerConstantIntrinsics() local
122 Worklist.push_back(WeakTrackingVH(&I)); in lowerConstantIntrinsics()
127 for (WeakTrackingVH &VH: Worklist) { in lowerConstantIntrinsics()
156 return !Worklist.empty(); in lowerConstantIntrinsics()
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 DFloat2Int.cpp149 std::deque<Instruction*> Worklist(Roots.begin(), Roots.end()); in walkBackwards() local
150 while (!Worklist.empty()) { in walkBackwards()
151 Instruction *I = Worklist.back(); in walkBackwards()
152 Worklist.pop_back(); in walkBackwards()
192 Worklist.push_back(OI); in walkBackwards()
293 std::deque<Instruction *> Worklist; in walkForwards() local
296 Worklist.push_back(Pair.first); in walkForwards()
298 while (!Worklist.empty()) { in walkForwards()
299 Instruction *I = Worklist.back(); in walkForwards()
300 Worklist.pop_back(); in walkForwards()
[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.emplace_back(&OrigMI, OrigBits); in hasAllNBitUsers()
128 while (!Worklist.empty()) { in hasAllNBitUsers()
129 auto P = Worklist.pop_back_val(); in hasAllNBitUsers()
216 Worklist.emplace_back(UserMI, Bits - ShAmt); in hasAllNBitUsers()
228 Worklist.emplace_back(UserMI, Bits + ShAmt); in hasAllNBitUsers()
235 Worklist.emplace_back(UserMI, Bits + ShAmt); in hasAllNBitUsers()
243 Worklist.emplace_back(UserMI, Bits); in hasAllNBitUsers()
250 Worklist.emplace_back(UserMI, Bits); in hasAllNBitUsers()
264 Worklist.emplace_back(UserMI, Bits); in hasAllNBitUsers()
[all …]
H A DRISCVFoldMemOffset.cpp99 std::queue<Register> Worklist; in foldOffset() local
100 Worklist.push(OrigReg); in foldOffset()
102 while (!Worklist.empty()) { in foldOffset()
103 Register Reg = Worklist.front(); in foldOffset()
104 Worklist.pop(); in foldOffset()
223 Worklist.push(User.getOperand(0).getReg()); in foldOffset()
226 Worklist.push(User.getOperand(0).getReg()); in foldOffset()
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DSIWholeQuadMode.cpp196 std::vector<WorkItem> &Worklist);
198 unsigned SubReg, char Flag, std::vector<WorkItem> &Worklist);
200 std::vector<WorkItem> &Worklist);
202 std::vector<WorkItem> &Worklist);
203 char scanInstructions(MachineFunction &MF, std::vector<WorkItem> &Worklist);
204 void propagateInstruction(MachineInstr &MI, std::vector<WorkItem> &Worklist);
205 void propagateBlock(MachineBasicBlock &MBB, std::vector<WorkItem> &Worklist);
301 std::vector<WorkItem> &Worklist) { in markInstruction() argument
322 Worklist.emplace_back(&MI); in markInstruction()
328 std::vector<WorkItem> &Worklist) { in markDefs() argument
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Support/
H A DGenericIteratedDominanceFrontier.h147 SmallVector<DomTreeNodeBase<NodeTy> *, 32> Worklist; in calculate() local
172 assert(Worklist.empty()); in calculate()
173 Worklist.push_back(Root); in calculate()
175 while (!Worklist.empty()) { in calculate()
176 DomTreeNodeBase<NodeTy> *Node = Worklist.pop_back_val(); in calculate()
205 Worklist.push_back(DomChild); in calculate()
/freebsd/contrib/llvm-project/llvm/lib/Target/WebAssembly/
H A DWebAssemblyAddMissingPrototypes.cpp90 SmallVector<Value *> Worklist; in runOnModule() local
91 Worklist.push_back(&F); in runOnModule()
92 while (!Worklist.empty()) { in runOnModule()
93 Value *V = Worklist.pop_back_val(); in runOnModule()
96 Worklist.push_back(BC); in runOnModule()
/freebsd/contrib/llvm-project/llvm/lib/Target/ARM/
H A DMVELaneInterleavingPass.cpp156 std::vector<Instruction *> Worklist; in tryInterleave() local
157 Worklist.push_back(Start); in tryInterleave()
158 Worklist.push_back(cast<Instruction>(Start->getOperand(0))); in tryInterleave()
166 while (!Worklist.empty()) { in tryInterleave()
167 Instruction *I = Worklist.back(); in tryInterleave()
168 Worklist.pop_back(); in tryInterleave()
186 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/contrib/llvm-project/llvm/lib/Transforms/InstCombine/
H A DInstCombineLoadStoreAlloca.cpp55 SmallVector<ValueAndIsOffset, 32> Worklist; in isOnlyCopiedFromConstantMemory() local
57 Worklist.emplace_back(V, false); in isOnlyCopiedFromConstantMemory()
58 while (!Worklist.empty()) { in isOnlyCopiedFromConstantMemory()
59 ValueAndIsOffset Elem = Worklist.pop_back_val(); in isOnlyCopiedFromConstantMemory()
79 Worklist.emplace_back(I, true); in isOnlyCopiedFromConstantMemory()
84 Worklist.emplace_back(I, IsOffset); in isOnlyCopiedFromConstantMemory()
90 Worklist.emplace_back(I, IsOffset || !GEP->hasAllZeroIndices()); in isOnlyCopiedFromConstantMemory()
270 SmallVector<Instruction *> Worklist; in collectUsers() local
277 Worklist.emplace_back(I); in collectUsers()
281 while (!Worklist.empty()) { in collectUsers()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/IR/
H A DSafepointIRVerifier.cpp329 SmallVector<const Value *, 32> Worklist; in getBaseType() local
332 Worklist.push_back(Val); in getBaseType()
336 while(!Worklist.empty()) { in getBaseType()
337 const Value *V = Worklist.pop_back_val(); in getBaseType()
342 Worklist.push_back(CI->stripPointerCasts()); in getBaseType()
346 Worklist.push_back(GEP->getPointerOperand()); in getBaseType()
352 append_range(Worklist, PN->incoming_values()); in getBaseType()
357 Worklist.push_back(SI->getTrueValue()); in getBaseType()
358 Worklist.push_back(SI->getFalseValue()); in getBaseType()
364 Worklist.push_back(GCRelocate->getDerivedPtr()); in getBaseType()
[all …]
H A DEHPersonalities.cpp114 SmallVector<std::pair<BasicBlock *, BasicBlock *>, 16> Worklist; in colorEHFunclets() local
131 Worklist.push_back({EntryBlock, EntryBlock}); in colorEHFunclets()
133 while (!Worklist.empty()) { in colorEHFunclets()
136 std::tie(Visiting, Color) = Worklist.pop_back_val(); in colorEHFunclets()
168 Worklist.push_back({Succ, SuccColor}); in colorEHFunclets()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/ObjCARC/
H A DProvenanceAnalysis.cpp85 SmallVector<const Value *, 8> Worklist; in IsStoredObjCPointer() local
86 Worklist.push_back(P); in IsStoredObjCPointer()
89 P = Worklist.pop_back_val(); in IsStoredObjCPointer()
106 Worklist.push_back(Ur); in IsStoredObjCPointer()
108 } while (!Worklist.empty()); in IsStoredObjCPointer()
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Scalar/
H A DLoopPassManager.h272 Worklist.insert(CurrentL);
281 appendLoopsToWorklist(NewChildLoops, Worklist);
302 Worklist.insert(NewSibLoops);
304 appendLoopsToWorklist(NewSibLoops, Worklist);
320 Worklist.insert(CurrentL);
337 SmallPriorityWorklist<Loop *, 4> &Worklist;
353 LPMUpdater(SmallPriorityWorklist<Loop *, 4> &Worklist,
356 : Worklist(Worklist), LAM(LAM), LoopNestMode(LoopNestMode),
/freebsd/contrib/llvm-project/compiler-rt/lib/ctx_profile/
H A DRootAutoDetector.cpp170 Set<const Trie *> Worklist; in determineRoots() local
171 Worklist.insert({&TheTrie, {}}); in determineRoots()
173 while (!Worklist.empty()) { in determineRoots()
176 Worklist.forEach([&](const auto &KVP) { in determineRoots()
190 Worklist.swap(NextWorklist); in determineRoots()
/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()
222 Worklist.push_back(std::make_pair(UserMI, Bits - ShAmt)); in hasAllNBitUsers()
233 Worklist.push_back(std::make_pair(UserMI, Bits)); in hasAllNBitUsers()
239 Worklist.push_back(std::make_pair(UserMI, Bits)); in hasAllNBitUsers()
246 Worklist.push_back(std::make_pair(UserMI, Bits)); in hasAllNBitUsers()
257 Worklist.push_back(std::make_pair(UserMI, Bits)); in hasAllNBitUsers()
329 Worklist.push_back(std::make_pair(UserMI, Bits)); in hasAllNBitUsers()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DLoopSimplify.cpp157 SmallVector<BasicBlock *, 8> Worklist; in addBlockAndPredsToSet() local
158 Worklist.push_back(InputBB); in addBlockAndPredsToSet()
160 BasicBlock *BB = Worklist.pop_back_val(); in addBlockAndPredsToSet()
164 append_range(Worklist, predecessors(BB)); in addBlockAndPredsToSet()
165 } while (!Worklist.empty()); in addBlockAndPredsToSet()
475 static bool simplifyOneLoop(Loop *L, SmallVectorImpl<Loop *> &Worklist, in simplifyOneLoop() argument
567 Worklist.push_back(OuterL); in simplifyOneLoop()
714 SmallVector<Loop *, 4> Worklist; in simplifyLoop() local
715 Worklist.push_back(L); in simplifyLoop()
720 for (unsigned Idx = 0; Idx != Worklist.size(); ++Idx) { in simplifyLoop()
[all …]

12345678910