Home
last modified time | relevance | path

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

12

/external/llvm/lib/Transforms/InstCombine/
DInstCombineWorklist.h26 SmallVector<Instruction*, 256> Worklist; variable
34 bool isEmpty() const { return Worklist.empty(); } in isEmpty()
39 if (WorklistMap.insert(std::make_pair(I, Worklist.size())).second) { in Add()
41 Worklist.push_back(I); in Add()
54 assert(Worklist.empty() && "Worklist must be empty to add initial group"); in AddInitialGroup()
55 Worklist.reserve(NumEntries+16); in AddInitialGroup()
61 Worklist.push_back(I); in AddInitialGroup()
71 Worklist[It->second] = 0; in Remove()
77 Instruction *I = Worklist.back(); in RemoveOne()
78 Worklist.pop_back(); in RemoveOne()
DInstCombine.h60 InstCombineWorklist &Worklist; variable
62 InstCombineIRInserter(InstCombineWorklist &WL) : Worklist(WL) {} in InstCombineIRInserter()
67 Worklist.Add(I); in InsertHelper()
82 InstCombineWorklist Worklist;
246 Worklist.Add(New); in InsertNewInstBefore()
265 Worklist.AddUsersToWorkList(I); // Add all modified instrs to worklist. in ReplaceInstUsesWith()
292 Worklist.Add(Op); in EraseInstFromFunction()
294 Worklist.Remove(&I); in EraseInstFromFunction()
DInstructionCombining.cpp1028 Worklist.Add(Parent.first); in Descale()
1046 Worklist.Add(Ancestor); in Descale()
1380 SmallVector<Instruction*, 4> Worklist; in isAllocSiteRemovable() local
1381 Worklist.push_back(AI); in isAllocSiteRemovable()
1384 Instruction *PI = Worklist.pop_back_val(); in isAllocSiteRemovable()
1396 Worklist.push_back(I); in isAllocSiteRemovable()
1451 } while (!Worklist.empty()); in isAllocSiteRemovable()
1607 Worklist.Add(Cond); in visitBranchInst()
1623 Worklist.Add(Cond); in visitBranchInst()
1647 Worklist.Add(I); in visitSwitchInst()
[all …]
/external/llvm/lib/Transforms/Scalar/
DLoopUnswitch.cpp214 void SimplifyCode(std::vector<Instruction*> &Worklist, Loop *L);
216 std::vector<Instruction*> &Worklist, Loop *l);
920 std::vector<Instruction*> &Worklist) { in RemoveFromWorklist() argument
922 Worklist.erase(std::remove(Worklist.begin(), Worklist.end(), I), in RemoveFromWorklist()
923 Worklist.end()); in RemoveFromWorklist()
929 std::vector<Instruction*> &Worklist, in ReplaceUsesOfWith() argument
936 Worklist.push_back(Use); in ReplaceUsesOfWith()
941 Worklist.push_back(cast<Instruction>(*UI)); in ReplaceUsesOfWith()
943 RemoveFromWorklist(I, Worklist); in ReplaceUsesOfWith()
953 std::vector<Instruction*> &Worklist, in RemoveBlockIfDead() argument
[all …]
DSimplifyCFGPass.cpp119 SmallVector<BasicBlock*, 128> Worklist; in markAliveBlocks() local
120 Worklist.push_back(BB); in markAliveBlocks()
124 BB = Worklist.pop_back_val(); in markAliveBlocks()
185 Worklist.push_back(*SI); in markAliveBlocks()
186 } while (!Worklist.empty()); in markAliveBlocks()
DReassociate.cpp437 SmallVector<std::pair<BinaryOperator*, APInt>, 8> Worklist; // (Op, Weight) in LinearizeExprTree() local
438 Worklist.push_back(std::make_pair(I, APInt(Bitwidth, 1))); in LinearizeExprTree()
463 while (!Worklist.empty()) { in LinearizeExprTree()
464 std::pair<BinaryOperator*, APInt> P = Worklist.pop_back_val(); in LinearizeExprTree()
478 Worklist.push_back(std::make_pair(BO, Weight)); in LinearizeExprTree()
516 Worklist.push_back(std::make_pair(BO, It->second)); in LinearizeExprTree()
548 Worklist.push_back(std::make_pair(BO, Weight)); in LinearizeExprTree()
DLoopStrengthReduce.cpp2222 SmallVector<const SCEV *, 4> Worklist; in CollectInterestingTypesAndFactors() local
2230 Worklist.push_back(Expr); in CollectInterestingTypesAndFactors()
2232 const SCEV *S = Worklist.pop_back_val(); in CollectInterestingTypesAndFactors()
2236 Worklist.push_back(AR->getStart()); in CollectInterestingTypesAndFactors()
2238 Worklist.append(Add->op_begin(), Add->op_end()); in CollectInterestingTypesAndFactors()
2240 } while (!Worklist.empty()); in CollectInterestingTypesAndFactors()
2950 SmallVector<const SCEV *, 8> Worklist(RegUses.begin(), RegUses.end()); in CollectLoopInvariantFixupsAndFormulae() local
2953 while (!Worklist.empty()) { in CollectLoopInvariantFixupsAndFormulae()
2954 const SCEV *S = Worklist.pop_back_val(); in CollectLoopInvariantFixupsAndFormulae()
2957 Worklist.append(N->op_begin(), N->op_end()); in CollectLoopInvariantFixupsAndFormulae()
[all …]
/external/llvm/lib/Analysis/
DCaptureTracking.cpp84 SmallVector<Use*, Threshold> Worklist; in PointerMayBeCaptured() local
98 Worklist.push_back(U); in PointerMayBeCaptured()
101 while (!Worklist.empty()) { in PointerMayBeCaptured()
102 Use *U = Worklist.pop_back_val(); in PointerMayBeCaptured()
154 Worklist.push_back(U); in PointerMayBeCaptured()
DPtrUseVisitor.cpp26 Worklist.push_back(llvm_move(NewU)); in enqueueUsers()
DBasicAliasAnalysis.cpp550 SmallVector<const Value *, 16> Worklist; in pointsToConstantMemory() local
551 Worklist.push_back(Loc.Ptr); in pointsToConstantMemory()
553 const Value *V = GetUnderlyingObject(Worklist.pop_back_val(), TD); in pointsToConstantMemory()
577 Worklist.push_back(SI->getTrueValue()); in pointsToConstantMemory()
578 Worklist.push_back(SI->getFalseValue()); in pointsToConstantMemory()
591 Worklist.push_back(PN->getIncomingValue(i)); in pointsToConstantMemory()
599 } while (!Worklist.empty() && --MaxLookup); in pointsToConstantMemory()
602 return Worklist.empty(); in pointsToConstantMemory()
DScalarEvolution.cpp2937 SmallVectorImpl<Instruction *> &Worklist) { in PushDefUseChildren() argument
2941 Worklist.push_back(cast<Instruction>(*UI)); in PushDefUseChildren()
2950 SmallVector<Instruction *, 16> Worklist; in ForgetSymbolicName() local
2951 PushDefUseChildren(PN, Worklist); in ForgetSymbolicName()
2955 while (!Worklist.empty()) { in ForgetSymbolicName()
2956 Instruction *I = Worklist.pop_back_val(); in ForgetSymbolicName()
2984 PushDefUseChildren(I, Worklist); in ForgetSymbolicName()
4031 PushLoopPHIs(const Loop *L, SmallVectorImpl<Instruction *> &Worklist) { in PushLoopPHIs() argument
4037 Worklist.push_back(PN); in PushLoopPHIs()
4075 SmallVector<Instruction *, 16> Worklist; in getBackedgeTakenInfo() local
[all …]
DMemoryDependenceAnalysis.cpp1018 SmallVector<BasicBlock*, 32> Worklist; in getNonLocalPointerDepFromBB() local
1019 Worklist.push_back(StartBB); in getNonLocalPointerDepFromBB()
1032 while (!Worklist.empty()) { in getNonLocalPointerDepFromBB()
1033 BasicBlock *BB = Worklist.pop_back_val(); in getNonLocalPointerDepFromBB()
1082 Worklist.append(NewBlocks.begin(), NewBlocks.end()); in getNonLocalPointerDepFromBB()
DValueTracking.cpp1888 SmallVector<Value *, 4> Worklist; in GetUnderlyingObjects() local
1889 Worklist.push_back(V); in GetUnderlyingObjects()
1891 Value *P = Worklist.pop_back_val(); in GetUnderlyingObjects()
1898 Worklist.push_back(SI->getTrueValue()); in GetUnderlyingObjects()
1899 Worklist.push_back(SI->getFalseValue()); in GetUnderlyingObjects()
1905 Worklist.push_back(PN->getIncomingValue(i)); in GetUnderlyingObjects()
1910 } while (!Worklist.empty()); in GetUnderlyingObjects()
/external/llvm/lib/Transforms/ObjCARC/
DProvenanceAnalysis.cpp77 SmallVector<const Value *, 8> Worklist; in IsStoredObjCPointer() local
78 Worklist.push_back(P); in IsStoredObjCPointer()
81 P = Worklist.pop_back_val(); in IsStoredObjCPointer()
99 Worklist.push_back(Ur); in IsStoredObjCPointer()
101 } while (!Worklist.empty()); in IsStoredObjCPointer()
DDependencyAnalysis.cpp212 SmallVector<std::pair<BasicBlock *, BasicBlock::iterator>, 4> Worklist; in FindDependencies() local
213 Worklist.push_back(std::make_pair(StartBB, StartPos)); in FindDependencies()
216 Worklist.pop_back_val(); in FindDependencies()
231 Worklist.push_back(std::make_pair(PredBB, PredBB->end())); in FindDependencies()
242 } while (!Worklist.empty()); in FindDependencies()
DObjCARCOpts.cpp179 SmallVector<const Value *, 4> Worklist; in DoesRetainableObjPtrEscape() local
180 Worklist.push_back(Ptr); in DoesRetainableObjPtrEscape()
184 Worklist.push_back(*I); in DoesRetainableObjPtrEscape()
191 const Value *V = Worklist.pop_back_val(); in DoesRetainableObjPtrEscape()
224 Worklist.push_back(UUser); in DoesRetainableObjPtrEscape()
247 } while (!Worklist.empty()); in DoesRetainableObjPtrEscape()
1266 SmallVector<std::pair<Instruction *, const Value *>, 4> Worklist; in OptimizeIndividualCalls() local
1267 Worklist.push_back(std::make_pair(Inst, Arg)); in OptimizeIndividualCalls()
1269 std::pair<Instruction *, const Value *> Pair = Worklist.pop_back_val(); in OptimizeIndividualCalls()
1350 Worklist.push_back(std::make_pair(Clone, Incoming)); in OptimizeIndividualCalls()
[all …]
/external/llvm/include/llvm/Analysis/
DDominatorInternals.h57 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()
DPtrUseVisitor.h124 SmallVector<UseToVisit, 8> Worklist; variable
217 while (!Worklist.empty()) { in visitPtr()
218 UseToVisit ToVisit = Worklist.pop_back_val(); in visitPtr()
DScalarEvolutionExpressions.h494 SmallVector<const SCEV *, 8> Worklist; variable
499 Worklist.push_back(S); in push()
506 while (!Worklist.empty() && !Visitor.isDone()) { in visitAll()
507 const SCEV *S = Worklist.pop_back_val(); in visitAll()
/external/llvm/lib/Transforms/Utils/
DPromoteMemoryToRegister.cpp294 std::vector<RenamePassData> &Worklist);
496 SmallVector<DomTreeNode*, 32> Worklist; in run() local
500 Worklist.push_back(Root); in run()
502 while (!Worklist.empty()) { in run()
503 DomTreeNode *Node = Worklist.pop_back_val(); in run()
508 Worklist.push_back(*CI); in run()
779 SmallVector<DomTreeNode*, 32> Worklist; in DetermineInsertionPoint() local
791 Worklist.clear(); in DetermineInsertionPoint()
792 Worklist.push_back(Root); in DetermineInsertionPoint()
794 while (!Worklist.empty()) { in DetermineInsertionPoint()
[all …]
DLocal.cpp970 SmallVector<BasicBlock*, 128> Worklist; in removeUnreachableBlocks() local
971 Worklist.push_back(&F.getEntryBlock()); in removeUnreachableBlocks()
974 BasicBlock *BB = Worklist.pop_back_val(); in removeUnreachableBlocks()
977 Worklist.push_back(*SI); in removeUnreachableBlocks()
978 } while (!Worklist.empty()); in removeUnreachableBlocks()
/external/llvm/lib/Transforms/IPO/
DMergeFunctions.cpp619 std::vector<WeakVH> Worklist; in runOnModule() local
620 Deferred.swap(Worklist); in runOnModule()
623 DEBUG(dbgs() << "size of worklist: " << Worklist.size() << '\n'); in runOnModule()
627 for (std::vector<WeakVH>::iterator I = Worklist.begin(), in runOnModule()
628 E = Worklist.end(); I != E; ++I) { in runOnModule()
642 for (std::vector<WeakVH>::iterator I = Worklist.begin(), in runOnModule()
643 E = Worklist.end(); I != E; ++I) { in runOnModule()
850 std::vector<Value *> Worklist; in removeUsers() local
851 Worklist.push_back(V); in removeUsers()
852 while (!Worklist.empty()) { in removeUsers()
[all …]
/external/llvm/lib/Support/
DDAGDeltaAlgorithm.cpp208 std::vector<change_ty> Worklist(Roots.begin(), Roots.end()); in DAGDeltaAlgorithmImpl() local
209 while (!Worklist.empty()) { in DAGDeltaAlgorithmImpl()
210 change_ty Change = Worklist.back(); in DAGDeltaAlgorithmImpl()
211 Worklist.pop_back(); in DAGDeltaAlgorithmImpl()
218 Worklist.push_back(*it); in DAGDeltaAlgorithmImpl()
/external/llvm/lib/CodeGen/SelectionDAG/
DLegalizeTypes.cpp199 Worklist.push_back(I); in run()
206 while (!Worklist.empty()) { in run()
212 SDNode *N = Worklist.back(); in run()
213 Worklist.pop_back(); in run()
363 Worklist.push_back(User); in run()
381 Worklist.push_back(User); in run()
514 Worklist.push_back(N); in AnalyzeNewNode()
DScheduleDAGSDNodes.cpp325 SmallVector<SDNode*, 64> Worklist; in BuildSchedUnits() local
327 Worklist.push_back(DAG->getRoot().getNode()); in BuildSchedUnits()
331 while (!Worklist.empty()) { in BuildSchedUnits()
332 SDNode *NI = Worklist.pop_back_val(); in BuildSchedUnits()
337 Worklist.push_back(NI->getOperand(i).getNode()); in BuildSchedUnits()

12