Home
last modified time | relevance | path

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

12345678

/openbmc/linux/fs/btrfs/
H A Dordered-data.c307 static bool can_finish_ordered_extent(struct btrfs_ordered_extent *ordered, in can_finish_ordered_extent() argument
311 struct btrfs_inode *inode = BTRFS_I(ordered->inode); in can_finish_ordered_extent()
333 if (WARN_ON_ONCE(len > ordered->bytes_left)) { in can_finish_ordered_extent()
337 ordered->file_offset, ordered->num_bytes, in can_finish_ordered_extent()
338 len, ordered->bytes_left); in can_finish_ordered_extent()
339 ordered->bytes_left = 0; in can_finish_ordered_extent()
341 ordered->bytes_left -= len; in can_finish_ordered_extent()
345 set_bit(BTRFS_ORDERED_IOERR, &ordered->flags); in can_finish_ordered_extent()
347 if (ordered->bytes_left) in can_finish_ordered_extent()
354 set_bit(BTRFS_ORDERED_IO_DONE, &ordered->flags); in can_finish_ordered_extent()
[all …]
H A Dtree-log.h60 struct btrfs_ordered_extent *ordered; in btrfs_release_log_ctx_extents() local
65 list_for_each_entry_safe(ordered, tmp, &ctx->ordered_extents, log_list) { in btrfs_release_log_ctx_extents()
66 list_del_init(&ordered->log_list); in btrfs_release_log_ctx_extents()
67 btrfs_put_ordered_extent(ordered); in btrfs_release_log_ctx_extents()
H A Dinode.c83 struct btrfs_ordered_extent *ordered; member
1105 struct btrfs_ordered_extent *ordered; in submit_one_async_extent() local
1165 ordered = btrfs_alloc_ordered_extent(inode, start, /* file_offset */ in submit_one_async_extent()
1173 if (IS_ERR(ordered)) { in submit_one_async_extent()
1175 ret = PTR_ERR(ordered); in submit_one_async_extent()
1184 btrfs_submit_compressed_write(ordered, in submit_one_async_extent()
1376 struct btrfs_ordered_extent *ordered; in cow_file_range() local
1427 ordered = btrfs_alloc_ordered_extent(inode, start, ram_size, in cow_file_range()
1431 if (IS_ERR(ordered)) { in cow_file_range()
1432 ret = PTR_ERR(ordered); in cow_file_range()
[all …]
H A Dcompression.c227 btrfs_finish_ordered_extent(cb->bbio.ordered, NULL, cb->start, cb->len, in btrfs_finish_compressed_write_work()
277 void btrfs_submit_compressed_write(struct btrfs_ordered_extent *ordered, in btrfs_submit_compressed_write() argument
283 struct btrfs_inode *inode = BTRFS_I(ordered->inode); in btrfs_submit_compressed_write()
287 ASSERT(IS_ALIGNED(ordered->file_offset, fs_info->sectorsize)); in btrfs_submit_compressed_write()
288 ASSERT(IS_ALIGNED(ordered->num_bytes, fs_info->sectorsize)); in btrfs_submit_compressed_write()
290 cb = alloc_compressed_bio(inode, ordered->file_offset, in btrfs_submit_compressed_write()
293 cb->start = ordered->file_offset; in btrfs_submit_compressed_write()
294 cb->len = ordered->num_bytes; in btrfs_submit_compressed_write()
296 cb->compressed_len = ordered->disk_num_bytes; in btrfs_submit_compressed_write()
300 cb->bbio.bio.bi_iter.bi_sector = ordered->disk_bytenr >> SECTOR_SHIFT; in btrfs_submit_compressed_write()
[all …]
H A Dzoned.c1675 static void btrfs_rewrite_logical_zoned(struct btrfs_ordered_extent *ordered, in btrfs_rewrite_logical_zoned() argument
1678 struct extent_map_tree *em_tree = &BTRFS_I(ordered->inode)->extent_tree; in btrfs_rewrite_logical_zoned()
1681 ordered->disk_bytenr = logical; in btrfs_rewrite_logical_zoned()
1684 em = search_extent_mapping(em_tree, ordered->file_offset, in btrfs_rewrite_logical_zoned()
1685 ordered->num_bytes); in btrfs_rewrite_logical_zoned()
1691 static bool btrfs_zoned_split_ordered(struct btrfs_ordered_extent *ordered, in btrfs_zoned_split_ordered() argument
1696 if (!test_bit(BTRFS_ORDERED_NOCOW, &ordered->flags) && in btrfs_zoned_split_ordered()
1697 split_extent_map(BTRFS_I(ordered->inode), ordered->file_offset, in btrfs_zoned_split_ordered()
1698 ordered->num_bytes, len, logical)) in btrfs_zoned_split_ordered()
1701 new = btrfs_split_ordered_extent(ordered, len); in btrfs_zoned_split_ordered()
[all …]
H A Dbio.c97 refcount_inc(&orig_bbio->ordered->refs); in btrfs_split_bio()
98 bbio->ordered = orig_bbio->ordered; in btrfs_split_bio()
108 btrfs_put_ordered_extent(bbio->ordered); in btrfs_cleanup_bio()
115 struct btrfs_ordered_extent *ordered = bbio->ordered; in __btrfs_bio_end_io() local
118 btrfs_put_ordered_extent(ordered); in __btrfs_bio_end_io()
H A Dordered-data.h170 bool btrfs_finish_ordered_extent(struct btrfs_ordered_extent *ordered,
210 struct btrfs_ordered_extent *ordered, u64 len);
H A Dsubpage.c503 ordered, start, len); in btrfs_subpage_set_ordered()
517 ordered, start, len); in btrfs_subpage_clear_ordered()
522 if (subpage_test_bitmap_all_zero(fs_info, subpage, ordered)) in btrfs_subpage_clear_ordered()
579 IMPLEMENT_BTRFS_SUBPAGE_TEST_OP(ordered);
648 IMPLEMENT_BTRFS_PAGE_OPS(ordered, SetPageOrdered, ClearPageOrdered,
746 GET_SUBPAGE_BITMAP(subpage, subpage_info, ordered, &ordered_bitmap); in btrfs_subpage_dump_bitmap()
/openbmc/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
/openbmc/linux/Documentation/riscv/
H 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.
/openbmc/linux/include/trace/events/
H A Dbtrfs.h518 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 …]
/openbmc/linux/Documentation/devicetree/bindings/sound/
H 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.
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.
H 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.
H A Ddavinci-mcbsp.txt20 TC channel ordered triplets.
22 These strings correspond 1:1 with the ordered pairs in dmas. The dma
/openbmc/linux/tools/lib/subcmd/
H A Dparse-options.c811 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 …]
/openbmc/linux/Documentation/core-api/
H 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
/openbmc/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.
/openbmc/linux/Documentation/admin-guide/perf/
H 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.
/openbmc/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
/openbmc/linux/fs/xfs/
H 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()
/openbmc/linux/tools/perf/Documentation/
H A Dperf.txt60 ordered-events - ordered events object debug messages
/openbmc/openbmc/meta-openembedded/meta-python/recipes-devtools/python/
H A Dpython3-nocasedict_2.0.4.bb1 SUMMARY = "A case-insensitive ordered dictionary for Python"
/openbmc/linux/tools/memory-model/litmus-tests/
H A DCoWW+poonceonce.litmus7 * writes to the same variable are ordered.

12345678