Fix a recently introduced bug, and make --assemble more resilient to it.
[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>
64c4757e
NB
34
35/*
36 * Parse a 128 bit uuid in 4 integers
37 * format is 32 hexx nibbles with options :.<space> separator
38 * If not exactly 32 hex digits are found, return 0
39 * else return 1
40 */
41int parse_uuid(char *str, int uuid[4])
42{
43 int hit = 0; /* number of Hex digIT */
44 int i;
45 char c;
46 for (i=0; i<4; i++) uuid[i]=0;
47
48 while ((c= *str++)) {
49 int n;
50 if (c>='0' && c<='9')
51 n = c-'0';
52 else if (c>='a' && c <= 'f')
53 n = 10 + c - 'a';
54 else if (c>='A' && c <= 'F')
55 n = 10 + c - 'A';
56 else if (strchr(":. -", c))
57 continue;
58 else return 0;
59
82b27616
NB
60 if (hit<32) {
61 uuid[hit/8] <<= 4;
62 uuid[hit/8] += n;
63 }
64c4757e
NB
64 hit++;
65 }
66 if (hit == 32)
67 return 1;
68 return 0;
69
70}
71
72
73/*
74 * Get the md version number.
75 * We use the RAID_VERSION ioctl if it is supported
76 * If not, but we have a block device with major '9', we assume
77 * 0.36.0
78 *
79 * Return version number as 24 but number - assume version parts
80 * always < 255
81 */
82
83int md_get_version(int fd)
84{
85 struct stat stb;
86 mdu_version_t vers;
87
88 if (fstat(fd, &stb)<0)
89 return -1;
90 if ((S_IFMT&stb.st_mode) != S_IFBLK)
91 return -1;
92
93 if (ioctl(fd, RAID_VERSION, &vers) == 0)
682c7051 94 return (vers.major*10000) + (vers.minor*100) + vers.patchlevel;
5787fa49
NB
95 if (errno == EACCES)
96 return -1;
0df46c2a 97 if (major(stb.st_rdev) == MD_MAJOR)
682c7051 98 return (3600);
64c4757e
NB
99 return -1;
100}
101
102
103int get_linux_version()
104{
105 struct utsname name;
98c6faba 106 char *cp;
64c4757e
NB
107 int a,b,c;
108 if (uname(&name) <0)
109 return -1;
110
98c6faba
NB
111 cp = name.release;
112 a = strtoul(cp, &cp, 10);
113 if (*cp != '.') return -1;
114 b = strtoul(cp+1, &cp, 10);
115 if (*cp != '.') return -1;
116 c = strtoul(cp+1, NULL, 10);
117
682c7051 118 return (a*1000000)+(b*1000)+c;
64c4757e
NB
119}
120
265e0f17
NB
121int enough(int level, int raid_disks, int layout,
122 char *avail, int avail_disks)
64c4757e 123{
265e0f17 124 int copies, first;
64c4757e 125 switch (level) {
265e0f17
NB
126 case 10:
127 /* This is the tricky one - we need to check
128 * which actual disks are present.
129 */
130 copies = (layout&255)* (layout>>8);
131 first=0;
132 do {
133 /* there must be one of the 'copies' form 'first' */
134 int n = copies;
135 int cnt=0;
136 while (n--) {
137 if (avail[first])
138 cnt++;
139 first = (first+1) % raid_disks;
140 }
141 if (cnt == 0)
142 return 0;
143
144 } while (first != 0);
145 return 1;
e5329c37 146
e0d19036
NB
147 case -4:
148 return avail_disks>= 1;
64c4757e
NB
149 case -1:
150 case 0:
151 return avail_disks == raid_disks;
152 case 1:
153 return avail_disks >= 1;
154 case 4:
155 case 5:
156 return avail_disks >= raid_disks-1;
98c6faba
NB
157 case 6:
158 return avail_disks >= raid_disks-2;
64c4757e
NB
159 default:
160 return 0;
161 }
162}
163
f277ce36 164int same_uuid(int a[4], int b[4], int swapuuid)
64c4757e 165{
f277ce36
NB
166 if (swapuuid) {
167 /* parse uuids are hostendian.
168 * uuid's from some superblocks are big-ending
169 * if there is a difference, we need to swap..
170 */
171 unsigned char *ac = (unsigned char *)a;
172 unsigned char *bc = (unsigned char *)b;
173 int i;
174 for (i=0; i<16; i+= 4) {
175 if (ac[i+0] != bc[i+3] ||
176 ac[i+1] != bc[i+2] ||
177 ac[i+2] != bc[i+1] ||
178 ac[i+3] != bc[i+0])
179 return 0;
180 }
181 return 1;
182 } else {
183 if (a[0]==b[0] &&
184 a[1]==b[1] &&
185 a[2]==b[2] &&
186 a[3]==b[3])
187 return 1;
188 return 0;
189 }
64c4757e
NB
190}
191
682c7051
NB
192int check_ext2(int fd, char *name)
193{
194 /*
195 * Check for an ext2fs file system.
196 * Superblock is always 1K at 1K offset
197 *
198 * s_magic is le16 at 56 == 0xEF53
199 * report mtime - le32 at 44
200 * blocks - le32 at 4
201 * logblksize - le32 at 24
202 */
203 unsigned char sb[1024];
204 time_t mtime;
205 int size, bsize;
206 if (lseek(fd, 1024,0)!= 1024)
207 return 0;
208 if (read(fd, sb, 1024)!= 1024)
209 return 0;
210 if (sb[56] != 0x53 || sb[57] != 0xef)
211 return 0;
212
213 mtime = sb[44]|(sb[45]|(sb[46]|sb[47]<<8)<<8)<<8;
214 bsize = sb[24]|(sb[25]|(sb[26]|sb[27]<<8)<<8)<<8;
215 size = sb[4]|(sb[5]|(sb[6]|sb[7]<<8)<<8)<<8;
216 fprintf(stderr, Name ": %s appears to contain an ext2fs file system\n",
217 name);
218 fprintf(stderr," size=%dK mtime=%s",
219 size*(1<<bsize), ctime(&mtime));
220 return 1;
221}
222
223int check_reiser(int fd, char *name)
224{
225 /*
226 * superblock is at 64K
227 * size is 1024;
228 * Magic string "ReIsErFs" or "ReIsEr2Fs" at 52
229 *
230 */
231 unsigned char sb[1024];
881990a2 232 unsigned long size;
682c7051
NB
233 if (lseek(fd, 64*1024, 0) != 64*1024)
234 return 0;
235 if (read(fd, sb, 1024) != 1024)
236 return 0;
a46f4061
NB
237 if (strncmp((char*)sb+52, "ReIsErFs",8)!=0 &&
238 strncmp((char*)sb+52, "ReIsEr2Fs",9)!=0)
682c7051
NB
239 return 0;
240 fprintf(stderr, Name ": %s appears to contain a reiserfs file system\n",name);
241 size = sb[0]|(sb[1]|(sb[2]|sb[3]<<8)<<8)<<8;
881990a2 242 fprintf(stderr, " size = %luK\n", size*4);
682c7051
NB
243
244 return 1;
245}
246
247int check_raid(int fd, char *name)
248{
4b1ac34b
NB
249 void *super;
250 struct mdinfo info;
682c7051 251 time_t crtime;
d078d77c 252 char *level;
82d9eba6 253 struct supertype *st = guess_super(fd);
f9ce90ba 254
82d9eba6
NB
255 if (!st) return 0;
256 st->ss->load_super(st, fd, &super, name);
257 /* Looks like a raid array .. */
258 fprintf(stderr, Name ": %s appears to be part of a raid array:\n",
259 name);
31317663 260 st->ss->getinfo_super(&info, super);
82d9eba6
NB
261 free(super);
262 crtime = info.array.ctime;
d078d77c
NB
263 level = map_num(pers, info.array.level);
264 if (!level) level = "-unknown-";
265 fprintf(stderr, " level=%s devices=%d ctime=%s",
266 level, info.array.raid_disks, ctime(&crtime));
82d9eba6 267 return 1;
682c7051
NB
268}
269
682c7051
NB
270int ask(char *mesg)
271{
272 char *add = "";
273 int i;
274 for (i=0; i<5; i++) {
275 char buf[100];
276 fprintf(stderr, "%s%s", mesg, add);
277 fflush(stderr);
278 if (fgets(buf, 100, stdin)==NULL)
279 return 0;
280 if (buf[0]=='y' || buf[0]=='Y')
281 return 1;
282 if (buf[0]=='n' || buf[0]=='N')
283 return 0;
284 add = "(y/n) ";
285 }
286 fprintf(stderr, Name ": assuming 'no'\n");
287 return 0;
288}
289
290char *map_num(mapping_t *map, int num)
291{
292 while (map->name) {
293 if (map->num == num)
294 return map->name;
295 map++;
296 }
297 return NULL;
298}
299
300int map_name(mapping_t *map, char *name)
301{
302 while (map->name) {
303 if (strcmp(map->name, name)==0)
304 return map->num;
305 map++;
306 }
98c6faba 307 return UnSet;
682c7051 308}
82b27616 309
e5329c37 310
8d80900b 311int is_standard(char *dev, int *nump)
e5329c37
NB
312{
313 /* tests if dev is a "standard" md dev name.
314 * i.e if the last component is "/dNN" or "/mdNN",
315 * where NN is a string of digits
316 */
8d80900b
NB
317 char *d = strrchr(dev, '/');
318 int type=0;
319 int num;
320 if (!d)
e5329c37 321 return 0;
8d80900b
NB
322 if (strncmp(d, "/d",2)==0)
323 d += 2, type=1; /* /dev/md/dN{pM} */
324 else if (strncmp(d, "/md_d", 5)==0)
325 d += 5, type=1; /* /dev/md_dNpM */
326 else if (strncmp(d, "/md", 3)==0)
327 d += 3, type=-1; /* /dev/mdN */
328 else if (d-dev > 3 && strncmp(d-2, "md/", 3)==0)
5a6d1148 329 d += 1, type=-1; /* /dev/md/N */
e5329c37
NB
330 else
331 return 0;
8d80900b 332 if (!*d)
e5329c37 333 return 0;
8d80900b
NB
334 num = atoi(d);
335 while (isdigit(*d))
336 d++;
337 if (*d)
e5329c37 338 return 0;
8d80900b
NB
339 if (nump) *nump = num;
340
341 return type;
e5329c37
NB
342}
343
344
82b27616
NB
345/*
346 * convert a major/minor pair for a block device into a name in /dev, if possible.
347 * On the first call, walk /dev collecting name.
348 * Put them in a simple linked listfor now.
349 */
350struct devmap {
351 int major, minor;
352 char *name;
353 struct devmap *next;
354} *devlist = NULL;
355int devlist_ready = 0;
356
5787fa49 357#ifdef UCLIBC
173fc515
NB
358int add_dev(const char *name, const struct stat *stb, int flag, struct FTW *s)
359{
0c239ef7 360 return 0;
173fc515 361}
16c6fa80 362char *map_dev(int major, int minor, int create)
5787fa49
NB
363{
364#if 0
365 fprintf(stderr, "Warning - fail to map %d,%d to a device name\n",
366 major, minor);
367#endif
368 return NULL;
369}
370#else
82b27616 371
173fc515
NB
372#ifdef __dietlibc__
373int add_dev_1(const char *name, const struct stat *stb, int flag)
374{
375 return add_dev(name, stb, flag, NULL);
376}
377int nftw(const char *path, int (*han)(const char *name, const struct stat *stb, int flag, struct FTW *s), int nopenfd, int flags)
378{
b56c3630 379 return ftw(path, add_dev_1, nopenfd);
173fc515
NB
380}
381#endif
82b27616
NB
382
383int add_dev(const char *name, const struct stat *stb, int flag, struct FTW *s)
384{
bed256c2
NB
385 struct stat st;
386 if (S_ISLNK(stb->st_mode)) {
387 stat(name, &st);
388 stb = &st;
82b27616 389 }
bed256c2
NB
390
391 if ((stb->st_mode&S_IFMT)== S_IFBLK) {
392 char *n = strdup(name);
393 struct devmap *dm = malloc(sizeof(*dm));
394 if (strncmp(n, "/dev/./", 7)==0)
395 strcpy(n+4, name+6);
396 if (dm) {
397 dm->major = major(stb->st_rdev);
398 dm->minor = minor(stb->st_rdev);
399 dm->name = n;
400 dm->next = devlist;
401 devlist = dm;
402 }
403 }
404 return 0;
82b27616
NB
405}
406
dd0781e5
NB
407/*
408 * Find a block device with the right major/minor number.
b79713f8
NB
409 * If we find multiple names, choose the shortest.
410 * If we find a non-standard name, it is probably there
411 * deliberately so prefer it over a standard name.
412 * This applies only to names for MD devices.
dd0781e5 413 */
16c6fa80 414char *map_dev(int major, int minor, int create)
82b27616 415{
dd0781e5 416 struct devmap *p;
b79713f8 417 char *std = NULL, *nonstd=NULL;
e7bb5d23 418 int did_check = 0;
eed35d66 419
e81cdd9f 420 if (major == 0 && minor == 0)
eed35d66 421 return NULL;
e81cdd9f 422
e7bb5d23 423 retry:
dd0781e5 424 if (!devlist_ready) {
0a416ec3
NB
425 char *dev = "/dev";
426 struct stat stb;
eed35d66
NB
427 while(devlist) {
428 struct devmap *d = devlist;
429 devlist = d->next;
430 free(d->name);
431 free(d);
432 }
0a416ec3
NB
433 if (lstat(dev, &stb)==0 &&
434 S_ISLNK(stb.st_mode))
435 dev = "/dev/.";
436 nftw(dev, add_dev, 10, FTW_PHYS);
dd0781e5 437 devlist_ready=1;
e7bb5d23 438 did_check = 1;
dd0781e5 439 }
82b27616 440
dd0781e5
NB
441 for (p=devlist; p; p=p->next)
442 if (p->major == major &&
443 p->minor == minor) {
b79713f8
NB
444 if (is_standard(p->name, NULL)) {
445 if (std == NULL ||
446 strlen(p->name) < strlen(std))
447 std = p->name;
448 } else {
449 if (nonstd == NULL ||
450 strlen(p->name) < strlen(nonstd))
451 nonstd = p->name;
452 }
dd0781e5 453 }
e7bb5d23
NB
454 if (!std && !nonstd && !did_check) {
455 devlist_ready = 0;
456 goto retry;
457 }
16c6fa80
NB
458 if (create && !std && !nonstd) {
459 static char buf[30];
382245c3 460 snprintf(buf, sizeof(buf), "%d:%d", major, minor);
16c6fa80
NB
461 nonstd = buf;
462 }
463
b79713f8 464 return nonstd ? nonstd : std;
82b27616
NB
465}
466
5787fa49 467#endif
82b27616 468
4b1ac34b 469unsigned long calc_csum(void *super, int bytes)
82b27616 470{
56eb10c0 471 unsigned long long newcsum = 0;
82b27616 472 int i;
4b1ac34b
NB
473 unsigned int csum;
474 unsigned int *superc = (unsigned int*) super;
82b27616 475
4b1ac34b 476 for(i=0; i<bytes/4; i++)
82b27616
NB
477 newcsum+= superc[i];
478 csum = (newcsum& 0xffffffff) + (newcsum>>32);
570c0542
NB
479#ifdef __alpha__
480/* The in-kernel checksum calculation is always 16bit on
481 * the alpha, though it is 32 bit on i386...
482 * I wonder what it is elsewhere... (it uses and API in
483 * a way that it shouldn't).
484 */
485 csum = (csum & 0xffff) + (csum >> 16);
486 csum = (csum & 0xffff) + (csum >> 16);
487#endif
82b27616
NB
488 return csum;
489}
cd29a5c8 490
56eb10c0 491char *human_size(long long bytes)
cd29a5c8
NB
492{
493 static char buf[30];
d5d3721e
NB
494
495 /* We convert bytes to either centi-M{ega,ibi}bytes or
496 * centi-G{igi,ibi}bytes, with appropriate rounding,
497 * and then print 1/100th of those as a decimal.
498 * We allow upto 2048Megabytes before converting to
499 * gigabytes, as that shows more precision and isn't
500 * too large a number.
501 * Terrabytes are not yet handled.
502 */
cd29a5c8 503
56eb10c0 504 if (bytes < 5000*1024)
cd29a5c8 505 buf[0]=0;
d5d3721e
NB
506 else if (bytes < 2*1024LL*1024LL*1024LL) {
507 long cMiB = (bytes / ( (1LL<<20) / 200LL ) +1) /2;
508 long cMB = (bytes / ( 1000000LL / 200LL ) +1) /2;
8f23b0b3 509 snprintf(buf, sizeof(buf), " (%ld.%02ld MiB %ld.%02ld MB)",
d5d3721e
NB
510 cMiB/100 , cMiB % 100,
511 cMB/100, cMB % 100);
512 } else {
513 long cGiB = (bytes / ( (1LL<<30) / 200LL ) +1) /2;
514 long cGB = (bytes / (1000000000LL/200LL ) +1) /2;
8f23b0b3 515 snprintf(buf, sizeof(buf), " (%ld.%02ld GiB %ld.%02ld GB)",
d5d3721e
NB
516 cGiB/100 , cGiB % 100,
517 cGB/100, cGB % 100);
518 }
cd29a5c8
NB
519 return buf;
520}
e0d19036
NB
521
522char *human_size_brief(long long bytes)
523{
524 static char buf[30];
525
526
527 if (bytes < 5000*1024)
8f23b0b3 528 snprintf(buf, sizeof(buf), "%ld.%02ldKiB",
bd526cee 529 (long)(bytes>>10), (long)(((bytes&1023)*100+512)/1024)
e0d19036
NB
530 );
531 else if (bytes < 2*1024LL*1024LL*1024LL)
8f23b0b3 532 snprintf(buf, sizeof(buf), "%ld.%02ldMiB",
e0d19036 533 (long)(bytes>>20),
bd526cee 534 (long)((bytes&0xfffff)+0x100000/200)/(0x100000/100)
e0d19036
NB
535 );
536 else
8f23b0b3 537 snprintf(buf, sizeof(buf), "%ld.%02ldGiB",
e0d19036 538 (long)(bytes>>30),
bd526cee 539 (long)(((bytes>>10)&0xfffff)+0x100000/200)/(0x100000/100)
e0d19036
NB
540 );
541 return buf;
542}
543
dd0781e5 544int get_mdp_major(void)
98c6faba 545{
dd0781e5
NB
546static int mdp_major = -1;
547 FILE *fl;
98c6faba
NB
548 char *w;
549 int have_block = 0;
550 int have_devices = 0;
551 int last_num = -1;
dd0781e5
NB
552
553 if (mdp_major != -1)
554 return mdp_major;
555 fl = fopen("/proc/devices", "r");
98c6faba 556 if (!fl)
dd0781e5 557 return -1;
98c6faba
NB
558 while ((w = conf_word(fl, 1))) {
559 if (have_block && strcmp(w, "devices:")==0)
560 have_devices = 1;
561 have_block = (strcmp(w, "Block")==0);
562 if (isdigit(w[0]))
563 last_num = atoi(w);
564 if (have_devices && strcmp(w, "mdp")==0)
565 mdp_major = last_num;
566 free(w);
567 }
568 fclose(fl);
dd0781e5 569 return mdp_major;
98c6faba
NB
570}
571
572
e0d19036 573
e0d19036
NB
574char *get_md_name(int dev)
575{
576 /* find /dev/md%d or /dev/md/%d or make a device /dev/.tmp.md%d */
98c6faba 577 /* if dev < 0, want /dev/md/d%d or find mdp in /proc/devices ... */
e0d19036
NB
578 static char devname[50];
579 struct stat stb;
98c6faba 580 dev_t rdev;
dd0781e5 581 char *dn;
98c6faba
NB
582
583 if (dev < 0) {
dd0781e5
NB
584 int mdp = get_mdp_major();
585 if (mdp < 0) return NULL;
0df46c2a 586 rdev = makedev(mdp, (-1-dev)<<6);
8f23b0b3 587 snprintf(devname, sizeof(devname), "/dev/md/d%d", -1-dev);
98c6faba
NB
588 if (stat(devname, &stb) == 0
589 && (S_IFMT&stb.st_mode) == S_IFBLK
590 && (stb.st_rdev == rdev))
591 return devname;
592 } else {
0df46c2a 593 rdev = makedev(MD_MAJOR, dev);
8f23b0b3 594 snprintf(devname, sizeof(devname), "/dev/md%d", dev);
98c6faba
NB
595 if (stat(devname, &stb) == 0
596 && (S_IFMT&stb.st_mode) == S_IFBLK
597 && (stb.st_rdev == rdev))
598 return devname;
599
8f23b0b3 600 snprintf(devname, sizeof(devname), "/dev/md/%d", dev);
98c6faba
NB
601 if (stat(devname, &stb) == 0
602 && (S_IFMT&stb.st_mode) == S_IFBLK
603 && (stb.st_rdev == rdev))
604 return devname;
605 }
16c6fa80 606 dn = map_dev(major(rdev), minor(rdev), 0);
dd0781e5
NB
607 if (dn)
608 return dn;
8f23b0b3 609 snprintf(devname, sizeof(devname), "/dev/.tmp.md%d", dev);
e0d19036 610 if (mknod(devname, S_IFBLK | 0600, rdev) == -1)
dd0781e5
NB
611 if (errno != EEXIST)
612 return NULL;
e0d19036
NB
613
614 if (stat(devname, &stb) == 0
615 && (S_IFMT&stb.st_mode) == S_IFBLK
616 && (stb.st_rdev == rdev))
617 return devname;
618 unlink(devname);
619 return NULL;
620}
621
622void put_md_name(char *name)
623{
624 if (strncmp(name, "/dev/.tmp.md", 12)==0)
625 unlink(name);
626}
f9ce90ba 627
8b0dabea
NB
628int dev_open(char *dev, int flags)
629{
630 /* like 'open', but if 'dev' matches %d:%d, create a temp
631 * block device and open that
632 */
633 char *e;
634 int fd = -1;
635 char devname[32];
e81cdd9f 636 int major;
8b0dabea 637 int minor;
e81cdd9f
NB
638
639 if (!dev) return -1;
640
641 major = strtoul(dev, &e, 0);
8b0dabea
NB
642 if (e > dev && *e == ':' && e[1] &&
643 (minor = strtoul(e+1, &e, 0)) >= 0 &&
644 *e == 0) {
645 snprintf(devname, sizeof(devname), "/dev/.tmp.md.%d:%d", major, minor);
646 if (mknod(devname, S_IFBLK|0600, makedev(major, minor))==0) {
647 fd = open(devname, flags);
648 unlink(devname);
649 }
650 } else
651 fd = open(dev, flags);
652 return fd;
653}
f9ce90ba 654
82d9eba6 655struct superswitch *superlist[] = { &super0, &super1, NULL };
f9ce90ba 656
82d9eba6 657struct supertype *super_by_version(int vers, int minor)
f9ce90ba 658{
82d9eba6
NB
659 struct supertype *st = malloc(sizeof(*st));
660 if (!st) return st;
6fbba4c9 661 if (vers == 0) {
82d9eba6 662 st->ss = &super0;
6fbba4c9
NB
663 st->max_devs = MD_SB_DISKS;
664 }
82d9eba6 665
6fbba4c9 666 if (vers == 1) {
82d9eba6 667 st->ss = &super1;
6fbba4c9
NB
668 st->max_devs = 384;
669 }
82d9eba6
NB
670 st->minor_version = minor;
671 return st;
f9ce90ba
NB
672}
673
82d9eba6 674struct supertype *guess_super(int fd)
f9ce90ba
NB
675{
676 /* try each load_super to find the best match,
677 * and return the best superswitch
678 */
82d9eba6
NB
679 struct superswitch *ss;
680 struct supertype *st;
570c0542
NB
681 unsigned long besttime = 0;
682 int bestsuper = -1;
82d9eba6 683
f9ce90ba
NB
684 void *sbp = NULL;
685 int i;
686
82d9eba6
NB
687 st = malloc(sizeof(*st));
688 memset(st, 0, sizeof(*st));
f9ce90ba
NB
689 for (i=0 ; superlist[i]; i++) {
690 int rv;
691 ss = superlist[i];
f277ce36 692 st->ss = NULL;
82d9eba6 693 rv = ss->load_super(st, fd, &sbp, NULL);
570c0542
NB
694 if (rv == 0) {
695 struct mdinfo info;
31317663 696 ss->getinfo_super(&info, sbp);
570c0542
NB
697 if (bestsuper == -1 ||
698 besttime < info.array.ctime) {
699 bestsuper = i;
700 besttime = info.array.ctime;
570c0542
NB
701 }
702 free(sbp);
703 }
704 }
705 if (bestsuper != -1) {
706 int rv;
f277ce36 707 st->ss = NULL;
570c0542 708 rv = superlist[bestsuper]->load_super(st, fd, &sbp, NULL);
f9ce90ba
NB
709 if (rv == 0) {
710 free(sbp);
82d9eba6 711 return st;
f9ce90ba
NB
712 }
713 }
570c0542 714 free(st);
f9ce90ba
NB
715 return NULL;
716}
fe6729fa 717
8fac0577 718
fe6729fa
NB
719#ifdef __TINYC__
720/* tinyc doesn't optimize this check in ioctl.h out ... */
721unsigned int __invalid_size_argument_for_IOC = 0;
722#endif
723