Lines Matching defs:first
17 * subtle (and I got it wrong the first time) so it deserves some
118 /* Find first data disk in a raid6 stripe */
122 /* ddf always start from first device */
445 struct list_head *first;
449 first = (conf->inactive_list + hash)->next;
450 sh = list_entry(first, struct stripe_head, lru);
451 list_del_init(first);
770 /* first sector in the request */
782 /* the request had REQ_PREFLUSH, cleared after the first stripe_head */
1056 struct list_head *first, *next = NULL;
1064 first = conf->pending_list.next;
1074 if (&data->sibling == first)
1075 first = data->sibling.next;
1093 if (first != &conf->pending_list)
1094 list_move_tail(&conf->pending_list, first);
1241 * increment it first.
3128 /* Same a left_asymmetric, by first stripe is
3335 * like to flush data in journal to RAID disks first, so complex rmw
3523 sector_t first = 0;
3532 if (count == 0 || sector < first)
3533 first = sector;
3540 if (first + conf->chunk_sectors * (count - 1) != last)
3601 * much all set STRIPE_BITMAP_PENDING. So only the first one
3622 * toread/towrite point to the first in a chain.
3689 /* fail all writes first */
4047 * disks first, this avoids handling complex rmw of write
5473 * first).
6101 * the lowest chunk offset in the first chunk.
6203 * Lets start with the stripe with the lowest chunk offset in the first
6461 * The source stripes are determined by mapping the first and last
7788 int first = 1;
7807 if (first) {
7809 first = 0;
7875 /* here_old is the first stripe that we might need to read
8322 int first = 0;
8352 first = last = rdev->raid_disk;
8358 if (rdev->saved_raid_disk >= first &&
8361 first = rdev->saved_raid_disk;
8363 for (disk = first; disk <= last; disk++) {
8377 for (disk = first; disk <= last; disk++) {
8440 * stripe_heads first.
8470 * be made bigger first.
9033 } else /* need remove journal device first */