]>
Commit | Line | Data |
---|---|---|
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 | sysfs_set_num(sra, NULL, "suspend_lo", 0x7FFFFFFFFFFFFFFFULL); | |
638 | err = sysfs_set_num(sra, NULL, "suspend_hi", 0); | |
639 | err = err ?: sysfs_set_num(sra, NULL, "suspend_lo", 0); | |
640 | err = err ?: sysfs_set_num(sra, NULL, "sync_min", 0); | |
641 | err = err ?: sysfs_set_num(sra, NULL, "sync_max", 0); | |
642 | err = err ?: sysfs_set_str(sra, NULL, "sync_action", "reshape"); | |
643 | ||
644 | return err; | |
645 | } | |
646 | ||
647 | void abort_reshape(struct mdinfo *sra) | |
648 | { | |
649 | sysfs_set_str(sra, NULL, "sync_action", "idle"); | |
650 | sysfs_set_num(sra, NULL, "suspend_lo", 0x7FFFFFFFFFFFFFFFULL); | |
651 | sysfs_set_num(sra, NULL, "suspend_hi", 0); | |
652 | sysfs_set_num(sra, NULL, "suspend_lo", 0); | |
653 | sysfs_set_num(sra, NULL, "sync_min", 0); | |
654 | sysfs_set_str(sra, NULL, "sync_max", "max"); | |
655 | } | |
656 | ||
657 | int remove_disks_on_raid10_to_raid0_takeover(struct supertype *st, | |
658 | struct mdinfo *sra, | |
659 | int layout) | |
660 | { | |
661 | int nr_of_copies; | |
662 | struct mdinfo *remaining; | |
663 | int slot; | |
664 | ||
665 | nr_of_copies = layout & 0xff; | |
666 | ||
667 | remaining = sra->devs; | |
668 | sra->devs = NULL; | |
669 | /* for each 'copy', select one device and remove from the list. */ | |
670 | for (slot = 0; slot < sra->array.raid_disks; slot += nr_of_copies) { | |
671 | struct mdinfo **diskp; | |
672 | int found = 0; | |
673 | ||
674 | /* Find a working device to keep */ | |
675 | for (diskp = &remaining; *diskp ; diskp = &(*diskp)->next) { | |
676 | struct mdinfo *disk = *diskp; | |
677 | ||
678 | if (disk->disk.raid_disk < slot) | |
679 | continue; | |
680 | if (disk->disk.raid_disk >= slot + nr_of_copies) | |
681 | continue; | |
682 | if (disk->disk.state & (1<<MD_DISK_REMOVED)) | |
683 | continue; | |
684 | if (disk->disk.state & (1<<MD_DISK_FAULTY)) | |
685 | continue; | |
686 | if (!(disk->disk.state & (1<<MD_DISK_SYNC))) | |
687 | continue; | |
688 | ||
689 | /* We have found a good disk to use! */ | |
690 | *diskp = disk->next; | |
691 | disk->next = sra->devs; | |
692 | sra->devs = disk; | |
693 | found = 1; | |
694 | break; | |
695 | } | |
696 | if (!found) | |
697 | break; | |
698 | } | |
699 | ||
700 | if (slot < sra->array.raid_disks) { | |
701 | /* didn't find all slots */ | |
702 | struct mdinfo **e; | |
703 | e = &remaining; | |
704 | while (*e) | |
705 | e = &(*e)->next; | |
706 | *e = sra->devs; | |
707 | sra->devs = remaining; | |
708 | return 1; | |
709 | } | |
710 | ||
711 | /* Remove all 'remaining' devices from the array */ | |
712 | while (remaining) { | |
713 | struct mdinfo *sd = remaining; | |
714 | remaining = sd->next; | |
715 | ||
716 | sysfs_set_str(sra, sd, "state", "faulty"); | |
717 | sysfs_set_str(sra, sd, "slot", "none"); | |
718 | sysfs_set_str(sra, sd, "state", "remove"); | |
719 | sd->disk.state |= (1<<MD_DISK_REMOVED); | |
720 | sd->disk.state &= ~(1<<MD_DISK_SYNC); | |
721 | sd->next = sra->devs; | |
722 | sra->devs = sd; | |
723 | } | |
724 | return 0; | |
725 | } | |
726 | ||
727 | void reshape_free_fdlist(int *fdlist, | |
728 | unsigned long long *offsets, | |
729 | int size) | |
730 | { | |
731 | int i; | |
732 | ||
733 | for (i = 0; i < size; i++) | |
734 | if (fdlist[i] >= 0) | |
735 | close(fdlist[i]); | |
736 | ||
737 | free(fdlist); | |
738 | free(offsets); | |
739 | } | |
740 | ||
741 | int reshape_prepare_fdlist(char *devname, | |
742 | struct mdinfo *sra, | |
743 | int raid_disks, | |
744 | int nrdisks, | |
745 | unsigned long blocks, | |
746 | char *backup_file, | |
747 | int *fdlist, | |
748 | unsigned long long *offsets) | |
749 | { | |
750 | int d = 0; | |
751 | struct mdinfo *sd; | |
752 | ||
753 | for (d = 0; d <= nrdisks; d++) | |
754 | fdlist[d] = -1; | |
755 | d = raid_disks; | |
756 | for (sd = sra->devs; sd; sd = sd->next) { | |
757 | if (sd->disk.state & (1<<MD_DISK_FAULTY)) | |
758 | continue; | |
759 | if (sd->disk.state & (1<<MD_DISK_SYNC)) { | |
760 | char *dn = map_dev(sd->disk.major, | |
761 | sd->disk.minor, 1); | |
762 | fdlist[sd->disk.raid_disk] | |
763 | = dev_open(dn, O_RDONLY); | |
764 | offsets[sd->disk.raid_disk] = sd->data_offset*512; | |
765 | if (fdlist[sd->disk.raid_disk] < 0) { | |
766 | fprintf(stderr, | |
767 | Name ": %s: cannot open component %s\n", | |
768 | devname, dn ? dn : "-unknown-"); | |
769 | d = -1; | |
770 | goto release; | |
771 | } | |
772 | } else if (backup_file == NULL) { | |
773 | /* spare */ | |
774 | char *dn = map_dev(sd->disk.major, | |
775 | sd->disk.minor, 1); | |
776 | fdlist[d] = dev_open(dn, O_RDWR); | |
777 | offsets[d] = (sd->data_offset + sra->component_size - blocks - 8)*512; | |
778 | if (fdlist[d] < 0) { | |
779 | fprintf(stderr, Name ": %s: cannot open component %s\n", | |
780 | devname, dn ? dn : "-unknown-"); | |
781 | d = -1; | |
782 | goto release; | |
783 | } | |
784 | d++; | |
785 | } | |
786 | } | |
787 | release: | |
788 | return d; | |
789 | } | |
790 | ||
791 | int reshape_open_backup_file(char *backup_file, | |
792 | int fd, | |
793 | char *devname, | |
794 | long blocks, | |
795 | int *fdlist, | |
796 | unsigned long long *offsets) | |
797 | { | |
798 | /* Return 1 on success, 0 on any form of failure */ | |
799 | /* need to check backup file is large enough */ | |
800 | char buf[512]; | |
801 | struct stat stb; | |
802 | unsigned int dev; | |
803 | int i; | |
804 | ||
805 | *fdlist = open(backup_file, O_RDWR|O_CREAT|O_EXCL, | |
806 | S_IRUSR | S_IWUSR); | |
807 | *offsets = 8 * 512; | |
808 | if (*fdlist < 0) { | |
809 | fprintf(stderr, Name ": %s: cannot create backup file %s: %s\n", | |
810 | devname, backup_file, strerror(errno)); | |
811 | return 0; | |
812 | } | |
813 | /* Guard against backup file being on array device. | |
814 | * If array is partitioned or if LVM etc is in the | |
815 | * way this will not notice, but it is better than | |
816 | * nothing. | |
817 | */ | |
818 | fstat(*fdlist, &stb); | |
819 | dev = stb.st_dev; | |
820 | fstat(fd, &stb); | |
821 | if (stb.st_rdev == dev) { | |
822 | fprintf(stderr, Name ": backup file must NOT be" | |
823 | " on the array being reshaped.\n"); | |
824 | close(*fdlist); | |
825 | return 0; | |
826 | } | |
827 | ||
828 | memset(buf, 0, 512); | |
829 | for (i=0; i < blocks + 1 ; i++) { | |
830 | if (write(*fdlist, buf, 512) != 512) { | |
831 | fprintf(stderr, Name ": %s: cannot create" | |
832 | " backup file %s: %s\n", | |
833 | devname, backup_file, strerror(errno)); | |
834 | return 0; | |
835 | } | |
836 | } | |
837 | if (fsync(*fdlist) != 0) { | |
838 | fprintf(stderr, Name ": %s: cannot create backup file %s: %s\n", | |
839 | devname, backup_file, strerror(errno)); | |
840 | return 0; | |
841 | } | |
842 | ||
843 | return 1; | |
844 | } | |
845 | ||
846 | unsigned long compute_backup_blocks(int nchunk, int ochunk, | |
847 | unsigned int ndata, unsigned int odata) | |
848 | { | |
849 | unsigned long a, b, blocks; | |
850 | /* So how much do we need to backup. | |
851 | * We need an amount of data which is both a whole number of | |
852 | * old stripes and a whole number of new stripes. | |
853 | * So LCM for (chunksize*datadisks). | |
854 | */ | |
855 | a = (ochunk/512) * odata; | |
856 | b = (nchunk/512) * ndata; | |
857 | /* Find GCD */ | |
858 | while (a != b) { | |
859 | if (a < b) | |
860 | b -= a; | |
861 | if (b < a) | |
862 | a -= b; | |
863 | } | |
864 | /* LCM == product / GCD */ | |
865 | blocks = (ochunk/512) * (nchunk/512) * odata * ndata / a; | |
866 | ||
867 | return blocks; | |
868 | } | |
869 | ||
870 | /* 'struct reshape' records the intermediate states | |
871 | * a general reshape. | |
872 | * The starting geometry is converted to the 'before' geometry | |
873 | * by at most an atomic level change. They could be the same. | |
874 | * Similarly the 'after' geometry is converted to the final | |
875 | * geometry by at most a level change. | |
876 | * Note that 'before' and 'after' must have the same level. | |
877 | * 'blocks' is the minimum number of sectors for a reshape unit. | |
878 | * This will be a multiple of the stripe size in each of the | |
879 | * 'before' and 'after' geometries. | |
880 | * If 'blocks' is 0, no restriping is necessary. | |
881 | */ | |
882 | struct reshape { | |
883 | int level; | |
884 | int parity; /* number of parity blocks/devices */ | |
885 | struct { | |
886 | int layout; | |
887 | int data_disks; | |
888 | } before, after; | |
889 | unsigned long long backup_blocks; | |
890 | unsigned long long stripes; /* number of old stripes that comprise 'blocks'*/ | |
891 | unsigned long long new_size; /* New size of array in sectors */ | |
892 | }; | |
893 | ||
894 | char *analyse_change(struct mdinfo *info, struct reshape *re) | |
895 | { | |
896 | /* Based on the current array state in info->array and | |
897 | * the changes in info->new_* etc, determine: | |
898 | * - whether the change is possible | |
899 | * - Intermediate level/raid_disks/layout | |
900 | * - whether a restriping reshape is needed | |
901 | * - number of sectors in minimum change unit. This | |
902 | * will cover a whole number of stripes in 'before' and | |
903 | * 'after'. | |
904 | * | |
905 | * Return message if the change should be rejected | |
906 | * NULL if the change can be achieved | |
907 | * | |
908 | * This can be called as part of starting a reshape, or | |
909 | * when assembling an array that is undergoing reshape. | |
910 | */ | |
911 | int new_disks; | |
912 | ||
913 | /* If a new level not explicitly given, we assume no-change */ | |
914 | if (info->new_level == UnSet) | |
915 | info->new_level = info->array.level; | |
916 | ||
917 | if (info->new_chunk) | |
918 | switch (info->new_level) { | |
919 | case 0: | |
920 | case 4: | |
921 | case 5: | |
922 | case 6: | |
923 | case 10: | |
924 | /* chunk size is meaningful, must divide component_size | |
925 | * evenly | |
926 | */ | |
927 | if (info->component_size % (info->new_chunk/512)) | |
928 | return "New chunk size does not" | |
929 | " divide component size"; | |
930 | break; | |
931 | default: | |
932 | return "chunk size not meaningful for this level"; | |
933 | } | |
934 | else | |
935 | info->new_chunk = info->array.chunk_size; | |
936 | ||
937 | switch (info->array.level) { | |
938 | case 1: | |
939 | /* RAID1 can convert to RAID1 with different disks, or | |
940 | * raid5 with 2 disks | |
941 | */ | |
942 | if (info->new_level == 1) { | |
943 | if (info->delta_disks == UnSet) | |
944 | /* Don't know what to do */ | |
945 | return "no change requested for Growing RAID1"; | |
946 | re->level = 1; | |
947 | re->before.data_disks = (info->array.raid_disks + | |
948 | info->delta_disks); | |
949 | re->before.layout = 0; | |
950 | re->backup_blocks = 0; | |
951 | re->parity = 0; | |
952 | return NULL; | |
953 | } | |
954 | if (info->array.raid_disks == 2 && | |
955 | info->array.raid_disks == 5) { | |
956 | /* simple in-place conversion */ | |
957 | re->level = 5; | |
958 | re->parity = 1; | |
959 | re->before.data_disks = 1; | |
960 | re->before.layout = ALGORITHM_LEFT_SYMMETRIC; | |
961 | re->backup_blocks = 0; | |
962 | return NULL; | |
963 | } | |
964 | /* Could do some multi-stage conversions, but leave that to | |
965 | * later. | |
966 | */ | |
967 | return "Impossibly level change request for RAID1"; | |
968 | ||
969 | case 10: | |
970 | /* RAID10 can only be converted from near mode to | |
971 | * RAID0 by removing some devices | |
972 | */ | |
973 | if ((info->array.layout & ~0xff) != 0x100) | |
974 | return "Cannot Grow RAID10 with far/offset layout"; | |
975 | /* number of devices must be multiple of number of copies */ | |
976 | if (info->array.raid_disks % (info->array.layout & 0xff)) | |
977 | return "RAID10 layout too complex for Grow operation"; | |
978 | ||
979 | if (info->new_level != 0) | |
980 | return "RAID10 can only be changed to RAID0"; | |
981 | new_disks = (info->array.raid_disks | |
982 | / (info->array.layout & 0xff)); | |
983 | if (info->delta_disks != UnSet) { | |
984 | info->delta_disks = (new_disks | |
985 | - info->array.raid_disks); | |
986 | } | |
987 | if (info->delta_disks != new_disks - info->array.raid_disks) | |
988 | return "New number of raid-devices impossible for RAID10"; | |
989 | if (info->new_chunk && | |
990 | info->new_chunk != info->array.chunk_size) | |
991 | return "Cannot change chunk-size with RAID10 Grow"; | |
992 | ||
993 | /* looks good */ | |
994 | re->level = 0; | |
995 | re->parity = 0; | |
996 | re->before.data_disks = new_disks; | |
997 | re->before.layout = 0; | |
998 | re->backup_blocks = 0; | |
999 | return NULL; | |
1000 | ||
1001 | case 0: | |
1002 | /* RAID0 can be converted to RAID10, or to RAID456 */ | |
1003 | if (info->new_level == 10) { | |
1004 | if (info->new_layout == UnSet && info->delta_disks == UnSet) { | |
1005 | /* Assume near=2 layout */ | |
1006 | info->new_layout = 0x102; | |
1007 | info->delta_disks = info->array.raid_disks; | |
1008 | } | |
1009 | if (info->new_layout == UnSet) { | |
1010 | int copies = 1 + (info->delta_disks | |
1011 | / info->array.raid_disks); | |
1012 | if (info->array.raid_disks * (copies-1) | |
1013 | != info->delta_disks) | |
1014 | return "Impossible number of devices" | |
1015 | " for RAID0->RAID10"; | |
1016 | info->new_layout = 0x100 + copies; | |
1017 | } | |
1018 | if (info->delta_disks == UnSet) { | |
1019 | int copies = info->new_layout & 0xff; | |
1020 | if (info->new_layout != 0x100 + copies) | |
1021 | return "New layout impossible" | |
1022 | " for RAID0->RAID10";; | |
1023 | info->delta_disks = (copies - 1) * | |
1024 | info->array.raid_disks; | |
1025 | } | |
1026 | if (info->new_chunk && | |
1027 | info->new_chunk != info->array.chunk_size) | |
1028 | return "Cannot change chunk-size with RAID0->RAID10"; | |
1029 | /* looks good */ | |
1030 | re->level = 10; | |
1031 | re->parity = 0; | |
1032 | re->before.data_disks = (info->array.raid_disks + | |
1033 | info->delta_disks); | |
1034 | re->before.layout = info->new_layout; | |
1035 | re->backup_blocks = 0; | |
1036 | return NULL; | |
1037 | } | |
1038 | ||
1039 | /* RAID0 can also covert to RAID0/4/5/6 by first converting to | |
1040 | * a raid4 style layout of the final level. | |
1041 | */ | |
1042 | switch (info->new_level) { | |
1043 | case 0: | |
1044 | case 4: | |
1045 | re->level = 4; | |
1046 | re->before.layout = 0; | |
1047 | break; | |
1048 | case 5: | |
1049 | re->level = 5; | |
1050 | re->before.layout = ALGORITHM_PARITY_N; | |
1051 | break; | |
1052 | case 6: | |
1053 | re->level = 6; | |
1054 | re->before.layout = ALGORITHM_PARITY_N; | |
1055 | break; | |
1056 | default: | |
1057 | return "Impossible level change requested"; | |
1058 | } | |
1059 | re->before.data_disks = info->array.raid_disks; | |
1060 | /* determining 'after' layout happens outside this 'switch' */ | |
1061 | break; | |
1062 | ||
1063 | case 4: | |
1064 | info->array.layout = ALGORITHM_PARITY_N; | |
1065 | case 5: | |
1066 | switch (info->new_level) { | |
1067 | case 4: | |
1068 | re->level = info->array.level; | |
1069 | re->before.data_disks = info->array.raid_disks - 1; | |
1070 | re->before.layout = info->array.layout; | |
1071 | break; | |
1072 | case 5: | |
1073 | re->level = 5; | |
1074 | re->before.data_disks = info->array.raid_disks - 1; | |
1075 | re->before.layout = info->array.layout; | |
1076 | break; | |
1077 | case 6: | |
1078 | re->level = 6; | |
1079 | re->before.data_disks = info->array.raid_disks - 1; | |
1080 | switch (info->array.layout) { | |
1081 | case ALGORITHM_LEFT_ASYMMETRIC: | |
1082 | re->before.layout = ALGORITHM_LEFT_ASYMMETRIC_6; | |
1083 | break; | |
1084 | case ALGORITHM_RIGHT_ASYMMETRIC: | |
1085 | re->before.layout = ALGORITHM_RIGHT_ASYMMETRIC_6; | |
1086 | break; | |
1087 | case ALGORITHM_LEFT_SYMMETRIC: | |
1088 | re->before.layout = ALGORITHM_LEFT_SYMMETRIC_6; | |
1089 | break; | |
1090 | case ALGORITHM_RIGHT_SYMMETRIC: | |
1091 | re->before.layout = ALGORITHM_RIGHT_SYMMETRIC_6; | |
1092 | break; | |
1093 | case ALGORITHM_PARITY_0: | |
1094 | re->before.layout = ALGORITHM_PARITY_0_6; | |
1095 | break; | |
1096 | case ALGORITHM_PARITY_N: | |
1097 | re->before.layout = ALGORITHM_PARITY_N_6; | |
1098 | break; | |
1099 | default: | |
1100 | return "Cannot convert an array with this layout"; | |
1101 | } | |
1102 | break; | |
1103 | case 1: | |
1104 | if (info->array.raid_disks != 2) | |
1105 | return "Can only convert a 2-device array to RAID1"; | |
1106 | re->level = 1; | |
1107 | re->before.data_disks = 2; | |
1108 | re->before.layout = 0; | |
1109 | break; | |
1110 | default: | |
1111 | return "Impossible level change requested"; | |
1112 | } | |
1113 | break; | |
1114 | case 6: | |
1115 | switch (info->new_level) { | |
1116 | case 4: | |
1117 | case 5: | |
1118 | case 6: | |
1119 | re->level = 6; | |
1120 | re->before.data_disks = info->array.raid_disks - 2; | |
1121 | re->before.layout = info->array.layout; | |
1122 | break; | |
1123 | default: | |
1124 | return "Impossible level change requested"; | |
1125 | } | |
1126 | break; | |
1127 | } | |
1128 | ||
1129 | /* If we reached here then it looks like a re-stripe is | |
1130 | * happening. We have determined the intermediate level | |
1131 | * and initial raid_disks/layout and stored these in 're'. | |
1132 | * | |
1133 | * We need to deduce the final layout that can be atomically | |
1134 | * converted to the end state. | |
1135 | */ | |
1136 | switch (info->new_level) { | |
1137 | case 0: | |
1138 | /* We can only get to RAID0 from RAID4 or RAID5 | |
1139 | * with appropriate layout and one extra device | |
1140 | */ | |
1141 | if (re->level != 4 && re->level != 5) | |
1142 | return "Cannot covert to RAID0 from this level"; | |
1143 | if (info->delta_disks == UnSet) | |
1144 | re->after.data_disks = re->before.data_disks; | |
1145 | else | |
1146 | re->after.data_disks = | |
1147 | info->array.raid_disks + info->delta_disks; | |
1148 | switch (re->level) { | |
1149 | case 4: | |
1150 | re->after.layout = 0 ; break; | |
1151 | case 5: | |
1152 | re->after.layout = ALGORITHM_PARITY_N; break; | |
1153 | } | |
1154 | break; | |
1155 | ||
1156 | case 4: | |
1157 | /* We can only get to RAID4 from RAID5 */ | |
1158 | if (re->level != 4 && re->level != 5) | |
1159 | return "Cannot convert to RAID4 from this level"; | |
1160 | if (info->delta_disks == UnSet) | |
1161 | re->after.data_disks = re->before.data_disks; | |
1162 | else | |
1163 | re->after.data_disks = | |
1164 | re->before.data_disks + info->delta_disks; | |
1165 | switch (re->level) { | |
1166 | case 4: | |
1167 | re->after.layout = 0 ; break; | |
1168 | case 5: | |
1169 | re->after.layout = ALGORITHM_PARITY_N; break; | |
1170 | } | |
1171 | break; | |
1172 | ||
1173 | case 5: | |
1174 | /* We get to RAID5 for RAID5 or RAID6 */ | |
1175 | if (re->level != 5 && re->level != 6) | |
1176 | return "Cannot convert to RAID5 from this level"; | |
1177 | if (info->delta_disks == UnSet) | |
1178 | re->after.data_disks = re->before.data_disks; | |
1179 | else if (re->level == 5) | |
1180 | re->after.data_disks = | |
1181 | re->before.data_disks + info->delta_disks; | |
1182 | else | |
1183 | re->after.data_disks = | |
1184 | info->array.raid_disks + info->delta_disks - 1; | |
1185 | switch (re->level) { | |
1186 | case 5: | |
1187 | if (info->new_layout == UnSet) | |
1188 | re->after.layout = re->before.layout; | |
1189 | else | |
1190 | re->after.layout = info->new_layout; | |
1191 | break; | |
1192 | case 6: | |
1193 | if (info->new_layout == UnSet) | |
1194 | info->new_layout = re->before.layout; | |
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 = info->array.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->backup_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->backup_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->backup_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 | /* reshape_* released the array */ | |
1599 | return rv; | |
1600 | release: | |
1601 | unfreeze(st, frozen); | |
1602 | return rv; | |
1603 | } | |
1604 | ||
1605 | static int reshape_array(char *container, int fd, char *devname, | |
1606 | struct supertype *st, struct mdinfo *info, | |
1607 | int force, | |
1608 | char *backup_file, int quiet, int forked) | |
1609 | { | |
1610 | struct reshape reshape; | |
1611 | int spares_needed; | |
1612 | char *msg; | |
1613 | int orig_level = UnSet; | |
1614 | int disks, odisks; | |
1615 | ||
1616 | struct mdu_array_info_s array; | |
1617 | char *c; | |
1618 | int rv = 0; | |
1619 | ||
1620 | int *fdlist; | |
1621 | unsigned long long *offsets; | |
1622 | int d; | |
1623 | int nrdisks; | |
1624 | int err; | |
1625 | int frozen; | |
1626 | unsigned long blocks, stripes; | |
1627 | unsigned long cache; | |
1628 | unsigned long long array_size; | |
1629 | int done; | |
1630 | struct mdinfo *sra, *sd; | |
1631 | ||
1632 | msg = analyse_change(info, &reshape); | |
1633 | if (msg) { | |
1634 | fprintf(stderr, Name ": %s\n", msg); | |
1635 | return 1; | |
1636 | } | |
1637 | if (ioctl(fd, GET_ARRAY_INFO, &array) != 0) { | |
1638 | dprintf("Canot get array information.\n"); | |
1639 | return 1; | |
1640 | } | |
1641 | spares_needed = max(reshape.before.data_disks, | |
1642 | reshape.after.data_disks) | |
1643 | + reshape.parity - array.raid_disks; | |
1644 | ||
1645 | if (!force && spares_needed > info->array.spare_disks) { | |
1646 | fprintf(stderr, | |
1647 | Name ": Need %d spare%s to avoid degraded array," | |
1648 | " and only have %d.\n" | |
1649 | " Use --force to over-ride this check.\n", | |
1650 | spares_needed, | |
1651 | spares_needed == 1 ? "" : "s", | |
1652 | info->array.spare_disks); | |
1653 | return 1; | |
1654 | } | |
1655 | ||
1656 | if (reshape.level != info->array.level) { | |
1657 | char *c = map_num(pers, reshape.level); | |
1658 | int err; | |
1659 | if (c == NULL) | |
1660 | return 1; /* This should not be possible */ | |
1661 | ||
1662 | err = sysfs_set_str(info, NULL, "level", c); | |
1663 | if (err) { | |
1664 | err = errno; | |
1665 | fprintf(stderr, Name ": %s: could not set level to %s\n", | |
1666 | devname, c); | |
1667 | if (err == EBUSY && | |
1668 | (info->array.state & (1<<MD_SB_BITMAP_PRESENT))) | |
1669 | fprintf(stderr, " Bitmap must be removed" | |
1670 | " before level can be changed\n"); | |
1671 | return 1; | |
1672 | } | |
1673 | if (!quiet) | |
1674 | fprintf(stderr, Name ": level of %s changed to %s\n", | |
1675 | devname, c); | |
1676 | orig_level = info->array.level; | |
1677 | } | |
1678 | ||
1679 | if (reshape.level > 0 && st->ss->external && | |
1680 | !mdmon_running(st->container_dev)) { | |
1681 | start_mdmon(st->container_dev); | |
1682 | ping_monitor(container); | |
1683 | } | |
1684 | ||
1685 | /* ->reshape_super might have chosen some spares from the | |
1686 | * container that it wants to be part of the new array. | |
1687 | * We can collect them with ->container_content and give | |
1688 | * them to the kernel. | |
1689 | */ | |
1690 | if (st->ss->reshape_super && st->ss->container_content) { | |
1691 | char *subarray = strchr(info->text_version+1, '/')+1; | |
1692 | struct mdinfo *info2 = | |
1693 | st->ss->container_content(st, subarray); | |
1694 | struct mdinfo *d; | |
1695 | ||
1696 | if (info2) | |
1697 | for (d = info2->devs; d; d = d->next) { | |
1698 | if (d->disk.state == 0 && | |
1699 | d->disk.raid_disk >= 0) { | |
1700 | /* This is a spare that wants to | |
1701 | * be part of the array. | |
1702 | */ | |
1703 | add_disk(fd, st, info2, d); | |
1704 | } | |
1705 | } | |
1706 | sysfs_free(info2); | |
1707 | } | |
1708 | ||
1709 | if (reshape.backup_blocks == 0) { | |
1710 | /* No restriping needed, but we might need to impose | |
1711 | * some more changes: layout, raid_disks, chunk_size | |
1712 | */ | |
1713 | if (info->new_layout != UnSet && | |
1714 | info->new_layout != info->array.layout) { | |
1715 | info->array.layout = info->new_layout; | |
1716 | if (ioctl(fd, SET_ARRAY_INFO, &info->array) != 0) { | |
1717 | fprintf(stderr, Name ": failed to set new layout\n"); | |
1718 | rv = 1; | |
1719 | } else if (!quiet) | |
1720 | printf("layout for %s set to %d\n", | |
1721 | devname, info->array.layout); | |
1722 | } | |
1723 | if (info->delta_disks != UnSet && | |
1724 | info->delta_disks != 0) { | |
1725 | info->array.raid_disks += info->delta_disks; | |
1726 | if (ioctl(fd, SET_ARRAY_INFO, &info->array) != 0) { | |
1727 | fprintf(stderr, Name ": failed to set raid disks\n"); | |
1728 | rv = 1; | |
1729 | } else if (!quiet) | |
1730 | printf("raid_disks for %s set to %d\n", | |
1731 | devname, info->array.raid_disks); | |
1732 | } | |
1733 | if (info->new_chunk != 0 && | |
1734 | info->new_chunk != info->array.chunk_size) { | |
1735 | if (sysfs_set_num(info, NULL, | |
1736 | "chunk_size", info->new_chunk) != 0) { | |
1737 | fprintf(stderr, Name ": failed to set chunk size\n"); | |
1738 | rv = 1; | |
1739 | } else if (!quiet) | |
1740 | printf("chunk size for %s set to %d\n", | |
1741 | devname, info->array.chunk_size); | |
1742 | } | |
1743 | ||
1744 | return rv; | |
1745 | } | |
1746 | ||
1747 | /* | |
1748 | * There are three possibilities. | |
1749 | * 1/ The array will shrink. | |
1750 | * We need to ensure the reshape will pause before reaching | |
1751 | * the 'critical section'. We also need to fork and wait for | |
1752 | * that to happen. When it does we | |
1753 | * suspend/backup/complete/unfreeze | |
1754 | * | |
1755 | * 2/ The array will not change size. | |
1756 | * This requires that we keep a backup of a sliding window | |
1757 | * so that we can restore data after a crash. So we need | |
1758 | * to fork and monitor progress. | |
1759 | * In future we will allow the data_offset to change, so | |
1760 | * a sliding backup becomes unnecessary. | |
1761 | * | |
1762 | * 3/ The array will grow. This is relatively easy. | |
1763 | * However the kernel's restripe routines will cheerfully | |
1764 | * overwrite some early data before it is safe. So we | |
1765 | * need to make a backup of the early parts of the array | |
1766 | * and be ready to restore it if rebuild aborts very early. | |
1767 | * For externally managed metadata, we still need a forked | |
1768 | * child to monitor the reshape and suspend IO over the region | |
1769 | * that is being reshaped. | |
1770 | * | |
1771 | * We backup data by writing it to one spare, or to a | |
1772 | * file which was given on command line. | |
1773 | * | |
1774 | * In each case, we first make sure that storage is available | |
1775 | * for the required backup. | |
1776 | * Then we: | |
1777 | * - request the shape change. | |
1778 | * - fork to handle backup etc. | |
1779 | */ | |
1780 | ||
1781 | /* Check that we can hold all the data */ | |
1782 | get_dev_size(fd, NULL, &array_size); | |
1783 | if (reshape.new_size < (array_size/512)) { | |
1784 | fprintf(stderr, | |
1785 | Name ": this change will reduce the size of the array.\n" | |
1786 | " use --grow --array-size first to truncate array.\n" | |
1787 | " e.g. mdadm --grow %s --array-size %llu\n", | |
1788 | devname, reshape.new_size/2); | |
1789 | rv = 1; | |
1790 | goto release; | |
1791 | } | |
1792 | ||
1793 | sra = sysfs_read(fd, 0, | |
1794 | GET_COMPONENT|GET_DEVS|GET_OFFSET|GET_STATE|GET_CHUNK| | |
1795 | GET_CACHE); | |
1796 | ||
1797 | if (!sra) { | |
1798 | fprintf(stderr, Name ": %s: Cannot get array details from sysfs\n", | |
1799 | devname); | |
1800 | rv = 1; | |
1801 | goto release; | |
1802 | } | |
1803 | ||
1804 | /* Decide how many blocks (sectors) for a reshape | |
1805 | * unit. The number we have so far is just a minimum | |
1806 | */ | |
1807 | blocks = reshape.backup_blocks; | |
1808 | if (reshape.before.data_disks == | |
1809 | reshape.after.data_disks) { | |
1810 | /* Make 'blocks' bigger for better throughput, but | |
1811 | * not so big that we reject it below. | |
1812 | * Try for 16 megabytes | |
1813 | */ | |
1814 | while (blocks * 32 < sra->component_size && | |
1815 | blocks < 16*1024*2) | |
1816 | blocks *= 2; | |
1817 | } else | |
1818 | fprintf(stderr, Name ": Need to backup %luK of critical " | |
1819 | "section..\n", blocks/2); | |
1820 | ||
1821 | if (blocks >= sra->component_size/2) { | |
1822 | fprintf(stderr, Name ": %s: Something wrong" | |
1823 | " - reshape aborted\n", | |
1824 | devname); | |
1825 | rv = 1; | |
1826 | goto release; | |
1827 | } | |
1828 | ||
1829 | /* Now we need to open all these devices so we can read/write. | |
1830 | */ | |
1831 | nrdisks = array.raid_disks + sra->array.spare_disks; | |
1832 | fdlist = malloc((1+nrdisks) * sizeof(int)); | |
1833 | offsets = malloc((1+nrdisks) * sizeof(offsets[0])); | |
1834 | if (!fdlist || !offsets) { | |
1835 | fprintf(stderr, Name ": malloc failed: grow aborted\n"); | |
1836 | rv = 1; | |
1837 | goto release; | |
1838 | } | |
1839 | ||
1840 | d = reshape_prepare_fdlist(devname, sra, array.raid_disks, | |
1841 | nrdisks, blocks, backup_file, | |
1842 | fdlist, offsets); | |
1843 | if (d < 0) { | |
1844 | rv = 1; | |
1845 | goto release; | |
1846 | } | |
1847 | if (backup_file == NULL) { | |
1848 | if (reshape.after.data_disks <= reshape.before.data_disks) { | |
1849 | fprintf(stderr, | |
1850 | Name ": %s: Cannot grow - need backup-file\n", | |
1851 | devname); | |
1852 | rv = 1; | |
1853 | goto release; | |
1854 | } else if (sra->array.spare_disks == 0) { | |
1855 | fprintf(stderr, Name ": %s: Cannot grow - need a spare or " | |
1856 | "backup-file to backup critical section\n", | |
1857 | devname); | |
1858 | rv = 1; | |
1859 | goto release; | |
1860 | } | |
1861 | } else { | |
1862 | if (!reshape_open_backup_file(backup_file, fd, devname, | |
1863 | (signed)blocks, | |
1864 | fdlist+d, offsets+d)) { | |
1865 | rv = 1; | |
1866 | goto release; | |
1867 | } | |
1868 | d++; | |
1869 | } | |
1870 | ||
1871 | /* lastly, check that the internal stripe cache is | |
1872 | * large enough, or it won't work. | |
1873 | * It must hold at least 4 stripes of the larger | |
1874 | * chunk size | |
1875 | */ | |
1876 | cache = max(info->array.chunk_size, info->new_chunk); | |
1877 | cache *= 4; /* 4 stripes minimum */ | |
1878 | cache /= 512; /* convert to sectors */ | |
1879 | disks = min(reshape.before.data_disks, reshape.after.data_disks); | |
1880 | /* make sure there is room for 'blocks' with a bit to spare */ | |
1881 | if (cache < 16 + blocks / disks) | |
1882 | cache = 16 + blocks / disks; | |
1883 | cache /= (4096/512); /* Covert from sectors to pages */ | |
1884 | ||
1885 | if (sra->cache_size < cache) | |
1886 | subarray_set_num(container, sra, "stripe_cache_size", | |
1887 | cache+1); | |
1888 | ||
1889 | /* Right, everything seems fine. Let's kick things off. | |
1890 | * If only changing raid_disks, use ioctl, else use | |
1891 | * sysfs. | |
1892 | */ | |
1893 | sync_metadata(st); | |
1894 | ||
1895 | sra->new_chunk = info->new_chunk; | |
1896 | ||
1897 | if (info->array.chunk_size == info->new_chunk && | |
1898 | reshape.before.layout == reshape.after.layout && | |
1899 | st->ss->external == 0) { | |
1900 | array.raid_disks = reshape.after.data_disks + reshape.parity; | |
1901 | if (ioctl(fd, SET_ARRAY_INFO, &array) != 0) { | |
1902 | int err = errno; | |
1903 | rv = 1; | |
1904 | fprintf(stderr, | |
1905 | Name ": Cannot set device shape for %s: %s\n", | |
1906 | devname, strerror(errno)); | |
1907 | ||
1908 | if (err == EBUSY && | |
1909 | (array.state & (1<<MD_SB_BITMAP_PRESENT))) | |
1910 | fprintf(stderr, | |
1911 | " Bitmap must be removed before" | |
1912 | " shape can be changed\n"); | |
1913 | ||
1914 | goto release; | |
1915 | } | |
1916 | } else { | |
1917 | /* set them all just in case some old 'new_*' value | |
1918 | * persists from some earlier problem | |
1919 | */ | |
1920 | int err = err; /* only used if rv==1, and always set if | |
1921 | * rv==1, so initialisation not needed, | |
1922 | * despite gcc warning | |
1923 | */ | |
1924 | if (sysfs_set_num(sra, NULL, "chunk_size", info->new_chunk) < 0) | |
1925 | rv = 1, err = errno; | |
1926 | if (!rv && sysfs_set_num(sra, NULL, "layout", | |
1927 | reshape.after.layout) < 0) | |
1928 | rv = 1, err = errno; | |
1929 | if (!rv && subarray_set_num(container, sra, "raid_disks", | |
1930 | reshape.after.data_disks + | |
1931 | reshape.parity) < 0) | |
1932 | rv = 1, err = errno; | |
1933 | if (rv) { | |
1934 | fprintf(stderr, Name ": Cannot set device shape for %s\n", | |
1935 | devname); | |
1936 | ||
1937 | if (err == EBUSY && | |
1938 | (array.state & (1<<MD_SB_BITMAP_PRESENT))) | |
1939 | fprintf(stderr, | |
1940 | " Bitmap must be removed before" | |
1941 | " shape can be changed\n"); | |
1942 | goto release; | |
1943 | } | |
1944 | } | |
1945 | ||
1946 | start_reshape(sra); | |
1947 | if (st->ss->external) { | |
1948 | /* metadata handler takes it from here */ | |
1949 | ping_manager(container); | |
1950 | st->ss->manage_reshape(st, backup_file); | |
1951 | frozen = 0; | |
1952 | goto release; | |
1953 | } | |
1954 | ||
1955 | /* set up the backup-super-block. This requires the | |
1956 | * uuid from the array. | |
1957 | */ | |
1958 | /* Find a superblock */ | |
1959 | for (sd = sra->devs; sd; sd = sd->next) { | |
1960 | char *dn; | |
1961 | int devfd; | |
1962 | int ok; | |
1963 | if (sd->disk.state & (1<<MD_DISK_FAULTY)) | |
1964 | continue; | |
1965 | dn = map_dev(sd->disk.major, sd->disk.minor, 1); | |
1966 | devfd = dev_open(dn, O_RDONLY); | |
1967 | if (devfd < 0) | |
1968 | continue; | |
1969 | ok = st->ss->load_super(st, devfd, NULL); | |
1970 | close(devfd); | |
1971 | if (ok >= 0) | |
1972 | break; | |
1973 | } | |
1974 | if (!sd) { | |
1975 | fprintf(stderr, Name ": %s: Cannot find a superblock\n", | |
1976 | devname); | |
1977 | rv = 1; | |
1978 | abort_reshape(sra); | |
1979 | goto release; | |
1980 | } | |
1981 | ||
1982 | memset(&bsb, 0, 512); | |
1983 | memcpy(bsb.magic, "md_backup_data-1", 16); | |
1984 | st->ss->uuid_from_super(st, (int*)&bsb.set_uuid); | |
1985 | bsb.mtime = __cpu_to_le64(time(0)); | |
1986 | bsb.devstart2 = blocks; | |
1987 | ||
1988 | stripes = blocks / (info->array.chunk_size/512) / | |
1989 | reshape.before.data_disks; | |
1990 | ||
1991 | /* Now we just need to kick off the reshape and watch, while | |
1992 | * handling backups of the data... | |
1993 | * This is all done by a forked background process. | |
1994 | */ | |
1995 | switch(forked ? 0 : fork()) { | |
1996 | case 0: | |
1997 | close(fd); | |
1998 | if (check_env("MDADM_GROW_VERIFY")) | |
1999 | fd = open(devname, O_RDONLY | O_DIRECT); | |
2000 | else | |
2001 | fd = -1; | |
2002 | mlockall(MCL_FUTURE); | |
2003 | ||
2004 | odisks = reshape.before.data_disks + reshape.parity; | |
2005 | ||
2006 | done = child_monitor(fd, sra, &reshape, stripes, | |
2007 | fdlist, offsets, | |
2008 | d - odisks, fdlist+odisks, offsets+odisks); | |
2009 | ||
2010 | if (backup_file && done) | |
2011 | unlink(backup_file); | |
2012 | if (!done) { | |
2013 | abort_reshape(sra); | |
2014 | goto out; | |
2015 | } | |
2016 | /* set new array size if required customer_array_size is used | |
2017 | * by this metadata. | |
2018 | */ | |
2019 | if (reshape.before.data_disks != | |
2020 | reshape.after.data_disks && | |
2021 | info->custom_array_size) { | |
2022 | struct mdinfo *info2; | |
2023 | char *subarray = strchr(info->text_version+1, '/')+1; | |
2024 | ||
2025 | wait_reshape(sra); | |
2026 | ping_monitor(container); | |
2027 | ||
2028 | info2 = st->ss->container_content(st, subarray); | |
2029 | if (info2) { | |
2030 | unsigned long long current_size = 0; | |
2031 | unsigned long long new_size = | |
2032 | info2->custom_array_size/2; | |
2033 | ||
2034 | if (sysfs_get_ll(sra, | |
2035 | NULL, | |
2036 | "array_size", | |
2037 | ¤t_size) == 0 && | |
2038 | new_size > current_size) { | |
2039 | if (sysfs_set_num(sra, NULL, | |
2040 | "array_size", new_size) | |
2041 | < 0) | |
2042 | dprintf("Error: Cannot" | |
2043 | " set array size"); | |
2044 | else | |
2045 | dprintf("Array size " | |
2046 | "changed"); | |
2047 | dprintf(" from %llu to %llu.\n", | |
2048 | current_size, new_size); | |
2049 | } | |
2050 | sysfs_free(info2); | |
2051 | } | |
2052 | } | |
2053 | ||
2054 | if (info->new_level != reshape.level) { | |
2055 | /* We need to wait for the reshape to finish | |
2056 | * (which will have happened unless | |
2057 | * odata < ndata) and then set the level | |
2058 | */ | |
2059 | ||
2060 | if (reshape.before.data_disks < | |
2061 | reshape.after.data_disks) | |
2062 | wait_reshape(sra); | |
2063 | ||
2064 | c = map_num(pers, info->new_level); | |
2065 | if (c == NULL) | |
2066 | goto out;/* not possible */ | |
2067 | ||
2068 | err = sysfs_set_str(sra, NULL, "level", c); | |
2069 | if (err) | |
2070 | fprintf(stderr, Name\ | |
2071 | ": %s: could not set level " | |
2072 | "to %s\n", devname, c); | |
2073 | } | |
2074 | out: | |
2075 | if (forked) | |
2076 | return 0; | |
2077 | exit(0); | |
2078 | case -1: | |
2079 | fprintf(stderr, Name ": Cannot run child to monitor reshape: %s\n", | |
2080 | strerror(errno)); | |
2081 | rv = 1; | |
2082 | abort_reshape(sra); | |
2083 | break; | |
2084 | default: | |
2085 | /* The child will take care of unfreezing the array */ | |
2086 | frozen = 0; | |
2087 | break; | |
2088 | } | |
2089 | ||
2090 | ||
2091 | release: | |
2092 | if (!rv) { | |
2093 | if (container) | |
2094 | ping_monitor(container); | |
2095 | if (st->ss->external) { | |
2096 | /* Re-load the metadata as much could have changed */ | |
2097 | int cfd = open_dev(st->container_dev); | |
2098 | if (cfd >= 0) { | |
2099 | st->ss->free_super(st); | |
2100 | st->ss->load_container(st, cfd, container); | |
2101 | close(cfd); | |
2102 | } | |
2103 | } | |
2104 | } | |
2105 | if (rv && orig_level != UnSet && sra) { | |
2106 | c = map_num(pers, orig_level); | |
2107 | if (c && sysfs_set_str(sra, NULL, "level", c) == 0) | |
2108 | fprintf(stderr, Name ": aborting level change\n"); | |
2109 | } | |
2110 | unfreeze(st, frozen); | |
2111 | return rv; | |
2112 | } | |
2113 | ||
2114 | int reshape_container(char *container, int cfd, char *devname, | |
2115 | struct supertype *st, | |
2116 | struct mdinfo *info, | |
2117 | int force, | |
2118 | char *backup_file, | |
2119 | int quiet) | |
2120 | { | |
2121 | struct mdinfo *cc = NULL; | |
2122 | ||
2123 | if (reshape_super(st, info->component_size, info->new_level, | |
2124 | info->new_layout, info->new_chunk, | |
2125 | info->array.raid_disks + info->delta_disks, | |
2126 | backup_file, devname, quiet)) | |
2127 | return 1; | |
2128 | ||
2129 | sync_metadata(st); | |
2130 | ||
2131 | /* ping monitor to be sure that update is on disk | |
2132 | */ | |
2133 | ping_monitor(container); | |
2134 | ||
2135 | switch (fork()) { | |
2136 | case -1: /* error */ | |
2137 | perror("Cannot fork to complete reshape\n"); | |
2138 | return 1; | |
2139 | default: /* parent */ | |
2140 | printf(Name ": multi-array reshape continues in background\n"); | |
2141 | return 0; | |
2142 | case 0: /* child */ | |
2143 | break; | |
2144 | } | |
2145 | ||
2146 | while(1) { | |
2147 | /* For each member array with reshape_active, | |
2148 | * we need to perform the reshape. | |
2149 | * We pick the first array that needs reshaping and | |
2150 | * reshape it. reshape_array() will re-read the metadata | |
2151 | * so the next time through a different array should be | |
2152 | * ready for reshape. | |
2153 | */ | |
2154 | struct mdinfo *content; | |
2155 | int rv; | |
2156 | int fd; | |
2157 | struct mdstat_ent *mdstat; | |
2158 | char *adev; | |
2159 | ||
2160 | sysfs_free(cc); | |
2161 | ||
2162 | cc = st->ss->container_content(st, NULL); | |
2163 | ||
2164 | for (content = cc; content ; content = content->next) { | |
2165 | char *subarray; | |
2166 | if (!content->reshape_active) | |
2167 | continue; | |
2168 | ||
2169 | subarray = strchr(content->text_version+1, '/')+1; | |
2170 | mdstat = mdstat_by_subdev(subarray, | |
2171 | devname2devnum(container)); | |
2172 | if (!mdstat) | |
2173 | continue; | |
2174 | break; | |
2175 | } | |
2176 | if (!content) | |
2177 | break; | |
2178 | ||
2179 | fd = open_dev_excl(mdstat->devnum); | |
2180 | if (fd < 0) | |
2181 | break; | |
2182 | adev = map_dev(dev2major(mdstat->devnum), | |
2183 | dev2minor(mdstat->devnum), | |
2184 | 0); | |
2185 | if (!adev) | |
2186 | adev = content->text_version; | |
2187 | ||
2188 | sysfs_init(content, fd, mdstat->devnum); | |
2189 | ||
2190 | rv = reshape_array(container, fd, adev, st, | |
2191 | content, force, | |
2192 | backup_file, quiet, 1); | |
2193 | close(fd); | |
2194 | if (rv) | |
2195 | break; | |
2196 | } | |
2197 | sysfs_free(cc); | |
2198 | exit(0); | |
2199 | } | |
2200 | ||
2201 | /* | |
2202 | * We run a child process in the background which performs the following | |
2203 | * steps: | |
2204 | * - wait for resync to reach a certain point | |
2205 | * - suspend io to the following section | |
2206 | * - backup that section | |
2207 | * - allow resync to proceed further | |
2208 | * - resume io | |
2209 | * - discard the backup. | |
2210 | * | |
2211 | * When are combined in slightly different ways in the three cases. | |
2212 | * Grow: | |
2213 | * - suspend/backup/allow/wait/resume/discard | |
2214 | * Shrink: | |
2215 | * - allow/wait/suspend/backup/allow/wait/resume/discard | |
2216 | * same-size: | |
2217 | * - wait/resume/discard/suspend/backup/allow | |
2218 | * | |
2219 | * suspend/backup/allow always come together | |
2220 | * wait/resume/discard do too. | |
2221 | * For the same-size case we have two backups to improve flow. | |
2222 | * | |
2223 | */ | |
2224 | ||
2225 | int progress_reshape(struct mdinfo *info, struct reshape *reshape, | |
2226 | unsigned long long backup_point, | |
2227 | unsigned long long wait_point, | |
2228 | unsigned long long *suspend_point, | |
2229 | unsigned long long *reshape_completed) | |
2230 | { | |
2231 | /* This function is called repeatedly by the reshape manager. | |
2232 | * It determines how much progress can safely be made and allows | |
2233 | * that progress. | |
2234 | * - 'info' identifies the array and particularly records in | |
2235 | * ->reshape_progress the metadata's knowledge of progress | |
2236 | * This is a sector offset from the start of the array | |
2237 | * of the next array block to be relocated. This number | |
2238 | * may increase from 0 or decrease from array_size, depending | |
2239 | * on the type of reshape that is happening. | |
2240 | * Note that in contrast, 'sync_completed' is a block count of the | |
2241 | * reshape so far. It gives the distance between the start point | |
2242 | * (head or tail of device) and the next place that data will be | |
2243 | * written. It always increases. | |
2244 | * - 'reshape' is the structure created by analyse_change | |
2245 | * - 'backup_point' shows how much the metadata manager has backed-up | |
2246 | * data. For reshapes with increasing progress, it is the next address | |
2247 | * to be backed up, previous addresses have been backed-up. For | |
2248 | * decreasing progress, it is the earliest address that has been | |
2249 | * backed up - later address are also backed up. | |
2250 | * So addresses between reshape_progress and backup_point are | |
2251 | * backed up providing those are in the 'correct' order. | |
2252 | * - 'wait_point' is an array address. When reshape_completed | |
2253 | * passes this point, progress_reshape should return. It might | |
2254 | * return earlier if it determines that ->reshape_progress needs | |
2255 | * to be updated or further backup is needed. | |
2256 | * - suspend_point is maintained by progress_reshape and the caller | |
2257 | * should not touch it except to initialise to zero. | |
2258 | * It is an array address and it only increases in 2.6.37 and earlier. | |
2259 | * This makes it difficult to handle reducing reshapes with | |
2260 | * external metadata. | |
2261 | * However: it is similar to backup_point in that it records the | |
2262 | * other end of a suspended region from reshape_progress. | |
2263 | * it is moved to extend the region that is safe to backup and/or | |
2264 | * reshape | |
2265 | * - reshape_completed is read from sysfs and returned. The caller | |
2266 | * should copy this into ->reshape_progress when it has reason to | |
2267 | * believe that the metadata knows this, and any backup outside this | |
2268 | * has been erased. | |
2269 | * | |
2270 | * Return value is: | |
2271 | * 1 if more data from backup_point - but only as far as suspend_point, | |
2272 | * should be backed up | |
2273 | * 0 if things are progressing smoothly | |
2274 | * -1 if the reshape is finished, either because it is all done, | |
2275 | * or due to an error. | |
2276 | */ | |
2277 | ||
2278 | int advancing = (reshape->after.data_disks | |
2279 | >= reshape->before.data_disks); | |
2280 | unsigned long long need_backup; /* need to eventually backup all the way | |
2281 | * to here | |
2282 | */ | |
2283 | unsigned long long read_offset, write_offset; | |
2284 | unsigned long long write_range; | |
2285 | unsigned long long max_progress, target, completed; | |
2286 | unsigned long long array_size = (info->component_size | |
2287 | * reshape->before.data_disks); | |
2288 | int fd; | |
2289 | ||
2290 | /* First, we unsuspend any region that is now known to be safe. | |
2291 | * If suspend_point is on the 'wrong' side of reshape_progress, then | |
2292 | * we don't have or need suspension at the moment. This is true for | |
2293 | * native metadata when we don't need to back-up. | |
2294 | */ | |
2295 | if (advancing) { | |
2296 | if (info->reshape_progress <= *suspend_point) | |
2297 | sysfs_set_num(info, NULL, "suspend_lo", | |
2298 | info->reshape_progress); | |
2299 | } else { | |
2300 | /* Note: this won't work in 2.6.37 and before. | |
2301 | * Something somewhere should make sure we don't need it! | |
2302 | */ | |
2303 | if (info->reshape_progress >= *suspend_point) | |
2304 | sysfs_set_num(info, NULL, "suspend_hi", | |
2305 | info->reshape_progress); | |
2306 | } | |
2307 | ||
2308 | /* Now work out how far it is safe to progress. | |
2309 | * If the read_offset for ->reshape_progress is less than | |
2310 | * 'blocks' beyond the write_offset, we can only progress as far | |
2311 | * as a backup. | |
2312 | * Otherwise we can progress until the write_offset for the new location | |
2313 | * reaches (within 'blocks' of) the read_offset at the current location. | |
2314 | * However that region must be suspended unless we are using native | |
2315 | * metadata. | |
2316 | * If we need to suspend more, we limit it to 128M per device, which is | |
2317 | * rather arbitrary and should be some time-based calculation. | |
2318 | */ | |
2319 | read_offset = info->reshape_progress / reshape->before.data_disks; | |
2320 | write_offset = info->reshape_progress / reshape->after.data_disks; | |
2321 | write_range = info->new_chunk/512; | |
2322 | if (advancing) { | |
2323 | need_backup = 0; | |
2324 | if (read_offset < write_offset + write_range) { | |
2325 | max_progress = backup_point; | |
2326 | if (reshape->before.data_disks == reshape->after.data_disks) | |
2327 | need_backup = array_size; | |
2328 | else | |
2329 | need_backup = reshape->backup_blocks; | |
2330 | } else { | |
2331 | max_progress = | |
2332 | read_offset * | |
2333 | reshape->after.data_disks; | |
2334 | } | |
2335 | } else { | |
2336 | need_backup = array_size; | |
2337 | if (read_offset > write_offset - write_range) { | |
2338 | max_progress = backup_point; | |
2339 | if (max_progress >= info->reshape_progress) | |
2340 | need_backup = 0; | |
2341 | } else { | |
2342 | max_progress = | |
2343 | read_offset * | |
2344 | reshape->after.data_disks; | |
2345 | /* If we are using internal metadata, then we can | |
2346 | * progress all the way to the suspend_point without | |
2347 | * worrying about backing-up/suspending along the | |
2348 | * way. | |
2349 | */ | |
2350 | if (max_progress < *suspend_point && | |
2351 | info->array.major_version >= 0) | |
2352 | max_progress = *suspend_point; | |
2353 | } | |
2354 | } | |
2355 | ||
2356 | /* We know it is safe to progress to 'max_progress' providing | |
2357 | * it is suspended or we are using native metadata. | |
2358 | * Consider extending suspend_point 128M per device if it | |
2359 | * is less than 64M per device beyond reshape_progress. | |
2360 | * But always do a multiple of 'blocks' | |
2361 | */ | |
2362 | target = 64*1024*2 * min(reshape->before.data_disks, | |
2363 | reshape->after.data_disks); | |
2364 | target /= reshape->backup_blocks; | |
2365 | if (target < 2) | |
2366 | target = 2; | |
2367 | target *= reshape->backup_blocks; | |
2368 | ||
2369 | /* For externally managed metadata we always need to suspend IO to | |
2370 | * the area being reshaped so we regularly push suspend_point forward. | |
2371 | * For native metadata we only need the suspend if we are going to do | |
2372 | * a backup. | |
2373 | */ | |
2374 | if (advancing) { | |
2375 | if ((need_backup > info->reshape_progress | |
2376 | || info->array.major_version < 0) && | |
2377 | *suspend_point < info->reshape_progress + target) { | |
2378 | if (need_backup < *suspend_point + 2 * target) | |
2379 | *suspend_point = need_backup; | |
2380 | else if (*suspend_point + 2 * target < array_size) | |
2381 | *suspend_point += 2 * target; | |
2382 | else | |
2383 | *suspend_point = array_size; | |
2384 | sysfs_set_num(info, NULL, "suspend_hi", *suspend_point); | |
2385 | if (max_progress > *suspend_point) | |
2386 | max_progress = *suspend_point; | |
2387 | } | |
2388 | } else { | |
2389 | if ((need_backup < info->reshape_progress | |
2390 | || info->array.major_version < 0) && | |
2391 | *suspend_point > info->reshape_progress - target) { | |
2392 | if (need_backup > *suspend_point - 2 * target) | |
2393 | *suspend_point = need_backup; | |
2394 | else if (*suspend_point >= 2 * target) | |
2395 | *suspend_point -= 2 * target; | |
2396 | else | |
2397 | *suspend_point = 0; | |
2398 | sysfs_set_num(info, NULL, "suspend_lo", *suspend_point); | |
2399 | if (max_progress < *suspend_point) | |
2400 | max_progress = *suspend_point; | |
2401 | } | |
2402 | } | |
2403 | ||
2404 | /* now set sync_max to allow that progress. sync_max, like | |
2405 | * sync_completed is a count of sectors written per device, so | |
2406 | * we find the difference between max_progress and the start point, | |
2407 | * and divide that by after.data_disks to get a sync_max | |
2408 | * number. | |
2409 | * At the same time we convert wait_point to a similar number | |
2410 | * for comparing against sync_completed. | |
2411 | */ | |
2412 | /* scale down max_progress to per_disk */ | |
2413 | max_progress /= reshape->after.data_disks; | |
2414 | /* Round to chunk size as some kernels give an erroneously high number */ | |
2415 | max_progress /= info->new_chunk/512; | |
2416 | max_progress *= info->new_chunk/512; | |
2417 | /* Limit progress to the whole device */ | |
2418 | if (max_progress > info->component_size) | |
2419 | max_progress = info->component_size; | |
2420 | wait_point /= reshape->after.data_disks; | |
2421 | if (!advancing) { | |
2422 | /* switch from 'device offset' to 'processed block count' */ | |
2423 | max_progress = info->component_size - max_progress; | |
2424 | wait_point = info->component_size - wait_point; | |
2425 | } | |
2426 | ||
2427 | sysfs_set_num(info, NULL, "sync_max", max_progress); | |
2428 | ||
2429 | /* Now wait. If we have already reached the point that we were | |
2430 | * asked to wait to, don't wait at all, else wait for any change. | |
2431 | * We need to select on 'sync_completed' as that is the place that | |
2432 | * notifications happen, but we are really interested in | |
2433 | * 'reshape_position' | |
2434 | */ | |
2435 | fd = sysfs_get_fd(info, NULL, "sync_completed"); | |
2436 | if (fd < 0) | |
2437 | return -1; | |
2438 | ||
2439 | if (sysfs_fd_get_ll(fd, &completed) < 0) { | |
2440 | close(fd); | |
2441 | return -1; | |
2442 | } | |
2443 | while (completed < max_progress && completed < wait_point) { | |
2444 | /* Check that sync_action is still 'reshape' to avoid | |
2445 | * waiting forever on a dead array | |
2446 | */ | |
2447 | char action[20]; | |
2448 | fd_set rfds; | |
2449 | if (sysfs_get_str(info, NULL, "sync_action", | |
2450 | action, 20) <= 0 || | |
2451 | strncmp(action, "reshape", 7) != 0) | |
2452 | break; | |
2453 | FD_ZERO(&rfds); | |
2454 | FD_SET(fd, &rfds); | |
2455 | select(fd+1, NULL, NULL, &rfds, NULL); | |
2456 | if (sysfs_fd_get_ll(fd, &completed) < 0) { | |
2457 | close(fd); | |
2458 | return -1; | |
2459 | } | |
2460 | } | |
2461 | /* some kernels can give an incorrectly high 'completed' number */ | |
2462 | completed /= (info->new_chunk/512); | |
2463 | completed *= (info->new_chunk/512); | |
2464 | /* Convert 'completed' back in to a 'progress' number */ | |
2465 | completed *= reshape->after.data_disks; | |
2466 | if (!advancing) { | |
2467 | completed = info->component_size * reshape->after.data_disks | |
2468 | - completed; | |
2469 | } | |
2470 | *reshape_completed = completed; | |
2471 | ||
2472 | close(fd); | |
2473 | ||
2474 | /* We return the need_backup flag. Caller will decide | |
2475 | * how much - a multiple of ->backup_blocks up to *suspend_point | |
2476 | */ | |
2477 | return advancing | |
2478 | ? (need_backup > info->reshape_progress) | |
2479 | : (need_backup < info->reshape_progress); | |
2480 | } | |
2481 | ||
2482 | ||
2483 | /* FIXME return status is never checked */ | |
2484 | static int grow_backup(struct mdinfo *sra, | |
2485 | unsigned long long offset, /* per device */ | |
2486 | unsigned long stripes, /* per device, in old chunks */ | |
2487 | int *sources, unsigned long long *offsets, | |
2488 | int disks, int chunk, int level, int layout, | |
2489 | int dests, int *destfd, unsigned long long *destoffsets, | |
2490 | int part, int *degraded, | |
2491 | char *buf) | |
2492 | { | |
2493 | /* Backup 'blocks' sectors at 'offset' on each device of the array, | |
2494 | * to storage 'destfd' (offset 'destoffsets'), after first | |
2495 | * suspending IO. Then allow resync to continue | |
2496 | * over the suspended section. | |
2497 | * Use part 'part' of the backup-super-block. | |
2498 | */ | |
2499 | int odata = disks; | |
2500 | int rv = 0; | |
2501 | int i; | |
2502 | unsigned long long ll; | |
2503 | int new_degraded; | |
2504 | //printf("offset %llu\n", offset); | |
2505 | if (level >= 4) | |
2506 | odata--; | |
2507 | if (level == 6) | |
2508 | odata--; | |
2509 | ||
2510 | /* Check that array hasn't become degraded, else we might backup the wrong data */ | |
2511 | sysfs_get_ll(sra, NULL, "degraded", &ll); | |
2512 | new_degraded = (int)ll; | |
2513 | if (new_degraded != *degraded) { | |
2514 | /* check each device to ensure it is still working */ | |
2515 | struct mdinfo *sd; | |
2516 | for (sd = sra->devs ; sd ; sd = sd->next) { | |
2517 | if (sd->disk.state & (1<<MD_DISK_FAULTY)) | |
2518 | continue; | |
2519 | if (sd->disk.state & (1<<MD_DISK_SYNC)) { | |
2520 | char sbuf[20]; | |
2521 | if (sysfs_get_str(sra, sd, "state", sbuf, 20) < 0 || | |
2522 | strstr(sbuf, "faulty") || | |
2523 | strstr(sbuf, "in_sync") == NULL) { | |
2524 | /* this device is dead */ | |
2525 | sd->disk.state = (1<<MD_DISK_FAULTY); | |
2526 | if (sd->disk.raid_disk >= 0 && | |
2527 | sources[sd->disk.raid_disk] >= 0) { | |
2528 | close(sources[sd->disk.raid_disk]); | |
2529 | sources[sd->disk.raid_disk] = -1; | |
2530 | } | |
2531 | } | |
2532 | } | |
2533 | } | |
2534 | *degraded = new_degraded; | |
2535 | } | |
2536 | if (part) { | |
2537 | bsb.arraystart2 = __cpu_to_le64(offset * odata); | |
2538 | bsb.length2 = __cpu_to_le64(stripes * (chunk/512) * odata); | |
2539 | } else { | |
2540 | bsb.arraystart = __cpu_to_le64(offset * odata); | |
2541 | bsb.length = __cpu_to_le64(stripes * (chunk/512) * odata); | |
2542 | } | |
2543 | if (part) | |
2544 | bsb.magic[15] = '2'; | |
2545 | for (i = 0; i < dests; i++) | |
2546 | if (part) | |
2547 | lseek64(destfd[i], destoffsets[i] + __le64_to_cpu(bsb.devstart2)*512, 0); | |
2548 | else | |
2549 | lseek64(destfd[i], destoffsets[i], 0); | |
2550 | ||
2551 | rv = save_stripes(sources, offsets, | |
2552 | disks, chunk, level, layout, | |
2553 | dests, destfd, | |
2554 | offset*512*odata, stripes * chunk * odata, | |
2555 | buf); | |
2556 | ||
2557 | if (rv) | |
2558 | return rv; | |
2559 | bsb.mtime = __cpu_to_le64(time(0)); | |
2560 | for (i = 0; i < dests; i++) { | |
2561 | bsb.devstart = __cpu_to_le64(destoffsets[i]/512); | |
2562 | ||
2563 | bsb.sb_csum = bsb_csum((char*)&bsb, ((char*)&bsb.sb_csum)-((char*)&bsb)); | |
2564 | if (memcmp(bsb.magic, "md_backup_data-2", 16) == 0) | |
2565 | bsb.sb_csum2 = bsb_csum((char*)&bsb, | |
2566 | ((char*)&bsb.sb_csum2)-((char*)&bsb)); | |
2567 | ||
2568 | rv = -1; | |
2569 | if ((unsigned long long)lseek64(destfd[i], destoffsets[i] - 4096, 0) | |
2570 | != destoffsets[i] - 4096) | |
2571 | break; | |
2572 | if (write(destfd[i], &bsb, 512) != 512) | |
2573 | break; | |
2574 | if (destoffsets[i] > 4096) { | |
2575 | if ((unsigned long long)lseek64(destfd[i], destoffsets[i]+stripes*chunk*odata, 0) != | |
2576 | destoffsets[i]+stripes*chunk*odata) | |
2577 | break; | |
2578 | if (write(destfd[i], &bsb, 512) != 512) | |
2579 | break; | |
2580 | } | |
2581 | fsync(destfd[i]); | |
2582 | rv = 0; | |
2583 | } | |
2584 | ||
2585 | return rv; | |
2586 | } | |
2587 | ||
2588 | /* in 2.6.30, the value reported by sync_completed can be | |
2589 | * less that it should be by one stripe. | |
2590 | * This only happens when reshape hits sync_max and pauses. | |
2591 | * So allow wait_backup to either extent sync_max further | |
2592 | * than strictly necessary, or return before the | |
2593 | * sync has got quite as far as we would really like. | |
2594 | * This is what 'blocks2' is for. | |
2595 | * The various caller give appropriate values so that | |
2596 | * every works. | |
2597 | */ | |
2598 | /* FIXME return value is often ignored */ | |
2599 | static int forget_backup( | |
2600 | int dests, int *destfd, unsigned long long *destoffsets, | |
2601 | int part) | |
2602 | { | |
2603 | /* | |
2604 | * Erase backup 'part' (which is 0 or 1) | |
2605 | */ | |
2606 | int i; | |
2607 | int rv; | |
2608 | ||
2609 | if (part) { | |
2610 | bsb.arraystart2 = __cpu_to_le64(0); | |
2611 | bsb.length2 = __cpu_to_le64(0); | |
2612 | } else { | |
2613 | bsb.arraystart = __cpu_to_le64(0); | |
2614 | bsb.length = __cpu_to_le64(0); | |
2615 | } | |
2616 | bsb.mtime = __cpu_to_le64(time(0)); | |
2617 | rv = 0; | |
2618 | for (i = 0; i < dests; i++) { | |
2619 | bsb.devstart = __cpu_to_le64(destoffsets[i]/512); | |
2620 | bsb.sb_csum = bsb_csum((char*)&bsb, ((char*)&bsb.sb_csum)-((char*)&bsb)); | |
2621 | if (memcmp(bsb.magic, "md_backup_data-2", 16) == 0) | |
2622 | bsb.sb_csum2 = bsb_csum((char*)&bsb, | |
2623 | ((char*)&bsb.sb_csum2)-((char*)&bsb)); | |
2624 | if ((unsigned long long)lseek64(destfd[i], destoffsets[i]-4096, 0) != | |
2625 | destoffsets[i]-4096) | |
2626 | rv = -1; | |
2627 | if (rv == 0 && | |
2628 | write(destfd[i], &bsb, 512) != 512) | |
2629 | rv = -1; | |
2630 | fsync(destfd[i]); | |
2631 | } | |
2632 | return rv; | |
2633 | } | |
2634 | ||
2635 | static void fail(char *msg) | |
2636 | { | |
2637 | int rv; | |
2638 | rv = (write(2, msg, strlen(msg)) != (int)strlen(msg)); | |
2639 | rv |= (write(2, "\n", 1) != 1); | |
2640 | exit(rv ? 1 : 2); | |
2641 | } | |
2642 | ||
2643 | static char *abuf, *bbuf; | |
2644 | static unsigned long long abuflen; | |
2645 | static void validate(int afd, int bfd, unsigned long long offset) | |
2646 | { | |
2647 | /* check that the data in the backup against the array. | |
2648 | * This is only used for regression testing and should not | |
2649 | * be used while the array is active | |
2650 | */ | |
2651 | if (afd < 0) | |
2652 | return; | |
2653 | lseek64(bfd, offset - 4096, 0); | |
2654 | if (read(bfd, &bsb2, 512) != 512) | |
2655 | fail("cannot read bsb"); | |
2656 | if (bsb2.sb_csum != bsb_csum((char*)&bsb2, | |
2657 | ((char*)&bsb2.sb_csum)-((char*)&bsb2))) | |
2658 | fail("first csum bad"); | |
2659 | if (memcmp(bsb2.magic, "md_backup_data", 14) != 0) | |
2660 | fail("magic is bad"); | |
2661 | if (memcmp(bsb2.magic, "md_backup_data-2", 16) == 0 && | |
2662 | bsb2.sb_csum2 != bsb_csum((char*)&bsb2, | |
2663 | ((char*)&bsb2.sb_csum2)-((char*)&bsb2))) | |
2664 | fail("second csum bad"); | |
2665 | ||
2666 | if (__le64_to_cpu(bsb2.devstart)*512 != offset) | |
2667 | fail("devstart is wrong"); | |
2668 | ||
2669 | if (bsb2.length) { | |
2670 | unsigned long long len = __le64_to_cpu(bsb2.length)*512; | |
2671 | ||
2672 | if (abuflen < len) { | |
2673 | free(abuf); | |
2674 | free(bbuf); | |
2675 | abuflen = len; | |
2676 | if (posix_memalign((void**)&abuf, 4096, abuflen) || | |
2677 | posix_memalign((void**)&bbuf, 4096, abuflen)) { | |
2678 | abuflen = 0; | |
2679 | /* just stop validating on mem-alloc failure */ | |
2680 | return; | |
2681 | } | |
2682 | } | |
2683 | ||
2684 | lseek64(bfd, offset, 0); | |
2685 | if ((unsigned long long)read(bfd, bbuf, len) != len) { | |
2686 | //printf("len %llu\n", len); | |
2687 | fail("read first backup failed"); | |
2688 | } | |
2689 | lseek64(afd, __le64_to_cpu(bsb2.arraystart)*512, 0); | |
2690 | if ((unsigned long long)read(afd, abuf, len) != len) | |
2691 | fail("read first from array failed"); | |
2692 | if (memcmp(bbuf, abuf, len) != 0) { | |
2693 | #if 0 | |
2694 | int i; | |
2695 | printf("offset=%llu len=%llu\n", | |
2696 | (unsigned long long)__le64_to_cpu(bsb2.arraystart)*512, len); | |
2697 | for (i=0; i<len; i++) | |
2698 | if (bbuf[i] != abuf[i]) { | |
2699 | printf("first diff byte %d\n", i); | |
2700 | break; | |
2701 | } | |
2702 | #endif | |
2703 | fail("data1 compare failed"); | |
2704 | } | |
2705 | } | |
2706 | if (bsb2.length2) { | |
2707 | unsigned long long len = __le64_to_cpu(bsb2.length2)*512; | |
2708 | ||
2709 | if (abuflen < len) { | |
2710 | free(abuf); | |
2711 | free(bbuf); | |
2712 | abuflen = len; | |
2713 | abuf = malloc(abuflen); | |
2714 | bbuf = malloc(abuflen); | |
2715 | } | |
2716 | ||
2717 | lseek64(bfd, offset+__le64_to_cpu(bsb2.devstart2)*512, 0); | |
2718 | if ((unsigned long long)read(bfd, bbuf, len) != len) | |
2719 | fail("read second backup failed"); | |
2720 | lseek64(afd, __le64_to_cpu(bsb2.arraystart2)*512, 0); | |
2721 | if ((unsigned long long)read(afd, abuf, len) != len) | |
2722 | fail("read second from array failed"); | |
2723 | if (memcmp(bbuf, abuf, len) != 0) | |
2724 | fail("data2 compare failed"); | |
2725 | } | |
2726 | } | |
2727 | ||
2728 | static int child_monitor(int afd, struct mdinfo *sra, struct reshape *reshape, | |
2729 | unsigned long stripes, | |
2730 | int *fds, unsigned long long *offsets, | |
2731 | int dests, int *destfd, unsigned long long *destoffsets) | |
2732 | { | |
2733 | /* Monitor a reshape where backup is being performed using | |
2734 | * 'native' mechanism - either to a backup file, or | |
2735 | * to some space in a spare. | |
2736 | */ | |
2737 | char *buf; | |
2738 | int degraded = -1; | |
2739 | unsigned long long speed; | |
2740 | unsigned long long suspend_point, array_size; | |
2741 | unsigned long long backup_point, wait_point; | |
2742 | unsigned long long reshape_completed; | |
2743 | int done = 0; | |
2744 | int increasing = reshape->after.data_disks >= reshape->before.data_disks; | |
2745 | int part = 0; /* The next part of the backup area to fill. It may already | |
2746 | * be full, so we need to check */ | |
2747 | int level = reshape->level; | |
2748 | int layout = reshape->before.layout; | |
2749 | int data = reshape->before.data_disks; | |
2750 | int disks = reshape->before.data_disks + reshape->parity; | |
2751 | int chunk = sra->array.chunk_size; | |
2752 | ||
2753 | if (posix_memalign((void**)&buf, 4096, disks * chunk)) | |
2754 | /* Don't start the 'reshape' */ | |
2755 | return 0; | |
2756 | if (reshape->before.data_disks == reshape->after.data_disks) { | |
2757 | sysfs_get_ll(sra, NULL, "sync_speed_min", &speed); | |
2758 | sysfs_set_num(sra, NULL, "sync_speed_min", 200000); | |
2759 | } | |
2760 | ||
2761 | if (increasing) { | |
2762 | array_size = sra->component_size * reshape->after.data_disks; | |
2763 | backup_point = sra->reshape_progress; | |
2764 | suspend_point = 0; | |
2765 | } else { | |
2766 | array_size = sra->component_size * reshape->before.data_disks; | |
2767 | backup_point = array_size; | |
2768 | suspend_point = array_size; | |
2769 | } | |
2770 | ||
2771 | while (!done) { | |
2772 | int rv; | |
2773 | ||
2774 | /* Want to return as soon the oldest backup slot can | |
2775 | * be released as that allows us to start backing up | |
2776 | * some more, providing suspend_point has been | |
2777 | * advanced, which it should have. | |
2778 | */ | |
2779 | if (increasing) { | |
2780 | wait_point = array_size; | |
2781 | if (part == 0 && __le64_to_cpu(bsb.length) > 0) | |
2782 | wait_point = (__le64_to_cpu(bsb.arraystart) + | |
2783 | __le64_to_cpu(bsb.length)); | |
2784 | if (part == 1 && __le64_to_cpu(bsb.length2) > 0) | |
2785 | wait_point = (__le64_to_cpu(bsb.arraystart2) + | |
2786 | __le64_to_cpu(bsb.length2)); | |
2787 | } else { | |
2788 | wait_point = 0; | |
2789 | if (part == 0 && __le64_to_cpu(bsb.length) > 0) | |
2790 | wait_point = __le64_to_cpu(bsb.arraystart); | |
2791 | if (part == 1 && __le64_to_cpu(bsb.length2) > 0) | |
2792 | wait_point = __le64_to_cpu(bsb.arraystart2); | |
2793 | } | |
2794 | ||
2795 | rv = progress_reshape(sra, reshape, | |
2796 | backup_point, wait_point, | |
2797 | &suspend_point, &reshape_completed); | |
2798 | /* external metadata would need to ping_monitor here */ | |
2799 | sra->reshape_progress = reshape_completed; | |
2800 | ||
2801 | /* Clear any backup region that is before 'here' */ | |
2802 | if (increasing) { | |
2803 | if (reshape_completed >= (__le64_to_cpu(bsb.arraystart) + | |
2804 | __le64_to_cpu(bsb.length))) | |
2805 | forget_backup(dests, destfd, | |
2806 | destoffsets, 0); | |
2807 | if (reshape_completed >= (__le64_to_cpu(bsb.arraystart2) + | |
2808 | __le64_to_cpu(bsb.length2))) | |
2809 | forget_backup(dests, destfd, | |
2810 | destoffsets, 1); | |
2811 | } else { | |
2812 | if (reshape_completed <= (__le64_to_cpu(bsb.arraystart))) | |
2813 | forget_backup(dests, destfd, | |
2814 | destoffsets, 0); | |
2815 | if (reshape_completed <= (__le64_to_cpu(bsb.arraystart2))) | |
2816 | forget_backup(dests, destfd, | |
2817 | destoffsets, 1); | |
2818 | } | |
2819 | ||
2820 | if (rv < 0) { | |
2821 | done = 1; | |
2822 | break; | |
2823 | } | |
2824 | ||
2825 | while (rv) { | |
2826 | unsigned long long offset; | |
2827 | unsigned long actual_stripes; | |
2828 | /* Need to backup some data. | |
2829 | * If 'part' is not used and the desired | |
2830 | * backup size is suspended, do a backup, | |
2831 | * then consider the next part. | |
2832 | */ | |
2833 | /* Check that 'part' is unused */ | |
2834 | if (part == 0 && __le64_to_cpu(bsb.length) != 0) | |
2835 | break; | |
2836 | if (part == 1 && __le64_to_cpu(bsb.length2) != 0) | |
2837 | break; | |
2838 | ||
2839 | offset = backup_point / data; | |
2840 | actual_stripes = stripes; | |
2841 | if (increasing) { | |
2842 | if (offset + actual_stripes * (chunk/512) > | |
2843 | sra->component_size) | |
2844 | actual_stripes = ((sra->component_size - offset) | |
2845 | / (chunk/512)); | |
2846 | if (offset + actual_stripes * (chunk/512) > | |
2847 | suspend_point/data) | |
2848 | break; | |
2849 | } else { | |
2850 | if (offset < actual_stripes * (chunk/512)) | |
2851 | actual_stripes = offset / (chunk/512); | |
2852 | offset -= actual_stripes * (chunk/512); | |
2853 | if (offset < suspend_point/data) | |
2854 | break; | |
2855 | } | |
2856 | grow_backup(sra, offset, actual_stripes, | |
2857 | fds, offsets, | |
2858 | disks, chunk, level, layout, | |
2859 | dests, destfd, destoffsets, | |
2860 | part, °raded, buf); | |
2861 | validate(afd, destfd[0], destoffsets[0]); | |
2862 | /* record where 'part' is up to */ | |
2863 | part = !part; | |
2864 | if (increasing) | |
2865 | backup_point += actual_stripes * (chunk/512) * data; | |
2866 | else | |
2867 | backup_point -= actual_stripes * (chunk/512) * data; | |
2868 | } | |
2869 | } | |
2870 | ||
2871 | /* FIXME maybe call progress_reshape one more time instead */ | |
2872 | abort_reshape(sra); /* remove any remaining suspension */ | |
2873 | if (reshape->before.data_disks == reshape->after.data_disks) | |
2874 | sysfs_set_num(sra, NULL, "sync_speed_min", speed); | |
2875 | free(buf); | |
2876 | return 1; /* FIXME what does this mean? */ | |
2877 | } | |
2878 | ||
2879 | /* | |
2880 | * If any spare contains md_back_data-1 which is recent wrt mtime, | |
2881 | * write that data into the array and update the super blocks with | |
2882 | * the new reshape_progress | |
2883 | */ | |
2884 | int Grow_restart(struct supertype *st, struct mdinfo *info, int *fdlist, int cnt, | |
2885 | char *backup_file, int verbose) | |
2886 | { | |
2887 | int i, j; | |
2888 | int old_disks; | |
2889 | unsigned long long *offsets; | |
2890 | unsigned long long nstripe, ostripe; | |
2891 | int ndata, odata; | |
2892 | ||
2893 | if (info->new_level != info->array.level) | |
2894 | return 1; /* Cannot handle level changes (they are instantaneous) */ | |
2895 | ||
2896 | odata = info->array.raid_disks - info->delta_disks - 1; | |
2897 | if (info->array.level == 6) odata--; /* number of data disks */ | |
2898 | ndata = info->array.raid_disks - 1; | |
2899 | if (info->new_level == 6) ndata--; | |
2900 | ||
2901 | old_disks = info->array.raid_disks - info->delta_disks; | |
2902 | ||
2903 | if (info->delta_disks <= 0) | |
2904 | /* Didn't grow, so the backup file must have | |
2905 | * been used | |
2906 | */ | |
2907 | old_disks = cnt; | |
2908 | for (i=old_disks-(backup_file?1:0); i<cnt; i++) { | |
2909 | struct mdinfo dinfo; | |
2910 | int fd; | |
2911 | int bsbsize; | |
2912 | char *devname, namebuf[20]; | |
2913 | ||
2914 | /* This was a spare and may have some saved data on it. | |
2915 | * Load the superblock, find and load the | |
2916 | * backup_super_block. | |
2917 | * If either fail, go on to next device. | |
2918 | * If the backup contains no new info, just return | |
2919 | * else restore data and update all superblocks | |
2920 | */ | |
2921 | if (i == old_disks-1) { | |
2922 | fd = open(backup_file, O_RDONLY); | |
2923 | if (fd<0) { | |
2924 | fprintf(stderr, Name ": backup file %s inaccessible: %s\n", | |
2925 | backup_file, strerror(errno)); | |
2926 | continue; | |
2927 | } | |
2928 | devname = backup_file; | |
2929 | } else { | |
2930 | fd = fdlist[i]; | |
2931 | if (fd < 0) | |
2932 | continue; | |
2933 | if (st->ss->load_super(st, fd, NULL)) | |
2934 | continue; | |
2935 | ||
2936 | st->ss->getinfo_super(st, &dinfo, NULL); | |
2937 | st->ss->free_super(st); | |
2938 | ||
2939 | if (lseek64(fd, | |
2940 | (dinfo.data_offset + dinfo.component_size - 8) <<9, | |
2941 | 0) < 0) { | |
2942 | fprintf(stderr, Name ": Cannot seek on device %d\n", i); | |
2943 | continue; /* Cannot seek */ | |
2944 | } | |
2945 | sprintf(namebuf, "device-%d", i); | |
2946 | devname = namebuf; | |
2947 | } | |
2948 | if (read(fd, &bsb, sizeof(bsb)) != sizeof(bsb)) { | |
2949 | if (verbose) | |
2950 | fprintf(stderr, Name ": Cannot read from %s\n", devname); | |
2951 | continue; /* Cannot read */ | |
2952 | } | |
2953 | if (memcmp(bsb.magic, "md_backup_data-1", 16) != 0 && | |
2954 | memcmp(bsb.magic, "md_backup_data-2", 16) != 0) { | |
2955 | if (verbose) | |
2956 | fprintf(stderr, Name ": No backup metadata on %s\n", devname); | |
2957 | continue; | |
2958 | } | |
2959 | if (bsb.sb_csum != bsb_csum((char*)&bsb, ((char*)&bsb.sb_csum)-((char*)&bsb))) { | |
2960 | if (verbose) | |
2961 | fprintf(stderr, Name ": Bad backup-metadata checksum on %s\n", devname); | |
2962 | continue; /* bad checksum */ | |
2963 | } | |
2964 | if (memcmp(bsb.magic, "md_backup_data-2", 16) == 0 && | |
2965 | bsb.sb_csum2 != bsb_csum((char*)&bsb, ((char*)&bsb.sb_csum2)-((char*)&bsb))) { | |
2966 | if (verbose) | |
2967 | fprintf(stderr, Name ": Bad backup-metadata checksum2 on %s\n", devname); | |
2968 | continue; /* Bad second checksum */ | |
2969 | } | |
2970 | if (memcmp(bsb.set_uuid,info->uuid, 16) != 0) { | |
2971 | if (verbose) | |
2972 | fprintf(stderr, Name ": Wrong uuid on backup-metadata on %s\n", devname); | |
2973 | continue; /* Wrong uuid */ | |
2974 | } | |
2975 | ||
2976 | /* array utime and backup-mtime should be updated at much the same time, but it seems that | |
2977 | * sometimes they aren't... So allow considerable flexability in matching, and allow | |
2978 | * this test to be overridden by an environment variable. | |
2979 | */ | |
2980 | if (info->array.utime > (int)__le64_to_cpu(bsb.mtime) + 2*60*60 || | |
2981 | info->array.utime < (int)__le64_to_cpu(bsb.mtime) - 10*60) { | |
2982 | if (check_env("MDADM_GROW_ALLOW_OLD")) { | |
2983 | fprintf(stderr, Name ": accepting backup with timestamp %lu " | |
2984 | "for array with timestamp %lu\n", | |
2985 | (unsigned long)__le64_to_cpu(bsb.mtime), | |
2986 | (unsigned long)info->array.utime); | |
2987 | } else { | |
2988 | if (verbose) | |
2989 | fprintf(stderr, Name ": too-old timestamp on " | |
2990 | "backup-metadata on %s\n", devname); | |
2991 | continue; /* time stamp is too bad */ | |
2992 | } | |
2993 | } | |
2994 | ||
2995 | if (bsb.magic[15] == '1') { | |
2996 | if (info->delta_disks >= 0) { | |
2997 | /* reshape_progress is increasing */ | |
2998 | if (__le64_to_cpu(bsb.arraystart) + __le64_to_cpu(bsb.length) < | |
2999 | info->reshape_progress) { | |
3000 | nonew: | |
3001 | if (verbose) | |
3002 | fprintf(stderr, Name ": backup-metadata found on %s but is not needed\n", devname); | |
3003 | continue; /* No new data here */ | |
3004 | } | |
3005 | } else { | |
3006 | /* reshape_progress is decreasing */ | |
3007 | if (__le64_to_cpu(bsb.arraystart) >= | |
3008 | info->reshape_progress) | |
3009 | goto nonew; /* No new data here */ | |
3010 | } | |
3011 | } else { | |
3012 | if (info->delta_disks >= 0) { | |
3013 | /* reshape_progress is increasing */ | |
3014 | if (__le64_to_cpu(bsb.arraystart) + __le64_to_cpu(bsb.length) < | |
3015 | info->reshape_progress && | |
3016 | __le64_to_cpu(bsb.arraystart2) + __le64_to_cpu(bsb.length2) < | |
3017 | info->reshape_progress) | |
3018 | goto nonew; /* No new data here */ | |
3019 | } else { | |
3020 | /* reshape_progress is decreasing */ | |
3021 | if (__le64_to_cpu(bsb.arraystart) >= | |
3022 | info->reshape_progress && | |
3023 | __le64_to_cpu(bsb.arraystart2) >= | |
3024 | info->reshape_progress) | |
3025 | goto nonew; /* No new data here */ | |
3026 | } | |
3027 | } | |
3028 | if (lseek64(fd, __le64_to_cpu(bsb.devstart)*512, 0)< 0) { | |
3029 | second_fail: | |
3030 | if (verbose) | |
3031 | fprintf(stderr, Name ": Failed to verify secondary backup-metadata block on %s\n", | |
3032 | devname); | |
3033 | continue; /* Cannot seek */ | |
3034 | } | |
3035 | /* There should be a duplicate backup superblock 4k before here */ | |
3036 | if (lseek64(fd, -4096, 1) < 0 || | |
3037 | read(fd, &bsb2, sizeof(bsb2)) != sizeof(bsb2)) | |
3038 | goto second_fail; /* Cannot find leading superblock */ | |
3039 | if (bsb.magic[15] == '1') | |
3040 | bsbsize = offsetof(struct mdp_backup_super, pad1); | |
3041 | else | |
3042 | bsbsize = offsetof(struct mdp_backup_super, pad); | |
3043 | if (memcmp(&bsb2, &bsb, bsbsize) != 0) | |
3044 | goto second_fail; /* Cannot find leading superblock */ | |
3045 | ||
3046 | /* Now need the data offsets for all devices. */ | |
3047 | offsets = malloc(sizeof(*offsets)*info->array.raid_disks); | |
3048 | for(j=0; j<info->array.raid_disks; j++) { | |
3049 | if (fdlist[j] < 0) | |
3050 | continue; | |
3051 | if (st->ss->load_super(st, fdlist[j], NULL)) | |
3052 | /* FIXME should be this be an error */ | |
3053 | continue; | |
3054 | st->ss->getinfo_super(st, &dinfo, NULL); | |
3055 | st->ss->free_super(st); | |
3056 | offsets[j] = dinfo.data_offset * 512; | |
3057 | } | |
3058 | printf(Name ": restoring critical section\n"); | |
3059 | ||
3060 | if (restore_stripes(fdlist, offsets, | |
3061 | info->array.raid_disks, | |
3062 | info->new_chunk, | |
3063 | info->new_level, | |
3064 | info->new_layout, | |
3065 | fd, __le64_to_cpu(bsb.devstart)*512, | |
3066 | __le64_to_cpu(bsb.arraystart)*512, | |
3067 | __le64_to_cpu(bsb.length)*512)) { | |
3068 | /* didn't succeed, so giveup */ | |
3069 | if (verbose) | |
3070 | fprintf(stderr, Name ": Error restoring backup from %s\n", | |
3071 | devname); | |
3072 | return 1; | |
3073 | } | |
3074 | ||
3075 | if (bsb.magic[15] == '2' && | |
3076 | restore_stripes(fdlist, offsets, | |
3077 | info->array.raid_disks, | |
3078 | info->new_chunk, | |
3079 | info->new_level, | |
3080 | info->new_layout, | |
3081 | fd, __le64_to_cpu(bsb.devstart)*512 + | |
3082 | __le64_to_cpu(bsb.devstart2)*512, | |
3083 | __le64_to_cpu(bsb.arraystart2)*512, | |
3084 | __le64_to_cpu(bsb.length2)*512)) { | |
3085 | /* didn't succeed, so giveup */ | |
3086 | if (verbose) | |
3087 | fprintf(stderr, Name ": Error restoring second backup from %s\n", | |
3088 | devname); | |
3089 | return 1; | |
3090 | } | |
3091 | ||
3092 | ||
3093 | /* Ok, so the data is restored. Let's update those superblocks. */ | |
3094 | ||
3095 | if (info->delta_disks >= 0) { | |
3096 | info->reshape_progress = __le64_to_cpu(bsb.arraystart) + | |
3097 | __le64_to_cpu(bsb.length); | |
3098 | if (bsb.magic[15] == '2') { | |
3099 | unsigned long long p2 = __le64_to_cpu(bsb.arraystart2) + | |
3100 | __le64_to_cpu(bsb.length2); | |
3101 | if (p2 > info->reshape_progress) | |
3102 | info->reshape_progress = p2; | |
3103 | } | |
3104 | } else { | |
3105 | info->reshape_progress = __le64_to_cpu(bsb.arraystart); | |
3106 | if (bsb.magic[15] == '2') { | |
3107 | unsigned long long p2 = __le64_to_cpu(bsb.arraystart2); | |
3108 | if (p2 < info->reshape_progress) | |
3109 | info->reshape_progress = p2; | |
3110 | } | |
3111 | } | |
3112 | for (j=0; j<info->array.raid_disks; j++) { | |
3113 | if (fdlist[j] < 0) continue; | |
3114 | if (st->ss->load_super(st, fdlist[j], NULL)) | |
3115 | continue; | |
3116 | st->ss->getinfo_super(st, &dinfo, NULL); | |
3117 | dinfo.reshape_progress = info->reshape_progress; | |
3118 | st->ss->update_super(st, &dinfo, | |
3119 | "_reshape_progress", | |
3120 | NULL,0, 0, NULL); | |
3121 | st->ss->store_super(st, fdlist[j]); | |
3122 | st->ss->free_super(st); | |
3123 | } | |
3124 | return 0; | |
3125 | } | |
3126 | /* Didn't find any backup data, try to see if any | |
3127 | * was needed. | |
3128 | */ | |
3129 | if (info->delta_disks < 0) { | |
3130 | /* When shrinking, the critical section is at the end. | |
3131 | * So see if we are before the critical section. | |
3132 | */ | |
3133 | unsigned long long first_block; | |
3134 | nstripe = ostripe = 0; | |
3135 | first_block = 0; | |
3136 | while (ostripe >= nstripe) { | |
3137 | ostripe += info->array.chunk_size / 512; | |
3138 | first_block = ostripe * odata; | |
3139 | nstripe = first_block / ndata / (info->new_chunk/512) * | |
3140 | (info->new_chunk/512); | |
3141 | } | |
3142 | ||
3143 | if (info->reshape_progress >= first_block) | |
3144 | return 0; | |
3145 | } | |
3146 | if (info->delta_disks > 0) { | |
3147 | /* See if we are beyond the critical section. */ | |
3148 | unsigned long long last_block; | |
3149 | nstripe = ostripe = 0; | |
3150 | last_block = 0; | |
3151 | while (nstripe >= ostripe) { | |
3152 | nstripe += info->new_chunk / 512; | |
3153 | last_block = nstripe * ndata; | |
3154 | ostripe = last_block / odata / (info->array.chunk_size/512) * | |
3155 | (info->array.chunk_size/512); | |
3156 | } | |
3157 | ||
3158 | if (info->reshape_progress >= last_block) | |
3159 | return 0; | |
3160 | } | |
3161 | /* needed to recover critical section! */ | |
3162 | if (verbose) | |
3163 | fprintf(stderr, Name ": Failed to find backup of critical section\n"); | |
3164 | return 1; | |
3165 | } | |
3166 | ||
3167 | int Grow_continue(int mdfd, struct supertype *st, struct mdinfo *info, | |
3168 | char *backup_file) | |
3169 | { | |
3170 | int err = sysfs_set_str(info, NULL, "array_state", "readonly"); | |
3171 | if (err) | |
3172 | return err; | |
3173 | return reshape_array(NULL, mdfd, "array", st, info, 1, backup_file, 0, 0); | |
3174 | } | |
3175 | ||
3176 |