| /external/llvm/lib/Transforms/InstCombine/ |
| D | InstCombineWorklist.h | 27 SmallVector<Instruction*, 256> Worklist; variable
35 bool isEmpty() const { return Worklist.empty(); } in isEmpty()
40 if (WorklistMap.insert(std::make_pair(I, Worklist.size())).second) { in Add()
42 Worklist.push_back(I); in Add()
55 assert(Worklist.empty() && "Worklist must be empty to add initial group"); in AddInitialGroup()
56 Worklist.reserve(NumEntries+16); in AddInitialGroup()
62 Worklist.push_back(I); in AddInitialGroup()
72 Worklist[It->second] = nullptr; in Remove()
78 Instruction *I = Worklist.pop_back_val(); in RemoveOne()
|
| D | InstCombine.h | 73 InstCombineWorklist &Worklist; variable
76 InstCombineIRInserter(InstCombineWorklist &WL) : Worklist(WL) {} in InstCombineIRInserter()
81 Worklist.Add(I); in InsertHelper()
97 InstCombineWorklist Worklist;
264 Worklist.Add(New); in InsertNewInstBefore()
283 Worklist.AddUsersToWorkList(I); // Add all modified instrs to worklist. in ReplaceInstUsesWith()
310 Worklist.Add(Op); in EraseInstFromFunction()
312 Worklist.Remove(&I); in EraseInstFromFunction()
|
| D | InstructionCombining.cpp | 1143 Worklist.Add(Parent.first); in Descale()
1161 Worklist.Add(Ancestor); in Descale()
1729 SmallVector<Instruction*, 4> Worklist; in isAllocSiteRemovable() local
1730 Worklist.push_back(AI); in isAllocSiteRemovable()
1733 Instruction *PI = Worklist.pop_back_val(); in isAllocSiteRemovable()
1744 Worklist.push_back(I); in isAllocSiteRemovable()
1799 } while (!Worklist.empty()); in isAllocSiteRemovable()
1955 Worklist.Add(Cond); in visitBranchInst()
1971 Worklist.Add(Cond); in visitBranchInst()
1995 Worklist.Add(I); in visitSwitchInst()
[all …]
|
| /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 | CaptureTracking.cpp | 84 SmallVector<const Use *, Threshold> Worklist; in PointerMayBeCaptured() local
96 Worklist.push_back(&U); in PointerMayBeCaptured()
99 while (!Worklist.empty()) { in PointerMayBeCaptured()
100 const Use *U = Worklist.pop_back_val(); in PointerMayBeCaptured()
157 Worklist.push_back(&UU); in PointerMayBeCaptured()
|
| D | PtrUseVisitor.cpp | 25 Worklist.push_back(std::move(NewU)); in enqueueUsers()
|
| D | BasicAliasAnalysis.cpp | 605 SmallVector<const Value *, 16> Worklist; in pointsToConstantMemory() local
606 Worklist.push_back(Loc.Ptr); in pointsToConstantMemory()
608 const Value *V = GetUnderlyingObject(Worklist.pop_back_val(), DL); in pointsToConstantMemory()
632 Worklist.push_back(SI->getTrueValue()); in pointsToConstantMemory()
633 Worklist.push_back(SI->getFalseValue()); in pointsToConstantMemory()
646 Worklist.push_back(PN->getIncomingValue(i)); in pointsToConstantMemory()
654 } while (!Worklist.empty() && --MaxLookup); in pointsToConstantMemory()
657 return Worklist.empty(); in pointsToConstantMemory()
|
| /external/llvm/lib/MC/MCAnalysis/ |
| D | MCObjectDisassembler.cpp | 267 SmallSetVector<BBInfo*, 16> Worklist; in buildCFG() local
268 Worklist.insert(&BBI); in buildCFG()
269 for (size_t wi = 0; wi < Worklist.size(); ++wi) { in buildCFG()
270 BBInfo *BBI = Worklist[wi]; in buildCFG()
277 Worklist.insert(*SI); in buildCFG()
280 Worklist.insert(*PI); in buildCFG()
284 for (size_t wi = 0; wi < Worklist.size(); ++wi) { in buildCFG()
285 BBInfo *BBI = Worklist[wi]; in buildCFG()
323 AddrWorklistTy Worklist; in getBBAt() local
325 Worklist.insert(BBBeginAddr); in getBBAt()
[all …]
|
| /external/llvm/lib/Transforms/Scalar/ |
| D | LoopUnswitch.cpp | 206 void SimplifyCode(std::vector<Instruction*> &Worklist, Loop *L);
914 std::vector<Instruction*> &Worklist) { in RemoveFromWorklist() argument
916 Worklist.erase(std::remove(Worklist.begin(), Worklist.end(), I), in RemoveFromWorklist()
917 Worklist.end()); in RemoveFromWorklist()
923 std::vector<Instruction*> &Worklist, in ReplaceUsesOfWith() argument
930 Worklist.push_back(Use); in ReplaceUsesOfWith()
934 Worklist.push_back(cast<Instruction>(U)); in ReplaceUsesOfWith()
936 RemoveFromWorklist(I, Worklist); in ReplaceUsesOfWith()
959 std::vector<Instruction*> Worklist; in RewriteLoopBodyWithConditionConstant() local
977 Worklist.push_back(UI); in RewriteLoopBodyWithConditionConstant()
[all …]
|
| D | TailRecursionElimination.cpp | 173 SmallVector<Use *, 32> Worklist; in walk() local
180 Worklist.push_back(&U); in walk()
186 while (!Worklist.empty()) { in walk()
187 Use *U = Worklist.pop_back_val(); in walk()
|
| D | SROA.cpp | 935 SetVector<AllocaInst *, SmallVector<AllocaInst *, 16> > Worklist; member in __anon20cc1aae0511::SROA
2566 Pass.Worklist.insert(AI); in visitMemTransferInst()
3241 Worklist.insert(NewAI); in rewritePartition()
3248 Worklist.insert(NewAI); in rewritePartition()
3517 SmallVectorImpl<Instruction *> &Worklist, in enqueueUsersInWorklist() argument
3521 Worklist.push_back(cast<Instruction>(U)); in enqueueUsersInWorklist()
3551 SmallVector<Instruction *, 8> Worklist; in promoteAllocas() local
3558 Worklist.clear(); in promoteAllocas()
3561 enqueueUsersInWorklist(*AI, Worklist, Visited); in promoteAllocas()
3563 while (!Worklist.empty()) { in promoteAllocas()
[all …]
|
| /external/llvm/lib/Transforms/ObjCARC/ |
| D | ProvenanceAnalysis.cpp | 77 SmallVector<const Value *, 8> Worklist; in IsStoredObjCPointer() local
78 Worklist.push_back(P); in IsStoredObjCPointer()
81 P = Worklist.pop_back_val(); in IsStoredObjCPointer()
98 Worklist.push_back(Ur); in IsStoredObjCPointer()
100 } while (!Worklist.empty()); in IsStoredObjCPointer()
|
| D | DependencyAnalysis.cpp | 214 SmallVector<std::pair<BasicBlock *, BasicBlock::iterator>, 4> Worklist; in FindDependencies() local
215 Worklist.push_back(std::make_pair(StartBB, StartPos)); in FindDependencies()
218 Worklist.pop_back_val(); in FindDependencies()
233 Worklist.push_back(std::make_pair(PredBB, PredBB->end())); in FindDependencies()
244 } while (!Worklist.empty()); in FindDependencies()
|
| /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/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()
475 static bool simplifyOneLoop(Loop *L, SmallVectorImpl<Loop *> &Worklist, in simplifyOneLoop() argument
589 Worklist.push_back(OuterL); in simplifyOneLoop()
719 SmallVector<Loop *, 4> Worklist; in simplifyLoop() local
720 Worklist.push_back(L); in simplifyLoop()
725 for (unsigned Idx = 0; Idx != Worklist.size(); ++Idx) { in simplifyLoop()
[all …]
|
| D | PromoteMemoryToRegister.cpp | 309 std::vector<RenamePassData> &Worklist);
577 SmallVector<DomTreeNode *, 32> Worklist; in run() local
581 Worklist.push_back(Root); in run()
583 while (!Worklist.empty()) { in run()
584 DomTreeNode *Node = Worklist.pop_back_val(); in run()
589 Worklist.push_back(*CI); in run()
869 SmallVector<DomTreeNode *, 32> Worklist; in DetermineInsertionPoint() local
881 Worklist.clear(); in DetermineInsertionPoint()
882 Worklist.push_back(Root); in DetermineInsertionPoint()
884 while (!Worklist.empty()) { in DetermineInsertionPoint()
[all …]
|
| /external/llvm/lib/Target/R600/ |
| D | SIInstrInfo.h | 41 unsigned split64BitImm(SmallVectorImpl<MachineInstr *> &Worklist,
47 void splitScalar64BitUnaryOp(SmallVectorImpl<MachineInstr *> &Worklist,
50 void splitScalar64BitBinaryOp(SmallVectorImpl<MachineInstr *> &Worklist,
53 void splitScalar64BitBCNT(SmallVectorImpl<MachineInstr *> &Worklist,
|
| D | SIInstrInfo.cpp | 826 unsigned SIInstrInfo::split64BitImm(SmallVectorImpl<MachineInstr *> &Worklist, in split64BitImm() argument
850 Worklist.push_back(Lo); in split64BitImm()
851 Worklist.push_back(Hi); in split64BitImm()
1174 SmallVector<MachineInstr *, 128> Worklist; in moveToVALU() local
1175 Worklist.push_back(&TopInst); in moveToVALU()
1177 while (!Worklist.empty()) { in moveToVALU()
1178 MachineInstr *Inst = Worklist.pop_back_val(); in moveToVALU()
1201 Worklist.push_back(Copy); in moveToVALU()
1206 unsigned Dst = split64BitImm(Worklist, in moveToVALU()
1217 splitScalar64BitBinaryOp(Worklist, Inst, AMDGPU::S_AND_B32); in moveToVALU()
[all …]
|
| /external/llvm/lib/Transforms/IPO/ |
| D | MergeFunctions.cpp | 1079 bool doSanityCheck(std::vector<WeakVH> &Worklist);
1132 bool MergeFunctions::doSanityCheck(std::vector<WeakVH> &Worklist) { in doSanityCheck() argument
1140 for (std::vector<WeakVH>::iterator I = Worklist.begin(), E = Worklist.end(); in doSanityCheck()
1215 std::vector<WeakVH> Worklist; in runOnModule() local
1216 Deferred.swap(Worklist); in runOnModule()
1218 DEBUG(doSanityCheck(Worklist)); in runOnModule()
1221 DEBUG(dbgs() << "size of worklist: " << Worklist.size() << '\n'); in runOnModule()
1225 for (std::vector<WeakVH>::iterator I = Worklist.begin(), in runOnModule()
1226 E = Worklist.end(); I != E; ++I) { in runOnModule()
1239 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()
|
| D | ScalarEvolutionExpressions.h | 576 SmallVector<const SCEV *, 8> Worklist; variable
581 Worklist.push_back(S); in push()
588 while (!Worklist.empty() && !Visitor.isDone()) { in visitAll()
589 const SCEV *S = Worklist.pop_back_val(); in visitAll()
|
| /external/llvm/lib/Support/ |
| D | DAGDeltaAlgorithm.cpp | 210 std::vector<change_ty> Worklist(Roots.begin(), Roots.end()); in DAGDeltaAlgorithmImpl() local
211 while (!Worklist.empty()) { in DAGDeltaAlgorithmImpl()
212 change_ty Change = Worklist.back(); in DAGDeltaAlgorithmImpl()
213 Worklist.pop_back(); in DAGDeltaAlgorithmImpl()
220 Worklist.push_back(*it); in DAGDeltaAlgorithmImpl()
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| D | LegalizeTypes.cpp | 201 Worklist.push_back(I); in run()
208 while (!Worklist.empty()) { in run()
214 SDNode *N = Worklist.back(); in run()
215 Worklist.pop_back(); in run()
365 Worklist.push_back(User); in run()
383 Worklist.push_back(User); in run()
516 Worklist.push_back(N); in AnalyzeNewNode()
|
| D | ScheduleDAGSDNodes.cpp | 331 SmallVector<SDNode*, 64> Worklist; in BuildSchedUnits() local
333 Worklist.push_back(DAG->getRoot().getNode()); in BuildSchedUnits()
337 while (!Worklist.empty()) { in BuildSchedUnits()
338 SDNode *NI = Worklist.pop_back_val(); in BuildSchedUnits()
343 Worklist.push_back(NI->getOperand(i).getNode()); in BuildSchedUnits()
|