| /netbsd-src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| H A D | IndirectBrExpandPass.cpp | 174 SmallVector<DominatorTree::UpdateType, 8> Updates; in runOnFunction() local 176 Updates.reserve(IndirectBrSuccs.size()); in runOnFunction() 180 Updates.push_back({DominatorTree::Delete, IBr->getParent(), SuccBB}); in runOnFunction() 186 assert(Updates.size() == IndirectBrSuccs.size() && in runOnFunction() 188 DTU->applyUpdates(Updates); in runOnFunction() 211 SmallVector<DominatorTree::UpdateType, 8> Updates; in runOnFunction() local 220 Updates.reserve(IndirectBrSuccs.size()); in runOnFunction() 222 Updates.push_back({DominatorTree::Delete, IBr->getParent(), SuccBB}); in runOnFunction() 223 assert(Updates.size() == IndirectBrSuccs.size() && in runOnFunction() 239 Updates.reserve(IndirectBrs.size() + 2 * IndirectBrSuccs.size()); in runOnFunction() [all …]
|
| H A D | DwarfEHPrepare.cpp | 217 std::vector<DominatorTree::UpdateType> Updates; in InsertUnwindResumeCalls() local 218 Updates.reserve(Resumes.size()); in InsertUnwindResumeCalls() 229 Updates.push_back({DominatorTree::Insert, Parent, UnwindBB}); in InsertUnwindResumeCalls() 246 DTU->applyUpdates(Updates); in InsertUnwindResumeCalls()
|
| H A D | ScheduleDAG.cpp | 468 Updates.clear(); in InitDAGTopologicalSorting() 531 for (auto &U : Updates) in FixOrder() 533 Updates.clear(); in FixOrder() 540 Dirty = Dirty || Updates.size() > 10; in AddPredQueued() 545 Updates.emplace_back(Y, X); in AddPredQueued()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/ |
| H A D | AMDGPUUnifyDivergentExitNodes.cpp | 190 std::vector<DominatorTree::UpdateType> Updates; in unifyReturnBlockSet() local 191 Updates.reserve(ReturningBlocks.size()); in unifyReturnBlockSet() 201 Updates.push_back({DominatorTree::Insert, BB, NewRetBlock}); in unifyReturnBlockSet() 205 DTU.applyUpdates(Updates); in unifyReturnBlockSet() 206 Updates.clear(); in unifyReturnBlockSet() 245 std::vector<DominatorTree::UpdateType> Updates; in runOnFunction() local 303 Updates.push_back({DominatorTree::Insert, BB, DummyReturnBB}); in runOnFunction() 310 Updates.reserve(Updates.size() + 2 * Successors.size() + 2); in runOnFunction() 314 Updates.push_back({DominatorTree::Insert, BB, TransitionBB}); in runOnFunction() 316 Updates.push_back({DominatorTree::Insert, TransitionBB, Successor}); in runOnFunction() [all …]
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/ |
| H A D | BasicBlockUtils.cpp | 57 SmallVectorImpl<DominatorTree::UpdateType> *Updates, in DetatchDeadBlocks() argument 65 if (Updates && UniqueSuccessors.insert(Succ).second) in DetatchDeadBlocks() 66 Updates->push_back({DominatorTree::Delete, BB, Succ}); in DetatchDeadBlocks() 105 SmallVector<DominatorTree::UpdateType, 4> Updates; in DeleteDeadBlocks() local 106 DetatchDeadBlocks(BBs, DTU ? &Updates : nullptr, KeepOneInputPHIs); in DeleteDeadBlocks() 109 DTU->applyUpdates(Updates); in DeleteDeadBlocks() 229 std::vector<DominatorTree::UpdateType> Updates; in MergeBlockIntoPredecessor() local 234 Updates.reserve(Updates.size() + 2 * SuccsOfBB.size() + 1); in MergeBlockIntoPredecessor() 244 Updates.push_back({DominatorTree::Insert, PredBB, SuccOfBB}); in MergeBlockIntoPredecessor() 246 Updates.push_back({DominatorTree::Delete, BB, SuccOfBB}); in MergeBlockIntoPredecessor() [all …]
|
| H A D | SimplifyCFG.cpp | 930 std::vector<DominatorTree::UpdateType> Updates; in SimplifyEqualityComparisonWithOnlyPredecessor() local 933 Updates.push_back({DominatorTree::Delete, PredDef, I.first}); in SimplifyEqualityComparisonWithOnlyPredecessor() 934 DTU->applyUpdates(Updates); in SimplifyEqualityComparisonWithOnlyPredecessor() 988 SmallVector<DominatorTree::UpdateType, 2> Updates; in SimplifyEqualityComparisonWithOnlyPredecessor() local 989 Updates.reserve(RemovedSuccs.size()); in SimplifyEqualityComparisonWithOnlyPredecessor() 991 Updates.push_back({DominatorTree::Delete, TIBB, RemovedSucc}); in SimplifyEqualityComparisonWithOnlyPredecessor() 992 DTU->applyUpdates(Updates); in SimplifyEqualityComparisonWithOnlyPredecessor() 1120 SmallVector<DominatorTree::UpdateType, 32> Updates; in PerformValueComparisonIntoPredecessorFolding() local 1186 Updates.push_back({DominatorTree::Delete, Pred, PredDefault}); in PerformValueComparisonIntoPredecessorFolding() 1264 Updates.reserve(Updates.size() + NewSuccessors.size()); in PerformValueComparisonIntoPredecessorFolding() [all …]
|
| H A D | BreakCriticalEdges.cpp | 250 SmallVector<DominatorTree::UpdateType, 3> Updates; in SplitKnownCriticalEdge() local 251 Updates.push_back({DominatorTree::Insert, TIBB, NewBB}); in SplitKnownCriticalEdge() 252 Updates.push_back({DominatorTree::Insert, NewBB, DestBB}); in SplitKnownCriticalEdge() 254 Updates.push_back({DominatorTree::Delete, TIBB, DestBB}); in SplitKnownCriticalEdge() 257 DT->applyUpdates(Updates); in SplitKnownCriticalEdge() 259 PDT->applyUpdates(Updates); in SplitKnownCriticalEdge()
|
| H A D | Local.cpp | 291 std::vector<DominatorTree::UpdateType> Updates; in ConstantFoldTerminator() local 292 Updates.reserve(RemovedSuccessors.size()); in ConstantFoldTerminator() 294 Updates.push_back({DominatorTree::Delete, BB, RemovedSuccessor}); in ConstantFoldTerminator() 295 DTU->applyUpdates(Updates); in ConstantFoldTerminator() 378 std::vector<DominatorTree::UpdateType> Updates; in ConstantFoldTerminator() local 379 Updates.reserve(RemovedSuccessors.size()); in ConstantFoldTerminator() 381 Updates.push_back({DominatorTree::Delete, BB, RemovedSuccessor}); in ConstantFoldTerminator() 382 DTU->applyUpdates(Updates); in ConstantFoldTerminator() 745 SmallVector<DominatorTree::UpdateType, 32> Updates; in MergeBasicBlockIntoOnlyPred() local 750 Updates.reserve(Updates.size() + 2 * PredsOfPredBB.size() + 1); in MergeBasicBlockIntoOnlyPred() [all …]
|
| H A D | LoopRotationUtils.cpp | 583 SmallVector<DominatorTree::UpdateType, 3> Updates; in rotateLoop() local 584 Updates.push_back({DominatorTree::Insert, OrigPreheader, Exit}); in rotateLoop() 585 Updates.push_back({DominatorTree::Insert, OrigPreheader, NewHeader}); in rotateLoop() 586 Updates.push_back({DominatorTree::Delete, OrigPreheader, OrigHeader}); in rotateLoop() 589 MSSAU->applyUpdates(Updates, *DT, /*UpdateDT=*/true); in rotateLoop() 593 DT->applyUpdates(Updates); in rotateLoop()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/AArch64/ |
| H A D | AArch64PromoteConstant.cpp | 202 void promoteConstants(Function &F, SmallVectorImpl<UpdateRecord> &Updates, 537 Function &F, SmallVectorImpl<UpdateRecord> &Updates, in promoteConstants() argument 540 for (auto U = Updates.begin(), E = Updates.end(); U != E;) { in promoteConstants() 560 SmallVector<UpdateRecord, 64> Updates; in runOnFunction() local 582 Updates.emplace_back(Cst, &I, OpNo); in runOnFunction() 586 if (Updates.empty()) in runOnFunction() 589 promoteConstants(F, Updates, PromotionCache); in runOnFunction()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| H A D | DomTreeUpdater.cpp | 230 void DomTreeUpdater::applyUpdates(ArrayRef<DominatorTree::UpdateType> Updates) { in applyUpdates() argument 235 PendUpdates.reserve(PendUpdates.size() + Updates.size()); in applyUpdates() 236 for (const auto &U : Updates) in applyUpdates() 244 DT->applyUpdates(Updates); in applyUpdates() 246 PDT->applyUpdates(Updates); in applyUpdates() 250 ArrayRef<DominatorTree::UpdateType> Updates) { in applyUpdatesPermissive() argument 256 for (const auto &U : Updates) { in applyUpdatesPermissive()
|
| H A D | MemorySSAUpdater.cpp | 777 SmallVector<CFGUpdate, 4> Updates; in privateUpdateExitBlocksForClonedLoop() local 783 Updates.push_back({DT.Insert, NewExit, ExitSucc}); in privateUpdateExitBlocksForClonedLoop() 785 applyInsertUpdates(Updates, DT); in privateUpdateExitBlocksForClonedLoop() 810 void MemorySSAUpdater::applyUpdates(ArrayRef<CFGUpdate> Updates, in applyUpdates() argument 815 for (auto &Update : Updates) { in applyUpdates() 832 DT.applyUpdates(Updates, RevDeleteUpdates); in applyUpdates() 846 DT.applyUpdates(Updates); in applyUpdates() 856 void MemorySSAUpdater::applyInsertUpdates(ArrayRef<CFGUpdate> Updates, in applyInsertUpdates() argument 859 applyInsertUpdates(Updates, DT, &GD); in applyInsertUpdates() 862 void MemorySSAUpdater::applyInsertUpdates(ArrayRef<CFGUpdate> Updates, in applyInsertUpdates() argument [all …]
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/ |
| H A D | SimplifyCFGPass.cpp | 85 std::vector<DominatorTree::UpdateType> Updates; in mergeEmptyReturnBlocks() local 149 Updates.reserve(Updates.size() + 2 * PredsOfBB.size()); in mergeEmptyReturnBlocks() 154 Updates.push_back({DominatorTree::Insert, Predecessor, RetBlock}); in mergeEmptyReturnBlocks() 156 Updates.push_back({DominatorTree::Delete, Predecessor, &BB}); in mergeEmptyReturnBlocks() 184 Updates.push_back({DominatorTree::Insert, &BB, RetBlock}); in mergeEmptyReturnBlocks() 188 DTU->applyUpdates(Updates); in mergeEmptyReturnBlocks()
|
| H A D | JumpThreading.cpp | 1097 std::vector<DominatorTree::UpdateType> Updates; in processBlock() local 1101 Updates.reserve(BBTerm->getNumSuccessors()); in processBlock() 1106 Updates.push_back({DominatorTree::Delete, BB, Succ}); in processBlock() 1114 DTU->applyUpdatesPermissive(Updates); in processBlock() 1720 std::vector <DominatorTree::UpdateType> Updates; in processThreadableEdges() local 1721 Updates.reserve(BB->getTerminator()->getNumSuccessors() - 1); in processThreadableEdges() 1727 Updates.push_back({DominatorTree::Delete, BB, SuccBB}); in processThreadableEdges() 1736 DTU->applyUpdatesPermissive(Updates); in processThreadableEdges() 2469 std::vector<DominatorTree::UpdateType> Updates; in splitBlockPreds() local 2470 Updates.reserve((2 * Preds.size()) + NewBBs.size()); in splitBlockPreds() [all …]
|
| H A D | SCCP.cpp | 372 SmallVector<DominatorTree::UpdateType, 8> Updates; in removeNonFeasibleEdges() local 383 Updates.push_back({DominatorTree::Delete, BB, Succ}); in removeNonFeasibleEdges() 388 DTU.applyUpdatesPermissive(Updates); in removeNonFeasibleEdges() 391 SmallVector<DominatorTree::UpdateType, 8> Updates; in removeNonFeasibleEdges() local 400 Updates.push_back({DominatorTree::Delete, BB, Succ}); in removeNonFeasibleEdges() 405 DTU.applyUpdatesPermissive(Updates); in removeNonFeasibleEdges()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Support/ |
| H A D | GenericDomTree.h | 202 ArrayRef<typename DomTreeT::UpdateType> Updates); 544 void applyUpdates(ArrayRef<UpdateType> Updates) { 546 Updates, /*ReverseApplyUpdates=*/true); 555 void applyUpdates(ArrayRef<UpdateType> Updates, 557 if (Updates.empty()) { 566 SmallVector<UpdateType> AllUpdates(Updates.begin(), Updates.end()); 783 void recalculate(ParentType &Func, ArrayRef<UpdateType> Updates) { 785 DomTreeBuilder::CalculateWithUpdates(*this, Updates);
|
| H A D | CFGDiff.h | 95 GraphDiff(ArrayRef<cfg::Update<NodePtr>> Updates, 97 cfg::LegalizeUpdates<NodePtr>(Updates, LegalizedUpdates, InverseGraph);
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Instrumentation/ |
| H A D | PGOMemOPSizeOpt.cpp | 461 std::vector<DominatorTree::UpdateType> Updates; in perform() local 463 Updates.reserve(2 * SizeIds.size()); in perform() 481 Updates.push_back({DominatorTree::Insert, CaseBB, MergeBB}); in perform() 482 Updates.push_back({DominatorTree::Insert, BB, CaseBB}); in perform() 486 DTU.applyUpdates(Updates); in perform() 487 Updates.clear(); in perform()
|
| /netbsd-src/external/apache2/llvm/dist/clang/lib/AST/ |
| H A D | StmtOpenMP.cpp | 274 Dir->setUpdates(Exprs.Updates); in Create() 317 Dir->setUpdates(Exprs.Updates); in Create() 384 Dir->setUpdates(Exprs.Updates); in Create() 514 Dir->setUpdates(Exprs.Updates); in Create() 559 Dir->setUpdates(Exprs.Updates); in Create() 852 Dir->setUpdates(Exprs.Updates); in Create() 956 Dir->setUpdates(Exprs.Updates); in Create() 1001 Dir->setUpdates(Exprs.Updates); in Create() 1044 Dir->setUpdates(Exprs.Updates); in Create() 1089 Dir->setUpdates(Exprs.Updates); in Create() [all …]
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/IPO/ |
| H A D | GlobalDCE.cpp | 145 SmallVectorImpl<GlobalValue *> *Updates) { in MarkLive() argument 150 if (Updates) in MarkLive() 151 Updates->push_back(&GV); in MarkLive() 154 MarkLive(*CM.second, Updates); // Recursion depth is only two because only in MarkLive()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/ |
| H A D | DomTreeUpdater.h | 123 void applyUpdates(ArrayRef<DominatorTree::UpdateType> Updates); 146 void applyUpdatesPermissive(ArrayRef<DominatorTree::UpdateType> Updates);
|
| H A D | MemorySSAUpdater.h | 125 void applyUpdates(ArrayRef<CFGUpdate> Updates, DominatorTree &DT, 128 void applyInsertUpdates(ArrayRef<CFGUpdate> Updates, DominatorTree &DT);
|
| /netbsd-src/crypto/external/bsd/openssl.old/dist/util/ |
| H A D | openssl-update-copyright | 31 Updates the year ranges of all OpenSSL copyright statements in the given
|
| /netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Transforms/IPO/ |
| H A D | GlobalDCE.h | 56 SmallVectorImpl<GlobalValue *> *Updates = nullptr);
|
| /netbsd-src/external/bsd/flex/dist/examples/ |
| H A D | README | 3 a bit before they work for you. Updates, new files and patches are welcome.
|