Searched refs:stripe (Results 1 - 25 of 41) sorted by path

12

/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 Ddm-stripe.c24 struct stripe { struct
47 struct stripe stripe[] __counted_by(stripes);
52 * drops out of a stripe volume.
65 unsigned int stripe, char **argv)
75 &sc->stripe[stripe].dev);
79 sc->stripe[stripe].physical_start = start;
103 ti->error = "Invalid stripe coun
64 get_stripe(struct dm_target *ti, struct stripe_c *sc, unsigned int stripe, char **argv) argument
201 stripe_map_sector(struct stripe_c *sc, sector_t sector, uint32_t *stripe, sector_t *result) argument
232 uint32_t stripe; local
274 uint32_t stripe; local
306 uint32_t stripe; local
[all...]
H A Draid10.c586 sector_t stripe; local
602 stripe = chunk;
603 dev = sector_div(stripe, geo->raid_disks);
605 stripe *= geo->far_copies;
607 sector += stripe << geo->chunk_shift;
1629 * stripe and discard region is larger than one stripe size. For far
1630 * offset layout, if the discard region is not aligned with stripe
1668 * One stripe contains the chunks from all member disk (one chunk from
1753 * the next stripe
[all...]
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/drivers/md/bcache/
H A Dwriteback.c601 int stripe; local
606 stripe = offset_to_stripe(d, offset);
607 if (stripe < 0)
622 if (stripe >= d->nr_stripes)
626 d->stripe_sectors_dirty + stripe);
628 if (!test_bit(stripe, d->full_dirty_stripes))
629 set_bit(stripe, d->full_dirty_stripes);
631 if (test_bit(stripe, d->full_dirty_stripes))
632 clear_bit(stripe, d->full_dirty_stripes);
637 stripe
656 int stripe; local
[all...]
H A Dwriteback.h66 pr_err("Invalid stripe %llu (>= nr_stripes %d).\n",
82 int stripe = offset_to_stripe(&dc->disk, offset); local
84 if (stripe < 0)
88 if (atomic_read(dc->disk.stripe_sectors_dirty + stripe))
95 stripe++;
/linux-master/drivers/scsi/megaraid/
H A Dmegaraid_sas_fp.c648 static u8 get_arm(struct megasas_instance *instance, u32 ld, u8 span, u64 stripe, argument
659 arm = mega_mod64(stripe, SPAN_ROW_SIZE(map, ld, span));
663 arm = get_arm_from_strip(instance, ld, stripe, map);
676 * This routine calculates the arm, span and block for the specified stripe and
677 * reference in stripe using spanset
683 * stripRef - Reference in stripe
777 * This routine calculates the arm, span and block for the specified stripe and
778 * reference in stripe.
784 * stripRef - Reference in stripe
1030 * calculate starting row and stripe, an
[all...]
/linux-master/drivers/staging/media/atomisp/pci/isp/modes/interface/
H A Disp_const.h75 #define CEIL_ROUND_DIV_STRIPE(width, stripe, padding) \
76 CEIL_MUL(padding + CEIL_DIV(width - padding, stripe), ((ENABLE_RAW_BINNING || ENABLE_FIXED_BAYER_DS) ? 4 : 2))
/linux-master/drivers/staging/media/ipu3/
H A Dipu3-abi.h752 /* stripe width - measured in pixels */
754 /* stripe width - measured in pixels */
834 /* Number of vectors to left-crop when writing stripes (not stripe 0) */
1058 struct imgu_abi_osys_stripe stripe[IPU3_UAPI_MAX_STRIPES]; member in struct:imgu_abi_osys_config
1272 struct imgu_abi_stripe_data stripe; member in struct:imgu_abi_acc_param
H A Dipu3-css-params.c229 * Function calculates input frame stripe offset, based
230 * on output frame stripe offset and filter parameters.
244 * stripe offset and filter parameters
260 * This function calculates input frame stripe width,
261 * based on output frame stripe offset and filter parameters
277 * This function calculates output frame stripe width, basedi
278 * on output frame stripe offset and filter parameters
573 /* Calculate stripe offsets */
596 /* Calculate stripe phase init */
669 * input stripe
[all...]
/linux-master/fs/bcachefs/
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_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
H A Dalloc_background_format.h19 x(stripe, 32) \
42 x(stripe, 32) \
70 __u32 stripe; member in struct:bch_alloc_v4
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_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 Dbcachefs.h1026 GENRADIX(struct stripe) stripes;
H A Dbcachefs_format.h400 x(stripe, 14) \
693 x(stripe, 7) \
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 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 Dbuckets_types.h16 u32 stripe; member in struct:bucket
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 Dec_types.h12 struct stripe { struct
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);
/linux-master/fs/btrfs/
H A DMakefile36 lru_cache.o raid-stripe-tree.o

Completed in 399 milliseconds

12