/external/llvm/include/llvm/Transforms/InstCombine/ |
InstCombine.h | 28 InstCombineWorklist Worklist; 35 InstCombinePass(InstCombinePass &&Arg) : Worklist(std::move(Arg.Worklist)) {} 37 Worklist = std::move(RHS.Worklist);
|
InstCombineWorklist.h | 1 //===- InstCombineWorklist.h - Worklist for InstCombine pass ----*- C++ -*-===// 24 /// InstCombineWorklist - This is the worklist management logic for 27 SmallVector<Instruction*, 256> Worklist; 36 : Worklist(std::move(Arg.Worklist)), 39 Worklist = std::move(RHS.Worklist); 44 bool isEmpty() const { return Worklist.empty(); } 46 /// Add - Add the specified instruction to the worklist if it isn't already 49 if (WorklistMap.insert(std::make_pair(I, Worklist.size())).second) [all...] |
/external/llvm/lib/Transforms/Scalar/ |
ADCE.cpp | 38 SmallVector<Instruction*, 128> Worklist; 45 Worklist.push_back(&I); 50 while (!Worklist.empty()) { 51 Instruction *Curr = Worklist.pop_back_val(); 55 Worklist.push_back(Inst); 62 // NOTE: We reuse the Worklist vector here for memory efficiency. 65 Worklist.push_back(&I); 70 for (Instruction *&I : Worklist) { 75 return !Worklist.empty();
|
BDCE.cpp | 66 SmallVector<Instruction*, 128> Worklist; 86 Worklist.push_back(&I); 91 for (Instruction *&I : Worklist) {
|
LoopInterchange.cpp | 289 // Discard all loops above it added into Worklist. 459 // Build up a worklist of loop pairs to analyze. 460 SmallVector<LoopVector, 8> Worklist; 463 populateWorklist(*L, Worklist); 465 DEBUG(dbgs() << "Worklist size = " << Worklist.size() << "\n"); 467 while (!Worklist.empty()) { 468 LoopVector LoopList = Worklist.pop_back_val(); [all...] |
/external/llvm/include/llvm/Transforms/Scalar/ |
SROA.h | 59 /// \brief Worklist of alloca instructions to simplify. 66 SetVector<AllocaInst *, SmallVector<AllocaInst *, 16>> Worklist; 73 /// \brief Post-promotion worklist. 86 /// \brief A worklist of PHIs to speculate prior to promoting allocas. 93 /// \brief A worklist of select instructions to speculate prior to promoting
|
/external/llvm/lib/Analysis/ |
EHPersonalities.cpp | 49 SmallVector<std::pair<BasicBlock *, BasicBlock *>, 16> Worklist; 66 Worklist.push_back({EntryBlock, EntryBlock}); 68 while (!Worklist.empty()) { 71 std::tie(Visiting, Color) = Worklist.pop_back_val(); 103 Worklist.push_back({Succ, SuccColor});
|
IteratedDominanceFrontier.cpp | 42 SmallVector<DomTreeNode *, 32> Worklist; 57 Worklist.clear(); 58 Worklist.push_back(Root); 61 while (!Worklist.empty()) { 62 DomTreeNode *Node = Worklist.pop_back_val(); 91 Worklist.push_back(DomChild);
|
CFG.cpp | 131 SmallVectorImpl<BasicBlock *> &Worklist, BasicBlock *StopBB, 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; 180 Worklist.push_back(const_cast<BasicBlock*>(A)); 182 return isPotentiallyReachableFromMany(Worklist, const_cast<BasicBlock *>(B), 191 SmallVector<BasicBlock*, 32> Worklist; 219 Worklist.append(succ_begin(BB), succ_end(BB)) [all...] |
CaptureTracking.cpp | 102 SmallVector<BasicBlock*, 32> Worklist; 103 Worklist.append(succ_begin(BB), succ_end(BB)); 104 return !isPotentiallyReachableFromMany(Worklist, BB, DT); 215 SmallVector<const Use *, Threshold> Worklist; 227 Worklist.push_back(&U); 230 while (!Worklist.empty()) { 231 const Use *U = Worklist.pop_back_val(); 289 Worklist.push_back(&UU);
|
DemandedBits.cpp | 272 SmallVector<Instruction*, 128> Worklist; 287 Worklist.push_back(&I); 298 Worklist.push_back(J); 308 while (!Worklist.empty()) { 309 Instruction *UserI = Worklist.pop_back_val(); 354 Worklist.push_back(I); 357 Worklist.push_back(I);
|
DivergenceAnalysis.cpp | 103 // users to Worklist. 111 std::vector<Value *> Worklist; // Stack for DFS. 116 Worklist.clear(); 120 Worklist.push_back(&I); 126 Worklist.push_back(&Arg); 151 Worklist.push_back(&*I); 196 Worklist.push_back(UserInst); 236 Worklist.push_back(UserInst); 242 while (!Worklist.empty()) { 243 Value *V = Worklist.back() [all...] |
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; 64 // instructions and add every operand which is a constant to the worklist. 70 Worklist.push_back(C); 75 findCallees(Worklist, Visited, Callees, CalleeIndexMap); 112 SmallVector<Constant *, 16> Worklist; 117 Worklist.push_back(GV.getInitializer()) [all...] |
VectorUtils.cpp | 450 SmallVector<Value *, 16> Worklist; 472 // don't add it to the worklist. 476 Worklist.push_back(&I); 481 if (Worklist.empty() || (TTI && !SeenExtFromIllegalType)) 485 while (!Worklist.empty()) { 486 Value *Val = Worklist.pop_back_val(); 533 Worklist.push_back(O);
|
/external/llvm/lib/Transforms/ObjCARC/ |
ProvenanceAnalysis.cpp | 78 SmallVector<const Value *, 8> Worklist; 79 Worklist.push_back(P); 82 P = Worklist.pop_back_val(); 99 Worklist.push_back(Ur); 101 } while (!Worklist.empty());
|
DependencyAnalysis.cpp | 231 SmallVector<std::pair<BasicBlock *, BasicBlock::iterator>, 4> Worklist; 232 Worklist.push_back(std::make_pair(StartBB, StartPos)); 235 Worklist.pop_back_val(); 246 // Add the predecessors to the worklist. 250 Worklist.push_back(std::make_pair(PredBB, PredBB->end())); 261 } while (!Worklist.empty());
|
/external/llvm/include/llvm/Support/ |
GenericDomTreeConstruction.h | 56 typename GraphT::ChildIteratorType>, 32> Worklist; 57 Worklist.push_back(std::make_pair(V, GraphT::child_begin(V))); 58 while (!Worklist.empty()) { 59 typename GraphT::NodeType* BB = Worklist.back().first; 60 typename GraphT::ChildIteratorType NextSucc = Worklist.back().second; 82 // If we are done with this block, remove it from the worklist. 84 Worklist.pop_back(); 89 ++Worklist.back().second; 98 Worklist.push_back(std::make_pair(Succ, GraphT::child_begin(Succ)));
|
/external/llvm/include/llvm/Analysis/ |
PtrUseVisitor.h | 115 /// This is used to maintain a worklist fo to-visit uses. This is used to 123 /// \brief The worklist of to-visit uses. 124 SmallVector<UseToVisit, 8> Worklist; 153 /// \brief Enqueue the users of this instruction in the visit worklist. 178 /// The recursive visit of uses is accomplished with a worklist, so the only 216 // Visit all the uses off the worklist until it is empty. 217 while (!Worklist.empty()) { 218 UseToVisit ToVisit = Worklist.pop_back_val();
|
/external/llvm/lib/Target/AMDGPU/ |
SIFixSGPRCopies.cpp | 246 SmallVector<MachineInstr *, 16> Worklist;
|
/external/llvm/lib/CodeGen/ |
LiveDebugValues.cpp | 360 std::greater<unsigned int>> Worklist; 374 Worklist.push(RPONumber); 379 // To solve it, we perform join() and transfer() using the two worklist method 382 while (!Worklist.empty() || !Pending.empty()) { 383 // We track what is on the pending worklist to avoid inserting the same 387 while (!Worklist.empty()) { 388 MachineBasicBlock *MBB = OrderToBB[Worklist.top()]; 389 Worklist.pop(); 410 Worklist.swap(Pending); 412 // worklist [all...] |
/external/llvm/lib/CodeGen/SelectionDAG/ |
LegalizeTypes.h | 135 /// Worklist - This defines a worklist of nodes to process. In order to be 136 /// pushed onto this worklist, all operands of a node must have already been 138 SmallVector<SDNode*, 128> Worklist; [all...] |
/external/llvm/lib/Transforms/IPO/ |
FunctionAttrs.cpp | 408 SmallVector<Use *, 32> Worklist; 420 Worklist.push_back(&U); 423 while (!Worklist.empty()) { 424 Use *U = Worklist.pop_back_val(); 436 Worklist.push_back(&UU); 450 Worklist.push_back(&UU); [all...] |
FunctionImport.cpp | 95 /// found they are added to the \p Worklist for importing. 99 SmallVector<StringRef, 64> &Worklist) { 113 // added to set/worklist. 143 Worklist.push_back(It.first->getKey()); 152 // Helper function: given a worklist and an index, will process all the worklist 161 SmallVector<StringRef, 64> &Worklist, 167 while (!Worklist.empty()) { 168 auto CalledFunctionName = Worklist.pop_back_val(); 252 // Process the newly imported functions and add callees to the worklist [all...] |
/external/llvm/lib/Transforms/InstCombine/ |
InstCombineInternal.h | 139 /// worklist. 142 InstCombineWorklist &Worklist; 147 : Worklist(WL), AC(AC) {} 152 Worklist.Add(I); 169 /// \brief A worklist of the instructions that need to be simplified. 170 InstCombineWorklist &Worklist; 173 /// worklist. 197 InstCombiner(InstCombineWorklist &Worklist, BuilderTy *Builder, 201 : Worklist(Worklist), Builder(Builder), MinimizeSize(MinimizeSize) [all...] |
/external/clang/lib/Lex/ |
PPMacroExpansion.cpp | 148 llvm::SmallVector<ModuleMacro *, 16> Worklist; 152 Worklist.push_back(LeafMM); 154 while (!Worklist.empty()) { 155 auto *MM = Worklist.pop_back_val(); 164 Worklist.push_back(O); 236 llvm::SmallVector<ModuleMacro *, 16> Worklist(Leaf.begin(), Leaf.end()); 237 while (!Worklist.empty()) { 238 auto *MM = Worklist.pop_back_val(); 257 Worklist.push_back(O); [all...] |