| /linux/fs/btrfs/ |
| H A D | direct-io.c | 19 struct btrfs_ordered_extent *ordered; member 43 struct btrfs_ordered_extent *ordered; in lock_extent_direct() local 69 ordered = btrfs_lookup_ordered_range(BTRFS_I(inode), lockstart, in lock_extent_direct() 79 if (!ordered && in lock_extent_direct() 86 if (ordered) { in lock_extent_direct() 88 btrfs_put_ordered_extent(ordered); in lock_extent_direct() 108 test_bit(BTRFS_ORDERED_DIRECT, &ordered->flags)) in lock_extent_direct() 109 btrfs_start_ordered_extent(ordered); in lock_extent_direct() 112 btrfs_put_ordered_extent(ordered); in lock_extent_direct() 148 struct btrfs_ordered_extent *ordered; in btrfs_create_dio_extent() local [all …]
|
| H A D | extent_io.c | 560 btrfs_finish_ordered_extent(bbio->ordered, bbio->file_offset, bio_size, !error); in end_bbio_data_write() 765 struct btrfs_ordered_extent *ordered; in alloc_new_bio() local 771 ordered = btrfs_lookup_ordered_extent(inode, file_offset); in alloc_new_bio() 772 if (unlikely(!ordered)) { in alloc_new_bio() 783 ordered->file_offset + in alloc_new_bio() 784 ordered->disk_num_bytes - file_offset); in alloc_new_bio() 785 bbio->ordered = ordered; in alloc_new_bio() 1232 struct btrfs_ordered_extent *ordered, in can_skip_one_ordered_range() argument 1279 ordered->file_offset + ordered->num_bytes) - cur; in can_skip_one_ordered_range() 1287 *fileoff = ordered->file_offset + ordered->num_bytes; in can_skip_one_ordered_range() [all …]
|
| H A D | zoned.c | 2091 static void btrfs_rewrite_logical_zoned(struct btrfs_ordered_extent *ordered, in btrfs_rewrite_logical_zoned() argument 2094 struct extent_map_tree *em_tree = &ordered->inode->extent_tree; in btrfs_rewrite_logical_zoned() 2097 ordered->disk_bytenr = logical; in btrfs_rewrite_logical_zoned() 2100 em = btrfs_search_extent_mapping(em_tree, ordered->file_offset, in btrfs_rewrite_logical_zoned() 2101 ordered->num_bytes); in btrfs_rewrite_logical_zoned() 2109 static bool btrfs_zoned_split_ordered(struct btrfs_ordered_extent *ordered, in btrfs_zoned_split_ordered() argument 2114 if (!test_bit(BTRFS_ORDERED_NOCOW, &ordered->flags) && in btrfs_zoned_split_ordered() 2115 btrfs_split_extent_map(ordered->inode, ordered->file_offset, in btrfs_zoned_split_ordered() 2116 ordered->num_bytes, len, logical)) in btrfs_zoned_split_ordered() 2119 new = btrfs_split_ordered_extent(ordered, len); in btrfs_zoned_split_ordered() [all …]
|
| H A D | inode.c | 1037 struct btrfs_ordered_extent *ordered; in submit_one_async_extent() local 1105 ordered = btrfs_alloc_ordered_extent(inode, start, &file_extent, in submit_one_async_extent() 1107 if (IS_ERR(ordered)) { in submit_one_async_extent() 1109 ret = PTR_ERR(ordered); in submit_one_async_extent() 1112 async_extent->cb->bbio.ordered = ordered; in submit_one_async_extent() 1209 struct btrfs_ordered_extent *ordered; in cow_one_range() local 1246 ordered = btrfs_alloc_ordered_extent(inode, file_offset, &file_extent, in cow_one_range() 1248 if (IS_ERR(ordered)) { in cow_one_range() 1250 ret = PTR_ERR(ordered); in cow_one_range() 1255 ret = btrfs_reloc_clone_csums(ordered); in cow_one_range() [all …]
|
| H A D | compression.c | 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->disk_bytenr >> SECTOR_SHIFT; in btrfs_submit_compressed_write() 334 cb->bbio.ordered = ordered; in btrfs_submit_compressed_write()
|
| /linux/Documentation/devicetree/bindings/scsi/ |
| H A D | hisilicon-sas.txt | 22 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 D | parse-options.c | 849 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/Documentation/devicetree/bindings/sound/ |
| H A D | sirf-audio-port.txt | 6 - 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/include/trace/events/ |
| H A D | btrfs.h | 571 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->refs); [all …]
|
| /linux/Documentation/arch/riscv/ |
| H A D | uabi.rst | 28 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 D | atomic_t.txt | 156 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 D | atomic_bitops.txt | 59 - 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 D | README | 18 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 D | Kconfig | 23 # 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 D | CoWW+poonceonce.litmus | 7 * writes to the same variable are ordered.
|
| H A D | CoRR+poonceonce+Once.litmus | 7 * reads from the same variable are ordered.
|
| H A D | CoRW+poonceonce+Once.litmus | 7 * a given variable and a later write to that same variable are ordered.
|
| H A D | CoWR+poonceonce+Once.litmus | 7 * given variable and a later read from that same variable are ordered.
|
| H A D | README | 7 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 D | R+fencembonceonces.litmus | 6 * This is the fully ordered (via smp_mb()) version of one of the classic
|
| /linux/Documentation/ABI/testing/ |
| H A D | sysfs-driver-input-cros-ec-keyb | 5 ordered by the physical positions of the keys, from left
|
| /linux/tools/perf/Documentation/ |
| H A D | perf.txt | 60 ordered-events - ordered events object debug messages
|
| /linux/Documentation/litmus-tests/atomic/ |
| H A D | cmpxchg-fail-ordered-2.litmus | 1 C cmpxchg-fail-ordered-2
|
| H A D | Atomic-RMW+mb__after_atomic-is-stronger-than-acquire.litmus | 8 * the RMW are ordered before the subsequential memory accesses.
|
| H A D | cmpxchg-fail-ordered-1.litmus | 1 C cmpxchg-fail-ordered-1
|