| /external/llvm/include/llvm/Transforms/InstCombine/ |
| D | InstCombineWorklist.h | 27 SmallVector<Instruction*, 256> Worklist; variable
36 : Worklist(std::move(Arg.Worklist)), in InstCombineWorklist()
39 Worklist = std::move(RHS.Worklist);
44 bool isEmpty() const { return Worklist.empty(); } in isEmpty()
49 if (WorklistMap.insert(std::make_pair(I, Worklist.size())).second) { in Add()
51 Worklist.push_back(I); in Add()
64 assert(Worklist.empty() && "Worklist must be empty to add initial group"); in AddInitialGroup()
65 Worklist.reserve(List.size()+16); in AddInitialGroup()
71 Worklist.push_back(I); in AddInitialGroup()
81 Worklist[It->second] = nullptr; in Remove()
[all …]
|
| D | InstCombine.h | 28 InstCombineWorklist Worklist; variable
35 InstCombinePass(InstCombinePass &&Arg) : Worklist(std::move(Arg.Worklist)) {} in InstCombinePass()
37 Worklist = std::move(RHS.Worklist);
|
| /external/llvm/lib/Transforms/Scalar/ |
| D | ADCE.cpp | 38 SmallVector<Instruction*, 128> Worklist; in aggressiveDCE() local
45 Worklist.push_back(&I); in aggressiveDCE()
50 while (!Worklist.empty()) { in aggressiveDCE()
51 Instruction *Curr = Worklist.pop_back_val(); in aggressiveDCE()
55 Worklist.push_back(Inst); in aggressiveDCE()
65 Worklist.push_back(&I); in aggressiveDCE()
70 for (Instruction *&I : Worklist) { in aggressiveDCE()
75 return !Worklist.empty(); in aggressiveDCE()
|
| D | LoopUnswitch.cpp | 261 void SimplifyCode(std::vector<Instruction*> &Worklist, Loop *L);
1117 std::vector<Instruction*> &Worklist) { in RemoveFromWorklist() argument
1119 Worklist.erase(std::remove(Worklist.begin(), Worklist.end(), I), in RemoveFromWorklist()
1120 Worklist.end()); in RemoveFromWorklist()
1126 std::vector<Instruction*> &Worklist, in ReplaceUsesOfWith() argument
1133 Worklist.push_back(Use); in ReplaceUsesOfWith()
1137 Worklist.push_back(cast<Instruction>(U)); in ReplaceUsesOfWith()
1139 RemoveFromWorklist(I, Worklist); in ReplaceUsesOfWith()
1162 std::vector<Instruction*> Worklist; in RewriteLoopBodyWithConditionConstant() local
1180 Worklist.push_back(UI); in RewriteLoopBodyWithConditionConstant()
[all …]
|
| D | BDCE.cpp | 66 SmallVector<Instruction*, 128> Worklist; in INITIALIZE_PASS_DEPENDENCY() local
86 Worklist.push_back(&I); in INITIALIZE_PASS_DEPENDENCY()
91 for (Instruction *&I : Worklist) { in INITIALIZE_PASS_DEPENDENCY()
|
| /external/llvm/lib/Analysis/ |
| D | CFG.cpp | 131 SmallVectorImpl<BasicBlock *> &Worklist, BasicBlock *StopBB, in isPotentiallyReachableFromMany() argument
143 BasicBlock *BB = Worklist.pop_back_val(); in isPotentiallyReachableFromMany()
163 Outer->getExitBlocks(Worklist); in isPotentiallyReachableFromMany()
165 Worklist.append(succ_begin(BB), succ_end(BB)); in isPotentiallyReachableFromMany()
167 } while (!Worklist.empty()); in isPotentiallyReachableFromMany()
179 SmallVector<BasicBlock*, 32> Worklist; in isPotentiallyReachable() local
180 Worklist.push_back(const_cast<BasicBlock*>(A)); in isPotentiallyReachable()
182 return isPotentiallyReachableFromMany(Worklist, const_cast<BasicBlock *>(B), in isPotentiallyReachable()
191 SmallVector<BasicBlock*, 32> Worklist; in isPotentiallyReachable() local
219 Worklist.append(succ_begin(BB), succ_end(BB)); in isPotentiallyReachable()
[all …]
|
| D | LazyCallGraph.cpp | 24 SmallVectorImpl<Constant *> &Worklist, SmallPtrSetImpl<Constant *> &Visited, in findCallees() argument
27 while (!Worklist.empty()) { in findCallees()
28 Constant *C = Worklist.pop_back_val(); in findCallees()
52 Worklist.push_back(cast<Constant>(Op)); in findCallees()
61 SmallVector<Constant *, 16> Worklist; in Node() local
70 Worklist.push_back(C); in Node()
75 findCallees(Worklist, Visited, Callees, CalleeIndexMap); in Node()
112 SmallVector<Constant *, 16> Worklist; in LazyCallGraph() local
117 Worklist.push_back(GV.getInitializer()); in LazyCallGraph()
121 findCallees(Worklist, Visited, EntryNodes, EntryIndexMap); in LazyCallGraph()
[all …]
|
| D | DivergenceAnalysis.cpp | 111 std::vector<Value *> Worklist; // Stack for DFS. member in __anonc7554f710111::DivergencePropagator
116 Worklist.clear(); in populateWithSourcesOfDivergence()
120 Worklist.push_back(&I); in populateWithSourcesOfDivergence()
126 Worklist.push_back(&Arg); in populateWithSourcesOfDivergence()
151 Worklist.push_back(&*I); in exploreSyncDependency()
196 Worklist.push_back(UserInst); in findUsersOutsideInfluenceRegion()
236 Worklist.push_back(UserInst); in exploreDataDependency()
242 while (!Worklist.empty()) { in propagate()
243 Value *V = Worklist.back(); in propagate()
244 Worklist.pop_back(); in propagate()
|
| D | IteratedDominanceFrontier.cpp | 42 SmallVector<DomTreeNode *, 32> Worklist; in calculate() local
57 Worklist.clear(); in calculate()
58 Worklist.push_back(Root); in calculate()
61 while (!Worklist.empty()) { in calculate()
62 DomTreeNode *Node = Worklist.pop_back_val(); in calculate()
91 Worklist.push_back(DomChild); in calculate()
|
| D | CaptureTracking.cpp | 102 SmallVector<BasicBlock*, 32> Worklist; in isSafeToPrune() local
103 Worklist.append(succ_begin(BB), succ_end(BB)); in isSafeToPrune()
104 return !isPotentiallyReachableFromMany(Worklist, BB, DT); in isSafeToPrune()
215 SmallVector<const Use *, Threshold> Worklist; in PointerMayBeCaptured() local
227 Worklist.push_back(&U); in PointerMayBeCaptured()
230 while (!Worklist.empty()) { in PointerMayBeCaptured()
231 const Use *U = Worklist.pop_back_val(); in PointerMayBeCaptured()
289 Worklist.push_back(&UU); in PointerMayBeCaptured()
|
| D | EHPersonalities.cpp | 49 SmallVector<std::pair<BasicBlock *, BasicBlock *>, 16> Worklist; in colorEHFunclets() local
66 Worklist.push_back({EntryBlock, EntryBlock}); in colorEHFunclets()
68 while (!Worklist.empty()) { in colorEHFunclets()
71 std::tie(Visiting, Color) = Worklist.pop_back_val(); in colorEHFunclets()
103 Worklist.push_back({Succ, SuccColor}); in colorEHFunclets()
|
| D | DemandedBits.cpp | 272 SmallVector<Instruction*, 128> Worklist; in performAnalysis() local
287 Worklist.push_back(&I); in performAnalysis()
298 Worklist.push_back(J); in performAnalysis()
308 while (!Worklist.empty()) { in performAnalysis()
309 Instruction *UserI = Worklist.pop_back_val(); in performAnalysis()
354 Worklist.push_back(I); in performAnalysis()
357 Worklist.push_back(I); in performAnalysis()
|
| /external/llvm/lib/Transforms/IPO/ |
| D | FunctionImport.cpp | 99 SmallVector<StringRef, 64> &Worklist) { in findExternalCalls() argument
143 Worklist.push_back(It.first->getKey()); in findExternalCalls()
161 SmallVector<StringRef, 64> &Worklist, in GetImportList() argument
167 while (!Worklist.empty()) { in GetImportList()
168 auto CalledFunctionName = Worklist.pop_back_val(); in GetImportList()
254 findExternalCalls(DestModule, *F, Index, CalledFunctions, Worklist); in GetImportList()
270 SmallVector<StringRef, 64> Worklist; in importFunctions() local
274 findExternalCalls(DestModule, F, Index, CalledFunctions, Worklist); in importFunctions()
276 if (Worklist.empty()) in importFunctions()
291 GetImportList(DestModule, Worklist, CalledFunctions, in importFunctions()
[all …]
|
| /external/llvm/lib/Transforms/ObjCARC/ |
| D | ProvenanceAnalysis.cpp | 78 SmallVector<const Value *, 8> Worklist; in IsStoredObjCPointer() local
79 Worklist.push_back(P); in IsStoredObjCPointer()
82 P = Worklist.pop_back_val(); in IsStoredObjCPointer()
99 Worklist.push_back(Ur); in IsStoredObjCPointer()
101 } while (!Worklist.empty()); in IsStoredObjCPointer()
|
| D | DependencyAnalysis.cpp | 231 SmallVector<std::pair<BasicBlock *, BasicBlock::iterator>, 4> Worklist; in FindDependencies() local
232 Worklist.push_back(std::make_pair(StartBB, StartPos)); in FindDependencies()
235 Worklist.pop_back_val(); in FindDependencies()
250 Worklist.push_back(std::make_pair(PredBB, PredBB->end())); in FindDependencies()
261 } while (!Worklist.empty()); in FindDependencies()
|
| /external/llvm/lib/Transforms/Utils/ |
| D | LoopSimplify.cpp | 190 SmallVector<BasicBlock *, 8> Worklist; in addBlockAndPredsToSet() local
191 Worklist.push_back(InputBB); in addBlockAndPredsToSet()
193 BasicBlock *BB = Worklist.pop_back_val(); in addBlockAndPredsToSet()
199 Worklist.push_back(WBB); in addBlockAndPredsToSet()
201 } while (!Worklist.empty()); in addBlockAndPredsToSet()
463 static bool simplifyOneLoop(Loop *L, SmallVectorImpl<Loop *> &Worklist, in simplifyOneLoop() argument
577 Worklist.push_back(OuterL); in simplifyOneLoop()
709 SmallVector<Loop *, 4> Worklist; in simplifyLoop() local
710 Worklist.push_back(L); in simplifyLoop()
715 for (unsigned Idx = 0; Idx != Worklist.size(); ++Idx) { in simplifyLoop()
[all …]
|
| D | LoopUtils.cpp | 99 SmallVector<Instruction *, 8> Worklist; in getSourceExtensionKind() local
102 Worklist.push_back(Exit); in getSourceExtensionKind()
106 while (!Worklist.empty()) { in getSourceExtensionKind()
107 Instruction *I = Worklist.pop_back_val(); in getSourceExtensionKind()
118 Worklist.push_back(J); in getSourceExtensionKind()
196 SmallVector<Instruction *, 8> Worklist; in AddReductionVar() local
213 Worklist.push_back(Start); in AddReductionVar()
230 while (!Worklist.empty()) { in AddReductionVar()
231 Instruction *Cur = Worklist.back(); in AddReductionVar()
232 Worklist.pop_back(); in AddReductionVar()
[all …]
|
| /external/llvm/include/llvm/Support/ |
| D | GenericDomTreeConstruction.h | 56 typename GraphT::ChildIteratorType>, 32> Worklist; in DFSPass() local
57 Worklist.push_back(std::make_pair(V, GraphT::child_begin(V))); in DFSPass()
58 while (!Worklist.empty()) { in DFSPass()
59 typename GraphT::NodeType* BB = Worklist.back().first; in DFSPass()
60 typename GraphT::ChildIteratorType NextSucc = Worklist.back().second; in DFSPass()
84 Worklist.pop_back(); in DFSPass()
89 ++Worklist.back().second; in DFSPass()
98 Worklist.push_back(std::make_pair(Succ, GraphT::child_begin(Succ))); in DFSPass()
|
| /external/llvm/lib/Transforms/InstCombine/ |
| D | InstCombineInternal.h | 142 InstCombineWorklist &Worklist; variable
147 : Worklist(WL), AC(AC) {} in InstCombineIRInserter()
152 Worklist.Add(I); in InsertHelper()
170 InstCombineWorklist &Worklist;
197 InstCombiner(InstCombineWorklist &Worklist, BuilderTy *Builder, in InstCombiner() argument
201 : Worklist(Worklist), Builder(Builder), MinimizeSize(MinimizeSize), in InstCombiner()
404 Worklist.Add(New); in InsertNewInstBefore()
425 Worklist.AddUsersToWorkList(I); // Add all modified instrs to worklist. in ReplaceInstUsesWith()
463 Worklist.Add(Op); in EraseInstFromFunction()
465 Worklist.Remove(&I); in EraseInstFromFunction()
|
| D | InstructionCombining.cpp | 1205 Worklist.Add(Parent.first); in Descale()
1223 Worklist.Add(Ancestor); in Descale()
1863 SmallVector<Instruction*, 4> Worklist; in isAllocSiteRemovable() local
1864 Worklist.push_back(AI); in isAllocSiteRemovable()
1867 Instruction *PI = Worklist.pop_back_val(); in isAllocSiteRemovable()
1878 Worklist.push_back(I); in isAllocSiteRemovable()
1933 } while (!Worklist.empty()); in isAllocSiteRemovable()
2116 Worklist.Add(Cond); in visitBranchInst()
2132 Worklist.Add(Cond); in visitBranchInst()
2194 Worklist.Add(I); in visitSwitchInst()
[all …]
|
| /external/llvm/lib/CodeGen/ |
| D | LiveDebugValues.cpp | 360 std::greater<unsigned int>> Worklist; in ExtendRanges() local
374 Worklist.push(RPONumber); in ExtendRanges()
382 while (!Worklist.empty() || !Pending.empty()) { in ExtendRanges()
387 while (!Worklist.empty()) { in ExtendRanges()
388 MachineBasicBlock *MBB = OrderToBB[Worklist.top()]; in ExtendRanges()
389 Worklist.pop(); in ExtendRanges()
410 Worklist.swap(Pending); in ExtendRanges()
|
| D | WinEHPrepare.cpp | 68 SmallVectorImpl<std::pair<BasicBlock *, Value *>> &Worklist);
446 SmallVector<std::pair<const Instruction *, int>, 8> Worklist; in calculateClrEHStateNumbers() local
459 Worklist.emplace_back(FirstNonPHI, -1); in calculateClrEHStateNumbers()
462 while (!Worklist.empty()) { in calculateClrEHStateNumbers()
465 std::tie(Pad, ParentState) = Worklist.pop_back_val(); in calculateClrEHStateNumbers()
506 Worklist.emplace_back(UserI, ParentState); in calculateClrEHStateNumbers()
518 Worklist.emplace_back(Pred->getFirstNonPHI(), PredState); in calculateClrEHStateNumbers()
946 SmallVector<std::pair<BasicBlock *, Value *>, 4> Worklist; in insertPHIStores() local
948 Worklist.push_back({OriginalPHI->getParent(), OriginalPHI}); in insertPHIStores()
950 while (!Worklist.empty()) { in insertPHIStores()
[all …]
|
| /external/llvm/lib/Target/AMDGPU/ |
| D | SIInstrInfo.h | 44 void lowerScalarAbs(SmallVectorImpl<MachineInstr *> &Worklist,
47 void splitScalar64BitUnaryOp(SmallVectorImpl<MachineInstr *> &Worklist,
50 void splitScalar64BitBinaryOp(SmallVectorImpl<MachineInstr *> &Worklist,
53 void splitScalar64BitBCNT(SmallVectorImpl<MachineInstr *> &Worklist,
55 void splitScalar64BitBFE(SmallVectorImpl<MachineInstr *> &Worklist,
60 SmallVectorImpl<MachineInstr *> &Worklist) const;
415 SmallVectorImpl<MachineInstr *> &Worklist) const;
|
| /external/llvm/tools/llvm-rtdyld/ |
| D | llvm-rtdyld.cpp | 520 WorklistT Worklist; in remapSectionsAndSymbols() local
523 Worklist.push_back(std::make_pair(CodeSection.base(), CodeSection.size())); in remapSectionsAndSymbols()
525 Worklist.push_back(std::make_pair(DataSection.base(), DataSection.size())); in remapSectionsAndSymbols()
539 for (WorklistT::iterator I = Worklist.begin(), E = Worklist.end(); in remapSectionsAndSymbols()
547 Worklist.erase(Tmp); in remapSectionsAndSymbols()
563 while (!Worklist.empty()) { in remapSectionsAndSymbols()
564 std::pair<void*, uint64_t> CurEntry = Worklist.front(); in remapSectionsAndSymbols()
565 Worklist.pop_front(); in remapSectionsAndSymbols()
|
| /external/llvm/include/llvm/Analysis/ |
| D | PtrUseVisitor.h | 124 SmallVector<UseToVisit, 8> Worklist; variable
217 while (!Worklist.empty()) { in visitPtr()
218 UseToVisit ToVisit = Worklist.pop_back_val(); in visitPtr()
|