/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 | 102 // Start out with all of the instructions in the worklist... 103 std::vector<Instruction*> WorkList; 105 WorkList.push_back(&*i); 107 // Loop over the worklist finding instructions that are dead. If they are 109 // potentially dead, and work until the worklist is empty. 112 while (!WorkList.empty()) { 113 Instruction *I = WorkList.back(); 114 WorkList.pop_back(); 118 // instructions being used, add them to the worklist, because they might 123 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...] |
AlignmentFromAssumptions.cpp | 312 SmallVector<Instruction*, 16> WorkList; 319 WorkList.push_back(K); 322 while (!WorkList.empty()) { 323 Instruction *J = WorkList.pop_back_val(); 403 WorkList.push_back(K);
|
/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());
|
InlineSpiller.cpp | 364 SmallSetVector<SibValueMap::value_type *, 8> WorkList; 365 WorkList.insert(SVI); 368 SVI = WorkList.pop_back_val(); 472 WorkList.insert(&*DepSVI); 477 } while (!WorkList.empty()); 508 SmallVector<std::pair<unsigned, VNInfo*>, 8> WorkList; 509 WorkList.push_back(std::make_pair(UseReg, UseVNI)); 515 std::tie(Reg, VNI) = WorkList.pop_back_val(); 567 // Create entries for all the PHIs. Don't add them to the worklist, we 581 // This is the first time we see NonPHI, add it to the worklist [all...] |
LiveIntervalAnalysis.cpp | 348 ShrinkToUsesWorkList &WorkList, 352 // Blocks that have already been added to WorkList as live-out. 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)); 394 WorkList.push_back(std::make_pair(Stop, VNI)); 414 ShrinkToUsesWorkList WorkList; [all...] |
MachineLICM.cpp | 371 SmallVector<MachineLoop *, 8> Worklist(MLI->begin(), MLI->end()); 372 while (!Worklist.empty()) { 373 CurLoop = Worklist.pop_back_val(); 380 Worklist.append(CurLoop->begin(), CurLoop->end()); 715 SmallVector<MachineDomTreeNode*, 8> WorkList; 720 WorkList.push_back(HeaderN); 721 while (!WorkList.empty()) { 722 MachineDomTreeNode *Node = WorkList.pop_back_val(); 747 // Add children in reverse order as then the next popped worklist node is 753 WorkList.push_back(Child) [all...] |
RegisterCoalescer.cpp | 111 SmallVector<MachineInstr*, 8> WorkList; 115 /// that may be present in WorkList. 137 /// copies that cannot yet be coalesced into WorkList. 447 // 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 | 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 | 216 SmallVector<const PathPieces *, 5> WorkList; 217 WorkList.push_back(&D->path); 219 while (!WorkList.empty()) { 220 const PathPieces &path = *WorkList.pop_back_val(); 246 WorkList.push_back(&call->path); 250 WorkList.push_back(¯o->subPieces); [all...] |
RegionStore.cpp | 632 /// initial worklist of a ClusterAnalysis. 647 typedef SmallVector<WorkListElement, 10> WorkList; 651 WorkList WL; [all...] |
/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) {
|
/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/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/Target/R600/ |
AMDGPUPromoteAlloca.cpp | 165 std::vector<Value*> WorkList; 172 WorkList.push_back(AllocaUser); 190 WorkList.push_back(GEPUser); 199 for (std::vector<Value*>::iterator I = WorkList.begin(), 200 E = WorkList.end(); I != E; ++I) { 238 static bool collectUsesWithPtrTypes(Value *Val, std::vector<Value*> &WorkList) { 241 if(std::find(WorkList.begin(), WorkList.end(), User) != WorkList.end()) 244 WorkList.push_back(User) [all...] |
/external/llvm/lib/Transforms/IPO/ |
ArgumentPromotion.cpp | 176 SmallVector<Value *, 16> WorkList; 177 WorkList.insert(WorkList.end(), arg->user_begin(), arg->user_end()); 178 while (!WorkList.empty()) { 179 Value *V = WorkList.back(); 180 WorkList.pop_back(); 183 WorkList.insert(WorkList.end(), V->user_begin(), V->user_end()); [all...] |
/external/llvm/lib/CodeGen/AsmPrinter/ |
DwarfDebug.cpp | [all...] |