| /linux-6.12.1/include/linux/atomic/ |
| D | atomic-instrumented.h | 95 * Atomically updates @v to (@v + @i) with relaxed ordering.
113 * Atomically updates @v to (@v + @i) with full ordering.
132 * Atomically updates @v to (@v + @i) with acquire ordering.
150 * Atomically updates @v to (@v + @i) with release ordering.
169 * Atomically updates @v to (@v + @i) with relaxed ordering.
187 * Atomically updates @v to (@v + @i) with full ordering.
206 * Atomically updates @v to (@v + @i) with acquire ordering.
224 * Atomically updates @v to (@v + @i) with release ordering.
243 * Atomically updates @v to (@v + @i) with relaxed ordering.
261 * Atomically updates @v to (@v - @i) with relaxed ordering.
[all …]
|
| D | atomic-long.h | 111 * Atomically updates @v to (@v + @i) with relaxed ordering.
132 * Atomically updates @v to (@v + @i) with full ordering.
153 * Atomically updates @v to (@v + @i) with acquire ordering.
174 * Atomically updates @v to (@v + @i) with release ordering.
195 * Atomically updates @v to (@v + @i) with relaxed ordering.
216 * Atomically updates @v to (@v + @i) with full ordering.
237 * Atomically updates @v to (@v + @i) with acquire ordering.
258 * Atomically updates @v to (@v + @i) with release ordering.
279 * Atomically updates @v to (@v + @i) with relaxed ordering.
300 * Atomically updates @v to (@v - @i) with relaxed ordering.
[all …]
|
| D | atomic-arch-fallback.h | 537 * Atomically updates @v to (@v + @i) with relaxed ordering.
554 * Atomically updates @v to (@v + @i) with full ordering.
581 * Atomically updates @v to (@v + @i) with acquire ordering.
608 * Atomically updates @v to (@v + @i) with release ordering.
634 * Atomically updates @v to (@v + @i) with relaxed ordering.
657 * Atomically updates @v to (@v + @i) with full ordering.
684 * Atomically updates @v to (@v + @i) with acquire ordering.
711 * Atomically updates @v to (@v + @i) with release ordering.
737 * Atomically updates @v to (@v + @i) with relaxed ordering.
760 * Atomically updates @v to (@v - @i) with relaxed ordering.
[all …]
|
| /linux-6.12.1/Documentation/RCU/ |
| D | checklist.rst | 32 for lockless updates. This does result in the mildly
34 rcu_read_unlock() are used to protect updates, however, this
45 c. restricting updates to a single task.
88 be running while updates are in progress. There are a number
107 c. Make updates appear atomic to readers. For example,
108 pointer updates to properly aligned fields will
119 d. Carefully order the updates and the reads so that readers
191 e. Updates must ensure that initialization of a given
222 Restructure your code so that it batches the updates, allowing
287 primitive will correspondingly delay updates. In contrast,
[all …]
|
| /linux-6.12.1/fs/xfs/ |
| D | xfs_rmap_item.h | 17 * that records the associated rmapbt updates. Typically, the first
19 * transactions containing rmapbt updates, and finally transactions with any
20 * bnobt/cntbt updates.
25 * (rmapbt/bnobt/cntbt) metadata updates in the non-first transaction.
63 * some rmapbt updates mentioned in an earlier rui item have been performed.
|
| D | xfs_refcount_item.h | 17 * transaction that records the associated refcountbt updates.
22 * to replay the refcountbt metadata updates.
62 * fact that some refcountbt updates mentioned in an earlier cui item
|
| D | xfs_bmap_item.h | 17 * that records the associated bmbt updates.
22 * bmbt metadata updates in the non-first transaction.
60 * some bmbt updates mentioned in an earlier bui item have been performed.
|
| /linux-6.12.1/fs/bcachefs/ |
| D | journal.h | 8 * The primary purpose of the journal is to log updates (insertions) to the
9 * b-tree, to avoid having to do synchronous updates to the b-tree on disk.
13 * but did handle unclean shutdowns by doing all index updates synchronously
16 * Updates to interior nodes still happen synchronously and without the journal
17 * (for simplicity) - this may change eventually but updates to interior nodes
26 * For synchronous updates (where we're waiting on the index update to hit
30 * Synchronous updates are specified by passing a closure (@flush_cl) to
73 * Open/dirty journal entries are journal entries that contain b-tree updates
92 * Journalling of index updates is done at the same time as the b-tree itself is
|
| D | journal_seq_blacklist.c | 12 * To guarantee order of btree updates after a crash, we need to detect when a
14 * successfully written, and ignore it - effectively ignoring any btree updates
18 * updates that weren't written to the journal yet: if b was updated after a,
19 * but b was flushed and not a - oops; on recovery we'll find that the updates
20 * to b happened, but not the updates to a that happened before it.
28 * contain updates for; then, on startup, the btree code queries the journal
|
| D | btree_update.h | 32 x(skip_accounting_apply, "we're in journal replay - accounting updates have already been applied")
136 * Most updates skip the btree write buffer until journal replay is in bch2_trans_update_buffered()
142 * But accounting updates don't overwrite, they're deltas, and they have in bch2_trans_update_buffered()
144 * able to tell which updates need to be applied: in bch2_trans_update_buffered()
170 * This is main entry point for btree updates.
199 for (struct btree_insert_entry *_i = (_trans)->updates; \
200 (_i) < (_trans)->updates + (_trans)->nr_updates; \
|
| D | disk_accounting_format.h | 23 * Unlike with other key types, updates are _deltas_, and the deltas are not
39 * For this to work, we must maintain this strict time ordering of updates as
45 * updates from journal replay to be lost.
|
| D | btree_trans_commit.c | 75 return i != trans->updates && in same_leaf_as_prev()
82 return i + 1 < trans->updates + trans->nr_updates && in same_leaf_as_next()
106 while (--i >= trans->updates) { in trans_lock_write_fail()
326 /* Cached btree updates: */
528 * Running triggers will append more updates to the list of updates as in run_btree_triggers()
535 i < trans->nr_updates && trans->updates[i].btree_id <= btree_id; in run_btree_triggers()
537 if (trans->updates[i].btree_id != btree_id) in run_btree_triggers()
540 int ret = run_one_trans_trigger(trans, trans->updates + i, overwrite); in run_btree_triggers()
569 trans->updates[btree_id_start].btree_id < btree_id) in bch2_trans_commit_run_triggers()
578 struct btree_insert_entry *i = trans->updates + idx; in bch2_trans_commit_run_triggers()
[all …]
|
| /linux-6.12.1/drivers/gpu/drm/panthor/ |
| D | panthor_fw.h | 301 * Used for host updates/events.
308 * Used for FW updates/events.
345 * Used for host updates/events.
352 * Used for FW updates/events.
389 * Used for host updates/events.
396 * Used for FW updates/events.
422 * Anything requiring atomic updates to multiple registers requires a dedicated lock.
448 * Anything requiring atomic updates to multiple registers requires a dedicated lock.
|
| /linux-6.12.1/fs/xfs/scrub/ |
| D | iscan.c | 41 * live updates, which means there must be a provision to update the new index
42 * when updates are made to inodes that already been scanned. The iscan lock
46 * To keep the new index up to date with other metadata updates being made to
195 * the same time so that the scan user can receive live updates for inodes that
213 * live updates. in xchk_iscan_move_cursor()
240 /* All live updates will be applied from now on */ in xchk_iscan_finish()
497 * the _want_live_update predicate will pass through all live updates. in xchk_iscan_iget()
738 * If so, it is newly allocated and will not be scanned. All live updates to
776 /* Scan is finished, caller should receive all updates. */ in xchk_iscan_want_live_update()
784 * start of the scan range. The caller should not receive any updates. in xchk_iscan_want_live_update()
[all …]
|
| D | nlinks.h | 19 * step because the collection iscan coordinates live updates to the
27 * Hook into directory updates so that we can receive live updates
|
| /linux-6.12.1/drivers/net/ethernet/intel/fm10k/ |
| D | fm10k_common.c | 299 * fm10k_update_hw_base_48b - Updates 48-bit statistic base value
320 * fm10k_update_hw_stats_tx_q - Updates TX queue statistics counters
325 * Function updates the TX queue statistics counters that are related to the
371 * fm10k_update_hw_stats_rx_q - Updates RX queue statistics counters
376 * Function updates the RX queue statistics counters that are related to the
427 * fm10k_update_hw_stats_q - Updates queue statistics counters
433 * Function updates the queue statistics counters that are related to the
453 * Function invalidates the index values for the queues so any updates that
|
| /linux-6.12.1/drivers/base/firmware_loader/ |
| D | Kconfig | 15 o /lib/firmware/updates/UTS_RELEASE
16 o /lib/firmware/updates
227 bool "Enable users to initiate firmware updates using sysfs"
232 sysfs interface that allows firmware updates to be initiated from
236 to support cards that rely on user-initiated updates for firmware files.
|
| /linux-6.12.1/drivers/gpu/drm/msm/ |
| D | msm_atomic.c | 82 * Flush hardware updates: in msm_atomic_async_commit()
232 * Push atomic updates down to hardware: in msm_atomic_commit_tail()
242 /* async updates are limited to single-crtc updates: */ in msm_atomic_commit_tail()
288 * Flush hardware updates: in msm_atomic_commit_tail()
|
| /linux-6.12.1/Documentation/ABI/testing/ |
| D | sysfs-bus-coresight-devices-trbe | 12 Description: (Read) Shows if TRBE updates in the memory are with access
13 and dirty flag updates as well. This value is fetched from
|
| D | sysfs-bus-counter | 208 Rising edges on signal A updates the respective count.
213 signal A updates the respective count; if the direction
215 updates the respective count. Quadrature encoding
220 signal B updates the respective count; if the direction
222 updates the respective count. Quadrature encoding
226 Any state transition on quadrature pair signal A updates
231 Any state transition on quadrature pair signal B updates
237 updates the respective count. Quadrature encoding
|
| /linux-6.12.1/drivers/net/ |
| D | LICENSE.SRC | 14 on an "as-is" basis. No further updates to this software should be
15 expected. Although updates may occur, no commitment exists.
|
| /linux-6.12.1/Documentation/core-api/ |
| D | entry.rst | 4 All transitions between execution domains require state updates which are
5 subject to strict ordering constraints. State updates are required for the
167 irq_enter_rcu() updates the preemption count which makes in_hardirq()
212 The state update on entry is handled in irqentry_nmi_enter() which updates
278 while handling an NMI. So NMI entry code has to be reentrant and state updates
|
| /linux-6.12.1/drivers/gpu/drm/amd/amdgpu/ |
| D | amdgpu_hmm.c | 35 * about updates on the page tables of a process.
122 * amdgpu_hmm_register - register a BO for notifier updates
154 * amdgpu_hmm_unregister - unregister a BO for notifier updates
158 * Remove any registration of mmu notifier updates from the buffer object.
|
| /linux-6.12.1/Documentation/driver-api/firmware/ |
| D | fw_search_path.rst | 9 * /lib/firmware/updates/UTS_RELEASE/
10 * /lib/firmware/updates/
|
| /linux-6.12.1/drivers/gpu/drm/radeon/ |
| D | radeon_mn.c | 88 * radeon_mn_register - register a BO for notifier updates
116 * radeon_mn_unregister - unregister a BO for notifier updates
120 * Remove any registration of MMU notifier updates from the buffer object.
|