| /kernel/linux/linux-4.19/fs/btrfs/ |
| D | ordered-data.c | 57 "Inconsistency in ordered tree at offset %llu", offset); in ordered_data_tree_panic()
135 * look find the first ordered struct that has this offset, otherwise
168 * The tree is given a single reference on the ordered extent that was
270 * when an ordered extent is finished. If the list covers more than one
271 * ordered extent, it is split across multiples.
287 * of the file. The IO may span ordered extents. If
292 * to make sure this function only returns 1 once for a given ordered extent.
336 "bad ordered accounting left %llu size %llu", in btrfs_dec_test_first_ordered_pending()
361 * of the file. The IO should not span ordered extents. If
366 * to make sure this function only returns 1 once for a given ordered extent.
[all …]
|
| D | ordered-data.h | 54 #define BTRFS_ORDERED_UPDATED_ISIZE 7 /* indicates whether this ordered extent
59 #define BTRFS_ORDERED_PENDING 9 /* We are waiting for this ordered extent to
80 * the end of the ordered extent which is behind it but
88 * this ordered extent so that we do not expose stale data.
110 /* If the transaction needs to wait on this ordered extent */
119 /* a per root list of all the pending ordered extents */
130 * calculates the total size you need to allocate for an ordered sum
182 struct btrfs_ordered_extent *ordered);
|
| D | file.c | 1461 * This function locks the extent and properly waits for data=ordered extents
1489 struct btrfs_ordered_extent *ordered; in lock_and_cleanup_extent_if_need() local
1493 ordered = btrfs_lookup_ordered_range(inode, start_pos, in lock_and_cleanup_extent_if_need()
1495 if (ordered && in lock_and_cleanup_extent_if_need()
1496 ordered->file_offset + ordered->len > start_pos && in lock_and_cleanup_extent_if_need()
1497 ordered->file_offset <= last_pos) { in lock_and_cleanup_extent_if_need()
1505 ordered, 1); in lock_and_cleanup_extent_if_need()
1506 btrfs_put_ordered_extent(ordered); in lock_and_cleanup_extent_if_need()
1509 if (ordered) in lock_and_cleanup_extent_if_need()
1510 btrfs_put_ordered_extent(ordered); in lock_and_cleanup_extent_if_need()
[all …]
|
| /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 …]
|
| /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-4.19/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-4.19/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/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-4.19/Documentation/ |
| D | atomic_t.txt | 137 atomic variable) can be fully ordered and no intermediate state is lost or
150 - RMW operations that have a return value are fully ordered;
164 Fully ordered primitives are ordered against everything prior and everything
165 subsequent. Therefore a fully ordered primitive is like having an smp_mb()
178 provide full ordered atomics and these barriers are no-ops.
180 NOTE: when the atomic RmW ops are fully ordered, they should also imply a
|
| /kernel/linux/linux-4.19/tools/memory-model/litmus-tests/ |
| D | README | 5 successive reads from the same variable are ordered.
10 are ordered.
15 are ordered.
19 successive writes to the same variable are ordered.
99 This is the fully ordered (via smp_mb()) version of one of
107 This is the fully ordered (again, via smp_mb() version of store
|
| /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-4.19/arch/riscv/include/asm/ |
| D | io.h | 137 * defines that all I/O regions are strongly ordered on channel 2, no explicit
160 * I/O memory access primitives. Reads are ordered relative to any
161 * following Normal memory access. Writes are ordered relative to any prior
186 * be fully ordered with respect to other memory and I/O operations". We're
188 * - Fully ordered WRT each other, by bracketing them with two fences. The
189 * outer set contains both I/O so inX is ordered with outX, while the inner just
191 * - Ordered in the same manner as readX/writeX WRT memory by subsuming their
193 * - Ordered WRT timer reads, so udelay and friends don't get elided by the
219 * 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-4.19/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
132 /** Check the status of first entry in the ordered list. If the instruction at
136 * @return 1 if the ordered list is empty, 0 otherwise.
|
| /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/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-4.19/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/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).
|