| /Linux-v5.15/fs/btrfs/ |
| D | ordered-data.c | 121 * look find the first ordered struct that has this offset, otherwise
149 * The tree is given a single reference on the ordered extent that was
172 * The ordered extent has reserved qgroup space, release now in __btrfs_add_ordered_extent()
222 "inconsistency in ordered tree at offset %llu", in __btrfs_add_ordered_extent()
287 * when an ordered extent is finished. If the list covers more than one
288 * ordered extent, it is split across multiples.
302 * Mark all ordered extents io inside the specified range finished.
306 * updated to indicate whether the pending ordered io is finished.
310 * @finish_func: The function to be executed when all the IO of an ordered
313 * This function is called for endio, thus the range must have ordered
[all …]
|
| D | ordered-data.h | 42 * Different types for ordered extents, one and only one of the 4 types
43 * need to be set when creating ordered extent.
61 /* Extra status bits for ordered extents */
73 /* We have already logged all the csums of the ordered extent */
95 * the end of the ordered extent which is behind it but
103 * this ordered extent so that we do not expose stale data.
134 /* a per root list of all the pending ordered extents */
152 * calculates the total size you need to allocate for an ordered sum
213 int btrfs_split_ordered_extent(struct btrfs_ordered_extent *ordered, u64 pre,
|
| D | tree-log.h | 40 struct btrfs_ordered_extent *ordered; in btrfs_release_log_ctx_extents() local
45 list_for_each_entry_safe(ordered, tmp, &ctx->ordered_extents, log_list) { in btrfs_release_log_ctx_extents()
46 list_del_init(&ordered->log_list); in btrfs_release_log_ctx_extents()
47 btrfs_put_ordered_extent(ordered); in btrfs_release_log_ctx_extents()
|
| D | file.c | 1421 * This function locks the extent and properly waits for data=ordered extents
1447 struct btrfs_ordered_extent *ordered; in lock_and_cleanup_extent_if_need() local
1451 ordered = btrfs_lookup_ordered_range(inode, start_pos, in lock_and_cleanup_extent_if_need()
1453 if (ordered && in lock_and_cleanup_extent_if_need()
1454 ordered->file_offset + ordered->num_bytes > start_pos && in lock_and_cleanup_extent_if_need()
1455 ordered->file_offset <= last_pos) { in lock_and_cleanup_extent_if_need()
1462 btrfs_start_ordered_extent(ordered, 1); in lock_and_cleanup_extent_if_need()
1463 btrfs_put_ordered_extent(ordered); in lock_and_cleanup_extent_if_need()
1466 if (ordered) in lock_and_cleanup_extent_if_need()
1467 btrfs_put_ordered_extent(ordered); in lock_and_cleanup_extent_if_need()
[all …]
|
| D | space-info.c | 9 #include "ordered-data.h"
115 * running delalloc, but usually we need to wait for ordered extents to
525 * If we are doing more ordered than delalloc we need to just wait on in shrink_delalloc()
526 * ordered extents, otherwise we'll waste time trying to flush delalloc in shrink_delalloc()
548 * their jobs and thus have ordered extents set up properly. in shrink_delalloc()
554 * that we know we'll have ordered extents for everything and we in shrink_delalloc()
736 u64 ordered, delalloc; in need_preemptive_reclaim() local
806 * If we have more ordered bytes than delalloc bytes then we're either in need_preemptive_reclaim()
810 * of ordered extents, preemptively waiting on ordered extents gets us in need_preemptive_reclaim()
811 * nothing, if our reservations are tied up in ordered extents we'll in need_preemptive_reclaim()
[all …]
|
| D | file-item.c | 387 * No ordered extents csums, as ordered extents are only for write in btrfs_lookup_bio_sums()
629 struct btrfs_ordered_extent *ordered = NULL; in btrfs_csum_one_bio() local
666 if (!ordered) { in btrfs_csum_one_bio()
667 ordered = btrfs_lookup_ordered_extent(inode, offset); in btrfs_csum_one_bio()
669 * The bio range is not covered by any ordered extent, in btrfs_csum_one_bio()
672 if (unlikely(!ordered)) { in btrfs_csum_one_bio()
674 "no ordered extent for root %llu ino %llu offset %llu\n", in btrfs_csum_one_bio()
687 if (offset >= ordered->file_offset + ordered->num_bytes || in btrfs_csum_one_bio()
688 offset < ordered->file_offset) { in btrfs_csum_one_bio()
693 btrfs_add_ordered_sum(ordered, sums); in btrfs_csum_one_bio()
[all …]
|
| D | inode.c | 42 #include "ordered-data.h"
150 * Cleanup all submitted ordered extents in specified range to handle errors
156 * to be released, which we want to happen only when finishing the ordered
175 * btrfs_mark_ordered_io_finished() to clear page Ordered and in btrfs_cleanup_ordered_extents()
176 * run the ordered extent accounting. in btrfs_cleanup_ordered_extents()
178 * Here we can't just clear the Ordered bit, or in btrfs_cleanup_ordered_extents()
180 * for the page range, and the ordered extent will never finish. in btrfs_cleanup_ordered_extents()
192 * Here we just clear all Ordered bits for every page in the in btrfs_cleanup_ordered_extents()
194 * the ordered extent accounting for the range. in btrfs_cleanup_ordered_extents()
548 * This is done inside an ordered work queue, and the compression
[all …]
|
| D | extent-io-tree.h | 25 * Must be cleared only during ordered extent completion or on error paths if we
26 * did not manage to submit bios and create the ordered extents for the range.
28 * an ordered extent in flight), that is left for the ordered extent completion.
32 * When an ordered extent successfully completes for a region marked as a new
|
| D | zoned.c | 1321 struct btrfs_ordered_extent *ordered; in btrfs_record_physical_zoned() local
1327 ordered = btrfs_lookup_ordered_extent(BTRFS_I(inode), file_offset); in btrfs_record_physical_zoned()
1328 if (WARN_ON(!ordered)) in btrfs_record_physical_zoned()
1331 ordered->physical = physical; in btrfs_record_physical_zoned()
1332 ordered->bdev = bio->bi_bdev; in btrfs_record_physical_zoned()
1334 btrfs_put_ordered_extent(ordered); in btrfs_record_physical_zoned()
1337 void btrfs_rewrite_logical_zoned(struct btrfs_ordered_extent *ordered) in btrfs_rewrite_logical_zoned() argument
1339 struct btrfs_inode *inode = BTRFS_I(ordered->inode); in btrfs_rewrite_logical_zoned()
1344 u64 orig_logical = ordered->disk_bytenr; in btrfs_rewrite_logical_zoned()
1349 ASSERT(!bdev_is_partition(ordered->bdev)); in btrfs_rewrite_logical_zoned()
[all …]
|
| /Linux-v5.15/drivers/pinctrl/samsung/ |
| 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 …]
|
| 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 …]
|
| /Linux-v5.15/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-v5.15/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-v5.15/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-v5.15/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()
236 ui_progress__init(&prog, oe->nr_events, "Processing time ordered events..."); in do_flush()
|
| /Linux-v5.15/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-v5.15/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-v5.15/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.
101 This is the fully ordered (via smp_mb()) version of one of
109 This is the fully ordered (again, via smp_mb() version of store
|
| /Linux-v5.15/include/asm-generic/bitops/ |
| D | instrumented-atomic.h | 66 * This is an atomic fully-ordered operation (implied full memory barrier).
79 * This is an atomic fully-ordered operation (implied full memory barrier).
92 * This is an atomic fully-ordered operation (implied full memory barrier).
|
| /Linux-v5.15/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 | brcm,bcm2835-i2s.txt | 7 - dmas: List of DMA controller phandle and DMA request line ordered pairs.
9 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.
|
| D | davinci-mcbsp.txt | 20 TC channel ordered triplets.
22 These strings correspond 1:1 with the ordered pairs in dmas. The dma
|
| /Linux-v5.15/tools/lib/subcmd/ |
| D | parse-options.c | 811 struct option *ordered; in options__order() local
817 ordered = malloc(len); in options__order()
818 if (!ordered) in options__order()
820 memcpy(ordered, opts, len); in options__order()
822 qsort(ordered, nr_opts, sizeof(*o), option__cmp); in options__order()
824 return ordered; in options__order()
862 struct option *ordered; in usage_with_options_internal() local
887 ordered = options__order(opts); in usage_with_options_internal()
888 if (ordered) in usage_with_options_internal()
889 opts = ordered; in usage_with_options_internal()
[all …]
|
| /Linux-v5.15/fs/xfs/ |
| D | xfs_log_cil.c | 163 bool ordered = false; in xlog_cil_alloc_shadow_bufs() local
173 * Ordered items need to be tracked but we do not wish to write in xlog_cil_alloc_shadow_bufs()
178 ordered = true; in xlog_cil_alloc_shadow_bufs()
229 if (ordered) in xlog_cil_alloc_shadow_bufs()
237 if (ordered) in xlog_cil_alloc_shadow_bufs()
353 bool ordered = false; in xlog_cil_insert_format_items() local
365 ordered = true; in xlog_cil_insert_format_items()
368 if (!shadow->lv_niovecs && !ordered) in xlog_cil_insert_format_items()
378 if (ordered) in xlog_cil_insert_format_items()
400 if (ordered) { in xlog_cil_insert_format_items()
[all …]
|
