| /linux-6.14.4/fs/btrfs/tests/ |
| D | delayed-refs-tests.c | 5 #include "../delayed-ref.h"
204 test_err("failed to select delayed ref head: %ld", in simple_test()
207 test_err("failed to find delayed ref head"); in simple_test()
219 test_err("failed to select delayed ref"); in simple_test()
333 * Merge tests, validate that we do delayed ref merging properly, the ref counts
334 * all end up properly, and delayed refs are deleted once they're no longer
405 test_err("failed to select delayed ref head: %ld", in merge_tests()
408 test_err("failed to find delayed ref head"); in merge_tests()
455 test_err("failed to select delayed ref head: %ld", in merge_tests()
458 test_err("failed to find delayed ref head"); in merge_tests()
[all …]
|
| /linux-6.14.4/fs/btrfs/ |
| D | delayed-inode.h | 36 * Used for delayed nodes which is waiting to be dealt with by the
37 * worker. If the delayed node is inserted into the work queue, we
41 atomic_t items; /* for delayed items */
42 atomic_t items_seq; /* for delayed items */
43 int nodes; /* for delayed nodes */
55 /* Used to add the node into the delayed root's node list. */
92 * delayed node's mutex.
100 * Track if this delayed item was already logged.
101 * Protected by the mutex of the parent delayed inode.
|
| D | delayed-inode.c | 13 #include "delayed-inode.h"
340 * Look up the delayed item by key.
342 * @delayed_node: pointer to the delayed node
428 /* If it's in a rbtree, then we need to have delayed node locked. */ in __btrfs_remove_delayed_item()
522 * for the number of leaves that will be used, based on the delayed in btrfs_delayed_item_reserve_metadata()
640 * Insert a single delayed item or a batch of delayed items, as many as possible
641 * that fit in a leaf. The delayed items (dir index keys) are sorted by their key
643 * then it means at some point we had delayed dir indexes to add but they got
647 * fits within a gap between delayed dir index items.
671 * During normal operation the delayed index offset is continuously in btrfs_insert_delayed_item()
[all …]
|
| D | delayed-ref.c | 11 #include "delayed-ref.h"
23 * delayed back reference update tracking. For subvolume trees
25 * delayed processing. This avoids deep call chains where we
60 * @nr_refs: number of delayed refs to drop
63 * Drops the delayed ref head's count from the delayed refs rsv and free any
82 * Adjust the size of the delayed refs rsv.
107 * Try to take num_bytes from the transaction's local delayed reserve. in btrfs_update_delayed_refs_rsv()
109 * reserve doesn't have enough reserved space, the delayed refs reserve in btrfs_update_delayed_refs_rsv()
132 * Adjust the size of the delayed refs block reserve for 1 block group item
151 * Adjust the size of the delayed refs block reserve to release space for 1
[all …]
|
| D | delayed-ref.h | 64 * refs rbtree in the corresponding delayed ref head
119 * to make sure that only one process is running the delayed refs
144 * with this head ref, this is not adjusted as delayed refs are run,
152 * for a bytenr, so it is adjusted as delayed refs are run so that any
175 * until the delayed ref is processed. must_insert_reserved is
176 * used to flag a delayed ref so the accounting can be updated
197 /* Indicate that we are flushing delayed refs for the commit */
273 * Normally false, but for certain cases like delayed subtree scan,
|
| D | block-rsv.c | 49 * There is some logic here to refill the delayed refs rsv or the global rsv
63 * buffer in case our delayed refs reserve does not reserve enough space to
77 * We keep a running tally of how many delayed refs we have on the system.
78 * We assume each one of these delayed refs are going to use a full
83 * From there it's straightforward, removing a delayed ref means we remove its
281 * If we are a delayed block reserve then push to the global rsv, in btrfs_block_rsv_release()
282 * otherwise dump into the global delayed reserve if it is not full. in btrfs_block_rsv_release()
366 * But we also need space for the delayed ref updates from the unlink, in btrfs_update_global_block_rsv()
367 * so add BTRFS_UNLINK_METADATA_UNITS units for delayed refs, one for in btrfs_update_global_block_rsv()
509 * warn_on if we are short on our delayed refs reserve. in btrfs_use_block_rsv()
|
| D | Makefile | 31 compression.o delayed-ref.o relocation.o delayed-inode.o scrub.o \
47 tests/raid-stripe-tree-tests.o tests/delayed-refs-tests.o
|
| /linux-6.14.4/drivers/md/ |
| D | dm-delay.c | 84 struct dm_delay_info *delayed, *next; in flush_delayed_bios() local
95 list_for_each_entry_safe(delayed, next, &local_list, list) { in flush_delayed_bios()
97 if (flush_all || time_after_eq(jiffies, delayed->expires)) { in flush_delayed_bios()
98 struct bio *bio = dm_bio_from_per_bio_data(delayed, in flush_delayed_bios()
100 list_del(&delayed->list); in flush_delayed_bios()
102 delayed->class->ops--; in flush_delayed_bios()
109 next_expires = delayed->expires; in flush_delayed_bios()
111 next_expires = min(next_expires, delayed->expires); in flush_delayed_bios()
303 struct dm_delay_info *delayed; in delay_bio() local
309 delayed = dm_per_bio_data(bio, sizeof(struct dm_delay_info)); in delay_bio()
[all …]
|
| /linux-6.14.4/Documentation/admin-guide/device-mapper/ |
| D | delay.rst | 35 # Create mapped device named "delayed" delaying read, write and flush operations for 500ms.
37 dmsetup create delayed --table "0 `blockdev --getsz $1` delay $1 0 500"
46 dmsetup create delayed --table "0 `blockdev --getsz $1` delay $1 2048 0 $2 4096 400"
54 dmsetup create delayed --table "0 `blockdev --getsz $1` delay $1 0 50 $2 0 100 $1 0 333"
|
| /linux-6.14.4/fs/ext4/ |
| D | extents_status.c | 27 * extent tree, whose goal is only track delayed extents in memory to
34 * Currently the first step has been done. All delayed extents are
35 * tracked in the tree. It maintains the delayed extent when a delayed
36 * allocation is issued, and the delayed extent is written out or
53 * are under high memory pressure. Delayed extents will not be
66 * Without extent status tree, ext4 identifies a delayed extent by looking
71 * block or a range of blocks are belonged to a delayed extent.
75 * FIEMAP looks up page cache to identify delayed allocations from holes.
82 * already under delayed allocation or not to determine whether
87 * mapped, If there are not very many delayed buffers, then it is
[all …]
|
| /linux-6.14.4/Documentation/filesystems/xfs/ |
| D | xfs-delayed-logging-design.rst | 19 the basic concepts covered, the design of the delayed logging mechanism is
373 Delayed Logging: Concepts
390 is the fundamental goal of delayed logging.
399 Delayed logging is the name we've given to keeping and tracking transactional
408 One of the key changes that delayed logging makes to the operation of the
423 It should be noted that delayed logging is not an innovative new concept that
431 The fundamental requirements for delayed logging in XFS are simple:
442 Delayed Logging: Design
457 the delayed logging tracking lock to commit the transaction. However, the
458 flushing thread has the delayed logging tracking lock already held, and is
[all …]
|
| /linux-6.14.4/tools/perf/pmu-events/arch/x86/ivytown/ |
| D | uncore-power.json | 151 …"PublicDescription": "Number of times that a deep C state was requested, but the delayed C state a…
160 …"PublicDescription": "Number of times that a deep C state was requested, but the delayed C state a…
169 …"PublicDescription": "Number of times that a deep C state was requested, but the delayed C state a…
178 …"PublicDescription": "Number of times that a deep C state was requested, but the delayed C state a…
187 …"PublicDescription": "Number of times that a deep C state was requested, but the delayed C state a…
196 …"PublicDescription": "Number of times that a deep C state was requested, but the delayed C state a…
205 …"PublicDescription": "Number of times that a deep C state was requested, but the delayed C state a…
214 …"PublicDescription": "Number of times that a deep C state was requested, but the delayed C state a…
223 …"PublicDescription": "Number of times that a deep C state was requested, but the delayed C state a…
232 …"PublicDescription": "Number of times that a deep C state was requested, but the delayed C state a…
[all …]
|
| /linux-6.14.4/drivers/staging/media/atomisp/pci/ |
| D | ia_css_err.h | 20 …IA_CSS_FW_WARNING_ISYS_QUEUE_FULL, /* < CSS system delayed because of insufficient space in the IS…
22 …IA_CSS_FW_WARNING_PSYS_QUEUE_FULL, /* < CSS system delayed because of insufficient space in the PS…
24 …IA_CSS_FW_WARNING_CIRCBUF_ALL_LOCKED, /* < CSS system delayed because of insufficient available bu…
|
| /linux-6.14.4/Documentation/ABI/testing/ |
| D | sysfs-devices-xenbus | 20 pv device has been delayed in order to avoid stalls due to
30 trigger delayed EOI processing.
37 before delayed EOI processing is triggered for a Xen pv
|
| /linux-6.14.4/tools/virtio/ |
| D | vhost_net_test.c | 276 bool delayed, int bufs) in run_tx_test() argument
330 if (delayed) { in run_tx_test()
343 bool delayed, int bufs) in run_rx_test() argument
441 .name = "delayed-interrupt",
445 .name = "no-delayed-interrupt",
468 " [--delayed-interrupt]" in help()
482 bool delayed = false; in main() local
504 delayed = true; in main()
528 run_rx_test(&dev, &dev.vqs[0], delayed, nbufs); in main()
529 run_tx_test(&dev, &dev.vqs[1], delayed, nbufs); in main()
|
| D | virtio_test.c | 170 bool delayed, int batch, int reset_n, int bufs) in run_test() argument
262 if (delayed) { in run_test()
309 .name = "delayed-interrupt",
313 .name = "no-delayed-interrupt",
336 " [--delayed-interrupt]" in help()
351 bool delayed = false; in main() local
372 delayed = true; in main()
401 run_test(&dev, &dev.vqs[0], delayed, batch, reset, 0x100000); in main()
|
| /linux-6.14.4/tools/testing/selftests/drivers/net/mlxsw/ |
| D | tc_action_hw_stats.sh | 86 skip_sw dst_ip 192.0.2.2 action drop hw_stats delayed
87 check_fail $? "Unexpected success in adding rule with delayed hw_stats"
89 log_test "delayed hw_stats"
|
| /linux-6.14.4/sound/pci/mixart/ |
| D | mixart_core.h | 217 u32 delayed; member
230 u32 delayed; member
387 u32 delayed; member
437 u32 delayed; member
497 u32 delayed; member
542 u32 delayed; member
|
| /linux-6.14.4/include/linux/ |
| D | devm-helpers.h | 35 * devm_delayed_work_autocancel - Resource-managed delayed work allocation
40 * Initialize delayed work which is automatically cancelled when driver is
41 * detached. A few drivers need delayed work which must be cancelled before
|
| /linux-6.14.4/net/ipv4/ |
| D | tcp_yeah.c | 94 * because delayed ACKs can cover more than one segment, so they in tcp_yeah_cong_avoid()
97 * Another unfortunate fact of life is that delayed ACKs delay the in tcp_yeah_cong_avoid()
106 * at least one RTT sample that wasn't from a delayed ACK. in tcp_yeah_cong_avoid()
109 * means they're almost certainly delayed ACKs. in tcp_yeah_cong_avoid()
125 * of delayed ACKs, at the cost of noticing congestion in tcp_yeah_cong_avoid()
|
| D | tcp_vegas.c | 26 * o To filter out the noise caused by delayed ACKs, we use the
107 * avoid the effects of delayed ACKs)
185 * at least one RTT sample that wasn't from a delayed ACK. in tcp_vegas_cong_avoid()
188 * means they're almost certainly delayed ACKs. in tcp_vegas_cong_avoid()
209 * of delayed ACKs, at the cost of noticing congestion in tcp_vegas_cong_avoid()
|
| /linux-6.14.4/Documentation/misc-devices/ |
| D | bh1770glc.rst | 36 by using a delayed work. As long as there is proximity threshold above
37 interrupts the delayed work is pushed forward. So, when proximity level goes
38 below the threshold value, there is no interrupt and the delayed work will
|
| /linux-6.14.4/Documentation/devicetree/bindings/memory-controllers/ |
| D | ti,gpmc-child.yaml | 129 description: ADV signal is delayed by half GPMC clock
133 description: CS signal is delayed by half GPMC clock
149 description: OE signal is delayed by half GPMC clock
153 description: WE signal is delayed by half GPMC clock
|
| /linux-6.14.4/include/net/iucv/ |
| D | af_iucv.h | 100 /* transmission of skb was done successfully (delayed) */
102 /* target unreachable (detected delayed) */
104 /* general error (detected delayed) */
|
| /linux-6.14.4/arch/x86/kernel/cpu/ |
| D | bus_lock.c | 196 * In order for each CPU to schedule its delayed work independently of the
197 * others, delayed work struct must be per-CPU. This is not required when
199 * the number of simultaneously scheduled delayed works to 1.
204 * If a CPU goes offline with pending delayed work to re-enable split lock
205 * detection then the delayed work will be executed on some other CPU. That
|