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