Home
last modified time | relevance | path

Searched refs:ordered (Results 1 – 25 of 155) sorted by relevance

1234567

/linux/fs/btrfs/
H A Dordered-data.c336 void btrfs_mark_ordered_extent_error(struct btrfs_ordered_extent *ordered) in btrfs_mark_ordered_extent_error() argument
338 if (!test_and_set_bit(BTRFS_ORDERED_IOERR, &ordered->flags)) in btrfs_mark_ordered_extent_error()
339 mapping_set_error(ordered->inode->vfs_inode.i_mapping, -EIO); in btrfs_mark_ordered_extent_error()
350 static bool can_finish_ordered_extent(struct btrfs_ordered_extent *ordered, in can_finish_ordered_extent() argument
354 struct btrfs_inode *inode = ordered->inode; in can_finish_ordered_extent()
376 if (WARN_ON_ONCE(len > ordered->bytes_left)) { in can_finish_ordered_extent()
380 ordered->file_offset, ordered->num_bytes, in can_finish_ordered_extent()
381 len, ordered->bytes_left); in can_finish_ordered_extent()
382 ordered->bytes_left = 0; in can_finish_ordered_extent()
384 ordered->bytes_left -= len; in can_finish_ordered_extent()
[all …]
H A Ddirect-io.c19 struct btrfs_ordered_extent *ordered; member
42 struct btrfs_ordered_extent *ordered; in lock_extent_direct() local
68 ordered = btrfs_lookup_ordered_range(BTRFS_I(inode), lockstart, in lock_extent_direct()
78 if (!ordered && in lock_extent_direct()
85 if (ordered) { in lock_extent_direct()
87 btrfs_put_ordered_extent(ordered); in lock_extent_direct()
107 test_bit(BTRFS_ORDERED_DIRECT, &ordered->flags)) in lock_extent_direct()
108 btrfs_start_ordered_extent(ordered); in lock_extent_direct()
111 btrfs_put_ordered_extent(ordered); in lock_extent_direct()
147 struct btrfs_ordered_extent *ordered; in btrfs_create_dio_extent() local
[all …]
H A Dextent_io.c541 btrfs_finish_ordered_extent(bbio->ordered, folio, start, len, in end_bbio_data_write()
755 struct btrfs_ordered_extent *ordered; in alloc_new_bio() local
757 ordered = btrfs_lookup_ordered_extent(inode, file_offset); in alloc_new_bio()
758 if (ordered) { in alloc_new_bio()
760 ordered->file_offset + in alloc_new_bio()
761 ordered->disk_num_bytes - file_offset); in alloc_new_bio()
762 bbio->ordered = ordered; in alloc_new_bio()
1173 struct btrfs_ordered_extent *ordered, in can_skip_one_ordered_range() argument
1220 ordered->file_offset + ordered->num_bytes) - cur; in can_skip_one_ordered_range()
1228 *fileoff = ordered->file_offset + ordered->num_bytes; in can_skip_one_ordered_range()
[all …]
H A Dordered-data.h166 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 Dcompression.c295 btrfs_finish_ordered_extent(cb->bbio.ordered, NULL, cb->start, cb->len, in end_bbio_compressed_write()
315 void btrfs_submit_compressed_write(struct btrfs_ordered_extent *ordered, in btrfs_submit_compressed_write() argument
318 struct btrfs_inode *inode = ordered->inode; in btrfs_submit_compressed_write()
321 ASSERT(IS_ALIGNED(ordered->file_offset, fs_info->sectorsize)); in btrfs_submit_compressed_write()
322 ASSERT(IS_ALIGNED(ordered->num_bytes, fs_info->sectorsize)); in btrfs_submit_compressed_write()
330 cb->start = ordered->file_offset; in btrfs_submit_compressed_write()
331 cb->len = ordered->num_bytes; in btrfs_submit_compressed_write()
332 ASSERT(cb->bbio.bio.bi_iter.bi_size == ordered->disk_num_bytes); in btrfs_submit_compressed_write()
333 cb->compressed_len = ordered->disk_num_bytes; in btrfs_submit_compressed_write()
334 cb->bbio.bio.bi_iter.bi_sector = ordered->disk_bytenr >> SECTOR_SHIFT; in btrfs_submit_compressed_write()
[all …]
H A Dinode.c1141 struct btrfs_ordered_extent *ordered; in submit_one_async_extent() local
1209 ordered = btrfs_alloc_ordered_extent(inode, start, &file_extent, in submit_one_async_extent()
1211 if (IS_ERR(ordered)) { in submit_one_async_extent()
1213 ret = PTR_ERR(ordered); in submit_one_async_extent()
1216 async_extent->cb->bbio.ordered = ordered; in submit_one_async_extent()
1313 struct btrfs_ordered_extent *ordered; in cow_one_range() local
1350 ordered = btrfs_alloc_ordered_extent(inode, file_offset, &file_extent, in cow_one_range()
1352 if (IS_ERR(ordered)) { in cow_one_range()
1354 ret = PTR_ERR(ordered); in cow_one_range()
1359 ret = btrfs_reloc_clone_csums(ordered); in cow_one_range()
[all …]
H A Dzoned.c2076 static void btrfs_rewrite_logical_zoned(struct btrfs_ordered_extent *ordered, in btrfs_rewrite_logical_zoned() argument
2079 struct extent_map_tree *em_tree = &ordered->inode->extent_tree; in btrfs_rewrite_logical_zoned()
2082 ordered->disk_bytenr = logical; in btrfs_rewrite_logical_zoned()
2085 em = btrfs_search_extent_mapping(em_tree, ordered->file_offset, in btrfs_rewrite_logical_zoned()
2086 ordered->num_bytes); in btrfs_rewrite_logical_zoned()
2094 static bool btrfs_zoned_split_ordered(struct btrfs_ordered_extent *ordered, in btrfs_zoned_split_ordered() argument
2099 if (!test_bit(BTRFS_ORDERED_NOCOW, &ordered->flags) && in btrfs_zoned_split_ordered()
2100 btrfs_split_extent_map(ordered->inode, ordered->file_offset, in btrfs_zoned_split_ordered()
2101 ordered->num_bytes, len, logical)) in btrfs_zoned_split_ordered()
2104 new = btrfs_split_ordered_extent(ordered, len); in btrfs_zoned_split_ordered()
[all …]
H A Dbio.c95 refcount_inc(&orig_bbio->ordered->refs); in btrfs_split_bio()
96 bbio->ordered = orig_bbio->ordered; in btrfs_split_bio()
125 btrfs_put_ordered_extent(bbio->ordered); in btrfs_bio_end_io()
144 struct btrfs_ordered_extent *ordered = bbio->ordered; in btrfs_bio_end_io() local
147 btrfs_put_ordered_extent(ordered); in btrfs_bio_end_io()
821 list_add_tail(&bioc->rst_ordered_entry, &bbio->ordered->bioc_list); in btrfs_submit_chunk()
H A Dsubpage.c487 ordered, start, len); in btrfs_subpage_set_ordered()
501 ordered, start, len); in btrfs_subpage_clear_ordered()
506 if (subpage_test_bitmap_all_zero(fs_info, folio, ordered)) in btrfs_subpage_clear_ordered()
563 IMPLEMENT_BTRFS_SUBPAGE_TEST_OP(ordered);
660 IMPLEMENT_BTRFS_PAGE_OPS(ordered, folio_set_ordered, folio_clear_ordered,
797 GET_SUBPAGE_BITMAP(fs_info, folio, ordered, &ordered_bitmap); in btrfs_subpage_dump_bitmap()
/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/include/trace/events/
H A 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/tools/lib/subcmd/
H A Dparse-options.c811 struct option *opt, *ordered = NULL, *group; in options__order() local
823 group = realloc(ordered, len); in options__order()
826 ordered = group; in options__order()
827 memcpy(&ordered[nr_parent], p, sizeof(*o) * (nr_opts - nr_parent)); in options__order()
832 memcpy(&ordered[nr_opts], o, sizeof(*o)); in options__order()
835 for (opt = group = ordered; opt->type != OPTION_END; opt++) { in options__order()
847 return ordered; in options__order()
885 struct option *ordered; in usage_with_options_internal() local
910 ordered = options__order(opts); in usage_with_options_internal()
911 if (ordered) in usage_with_options_internal()
[all …]
/linux/Documentation/core-api/
H A Drefcount-vs-atomic.rst67 then further stores are ordered against this operation.
135 * fully ordered --> control dependency on success for stores
151 * fully ordered --> ACQUIRE ordering on success
164 * fully ordered --> RELEASE ordering + ACQUIRE ordering on success
177 * fully ordered --> RELEASE ordering + control dependency
192 * fully ordered --> RELEASE ordering + control dependency + hold
/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.
/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
H A Datomic_bitops.txt59 - RMW operations that have a return value are fully ordered.
61 - RMW operations that are conditional are fully ordered.
/linux/Documentation/devicetree/bindings/
H A 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/Documentation/arch/riscv/
H A Duabi.rst28 ordered first by category, in canonical order, as listed above, then
33 extensions are listed, they will be ordered alphabetically.
37 extensions are listed, they will be ordered alphabetically.
41 ordered alphabetically.
/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/Documentation/admin-guide/perf/
H A Dnvidia-pmu.rst32 strongly-ordered (SO) PCIE write traffic to local/remote memory. Please see
62 In this config, the PMU captures read and relaxed ordered (RO) writes from
155 to local memory. For PCIE traffic, this PMU captures read and relaxed ordered
281 PCIE1 traffic represents strongly ordered (SO) writes.
282 PCIE2 traffic represents reads and relaxed ordered (RO) writes.
332 PCIE1 traffic represents strongly ordered (SO) writes.
333 PCIE2 traffic represents reads and relaxed ordered (RO) writes.
/linux/virt/kvm/
H A DKconfig23 # Only strongly ordered architectures can select this, as it doesn't
31 # Weakly ordered architectures can only select this, advertising
/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
H A DCoWW+poonceonce.litmus7 * writes to the same variable are ordered.
/linux/tools/perf/Documentation/
H A Dperf.txt60 ordered-events - ordered events object debug messages
/linux/Documentation/ABI/testing/
H A Dsysfs-driver-input-cros-ec-keyb5 ordered by the physical positions of the keys, from left

1234567