| /Linux-v5.4/fs/btrfs/ |
| D | ordered-data.c | 508 struct btrfs_ordered_extent *ordered; in btrfs_run_ordered_extent_work() local
510 ordered = container_of(work, struct btrfs_ordered_extent, flush_work); in btrfs_run_ordered_extent_work()
511 btrfs_start_ordered_extent(ordered->inode, ordered, 1); in btrfs_run_ordered_extent_work()
512 complete(&ordered->completion); in btrfs_run_ordered_extent_work()
526 struct btrfs_ordered_extent *ordered, *next; in btrfs_wait_ordered_extents() local
534 ordered = list_first_entry(&splice, struct btrfs_ordered_extent, in btrfs_wait_ordered_extents()
537 if (range_end <= ordered->start || in btrfs_wait_ordered_extents()
538 ordered->start + ordered->disk_len <= range_start) { in btrfs_wait_ordered_extents()
539 list_move_tail(&ordered->root_extent_list, &skipped); in btrfs_wait_ordered_extents()
544 list_move_tail(&ordered->root_extent_list, in btrfs_wait_ordered_extents()
[all …]
|
| D | file-item.c | 438 struct btrfs_ordered_extent *ordered = NULL; in btrfs_csum_one_bio() local
476 if (!ordered) { in btrfs_csum_one_bio()
477 ordered = btrfs_lookup_ordered_extent(inode, offset); in btrfs_csum_one_bio()
478 BUG_ON(!ordered); /* Logic error */ in btrfs_csum_one_bio()
486 if (offset >= ordered->file_offset + ordered->len || in btrfs_csum_one_bio()
487 offset < ordered->file_offset) { in btrfs_csum_one_bio()
492 btrfs_add_ordered_sum(ordered, sums); in btrfs_csum_one_bio()
493 btrfs_put_ordered_extent(ordered); in btrfs_csum_one_bio()
503 ordered = btrfs_lookup_ordered_extent(inode, in btrfs_csum_one_bio()
505 ASSERT(ordered); /* Logic error */ in btrfs_csum_one_bio()
[all …]
|
| D | file.c | 1499 struct btrfs_ordered_extent *ordered; in lock_and_cleanup_extent_if_need() local
1503 ordered = btrfs_lookup_ordered_range(inode, start_pos, in lock_and_cleanup_extent_if_need()
1505 if (ordered && in lock_and_cleanup_extent_if_need()
1506 ordered->file_offset + ordered->len > start_pos && in lock_and_cleanup_extent_if_need()
1507 ordered->file_offset <= last_pos) { in lock_and_cleanup_extent_if_need()
1515 ordered, 1); in lock_and_cleanup_extent_if_need()
1516 btrfs_put_ordered_extent(ordered); in lock_and_cleanup_extent_if_need()
1519 if (ordered) in lock_and_cleanup_extent_if_need()
1520 btrfs_put_ordered_extent(ordered); in lock_and_cleanup_extent_if_need()
2416 struct btrfs_ordered_extent *ordered; in btrfs_punch_hole_lock_range() local
[all …]
|
| D | inode.c | 2162 struct btrfs_ordered_extent *ordered; in btrfs_writepage_fixup_worker() local
2191 ordered = btrfs_lookup_ordered_range(BTRFS_I(inode), page_start, in btrfs_writepage_fixup_worker()
2193 if (ordered) { in btrfs_writepage_fixup_worker()
2197 btrfs_start_ordered_extent(inode, ordered, 1); in btrfs_writepage_fixup_worker()
2198 btrfs_put_ordered_extent(ordered); in btrfs_writepage_fixup_worker()
2629 struct btrfs_ordered_extent *ordered; in relink_extent_backref() local
2692 ordered = btrfs_lookup_first_ordered_extent(inode, lock_end); in relink_extent_backref()
2693 if (ordered) { in relink_extent_backref()
2694 btrfs_put_ordered_extent(ordered); in relink_extent_backref()
2887 struct btrfs_ordered_extent *ordered) in record_old_file_extents() argument
[all …]
|
| /Linux-v5.4/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-v5.4/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
|
| /Linux-v5.4/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 | sirf-usp.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 | davinci-mcbsp.txt | 20 TC channel ordered triplets.
22 These strings correspond 1:1 with the ordered pairs in dmas. The dma
|
| /Linux-v5.4/tools/lib/subcmd/ |
| D | parse-options.c | 808 struct option *ordered; in options__order() local
814 ordered = malloc(len); in options__order()
815 if (!ordered) in options__order()
817 memcpy(ordered, opts, len); in options__order()
819 qsort(ordered, nr_opts, sizeof(*o), option__cmp); in options__order()
821 return ordered; in options__order()
859 struct option *ordered; in usage_with_options_internal() local
884 ordered = options__order(opts); in usage_with_options_internal()
885 if (ordered) in usage_with_options_internal()
886 opts = ordered; in usage_with_options_internal()
[all …]
|
| /Linux-v5.4/fs/xfs/ |
| D | xfs_log_cil.c | 136 bool ordered = false; in xlog_cil_alloc_shadow_bufs() local
151 ordered = true; in xlog_cil_alloc_shadow_bufs()
194 if (ordered) in xlog_cil_alloc_shadow_bufs()
202 if (ordered) in xlog_cil_alloc_shadow_bufs()
318 bool ordered = false; in xlog_cil_insert_format_items() local
330 ordered = true; in xlog_cil_insert_format_items()
333 if (!shadow->lv_niovecs && !ordered) in xlog_cil_insert_format_items()
343 if (ordered) in xlog_cil_insert_format_items()
365 if (ordered) { in xlog_cil_insert_format_items()
|
| /Linux-v5.4/drivers/misc/mic/scif/ |
| D | scif_dma.c | 65 bool ordered; member
704 size_t count, bool ordered) in scif_unaligned_cpy_toio() argument
706 if (ordered) in scif_unaligned_cpy_toio()
725 size_t count, bool ordered) in scif_unaligned_cpy_fromio() argument
727 if (ordered) in scif_unaligned_cpy_fromio()
905 work->ordered && in scif_rma_list_dma_copy_unaligned()
909 loop_len, work->ordered && in scif_rma_list_dma_copy_unaligned()
941 if (work->ordered && !tail_len && in scif_rma_list_dma_copy_unaligned()
1046 if (work->ordered) { in scif_rma_list_dma_copy_unaligned()
1055 tail_len, work->ordered); in scif_rma_list_dma_copy_unaligned()
[all …]
|
| /Linux-v5.4/tools/perf/Documentation/ |
| D | perf.txt | 23 ordered-events - ordered events object debug messages
|
| /Linux-v5.4/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-v5.4/include/trace/events/ |
| D | btrfs.h | 478 const struct btrfs_ordered_extent *ordered),
480 TP_ARGS(inode, ordered),
498 __entry->file_offset = ordered->file_offset;
499 __entry->start = ordered->start;
500 __entry->len = ordered->len;
501 __entry->disk_len = ordered->disk_len;
502 __entry->bytes_left = ordered->bytes_left;
503 __entry->flags = ordered->flags;
504 __entry->compress_type = ordered->compress_type;
505 __entry->refs = refcount_read(&ordered->refs);
[all …]
|
| /Linux-v5.4/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.
101 This is the fully ordered (via smp_mb()) version of one of
109 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
|
| D | MP+polockonce+poacquiresilsil.litmus | 7 * to sense the lock-held state, ordered by acquire? Note that when the
|
| D | Z6.0+pooncelock+pooncelock+pombonce.litmus | 8 * seen as ordered by a third process not holding that lock.
|
