Home
last modified time | relevance | path

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

12345

/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/tools/lib/subcmd/
H A Dparse-options.c849 struct option *opt, *ordered = NULL, *group;
861 group = realloc(ordered, len); in option__in_argv()
864 ordered = group; in option__in_argv()
865 memcpy(&ordered[nr_parent], p, sizeof(*o) * (nr_opts - nr_parent)); in option__in_argv()
870 memcpy(&ordered[nr_opts], o, sizeof(*o)); in option__in_argv()
873 for (opt = group = ordered; opt->type != OPTION_END; opt++) { in option__in_argv()
885 return ordered; in usage_with_options_internal() local
923 struct option *ordered; in usage_with_options_internal()
948 ordered = options__order(opts); in usage_with_options_msg()
949 if (ordered) in usage_with_options_msg()
811 struct option *opt, *ordered = NULL, *group; options__order() local
[all...]
/linux/include/trace/events/
H A Dbtrfs.h571 const struct btrfs_ordered_extent *ordered),
573 TP_ARGS(inode, ordered),
591 __entry->file_offset = ordered->file_offset;
592 __entry->start = ordered->disk_bytenr;
593 __entry->len = ordered->num_bytes;
594 __entry->disk_len = ordered->disk_num_bytes;
595 __entry->bytes_left = ordered->bytes_left;
596 __entry->flags = ordered->flags;
597 __entry->compress_type = ordered->compress_type;
598 __entry->refs = refcount_read(&ordered
[all...]
/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/fs/btrfs/
H A Dextent_io.c96 * how many bytes are there before stripe/ordered extent boundary.
538 btrfs_finish_ordered_extent(bbio->ordered, bbio->file_offset, bio_size, !error); in end_bbio_data_write()
741 /* Limit data write bios to the ordered boundary. */ in alloc_new_bio()
743 struct btrfs_ordered_extent *ordered; in alloc_new_bio()
749 ordered = btrfs_lookup_ordered_extent(inode, file_offset); in alloc_new_bio() local
750 if (unlikely(!ordered)) { in alloc_new_bio()
761 ordered->file_offset + in alloc_new_bio()
762 ordered->disk_num_bytes - file_offset); in alloc_new_bio()
763 bbio->ordered = ordered; in alloc_new_bio()
1167 can_skip_one_ordered_range(struct btrfs_inode * inode,struct btrfs_ordered_extent * ordered,u64 * fileoff) can_skip_one_ordered_range() argument
1263 can_skip_ordered_extent(struct btrfs_inode * inode,struct btrfs_ordered_extent * ordered,u64 start,u64 end) can_skip_ordered_extent() argument
1302 struct btrfs_ordered_extent *ordered; lock_extents_for_read() local
1766 struct btrfs_ordered_extent *ordered; extent_writepage_io() local
[all...]
H A Dinode.c42 #include "ordered-data.h"
390 * Cleanup all submitted ordered extents in specified range to handle errors
396 * to be released, which we want to happen only when finishing the ordered
846 * This is done inside an ordered work queue, and the compression is spread in compressed_bio_last_folio()
847 * across many cpus. The actual IO submission is step two, and the ordered work in compressed_bio_last_folio()
1032 struct btrfs_ordered_extent *ordered; in submit_uncompressed_range()
1100 ordered = btrfs_alloc_ordered_extent(inode, start, &file_extent, in submit_one_async_extent()
1102 if (IS_ERR(ordered)) { in submit_one_async_extent()
1104 ret = PTR_ERR(ordered); in submit_one_async_extent()
1107 async_extent->cb->bbio.ordered in submit_one_async_extent()
1056 struct btrfs_ordered_extent *ordered; submit_one_async_extent() local
1228 struct btrfs_ordered_extent *ordered; cow_one_range() local
1932 struct btrfs_ordered_extent *ordered; nocow_one_range() local
2847 struct btrfs_ordered_extent *ordered; btrfs_writepage_fixup_worker() local
3438 btrfs_finish_ordered_io(struct btrfs_ordered_extent * ordered) btrfs_finish_ordered_io() argument
5055 struct btrfs_ordered_extent *ordered; btrfs_truncate_block() local
7722 struct btrfs_ordered_extent *ordered; btrfs_invalidate_folio() local
8132 struct btrfs_ordered_extent *ordered; btrfs_destroy_inode() local
9770 struct btrfs_ordered_extent *ordered; btrfs_encoded_read() local
9793 struct btrfs_ordered_extent *ordered; btrfs_encoded_read() local
9913 struct btrfs_ordered_extent *ordered; btrfs_do_encoded_write() local
10661 struct btrfs_ordered_extent *ordered; btrfs_assert_inode_range_clean() local
[all...]
H A Dcompression.c29 #include "ordered-data.h"
295 btrfs_finish_ordered_extent(cb->bbio.ordered, 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->bbio.bio.bi_iter.bi_sector = ordered in btrfs_submit_compressed_write()
[all...]
H A Dzoned.c2091 static void btrfs_rewrite_logical_zoned(struct btrfs_ordered_extent *ordered, in btrfs_rewrite_logical_zoned()
2094 struct extent_map_tree *em_tree = &ordered->inode->extent_tree; in btrfs_zoned_split_ordered()
2097 ordered->disk_bytenr = logical; in btrfs_zoned_split_ordered()
2100 em = btrfs_search_extent_mapping(em_tree, ordered->file_offset, in btrfs_zoned_split_ordered()
2101 ordered->num_bytes); in btrfs_zoned_split_ordered()
2109 static bool btrfs_zoned_split_ordered(struct btrfs_ordered_extent *ordered, in btrfs_zoned_split_ordered()
2114 if (!test_bit(BTRFS_ORDERED_NOCOW, &ordered->flags) && in btrfs_finish_ordered_zoned()
2115 btrfs_split_extent_map(ordered->inode, ordered->file_offset, in btrfs_finish_ordered_zoned()
2116 ordered in btrfs_finish_ordered_zoned()
2075 btrfs_rewrite_logical_zoned(struct btrfs_ordered_extent * ordered,u64 logical) btrfs_rewrite_logical_zoned() argument
2093 btrfs_zoned_split_ordered(struct btrfs_ordered_extent * ordered,u64 logical,u64 len) btrfs_zoned_split_ordered() argument
2111 btrfs_finish_ordered_zoned(struct btrfs_ordered_extent * ordered) btrfs_finish_ordered_zoned() argument
[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
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/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/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.
H A DCoRR+poonceonce+Once.litmus7 * reads from the same variable are ordered.
H A DCoRW+poonceonce+Once.litmus7 * a given variable and a later write to that same variable are ordered.
H A DCoWR+poonceonce+Once.litmus7 * given variable and a later read from that same variable are ordered.
H A DR+fencembonceonces.litmus6 * This is the fully ordered (via smp_mb()) version of one of the classic
H A DMP+polockonce+poacquiresilsil.litmus7 * to sense the lock-held state, ordered by acquire? Note that when the
/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
/linux/Documentation/litmus-tests/atomic/
H A Dcmpxchg-fail-ordered-2.litmus1 C cmpxchg-fail-ordered-2
H A DAtomic-RMW+mb__after_atomic-is-stronger-than-acquire.litmus8 * the RMW are ordered before the subsequential memory accesses.
H A Dcmpxchg-fail-ordered-1.litmus1 C cmpxchg-fail-ordered-1

12345