Initial DDF support code.
[thirdparty/mdadm.git] / util.c
CommitLineData
64c4757e 1/*
9a9dab36 2 * mdadm - manage Linux "md" devices aka RAID arrays.
64c4757e 3 *
4f589ad0 4 * Copyright (C) 2001-2006 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
22 * Email: <neilb@cse.unsw.edu.au>
23 * Paper: Neil Brown
24 * School of Computer Science and Engineering
25 * The University of New South Wales
26 * Sydney, 2052
27 * Australia
28 */
29
9a9dab36 30#include "mdadm.h"
64c4757e
NB
31#include "md_p.h"
32#include <sys/utsname.h>
98c6faba 33#include <ctype.h>
a322f70c 34#include <dirent.h>
0a816ef9
NB
35
36/*
37 * following taken from linux/blkpg.h because they aren't
38 * anywhere else and it isn't safe to #include linux/ * stuff.
39 */
40
41#define BLKPG _IO(0x12,105)
42
43/* The argument structure */
44struct blkpg_ioctl_arg {
45 int op;
46 int flags;
47 int datalen;
48 void *data;
49};
50
51/* The subfunctions (for the op field) */
52#define BLKPG_ADD_PARTITION 1
53#define BLKPG_DEL_PARTITION 2
54
55/* Sizes of name fields. Unused at present. */
56#define BLKPG_DEVNAMELTH 64
57#define BLKPG_VOLNAMELTH 64
58
59/* The data structure for ADD_PARTITION and DEL_PARTITION */
60struct blkpg_partition {
61 long long start; /* starting offset in bytes */
62 long long length; /* length in bytes */
63 int pno; /* partition number */
64 char devname[BLKPG_DEVNAMELTH]; /* partition name, like sda5 or c0d1p2,
65 to be used in kernel messages */
66 char volname[BLKPG_VOLNAMELTH]; /* volume label */
67};
64c4757e
NB
68
69/*
70 * Parse a 128 bit uuid in 4 integers
71 * format is 32 hexx nibbles with options :.<space> separator
72 * If not exactly 32 hex digits are found, return 0
73 * else return 1
74 */
75int parse_uuid(char *str, int uuid[4])
76{
aba69144
NB
77 int hit = 0; /* number of Hex digIT */
78 int i;
79 char c;
80 for (i=0; i<4; i++) uuid[i]=0;
81
82 while ((c= *str++)) {
83 int n;
84 if (c>='0' && c<='9')
85 n = c-'0';
86 else if (c>='a' && c <= 'f')
87 n = 10 + c - 'a';
88 else if (c>='A' && c <= 'F')
89 n = 10 + c - 'A';
90 else if (strchr(":. -", c))
91 continue;
92 else return 0;
93
94 if (hit<32) {
95 uuid[hit/8] <<= 4;
96 uuid[hit/8] += n;
97 }
98 hit++;
82b27616 99 }
aba69144
NB
100 if (hit == 32)
101 return 1;
102 return 0;
64c4757e
NB
103}
104
105
106/*
107 * Get the md version number.
108 * We use the RAID_VERSION ioctl if it is supported
109 * If not, but we have a block device with major '9', we assume
110 * 0.36.0
111 *
112 * Return version number as 24 but number - assume version parts
113 * always < 255
114 */
115
116int md_get_version(int fd)
117{
118 struct stat stb;
119 mdu_version_t vers;
120
121 if (fstat(fd, &stb)<0)
122 return -1;
123 if ((S_IFMT&stb.st_mode) != S_IFBLK)
124 return -1;
125
126 if (ioctl(fd, RAID_VERSION, &vers) == 0)
682c7051 127 return (vers.major*10000) + (vers.minor*100) + vers.patchlevel;
5787fa49
NB
128 if (errno == EACCES)
129 return -1;
0df46c2a 130 if (major(stb.st_rdev) == MD_MAJOR)
682c7051 131 return (3600);
64c4757e
NB
132 return -1;
133}
134
64c4757e
NB
135int get_linux_version()
136{
137 struct utsname name;
98c6faba 138 char *cp;
64c4757e
NB
139 int a,b,c;
140 if (uname(&name) <0)
141 return -1;
142
98c6faba
NB
143 cp = name.release;
144 a = strtoul(cp, &cp, 10);
145 if (*cp != '.') return -1;
146 b = strtoul(cp+1, &cp, 10);
147 if (*cp != '.') return -1;
148 c = strtoul(cp+1, NULL, 10);
149
682c7051 150 return (a*1000000)+(b*1000)+c;
64c4757e
NB
151}
152
0430ed48
NB
153void remove_partitions(int fd)
154{
155 /* remove partitions from this block devices.
156 * This is used for components added to an array
157 */
158#ifdef BLKPG_DEL_PARTITION
159 struct blkpg_ioctl_arg a;
160 struct blkpg_partition p;
161
162 a.op = BLKPG_DEL_PARTITION;
163 a.data = (void*)&p;
164 a.datalen = sizeof(p);
165 a.flags = 0;
166 memset(a.data, 0, a.datalen);
167 for (p.pno=0; p.pno < 16; p.pno++)
168 ioctl(fd, BLKPG, &a);
169#endif
170}
171
583315d9 172int enough(int level, int raid_disks, int layout, int clean,
265e0f17 173 char *avail, int avail_disks)
64c4757e 174{
265e0f17 175 int copies, first;
64c4757e 176 switch (level) {
265e0f17
NB
177 case 10:
178 /* This is the tricky one - we need to check
179 * which actual disks are present.
180 */
702b557b 181 copies = (layout&255)* ((layout>>8) & 255);
265e0f17
NB
182 first=0;
183 do {
184 /* there must be one of the 'copies' form 'first' */
185 int n = copies;
186 int cnt=0;
187 while (n--) {
188 if (avail[first])
189 cnt++;
190 first = (first+1) % raid_disks;
191 }
192 if (cnt == 0)
193 return 0;
194
195 } while (first != 0);
196 return 1;
e5329c37 197
e0d19036
NB
198 case -4:
199 return avail_disks>= 1;
64c4757e
NB
200 case -1:
201 case 0:
202 return avail_disks == raid_disks;
203 case 1:
204 return avail_disks >= 1;
205 case 4:
206 case 5:
583315d9
NB
207 if (clean)
208 return avail_disks >= raid_disks-1;
209 else
210 return avail_disks >= raid_disks;
98c6faba 211 case 6:
583315d9
NB
212 if (clean)
213 return avail_disks >= raid_disks-2;
214 else
215 return avail_disks >= raid_disks;
64c4757e
NB
216 default:
217 return 0;
218 }
219}
220
f277ce36 221int same_uuid(int a[4], int b[4], int swapuuid)
64c4757e 222{
f277ce36
NB
223 if (swapuuid) {
224 /* parse uuids are hostendian.
225 * uuid's from some superblocks are big-ending
aba69144 226 * if there is a difference, we need to swap..
f277ce36
NB
227 */
228 unsigned char *ac = (unsigned char *)a;
229 unsigned char *bc = (unsigned char *)b;
230 int i;
231 for (i=0; i<16; i+= 4) {
232 if (ac[i+0] != bc[i+3] ||
233 ac[i+1] != bc[i+2] ||
234 ac[i+2] != bc[i+1] ||
235 ac[i+3] != bc[i+0])
236 return 0;
237 }
238 return 1;
239 } else {
240 if (a[0]==b[0] &&
241 a[1]==b[1] &&
242 a[2]==b[2] &&
243 a[3]==b[3])
244 return 1;
245 return 0;
246 }
64c4757e 247}
350f29f9
NB
248void copy_uuid(void *a, int b[4], int swapuuid)
249{
250 if (swapuuid) {
251 /* parse uuids are hostendian.
252 * uuid's from some superblocks are big-ending
253 * if there is a difference, we need to swap..
254 */
255 unsigned char *ac = (unsigned char *)a;
256 unsigned char *bc = (unsigned char *)b;
257 int i;
258 for (i=0; i<16; i+= 4) {
259 ac[i+0] = bc[i+3];
260 ac[i+1] = bc[i+2];
261 ac[i+2] = bc[i+1];
262 ac[i+3] = bc[i+0];
263 }
264 } else
265 memcpy(a, b, 16);
266}
64c4757e 267
435d4ebb 268#ifndef MDASSEMBLE
682c7051
NB
269int check_ext2(int fd, char *name)
270{
271 /*
272 * Check for an ext2fs file system.
273 * Superblock is always 1K at 1K offset
274 *
275 * s_magic is le16 at 56 == 0xEF53
276 * report mtime - le32 at 44
277 * blocks - le32 at 4
278 * logblksize - le32 at 24
279 */
280 unsigned char sb[1024];
281 time_t mtime;
282 int size, bsize;
283 if (lseek(fd, 1024,0)!= 1024)
284 return 0;
285 if (read(fd, sb, 1024)!= 1024)
286 return 0;
287 if (sb[56] != 0x53 || sb[57] != 0xef)
288 return 0;
289
290 mtime = sb[44]|(sb[45]|(sb[46]|sb[47]<<8)<<8)<<8;
291 bsize = sb[24]|(sb[25]|(sb[26]|sb[27]<<8)<<8)<<8;
292 size = sb[4]|(sb[5]|(sb[6]|sb[7]<<8)<<8)<<8;
293 fprintf(stderr, Name ": %s appears to contain an ext2fs file system\n",
294 name);
295 fprintf(stderr," size=%dK mtime=%s",
296 size*(1<<bsize), ctime(&mtime));
297 return 1;
298}
299
300int check_reiser(int fd, char *name)
301{
302 /*
303 * superblock is at 64K
304 * size is 1024;
305 * Magic string "ReIsErFs" or "ReIsEr2Fs" at 52
306 *
307 */
308 unsigned char sb[1024];
881990a2 309 unsigned long size;
682c7051
NB
310 if (lseek(fd, 64*1024, 0) != 64*1024)
311 return 0;
312 if (read(fd, sb, 1024) != 1024)
313 return 0;
a46f4061
NB
314 if (strncmp((char*)sb+52, "ReIsErFs",8)!=0 &&
315 strncmp((char*)sb+52, "ReIsEr2Fs",9)!=0)
682c7051
NB
316 return 0;
317 fprintf(stderr, Name ": %s appears to contain a reiserfs file system\n",name);
318 size = sb[0]|(sb[1]|(sb[2]|sb[3]<<8)<<8)<<8;
881990a2 319 fprintf(stderr, " size = %luK\n", size*4);
aba69144 320
682c7051
NB
321 return 1;
322}
323
324int check_raid(int fd, char *name)
325{
4b1ac34b 326 struct mdinfo info;
682c7051 327 time_t crtime;
d078d77c 328 char *level;
82d9eba6 329 struct supertype *st = guess_super(fd);
f9ce90ba 330
82d9eba6 331 if (!st) return 0;
3da92f27 332 st->ss->load_super(st, fd, name);
82d9eba6
NB
333 /* Looks like a raid array .. */
334 fprintf(stderr, Name ": %s appears to be part of a raid array:\n",
335 name);
3da92f27
NB
336 st->ss->getinfo_super(st, &info);
337 st->ss->free_super(st);
82d9eba6 338 crtime = info.array.ctime;
d078d77c
NB
339 level = map_num(pers, info.array.level);
340 if (!level) level = "-unknown-";
341 fprintf(stderr, " level=%s devices=%d ctime=%s",
342 level, info.array.raid_disks, ctime(&crtime));
82d9eba6 343 return 1;
682c7051
NB
344}
345
682c7051
NB
346int ask(char *mesg)
347{
348 char *add = "";
349 int i;
350 for (i=0; i<5; i++) {
351 char buf[100];
352 fprintf(stderr, "%s%s", mesg, add);
353 fflush(stderr);
354 if (fgets(buf, 100, stdin)==NULL)
355 return 0;
356 if (buf[0]=='y' || buf[0]=='Y')
357 return 1;
358 if (buf[0]=='n' || buf[0]=='N')
359 return 0;
360 add = "(y/n) ";
361 }
362 fprintf(stderr, Name ": assuming 'no'\n");
363 return 0;
364}
435d4ebb 365#endif /* MDASSEMBLE */
682c7051
NB
366
367char *map_num(mapping_t *map, int num)
368{
369 while (map->name) {
370 if (map->num == num)
371 return map->name;
372 map++;
373 }
374 return NULL;
375}
376
377int map_name(mapping_t *map, char *name)
378{
379 while (map->name) {
380 if (strcmp(map->name, name)==0)
381 return map->num;
382 map++;
383 }
98c6faba 384 return UnSet;
682c7051 385}
82b27616 386
e5329c37 387
8d80900b 388int is_standard(char *dev, int *nump)
e5329c37
NB
389{
390 /* tests if dev is a "standard" md dev name.
391 * i.e if the last component is "/dNN" or "/mdNN",
aba69144 392 * where NN is a string of digits
e5329c37 393 */
8d80900b
NB
394 char *d = strrchr(dev, '/');
395 int type=0;
396 int num;
397 if (!d)
e5329c37 398 return 0;
8d80900b
NB
399 if (strncmp(d, "/d",2)==0)
400 d += 2, type=1; /* /dev/md/dN{pM} */
401 else if (strncmp(d, "/md_d", 5)==0)
402 d += 5, type=1; /* /dev/md_dNpM */
403 else if (strncmp(d, "/md", 3)==0)
404 d += 3, type=-1; /* /dev/mdN */
405 else if (d-dev > 3 && strncmp(d-2, "md/", 3)==0)
5a6d1148 406 d += 1, type=-1; /* /dev/md/N */
e5329c37
NB
407 else
408 return 0;
8d80900b 409 if (!*d)
e5329c37 410 return 0;
8d80900b
NB
411 num = atoi(d);
412 while (isdigit(*d))
413 d++;
414 if (*d)
e5329c37 415 return 0;
8d80900b
NB
416 if (nump) *nump = num;
417
418 return type;
e5329c37
NB
419}
420
421
82b27616
NB
422/*
423 * convert a major/minor pair for a block device into a name in /dev, if possible.
424 * On the first call, walk /dev collecting name.
425 * Put them in a simple linked listfor now.
426 */
427struct devmap {
428 int major, minor;
429 char *name;
430 struct devmap *next;
431} *devlist = NULL;
432int devlist_ready = 0;
433
82b27616
NB
434int add_dev(const char *name, const struct stat *stb, int flag, struct FTW *s)
435{
bed256c2
NB
436 struct stat st;
437 if (S_ISLNK(stb->st_mode)) {
438 stat(name, &st);
439 stb = &st;
82b27616 440 }
bed256c2
NB
441
442 if ((stb->st_mode&S_IFMT)== S_IFBLK) {
443 char *n = strdup(name);
444 struct devmap *dm = malloc(sizeof(*dm));
445 if (strncmp(n, "/dev/./", 7)==0)
446 strcpy(n+4, name+6);
447 if (dm) {
448 dm->major = major(stb->st_rdev);
449 dm->minor = minor(stb->st_rdev);
450 dm->name = n;
451 dm->next = devlist;
452 devlist = dm;
453 }
454 }
455 return 0;
82b27616
NB
456}
457
45e878bb
NB
458#ifndef HAVE_NFTW
459#ifdef HAVE_FTW
460int add_dev_1(const char *name, const struct stat *stb, int flag)
461{
462 return add_dev(name, stb, flag, NULL);
463}
464int nftw(const char *path, int (*han)(const char *name, const struct stat *stb, int flag, struct FTW *s), int nopenfd, int flags)
465{
466 return ftw(path, add_dev_1, nopenfd);
467}
468#else
45e878bb
NB
469int nftw(const char *path, int (*han)(const char *name, const struct stat *stb, int flag, struct FTW *s), int nopenfd, int flags)
470{
471 return 0;
472}
473#endif /* HAVE_FTW */
474#endif /* HAVE_NFTW */
475
dd0781e5
NB
476/*
477 * Find a block device with the right major/minor number.
b79713f8
NB
478 * If we find multiple names, choose the shortest.
479 * If we find a non-standard name, it is probably there
480 * deliberately so prefer it over a standard name.
481 * This applies only to names for MD devices.
dd0781e5 482 */
16c6fa80 483char *map_dev(int major, int minor, int create)
82b27616 484{
dd0781e5 485 struct devmap *p;
b79713f8 486 char *std = NULL, *nonstd=NULL;
e7bb5d23 487 int did_check = 0;
eed35d66 488
e81cdd9f 489 if (major == 0 && minor == 0)
eed35d66 490 return NULL;
e81cdd9f 491
e7bb5d23 492 retry:
dd0781e5 493 if (!devlist_ready) {
0a416ec3
NB
494 char *dev = "/dev";
495 struct stat stb;
eed35d66
NB
496 while(devlist) {
497 struct devmap *d = devlist;
498 devlist = d->next;
499 free(d->name);
500 free(d);
501 }
0a416ec3
NB
502 if (lstat(dev, &stb)==0 &&
503 S_ISLNK(stb.st_mode))
504 dev = "/dev/.";
505 nftw(dev, add_dev, 10, FTW_PHYS);
dd0781e5 506 devlist_ready=1;
e7bb5d23 507 did_check = 1;
dd0781e5 508 }
82b27616 509
dd0781e5
NB
510 for (p=devlist; p; p=p->next)
511 if (p->major == major &&
512 p->minor == minor) {
b79713f8
NB
513 if (is_standard(p->name, NULL)) {
514 if (std == NULL ||
515 strlen(p->name) < strlen(std))
516 std = p->name;
517 } else {
518 if (nonstd == NULL ||
519 strlen(p->name) < strlen(nonstd))
520 nonstd = p->name;
521 }
dd0781e5 522 }
e7bb5d23
NB
523 if (!std && !nonstd && !did_check) {
524 devlist_ready = 0;
525 goto retry;
526 }
16c6fa80
NB
527 if (create && !std && !nonstd) {
528 static char buf[30];
382245c3 529 snprintf(buf, sizeof(buf), "%d:%d", major, minor);
16c6fa80
NB
530 nonstd = buf;
531 }
532
b79713f8 533 return nonstd ? nonstd : std;
82b27616
NB
534}
535
4b1ac34b 536unsigned long calc_csum(void *super, int bytes)
82b27616 537{
56eb10c0 538 unsigned long long newcsum = 0;
82b27616 539 int i;
4b1ac34b
NB
540 unsigned int csum;
541 unsigned int *superc = (unsigned int*) super;
82b27616 542
4b1ac34b 543 for(i=0; i<bytes/4; i++)
82b27616
NB
544 newcsum+= superc[i];
545 csum = (newcsum& 0xffffffff) + (newcsum>>32);
570c0542 546#ifdef __alpha__
aba69144 547/* The in-kernel checksum calculation is always 16bit on
570c0542
NB
548 * the alpha, though it is 32 bit on i386...
549 * I wonder what it is elsewhere... (it uses and API in
550 * a way that it shouldn't).
551 */
552 csum = (csum & 0xffff) + (csum >> 16);
553 csum = (csum & 0xffff) + (csum >> 16);
554#endif
82b27616
NB
555 return csum;
556}
cd29a5c8 557
435d4ebb 558#ifndef MDASSEMBLE
56eb10c0 559char *human_size(long long bytes)
cd29a5c8
NB
560{
561 static char buf[30];
d5d3721e
NB
562
563 /* We convert bytes to either centi-M{ega,ibi}bytes or
564 * centi-G{igi,ibi}bytes, with appropriate rounding,
565 * and then print 1/100th of those as a decimal.
566 * We allow upto 2048Megabytes before converting to
567 * gigabytes, as that shows more precision and isn't
568 * too large a number.
569 * Terrabytes are not yet handled.
570 */
cd29a5c8 571
56eb10c0 572 if (bytes < 5000*1024)
cd29a5c8 573 buf[0]=0;
d5d3721e
NB
574 else if (bytes < 2*1024LL*1024LL*1024LL) {
575 long cMiB = (bytes / ( (1LL<<20) / 200LL ) +1) /2;
576 long cMB = (bytes / ( 1000000LL / 200LL ) +1) /2;
8f23b0b3 577 snprintf(buf, sizeof(buf), " (%ld.%02ld MiB %ld.%02ld MB)",
d5d3721e
NB
578 cMiB/100 , cMiB % 100,
579 cMB/100, cMB % 100);
580 } else {
581 long cGiB = (bytes / ( (1LL<<30) / 200LL ) +1) /2;
582 long cGB = (bytes / (1000000000LL/200LL ) +1) /2;
8f23b0b3 583 snprintf(buf, sizeof(buf), " (%ld.%02ld GiB %ld.%02ld GB)",
d5d3721e
NB
584 cGiB/100 , cGiB % 100,
585 cGB/100, cGB % 100);
586 }
cd29a5c8
NB
587 return buf;
588}
e0d19036
NB
589
590char *human_size_brief(long long bytes)
591{
592 static char buf[30];
e0d19036
NB
593
594 if (bytes < 5000*1024)
8f23b0b3 595 snprintf(buf, sizeof(buf), "%ld.%02ldKiB",
bd526cee 596 (long)(bytes>>10), (long)(((bytes&1023)*100+512)/1024)
e0d19036
NB
597 );
598 else if (bytes < 2*1024LL*1024LL*1024LL)
8f23b0b3 599 snprintf(buf, sizeof(buf), "%ld.%02ldMiB",
e0d19036 600 (long)(bytes>>20),
bd526cee 601 (long)((bytes&0xfffff)+0x100000/200)/(0x100000/100)
e0d19036
NB
602 );
603 else
8f23b0b3 604 snprintf(buf, sizeof(buf), "%ld.%02ldGiB",
e0d19036 605 (long)(bytes>>30),
bd526cee 606 (long)(((bytes>>10)&0xfffff)+0x100000/200)/(0x100000/100)
e0d19036
NB
607 );
608 return buf;
609}
435d4ebb 610#endif
e0d19036 611
435d4ebb 612#if !defined(MDASSEMBLE) || defined(MDASSEMBLE) && defined(MDASSEMBLE_AUTO)
dd0781e5 613int get_mdp_major(void)
98c6faba 614{
dd0781e5
NB
615static int mdp_major = -1;
616 FILE *fl;
98c6faba
NB
617 char *w;
618 int have_block = 0;
619 int have_devices = 0;
620 int last_num = -1;
dd0781e5
NB
621
622 if (mdp_major != -1)
623 return mdp_major;
624 fl = fopen("/proc/devices", "r");
98c6faba 625 if (!fl)
dd0781e5 626 return -1;
98c6faba
NB
627 while ((w = conf_word(fl, 1))) {
628 if (have_block && strcmp(w, "devices:")==0)
629 have_devices = 1;
630 have_block = (strcmp(w, "Block")==0);
631 if (isdigit(w[0]))
632 last_num = atoi(w);
633 if (have_devices && strcmp(w, "mdp")==0)
634 mdp_major = last_num;
635 free(w);
636 }
637 fclose(fl);
dd0781e5 638 return mdp_major;
98c6faba
NB
639}
640
641
e0d19036 642
e0d19036
NB
643char *get_md_name(int dev)
644{
645 /* find /dev/md%d or /dev/md/%d or make a device /dev/.tmp.md%d */
98c6faba 646 /* if dev < 0, want /dev/md/d%d or find mdp in /proc/devices ... */
e0d19036
NB
647 static char devname[50];
648 struct stat stb;
98c6faba 649 dev_t rdev;
dd0781e5 650 char *dn;
98c6faba
NB
651
652 if (dev < 0) {
dd0781e5
NB
653 int mdp = get_mdp_major();
654 if (mdp < 0) return NULL;
0df46c2a 655 rdev = makedev(mdp, (-1-dev)<<6);
8f23b0b3 656 snprintf(devname, sizeof(devname), "/dev/md/d%d", -1-dev);
98c6faba
NB
657 if (stat(devname, &stb) == 0
658 && (S_IFMT&stb.st_mode) == S_IFBLK
659 && (stb.st_rdev == rdev))
660 return devname;
661 } else {
0df46c2a 662 rdev = makedev(MD_MAJOR, dev);
8f23b0b3 663 snprintf(devname, sizeof(devname), "/dev/md%d", dev);
98c6faba
NB
664 if (stat(devname, &stb) == 0
665 && (S_IFMT&stb.st_mode) == S_IFBLK
666 && (stb.st_rdev == rdev))
667 return devname;
668
8f23b0b3 669 snprintf(devname, sizeof(devname), "/dev/md/%d", dev);
98c6faba
NB
670 if (stat(devname, &stb) == 0
671 && (S_IFMT&stb.st_mode) == S_IFBLK
672 && (stb.st_rdev == rdev))
673 return devname;
674 }
16c6fa80 675 dn = map_dev(major(rdev), minor(rdev), 0);
dd0781e5
NB
676 if (dn)
677 return dn;
8f23b0b3 678 snprintf(devname, sizeof(devname), "/dev/.tmp.md%d", dev);
e0d19036 679 if (mknod(devname, S_IFBLK | 0600, rdev) == -1)
dd0781e5
NB
680 if (errno != EEXIST)
681 return NULL;
e0d19036
NB
682
683 if (stat(devname, &stb) == 0
684 && (S_IFMT&stb.st_mode) == S_IFBLK
685 && (stb.st_rdev == rdev))
686 return devname;
687 unlink(devname);
688 return NULL;
689}
690
691void put_md_name(char *name)
692{
693 if (strncmp(name, "/dev/.tmp.md", 12)==0)
694 unlink(name);
695}
ea24acd0
NB
696
697static int dev2major(int d)
698{
699 if (d >= 0)
700 return MD_MAJOR;
701 else
702 return get_mdp_major();
703}
704
705static int dev2minor(int d)
706{
707 if (d >= 0)
708 return d;
709 return (-1-d) << MdpMinorShift;
710}
711
712int find_free_devnum(int use_partitions)
713{
714 int devnum;
715 for (devnum = 127; devnum != 128;
716 devnum = devnum ? devnum-1 : (1<<22)-1) {
717 char *dn;
718 int _devnum;
719
720 _devnum = use_partitions ? (-1-devnum) : devnum;
721 if (mddev_busy(_devnum))
722 continue;
723 /* make sure it is new to /dev too, at least as a
724 * non-standard */
725 dn = map_dev(dev2major(_devnum), dev2minor(_devnum), 0);
726 if (dn && ! is_standard(dn, NULL))
727 continue;
728 break;
729 }
730 if (devnum == 128)
731 return NoMdDev;
732 return use_partitions ? (-1-devnum) : devnum;
733}
435d4ebb 734#endif /* !defined(MDASSEMBLE) || defined(MDASSEMBLE) && defined(MDASSEMBLE_AUTO) */
f9ce90ba 735
8b0dabea
NB
736int dev_open(char *dev, int flags)
737{
738 /* like 'open', but if 'dev' matches %d:%d, create a temp
739 * block device and open that
740 */
741 char *e;
742 int fd = -1;
743 char devname[32];
e81cdd9f 744 int major;
8b0dabea 745 int minor;
e81cdd9f
NB
746
747 if (!dev) return -1;
748
749 major = strtoul(dev, &e, 0);
8b0dabea
NB
750 if (e > dev && *e == ':' && e[1] &&
751 (minor = strtoul(e+1, &e, 0)) >= 0 &&
752 *e == 0) {
753 snprintf(devname, sizeof(devname), "/dev/.tmp.md.%d:%d", major, minor);
754 if (mknod(devname, S_IFBLK|0600, makedev(major, minor))==0) {
755 fd = open(devname, flags);
756 unlink(devname);
757 }
758 } else
759 fd = open(dev, flags);
760 return fd;
761}
f9ce90ba 762
a322f70c 763struct superswitch *superlist[] = { &super0, &super1, &super_ddf, NULL };
f9ce90ba 764
ea24acd0 765#if !defined(MDASSEMBLE) || defined(MDASSEMBLE) && defined(MDASSEMBLE_AUTO)
1686dc25 766struct supertype *super_by_fd(int fd)
f9ce90ba 767{
1686dc25
NB
768 mdu_array_info_t array;
769 int vers;
770 int minor;
771 struct supertype *st = NULL;
7e0f6979 772 struct mdinfo *sra;
142cb9e1 773 char *verstr;
1686dc25
NB
774 char version[20];
775 int i;
776
777 sra = sysfs_read(fd, 0, GET_VERSION);
778
779 if (sra) {
7e0f6979
NB
780 vers = sra->array.major_version;
781 minor = sra->array.minor_version;
142cb9e1 782 verstr = sra->text_version;
1686dc25
NB
783 } else {
784 if (ioctl(fd, GET_ARRAY_INFO, &array))
785 array.major_version = array.minor_version = 0;
786 vers = array.major_version;
787 minor = array.minor_version;
142cb9e1 788 verstr = "";
6fbba4c9 789 }
82d9eba6 790
1686dc25
NB
791 if (vers != -1) {
792 sprintf(version, "%d.%d", vers, minor);
793 verstr = version;
6fbba4c9 794 }
1686dc25
NB
795 for (i = 0; st == NULL && superlist[i] ; i++)
796 st = superlist[i]->match_metadata_desc(verstr);
797
798 if (sra)
799 sysfs_free(sra);
3b0896f8
NB
800 if (st)
801 st->sb = NULL;
82d9eba6 802 return st;
f9ce90ba 803}
ea24acd0
NB
804#endif /* !defined(MDASSEMBLE) || defined(MDASSEMBLE) && defined(MDASSEMBLE_AUTO) */
805
f9ce90ba 806
3da92f27
NB
807struct supertype *dup_super(struct supertype *st)
808{
1686dc25
NB
809 struct supertype *stnew = NULL;
810 char *verstr = NULL;
811 char version[20];
812 int i;
813
3da92f27
NB
814 if (!st)
815 return st;
1686dc25 816
d03373f1
NB
817 if (st->ss->text_version)
818 strcpy(version, st->ss->text_version);
819 else if (st->minor_version == -1)
1686dc25
NB
820 sprintf(version, "%d", st->ss->major);
821 else
822 sprintf(version, "%d.%d", st->ss->major, st->minor_version);
823 verstr = version;
824
825 for (i = 0; stnew == NULL && superlist[i] ; i++)
826 stnew = superlist[i]->match_metadata_desc(verstr);
827
ff1f6545
NB
828 if (stnew)
829 stnew->sb = NULL;
1686dc25 830 return stnew;
3da92f27
NB
831}
832
82d9eba6 833struct supertype *guess_super(int fd)
f9ce90ba
NB
834{
835 /* try each load_super to find the best match,
836 * and return the best superswitch
837 */
82d9eba6
NB
838 struct superswitch *ss;
839 struct supertype *st;
570c0542
NB
840 unsigned long besttime = 0;
841 int bestsuper = -1;
f9ce90ba
NB
842 int i;
843
82d9eba6
NB
844 st = malloc(sizeof(*st));
845 memset(st, 0, sizeof(*st));
f9ce90ba
NB
846 for (i=0 ; superlist[i]; i++) {
847 int rv;
848 ss = superlist[i];
f277ce36 849 st->ss = NULL;
3da92f27 850 rv = ss->load_super(st, fd, NULL);
570c0542
NB
851 if (rv == 0) {
852 struct mdinfo info;
3da92f27 853 st->ss->getinfo_super(st, &info);
570c0542
NB
854 if (bestsuper == -1 ||
855 besttime < info.array.ctime) {
856 bestsuper = i;
857 besttime = info.array.ctime;
570c0542 858 }
3da92f27 859 ss->free_super(st);
570c0542
NB
860 }
861 }
862 if (bestsuper != -1) {
863 int rv;
f277ce36 864 st->ss = NULL;
3da92f27 865 rv = superlist[bestsuper]->load_super(st, fd, NULL);
f9ce90ba 866 if (rv == 0) {
5e747af2 867 superlist[bestsuper]->free_super(st);
82d9eba6 868 return st;
f9ce90ba
NB
869 }
870 }
570c0542 871 free(st);
f9ce90ba
NB
872 return NULL;
873}
fe6729fa 874
beae1dfe
NB
875/* Return size of device in bytes */
876int get_dev_size(int fd, char *dname, unsigned long long *sizep)
877{
878 unsigned long long ldsize;
c2c9bb6f
NB
879 struct stat st;
880
881 if (fstat(fd, &st) != -1 && S_ISREG(st.st_mode))
882 ldsize = (unsigned long long)st.st_size;
883 else
beae1dfe
NB
884#ifdef BLKGETSIZE64
885 if (ioctl(fd, BLKGETSIZE64, &ldsize) != 0)
886#endif
887 {
888 unsigned long dsize;
889 if (ioctl(fd, BLKGETSIZE, &dsize) == 0) {
890 ldsize = dsize;
891 ldsize <<= 9;
892 } else {
893 if (dname)
894 fprintf(stderr, Name ": Cannot get size of %s: %s\b",
895 dname, strerror(errno));
896 return 0;
897 }
898 }
899 *sizep = ldsize;
900 return 1;
901}
8fac0577 902
8382f19b
NB
903void get_one_disk(int mdfd, mdu_array_info_t *ainf, mdu_disk_info_t *disk)
904{
905 int d;
906 ioctl(mdfd, GET_ARRAY_INFO, ainf);
907 for (d = 0 ; d < ainf->raid_disks + ainf->nr_disks ; d++)
908 if (ioctl(mdfd, GET_DISK_INFO, disk) == 0)
909 return;
910}
63152c1b 911
a322f70c
DW
912int open_container(int fd)
913{
914 /* 'fd' is a block device. Find out if it is in use
915 * by a container, and return an open fd on that container.
916 */
917 char path[256];
918 char *e;
919 DIR *dir;
920 struct dirent *de;
921 int dfd, n;
922 char buf[200];
923 int major, minor;
924 struct stat st;
925
926 if (fstat(fd, &st) != 0)
927 return -1;
928 sprintf(path, "/sys/dev/block/%d:%d/holders",
929 (int)major(st.st_rdev), (int)minor(st.st_rdev));
930 e = path + strlen(path);
931
932 dir = opendir(path);
933 if (!dir)
934 return -1;
935 while ((de = readdir(dir))) {
936 if (de->d_ino == 0)
937 continue;
938 if (de->d_name[0] == '.')
939 continue;
940 sprintf(e, "/%s/dev", de->d_name);
941 dfd = open(path, O_RDONLY);
942 if (dfd < 0)
943 continue;
944 n = read(dfd, buf, sizeof(buf));
945 close(dfd);
946 if (n <= 0 || n >= sizeof(buf))
947 continue;
948 buf[n] = 0;
949 if (sscanf(buf, "%d:%d", &major, &minor) != 2)
950 continue;
951 sprintf(buf, "%d:%d", major, minor);
952 dfd = dev_open(buf, O_RDONLY);
953 if (dfd >= 0) {
954 closedir(dir);
955 return dfd;
956 }
957 }
958 return -1;
959}
960
fe6729fa
NB
961#ifdef __TINYC__
962/* tinyc doesn't optimize this check in ioctl.h out ... */
963unsigned int __invalid_size_argument_for_IOC = 0;
964#endif
965