/linux-6.1.9/fs/btrfs/ |
D | ordered-data.c | 613 struct btrfs_ordered_extent *ordered; in btrfs_run_ordered_extent_work() local 615 ordered = container_of(work, struct btrfs_ordered_extent, flush_work); in btrfs_run_ordered_extent_work() 616 btrfs_start_ordered_extent(ordered, 1); in btrfs_run_ordered_extent_work() 617 complete(&ordered->completion); in btrfs_run_ordered_extent_work() 631 struct btrfs_ordered_extent *ordered, *next; in btrfs_wait_ordered_extents() local 639 ordered = list_first_entry(&splice, struct btrfs_ordered_extent, in btrfs_wait_ordered_extents() 642 if (range_end <= ordered->disk_bytenr || in btrfs_wait_ordered_extents() 643 ordered->disk_bytenr + ordered->disk_num_bytes <= range_start) { in btrfs_wait_ordered_extents() 644 list_move_tail(&ordered->root_extent_list, &skipped); in btrfs_wait_ordered_extents() 649 list_move_tail(&ordered->root_extent_list, in btrfs_wait_ordered_extents() [all …]
|
D | tree-log.h | 56 struct btrfs_ordered_extent *ordered; in btrfs_release_log_ctx_extents() local 61 list_for_each_entry_safe(ordered, tmp, &ctx->ordered_extents, log_list) { in btrfs_release_log_ctx_extents() 62 list_del_init(&ordered->log_list); in btrfs_release_log_ctx_extents() 63 btrfs_put_ordered_extent(ordered); in btrfs_release_log_ctx_extents()
|
D | file-item.c | 650 struct btrfs_ordered_extent *ordered = NULL; in btrfs_csum_one_bio() local 682 if (!ordered) { in btrfs_csum_one_bio() 683 ordered = btrfs_lookup_ordered_extent(inode, offset); in btrfs_csum_one_bio() 688 if (unlikely(!ordered)) { in btrfs_csum_one_bio() 704 !in_range(offset, ordered->file_offset, in btrfs_csum_one_bio() 705 ordered->num_bytes)) { in btrfs_csum_one_bio() 710 btrfs_add_ordered_sum(ordered, sums); in btrfs_csum_one_bio() 711 btrfs_put_ordered_extent(ordered); in btrfs_csum_one_bio() 721 ordered = btrfs_lookup_ordered_extent(inode, in btrfs_csum_one_bio() 723 ASSERT(ordered); /* Logic error */ in btrfs_csum_one_bio() [all …]
|
D | inode.c | 2640 struct btrfs_ordered_extent *ordered; in extract_ordered_extent() local 2649 ordered = btrfs_lookup_ordered_extent(inode, file_offset); in extract_ordered_extent() 2650 if (WARN_ON_ONCE(!ordered)) in extract_ordered_extent() 2654 if (ordered->disk_num_bytes == len) in extract_ordered_extent() 2658 if (WARN_ON_ONCE(ordered->bytes_left != ordered->disk_num_bytes)) { in extract_ordered_extent() 2664 if (WARN_ON_ONCE(ordered->disk_num_bytes != ordered->num_bytes)) { in extract_ordered_extent() 2669 ordered_end = ordered->disk_bytenr + ordered->disk_num_bytes; in extract_ordered_extent() 2671 if (WARN_ON_ONCE(start < ordered->disk_bytenr || end > ordered_end)) { in extract_ordered_extent() 2677 if (WARN_ON_ONCE(!list_empty(&ordered->list))) { in extract_ordered_extent() 2682 file_len = ordered->num_bytes; in extract_ordered_extent() [all …]
|
D | zoned.c | 1662 struct btrfs_ordered_extent *ordered; in btrfs_record_physical_zoned() local 1668 ordered = btrfs_lookup_ordered_extent(BTRFS_I(inode), file_offset); in btrfs_record_physical_zoned() 1669 if (WARN_ON(!ordered)) in btrfs_record_physical_zoned() 1672 ordered->physical = physical; in btrfs_record_physical_zoned() 1673 ordered->bdev = bio->bi_bdev; in btrfs_record_physical_zoned() 1675 btrfs_put_ordered_extent(ordered); in btrfs_record_physical_zoned() 1678 void btrfs_rewrite_logical_zoned(struct btrfs_ordered_extent *ordered) in btrfs_rewrite_logical_zoned() argument 1680 struct btrfs_inode *inode = BTRFS_I(ordered->inode); in btrfs_rewrite_logical_zoned() 1685 u64 orig_logical = ordered->disk_bytenr; in btrfs_rewrite_logical_zoned() 1690 ASSERT(!bdev_is_partition(ordered->bdev)); in btrfs_rewrite_logical_zoned() [all …]
|
/linux-6.1.9/Documentation/devicetree/bindings/scsi/ |
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-6.1.9/include/trace/events/ |
D | btrfs.h | 518 const struct btrfs_ordered_extent *ordered), 520 TP_ARGS(inode, ordered), 538 __entry->file_offset = ordered->file_offset; 539 __entry->start = ordered->disk_bytenr; 540 __entry->len = ordered->num_bytes; 541 __entry->disk_len = ordered->disk_num_bytes; 542 __entry->bytes_left = ordered->bytes_left; 543 __entry->flags = ordered->flags; 544 __entry->compress_type = ordered->compress_type; 545 __entry->refs = refcount_read(&ordered->refs); [all …]
|
/linux-6.1.9/Documentation/devicetree/bindings/sound/ |
D | sprd-pcm.txt | 5 - dmas: Specify the list of DMA controller phandle and DMA request line ordered pairs. 7 These strings correspond 1:1 with the ordered pairs in dmas.
|
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.
|
D | brcm,bcm2835-i2s.txt | 7 - dmas: List of DMA controller phandle and DMA request line ordered pairs. 9 These strings correspond 1:1 with the ordered pairs in dmas.
|
D | davinci-mcbsp.txt | 20 TC channel ordered triplets. 22 These strings correspond 1:1 with the ordered pairs in dmas. The dma
|
/linux-6.1.9/tools/lib/subcmd/ |
D | parse-options.c | 811 struct option *opt, *ordered, *group; in options__order() local 817 ordered = malloc(len); in options__order() 818 if (!ordered) in options__order() 820 memcpy(ordered, opts, len); in options__order() 823 for (opt = group = ordered; opt->type != OPTION_END; opt++) { in options__order() 835 return ordered; in options__order() 873 struct option *ordered; in usage_with_options_internal() local 898 ordered = options__order(opts); in usage_with_options_internal() 899 if (ordered) in usage_with_options_internal() 900 opts = ordered; in usage_with_options_internal() [all …]
|
/linux-6.1.9/Documentation/core-api/ |
D | refcount-vs-atomic.rst | 67 then further stores are ordered against this operation. 123 * fully ordered --> control dependency on success for stores 139 * fully ordered --> RELEASE ordering + ACQUIRE ordering on success 152 * fully ordered --> RELEASE ordering + control dependency 167 * fully ordered --> RELEASE ordering + control dependency + hold
|
/linux-6.1.9/virt/kvm/ |
D | Kconfig | 22 # Only strongly ordered architectures can select this, as it doesn't 30 # Weakly ordered architectures can only select this, advertising
|
/linux-6.1.9/Documentation/ |
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
|
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-6.1.9/tools/perf/Documentation/ |
D | perf.txt | 60 ordered-events - ordered events object debug messages
|
/linux-6.1.9/fs/xfs/ |
D | xfs_log_cil.c | 280 bool ordered = false; in xlog_cil_alloc_shadow_bufs() local 295 ordered = true; in xlog_cil_alloc_shadow_bufs() 345 if (ordered) in xlog_cil_alloc_shadow_bufs() 353 if (ordered) in xlog_cil_alloc_shadow_bufs() 461 bool ordered = false; in xlog_cil_insert_format_items() local 473 ordered = true; in xlog_cil_insert_format_items() 476 if (!shadow->lv_niovecs && !ordered) in xlog_cil_insert_format_items() 485 if (ordered) in xlog_cil_insert_format_items() 506 if (ordered) { in xlog_cil_insert_format_items()
|
/linux-6.1.9/tools/memory-model/litmus-tests/ |
D | CoWW+poonceonce.litmus | 7 * writes to the same variable are ordered.
|
D | CoRR+poonceonce+Once.litmus | 7 * reads from the same variable are ordered.
|
D | CoRW+poonceonce+Once.litmus | 7 * a given variable and a later write to that same variable are ordered.
|
D | CoWR+poonceonce+Once.litmus | 7 * given variable and a later read from that same variable are ordered.
|
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
|
D | R+fencembonceonces.litmus | 6 * This is the fully ordered (via smp_mb()) version of one of the classic
|
/linux-6.1.9/Documentation/ABI/testing/ |
D | sysfs-driver-input-cros-ec-keyb | 5 ordered by the physical positions of the keys, from left
|