/external/llvm/lib/Transforms/Scalar/ |
H A D | ConstantProp.cpp | 66 std::set<Instruction*> WorkList; local 68 WorkList.insert(&*i); 75 while (!WorkList.empty()) { 76 Instruction *I = *WorkList.begin(); 77 WorkList.erase(WorkList.begin()); // Get an element from the worklist... 84 WorkList.insert(cast<Instruction>(U)); 90 WorkList.erase(I);
|
H A D | DCE.cpp | 101 std::vector<Instruction*> WorkList; local 103 WorkList.push_back(&*i); 110 while (!WorkList.empty()) { 111 Instruction *I = WorkList.back(); 112 WorkList.pop_back(); 121 WorkList.push_back(Used); 127 WorkList.erase(std::remove(WorkList.begin(), WorkList.end(), I), 128 WorkList [all...] |
H A D | Reg2Mem.cpp | 92 std::list<Instruction*> WorkList; local 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 [all...] |
H A D | ScalarReplAggregates.cpp | 166 std::vector<AllocaInst*> &WorkList); 1467 std::vector<AllocaInst*> WorkList; local 1473 WorkList.push_back(A); 1477 while (!WorkList.empty()) { 1478 AllocaInst *AI = WorkList.back(); 1479 WorkList.pop_back(); 1509 DoScalarReplacement(AI, WorkList); 1538 std::vector<AllocaInst*> &WorkList) { 1548 WorkList.push_back(NA); // Add to worklist for recursive processing 1558 WorkList 1537 DoScalarReplacement(AllocaInst *AI, std::vector<AllocaInst*> &WorkList) argument [all...] |
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
H A D | WorkList.h | 1 //==- WorkList.h - Worklist class used by CoreEngine ---------------*- C++ -*-// 10 // This file defines WorkList, a pure virtual class that represents an opaque 61 class WorkList { class in namespace:clang::ento 64 virtual ~WorkList(); 91 static WorkList *makeDFS(); 92 static WorkList *makeBFS(); 93 static WorkList *makeBFSBlockDFSContents();
|
/external/clang/lib/Analysis/ |
H A D | PseudoConstantAnalysis.cpp | 77 std::deque<const Stmt *> WorkList; local 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()); 225 WorkList.push_back(*I); 226 } // while (!WorkList.empty())
|
H A D | ReachableCode.cpp | 347 SmallVector<const CFGBlock *, 10> WorkList; member in class:__anon17781::DeadCodeScan 380 WorkList.push_back(block); 397 WorkList.push_back(PredBlock); 448 while (!WorkList.empty()) { 449 const CFGBlock *Block = WorkList.pop_back_val();
|
/external/llvm/lib/CodeGen/ |
H A D | ProcessImplicitDefs.cpp | 32 SmallSetVector<MachineInstr*, 16> WorkList; member in class:__anon25785::ProcessImplicitDefs 90 WorkList.insert(UserMI); 145 assert(WorkList.empty() && "Inconsistent worklist state"); 153 WorkList.insert(MBBI); 155 if (WorkList.empty()) 158 DEBUG(dbgs() << "BB#" << MFI->getNumber() << " has " << WorkList.size() 162 // Drain the WorkList to recursively process any new implicit defs. 163 do processImplicitDef(WorkList.pop_back_val()); 164 while (!WorkList.empty());
|
H A D | MachineCSE.cpp | 629 SmallVector<MachineDomTreeNode*, 8> WorkList; local 635 WorkList.push_back(Node); 637 Node = WorkList.pop_back_val(); 644 WorkList.push_back(Child); 646 } while (!WorkList.empty());
|
H A D | LiveVariables.cpp | 95 std::vector<MachineBasicBlock*> &WorkList) { 115 WorkList.insert(WorkList.end(), MBB->pred_rbegin(), MBB->pred_rend()); 121 std::vector<MachineBasicBlock*> WorkList; local 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); 92 MarkVirtRegAliveInBlock(VarInfo& VRInfo, MachineBasicBlock *DefBlock, MachineBasicBlock *MBB, std::vector<MachineBasicBlock*> &WorkList) argument
|
H A D | MachineBlockPlacement.cpp | 215 BlockChain &Chain, SmallVectorImpl<MachineBasicBlock *> &WorkList, 424 BlockChain &Chain, SmallVectorImpl<MachineBasicBlock *> &WorkList, 430 WorkList.erase(std::remove_if(WorkList.begin(), WorkList.end(), 434 WorkList.end()); 438 for (SmallVectorImpl<MachineBasicBlock *>::iterator WBI = WorkList.begin(), 439 WBE = WorkList.end(); 423 selectBestCandidateBlock( BlockChain &Chain, SmallVectorImpl<MachineBasicBlock *> &WorkList, const BlockFilterSet *BlockFilter) argument
|
H A D | InlineSpiller.cpp | 365 SmallSetVector<SibValueMap::value_type *, 8> WorkList; 366 WorkList.insert(SVI); 369 SVI = WorkList.pop_back_val(); 473 WorkList.insert(&*DepSVI); 478 } while (!WorkList.empty()); 509 SmallVector<std::pair<unsigned, VNInfo*>, 8> WorkList; local 510 WorkList.push_back(std::make_pair(UseReg, UseVNI)); 515 std::tie(Reg, VNI) = WorkList.pop_back_val(); 581 WorkList.push_back(std::make_pair(Reg, NonPHI)); 611 WorkList 759 SmallVector<std::pair<LiveInterval*, VNInfo*>, 8> WorkList; local 823 SmallVector<std::pair<LiveInterval*, VNInfo*>, 8> WorkList; local [all...] |
H A D | LiveIntervalAnalysis.cpp | 325 SmallVector<std::pair<SlotIndex, VNInfo*>, 16> WorkList; local 327 // Blocks that have already been added to WorkList as live-out. 354 WorkList.push_back(std::make_pair(Idx, VNI)); 370 // Extend intervals to reach all uses in WorkList. 371 while (!WorkList.empty()) { 372 SlotIndex Idx = WorkList.back().first; 373 VNInfo *VNI = WorkList.back().second; 374 WorkList.pop_back(); 393 WorkList.push_back(std::make_pair(Stop, PVNI)); 410 WorkList [all...] |
H A D | MachineLICM.cpp | 696 SmallVector<MachineDomTreeNode*, 8> WorkList; local 701 WorkList.push_back(HeaderN); 703 MachineDomTreeNode *Node = WorkList.pop_back_val(); 734 WorkList.push_back(Child); 736 } while (!WorkList.empty());
|
H A D | RegisterCoalescer.cpp | 97 /// WorkList - Copy instructions yet to be coalesced. 98 SmallVector<MachineInstr*, 8> WorkList; member in class:__anon25794::RegisterCoalescer 102 /// that may be present in WorkList. 124 /// copies that cannot yet be coalesced into WorkList. 406 // MI may be in WorkList. Make sure we don't visit it. 2099 // Try joining WorkList copies starting from index From. 2128 const unsigned PrevSize = WorkList.size(); 2141 WorkList.push_back(&(*MII)); 2148 WorkList.push_back(MII); 2151 // This prevents the WorkList fro [all...] |
/external/llvm/lib/Transforms/Instrumentation/ |
H A D | BoundsChecking.cpp | 180 std::vector<Instruction*> WorkList; local 185 WorkList.push_back(I); 189 for (std::vector<Instruction*>::iterator i = WorkList.begin(), 190 e = WorkList.end(); i != e; ++i) {
|
/external/clang/lib/StaticAnalyzer/Core/ |
H A D | PlistDiagnostics.cpp | 306 SmallVector<const PathPieces *, 5> WorkList; local 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);
|
H A D | CoreEngine.cpp | 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 [all...] |
H A D | BugReporterVisitors.cpp | 1115 std::deque<const Stmt *> WorkList; local 1116 WorkList.push_back(S); 1118 while (!WorkList.empty()) { 1119 const Stmt *Head = WorkList.front(); 1120 WorkList.pop_front(); 1143 WorkList.push_back(*I);
|
H A D | PathDiagnostic.cpp | 217 SmallVector<const PathPieces *, 5> WorkList; local 218 WorkList.push_back(&D->path); 220 while (!WorkList.empty()) { 221 const PathPieces &path = *WorkList.pop_back_val(); 247 WorkList.push_back(&call->path); 251 WorkList.push_back(¯o->subPieces);
|
H A D | RegionStore.cpp | 646 typedef SmallVector<WorkListElement, 10> WorkList; typedef in class:__anon18282::ClusterAnalysis 650 WorkList WL;
|
/external/llvm/include/llvm/Transforms/Utils/ |
H A D | SSAUpdaterImpl.h | 104 SmallVector<BBInfo*, 64> WorkList; local 108 WorkList.push_back(Info); 114 while (!WorkList.empty()) { 115 Info = WorkList.pop_back_val(); 146 WorkList.push_back(PredInfo); 161 WorkList.push_back(Info); 164 while (!WorkList.empty()) { 165 Info = WorkList.back(); 173 WorkList.pop_back(); 191 WorkList 398 SmallVector<PhiT*, 20> WorkList; local [all...] |
/external/llvm/utils/TableGen/ |
H A D | DFAPacketizerEmitter.cpp | 438 SmallVector<const State*, 32> WorkList; local 441 WorkList.push_back(Initial); 460 while (!WorkList.empty()) { 461 const State *current = WorkList.pop_back_val(); 488 WorkList.push_back(NewState);
|
/external/llvm/lib/Target/R600/ |
H A D | AMDGPUPromoteAlloca.cpp | 164 std::vector<Value*> WorkList; local 171 WorkList.push_back(AllocaUser); 189 WorkList.push_back(GEPUser); 198 for (std::vector<Value*>::iterator I = WorkList.begin(), 199 E = WorkList.end(); I != E; ++I) { 237 static void collectUsesWithPtrTypes(Value *Val, std::vector<Value*> &WorkList) { argument 239 if(std::find(WorkList.begin(), WorkList.end(), User) != WorkList.end()) 242 WorkList 323 std::vector<Value*> WorkList; local [all...] |
/external/llvm/lib/CodeGen/AsmPrinter/ |
H A D | DwarfDebug.cpp | 1379 SmallVector<LexicalScope *, 4> WorkList; local 1380 WorkList.push_back(LScopes.getCurrentFunctionScope()); 1381 while (!WorkList.empty()) { 1382 LexicalScope *S = WorkList.pop_back_val(); 1386 WorkList.append(Children.begin(), Children.end());
|