/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); 74 while (!WorkList.empty()) { 75 Instruction *I = *WorkList.begin(); 76 WorkList.erase(WorkList.begin()); // Get an element from the worklist... 80 // Add all of the users of this instruction to the worklist, they might 83 WorkList.insert(cast<Instruction>(U)) [all...] |
DCE.cpp | 97 SmallSetVector<Instruction *, 16> &WorkList, 114 WorkList.insert(OpI); 132 SmallSetVector<Instruction *, 16> WorkList; 133 // Iterate over the original function, only adding insts to the worklist 135 // the worklist with the entire function's worth of instructions. 141 // worklist from an earlier visit. 142 if (!WorkList.count(I)) 143 MadeChange |= DCEInstruction(I, WorkList, TLI); 146 while (!WorkList.empty()) { 147 Instruction *I = WorkList.pop_back_val() [all...] |
Reg2Mem.cpp | 91 std::list<Instruction*> WorkList; 98 WorkList.push_front(&*iib); 103 NumRegsDemoted += WorkList.size(); 104 for (std::list<Instruction*>::iterator ilb = WorkList.begin(), 105 ile = WorkList.end(); ilb != ile; ++ilb) 108 WorkList.clear(); 116 WorkList.push_front(&*iib); 119 NumPhisDemoted += WorkList.size(); 120 for (std::list<Instruction*>::iterator ilb = WorkList.begin(), 121 ile = WorkList.end(); ilb != ile; ++ilb [all...] |
AlignmentFromAssumptions.cpp | 315 SmallVector<Instruction*, 16> WorkList; 322 WorkList.push_back(K); 325 while (!WorkList.empty()) { 326 Instruction *J = WorkList.pop_back_val(); 406 WorkList.push_back(K);
|
DeadStoreElimination.cpp | 667 SmallVector<BasicBlock *, 16> WorkList; 677 WorkList.push_back(SecondBB); 681 while (!WorkList.empty()) { 682 BasicBlock *B = WorkList.pop_back_val(); 712 WorkList.push_back(*PredI); [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 | 33 SmallSetVector<MachineInstr*, 16> WorkList; 91 WorkList.insert(UserMI); 146 assert(WorkList.empty() && "Inconsistent worklist state"); 154 WorkList.insert(&*MBBI); 156 if (WorkList.empty()) 159 DEBUG(dbgs() << "BB#" << MFI->getNumber() << " has " << WorkList.size() 163 // Drain the WorkList to recursively process any new implicit defs. 164 do processImplicitDef(WorkList.pop_back_val()); 165 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 | 677 SmallVector<MachineDomTreeNode*, 8> WorkList; 683 WorkList.push_back(Node); 685 Node = WorkList.pop_back_val(); 692 WorkList.push_back(Child); 694 } while (!WorkList.empty());
|
PrologEpilogInserter.cpp | 381 SmallVector<MachineBasicBlock *, 8> WorkList; 389 WorkList.push_back(Entry); 399 WorkList.push_back(Restore); 401 while (!WorkList.empty()) { 402 const MachineBasicBlock *CurBB = WorkList.pop_back_val(); 411 WorkList.push_back(SuccBB); [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(SubStmt); 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 | 38 // Worklist classes for exploration of reachable states. 41 WorkList::Visitor::~Visitor() {} 44 class DFS : public WorkList { 72 class BFS : public WorkList { 101 // Place the dstor for WorkList here because it contains virtual member 103 WorkList::~WorkList() {} 105 WorkList *WorkList::makeDFS() { return new DFS(); } 106 WorkList *WorkList::makeBFS() { return new BFS(); [all...] |
BugReporterVisitors.cpp | [all...] |
PathDiagnostic.cpp | 214 SmallVector<const PathPieces *, 5> WorkList; 215 WorkList.push_back(&D->path); 217 while (!WorkList.empty()) { 218 const PathPieces &path = *WorkList.pop_back_val(); 244 WorkList.push_back(&call->path); 248 WorkList.push_back(¯o->subPieces); [all...] |
/external/llvm/lib/Target/PowerPC/ |
PPCBoolRetToInt.cpp | 63 SmallVector<Value *, 8> WorkList; 64 WorkList.push_back(V); 66 while (!WorkList.empty()) { 67 Value *Curr = WorkList.back(); 68 WorkList.pop_back(); 72 WorkList.push_back(Op);
|
/external/llvm/lib/Transforms/Instrumentation/ |
BoundsChecking.cpp | 179 std::vector<Instruction*> WorkList; 184 WorkList.push_back(I); 188 for (std::vector<Instruction*>::iterator i = WorkList.begin(), 189 e = WorkList.end(); i != e; ++i) {
|
SafeStack.cpp | 257 SmallVector<const Value *, 8> WorkList; 258 WorkList.push_back(AllocaPtr); 261 while (!WorkList.empty()) { 262 const Value *V = WorkList.pop_back_val(); 336 WorkList.push_back(cast<const Instruction>(I));
|
PGOInstrumentation.cpp | 463 // Use a worklist as we will update the vector during the iteration. 464 std::vector<PGOUseEdge *> WorkList; 466 WorkList.push_back(E.get()); 469 for (auto &E : WorkList) {
|
/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/AMDGPU/ |
AMDGPUPromoteAlloca.cpp | 169 std::vector<Value*> WorkList; 176 WorkList.push_back(AllocaUser); 194 WorkList.push_back(GEPUser); 203 for (std::vector<Value*>::iterator I = WorkList.begin(), 204 E = WorkList.end(); I != E; ++I) { 242 static bool collectUsesWithPtrTypes(Value *Val, std::vector<Value*> &WorkList) { 245 if(std::find(WorkList.begin(), WorkList.end(), User) != WorkList.end()) 253 WorkList.push_back(User) [all...] |
/external/llvm/lib/Target/WebAssembly/ |
WebAssemblyPEI.cpp | 397 SmallVector<MachineBasicBlock *, 8> WorkList; 405 WorkList.push_back(Entry); 415 WorkList.push_back(Restore); 417 while (!WorkList.empty()) { 418 const MachineBasicBlock *CurBB = WorkList.pop_back_val(); 427 WorkList.push_back(SuccBB); [all...] |
/external/llvm/lib/Transforms/IPO/ |
ArgumentPromotion.cpp | 182 SmallVector<Value *, 16> WorkList; 183 WorkList.insert(WorkList.end(), arg->user_begin(), arg->user_end()); 184 while (!WorkList.empty()) { 185 Value *V = WorkList.back(); 186 WorkList.pop_back(); 189 WorkList.insert(WorkList.end(), V->user_begin(), V->user_end()); [all...] |
/external/llvm/utils/TableGen/ |
DFAPacketizerEmitter.cpp | 836 // Run the worklist algorithm to generate the DFA. 891 // Run a worklist algorithm to generate the DFA. 897 SmallVector<const State*, 32> WorkList; 898 // std::queue<State*> WorkList; 901 WorkList.push_back(Initial); 904 // Worklist algorithm to create a DFA for processor resource tracking. 906 // Begin with initial node in worklist. Initial node does not have 910 // While worklist != empty 911 // S = first element of worklist [all...] |