| /kernel/linux/linux-6.6/drivers/md/ |
| D | dm-delay.c | 83 struct dm_delay_info *delayed, *next; in flush_delayed_bios() local
89 list_for_each_entry_safe(delayed, next, &dc->delayed_bios, list) { in flush_delayed_bios()
90 if (flush_all || time_after_eq(jiffies, delayed->expires)) { in flush_delayed_bios()
91 struct bio *bio = dm_bio_from_per_bio_data(delayed, in flush_delayed_bios()
93 list_del(&delayed->list); in flush_delayed_bios()
95 delayed->class->ops--; in flush_delayed_bios()
101 next_expires = delayed->expires; in flush_delayed_bios()
103 next_expires = min(next_expires, delayed->expires); in flush_delayed_bios()
247 struct dm_delay_info *delayed; in delay_bio() local
253 delayed = dm_per_bio_data(bio, sizeof(struct dm_delay_info)); in delay_bio()
[all …]
|
| /kernel/linux/linux-5.10/drivers/md/ |
| D | dm-delay.c | 82 struct dm_delay_info *delayed, *next; in flush_delayed_bios() local
88 list_for_each_entry_safe(delayed, next, &dc->delayed_bios, list) { in flush_delayed_bios()
89 if (flush_all || time_after_eq(jiffies, delayed->expires)) { in flush_delayed_bios()
90 struct bio *bio = dm_bio_from_per_bio_data(delayed, in flush_delayed_bios()
92 list_del(&delayed->list); in flush_delayed_bios()
94 delayed->class->ops--; in flush_delayed_bios()
100 next_expires = delayed->expires; in flush_delayed_bios()
102 next_expires = min(next_expires, delayed->expires); in flush_delayed_bios()
245 struct dm_delay_info *delayed; in delay_bio() local
251 delayed = dm_per_bio_data(bio, sizeof(struct dm_delay_info)); in delay_bio()
[all …]
|
| /kernel/linux/linux-6.6/fs/btrfs/ |
| D | delayed-inode.h | 28 * Used for delayed nodes which is waiting to be dealt with by the
29 * worker. If the delayed node is inserted into the work queue, we
33 atomic_t items; /* for delayed items */
34 atomic_t items_seq; /* for delayed items */
35 int nodes; /* for delayed nodes */
47 /* Used to add the node into the delayed root's node list. */
84 * delayed node's mutex.
92 * Track if this delayed item was already logged.
93 * Protected by the mutex of the parent delayed inode.
|
| D | delayed-inode.c | 13 #include "delayed-inode.h"
331 * __btrfs_lookup_delayed_item - look up the delayed item by key
332 * @delayed_node: pointer to the delayed node
423 /* If it's in a rbtree, then we need to have delayed node locked. */ in __btrfs_remove_delayed_item()
517 * for the number of leaves that will be used, based on the delayed in btrfs_delayed_item_reserve_metadata()
635 * Insert a single delayed item or a batch of delayed items, as many as possible
636 * that fit in a leaf. The delayed items (dir index keys) are sorted by their key
638 * then it means at some point we had delayed dir indexes to add but they got
642 * fits within a gap between delayed dir index items.
666 * During normal operation the delayed index offset is continuously in btrfs_insert_delayed_item()
[all …]
|
| D | delayed-ref.h | 63 * to make sure that only one process is running the delayed refs
94 * with this head ref, this is not adjusted as delayed refs are run,
102 * for a bytenr, so it is adjusted as delayed refs are run so that any
110 * until the delayed ref is processed. must_insert_reserved is
111 * used to flag a delayed ref so the accounting can be updated
141 /* Indicate that we are flushing delayed refs for the commit */
155 /* how many delayed ref updates we've queued, used by the
231 * Normally false, but for certain cases like delayed subtree scan,
|
| 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
62 * Drops the delayed ref head's count from the delayed refs rsv and free any
78 * Adjust the size of the delayed refs rsv.
103 * Transfer bytes to our delayed refs rsv.
145 * Refill based on our delayed refs usage.
150 * This will refill the delayed block_rsv up to 1 items size worth of space and
212 * compare two delayed tree backrefs with same bytenr and type
232 * compare two delayed data backrefs with same bytenr and type
[all …]
|
| D | block-rsv.c | 50 * There is some logic here to refill the delayed refs rsv or the global rsv
64 * buffer in case our delayed refs reserve does not reserve enough space to
78 * We keep a running tally of how many delayed refs we have on the system.
79 * We assume each one of these delayed refs are going to use a full
84 * From there it's straightforward, removing a delayed ref means we remove its
283 * into the delayed rsv if it is not full. in btrfs_block_rsv_release()
362 * But we also need space for the delayed ref updates from the unlink, in btrfs_update_global_block_rsv()
363 * so add BTRFS_UNLINK_METADATA_UNITS units for delayed refs, one for in btrfs_update_global_block_rsv()
507 * warn_on if we are short on our delayed refs reserve. in btrfs_use_block_rsv()
|
| /kernel/linux/linux-5.10/fs/btrfs/ |
| D | delayed-inode.h | 19 /* types of the delayed item */
27 * Used for delayed nodes which is waiting to be dealt with by the
28 * worker. If the delayed node is inserted into the work queue, we
32 atomic_t items; /* for delayed items */
33 atomic_t items_seq; /* for delayed items */
34 int nodes; /* for delayed nodes */
46 /* Used to add the node into the delayed root's node list. */
|
| D | delayed-ref.h | 67 * to make sure that only one process is running the delayed refs
92 * with this head ref, this is not adjusted as delayed refs are run,
100 * for a bytenr, so it is adjusted as delayed refs are run so that any
108 * until the delayed ref is processed. must_insert_reserved is
109 * used to flag a delayed ref so the accounting can be updated
148 /* how many delayed ref updates we've queued, used by the
229 * Normally false, but for certain cases like delayed subtree scan,
|
| D | delayed-ref.c | 10 #include "delayed-ref.h"
20 * delayed back reference update tracking. For subvolume trees
22 * delayed processing. This avoids deep call chains where we
76 * This drops the delayed ref head's count from the delayed refs rsv and frees
92 * btrfs_update_delayed_refs_rsv - adjust the size of the delayed refs rsv
93 * @trans - the trans that may have generated delayed refs
117 * btrfs_migrate_to_delayed_refs_rsv - transfer bytes to our delayed refs rsv.
165 * btrfs_delayed_refs_rsv_refill - refill based on our delayed refs usage.
169 * This will refill the delayed block_rsv up to 1 items size worth of space and
201 * compare two delayed tree backrefs with same bytenr and type
[all …]
|
| D | delayed-inode.c | 11 #include "delayed-inode.h"
332 * __btrfs_lookup_delayed_item - look up the delayed item by key
333 * @delayed_node: pointer to the delayed node
763 /* get keys of all the delayed items */ in btrfs_batch_insert_items()
1063 * Delayed iref deletion is for the inode who has only one link, in __btrfs_update_delayed_inode()
1077 * If we fail to update the delayed inode we need to abort the in __btrfs_update_delayed_inode()
1146 * outstanding delayed items cleaned up.
1184 * node. If the commit of delayed items was successful the path in __btrfs_run_delayed_items()
1194 * releasing the delayed node, as that requires taking the delayed node's in __btrfs_run_delayed_items()
1195 * mutex. If another task starts running delayed items before we take in __btrfs_run_delayed_items()
[all …]
|
| D | block-rsv.c | 47 * There is some logic here to refill the delayed refs rsv or the global rsv
61 * buffer in case our delayed refs reserve does not reserve enough space to
75 * We keep a running tally of how many delayed refs we have on the system.
76 * We assume each one of these delayed refs are going to use a full
81 * From there it's straightforward, removing a delayed ref means we remove its
285 * into the delayed rsv if it is not full. in btrfs_block_rsv_release()
378 * But we also need space for the delayed ref updates from the unlink, in btrfs_update_global_block_rsv()
379 * so its 10, 5 for the actual operation, and 5 for the delayed ref in btrfs_update_global_block_rsv()
506 * warn_on if we are short on our delayed refs reserve. in btrfs_use_block_rsv()
|
| /kernel/linux/linux-5.10/Documentation/filesystems/ |
| D | xfs-delayed-logging-design.rst | 4 XFS Delayed Logging Design
90 Delayed Logging: Concepts
107 is the fundamental goal of delayed logging.
116 Delayed logging is the name we've given to keeping and tracking transactional
125 One of the key changes that delayed logging makes to the operation of the
140 It should be noted that delayed logging is not an innovative new concept that
148 The fundamental requirements for delayed logging in XFS are simple:
159 Delayed Logging: Design
174 the delayed logging tracking lock to commit the transaction. However, the
175 flushing thread has the delayed logging tracking lock already held, and is
[all …]
|
| /kernel/linux/linux-6.6/tools/perf/pmu-events/arch/x86/ivytown/ |
| D | uncore-power.json | 134 …"PublicDescription": "Number of times that a deep C state was requested, but the delayed C state a…
142 …"PublicDescription": "Number of times that a deep C state was requested, but the delayed C state a…
150 …"PublicDescription": "Number of times that a deep C state was requested, but the delayed C state a…
158 …"PublicDescription": "Number of times that a deep C state was requested, but the delayed C state a…
166 …"PublicDescription": "Number of times that a deep C state was requested, but the delayed C state a…
174 …"PublicDescription": "Number of times that a deep C state was requested, but the delayed C state a…
182 …"PublicDescription": "Number of times that a deep C state was requested, but the delayed C state a…
190 …"PublicDescription": "Number of times that a deep C state was requested, but the delayed C state a…
198 …"PublicDescription": "Number of times that a deep C state was requested, but the delayed C state a…
206 …"PublicDescription": "Number of times that a deep C state was requested, but the delayed C state a…
[all …]
|
| /kernel/linux/linux-6.6/Documentation/filesystems/ |
| 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 …]
|
| /kernel/linux/linux-6.6/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
|
| /kernel/linux/linux-5.10/drivers/staging/media/atomisp/pci/ |
| D | ia_css_err.h | 29 …IA_CSS_FW_WARNING_ISYS_QUEUE_FULL, /* < CSS system delayed because of insufficient space in the IS…
31 …IA_CSS_FW_WARNING_PSYS_QUEUE_FULL, /* < CSS system delayed because of insufficient space in the PS…
33 …IA_CSS_FW_WARNING_CIRCBUF_ALL_LOCKED, /* < CSS system delayed because of insufficient available bu…
|
| /kernel/linux/linux-6.6/drivers/staging/media/atomisp/pci/ |
| D | ia_css_err.h | 29 …IA_CSS_FW_WARNING_ISYS_QUEUE_FULL, /* < CSS system delayed because of insufficient space in the IS…
31 …IA_CSS_FW_WARNING_PSYS_QUEUE_FULL, /* < CSS system delayed because of insufficient space in the PS…
33 …IA_CSS_FW_WARNING_CIRCBUF_ALL_LOCKED, /* < CSS system delayed because of insufficient available bu…
|
| /kernel/linux/linux-6.6/tools/virtio/ |
| 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()
|
| /kernel/linux/linux-5.10/tools/virtio/ |
| 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()
349 bool delayed = false; in main() local
372 delayed = true; in main()
401 run_test(&dev, &dev.vqs[0], delayed, batch, reset, 0x100000); in main()
|
| /kernel/linux/linux-5.10/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 …]
|
| /kernel/linux/linux-6.6/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 …]
|
| /kernel/linux/linux-5.10/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"
|
| /kernel/linux/linux-6.6/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"
|
| /kernel/linux/linux-6.6/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
|