]> git.ipfire.org Git - thirdparty/mdadm.git/blob - Grow.c
Raid0: execute backward takeover
[thirdparty/mdadm.git] / Grow.c
1 /*
2 * mdadm - manage Linux "md" devices aka RAID arrays.
3 *
4 * Copyright (C) 2001-2009 Neil Brown <neilb@suse.de>
5 *
6 *
7 * This program is free software; you can redistribute it and/or modify
8 * it under the terms of the GNU General Public License as published by
9 * the Free Software Foundation; either version 2 of the License, or
10 * (at your option) any later version.
11 *
12 * This program is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 * GNU General Public License for more details.
16 *
17 * You should have received a copy of the GNU General Public License
18 * along with this program; if not, write to the Free Software
19 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
20 *
21 * Author: Neil Brown
22 * Email: <neilb@suse.de>
23 */
24 #include "mdadm.h"
25 #include "dlink.h"
26 #include <sys/mman.h>
27
28 #if ! defined(__BIG_ENDIAN) && ! defined(__LITTLE_ENDIAN)
29 #error no endian defined
30 #endif
31 #include "md_u.h"
32 #include "md_p.h"
33
34 #ifndef offsetof
35 #define offsetof(t,f) ((size_t)&(((t*)0)->f))
36 #endif
37
38 int Grow_Add_device(char *devname, int fd, char *newdev)
39 {
40 /* Add a device to an active array.
41 * Currently, just extend a linear array.
42 * This requires writing a new superblock on the
43 * new device, calling the kernel to add the device,
44 * and if that succeeds, update the superblock on
45 * all other devices.
46 * This means that we need to *find* all other devices.
47 */
48 struct mdinfo info;
49
50 struct stat stb;
51 int nfd, fd2;
52 int d, nd;
53 struct supertype *st = NULL;
54 char *subarray = NULL;
55
56 if (ioctl(fd, GET_ARRAY_INFO, &info.array) < 0) {
57 fprintf(stderr, Name ": cannot get array info for %s\n", devname);
58 return 1;
59 }
60
61 if (info.array.level != -1) {
62 fprintf(stderr, Name ": can only add devices to linear arrays\n");
63 return 1;
64 }
65
66 st = super_by_fd(fd, &subarray);
67 if (!st) {
68 fprintf(stderr, Name ": cannot handle arrays with superblock version %d\n", info.array.major_version);
69 return 1;
70 }
71
72 if (subarray) {
73 fprintf(stderr, Name ": Cannot grow linear sub-arrays yet\n");
74 free(subarray);
75 free(st);
76 }
77
78 nfd = open(newdev, O_RDWR|O_EXCL|O_DIRECT);
79 if (nfd < 0) {
80 fprintf(stderr, Name ": cannot open %s\n", newdev);
81 free(st);
82 return 1;
83 }
84 fstat(nfd, &stb);
85 if ((stb.st_mode & S_IFMT) != S_IFBLK) {
86 fprintf(stderr, Name ": %s is not a block device!\n", newdev);
87 close(nfd);
88 free(st);
89 return 1;
90 }
91 /* now check out all the devices and make sure we can read the superblock */
92 for (d=0 ; d < info.array.raid_disks ; d++) {
93 mdu_disk_info_t disk;
94 char *dv;
95
96 st->ss->free_super(st);
97
98 disk.number = d;
99 if (ioctl(fd, GET_DISK_INFO, &disk) < 0) {
100 fprintf(stderr, Name ": cannot get device detail for device %d\n",
101 d);
102 close(nfd);
103 free(st);
104 return 1;
105 }
106 dv = map_dev(disk.major, disk.minor, 1);
107 if (!dv) {
108 fprintf(stderr, Name ": cannot find device file for device %d\n",
109 d);
110 close(nfd);
111 free(st);
112 return 1;
113 }
114 fd2 = dev_open(dv, O_RDWR);
115 if (!fd2) {
116 fprintf(stderr, Name ": cannot open device file %s\n", dv);
117 close(nfd);
118 free(st);
119 return 1;
120 }
121
122 if (st->ss->load_super(st, fd2, NULL)) {
123 fprintf(stderr, Name ": cannot find super block on %s\n", dv);
124 close(nfd);
125 close(fd2);
126 free(st);
127 return 1;
128 }
129 close(fd2);
130 }
131 /* Ok, looks good. Lets update the superblock and write it out to
132 * newdev.
133 */
134
135 info.disk.number = d;
136 info.disk.major = major(stb.st_rdev);
137 info.disk.minor = minor(stb.st_rdev);
138 info.disk.raid_disk = d;
139 info.disk.state = (1 << MD_DISK_SYNC) | (1 << MD_DISK_ACTIVE);
140 st->ss->update_super(st, &info, "linear-grow-new", newdev,
141 0, 0, NULL);
142
143 if (st->ss->store_super(st, nfd)) {
144 fprintf(stderr, Name ": Cannot store new superblock on %s\n",
145 newdev);
146 close(nfd);
147 return 1;
148 }
149 close(nfd);
150
151 if (ioctl(fd, ADD_NEW_DISK, &info.disk) != 0) {
152 fprintf(stderr, Name ": Cannot add new disk to this array\n");
153 return 1;
154 }
155 /* Well, that seems to have worked.
156 * Now go through and update all superblocks
157 */
158
159 if (ioctl(fd, GET_ARRAY_INFO, &info.array) < 0) {
160 fprintf(stderr, Name ": cannot get array info for %s\n", devname);
161 return 1;
162 }
163
164 nd = d;
165 for (d=0 ; d < info.array.raid_disks ; d++) {
166 mdu_disk_info_t disk;
167 char *dv;
168
169 disk.number = d;
170 if (ioctl(fd, GET_DISK_INFO, &disk) < 0) {
171 fprintf(stderr, Name ": cannot get device detail for device %d\n",
172 d);
173 return 1;
174 }
175 dv = map_dev(disk.major, disk.minor, 1);
176 if (!dv) {
177 fprintf(stderr, Name ": cannot find device file for device %d\n",
178 d);
179 return 1;
180 }
181 fd2 = dev_open(dv, O_RDWR);
182 if (fd2 < 0) {
183 fprintf(stderr, Name ": cannot open device file %s\n", dv);
184 return 1;
185 }
186 if (st->ss->load_super(st, fd2, NULL)) {
187 fprintf(stderr, Name ": cannot find super block on %s\n", dv);
188 close(fd);
189 return 1;
190 }
191 info.array.raid_disks = nd+1;
192 info.array.nr_disks = nd+1;
193 info.array.active_disks = nd+1;
194 info.array.working_disks = nd+1;
195
196 st->ss->update_super(st, &info, "linear-grow-update", dv,
197 0, 0, NULL);
198
199 if (st->ss->store_super(st, fd2)) {
200 fprintf(stderr, Name ": Cannot store new superblock on %s\n", dv);
201 close(fd2);
202 return 1;
203 }
204 close(fd2);
205 }
206
207 return 0;
208 }
209
210 int Grow_addbitmap(char *devname, int fd, char *file, int chunk, int delay, int write_behind, int force)
211 {
212 /*
213 * First check that array doesn't have a bitmap
214 * Then create the bitmap
215 * Then add it
216 *
217 * For internal bitmaps, we need to check the version,
218 * find all the active devices, and write the bitmap block
219 * to all devices
220 */
221 mdu_bitmap_file_t bmf;
222 mdu_array_info_t array;
223 struct supertype *st;
224 char *subarray = NULL;
225 int major = BITMAP_MAJOR_HI;
226 int vers = md_get_version(fd);
227 unsigned long long bitmapsize, array_size;
228
229 if (vers < 9003) {
230 major = BITMAP_MAJOR_HOSTENDIAN;
231 fprintf(stderr, Name ": Warning - bitmaps created on this kernel"
232 " are not portable\n"
233 " between different architectures. Consider upgrading"
234 " the Linux kernel.\n");
235 }
236
237 if (ioctl(fd, GET_BITMAP_FILE, &bmf) != 0) {
238 if (errno == ENOMEM)
239 fprintf(stderr, Name ": Memory allocation failure.\n");
240 else
241 fprintf(stderr, Name ": bitmaps not supported by this kernel.\n");
242 return 1;
243 }
244 if (bmf.pathname[0]) {
245 if (strcmp(file,"none")==0) {
246 if (ioctl(fd, SET_BITMAP_FILE, -1)!= 0) {
247 fprintf(stderr, Name ": failed to remove bitmap %s\n",
248 bmf.pathname);
249 return 1;
250 }
251 return 0;
252 }
253 fprintf(stderr, Name ": %s already has a bitmap (%s)\n",
254 devname, bmf.pathname);
255 return 1;
256 }
257 if (ioctl(fd, GET_ARRAY_INFO, &array) != 0) {
258 fprintf(stderr, Name ": cannot get array status for %s\n", devname);
259 return 1;
260 }
261 if (array.state & (1<<MD_SB_BITMAP_PRESENT)) {
262 if (strcmp(file, "none")==0) {
263 array.state &= ~(1<<MD_SB_BITMAP_PRESENT);
264 if (ioctl(fd, SET_ARRAY_INFO, &array)!= 0) {
265 fprintf(stderr, Name ": failed to remove internal bitmap.\n");
266 return 1;
267 }
268 return 0;
269 }
270 fprintf(stderr, Name ": Internal bitmap already present on %s\n",
271 devname);
272 return 1;
273 }
274
275 if (strcmp(file, "none") == 0) {
276 fprintf(stderr, Name ": no bitmap found on %s\n", devname);
277 return 1;
278 }
279 if (array.level <= 0) {
280 fprintf(stderr, Name ": Bitmaps not meaningful with level %s\n",
281 map_num(pers, array.level)?:"of this array");
282 return 1;
283 }
284 bitmapsize = array.size;
285 bitmapsize <<= 1;
286 if (get_dev_size(fd, NULL, &array_size) &&
287 array_size > (0x7fffffffULL<<9)) {
288 /* Array is big enough that we cannot trust array.size
289 * try other approaches
290 */
291 bitmapsize = get_component_size(fd);
292 }
293 if (bitmapsize == 0) {
294 fprintf(stderr, Name ": Cannot reliably determine size of array to create bitmap - sorry.\n");
295 return 1;
296 }
297
298 if (array.level == 10) {
299 int ncopies = (array.layout&255)*((array.layout>>8)&255);
300 bitmapsize = bitmapsize * array.raid_disks / ncopies;
301 }
302
303 st = super_by_fd(fd, &subarray);
304 if (!st) {
305 fprintf(stderr, Name ": Cannot understand version %d.%d\n",
306 array.major_version, array.minor_version);
307 return 1;
308 }
309 if (subarray) {
310 fprintf(stderr, Name ": Cannot add bitmaps to sub-arrays yet\n");
311 free(subarray);
312 free(st);
313 return 1;
314 }
315 if (strcmp(file, "internal") == 0) {
316 int d;
317 if (st->ss->add_internal_bitmap == NULL) {
318 fprintf(stderr, Name ": Internal bitmaps not supported "
319 "with %s metadata\n", st->ss->name);
320 return 1;
321 }
322 for (d=0; d< st->max_devs; d++) {
323 mdu_disk_info_t disk;
324 char *dv;
325 disk.number = d;
326 if (ioctl(fd, GET_DISK_INFO, &disk) < 0)
327 continue;
328 if (disk.major == 0 &&
329 disk.minor == 0)
330 continue;
331 if ((disk.state & (1<<MD_DISK_SYNC))==0)
332 continue;
333 dv = map_dev(disk.major, disk.minor, 1);
334 if (dv) {
335 int fd2 = dev_open(dv, O_RDWR);
336 if (fd2 < 0)
337 continue;
338 if (st->ss->load_super(st, fd2, NULL)==0) {
339 if (st->ss->add_internal_bitmap(
340 st,
341 &chunk, delay, write_behind,
342 bitmapsize, 0, major)
343 )
344 st->ss->write_bitmap(st, fd2);
345 else {
346 fprintf(stderr, Name ": failed to create internal bitmap - chunksize problem.\n");
347 close(fd2);
348 return 1;
349 }
350 }
351 close(fd2);
352 }
353 }
354 array.state |= (1<<MD_SB_BITMAP_PRESENT);
355 if (ioctl(fd, SET_ARRAY_INFO, &array)!= 0) {
356 if (errno == EBUSY)
357 fprintf(stderr, Name
358 ": Cannot add bitmap while array is"
359 " resyncing or reshaping etc.\n");
360 fprintf(stderr, Name ": failed to set internal bitmap.\n");
361 return 1;
362 }
363 } else {
364 int uuid[4];
365 int bitmap_fd;
366 int d;
367 int max_devs = st->max_devs;
368
369 /* try to load a superblock */
370 for (d=0; d<max_devs; d++) {
371 mdu_disk_info_t disk;
372 char *dv;
373 int fd2;
374 disk.number = d;
375 if (ioctl(fd, GET_DISK_INFO, &disk) < 0)
376 continue;
377 if ((disk.major==0 && disk.minor==0) ||
378 (disk.state & (1<<MD_DISK_REMOVED)))
379 continue;
380 dv = map_dev(disk.major, disk.minor, 1);
381 if (!dv) continue;
382 fd2 = dev_open(dv, O_RDONLY);
383 if (fd2 >= 0 &&
384 st->ss->load_super(st, fd2, NULL) == 0) {
385 close(fd2);
386 st->ss->uuid_from_super(st, uuid);
387 break;
388 }
389 close(fd2);
390 }
391 if (d == max_devs) {
392 fprintf(stderr, Name ": cannot find UUID for array!\n");
393 return 1;
394 }
395 if (CreateBitmap(file, force, (char*)uuid, chunk,
396 delay, write_behind, bitmapsize, major)) {
397 return 1;
398 }
399 bitmap_fd = open(file, O_RDWR);
400 if (bitmap_fd < 0) {
401 fprintf(stderr, Name ": weird: %s cannot be opened\n",
402 file);
403 return 1;
404 }
405 if (ioctl(fd, SET_BITMAP_FILE, bitmap_fd) < 0) {
406 int err = errno;
407 if (errno == EBUSY)
408 fprintf(stderr, Name
409 ": Cannot add bitmap while array is"
410 " resyncing or reshaping etc.\n");
411 fprintf(stderr, Name ": Cannot set bitmap file for %s: %s\n",
412 devname, strerror(err));
413 return 1;
414 }
415 }
416
417 return 0;
418 }
419
420
421 /*
422 * When reshaping an array we might need to backup some data.
423 * This is written to all spares with a 'super_block' describing it.
424 * The superblock goes 4K from the end of the used space on the
425 * device.
426 * It if written after the backup is complete.
427 * It has the following structure.
428 */
429
430 static struct mdp_backup_super {
431 char magic[16]; /* md_backup_data-1 or -2 */
432 __u8 set_uuid[16];
433 __u64 mtime;
434 /* start/sizes in 512byte sectors */
435 __u64 devstart; /* address on backup device/file of data */
436 __u64 arraystart;
437 __u64 length;
438 __u32 sb_csum; /* csum of preceeding bytes. */
439 __u32 pad1;
440 __u64 devstart2; /* offset in to data of second section */
441 __u64 arraystart2;
442 __u64 length2;
443 __u32 sb_csum2; /* csum of preceeding bytes. */
444 __u8 pad[512-68-32];
445 } __attribute__((aligned(512))) bsb, bsb2;
446
447 static __u32 bsb_csum(char *buf, int len)
448 {
449 int i;
450 int csum = 0;
451 for (i=0; i<len; i++)
452 csum = (csum<<3) + buf[0];
453 return __cpu_to_le32(csum);
454 }
455
456 static int check_idle(struct supertype *st)
457 {
458 /* Check that all member arrays for this container, or the
459 * container of this array, are idle
460 */
461 int container_dev = (st->container_dev != NoMdDev
462 ? st->container_dev : st->devnum);
463 char container[40];
464 struct mdstat_ent *ent, *e;
465 int is_idle = 1;
466
467 fmt_devname(container, container_dev);
468 ent = mdstat_read(0, 0);
469 for (e = ent ; e; e = e->next) {
470 if (!is_container_member(e, container))
471 continue;
472 if (e->percent >= 0) {
473 is_idle = 0;
474 break;
475 }
476 }
477 free_mdstat(ent);
478 return is_idle;
479 }
480
481 static int freeze_container(struct supertype *st)
482 {
483 int container_dev = (st->container_dev != NoMdDev
484 ? st->container_dev : st->devnum);
485 char container[40];
486
487 if (!check_idle(st))
488 return -1;
489
490 fmt_devname(container, container_dev);
491
492 if (block_monitor(container, 1)) {
493 fprintf(stderr, Name ": failed to freeze container\n");
494 return -2;
495 }
496
497 return 1;
498 }
499
500 static void unfreeze_container(struct supertype *st)
501 {
502 int container_dev = (st->container_dev != NoMdDev
503 ? st->container_dev : st->devnum);
504 char container[40];
505
506 fmt_devname(container, container_dev);
507
508 unblock_monitor(container, 1);
509 }
510
511 static int freeze(struct supertype *st)
512 {
513 /* Try to freeze resync/rebuild on this array/container.
514 * Return -1 if the array is busy,
515 * return -2 container cannot be frozen,
516 * return 0 if this kernel doesn't support 'frozen'
517 * return 1 if it worked.
518 */
519 if (st->ss->external)
520 return freeze_container(st);
521 else {
522 struct mdinfo *sra = sysfs_read(-1, st->devnum, GET_VERSION);
523 int err;
524
525 if (!sra)
526 return -1;
527 err = sysfs_freeze_array(sra);
528 sysfs_free(sra);
529 return err;
530 }
531 }
532
533 static void unfreeze(struct supertype *st, int frozen)
534 {
535 /* If 'frozen' is 1, unfreeze the array */
536 if (frozen <= 0)
537 return;
538
539 if (st->ss->external)
540 return unfreeze_container(st);
541 else {
542 struct mdinfo *sra = sysfs_read(-1, st->devnum, GET_VERSION);
543
544 if (sra)
545 sysfs_set_str(sra, NULL, "sync_action", "idle");
546 else
547 fprintf(stderr, Name ": failed to unfreeze array\n");
548 sysfs_free(sra);
549 }
550 }
551
552 static void wait_reshape(struct mdinfo *sra)
553 {
554 int fd = sysfs_get_fd(sra, NULL, "sync_action");
555 char action[20];
556
557 if (fd < 0)
558 return;
559
560 while (sysfs_fd_get_str(fd, action, 20) > 0 &&
561 strncmp(action, "reshape", 7) == 0) {
562 fd_set rfds;
563 FD_ZERO(&rfds);
564 FD_SET(fd, &rfds);
565 select(fd+1, NULL, NULL, &rfds, NULL);
566 }
567 close(fd);
568 }
569
570 static int reshape_super(struct supertype *st, long long size, int level,
571 int layout, int chunksize, int raid_disks,
572 char *backup_file, char *dev, int verbose)
573 {
574 /* nothing extra to check in the native case */
575 if (!st->ss->external)
576 return 0;
577 if (!st->ss->reshape_super ||
578 !st->ss->manage_reshape) {
579 fprintf(stderr, Name ": %s metadata does not support reshape\n",
580 st->ss->name);
581 return 1;
582 }
583
584 return st->ss->reshape_super(st, size, level, layout, chunksize,
585 raid_disks, backup_file, dev, verbose);
586 }
587
588 static void sync_metadata(struct supertype *st)
589 {
590 if (st->ss->external) {
591 if (st->update_tail) {
592 flush_metadata_updates(st);
593 st->update_tail = &st->updates;
594 } else
595 st->ss->sync_metadata(st);
596 }
597 }
598
599 static int subarray_set_num(char *container, struct mdinfo *sra, char *name, int n)
600 {
601 /* when dealing with external metadata subarrays we need to be
602 * prepared to handle EAGAIN. The kernel may need to wait for
603 * mdmon to mark the array active so the kernel can handle
604 * allocations/writeback when preparing the reshape action
605 * (md_allow_write()). We temporarily disable safe_mode_delay
606 * to close a race with the array_state going clean before the
607 * next write to raid_disks / stripe_cache_size
608 */
609 char safe[50];
610 int rc;
611
612 /* only 'raid_disks' and 'stripe_cache_size' trigger md_allow_write */
613 if (!container ||
614 (strcmp(name, "raid_disks") != 0 &&
615 strcmp(name, "stripe_cache_size") != 0))
616 return sysfs_set_num(sra, NULL, name, n);
617
618 rc = sysfs_get_str(sra, NULL, "safe_mode_delay", safe, sizeof(safe));
619 if (rc <= 0)
620 return -1;
621 sysfs_set_num(sra, NULL, "safe_mode_delay", 0);
622 rc = sysfs_set_num(sra, NULL, name, n);
623 if (rc < 0 && errno == EAGAIN) {
624 ping_monitor(container);
625 /* if we get EAGAIN here then the monitor is not active
626 * so stop trying
627 */
628 rc = sysfs_set_num(sra, NULL, name, n);
629 }
630 sysfs_set_str(sra, NULL, "safe_mode_delay", safe);
631 return rc;
632 }
633
634 int start_reshape(struct mdinfo *sra)
635 {
636 int err;
637 err = sysfs_set_num(sra, NULL, "suspend_hi", 0);
638 err = err ?: sysfs_set_num(sra, NULL, "suspend_lo", 0);
639 err = err ?: sysfs_set_num(sra, NULL, "sync_min", 0);
640 err = err ?: sysfs_set_num(sra, NULL, "sync_max", 0);
641 err = err ?: sysfs_set_str(sra, NULL, "sync_action", "reshape");
642
643 return err;
644 }
645
646 void abort_reshape(struct mdinfo *sra)
647 {
648 sysfs_set_str(sra, NULL, "sync_action", "idle");
649 sysfs_set_num(sra, NULL, "suspend_lo", 0x7FFFFFFFFFFFFFFFULL);
650 sysfs_set_num(sra, NULL, "suspend_hi", 0);
651 sysfs_set_num(sra, NULL, "suspend_lo", 0);
652 sysfs_set_num(sra, NULL, "sync_min", 0);
653 sysfs_set_str(sra, NULL, "sync_max", "max");
654 }
655
656 int remove_disks_on_raid10_to_raid0_takeover(struct supertype *st,
657 struct mdinfo *sra,
658 int layout)
659 {
660 int nr_of_copies;
661 struct mdinfo *remaining;
662 int slot;
663
664 nr_of_copies = layout & 0xff;
665
666 remaining = sra->devs;
667 sra->devs = NULL;
668 /* for each 'copy', select one device and remove from the list. */
669 for (slot = 0; slot < sra->array.raid_disks; slot += nr_of_copies) {
670 struct mdinfo **diskp;
671 int found = 0;
672
673 /* Find a working device to keep */
674 for (diskp = &remaining; *diskp ; diskp = &(*diskp)->next) {
675 struct mdinfo *disk = *diskp;
676
677 if (disk->disk.raid_disk < slot)
678 continue;
679 if (disk->disk.raid_disk >= slot + nr_of_copies)
680 continue;
681 if (disk->disk.state & (1<<MD_DISK_REMOVED))
682 continue;
683 if (disk->disk.state & (1<<MD_DISK_FAULTY))
684 continue;
685 if (!(disk->disk.state & (1<<MD_DISK_SYNC)))
686 continue;
687
688 /* We have found a good disk to use! */
689 *diskp = disk->next;
690 disk->next = sra->devs;
691 sra->devs = disk;
692 found = 1;
693 break;
694 }
695 if (!found)
696 break;
697 }
698
699 if (slot < sra->array.raid_disks) {
700 /* didn't find all slots */
701 struct mdinfo **e;
702 e = &remaining;
703 while (*e)
704 e = &(*e)->next;
705 *e = sra->devs;
706 sra->devs = remaining;
707 return 1;
708 }
709
710 /* Remove all 'remaining' devices from the array */
711 while (remaining) {
712 struct mdinfo *sd = remaining;
713 remaining = sd->next;
714
715 sysfs_set_str(sra, sd, "state", "faulty");
716 sysfs_set_str(sra, sd, "slot", "none");
717 sysfs_set_str(sra, sd, "state", "remove");
718 sd->disk.state |= (1<<MD_DISK_REMOVED);
719 sd->disk.state &= ~(1<<MD_DISK_SYNC);
720 sd->next = sra->devs;
721 sra->devs = sd;
722 }
723 return 0;
724 }
725
726 void reshape_free_fdlist(int *fdlist,
727 unsigned long long *offsets,
728 int size)
729 {
730 int i;
731
732 for (i = 0; i < size; i++)
733 if (fdlist[i] >= 0)
734 close(fdlist[i]);
735
736 free(fdlist);
737 free(offsets);
738 }
739
740 int reshape_prepare_fdlist(char *devname,
741 struct mdinfo *sra,
742 int raid_disks,
743 int nrdisks,
744 unsigned long blocks,
745 char *backup_file,
746 int *fdlist,
747 unsigned long long *offsets)
748 {
749 int d = 0;
750 struct mdinfo *sd;
751
752 for (d = 0; d <= nrdisks; d++)
753 fdlist[d] = -1;
754 d = raid_disks;
755 for (sd = sra->devs; sd; sd = sd->next) {
756 if (sd->disk.state & (1<<MD_DISK_FAULTY))
757 continue;
758 if (sd->disk.state & (1<<MD_DISK_SYNC)) {
759 char *dn = map_dev(sd->disk.major,
760 sd->disk.minor, 1);
761 fdlist[sd->disk.raid_disk]
762 = dev_open(dn, O_RDONLY);
763 offsets[sd->disk.raid_disk] = sd->data_offset*512;
764 if (fdlist[sd->disk.raid_disk] < 0) {
765 fprintf(stderr,
766 Name ": %s: cannot open component %s\n",
767 devname, dn ? dn : "-unknown-");
768 d = -1;
769 goto release;
770 }
771 } else if (backup_file == NULL) {
772 /* spare */
773 char *dn = map_dev(sd->disk.major,
774 sd->disk.minor, 1);
775 fdlist[d] = dev_open(dn, O_RDWR);
776 offsets[d] = (sd->data_offset + sra->component_size - blocks - 8)*512;
777 if (fdlist[d] < 0) {
778 fprintf(stderr, Name ": %s: cannot open component %s\n",
779 devname, dn ? dn : "-unknown-");
780 d = -1;
781 goto release;
782 }
783 d++;
784 }
785 }
786 release:
787 return d;
788 }
789
790 int reshape_open_backup_file(char *backup_file,
791 int fd,
792 char *devname,
793 long blocks,
794 int *fdlist,
795 unsigned long long *offsets)
796 {
797 /* Return 1 on success, 0 on any form of failure */
798 /* need to check backup file is large enough */
799 char buf[512];
800 struct stat stb;
801 unsigned int dev;
802 int i;
803
804 *fdlist = open(backup_file, O_RDWR|O_CREAT|O_EXCL,
805 S_IRUSR | S_IWUSR);
806 *offsets = 8 * 512;
807 if (*fdlist < 0) {
808 fprintf(stderr, Name ": %s: cannot create backup file %s: %s\n",
809 devname, backup_file, strerror(errno));
810 return 0;
811 }
812 /* Guard against backup file being on array device.
813 * If array is partitioned or if LVM etc is in the
814 * way this will not notice, but it is better than
815 * nothing.
816 */
817 fstat(*fdlist, &stb);
818 dev = stb.st_dev;
819 fstat(fd, &stb);
820 if (stb.st_rdev == dev) {
821 fprintf(stderr, Name ": backup file must NOT be"
822 " on the array being reshaped.\n");
823 close(*fdlist);
824 return 0;
825 }
826
827 memset(buf, 0, 512);
828 for (i=0; i < blocks + 1 ; i++) {
829 if (write(*fdlist, buf, 512) != 512) {
830 fprintf(stderr, Name ": %s: cannot create"
831 " backup file %s: %s\n",
832 devname, backup_file, strerror(errno));
833 return 0;
834 }
835 }
836 if (fsync(*fdlist) != 0) {
837 fprintf(stderr, Name ": %s: cannot create backup file %s: %s\n",
838 devname, backup_file, strerror(errno));
839 return 0;
840 }
841
842 return 1;
843 }
844
845 unsigned long compute_backup_blocks(int nchunk, int ochunk,
846 unsigned int ndata, unsigned int odata)
847 {
848 unsigned long a, b, blocks;
849 /* So how much do we need to backup.
850 * We need an amount of data which is both a whole number of
851 * old stripes and a whole number of new stripes.
852 * So LCM for (chunksize*datadisks).
853 */
854 a = (ochunk/512) * odata;
855 b = (nchunk/512) * ndata;
856 /* Find GCD */
857 while (a != b) {
858 if (a < b)
859 b -= a;
860 if (b < a)
861 a -= b;
862 }
863 /* LCM == product / GCD */
864 blocks = (ochunk/512) * (nchunk/512) * odata * ndata / a;
865
866 return blocks;
867 }
868
869 /* 'struct reshape' records the intermediate states
870 * a general reshape.
871 * The starting geometry is converted to the 'before' geometry
872 * by at most an atomic level change. They could be the same.
873 * Similarly the 'after' geometry is converted to the final
874 * geometry by at most a level change.
875 * Note that 'before' and 'after' must have the same level.
876 * 'blocks' is the minimum number of sectors for a reshape unit.
877 * This will be a multiple of the stripe size in each of the
878 * 'before' and 'after' geometries.
879 * If 'blocks' is 0, no restriping is necessary.
880 */
881 struct reshape {
882 int level;
883 int parity; /* number of parity blocks/devices */
884 struct {
885 int layout;
886 int data_disks;
887 } before, after;
888 unsigned long long blocks;
889 unsigned long long stripes; /* number of old stripes that comprise 'blocks'*/
890 unsigned long long new_size; /* New size of array in sectors */
891 };
892
893 char *analyse_change(struct mdinfo *info, struct reshape *re)
894 {
895 /* Based on the current array state in info->array and
896 * the changes in info->new_* etc, determine:
897 * - whether the change is possible
898 * - Intermediate level/raid_disks/layout
899 * - whether a restriping reshape is needed
900 * - number of sectors in minimum change unit. This
901 * will cover a whole number of stripes in 'before' and
902 * 'after'.
903 *
904 * Return message if the change should be rejected
905 * NULL if the change can be achieved
906 *
907 * This can be called as part of starting a reshape, or
908 * when assembling an array that is undergoing reshape.
909 */
910 int new_disks;
911
912 /* If a new level not explicitly given, we assume no-change */
913 if (info->new_level == UnSet)
914 info->new_level = info->array.level;
915
916 if (info->new_chunk)
917 switch (info->new_level) {
918 case 0:
919 case 4:
920 case 5:
921 case 6:
922 case 10:
923 /* chunk size is meaningful, must divide component_size
924 * evenly
925 */
926 if (info->component_size % (info->new_chunk/512))
927 return "New chunk size does not"
928 " divide component size";
929 break;
930 default:
931 return "chunk size not meaningful for this level";
932 }
933 else
934 info->new_chunk = info->array.chunk_size;
935
936 switch (info->array.level) {
937 case 1:
938 /* RAID1 can convert to RAID1 with different disks, or
939 * raid5 with 2 disks
940 */
941 if (info->new_level == 1) {
942 if (info->delta_disks == UnSet)
943 /* Don't know what to do */
944 return "no change requested for Growing RAID1";
945 re->level = 1;
946 re->before.data_disks = (info->array.raid_disks +
947 info->delta_disks);
948 re->before.layout = 0;
949 re->blocks = 0;
950 re->parity = 0;
951 return NULL;
952 }
953 if (info->array.raid_disks == 2 &&
954 info->array.raid_disks == 5) {
955 /* simple in-place conversion */
956 re->level = 5;
957 re->parity = 1;
958 re->before.data_disks = 1;
959 re->before.layout = ALGORITHM_LEFT_SYMMETRIC;
960 re->blocks = 0;
961 return NULL;
962 }
963 /* Could do some multi-stage conversions, but leave that to
964 * later.
965 */
966 return "Impossibly level change request for RAID1";
967
968 case 10:
969 /* RAID10 can only be converted from near mode to
970 * RAID0 by removing some devices
971 */
972 if ((info->array.layout & ~0xff) != 0x100)
973 return "Cannot Grow RAID10 with far/offset layout";
974 /* number of devices must be multiple of number of copies */
975 if (info->array.raid_disks % (info->array.layout & 0xff))
976 return "RAID10 layout too complex for Grow operation";
977
978 if (info->new_level != 0)
979 return "RAID10 can only be changed to RAID0";
980 new_disks = (info->array.raid_disks
981 / (info->array.layout & 0xff));
982 if (info->delta_disks != UnSet) {
983 info->delta_disks = (new_disks
984 - info->array.raid_disks);
985 }
986 if (info->delta_disks != new_disks - info->array.raid_disks)
987 return "New number of raid-devices impossible for RAID10";
988 if (info->new_chunk &&
989 info->new_chunk != info->array.chunk_size)
990 return "Cannot change chunk-size with RAID10 Grow";
991
992 /* looks good */
993 re->level = 0;
994 re->parity = 0;
995 re->before.data_disks = new_disks;
996 re->before.layout = 0;
997 re->blocks = 0;
998 return NULL;
999
1000 case 0:
1001 /* RAID0 can be converted to RAID10, or to RAID456 */
1002 if (info->new_level == 10) {
1003 if (info->new_layout == UnSet && info->delta_disks == UnSet) {
1004 /* Assume near=2 layout */
1005 info->new_layout = 0x102;
1006 info->delta_disks = info->array.raid_disks;
1007 }
1008 if (info->new_layout == UnSet) {
1009 int copies = 1 + (info->delta_disks
1010 / info->array.raid_disks);
1011 if (info->array.raid_disks * (copies-1)
1012 != info->delta_disks)
1013 return "Impossible number of devices"
1014 " for RAID0->RAID10";
1015 info->new_layout = 0x100 + copies;
1016 }
1017 if (info->delta_disks == UnSet) {
1018 int copies = info->new_layout & 0xff;
1019 if (info->new_layout != 0x100 + copies)
1020 return "New layout impossible"
1021 " for RAID0->RAID10";;
1022 info->delta_disks = (copies - 1) *
1023 info->array.raid_disks;
1024 }
1025 if (info->new_chunk &&
1026 info->new_chunk != info->array.chunk_size)
1027 return "Cannot change chunk-size with RAID0->RAID10";
1028 /* looks good */
1029 re->level = 10;
1030 re->parity = 0;
1031 re->before.data_disks = (info->array.raid_disks +
1032 info->delta_disks);
1033 re->before.layout = info->new_layout;
1034 re->blocks = 0;
1035 return NULL;
1036 }
1037
1038 /* RAID0 can also covert to RAID0/4/5/6 by first converting to
1039 * a raid4 style layout of the final level.
1040 */
1041 switch (info->new_level) {
1042 case 0:
1043 case 4:
1044 re->level = 4;
1045 re->before.layout = 0;
1046 break;
1047 case 5:
1048 re->level = 5;
1049 re->before.layout = ALGORITHM_PARITY_N;
1050 break;
1051 case 6:
1052 re->level = 6;
1053 re->before.layout = ALGORITHM_PARITY_N;
1054 break;
1055 default:
1056 return "Impossible level change requested";
1057 }
1058 re->before.data_disks = info->array.raid_disks;
1059 /* determining 'after' layout happens outside this 'switch' */
1060 break;
1061
1062 case 4:
1063 info->array.layout = ALGORITHM_PARITY_N;
1064 case 5:
1065 switch (info->new_level) {
1066 case 4:
1067 re->level = info->array.level;
1068 re->before.data_disks = info->array.raid_disks - 1;
1069 re->before.layout = info->array.layout;
1070 break;
1071 case 5:
1072 re->level = 5;
1073 re->before.data_disks = info->array.raid_disks - 1;
1074 re->before.layout = info->array.layout;
1075 break;
1076 case 6:
1077 re->level = 6;
1078 re->before.data_disks = info->array.raid_disks - 1;
1079 switch (info->array.layout) {
1080 case ALGORITHM_LEFT_ASYMMETRIC:
1081 re->before.layout = ALGORITHM_LEFT_ASYMMETRIC_6;
1082 break;
1083 case ALGORITHM_RIGHT_ASYMMETRIC:
1084 re->before.layout = ALGORITHM_RIGHT_ASYMMETRIC_6;
1085 break;
1086 case ALGORITHM_LEFT_SYMMETRIC:
1087 re->before.layout = ALGORITHM_LEFT_SYMMETRIC_6;
1088 break;
1089 case ALGORITHM_RIGHT_SYMMETRIC:
1090 re->before.layout = ALGORITHM_RIGHT_SYMMETRIC_6;
1091 break;
1092 case ALGORITHM_PARITY_0:
1093 re->before.layout = ALGORITHM_PARITY_0_6;
1094 break;
1095 case ALGORITHM_PARITY_N:
1096 re->before.layout = ALGORITHM_PARITY_N_6;
1097 break;
1098 default:
1099 return "Cannot convert an array with this layout";
1100 }
1101 break;
1102 case 1:
1103 if (info->array.raid_disks != 2)
1104 return "Can only convert a 2-device array to RAID1";
1105 re->level = 1;
1106 re->before.data_disks = 2;
1107 re->before.layout = 0;
1108 break;
1109 default:
1110 return "Impossible level change requested";
1111 }
1112 break;
1113 case 6:
1114 switch (info->new_level) {
1115 case 4:
1116 case 5:
1117 case 6:
1118 re->level = 6;
1119 re->before.data_disks = info->array.raid_disks - 2;
1120 re->before.layout = info->array.layout;
1121 break;
1122 default:
1123 return "Impossible level change requested";
1124 }
1125 break;
1126 }
1127
1128 /* If we reached here then it looks like a re-stripe is
1129 * happening. We have determined the intermediate level
1130 * and initial raid_disks/layout and stored these in 're'.
1131 *
1132 * We need to deduce the final layout that can be atomically
1133 * converted to the end state.
1134 */
1135 switch (info->new_level) {
1136 case 0:
1137 /* We can only get to RAID0 from RAID4 or RAID5
1138 * with appropriate layout and one extra device
1139 */
1140 if (re->level != 4 && re->level != 5)
1141 return "Cannot covert to RAID0 from this level";
1142 if (info->delta_disks == UnSet)
1143 re->after.data_disks = re->before.data_disks;
1144 else
1145 re->after.data_disks =
1146 info->array.raid_disks + info->delta_disks;
1147 switch (re->level) {
1148 case 4:
1149 re->after.layout = 0 ; break;
1150 case 5:
1151 re->after.layout = ALGORITHM_PARITY_N; break;
1152 }
1153 break;
1154
1155 case 4:
1156 /* We can only get to RAID4 from RAID5 */
1157 if (re->level != 4 && re->level != 5)
1158 return "Cannot convert to RAID4 from this level";
1159 if (info->delta_disks == UnSet)
1160 re->after.data_disks = re->before.data_disks;
1161 else
1162 re->after.data_disks =
1163 re->before.data_disks + info->delta_disks;
1164 switch (re->level) {
1165 case 4:
1166 re->after.layout = 0 ; break;
1167 case 5:
1168 re->after.layout = ALGORITHM_PARITY_N; break;
1169 }
1170 break;
1171
1172 case 5:
1173 /* We get to RAID5 for RAID5 or RAID6 */
1174 if (re->level != 5 && re->level != 6)
1175 return "Cannot convert to RAID5 from this level";
1176 if (info->delta_disks == UnSet)
1177 re->after.data_disks = re->before.data_disks;
1178 else if (re->level == 5)
1179 re->after.data_disks =
1180 re->before.data_disks + info->delta_disks;
1181 else
1182 re->after.data_disks =
1183 info->array.raid_disks + info->delta_disks - 1;
1184 switch (re->level) {
1185 case 5:
1186 if (info->new_layout == UnSet)
1187 re->after.layout = re->before.layout;
1188 else
1189 re->after.layout = info->new_layout;
1190 break;
1191 case 6:
1192 if (info->new_layout == UnSet) {
1193 re->after.layout = re->before.layout;
1194 break;
1195 }
1196 /* after.layout needs to be raid6 version of new_layout */
1197 if (info->new_layout == ALGORITHM_PARITY_N)
1198 re->after.layout = ALGORITHM_PARITY_N;
1199 else {
1200 char layout[40];
1201 char *ls = map_num(r5layout, info->new_layout);
1202 int l;
1203 strcat(strcpy(layout, ls), "-6");
1204 l = map_name(r6layout, layout);
1205 if (l == UnSet)
1206 return "Cannot find RAID6 layout"
1207 " to convert to";
1208 re->after.layout = l;
1209 }
1210 }
1211 break;
1212
1213 case 6:
1214 /* We must already be at level 6 */
1215 if (re->level != 6)
1216 return "Impossible level change";
1217 if (info->delta_disks == UnSet)
1218 re->after.data_disks = re->before.data_disks;
1219 else
1220 re->after.data_disks = (info->array.raid_disks +
1221 info->delta_disks) - 2;
1222 if (info->new_layout == UnSet)
1223 re->after.layout = re->before.layout;
1224 else
1225 re->after.layout = info->new_layout;
1226 break;
1227 default:
1228 return "Impossible level change requested";
1229 }
1230 switch (re->level) {
1231 case 6: re->parity = 2; break;
1232 case 4:
1233 case 5: re->parity = 1; break;
1234 default: re->parity = 0; break;
1235 }
1236 /* So we have a restripe operation, we need to calculate the number
1237 * of blocks per reshape operation.
1238 */
1239 if (info->new_chunk == 0)
1240 info->new_chunk = info->array.chunk_size;
1241 if (re->after.data_disks == re->before.data_disks &&
1242 re->after.layout == re->before.layout &&
1243 info->new_chunk == info->array.chunk_size) {
1244 /* Nothing to change */
1245 re->blocks = 0;
1246 return NULL;
1247 }
1248 if (re->after.data_disks == 1 && re->before.data_disks == 1) {
1249 /* chunks can layout changes make no difference */
1250 re->blocks = 0;
1251 return NULL;
1252 }
1253
1254 if (re->after.data_disks == re->before.data_disks &&
1255 get_linux_version() < 2006032)
1256 return "in-place reshape is not safe before 2.6.32 - sorry.";
1257
1258 if (re->after.data_disks < re->before.data_disks &&
1259 get_linux_version() < 2006030)
1260 return "reshape to fewer devices is not supported before 2.6.32 - sorry.";
1261
1262 re->blocks = compute_backup_blocks(
1263 info->new_chunk, info->array.chunk_size,
1264 re->after.data_disks,
1265 re->before.data_disks);
1266
1267 re->new_size = info->component_size * re->after.data_disks;
1268 return NULL;
1269 }
1270
1271 static int reshape_array(char *container, int fd, char *devname,
1272 struct supertype *st, struct mdinfo *info,
1273 int force, char *backup_file, int quiet, int forked);
1274 static int reshape_container(char *container, int cfd, char *devname,
1275 struct supertype *st,
1276 struct mdinfo *info,
1277 int force,
1278 char *backup_file,
1279 int quiet);
1280 static int child_monitor(int afd, struct mdinfo *sra, struct reshape *reshape,
1281 unsigned long stripes,
1282 int *fds, unsigned long long *offsets,
1283 int dests, int *destfd, unsigned long long *destoffsets);
1284
1285
1286 int Grow_reshape(char *devname, int fd, int quiet, char *backup_file,
1287 long long size,
1288 int level, char *layout_str, int chunksize, int raid_disks,
1289 int force)
1290 {
1291 /* Make some changes in the shape of an array.
1292 * The kernel must support the change.
1293 *
1294 * There are three different changes. Each can trigger
1295 * a resync or recovery so we freeze that until we have
1296 * requested everything (if kernel supports freezing - 2.6.30).
1297 * The steps are:
1298 * - change size (i.e. component_size)
1299 * - change level
1300 * - change layout/chunksize/ndisks
1301 *
1302 * The last can require a reshape. It is different on different
1303 * levels so we need to check the level before actioning it.
1304 * Some times the level change needs to be requested after the
1305 * reshape (e.g. raid6->raid5, raid5->raid0)
1306 *
1307 */
1308 struct mdu_array_info_s array;
1309 int rv = 0;
1310 struct supertype *st;
1311 char *subarray = NULL;
1312
1313 int frozen;
1314 int changed = 0;
1315 char *container = NULL;
1316 char container_buf[20];
1317 int cfd = -1;
1318
1319 struct mdinfo info;
1320 struct mdinfo *sra;
1321
1322 if (ioctl(fd, GET_ARRAY_INFO, &array) < 0) {
1323 fprintf(stderr, Name ": %s is not an active md array - aborting\n",
1324 devname);
1325 return 1;
1326 }
1327
1328 if (size >= 0 &&
1329 (chunksize || level!= UnSet || layout_str || raid_disks)) {
1330 fprintf(stderr, Name ": cannot change component size at the same time "
1331 "as other changes.\n"
1332 " Change size first, then check data is intact before "
1333 "making other changes.\n");
1334 return 1;
1335 }
1336
1337 if (raid_disks && raid_disks < array.raid_disks && array.level > 1 &&
1338 get_linux_version() < 2006032 &&
1339 !check_env("MDADM_FORCE_FEWER")) {
1340 fprintf(stderr, Name ": reducing the number of devices is not safe before Linux 2.6.32\n"
1341 " Please use a newer kernel\n");
1342 return 1;
1343 }
1344
1345 st = super_by_fd(fd, &subarray);
1346 if (!st) {
1347 fprintf(stderr, Name ": Unable to determine metadata format for %s\n", devname);
1348 return 1;
1349 }
1350 if (raid_disks > st->max_devs) {
1351 fprintf(stderr, Name ": Cannot increase raid-disks on this array"
1352 " beyond %d\n", st->max_devs);
1353 return 1;
1354 }
1355
1356 /* in the external case we need to check that the requested reshape is
1357 * supported, and perform an initial check that the container holds the
1358 * pre-requisite spare devices (mdmon owns final validation)
1359 */
1360 if (st->ss->external) {
1361 int container_dev;
1362 int rv;
1363
1364 if (subarray) {
1365 container_dev = st->container_dev;
1366 cfd = open_dev_excl(st->container_dev);
1367 } else {
1368 container_dev = st->devnum;
1369 close(fd);
1370 cfd = open_dev_excl(st->devnum);
1371 fd = cfd;
1372 }
1373 if (cfd < 0) {
1374 fprintf(stderr, Name ": Unable to open container for %s\n",
1375 devname);
1376 free(subarray);
1377 return 1;
1378 }
1379
1380 fmt_devname(container_buf, container_dev);
1381 container = container_buf;
1382
1383 if (subarray)
1384 rv = st->ss->load_container(st, cfd, NULL);
1385 else
1386 rv = st->ss->load_super(st, cfd, NULL);
1387 if (rv) {
1388 fprintf(stderr, Name ": Cannot read superblock for %s\n",
1389 devname);
1390 free(subarray);
1391 return 1;
1392 }
1393
1394 if (mdmon_running(container_dev))
1395 st->update_tail = &st->updates;
1396 }
1397
1398 if (raid_disks > array.raid_disks &&
1399 array.spare_disks < (raid_disks - array.raid_disks) &&
1400 !force) {
1401 fprintf(stderr,
1402 Name ": Need %d spare%s to avoid degraded array,"
1403 " and only have %d.\n"
1404 " Use --force to over-ride this check.\n",
1405 raid_disks - array.raid_disks,
1406 raid_disks - array.raid_disks == 1 ? "" : "s",
1407 array.spare_disks);
1408 return 1;
1409 }
1410
1411 sra = sysfs_read(fd, 0, GET_LEVEL | GET_DISKS | GET_DEVS | GET_STATE);
1412 if (sra) {
1413 if (st->ss->external && subarray == NULL) {
1414 array.level = LEVEL_CONTAINER;
1415 sra->array.level = LEVEL_CONTAINER;
1416 }
1417 } else {
1418 fprintf(stderr, Name ": failed to read sysfs parameters for %s\n",
1419 devname);
1420 return 1;
1421 }
1422 frozen = freeze(st);
1423 if (frozen < -1) {
1424 /* freeze() already spewed the reason */
1425 return 1;
1426 } else if (frozen < 0) {
1427 fprintf(stderr, Name ": %s is performing resync/recovery and cannot"
1428 " be reshaped\n", devname);
1429 return 1;
1430 }
1431
1432 /* ========= set size =============== */
1433 if (size >= 0 && (size == 0 || size != array.size)) {
1434 long long orig_size = array.size;
1435
1436 if (reshape_super(st, size, UnSet, UnSet, 0, 0, NULL, devname, !quiet)) {
1437 rv = 1;
1438 goto release;
1439 }
1440 sync_metadata(st);
1441 array.size = size;
1442 if (array.size != size) {
1443 /* got truncated to 32bit, write to
1444 * component_size instead
1445 */
1446 if (sra)
1447 rv = sysfs_set_num(sra, NULL,
1448 "component_size", size);
1449 else
1450 rv = -1;
1451 } else
1452 rv = ioctl(fd, SET_ARRAY_INFO, &array);
1453 if (rv != 0) {
1454 int err = errno;
1455
1456 /* restore metadata */
1457 if (reshape_super(st, orig_size, UnSet, UnSet, 0, 0,
1458 NULL, devname, !quiet) == 0)
1459 sync_metadata(st);
1460 fprintf(stderr, Name ": Cannot set device size for %s: %s\n",
1461 devname, strerror(err));
1462 if (err == EBUSY &&
1463 (array.state & (1<<MD_SB_BITMAP_PRESENT)))
1464 fprintf(stderr, " Bitmap must be removed before size can be changed\n");
1465 rv = 1;
1466 goto release;
1467 }
1468 ioctl(fd, GET_ARRAY_INFO, &array);
1469 size = get_component_size(fd)/2;
1470 if (size == 0)
1471 size = array.size;
1472 if (!quiet)
1473 fprintf(stderr, Name ": component size of %s has been set to %lluK\n",
1474 devname, size);
1475 changed = 1;
1476 } else if (array.level != LEVEL_CONTAINER) {
1477 size = get_component_size(fd)/2;
1478 if (size == 0)
1479 size = array.size;
1480 }
1481
1482 /* ========= check for Raid10 -> Raid0 conversion ===============
1483 * current implementation assumes that following conditions must be met:
1484 * - far_copies == 1
1485 * - near_copies == 2
1486 */
1487 if (level == 0 && array.level == 10 && sra &&
1488 array.layout == ((1 << 8) + 2) && !(array.raid_disks & 1)) {
1489 int err;
1490 err = remove_disks_on_raid10_to_raid0_takeover(st, sra, array.layout);
1491 if (err) {
1492 dprintf(Name": Array cannot be reshaped\n");
1493 if (cfd > -1)
1494 close(cfd);
1495 rv = 1;
1496 goto release;
1497 }
1498 }
1499
1500 info.array = array;
1501 sysfs_init(&info, fd, NoMdDev);
1502 info.component_size = size*2;
1503 info.new_level = level;
1504 info.new_chunk = chunksize * 1024;
1505 if (raid_disks)
1506 info.delta_disks = raid_disks - info.array.raid_disks;
1507 else
1508 info.delta_disks = UnSet;
1509 if (layout_str == NULL) {
1510 info.new_layout = UnSet;
1511 if (info.array.level == 6 &&
1512 (info.new_level == 6 || info.new_level == UnSet) &&
1513 info.array.layout >= 16) {
1514 fprintf(stderr, Name
1515 ": %s has a non-standard layout. If you"
1516 " wish to preserve this\n"
1517 " during the reshape, please specify"
1518 " --layout=preserve\n"
1519 " If you want to change it, specify a"
1520 " layout or use --layout=normalise\n",
1521 devname);
1522 rv = 1;
1523 goto release;
1524 }
1525 } else if (strcmp(layout_str, "normalise") == 0 ||
1526 strcmp(layout_str, "normalize") == 0) {
1527 /* If we have a -6 RAID6 layout, remove the '-6'. */
1528 info.new_layout = UnSet;
1529 if (info.array.level == 6 && info.new_level == UnSet) {
1530 char l[40], *h;
1531 strcpy(l, map_num(r6layout, info.array.layout));
1532 h = strrchr(l, '-');
1533 if (h && strcmp(h, "-6") == 0) {
1534 *h = 0;
1535 info.new_layout = map_name(r6layout, l);
1536 }
1537 }
1538 } else if (strcmp(layout_str, "preserve") == 0) {
1539 info.new_layout = UnSet;
1540 } else {
1541 int l = info.new_level;
1542 if (l == UnSet)
1543 l = info.array.level;
1544 switch (l) {
1545 case 5:
1546 info.new_layout = map_name(r5layout, layout_str);
1547 break;
1548 case 6:
1549 info.new_layout = map_name(r6layout, layout_str);
1550 break;
1551 case 10:
1552 info.new_layout = parse_layout_10(layout_str);
1553 break;
1554 case LEVEL_FAULTY:
1555 info.new_layout = parse_layout_faulty(layout_str);
1556 break;
1557 default:
1558 fprintf(stderr, Name ": layout not meaningful"
1559 " with this level\n");
1560 rv = 1;
1561 goto release;
1562 }
1563 if (info.new_layout == UnSet) {
1564 fprintf(stderr, Name ": layout %s not understood"
1565 " for this level\n",
1566 layout_str);
1567 rv = 1;
1568 goto release;
1569 }
1570 }
1571
1572 if (array.level == LEVEL_CONTAINER) {
1573 /* This change is to be applied to every array in the
1574 * container. This is only needed when the metadata imposes
1575 * restraints of the various arrays in the container.
1576 * Currently we only know that IMSM requires all arrays
1577 * to have the same number of devices so changing the
1578 * number of devices (On-Line Capacity Expansion) must be
1579 * performed at the level of the container
1580 */
1581 rv = reshape_container(container, fd, devname, st, &info,
1582 force, backup_file, quiet);
1583 } else {
1584 /* Impose these changes on a single array. First
1585 * check that the metadata is OK with the change. */
1586
1587 if (reshape_super(st, info.component_size, info.new_level,
1588 info.new_layout, info.new_chunk,
1589 info.array.raid_disks + info.delta_disks,
1590 backup_file, devname, quiet)) {
1591 rv = 1;
1592 goto release;
1593 }
1594 sync_metadata(st);
1595 rv = reshape_array(container, fd, devname, st, &info, force,
1596 backup_file, quiet, 0);
1597 }
1598 release:
1599 unfreeze(st, frozen);
1600 return rv;
1601 }
1602
1603 static int reshape_array(char *container, int fd, char *devname,
1604 struct supertype *st, struct mdinfo *info,
1605 int force,
1606 char *backup_file, int quiet, int forked)
1607 {
1608 struct reshape reshape;
1609 int spares_needed;
1610 char *msg;
1611 int orig_level = UnSet;
1612 int disks, odisks;
1613
1614 struct mdu_array_info_s array;
1615 char *c;
1616 int rv = 0;
1617
1618 int *fdlist;
1619 unsigned long long *offsets;
1620 int d;
1621 int nrdisks;
1622 int err;
1623 int frozen;
1624 unsigned long blocks, stripes;
1625 unsigned long cache;
1626 unsigned long long array_size;
1627 int done;
1628 struct mdinfo *sra, *sd;
1629
1630 msg = analyse_change(info, &reshape);
1631 if (msg) {
1632 fprintf(stderr, Name ": %s\n", msg);
1633 return 1;
1634 }
1635 if (ioctl(fd, GET_ARRAY_INFO, &array) != 0) {
1636 dprintf("Canot get array information.\n");
1637 return 1;
1638 }
1639 spares_needed = max(reshape.before.data_disks,
1640 reshape.after.data_disks)
1641 + reshape.parity - array.raid_disks;
1642
1643 if (!force && spares_needed < info->array.spare_disks) {
1644 fprintf(stderr,
1645 Name ": Need %d spare%s to avoid degraded array,"
1646 " and only have %d.\n"
1647 " Use --force to over-ride this check.\n",
1648 spares_needed,
1649 spares_needed == 1 ? "" : "s",
1650 info->array.spare_disks);
1651 return 1;
1652 }
1653
1654 if (reshape.level != info->array.level) {
1655 char *c = map_num(pers, reshape.level);
1656 int err;
1657 if (c == NULL)
1658 return 1; /* This should not be possible */
1659
1660 err = sysfs_set_str(info, NULL, "level", c);
1661 if (err) {
1662 err = errno;
1663 fprintf(stderr, Name ": %s: could not set level to %s\n",
1664 devname, c);
1665 if (err == EBUSY &&
1666 (info->array.state & (1<<MD_SB_BITMAP_PRESENT)))
1667 fprintf(stderr, " Bitmap must be removed"
1668 " before level can be changed\n");
1669 return 1;
1670 }
1671 if (!quiet)
1672 fprintf(stderr, Name " level of %s changed to %s\n",
1673 devname, c);
1674 orig_level = info->array.level;
1675 }
1676
1677 if (reshape.level > 0 && st->ss->external &&
1678 !mdmon_running(st->container_dev)) {
1679 start_mdmon(st->container_dev);
1680 ping_monitor(container);
1681 }
1682
1683 /* ->reshape_super might have chosen some spares from the
1684 * container that it wants to be part of the new array.
1685 * We can collect them with ->container_content and give
1686 * them to the kernel.
1687 */
1688 if (st->ss->reshape_super && st->ss->container_content) {
1689 char *subarray = strchr(info->text_version+1, '/')+1;
1690 struct mdinfo *info2 =
1691 st->ss->container_content(st, subarray);
1692 struct mdinfo *d;
1693
1694 if (info2)
1695 for (d = info2->devs; d; d = d->next) {
1696 if (d->disk.state == 0 &&
1697 d->disk.raid_disk >= 0) {
1698 /* This is a spare that wants to
1699 * be part of the array.
1700 */
1701 add_disk(fd, st, info2, d);
1702 }
1703 }
1704 sysfs_free(info2);
1705 }
1706
1707 if (reshape.blocks == 0) {
1708 /* No restriping needed, but we might need to impose
1709 * some more changes: layout, raid_disks, chunk_size
1710 */
1711 if (info->new_layout != UnSet &&
1712 info->new_layout != info->array.layout) {
1713 info->array.layout = info->new_layout;
1714 if (ioctl(fd, SET_ARRAY_INFO, &info->array) != 0) {
1715 fprintf(stderr, Name ": failed to set new layout\n");
1716 rv = 1;
1717 } else if (!quiet)
1718 printf("layout for %s set to %d\n",
1719 devname, info->array.layout);
1720 }
1721 if (info->delta_disks != UnSet &&
1722 info->delta_disks != 0) {
1723 info->array.raid_disks += info->delta_disks;
1724 if (ioctl(fd, SET_ARRAY_INFO, &info->array) != 0) {
1725 fprintf(stderr, Name ": failed to set raid disks\n");
1726 rv = 1;
1727 } else if (!quiet)
1728 printf("raid_disks for %s set to %d\n",
1729 devname, info->array.raid_disks);
1730 }
1731 if (info->new_chunk != 0 &&
1732 info->new_chunk != info->array.chunk_size) {
1733 if (sysfs_set_num(info, NULL,
1734 "chunk_size", info->new_chunk) != 0) {
1735 fprintf(stderr, Name ": failed to set chunk size\n");
1736 rv = 1;
1737 } else if (!quiet)
1738 printf("chunk size for %s set to %d\n",
1739 devname, info->array.chunk_size);
1740 }
1741
1742 return rv;
1743 }
1744
1745 /*
1746 * There are three possibilities.
1747 * 1/ The array will shrink.
1748 * We need to ensure the reshape will pause before reaching
1749 * the 'critical section'. We also need to fork and wait for
1750 * that to happen. When it does we
1751 * suspend/backup/complete/unfreeze
1752 *
1753 * 2/ The array will not change size.
1754 * This requires that we keep a backup of a sliding window
1755 * so that we can restore data after a crash. So we need
1756 * to fork and monitor progress.
1757 * In future we will allow the data_offset to change, so
1758 * a sliding backup becomes unnecessary.
1759 *
1760 * 3/ The array will grow. This is relatively easy.
1761 * However the kernel's restripe routines will cheerfully
1762 * overwrite some early data before it is safe. So we
1763 * need to make a backup of the early parts of the array
1764 * and be ready to restore it if rebuild aborts very early.
1765 * For externally managed metadata, we still need a forked
1766 * child to monitor the reshape and suspend IO over the region
1767 * that is being reshaped.
1768 *
1769 * We backup data by writing it to one spare, or to a
1770 * file which was given on command line.
1771 *
1772 * In each case, we first make sure that storage is available
1773 * for the required backup.
1774 * Then we:
1775 * - request the shape change.
1776 * - fork to handle backup etc.
1777 */
1778
1779 /* Check that we can hold all the data */
1780 get_dev_size(fd, NULL, &array_size);
1781 if (reshape.new_size < (array_size/512)) {
1782 fprintf(stderr,
1783 Name ": this change will reduce the size of the array.\n"
1784 " use --grow --array-size first to truncate array.\n"
1785 " e.g. mdadm --grow %s --array-size %llu\n",
1786 devname, reshape.new_size/2);
1787 rv = 1;
1788 goto release;
1789 }
1790
1791 sra = sysfs_read(fd, 0,
1792 GET_COMPONENT|GET_DEVS|GET_OFFSET|GET_STATE||GET_CHUNK|
1793 GET_CACHE);
1794
1795 if (!sra) {
1796 fprintf(stderr, Name ": %s: Cannot get array details from sysfs\n",
1797 devname);
1798 rv = 1;
1799 goto release;
1800 }
1801
1802 /* Decide how many blocks (sectors) for a reshape
1803 * unit. The number we have so far is just a minimum
1804 */
1805 blocks = reshape.blocks;
1806 if (reshape.before.data_disks ==
1807 reshape.after.data_disks) {
1808 /* Make 'blocks' bigger for better throughput, but
1809 * not so big that we reject it below.
1810 * Try for 16 megabytes
1811 */
1812 while (blocks * 32 < sra->component_size &&
1813 blocks < 16*1024*2)
1814 blocks *= 2;
1815 } else
1816 fprintf(stderr, Name ": Need to backup %luK of critical "
1817 "section..\n", blocks/2);
1818
1819 if (blocks >= sra->component_size/2) {
1820 fprintf(stderr, Name ": %s: Something wrong"
1821 " - reshape aborted\n",
1822 devname);
1823 rv = 1;
1824 goto release;
1825 }
1826
1827 /* Now we need to open all these devices so we can read/write.
1828 */
1829 nrdisks = array.raid_disks + sra->array.spare_disks;
1830 fdlist = malloc((1+nrdisks) * sizeof(int));
1831 offsets = malloc((1+nrdisks) * sizeof(offsets[0]));
1832 if (!fdlist || !offsets) {
1833 fprintf(stderr, Name ": malloc failed: grow aborted\n");
1834 rv = 1;
1835 goto release;
1836 }
1837
1838 d = reshape_prepare_fdlist(devname, sra, array.raid_disks,
1839 nrdisks, blocks, backup_file,
1840 fdlist, offsets);
1841 if (d < 0) {
1842 rv = 1;
1843 goto release;
1844 }
1845 if (backup_file == NULL) {
1846 if (reshape.after.data_disks <= reshape.before.data_disks) {
1847 fprintf(stderr,
1848 Name ": %s: Cannot grow - need backup-file\n",
1849 devname);
1850 rv = 1;
1851 goto release;
1852 } else if (sra->array.spare_disks == 0) {
1853 fprintf(stderr, Name ": %s: Cannot grow - need a spare or "
1854 "backup-file to backup critical section\n",
1855 devname);
1856 rv = 1;
1857 goto release;
1858 }
1859 } else {
1860 if (!reshape_open_backup_file(backup_file, fd, devname,
1861 (signed)blocks,
1862 fdlist+d, offsets+d)) {
1863 rv = 1;
1864 goto release;
1865 }
1866 d++;
1867 }
1868
1869 /* lastly, check that the internal stripe cache is
1870 * large enough, or it won't work.
1871 * It must hold at least 4 stripes of the larger
1872 * chunk size
1873 */
1874 cache = max(info->array.chunk_size, info->new_chunk);
1875 cache *= 4; /* 4 stripes minimum */
1876 cache /= 512; /* convert to sectors */
1877 disks = min(reshape.before.data_disks, reshape.after.data_disks);
1878 /* make sure there is room for 'blocks' with a bit to spare */
1879 if (cache < 16 + blocks / disks)
1880 cache = 16 + blocks / disks;
1881 cache /= (4096/512); /* Covert from sectors to pages */
1882
1883 if (sra->cache_size < cache)
1884 subarray_set_num(container, sra, "stripe_cache_size",
1885 cache+1);
1886
1887 /* Right, everything seems fine. Let's kick things off.
1888 * If only changing raid_disks, use ioctl, else use
1889 * sysfs.
1890 */
1891 sync_metadata(st);
1892
1893 if (info->array.chunk_size == info->new_chunk &&
1894 reshape.before.layout == reshape.after.layout &&
1895 st->ss->external == 0) {
1896 array.raid_disks = reshape.after.data_disks + reshape.parity;
1897 if (ioctl(fd, SET_ARRAY_INFO, &array) != 0) {
1898 int err = errno;
1899 rv = 1;
1900 fprintf(stderr,
1901 Name ": Cannot set device shape for %s: %s\n",
1902 devname, strerror(errno));
1903
1904 if (err == EBUSY &&
1905 (array.state & (1<<MD_SB_BITMAP_PRESENT)))
1906 fprintf(stderr,
1907 " Bitmap must be removed before"
1908 " shape can be changed\n");
1909
1910 goto release;
1911 }
1912 } else {
1913 /* set them all just in case some old 'new_*' value
1914 * persists from some earlier problem
1915 */
1916 int err = err; /* only used if rv==1, and always set if
1917 * rv==1, so initialisation not needed,
1918 * despite gcc warning
1919 */
1920 if (sysfs_set_num(sra, NULL, "chunk_size", info->new_chunk) < 0)
1921 rv = 1, err = errno;
1922 if (!rv && sysfs_set_num(sra, NULL, "layout",
1923 reshape.after.layout) < 0)
1924 rv = 1, err = errno;
1925 if (!rv && subarray_set_num(container, sra, "raid_disks",
1926 reshape.after.data_disks +
1927 reshape.parity) < 0)
1928 rv = 1, err = errno;
1929 if (rv) {
1930 fprintf(stderr, Name ": Cannot set device shape for %s\n",
1931 devname);
1932
1933 if (err == EBUSY &&
1934 (array.state & (1<<MD_SB_BITMAP_PRESENT)))
1935 fprintf(stderr,
1936 " Bitmap must be removed before"
1937 " shape can be changed\n");
1938 goto release;
1939 }
1940 }
1941
1942 start_reshape(sra);
1943 if (st->ss->external) {
1944 /* metadata handler takes it from here */
1945 ping_manager(container);
1946 st->ss->manage_reshape(st, backup_file);
1947 frozen = 0;
1948 goto release;
1949 }
1950
1951 /* set up the backup-super-block. This requires the
1952 * uuid from the array.
1953 */
1954 /* Find a superblock */
1955 for (sd = sra->devs; sd; sd = sd->next) {
1956 char *dn;
1957 int devfd;
1958 int ok;
1959 if (sd->disk.state & (1<<MD_DISK_FAULTY))
1960 continue;
1961 dn = map_dev(sd->disk.major, sd->disk.minor, 1);
1962 devfd = dev_open(dn, O_RDONLY);
1963 if (devfd < 0)
1964 continue;
1965 ok = st->ss->load_super(st, devfd, NULL);
1966 close(devfd);
1967 if (ok >= 0)
1968 break;
1969 }
1970 if (!sd) {
1971 fprintf(stderr, Name ": %s: Cannot find a superblock\n",
1972 devname);
1973 rv = 1;
1974 abort_reshape(sra);
1975 goto release;
1976 }
1977
1978 memset(&bsb, 0, 512);
1979 memcpy(bsb.magic, "md_backup_data-1", 16);
1980 st->ss->uuid_from_super(st, (int*)&bsb.set_uuid);
1981 bsb.mtime = __cpu_to_le64(time(0));
1982 bsb.devstart2 = blocks;
1983
1984 stripes = reshape.blocks / (info->array.chunk_size/512) /
1985 reshape.before.data_disks;
1986
1987 /* Now we just need to kick off the reshape and watch, while
1988 * handling backups of the data...
1989 * This is all done by a forked background process.
1990 */
1991 switch(forked ? 0 : fork()) {
1992 case 0:
1993 close(fd);
1994 if (check_env("MDADM_GROW_VERIFY"))
1995 fd = open(devname, O_RDONLY | O_DIRECT);
1996 else
1997 fd = -1;
1998 mlockall(MCL_FUTURE);
1999
2000 odisks = reshape.before.data_disks + reshape.parity;
2001
2002 done = child_monitor(fd, sra, &reshape, stripes,
2003 fdlist, offsets,
2004 d - odisks, fdlist+odisks, offsets+odisks);
2005
2006 if (backup_file && done)
2007 unlink(backup_file);
2008 if (!done) {
2009 abort_reshape(sra);
2010 goto out;
2011 }
2012 /* set new array size if required customer_array_size is used
2013 * by this metadata.
2014 */
2015 if (reshape.before.data_disks !=
2016 reshape.after.data_disks &&
2017 info->custom_array_size) {
2018 struct mdinfo *info2;
2019 char *subarray = strchr(info->text_version+1, '/')+1;
2020
2021 wait_reshape(sra);
2022 ping_monitor(container);
2023
2024 info2 = st->ss->container_content(st, subarray);
2025 if (info2) {
2026 unsigned long long current_size = 0;
2027 unsigned long long new_size =
2028 info2->custom_array_size/2;
2029
2030 if (sysfs_get_ll(sra,
2031 NULL,
2032 "array_size",
2033 &current_size) == 0 &&
2034 new_size > current_size) {
2035 if (sysfs_set_num(sra, NULL,
2036 "array_size", new_size)
2037 < 0)
2038 dprintf("Error: Cannot"
2039 " set array size");
2040 else
2041 dprintf("Array size "
2042 "changed");
2043 dprintf(" from %llu to %llu.\n",
2044 current_size, new_size);
2045 }
2046 sysfs_free(info2);
2047 }
2048 }
2049
2050 if (info->new_level != reshape.level) {
2051 /* We need to wait for the reshape to finish
2052 * (which will have happened unless
2053 * odata < ndata) and then set the level
2054 */
2055
2056 if (reshape.before.data_disks <
2057 reshape.after.data_disks)
2058 wait_reshape(sra);
2059
2060 c = map_num(pers, info->new_level);
2061 if (c == NULL) {
2062 if (forked)
2063 return 1;
2064 exit(0);/* not possible */
2065 }
2066
2067 err = sysfs_set_str(sra, NULL, "level", c);
2068 if (err)
2069 fprintf(stderr, Name\
2070 ": %s: could not set level"
2071 "to %s\n", devname, c);
2072 }
2073 out:
2074 if (forked)
2075 return 0;
2076 exit(0);
2077 case -1:
2078 fprintf(stderr, Name ": Cannot run child to monitor reshape: %s\n",
2079 strerror(errno));
2080 rv = 1;
2081 abort_reshape(sra);
2082 break;
2083 default:
2084 /* The child will take care of unfreezing the array */
2085 frozen = 0;
2086 break;
2087 }
2088
2089
2090 release:
2091 if (rv) {
2092 unfreeze(st, frozen);
2093 return rv;
2094 }
2095 if (container)
2096 ping_monitor(container);
2097 if (st->ss->external) {
2098 /* Re-load the metadata as much could have changed */
2099 int cfd = open_dev(st->container_dev);
2100 if (cfd >= 0) {
2101 st->ss->free_super(st);
2102 st->ss->load_container(st, cfd, container);
2103 close(cfd);
2104 }
2105 }
2106 if (rv && orig_level != UnSet && sra) {
2107 c = map_num(pers, orig_level);
2108 if (c && sysfs_set_str(sra, NULL, "level", c) == 0)
2109 fprintf(stderr, Name ": aborting level change\n");
2110 }
2111 unfreeze(st, frozen);
2112 return rv;
2113 }
2114
2115 int reshape_container(char *container, int cfd, char *devname,
2116 struct supertype *st,
2117 struct mdinfo *info,
2118 int force,
2119 char *backup_file,
2120 int quiet)
2121 {
2122 struct mdinfo *cc = NULL;
2123
2124 if (reshape_super(st, info->component_size, info->new_level,
2125 info->new_layout, info->new_chunk,
2126 info->array.raid_disks + info->delta_disks,
2127 backup_file, devname, quiet))
2128 return 1;
2129
2130 sync_metadata(st);
2131
2132 /* ping monitor to be sure that update is on disk
2133 */
2134 ping_monitor(container);
2135
2136 switch (fork()) {
2137 case -1: /* error */
2138 perror("Cannot fork to complete reshape\n");
2139 return 1;
2140 default: /* parent */
2141 printf(Name ": multi-array reshape continues in background\n");
2142 return 0;
2143 case 0: /* child */
2144 break;
2145 }
2146
2147 while(1) {
2148 /* For each member array with reshape_active,
2149 * we need to perform the reshape.
2150 * We pick the first array that needs reshaping and
2151 * reshape it. reshape_array() will re-read the metadata
2152 * so the next time through a different array should be
2153 * ready for reshape.
2154 */
2155 struct mdinfo *content;
2156 int rv;
2157 int fd;
2158 struct mdstat_ent *mdstat;
2159 char *adev;
2160
2161 sysfs_free(cc);
2162
2163 cc = st->ss->container_content(st, NULL);
2164
2165 for (content = cc; content ; content = content->next) {
2166 char *subarray;
2167 if (!content->reshape_active)
2168 continue;
2169
2170 subarray = strchr(content->text_version+1, '/')+1;
2171 mdstat = mdstat_by_subdev(subarray,
2172 devname2devnum(container));
2173 if (!mdstat)
2174 continue;
2175 break;
2176 }
2177 if (!content)
2178 break;
2179
2180 fd = open_dev_excl(mdstat->devnum);
2181 if (fd < 0)
2182 break;
2183 adev = map_dev(dev2major(mdstat->devnum),
2184 dev2minor(mdstat->devnum),
2185 0);
2186 if (!adev)
2187 adev = content->text_version;
2188
2189 sysfs_init(content, fd, mdstat->devnum);
2190
2191 rv = reshape_array(container, fd, adev, st,
2192 content, force,
2193 backup_file, quiet, 1);
2194 close(fd);
2195 if (rv)
2196 break;
2197 }
2198 sysfs_free(cc);
2199 exit(0);
2200 }
2201
2202 /*
2203 * We run a child process in the background which performs the following
2204 * steps:
2205 * - wait for resync to reach a certain point
2206 * - suspend io to the following section
2207 * - backup that section
2208 * - allow resync to proceed further
2209 * - resume io
2210 * - discard the backup.
2211 *
2212 * When are combined in slightly different ways in the three cases.
2213 * Grow:
2214 * - suspend/backup/allow/wait/resume/discard
2215 * Shrink:
2216 * - allow/wait/suspend/backup/allow/wait/resume/discard
2217 * same-size:
2218 * - wait/resume/discard/suspend/backup/allow
2219 *
2220 * suspend/backup/allow always come together
2221 * wait/resume/discard do too.
2222 * For the same-size case we have two backups to improve flow.
2223 *
2224 */
2225
2226 int progress_reshape(struct mdinfo *info, struct reshape *reshape,
2227 unsigned long long backup_point,
2228 unsigned long long wait_point,
2229 unsigned long long *suspend_point,
2230 unsigned long long *reshape_completed)
2231 {
2232 /* This function is called repeatedly by the reshape manager.
2233 * It determines how much progress can safely be made and allows
2234 * that progress.
2235 * - 'info' identifies the array and particularly records in
2236 * ->reshape_progress the metadata's knowledge of progress
2237 * This is a sector offset from the start of the array
2238 * of the next array block to be relocated. This number
2239 * may increase from 0 or decrease from array_size, depending
2240 * on the type of reshape that is happening.
2241 * Note that in contrast, 'sync_completed' is a block count of the
2242 * reshape so far. It gives the distance between the start point
2243 * (head or tail of device) and the next place that data will be
2244 * written. It always increases.
2245 * - 'reshape' is the structure created by analyse_change
2246 * - 'backup_point' shows how much the metadata manager has backed-up
2247 * data. For reshapes with increasing progress, it is the next address
2248 * to be backed up, previous addresses have been backed-up. For
2249 * decreasing progress, it is the earliest address that has been
2250 * backed up - later address are also backed up.
2251 * So addresses between reshape_progress and backup_point are
2252 * backed up providing those are in the 'correct' order.
2253 * - 'wait_point' is an array address. When reshape_completed
2254 * passes this point, progress_reshape should return. It might
2255 * return earlier if it determines that ->reshape_progress needs
2256 * to be updated or further backup is needed.
2257 * - suspend_point is maintained by progress_reshape and the caller
2258 * should not touch it except to initialise to zero.
2259 * It is an array address and it only increases in 2.6.37 and earlier.
2260 * This makes it difficulty to handle reducing reshapes with
2261 * external metadata.
2262 * However: it is similar to backup_point in that it records the
2263 * other end of a suspended region from reshape_progress.
2264 * it is moved to extend the region that is safe to backup and/or
2265 * reshape
2266 * - reshape_completed is read from sysfs and returned. The caller
2267 * should copy this into ->reshape_progress when it has reason to
2268 * believe that the metadata knows this, and any backup outside this
2269 * has been erased.
2270 *
2271 * Return value is:
2272 * 1 if more data from backup_point - but only as far as suspend_point,
2273 * should be backed up
2274 * 0 if things are progressing smoothly
2275 * -1 if the reshape is finished, either because it is all done,
2276 * or due to an error.
2277 */
2278
2279 int advancing = (reshape->after.data_disks
2280 >= reshape->before.data_disks);
2281 int need_backup = (reshape->after.data_disks
2282 == reshape->before.data_disks);
2283 unsigned long long read_offset, write_offset;
2284 unsigned long long read_range, write_range;
2285 unsigned long long max_progress, target, completed;
2286 int fd;
2287
2288 /* First, we unsuspend any region that is now known to be safe.
2289 * If suspend_point is on the 'wrong' side of reshape_progress, then
2290 * we don't have or need suspension at the moment. This is true for
2291 * native metadata when we don't need to back-up.
2292 */
2293 if (advancing) {
2294 if (info->reshape_progress < *suspend_point)
2295 sysfs_set_num(info, NULL, "suspend_lo",
2296 info->reshape_progress);
2297 } else {
2298 /* Note: this won't work in 2.6.37 and before.
2299 * Something somewhere should make sure we don't need it!
2300 */
2301 if (info->reshape_progress > *suspend_point)
2302 sysfs_set_num(info, NULL, "suspend_hi",
2303 info->reshape_progress);
2304 }
2305
2306 /* Now work out how far it is safe to progress.
2307 * If the read_offset for ->reshape_progress is less than
2308 * 'blocks' beyond the write_offset, we can only progress as far
2309 * as a backup.
2310 * Otherwise we can progress until the write_offset for the new location
2311 * reaches (within 'blocks' of) the read_offset at the current location.
2312 * However that region must be suspended unless we are using native
2313 * metadata.
2314 * If we need to suspend more, we limit it to 128M per device, which is
2315 * rather arbitrary and should be some time-based calculation.
2316 */
2317 write_offset = info->reshape_progress / reshape->before.data_disks;
2318 read_offset = info->reshape_progress / reshape->after.data_disks;
2319 write_range = reshape->blocks / reshape->before.data_disks;
2320 read_range = reshape->blocks / reshape->after.data_disks;
2321 if (advancing) {
2322 if (read_offset < write_offset + write_range) {
2323 max_progress = backup_point;
2324 if (max_progress <= info->reshape_progress)
2325 need_backup = 1;
2326 } else {
2327 max_progress =
2328 (read_offset - write_range) *
2329 reshape->before.data_disks;
2330 }
2331 } else {
2332 if (read_offset > write_offset - write_range) {
2333 max_progress = backup_point;
2334 if (max_progress >= info->reshape_progress)
2335 need_backup = 1;
2336 } else {
2337 max_progress =
2338 (read_offset + write_range) *
2339 reshape->before.data_disks;
2340 /* If we are using internal metadata, then we can
2341 * progress all the way to the suspend_point without
2342 * worrying about backing-up/suspending along the
2343 * way.
2344 */
2345 if (max_progress < *suspend_point &&
2346 info->array.major_version >= 0)
2347 max_progress = *suspend_point;
2348 }
2349 }
2350
2351 /* We know it is safe to progress to 'max_progress' providing
2352 * it is suspended or we are using native metadata.
2353 * Consider extending suspend_point 128M per device if it
2354 * is less than 64M per device beyond reshape_progress.
2355 * But always do a multiple of 'blocks'
2356 */
2357 target = 64*1024*2 * min(reshape->before.data_disks,
2358 reshape->after.data_disks);
2359 target /= reshape->blocks;
2360 if (target < 2)
2361 target = 2;
2362 target *= reshape->blocks;
2363
2364 /* For externally managed metadata we always need to suspend IO to
2365 * the area being reshaped so we regularly push suspend_point forward.
2366 * For native metadata we only need the suspend if we are going to do
2367 * a backup.
2368 */
2369 if (advancing) {
2370 if ((need_backup || info->array.major_version < 0) &&
2371 *suspend_point < info->reshape_progress + target) {
2372 if (max_progress < *suspend_point + 2 * target)
2373 *suspend_point = max_progress;
2374 else
2375 *suspend_point += 2 * target;
2376 sysfs_set_num(info, NULL, "suspend_hi", *suspend_point);
2377 max_progress = *suspend_point;
2378 }
2379 } else {
2380 if ((need_backup || info->array.major_version < 0) &&
2381 *suspend_point > info->reshape_progress - target) {
2382 if (max_progress > *suspend_point - 2 * target)
2383 *suspend_point = max_progress;
2384 else
2385 *suspend_point -= 2 * target;
2386 sysfs_set_num(info, NULL, "suspend_lo", *suspend_point);
2387 max_progress = *suspend_point;
2388 }
2389 }
2390
2391 /* now set sync_max to allow that progress. sync_max, like
2392 * sync_completed is a count of sectors written per device, so
2393 * we find the difference between max_progress and the start point,
2394 * and divide that by after.data_disks to get a sync_max
2395 * number.
2396 * At the same time we convert wait_point to a similar number
2397 * for comparing against sync_completed.
2398 */
2399 if (!advancing) {
2400 max_progress = info->component_size * reshape->after.data_disks
2401 - max_progress;
2402 wait_point = info->component_size * reshape->after.data_disks
2403 - wait_point;
2404 }
2405 max_progress /= reshape->after.data_disks;
2406 wait_point /= reshape->after.data_disks;
2407
2408 sysfs_set_num(info, NULL, "sync_max", max_progress);
2409
2410 /* Now wait. If we have already reached the point that we were
2411 * asked to wait to, don't wait at all, else wait for any change.
2412 * We need to select on 'sync_completed' as that is the place that
2413 * notifications happen, but we are really interested in
2414 * 'reshape_position'
2415 */
2416 fd = sysfs_get_fd(info, NULL, "sync_completed");
2417 if (fd < 0)
2418 return -1;
2419
2420 if (sysfs_fd_get_ll(fd, &completed) < 0) {
2421 close(fd);
2422 return -1;
2423 }
2424 while (completed < max_progress && completed < wait_point) {
2425 /* Check that sync_action is still 'reshape' to avoid
2426 * waiting forever on a dead array
2427 */
2428 char action[20];
2429 fd_set rfds;
2430 if (sysfs_get_str(info, NULL, "sync_action",
2431 action, 20) <= 0 ||
2432 strncmp(action, "reshape", 7) != 0)
2433 break;
2434 FD_ZERO(&rfds);
2435 FD_SET(fd, &rfds);
2436 select(fd+1, NULL, NULL, &rfds, NULL);
2437 if (sysfs_fd_get_ll(fd, &completed) < 0) {
2438 close(fd);
2439 return -1;
2440 }
2441 }
2442 /* Convert 'completed' back in to a 'progress' number */
2443 completed *= reshape->after.data_disks;
2444 if (!advancing) {
2445 completed = info->component_size * reshape->after.data_disks
2446 - completed;
2447 }
2448 *reshape_completed = completed;
2449
2450 close(fd);
2451
2452 /* We return the need_backup flag. Caller will decide
2453 * how much (a multiple of ->blocks) and will adjust
2454 * suspend_{lo,hi} and suspend_point.
2455 */
2456 return need_backup;
2457 }
2458
2459
2460 /* FIXME return status is never checked */
2461 static int grow_backup(struct mdinfo *sra,
2462 unsigned long long offset, /* per device */
2463 unsigned long stripes, /* per device, in old chunks */
2464 int *sources, unsigned long long *offsets,
2465 int disks, int chunk, int level, int layout,
2466 int dests, int *destfd, unsigned long long *destoffsets,
2467 int part, int *degraded,
2468 char *buf)
2469 {
2470 /* Backup 'blocks' sectors at 'offset' on each device of the array,
2471 * to storage 'destfd' (offset 'destoffsets'), after first
2472 * suspending IO. Then allow resync to continue
2473 * over the suspended section.
2474 * Use part 'part' of the backup-super-block.
2475 */
2476 int odata = disks;
2477 int rv = 0;
2478 int i;
2479 unsigned long long ll;
2480 int new_degraded;
2481 //printf("offset %llu\n", offset);
2482 if (level >= 4)
2483 odata--;
2484 if (level == 6)
2485 odata--;
2486
2487 /* Check that array hasn't become degraded, else we might backup the wrong data */
2488 sysfs_get_ll(sra, NULL, "degraded", &ll);
2489 new_degraded = (int)ll;
2490 if (new_degraded != *degraded) {
2491 /* check each device to ensure it is still working */
2492 struct mdinfo *sd;
2493 for (sd = sra->devs ; sd ; sd = sd->next) {
2494 if (sd->disk.state & (1<<MD_DISK_FAULTY))
2495 continue;
2496 if (sd->disk.state & (1<<MD_DISK_SYNC)) {
2497 char sbuf[20];
2498 if (sysfs_get_str(sra, sd, "state", sbuf, 20) < 0 ||
2499 strstr(sbuf, "faulty") ||
2500 strstr(sbuf, "in_sync") == NULL) {
2501 /* this device is dead */
2502 sd->disk.state = (1<<MD_DISK_FAULTY);
2503 if (sd->disk.raid_disk >= 0 &&
2504 sources[sd->disk.raid_disk] >= 0) {
2505 close(sources[sd->disk.raid_disk]);
2506 sources[sd->disk.raid_disk] = -1;
2507 }
2508 }
2509 }
2510 }
2511 *degraded = new_degraded;
2512 }
2513 if (part) {
2514 bsb.arraystart2 = __cpu_to_le64(offset * odata);
2515 bsb.length2 = __cpu_to_le64(stripes * (chunk/512) * odata);
2516 } else {
2517 bsb.arraystart = __cpu_to_le64(offset * odata);
2518 bsb.length = __cpu_to_le64(stripes * (chunk/512) * odata);
2519 }
2520 if (part)
2521 bsb.magic[15] = '2';
2522 for (i = 0; i < dests; i++)
2523 if (part)
2524 lseek64(destfd[i], destoffsets[i] + __le64_to_cpu(bsb.devstart2)*512, 0);
2525 else
2526 lseek64(destfd[i], destoffsets[i], 0);
2527
2528 rv = save_stripes(sources, offsets,
2529 disks, chunk, level, layout,
2530 dests, destfd,
2531 offset*512*odata, stripes * chunk * odata,
2532 buf);
2533
2534 if (rv)
2535 return rv;
2536 bsb.mtime = __cpu_to_le64(time(0));
2537 for (i = 0; i < dests; i++) {
2538 bsb.devstart = __cpu_to_le64(destoffsets[i]/512);
2539
2540 bsb.sb_csum = bsb_csum((char*)&bsb, ((char*)&bsb.sb_csum)-((char*)&bsb));
2541 if (memcmp(bsb.magic, "md_backup_data-2", 16) == 0)
2542 bsb.sb_csum2 = bsb_csum((char*)&bsb,
2543 ((char*)&bsb.sb_csum2)-((char*)&bsb));
2544
2545 rv = -1;
2546 if ((unsigned long long)lseek64(destfd[i], destoffsets[i] - 4096, 0)
2547 != destoffsets[i] - 4096)
2548 break;
2549 if (write(destfd[i], &bsb, 512) != 512)
2550 break;
2551 if (destoffsets[i] > 4096) {
2552 if ((unsigned long long)lseek64(destfd[i], destoffsets[i]+stripes*chunk*odata, 0) !=
2553 destoffsets[i]+stripes*chunk*odata)
2554 break;
2555 if (write(destfd[i], &bsb, 512) != 512)
2556 break;
2557 }
2558 fsync(destfd[i]);
2559 rv = 0;
2560 }
2561
2562 return rv;
2563 }
2564
2565 /* in 2.6.30, the value reported by sync_completed can be
2566 * less that it should be by one stripe.
2567 * This only happens when reshape hits sync_max and pauses.
2568 * So allow wait_backup to either extent sync_max further
2569 * than strictly necessary, or return before the
2570 * sync has got quite as far as we would really like.
2571 * This is what 'blocks2' is for.
2572 * The various caller give appropriate values so that
2573 * every works.
2574 */
2575 /* FIXME return value is often ignored */
2576 static int forget_backup(
2577 int dests, int *destfd, unsigned long long *destoffsets,
2578 int part)
2579 {
2580 /*
2581 * Erase backup 'part' (which is 0 or 1)
2582 */
2583 int i;
2584 int rv;
2585
2586 if (part) {
2587 bsb.arraystart2 = __cpu_to_le64(0);
2588 bsb.length2 = __cpu_to_le64(0);
2589 } else {
2590 bsb.arraystart = __cpu_to_le64(0);
2591 bsb.length = __cpu_to_le64(0);
2592 }
2593 bsb.mtime = __cpu_to_le64(time(0));
2594 rv = 0;
2595 for (i = 0; i < dests; i++) {
2596 bsb.devstart = __cpu_to_le64(destoffsets[i]/512);
2597 bsb.sb_csum = bsb_csum((char*)&bsb, ((char*)&bsb.sb_csum)-((char*)&bsb));
2598 if (memcmp(bsb.magic, "md_backup_data-2", 16) == 0)
2599 bsb.sb_csum2 = bsb_csum((char*)&bsb,
2600 ((char*)&bsb.sb_csum2)-((char*)&bsb));
2601 if ((unsigned long long)lseek64(destfd[i], destoffsets[i]-4096, 0) !=
2602 destoffsets[i]-4096)
2603 rv = -1;
2604 if (rv == 0 &&
2605 write(destfd[i], &bsb, 512) != 512)
2606 rv = -1;
2607 fsync(destfd[i]);
2608 }
2609 return rv;
2610 }
2611
2612 static void fail(char *msg)
2613 {
2614 int rv;
2615 rv = (write(2, msg, strlen(msg)) != (int)strlen(msg));
2616 rv |= (write(2, "\n", 1) != 1);
2617 exit(rv ? 1 : 2);
2618 }
2619
2620 static char *abuf, *bbuf;
2621 static unsigned long long abuflen;
2622 static void validate(int afd, int bfd, unsigned long long offset)
2623 {
2624 /* check that the data in the backup against the array.
2625 * This is only used for regression testing and should not
2626 * be used while the array is active
2627 */
2628 if (afd < 0)
2629 return;
2630 lseek64(bfd, offset - 4096, 0);
2631 if (read(bfd, &bsb2, 512) != 512)
2632 fail("cannot read bsb");
2633 if (bsb2.sb_csum != bsb_csum((char*)&bsb2,
2634 ((char*)&bsb2.sb_csum)-((char*)&bsb2)))
2635 fail("first csum bad");
2636 if (memcmp(bsb2.magic, "md_backup_data", 14) != 0)
2637 fail("magic is bad");
2638 if (memcmp(bsb2.magic, "md_backup_data-2", 16) == 0 &&
2639 bsb2.sb_csum2 != bsb_csum((char*)&bsb2,
2640 ((char*)&bsb2.sb_csum2)-((char*)&bsb2)))
2641 fail("second csum bad");
2642
2643 if (__le64_to_cpu(bsb2.devstart)*512 != offset)
2644 fail("devstart is wrong");
2645
2646 if (bsb2.length) {
2647 unsigned long long len = __le64_to_cpu(bsb2.length)*512;
2648
2649 if (abuflen < len) {
2650 free(abuf);
2651 free(bbuf);
2652 abuflen = len;
2653 if (posix_memalign((void**)&abuf, 4096, abuflen) ||
2654 posix_memalign((void**)&bbuf, 4096, abuflen)) {
2655 abuflen = 0;
2656 /* just stop validating on mem-alloc failure */
2657 return;
2658 }
2659 }
2660
2661 lseek64(bfd, offset, 0);
2662 if ((unsigned long long)read(bfd, bbuf, len) != len) {
2663 //printf("len %llu\n", len);
2664 fail("read first backup failed");
2665 }
2666 lseek64(afd, __le64_to_cpu(bsb2.arraystart)*512, 0);
2667 if ((unsigned long long)read(afd, abuf, len) != len)
2668 fail("read first from array failed");
2669 if (memcmp(bbuf, abuf, len) != 0) {
2670 #if 0
2671 int i;
2672 printf("offset=%llu len=%llu\n",
2673 (unsigned long long)__le64_to_cpu(bsb2.arraystart)*512, len);
2674 for (i=0; i<len; i++)
2675 if (bbuf[i] != abuf[i]) {
2676 printf("first diff byte %d\n", i);
2677 break;
2678 }
2679 #endif
2680 fail("data1 compare failed");
2681 }
2682 }
2683 if (bsb2.length2) {
2684 unsigned long long len = __le64_to_cpu(bsb2.length2)*512;
2685
2686 if (abuflen < len) {
2687 free(abuf);
2688 free(bbuf);
2689 abuflen = len;
2690 abuf = malloc(abuflen);
2691 bbuf = malloc(abuflen);
2692 }
2693
2694 lseek64(bfd, offset+__le64_to_cpu(bsb2.devstart2)*512, 0);
2695 if ((unsigned long long)read(bfd, bbuf, len) != len)
2696 fail("read second backup failed");
2697 lseek64(afd, __le64_to_cpu(bsb2.arraystart2)*512, 0);
2698 if ((unsigned long long)read(afd, abuf, len) != len)
2699 fail("read second from array failed");
2700 if (memcmp(bbuf, abuf, len) != 0)
2701 fail("data2 compare failed");
2702 }
2703 }
2704
2705 static int child_monitor(int afd, struct mdinfo *sra, struct reshape *reshape,
2706 unsigned long stripes,
2707 int *fds, unsigned long long *offsets,
2708 int dests, int *destfd, unsigned long long *destoffsets)
2709 {
2710 /* Monitor a reshape where backup is being performed using
2711 * 'native' mechanism - either to a backup file, or
2712 * to some space in a spare.
2713 */
2714 char *buf;
2715 int degraded = -1;
2716 unsigned long long speed;
2717 unsigned long long suspend_point, array_size;
2718 unsigned long long backup_point, wait_point;
2719 unsigned long long reshape_completed;
2720 int done = 0;
2721 int increasing = reshape->after.data_disks >= reshape->before.data_disks;
2722 int part = 0; /* The next part of the backup area to fill. It may already
2723 * be full, so we need to check */
2724 int level = reshape->level;
2725 int layout = reshape->before.layout;
2726 int data = reshape->before.data_disks;
2727 int disks = reshape->before.data_disks + reshape->parity;
2728 int chunk = sra->array.chunk_size;
2729
2730 if (posix_memalign((void**)&buf, 4096, disks * chunk))
2731 /* Don't start the 'reshape' */
2732 return 0;
2733 if (reshape->before.data_disks == reshape->after.data_disks) {
2734 sysfs_get_ll(sra, NULL, "sync_speed_min", &speed);
2735 sysfs_set_num(sra, NULL, "sync_speed_min", 200000);
2736 }
2737
2738 array_size = sra->component_size * data;
2739 if (increasing) {
2740 backup_point = sra->reshape_progress;
2741 suspend_point = 0;
2742 } else {
2743 backup_point = array_size;
2744 suspend_point = array_size;
2745 }
2746
2747 while (!done) {
2748 int rv;
2749
2750 /* Want to return as soon the oldest backup slot can
2751 * be released as that allows us to start backing up
2752 * some more, providing suspend_point has been
2753 * advanced, which it should have
2754 */
2755 if (increasing) {
2756 wait_point = array_size;
2757 if (part == 0 && __le64_to_cpu(bsb.length) > 0)
2758 wait_point = (__le64_to_cpu(bsb.arraystart) +
2759 __le64_to_cpu(bsb.length));
2760 if (part == 1 && __le64_to_cpu(bsb.length2) > 0)
2761 wait_point = (__le64_to_cpu(bsb.arraystart2) +
2762 __le64_to_cpu(bsb.length2));
2763 } else {
2764 wait_point = 0;
2765 if (part == 0 && __le64_to_cpu(bsb.length) > 0)
2766 wait_point = __le64_to_cpu(bsb.arraystart);
2767 if (part == 1 && __le64_to_cpu(bsb.length2) > 0)
2768 wait_point = __le64_to_cpu(bsb.arraystart2);
2769 }
2770
2771 rv = progress_reshape(sra, reshape,
2772 backup_point, wait_point,
2773 &suspend_point, &reshape_completed);
2774 if (rv < 0) {
2775 done = 1;
2776 break;
2777 }
2778
2779 /* external metadata would need to ping_monitor here */
2780 sra->reshape_progress = reshape_completed;
2781
2782 /* Clear any backup region that is before 'here' */
2783 if (increasing) {
2784 if (reshape_completed >= (__le64_to_cpu(bsb.arraystart) +
2785 __le64_to_cpu(bsb.length)))
2786 forget_backup(dests, destfd,
2787 destoffsets, 0);
2788 if (reshape_completed >= (__le64_to_cpu(bsb.arraystart2) +
2789 __le64_to_cpu(bsb.length2)))
2790 forget_backup(dests, destfd,
2791 destoffsets, 1);
2792 } else {
2793 if (reshape_completed <= (__le64_to_cpu(bsb.arraystart)))
2794 forget_backup(dests, destfd,
2795 destoffsets, 0);
2796 if (reshape_completed <= (__le64_to_cpu(bsb.arraystart2)))
2797 forget_backup(dests, destfd,
2798 destoffsets, 1);
2799 }
2800
2801 if (rv) {
2802 unsigned long long offset;
2803 /* need to backup some space... */
2804 /* Check that 'part' is unused */
2805 if (part == 0 && __le64_to_cpu(bsb.length) != 0)
2806 abort(); /* BUG here */
2807 if (part == 1 && __le64_to_cpu(bsb.length2) != 0)
2808 abort();
2809
2810 offset = backup_point / data;
2811 if (!increasing)
2812 offset -= stripes * (chunk/512);
2813 grow_backup(sra, offset, stripes,
2814 fds, offsets,
2815 disks, chunk, level, layout,
2816 dests, destfd, destoffsets,
2817 part, &degraded, buf);
2818 validate(afd, destfd[0], destoffsets[0]);
2819 /* record where 'part' is up to */
2820 part = !part;
2821 if (increasing)
2822 backup_point += stripes * (chunk/512) * data;
2823 else
2824 backup_point -= stripes * (chunk/512) * data;
2825 }
2826 }
2827
2828 if (reshape->before.data_disks == reshape->after.data_disks)
2829 sysfs_set_num(sra, NULL, "sync_speed_min", speed);
2830 free(buf);
2831 return 1; /* FIXME what does this mean? */
2832 }
2833
2834 /*
2835 * If any spare contains md_back_data-1 which is recent wrt mtime,
2836 * write that data into the array and update the super blocks with
2837 * the new reshape_progress
2838 */
2839 int Grow_restart(struct supertype *st, struct mdinfo *info, int *fdlist, int cnt,
2840 char *backup_file, int verbose)
2841 {
2842 int i, j;
2843 int old_disks;
2844 unsigned long long *offsets;
2845 unsigned long long nstripe, ostripe;
2846 int ndata, odata;
2847
2848 if (info->new_level != info->array.level)
2849 return 1; /* Cannot handle level changes (they are instantaneous) */
2850
2851 odata = info->array.raid_disks - info->delta_disks - 1;
2852 if (info->array.level == 6) odata--; /* number of data disks */
2853 ndata = info->array.raid_disks - 1;
2854 if (info->new_level == 6) ndata--;
2855
2856 old_disks = info->array.raid_disks - info->delta_disks;
2857
2858 if (info->delta_disks <= 0)
2859 /* Didn't grow, so the backup file must have
2860 * been used
2861 */
2862 old_disks = cnt;
2863 for (i=old_disks-(backup_file?1:0); i<cnt; i++) {
2864 struct mdinfo dinfo;
2865 int fd;
2866 int bsbsize;
2867 char *devname, namebuf[20];
2868
2869 /* This was a spare and may have some saved data on it.
2870 * Load the superblock, find and load the
2871 * backup_super_block.
2872 * If either fail, go on to next device.
2873 * If the backup contains no new info, just return
2874 * else restore data and update all superblocks
2875 */
2876 if (i == old_disks-1) {
2877 fd = open(backup_file, O_RDONLY);
2878 if (fd<0) {
2879 fprintf(stderr, Name ": backup file %s inaccessible: %s\n",
2880 backup_file, strerror(errno));
2881 continue;
2882 }
2883 devname = backup_file;
2884 } else {
2885 fd = fdlist[i];
2886 if (fd < 0)
2887 continue;
2888 if (st->ss->load_super(st, fd, NULL))
2889 continue;
2890
2891 st->ss->getinfo_super(st, &dinfo, NULL);
2892 st->ss->free_super(st);
2893
2894 if (lseek64(fd,
2895 (dinfo.data_offset + dinfo.component_size - 8) <<9,
2896 0) < 0) {
2897 fprintf(stderr, Name ": Cannot seek on device %d\n", i);
2898 continue; /* Cannot seek */
2899 }
2900 sprintf(namebuf, "device-%d", i);
2901 devname = namebuf;
2902 }
2903 if (read(fd, &bsb, sizeof(bsb)) != sizeof(bsb)) {
2904 if (verbose)
2905 fprintf(stderr, Name ": Cannot read from %s\n", devname);
2906 continue; /* Cannot read */
2907 }
2908 if (memcmp(bsb.magic, "md_backup_data-1", 16) != 0 &&
2909 memcmp(bsb.magic, "md_backup_data-2", 16) != 0) {
2910 if (verbose)
2911 fprintf(stderr, Name ": No backup metadata on %s\n", devname);
2912 continue;
2913 }
2914 if (bsb.sb_csum != bsb_csum((char*)&bsb, ((char*)&bsb.sb_csum)-((char*)&bsb))) {
2915 if (verbose)
2916 fprintf(stderr, Name ": Bad backup-metadata checksum on %s\n", devname);
2917 continue; /* bad checksum */
2918 }
2919 if (memcmp(bsb.magic, "md_backup_data-2", 16) == 0 &&
2920 bsb.sb_csum2 != bsb_csum((char*)&bsb, ((char*)&bsb.sb_csum2)-((char*)&bsb))) {
2921 if (verbose)
2922 fprintf(stderr, Name ": Bad backup-metadata checksum2 on %s\n", devname);
2923 continue; /* Bad second checksum */
2924 }
2925 if (memcmp(bsb.set_uuid,info->uuid, 16) != 0) {
2926 if (verbose)
2927 fprintf(stderr, Name ": Wrong uuid on backup-metadata on %s\n", devname);
2928 continue; /* Wrong uuid */
2929 }
2930
2931 /* array utime and backup-mtime should be updated at much the same time, but it seems that
2932 * sometimes they aren't... So allow considerable flexability in matching, and allow
2933 * this test to be overridden by an environment variable.
2934 */
2935 if (info->array.utime > (int)__le64_to_cpu(bsb.mtime) + 2*60*60 ||
2936 info->array.utime < (int)__le64_to_cpu(bsb.mtime) - 10*60) {
2937 if (check_env("MDADM_GROW_ALLOW_OLD")) {
2938 fprintf(stderr, Name ": accepting backup with timestamp %lu "
2939 "for array with timestamp %lu\n",
2940 (unsigned long)__le64_to_cpu(bsb.mtime),
2941 (unsigned long)info->array.utime);
2942 } else {
2943 if (verbose)
2944 fprintf(stderr, Name ": too-old timestamp on "
2945 "backup-metadata on %s\n", devname);
2946 continue; /* time stamp is too bad */
2947 }
2948 }
2949
2950 if (bsb.magic[15] == '1') {
2951 if (info->delta_disks >= 0) {
2952 /* reshape_progress is increasing */
2953 if (__le64_to_cpu(bsb.arraystart) + __le64_to_cpu(bsb.length) <
2954 info->reshape_progress) {
2955 nonew:
2956 if (verbose)
2957 fprintf(stderr, Name ": backup-metadata found on %s but is not needed\n", devname);
2958 continue; /* No new data here */
2959 }
2960 } else {
2961 /* reshape_progress is decreasing */
2962 if (__le64_to_cpu(bsb.arraystart) >=
2963 info->reshape_progress)
2964 goto nonew; /* No new data here */
2965 }
2966 } else {
2967 if (info->delta_disks >= 0) {
2968 /* reshape_progress is increasing */
2969 if (__le64_to_cpu(bsb.arraystart) + __le64_to_cpu(bsb.length) <
2970 info->reshape_progress &&
2971 __le64_to_cpu(bsb.arraystart2) + __le64_to_cpu(bsb.length2) <
2972 info->reshape_progress)
2973 goto nonew; /* No new data here */
2974 } else {
2975 /* reshape_progress is decreasing */
2976 if (__le64_to_cpu(bsb.arraystart) >=
2977 info->reshape_progress &&
2978 __le64_to_cpu(bsb.arraystart2) >=
2979 info->reshape_progress)
2980 goto nonew; /* No new data here */
2981 }
2982 }
2983 if (lseek64(fd, __le64_to_cpu(bsb.devstart)*512, 0)< 0) {
2984 second_fail:
2985 if (verbose)
2986 fprintf(stderr, Name ": Failed to verify secondary backup-metadata block on %s\n",
2987 devname);
2988 continue; /* Cannot seek */
2989 }
2990 /* There should be a duplicate backup superblock 4k before here */
2991 if (lseek64(fd, -4096, 1) < 0 ||
2992 read(fd, &bsb2, sizeof(bsb2)) != sizeof(bsb2))
2993 goto second_fail; /* Cannot find leading superblock */
2994 if (bsb.magic[15] == '1')
2995 bsbsize = offsetof(struct mdp_backup_super, pad1);
2996 else
2997 bsbsize = offsetof(struct mdp_backup_super, pad);
2998 if (memcmp(&bsb2, &bsb, bsbsize) != 0)
2999 goto second_fail; /* Cannot find leading superblock */
3000
3001 /* Now need the data offsets for all devices. */
3002 offsets = malloc(sizeof(*offsets)*info->array.raid_disks);
3003 for(j=0; j<info->array.raid_disks; j++) {
3004 if (fdlist[j] < 0)
3005 continue;
3006 if (st->ss->load_super(st, fdlist[j], NULL))
3007 /* FIXME should be this be an error */
3008 continue;
3009 st->ss->getinfo_super(st, &dinfo, NULL);
3010 st->ss->free_super(st);
3011 offsets[j] = dinfo.data_offset * 512;
3012 }
3013 printf(Name ": restoring critical section\n");
3014
3015 if (restore_stripes(fdlist, offsets,
3016 info->array.raid_disks,
3017 info->new_chunk,
3018 info->new_level,
3019 info->new_layout,
3020 fd, __le64_to_cpu(bsb.devstart)*512,
3021 __le64_to_cpu(bsb.arraystart)*512,
3022 __le64_to_cpu(bsb.length)*512)) {
3023 /* didn't succeed, so giveup */
3024 if (verbose)
3025 fprintf(stderr, Name ": Error restoring backup from %s\n",
3026 devname);
3027 return 1;
3028 }
3029
3030 if (bsb.magic[15] == '2' &&
3031 restore_stripes(fdlist, offsets,
3032 info->array.raid_disks,
3033 info->new_chunk,
3034 info->new_level,
3035 info->new_layout,
3036 fd, __le64_to_cpu(bsb.devstart)*512 +
3037 __le64_to_cpu(bsb.devstart2)*512,
3038 __le64_to_cpu(bsb.arraystart2)*512,
3039 __le64_to_cpu(bsb.length2)*512)) {
3040 /* didn't succeed, so giveup */
3041 if (verbose)
3042 fprintf(stderr, Name ": Error restoring second backup from %s\n",
3043 devname);
3044 return 1;
3045 }
3046
3047
3048 /* Ok, so the data is restored. Let's update those superblocks. */
3049
3050 if (info->delta_disks >= 0) {
3051 info->reshape_progress = __le64_to_cpu(bsb.arraystart) +
3052 __le64_to_cpu(bsb.length);
3053 if (bsb.magic[15] == '2') {
3054 unsigned long long p2 = __le64_to_cpu(bsb.arraystart2) +
3055 __le64_to_cpu(bsb.length2);
3056 if (p2 > info->reshape_progress)
3057 info->reshape_progress = p2;
3058 }
3059 } else {
3060 info->reshape_progress = __le64_to_cpu(bsb.arraystart);
3061 if (bsb.magic[15] == '2') {
3062 unsigned long long p2 = __le64_to_cpu(bsb.arraystart2);
3063 if (p2 < info->reshape_progress)
3064 info->reshape_progress = p2;
3065 }
3066 }
3067 for (j=0; j<info->array.raid_disks; j++) {
3068 if (fdlist[j] < 0) continue;
3069 if (st->ss->load_super(st, fdlist[j], NULL))
3070 continue;
3071 st->ss->getinfo_super(st, &dinfo, NULL);
3072 dinfo.reshape_progress = info->reshape_progress;
3073 st->ss->update_super(st, &dinfo,
3074 "_reshape_progress",
3075 NULL,0, 0, NULL);
3076 st->ss->store_super(st, fdlist[j]);
3077 st->ss->free_super(st);
3078 }
3079 return 0;
3080 }
3081 /* Didn't find any backup data, try to see if any
3082 * was needed.
3083 */
3084 if (info->delta_disks < 0) {
3085 /* When shrinking, the critical section is at the end.
3086 * So see if we are before the critical section.
3087 */
3088 unsigned long long first_block;
3089 nstripe = ostripe = 0;
3090 first_block = 0;
3091 while (ostripe >= nstripe) {
3092 ostripe += info->array.chunk_size / 512;
3093 first_block = ostripe * odata;
3094 nstripe = first_block / ndata / (info->new_chunk/512) *
3095 (info->new_chunk/512);
3096 }
3097
3098 if (info->reshape_progress >= first_block)
3099 return 0;
3100 }
3101 if (info->delta_disks > 0) {
3102 /* See if we are beyond the critical section. */
3103 unsigned long long last_block;
3104 nstripe = ostripe = 0;
3105 last_block = 0;
3106 while (nstripe >= ostripe) {
3107 nstripe += info->new_chunk / 512;
3108 last_block = nstripe * ndata;
3109 ostripe = last_block / odata / (info->array.chunk_size/512) *
3110 (info->array.chunk_size/512);
3111 }
3112
3113 if (info->reshape_progress >= last_block)
3114 return 0;
3115 }
3116 /* needed to recover critical section! */
3117 if (verbose)
3118 fprintf(stderr, Name ": Failed to find backup of critical section\n");
3119 return 1;
3120 }
3121
3122 int Grow_continue(int mdfd, struct supertype *st, struct mdinfo *info,
3123 char *backup_file)
3124 {
3125 int err = sysfs_set_str(info, NULL, "array_state", "readonly");
3126 if (err)
3127 return err;
3128 return reshape_array(NULL, mdfd, "array", st, info, 1, backup_file, 0, 0);
3129 }
3130
3131