| /external/llvm/include/llvm/Transforms/InstCombine/ |
| InstCombineWorklist.h | 1 //===- InstCombineWorklist.h - Worklist for InstCombine pass ----*- C++ -*-===//
25 /// InstCombineWorklist - This is the worklist management logic for
28 SmallVector<Instruction*, 256> Worklist;
37 : Worklist(std::move(Arg.Worklist)),
40 Worklist = std::move(RHS.Worklist);
45 bool isEmpty() const { return Worklist.empty(); }
47 /// Add - Add the specified instruction to the worklist if it isn't already
50 if (WorklistMap.insert(std::make_pair(I, Worklist.size())).second)
[all...] |
| InstCombine.h | 28 InstCombineWorklist Worklist;
38 : Worklist(std::move(Arg.Worklist)),
41 Worklist = std::move(RHS.Worklist);
54 InstCombineWorklist Worklist;
|
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Transforms/InstCombine/ |
| InstCombineWorklist.h | 1 //===- InstCombineWorklist.h - Worklist for InstCombine pass ----*- C++ -*-===//
25 /// InstCombineWorklist - This is the worklist management logic for
28 SmallVector<Instruction*, 256> Worklist;
37 bool isEmpty() const { return Worklist.empty(); }
39 /// Add - Add the specified instruction to the worklist if it isn't already
42 if (WorklistMap.insert(std::make_pair(I, Worklist.size())).second) {
44 Worklist.push_back(I);
54 /// which should only be done when the worklist is empty and when the group
57 assert(Worklist.empty() && "Worklist must be empty to add initial group")
[all...] |
| InstCombine.h | 27 InstCombineWorklist Worklist;
44 InstCombineWorklist Worklist;
|
| /external/swiftshader/third_party/LLVM/lib/Transforms/InstCombine/ |
| InstCombineWorklist.h | 1 //===- InstCombineWorklist.h - Worklist for the InstCombine pass ----------===//
23 /// InstCombineWorklist - This is the worklist management logic for
26 SmallVector<Instruction*, 256> Worklist;
34 bool isEmpty() const { return Worklist.empty(); }
36 /// Add - Add the specified instruction to the worklist if it isn't already
39 if (WorklistMap.insert(std::make_pair(I, Worklist.size())).second) {
41 Worklist.push_back(I);
51 /// which should only be done when the worklist is empty and when the group
54 assert(Worklist.empty() && "Worklist must be empty to add initial group")
[all...] |
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/CodeGen/GlobalISel/ |
| GISelWorkList.h | 1 //===- GISelWorkList.h - Worklist for GISel passes ----*- C++ -*-===//
21 // Worklist which mostly works similar to InstCombineWorkList, but on MachineInstrs.
27 SmallVector<MachineInstr*, N> Worklist;
37 /// Add - Add the specified instruction to the worklist if it isn't already
40 if (WorklistMap.try_emplace(I, Worklist.size()).second) {
41 Worklist.push_back(I);
45 /// Remove - remove I from the worklist if it exists.
48 if (It == WorklistMap.end()) return; // Not in worklist.
51 Worklist[It->second] = nullptr;
59 I = Worklist.pop_back_val()
[all...] |
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Analysis/ |
| CodeMetrics.cpp | 32 SmallVectorImpl<const Value *> &Worklist) {
40 Worklist.push_back(Operand);
44 SmallVectorImpl<const Value *> &Worklist,
49 // Walk the worklist using an index but without caching the size so we can
50 // append more entries as we process the worklist. This forms a queue without
52 // worklist forever.
53 for (int i = 0; i < (int)Worklist.size(); ++i) {
54 const Value *V = Worklist[i];
57 "Failed to add a worklist entry to our visited set!");
67 appendSpeculatableOperands(V, Visited, Worklist);
[all...] |
| IteratedDominanceFrontier.cpp | 40 SmallVector<DomTreeNode *, 32> Worklist;
55 Worklist.clear();
56 Worklist.push_back(Root);
59 while (!Worklist.empty()) {
60 DomTreeNode *Node = Worklist.pop_back_val();
91 Worklist.push_back(DomChild);
|
| CFG.cpp | 131 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;
180 Worklist.push_back(const_cast<BasicBlock*>(A));
182 return isPotentiallyReachableFromMany(Worklist, const_cast<BasicBlock *>(B),
191 SmallVector<BasicBlock*, 32> Worklist;
219 Worklist.append(succ_begin(BB), succ_end(BB))
[all...] |
| PtrUseVisitor.cpp | 29 Worklist.push_back(std::move(NewU));
|
| EHPersonalities.cpp | 79 SmallVector<std::pair<BasicBlock *, BasicBlock *>, 16> Worklist;
96 Worklist.push_back({EntryBlock, EntryBlock});
98 while (!Worklist.empty()) {
101 std::tie(Visiting, Color) = Worklist.pop_back_val();
133 Worklist.push_back({Succ, SuccColor});
|
| DivergenceAnalysis.cpp | 102 // users to Worklist.
110 std::vector<Value *> Worklist; // Stack for DFS.
115 Worklist.clear();
119 Worklist.push_back(&I);
125 Worklist.push_back(&Arg);
161 Worklist.push_back(&*I);
206 Worklist.push_back(UserInst);
246 Worklist.push_back(UserInst);
252 while (!Worklist.empty()) {
253 Value *V = Worklist.back()
[all...] |
| /external/llvm/lib/Analysis/ |
| IteratedDominanceFrontier.cpp | 43 SmallVector<DomTreeNode *, 32> Worklist;
58 Worklist.clear();
59 Worklist.push_back(Root);
62 while (!Worklist.empty()) {
63 DomTreeNode *Node = Worklist.pop_back_val();
96 Worklist.push_back(DomChild);
|
| CFG.cpp | 131 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;
180 Worklist.push_back(const_cast<BasicBlock*>(A));
182 return isPotentiallyReachableFromMany(Worklist, const_cast<BasicBlock *>(B),
191 SmallVector<BasicBlock*, 32> Worklist;
219 Worklist.append(succ_begin(BB), succ_end(BB))
[all...] |
| PtrUseVisitor.cpp | 25 Worklist.push_back(std::move(NewU));
|
| EHPersonalities.cpp | 52 SmallVector<std::pair<BasicBlock *, BasicBlock *>, 16> Worklist;
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});
|
| DivergenceAnalysis.cpp | 101 // users to Worklist.
109 std::vector<Value *> Worklist; // Stack for DFS.
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.back()
[all...] |
| CaptureTracking.cpp | 103 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;
228 Worklist.push_back(&U);
231 while (!Worklist.empty()) {
232 const Use *U = Worklist.pop_back_val();
325 Worklist.push_back(&UU);
|
| /external/llvm/lib/Transforms/Scalar/ |
| ADCE.cpp | 78 SmallVector<Instruction*, 128> Worklist;
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();
|
| BDCE.cpp | 39 SmallVector<Instruction*, 128> Worklist;
59 Worklist.push_back(&I);
64 for (Instruction *&I : Worklist) {
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Transforms/AggressiveInstCombine/ |
| TruncInstCombine.cpp | 66 SmallVector<Value *, 8> Worklist;
71 Worklist.push_back(CurrentTruncInst->getOperand(0));
73 while (!Worklist.empty()) {
74 Value *Curr = Worklist.back();
77 Worklist.pop_back();
87 // Worklist and the Stack, and add it to the instruction info map.
88 Worklist.pop_back();
96 Worklist.pop_back();
122 Worklist.push_back(Operand);
139 SmallVector<Value *, 8> Worklist;
[all...] |
| /external/swiftshader/third_party/LLVM/lib/Analysis/ |
| CaptureTracking.cpp | 49 SmallVector<Use*, Threshold> Worklist;
62 Worklist.push_back(U);
65 while (!Worklist.empty()) {
66 Use *U = Worklist.pop_back_val();
125 Worklist.push_back(U);
|
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Transforms/Scalar/ |
| LoopPassManager.h | 106 /// Helper to implement appending of loops onto a worklist.
108 /// We want to process loops in postorder, but the worklist is a LIFO data
115 SmallPriorityWorklist<Loop *, 4> &Worklist) {
116 // We use an internal worklist to build up the preorder traversal without
121 // to visit defs before uses and the worklist is LIFO.
125 "Must start with an empty preorder walk worklist.");
133 Worklist.insert(std::move(PreOrderLoops));
183 // Insert ourselves back into the worklist first, as this loop should be
185 Worklist.insert(CurrentL);
194 internal::appendLoopsToWorklist(NewChildLoops, Worklist);
[all...] |
| /external/llvm/lib/Target/AMDGPU/ |
| SIWholeQuadMode.cpp | 103 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.push_back(&DefMI)
[all...] |
| /external/swiftshader/third_party/LLVM/lib/Transforms/Scalar/ |
| LoopUnswitch.cpp | 123 /// RemoveLoopFromWorklist - If the specified loop is on the loop worklist,
154 void SimplifyCode(std::vector<Instruction*> &Worklist, Loop *L);
156 std::vector<Instruction*> &Worklist, Loop *l);
715 /// RemoveFromWorklist - Remove all instances of I from the worklist vector
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)
[all...] |
