Searched refs:Worklist (Results 1 - 25 of 128) sorted by relevance

123456

/external/llvm/include/llvm/Transforms/InstCombine/
H A DInstCombineWorklist.h1 //===- InstCombineWorklist.h - Worklist for InstCombine pass ----*- C++ -*-===//
28 SmallVector<Instruction*, 256> Worklist; member in class:llvm::InstCombineWorklist
37 : Worklist(std::move(Arg.Worklist)),
40 Worklist = std::move(RHS.Worklist);
45 bool isEmpty() const { return Worklist.empty(); }
50 if (WorklistMap.insert(std::make_pair(I, Worklist.size())).second) {
52 Worklist.push_back(I);
65 assert(Worklist
[all...]
H A DInstCombine.h28 InstCombineWorklist Worklist; member in class:llvm::InstCombinePass
38 : Worklist(std::move(Arg.Worklist)),
41 Worklist = std::move(RHS.Worklist);
54 InstCombineWorklist Worklist; member in class:llvm::InstructionCombiningPass
/external/swiftshader/third_party/LLVM/lib/Transforms/InstCombine/
H A DInstCombineWorklist.h1 //===- InstCombineWorklist.h - Worklist for the InstCombine pass ----------===//
26 SmallVector<Instruction*, 256> Worklist; member in class:llvm::InstCombineWorklist
34 bool isEmpty() const { return Worklist.empty(); }
39 if (WorklistMap.insert(std::make_pair(I, Worklist.size())).second) {
41 Worklist.push_back(I);
54 assert(Worklist.empty() && "Worklist must be empty to add initial group");
55 Worklist.reserve(NumEntries+16);
60 WorklistMap.insert(std::make_pair(I, Worklist.size()));
61 Worklist
[all...]
/external/llvm/lib/Analysis/
H A DIteratedDominanceFrontier.cpp43 SmallVector<DomTreeNode *, 32> Worklist; local
58 Worklist.clear();
59 Worklist.push_back(Root);
62 while (!Worklist.empty()) {
63 DomTreeNode *Node = Worklist.pop_back_val();
96 Worklist.push_back(DomChild);
H A DCFG.cpp131 SmallVectorImpl<BasicBlock *> &Worklist, BasicBlock *StopBB,
143 BasicBlock *BB = Worklist.pop_back_val();
163 Outer->getExitBlocks(Worklist);
165 Worklist.append(succ_begin(BB), succ_end(BB));
167 } while (!Worklist.empty());
179 SmallVector<BasicBlock*, 32> Worklist; local
180 Worklist.push_back(const_cast<BasicBlock*>(A));
182 return isPotentiallyReachableFromMany(Worklist, const_cast<BasicBlock *>(B),
191 SmallVector<BasicBlock*, 32> Worklist; local
219 Worklist
130 isPotentiallyReachableFromMany( SmallVectorImpl<BasicBlock *> &Worklist, BasicBlock *StopBB, const DominatorTree *DT, const LoopInfo *LI) argument
[all...]
H A DPtrUseVisitor.cpp25 Worklist.push_back(std::move(NewU));
H A DEHPersonalities.cpp52 SmallVector<std::pair<BasicBlock *, BasicBlock *>, 16> Worklist; local
69 Worklist.push_back({EntryBlock, EntryBlock});
71 while (!Worklist.empty()) {
74 std::tie(Visiting, Color) = Worklist.pop_back_val();
106 Worklist.push_back({Succ, SuccColor});
H A DDivergenceAnalysis.cpp101 // users to Worklist.
109 std::vector<Value *> Worklist; // Stack for DFS. member in class:__anon12472::DivergencePropagator
114 Worklist.clear();
118 Worklist.push_back(&I);
124 Worklist.push_back(&Arg);
160 Worklist.push_back(&*I);
205 Worklist.push_back(UserInst);
245 Worklist.push_back(UserInst);
251 while (!Worklist.empty()) {
252 Value *V = Worklist
[all...]
H A DCaptureTracking.cpp103 SmallVector<BasicBlock*, 32> Worklist;
104 Worklist.append(succ_begin(BB), succ_end(BB));
105 return !isPotentiallyReachableFromMany(Worklist, BB, DT);
216 SmallVector<const Use *, Threshold> Worklist; local
228 Worklist.push_back(&U);
231 while (!Worklist.empty()) {
232 const Use *U = Worklist.pop_back_val();
325 Worklist.push_back(&UU);
H A DLazyCallGraph.cpp43 static void findReferences(SmallVectorImpl<Constant *> &Worklist, argument
47 while (!Worklist.empty()) {
48 Constant *C = Worklist.pop_back_val();
57 Worklist.push_back(cast<Constant>(Op));
66 SmallVector<Constant *, 16> Worklist; local
87 Worklist.push_back(C);
93 findReferences(Worklist, Visited, Edges, EdgeIndexMap);
138 SmallVector<Constant *, 16> Worklist; local
143 Worklist.push_back(GV.getInitializer());
147 findReferences(Worklist, Visite
[all...]
H A DDemandedBits.cpp270 SmallVector<Instruction*, 128> Worklist; local
285 Worklist.push_back(&I);
296 Worklist.push_back(J);
306 while (!Worklist.empty()) {
307 Instruction *UserI = Worklist.pop_back_val();
352 Worklist.push_back(I);
355 Worklist.push_back(I);
H A DModuleSummaryAnalysis.cpp35 SmallVector<const User *, 32> Worklist; local
36 Worklist.push_back(CurUser);
38 while (!Worklist.empty()) {
39 const User *U = Worklist.pop_back_val();
60 Worklist.push_back(Operand);
/external/llvm/lib/Transforms/Scalar/
H A DADCE.cpp78 SmallVector<Instruction*, 128> Worklist; local
88 Worklist.push_back(&I);
95 while (!Worklist.empty()) {
96 Instruction *Curr = Worklist.pop_back_val();
105 Worklist.push_back(Inst);
112 // NOTE: We reuse the Worklist vector here for memory efficiency.
136 Worklist.push_back(&I);
140 for (Instruction *&I : Worklist) {
145 return !Worklist.empty();
H A DBDCE.cpp39 SmallVector<Instruction*, 128> Worklist; local
59 Worklist.push_back(&I);
64 for (Instruction *&I : Worklist) {
H A DLoopUnswitch.cpp257 void SimplifyCode(std::vector<Instruction*> &Worklist, Loop *L);
1173 std::vector<Instruction*> &Worklist) {
1175 Worklist.erase(std::remove(Worklist.begin(), Worklist.end(), I),
1176 Worklist.end());
1182 std::vector<Instruction*> &Worklist,
1189 Worklist.push_back(Use);
1193 Worklist.push_back(cast<Instruction>(U));
1195 RemoveFromWorklist(I, Worklist);
1172 RemoveFromWorklist(Instruction *I, std::vector<Instruction*> &Worklist) argument
1181 ReplaceUsesOfWith(Instruction *I, Value *V, std::vector<Instruction*> &Worklist, Loop *L, LPPassManager *LPM) argument
1218 std::vector<Instruction*> Worklist; local
1327 SimplifyCode(std::vector<Instruction*> &Worklist, Loop *L) argument
[all...]
/external/swiftshader/third_party/LLVM/lib/Analysis/
H A DCaptureTracking.cpp49 SmallVector<Use*, Threshold> Worklist; local
62 Worklist.push_back(U);
65 while (!Worklist.empty()) {
66 Use *U = Worklist.pop_back_val();
125 Worklist.push_back(U);
/external/llvm/lib/Target/AMDGPU/
H A DSIWholeQuadMode.cpp103 char scanInstructions(MachineFunction &MF, std::vector<WorkItem> &Worklist);
104 void propagateInstruction(MachineInstr &MI, std::vector<WorkItem> &Worklist);
105 void propagateBlock(MachineBasicBlock &MBB, std::vector<WorkItem> &Worklist);
150 std::vector<WorkItem> &Worklist) {
196 Worklist.push_back(&MI);
203 Worklist.push_back(&MBB);
212 std::vector<WorkItem>& Worklist) {
228 Worklist.push_back(MBB);
238 Worklist.push_back(PrevMI);
276 Worklist
149 scanInstructions(MachineFunction &MF, std::vector<WorkItem> &Worklist) argument
211 propagateInstruction(MachineInstr &MI, std::vector<WorkItem>& Worklist) argument
281 propagateBlock(MachineBasicBlock &MBB, std::vector<WorkItem>& Worklist) argument
318 std::vector<WorkItem> Worklist; local
[all...]
/external/swiftshader/third_party/LLVM/lib/Transforms/Scalar/
H A DLoopUnswitch.cpp154 void SimplifyCode(std::vector<Instruction*> &Worklist, Loop *L);
156 std::vector<Instruction*> &Worklist, Loop *l);
718 std::vector<Instruction*> &Worklist) {
719 std::vector<Instruction*>::iterator WI = std::find(Worklist.begin(),
720 Worklist.end(), I);
721 while (WI != Worklist.end()) {
722 unsigned Offset = WI-Worklist.begin();
723 Worklist.erase(WI);
724 WI = std::find(Worklist.begin()+Offset, Worklist
717 RemoveFromWorklist(Instruction *I, std::vector<Instruction*> &Worklist) argument
730 ReplaceUsesOfWith(Instruction *I, Value *V, std::vector<Instruction*> &Worklist, Loop *L, LPPassManager *LPM) argument
754 RemoveBlockIfDead(BasicBlock *BB, std::vector<Instruction*> &Worklist, Loop *L) argument
890 std::vector<Instruction*> Worklist; local
997 SimplifyCode(std::vector<Instruction*> &Worklist, Loop *L) argument
[all...]
H A DSimplifyCFGPass.cpp112 SmallVector<BasicBlock*, 128> Worklist; local
113 Worklist.push_back(BB);
116 BB = Worklist.pop_back_val();
168 Worklist.push_back(*SI);
169 } while (!Worklist.empty());
/external/llvm/lib/Transforms/ObjCARC/
H A DProvenanceAnalysis.cpp78 SmallVector<const Value *, 8> Worklist; local
79 Worklist.push_back(P);
82 P = Worklist.pop_back_val();
99 Worklist.push_back(Ur);
101 } while (!Worklist.empty());
H A DDependencyAnalysis.cpp231 SmallVector<std::pair<BasicBlock *, BasicBlock::iterator>, 4> Worklist; local
232 Worklist.push_back(std::make_pair(StartBB, StartPos));
235 Worklist.pop_back_val();
250 Worklist.push_back(std::make_pair(PredBB, PredBB->end()));
261 } while (!Worklist.empty());
/external/llvm/include/llvm/Analysis/
H A DCFG.h82 /// 'Worklist' to 'StopBB', returning true if uncertain.
84 /// Determine whether there is a path from at least one block in Worklist to
86 /// once any block in 'Worklist' has been reached then 'StopBB' can not be
88 bool isPotentiallyReachableFromMany(SmallVectorImpl<BasicBlock *> &Worklist,
/external/llvm/include/llvm/Support/
H A DGenericDomTreeConstruction.h56 typename GraphT::ChildIteratorType>, 32> Worklist; local
57 Worklist.push_back(std::make_pair(V, GraphT::child_begin(V)));
58 while (!Worklist.empty()) {
59 typename GraphT::NodeType* BB = Worklist.back().first;
60 typename GraphT::ChildIteratorType NextSucc = Worklist.back().second;
84 Worklist.pop_back();
89 ++Worklist.back().second;
98 Worklist.push_back(std::make_pair(Succ, GraphT::child_begin(Succ)));
/external/swiftshader/third_party/LLVM/include/llvm/Analysis/
H A DDominatorInternals.h57 typename GraphT::ChildIteratorType>, 32> Worklist; local
58 Worklist.push_back(std::make_pair(V, GraphT::child_begin(V)));
59 while (!Worklist.empty()) {
60 typename GraphT::NodeType* BB = Worklist.back().first;
61 typename GraphT::ChildIteratorType NextSucc = Worklist.back().second;
85 Worklist.pop_back();
90 ++Worklist.back().second;
99 Worklist.push_back(std::make_pair(Succ, GraphT::child_begin(Succ)));
/external/llvm/lib/Transforms/Utils/
H A DSplitModule.cpp62 SmallVector<const User *, 4> Worklist; local
63 Worklist.push_back(U);
64 while (!Worklist.empty()) {
65 const User *UU = Worklist.pop_back_val();
68 Worklist.append(UU->user_begin(), UU->user_end());

Completed in 520 milliseconds

123456