| /freebsd-12.1/contrib/llvm/lib/Transforms/AggressiveInstCombine/ |
| H A D | TruncInstCombine.cpp | 73 while (!Worklist.empty()) { in buildTruncExpressionDag() 74 Value *Curr = Worklist.back(); in buildTruncExpressionDag() 77 Worklist.pop_back(); in buildTruncExpressionDag() 88 Worklist.pop_back(); in buildTruncExpressionDag() 96 Worklist.pop_back(); in buildTruncExpressionDag() 151 Worklist.push_back(Src); in getMinBitWidth() 154 while (!Worklist.empty()) { in getMinBitWidth() 158 Worklist.pop_back(); in getMinBitWidth() 173 Worklist.pop_back(); in getMinBitWidth() 199 Worklist.push_back(IOp); in getMinBitWidth() [all …]
|
| /freebsd-12.1/contrib/llvm/lib/Analysis/ |
| H A D | CodeMetrics.cpp | 32 SmallVectorImpl<const Value *> &Worklist) { in appendSpeculatableOperands() argument 40 Worklist.push_back(Operand); in appendSpeculatableOperands() 53 for (int i = 0; i < (int)Worklist.size(); ++i) { in completeEphemeralValues() 54 const Value *V = Worklist[i]; in completeEphemeralValues() 67 appendSpeculatableOperands(V, Visited, Worklist); in completeEphemeralValues() 76 SmallVector<const Value *, 16> Worklist; in collectEphemeralValues() local 90 appendSpeculatableOperands(I, Visited, Worklist); in collectEphemeralValues() 93 completeEphemeralValues(Visited, Worklist, EphValues); in collectEphemeralValues() 100 SmallVector<const Value *, 16> Worklist; in collectEphemeralValues() local 110 appendSpeculatableOperands(I, Visited, Worklist); in collectEphemeralValues() [all …]
|
| H A D | CFG.cpp | 132 SmallVectorImpl<BasicBlock *> &Worklist, BasicBlock *StopBB, in isPotentiallyReachableFromMany() argument 144 BasicBlock *BB = Worklist.pop_back_val(); in isPotentiallyReachableFromMany() 164 Outer->getExitBlocks(Worklist); in isPotentiallyReachableFromMany() 166 Worklist.append(succ_begin(BB), succ_end(BB)); in isPotentiallyReachableFromMany() 168 } while (!Worklist.empty()); in isPotentiallyReachableFromMany() 180 SmallVector<BasicBlock*, 32> Worklist; in isPotentiallyReachable() local 181 Worklist.push_back(const_cast<BasicBlock*>(A)); in isPotentiallyReachable() 192 SmallVector<BasicBlock*, 32> Worklist; in isPotentiallyReachable() local 220 Worklist.append(succ_begin(BB), succ_end(BB)); in isPotentiallyReachable() 222 if (Worklist.empty()) { in isPotentiallyReachable() [all …]
|
| H A D | IteratedDominanceFrontier.cpp | 41 SmallVector<DomTreeNode *, 32> Worklist; in calculate() local 56 Worklist.clear(); in calculate() 57 Worklist.push_back(Root); in calculate() 60 while (!Worklist.empty()) { in calculate() 61 DomTreeNode *Node = Worklist.pop_back_val(); in calculate() 102 Worklist.push_back(DomChild); in calculate()
|
| H A D | LegacyDivergenceAnalysis.cpp | 120 std::vector<Value *> Worklist; // Stack for DFS. member in __anonb61c9b1d0111::DivergencePropagator 125 Worklist.clear(); in populateWithSourcesOfDivergence() 129 Worklist.push_back(&I); in populateWithSourcesOfDivergence() 135 Worklist.push_back(&Arg); in populateWithSourcesOfDivergence() 171 Worklist.push_back(&*I); in exploreSyncDependency() 216 Worklist.push_back(UserInst); in findUsersOutsideInfluenceRegion() 256 Worklist.push_back(UserInst); in exploreDataDependency() 262 while (!Worklist.empty()) { in propagate() 263 Value *V = Worklist.back(); in propagate() 264 Worklist.pop_back(); in propagate()
|
| H A D | LazyCallGraph.cpp | 115 Worklist.push_back(C); in populateSlow() 278 } while (!Worklist.empty()); in isAncestorOf() 361 Worklist.push_back(this); in isAncestorOf() 375 } while (!Worklist.empty()); in isAncestorOf() 605 } while (!Worklist.empty()); in switchInternalEdgeToCall() 730 Worklist.swap(OldSCC.Nodes); in switchInternalEdgeToRef() 731 for (Node *N : Worklist) { in switchInternalEdgeToRef() 749 for (Node *RootN : Worklist) { in switchInternalEdgeToRef() 1007 Worklist.push_back(this); in insertIncomingRefEdge() 1021 } while (!Worklist.empty()); in insertIncomingRefEdge() [all …]
|
| H A D | CaptureTracking.cpp | 103 SmallVector<BasicBlock*, 32> Worklist; in isSafeToPrune() local 104 Worklist.append(succ_begin(BB), succ_end(BB)); in isSafeToPrune() 105 return !isPotentiallyReachableFromMany(Worklist, BB, DT); in isSafeToPrune() 215 SmallVector<const Use *, DefaultMaxUsesToExplore> Worklist; in PointerMayBeCaptured() local 229 Worklist.push_back(&U); in PointerMayBeCaptured() 234 while (!Worklist.empty()) { in PointerMayBeCaptured() 235 const Use *U = Worklist.pop_back_val(); in PointerMayBeCaptured()
|
| H A D | EHPersonalities.cpp | 79 SmallVector<std::pair<BasicBlock *, BasicBlock *>, 16> Worklist; in colorEHFunclets() local 96 Worklist.push_back({EntryBlock, EntryBlock}); in colorEHFunclets() 98 while (!Worklist.empty()) { in colorEHFunclets() 101 std::tie(Visiting, Color) = Worklist.pop_back_val(); in colorEHFunclets() 133 Worklist.push_back({Succ, SuccColor}); in colorEHFunclets()
|
| H A D | DivergenceAnalysis.cpp | 220 Worklist.push_back(&Phi); in taintLoopLiveOuts() 258 Worklist.push_back(&Phi); in pushPHINodes() 274 Worklist.push_back(UserInst); in pushUsers() 370 while (!Worklist.empty()) { in compute() 371 const Instruction &I = *Worklist.back(); in compute() 372 Worklist.pop_back(); in compute()
|
| /freebsd-12.1/contrib/llvm/include/llvm/Transforms/InstCombine/ |
| H A D | InstCombineWorklist.h | 28 SmallVector<Instruction*, 256> Worklist; variable 37 bool isEmpty() const { return Worklist.empty(); } in isEmpty() 42 if (WorklistMap.insert(std::make_pair(I, Worklist.size())).second) { in Add() 44 Worklist.push_back(I); in Add() 57 assert(Worklist.empty() && "Worklist must be empty to add initial group"); in AddInitialGroup() 58 Worklist.reserve(List.size()+16); in AddInitialGroup() 65 Worklist.push_back(I); in AddInitialGroup() 75 Worklist[It->second] = nullptr; in Remove() 81 Instruction *I = Worklist.pop_back_val(); in RemoveOne()
|
| /freebsd-12.1/contrib/llvm/include/llvm/Transforms/Scalar/ |
| H A D | LoopPassManager.h | 133 Worklist.insert(std::move(PreOrderLoops)); 185 Worklist.insert(CurrentL); 214 internal::appendLoopsToWorklist(NewSibLoops, Worklist); 230 Worklist.insert(CurrentL); 237 SmallPriorityWorklist<Loop *, 4> &Worklist; 251 LPMUpdater(SmallPriorityWorklist<Loop *, 4> &Worklist, 253 : Worklist(Worklist), LAM(LAM) {} 318 SmallPriorityWorklist<Loop *, 4> Worklist; 322 LPMUpdater Updater(Worklist, LAM); 333 Loop *L = Worklist.pop_back_val(); [all …]
|
| /freebsd-12.1/contrib/llvm/lib/Target/AMDGPU/ |
| H A D | SIWholeQuadMode.cpp | 264 Worklist.push_back(&MI); in markInstruction() 295 Worklist); in markInstructionUses() 370 Worklist.push_back(&MBB); in scanInstructions() 435 Worklist.push_back(MBB); in propagateInstruction() 473 Worklist.push_back(LastMI); in propagateBlock() 485 Worklist.push_back(Pred); in propagateBlock() 495 Worklist.push_back(Succ); in propagateBlock() 500 std::vector<WorkItem> Worklist; in analyzeFunction() local 503 while (!Worklist.empty()) { in analyzeFunction() 504 WorkItem WI = Worklist.back(); in analyzeFunction() [all …]
|
| H A D | SIFixupVectorISel.cpp | 91 SmallVector<MachineOperand *, 8> Worklist; in findSRegBaseAndIndex() local 92 Worklist.push_back(Op); in findSRegBaseAndIndex() 93 while (!Worklist.empty()) { in findSRegBaseAndIndex() 94 MachineOperand *WOp = Worklist.pop_back_val(); in findSRegBaseAndIndex() 103 Worklist.push_back(&DefInst->getOperand(1)); in findSRegBaseAndIndex() 108 Worklist.push_back(&DefInst->getOperand(1)); in findSRegBaseAndIndex() 109 Worklist.push_back(&DefInst->getOperand(3)); in findSRegBaseAndIndex()
|
| /freebsd-12.1/contrib/llvm/include/llvm/CodeGen/GlobalISel/ |
| H A D | GISelWorkList.h | 33 SmallVector<MachineInstr *, N> Worklist; variable 45 if (WorklistMap.try_emplace(I, Worklist.size()).second) in insert() 46 Worklist.push_back(I); in insert() 55 Worklist[It->second] = nullptr; in remove() 61 Worklist.clear(); in clear() 68 I = Worklist.pop_back_val(); in pop_back_val()
|
| /freebsd-12.1/contrib/llvm/tools/lld/COFF/ |
| H A D | MarkLive.cpp | 30 SmallVector<SectionChunk *, 256> Worklist; in markLive() local 36 Worklist.push_back(SC); in markLive() 42 Worklist.push_back(C); in markLive() 58 while (!Worklist.empty()) { in markLive() 59 SectionChunk *SC = Worklist.pop_back_val(); in markLive()
|
| /freebsd-12.1/contrib/llvm/lib/IR/ |
| H A D | SafepointIRVerifier.cpp | 318 SmallVector<const Value *, 32> Worklist; in getBaseType() local 321 Worklist.push_back(Val); in getBaseType() 325 while(!Worklist.empty()) { in getBaseType() 326 const Value *V = Worklist.pop_back_val(); in getBaseType() 331 Worklist.push_back(CI->stripPointerCasts()); in getBaseType() 342 Worklist.push_back(InV); in getBaseType() 347 Worklist.push_back(SI->getTrueValue()); in getBaseType() 348 Worklist.push_back(SI->getFalseValue()); in getBaseType() 596 SetVector<const BasicBlock *> Worklist; in recalculateBBsStates() local 600 Worklist.insert(BBI.first); in recalculateBBsStates() [all …]
|
| /freebsd-12.1/contrib/llvm/lib/Transforms/Scalar/ |
| H A D | LoopUnswitch.cpp | 1401 Worklist.erase(std::remove(Worklist.begin(), Worklist.end(), I), in RemoveFromWorklist() 1402 Worklist.end()); in RemoveFromWorklist() 1415 Worklist.push_back(Use); in ReplaceUsesOfWith() 1421 RemoveFromWorklist(I, Worklist); in ReplaceUsesOfWith() 1463 Worklist.push_back(UI); in RewriteLoopBodyWithConditionConstant() 1469 SimplifyCode(Worklist, L); in RewriteLoopBodyWithConditionConstant() 1499 Worklist.push_back(UI); in RewriteLoopBodyWithConditionConstant() 1560 SimplifyCode(Worklist, L); in RewriteLoopBodyWithConditionConstant() 1573 while (!Worklist.empty()) { in SimplifyCode() 1575 Worklist.pop_back(); in SimplifyCode() [all …]
|
| H A D | PlaceSafepoints.cpp | 271 std::vector<BasicBlock *> &Worklist) { in scanOneBB() argument 288 Worklist.push_back(Succ); in scanOneBB() 299 std::vector<BasicBlock *> Worklist; in scanInlinedCode() local 301 scanOneBB(Start, End, Calls, Seen, Worklist); in scanInlinedCode() 302 while (!Worklist.empty()) { in scanInlinedCode() 303 BasicBlock *BB = Worklist.back(); in scanInlinedCode() 304 Worklist.pop_back(); in scanInlinedCode() 305 scanOneBB(&*BB->begin(), End, Calls, Seen, Worklist); in scanInlinedCode()
|
| /freebsd-12.1/contrib/llvm/lib/Transforms/Utils/ |
| H A D | LoopSimplify.cpp | 159 SmallVector<BasicBlock *, 8> Worklist; in addBlockAndPredsToSet() local 160 Worklist.push_back(InputBB); in addBlockAndPredsToSet() 162 BasicBlock *BB = Worklist.pop_back_val(); in addBlockAndPredsToSet() 168 Worklist.push_back(WBB); in addBlockAndPredsToSet() 170 } while (!Worklist.empty()); in addBlockAndPredsToSet() 546 Worklist.push_back(OuterL); in simplifyOneLoop() 695 SmallVector<Loop *, 4> Worklist; in simplifyLoop() local 696 Worklist.push_back(L); in simplifyLoop() 702 Loop *L2 = Worklist[Idx]; in simplifyLoop() 706 while (!Worklist.empty()) in simplifyLoop() [all …]
|
| H A D | LCSSA.cpp | 75 bool llvm::formLCSSAForInstructions(SmallVectorImpl<Instruction *> &Worklist, in formLCSSAForInstructions() argument 87 while (!Worklist.empty()) { in formLCSSAForInstructions() 90 Instruction *I = Worklist.pop_back_val(); in formLCSSAForInstructions() 232 Worklist.push_back(PostProcessPN); in formLCSSAForInstructions() 323 SmallVector<Instruction *, 8> Worklist; in formLCSSA() local 343 Worklist.push_back(&I); in formLCSSA() 346 Changed = formLCSSAForInstructions(Worklist, DT, *LI); in formLCSSA()
|
| /freebsd-12.1/contrib/llvm/lib/Transforms/ObjCARC/ |
| H A D | ProvenanceAnalysis.cpp | 87 SmallVector<const Value *, 8> Worklist; in IsStoredObjCPointer() local 88 Worklist.push_back(P); in IsStoredObjCPointer() 91 P = Worklist.pop_back_val(); in IsStoredObjCPointer() 108 Worklist.push_back(Ur); in IsStoredObjCPointer() 110 } while (!Worklist.empty()); in IsStoredObjCPointer()
|
| H A D | DependencyAnalysis.cpp | 228 SmallVector<std::pair<BasicBlock *, BasicBlock::iterator>, 4> Worklist; in FindDependencies() local 229 Worklist.push_back(std::make_pair(StartBB, StartPos)); in FindDependencies() 232 Worklist.pop_back_val(); in FindDependencies() 247 Worklist.push_back(std::make_pair(PredBB, PredBB->end())); in FindDependencies() 258 } while (!Worklist.empty()); in FindDependencies()
|
| /freebsd-12.1/contrib/llvm/lib/Transforms/IPO/ |
| H A D | MergeFunctions.cpp | 240 bool doSanityCheck(std::vector<WeakTrackingVH> &Worklist); 420 std::vector<WeakTrackingVH> Worklist; in runOnModule() local 421 Deferred.swap(Worklist); in runOnModule() 423 LLVM_DEBUG(doSanityCheck(Worklist)); in runOnModule() 429 for (WeakTrackingVH &I : Worklist) { in runOnModule() 947 std::vector<Value *> Worklist; in removeUsers() local 948 Worklist.push_back(V); in removeUsers() 951 while (!Worklist.empty()) { in removeUsers() 952 Value *V = Worklist.back(); in removeUsers() 953 Worklist.pop_back(); in removeUsers() [all …]
|
| /freebsd-12.1/contrib/llvm/lib/Bitcode/Writer/ |
| H A D | ValueEnumerator.cpp | 584 SmallVector<const MDNode *, 64> Worklist; in dropFunctionFromMetadata() local 585 auto push = [&Worklist](MetadataMapType::value_type &MD) { in dropFunctionFromMetadata() 599 Worklist.push_back(N); in dropFunctionFromMetadata() 602 while (!Worklist.empty()) in dropFunctionFromMetadata() 623 Worklist.push_back(std::make_pair(N, N->op_begin())); in EnumerateMetadata() 625 while (!Worklist.empty()) { in EnumerateMetadata() 626 const MDNode *N = Worklist.back().first; in EnumerateMetadata() 631 Worklist.back().second, N->op_end(), in EnumerateMetadata() 635 Worklist.back().second = ++I; in EnumerateMetadata() 646 Worklist.pop_back(); in EnumerateMetadata() [all …]
|
| /freebsd-12.1/contrib/llvm/lib/Target/WebAssembly/ |
| H A D | WebAssemblyRegStackify.cpp | 644 SmallVector<RangeTy, 4> Worklist; member in __anon6bab11b20211::TreeWalkerState 650 Worklist.push_back(reverse(Range)); in TreeWalkerState() 653 bool Done() const { return Worklist.empty(); } in Done() 656 RangeTy &Range = Worklist.back(); in Pop() 660 Worklist.pop_back(); in Pop() 661 assert((Worklist.empty() || in Pop() 662 Worklist.back().begin() != Worklist.back().end()) && in Pop() 671 Worklist.push_back(reverse(Range)); in PushOperands() 686 if (Worklist.empty()) in HasRemainingOperands() 688 const RangeTy &Range = Worklist.back(); in HasRemainingOperands() [all …]
|