Home
last modified time | relevance | path

Searched refs:ordered (Results 1 – 25 of 112) 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.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/fs/btrfs/
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 Dextent_io.c542 btrfs_finish_ordered_extent(bbio->ordered, folio, start, len, in end_bbio_data_write()
751 struct btrfs_ordered_extent *ordered; in alloc_new_bio() local
753 ordered = btrfs_lookup_ordered_extent(inode, file_offset); in alloc_new_bio()
754 if (ordered) { in alloc_new_bio()
756 ordered->file_offset + in alloc_new_bio()
757 ordered->disk_num_bytes - file_offset); in alloc_new_bio()
758 bbio->ordered = ordered; in alloc_new_bio()
1155 struct btrfs_ordered_extent *ordered, in can_skip_one_ordered_range() argument
1202 ordered->file_offset + ordered->num_bytes) - cur; in can_skip_one_ordered_range()
1210 *fileoff = ordered->file_offset + ordered->num_bytes; in can_skip_one_ordered_range()
[all …]
H A Dcompression.c331 btrfs_finish_ordered_extent(cb->bbio.ordered, NULL, cb->start, cb->len, in end_bbio_compressed_write()
369 void btrfs_submit_compressed_write(struct btrfs_ordered_extent *ordered, in btrfs_submit_compressed_write() argument
375 struct btrfs_inode *inode = ordered->inode; in btrfs_submit_compressed_write()
379 ASSERT(IS_ALIGNED(ordered->file_offset, fs_info->sectorsize)); in btrfs_submit_compressed_write()
380 ASSERT(IS_ALIGNED(ordered->num_bytes, fs_info->sectorsize)); in btrfs_submit_compressed_write()
382 cb = alloc_compressed_bio(inode, ordered->file_offset, in btrfs_submit_compressed_write()
385 cb->start = ordered->file_offset; in btrfs_submit_compressed_write()
386 cb->len = ordered->num_bytes; in btrfs_submit_compressed_write()
388 cb->compressed_len = ordered->disk_num_bytes; in btrfs_submit_compressed_write()
391 cb->bbio.bio.bi_iter.bi_sector = ordered->disk_bytenr >> SECTOR_SHIFT; in btrfs_submit_compressed_write()
[all …]
H A Dzoned.c1864 static void btrfs_rewrite_logical_zoned(struct btrfs_ordered_extent *ordered, in btrfs_rewrite_logical_zoned() argument
1867 struct extent_map_tree *em_tree = &ordered->inode->extent_tree; in btrfs_rewrite_logical_zoned()
1870 ordered->disk_bytenr = logical; in btrfs_rewrite_logical_zoned()
1873 em = btrfs_search_extent_mapping(em_tree, ordered->file_offset, in btrfs_rewrite_logical_zoned()
1874 ordered->num_bytes); in btrfs_rewrite_logical_zoned()
1882 static bool btrfs_zoned_split_ordered(struct btrfs_ordered_extent *ordered, in btrfs_zoned_split_ordered() argument
1887 if (!test_bit(BTRFS_ORDERED_NOCOW, &ordered->flags) && in btrfs_zoned_split_ordered()
1888 btrfs_split_extent_map(ordered->inode, ordered->file_offset, in btrfs_zoned_split_ordered()
1889 ordered->num_bytes, len, logical)) in btrfs_zoned_split_ordered()
1892 new = btrfs_split_ordered_extent(ordered, len); in btrfs_zoned_split_ordered()
[all …]
H A Drelocation.h21 int btrfs_reloc_clone_csums(struct btrfs_ordered_extent *ordered);
/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/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/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 DKconfig22 # Only strongly ordered architectures can select this, as it doesn't
30 # 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