/freebsd-current/contrib/llvm-project/llvm/include/llvm/CodeGen/GlobalISel/ |
H A D | GISelWorkList.h | 1 //===- GISelWorkList.h - Worklist for GISel passes ----*- C++ -*-===// 19 // Worklist which mostly works similar to InstCombineWorkList, but on 28 SmallVector<MachineInstr *, N> Worklist; member in class:llvm::GISelWorkList 51 Worklist.push_back(I); 59 // inserts all the elements in the Worklist into the map. 63 if (Worklist.size() > N) 64 WorklistMap.reserve(Worklist.size()); 65 for (unsigned i = 0; i < Worklist.size(); ++i) 66 if (!WorklistMap.try_emplace(Worklist[i], i).second) 78 if (WorklistMap.try_emplace(I, Worklist [all...] |
/freebsd-current/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | LoopAccessAnalysisPrinter.cpp | 26 SmallPriorityWorklist<Loop *, 4> Worklist; local 27 appendLoopsToWorklist(LI, Worklist); 28 while (!Worklist.empty()) { 29 Loop *L = Worklist.pop_back_val();
|
H A D | BDCE.cpp | 91 SmallVector<Instruction*, 128> Worklist; local 105 Worklist.push_back(&I); 121 Worklist.push_back(SE); 151 for (Instruction *&I : llvm::reverse(Worklist)) { 156 for (Instruction *&I : Worklist) {
|
H A D | LowerConstantIntrinsics.cpp | 64 SmallVector<WeakVH, 8> Worklist(UnsimplifiedUsers.begin(), 67 for (auto &VH : Worklist) { 107 SmallVector<WeakTrackingVH, 8> Worklist; local 120 Worklist.push_back(WeakTrackingVH(&I)); 125 for (WeakTrackingVH &VH: Worklist) { 154 return !Worklist.empty();
|
H A D | Float2Int.cpp | 153 std::deque<Instruction*> Worklist(Roots.begin(), Roots.end()); 154 while (!Worklist.empty()) { 155 Instruction *I = Worklist.back(); 156 Worklist.pop_back(); 196 Worklist.push_back(OI); 297 std::deque<Instruction *> Worklist; local 300 Worklist.push_back(Pair.first); 302 while (!Worklist.empty()) { 303 Instruction *I = Worklist.back(); 304 Worklist [all...] |
/freebsd-current/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/ |
H A D | InstructionWorklist.h | 1 //=== InstructionWorklist.h - Worklist for InstCombine & others -*- C++ -*-===// 26 SmallVector<Instruction *, 256> Worklist; member in class:llvm::InstructionWorklist 39 bool isEmpty() const { return Worklist.empty() && Deferred.empty(); } 62 if (WorklistMap.insert(std::make_pair(I, Worklist.size())).second) { 64 Worklist.push_back(I); 80 Worklist.reserve(Size + 16); 89 Worklist[It->second] = nullptr; 97 if (Worklist.empty()) 99 Instruction *I = Worklist.pop_back_val(); 124 assert(WorklistMap.empty() && "Worklist empt [all...] |
/freebsd-current/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | CodeMetrics.cpp | 29 SmallVectorImpl<const Value *> &Worklist) { 38 Worklist.push_back(I); 42 SmallVectorImpl<const Value *> &Worklist, 51 for (int i = 0; i < (int)Worklist.size(); ++i) { 52 const Value *V = Worklist[i]; 65 appendSpeculatableOperands(V, Visited, Worklist); 74 SmallVector<const Value *, 16> Worklist; local 88 appendSpeculatableOperands(I, Visited, Worklist); 91 completeEphemeralValues(Visited, Worklist, EphValues); 98 SmallVector<const Value *, 16> Worklist; local 27 appendSpeculatableOperands(const Value *V, SmallPtrSetImpl<const Value *> &Visited, SmallVectorImpl<const Value *> &Worklist) argument 41 completeEphemeralValues(SmallPtrSetImpl<const Value *> &Visited, SmallVectorImpl<const Value *> &Worklist, SmallPtrSetImpl<const Value *> &EphValues) argument [all...] |
H A D | CFG.cpp | 134 SmallVectorImpl<BasicBlock *> &Worklist, const BasicBlock *StopBB, 163 BasicBlock *BB = Worklist.pop_back_val(); 196 Outer->getExitBlocks(Worklist); 198 Worklist.append(succ_begin(BB), succ_end(BB)); 200 } while (!Worklist.empty()); 225 SmallVector<BasicBlock*, 32> Worklist; local 226 Worklist.push_back(const_cast<BasicBlock*>(A)); 228 return isPotentiallyReachableFromMany(Worklist, B, ExclusionSet, DT, LI); 261 SmallVector<BasicBlock*, 32> Worklist; 262 Worklist 133 isPotentiallyReachableFromMany( SmallVectorImpl<BasicBlock *> &Worklist, const BasicBlock *StopBB, const SmallPtrSetImpl<BasicBlock *> *ExclusionSet, const DominatorTree *DT, const LoopInfo *LI) argument [all...] |
H A D | PtrUseVisitor.cpp | 27 Worklist.push_back(std::move(NewU));
|
H A D | MustExecute.cpp | 424 SmallVector<const BasicBlock *, 8> Worklist; local 430 Worklist.push_back(SuccBB); 432 LLVM_DEBUG(dbgs() << "\t\t#Worklist: " << Worklist.size() << "\n"); 435 if (Worklist.empty()) 439 if (Worklist.size() == 1) 440 return Worklist[0]; 451 if (!JoinBB && Worklist.size() == 2) { 452 const BasicBlock *Succ0 = Worklist[0]; 453 const BasicBlock *Succ1 = Worklist[ 559 SmallVector<const BasicBlock *, 8> Worklist; local [all...] |
H A D | GuardUtils.cpp | 120 SmallVector<Value *, 4> Worklist(1, Condition); 124 Value *Check = Worklist.pop_back_val(); 128 Worklist.push_back(LHS); 130 Worklist.push_back(RHS); 135 } while (!Worklist.empty());
|
H A D | LazyCallGraph.cpp | 78 SmallVector<Constant *, 16> Worklist; local 112 Worklist.push_back(C); 118 visitReferences(Worklist, Visited, [&](Function &F) { 191 SmallVector<Constant *, 16> Worklist; local 196 Worklist.push_back(GV.getInitializer()); 201 visitReferences(Worklist, Visited, [&](Function &F) { 257 SmallVector<Node *, 4> Worklist; local 259 Worklist.push_back(N); 260 while (!Worklist.empty()) { 261 Node *VisitingNode = Worklist 297 SmallVector<const SCC *, 16> Worklist = {this}; local 381 SmallVector<Node *, 4> Worklist; local [all...] |
/freebsd-current/contrib/llvm-project/llvm/include/llvm/Transforms/InstCombine/ |
H A D | InstCombine.h | 56 InstructionWorklist Worklist; member in class:llvm::InstCombinePass 72 InstructionWorklist Worklist; member in class:llvm::InstructionCombiningPass
|
/freebsd-current/contrib/llvm-project/llvm/lib/Target/WebAssembly/ |
H A D | WebAssemblyAddMissingPrototypes.cpp | 91 SmallVector<Value *> Worklist; local 92 Worklist.push_back(&F); 93 while (!Worklist.empty()) { 94 Value *V = Worklist.pop_back_val(); 97 Worklist.push_back(BC);
|
/freebsd-current/contrib/llvm-project/llvm/include/llvm/Support/ |
H A D | GenericIteratedDominanceFrontier.h | 146 SmallVector<DomTreeNodeBase<NodeTy> *, 32> Worklist; local 167 assert(Worklist.empty()); 168 Worklist.push_back(Root); 170 while (!Worklist.empty()) { 171 DomTreeNodeBase<NodeTy> *Node = Worklist.pop_back_val(); 200 Worklist.push_back(DomChild);
|
/freebsd-current/contrib/llvm-project/llvm/lib/Transforms/AggressiveInstCombine/ |
H A D | TruncInstCombine.cpp | 89 SmallVector<Value *, 8> Worklist; local 94 Worklist.push_back(CurrentTruncInst->getOperand(0)); 96 while (!Worklist.empty()) { 97 Value *Curr = Worklist.back(); 100 Worklist.pop_back(); 110 // Worklist and the Stack, and add it to the instruction info map. 111 Worklist.pop_back(); 119 Worklist.pop_back(); 152 append_range(Worklist, Operands); 161 Worklist 176 SmallVector<Value *, 8> Worklist; local [all...] |
/freebsd-current/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
H A D | DetectDeadLanes.h | 105 Worklist.push_back(RegIdx); 109 /// Worklist containing virtreg indexes. 110 std::deque<unsigned> Worklist; member in class:llvm::DeadLaneDetector
|
/freebsd-current/contrib/llvm-project/llvm/lib/Transforms/ObjCARC/ |
H A D | ProvenanceAnalysis.cpp | 83 SmallVector<const Value *, 8> Worklist; local 84 Worklist.push_back(P); 87 P = Worklist.pop_back_val(); 104 Worklist.push_back(Ur); 106 } while (!Worklist.empty());
|
/freebsd-current/contrib/llvm-project/llvm/lib/IR/ |
H A D | EHPersonalities.cpp | 103 SmallVector<std::pair<BasicBlock *, BasicBlock *>, 16> Worklist; local 120 Worklist.push_back({EntryBlock, EntryBlock}); 122 while (!Worklist.empty()) { 125 std::tie(Visiting, Color) = Worklist.pop_back_val(); 157 Worklist.push_back({Succ, SuccColor});
|
H A D | SafepointIRVerifier.cpp | 328 SmallVector<const Value *, 32> Worklist; local 331 Worklist.push_back(Val); 335 while(!Worklist.empty()) { 336 const Value *V = Worklist.pop_back_val(); 341 Worklist.push_back(CI->stripPointerCasts()); 345 Worklist.push_back(GEP->getPointerOperand()); 351 append_range(Worklist, PN->incoming_values()); 356 Worklist.push_back(SI->getTrueValue()); 357 Worklist.push_back(SI->getFalseValue()); 363 Worklist 613 SetVector<const BasicBlock *> Worklist; local [all...] |
/freebsd-current/contrib/llvm-project/llvm/lib/Target/ARM/ |
H A D | MVELaneInterleavingPass.cpp | 162 std::vector<Instruction *> Worklist; 163 Worklist.push_back(Start); 164 Worklist.push_back(cast<Instruction>(Start->getOperand(0))); 172 while (!Worklist.empty()) { 173 Instruction *I = Worklist.back(); 174 Worklist.pop_back(); 192 Worklist.push_back(cast<Instruction>(Use)); 252 Worklist.push_back(cast<Instruction>(&Op)); 258 Worklist.push_back(cast<Instruction>(Use));
|
/freebsd-current/contrib/llvm-project/llvm/lib/Target/RISCV/ |
H A D | RISCVOptWInstrs.cpp | 113 SmallVector<std::pair<const MachineInstr *, unsigned>, 4> Worklist; local 115 Worklist.push_back(std::make_pair(&OrigMI, OrigBits)); 117 while (!Worklist.empty()) { 118 auto P = Worklist.pop_back_val(); 199 Worklist.push_back(std::make_pair(UserMI, Bits - ShAmt)); 210 Worklist.push_back(std::make_pair(UserMI, Bits)); 216 Worklist.push_back(std::make_pair(UserMI, Bits)); 223 Worklist.push_back(std::make_pair(UserMI, Bits)); 237 Worklist.push_back(std::make_pair(UserMI, Bits)); 256 Worklist 389 SmallVector<MachineInstr *, 4> Worklist; local [all...] |
/freebsd-current/contrib/llvm-project/clang/lib/Analysis/ |
H A D | IntervalPartition.cpp | 50 std::queue<const Node *> Worklist; local 56 // adding to `Worklist`. 57 Worklist.push(S); 70 while (!Worklist.empty()) { 71 const auto *B = Worklist.front(); 73 Worklist.pop(); 88 Worklist.push(S);
|
/freebsd-current/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
H A D | SIWholeQuadMode.cpp | 184 std::vector<WorkItem> &Worklist); 186 unsigned SubReg, char Flag, std::vector<WorkItem> &Worklist); 188 std::vector<WorkItem> &Worklist); 190 std::vector<WorkItem> &Worklist); 191 char scanInstructions(MachineFunction &MF, std::vector<WorkItem> &Worklist); 192 void propagateInstruction(MachineInstr &MI, std::vector<WorkItem> &Worklist); 193 void propagateBlock(MachineBasicBlock &MBB, std::vector<WorkItem> &Worklist); 292 std::vector<WorkItem> &Worklist) { 310 Worklist.push_back(&MI); 316 std::vector<WorkItem> &Worklist) { 291 markInstruction(MachineInstr &MI, char Flag, std::vector<WorkItem> &Worklist) argument 314 markDefs(const MachineInstr &UseMI, LiveRange &LR, Register Reg, unsigned SubReg, char Flag, std::vector<WorkItem> &Worklist) argument 431 markOperand(const MachineInstr &MI, const MachineOperand &Op, char Flag, std::vector<WorkItem> &Worklist) argument 467 markInstructionUses(const MachineInstr &MI, char Flag, std::vector<WorkItem> &Worklist) argument 478 scanInstructions(MachineFunction &MF, std::vector<WorkItem> &Worklist) argument 637 propagateInstruction(MachineInstr &MI, std::vector<WorkItem>& Worklist) argument 686 propagateBlock(MachineBasicBlock &MBB, std::vector<WorkItem>& Worklist) argument 723 std::vector<WorkItem> Worklist; local [all...] |
/freebsd-current/contrib/llvm-project/llvm/include/llvm/Transforms/Scalar/ |
H A D | LoopPassManager.h | 308 Worklist.insert(CurrentL); 317 appendLoopsToWorklist(NewChildLoops, Worklist); 338 Worklist.insert(NewSibLoops); 340 appendLoopsToWorklist(NewSibLoops, Worklist); 356 Worklist.insert(CurrentL); 373 SmallPriorityWorklist<Loop *, 4> &Worklist; member in class:llvm::LPMUpdater 389 LPMUpdater(SmallPriorityWorklist<Loop *, 4> &Worklist, argument 392 : Worklist(Worklist), LAM(LAM), LoopNestMode(LoopNestMode),
|