| /linux-6.8/fs/btrfs/ |
| D | ordered-data.c | 124 * look find the first ordered struct that has this offset, otherwise
165 * The ordered extent has reserved qgroup space, release now in alloc_ordered_extent()
229 "inconsistency in ordered tree at offset %llu", in insert_ordered_extent()
247 * Add an ordered extent to the per-inode tree.
260 * tree is given a single reference on the ordered extent that was inserted, and
263 * Return: the new ordered extent or error pointer.
285 * when an ordered extent is finished. If the list covers more than one
286 * ordered extent, it is split across multiples.
306 static bool can_finish_ordered_extent(struct btrfs_ordered_extent *ordered, in can_finish_ordered_extent() argument
310 struct btrfs_inode *inode = BTRFS_I(ordered->inode); in can_finish_ordered_extent()
[all …]
|
| D | ordered-data.h | 35 * Different types for ordered extents, one and only one of the 4 types
36 * need to be set when creating ordered extent.
54 /* Extra status bits for ordered extents */
66 /* We have already logged all the csums of the ordered extent */
101 * this ordered extent so that we do not expose stale data.
132 /* a per root list of all the pending ordered extents */
150 bool btrfs_finish_ordered_extent(struct btrfs_ordered_extent *ordered,
190 struct btrfs_ordered_extent *ordered, u64 len);
|
| D | inode.c | 43 #include "ordered-data.h"
84 struct btrfs_ordered_extent *ordered; member
411 * Cleanup all submitted ordered extents in specified range to handle errors
417 * to be released, which we want to happen only when finishing the ordered
439 * clear page Ordered and run the ordered extent accounting. in btrfs_cleanup_ordered_extents()
441 * Here we can't just clear the Ordered bit, or in btrfs_cleanup_ordered_extents()
443 * for the page range, and the ordered extent will never finish. in btrfs_cleanup_ordered_extents()
455 * Here we just clear all Ordered bits for every page in the in btrfs_cleanup_ordered_extents()
457 * the ordered extent accounting for the range. in btrfs_cleanup_ordered_extents()
829 * This is done inside an ordered work queue, and the compression is spread
[all …]
|
| D | tree-log.h | 60 struct btrfs_ordered_extent *ordered; in btrfs_release_log_ctx_extents() local
65 list_for_each_entry_safe(ordered, tmp, &ctx->ordered_extents, log_list) { in btrfs_release_log_ctx_extents()
66 list_del_init(&ordered->log_list); in btrfs_release_log_ctx_extents()
67 btrfs_put_ordered_extent(ordered); in btrfs_release_log_ctx_extents()
|
| D | extent-io-tree.h | 26 * Must be cleared only during ordered extent completion or on error
27 * paths if we did not manage to submit bios and create the ordered
29 * and page invalidation (if there is an ordered extent in flight),
30 * that is left for the ordered extent completion.
34 * When an ordered extent successfully completes for a region marked as
|
| D | async-thread.c | 30 /* List head pointing to ordered work list */
136 /* Ordered workqueues don't allow @max_active adjustments. */ in btrfs_alloc_ordered_workqueue()
231 * this guarantees that the ordered function will see all in run_ordered_work()
237 * we are going to call the ordered done function, but in run_ordered_work()
278 * We don't want to call the ordered free functions with in run_ordered_work()
319 * ordered before setting the WORK_DONE_BIT. Ensuring the thread in btrfs_work_helper()
320 * which is going to executed the ordered work sees them. in btrfs_work_helper()
|
| D | space-info.c | 9 #include "ordered-data.h"
119 * running delalloc, but usually we need to wait for ordered extents to
636 * If we are doing more ordered than delalloc we need to just wait on in shrink_delalloc()
637 * ordered extents, otherwise we'll waste time trying to flush delalloc in shrink_delalloc()
659 * their jobs and thus have ordered extents set up properly. in shrink_delalloc()
665 * that we know we'll have ordered extents for everything and we in shrink_delalloc()
860 u64 ordered, delalloc; in need_preemptive_reclaim() local
934 * If we have more ordered bytes than delalloc bytes then we're either in need_preemptive_reclaim()
938 * of ordered extents, preemptively waiting on ordered extents gets us in need_preemptive_reclaim()
939 * nothing, if our reservations are tied up in ordered extents we'll in need_preemptive_reclaim()
[all …]
|
| D | file.c | 972 * This function locks the extent and properly waits for data=ordered extents
998 struct btrfs_ordered_extent *ordered; in lock_and_cleanup_extent_if_need() local
1015 ordered = btrfs_lookup_ordered_range(inode, start_pos, in lock_and_cleanup_extent_if_need()
1017 if (ordered && in lock_and_cleanup_extent_if_need()
1018 ordered->file_offset + ordered->num_bytes > start_pos && in lock_and_cleanup_extent_if_need()
1019 ordered->file_offset <= last_pos) { in lock_and_cleanup_extent_if_need()
1026 btrfs_start_ordered_extent(ordered); in lock_and_cleanup_extent_if_need()
1027 btrfs_put_ordered_extent(ordered); in lock_and_cleanup_extent_if_need()
1030 if (ordered) in lock_and_cleanup_extent_if_need()
1031 btrfs_put_ordered_extent(ordered); in lock_and_cleanup_extent_if_need()
[all …]
|
| D | bio.c | 97 refcount_inc(&orig_bbio->ordered->refs); in btrfs_split_bio()
98 bbio->ordered = orig_bbio->ordered; in btrfs_split_bio()
108 btrfs_put_ordered_extent(bbio->ordered); in btrfs_cleanup_bio()
115 struct btrfs_ordered_extent *ordered = bbio->ordered; in __btrfs_bio_end_io() local
118 btrfs_put_ordered_extent(ordered); in __btrfs_bio_end_io()
560 * sums are attached onto the ordered extent record.
562 * At IO completion time the csums attached on the ordered extent record are
579 * sums are attached onto the ordered extent record.
581 * At IO completion time the csums attached on the ordered extent record are
718 list_add_tail(&bioc->rst_ordered_entry, &bbio->ordered->bioc_list); in btrfs_submit_chunk()
|
| /linux-6.8/Documentation/devicetree/bindings/scsi/ |
| D | hisilicon-sas.txt | 22 sources; the interrupts are ordered in 3 groups, as follows:
30 The phy interrupts are ordered into groups of 3 per phy
34 The interrupts are ordered in increasing order.
35 Fatal interrupts : the fatal interrupts are ordered as follows:
39 the interrupts are ordered in 3 groups, as follows:
47 interrupt. The interrupts are ordered in increasing
50 interrupt source. The interrupts are ordered in
|
| /linux-6.8/drivers/pinctrl/samsung/ |
| D | pinctrl-exynos-arm.c | 92 /* Must start with EINTG banks, ordered by EINT group number. */
152 /* Must start with EINTG banks, ordered by EINT group number. */
164 /* Must start with EINTG banks, ordered by EINT group number. */
239 /* Must start with EINTG banks, ordered by EINT group number. */
260 /* Must start with EINTG banks, ordered by EINT group number. */
285 /* Must start with EINTG banks, ordered by EINT group number. */
356 /* Must start with EINTG banks, ordered by EINT group number. */
374 /* Must start with EINTG banks, ordered by EINT group number. */
402 /* Must start with EINTG banks, ordered by EINT group number. */
408 /* Must start with EINTG banks, ordered by EINT group number. */
[all …]
|
| D | pinctrl-exynos-arm64.c | 66 /* Must start with EINTG banks, ordered by EINT group number. */
80 /* Must start with EINTG banks, ordered by EINT group number. */
87 /* Must start with EINTG banks, ordered by EINT group number. */
93 /* Must start with EINTG banks, ordered by EINT group number. */
99 /* Must start with EINTG banks, ordered by EINT group number. */
105 /* Must start with EINTG banks, ordered by EINT group number. */
116 /* Must start with EINTG banks, ordered by EINT group number. */
122 /* Must start with EINTG banks, ordered by EINT group number. */
128 /* Must start with EINTG banks, ordered by EINT group number. */
150 /* Must start with EINTG banks, ordered by EINT group number. */
[all …]
|
| /linux-6.8/arch/riscv/include/asm/ |
| D | io.h | 36 * be fully ordered with respect to other memory and I/O operations". We're
38 * - Fully ordered WRT each other, by bracketing them with two fences. The
39 * outer set contains both I/O so inX is ordered with outX, while the inner just
41 * - Ordered in the same manner as readX/writeX WRT memory by subsuming their
43 * - Ordered WRT timer reads, so udelay and friends don't get elided by the
56 * Accesses from a single hart to a single I/O address must be ordered. This
|
| /linux-6.8/Documentation/ |
| D | atomic_t.txt | 156 atomic variable) can be fully ordered and no intermediate state is lost or
169 - RMW operations that have a return value are fully ordered;
183 Fully ordered primitives are ordered against everything prior and everything
184 subsequent. Therefore a fully ordered primitive is like having an smp_mb()
198 ordered, so it is advisable to place the barrier right next to the RMW atomic
203 provide full ordered atomics and these barriers are no-ops.
205 NOTE: when the atomic RmW ops are fully ordered, they should also imply a
|
| /linux-6.8/Documentation/arch/riscv/ |
| D | uabi.rst | 26 ordered first by category, in canonical order, as listed above, then
31 extensions are listed, they will be ordered alphabetically.
35 extensions are listed, they will be ordered alphabetically.
39 ordered alphabetically.
|
| /linux-6.8/tools/perf/util/ |
| D | ordered-events.c | 7 #include "ordered-events.h"
112 * We maintain the following scheme of buffers for ordered in alloc_event()
119 * Each buffer keeps an array of ordered events objects: in alloc_event()
124 * Each allocated ordered event is linked to one of in alloc_event()
126 * - time ordered list 'events' in alloc_event()
129 * Allocation of the ordered event uses the following order in alloc_event()
135 * Removal of ordered event object moves it from events to in alloc_event()
237 ui_progress__init(&prog, oe->nr_events, "Processing time ordered events..."); in do_flush()
|
| /linux-6.8/drivers/platform/x86/hp/hp-bioscfg/ |
| D | order-list-attributes.c | 3 * Functions corresponding to ordered list type attributes under
4 * BIOS ORDERED LIST GUID for use with hp-bioscfg driver.
51 * separators when reporting ordered-list values. in validate_ordered_list_input()
80 return sysfs_emit(buf, "ordered-list\n"); in type_show()
263 * Ordered list data is stored in hex and comma separated format in hp_populate_ordered_list_elements_from_package()
369 …pr_warn("Ordered List size value exceeded the maximum number of elements supported or data may be … in hp_populate_ordered_list_elements_from_buffer()
388 * instance under ordered list attribute
403 /* Populate ordered list elements */ in hp_populate_ordered_list_buffer_data()
|
| /linux-6.8/include/trace/events/ |
| D | btrfs.h | 515 const struct btrfs_ordered_extent *ordered),
517 TP_ARGS(inode, ordered),
535 __entry->file_offset = ordered->file_offset;
536 __entry->start = ordered->disk_bytenr;
537 __entry->len = ordered->num_bytes;
538 __entry->disk_len = ordered->disk_num_bytes;
539 __entry->bytes_left = ordered->bytes_left;
540 __entry->flags = ordered->flags;
541 __entry->compress_type = ordered->compress_type;
542 __entry->refs = refcount_read(&ordered->refs);
[all …]
|
| /linux-6.8/Documentation/devicetree/bindings/ |
| D | dts-coding-style.rst | 51 ordered by unit address in ascending order.
56 2. Nodes without unit addresses shall be ordered alpha-numerically by the node
57 name. For a few node types, they can be ordered by the main property, e.g.
58 pin configuration states ordered by value of "pins" property.
61 ordered either alpha-numerically or by keeping the order from DTSI, where
|
| /linux-6.8/Documentation/core-api/ |
| D | refcount-vs-atomic.rst | 67 then further stores are ordered against this operation.
123 * fully ordered --> control dependency on success for stores
139 * fully ordered --> RELEASE ordering + ACQUIRE ordering on success
152 * fully ordered --> RELEASE ordering + control dependency
167 * fully ordered --> RELEASE ordering + control dependency + hold
|
| /linux-6.8/drivers/net/ethernet/cavium/liquidio/ |
| D | response_manager.h | 27 /** Maximum ordered requests to process in every invocation of
37 * system. One for each response order- Unordered, ordered
134 /** Check the status of first entry in the ordered list. If the instruction at
138 * @return 1 if the ordered list is empty, 0 otherwise.
|
| /linux-6.8/tools/memory-model/litmus-tests/ |
| D | README | 7 successive reads from the same variable are ordered.
12 are ordered.
17 are ordered.
21 successive writes to the same variable are ordered.
109 This is the fully ordered (via smp_mb()) version of one of
117 This is the fully ordered (again, via smp_mb() version of store
|
| /linux-6.8/include/asm-generic/bitops/ |
| D | instrumented-atomic.h | 66 * This is an atomic fully-ordered operation (implied full memory barrier).
80 * This is an atomic fully-ordered operation (implied full memory barrier).
94 * This is an atomic fully-ordered operation (implied full memory barrier).
|
| /linux-6.8/Documentation/devicetree/bindings/sound/ |
| D | sirf-audio-port.txt | 6 - dmas: List of DMA controller phandle and DMA request line ordered pairs.
8 These strings correspond 1:1 with the ordered pairs in dmas.
|
| D | sprd-pcm.txt | 5 - dmas: Specify the list of DMA controller phandle and DMA request line ordered pairs.
7 These strings correspond 1:1 with the ordered pairs in dmas.
|