Home
last modified time | relevance | path

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

12345678910>>...60

/kernel/linux/linux-6.6/fs/btrfs/
Dordered-data.c124 * look find the first ordered struct that has this offset, otherwise
167 * The ordered extent has reserved qgroup space, release now in alloc_ordered_extent()
235 "inconsistency in ordered tree at offset %llu", in insert_ordered_extent()
253 * Add an ordered extent to the per-inode tree.
266 * tree is given a single reference on the ordered extent that was inserted, and
269 * Return: the new ordered extent or error pointer.
291 * when an ordered extent is finished. If the list covers more than one
292 * ordered extent, it is split across multiples.
313 static bool can_finish_ordered_extent(struct btrfs_ordered_extent *ordered, in can_finish_ordered_extent() argument
317 struct btrfs_inode *inode = BTRFS_I(ordered->inode); in can_finish_ordered_extent()
[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 */
170 bool btrfs_finish_ordered_extent(struct btrfs_ordered_extent *ordered,
210 struct btrfs_ordered_extent *ordered, u64 len);
Dinode.c43 #include "ordered-data.h"
83 struct btrfs_ordered_extent *ordered; member
401 * Cleanup all submitted ordered extents in specified range to handle errors
407 * to be released, which we want to happen only when finishing the ordered
429 * clear page Ordered and run the ordered extent accounting. in btrfs_cleanup_ordered_extents()
431 * Here we can't just clear the Ordered bit, or in btrfs_cleanup_ordered_extents()
433 * for the page range, and the ordered extent will never finish. in btrfs_cleanup_ordered_extents()
445 * Here we just clear all Ordered bits for every page in the in btrfs_cleanup_ordered_extents()
447 * the ordered extent accounting for the range. in btrfs_cleanup_ordered_extents()
820 * This is done inside an ordered work queue, and the compression is spread
[all …]
Dextent-io-tree.h26 * Must be cleared only during ordered extent completion or on error
27 * paths if we did not manage to submit bios and create the ordered
29 * and page invalidation (if there is an ordered extent in flight),
30 * that is left for the ordered extent completion.
34 * When an ordered extent successfully completes for a region marked as
Dtree-log.h60 struct btrfs_ordered_extent *ordered; in btrfs_release_log_ctx_extents() local
65 list_for_each_entry_safe(ordered, tmp, &ctx->ordered_extents, log_list) { in btrfs_release_log_ctx_extents()
66 list_del_init(&ordered->log_list); in btrfs_release_log_ctx_extents()
67 btrfs_put_ordered_extent(ordered); in btrfs_release_log_ctx_extents()
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()
/kernel/linux/linux-5.10/fs/btrfs/
Dordered-data.c131 * 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 …]
Dtree-log.h40 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()
Dordered-data.h61 /* 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
Dfile.c1395 * 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/
Dpinctrl-exynos-arm64.c48 /* 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 …]
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 …]
/kernel/linux/linux-6.6/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 …]
/kernel/linux/linux-6.6/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
/kernel/linux/linux-5.10/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
/kernel/linux/linux-5.10/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
/kernel/linux/linux-6.6/Documentation/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.
/kernel/linux/linux-6.6/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
/kernel/linux/linux-6.6/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
/kernel/linux/linux-5.10/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()
236 ui_progress__init(&prog, oe->nr_events, "Processing time ordered events..."); in do_flush()
/kernel/linux/linux-6.6/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()
/kernel/linux/linux-6.6/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()
80 return sysfs_emit(buf, "ordered-list\n"); in type_show()
263 * Ordered list data is stored in hex and comma separated format in hp_populate_ordered_list_elements_from_package()
369 …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()
388 * instance under ordered list attribute
403 /* Populate ordered list elements */ in hp_populate_ordered_list_buffer_data()
/kernel/linux/linux-5.10/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
69 * Accesses from a single hart to a single I/O address must be ordered. This
/kernel/linux/linux-6.6/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 …]

12345678910>>...60