Lines Matching defs:stripes
102 * We maintain a biased count of active stripes in the bottom 16 bits of
103 * bi_phys_segments, and a count of processed stripes in the upper 16 bits
1385 /* Make all the stripes able to hold 'newsize' devices.
1396 * freed when all stripes are done.
1456 * OK, we have enough stripes, start collecting inactive
1457 * stripes and copying them over
1478 * At this point, we are holding all the stripes so the array
1510 /* Step 4, return new stripes to service */
3792 bi->bi_phys_segments = 1; /* biased count of active stripes */
3920 * Full stripe writes are allowed to pass preread active stripes up until
4002 bi->bi_phys_segments = 1; /* over-loaded to count active stripes */
4130 /* We need to wait for the stripes to all be handled.
4147 * destination stripes and flag them as expanding.
4148 * Then we find all the source stripes and request reads.
4163 struct list_head stripes;
4265 INIT_LIST_HEAD(&stripes);
4295 list_add(&sh->lru, &stripes);
4304 * reads on the source stripes.
4305 * The source stripes are determined by mapping the first and last
4306 * block on the destination stripes.
4325 * the destination stripes
4327 while (!list_empty(&stripes)) {
4328 sh = list_entry(stripes.next, struct stripe_head, lru);
4414 return sync_blocks * STRIPE_SECTORS; /* keep things rounded to whole stripes */
4517 * We scan the hash table for stripes which can be handled now.
4518 * During the scan, completed stripes are saved for us by the interrupt
4568 pr_debug("%d stripes handled\n", handled);
5194 /* read-ahead size must cover two whole stripes, which
5475 printk(KERN_WARNING "md/raid:%s: reshape: not enough stripes. Needed %lu\n",
5641 /* read-ahead size must cover two whole stripes, which is
5706 * active stripes can drain