| /external/llvm/lib/Transforms/Scalar/ |
| ConstantProp.cpp | 67 // Initialize the worklist to all of the instructions ready to process...
68 std::set<Instruction*> WorkList;
70 WorkList.insert(&I);
77 while (!WorkList.empty()) {
78 Instruction *I = *WorkList.begin();
79 WorkList.erase(WorkList.begin()); // Get an element from the worklist...
83 // Add all of the users of this instruction to the worklist, they might
86 WorkList.insert(cast<Instruction>(U))
[all...] |
| DCE.cpp | 76 SmallSetVector<Instruction *, 16> &WorkList,
93 WorkList.insert(OpI);
105 SmallSetVector<Instruction *, 16> WorkList;
106 // Iterate over the original function, only adding insts to the worklist
108 // the worklist with the entire function's worth of instructions.
114 // worklist from an earlier visit.
115 if (!WorkList.count(I))
116 MadeChange |= DCEInstruction(I, WorkList, TLI);
119 while (!WorkList.empty()) {
120 Instruction *I = WorkList.pop_back_val()
[all...] |
| Reg2Mem.cpp | 91 std::list<Instruction*> WorkList;
97 WorkList.push_front(&*iib);
102 NumRegsDemoted += WorkList.size();
103 for (Instruction *ilb : WorkList)
106 WorkList.clear();
113 WorkList.push_front(&*iib);
116 NumPhisDemoted += WorkList.size();
117 for (Instruction *ilb : WorkList)
|
| /external/swiftshader/third_party/LLVM/lib/Transforms/Scalar/ |
| ConstantProp.cpp | 59 // Initialize the worklist to all of the instructions ready to process...
60 std::set<Instruction*> WorkList;
62 WorkList.insert(&*i);
66 while (!WorkList.empty()) {
67 Instruction *I = *WorkList.begin();
68 WorkList.erase(WorkList.begin()); // Get an element from the worklist...
72 // Add all of the users of this instruction to the worklist, they might
76 WorkList.insert(cast<Instruction>(*UI))
[all...] |
| DCE.cpp | 90 // Start out with all of the instructions in the worklist...
91 std::vector<Instruction*> WorkList;
93 WorkList.push_back(&*i);
95 // Loop over the worklist finding instructions that are dead. If they are
97 // potentially dead, and work until the worklist is empty.
100 while (!WorkList.empty()) {
101 Instruction *I = WorkList.back();
102 WorkList.pop_back();
106 // instructions being used, add them to the worklist, because they might
111 WorkList.push_back(Used)
[all...] |
| Reg2Mem.cpp | 92 std::list<Instruction*> WorkList;
99 WorkList.push_front(&*iib);
104 NumRegsDemoted += WorkList.size();
105 for (std::list<Instruction*>::iterator ilb = WorkList.begin(),
106 ile = WorkList.end(); ilb != ile; ++ilb)
109 WorkList.clear();
117 WorkList.push_front(&*iib);
120 NumPhisDemoted += WorkList.size();
121 for (std::list<Instruction*>::iterator ilb = WorkList.begin(),
122 ile = WorkList.end(); ilb != ile; ++ilb
[all...] |
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Transforms/Scalar/ |
| ConstantProp.cpp | 68 // Initialize the worklist to all of the instructions ready to process...
69 std::set<Instruction*> WorkList;
71 WorkList.insert(&I);
78 while (!WorkList.empty()) {
79 Instruction *I = *WorkList.begin();
80 WorkList.erase(WorkList.begin()); // Get an element from the worklist...
84 // Add all of the users of this instruction to the worklist, they might
87 WorkList.insert(cast<Instruction>(U))
[all...] |
| DCE.cpp | 77 SmallSetVector<Instruction *, 16> &WorkList,
96 WorkList.insert(OpI);
108 SmallSetVector<Instruction *, 16> WorkList;
109 // Iterate over the original function, only adding insts to the worklist
111 // the worklist with the entire function's worth of instructions.
117 // worklist from an earlier visit.
118 if (!WorkList.count(I))
119 MadeChange |= DCEInstruction(I, WorkList, TLI);
122 while (!WorkList.empty()) {
123 Instruction *I = WorkList.pop_back_val()
[all...] |
| Reg2Mem.cpp | 92 std::list<Instruction*> WorkList;
98 WorkList.push_front(&*iib);
103 NumRegsDemoted += WorkList.size();
104 for (Instruction *ilb : WorkList)
107 WorkList.clear();
114 WorkList.push_front(&*iib);
117 NumPhisDemoted += WorkList.size();
118 for (Instruction *ilb : WorkList)
|
| BDCE.cpp | 43 // Initialize the worklist with eligible direct users.
44 SmallVector<Instruction *, 16> WorkList;
51 WorkList.push_back(J);
65 while (!WorkList.empty()) {
66 Instruction *J = WorkList.pop_back_val();
83 WorkList.push_back(K);
89 SmallVector<Instruction*, 128> Worklist;
119 Worklist.push_back(&I);
124 for (Instruction *&I : Worklist) {
|
| /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| WorkList.h | 1 //==- WorkList.h - Worklist class used by CoreEngine ---------------*- C++ -*-//
10 // This file defines WorkList, a pure virtual class that represents an opaque
11 // worklist used by CoreEngine to explore the reachability state space.
48 /// Returns the node associated with the worklist unit.
51 /// Returns the block counter map associated with the worklist unit.
54 /// Returns the CFGblock associated with the worklist unit.
57 /// Return the index within the CFGBlock for the worklist unit.
61 class WorkList {
64 virtual ~WorkList();
[all...] |
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/ |
| ScheduleDAG.cpp | 218 SmallVector<SUnit*, 8> WorkList;
219 WorkList.push_back(this);
221 SUnit *SU = WorkList.pop_back_val();
226 WorkList.push_back(SuccSU);
228 } while (!WorkList.empty());
233 SmallVector<SUnit*, 8> WorkList;
234 WorkList.push_back(this);
236 SUnit *SU = WorkList.pop_back_val();
241 WorkList.push_back(PredSU);
243 } while (!WorkList.empty())
[all...] |
| ProcessImplicitDefs.cpp | 33 SmallSetVector<MachineInstr*, 16> WorkList;
89 WorkList.insert(UserMI);
144 assert(WorkList.empty() && "Inconsistent worklist state");
152 WorkList.insert(&*MBBI);
154 if (WorkList.empty())
157 LLVM_DEBUG(dbgs() << printMBBReference(*MFI) << " has " << WorkList.size()
161 // Drain the WorkList to recursively process any new implicit defs.
162 do processImplicitDef(WorkList.pop_back_val());
163 while (!WorkList.empty())
[all...] |
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/GlobalISel/ |
| Combiner.cpp | 55 GISelWorkList<512> WorkList;
68 WorkList.insert(CurMI);
72 while (!WorkList.empty()) {
73 MachineInstr *CurrInst = WorkList.pop_back_val();
|
| /external/llvm/include/llvm/Analysis/ |
| LoopPassManager.h | 96 SmallVector<Loop *, 2> WorkList(LI.begin(), LI.end());
97 while (!WorkList.empty()) {
98 Loop *L = WorkList.pop_back_val();
99 WorkList.insert(WorkList.end(), L->begin(), L->end());
|
| /external/llvm/lib/CodeGen/ |
| ScheduleDAG.cpp | 180 SmallVector<SUnit*, 8> WorkList;
181 WorkList.push_back(this);
183 SUnit *SU = WorkList.pop_back_val();
189 WorkList.push_back(SuccSU);
191 } while (!WorkList.empty());
196 SmallVector<SUnit*, 8> WorkList;
197 WorkList.push_back(this);
199 SUnit *SU = WorkList.pop_back_val();
205 WorkList.push_back(PredSU);
207 } while (!WorkList.empty())
[all...] |
| ProcessImplicitDefs.cpp | 33 SmallSetVector<MachineInstr*, 16> WorkList;
91 WorkList.insert(UserMI);
146 assert(WorkList.empty() && "Inconsistent worklist state");
154 WorkList.insert(&*MBBI);
156 if (WorkList.empty())
159 DEBUG(dbgs() << "BB#" << MFI->getNumber() << " has " << WorkList.size()
163 // Drain the WorkList to recursively process any new implicit defs.
164 do processImplicitDef(WorkList.pop_back_val());
165 while (!WorkList.empty())
[all...] |
| /external/swiftshader/third_party/LLVM/lib/CodeGen/ |
| ScheduleDAG.cpp | 170 SmallVector<SUnit*, 8> WorkList;
171 WorkList.push_back(this);
173 SUnit *SU = WorkList.pop_back_val();
179 WorkList.push_back(SuccSU);
181 } while (!WorkList.empty());
186 SmallVector<SUnit*, 8> WorkList;
187 WorkList.push_back(this);
189 SUnit *SU = WorkList.pop_back_val();
195 WorkList.push_back(PredSU);
197 } while (!WorkList.empty())
[all...] |
| /external/skia/src/core/ |
| SkExecutor.cpp | 63 template <typename WorkList>
129 WorkList fWork;
135 using WorkList = std::deque<std::function<void(void)>>;
136 return skstd::make_unique<SkThreadPool<WorkList>>(threads > 0 ? threads : num_cores());
139 using WorkList = SkTArray<std::function<void(void)>>;
140 return skstd::make_unique<SkThreadPool<WorkList>>(threads > 0 ? threads : num_cores());
|
| /external/skqp/src/core/ |
| SkExecutor.cpp | 63 template <typename WorkList>
129 WorkList fWork;
135 using WorkList = std::deque<std::function<void(void)>>;
136 return skstd::make_unique<SkThreadPool<WorkList>>(threads > 0 ? threads : num_cores());
139 using WorkList = SkTArray<std::function<void(void)>>;
140 return skstd::make_unique<SkThreadPool<WorkList>>(threads > 0 ? threads : num_cores());
|
| /external/spirv-llvm/lib/SPIRV/ |
| SPIRVLowerConstExpr.cpp | 119 std::list<Instruction *> WorkList;
123 WorkList.push_back(static_cast<Instruction*>(II));
126 while (!WorkList.empty()) {
127 auto II = WorkList.front();
128 WorkList.pop_front();
137 WorkList.push_front(ReplInst);
|
| /external/swiftshader/third_party/LLVM/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 94 SmallVector<BBInfo*, 64> WorkList;
98 WorkList.push_back(Info);
104 while (!WorkList.empty()) {
105 Info = WorkList.pop_back_val();
136 WorkList.push_back(PredInfo);
146 // Initialize the worklist with the roots from the backward traversal.
151 WorkList.push_back(Info);
154 while (!WorkList.empty()) {
155 Info = WorkList.back();
163 WorkList.pop_back()
[all...] |
| /external/clang/lib/Analysis/ |
| PseudoConstantAnalysis.cpp | 75 std::deque<const Stmt *> WorkList;
80 WorkList.push_back(DeclBody);
82 while (!WorkList.empty()) {
83 const Stmt *Head = WorkList.front();
84 WorkList.pop_front();
212 WorkList.push_back(B->getBody());
220 // Add all substatements to the worklist
223 WorkList.push_back(SubStmt);
224 } // while (!WorkList.empty())
|
| /external/swiftshader/third_party/LLVM/tools/llvm-objdump/ |
| MCFunction.cpp | 44 SmallVector<uint64_t, 16> WorkList;
45 WorkList.push_back(Start);
47 while (!WorkList.empty()) {
48 uint64_t Index = WorkList.pop_back_val();
64 // new basic block there and add the target to the worklist.
67 WorkList.push_back(targ);
68 WorkList.push_back(Index+Size);
|
| /external/llvm/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 105 SmallVector<BBInfo*, 64> WorkList;
109 WorkList.push_back(Info);
115 while (!WorkList.empty()) {
116 Info = WorkList.pop_back_val();
147 WorkList.push_back(PredInfo);
157 // Initialize the worklist with the roots from the backward traversal.
162 WorkList.push_back(Info);
165 while (!WorkList.empty()) {
166 Info = WorkList.back();
174 WorkList.pop_back()
[all...] |
