Home
last modified time | relevance | path

Searched refs:ordered (Results 1 – 25 of 119) 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/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/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 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.c95 * how many bytes are there before stripe/ordered extent boundary.
541 btrfs_finish_ordered_extent(bbio->ordered, folio, start, len, in end_bbio_data_write()
748 /* Limit data write bios to the ordered boundary. */ in alloc_new_bio()
750 struct btrfs_ordered_extent *ordered; in alloc_new_bio()
752 ordered = btrfs_lookup_ordered_extent(inode, file_offset); in alloc_new_bio()
753 if (ordered) { in alloc_new_bio()
755 ordered->file_offset + in alloc_new_bio()
756 ordered->disk_num_bytes - file_offset); in alloc_new_bio()
757 bbio->ordered = ordered; in alloc_new_bio()
751 struct btrfs_ordered_extent *ordered; alloc_new_bio() local
1155 can_skip_one_ordered_range(struct btrfs_inode * inode,struct btrfs_ordered_extent * ordered,u64 * fileoff) can_skip_one_ordered_range() argument
1251 can_skip_ordered_extent(struct btrfs_inode * inode,struct btrfs_ordered_extent * ordered,u64 start,u64 end) can_skip_ordered_extent() argument
1290 struct btrfs_ordered_extent *ordered; lock_extents_for_read() local
1728 struct btrfs_ordered_extent *ordered; extent_writepage_io() local
[all...]
H A Dinode.c43 #include "ordered-data.h"
394 * Cleanup all submitted ordered extents in specified range to handle errors
400 * to be released, which we want to happen only when finishing the ordered
421 * the ordered extent accounting for the range. in btrfs_cleanup_ordered_extents()
923 * This is done inside an ordered work queue, and the compression is spread in compress_file_range()
924 * across many cpus. The actual IO submission is step two, and the ordered work in compress_file_range()
1142 struct btrfs_ordered_extent *ordered; in submit_one_async_extent()
1210 ordered = btrfs_alloc_ordered_extent(inode, start, &file_extent, in submit_one_async_extent()
1212 if (IS_ERR(ordered)) { in submit_one_async_extent()
1214 ret = PTR_ERR(ordered); in submit_one_async_extent()
1129 struct btrfs_ordered_extent *ordered; submit_one_async_extent() local
1385 struct btrfs_ordered_extent *ordered; cow_file_range() local
1970 struct btrfs_ordered_extent *ordered; nocow_one_range() local
2781 struct btrfs_ordered_extent *ordered; btrfs_writepage_fixup_worker() local
3366 btrfs_finish_ordered_io(struct btrfs_ordered_extent * ordered) btrfs_finish_ordered_io() argument
4982 struct btrfs_ordered_extent *ordered; btrfs_truncate_block() local
7619 struct btrfs_ordered_extent *ordered; btrfs_invalidate_folio() local
8029 struct btrfs_ordered_extent *ordered; btrfs_destroy_inode() local
9642 struct btrfs_ordered_extent *ordered; btrfs_encoded_read() local
9665 struct btrfs_ordered_extent *ordered; btrfs_encoded_read() local
9785 struct btrfs_ordered_extent *ordered; btrfs_do_encoded_write() local
10527 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, NULL, cb->start, cb->len, in end_compressed_writeback()
315 void btrfs_submit_compressed_write(struct btrfs_ordered_extent *ordered, in end_compressed_writeback()
318 struct btrfs_inode *inode = ordered->inode; in end_compressed_writeback()
321 ASSERT(IS_ALIGNED(ordered->file_offset, fs_info->sectorsize));
322 ASSERT(IS_ALIGNED(ordered->num_bytes, fs_info->sectorsize));
325 cb->start = ordered->file_offset;
326 cb->len = ordered->num_bytes;
327 cb->compressed_len = ordered->disk_num_bytes; in end_bbio_compressed_write()
328 cb->bbio.bio.bi_iter.bi_sector = ordered in end_bbio_compressed_write()
369 btrfs_submit_compressed_write(struct btrfs_ordered_extent * ordered,struct folio ** compressed_folios,unsigned int nr_folios,blk_opf_t write_flags,bool writeback) btrfs_submit_compressed_write() argument
[all...]
H A Dzoned.c2067 static void btrfs_rewrite_logical_zoned(struct btrfs_ordered_extent *ordered, in btrfs_check_meta_write_pointer()
2070 struct extent_map_tree *em_tree = &ordered->inode->extent_tree; in btrfs_check_meta_write_pointer()
2073 ordered->disk_bytenr = logical; in btrfs_zoned_issue_zeroout()
2076 em = btrfs_search_extent_mapping(em_tree, ordered->file_offset, in btrfs_zoned_issue_zeroout()
2077 ordered->num_bytes); in btrfs_zoned_issue_zeroout()
2085 static bool btrfs_zoned_split_ordered(struct btrfs_ordered_extent *ordered, in read_zone_info()
2090 if (!test_bit(BTRFS_ORDERED_NOCOW, &ordered->flags) && in read_zone_info()
2091 btrfs_split_extent_map(ordered->inode, ordered->file_offset, in read_zone_info()
2092 ordered in read_zone_info()
1864 btrfs_rewrite_logical_zoned(struct btrfs_ordered_extent * ordered,u64 logical) btrfs_rewrite_logical_zoned() argument
1882 btrfs_zoned_split_ordered(struct btrfs_ordered_extent * ordered,u64 logical,u64 len) btrfs_zoned_split_ordered() argument
1900 btrfs_finish_ordered_zoned(struct btrfs_ordered_extent * ordered) btrfs_finish_ordered_zoned() argument
[all...]
H A Drelocation.h32 int btrfs_reloc_clone_csums(struct btrfs_ordered_extent *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/
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/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 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 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 DR+fencembonceonces.litmus6 * This is the fully ordered (via smp_mb()) version of one of the classic
/linux/Documentation/ABI/testing/
H A Dsysfs-driver-input-cros-ec-keyb5 ordered by the physical positions of the keys, from left
/linux/tools/perf/Documentation/
H A Dperf.txt60 ordered-events - ordered events object debug messages
/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.

12345