| /kernel/linux/linux-5.10/fs/btrfs/ |
| D | ordered-data.c | 131 * look find the first ordered struct that has this offset, otherwise
159 * The tree is given a single reference on the ordered extent that was
182 * The ordered extent has reserved qgroup space, release now in __btrfs_add_ordered_extent()
227 "inconsistency in ordered tree at offset %llu", in __btrfs_add_ordered_extent()
285 * when an ordered extent is finished. If the list covers more than one
286 * ordered extent, it is split across multiples.
301 * of the file. The IO may span ordered extents. If
306 * to make sure this function only returns 1 once for a given ordered extent.
349 "bad ordered accounting left %llu size %llu", in btrfs_dec_test_first_ordered_pending()
374 * of the file. The IO should not span ordered extents. If
[all …]
|
| 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 | ordered-data.h | 61 /* We have already logged all the csums of the ordered extent */
83 * the end of the ordered extent which is behind it but
91 * this ordered extent so that we do not expose stale data.
122 /* a per root list of all the pending ordered extents */
133 * calculates the total size you need to allocate for an ordered sum
|
| D | file.c | 1395 * This function locks the extent and properly waits for data=ordered extents
1421 struct btrfs_ordered_extent *ordered; in lock_and_cleanup_extent_if_need() local
1425 ordered = btrfs_lookup_ordered_range(inode, start_pos, in lock_and_cleanup_extent_if_need()
1427 if (ordered && in lock_and_cleanup_extent_if_need()
1428 ordered->file_offset + ordered->num_bytes > start_pos && in lock_and_cleanup_extent_if_need()
1429 ordered->file_offset <= last_pos) { in lock_and_cleanup_extent_if_need()
1436 btrfs_start_ordered_extent(ordered, 1); in lock_and_cleanup_extent_if_need()
1437 btrfs_put_ordered_extent(ordered); in lock_and_cleanup_extent_if_need()
1440 if (ordered) in lock_and_cleanup_extent_if_need()
1441 btrfs_put_ordered_extent(ordered); in lock_and_cleanup_extent_if_need()
[all …]
|
| D | btrfs_inode.h | 13 #include "ordered-data.h"
20 * ordered operations list so that we make sure to flush out any
31 * fsync racing with ordered extent completion).
152 * the size of the file stored in the metadata on disk. data=ordered
226 * corresponding ordered extent. The fast fsync path must acquire write
227 * access on this semaphore before it collects ordered extents and
|
| D | async-thread.c | 30 /* List head pointing to ordered work list */
240 * this guarantees that the ordered function will see all in run_ordered_work()
246 * we are going to call the ordered done function, but in run_ordered_work()
287 * We don't want to call the ordered free functions with in run_ordered_work()
329 * ordered before setting the WORK_DONE_BIT. Ensuring the thread in btrfs_work_helper()
330 * which is going to executed the ordered work sees them. in btrfs_work_helper()
|
| D | file-item.c | 531 struct btrfs_ordered_extent *ordered = NULL; in btrfs_csum_one_bio() local
569 if (!ordered) { in btrfs_csum_one_bio()
570 ordered = btrfs_lookup_ordered_extent(inode, offset); in btrfs_csum_one_bio()
572 * The bio range is not covered by any ordered extent, in btrfs_csum_one_bio()
575 if (unlikely(!ordered)) { in btrfs_csum_one_bio()
577 "no ordered extent for root %llu ino %llu offset %llu\n", in btrfs_csum_one_bio()
590 if (offset >= ordered->file_offset + ordered->num_bytes || in btrfs_csum_one_bio()
591 offset < ordered->file_offset) { in btrfs_csum_one_bio()
596 btrfs_add_ordered_sum(ordered, sums); in btrfs_csum_one_bio()
597 btrfs_put_ordered_extent(ordered); in btrfs_csum_one_bio()
[all …]
|
| D | block-group.h | 157 * Decremented when an ordered extent that represents an IO against this
159 * root's list of ordered extents) or immediately after the allocation
161 * don't create ordered extents).
168 * field is 0). Decremented by such tasks once they create an ordered
|
| /kernel/linux/linux-5.10/drivers/pinctrl/samsung/ |
| D | pinctrl-exynos-arm64.c | 48 /* Must start with EINTG banks, ordered by EINT group number. */
62 /* Must start with EINTG banks, ordered by EINT group number. */
69 /* Must start with EINTG banks, ordered by EINT group number. */
75 /* Must start with EINTG banks, ordered by EINT group number. */
81 /* Must start with EINTG banks, ordered by EINT group number. */
87 /* Must start with EINTG banks, ordered by EINT group number. */
98 /* Must start with EINTG banks, ordered by EINT group number. */
104 /* Must start with EINTG banks, ordered by EINT group number. */
110 /* Must start with EINTG banks, ordered by EINT group number. */
132 /* 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 …]
|
| /kernel/linux/linux-5.10/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
|
| /kernel/linux/linux-5.10/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
|
| /kernel/linux/linux-5.10/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()
|
| /kernel/linux/linux-5.10/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
69 * Accesses from a single hart to a single I/O address must be ordered. This
|
| /kernel/linux/linux-5.10/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
|
| /kernel/linux/linux-5.10/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.
|
| /kernel/linux/linux-5.10/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).
|
| /kernel/linux/linux-5.10/drivers/ide/ |
| D | ide-scan-pci.c | 19 static int pre_init = 1; /* Before first ordered IDE scan */
84 * Perform the initial bus rather than driver ordered scan of the
86 * module ordering not traditionally ordered.
|
| /kernel/linux/linux-5.10/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
|
| /kernel/linux/linux-5.10/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.
|
| 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 | sirf-usp.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 | davinci-mcbsp.txt | 20 TC channel ordered triplets.
22 These strings correspond 1:1 with the ordered pairs in dmas. The dma
|
| /kernel/linux/linux-5.10/tools/perf/Documentation/ |
| D | perf.txt | 60 ordered-events - ordered events object debug messages
|