/freebsd-11.0-release/contrib/llvm/include/llvm/Transforms/InstCombine/ |
H A D | InstCombine.h | 28 InstCombineWorklist Worklist; member in class:llvm::InstCombinePass 35 InstCombinePass(InstCombinePass &&Arg) : Worklist(std::move(Arg.Worklist)) {} 37 Worklist = std::move(RHS.Worklist);
|
H A D | InstCombineWorklist.h | 1 //===- InstCombineWorklist.h - Worklist for InstCombine pass ----*- C++ -*-===// 27 SmallVector<Instruction*, 256> Worklist; member in class:llvm::InstCombineWorklist 36 : Worklist(std::move(Arg.Worklist)), 39 Worklist = std::move(RHS.Worklist); 44 bool isEmpty() const { return Worklist.empty(); } 49 if (WorklistMap.insert(std::make_pair(I, Worklist.size())).second) { 51 Worklist.push_back(I); 64 assert(Worklist [all...] |
/freebsd-11.0-release/contrib/llvm/lib/Transforms/Scalar/ |
H A D | ADCE.cpp | 38 SmallVector<Instruction*, 128> Worklist; local 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();
|
H A D | BDCE.cpp | 66 SmallVector<Instruction*, 128> Worklist; local 86 Worklist.push_back(&I); 91 for (Instruction *&I : Worklist) {
|
H A D | LoopUnswitch.cpp | 261 void SimplifyCode(std::vector<Instruction*> &Worklist, Loop *L); 1117 std::vector<Instruction*> &Worklist) { 1119 Worklist.erase(std::remove(Worklist.begin(), Worklist.end(), I), 1120 Worklist.end()); 1126 std::vector<Instruction*> &Worklist, 1133 Worklist.push_back(Use); 1137 Worklist.push_back(cast<Instruction>(U)); 1139 RemoveFromWorklist(I, Worklist); 1116 RemoveFromWorklist(Instruction *I, std::vector<Instruction*> &Worklist) argument 1125 ReplaceUsesOfWith(Instruction *I, Value *V, std::vector<Instruction*> &Worklist, Loop *L, LPPassManager *LPM) argument 1162 std::vector<Instruction*> Worklist; local 1272 SimplifyCode(std::vector<Instruction*> &Worklist, Loop *L) argument [all...] |
/freebsd-11.0-release/contrib/llvm/lib/Analysis/ |
H A D | IteratedDominanceFrontier.cpp | 42 SmallVector<DomTreeNode *, 32> Worklist; local 57 Worklist.clear(); 58 Worklist.push_back(Root); 61 while (!Worklist.empty()) { 62 DomTreeNode *Node = Worklist.pop_back_val(); 91 Worklist.push_back(DomChild);
|
H A D | 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; local 180 Worklist.push_back(const_cast<BasicBlock*>(A)); 182 return isPotentiallyReachableFromMany(Worklist, const_cast<BasicBlock *>(B), 191 SmallVector<BasicBlock*, 32> Worklist; local 219 Worklist 130 isPotentiallyReachableFromMany( SmallVectorImpl<BasicBlock *> &Worklist, BasicBlock *StopBB, const DominatorTree *DT, const LoopInfo *LI) argument [all...] |
H A D | PtrUseVisitor.cpp | 25 Worklist.push_back(std::move(NewU));
|
H A D | EHPersonalities.cpp | 49 SmallVector<std::pair<BasicBlock *, BasicBlock *>, 16> Worklist; local 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});
|
H A D | DivergenceAnalysis.cpp | 103 // users to Worklist. 111 std::vector<Value *> Worklist; // Stack for DFS. member in class:__anon2388::DivergencePropagator 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 [all...] |
H A D | 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; local 227 Worklist.push_back(&U); 230 while (!Worklist.empty()) { 231 const Use *U = Worklist.pop_back_val(); 289 Worklist.push_back(&UU);
|
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 | DemandedBits.cpp | 265 SmallVector<Instruction*, 128> Worklist; local 280 Worklist.push_back(&I); 291 Worklist.push_back(J); 301 while (!Worklist.empty()) { 302 Instruction *UserI = Worklist.pop_back_val(); 347 Worklist.push_back(I); 350 Worklist.push_back(I);
|
/freebsd-11.0-release/contrib/llvm/lib/Transforms/IPO/ |
H A D | FunctionImport.cpp | 96 /// found they are added to the \p Worklist for importing. 100 SmallVector<StringRef, 64> &Worklist) { 146 Worklist.push_back(It.first->getKey()); 164 SmallVector<StringRef, 64> &Worklist, 170 while (!Worklist.empty()) { 171 auto CalledFunctionName = Worklist.pop_back_val(); 257 findExternalCalls(DestModule, *F, Index, CalledFunctions, Worklist); 273 SmallVector<StringRef, 64> Worklist; local 277 findExternalCalls(DestModule, F, Index, CalledFunctions, Worklist); 279 if (Worklist 97 findExternalCalls(const Module &DestModule, Function &F, const FunctionInfoIndex &Index, StringSet<> &CalledFunctions, SmallVector<StringRef, 64> &Worklist) argument 163 GetImportList(Module &DestModule, SmallVector<StringRef, 64> &Worklist, StringSet<> &CalledFunctions, std::map<StringRef, DenseSet<const GlobalValue *>> &ModuleToFunctionsToImportMap, const FunctionInfoIndex &Index, ModuleLazyLoaderCache &ModuleLoaderCache) argument [all...] |
/freebsd-11.0-release/contrib/llvm/lib/Transforms/ObjCARC/ |
H A D | ProvenanceAnalysis.cpp | 78 SmallVector<const Value *, 8> Worklist; local 79 Worklist.push_back(P); 82 P = Worklist.pop_back_val(); 99 Worklist.push_back(Ur); 101 } while (!Worklist.empty());
|
H A D | DependencyAnalysis.cpp | 231 SmallVector<std::pair<BasicBlock *, BasicBlock::iterator>, 4> Worklist; local 232 Worklist.push_back(std::make_pair(StartBB, StartPos)); 235 Worklist.pop_back_val(); 250 Worklist.push_back(std::make_pair(PredBB, PredBB->end())); 261 } while (!Worklist.empty());
|
/freebsd-11.0-release/contrib/llvm/include/llvm/Analysis/ |
H A D | CFG.h | 82 /// 'Worklist' to 'StopBB', returning true if uncertain. 84 /// Determine whether there is a path from at least one block in Worklist to 86 /// once any block in 'Worklist' has been reached then 'StopBB' can not be 88 bool isPotentiallyReachableFromMany(SmallVectorImpl<BasicBlock *> &Worklist,
|
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();
|
/freebsd-11.0-release/contrib/llvm/include/llvm/Support/ |
H A D | GenericDomTreeConstruction.h | 56 typename GraphT::ChildIteratorType>, 32> Worklist; local 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; 84 Worklist.pop_back(); 89 ++Worklist.back().second; 98 Worklist.push_back(std::make_pair(Succ, GraphT::child_begin(Succ)));
|
/freebsd-11.0-release/contrib/llvm/lib/Transforms/Utils/ |
H A D | LoopUtils.cpp | 99 SmallVector<Instruction *, 8> Worklist; local 102 Worklist.push_back(Exit); 106 while (!Worklist.empty()) { 107 Instruction *I = Worklist.pop_back_val(); 118 Worklist.push_back(J); 196 SmallVector<Instruction *, 8> Worklist; local 213 Worklist.push_back(Start); 230 while (!Worklist.empty()) { 231 Instruction *Cur = Worklist.back(); 232 Worklist [all...] |
H A D | LoopSimplify.cpp | 190 SmallVector<BasicBlock *, 8> Worklist; local 191 Worklist.push_back(InputBB); 193 BasicBlock *BB = Worklist.pop_back_val(); 199 Worklist.push_back(WBB); 201 } while (!Worklist.empty()); 463 static bool simplifyOneLoop(Loop *L, SmallVectorImpl<Loop *> &Worklist, argument 577 Worklist.push_back(OuterL); 708 // Worklist maintains our depth-first queue of loops in this nest to process. 709 SmallVector<Loop *, 4> Worklist; local 710 Worklist [all...] |
/freebsd-11.0-release/contrib/llvm/lib/Transforms/InstCombine/ |
H A D | InstCombineInternal.h | 142 InstCombineWorklist &Worklist; member in class:llvm::InstCombineIRInserter 147 : Worklist(WL), AC(AC) {} 152 Worklist.Add(I); 170 InstCombineWorklist &Worklist; member in class:llvm::InstCombiner 197 InstCombiner(InstCombineWorklist &Worklist, BuilderTy *Builder, argument 201 : Worklist(Worklist), Builder(Builder), MinimizeSize(MinimizeSize), 404 Worklist.Add(New); 425 Worklist.AddUsersToWorkList(I); // Add all modified instrs to worklist. 463 Worklist [all...] |
/freebsd-11.0-release/contrib/llvm/include/llvm/Transforms/Scalar/ |
H A D | SROA.h | 59 /// \brief Worklist of alloca instructions to simplify. 66 SetVector<AllocaInst *, SmallVector<AllocaInst *, 16>> Worklist; member in class:llvm::SROA
|
/freebsd-11.0-release/contrib/llvm/lib/CodeGen/ |
H A D | LiveDebugValues.cpp | 346 std::greater<unsigned int>> Worklist; local 360 Worklist.push(RPONumber); 368 while (!Worklist.empty() || !Pending.empty()) { 373 while (!Worklist.empty()) { 374 MachineBasicBlock *MBB = OrderToBB[Worklist.top()]; 375 Worklist.pop(); 396 Worklist.swap(Pending);
|
/freebsd-11.0-release/contrib/llvm/lib/Target/AMDGPU/ |
H A D | SIInstrInfo.h | 44 void lowerScalarAbs(SmallVectorImpl<MachineInstr *> &Worklist, 47 void splitScalar64BitUnaryOp(SmallVectorImpl<MachineInstr *> &Worklist, 50 void splitScalar64BitBinaryOp(SmallVectorImpl<MachineInstr *> &Worklist, 53 void splitScalar64BitBCNT(SmallVectorImpl<MachineInstr *> &Worklist, 55 void splitScalar64BitBFE(SmallVectorImpl<MachineInstr *> &Worklist, 60 SmallVectorImpl<MachineInstr *> &Worklist) const; 415 SmallVectorImpl<MachineInstr *> &Worklist) const;
|