Lines Matching refs:disks

484 	if (!mddev->raid_disks && list_empty(&mddev->disks) &&
512 	INIT_LIST_HEAD(&mddev->disks);
1138 		if (sb->disks[rdev->desc_nr].state & (
1157 		desc = sb->disks + rdev->desc_nr;
1193 	 * 1/ zero out disks
1195 	 * 3/ any empty disks < next_spare become removed
1197 	 * disks[0] gets initialised to REMOVED because
1257 	sb->disks[0].state = (1<<MD_DISK_REMOVED);
1278 		d = &sb->disks[rdev2->desc_nr];
1305 		mdp_disk_t *d = &sb->disks[i];
1320 	sb->this_disk = sb->disks[rdev->desc_nr];
1959 	if (list_empty(&mddev->disks))
1964 		/* skip spares and non-functional disks */
2089 	list_add_rcu(&rdev->same_set, &mddev->disks);
2189 	while (!list_empty(&mddev->disks)) {
2190 		rdev = list_first_entry(&mddev->disks, struct md_rdev,
2391 		 * then added disks for geometry changes,
3794 		if (list_empty(&mddev->disks) &&
3996 		if (!IS_ERR(rdev) && !list_empty(&mddev->disks)) {
3998 				= list_entry(mddev->disks.next,
4139 	else if (!list_empty(&mddev->disks))
5009 	if (list_empty(&mddev->disks))
5246 	if (list_empty(&mddev->disks))
5556 	if (list_empty(&mddev->disks))
5575  * lets try to run arrays based on all disks that have arrived
5578  * the method: pick the first pending disk, collect all disks with
5581  * update time (freshest comes first), kick out 'old' disks and
5641 			 || !list_empty(&mddev->disks)) {
5835 		if (!list_empty(&mddev->disks)) {
5837 				= list_entry(mddev->disks.next,
6327 	/* change the number of raid disks */
6678 		if (!list_empty(&mddev->disks)) {
6680 			       "md: array %s already has disks!\n",
7253 	if (mddev->pers || mddev->raid_disks || !list_empty(&mddev->disks)) {
7284 		if (!list_empty(&mddev->disks)) {