Searched refs:stripe (Results 1 - 25 of 41) sorted by last modified time

12

/linux-master/fs/btrfs/
H A Dvolumes.c36 #include "raid-stripe-tree.h"
3816 struct btrfs_stripe *stripe; local
3821 stripe = btrfs_stripe_nr(chunk, i);
3822 if (btrfs_stripe_devid(leaf, stripe) == bargs->devid)
3843 struct btrfs_stripe *stripe; local
3858 stripe = btrfs_stripe_nr(chunk, i);
3859 if (btrfs_stripe_devid(leaf, stripe) != bargs->devid)
3862 stripe_offset = btrfs_stripe_offset(leaf, stripe);
5429 * The DUP profile stores more than one stripe per device, the
5535 struct btrfs_io_stripe *stripe local
5547 struct btrfs_io_stripe *stripe = &map->stripes[i]; local
5773 struct btrfs_stripe *stripe; local
[all...]
H A Dscrub.c26 #include "raid-stripe-tree.h"
96 * Set for data stripes if it's triggered from P/Q stripe.
125 * How many data/meta extents are in this stripe. Only for scrub status
136 * Indicate the states of the stripe. Bits are defined in
145 * The errors hit during the initial read of the stripe.
177 * Checksum for the whole stripe if this stripe is inside a data block
231 static void release_scrub_stripe(struct scrub_stripe *stripe) argument
233 if (!stripe)
237 if (stripe
249 init_scrub_stripe(struct btrfs_fs_info *fs_info, struct scrub_stripe *stripe) argument
284 wait_scrub_stripe_io(struct scrub_stripe *stripe) argument
582 scrub_stripe_get_page(struct scrub_stripe *stripe, int sector_nr) argument
590 scrub_stripe_get_page_offset(struct scrub_stripe *stripe, int sector_nr) argument
598 scrub_verify_one_metadata(struct scrub_stripe *stripe, int sector_nr) argument
689 scrub_verify_one_sector(struct scrub_stripe *stripe, int sector_nr) argument
751 scrub_verify_one_stripe(struct scrub_stripe *stripe, unsigned long bitmap) argument
764 calc_sector_number(struct scrub_stripe *stripe, struct bio_vec *first_bvec) argument
785 struct scrub_stripe *stripe = bbio->private; local
817 scrub_stripe_submit_repair_read(struct scrub_stripe *stripe, int mirror, int blocksize, bool wait) argument
866 scrub_stripe_report_errors(struct scrub_ctx *sctx, struct scrub_stripe *stripe) argument
1010 struct scrub_stripe *stripe = container_of(work, struct scrub_stripe, work); local
1100 struct scrub_stripe *stripe = bbio->private; local
1128 struct scrub_stripe *stripe = bbio->private; local
1152 scrub_submit_write_bio(struct scrub_ctx *sctx, struct scrub_stripe *stripe, struct btrfs_bio *bbio, bool dev_replace) argument
1194 scrub_write_sectors(struct scrub_ctx *sctx, struct scrub_stripe *stripe, unsigned long write_bitmap, bool dev_replace) argument
1482 fill_one_extent_info(struct btrfs_fs_info *fs_info, struct scrub_stripe *stripe, u64 extent_start, u64 extent_len, u64 extent_flags, u64 extent_gen) argument
1504 scrub_stripe_reset_bitmaps(struct scrub_stripe *stripe) argument
1524 scrub_find_fill_first_stripe(struct btrfs_block_group *bg, struct btrfs_path *extent_path, struct btrfs_path *csum_path, struct btrfs_device *dev, u64 physical, int mirror_num, u64 logical_start, u32 logical_len, struct scrub_stripe *stripe) argument
1636 scrub_reset_stripe(struct scrub_stripe *stripe) argument
1651 scrub_submit_extent_sector_read(struct scrub_ctx *sctx, struct scrub_stripe *stripe) argument
1723 scrub_submit_initial_read(struct scrub_ctx *sctx, struct scrub_stripe *stripe) argument
1774 stripe_has_metadata_error(struct scrub_stripe *stripe) argument
1805 struct scrub_stripe *stripe = &sctx->stripes[first_slot + i]; local
1817 struct scrub_stripe *stripe; local
1887 struct scrub_stripe *stripe; local
1936 struct scrub_stripe *stripe; local
[all...]
H A Dextent-tree.c42 #include "raid-stripe-tree.h"
1328 static int do_discard_extent(struct btrfs_discard_stripe *stripe, u64 *bytes) argument
1330 struct btrfs_device *dev = stripe->dev;
1333 u64 phys = stripe->physical;
1334 u64 len = stripe->length;
1356 } else if (bdev_max_discard_sectors(stripe->dev->bdev)) {
1396 struct btrfs_discard_stripe *stripe = stripes + i; local
1399 if (!stripe->dev->bdev) {
1405 &stripe->dev->dev_state))
1408 ret = do_discard_extent(stripe,
[all...]
H A Draid56.c115 * the stripe hash table is used for locking, and to collect
116 * bios in hopes of making a full stripe
160 * use the page uptodate bit in the stripe cache array
200 * we hash on the first logical address of the stripe
289 * Stealing an rbio means taking all the uptodate pages from the stripe array
314 * all data stripe pages present and uptodate.
454 * insert an rbio into the stripe cache. It
524 * Returns true if the bio list inside this rbio covers an entire stripe (no
544 * the same stripe and if they are both going in the same
576 * We've need read the full stripe fro
1053 struct btrfs_io_stripe *stripe; local
1217 int stripe; local
1260 int stripe; local
1970 int stripe = total_sector_nr / rbio->stripe_nsectors; local
2180 int stripe = total_sector_nr / rbio->stripe_nsectors; local
2434 int stripe; local
2580 is_data_stripe(struct btrfs_raid_bio *rbio, int stripe) argument
2681 int stripe = total_sector_nr / rbio->stripe_nsectors; local
[all...]
H A Draid-stripe-tree.c12 #include "raid-stripe-tree.h"
57 /* That stripe ends before we start, we're done. */
152 u32 stripe_index, struct btrfs_io_stripe *stripe)
178 if (stripe->is_scrub) {
230 "on-disk stripe encoding %d doesn't match RAID index %d",
241 if (devid != stripe->dev->devid)
247 stripe->physical = physical + offset;
250 stripe->physical, devid);
256 /* If we're here, we haven't found the requested devid in the stripe. */
261 if (ret && ret != -EIO && !stripe
150 btrfs_get_raid_extent_offset(struct btrfs_fs_info *fs_info, u64 logical, u64 *length, u64 map_type, u32 stripe_index, struct btrfs_io_stripe *stripe) argument
[all...]
H A Draid-stripe-tree.h27 u32 stripe_index, struct btrfs_io_stripe *stripe);
H A Dbio.c16 #include "raid-stripe-tree.h"
404 struct btrfs_io_stripe *stripe = bio->bi_private; local
405 struct btrfs_io_context *bioc = stripe->bioc;
412 btrfs_log_dev_io_error(bio, stripe->dev);
425 stripe->physical = bio->bi_iter.bi_sector << SECTOR_SHIFT;
433 struct btrfs_io_stripe *stripe = bio->bi_private; local
436 atomic_inc(&stripe->bioc->error);
437 btrfs_log_dev_io_error(bio, stripe->dev);
439 stripe->physical = bio->bi_iter.bi_sector << SECTOR_SHIFT;
443 bio_endio(stripe
[all...]
H A Daccessors.h217 offset += offsetof(struct btrfs_chunk, stripe);
/linux-master/fs/bcachefs/
H A Dbuckets.c339 .stripe = b.stripe,
893 BTREE_ITER_WITH_UPDATES, stripe);
897 "pointer to nonexistent stripe %llu",
904 "stripe pointer doesn't match stripe %llu",
941 bch_err_ratelimited(c, "pointer to nonexistent stripe %llu\n while marking %s",
H A Djournal_io.c1470 bch2_dev_stripe_increment(ca, &j->wp.stripe);
1518 devs_sorted = bch2_dev_alloc_list(c, &j->wp.stripe, &devs);
H A Dbtree_gc.c697 "pointer to nonexistent stripe %llu\n"
706 "pointer does not match stripe %llu\n"
779 bch_err(c, "aieee, found stripe ptr with no data ptr");
1359 l.stripe != r.stripe;
1395 b->stripe,
1441 stripe);
1526 g->stripe = a->stripe;
1687 prt_printf(&buf, "stripe bloc
[all...]
H A Dbcachefs_format.h400 x(stripe, 14) \
693 x(stripe, 7) \
H A Dec.c119 "stripe at bad pos");
193 if (bch2_trans_inconsistent_on(a->v.stripe ||
199 a->v.stripe, s.k->p.offset)) {
205 "bucket %llu:%llu gen %u data type %s dirty_sectors %u: data already in stripe bucket %llu",
214 a->v.stripe = s.k->p.offset;
218 if (bch2_trans_inconsistent_on(a->v.stripe != s.k->p.offset ||
220 "bucket %llu:%llu gen %u: not marked as stripe when deleting stripe %llu (got %u)",
222 s.k->p.offset, a->v.stripe)) {
227 a->v.stripe
764 get_stripe_key_trans(struct btree_trans *trans, u64 idx, struct ec_stripe_buf *stripe) argument
[all...]
H A Dec.h137 /* might not be buffering the entire stripe: */
218 void bch2_stripes_heap_update(struct bch_fs *, struct stripe *, size_t);
219 void bch2_stripes_heap_del(struct bch_fs *, struct stripe *, size_t);
220 void bch2_stripes_heap_insert(struct bch_fs *, struct stripe *, size_t);
H A Dbcachefs.h1026 GENRADIX(struct stripe) stripes;
H A Dalloc_types.h20 x(stripe) \
56 * the block in the stripe this open_bucket corresponds to:
106 struct dev_stripe_state stripe; member in struct:write_point::__anon168
H A Dalloc_background.c266 bkey_fsck_err_on(bch2_bucket_sectors(*a.v) || a.v->stripe,
283 a.v->stripe,
310 a->stripe = swab32(a->stripe);
343 prt_printf(out, "stripe %u", a->stripe);
386 .stripe = u.stripe,
903 g->stripe = new_a->stripe;
[all...]
H A Dalloc_foreground.c619 static int __dev_stripe_cmp(struct dev_stripe_state *stripe, argument
622 return ((stripe->next_alloc[l] > stripe->next_alloc[r]) -
623 (stripe->next_alloc[l] < stripe->next_alloc[r]));
626 #define dev_stripe_cmp(l, r) __dev_stripe_cmp(stripe, l, r)
629 struct dev_stripe_state *stripe,
643 struct dev_stripe_state *stripe,
646 u64 *v = stripe->next_alloc + ca->dev_idx;
658 for (v = stripe
628 bch2_dev_alloc_list(struct bch_fs *c, struct dev_stripe_state *stripe, struct bch_devs_mask *devs) argument
642 bch2_dev_stripe_increment_inlined(struct bch_dev *ca, struct dev_stripe_state *stripe, struct bch_dev_usage *usage) argument
663 bch2_dev_stripe_increment(struct bch_dev *ca, struct dev_stripe_state *stripe) argument
699 bch2_bucket_alloc_set_trans(struct btree_trans *trans, struct open_buckets *ptrs, struct dev_stripe_state *stripe, struct bch_devs_mask *devs_may_alloc, unsigned nr_replicas, unsigned *nr_effective, bool *have_cache, unsigned flags, enum bch_data_type data_type, enum bch_watermark watermark, struct closure *cl) argument
[all...]
H A Dalloc_background.h45 u32 stripe,
49 if (stripe)
66 a.stripe, a, data_type);
43 __alloc_data_type(u32 dirty_sectors, u32 cached_sectors, u32 stripe, struct bch_alloc_v4 a, enum bch_data_type data_type) argument
/linux-master/fs/ext4/
H A Dmballoc.c128 * stripe=<value> option the group prealloc request is normalized to the
129 * smallest multiple of the stripe value (sbi->s_stripe) which is
196 * stripe size (sbi->s_stripe), we try to search for contiguous block in
197 * stripe size. This should result in better allocation on RAID setups. If
1017 * We are assuming that stripe size is always a multiple of
1044 * stripe size (in cluster units) multiple for
2520 * we try to find stripe-aligned chunks for stripe-size-multiple requests
2532 ext4_grpblk_t i, stripe; local
2537 /* find first stripe
[all...]
/linux-master/sound/hda/
H A Dhdac_stream.c51 * snd_hdac_get_stream_stripe_ctl - get stripe control value
79 /* stripe value: 0 for 1SDO, 1 for 2SDO, 2 for 4SDO lines */
143 /* set stripe control */
144 if (azx_dev->stripe) {
172 if (azx_dev->stripe)
/linux-master/drivers/md/
H A DMakefile6 dm-mod-y += dm.o dm-table.o dm-target.o dm-linear.o dm-stripe.o \
H A Draid5.c25 * When we discover that we will need to write to any block in a stripe
29 * we plug the array and queue the stripe for later.
120 /* Find first data disk in a raid6 stripe */
237 * In the following cases, the stripe cannot be released to cached
238 * lists. Therefore, we make the stripe write out and set
241 * 2. when resync is requested fot the stripe.
289 /* full stripe */
427 pr_debug("remove_hash(), stripe %llu\n",
437 pr_debug("insert_hash(), stripe %llu\n",
443 /* find an idle stripe, mak
2962 sector_t stripe, stripe2; local
3170 sector_t stripe; local
3601 stripe_set_idx(sector_t stripe, struct r5conf *conf, int previous, struct stripe_head *sh) argument
7699 int data_disks, stripe; local
[all...]
/linux-master/fs/nfs/blocklayout/
H A Dblocklayout.h83 } stripe; member in union:pnfs_block_volume::__anon1815
H A Ddev.c127 p = xdr_decode_hyper(p, &b->stripe.chunk_size);
128 b->stripe.volumes_count = be32_to_cpup(p++);
129 if (b->stripe.volumes_count > PNFS_BLOCK_MAX_DEVICES) {
130 dprintk("Too many volumes: %d\n", b->stripe.volumes_count);
134 p = xdr_inline_decode(xdr, b->stripe.volumes_count * 4);
137 for (i = 0; i < b->stripe.volumes_count; i++)
138 b->stripe.volumes[i] = be32_to_cpup(p++);
214 /* truncate offset to the beginning of the stripe */
217 /* disk offset of the stripe */
436 d->children = kcalloc(v->stripe
[all...]

Completed in 436 milliseconds

12