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