]> git.ipfire.org Git - thirdparty/mdadm.git/blob - util.c
split name/number maps into separate file.
[thirdparty/mdadm.git] / util.c
1 /*
2 * mdadm - manage Linux "md" devices aka RAID arrays.
3 *
4 * Copyright (C) 2001-2009 Neil Brown <neilb@suse.de>
5 *
6 *
7 * This program is free software; you can redistribute it and/or modify
8 * it under the terms of the GNU General Public License as published by
9 * the Free Software Foundation; either version 2 of the License, or
10 * (at your option) any later version.
11 *
12 * This program is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 * GNU General Public License for more details.
16 *
17 * You should have received a copy of the GNU General Public License
18 * along with this program; if not, write to the Free Software
19 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
20 *
21 * Author: Neil Brown
22 * Email: <neilb@suse.de>
23 */
24
25 #include "mdadm.h"
26 #include "md_p.h"
27 #include <sys/socket.h>
28 #include <sys/utsname.h>
29 #include <sys/wait.h>
30 #include <sys/un.h>
31 #include <ctype.h>
32 #include <dirent.h>
33 #include <signal.h>
34
35 /*
36 * following taken from linux/blkpg.h because they aren't
37 * anywhere else and it isn't safe to #include linux/ * stuff.
38 */
39
40 #define BLKPG _IO(0x12,105)
41
42 /* The argument structure */
43 struct blkpg_ioctl_arg {
44 int op;
45 int flags;
46 int datalen;
47 void *data;
48 };
49
50 /* The subfunctions (for the op field) */
51 #define BLKPG_ADD_PARTITION 1
52 #define BLKPG_DEL_PARTITION 2
53
54 /* Sizes of name fields. Unused at present. */
55 #define BLKPG_DEVNAMELTH 64
56 #define BLKPG_VOLNAMELTH 64
57
58 /* The data structure for ADD_PARTITION and DEL_PARTITION */
59 struct blkpg_partition {
60 long long start; /* starting offset in bytes */
61 long long length; /* length in bytes */
62 int pno; /* partition number */
63 char devname[BLKPG_DEVNAMELTH]; /* partition name, like sda5 or c0d1p2,
64 to be used in kernel messages */
65 char volname[BLKPG_VOLNAMELTH]; /* volume label */
66 };
67
68 #include "part.h"
69
70 /* Force a compilation error if condition is true */
71 #define BUILD_BUG_ON(condition) ((void)BUILD_BUG_ON_ZERO(condition))
72
73 /* Force a compilation error if condition is true, but also produce a
74 result (of value 0 and type size_t), so the expression can be used
75 e.g. in a structure initializer (or where-ever else comma expressions
76 aren't permitted). */
77 #define BUILD_BUG_ON_ZERO(e) (sizeof(struct { int:-!!(e); }))
78
79 /*
80 * Parse a 128 bit uuid in 4 integers
81 * format is 32 hexx nibbles with options :.<space> separator
82 * If not exactly 32 hex digits are found, return 0
83 * else return 1
84 */
85 int parse_uuid(char *str, int uuid[4])
86 {
87 int hit = 0; /* number of Hex digIT */
88 int i;
89 char c;
90 for (i=0; i<4; i++) uuid[i]=0;
91
92 while ((c= *str++)) {
93 int n;
94 if (c>='0' && c<='9')
95 n = c-'0';
96 else if (c>='a' && c <= 'f')
97 n = 10 + c - 'a';
98 else if (c>='A' && c <= 'F')
99 n = 10 + c - 'A';
100 else if (strchr(":. -", c))
101 continue;
102 else return 0;
103
104 if (hit<32) {
105 uuid[hit/8] <<= 4;
106 uuid[hit/8] += n;
107 }
108 hit++;
109 }
110 if (hit == 32)
111 return 1;
112 return 0;
113 }
114
115
116 /*
117 * Get the md version number.
118 * We use the RAID_VERSION ioctl if it is supported
119 * If not, but we have a block device with major '9', we assume
120 * 0.36.0
121 *
122 * Return version number as 24 but number - assume version parts
123 * always < 255
124 */
125
126 int md_get_version(int fd)
127 {
128 struct stat stb;
129 mdu_version_t vers;
130
131 if (fstat(fd, &stb)<0)
132 return -1;
133 if ((S_IFMT&stb.st_mode) != S_IFBLK)
134 return -1;
135
136 if (ioctl(fd, RAID_VERSION, &vers) == 0)
137 return (vers.major*10000) + (vers.minor*100) + vers.patchlevel;
138 if (errno == EACCES)
139 return -1;
140 if (major(stb.st_rdev) == MD_MAJOR)
141 return (3600);
142 return -1;
143 }
144
145 int get_linux_version()
146 {
147 struct utsname name;
148 char *cp;
149 int a,b,c;
150 if (uname(&name) <0)
151 return -1;
152
153 cp = name.release;
154 a = strtoul(cp, &cp, 10);
155 if (*cp != '.') return -1;
156 b = strtoul(cp+1, &cp, 10);
157 if (*cp != '.') return -1;
158 c = strtoul(cp+1, NULL, 10);
159
160 return (a*1000000)+(b*1000)+c;
161 }
162
163 #ifndef MDASSEMBLE
164 int mdadm_version(char *version)
165 {
166 int a, b, c;
167 char *cp;
168
169 if (!version)
170 version = Version;
171
172 cp = strchr(version, '-');
173 if (!cp || *(cp+1) != ' ' || *(cp+2) != 'v')
174 return -1;
175 cp += 3;
176 a = strtoul(cp, &cp, 10);
177 if (*cp != '.')
178 return -1;
179 b = strtoul(cp+1, &cp, 10);
180 if (*cp == '.')
181 c = strtoul(cp+1, &cp, 10);
182 else
183 c = 0;
184 if (*cp != ' ' && *cp != '-')
185 return -1;
186 return (a*1000000)+(b*1000)+c;
187 }
188
189 long long parse_size(char *size)
190 {
191 /* parse 'size' which should be a number optionally
192 * followed by 'K', 'M', or 'G'.
193 * Without a suffix, K is assumed.
194 * Number returned is in sectors (half-K)
195 */
196 char *c;
197 long long s = strtoll(size, &c, 10);
198 if (s > 0) {
199 switch (*c) {
200 case 'K':
201 c++;
202 default:
203 s *= 2;
204 break;
205 case 'M':
206 c++;
207 s *= 1024 * 2;
208 break;
209 case 'G':
210 c++;
211 s *= 1024 * 1024 * 2;
212 break;
213 }
214 }
215 if (*c)
216 s = 0;
217 return s;
218 }
219
220 int parse_layout_10(char *layout)
221 {
222 int copies, rv;
223 char *cp;
224 /* Parse the layout string for raid10 */
225 /* 'f', 'o' or 'n' followed by a number <= raid_disks */
226 if ((layout[0] != 'n' && layout[0] != 'f' && layout[0] != 'o') ||
227 (copies = strtoul(layout+1, &cp, 10)) < 1 ||
228 copies > 200 ||
229 *cp)
230 return -1;
231 if (layout[0] == 'n')
232 rv = 256 + copies;
233 else if (layout[0] == 'o')
234 rv = 0x10000 + (copies<<8) + 1;
235 else
236 rv = 1 + (copies<<8);
237 return rv;
238 }
239
240 int parse_layout_faulty(char *layout)
241 {
242 /* Parse the layout string for 'faulty' */
243 int ln = strcspn(layout, "0123456789");
244 char *m = strdup(layout);
245 int mode;
246 m[ln] = 0;
247 mode = map_name(faultylayout, m);
248 if (mode == UnSet)
249 return -1;
250
251 return mode | (atoi(layout+ln)<< ModeShift);
252 }
253 #endif
254
255 void remove_partitions(int fd)
256 {
257 /* remove partitions from this block devices.
258 * This is used for components added to an array
259 */
260 #ifdef BLKPG_DEL_PARTITION
261 struct blkpg_ioctl_arg a;
262 struct blkpg_partition p;
263
264 a.op = BLKPG_DEL_PARTITION;
265 a.data = (void*)&p;
266 a.datalen = sizeof(p);
267 a.flags = 0;
268 memset(a.data, 0, a.datalen);
269 for (p.pno=0; p.pno < 16; p.pno++)
270 ioctl(fd, BLKPG, &a);
271 #endif
272 }
273
274 int test_partition(int fd)
275 {
276 /* Check if fd is a whole-disk or a partition.
277 * BLKPG will return EINVAL on a partition, and BLKPG_DEL_PARTITION
278 * will return ENXIO on an invalid partition number.
279 */
280 struct blkpg_ioctl_arg a;
281 struct blkpg_partition p;
282 a.op = BLKPG_DEL_PARTITION;
283 a.data = (void*)&p;
284 a.datalen = sizeof(p);
285 a.flags = 0;
286 memset(a.data, 0, a.datalen);
287 p.pno = 1<<30;
288 if (ioctl(fd, BLKPG, &a) == 0)
289 /* Very unlikely, but not a partition */
290 return 0;
291 if (errno == ENXIO)
292 /* not a partition */
293 return 0;
294
295 return 1;
296 }
297
298 int test_partition_from_id(dev_t id)
299 {
300 char buf[20];
301 int fd, rv;
302
303 sprintf(buf, "%d:%d", major(id), minor(id));
304 fd = dev_open(buf, O_RDONLY);
305 if (fd < 0)
306 return -1;
307 rv = test_partition(fd);
308 close(fd);
309 return rv;
310 }
311
312 int enough(int level, int raid_disks, int layout, int clean,
313 char *avail, int avail_disks)
314 {
315 int copies, first;
316 switch (level) {
317 case 10:
318 /* This is the tricky one - we need to check
319 * which actual disks are present.
320 */
321 copies = (layout&255)* ((layout>>8) & 255);
322 first=0;
323 do {
324 /* there must be one of the 'copies' form 'first' */
325 int n = copies;
326 int cnt=0;
327 while (n--) {
328 if (avail[first])
329 cnt++;
330 first = (first+1) % raid_disks;
331 }
332 if (cnt == 0)
333 return 0;
334
335 } while (first != 0);
336 return 1;
337
338 case LEVEL_MULTIPATH:
339 return avail_disks>= 1;
340 case LEVEL_LINEAR:
341 case 0:
342 return avail_disks == raid_disks;
343 case 1:
344 return avail_disks >= 1;
345 case 4:
346 case 5:
347 if (clean)
348 return avail_disks >= raid_disks-1;
349 else
350 return avail_disks >= raid_disks;
351 case 6:
352 if (clean)
353 return avail_disks >= raid_disks-2;
354 else
355 return avail_disks >= raid_disks;
356 default:
357 return 0;
358 }
359 }
360
361 int enough_fd(int fd)
362 {
363 struct mdu_array_info_s array;
364 struct mdu_disk_info_s disk;
365 int avail_disks = 0;
366 int i;
367 char *avail;
368
369 if (ioctl(fd, GET_ARRAY_INFO, &array) != 0 ||
370 array.raid_disks <= 0)
371 return 0;
372 avail = calloc(array.raid_disks, 1);
373 for (i=0; i<array.raid_disks + array.nr_disks; i++) {
374 disk.number = i;
375 if (ioctl(fd, GET_DISK_INFO, &disk) != 0)
376 continue;
377 if (! (disk.state & (1<<MD_DISK_SYNC)))
378 continue;
379 if (disk.raid_disk < 0 || disk.raid_disk >= array.raid_disks)
380 continue;
381 avail_disks++;
382 avail[disk.raid_disk] = 1;
383 }
384 /* This is used on an active array, so assume it is clean */
385 return enough(array.level, array.raid_disks, array.layout,
386 1,
387 avail, avail_disks);
388 }
389
390
391 const int uuid_zero[4] = { 0, 0, 0, 0 };
392
393 int same_uuid(int a[4], int b[4], int swapuuid)
394 {
395 if (swapuuid) {
396 /* parse uuids are hostendian.
397 * uuid's from some superblocks are big-ending
398 * if there is a difference, we need to swap..
399 */
400 unsigned char *ac = (unsigned char *)a;
401 unsigned char *bc = (unsigned char *)b;
402 int i;
403 for (i=0; i<16; i+= 4) {
404 if (ac[i+0] != bc[i+3] ||
405 ac[i+1] != bc[i+2] ||
406 ac[i+2] != bc[i+1] ||
407 ac[i+3] != bc[i+0])
408 return 0;
409 }
410 return 1;
411 } else {
412 if (a[0]==b[0] &&
413 a[1]==b[1] &&
414 a[2]==b[2] &&
415 a[3]==b[3])
416 return 1;
417 return 0;
418 }
419 }
420 void copy_uuid(void *a, int b[4], int swapuuid)
421 {
422 if (swapuuid) {
423 /* parse uuids are hostendian.
424 * uuid's from some superblocks are big-ending
425 * if there is a difference, we need to swap..
426 */
427 unsigned char *ac = (unsigned char *)a;
428 unsigned char *bc = (unsigned char *)b;
429 int i;
430 for (i=0; i<16; i+= 4) {
431 ac[i+0] = bc[i+3];
432 ac[i+1] = bc[i+2];
433 ac[i+2] = bc[i+1];
434 ac[i+3] = bc[i+0];
435 }
436 } else
437 memcpy(a, b, 16);
438 }
439
440 char *__fname_from_uuid(int id[4], int swap, char *buf, char sep)
441 {
442 int i, j;
443 char uuid[16];
444 char *c = buf;
445 strcpy(c, "UUID-");
446 c += strlen(c);
447 copy_uuid(uuid, id, swap);
448 for (i = 0; i < 4; i++) {
449 if (i)
450 *c++ = sep;
451 for (j = 3; j >= 0; j--) {
452 sprintf(c,"%02x", (unsigned char) uuid[j+4*i]);
453 c+= 2;
454 }
455 }
456 return buf;
457
458 }
459
460 char *fname_from_uuid(struct supertype *st, struct mdinfo *info, char *buf, char sep)
461 {
462 // dirty hack to work around an issue with super1 superblocks...
463 // super1 superblocks need swapuuid set in order for assembly to
464 // work, but can't have it set if we want this printout to match
465 // all the other uuid printouts in super1.c, so we force swapuuid
466 // to 1 to make our printout match the rest of super1
467 return __fname_from_uuid(info->uuid, (st->ss == &super1) ? 1 : st->ss->swapuuid, buf, sep);
468 }
469
470 #ifndef MDASSEMBLE
471 int check_ext2(int fd, char *name)
472 {
473 /*
474 * Check for an ext2fs file system.
475 * Superblock is always 1K at 1K offset
476 *
477 * s_magic is le16 at 56 == 0xEF53
478 * report mtime - le32 at 44
479 * blocks - le32 at 4
480 * logblksize - le32 at 24
481 */
482 unsigned char sb[1024];
483 time_t mtime;
484 int size, bsize;
485 if (lseek(fd, 1024,0)!= 1024)
486 return 0;
487 if (read(fd, sb, 1024)!= 1024)
488 return 0;
489 if (sb[56] != 0x53 || sb[57] != 0xef)
490 return 0;
491
492 mtime = sb[44]|(sb[45]|(sb[46]|sb[47]<<8)<<8)<<8;
493 bsize = sb[24]|(sb[25]|(sb[26]|sb[27]<<8)<<8)<<8;
494 size = sb[4]|(sb[5]|(sb[6]|sb[7]<<8)<<8)<<8;
495 fprintf(stderr, Name ": %s appears to contain an ext2fs file system\n",
496 name);
497 fprintf(stderr," size=%dK mtime=%s",
498 size*(1<<bsize), ctime(&mtime));
499 return 1;
500 }
501
502 int check_reiser(int fd, char *name)
503 {
504 /*
505 * superblock is at 64K
506 * size is 1024;
507 * Magic string "ReIsErFs" or "ReIsEr2Fs" at 52
508 *
509 */
510 unsigned char sb[1024];
511 unsigned long size;
512 if (lseek(fd, 64*1024, 0) != 64*1024)
513 return 0;
514 if (read(fd, sb, 1024) != 1024)
515 return 0;
516 if (strncmp((char*)sb+52, "ReIsErFs",8)!=0 &&
517 strncmp((char*)sb+52, "ReIsEr2Fs",9)!=0)
518 return 0;
519 fprintf(stderr, Name ": %s appears to contain a reiserfs file system\n",name);
520 size = sb[0]|(sb[1]|(sb[2]|sb[3]<<8)<<8)<<8;
521 fprintf(stderr, " size = %luK\n", size*4);
522
523 return 1;
524 }
525
526 int check_raid(int fd, char *name)
527 {
528 struct mdinfo info;
529 time_t crtime;
530 char *level;
531 struct supertype *st = guess_super(fd);
532
533 if (!st) return 0;
534 st->ss->load_super(st, fd, name);
535 /* Looks like a raid array .. */
536 fprintf(stderr, Name ": %s appears to be part of a raid array:\n",
537 name);
538 st->ss->getinfo_super(st, &info, NULL);
539 st->ss->free_super(st);
540 crtime = info.array.ctime;
541 level = map_num(pers, info.array.level);
542 if (!level) level = "-unknown-";
543 fprintf(stderr, " level=%s devices=%d ctime=%s",
544 level, info.array.raid_disks, ctime(&crtime));
545 return 1;
546 }
547
548 int ask(char *mesg)
549 {
550 char *add = "";
551 int i;
552 for (i=0; i<5; i++) {
553 char buf[100];
554 fprintf(stderr, "%s%s", mesg, add);
555 fflush(stderr);
556 if (fgets(buf, 100, stdin)==NULL)
557 return 0;
558 if (buf[0]=='y' || buf[0]=='Y')
559 return 1;
560 if (buf[0]=='n' || buf[0]=='N')
561 return 0;
562 add = "(y/n) ";
563 }
564 fprintf(stderr, Name ": assuming 'no'\n");
565 return 0;
566 }
567 #endif /* MDASSEMBLE */
568
569 int is_standard(char *dev, int *nump)
570 {
571 /* tests if dev is a "standard" md dev name.
572 * i.e if the last component is "/dNN" or "/mdNN",
573 * where NN is a string of digits
574 * Returns 1 if a partitionable standard,
575 * -1 if non-partitonable,
576 * 0 if not a standard name.
577 */
578 char *d = strrchr(dev, '/');
579 int type=0;
580 int num;
581 if (!d)
582 return 0;
583 if (strncmp(d, "/d",2)==0)
584 d += 2, type=1; /* /dev/md/dN{pM} */
585 else if (strncmp(d, "/md_d", 5)==0)
586 d += 5, type=1; /* /dev/md_dN{pM} */
587 else if (strncmp(d, "/md", 3)==0)
588 d += 3, type=-1; /* /dev/mdN */
589 else if (d-dev > 3 && strncmp(d-2, "md/", 3)==0)
590 d += 1, type=-1; /* /dev/md/N */
591 else
592 return 0;
593 if (!*d)
594 return 0;
595 num = atoi(d);
596 while (isdigit(*d))
597 d++;
598 if (*d)
599 return 0;
600 if (nump) *nump = num;
601
602 return type;
603 }
604
605
606 /*
607 * convert a major/minor pair for a block device into a name in /dev, if possible.
608 * On the first call, walk /dev collecting name.
609 * Put them in a simple linked listfor now.
610 */
611 struct devmap {
612 int major, minor;
613 char *name;
614 struct devmap *next;
615 } *devlist = NULL;
616 int devlist_ready = 0;
617
618 int add_dev(const char *name, const struct stat *stb, int flag, struct FTW *s)
619 {
620 struct stat st;
621
622 if (S_ISLNK(stb->st_mode)) {
623 if (stat(name, &st) != 0)
624 return 0;
625 stb = &st;
626 }
627
628 if ((stb->st_mode&S_IFMT)== S_IFBLK) {
629 char *n = strdup(name);
630 struct devmap *dm = malloc(sizeof(*dm));
631 if (strncmp(n, "/dev/./", 7)==0)
632 strcpy(n+4, name+6);
633 if (dm) {
634 dm->major = major(stb->st_rdev);
635 dm->minor = minor(stb->st_rdev);
636 dm->name = n;
637 dm->next = devlist;
638 devlist = dm;
639 }
640 }
641 return 0;
642 }
643
644 #ifndef HAVE_NFTW
645 #ifdef HAVE_FTW
646 int add_dev_1(const char *name, const struct stat *stb, int flag)
647 {
648 return add_dev(name, stb, flag, NULL);
649 }
650 int nftw(const char *path, int (*han)(const char *name, const struct stat *stb, int flag, struct FTW *s), int nopenfd, int flags)
651 {
652 return ftw(path, add_dev_1, nopenfd);
653 }
654 #else
655 int nftw(const char *path, int (*han)(const char *name, const struct stat *stb, int flag, struct FTW *s), int nopenfd, int flags)
656 {
657 return 0;
658 }
659 #endif /* HAVE_FTW */
660 #endif /* HAVE_NFTW */
661
662 /*
663 * Find a block device with the right major/minor number.
664 * If we find multiple names, choose the shortest.
665 * If we find a name in /dev/md/, we prefer that.
666 * This applies only to names for MD devices.
667 */
668 char *map_dev(int major, int minor, int create)
669 {
670 struct devmap *p;
671 char *regular = NULL, *preferred=NULL;
672 int did_check = 0;
673
674 if (major == 0 && minor == 0)
675 return NULL;
676
677 retry:
678 if (!devlist_ready) {
679 char *dev = "/dev";
680 struct stat stb;
681 while(devlist) {
682 struct devmap *d = devlist;
683 devlist = d->next;
684 free(d->name);
685 free(d);
686 }
687 if (lstat(dev, &stb)==0 &&
688 S_ISLNK(stb.st_mode))
689 dev = "/dev/.";
690 nftw(dev, add_dev, 10, FTW_PHYS);
691 devlist_ready=1;
692 did_check = 1;
693 }
694
695 for (p=devlist; p; p=p->next)
696 if (p->major == major &&
697 p->minor == minor) {
698 if (strncmp(p->name, "/dev/md/",8) == 0) {
699 if (preferred == NULL ||
700 strlen(p->name) < strlen(preferred))
701 preferred = p->name;
702 } else {
703 if (regular == NULL ||
704 strlen(p->name) < strlen(regular))
705 regular = p->name;
706 }
707 }
708 if (!regular && !preferred && !did_check) {
709 devlist_ready = 0;
710 goto retry;
711 }
712 if (create && !regular && !preferred) {
713 static char buf[30];
714 snprintf(buf, sizeof(buf), "%d:%d", major, minor);
715 regular = buf;
716 }
717
718 return preferred ? preferred : regular;
719 }
720
721 unsigned long calc_csum(void *super, int bytes)
722 {
723 unsigned long long newcsum = 0;
724 int i;
725 unsigned int csum;
726 unsigned int *superc = (unsigned int*) super;
727
728 for(i=0; i<bytes/4; i++)
729 newcsum+= superc[i];
730 csum = (newcsum& 0xffffffff) + (newcsum>>32);
731 #ifdef __alpha__
732 /* The in-kernel checksum calculation is always 16bit on
733 * the alpha, though it is 32 bit on i386...
734 * I wonder what it is elsewhere... (it uses and API in
735 * a way that it shouldn't).
736 */
737 csum = (csum & 0xffff) + (csum >> 16);
738 csum = (csum & 0xffff) + (csum >> 16);
739 #endif
740 return csum;
741 }
742
743 #ifndef MDASSEMBLE
744 char *human_size(long long bytes)
745 {
746 static char buf[30];
747
748 /* We convert bytes to either centi-M{ega,ibi}bytes or
749 * centi-G{igi,ibi}bytes, with appropriate rounding,
750 * and then print 1/100th of those as a decimal.
751 * We allow upto 2048Megabytes before converting to
752 * gigabytes, as that shows more precision and isn't
753 * too large a number.
754 * Terrabytes are not yet handled.
755 */
756
757 if (bytes < 5000*1024)
758 buf[0]=0;
759 else if (bytes < 2*1024LL*1024LL*1024LL) {
760 long cMiB = (bytes / ( (1LL<<20) / 200LL ) +1) /2;
761 long cMB = (bytes / ( 1000000LL / 200LL ) +1) /2;
762 snprintf(buf, sizeof(buf), " (%ld.%02ld MiB %ld.%02ld MB)",
763 cMiB/100 , cMiB % 100,
764 cMB/100, cMB % 100);
765 } else {
766 long cGiB = (bytes / ( (1LL<<30) / 200LL ) +1) /2;
767 long cGB = (bytes / (1000000000LL/200LL ) +1) /2;
768 snprintf(buf, sizeof(buf), " (%ld.%02ld GiB %ld.%02ld GB)",
769 cGiB/100 , cGiB % 100,
770 cGB/100, cGB % 100);
771 }
772 return buf;
773 }
774
775 char *human_size_brief(long long bytes)
776 {
777 static char buf[30];
778
779 if (bytes < 5000*1024)
780 snprintf(buf, sizeof(buf), "%ld.%02ldKiB",
781 (long)(bytes>>10), (long)(((bytes&1023)*100+512)/1024)
782 );
783 else if (bytes < 2*1024LL*1024LL*1024LL)
784 snprintf(buf, sizeof(buf), "%ld.%02ldMiB",
785 (long)(bytes>>20),
786 (long)((bytes&0xfffff)+0x100000/200)/(0x100000/100)
787 );
788 else
789 snprintf(buf, sizeof(buf), "%ld.%02ldGiB",
790 (long)(bytes>>30),
791 (long)(((bytes>>10)&0xfffff)+0x100000/200)/(0x100000/100)
792 );
793 return buf;
794 }
795
796 void print_r10_layout(int layout)
797 {
798 int near = layout & 255;
799 int far = (layout >> 8) & 255;
800 int offset = (layout&0x10000);
801 char *sep = "";
802
803 if (near != 1) {
804 printf("%s near=%d", sep, near);
805 sep = ",";
806 }
807 if (far != 1)
808 printf("%s %s=%d", sep, offset?"offset":"far", far);
809 if (near*far == 1)
810 printf("NO REDUNDANCY");
811 }
812 #endif
813
814 unsigned long long calc_array_size(int level, int raid_disks, int layout,
815 int chunksize, unsigned long long devsize)
816 {
817 int data_disks = 0;
818 switch (level) {
819 case 0: data_disks = raid_disks; break;
820 case 1: data_disks = 1; break;
821 case 4:
822 case 5: data_disks = raid_disks - 1; break;
823 case 6: data_disks = raid_disks - 2; break;
824 case 10: data_disks = raid_disks / (layout & 255) / ((layout>>8)&255);
825 break;
826 }
827 devsize &= ~(unsigned long long)((chunksize>>9)-1);
828 return data_disks * devsize;
829 }
830
831 int get_mdp_major(void)
832 {
833 static int mdp_major = -1;
834 FILE *fl;
835 char *w;
836 int have_block = 0;
837 int have_devices = 0;
838 int last_num = -1;
839
840 if (mdp_major != -1)
841 return mdp_major;
842 fl = fopen("/proc/devices", "r");
843 if (!fl)
844 return -1;
845 while ((w = conf_word(fl, 1))) {
846 if (have_block && strcmp(w, "devices:")==0)
847 have_devices = 1;
848 have_block = (strcmp(w, "Block")==0);
849 if (isdigit(w[0]))
850 last_num = atoi(w);
851 if (have_devices && strcmp(w, "mdp")==0)
852 mdp_major = last_num;
853 free(w);
854 }
855 fclose(fl);
856 return mdp_major;
857 }
858
859 #if !defined(MDASSEMBLE) || defined(MDASSEMBLE) && defined(MDASSEMBLE_AUTO)
860 char *get_md_name(int dev)
861 {
862 /* find /dev/md%d or /dev/md/%d or make a device /dev/.tmp.md%d */
863 /* if dev < 0, want /dev/md/d%d or find mdp in /proc/devices ... */
864 static char devname[50];
865 struct stat stb;
866 dev_t rdev;
867 char *dn;
868
869 if (dev < 0) {
870 int mdp = get_mdp_major();
871 if (mdp < 0) return NULL;
872 rdev = makedev(mdp, (-1-dev)<<6);
873 snprintf(devname, sizeof(devname), "/dev/md/d%d", -1-dev);
874 if (stat(devname, &stb) == 0
875 && (S_IFMT&stb.st_mode) == S_IFBLK
876 && (stb.st_rdev == rdev))
877 return devname;
878 } else {
879 rdev = makedev(MD_MAJOR, dev);
880 snprintf(devname, sizeof(devname), "/dev/md%d", dev);
881 if (stat(devname, &stb) == 0
882 && (S_IFMT&stb.st_mode) == S_IFBLK
883 && (stb.st_rdev == rdev))
884 return devname;
885
886 snprintf(devname, sizeof(devname), "/dev/md/%d", dev);
887 if (stat(devname, &stb) == 0
888 && (S_IFMT&stb.st_mode) == S_IFBLK
889 && (stb.st_rdev == rdev))
890 return devname;
891 }
892 dn = map_dev(major(rdev), minor(rdev), 0);
893 if (dn)
894 return dn;
895 snprintf(devname, sizeof(devname), "/dev/.tmp.md%d", dev);
896 if (mknod(devname, S_IFBLK | 0600, rdev) == -1)
897 if (errno != EEXIST)
898 return NULL;
899
900 if (stat(devname, &stb) == 0
901 && (S_IFMT&stb.st_mode) == S_IFBLK
902 && (stb.st_rdev == rdev))
903 return devname;
904 unlink(devname);
905 return NULL;
906 }
907
908 void put_md_name(char *name)
909 {
910 if (strncmp(name, "/dev/.tmp.md", 12)==0)
911 unlink(name);
912 }
913
914 int find_free_devnum(int use_partitions)
915 {
916 int devnum;
917 for (devnum = 127; devnum != 128;
918 devnum = devnum ? devnum-1 : (1<<20)-1) {
919 char *dn;
920 int _devnum;
921
922 _devnum = use_partitions ? (-1-devnum) : devnum;
923 if (mddev_busy(_devnum))
924 continue;
925 /* make sure it is new to /dev too, at least as a
926 * non-standard */
927 dn = map_dev(dev2major(_devnum), dev2minor(_devnum), 0);
928 if (dn && ! is_standard(dn, NULL))
929 continue;
930 break;
931 }
932 if (devnum == 128)
933 return NoMdDev;
934 return use_partitions ? (-1-devnum) : devnum;
935 }
936 #endif /* !defined(MDASSEMBLE) || defined(MDASSEMBLE) && defined(MDASSEMBLE_AUTO) */
937
938 int dev_open(char *dev, int flags)
939 {
940 /* like 'open', but if 'dev' matches %d:%d, create a temp
941 * block device and open that
942 */
943 char *e;
944 int fd = -1;
945 char devname[32];
946 int major;
947 int minor;
948
949 if (!dev) return -1;
950 flags |= O_DIRECT;
951
952 major = strtoul(dev, &e, 0);
953 if (e > dev && *e == ':' && e[1] &&
954 (minor = strtoul(e+1, &e, 0)) >= 0 &&
955 *e == 0) {
956 char *path = map_dev(major, minor, 0);
957 if (path)
958 fd = open(path, flags);
959 if (fd < 0) {
960 snprintf(devname, sizeof(devname), "/dev/.tmp.md.%d:%d:%d",
961 (int)getpid(), major, minor);
962 if (mknod(devname, S_IFBLK|0600, makedev(major, minor))==0) {
963 fd = open(devname, flags);
964 unlink(devname);
965 }
966 }
967 if (fd < 0) {
968 snprintf(devname, sizeof(devname), "/tmp/.tmp.md.%d:%d:%d",
969 (int)getpid(), major, minor);
970 if (mknod(devname, S_IFBLK|0600, makedev(major, minor))==0) {
971 fd = open(devname, flags);
972 unlink(devname);
973 }
974 }
975 } else
976 fd = open(dev, flags);
977 return fd;
978 }
979
980 int open_dev_flags(int devnum, int flags)
981 {
982 char buf[20];
983
984 sprintf(buf, "%d:%d", dev2major(devnum), dev2minor(devnum));
985 return dev_open(buf, flags);
986 }
987
988 int open_dev(int devnum)
989 {
990 return open_dev_flags(devnum, O_RDONLY);
991 }
992
993 int open_dev_excl(int devnum)
994 {
995 char buf[20];
996 int i;
997 int flags = O_RDWR;
998
999 sprintf(buf, "%d:%d", dev2major(devnum), dev2minor(devnum));
1000 for (i=0 ; i<25 ; i++) {
1001 int fd = dev_open(buf, flags|O_EXCL);
1002 if (fd >= 0)
1003 return fd;
1004 if (errno == EACCES && flags == O_RDWR) {
1005 flags = O_RDONLY;
1006 continue;
1007 }
1008 if (errno != EBUSY)
1009 return fd;
1010 usleep(200000);
1011 }
1012 return -1;
1013 }
1014
1015 int same_dev(char *one, char *two)
1016 {
1017 struct stat st1, st2;
1018 if (stat(one, &st1) != 0)
1019 return 0;
1020 if (stat(two, &st2) != 0)
1021 return 0;
1022 if ((st1.st_mode & S_IFMT) != S_IFBLK)
1023 return 0;
1024 if ((st2.st_mode & S_IFMT) != S_IFBLK)
1025 return 0;
1026 return st1.st_rdev == st2.st_rdev;
1027 }
1028
1029 void wait_for(char *dev, int fd)
1030 {
1031 int i;
1032 struct stat stb_want;
1033
1034 if (fstat(fd, &stb_want) != 0 ||
1035 (stb_want.st_mode & S_IFMT) != S_IFBLK)
1036 return;
1037
1038 for (i=0 ; i<25 ; i++) {
1039 struct stat stb;
1040 if (stat(dev, &stb) == 0 &&
1041 (stb.st_mode & S_IFMT) == S_IFBLK &&
1042 (stb.st_rdev == stb_want.st_rdev))
1043 return;
1044 usleep(200000);
1045 }
1046 if (i == 25)
1047 dprintf("%s: timeout waiting for %s\n", __func__, dev);
1048 }
1049
1050 struct superswitch *superlist[] =
1051 {
1052 &super0, &super1,
1053 &super_ddf, &super_imsm,
1054 &mbr, &gpt,
1055 NULL };
1056
1057 #if !defined(MDASSEMBLE) || defined(MDASSEMBLE) && defined(MDASSEMBLE_AUTO)
1058
1059 struct supertype *super_by_fd(int fd, char **subarrayp)
1060 {
1061 mdu_array_info_t array;
1062 int vers;
1063 int minor;
1064 struct supertype *st = NULL;
1065 struct mdinfo *sra;
1066 char *verstr;
1067 char version[20];
1068 int i;
1069 char *subarray = NULL;
1070 int container = NoMdDev;
1071
1072 sra = sysfs_read(fd, 0, GET_VERSION);
1073
1074 if (sra) {
1075 vers = sra->array.major_version;
1076 minor = sra->array.minor_version;
1077 verstr = sra->text_version;
1078 } else {
1079 if (ioctl(fd, GET_ARRAY_INFO, &array))
1080 array.major_version = array.minor_version = 0;
1081 vers = array.major_version;
1082 minor = array.minor_version;
1083 verstr = "";
1084 }
1085
1086 if (vers != -1) {
1087 sprintf(version, "%d.%d", vers, minor);
1088 verstr = version;
1089 }
1090 if (minor == -2 && is_subarray(verstr)) {
1091 char *dev = verstr+1;
1092
1093 subarray = strchr(dev, '/');
1094 if (subarray)
1095 *subarray++ = '\0';
1096 subarray = strdup(subarray);
1097 container = devname2devnum(dev);
1098 if (sra)
1099 sysfs_free(sra);
1100 sra = sysfs_read(-1, container, GET_VERSION);
1101 if (sra && sra->text_version[0])
1102 verstr = sra->text_version;
1103 else
1104 verstr = "-no-metadata-";
1105 }
1106
1107 for (i = 0; st == NULL && superlist[i] ; i++)
1108 st = superlist[i]->match_metadata_desc(verstr);
1109
1110 if (sra)
1111 sysfs_free(sra);
1112 if (st) {
1113 st->sb = NULL;
1114 if (subarrayp)
1115 *subarrayp = subarray;
1116 st->container_dev = container;
1117 st->devnum = fd2devnum(fd);
1118 } else
1119 free(subarray);
1120
1121 return st;
1122 }
1123 #endif /* !defined(MDASSEMBLE) || defined(MDASSEMBLE) && defined(MDASSEMBLE_AUTO) */
1124
1125 int dev_size_from_id(dev_t id, unsigned long long *size)
1126 {
1127 char buf[20];
1128 int fd;
1129
1130 sprintf(buf, "%d:%d", major(id), minor(id));
1131 fd = dev_open(buf, O_RDONLY);
1132 if (fd < 0)
1133 return 0;
1134 if (get_dev_size(fd, NULL, size)) {
1135 close(fd);
1136 return 1;
1137 }
1138 close(fd);
1139 return 0;
1140 }
1141
1142 struct supertype *dup_super(struct supertype *orig)
1143 {
1144 struct supertype *st;
1145
1146 if (!orig)
1147 return orig;
1148 st = malloc(sizeof(*st));
1149 if (!st)
1150 return st;
1151 memset(st, 0, sizeof(*st));
1152 st->ss = orig->ss;
1153 st->max_devs = orig->max_devs;
1154 st->minor_version = orig->minor_version;
1155 st->sb = NULL;
1156 st->info = NULL;
1157 return st;
1158 }
1159
1160 struct supertype *guess_super_type(int fd, enum guess_types guess_type)
1161 {
1162 /* try each load_super to find the best match,
1163 * and return the best superswitch
1164 */
1165 struct superswitch *ss;
1166 struct supertype *st;
1167 time_t besttime = 0;
1168 int bestsuper = -1;
1169 int i;
1170
1171 st = malloc(sizeof(*st));
1172 memset(st, 0, sizeof(*st));
1173 st->container_dev = NoMdDev;
1174
1175 for (i=0 ; superlist[i]; i++) {
1176 int rv;
1177 ss = superlist[i];
1178 if (guess_type == guess_array && ss->add_to_super == NULL)
1179 continue;
1180 if (guess_type == guess_partitions && ss->add_to_super != NULL)
1181 continue;
1182 memset(st, 0, sizeof(*st));
1183 st->ignore_hw_compat = 1;
1184 rv = ss->load_super(st, fd, NULL);
1185 if (rv == 0) {
1186 struct mdinfo info;
1187 st->ss->getinfo_super(st, &info, NULL);
1188 if (bestsuper == -1 ||
1189 besttime < info.array.ctime) {
1190 bestsuper = i;
1191 besttime = info.array.ctime;
1192 }
1193 ss->free_super(st);
1194 }
1195 }
1196 if (bestsuper != -1) {
1197 int rv;
1198 memset(st, 0, sizeof(*st));
1199 st->ignore_hw_compat = 1;
1200 rv = superlist[bestsuper]->load_super(st, fd, NULL);
1201 if (rv == 0) {
1202 superlist[bestsuper]->free_super(st);
1203 st->ignore_hw_compat = 0;
1204 return st;
1205 }
1206 }
1207 free(st);
1208 return NULL;
1209 }
1210
1211 /* Return size of device in bytes */
1212 int get_dev_size(int fd, char *dname, unsigned long long *sizep)
1213 {
1214 unsigned long long ldsize;
1215 struct stat st;
1216
1217 if (fstat(fd, &st) != -1 && S_ISREG(st.st_mode))
1218 ldsize = (unsigned long long)st.st_size;
1219 else
1220 #ifdef BLKGETSIZE64
1221 if (ioctl(fd, BLKGETSIZE64, &ldsize) != 0)
1222 #endif
1223 {
1224 unsigned long dsize;
1225 if (ioctl(fd, BLKGETSIZE, &dsize) == 0) {
1226 ldsize = dsize;
1227 ldsize <<= 9;
1228 } else {
1229 if (dname)
1230 fprintf(stderr, Name ": Cannot get size of %s: %s\b",
1231 dname, strerror(errno));
1232 return 0;
1233 }
1234 }
1235 *sizep = ldsize;
1236 return 1;
1237 }
1238
1239 /* Return true if this can only be a container, not a member device.
1240 * i.e. is and md device and size is zero
1241 */
1242 int must_be_container(int fd)
1243 {
1244 unsigned long long size;
1245 if (md_get_version(fd) < 0)
1246 return 0;
1247 if (get_dev_size(fd, NULL, &size) == 0)
1248 return 1;
1249 if (size == 0)
1250 return 1;
1251 return 0;
1252 }
1253
1254 /* Sets endofpart parameter to the last block used by the last GPT partition on the device.
1255 * Returns: 1 if successful
1256 * -1 for unknown partition type
1257 * 0 for other errors
1258 */
1259 static int get_gpt_last_partition_end(int fd, unsigned long long *endofpart)
1260 {
1261 struct GPT gpt;
1262 unsigned char buf[512];
1263 unsigned char empty_gpt_entry[16]= {0};
1264 struct GPT_part_entry *part;
1265 unsigned long long curr_part_end;
1266 unsigned all_partitions, entry_size;
1267 unsigned part_nr;
1268
1269 *endofpart = 0;
1270
1271 BUILD_BUG_ON(sizeof(gpt) != 512);
1272 /* read GPT header */
1273 lseek(fd, 512, SEEK_SET);
1274 if (read(fd, &gpt, 512) != 512)
1275 return 0;
1276
1277 /* get the number of partition entries and the entry size */
1278 all_partitions = __le32_to_cpu(gpt.part_cnt);
1279 entry_size = __le32_to_cpu(gpt.part_size);
1280
1281 /* Check GPT signature*/
1282 if (gpt.magic != GPT_SIGNATURE_MAGIC)
1283 return -1;
1284
1285 /* sanity checks */
1286 if (all_partitions > 1024 ||
1287 entry_size > 512)
1288 return -1;
1289
1290 /* read first GPT partition entries */
1291 if (read(fd, buf, 512) != 512)
1292 return 0;
1293
1294 part = (struct GPT_part_entry*)buf;
1295
1296 for (part_nr=0; part_nr < all_partitions; part_nr++) {
1297 /* is this valid partition? */
1298 if (memcmp(part->type_guid, empty_gpt_entry, 16) != 0) {
1299 /* check the last lba for the current partition */
1300 curr_part_end = __le64_to_cpu(part->ending_lba);
1301 if (curr_part_end > *endofpart)
1302 *endofpart = curr_part_end;
1303 }
1304
1305 part = (struct GPT_part_entry*)((unsigned char*)part + entry_size);
1306
1307 if ((unsigned char *)part >= buf + 512) {
1308 if (read(fd, buf, 512) != 512)
1309 return 0;
1310 part = (struct GPT_part_entry*)buf;
1311 }
1312 }
1313 return 1;
1314 }
1315
1316 /* Sets endofpart parameter to the last block used by the last partition on the device.
1317 * Returns: 1 if successful
1318 * -1 for unknown partition type
1319 * 0 for other errors
1320 */
1321 static int get_last_partition_end(int fd, unsigned long long *endofpart)
1322 {
1323 struct MBR boot_sect;
1324 struct MBR_part_record *part;
1325 unsigned long long curr_part_end;
1326 unsigned part_nr;
1327 int retval = 0;
1328
1329 *endofpart = 0;
1330
1331 BUILD_BUG_ON(sizeof(boot_sect) != 512);
1332 /* read MBR */
1333 lseek(fd, 0, 0);
1334 if (read(fd, &boot_sect, 512) != 512)
1335 goto abort;
1336
1337 /* check MBP signature */
1338 if (boot_sect.magic == MBR_SIGNATURE_MAGIC) {
1339 retval = 1;
1340 /* found the correct signature */
1341 part = boot_sect.parts;
1342
1343 for (part_nr=0; part_nr < MBR_PARTITIONS; part_nr++) {
1344 /* check for GPT type */
1345 if (part->part_type == MBR_GPT_PARTITION_TYPE) {
1346 retval = get_gpt_last_partition_end(fd, endofpart);
1347 break;
1348 }
1349 /* check the last used lba for the current partition */
1350 curr_part_end = __le32_to_cpu(part->first_sect_lba) +
1351 __le32_to_cpu(part->blocks_num);
1352 if (curr_part_end > *endofpart)
1353 *endofpart = curr_part_end;
1354
1355 part++;
1356 }
1357 } else {
1358 /* Unknown partition table */
1359 retval = -1;
1360 }
1361 abort:
1362 return retval;
1363 }
1364
1365 int check_partitions(int fd, char *dname, unsigned long long freesize,
1366 unsigned long long size)
1367 {
1368 /*
1369 * Check where the last partition ends
1370 */
1371 unsigned long long endofpart;
1372 int ret;
1373
1374 if ((ret = get_last_partition_end(fd, &endofpart)) > 0) {
1375 /* There appears to be a partition table here */
1376 if (freesize == 0) {
1377 /* partitions will not be visible in new device */
1378 fprintf(stderr,
1379 Name ": partition table exists on %s but will be lost or\n"
1380 " meaningless after creating array\n",
1381 dname);
1382 return 1;
1383 } else if (endofpart > freesize) {
1384 /* last partition overlaps metadata */
1385 fprintf(stderr,
1386 Name ": metadata will over-write last partition on %s.\n",
1387 dname);
1388 return 1;
1389 } else if (size && endofpart > size) {
1390 /* partitions will be truncated in new device */
1391 fprintf(stderr,
1392 Name ": array size is too small to cover all partitions on %s.\n",
1393 dname);
1394 return 1;
1395 }
1396 }
1397 return 0;
1398 }
1399
1400 void get_one_disk(int mdfd, mdu_array_info_t *ainf, mdu_disk_info_t *disk)
1401 {
1402 int d;
1403 ioctl(mdfd, GET_ARRAY_INFO, ainf);
1404 for (d = 0 ; d < ainf->raid_disks + ainf->nr_disks ; d++)
1405 if (ioctl(mdfd, GET_DISK_INFO, disk) == 0)
1406 return;
1407 }
1408
1409 int open_container(int fd)
1410 {
1411 /* 'fd' is a block device. Find out if it is in use
1412 * by a container, and return an open fd on that container.
1413 */
1414 char path[256];
1415 char *e;
1416 DIR *dir;
1417 struct dirent *de;
1418 int dfd, n;
1419 char buf[200];
1420 int major, minor;
1421 struct stat st;
1422
1423 if (fstat(fd, &st) != 0)
1424 return -1;
1425 sprintf(path, "/sys/dev/block/%d:%d/holders",
1426 (int)major(st.st_rdev), (int)minor(st.st_rdev));
1427 e = path + strlen(path);
1428
1429 dir = opendir(path);
1430 if (!dir)
1431 return -1;
1432 while ((de = readdir(dir))) {
1433 if (de->d_ino == 0)
1434 continue;
1435 if (de->d_name[0] == '.')
1436 continue;
1437 sprintf(e, "/%s/dev", de->d_name);
1438 dfd = open(path, O_RDONLY);
1439 if (dfd < 0)
1440 continue;
1441 n = read(dfd, buf, sizeof(buf));
1442 close(dfd);
1443 if (n <= 0 || (unsigned)n >= sizeof(buf))
1444 continue;
1445 buf[n] = 0;
1446 if (sscanf(buf, "%d:%d", &major, &minor) != 2)
1447 continue;
1448 sprintf(buf, "%d:%d", major, minor);
1449 dfd = dev_open(buf, O_RDONLY);
1450 if (dfd >= 0) {
1451 closedir(dir);
1452 return dfd;
1453 }
1454 }
1455 closedir(dir);
1456 return -1;
1457 }
1458
1459 struct superswitch *version_to_superswitch(char *vers)
1460 {
1461 int i;
1462
1463 for (i = 0; superlist[i]; i++) {
1464 struct superswitch *ss = superlist[i];
1465
1466 if (strcmp(vers, ss->name) == 0)
1467 return ss;
1468 }
1469
1470 return NULL;
1471 }
1472
1473 int is_container_member(struct mdstat_ent *mdstat, char *container)
1474 {
1475 if (mdstat->metadata_version == NULL ||
1476 strncmp(mdstat->metadata_version, "external:", 9) != 0 ||
1477 !is_subarray(mdstat->metadata_version+9) ||
1478 strncmp(mdstat->metadata_version+10, container, strlen(container)) != 0 ||
1479 mdstat->metadata_version[10+strlen(container)] != '/')
1480 return 0;
1481
1482 return 1;
1483 }
1484
1485 int is_subarray_active(char *subarray, char *container)
1486 {
1487 struct mdstat_ent *mdstat = mdstat_read(0, 0);
1488 struct mdstat_ent *ent;
1489
1490 for (ent = mdstat; ent; ent = ent->next)
1491 if (is_container_member(ent, container))
1492 if (strcmp(to_subarray(ent, container), subarray) == 0)
1493 break;
1494
1495 free_mdstat(mdstat);
1496
1497 return ent != NULL;
1498 }
1499
1500 /* open_subarray - opens a subarray in a container
1501 * @dev: container device name
1502 * @st: empty supertype
1503 * @quiet: block reporting errors flag
1504 *
1505 * On success returns an fd to a container and fills in *st
1506 */
1507 int open_subarray(char *dev, char *subarray, struct supertype *st, int quiet)
1508 {
1509 struct mdinfo *mdi;
1510 struct mdinfo *info;
1511 int fd, err = 1;
1512
1513 fd = open(dev, O_RDWR|O_EXCL);
1514 if (fd < 0) {
1515 if (!quiet)
1516 fprintf(stderr, Name ": Couldn't open %s, aborting\n",
1517 dev);
1518 return 2;
1519 }
1520
1521 st->devnum = fd2devnum(fd);
1522 if (st->devnum == NoMdDev) {
1523 if (!quiet)
1524 fprintf(stderr,
1525 Name ": Failed to determine device number for %s\n",
1526 dev);
1527 goto close_fd;
1528 }
1529
1530 mdi = sysfs_read(fd, st->devnum, GET_VERSION|GET_LEVEL);
1531 if (!mdi) {
1532 if (!quiet)
1533 fprintf(stderr, Name ": Failed to read sysfs for %s\n",
1534 dev);
1535 goto close_fd;
1536 }
1537
1538 if (mdi->array.level != UnSet) {
1539 if (!quiet)
1540 fprintf(stderr, Name ": %s is not a container\n", dev);
1541 goto free_sysfs;
1542 }
1543
1544 st->ss = version_to_superswitch(mdi->text_version);
1545 if (!st->ss) {
1546 if (!quiet)
1547 fprintf(stderr,
1548 Name ": Operation not supported for %s metadata\n",
1549 mdi->text_version);
1550 goto free_sysfs;
1551 }
1552
1553 st->devname = devnum2devname(st->devnum);
1554 if (!st->devname) {
1555 if (!quiet)
1556 fprintf(stderr, Name ": Failed to allocate device name\n");
1557 goto free_sysfs;
1558 }
1559
1560 if (!st->ss->load_container) {
1561 if (!quiet)
1562 fprintf(stderr, Name ": %s is not a container\n", dev);
1563 goto free_name;
1564 }
1565
1566 if (st->ss->load_container(st, fd, NULL)) {
1567 if (!quiet)
1568 fprintf(stderr, Name ": Failed to load metadata for %s\n",
1569 dev);
1570 goto free_name;
1571 }
1572
1573 info = st->ss->container_content(st, subarray);
1574 if (!info) {
1575 if (!quiet)
1576 fprintf(stderr, Name ": Failed to find subarray-%s in %s\n",
1577 subarray, dev);
1578 goto free_super;
1579 }
1580 free(info);
1581
1582 err = 0;
1583
1584 free_super:
1585 if (err)
1586 st->ss->free_super(st);
1587 free_name:
1588 if (err)
1589 free(st->devname);
1590 free_sysfs:
1591 sysfs_free(mdi);
1592 close_fd:
1593 if (err)
1594 close(fd);
1595
1596 if (err)
1597 return -1;
1598 else
1599 return fd;
1600 }
1601
1602 int add_disk(int mdfd, struct supertype *st,
1603 struct mdinfo *sra, struct mdinfo *info)
1604 {
1605 /* Add a device to an array, in one of 2 ways. */
1606 int rv;
1607 #ifndef MDASSEMBLE
1608 if (st->ss->external) {
1609 if (info->disk.state & (1<<MD_DISK_SYNC))
1610 info->recovery_start = MaxSector;
1611 else
1612 info->recovery_start = 0;
1613 rv = sysfs_add_disk(sra, info, 0);
1614 if (! rv) {
1615 struct mdinfo *sd2;
1616 for (sd2 = sra->devs; sd2; sd2=sd2->next)
1617 if (sd2 == info)
1618 break;
1619 if (sd2 == NULL) {
1620 sd2 = malloc(sizeof(*sd2));
1621 *sd2 = *info;
1622 sd2->next = sra->devs;
1623 sra->devs = sd2;
1624 }
1625 }
1626 } else
1627 #endif
1628 rv = ioctl(mdfd, ADD_NEW_DISK, &info->disk);
1629 return rv;
1630 }
1631
1632 int remove_disk(int mdfd, struct supertype *st,
1633 struct mdinfo *sra, struct mdinfo *info)
1634 {
1635 int rv;
1636 /* Remove the disk given by 'info' from the array */
1637 #ifndef MDASSEMBLE
1638 if (st->ss->external)
1639 rv = sysfs_set_str(sra, info, "slot", "none");
1640 else
1641 #endif
1642 rv = ioctl(mdfd, HOT_REMOVE_DISK, makedev(info->disk.major,
1643 info->disk.minor));
1644 return rv;
1645 }
1646
1647 int set_array_info(int mdfd, struct supertype *st, struct mdinfo *info)
1648 {
1649 /* Initialise kernel's knowledge of array.
1650 * This varies between externally managed arrays
1651 * and older kernels
1652 */
1653 int vers = md_get_version(mdfd);
1654 int rv;
1655
1656 #ifndef MDASSEMBLE
1657 if (st->ss->external)
1658 rv = sysfs_set_array(info, vers);
1659 else
1660 #endif
1661 if ((vers % 100) >= 1) { /* can use different versions */
1662 mdu_array_info_t inf;
1663 memset(&inf, 0, sizeof(inf));
1664 inf.major_version = info->array.major_version;
1665 inf.minor_version = info->array.minor_version;
1666 rv = ioctl(mdfd, SET_ARRAY_INFO, &inf);
1667 } else
1668 rv = ioctl(mdfd, SET_ARRAY_INFO, NULL);
1669 return rv;
1670 }
1671
1672 unsigned long long min_recovery_start(struct mdinfo *array)
1673 {
1674 /* find the minimum recovery_start in an array for metadata
1675 * formats that only record per-array recovery progress instead
1676 * of per-device
1677 */
1678 unsigned long long recovery_start = MaxSector;
1679 struct mdinfo *d;
1680
1681 for (d = array->devs; d; d = d->next)
1682 recovery_start = min(recovery_start, d->recovery_start);
1683
1684 return recovery_start;
1685 }
1686
1687 void fmt_devname(char *name, int num)
1688 {
1689 if (num >= 0)
1690 sprintf(name, "md%d", num);
1691 else
1692 sprintf(name, "md_d%d", -1-num);
1693 }
1694
1695 char *devnum2devname(int num)
1696 {
1697 char name[100];
1698 fmt_devname(name,num);
1699 return strdup(name);
1700 }
1701
1702 int devname2devnum(char *name)
1703 {
1704 char *ep;
1705 int num;
1706 if (strncmp(name, "md_d", 4)==0)
1707 num = -1-strtoul(name+4, &ep, 10);
1708 else
1709 num = strtoul(name+2, &ep, 10);
1710 return num;
1711 }
1712
1713 int stat2devnum(struct stat *st)
1714 {
1715 char path[30];
1716 char link[200];
1717 char *cp;
1718 int n;
1719
1720 if ((S_IFMT & st->st_mode) == S_IFBLK) {
1721 if (major(st->st_rdev) == MD_MAJOR)
1722 return minor(st->st_rdev);
1723 else if (major(st->st_rdev) == (unsigned)get_mdp_major())
1724 return -1- (minor(st->st_rdev)>>MdpMinorShift);
1725
1726 /* must be an extended-minor partition. Look at the
1727 * /sys/dev/block/%d:%d link which must look like
1728 * ../../block/mdXXX/mdXXXpYY
1729 */
1730 sprintf(path, "/sys/dev/block/%d:%d", major(st->st_rdev),
1731 minor(st->st_rdev));
1732 n = readlink(path, link, sizeof(link)-1);
1733 if (n <= 0)
1734 return NoMdDev;
1735 link[n] = 0;
1736 cp = strrchr(link, '/');
1737 if (cp) *cp = 0;
1738 cp = strrchr(link, '/');
1739 if (cp && strncmp(cp, "/md", 3) == 0)
1740 return devname2devnum(cp+1);
1741 }
1742 return NoMdDev;
1743
1744 }
1745
1746 int fd2devnum(int fd)
1747 {
1748 struct stat stb;
1749 if (fstat(fd, &stb) == 0)
1750 return stat2devnum(&stb);
1751 return NoMdDev;
1752 }
1753
1754 int mdmon_pid(int devnum)
1755 {
1756 char path[100];
1757 char pid[10];
1758 int fd;
1759 int n;
1760 char *devname = devnum2devname(devnum);
1761
1762 sprintf(path, "%s/%s.pid", MDMON_DIR, devname);
1763 free(devname);
1764
1765 fd = open(path, O_RDONLY | O_NOATIME, 0);
1766
1767 if (fd < 0)
1768 return -1;
1769 n = read(fd, pid, 9);
1770 close(fd);
1771 if (n <= 0)
1772 return -1;
1773 return atoi(pid);
1774 }
1775
1776 int mdmon_running(int devnum)
1777 {
1778 int pid = mdmon_pid(devnum);
1779 if (pid <= 0)
1780 return 0;
1781 if (kill(pid, 0) == 0)
1782 return 1;
1783 return 0;
1784 }
1785
1786 int start_mdmon(int devnum)
1787 {
1788 int i;
1789 int len;
1790 pid_t pid;
1791 int status;
1792 char pathbuf[1024];
1793 char *paths[4] = {
1794 pathbuf,
1795 "/sbin/mdmon",
1796 "mdmon",
1797 NULL
1798 };
1799
1800 if (check_env("MDADM_NO_MDMON"))
1801 return 0;
1802
1803 len = readlink("/proc/self/exe", pathbuf, sizeof(pathbuf));
1804 if (len > 0) {
1805 char *sl;
1806 pathbuf[len] = 0;
1807 sl = strrchr(pathbuf, '/');
1808 if (sl)
1809 sl++;
1810 else
1811 sl = pathbuf;
1812 strcpy(sl, "mdmon");
1813 } else
1814 pathbuf[0] = '\0';
1815
1816 switch(fork()) {
1817 case 0:
1818 /* FIXME yuk. CLOSE_EXEC?? */
1819 for (i=3; i < 100; i++)
1820 close(i);
1821 for (i=0; paths[i]; i++)
1822 if (paths[i][0])
1823 execl(paths[i], "mdmon",
1824 devnum2devname(devnum),
1825 NULL);
1826 exit(1);
1827 case -1: fprintf(stderr, Name ": cannot run mdmon. "
1828 "Array remains readonly\n");
1829 return -1;
1830 default: /* parent - good */
1831 pid = wait(&status);
1832 if (pid < 0 || status != 0)
1833 return -1;
1834 }
1835 return 0;
1836 }
1837
1838 int check_env(char *name)
1839 {
1840 char *val = getenv(name);
1841
1842 if (val && atoi(val) == 1)
1843 return 1;
1844
1845 return 0;
1846 }
1847
1848 __u32 random32(void)
1849 {
1850 __u32 rv;
1851 int rfd = open("/dev/urandom", O_RDONLY);
1852 if (rfd < 0 || read(rfd, &rv, 4) != 4)
1853 rv = random();
1854 if (rfd >= 0)
1855 close(rfd);
1856 return rv;
1857 }
1858
1859 #ifndef MDASSEMBLE
1860 int flush_metadata_updates(struct supertype *st)
1861 {
1862 int sfd;
1863 if (!st->updates) {
1864 st->update_tail = NULL;
1865 return -1;
1866 }
1867
1868 sfd = connect_monitor(devnum2devname(st->container_dev));
1869 if (sfd < 0)
1870 return -1;
1871
1872 while (st->updates) {
1873 struct metadata_update *mu = st->updates;
1874 st->updates = mu->next;
1875
1876 send_message(sfd, mu, 0);
1877 wait_reply(sfd, 0);
1878 free(mu->buf);
1879 free(mu);
1880 }
1881 ack(sfd, 0);
1882 wait_reply(sfd, 0);
1883 close(sfd);
1884 st->update_tail = NULL;
1885 return 0;
1886 }
1887
1888 void append_metadata_update(struct supertype *st, void *buf, int len)
1889 {
1890
1891 struct metadata_update *mu = malloc(sizeof(*mu));
1892
1893 mu->buf = buf;
1894 mu->len = len;
1895 mu->space = NULL;
1896 mu->space_list = NULL;
1897 mu->next = NULL;
1898 *st->update_tail = mu;
1899 st->update_tail = &mu->next;
1900 }
1901 #endif /* MDASSEMBLE */
1902
1903 #ifdef __TINYC__
1904 /* tinyc doesn't optimize this check in ioctl.h out ... */
1905 unsigned int __invalid_size_argument_for_IOC = 0;
1906 #endif
1907
1908 int experimental(void)
1909 {
1910 if (check_env("MDADM_EXPERIMENTAL"))
1911 return 1;
1912 else {
1913 fprintf(stderr, Name ": To use this feature MDADM_EXPERIMENTAL enviroment variable has to defined.\n");
1914 return 0;
1915 }
1916 }
1917
1918 /* Pick all spares matching given criteria from a container
1919 * if min_size == 0 do not check size
1920 * if domlist == NULL do not check domains
1921 * if spare_group given add it to domains of each spare
1922 * metadata allows to test domains using metadata of destination array */
1923 struct mdinfo *container_choose_spares(struct supertype *st,
1924 unsigned long long min_size,
1925 struct domainlist *domlist,
1926 char *spare_group,
1927 const char *metadata, int get_one)
1928 {
1929 struct mdinfo *d, **dp, *disks = NULL;
1930
1931 /* get list of all disks in container */
1932 if (st->ss->getinfo_super_disks)
1933 disks = st->ss->getinfo_super_disks(st);
1934
1935 if (!disks)
1936 return disks;
1937 /* find spare devices on the list */
1938 dp = &disks->devs;
1939 disks->array.spare_disks = 0;
1940 while (*dp) {
1941 int found = 0;
1942 d = *dp;
1943 if (d->disk.state == 0) {
1944 /* check if size is acceptable */
1945 unsigned long long dev_size;
1946 dev_t dev = makedev(d->disk.major,d->disk.minor);
1947
1948 if (!min_size ||
1949 (dev_size_from_id(dev, &dev_size) &&
1950 dev_size >= min_size))
1951 found = 1;
1952 /* check if domain matches */
1953 if (found && domlist) {
1954 struct dev_policy *pol = devnum_policy(dev);
1955 if (spare_group)
1956 pol_add(&pol, pol_domain,
1957 spare_group, NULL);
1958 if (domain_test(domlist, pol, metadata) != 1)
1959 found = 0;
1960 dev_policy_free(pol);
1961 }
1962 }
1963 if (found) {
1964 dp = &d->next;
1965 disks->array.spare_disks++;
1966 if (get_one) {
1967 sysfs_free(*dp);
1968 d->next = NULL;
1969 }
1970 } else {
1971 *dp = d->next;
1972 d->next = NULL;
1973 sysfs_free(d);
1974 }
1975 }
1976 return disks;
1977 }