| /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...] |
| ScalarReplAggregates.cpp | 166 std::vector<AllocaInst*> &WorkList);
[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...] |
| /external/llvm/lib/CodeGen/ |
| 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...] |
| 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);
|
| 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());
|
| LiveIntervalAnalysis.cpp | 325 SmallVector<std::pair<SlotIndex, VNInfo*>, 16> WorkList;
327 // Blocks that have already been added to WorkList as live-out.
354 WorkList.push_back(std::make_pair(Idx, VNI));
370 // Extend intervals to reach all uses in WorkList.
371 while (!WorkList.empty()) {
372 SlotIndex Idx = WorkList.back().first;
373 VNInfo *VNI = WorkList.back().second;
374 WorkList.pop_back();
393 WorkList.push_back(std::make_pair(Stop, PVNI));
410 WorkList.push_back(std::make_pair(Stop, VNI))
[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...] |
| MachineLICM.cpp | 359 SmallVector<MachineLoop *, 8> Worklist(MLI->begin(), MLI->end());
360 while (!Worklist.empty()) {
361 CurLoop = Worklist.pop_back_val();
368 Worklist.append(CurLoop->begin(), CurLoop->end());
696 SmallVector<MachineDomTreeNode*, 8> WorkList;
701 WorkList.push_back(HeaderN);
703 MachineDomTreeNode *Node = WorkList.pop_back_val();
728 // Add children in reverse order as then the next popped worklist node is
734 WorkList.push_back(Child);
736 } while (!WorkList.empty())
[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...] |
| /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/clang/lib/StaticAnalyzer/Core/ |
| 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);
|
| 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...] |
| BugReporterVisitors.cpp | [all...] |
| PathDiagnostic.cpp | 217 SmallVector<const PathPieces *, 5> WorkList;
218 WorkList.push_back(&D->path);
220 while (!WorkList.empty()) {
221 const PathPieces &path = *WorkList.pop_back_val();
247 WorkList.push_back(&call->path);
251 WorkList.push_back(¯o->subPieces);
[all...] |
| RegionStore.cpp | 631 /// initial worklist of a ClusterAnalysis.
646 typedef SmallVector<WorkListElement, 10> WorkList;
650 WorkList WL;
[all...] |
| /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/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/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/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/lib/CodeGen/AsmPrinter/ |
| DwarfDebug.cpp | [all...] |
| /external/llvm/lib/IR/ |
| Constants.cpp | 308 SmallVector<const Constant *, 8> WorkList;
309 WorkList.push_back(C);
312 while (!WorkList.empty()) {
313 const Constant *WorkItem = WorkList.pop_back_val();
322 WorkList.push_back(ConstOp);
[all...] |
