| /external/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...] |
| ScalarReplAggregates.cpp | 139 std::vector<AllocaInst*> &WorkList);
[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.
50 /// Returns the node associated with the worklist unit.
53 /// Returns the block counter map associated with the worklist unit.
56 /// Returns the CFGblock associated with the worklist unit.
59 /// Return the index within the CFGBlock for the worklist unit.
63 class WorkList {
66 virtual ~WorkList();
[all...] |
| /external/clang/lib/Analysis/ |
| PseudoConstantAnalysis.cpp | 78 std::deque<const Stmt *> WorkList;
83 WorkList.push_back(DeclBody);
85 while (!WorkList.empty()) {
86 const Stmt *Head = WorkList.front();
87 WorkList.pop_front();
227 WorkList.push_back(B->getBody());
235 // Add all substatements to the worklist
238 WorkList.push_back(*I);
239 } // while (!WorkList.empty())
|
| ReachableCode.cpp | 32 llvm::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/clang/lib/StaticAnalyzer/Core/ |
| ExprEngineCXX.cpp | 40 SmallVector<CallExprWLItem, 20> WorkList;
41 WorkList.reserve(AE - AI);
42 WorkList.push_back(CallExprWLItem(AI, Pred));
44 while (!WorkList.empty()) {
45 CallExprWLItem Item = WorkList.back();
46 WorkList.pop_back();
62 WorkList.push_back(CallExprWLItem(Item.I, *NI));
|
| BugReporterVisitors.cpp | 415 std::deque<const Stmt *> WorkList;
416 WorkList.push_back(S);
418 while (!WorkList.empty()) {
419 const Stmt *Head = WorkList.front();
420 WorkList.pop_front();
442 WorkList.push_back(*I);
|
| CoreEngine.cpp | 27 // Worklist classes for exploration of reachable states.
30 WorkList::Visitor::~Visitor() {}
33 class DFS : public WorkList {
61 class BFS : public WorkList {
90 // Place the dstor for WorkList here because it contains virtual member
92 WorkList::~WorkList() {}
94 WorkList *WorkList::makeDFS() { return new DFS(); }
95 WorkList *WorkList::makeBFS() { return new BFS();
[all...] |
| RegionStore.cpp | 466 WorkList;
470 WorkList WL;
641 // Get the old binding. Is it a region? If so, add it to the worklist.
734 // Add the regions to the worklist.
[all...] |
| /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/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/v8/src/ |
| data-flow.h | 295 // Simple fixed-capacity list-based worklist (managed as a queue) of
298 class WorkList BASE_EMBEDDED {
300 // The worklist cannot grow bigger than size. We keep one item empty to
302 explicit WorkList(int size)
310 // The worklist is full if head is at 0 and tail is at capacity - 1:
|
| /external/llvm/lib/CodeGen/ |
| LiveVariables.cpp | 91 std::vector<MachineBasicBlock*> &WorkList) {
110 WorkList.insert(WorkList.end(), MBB->pred_rbegin(), MBB->pred_rend());
116 std::vector<MachineBasicBlock*> WorkList;
117 MarkVirtRegAliveInBlock(VRInfo, DefBlock, MBB, WorkList);
119 while (!WorkList.empty()) {
120 MachineBasicBlock *Pred = WorkList.back();
121 WorkList.pop_back();
122 MarkVirtRegAliveInBlock(VRInfo, DefBlock, Pred, WorkList);
|
| MachineCSE.cpp | 504 SmallVector<MachineDomTreeNode*, 8> WorkList;
511 WorkList.push_back(Node);
513 Node = WorkList.pop_back_val();
521 WorkList.push_back(Child);
523 } while (!WorkList.empty());
|
| InlineSpiller.cpp | 359 SmallVector<SibValueMap::iterator, 8> WorkList(1, SVI);
363 SVI = WorkList.pop_back_val();
456 WorkList.push_back(DepSVI);
461 } while (!WorkList.empty());
492 SmallVector<std::pair<unsigned, VNInfo*>, 8> WorkList;
493 WorkList.push_back(std::make_pair(UseReg, UseVNI));
498 tie(Reg, VNI) = WorkList.pop_back_val();
548 // Create entries for all the PHIs. Don't add them to the worklist, we
562 // This is the first time we see NonPHI, add it to the worklist.
564 WorkList.push_back(std::make_pair(Reg, NonPHI))
[all...] |
| LiveIntervalAnalysis.cpp | 759 SmallVector<std::pair<SlotIndex, VNInfo*>, 16> WorkList;
761 // Blocks that have already been added to WorkList as live-out.
787 WorkList.push_back(std::make_pair(Idx, VNI));
804 WorkList.push_back(std::make_pair(VNI->def.getLoadIndex(), UVNI));
810 // Extend intervals to reach all uses in WorkList.
811 while (!WorkList.empty()) {
812 SlotIndex Idx = WorkList.back().first;
813 VNInfo *VNI = WorkList.back().second;
814 WorkList.pop_back();
833 WorkList.push_back(std::make_pair(Stop, PVNI))
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| LoopSimplify.cpp | 438 std::vector<BasicBlock *> WorkList;
439 WorkList.push_back(InputBB);
441 BasicBlock *BB = WorkList.back(); WorkList.pop_back();
447 WorkList.push_back(WBB);
449 } while(!WorkList.empty());
|
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| DwarfDebug.cpp | [all...] |
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| DAGCombiner.cpp | 66 // Worklist of all of the nodes that need to be simplified.
67 std::vector<SDNode*> WorkList;
91 WorkList.push_back(N);
94 /// removeFromWorkList - remove all instances of N from the worklist.
97 WorkList.erase(std::remove(WorkList.begin(), WorkList.end(), N),
98 WorkList.end());
308 /// nodes from the worklist.
590 // Push the new nodes and any users onto the worklist
[all...] |
| SelectionDAGBuilder.cpp | [all...] |
