| /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(NumEntries+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 | 57 SmallVector<Instruction*, 128> Worklist; in runOnFunction() local
64 Worklist.push_back(&I); in runOnFunction()
69 while (!Worklist.empty()) { in runOnFunction()
70 Instruction *Curr = Worklist.pop_back_val(); in runOnFunction()
74 Worklist.push_back(Inst); in runOnFunction()
84 Worklist.push_back(&I); in runOnFunction()
89 for (Instruction *&I : Worklist) { in runOnFunction()
94 return !Worklist.empty(); in runOnFunction()
|
| D | LoopUnswitch.cpp | 211 void SimplifyCode(std::vector<Instruction*> &Worklist, Loop *L);
928 std::vector<Instruction*> &Worklist) { in RemoveFromWorklist() argument
930 Worklist.erase(std::remove(Worklist.begin(), Worklist.end(), I), in RemoveFromWorklist()
931 Worklist.end()); in RemoveFromWorklist()
937 std::vector<Instruction*> &Worklist, in ReplaceUsesOfWith() argument
944 Worklist.push_back(Use); in ReplaceUsesOfWith()
948 Worklist.push_back(cast<Instruction>(U)); in ReplaceUsesOfWith()
950 RemoveFromWorklist(I, Worklist); in ReplaceUsesOfWith()
973 std::vector<Instruction*> Worklist; in RewriteLoopBodyWithConditionConstant() local
991 Worklist.push_back(UI); in RewriteLoopBodyWithConditionConstant()
[all …]
|
| D | BDCE.cpp | 269 SmallVector<Instruction*, 128> Worklist; in runOnFunction() local
287 Worklist.push_back(&I); in runOnFunction()
298 Worklist.push_back(J); in runOnFunction()
308 while (!Worklist.empty()) { in runOnFunction()
309 Instruction *UserI = Worklist.pop_back_val(); in runOnFunction()
354 Worklist.push_back(I); in runOnFunction()
357 Worklist.push_back(I); in runOnFunction()
394 Worklist.push_back(&I); in runOnFunction()
399 for (Instruction *&I : Worklist) { in runOnFunction()
|
| D | LoopUnrollPass.cpp | 466 SmallSetVector<Instruction *, 8> Worklist; in estimateNumberOfOptimizedInstructions() local
481 Worklist.insert(cast<Instruction>(U)); in estimateNumberOfOptimizedInstructions()
487 while (!Worklist.empty()) { in estimateNumberOfOptimizedInstructions()
488 Instruction *I = Worklist.pop_back_val(); in estimateNumberOfOptimizedInstructions()
494 Worklist.insert(cast<Instruction>(U)); in estimateNumberOfOptimizedInstructions()
512 Worklist.insert(OpI); in estimateNumberOfOptimizedInstructions()
528 while (!Worklist.empty()) { in estimateNumberOfOptimizedInstructions()
529 Instruction *I = Worklist.pop_back_val(); in estimateNumberOfOptimizedInstructions()
|
| D | Float2Int.cpp | 182 std::deque<Instruction*> Worklist(Roots.begin(), Roots.end()); in walkBackwards() local
183 while (!Worklist.empty()) { in walkBackwards()
184 Instruction *I = Worklist.back(); in walkBackwards()
185 Worklist.pop_back(); in walkBackwards()
231 Worklist.push_back(OI); in walkBackwards()
|
| /external/llvm/lib/Analysis/ |
| D | CFG.cpp | 129 static bool isPotentiallyReachableInner(SmallVectorImpl<BasicBlock *> &Worklist, in isPotentiallyReachableInner() argument
143 BasicBlock *BB = Worklist.pop_back_val(); in isPotentiallyReachableInner()
163 Outer->getExitBlocks(Worklist); in isPotentiallyReachableInner()
165 Worklist.append(succ_begin(BB), succ_end(BB)); in isPotentiallyReachableInner()
167 } while (!Worklist.empty()); in isPotentiallyReachableInner()
179 SmallVector<BasicBlock*, 32> Worklist; in isPotentiallyReachable() local
180 Worklist.push_back(const_cast<BasicBlock*>(A)); in isPotentiallyReachable()
182 return isPotentiallyReachableInner(Worklist, const_cast<BasicBlock*>(B), in isPotentiallyReachable()
191 SmallVector<BasicBlock*, 32> Worklist; in isPotentiallyReachable() local
218 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 | 155 std::vector<Value *> Worklist; // Stack for DFS. member in __anonb908b5250211::DivergencePropagator
160 Worklist.clear(); in populateWithSourcesOfDivergence()
164 Worklist.push_back(&I); in populateWithSourcesOfDivergence()
170 Worklist.push_back(&Arg); in populateWithSourcesOfDivergence()
195 Worklist.push_back(I); in exploreSyncDependency()
240 Worklist.push_back(UserInst); in findUsersOutsideInfluenceRegion()
268 Worklist.push_back(UserInst); in exploreDataDependency()
274 while (!Worklist.empty()) { in propagate()
275 Value *V = Worklist.back(); in propagate()
276 Worklist.pop_back(); in propagate()
|
| D | CaptureTracking.cpp | 171 SmallVector<const Use *, Threshold> Worklist; in PointerMayBeCaptured() local
183 Worklist.push_back(&U); in PointerMayBeCaptured()
186 while (!Worklist.empty()) { in PointerMayBeCaptured()
187 const Use *U = Worklist.pop_back_val(); in PointerMayBeCaptured()
244 Worklist.push_back(&UU); in PointerMayBeCaptured()
|
| D | CFLAliasAnalysis.cpp | 865 SmallVector<ConstantExpr *, 4> Worklist; in constexprToEdges() local
866 Worklist.push_back(&CExprToCollapse); in constexprToEdges()
869 while (!Worklist.empty()) { in constexprToEdges()
870 auto *CExpr = Worklist.pop_back_val(); in constexprToEdges()
882 Worklist.push_back(Nested); in constexprToEdges()
887 Worklist.push_back(Nested); in constexprToEdges()
1007 SmallVector<GraphT::Node, 16> Worklist; in buildSetsFrom() local
1009 Worklist.clear(); in buildSetsFrom()
1014 Worklist.push_back(InitialNode); in buildSetsFrom()
1015 while (!Worklist.empty()) { in buildSetsFrom()
[all …]
|
| /external/llvm/lib/Transforms/ObjCARC/ |
| D | ProvenanceAnalysis.cpp | 79 SmallVector<const Value *, 8> Worklist; in IsStoredObjCPointer() local
80 Worklist.push_back(P); in IsStoredObjCPointer()
83 P = Worklist.pop_back_val(); in IsStoredObjCPointer()
100 Worklist.push_back(Ur); in IsStoredObjCPointer()
102 } 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 | 195 SmallVector<BasicBlock *, 8> Worklist; in addBlockAndPredsToSet() local
196 Worklist.push_back(InputBB); in addBlockAndPredsToSet()
198 BasicBlock *BB = Worklist.pop_back_val(); in addBlockAndPredsToSet()
204 Worklist.push_back(WBB); in addBlockAndPredsToSet()
206 } while (!Worklist.empty()); in addBlockAndPredsToSet()
480 static bool simplifyOneLoop(Loop *L, SmallVectorImpl<Loop *> &Worklist, in simplifyOneLoop() argument
594 Worklist.push_back(OuterL); in simplifyOneLoop()
727 SmallVector<Loop *, 4> Worklist; in simplifyLoop() local
728 Worklist.push_back(L); in simplifyLoop()
733 for (unsigned Idx = 0; Idx != Worklist.size(); ++Idx) { in simplifyLoop()
[all …]
|
| D | PromoteMemoryToRegister.cpp | 314 std::vector<RenamePassData> &Worklist);
584 SmallVector<DomTreeNode *, 32> Worklist; in run() local
588 Worklist.push_back(Root); in run()
590 while (!Worklist.empty()) { in run()
591 DomTreeNode *Node = Worklist.pop_back_val(); in run()
596 Worklist.push_back(*CI); in run()
875 SmallVector<DomTreeNode *, 32> Worklist; in DetermineInsertionPoint() local
890 Worklist.clear(); in DetermineInsertionPoint()
891 Worklist.push_back(Root); in DetermineInsertionPoint()
894 while (!Worklist.empty()) { in DetermineInsertionPoint()
[all …]
|
| /external/llvm/include/llvm/Support/ |
| D | GenericDomTreeConstruction.h | 57 typename GraphT::ChildIteratorType>, 32> Worklist; in DFSPass() local
58 Worklist.push_back(std::make_pair(V, GraphT::child_begin(V))); in DFSPass()
59 while (!Worklist.empty()) { in DFSPass()
60 typename GraphT::NodeType* BB = Worklist.back().first; in DFSPass()
61 typename GraphT::ChildIteratorType NextSucc = Worklist.back().second; in DFSPass()
85 Worklist.pop_back(); in DFSPass()
90 ++Worklist.back().second; in DFSPass()
99 Worklist.push_back(std::make_pair(Succ, GraphT::child_begin(Succ))); in DFSPass()
|
| /external/llvm/lib/Transforms/InstCombine/ |
| D | InstCombineInternal.h | 152 InstCombineWorklist &Worklist; variable
157 : Worklist(WL), AC(AC) {} in InstCombineIRInserter()
162 Worklist.Add(I); in InsertHelper()
180 InstCombineWorklist &Worklist;
205 InstCombiner(InstCombineWorklist &Worklist, BuilderTy *Builder, in InstCombiner() argument
208 : 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 | 1145 Worklist.Add(Parent.first); in Descale()
1163 Worklist.Add(Ancestor); in Descale()
1798 SmallVector<Instruction*, 4> Worklist; in isAllocSiteRemovable() local
1799 Worklist.push_back(AI); in isAllocSiteRemovable()
1802 Instruction *PI = Worklist.pop_back_val(); in isAllocSiteRemovable()
1813 Worklist.push_back(I); in isAllocSiteRemovable()
1868 } while (!Worklist.empty()); in isAllocSiteRemovable()
2051 Worklist.Add(Cond); in visitBranchInst()
2067 Worklist.Add(Cond); in visitBranchInst()
2129 Worklist.Add(I); in visitSwitchInst()
[all …]
|
| D | InstCombineLoadStoreAlloca.cpp | 507 SmallVector<Value *, 4> Worklist(1, V); in isObjectSizeLessThanOrEq() local
510 Value *P = Worklist.pop_back_val(); in isObjectSizeLessThanOrEq()
517 Worklist.push_back(SI->getTrueValue()); in isObjectSizeLessThanOrEq()
518 Worklist.push_back(SI->getFalseValue()); in isObjectSizeLessThanOrEq()
524 Worklist.push_back(PN->getIncomingValue(i)); in isObjectSizeLessThanOrEq()
531 Worklist.push_back(GA->getAliasee()); in isObjectSizeLessThanOrEq()
564 } while (!Worklist.empty()); in isObjectSizeLessThanOrEq()
696 Worklist.Add(NewGEPI); in visitLoadInst()
902 Worklist.Add(NewGEPI); in visitStoreInst()
973 Worklist.Add(U); // Dropped a use. in visitStoreInst()
|
| /external/llvm/tools/llvm-rtdyld/ |
| D | llvm-rtdyld.cpp | 413 WorklistT Worklist; in remapSections() local
416 Worklist.push_back(std::make_pair(CodeSection.base(), CodeSection.size())); in remapSections()
418 Worklist.push_back(std::make_pair(DataSection.base(), DataSection.size())); in remapSections()
432 for (WorklistT::iterator I = Worklist.begin(), E = Worklist.end(); in remapSections()
440 Worklist.erase(Tmp); in remapSections()
456 while (!Worklist.empty()) { in remapSections()
457 std::pair<void*, uint64_t> CurEntry = Worklist.front(); in remapSections()
458 Worklist.pop_front(); in remapSections()
|
| /external/llvm/lib/Transforms/IPO/ |
| D | MergeFunctions.cpp | 1083 bool doSanityCheck(std::vector<WeakVH> &Worklist);
1133 bool MergeFunctions::doSanityCheck(std::vector<WeakVH> &Worklist) { in doSanityCheck() argument
1141 for (std::vector<WeakVH>::iterator I = Worklist.begin(), E = Worklist.end(); in doSanityCheck()
1214 std::vector<WeakVH> Worklist; in runOnModule() local
1215 Deferred.swap(Worklist); in runOnModule()
1217 DEBUG(doSanityCheck(Worklist)); in runOnModule()
1220 DEBUG(dbgs() << "size of worklist: " << Worklist.size() << '\n'); in runOnModule()
1224 for (std::vector<WeakVH>::iterator I = Worklist.begin(), in runOnModule()
1225 E = Worklist.end(); I != E; ++I) { in runOnModule()
1238 for (std::vector<WeakVH>::iterator I = Worklist.begin(), in runOnModule()
[all …]
|
| /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()
|
| /external/llvm/lib/Target/R600/ |
| D | SIInstrInfo.h | 42 unsigned split64BitImm(SmallVectorImpl<MachineInstr *> &Worklist,
50 void splitScalar64BitUnaryOp(SmallVectorImpl<MachineInstr *> &Worklist,
53 void splitScalar64BitBinaryOp(SmallVectorImpl<MachineInstr *> &Worklist,
56 void splitScalar64BitBCNT(SmallVectorImpl<MachineInstr *> &Worklist,
58 void splitScalar64BitBFE(SmallVectorImpl<MachineInstr *> &Worklist,
|
| /external/llvm/lib/Support/ |
| D | DAGDeltaAlgorithm.cpp | 202 std::vector<change_ty> Worklist(Roots.begin(), Roots.end()); in DAGDeltaAlgorithmImpl() local
203 while (!Worklist.empty()) { in DAGDeltaAlgorithmImpl()
204 change_ty Change = Worklist.back(); in DAGDeltaAlgorithmImpl()
205 Worklist.pop_back(); in DAGDeltaAlgorithmImpl()
212 Worklist.push_back(*it); in DAGDeltaAlgorithmImpl()
|