/external/llvm/lib/Transforms/Scalar/ |
H A D | ConstantProp.cpp | 65 std::set<Instruction*> WorkList; local 67 WorkList.insert(&*i); 73 while (!WorkList.empty()) { 74 Instruction *I = *WorkList.begin(); 75 WorkList.erase(WorkList.begin()); // Get an element from the worklist... 83 WorkList.insert(cast<Instruction>(*UI)); 89 WorkList.erase(I);
|
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 | DCE.cpp | 95 std::vector<Instruction*> WorkList; local 97 WorkList.push_back(&*i); 104 while (!WorkList.empty()) { 105 Instruction *I = WorkList.back(); 106 WorkList.pop_back(); 115 WorkList.push_back(Used); 121 for (std::vector<Instruction*>::iterator WI = WorkList.begin(); 122 WI != WorkList.end(); ) { 124 WI = WorkList.erase(WI);
|
H A D | CodeGenPrepare.cpp | 187 SmallPtrSet<BasicBlock*, 8> WorkList; local 196 WorkList.insert(*II); 200 I = WorkList.begin(), E = WorkList.end(); I != E; ++I)
|
/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 63 class WorkList { class in namespace:clang::ento 66 virtual ~WorkList(); 93 static WorkList *makeDFS(); 94 static WorkList *makeBFS(); 95 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(); 215 WorkList.push_back(B->getBody()); 226 WorkList.push_back(*I); 227 } // while (!WorkList.empty())
|
H A D | ReachableCode.cpp | 32 llvm::SmallVector<const CFGBlock *, 10> WorkList; member in class:__anon3546::DeadCodeScan 62 WorkList.push_back(block); 79 WorkList.push_back(PredBlock); 125 while (!WorkList.empty()) { 126 const CFGBlock *Block = WorkList.pop_back_val();
|
/external/llvm/lib/CodeGen/ |
H A D | ProcessImplicitDefs.cpp | 32 SmallSetVector<MachineInstr*, 16> WorkList; member in class:__anon8698::ProcessImplicitDefs 93 WorkList.insert(UserMI); 148 assert(WorkList.empty() && "Inconsistent worklist state"); 156 WorkList.insert(MBBI); 158 if (WorkList.empty()) 161 DEBUG(dbgs() << "BB#" << MFI->getNumber() << " has " << WorkList.size() 165 // Drain the WorkList to recursively process any new implicit defs. 166 do processImplicitDef(WorkList.pop_back_val()); 167 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 | 201 BlockChain &Chain, SmallVectorImpl<MachineBasicBlock *> &WorkList, 426 BlockChain &Chain, SmallVectorImpl<MachineBasicBlock *> &WorkList, 432 WorkList.erase(std::remove_if(WorkList.begin(), WorkList.end(), 434 WorkList.end()); 438 for (SmallVectorImpl<MachineBasicBlock *>::iterator WBI = WorkList.begin(), 439 WBE = WorkList.end(); 425 selectBestCandidateBlock( BlockChain &Chain, SmallVectorImpl<MachineBasicBlock *> &WorkList, const BlockFilterSet *BlockFilter) argument
|
H A D | MachineCSE.cpp | 599 SmallVector<MachineDomTreeNode*, 8> WorkList; local 605 WorkList.push_back(Node); 607 Node = WorkList.pop_back_val(); 614 WorkList.push_back(Child); 616 } while (!WorkList.empty());
|
H A D | InlineSpiller.cpp | 357 SmallVector<SibValueMap::iterator, 8> WorkList(1, SVI); 361 SVI = WorkList.pop_back_val(); 454 WorkList.push_back(DepSVI); 459 } while (!WorkList.empty()); 490 SmallVector<std::pair<unsigned, VNInfo*>, 8> WorkList; local 491 WorkList.push_back(std::make_pair(UseReg, UseVNI)); 496 tie(Reg, VNI) = WorkList.pop_back_val(); 562 WorkList.push_back(std::make_pair(Reg, NonPHI)); 592 WorkList.push_back(std::make_pair(SrcReg, SrcVNI)); 614 } while (!WorkList 740 SmallVector<std::pair<LiveInterval*, VNInfo*>, 8> WorkList; local 802 SmallVector<std::pair<LiveInterval*, VNInfo*>, 8> WorkList; local [all...] |
H A D | LiveIntervalAnalysis.cpp | 612 SmallVector<std::pair<SlotIndex, VNInfo*>, 16> WorkList; local 614 // Blocks that have already been added to WorkList as live-out. 639 WorkList.push_back(std::make_pair(Idx, VNI)); 655 // Extend intervals to reach all uses in WorkList. 656 while (!WorkList.empty()) { 657 SlotIndex Idx = WorkList.back().first; 658 VNInfo *VNI = WorkList.back().second; 659 WorkList.pop_back(); 678 WorkList.push_back(std::make_pair(Stop, PVNI)); 695 WorkList [all...] |
H A D | MachineLICM.cpp | 692 SmallVector<MachineDomTreeNode*, 8> WorkList; local 697 WorkList.push_back(HeaderN); 699 MachineDomTreeNode *Node = WorkList.pop_back_val(); 730 WorkList.push_back(Child); 732 } while (!WorkList.empty());
|
H A D | RegisterCoalescer.cpp | 83 /// WorkList - Copy instructions yet to be coalesced. 84 SmallVector<MachineInstr*, 8> WorkList; member in class:__anon8709::RegisterCoalescer 87 /// that may be present in WorkList. 106 /// copies that cannot yet be coalesced into WorkList. 109 /// copyCoalesceWorkList - Try to coalesce all copies in WorkList after 377 // MI may be in WorkList. Make sure we don't visit it. 1469 // Try joining WorkList copies starting from index From. 1472 assert(From <= WorkList.size() && "Out of range"); 1474 for (unsigned i = From, e = WorkList.size(); i != e; ++i) { 1475 if (!WorkList[ [all...] |
/external/llvm/tools/llvm-objdump/ |
H A D | MCFunction.cpp | 44 SmallVector<uint64_t, 16> WorkList; local 45 WorkList.push_back(Start); 47 while (!WorkList.empty()) { 48 uint64_t Index = WorkList.pop_back_val(); 67 WorkList.push_back(targ); 68 WorkList.push_back(Index+Size);
|
/external/llvm/include/llvm/Transforms/Utils/ |
H A D | SSAUpdaterImpl.h | 102 SmallVector<BBInfo*, 64> WorkList; local 106 WorkList.push_back(Info); 112 while (!WorkList.empty()) { 113 Info = WorkList.pop_back_val(); 144 WorkList.push_back(PredInfo); 159 WorkList.push_back(Info); 162 while (!WorkList.empty()) { 163 Info = WorkList.back(); 171 WorkList.pop_back(); 189 WorkList 396 SmallVector<PhiT*, 20> WorkList; local [all...] |
/external/llvm/lib/Transforms/Instrumentation/ |
H A D | BoundsChecking.cpp | 182 std::vector<Instruction*> WorkList; local 187 WorkList.push_back(I); 191 for (std::vector<Instruction*>::iterator i = WorkList.begin(), 192 e = WorkList.end(); i != e; ++i) {
|
/external/llvm/utils/TableGen/ |
H A D | DFAPacketizerEmitter.cpp | 445 SmallVector<State*, 32> WorkList; local 448 WorkList.push_back(Initial); 467 while (!WorkList.empty()) { 468 State *current = WorkList.pop_back_val(); 496 WorkList.push_back(NewState);
|
/external/clang/include/clang/Analysis/FlowSensitive/ |
H A D | DataflowSolver.h | 201 while (!WorkList.isEmpty()) { 202 const CFGBlock *B = WorkList.dequeue(); 213 WorkList.enqueue(&**I); 222 WorkList.enqueue(&**I); 328 WorkList.enqueue(TargetBlock); 332 WorkList.enqueue(TargetBlock); 338 DataflowWorkListTy WorkList; member in class:clang::DataflowSolver
|
/external/clang/lib/StaticAnalyzer/Core/ |
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 | PlistDiagnostics.cpp | 362 llvm::SmallVector<const PathPieces *, 5> WorkList; local 363 WorkList.push_back(&D->path); 365 while (!WorkList.empty()) { 366 const PathPieces &path = *WorkList.back(); 367 WorkList.pop_back(); 387 WorkList.push_back(&call->path); 391 WorkList.push_back(¯o->subPieces);
|
H A D | BugReporterVisitors.cpp | 584 std::deque<const Stmt *> WorkList; local 585 WorkList.push_back(S); 587 while (!WorkList.empty()) { 588 const Stmt *Head = WorkList.front(); 589 WorkList.pop_front(); 611 WorkList.push_back(*I);
|
H A D | PathDiagnostic.cpp | 143 llvm::SmallVector<const PathPieces *, 5> WorkList; local 144 WorkList.push_back(&D->path); 146 while (!WorkList.empty()) { 147 const PathPieces &path = *WorkList.back(); 148 WorkList.pop_back(); 174 WorkList.push_back(&call->path); 178 WorkList.push_back(¯o->subPieces);
|
/external/llvm/lib/Transforms/Utils/ |
H A D | LoopSimplify.cpp | 445 std::vector<BasicBlock *> WorkList; local 446 WorkList.push_back(InputBB); 448 BasicBlock *BB = WorkList.back(); WorkList.pop_back(); 454 WorkList.push_back(WBB); 456 } while(!WorkList.empty());
|