Home
last modified time | relevance | path

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

12345678

/openbsd-src/gnu/llvm/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 …]
/openbsd-src/gnu/llvm/llvm/lib/Analysis/
H A DCodeMetrics.cpp29 SmallVectorImpl<const Value *> &Worklist) { in appendSpeculatableOperands() argument
38 Worklist.push_back(I); in appendSpeculatableOperands()
42 SmallVectorImpl<const Value *> &Worklist, in completeEphemeralValues() argument
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
[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()
228 return isPotentiallyReachableFromMany(Worklist, B, ExclusionSet, DT, LI); in isPotentiallyReachable()
261 SmallVector<BasicBlock*, 32> Worklist; in isPotentiallyReachable() local
262 Worklist.append(succ_begin(BB), succ_end(BB)); in isPotentiallyReachable()
[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()
257 SmallVector<Node *, 4> Worklist; in verify() local
259 Worklist.push_back(N); in verify()
260 while (!Worklist.empty()) { in verify()
261 Node *VisitingNode = Worklist.pop_back_val(); in verify()
[all …]
H A DMustExecute.cpp529 SmallVector<const BasicBlock *, 8> Worklist; in findForwardJoinPoint() local
535 Worklist.push_back(SuccBB); in findForwardJoinPoint()
537 LLVM_DEBUG(dbgs() << "\t\t#Worklist: " << Worklist.size() << "\n"); in findForwardJoinPoint()
540 if (Worklist.empty()) in findForwardJoinPoint()
544 if (Worklist.size() == 1) in findForwardJoinPoint()
545 return Worklist[0]; in findForwardJoinPoint()
556 if (!JoinBB && Worklist.size() == 2) { in findForwardJoinPoint()
557 const BasicBlock *Succ0 = Worklist[0]; in findForwardJoinPoint()
558 const BasicBlock *Succ1 = Worklist[1]; in findForwardJoinPoint()
607 while (!Worklist.empty()) { in findForwardJoinPoint()
[all …]
H A DLegacyDivergenceAnalysis.cpp123 std::vector<Value *> Worklist; // Stack for DFS. member in __anon383f524f0111::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()
/openbsd-src/gnu/llvm/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()
/openbsd-src/gnu/llvm/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()
111 Worklist.pop_back(); in buildTruncExpressionGraph()
119 Worklist.pop_back(); in buildTruncExpressionGraph()
152 append_range(Worklist, Operands); in buildTruncExpressionGraph()
161 Worklist.push_back(Op); in buildTruncExpressionGraph()
176 SmallVector<Value *, 8> Worklist; in getMinBitWidth() local
[all …]
/openbsd-src/gnu/llvm/llvm/lib/Transforms/Scalar/
H A DLoopAccessAnalysisPrinter.cpp25 SmallPriorityWorklist<Loop *, 4> Worklist; in run() local
26 appendLoopsToWorklist(LI, Worklist); in run()
27 while (!Worklist.empty()) { in run()
28 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()
106 SmallVector<WeakTrackingVH, 8> Worklist; in lowerConstantIntrinsics() local
119 Worklist.push_back(WeakTrackingVH(&I)); in lowerConstantIntrinsics()
124 for (WeakTrackingVH &VH: Worklist) { in lowerConstantIntrinsics()
151 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()
154 for (Instruction *&I : llvm::reverse(Worklist)) { in bitTrackingDCE()
159 for (Instruction *&I : Worklist) { in bitTrackingDCE()
/openbsd-src/gnu/llvm/llvm/lib/Target/AMDGPU/
H A DSIWholeQuadMode.cpp183 std::vector<WorkItem> &Worklist);
185 unsigned SubReg, char Flag, std::vector<WorkItem> &Worklist);
187 std::vector<WorkItem> &Worklist);
189 std::vector<WorkItem> &Worklist);
190 char scanInstructions(MachineFunction &MF, std::vector<WorkItem> &Worklist);
191 void propagateInstruction(MachineInstr &MI, std::vector<WorkItem> &Worklist);
192 void propagateBlock(MachineBasicBlock &MBB, std::vector<WorkItem> &Worklist);
293 std::vector<WorkItem> &Worklist) { in markInstruction() argument
311 Worklist.push_back(&MI); in markInstruction()
317 std::vector<WorkItem> &Worklist) { in markDefs() argument
[all …]
/openbsd-src/gnu/llvm/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()
/openbsd-src/gnu/llvm/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()
/openbsd-src/gnu/llvm/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()
/openbsd-src/gnu/llvm/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()
/openbsd-src/gnu/llvm/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 …]
/openbsd-src/gnu/llvm/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()
479 static bool simplifyOneLoop(Loop *L, SmallVectorImpl<Loop *> &Worklist, in simplifyOneLoop() argument
571 Worklist.push_back(OuterL); in simplifyOneLoop()
725 SmallVector<Loop *, 4> Worklist; in simplifyLoop() local
726 Worklist.push_back(L); in simplifyLoop()
731 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()
/openbsd-src/gnu/llvm/llvm/lib/Transforms/ObjCARC/
H A DProvenanceAnalysis.cpp98 SmallVector<const Value *, 8> Worklist; in IsStoredObjCPointer() local
99 Worklist.push_back(P); in IsStoredObjCPointer()
102 P = Worklist.pop_back_val(); in IsStoredObjCPointer()
119 Worklist.push_back(Ur); in IsStoredObjCPointer()
121 } 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()
231 Worklist.push_back(std::make_pair(PredBB, PredBB->end())); in findDependencies()
242 } while (!Worklist.empty()); in findDependencies()
/openbsd-src/gnu/llvm/llvm/include/llvm/Transforms/Scalar/
H A DLoopPassManager.h308 Worklist.insert(CurrentL);
317 appendLoopsToWorklist(NewChildLoops, Worklist);
338 Worklist.insert(NewSibLoops);
340 appendLoopsToWorklist(NewSibLoops, Worklist);
356 Worklist.insert(CurrentL);
373 SmallPriorityWorklist<Loop *, 4> &Worklist;
389 LPMUpdater(SmallPriorityWorklist<Loop *, 4> &Worklist,
392 : Worklist(Worklist), LAM(LAM), LoopNestMode(LoopNestMode),

12345678