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