Home
last modified time | relevance | path

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

12345678910>>...34

/linux-6.14.4/fs/btrfs/
Dordered-data.c124 * 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.
279 * For PREALLOC, we do not use ordered extent members, but in btrfs_alloc_ordered_extent()
282 * So here we always pass 0 as offset for NOCOW/PREALLOC ordered extents, in btrfs_alloc_ordered_extent()
307 * when an ordered extent is finished. If the list covers more than one
308 * ordered extent, it is split across multiples.
[all …]
Ddirect-io.c17 struct btrfs_ordered_extent *ordered; member
40 struct btrfs_ordered_extent *ordered; in lock_extent_direct() local
63 * doing DIO to, so we need to make sure there's no ordered in lock_extent_direct()
66 ordered = btrfs_lookup_ordered_range(BTRFS_I(inode), lockstart, in lock_extent_direct()
76 if (!ordered && in lock_extent_direct()
83 if (ordered) { in lock_extent_direct()
85 btrfs_put_ordered_extent(ordered); in lock_extent_direct()
90 * If we are doing a DIO read and the ordered extent we in lock_extent_direct()
96 * created an ordered extent for a previous extent map in lock_extent_direct()
105 test_bit(BTRFS_ORDERED_DIRECT, &ordered->flags)) in lock_extent_direct()
[all …]
Dordered-data.h50 * Different types for ordered extents, one and only one of the 4 types
51 * need to be set when creating ordered extent.
69 /* Extra status bits for ordered extents */
81 /* We have already logged all the csums of the ordered extent */
116 * this ordered extent so that we do not expose stale data.
147 /* a per root list of all the pending ordered extents */
165 void btrfs_finish_ordered_extent(struct btrfs_ordered_extent *ordered,
216 struct btrfs_ordered_extent *ordered, u64 len);
217 void btrfs_mark_ordered_extent_error(struct btrfs_ordered_extent *ordered);
Dasync-thread.c29 /* List head pointing to ordered work list */
135 /* Ordered workqueues don't allow @max_active adjustments. */ in btrfs_alloc_ordered_workqueue()
230 * this guarantees that the ordered function will see all in run_ordered_work()
236 * we are going to call the ordered done function, but in run_ordered_work()
277 * We don't want to call the ordered free functions with in run_ordered_work()
318 * ordered before setting the WORK_DONE_BIT. Ensuring the thread in btrfs_work_helper()
319 * which is going to executed the ordered work sees them. in btrfs_work_helper()
Dinode.c42 #include "ordered-data.h"
386 * Cleanup all submitted ordered extents in specified range to handle errors
392 * to be released, which we want to happen only when finishing the ordered
409 * Here we just clear all Ordered bits for every page in the in btrfs_cleanup_ordered_extents()
411 * the ordered extent accounting for the range. in btrfs_cleanup_ordered_extents()
859 * This is done inside an ordered work queue, and the compression is spread
860 * across many cpus. The actual IO submission is step two, and the ordered work
1112 struct btrfs_ordered_extent *ordered; in submit_one_async_extent() local
1175 ordered = btrfs_alloc_ordered_extent(inode, start, &file_extent, in submit_one_async_extent()
1177 if (IS_ERR(ordered)) { in submit_one_async_extent()
[all …]
Dextent-io-tree.h34 * Must be cleared only during ordered extent completion or on error
35 * paths if we did not manage to submit bios and create the ordered
37 * and page invalidation (if there is an ordered extent in flight),
38 * that is left for the ordered extent completion.
42 * When an ordered extent successfully completes for a region marked as
Dfile.c901 * Locks the extent and properly waits for data=ordered extents to finish
924 struct btrfs_ordered_extent *ordered; in lock_and_cleanup_extent_if_need() local
937 ordered = btrfs_lookup_ordered_range(inode, start_pos, in lock_and_cleanup_extent_if_need()
939 if (ordered && in lock_and_cleanup_extent_if_need()
940 ordered->file_offset + ordered->num_bytes > start_pos && in lock_and_cleanup_extent_if_need()
941 ordered->file_offset <= last_pos) { in lock_and_cleanup_extent_if_need()
946 btrfs_start_ordered_extent(ordered); in lock_and_cleanup_extent_if_need()
947 btrfs_put_ordered_extent(ordered); in lock_and_cleanup_extent_if_need()
950 if (ordered) in lock_and_cleanup_extent_if_need()
951 btrfs_put_ordered_extent(ordered); in lock_and_cleanup_extent_if_need()
[all …]
Dbio.c93 refcount_inc(&orig_bbio->ordered->refs); in btrfs_split_bio()
94 bbio->ordered = orig_bbio->ordered; in btrfs_split_bio()
104 btrfs_put_ordered_extent(bbio->ordered); in btrfs_cleanup_bio()
111 struct btrfs_ordered_extent *ordered = bbio->ordered; in __btrfs_bio_end_io() local
114 btrfs_put_ordered_extent(ordered); in __btrfs_bio_end_io()
545 * sums are attached onto the ordered extent record.
547 * At IO completion time the csums attached on the ordered extent record are
564 * sums are attached onto the ordered extent record.
566 * At IO completion time the csums attached on the ordered extent record are
744 list_add_tail(&bioc->rst_ordered_entry, &bbio->ordered->bioc_list); in btrfs_submit_chunk()
/linux-6.14.4/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-6.14.4/drivers/pinctrl/samsung/
Dpinctrl-exynos-arm.c105 /* Must start with EINTG banks, ordered by EINT group number. */
166 /* Must start with EINTG banks, ordered by EINT group number. */
178 /* Must start with EINTG banks, ordered by EINT group number. */
253 /* Must start with EINTG banks, ordered by EINT group number. */
274 /* Must start with EINTG banks, ordered by EINT group number. */
299 /* Must start with EINTG banks, ordered by EINT group number. */
370 /* Must start with EINTG banks, ordered by EINT group number. */
388 /* Must start with EINTG banks, ordered by EINT group number. */
416 /* Must start with EINTG banks, ordered by EINT group number. */
422 /* Must start with EINTG banks, ordered by EINT group number. */
[all …]
Dpinctrl-exynos-arm64.c75 /* Must start with EINTG banks, ordered by EINT group number. */
89 /* Must start with EINTG banks, ordered by EINT group number. */
96 /* Must start with EINTG banks, ordered by EINT group number. */
102 /* Must start with EINTG banks, ordered by EINT group number. */
108 /* Must start with EINTG banks, ordered by EINT group number. */
114 /* Must start with EINTG banks, ordered by EINT group number. */
125 /* Must start with EINTG banks, ordered by EINT group number. */
131 /* Must start with EINTG banks, ordered by EINT group number. */
137 /* Must start with EINTG banks, ordered by EINT group number. */
159 /* Must start with EINTG banks, ordered by EINT group number. */
[all …]
/linux-6.14.4/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
/linux-6.14.4/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
/linux-6.14.4/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-6.14.4/drivers/platform/x86/hp/hp-bioscfg/
Dorder-list-attributes.c3 * 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()
78 return sysfs_emit(buf, "ordered-list\n"); in type_show()
257 * Ordered list data is stored in hex and comma separated format in hp_populate_ordered_list_elements_from_package()
361 …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()
380 * instance under ordered list attribute
395 /* Populate ordered list elements */ in hp_populate_ordered_list_buffer_data()
/linux-6.14.4/Documentation/arch/riscv/
Duabi.rst26 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.14.4/include/trace/events/
Dbtrfs.h502 const struct btrfs_ordered_extent *ordered),
504 TP_ARGS(inode, ordered),
522 __entry->file_offset = ordered->file_offset;
523 __entry->start = ordered->disk_bytenr;
524 __entry->len = ordered->num_bytes;
525 __entry->disk_len = ordered->disk_num_bytes;
526 __entry->bytes_left = ordered->bytes_left;
527 __entry->flags = ordered->flags;
528 __entry->compress_type = ordered->compress_type;
529 __entry->refs = refcount_read(&ordered->refs);
[all …]
/linux-6.14.4/Documentation/devicetree/bindings/
Ddts-coding-style.rst51 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.14.4/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-6.14.4/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-6.14.4/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-6.14.4/Documentation/litmus-tests/
DREADME18 the RMW are ordered before the subsequential memory accesses.
24 cmpxchg-fail-ordered-1.litmus
28 cmpxchg-fail-ordered-2.litmus
/linux-6.14.4/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-6.14.4/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.

12345678910>>...34