/freebsd-12-stable/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/ |
H A D | Combiner.cpp | 53 WorkListTy &WorkList; 59 WorkListMaintainer(WorkListTy &WorkList) argument 60 : GISelChangeObserver(), WorkList(WorkList) {} 66 WorkList.remove(&MI); 70 WorkList.insert(&MI); 75 WorkList.insert(&MI); 79 WorkList.insert(&MI); 126 GISelWorkList<512> WorkList; local 127 WorkListMaintainer Observer(WorkList); [all...] |
/freebsd-12-stable/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
H A D | WorkList.h | 1 //==- WorkList.h - Worklist class used by CoreEngine ---------------*- C++ -*-// 9 // This file defines WorkList, a pure virtual class that represents an opaque 60 class WorkList { class in namespace:clang::ento 63 virtual ~WorkList(); 82 static std::unique_ptr<WorkList> makeDFS(); 83 static std::unique_ptr<WorkList> makeBFS(); 84 static std::unique_ptr<WorkList> makeBFSBlockDFSContents(); 85 static std::unique_ptr<WorkList> makeUnexploredFirst(); 86 static std::unique_ptr<WorkList> makeUnexploredFirstPriorityQueue(); 87 static std::unique_ptr<WorkList> makeUnexploredFirstPriorityLocationQueu [all...] |
/freebsd-12-stable/contrib/llvm-project/clang/lib/StaticAnalyzer/Core/ |
H A D | WorkList.cpp | 1 //===- WorkList.cpp - Analyzer work-list implementation--------------------===// 13 #include "clang/StaticAnalyzer/Core/PathSensitive/WorkList.h" 25 #define DEBUG_TYPE "WorkList" 36 class DFS : public WorkList { 56 class BFS : public WorkList { 77 // Place the dstor for WorkList here because it contains virtual member 79 WorkList::~WorkList() = default; 81 std::unique_ptr<WorkList> WorkList [all...] |
H A D | CoreEngine.cpp | 28 #include "clang/StaticAnalyzer/Core/PathSensitive/WorkList.h" 55 static std::unique_ptr<WorkList> generateWorkList(AnalyzerOptions &Opts, 59 return WorkList::makeDFS(); 61 return WorkList::makeBFS(); 63 return WorkList::makeBFSBlockDFSContents(); 65 return WorkList::makeUnexploredFirst(); 67 return WorkList::makeUnexploredFirstPriorityQueue(); 69 return WorkList::makeUnexploredFirstPriorityLocationQueue();
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | ConstantProp.cpp | 73 SmallPtrSet<Instruction *, 16> WorkList; 74 // The SmallVector of WorkList ensures that we do iteration at stable order. 79 WorkList.insert(&I); 88 while (!WorkList.empty()) { 91 WorkList.erase(I); // Remove element from the worklist... 102 if (WorkList.insert(cast<Instruction>(U)).second)
|
H A D | Reg2Mem.cpp | 92 std::list<Instruction*> WorkList; local 98 WorkList.push_front(&*iib); 103 NumRegsDemoted += WorkList.size(); 104 for (Instruction *ilb : WorkList) 107 WorkList.clear(); 114 WorkList.push_front(&*iib); 117 NumPhisDemoted += WorkList.size(); 118 for (Instruction *ilb : WorkList)
|
H A D | DCE.cpp | 123 SmallSetVector<Instruction *, 16> &WorkList, 145 WorkList.insert(OpI); 157 SmallSetVector<Instruction *, 16> WorkList; local 167 if (!WorkList.count(I)) 168 MadeChange |= DCEInstruction(I, WorkList, TLI); 171 while (!WorkList.empty()) { 172 Instruction *I = WorkList.pop_back_val(); 173 MadeChange |= DCEInstruction(I, WorkList, TLI); 122 DCEInstruction(Instruction *I, SmallSetVector<Instruction *, 16> &WorkList, const TargetLibraryInfo *TLI) argument
|
H A D | BDCE.cpp | 46 SmallVector<Instruction *, 16> WorkList; local 54 WorkList.push_back(J); 68 while (!WorkList.empty()) { 69 Instruction *J = WorkList.pop_back_val(); 84 WorkList.push_back(K);
|
H A D | LowerMatrixIntrinsics.cpp | 325 propagateShapeForward(SmallVectorImpl<Instruction *> &WorkList) { argument 331 while (!WorkList.empty()) { 332 Instruction *Inst = WorkList.back(); 333 WorkList.pop_back(); 379 WorkList.push_back(cast<Instruction>(User)); 389 propagateShapeBackward(SmallVectorImpl<Instruction *> &WorkList) { argument 393 SmallVectorImpl<Instruction *> &WorkList) { 396 WorkList.push_back(I); 402 while (!WorkList.empty()) { 403 Value *V = WorkList 462 SmallVector<Instruction *, 32> WorkList; local [all...] |
H A D | AlignmentFromAssumptions.cpp | 307 SmallVector<Instruction*, 16> WorkList; local 314 WorkList.push_back(K); 317 while (!WorkList.empty()) { 318 Instruction *J = WorkList.pop_back_val(); 367 WorkList.push_back(K);
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | ScheduleDAG.cpp | 219 SmallVector<SUnit*, 8> WorkList; 220 WorkList.push_back(this); 222 SUnit *SU = WorkList.pop_back_val(); 227 WorkList.push_back(SuccSU); 229 } while (!WorkList.empty()); 234 SmallVector<SUnit*, 8> WorkList; 235 WorkList.push_back(this); 237 SUnit *SU = WorkList.pop_back_val(); 242 WorkList.push_back(PredSU); 244 } while (!WorkList [all...] |
H A D | ProcessImplicitDefs.cpp | 33 SmallSetVector<MachineInstr*, 16> WorkList; member in class:__anon4617::ProcessImplicitDefs 89 WorkList.insert(UserMI); 144 assert(WorkList.empty() && "Inconsistent worklist state"); 152 WorkList.insert(&*MBBI); 154 if (WorkList.empty()) 157 LLVM_DEBUG(dbgs() << printMBBReference(*MFI) << " has " << WorkList.size() 161 // Drain the WorkList to recursively process any new implicit defs. 162 do processImplicitDef(WorkList.pop_back_val()); 163 while (!WorkList.empty());
|
H A D | LiveRangeCalc.cpp | 292 SetVector<unsigned> WorkList; local 296 WorkList.insert(P->getNumber()); 298 for (unsigned i = 0; i != WorkList.size(); ++i) { 300 unsigned N = WorkList[i]; 339 WorkList.insert(P->getNumber()); 352 SmallVector<unsigned, 16> WorkList(1, UseMBBNum); 361 for (unsigned i = 0; i != WorkList.size(); ++i) { 362 MachineBasicBlock *MBB = MF->getBlockNumbered(WorkList[i]); 416 WorkList.push_back(Pred->getNumber()); 430 if (WorkList [all...] |
H A D | SafeStackColoring.cpp | 73 SmallVector<Instruction *, 8> WorkList; local 74 WorkList.push_back(AI); 75 while (!WorkList.empty()) { 76 Instruction *I = WorkList.pop_back_val(); 79 WorkList.push_back(BI);
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | CodeMoverUtils.cpp | 64 /// Get the next instructions of \p I, and push them to \p WorkList. 66 SmallPtrSetImpl<Instruction *> &WorkList) { 68 WorkList.insert(NextInst); 72 WorkList.insert(&Succ->front()); 76 SmallPtrSet<Instruction *, 10> WorkList; local 77 getNextInsts(StartInst, WorkList); 78 while (!WorkList.empty()) { 79 Instruction *CurInst = *WorkList.begin(); 80 WorkList.erase(CurInst); 88 getNextInsts(*CurInst, WorkList); [all...] |
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/ |
H A D | SSAUpdaterImpl.h | 117 SmallVector<BBInfo *, 64> WorkList; local 121 WorkList.push_back(Info); 127 while (!WorkList.empty()) { 128 Info = WorkList.pop_back_val(); 158 WorkList.push_back(PredInfo); 173 WorkList.push_back(Info); 176 while (!WorkList.empty()) { 177 Info = WorkList.back(); 185 WorkList.pop_back(); 203 WorkList 405 SmallVector<PhiT *, 20> WorkList; local [all...] |
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/PowerPC/ |
H A D | PPCBoolRetToInt.cpp | 74 SmallVector<Value *, 8> WorkList; local 75 WorkList.push_back(V); 77 while (!WorkList.empty()) { 78 Value *Curr = WorkList.back(); 79 WorkList.pop_back(); 86 WorkList.push_back(Op);
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/WebAssembly/ |
H A D | WebAssemblyFixIrreducibleControlFlow.cpp | 128 SmallVector<BlockPair, 4> WorkList; 135 WorkList.emplace_back(MBB, Succ); 140 while (!WorkList.empty()) { 142 std::tie(MBB, Succ) = WorkList.pop_back_val(); 149 WorkList.emplace_back(Pred, Succ); 198 BlockVector WorkList; local 203 WorkList.push_back(Pred); 208 while (!WorkList.empty()) { 209 auto *MBB = WorkList.pop_back_val(); 214 WorkList [all...] |
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | BranchProbabilityInfo.cpp | 151 SmallVectorImpl<const BasicBlock *> &WorkList, 162 WorkList.insert(WorkList.end(), NewItems.begin(), NewItems.end()); 168 SmallVector<const BasicBlock *, 8> WorkList; local 178 UpdatePDTWorklist(&BB, PDT, WorkList, PostDominatedByUnreachable); 182 while (!WorkList.empty()) { 183 const BasicBlock *BB = WorkList.pop_back_val(); 190 UpdatePDTWorklist(BB, PDT, WorkList, PostDominatedByUnreachable); 197 UpdatePDTWorklist(BB, PDT, WorkList, PostDominatedByUnreachable); 204 SmallVector<const BasicBlock *, 8> WorkList; local 150 UpdatePDTWorklist(const BasicBlock *BB, PostDominatorTree *PDT, SmallVectorImpl<const BasicBlock *> &WorkList, SmallPtrSetImpl<const BasicBlock *> &TargetSet) argument 548 SmallVector<PHINode*, 8> WorkList; local [all...] |
H A D | CFLAndersAliasAnalysis.cpp | 599 std::vector<WorkListItem> &WorkList) { 603 WorkList.push_back(WorkListItem{From, To, State}); 606 static void initializeWorkList(std::vector<WorkListItem> &WorkList, argument 621 WorkList); 623 WorkList); 639 std::vector<WorkListItem> &WorkList) { 659 MatchState::FlowFromMemAliasNoReadWrite, ReachSet, WorkList); 664 propagate(Src, *ToNodeBelow, ToState, ReachSet, WorkList); 686 propagate(FromNode, AssignEdge.Other, State, ReachSet, WorkList); 690 propagate(FromNode, RevAssignEdge.Other, State, ReachSet, WorkList); 597 propagate(InstantiatedValue From, InstantiatedValue To, MatchState State, ReachabilitySet &ReachSet, std::vector<WorkListItem> &WorkList) argument 637 processWorkListItem(const WorkListItem &Item, const CFLGraph &Graph, ReachabilitySet &ReachSet, AliasMemSet &MemSet, std::vector<WorkListItem> &WorkList) argument 739 std::vector<InstantiatedValue> WorkList, NextList; local 793 std::vector<WorkListItem> WorkList, NextList; local [all...] |
H A D | StackSafetyAnalysis.cpp | 285 SmallVector<const Value *, 8> WorkList; local 286 WorkList.push_back(Ptr); 289 while (!WorkList.empty()) { 290 const Value *V = WorkList.pop_back_val(); 360 WorkList.push_back(cast<const Instruction>(I)); 402 SetVector<const GlobalValue *> WorkList; member in class:__anon4478::StackSafetyDataFlowAnalysis 496 WorkList.insert(CallerID); 504 WorkList.clear(); 526 while (!WorkList.empty()) { 527 const GlobalValue *Callee = WorkList [all...] |
/freebsd-12-stable/contrib/llvm-project/llvm/lib/CodeGen/AsmPrinter/ |
H A D | DebugHandlerBase.cpp | 94 SmallVector<LexicalScope *, 4> WorkList; local 95 WorkList.push_back(LScopes.getCurrentFunctionScope()); 96 while (!WorkList.empty()) { 97 LexicalScope *S = WorkList.pop_back_val(); 101 WorkList.append(Children.begin(), Children.end());
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/Mips/ |
H A D | MipsOptimizePICCall.cpp | 204 SmallVector<MBBInfo, 8> WorkList(1, MBBInfo(MDT->getRootNode())); 206 while (!WorkList.empty()) { 207 MBBInfo &MBBI = WorkList.back(); 213 WorkList.pop_back(); 222 WorkList.append(Children.begin(), Children.end());
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
H A D | AMDGPUPromoteAlloca.cpp | 100 std::vector<Value*> &WorkList) const; 385 std::vector<Value*> WorkList; local 392 WorkList.push_back(AllocaUser); 411 WorkList.push_back(GEPUser); 422 for (Value *V : WorkList) { 526 std::vector<Value*> &WorkList) const { 529 if (is_contained(WorkList, User)) 536 WorkList.push_back(User); 573 WorkList.push_back(ICmp); 581 WorkList 786 std::vector<Value*> WorkList; local [all...] |
/freebsd-12-stable/contrib/sendmail/src/ |
H A D | queue.c | 2164 /* Has the WorkList reached the limit? */ 2492 ** full -- (optional) to be set 'true' if WorkList is full 2494 ** messages in this queue not added to WorkList 2499 ** the number of requests in WorkList however). 2502 ** prepares available work into WorkList 2513 static WORK *WorkList = NULL; /* list of unsort work */ variable 2514 static int WorkListSize = 0; /* current max size of WorkList */ 2515 static int WorkListCount = 0; /* # of work items in WorkList */ 2665 "WorkList for %s maxed out at %d", 2679 w = &WorkList[w [all...] |