| /external/llvm/lib/Transforms/Scalar/ |
| ConstantProp.cpp | 64 // Initialize the worklist to all of the instructions ready to process...
65 std::set<Instruction*> WorkList;
67 WorkList.insert(&*i);
73 while (!WorkList.empty()) {
74 Instruction *I = *WorkList.begin();
75 WorkList.erase(WorkList.begin()); // Get an element from the worklist...
79 // Add all of the users of this instruction to the worklist, they might
83 WorkList.insert(cast<Instruction>(*UI))
[all...] |
| DCE.cpp | 94 // Start out with all of the instructions in the worklist...
95 std::vector<Instruction*> WorkList;
97 WorkList.push_back(&*i);
99 // Loop over the worklist finding instructions that are dead. If they are
101 // potentially dead, and work until the worklist is empty.
104 while (!WorkList.empty()) {
105 Instruction *I = WorkList.back();
106 WorkList.pop_back();
110 // instructions being used, add them to the worklist, because they might
115 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...] |
| CodeGenPrepare.cpp | 187 SmallPtrSet<BasicBlock*, 8> WorkList;
196 WorkList.insert(*II);
200 MadeChange |= !WorkList.empty();
201 while (!WorkList.empty()) {
202 BasicBlock *BB = *WorkList.begin();
203 WorkList.erase(BB);
211 WorkList.insert(*II);
1468 SmallVector<Value*, 8> worklist; local
[all...] |
| /external/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/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;
93 WorkList.insert(UserMI);
148 assert(WorkList.empty() && "Inconsistent worklist state");
156 WorkList.insert(MBBI);
158 if (WorkList.empty())
161 DEBUG(dbgs() << "BB#" << MFI->getNumber() << " has " << WorkList.size()
165 // Drain the WorkList to recursively process any new implicit defs.
166 do processImplicitDef(WorkList.pop_back_val());
167 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 | 621 SmallVector<MachineDomTreeNode*, 8> WorkList;
627 WorkList.push_back(Node);
629 Node = WorkList.pop_back_val();
636 WorkList.push_back(Child);
638 } while (!WorkList.empty());
|
| LiveIntervalAnalysis.cpp | 312 SmallVector<std::pair<SlotIndex, VNInfo*>, 16> WorkList;
314 // Blocks that have already been added to WorkList as live-out.
339 WorkList.push_back(std::make_pair(Idx, VNI));
355 // Extend intervals to reach all uses in WorkList.
356 while (!WorkList.empty()) {
357 SlotIndex Idx = WorkList.back().first;
358 VNInfo *VNI = WorkList.back().second;
359 WorkList.pop_back();
378 WorkList.push_back(std::make_pair(Stop, PVNI));
395 WorkList.push_back(std::make_pair(Stop, VNI))
[all...] |
| InlineSpiller.cpp | 357 SmallVector<SibValueMap::iterator, 8> WorkList(1, SVI);
361 SVI = WorkList.pop_back_val();
454 WorkList.push_back(DepSVI);
459 } while (!WorkList.empty());
490 SmallVector<std::pair<unsigned, VNInfo*>, 8> WorkList;
491 WorkList.push_back(std::make_pair(UseReg, UseVNI));
496 tie(Reg, VNI) = WorkList.pop_back_val();
546 // Create entries for all the PHIs. Don't add them to the worklist, we
560 // This is the first time we see NonPHI, add it to the worklist.
562 WorkList.push_back(std::make_pair(Reg, NonPHI))
[all...] |
| MachineLICM.cpp | 355 SmallVector<MachineLoop *, 8> Worklist(MLI->begin(), MLI->end());
356 while (!Worklist.empty()) {
357 CurLoop = Worklist.pop_back_val();
364 Worklist.append(CurLoop->begin(), CurLoop->end());
692 SmallVector<MachineDomTreeNode*, 8> WorkList;
697 WorkList.push_back(HeaderN);
699 MachineDomTreeNode *Node = WorkList.pop_back_val();
724 // Add children in reverse order as then the next popped worklist node is
730 WorkList.push_back(Child);
732 } 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();
215 WorkList.push_back(B->getBody());
223 // Add all substatements to the worklist
226 WorkList.push_back(*I);
227 } // while (!WorkList.empty())
|
| ReachableCode.cpp | 32 SmallVector<const CFGBlock *, 10> WorkList;
62 WorkList.push_back(block);
79 WorkList.push_back(PredBlock);
125 while (!WorkList.empty()) {
126 const CFGBlock *Block = WorkList.pop_back_val();
|
| /external/llvm/lib/Transforms/Instrumentation/ |
| BoundsChecking.cpp | 181 std::vector<Instruction*> WorkList;
186 WorkList.push_back(I);
190 for (std::vector<Instruction*>::iterator i = WorkList.begin(),
191 e = WorkList.end(); i != e; ++i) {
|
| /external/clang/include/clang/Analysis/FlowSensitive/ |
| DataflowSolver.h | 27 /// DataflowWorkListTy - Data structure representing the worklist used for
35 /// enqueue - Add a block to the worklist. Blocks already on the
36 /// worklist are not added a second time.
45 /// dequeue - Remove a block from the worklist.
54 /// isEmpty - Return true if the worklist is empty.
196 /// SolveDataflowEquations - Perform the actual worklist algorithm
201 while (!WorkList.isEmpty()) {
202 const CFGBlock *B = WorkList.dequeue();
213 WorkList.enqueue(&**I);
222 WorkList.enqueue(&**I)
[all...] |
| /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 | 372 SmallVector<const PathPieces *, 5> WorkList;
373 WorkList.push_back(&D->path);
375 while (!WorkList.empty()) {
376 const PathPieces &path = *WorkList.back();
377 WorkList.pop_back();
397 WorkList.push_back(&call->path);
401 WorkList.push_back(¯o->subPieces);
|
| BugReporterVisitors.cpp | [all...] |
| PathDiagnostic.cpp | 149 SmallVector<const PathPieces *, 5> WorkList;
150 WorkList.push_back(&D->path);
152 while (!WorkList.empty()) {
153 const PathPieces &path = *WorkList.back();
154 WorkList.pop_back();
180 WorkList.push_back(&call->path);
184 WorkList.push_back(¯o->subPieces);
[all...] |
| RegionStore.cpp | 598 typedef SmallVector<const MemRegion *, 10> WorkList;
602 WorkList WL;
[all...] |
| /external/llvm/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 102 SmallVector<BBInfo*, 64> WorkList;
106 WorkList.push_back(Info);
112 while (!WorkList.empty()) {
113 Info = WorkList.pop_back_val();
144 WorkList.push_back(PredInfo);
154 // Initialize the worklist with the roots from the backward traversal.
159 WorkList.push_back(Info);
162 while (!WorkList.empty()) {
163 Info = WorkList.back();
171 WorkList.pop_back()
[all...] |
| /external/llvm/utils/TableGen/ |
| DFAPacketizerEmitter.cpp | 407 // Run the worklist algorithm to generate the DFA.
447 // Run a worklist algorithm to generate the DFA.
454 SmallVector<State*, 32> WorkList;
457 WorkList.push_back(Initial);
460 // Worklist algorithm to create a DFA for processor resource tracking.
462 // Begin with initial node in worklist. Initial node does not have
466 // While worklist != empty
467 // S = first element of worklist
473 // Add S' to worklist
476 while (!WorkList.empty())
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| LoopSimplify.cpp | 452 std::vector<BasicBlock *> WorkList;
453 WorkList.push_back(InputBB);
455 BasicBlock *BB = WorkList.back(); WorkList.pop_back();
461 WorkList.push_back(WBB);
463 } while(!WorkList.empty());
|
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| DwarfDebug.cpp | [all...] |
