Lines Matching refs:disks

468 	if (!mddev->raid_disks && list_empty(&mddev->disks) &&
498 	INIT_LIST_HEAD(&mddev->disks);
1123 		if (sb->disks[rdev->desc_nr].state & (
1142 		desc = sb->disks + rdev->desc_nr;
1178 	 * 1/ zero out disks
1180 	 * 3/ any empty disks < next_spare become removed
1182 	 * disks[0] gets initialised to REMOVED because
1242 	sb->disks[0].state = (1<<MD_DISK_REMOVED);
1263 		d = &sb->disks[rdev2->desc_nr];
1290 		mdp_disk_t *d = &sb->disks[i];
1305 	sb->this_disk = sb->disks[rdev->desc_nr];
1983 	if (list_empty(&mddev->disks))
1988 		/* skip spares and non-functional disks */
2113 	list_add_rcu(&rdev->same_set, &mddev->disks);
2213 	while (!list_empty(&mddev->disks)) {
2214 		rdev = list_first_entry(&mddev->disks, struct md_rdev,
2472 		 * then added disks for geometry changes,
3894 		if (list_empty(&mddev->disks) &&
4100 		if (!IS_ERR(rdev) && !list_empty(&mddev->disks)) {
4102 				= list_entry(mddev->disks.next,
4239 	else if (!list_empty(&mddev->disks))
5124 	if (list_empty(&mddev->disks))
5369 	if (list_empty(&mddev->disks))
5697 	if (list_empty(&mddev->disks))
5716  * lets try to run arrays based on all disks that have arrived
5719  * the method: pick the first pending disk, collect all disks with
5722  * update time (freshest comes first), kick out 'old' disks and
5782 			 || !list_empty(&mddev->disks)) {
5978 		if (!list_empty(&mddev->disks)) {
5980 				= list_entry(mddev->disks.next,
6470 	/* change the number of raid disks */
6815 		if (!list_empty(&mddev->disks)) {
6817 			       "md: array %s already has disks!\n",
7405 	if (mddev->pers || mddev->raid_disks || !list_empty(&mddev->disks)) {
7438 		if (!list_empty(&mddev->disks)) {