Home
last modified time | relevance | path

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

1234

/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.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/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/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.c541 btrfs_finish_ordered_extent(bbio->ordered, bbio->file_offset, bio_size, !error); in end_bbio_data_write()
749 struct btrfs_ordered_extent *ordered; in alloc_new_bio() local
751 ordered = btrfs_lookup_ordered_extent(inode, file_offset); in alloc_new_bio()
752 if (ordered) { in alloc_new_bio()
754 ordered->file_offset + in alloc_new_bio()
755 ordered->disk_num_bytes - file_offset); in alloc_new_bio()
756 bbio->ordered = ordered; in alloc_new_bio()
1167 struct btrfs_ordered_extent *ordered, in can_skip_one_ordered_range() argument
1214 ordered->file_offset + ordered->num_bytes) - cur; in can_skip_one_ordered_range()
1222 *fileoff = ordered->file_offset + ordered->num_bytes; in can_skip_one_ordered_range()
[all …]
H A Dinode.c1056 struct btrfs_ordered_extent *ordered; in submit_one_async_extent() local
1124 ordered = btrfs_alloc_ordered_extent(inode, start, &file_extent, in submit_one_async_extent()
1126 if (IS_ERR(ordered)) { in submit_one_async_extent()
1128 ret = PTR_ERR(ordered); in submit_one_async_extent()
1131 async_extent->cb->bbio.ordered = ordered; in submit_one_async_extent()
1228 struct btrfs_ordered_extent *ordered; in cow_one_range() local
1265 ordered = btrfs_alloc_ordered_extent(inode, file_offset, &file_extent, in cow_one_range()
1267 if (IS_ERR(ordered)) { in cow_one_range()
1269 ret = PTR_ERR(ordered); in cow_one_range()
1274 ret = btrfs_reloc_clone_csums(ordered); in cow_one_range()
[all …]
H A Dcompression.c295 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->disk_bytenr >> SECTOR_SHIFT; in btrfs_submit_compressed_write()
334 cb->bbio.ordered = ordered; in btrfs_submit_compressed_write()
H A Dzoned.c2075 static void btrfs_rewrite_logical_zoned(struct btrfs_ordered_extent *ordered, in btrfs_rewrite_logical_zoned() argument
2078 struct extent_map_tree *em_tree = &ordered->inode->extent_tree; in btrfs_rewrite_logical_zoned()
2081 ordered->disk_bytenr = logical; in btrfs_rewrite_logical_zoned()
2084 em = btrfs_search_extent_mapping(em_tree, ordered->file_offset, in btrfs_rewrite_logical_zoned()
2085 ordered->num_bytes); in btrfs_rewrite_logical_zoned()
2093 static bool btrfs_zoned_split_ordered(struct btrfs_ordered_extent *ordered, in btrfs_zoned_split_ordered() argument
2098 if (!test_bit(BTRFS_ORDERED_NOCOW, &ordered->flags) && in btrfs_zoned_split_ordered()
2099 btrfs_split_extent_map(ordered->inode, ordered->file_offset, in btrfs_zoned_split_ordered()
2100 ordered->num_bytes, len, logical)) in btrfs_zoned_split_ordered()
2103 new = btrfs_split_ordered_extent(ordered, len); in btrfs_zoned_split_ordered()
[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

1234