/freebsd/contrib/dialog/package/debian/ |
H A D | changelog | 3 * maintenance updates 9 * maintenance updates 15 * maintenance updates 21 * maintenance updates 27 * maintenance updates 33 * maintenance updates 39 * maintenance updates 45 * maintenance updates 51 * maintenance updates 57 * maintenance updates [all …]
|
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/ |
H A D | GenericDomTreeUpdater.h | 54 "Pending updates were not flushed by derived class."); in ~GenericDomTreeUpdater() 85 /// as having no pending updates. This function does not check 92 /// Returns true if there are DomTreeT updates queued. 100 /// Returns true if there are PostDomTreeT updates queued. 111 /// These methods provide APIs for submitting updates to the DomTreeT and 116 /// 1. Eager UpdateStrategy: Updates are submitted and then flushed 118 /// 2. Lazy UpdateStrategy: Updates are submitted but only flushed when you 120 /// when you submit a bunch of updates multiple times which can then 121 /// add up to a large number of updates between two queries on the 122 /// DomTreeT. The incremental updater can reschedule the updates or [all …]
|
H A D | GenericDomTreeUpdaterImpl.h | 59 ArrayRef<typename DomTreeT::UpdateType> Updates) { in applyUpdates() argument 64 PendUpdates.reserve(PendUpdates.size() + Updates.size()); in applyUpdates() 65 for (const auto &U : Updates) in applyUpdates() 73 DT->applyUpdates(Updates); in applyUpdates() 75 PDT->applyUpdates(Updates); in applyUpdates() 80 applyUpdatesPermissive(ArrayRef<typename DomTreeT::UpdateType> Updates) { in applyUpdatesPermissive() argument 86 for (const auto &U : Updates) { in applyUpdatesPermissive() 88 // Because it is illegal to submit updates that have already been applied in applyUpdatesPermissive() 89 // and updates to an edge need to be strictly ordered, in applyUpdatesPermissive() 98 // 1. it is illegal to submit updates that have already been applied, in applyUpdatesPermissive() [all …]
|
H A D | DomTreeUpdater.h | 46 /// These methods provide APIs for submitting updates to the DominatorTree and 51 /// 1. Eager UpdateStrategy: Updates are submitted and then flushed 53 /// 2. Lazy UpdateStrategy: Updates are submitted but only flushed when you 55 /// when you submit a bunch of updates multiple times which can then 56 /// add up to a large number of updates between two queries on the 57 /// DominatorTree. The incremental updater can reschedule the updates or 59 /// process depending on the number of updates.
|
H A D | MemorySSAUpdater.h | 12 // automatically updates the MemorySSA IR to be correct. 120 /// Apply CFG updates, analogous with the DT edge updates. By default, the 122 /// update the DT with the same updates. 123 void applyUpdates(ArrayRef<CFGUpdate> Updates, DominatorTree &DT, 125 /// Apply CFG insert updates, analogous with the DT edge updates. 126 void applyInsertUpdates(ArrayRef<CFGUpdate> Updates, DominatorTree &DT); 185 /// which will perform all the necessary MSSA updates. If these APIs are used,
|
/freebsd/usr.sbin/freebsd-update/ |
H A D | freebsd-update.8 | 31 .Nd fetch and install binary updates to FreeBSD 50 updates to the 53 .Sh BINARY UPDATES AVAILABILITY 54 Binary updates are not available for every single 58 In general, binary updates are available for ALPHA, BETA, RC, and RELEASE 85 Security Team only builds updates for releases shipped in binary form by the 163 all available binary updates. 165 Sleep a random amount of time between 1 and 3600 seconds, then download updates 169 If updates are downloaded, an email will be sent (to root or a different 176 machines will simultaneously attempt to fetch updates. [all …]
|
H A D | freebsd-update.sh | 51 -s server -- Server from which to fetch updates 60 fetch -- Fetch updates from server 61 cron -- Sleep rand(3600) seconds, fetch updates, and send an 62 email if updates were found 64 updatesready -- Check if there are fetched updates ready to install 65 install -- Install downloaded updates or upgrades 66 rollback -- Uninstall most recently installed updates 144 # Set the name of the server (pool) from which to fetch updates 245 # Add to the list of paths under which updates will be ignored. 259 # Add to the list of paths within which updates will be performed only if the [all …]
|
/freebsd/share/man/man7/ |
H A D | ffs.7 |
|
H A D | mitigations.7 | 363 releasing microcode updates, which may then be bundled into platform firmware 364 updates 365 .Pq historically called BIOS updates for PCs 368 Platform firmware updates, if available from the manufacturer, 376 If platform firmware updates are no longer available, 384 these updates when available, as early as possible in the boot process, 397 .Pq which sometimes requires firmware updates , 447 microcode updates have been actually released and community-tested.
|
/freebsd/share/man/man4/ |
H A D | ffs.4 | 78 .Ss Soft Updates 81 The soft updates feature tracks writes to the disk 86 To create a new file system with the soft updates 101 It is possible to enable soft updates on an 109 Soft updates can also add journaling that reduces the time spent by 117 To create a new file system with both the soft updates 118 and soft updates journaling enabled, 130 It is possible to enable soft updates journaling on an 138 This flag automatically enables the soft updates feature 144 already exists before enabling the soft updates journaling. [all …]
|
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
H A D | AMDGPUUnifyDivergentExitNodes.cpp | 161 std::vector<DominatorTree::UpdateType> Updates; in unifyReturnBlockSet() local 162 Updates.reserve(ReturningBlocks.size()); in unifyReturnBlockSet() 172 Updates.emplace_back(DominatorTree::Insert, BB, NewRetBlock); in unifyReturnBlockSet() 176 DTU.applyUpdates(Updates); in unifyReturnBlockSet() 177 Updates.clear(); in unifyReturnBlockSet() 207 std::vector<DominatorTree::UpdateType> Updates; in run() local 242 Updates.emplace_back(DominatorTree::Insert, BB, DummyReturnBB); in run() 249 Updates.reserve(Updates.size() + 2 * Successors.size() + 2); in run() 253 Updates.emplace_back(DominatorTree::Insert, BB, TransitionBB); in run() 255 Updates.emplace_back(DominatorTree::Insert, TransitionBB, Successor); in run() [all …]
|
/freebsd/contrib/ldns/drill/ |
H A D | ChangeLog.22-nov-2005 | 46 * big configure.ac and Makefile.in updates (made more general) 57 * configure.ac updates 58 * secure resolving updates (still doesn't work) 72 * Numerous smaller updates in documentation 79 * build updates 97 * lots of various updates 103 * --trace updates 104 * --chase updates
|
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | IndirectBrExpandPass.cpp | 178 SmallVector<DominatorTree::UpdateType, 8> Updates; in runImpl() local 180 Updates.reserve(IndirectBrSuccs.size()); in runImpl() 184 Updates.push_back({DominatorTree::Delete, IBr->getParent(), SuccBB}); in runImpl() 190 assert(Updates.size() == IndirectBrSuccs.size() && in runImpl() 192 DTU->applyUpdates(Updates); in runImpl() 216 SmallVector<DominatorTree::UpdateType, 8> Updates; in runImpl() local 225 Updates.reserve(IndirectBrSuccs.size()); in runImpl() 227 Updates.push_back({DominatorTree::Delete, IBr->getParent(), SuccBB}); in runImpl() 228 assert(Updates.size() == IndirectBrSuccs.size() && in runImpl() 244 Updates.reserve(IndirectBrs.size() + 2 * IndirectBrSuccs.size()); in runImpl() [all …]
|
/freebsd/contrib/llvm-project/llvm/include/llvm/Support/ |
H A D | CFGDiff.h | 28 // also equivalent to applying updates in reverse. 53 // a getChildren method to get a Node's children based on the additional updates 65 // By default, it is assumed that, given a CFG and a set of updates, we wish 66 // to apply these updates as given. If UpdatedAreReverseApplied is set, the 67 // updates will be applied in reverse: deleted edges are considered re-added 71 // Keep the list of legalized updates for a deterministic order of updates 72 // when using a GraphDiff for incremental updates in the DominatorTree. 95 GraphDiff(ArrayRef<cfg::Update<NodePtr>> Updates, 97 cfg::LegalizeUpdates<NodePtr>(Updates, LegalizedUpdate [all...] |
H A D | BinaryStreamReader.h | 45 /// Updates the stream's offset to point after the newly read data. 53 /// depends on the implementation of the underlying stream. Updates the 62 /// buffer into \p Dest. Updates the stream's offset to point after the newly 103 /// on the implementation of the underlying stream. Updates the stream's 118 /// on the implementation of the underlying stream. Updates the stream's 126 /// equivalent to calling getUnderlyingStream().slice(Offset). Updates the 135 /// Updates the stream's offset to point after the newly read object. Never 144 /// Updates the stream's offset to point after the newly read object. Never 154 /// Updates the stream's offset to point after the newly read object. Whether 171 /// type T can be safely treated in this manner. Updates th [all...] |
H A D | GenericDomTree.h | 201 ArrayRef<typename DomTreeT::UpdateType> Updates); 531 /// This function should be used when there were multiple CFG updates after 532 /// the last dominator tree update. It takes care of performing the updates 535 /// The functions expects the sequence of updates to be balanced. Eg.: 545 /// The applyUpdates function can reorder the updates and remove redundant 551 /// updates on reverse edges internally (so there's no need to swap the 553 /// The type of updates is the same for DomTreeBase<T> and PostDomTreeBase<T> 556 /// \param Updates An ordered sequence of updates to perform. The current CFG 557 /// and the reverse of these updates provides the pre-view of the CFG. 559 void applyUpdates(ArrayRef<UpdateType> Updates) { [all …]
|
H A D | CFGUpdate.h | 56 // LegalizeUpdates function simplifies updates assuming a graph structure. 58 // a) It removes redundant updates, which makes it easier to reverse-apply 60 // b) It optimizes away updates that cancel each other out, as the end result 69 // of updates contains multiple updates of the same kind and we assert for 98 // of work needed to perform the series of updates.
|
/freebsd/share/man/man5/ |
H A D | freebsd-update.conf.5 | 57 these are part of updates downloaded. 72 part of updates downloaded. 213 updates to paths which start with a string matching one of 226 when installing updates if these have been modified locally. 229 of the RSA key which will be trusted to sign updates. 237 updates to paths which start with a string matching one of 244 server or server pool from which updates will be downloaded. 265 updates to paths which start with a string matching one of 275 in which temporary files and downloaded updates will be stored.
|
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | BasicBlockUtils.cpp | 64 SmallVectorImpl<DominatorTree::UpdateType> *Updates, in detachDeadBlocks() argument 72 if (Updates && UniqueSuccessors.insert(Succ).second) in detachDeadBlocks() 73 Updates->push_back({DominatorTree::Delete, BB, Succ}); in detachDeadBlocks() 92 "applying corresponding DTU updates."); in detachDeadBlocks() 112 SmallVector<DominatorTree::UpdateType, 4> Updates; in DeleteDeadBlocks() local 113 detachDeadBlocks(BBs, DTU ? &Updates : nullptr, KeepOneInputPHIs); in DeleteDeadBlocks() 116 DTU->applyUpdates(Updates); in DeleteDeadBlocks() 157 MemDep->removeInstruction(PN); // Memdep updates AA itself. in FoldSingleEntryPHINodes() 238 assert(!DTU && "cannot use both DT and DTU for updates"); in MergeBlockIntoPredecessor() 249 std::vector<DominatorTree::UpdateType> Updates; in MergeBlockIntoPredecessor() local [all …]
|
/freebsd/usr.sbin/rpc.yppasswdd/ |
H A D | rpc.yppasswdd.8 | 65 template file and then updates the NIS 76 These updates are typically done using 121 sophisticated updates on the NIS passwd maps. 262 is invoked with this flag, it will perform map updates in place. 278 updates for the super-user on the NIS master server. 282 flag will cause it to log informational messages for all updates. 299 ports from successfully submitting password updates. 350 This is not a problem for password updates since the plaintext password
|
/freebsd/sys/contrib/openzfs/tests/zfs-tests/tests/functional/limits/ |
H A D | snapshot_count.ksh | 26 # 3. Verify 'zfs rename' updates counts across different hierarchies 27 # 4. Verify 'zfs promote' updates counts across different hierarchies 69 # 3. Verify 'zfs rename' updates counts across different hierarchies 78 # 4. Verify 'zfs promote' updates counts across different hierarchies
|
/freebsd/sys/contrib/openzfs/include/sys/ |
H A D | mntent.h | 60 #define MNTOPT_DIRSYNC "dirsync" /* do dir updates synchronously */ 71 #define MNTOPT_RELATIME "relatime" /* allow relative time updates */ 72 #define MNTOPT_NORELATIME "norelatime" /* do not allow relative time updates */ 73 #define MNTOPT_STRICTATIME "strictatime" /* strict access time updates */ 74 #define MNTOPT_NOSTRICTATIME "nostrictatime" /* No strict access time updates */
|
/freebsd/include/protocols/ |
H A D | routed.h | 149 * If changes occur between updates, dynamic updates containing only changes 151 * between MIN_WAITTIME and MAX_WAITTIME, and no additional dynamic updates 155 * After EXPIRE_TIME without updates, the entry is marked invalid, 160 #define MIN_WAITTIME 2 /* min sec until next flash updates */
|
/freebsd/share/man/man9/ |
H A D | scheduler.9 | 196 It updates the group's estimated CPU time and then adjusts the priority via 201 function updates all process priorities. 202 First, it updates statistics that track how long processes have been in various 204 Secondly, it updates the estimated CPU time for the current process such 213 Thirdly, it updates the %CPU estimate used by utilities such as
|
/freebsd/contrib/netbsd-tests/fs/tmpfs/ |
H A D | t_times.sh | 35 "manipulating it updates times correctly" 69 "manipulating it updates times correctly" 94 "manipulating it updates times correctly" 115 atf_set "descr" "Tests that linking to an existing file updates" \ 137 atf_set "descr" "Tests that renaming an existing file updates" \
|