| /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 | 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...] |
| CodeGenPrepare.cpp | 168 SmallPtrSet<BasicBlock*, 8> WorkList;
177 WorkList.insert(*II);
182 I = WorkList.begin(), E = WorkList.end(); I != E; ++I)
756 SmallVector<Value*, 8> worklist; local
758 worklist.push_back(Addr);
760 // Use a worklist to iteratively look through PHI nodes, and ensure that
768 while (!worklist.empty()) {
769 Value *V = worklist.back();
770 worklist.pop_back()
[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 | 76 std::deque<const Stmt *> WorkList;
81 WorkList.push_back(DeclBody);
83 while (!WorkList.empty()) {
84 const Stmt *Head = WorkList.front();
85 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 | 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/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/ |
| BugReporterVisitors.cpp | 404 std::deque<const Stmt *> WorkList;
405 WorkList.push_back(S);
407 while (!WorkList.empty()) {
408 const Stmt *Head = WorkList.front();
409 WorkList.pop_front();
431 WorkList.push_back(*I);
|
| CoreEngine.cpp | 35 // Worklist classes for exploration of reachable states.
38 WorkList::Visitor::~Visitor() {}
41 class DFS : public WorkList {
69 class BFS : public WorkList {
98 // Place the dstor for WorkList here because it contains virtual member
100 WorkList::~WorkList() {}
102 WorkList *WorkList::makeDFS() { return new DFS(); }
103 WorkList *WorkList::makeBFS() { return new BFS();
[all...] |
| PlistDiagnostics.cpp | 365 llvm::SmallVector<const PathPieces *, 5> WorkList;
366 WorkList.push_back(&D->path);
368 while (!WorkList.empty()) {
369 const PathPieces &path = *WorkList.back();
370 WorkList.pop_back();
385 WorkList.push_back(&call->path);
389 WorkList.push_back(¯o->subPieces);
|
| PathDiagnostic.cpp | 99 llvm::SmallVector<const PathPieces *, 5> WorkList;
100 WorkList.push_back(&D->path);
102 while (!WorkList.empty()) {
103 const PathPieces &path = *WorkList.back();
104 WorkList.pop_back();
130 WorkList.push_back(&call->path);
134 WorkList.push_back(¯o->subPieces);
|
| RegionStore.cpp | 485 WorkList;
489 WorkList WL;
662 // Get the old binding. Is it a region? If so, add it to the worklist.
783 // Add the regions to the worklist.
[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 | 403 // Run the worklist algorithm to generate the DFA.
444 // Run a worklist algorithm to generate the DFA.
451 SmallVector<State*, 32> WorkList;
454 WorkList.push_back(Initial);
457 // Worklist algorithm to create a DFA for processor resource tracking.
459 // Begin with initial node in worklist. Initial node does not have
463 // While worklist != empty
464 // S = first element of worklist
470 // Add S' to worklist
473 while (!WorkList.empty())
[all...] |
| /external/llvm/lib/CodeGen/ |
| LiveVariables.cpp | 93 std::vector<MachineBasicBlock*> &WorkList) {
113 WorkList.insert(WorkList.end(), MBB->pred_rbegin(), MBB->pred_rend());
119 std::vector<MachineBasicBlock*> WorkList;
120 MarkVirtRegAliveInBlock(VRInfo, DefBlock, MBB, WorkList);
122 while (!WorkList.empty()) {
123 MachineBasicBlock *Pred = WorkList.back();
124 WorkList.pop_back();
125 MarkVirtRegAliveInBlock(VRInfo, DefBlock, Pred, WorkList);
|
| MachineCSE.cpp | 560 SmallVector<MachineDomTreeNode*, 8> WorkList;
567 WorkList.push_back(Node);
569 Node = WorkList.pop_back_val();
577 WorkList.push_back(Child);
579 } 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...] |
| 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/llvm/lib/Transforms/Utils/ |
| LoopSimplify.cpp | 445 std::vector<BasicBlock *> WorkList;
446 WorkList.push_back(InputBB);
448 BasicBlock *BB = WorkList.back(); WorkList.pop_back();
454 WorkList.push_back(WBB);
456 } while(!WorkList.empty());
|
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| DwarfDebug.cpp | [all...] |
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| SelectionDAGBuilder.cpp | [all...] |
