Home
last modified time | relevance | path

Searched refs:Worklist (Results 1 – 25 of 33) 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()
60 WorklistMap.insert(std::make_pair(I, Worklist.size())); in AddInitialGroup()
61 Worklist.push_back(I); in AddInitialGroup()
71 Worklist[It->second] = 0; in Remove()
77 Instruction *I = Worklist.back(); in RemoveOne()
[all …]
DInstCombine.h57 InstCombineWorklist &Worklist; variable
59 InstCombineIRInserter(InstCombineWorklist &WL) : Worklist(WL) {} in InstCombineIRInserter()
64 Worklist.Add(I); in InsertHelper()
76 InstCombineWorklist Worklist;
233 Worklist.Add(New); in InsertNewInstBefore()
252 Worklist.AddUsersToWorkList(I); // Add all modified instrs to worklist. in ReplaceInstUsesWith()
279 Worklist.Add(Op); in EraseInstFromFunction()
281 Worklist.Remove(&I); in EraseInstFromFunction()
DInstructionCombining.cpp1141 Worklist.Add(Cond); in visitBranchInst()
1158 Worklist.Add(Cond); in visitBranchInst()
1176 Worklist.Add(I); in visitSwitchInst()
1392 SmallVector<BasicBlock*, 256> Worklist; in AddReachableCodeToWorklist() local
1393 Worklist.push_back(BB); in AddReachableCodeToWorklist()
1399 BB = Worklist.pop_back_val(); in AddReachableCodeToWorklist()
1456 Worklist.push_back(ReachableBB); in AddReachableCodeToWorklist()
1465 Worklist.push_back(ReachableBB); in AddReachableCodeToWorklist()
1470 Worklist.push_back(SI->getSuccessor(0)); in AddReachableCodeToWorklist()
1476 Worklist.push_back(TI->getSuccessor(i)); in AddReachableCodeToWorklist()
[all …]
DInstCombineMulDivRem.cpp343 Worklist.Add(BBI); in SimplifyDivRemOfSelect()
347 Worklist.Add(BBI); in SimplifyDivRemOfSelect()
672 Worklist.AddValue(I.getOperand(1)); in visitSRem()
710 Worklist.AddValue(I.getOperand(1)); in visitSRem()
DInstCombineCompares.cpp927 Worklist.Add(Shr); in FoldICmpShrCst()
1030 Worklist.Add(LHSI); in visitICmpInstWithInstAndIntCst()
1173 Worklist.Add(Shift); // Shift is dead. in visitICmpInstWithInstAndIntCst()
1483 Worklist.Add(II); in visitICmpInstWithInstAndIntCst()
1491 Worklist.Add(II); in visitICmpInstWithInstAndIntCst()
1500 Worklist.Add(II); in visitICmpInstWithInstAndIntCst()
DInstCombineLoadStoreAlloca.cpp456 Worklist.Add(U); // Dropped a use. in visitStoreInst()
DInstCombineVectorOps.cpp207 Worklist.AddValue(EI.getOperand(0)); in visitExtractElementInst()
DInstCombineShifts.cpp197 IC.Worklist.Add(I); in GetShiftedValue()
/external/llvm/lib/Transforms/Scalar/
DLoopUnswitch.cpp154 void SimplifyCode(std::vector<Instruction*> &Worklist, Loop *L);
156 std::vector<Instruction*> &Worklist, Loop *l);
698 std::vector<Instruction*> &Worklist) { in RemoveFromWorklist() argument
699 std::vector<Instruction*>::iterator WI = std::find(Worklist.begin(), in RemoveFromWorklist()
700 Worklist.end(), I); in RemoveFromWorklist()
701 while (WI != Worklist.end()) { in RemoveFromWorklist()
702 unsigned Offset = WI-Worklist.begin(); in RemoveFromWorklist()
703 Worklist.erase(WI); in RemoveFromWorklist()
704 WI = std::find(Worklist.begin()+Offset, Worklist.end(), I); in RemoveFromWorklist()
711 std::vector<Instruction*> &Worklist, in ReplaceUsesOfWith() argument
[all …]
DSimplifyCFGPass.cpp112 SmallVector<BasicBlock*, 128> Worklist; in MarkAliveBlocks() local
113 Worklist.push_back(BB); in MarkAliveBlocks()
116 BB = Worklist.pop_back_val(); in MarkAliveBlocks()
168 Worklist.push_back(*SI); in MarkAliveBlocks()
169 } while (!Worklist.empty()); in MarkAliveBlocks()
DObjCARC.cpp983 SmallVector<const Value *, 8> Worklist; in isStoredObjCPointer() local
984 Worklist.push_back(P); in isStoredObjCPointer()
987 P = Worklist.pop_back_val(); in isStoredObjCPointer()
1005 Worklist.push_back(Ur); in isStoredObjCPointer()
1007 } while (!Worklist.empty()); in isStoredObjCPointer()
1778 SmallVector<std::pair<BasicBlock *, BasicBlock::iterator>, 4> Worklist; in FindDependencies() local
1779 Worklist.push_back(std::make_pair(StartBB, StartPos)); in FindDependencies()
1782 Worklist.pop_back_val(); in FindDependencies()
1797 Worklist.push_back(std::make_pair(PredBB, PredBB->end())); in FindDependencies()
1808 } while (!Worklist.empty()); in FindDependencies()
[all …]
DLoopStrengthReduce.cpp1980 SmallVector<const SCEV *, 4> Worklist; in CollectInterestingTypesAndFactors() local
1988 Worklist.push_back(Expr); in CollectInterestingTypesAndFactors()
1990 const SCEV *S = Worklist.pop_back_val(); in CollectInterestingTypesAndFactors()
1993 Worklist.push_back(AR->getStart()); in CollectInterestingTypesAndFactors()
1995 Worklist.append(Add->op_begin(), Add->op_end()); in CollectInterestingTypesAndFactors()
1997 } while (!Worklist.empty()); in CollectInterestingTypesAndFactors()
2163 SmallVector<const SCEV *, 8> Worklist(RegUses.begin(), RegUses.end()); in CollectLoopInvariantFixupsAndFormulae() local
2166 while (!Worklist.empty()) { in CollectLoopInvariantFixupsAndFormulae()
2167 const SCEV *S = Worklist.pop_back_val(); in CollectLoopInvariantFixupsAndFormulae()
2170 Worklist.append(N->op_begin(), N->op_end()); in CollectLoopInvariantFixupsAndFormulae()
[all …]
/external/llvm/lib/Analysis/
DCaptureTracking.cpp49 SmallVector<Use*, Threshold> Worklist; in PointerMayBeCaptured() local
62 Worklist.push_back(U); in PointerMayBeCaptured()
65 while (!Worklist.empty()) { in PointerMayBeCaptured()
66 Use *U = Worklist.pop_back_val(); in PointerMayBeCaptured()
125 Worklist.push_back(U); in PointerMayBeCaptured()
DBasicAliasAnalysis.cpp568 SmallVector<const Value *, 16> Worklist; in pointsToConstantMemory() local
569 Worklist.push_back(Loc.Ptr); in pointsToConstantMemory()
571 const Value *V = GetUnderlyingObject(Worklist.pop_back_val(), TD); in pointsToConstantMemory()
595 Worklist.push_back(SI->getTrueValue()); in pointsToConstantMemory()
596 Worklist.push_back(SI->getFalseValue()); in pointsToConstantMemory()
609 Worklist.push_back(PN->getIncomingValue(i)); in pointsToConstantMemory()
617 } while (!Worklist.empty() && --MaxLookup); in pointsToConstantMemory()
620 return Worklist.empty(); in pointsToConstantMemory()
DScalarEvolution.cpp2826 SmallVectorImpl<Instruction *> &Worklist) { in PushDefUseChildren() argument
2830 Worklist.push_back(cast<Instruction>(*UI)); in PushDefUseChildren()
2839 SmallVector<Instruction *, 16> Worklist; in ForgetSymbolicName() local
2840 PushDefUseChildren(PN, Worklist); in ForgetSymbolicName()
2844 while (!Worklist.empty()) { in ForgetSymbolicName()
2845 Instruction *I = Worklist.pop_back_val(); in ForgetSymbolicName()
2873 PushDefUseChildren(I, Worklist); in ForgetSymbolicName()
3841 PushLoopPHIs(const Loop *L, SmallVectorImpl<Instruction *> &Worklist) { in PushLoopPHIs() argument
3847 Worklist.push_back(PN); in PushLoopPHIs()
3887 SmallVector<Instruction *, 16> Worklist; in getBackedgeTakenInfo() local
[all …]
DMemoryDependenceAnalysis.cpp964 SmallVector<BasicBlock*, 32> Worklist; in getNonLocalPointerDepFromBB() local
965 Worklist.push_back(StartBB); in getNonLocalPointerDepFromBB()
978 while (!Worklist.empty()) { in getNonLocalPointerDepFromBB()
979 BasicBlock *BB = Worklist.pop_back_val(); in getNonLocalPointerDepFromBB()
1028 Worklist.append(NewBlocks.begin(), NewBlocks.end()); in getNonLocalPointerDepFromBB()
/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()
/external/llvm/lib/Transforms/IPO/
DMergeFunctions.cpp617 std::vector<WeakVH> Worklist; in runOnModule() local
618 Deferred.swap(Worklist); in runOnModule()
621 DEBUG(dbgs() << "size of worklist: " << Worklist.size() << '\n'); in runOnModule()
625 for (std::vector<WeakVH>::iterator I = Worklist.begin(), in runOnModule()
626 E = Worklist.end(); I != E; ++I) { in runOnModule()
640 for (std::vector<WeakVH>::iterator I = Worklist.begin(), in runOnModule()
641 E = Worklist.end(); I != E; ++I) { in runOnModule()
848 std::vector<Value *> Worklist; in removeUsers() local
849 Worklist.push_back(V); in removeUsers()
850 while (!Worklist.empty()) { in removeUsers()
[all …]
/external/llvm/lib/Transforms/Utils/
DPromoteMemoryToRegister.cpp284 std::vector<RenamePassData> &Worklist);
485 SmallVector<DomTreeNode*, 32> Worklist; in run() local
489 Worklist.push_back(Root); in run()
491 while (!Worklist.empty()) { in run()
492 DomTreeNode *Node = Worklist.pop_back_val(); in run()
497 Worklist.push_back(*CI); in run()
764 SmallVector<DomTreeNode*, 32> Worklist; in DetermineInsertionPoint() local
776 Worklist.clear(); in DetermineInsertionPoint()
777 Worklist.push_back(Root); in DetermineInsertionPoint()
779 while (!Worklist.empty()) { in DetermineInsertionPoint()
[all …]
DSimplifyCFG.cpp1564 SmallVector<std::pair<Value*, unsigned>, 4> Worklist; in FoldBranchToCommonDest() local
1565 Worklist.push_back(std::make_pair(PBI->getOperand(0), 0)); in FoldBranchToCommonDest()
1570 while (!Worklist.empty()) { in FoldBranchToCommonDest()
1571 std::pair<Value*, unsigned> Pair = Worklist.back(); in FoldBranchToCommonDest()
1572 Worklist.pop_back(); in FoldBranchToCommonDest()
1581 Worklist.push_back(std::make_pair(OI->get(), Pair.second+1)); in FoldBranchToCommonDest()
/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()
367 Worklist.push_back(User); in run()
385 Worklist.push_back(User); in run()
518 Worklist.push_back(N); in AnalyzeNewNode()
DScheduleDAGSDNodes.cpp285 SmallVector<SDNode*, 64> Worklist; in BuildSchedUnits() local
287 Worklist.push_back(DAG->getRoot().getNode()); in BuildSchedUnits()
291 while (!Worklist.empty()) { in BuildSchedUnits()
292 SDNode *NI = Worklist.pop_back_val(); in BuildSchedUnits()
297 Worklist.push_back(NI->getOperand(i).getNode()); in BuildSchedUnits()
DSelectionDAGISel.cpp419 SmallVector<SDNode*, 128> Worklist; in ComputeLiveOutVRegInfo() local
421 Worklist.push_back(CurDAG->getRoot().getNode()); in ComputeLiveOutVRegInfo()
428 SDNode *N = Worklist.pop_back_val(); in ComputeLiveOutVRegInfo()
437 Worklist.push_back(N->getOperand(i).getNode()); in ComputeLiveOutVRegInfo()
457 } while (!Worklist.empty()); in ComputeLiveOutVRegInfo()
/external/llvm/lib/CodeGen/
DMachineLICM.cpp308 SmallVector<MachineLoop *, 8> Worklist(MLI->begin(), MLI->end()); in runOnMachineFunction() local
309 while (!Worklist.empty()) { in runOnMachineFunction()
310 CurLoop = Worklist.pop_back_val(); in runOnMachineFunction()
316 Worklist.append(CurLoop->begin(), CurLoop->end()); in runOnMachineFunction()

12