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