Home
last modified time | relevance | path

Searched full:ordered (Results 1 – 25 of 755) sorted by relevance

12345678910>>...31

/Linux-v6.1/fs/btrfs/
Dordered-data.c121 * look find the first ordered struct that has this offset, otherwise
147 * Add an ordered extent to the per-inode tree.
160 * tree is given a single reference on the ordered extent that was inserted.
185 * The ordered extent has reserved qgroup space, release now in btrfs_add_ordered_extent()
231 "inconsistency in ordered tree at offset %llu", in btrfs_add_ordered_extent()
261 * when an ordered extent is finished. If the list covers more than one
262 * ordered extent, it is split across multiples.
284 * Mark all ordered extents io inside the specified range finished.
288 * updated to indicate whether the pending ordered io is finished.
293 * This function is called for endio, thus the range must have ordered
[all …]
Dordered-data.h42 * 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 */
107 * the end of the ordered extent which is behind it but
115 * this ordered extent so that we do not expose stale data.
146 /* a per root list of all the pending ordered extents */
210 int btrfs_split_ordered_extent(struct btrfs_ordered_extent *ordered, u64 pre,
Dtree-log.h56 struct btrfs_ordered_extent *ordered; in btrfs_release_log_ctx_extents() local
61 list_for_each_entry_safe(ordered, tmp, &ctx->ordered_extents, log_list) { in btrfs_release_log_ctx_extents()
62 list_del_init(&ordered->log_list); in btrfs_release_log_ctx_extents()
63 btrfs_put_ordered_extent(ordered); in btrfs_release_log_ctx_extents()
Dinode.c43 #include "ordered-data.h"
179 * Cleanup all submitted ordered extents in specified range to handle errors
185 * to be released, which we want to happen only when finishing the ordered
207 * btrfs_mark_ordered_io_finished() to clear page Ordered and in btrfs_cleanup_ordered_extents()
208 * run the ordered extent accounting. in btrfs_cleanup_ordered_extents()
210 * Here we can't just clear the Ordered bit, or in btrfs_cleanup_ordered_extents()
212 * for the page range, and the ordered extent will never finish. in btrfs_cleanup_ordered_extents()
224 * Here we just clear all Ordered bits for every page in the in btrfs_cleanup_ordered_extents()
226 * the ordered extent accounting for the range. in btrfs_cleanup_ordered_extents()
600 * This is done inside an ordered work queue, and the compression
[all …]
Dextent-io-tree.h24 * Must be cleared only during ordered extent completion or on error paths if we
25 * did not manage to submit bios and create the ordered extents for the range.
27 * an ordered extent in flight), that is left for the ordered extent completion.
31 * When an ordered extent successfully completes for a region marked as a new
Dasync-thread.c29 /* List head pointing to ordered work list */
196 * this guarantees that the ordered function will see all in run_ordered_work()
202 * we are going to call the ordered done function, but in run_ordered_work()
243 * We don't want to call the ordered free functions with in run_ordered_work()
284 * ordered before setting the WORK_DONE_BIT. Ensuring the thread in btrfs_work_helper()
285 * which is going to executed the ordered work sees them. in btrfs_work_helper()
Dfile-item.c133 * Calculate the total size needed to allocate for an ordered sum structure
400 * No ordered extents csums, as ordered extents are only for write in btrfs_lookup_bio_sums()
642 * @one_ordered: If true, @bio only refers to one ordered extent.
650 struct btrfs_ordered_extent *ordered = NULL; in btrfs_csum_one_bio() local
682 if (!ordered) { in btrfs_csum_one_bio()
683 ordered = btrfs_lookup_ordered_extent(inode, offset); in btrfs_csum_one_bio()
685 * The bio range is not covered by any ordered extent, in btrfs_csum_one_bio()
688 if (unlikely(!ordered)) { in btrfs_csum_one_bio()
690 "no ordered extent for root %llu ino %llu offset %llu\n", in btrfs_csum_one_bio()
704 !in_range(offset, ordered->file_offset, in btrfs_csum_one_bio()
[all …]
Dspace-info.c9 #include "ordered-data.h"
116 * running delalloc, but usually we need to wait for ordered extents to
612 * If we are doing more ordered than delalloc we need to just wait on in shrink_delalloc()
613 * ordered extents, otherwise we'll waste time trying to flush delalloc in shrink_delalloc()
635 * their jobs and thus have ordered extents set up properly. in shrink_delalloc()
641 * that we know we'll have ordered extents for everything and we in shrink_delalloc()
854 u64 ordered, delalloc; in need_preemptive_reclaim() local
929 * If we have more ordered bytes than delalloc bytes then we're either in need_preemptive_reclaim()
933 * of ordered extents, preemptively waiting on ordered extents gets us in need_preemptive_reclaim()
934 * nothing, if our reservations are tied up in ordered extents we'll in need_preemptive_reclaim()
[all …]
/Linux-v6.1/drivers/pinctrl/samsung/
Dpinctrl-exynos-arm64.c66 /* 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 …]
Dpinctrl-exynos-arm.c92 /* 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-v6.1/Documentation/devicetree/bindings/scsi/
Dhisilicon-sas.txt22 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-v6.1/arch/riscv/include/asm/
Dio.h36 * 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
Dpgtable-64.h81 * 01 - NC Non-cacheable, idempotent, weakly-ordered Main Memory
82 * 10 - IO Non-cacheable, non-idempotent, strongly-ordered I/O memory
92 * 00000 - NC Weakly-ordered, Non-cacheable, Non-bufferable, Non-shareable, Non-trustable
93 * 01110 - PMA Weakly-ordered, Cacheable, Bufferable, Shareable, Non-trustable
94 * 10000 - IO Strongly-ordered, Non-cacheable, Non-bufferable, Non-shareable, Non-trustable
/Linux-v6.1/Documentation/
Datomic_t.txt156 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
Datomic_bitops.txt59 - RMW operations that have a return value are fully ordered.
61 - RMW operations that are conditional are fully ordered.
/Linux-v6.1/tools/perf/util/
Dordered-events.c7 #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-v6.1/include/trace/events/
Dbtrfs.h518 const struct btrfs_ordered_extent *ordered),
520 TP_ARGS(inode, ordered),
538 __entry->file_offset = ordered->file_offset;
539 __entry->start = ordered->disk_bytenr;
540 __entry->len = ordered->num_bytes;
541 __entry->disk_len = ordered->disk_num_bytes;
542 __entry->bytes_left = ordered->bytes_left;
543 __entry->flags = ordered->flags;
544 __entry->compress_type = ordered->compress_type;
545 __entry->refs = refcount_read(&ordered->refs);
[all …]
/Linux-v6.1/Documentation/core-api/
Drefcount-vs-atomic.rst67 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-v6.1/drivers/net/ethernet/cavium/liquidio/
Dresponse_manager.h27 /** 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-v6.1/tools/memory-model/litmus-tests/
DREADME7 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-v6.1/include/asm-generic/bitops/
Dinstrumented-atomic.h66 * 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-v6.1/Documentation/devicetree/bindings/sound/
Dsirf-audio-port.txt6 - dmas: List of DMA controller phandle and DMA request line ordered pairs.
8 These strings correspond 1:1 with the ordered pairs in dmas.
Dbrcm,bcm2835-i2s.txt7 - dmas: List of DMA controller phandle and DMA request line ordered pairs.
9 These strings correspond 1:1 with the ordered pairs in dmas.
Dsprd-pcm.txt5 - 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.
/Linux-v6.1/virt/kvm/
DKconfig22 # Only strongly ordered architectures can select this, as it doesn't
30 # Weakly ordered architectures can only select this, advertising

12345678910>>...31