| /external/llvm/lib/Transforms/Scalar/ |
| ConstantProp.cpp | 65 // Initialize the worklist to all of the instructions ready to process...
66 std::set<Instruction*> WorkList;
68 WorkList.insert(&*i);
75 while (!WorkList.empty()) {
76 Instruction *I = *WorkList.begin();
77 WorkList.erase(WorkList.begin()); // Get an element from the worklist...
81 // Add all of the users of this instruction to the worklist, they might
84 WorkList.insert(cast<Instruction>(U))
[all...] |
| DCE.cpp | 100 // Start out with all of the instructions in the worklist...
101 std::vector<Instruction*> WorkList;
103 WorkList.push_back(&*i);
105 // Loop over the worklist finding instructions that are dead. If they are
107 // potentially dead, and work until the worklist is empty.
110 while (!WorkList.empty()) {
111 Instruction *I = WorkList.back();
112 WorkList.pop_back();
116 // instructions being used, add them to the worklist, because they might
121 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/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...] |
| CoreEngine.h | 23 #include "clang/StaticAnalyzer/Core/PathSensitive/WorkList.h"
66 /// worklist algorithm. It is up to the implementation of WList to decide
68 std::unique_ptr<WorkList> WList;
114 WList(WorkList::makeDFS()),
125 /// ExecuteWorkList - Run the worklist algorithm for a maximum number of
126 /// steps. Returns true if there is still simulation state on the worklist.
129 /// Returns true if there is still simulation state on the worklist.
153 WorkList *getWorkList() const { return WList.get(); }
|
| /external/llvm/lib/CodeGen/ |
| ScheduleDAG.cpp | 181 SmallVector<SUnit*, 8> WorkList;
182 WorkList.push_back(this);
184 SUnit *SU = WorkList.pop_back_val();
190 WorkList.push_back(SuccSU);
192 } while (!WorkList.empty());
197 SmallVector<SUnit*, 8> WorkList;
198 WorkList.push_back(this);
200 SUnit *SU = WorkList.pop_back_val();
206 WorkList.push_back(PredSU);
208 } while (!WorkList.empty())
[all...] |
| ProcessImplicitDefs.cpp | 32 SmallSetVector<MachineInstr*, 16> WorkList;
90 WorkList.insert(UserMI);
145 assert(WorkList.empty() && "Inconsistent worklist state");
153 WorkList.insert(MBBI);
155 if (WorkList.empty())
158 DEBUG(dbgs() << "BB#" << MFI->getNumber() << " has " << WorkList.size()
162 // Drain the WorkList to recursively process any new implicit defs.
163 do processImplicitDef(WorkList.pop_back_val());
164 while (!WorkList.empty())
[all...] |
| LiveRangeCalc.cpp | 174 SmallVector<unsigned, 16> WorkList(1, KillMBBNum);
181 for (unsigned i = 0; i != WorkList.size(); ++i) {
182 MachineBasicBlock *MBB = MF->getBlockNumbered(WorkList[i]);
229 WorkList.push_back(Pred->getNumber());
240 if (WorkList.size() > 4)
241 array_pod_sort(WorkList.begin(), WorkList.end());
246 for (SmallVectorImpl<unsigned>::const_iterator I = WorkList.begin(),
247 E = WorkList.end(); I != E; ++I) {
263 LiveIn.reserve(WorkList.size())
[all...] |
| InlineSpiller.cpp | 365 SmallSetVector<SibValueMap::value_type *, 8> WorkList;
366 WorkList.insert(SVI);
369 SVI = WorkList.pop_back_val();
473 WorkList.insert(&*DepSVI);
478 } while (!WorkList.empty());
509 SmallVector<std::pair<unsigned, VNInfo*>, 8> WorkList;
510 WorkList.push_back(std::make_pair(UseReg, UseVNI));
515 std::tie(Reg, VNI) = WorkList.pop_back_val();
565 // Create entries for all the PHIs. Don't add them to the worklist, we
579 // This is the first time we see NonPHI, add it to the worklist
[all...] |
| LiveVariables.cpp | 95 std::vector<MachineBasicBlock*> &WorkList) {
115 WorkList.insert(WorkList.end(), MBB->pred_rbegin(), MBB->pred_rend());
121 std::vector<MachineBasicBlock*> WorkList;
122 MarkVirtRegAliveInBlock(VRInfo, DefBlock, MBB, WorkList);
124 while (!WorkList.empty()) {
125 MachineBasicBlock *Pred = WorkList.back();
126 WorkList.pop_back();
127 MarkVirtRegAliveInBlock(VRInfo, DefBlock, Pred, WorkList);
|
| MachineBlockPlacement.cpp | 215 BlockChain &Chain, SmallVectorImpl<MachineBasicBlock *> &WorkList,
292 /// chain which reach the zero-predecessor state to the worklist passed in.
303 // predecessor to the worklist as a viable candidate for CFG-neutral
413 /// \brief Select the best block from a worklist.
415 /// This looks through the provided worklist as a list of candidate basic
418 /// the most frequently visited block in the worklist, which in the case of
424 BlockChain &Chain, SmallVectorImpl<MachineBasicBlock *> &WorkList,
426 // Once we need to walk the worklist looking for a candidate, cleanup the
427 // worklist of already placed entries.
430 WorkList.erase(std::remove_if(WorkList.begin(), WorkList.end()
[all...] |
| RegisterCoalescer.cpp | 97 /// WorkList - Copy instructions yet to be coalesced.
98 SmallVector<MachineInstr*, 8> WorkList;
102 /// that may be present in WorkList.
124 /// copies that cannot yet be coalesced into WorkList.
406 // MI may be in WorkList. Make sure we don't visit it.
[all...] |
| MachineCSE.cpp | 629 SmallVector<MachineDomTreeNode*, 8> WorkList;
635 WorkList.push_back(Node);
637 Node = WorkList.pop_back_val();
644 WorkList.push_back(Child);
646 } while (!WorkList.empty());
|
| MachineTraceMetrics.cpp | 511 SmallVector<const MachineBasicBlock*, 16> WorkList;
517 WorkList.push_back(BadMBB);
519 const MachineBasicBlock *MBB = WorkList.pop_back_val();
531 WorkList.push_back(*I);
537 } while (!WorkList.empty());
543 WorkList.push_back(BadMBB);
545 const MachineBasicBlock *MBB = WorkList.pop_back_val();
557 WorkList.push_back(*I);
563 } while (!WorkList.empty());
[all...] |
| /external/clang/lib/Analysis/ |
| PseudoConstantAnalysis.cpp | 77 std::deque<const Stmt *> WorkList;
82 WorkList.push_back(DeclBody);
84 while (!WorkList.empty()) {
85 const Stmt *Head = WorkList.front();
86 WorkList.pop_front();
214 WorkList.push_back(B->getBody());
222 // Add all substatements to the worklist
225 WorkList.push_back(*I);
226 } // while (!WorkList.empty())
|
| ReachableCode.cpp | 347 SmallVector<const CFGBlock *, 10> WorkList;
380 WorkList.push_back(block);
397 WorkList.push_back(PredBlock);
448 while (!WorkList.empty()) {
449 const CFGBlock *Block = WorkList.pop_back_val();
|
| /external/llvm/lib/Target/R600/ |
| AMDGPUPromoteAlloca.cpp | 164 std::vector<Value*> WorkList;
171 WorkList.push_back(AllocaUser);
189 WorkList.push_back(GEPUser);
198 for (std::vector<Value*>::iterator I = WorkList.begin(),
199 E = WorkList.end(); I != E; ++I) {
237 static void collectUsesWithPtrTypes(Value *Val, std::vector<Value*> &WorkList) {
239 if(std::find(WorkList.begin(), WorkList.end(), User) != WorkList.end())
242 WorkList.push_back(User)
[all...] |
| /external/llvm/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 104 SmallVector<BBInfo*, 64> WorkList;
108 WorkList.push_back(Info);
114 while (!WorkList.empty()) {
115 Info = WorkList.pop_back_val();
146 WorkList.push_back(PredInfo);
156 // Initialize the worklist with the roots from the backward traversal.
161 WorkList.push_back(Info);
164 while (!WorkList.empty()) {
165 Info = WorkList.back();
173 WorkList.pop_back()
[all...] |
| /external/llvm/lib/Target/Mips/ |
| MipsOptimizePICCall.cpp | 184 SmallVector<MBBInfo, 8> WorkList(1, MBBInfo(MDT->getRootNode()));
186 while (!WorkList.empty()) {
187 MBBInfo &MBBI = WorkList.back();
193 WorkList.pop_back();
202 WorkList.append(Children.begin(), Children.end());
|
| /external/clang/lib/StaticAnalyzer/Core/ |
| CoreEngine.cpp | 37 // Worklist classes for exploration of reachable states.
40 WorkList::Visitor::~Visitor() {}
43 class DFS : public WorkList {
71 class BFS : public WorkList {
100 // Place the dstor for WorkList here because it contains virtual member
102 WorkList::~WorkList() {}
104 WorkList *WorkList::makeDFS() { return new DFS(); }
105 WorkList *WorkList::makeBFS() { return new BFS();
[all...] |
| PlistDiagnostics.cpp | 306 SmallVector<const PathPieces *, 5> WorkList;
307 WorkList.push_back(&D->path);
309 while (!WorkList.empty()) {
310 const PathPieces &path = *WorkList.pop_back_val();
330 WorkList.push_back(&call->path);
334 WorkList.push_back(¯o->subPieces);
|
| /external/llvm/lib/Transforms/Instrumentation/ |
| BoundsChecking.cpp | 180 std::vector<Instruction*> WorkList;
185 WorkList.push_back(I);
189 for (std::vector<Instruction*>::iterator i = WorkList.begin(),
190 e = WorkList.end(); i != e; ++i) {
|
| /external/llvm/utils/TableGen/ |
| DFAPacketizerEmitter.cpp | 392 // Run the worklist algorithm to generate the DFA.
432 // Run a worklist algorithm to generate the DFA.
438 SmallVector<const State*, 32> WorkList;
441 WorkList.push_back(Initial);
444 // Worklist algorithm to create a DFA for processor resource tracking.
446 // Begin with initial node in worklist. Initial node does not have
450 // While worklist != empty
451 // S = first element of worklist
457 // Add S' to worklist
460 while (!WorkList.empty())
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| LiveVariables.h | 276 std::vector<MachineBasicBlock*> &WorkList);
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| SelectionDAGBuilder.h | 649 CaseRecVector& WorkList,
654 CaseRecVector& WorkList,
659 CaseRecVector& WorkList,
664 CaseRecVector& WorkList,
|
