Home
last modified time | relevance | path

Searched refs:ordered (Results 1 – 25 of 175) sorted by relevance

1234567

/linux/fs/btrfs/
A Dordered-data.c364 ordered->file_offset, ordered->num_bytes, in can_finish_ordered_extent()
366 ordered->bytes_left = 0; in can_finish_ordered_extent()
374 if (ordered->bytes_left) in can_finish_ordered_extent()
769 ordered->disk_bytenr + ordered->disk_num_bytes <= range_start) { in btrfs_wait_ordered_extents()
914 if (!ordered) in btrfs_wait_ordered_range()
920 if (ordered->file_offset + ordered->num_bytes <= start) { in btrfs_wait_ordered_range()
1166 if (!ordered) { in btrfs_lock_and_flush_ordered_range()
1198 if (!ordered) in btrfs_try_lock_ordered_range()
1233 if (ordered->bytes_left) { in btrfs_split_ordered_extent()
1235 if (WARN_ON_ONCE(ordered->bytes_left != ordered->disk_num_bytes)) in btrfs_split_ordered_extent()
[all …]
A Ddirect-io.c17 struct btrfs_ordered_extent *ordered; member
76 if (!ordered && in lock_extent_direct()
83 if (ordered) { in lock_extent_direct()
156 if (IS_ERR(ordered)) { in btrfs_create_dio_extent()
162 em = ERR_CAST(ordered); in btrfs_create_dio_extent()
164 ASSERT(!dio_data->ordered); in btrfs_create_dio_extent()
165 dio_data->ordered = ordered; in btrfs_create_dio_extent()
636 dio_data->ordered = NULL; in btrfs_dio_iomap_end()
685 refcount_inc(&ordered->refs); in btrfs_extract_ordered_extent()
686 bbio->ordered = ordered; in btrfs_extract_ordered_extent()
[all …]
A Dordered-data.h165 void btrfs_finish_ordered_extent(struct btrfs_ordered_extent *ordered,
216 struct btrfs_ordered_extent *ordered, u64 len);
217 void btrfs_mark_ordered_extent_error(struct btrfs_ordered_extent *ordered);
A Dzoned.c1780 ordered->disk_bytenr = logical; in btrfs_rewrite_logical_zoned()
1784 ordered->num_bytes); in btrfs_rewrite_logical_zoned()
1798 split_extent_map(ordered->inode, ordered->file_offset, in btrfs_zoned_split_ordered()
1799 ordered->num_bytes, len, logical)) in btrfs_zoned_split_ordered()
1802 new = btrfs_split_ordered_extent(ordered, len); in btrfs_zoned_split_ordered()
1812 struct btrfs_inode *inode = ordered->inode; in btrfs_finish_ordered_zoned()
1824 ASSERT(!list_empty(&ordered->list)); in btrfs_finish_ordered_zoned()
1830 while (len < ordered->disk_num_bytes) { in btrfs_finish_ordered_zoned()
1837 set_bit(BTRFS_ORDERED_IOERR, &ordered->flags); in btrfs_finish_ordered_zoned()
1845 if (ordered->disk_bytenr != logical) in btrfs_finish_ordered_zoned()
[all …]
A Dcompression.c319 btrfs_finish_ordered_extent(cb->bbio.ordered, NULL, cb->start, cb->len, in btrfs_finish_compressed_write_work()
371 void btrfs_submit_compressed_write(struct btrfs_ordered_extent *ordered, in btrfs_submit_compressed_write() argument
377 struct btrfs_inode *inode = ordered->inode; in btrfs_submit_compressed_write()
381 ASSERT(IS_ALIGNED(ordered->file_offset, fs_info->sectorsize)); in btrfs_submit_compressed_write()
382 ASSERT(IS_ALIGNED(ordered->num_bytes, fs_info->sectorsize)); in btrfs_submit_compressed_write()
384 cb = alloc_compressed_bio(inode, ordered->file_offset, in btrfs_submit_compressed_write()
387 cb->start = ordered->file_offset; in btrfs_submit_compressed_write()
388 cb->len = ordered->num_bytes; in btrfs_submit_compressed_write()
390 cb->compressed_len = ordered->disk_num_bytes; in btrfs_submit_compressed_write()
394 cb->bbio.bio.bi_iter.bi_sector = ordered->disk_bytenr >> SECTOR_SHIFT; in btrfs_submit_compressed_write()
[all …]
A Dinode.c2792 if (ordered) { in btrfs_writepage_fixup_worker()
4806 if (ordered) { in btrfs_truncate_block()
7336 if (!ordered) { in btrfs_invalidate_folio()
7388 ordered->truncated_len = min(ordered->truncated_len, in btrfs_invalidate_folio()
7408 if (ordered) in btrfs_invalidate_folio()
7776 if (!ordered) in btrfs_destroy_inode()
7781 ordered->file_offset, ordered->num_bytes); in btrfs_destroy_inode()
9284 if (!ordered) in btrfs_encoded_read()
9534 if (ordered) in btrfs_do_encoded_write()
10082 if (ordered) { in btrfs_assert_inode_range_clean()
[all …]
A Dbio.c90 refcount_inc(&orig_bbio->ordered->refs); in btrfs_split_bio()
91 bbio->ordered = orig_bbio->ordered; in btrfs_split_bio()
101 btrfs_put_ordered_extent(bbio->ordered); in btrfs_cleanup_bio()
108 struct btrfs_ordered_extent *ordered = bbio->ordered; in __btrfs_bio_end_io() local
111 btrfs_put_ordered_extent(ordered); in __btrfs_bio_end_io()
719 list_add_tail(&bioc->rst_ordered_entry, &bbio->ordered->bioc_list); in btrfs_submit_chunk()
/linux/Documentation/devicetree/bindings/scsi/
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/
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()
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()
912 opts = ordered; in usage_with_options_internal()
[all …]
/linux/Documentation/devicetree/bindings/sound/
A Dsprd-pcm.txt5 - 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.
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.
A Dbrcm,bcm2835-i2s.txt7 - dmas: List of DMA controller phandle and DMA request line ordered pairs.
9 These strings correspond 1:1 with the ordered pairs in dmas.
/linux/include/trace/events/
A Dbtrfs.h503 TP_ARGS(inode, ordered),
555 TP_ARGS(inode, ordered)
563 TP_ARGS(inode, ordered)
571 TP_ARGS(inode, ordered)
579 TP_ARGS(inode, ordered)
587 TP_ARGS(inode, ordered)
595 TP_ARGS(inode, ordered)
603 TP_ARGS(inode, ordered)
611 TP_ARGS(inode, ordered)
619 TP_ARGS(inode, ordered)
[all …]
/linux/Documentation/arch/riscv/
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/core-api/
A Drefcount-vs-atomic.rst67 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/Documentation/devicetree/bindings/
A Ddts-coding-style.rst51 ordered by unit address in ascending order.
56 2. Nodes without unit addresses shall be ordered alpha-numerically by the node
57 name. For a few node types, they can be ordered by the main property, e.g.
58 pin configuration states ordered by value of "pins" property.
61 ordered either alpha-numerically or by keeping the order from DTSI, where
/linux/Documentation/
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
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/admin-guide/perf/
A Dnvidia-pmu.rst32 strongly-ordered (SO) PCIE write traffic to local/remote memory. Please see
62 In this config, the PMU captures read and relaxed ordered (RO) writes from
123 to local memory. For PCIE traffic, this PMU captures read and relaxed ordered
247 PCIE1 traffic represents strongly ordered (SO) writes.
248 PCIE2 traffic represents reads and relaxed ordered (RO) writes.
298 PCIE1 traffic represents strongly ordered (SO) writes.
299 PCIE2 traffic represents reads and relaxed ordered (RO) writes.
/linux/Documentation/litmus-tests/
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/
A DKconfig22 # Only strongly ordered architectures can select this, as it doesn't
30 # Weakly ordered architectures can only select this, advertising
/linux/fs/xfs/
A Dxfs_log_cil.c282 bool ordered = false; in xlog_cil_alloc_shadow_bufs() local
297 ordered = true; in xlog_cil_alloc_shadow_bufs()
347 if (ordered) in xlog_cil_alloc_shadow_bufs()
355 if (ordered) in xlog_cil_alloc_shadow_bufs()
463 bool ordered = false; in xlog_cil_insert_format_items() local
475 ordered = true; in xlog_cil_insert_format_items()
478 if (!shadow->lv_niovecs && !ordered) in xlog_cil_insert_format_items()
487 if (ordered) in xlog_cil_insert_format_items()
508 if (ordered) { in xlog_cil_insert_format_items()
/linux/tools/memory-model/litmus-tests/
A DCoWW+poonceonce.litmus7 * writes to the same variable are ordered.
/linux/Documentation/ABI/testing/
A Dsysfs-driver-input-cros-ec-keyb5 ordered by the physical positions of the keys, from left
/linux/tools/perf/Documentation/
A Dperf.txt60 ordered-events - ordered events object debug messages

Completed in 45 milliseconds

1234567