/external/llvm/lib/Transforms/ObjCARC/ |
H A D | ProvenanceAnalysis.cpp | 77 SmallVector<const Value *, 8> Worklist; local 78 Worklist.push_back(P); 81 P = Worklist.pop_back_val(); 98 Worklist.push_back(Ur); 100 } while (!Worklist.empty());
|
H A D | DependencyAnalysis.cpp | 214 SmallVector<std::pair<BasicBlock *, BasicBlock::iterator>, 4> Worklist; local 215 Worklist.push_back(std::make_pair(StartBB, StartPos)); 218 Worklist.pop_back_val(); 233 Worklist.push_back(std::make_pair(PredBB, PredBB->end())); 244 } while (!Worklist.empty());
|
/external/llvm/lib/Analysis/ |
H A D | CaptureTracking.cpp | 84 SmallVector<const Use *, Threshold> Worklist; local 96 Worklist.push_back(&U); 99 while (!Worklist.empty()) { 100 const Use *U = Worklist.pop_back_val(); 157 Worklist.push_back(&UU);
|
H A D | CFG.cpp | 129 static bool isPotentiallyReachableInner(SmallVectorImpl<BasicBlock *> &Worklist, argument 143 BasicBlock *BB = Worklist.pop_back_val(); 163 Outer->getExitBlocks(Worklist); 165 Worklist.append(succ_begin(BB), succ_end(BB)); 167 } while (!Worklist.empty()); 179 SmallVector<BasicBlock*, 32> Worklist; local 180 Worklist.push_back(const_cast<BasicBlock*>(A)); 182 return isPotentiallyReachableInner(Worklist, const_cast<BasicBlock*>(B), 191 SmallVector<BasicBlock*, 32> Worklist; local 218 Worklist [all...] |
H A D | LazyCallGraph.cpp | 24 SmallVectorImpl<Constant *> &Worklist, SmallPtrSetImpl<Constant *> &Visited, 27 while (!Worklist.empty()) { 28 Constant *C = Worklist.pop_back_val(); 52 Worklist.push_back(cast<Constant>(Op)); 61 SmallVector<Constant *, 16> Worklist; local 70 Worklist.push_back(C); 75 findCallees(Worklist, Visited, Callees, CalleeIndexMap); 112 SmallVector<Constant *, 16> Worklist; local 117 Worklist.push_back(GV.getInitializer()); 121 findCallees(Worklist, Visite 23 findCallees( SmallVectorImpl<Constant *> &Worklist, SmallPtrSetImpl<Constant *> &Visited, SmallVectorImpl<PointerUnion<Function *, LazyCallGraph::Node *>> &Callees, DenseMap<Function *, size_t> &CalleeIndexMap) argument 552 SmallVector<Node *, 16> Worklist; local [all...] |
H A D | BasicAliasAnalysis.cpp | 605 SmallVector<const Value *, 16> Worklist; local 606 Worklist.push_back(Loc.Ptr); 608 const Value *V = GetUnderlyingObject(Worklist.pop_back_val(), DL); 632 Worklist.push_back(SI->getTrueValue()); 633 Worklist.push_back(SI->getFalseValue()); 646 Worklist.push_back(PN->getIncomingValue(i)); 654 } while (!Worklist.empty() && --MaxLookup); 657 return Worklist.empty();
|
H A D | MemoryDependenceAnalysis.cpp | 1031 SmallVector<BasicBlock*, 32> Worklist; local 1032 Worklist.push_back(StartBB); 1045 while (!Worklist.empty()) { 1046 BasicBlock *BB = Worklist.pop_back_val(); 1102 Worklist.append(NewBlocks.begin(), NewBlocks.end());
|
H A D | ValueTracking.cpp | 1931 SmallVector<Value *, 4> Worklist; local 1932 Worklist.push_back(V); 1934 Value *P = Worklist.pop_back_val(); 1941 Worklist.push_back(SI->getTrueValue()); 1942 Worklist.push_back(SI->getFalseValue()); 1948 Worklist.push_back(PN->getIncomingValue(i)); 1953 } while (!Worklist.empty());
|
H A D | InstructionSimplify.cpp | 3197 SmallSetVector<Instruction *, 8> Worklist; local 3204 Worklist.insert(cast<Instruction>(U)); 3214 Worklist.insert(I); 3218 for (unsigned Idx = 0; Idx != Worklist.size(); ++Idx) { 3219 I = Worklist[Idx]; 3232 Worklist.insert(cast<Instruction>(U));
|
/external/llvm/lib/Transforms/InstCombine/ |
H A D | InstCombineWorklist.h | 1 //===- InstCombineWorklist.h - Worklist for InstCombine pass ----*- C++ -*-===// 27 SmallVector<Instruction*, 256> Worklist; member in class:llvm::InstCombineWorklist 35 bool isEmpty() const { return Worklist.empty(); } 40 if (WorklistMap.insert(std::make_pair(I, Worklist.size())).second) { 42 Worklist.push_back(I); 55 assert(Worklist.empty() && "Worklist must be empty to add initial group"); 56 Worklist.reserve(NumEntries+16); 62 Worklist.push_back(I); 72 Worklist[I [all...] |
H A D | InstCombine.h | 73 InstCombineWorklist &Worklist; member in class:llvm::InstCombineIRInserter 76 InstCombineIRInserter(InstCombineWorklist &WL) : Worklist(WL) {} 81 Worklist.Add(I); 96 /// Worklist - All of the instructions that need to be simplified. 97 InstCombineWorklist Worklist; member in class:llvm::InstCombiner 264 Worklist.Add(New); 283 Worklist.AddUsersToWorkList(I); // Add all modified instrs to worklist. 310 Worklist.Add(Op); 312 Worklist.Remove(&I);
|
/external/llvm/include/llvm/Support/ |
H A D | GenericDomTreeConstruction.h | 57 typename GraphT::ChildIteratorType>, 32> Worklist; local 58 Worklist.push_back(std::make_pair(V, GraphT::child_begin(V))); 59 while (!Worklist.empty()) { 60 typename GraphT::NodeType* BB = Worklist.back().first; 61 typename GraphT::ChildIteratorType NextSucc = Worklist.back().second; 85 Worklist.pop_back(); 90 ++Worklist.back().second; 99 Worklist.push_back(std::make_pair(Succ, GraphT::child_begin(Succ)));
|
/external/llvm/include/llvm/Analysis/ |
H A D | PtrUseVisitor.h | 124 SmallVector<UseToVisit, 8> Worklist; member in class:llvm::detail::PtrUseVisitorBase 217 while (!Worklist.empty()) { 218 UseToVisit ToVisit = Worklist.pop_back_val();
|
H A D | ScalarEvolutionExpressions.h | 576 SmallVector<const SCEV *, 8> Worklist; member in class:llvm::SCEVTraversal 581 Worklist.push_back(S); 588 while (!Worklist.empty() && !Visitor.isDone()) { 589 const SCEV *S = Worklist.pop_back_val();
|
/external/llvm/lib/CodeGen/SelectionDAG/ |
H A D | LegalizeTypes.h | 116 /// Worklist - This defines a worklist of nodes to process. In order to be 119 SmallVector<SDNode*, 128> Worklist; member in class:llvm::DAGTypeLegalizer
|
H A D | SelectionDAGISel.cpp | 609 SmallVector<SDNode*, 128> Worklist; local 611 Worklist.push_back(CurDAG->getRoot().getNode()); 617 SDNode *N = Worklist.pop_back_val(); 626 Worklist.push_back(N->getOperand(i).getNode()); 645 } while (!Worklist.empty());
|
/external/llvm/lib/Transforms/Utils/ |
H A D | LoopSimplify.cpp | 195 SmallVector<BasicBlock *, 8> Worklist; local 196 Worklist.push_back(InputBB); 198 BasicBlock *BB = Worklist.pop_back_val(); 204 Worklist.push_back(WBB); 206 } while (!Worklist.empty()); 475 static bool simplifyOneLoop(Loop *L, SmallVectorImpl<Loop *> &Worklist, argument 589 Worklist.push_back(OuterL); 718 // Worklist maintains our depth-first queue of loops in this nest to process. 719 SmallVector<Loop *, 4> Worklist; local 720 Worklist [all...] |
H A D | PromoteMemoryToRegister.cpp | 309 std::vector<RenamePassData> &Worklist); 577 SmallVector<DomTreeNode *, 32> Worklist; local 581 Worklist.push_back(Root); 583 while (!Worklist.empty()) { 584 DomTreeNode *Node = Worklist.pop_back_val(); 589 Worklist.push_back(*CI); 869 SmallVector<DomTreeNode *, 32> Worklist; local 881 Worklist.clear(); 882 Worklist.push_back(Root); 884 while (!Worklist 960 RenamePass(BasicBlock *BB, BasicBlock *Pred, RenamePassData::ValVector &IncomingVals, std::vector<RenamePassData> &Worklist) argument [all...] |
H A D | Local.cpp | 1170 SmallVector<BasicBlock*, 128> Worklist; local 1171 Worklist.push_back(BB); 1175 BB = Worklist.pop_back_val(); 1236 Worklist.push_back(*SI); 1237 } while (!Worklist.empty());
|
/external/llvm/lib/MC/MCAnalysis/ |
H A D | MCObjectDisassembler.cpp | 267 SmallSetVector<BBInfo*, 16> Worklist; local 268 Worklist.insert(&BBI); 269 for (size_t wi = 0; wi < Worklist.size(); ++wi) { 270 BBInfo *BBI = Worklist[wi]; 277 Worklist.insert(*SI); 280 Worklist.insert(*PI); 284 for (size_t wi = 0; wi < Worklist.size(); ++wi) { 285 BBInfo *BBI = Worklist[wi]; 323 AddrWorklistTy Worklist; local 325 Worklist [all...] |
/external/llvm/lib/Transforms/IPO/ |
H A D | FunctionAttrs.cpp | 414 SmallVector<Use*, 32> Worklist; local 430 Worklist.push_back(&U); 433 while (!Worklist.empty()) { 434 Use *U = Worklist.pop_back_val(); 447 Worklist.push_back(&UU); 461 Worklist.push_back(&UU);
|
H A D | MergeFunctions.cpp | 1079 bool doSanityCheck(std::vector<WeakVH> &Worklist); 1132 bool MergeFunctions::doSanityCheck(std::vector<WeakVH> &Worklist) { argument 1140 for (std::vector<WeakVH>::iterator I = Worklist.begin(), E = Worklist.end(); 1215 std::vector<WeakVH> Worklist; local 1216 Deferred.swap(Worklist); 1218 DEBUG(doSanityCheck(Worklist)); 1221 DEBUG(dbgs() << "size of worklist: " << Worklist.size() << '\n'); 1225 for (std::vector<WeakVH>::iterator I = Worklist.begin(), 1226 E = Worklist 1468 std::vector<Value *> Worklist; local [all...] |
/external/llvm/lib/Transforms/Scalar/ |
H A D | TailRecursionElimination.cpp | 173 SmallVector<Use *, 32> Worklist; local 180 Worklist.push_back(&U); 186 while (!Worklist.empty()) { 187 Use *U = Worklist.pop_back_val();
|
H A D | LoopUnswitch.cpp | 206 void SimplifyCode(std::vector<Instruction*> &Worklist, Loop *L); 914 std::vector<Instruction*> &Worklist) { 916 Worklist.erase(std::remove(Worklist.begin(), Worklist.end(), I), 917 Worklist.end()); 923 std::vector<Instruction*> &Worklist, 930 Worklist.push_back(Use); 934 Worklist.push_back(cast<Instruction>(U)); 936 RemoveFromWorklist(I, Worklist); 913 RemoveFromWorklist(Instruction *I, std::vector<Instruction*> &Worklist) argument 922 ReplaceUsesOfWith(Instruction *I, Value *V, std::vector<Instruction*> &Worklist, Loop *L, LPPassManager *LPM) argument 959 std::vector<Instruction*> Worklist; local 1071 SimplifyCode(std::vector<Instruction*> &Worklist, Loop *L) argument [all...] |
H A D | Reassociate.cpp | 512 // Worklist of non-leaf nodes (their operands are in the expression too) along 516 SmallVector<std::pair<BinaryOperator*, APInt>, 8> Worklist; // (Op, Weight) local 517 Worklist.push_back(std::make_pair(I, APInt(Bitwidth, 1))); 542 while (!Worklist.empty()) { 543 std::pair<BinaryOperator*, APInt> P = Worklist.pop_back_val(); 557 Worklist.push_back(std::make_pair(BO, Weight)); 595 Worklist.push_back(std::make_pair(BO, It->second)); 627 Worklist.push_back(std::make_pair(BO, Weight));
|