Home
last modified time | relevance | path

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

12345678910>>...26

/linux/fs/btrfs/
H A Dordered-data.c124 * look find the first ordered struct that has this offset, otherwise
162 * ordered extent by calling btrfs_qgroup_release_data() and tracking in alloc_ordered_extent()
163 * the qgroup reserved amount in the ordered extent, so that later after in alloc_ordered_extent()
164 * completing the ordered extent, when running the data delayed ref it in alloc_ordered_extent()
245 "inconsistency in ordered tree at offset %llu", in insert_ordered_extent()
263 * Add an ordered extent to the per-inode tree.
276 * tree is given a single reference on the ordered extent that was inserted, and
279 * Return: the new ordered extent or error pointer.
295 * For PREALLOC, we do not use ordered extent members, but in btrfs_alloc_ordered_extent()
298 * So here we always pass 0 as offset for NOCOW/PREALLOC ordered extents, in btrfs_alloc_ordered_extent()
[all …]
H A 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 …]
H A Dordered-data.h51 * Different types for ordered extents, one and only one of the 4 types
52 * need to be set when creating ordered extent.
70 /* Extra status bits for ordered extents */
82 /* We have already logged all the csums of the ordered extent */
117 * this ordered extent so that we do not expose stale data.
148 /* a per root list of all the pending ordered extents */
166 void btrfs_finish_ordered_extent(struct btrfs_ordered_extent *ordered,
223 struct btrfs_ordered_extent *ordered, u64 len);
224 void btrfs_mark_ordered_extent_error(struct btrfs_ordered_extent *ordered);
H A 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 * Mark that a range is being locked for finishing an ordered extent.
47 * When an ordered extent successfully completes for a region marked as
H A Dinode.c42 #include "ordered-data.h"
389 * Cleanup all submitted ordered extents in specified range to handle errors
395 * to be released, which we want to happen only when finishing the ordered
414 * Here we just clear all Ordered bits for every page in the in btrfs_cleanup_ordered_extents()
416 * the ordered extent accounting for the range. in btrfs_cleanup_ordered_extents()
840 * This is done inside an ordered work queue, and the compression is spread
841 * across many cpus. The actual IO submission is step two, and the ordered work
1097 struct btrfs_ordered_extent *ordered; in submit_one_async_extent() local
1165 ordered = btrfs_alloc_ordered_extent(inode, start, &file_extent, in submit_one_async_extent()
1167 if (IS_ERR(ordered)) { in submit_one_async_extent()
[all …]
H A Dfile.c891 * Locks the extent and properly waits for data=ordered extents to finish
914 struct btrfs_ordered_extent *ordered; in lock_and_cleanup_extent_if_need() local
928 ordered = btrfs_lookup_ordered_range(inode, start_pos, in lock_and_cleanup_extent_if_need()
930 if (ordered && in lock_and_cleanup_extent_if_need()
931 ordered->file_offset + ordered->num_bytes > start_pos && in lock_and_cleanup_extent_if_need()
932 ordered->file_offset <= last_pos) { in lock_and_cleanup_extent_if_need()
937 btrfs_start_ordered_extent(ordered); in lock_and_cleanup_extent_if_need()
938 btrfs_put_ordered_extent(ordered); in lock_and_cleanup_extent_if_need()
941 if (ordered) in lock_and_cleanup_extent_if_need()
942 btrfs_put_ordered_extent(ordered); in lock_and_cleanup_extent_if_need()
[all …]
H A Dextent_io.c95 * how many bytes are there before stripe/ordered extent boundary.
543 btrfs_finish_ordered_extent(bbio->ordered, folio, start, len, in end_bbio_data_write()
752 /* Limit data write bios to the ordered boundary. */ in alloc_new_bio()
754 struct btrfs_ordered_extent *ordered; in alloc_new_bio() local
756 ordered = btrfs_lookup_ordered_extent(inode, file_offset); in alloc_new_bio()
757 if (ordered) { in alloc_new_bio()
759 ordered->file_offset + in alloc_new_bio()
760 ordered->disk_num_bytes - file_offset); in alloc_new_bio()
761 bbio->ordered = ordered; in alloc_new_bio()
811 /* Cap to the current ordered extent boundary if there is one. */ in submit_extent_folio()
[all …]
H A Dbio.c93 refcount_inc(&orig_bbio->ordered->refs); in btrfs_split_bio()
94 bbio->ordered = orig_bbio->ordered; in btrfs_split_bio()
109 btrfs_put_ordered_extent(bbio->ordered); in btrfs_bio_end_io()
128 struct btrfs_ordered_extent *ordered = bbio->ordered; in btrfs_bio_end_io() local
131 btrfs_put_ordered_extent(ordered); in btrfs_bio_end_io()
530 * sums are attached onto the ordered extent record.
532 * At IO completion time the csums attached on the ordered extent record are
549 * sums are attached onto the ordered extent record.
551 * At IO completion time the csums attached on the ordered extent record are
730 list_add_tail(&bioc->rst_ordered_entry, &bbio->ordered->bioc_list); in btrfs_submit_chunk()
H A Dspace-info.c11 #include "ordered-data.h"
121 * running delalloc, but usually we need to wait for ordered extents to
713 * If we are doing more ordered than delalloc we need to just wait on in shrink_delalloc()
714 * ordered extents, otherwise we'll waste time trying to flush delalloc in shrink_delalloc()
736 * their jobs and thus have ordered extents set up properly. in shrink_delalloc()
742 * that we know we'll have ordered extents for everything and we in shrink_delalloc()
932 u64 ordered, delalloc; in need_preemptive_reclaim() local
1006 * If we have more ordered bytes than delalloc bytes then we're either in need_preemptive_reclaim()
1010 * of ordered extents, preemptively waiting on ordered extents gets us in need_preemptive_reclaim()
1011 * nothing, if our reservations are tied up in ordered extents we'll in need_preemptive_reclaim()
[all …]
H A Dsubpage.h18 * For subpage we pack all uptodate/dirty/writeback/ordered bitmaps into
23 * /- uptodate /- dirty /- ordered
45 * The ordered and checked flags are for COW fixup, already marked
185 DECLARE_BTRFS_SUBPAGE_OPS(ordered);
/linux/Documentation/devicetree/bindings/scsi/
H A 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/drivers/pinctrl/samsung/
H A 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 …]
/linux/Documentation/
H A 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/arch/riscv/include/asm/
H A Dio.h40 * be fully ordered with respect to other memory and I/O operations". We're
42 * - Fully ordered WRT each other, by bracketing them with two fences. The
43 * outer set contains both I/O so inX is ordered with outX, while the inner just
45 * - Ordered in the same manner as readX/writeX WRT memory by subsuming their
47 * - Ordered WRT timer reads, so udelay and friends don't get elided by the
60 * Accesses from a single hart to a single I/O address must be ordered. This
H A Dpgtable-64.h117 * 01 - NC Non-cacheable, idempotent, weakly-ordered Main Memory
118 * 10 - IO Non-cacheable, non-idempotent, strongly-ordered I/O memory
132 * 00110 - NC Weakly-ordered, Non-cacheable, Bufferable, Shareable, Non-trustable
133 * 01110 - PMA Weakly-ordered, Cacheable, Bufferable, Shareable, Non-trustable
134 * 10010 - IO Strongly-ordered, Non-cacheable, Non-bufferable, Shareable, Non-trustable
/linux/drivers/platform/x86/hp/hp-bioscfg/
H A 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/tools/perf/util/
H A 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/include/trace/events/
H A Dbtrfs.h501 const struct btrfs_ordered_extent *ordered),
503 TP_ARGS(inode, ordered),
521 __entry->file_offset = ordered->file_offset;
522 __entry->start = ordered->disk_bytenr;
523 __entry->len = ordered->num_bytes;
524 __entry->disk_len = ordered->disk_num_bytes;
525 __entry->bytes_left = ordered->bytes_left;
526 __entry->flags = ordered->flags;
527 __entry->compress_type = ordered->compress_type;
528 __entry->refs = refcount_read(&ordered
[all...]
/linux/Documentation/arch/riscv/
H A 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/rust/kernel/sync/atomic/
H A Dordering.rs13 //! - [`Full`] means "fully-ordered", that is:
43 /// The annotation type for fully-ordered memory ordering, for the description fully-ordered memory
58 /// Fully-ordered.
/linux/tools/memory-model/litmus-tests/
H A 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/drivers/net/ethernet/cavium/liquidio/
H A 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/Documentation/litmus-tests/
H A DREADME18 the RMW are ordered before the subsequential memory accesses.
24 cmpxchg-fail-ordered-1.litmus
28 cmpxchg-fail-ordered-2.litmus
/linux/include/asm-generic/bitops/
H A 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/Documentation/devicetree/bindings/sound/
H A 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.

12345678910>>...26