/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/AArch64/ |
H A D | AArch64PromoteConstant.cpp | 200 /// Do the constant promotion indicated by the Updates records, keeping track 202 void promoteConstants(Function &F, SmallVectorImpl<UpdateRecord> &Updates, 523 Function &F, SmallVectorImpl<UpdateRecord> &Updates, 526 for (auto U = Updates.begin(), E = Updates.end(); U != E;) { 546 SmallVector<UpdateRecord, 64> Updates; local 567 Updates.emplace_back(Cst, &I, OpNo); 571 if (Updates.empty()) 574 promoteConstants(F, Updates, PromotionCache); 522 promoteConstants( Function &F, SmallVectorImpl<UpdateRecord> &Updates, PromotionCacheTy &PromotionCache) argument
|
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/Transforms/IPO/ |
H A D | GlobalDCE.h | 56 SmallVectorImpl<GlobalValue *> *Updates = nullptr);
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | DomTreeUpdater.cpp | 231 void DomTreeUpdater::applyUpdates(ArrayRef<DominatorTree::UpdateType> Updates) { argument 236 for (const auto &U : Updates) 244 DT->applyUpdates(Updates); 246 PDT->applyUpdates(Updates); 250 ArrayRef<DominatorTree::UpdateType> Updates) { 256 for (const auto &U : Updates) { 249 applyUpdatesPermissive( ArrayRef<DominatorTree::UpdateType> Updates) argument
|
H A D | MemorySSAUpdater.cpp | 749 SmallVector<CFGUpdate, 4> Updates; local 755 Updates.push_back({DT.Insert, NewExit, ExitSucc}); 757 applyInsertUpdates(Updates, DT); 782 void MemorySSAUpdater::applyUpdates(ArrayRef<CFGUpdate> Updates, argument 786 for (auto &Update : Updates) { 813 void MemorySSAUpdater::applyInsertUpdates(ArrayRef<CFGUpdate> Updates, argument 816 applyInsertUpdates(Updates, DT, &GD); 819 void MemorySSAUpdater::applyInsertUpdates(ArrayRef<CFGUpdate> Updates, argument 896 // will be defined by the order in Updates (fixed) and the order given by 901 // traverse either Updates o [all...] |
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/ |
H A D | PGOMemOPSizeOpt.cpp | 369 std::vector<DominatorTree::UpdateType> Updates; local 371 Updates.reserve(2 * SizeIds.size()); 388 Updates.push_back({DominatorTree::Insert, CaseBB, MergeBB}); 389 Updates.push_back({DominatorTree::Insert, BB, CaseBB}); 393 DTU.applyUpdates(Updates); 394 Updates.clear();
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | BreakCriticalEdges.cpp | 234 SmallVector<DominatorTree::UpdateType, 3> Updates; local 235 Updates.push_back({DominatorTree::Insert, TIBB, NewBB}); 236 Updates.push_back({DominatorTree::Insert, NewBB, DestBB}); 238 Updates.push_back({DominatorTree::Delete, TIBB, DestBB}); 241 DT->applyUpdates(Updates); 243 PDT->applyUpdates(Updates);
|
H A D | BasicBlockUtils.cpp | 56 SmallVectorImpl<DominatorTree::UpdateType> *Updates, 64 if (Updates && UniqueSuccessors.insert(Succ).second) 65 Updates->push_back({DominatorTree::Delete, BB, Succ}); 104 SmallVector<DominatorTree::UpdateType, 4> Updates; local 105 DetatchDeadBlocks(BBs, DTU ? &Updates : nullptr, KeepOneInputPHIs); 108 DTU->applyUpdatesPermissive(Updates); 228 std::vector<DominatorTree::UpdateType> Updates; local 230 Updates.reserve(1 + (2 * succ_size(BB))); 240 Updates.push_back({DominatorTree::Insert, PredBB, *I}); 242 Updates 54 DetatchDeadBlocks( ArrayRef<BasicBlock *> BBs, SmallVectorImpl<DominatorTree::UpdateType> *Updates, bool KeepOneInputPHIs) argument [all...] |
H A D | Local.cpp | 238 std::vector <DominatorTree::UpdateType> Updates; local 240 Updates.reserve(SI->getNumSuccessors() - 1); 250 Updates.push_back({DominatorTree::Delete, BB, Succ}); 260 DTU->applyUpdatesPermissive(Updates); 306 std::vector <DominatorTree::UpdateType> Updates; local 308 Updates.reserve(IBI->getNumDestinations() - 1); 321 Updates.push_back({DominatorTree::Delete, ParentBB, DestBB}); 344 DTU->applyUpdatesPermissive(Updates); 691 SmallVector<DominatorTree::UpdateType, 32> Updates; local 694 Updates 1003 SmallVector<DominatorTree::UpdateType, 32> Updates; local 1919 std::vector <DominatorTree::UpdateType> Updates; local 2256 std::vector<DominatorTree::UpdateType> Updates; local [all...] |
H A D | LoopRotationUtils.cpp | 433 SmallVector<DominatorTree::UpdateType, 3> Updates; local 434 Updates.push_back({DominatorTree::Insert, OrigPreheader, Exit}); 435 Updates.push_back({DominatorTree::Insert, OrigPreheader, NewHeader}); 436 Updates.push_back({DominatorTree::Delete, OrigPreheader, OrigHeader}); 437 DT->applyUpdates(Updates); 440 MSSAU->applyUpdates(Updates, *DT);
|
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/Analysis/ |
H A D | DomTreeUpdater.h | 93 /// 1. Eager UpdateStrategy: Updates are submitted and then flushed 95 /// 2. Lazy UpdateStrategy: Updates are submitted but only flushed when you 121 void applyUpdates(ArrayRef<DominatorTree::UpdateType> Updates); 144 void applyUpdatesPermissive(ArrayRef<DominatorTree::UpdateType> Updates);
|
H A D | MemorySSAUpdater.h | 137 void applyUpdates(ArrayRef<CFGUpdate> Updates, DominatorTree &DT); 139 void applyInsertUpdates(ArrayRef<CFGUpdate> Updates, DominatorTree &DT);
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | JumpThreading.cpp | 1054 std::vector<DominatorTree::UpdateType> Updates; local 1058 Updates.reserve(BBTerm->getNumSuccessors()); 1063 Updates.push_back({DominatorTree::Delete, BB, Succ}); 1070 DTU->applyUpdatesPermissive(Updates); 1640 std::vector <DominatorTree::UpdateType> Updates; local 1641 Updates.reserve(BB->getTerminator()->getNumSuccessors() - 1); 1647 Updates.push_back({DominatorTree::Delete, BB, SuccBB}); 1655 DTU->applyUpdatesPermissive(Updates); 2166 std::vector<DominatorTree::UpdateType> Updates; local 2167 Updates 2326 std::vector<DominatorTree::UpdateType> Updates; local 2622 std::vector<DominatorTree::UpdateType> Updates; local [all...] |
H A D | LoopUnswitch.cpp | 971 SmallVector<DominatorTree::UpdateType, 3> Updates; local 973 Updates.push_back({DominatorTree::Insert, OldBranchParent, TrueDest}); 975 Updates.push_back({DominatorTree::Insert, OldBranchParent, FalseDest}); 979 Updates.push_back({DominatorTree::Delete, OldBranchParent, OldBranchSucc}); 981 DT->applyUpdates(Updates); 984 MSSAU->applyUpdates(Updates, *DT);
|
H A D | SimpleLoopUnswitch.cpp | 510 SmallVector<CFGUpdate, 1> Updates; local 511 Updates.push_back({cfg::UpdateKind::Insert, OldPH, UnswitchedBB}); 512 MSSAU->applyInsertUpdates(Updates, DT);
|
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/Support/ |
H A D | GenericDomTreeConstruction.h | 78 SmallVector<UpdateT, 4> Updates; member in struct:llvm::DomTreeBuilder::SemiNCAInfo::BatchUpdateInfo 712 // Updates the set of roots after insertion or deletion. This ensures that 847 // Updates immediate dominators and levels after insertion. 1155 static void ApplyUpdates(DomTreeT &DT, ArrayRef<UpdateT> Updates) { argument 1156 const size_t NumUpdates = Updates.size(); 1163 const auto &Update = Updates.front(); 1173 LLVM_DEBUG(dbgs() << "Legalizing " << BUI.Updates.size() << " updates\n"); 1174 cfg::LegalizeUpdates<NodePtr>(Updates, BUI.Updates, IsPostDom); 1176 const size_t NumLegalized = BUI.Updates 1604 CalculateWithUpdates(DomTreeT &DT, ArrayRef<typename DomTreeT::UpdateType> Updates) argument 1637 ApplyUpdates(DomTreeT &DT, ArrayRef<typename DomTreeT::UpdateType> Updates) argument [all...] |
H A D | GenericDomTree.h | 196 ArrayRef<typename DomTreeT::UpdateType> Updates); 208 ArrayRef<typename DomTreeT::UpdateType> Updates); 518 /// \param Updates An unordered sequence of updates to perform. 520 void applyUpdates(ArrayRef<UpdateType> Updates) { argument 521 DomTreeBuilder::ApplyUpdates(*this, Updates); 734 void recalculate(ParentType &Func, ArrayRef<UpdateType> Updates) { argument 736 DomTreeBuilder::CalculateWithUpdates(*this, Updates);
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/IPO/ |
H A D | GlobalDCE.cpp | 145 SmallVectorImpl<GlobalValue *> *Updates) { 150 if (Updates) 151 Updates->push_back(&GV); 154 MarkLive(*CM.second, Updates); // Recursion depth is only two because only 144 MarkLive(GlobalValue &GV, SmallVectorImpl<GlobalValue *> *Updates) argument
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | ScheduleDAG.cpp | 468 Updates.clear(); 531 for (auto &U : Updates) 533 Updates.clear(); 540 Dirty = Dirty || Updates.size() > 10; 545 Updates.emplace_back(Y, X);
|
/freebsd-12-stable/contrib/llvm-project/clang/lib/AST/ |
H A D | StmtOpenMP.cpp | 211 Dir->setUpdates(Exprs.Updates); 262 Dir->setUpdates(Exprs.Updates); 315 Dir->setUpdates(Exprs.Updates); 481 Dir->setUpdates(Exprs.Updates); 533 Dir->setUpdates(Exprs.Updates); 900 Dir->setUpdates(Exprs.Updates); 1045 Dir->setUpdates(Exprs.Updates); 1097 Dir->setUpdates(Exprs.Updates); 1148 Dir->setUpdates(Exprs.Updates); 1201 Dir->setUpdates(Exprs.Updates); [all...] |
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/IR/ |
H A D | CFGDiff.h | 104 GraphDiff(ArrayRef<cfg::Update<NodePtr>> Updates) { argument 106 cfg::LegalizeUpdates<NodePtr>(Updates, LegalizedUpdates, InverseGraph);
|
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/ |
H A D | BasicBlockUtils.h | 44 /// instruction. If \p Updates is specified, collect all necessary DT updates 48 SmallVectorImpl<DominatorTree::UpdateType> *Updates, 304 /// Updates DT and LI if given.
|
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
H A D | ScheduleDAG.h | 698 SmallVector<std::pair<SUnit *, SUnit *>, 16> Updates; member in class:llvm::SUnit::ScheduleDAGTopologicalSort 744 /// Updates the topological ordering to accommodate an edge to be 752 /// Updates the topological ordering to accommodate an an edge to be
|
/freebsd-12-stable/contrib/subversion/subversion/libsvn_wc/ |
H A D | wc-checks.sql | 31 SELECT RAISE(FAIL, 'Updates to REPOSITORY are not allowed.');
|
/freebsd-12-stable/contrib/llvm-project/clang/include/clang/AST/ |
H A D | StmtOpenMP.h | 584 // Updates, Finals, DependentCounters, 830 SmallVector<Expr *, 4> Updates; member in struct:clang::OMPLoopDirective::HelperExprs 883 Updates.resize(Size); 892 Updates[i] = nullptr;
|
/freebsd-12-stable/contrib/llvm-project/clang/lib/Sema/ |
H A D | SemaOpenMP.cpp | 7808 Built.Updates.resize(NestedLoopCount); 7905 Built.Updates[Cnt] = Update.get(); 14511 SmallVector<Expr *, 8> Updates; 14533 Updates.push_back(nullptr); 14546 Updates.push_back(nullptr); 14588 Updates.push_back(nullptr); 14593 Updates.push_back(Update.get()); 14605 Clause.setUpdates(Updates);
|