]>
Commit | Line | Data |
---|---|---|
64c4757e | 1 | /* |
9a9dab36 | 2 | * mdadm - manage Linux "md" devices aka RAID arrays. |
64c4757e | 3 | * |
cd29a5c8 | 4 | * Copyright (C) 2001-2002 Neil Brown <neilb@cse.unsw.edu.au> |
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 | */ | |
41 | int 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 | ||
83 | int 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 | ||
103 | int 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 |
121 | int 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 | 164 | int 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 |
192 | int 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 | ||
223 | int 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 | ||
247 | int 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 |
270 | int 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 | ||
290 | char *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 | ||
300 | int 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 | 311 | int 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 | */ | |
350 | struct devmap { | |
351 | int major, minor; | |
352 | char *name; | |
353 | struct devmap *next; | |
354 | } *devlist = NULL; | |
355 | int devlist_ready = 0; | |
356 | ||
5787fa49 | 357 | #ifdef UCLIBC |
173fc515 NB |
358 | int add_dev(const char *name, const struct stat *stb, int flag, struct FTW *s) |
359 | { | |
360 | } | |
16c6fa80 | 361 | char *map_dev(int major, int minor, int create) |
5787fa49 NB |
362 | { |
363 | #if 0 | |
364 | fprintf(stderr, "Warning - fail to map %d,%d to a device name\n", | |
365 | major, minor); | |
366 | #endif | |
367 | return NULL; | |
368 | } | |
369 | #else | |
82b27616 | 370 | |
173fc515 NB |
371 | #ifdef __dietlibc__ |
372 | int add_dev_1(const char *name, const struct stat *stb, int flag) | |
373 | { | |
374 | return add_dev(name, stb, flag, NULL); | |
375 | } | |
376 | int nftw(const char *path, int (*han)(const char *name, const struct stat *stb, int flag, struct FTW *s), int nopenfd, int flags) | |
377 | { | |
378 | ftw(path, add_dev_1, nopenfd); | |
379 | } | |
380 | #endif | |
82b27616 NB |
381 | |
382 | int add_dev(const char *name, const struct stat *stb, int flag, struct FTW *s) | |
383 | { | |
bed256c2 NB |
384 | struct stat st; |
385 | if (S_ISLNK(stb->st_mode)) { | |
386 | stat(name, &st); | |
387 | stb = &st; | |
82b27616 | 388 | } |
bed256c2 NB |
389 | |
390 | if ((stb->st_mode&S_IFMT)== S_IFBLK) { | |
391 | char *n = strdup(name); | |
392 | struct devmap *dm = malloc(sizeof(*dm)); | |
393 | if (strncmp(n, "/dev/./", 7)==0) | |
394 | strcpy(n+4, name+6); | |
395 | if (dm) { | |
396 | dm->major = major(stb->st_rdev); | |
397 | dm->minor = minor(stb->st_rdev); | |
398 | dm->name = n; | |
399 | dm->next = devlist; | |
400 | devlist = dm; | |
401 | } | |
402 | } | |
403 | return 0; | |
82b27616 NB |
404 | } |
405 | ||
dd0781e5 NB |
406 | /* |
407 | * Find a block device with the right major/minor number. | |
b79713f8 NB |
408 | * If we find multiple names, choose the shortest. |
409 | * If we find a non-standard name, it is probably there | |
410 | * deliberately so prefer it over a standard name. | |
411 | * This applies only to names for MD devices. | |
dd0781e5 | 412 | */ |
16c6fa80 | 413 | char *map_dev(int major, int minor, int create) |
82b27616 | 414 | { |
dd0781e5 | 415 | struct devmap *p; |
b79713f8 | 416 | char *std = NULL, *nonstd=NULL; |
dd0781e5 | 417 | if (!devlist_ready) { |
0a416ec3 NB |
418 | char *dev = "/dev"; |
419 | struct stat stb; | |
420 | if (lstat(dev, &stb)==0 && | |
421 | S_ISLNK(stb.st_mode)) | |
422 | dev = "/dev/."; | |
423 | nftw(dev, add_dev, 10, FTW_PHYS); | |
dd0781e5 NB |
424 | devlist_ready=1; |
425 | } | |
82b27616 | 426 | |
dd0781e5 NB |
427 | for (p=devlist; p; p=p->next) |
428 | if (p->major == major && | |
429 | p->minor == minor) { | |
b79713f8 NB |
430 | if (is_standard(p->name, NULL)) { |
431 | if (std == NULL || | |
432 | strlen(p->name) < strlen(std)) | |
433 | std = p->name; | |
434 | } else { | |
435 | if (nonstd == NULL || | |
436 | strlen(p->name) < strlen(nonstd)) | |
437 | nonstd = p->name; | |
438 | } | |
dd0781e5 | 439 | } |
16c6fa80 NB |
440 | if (create && !std && !nonstd) { |
441 | static char buf[30]; | |
442 | snprintf(buf, 1024, "%d:%d", major, minor); | |
443 | nonstd = buf; | |
444 | } | |
445 | ||
b79713f8 | 446 | return nonstd ? nonstd : std; |
82b27616 NB |
447 | } |
448 | ||
5787fa49 | 449 | #endif |
82b27616 | 450 | |
4b1ac34b | 451 | unsigned long calc_csum(void *super, int bytes) |
82b27616 | 452 | { |
56eb10c0 | 453 | unsigned long long newcsum = 0; |
82b27616 | 454 | int i; |
4b1ac34b NB |
455 | unsigned int csum; |
456 | unsigned int *superc = (unsigned int*) super; | |
82b27616 | 457 | |
4b1ac34b | 458 | for(i=0; i<bytes/4; i++) |
82b27616 NB |
459 | newcsum+= superc[i]; |
460 | csum = (newcsum& 0xffffffff) + (newcsum>>32); | |
570c0542 NB |
461 | #ifdef __alpha__ |
462 | /* The in-kernel checksum calculation is always 16bit on | |
463 | * the alpha, though it is 32 bit on i386... | |
464 | * I wonder what it is elsewhere... (it uses and API in | |
465 | * a way that it shouldn't). | |
466 | */ | |
467 | csum = (csum & 0xffff) + (csum >> 16); | |
468 | csum = (csum & 0xffff) + (csum >> 16); | |
469 | #endif | |
82b27616 NB |
470 | return csum; |
471 | } | |
cd29a5c8 | 472 | |
56eb10c0 | 473 | char *human_size(long long bytes) |
cd29a5c8 NB |
474 | { |
475 | static char buf[30]; | |
d5d3721e NB |
476 | |
477 | /* We convert bytes to either centi-M{ega,ibi}bytes or | |
478 | * centi-G{igi,ibi}bytes, with appropriate rounding, | |
479 | * and then print 1/100th of those as a decimal. | |
480 | * We allow upto 2048Megabytes before converting to | |
481 | * gigabytes, as that shows more precision and isn't | |
482 | * too large a number. | |
483 | * Terrabytes are not yet handled. | |
484 | */ | |
cd29a5c8 | 485 | |
56eb10c0 | 486 | if (bytes < 5000*1024) |
cd29a5c8 | 487 | buf[0]=0; |
d5d3721e NB |
488 | else if (bytes < 2*1024LL*1024LL*1024LL) { |
489 | long cMiB = (bytes / ( (1LL<<20) / 200LL ) +1) /2; | |
490 | long cMB = (bytes / ( 1000000LL / 200LL ) +1) /2; | |
8f23b0b3 | 491 | snprintf(buf, sizeof(buf), " (%ld.%02ld MiB %ld.%02ld MB)", |
d5d3721e NB |
492 | cMiB/100 , cMiB % 100, |
493 | cMB/100, cMB % 100); | |
494 | } else { | |
495 | long cGiB = (bytes / ( (1LL<<30) / 200LL ) +1) /2; | |
496 | long cGB = (bytes / (1000000000LL/200LL ) +1) /2; | |
8f23b0b3 | 497 | snprintf(buf, sizeof(buf), " (%ld.%02ld GiB %ld.%02ld GB)", |
d5d3721e NB |
498 | cGiB/100 , cGiB % 100, |
499 | cGB/100, cGB % 100); | |
500 | } | |
cd29a5c8 NB |
501 | return buf; |
502 | } | |
e0d19036 NB |
503 | |
504 | char *human_size_brief(long long bytes) | |
505 | { | |
506 | static char buf[30]; | |
507 | ||
508 | ||
509 | if (bytes < 5000*1024) | |
8f23b0b3 | 510 | snprintf(buf, sizeof(buf), "%ld.%02ldKiB", |
bd526cee | 511 | (long)(bytes>>10), (long)(((bytes&1023)*100+512)/1024) |
e0d19036 NB |
512 | ); |
513 | else if (bytes < 2*1024LL*1024LL*1024LL) | |
8f23b0b3 | 514 | snprintf(buf, sizeof(buf), "%ld.%02ldMiB", |
e0d19036 | 515 | (long)(bytes>>20), |
bd526cee | 516 | (long)((bytes&0xfffff)+0x100000/200)/(0x100000/100) |
e0d19036 NB |
517 | ); |
518 | else | |
8f23b0b3 | 519 | snprintf(buf, sizeof(buf), "%ld.%02ldGiB", |
e0d19036 | 520 | (long)(bytes>>30), |
bd526cee | 521 | (long)(((bytes>>10)&0xfffff)+0x100000/200)/(0x100000/100) |
e0d19036 NB |
522 | ); |
523 | return buf; | |
524 | } | |
525 | ||
dd0781e5 | 526 | int get_mdp_major(void) |
98c6faba | 527 | { |
dd0781e5 NB |
528 | static int mdp_major = -1; |
529 | FILE *fl; | |
98c6faba NB |
530 | char *w; |
531 | int have_block = 0; | |
532 | int have_devices = 0; | |
533 | int last_num = -1; | |
dd0781e5 NB |
534 | |
535 | if (mdp_major != -1) | |
536 | return mdp_major; | |
537 | fl = fopen("/proc/devices", "r"); | |
98c6faba | 538 | if (!fl) |
dd0781e5 | 539 | return -1; |
98c6faba NB |
540 | while ((w = conf_word(fl, 1))) { |
541 | if (have_block && strcmp(w, "devices:")==0) | |
542 | have_devices = 1; | |
543 | have_block = (strcmp(w, "Block")==0); | |
544 | if (isdigit(w[0])) | |
545 | last_num = atoi(w); | |
546 | if (have_devices && strcmp(w, "mdp")==0) | |
547 | mdp_major = last_num; | |
548 | free(w); | |
549 | } | |
550 | fclose(fl); | |
dd0781e5 | 551 | return mdp_major; |
98c6faba NB |
552 | } |
553 | ||
554 | ||
e0d19036 | 555 | |
e0d19036 NB |
556 | char *get_md_name(int dev) |
557 | { | |
558 | /* find /dev/md%d or /dev/md/%d or make a device /dev/.tmp.md%d */ | |
98c6faba | 559 | /* if dev < 0, want /dev/md/d%d or find mdp in /proc/devices ... */ |
e0d19036 NB |
560 | static char devname[50]; |
561 | struct stat stb; | |
98c6faba | 562 | dev_t rdev; |
dd0781e5 | 563 | char *dn; |
98c6faba NB |
564 | |
565 | if (dev < 0) { | |
dd0781e5 NB |
566 | int mdp = get_mdp_major(); |
567 | if (mdp < 0) return NULL; | |
0df46c2a | 568 | rdev = makedev(mdp, (-1-dev)<<6); |
8f23b0b3 | 569 | snprintf(devname, sizeof(devname), "/dev/md/d%d", -1-dev); |
98c6faba NB |
570 | if (stat(devname, &stb) == 0 |
571 | && (S_IFMT&stb.st_mode) == S_IFBLK | |
572 | && (stb.st_rdev == rdev)) | |
573 | return devname; | |
574 | } else { | |
0df46c2a | 575 | rdev = makedev(MD_MAJOR, dev); |
8f23b0b3 | 576 | snprintf(devname, sizeof(devname), "/dev/md%d", dev); |
98c6faba NB |
577 | if (stat(devname, &stb) == 0 |
578 | && (S_IFMT&stb.st_mode) == S_IFBLK | |
579 | && (stb.st_rdev == rdev)) | |
580 | return devname; | |
581 | ||
8f23b0b3 | 582 | snprintf(devname, sizeof(devname), "/dev/md/%d", dev); |
98c6faba NB |
583 | if (stat(devname, &stb) == 0 |
584 | && (S_IFMT&stb.st_mode) == S_IFBLK | |
585 | && (stb.st_rdev == rdev)) | |
586 | return devname; | |
587 | } | |
16c6fa80 | 588 | dn = map_dev(major(rdev), minor(rdev), 0); |
dd0781e5 NB |
589 | if (dn) |
590 | return dn; | |
8f23b0b3 | 591 | snprintf(devname, sizeof(devname), "/dev/.tmp.md%d", dev); |
e0d19036 | 592 | if (mknod(devname, S_IFBLK | 0600, rdev) == -1) |
dd0781e5 NB |
593 | if (errno != EEXIST) |
594 | return NULL; | |
e0d19036 NB |
595 | |
596 | if (stat(devname, &stb) == 0 | |
597 | && (S_IFMT&stb.st_mode) == S_IFBLK | |
598 | && (stb.st_rdev == rdev)) | |
599 | return devname; | |
600 | unlink(devname); | |
601 | return NULL; | |
602 | } | |
603 | ||
604 | void put_md_name(char *name) | |
605 | { | |
606 | if (strncmp(name, "/dev/.tmp.md", 12)==0) | |
607 | unlink(name); | |
608 | } | |
f9ce90ba | 609 | |
8b0dabea NB |
610 | int dev_open(char *dev, int flags) |
611 | { | |
612 | /* like 'open', but if 'dev' matches %d:%d, create a temp | |
613 | * block device and open that | |
614 | */ | |
615 | char *e; | |
616 | int fd = -1; | |
617 | char devname[32]; | |
618 | int major = strtoul(dev, &e, 0); | |
619 | int minor; | |
620 | if (e > dev && *e == ':' && e[1] && | |
621 | (minor = strtoul(e+1, &e, 0)) >= 0 && | |
622 | *e == 0) { | |
623 | snprintf(devname, sizeof(devname), "/dev/.tmp.md.%d:%d", major, minor); | |
624 | if (mknod(devname, S_IFBLK|0600, makedev(major, minor))==0) { | |
625 | fd = open(devname, flags); | |
626 | unlink(devname); | |
627 | } | |
628 | } else | |
629 | fd = open(dev, flags); | |
630 | return fd; | |
631 | } | |
f9ce90ba | 632 | |
82d9eba6 | 633 | struct superswitch *superlist[] = { &super0, &super1, NULL }; |
f9ce90ba | 634 | |
82d9eba6 | 635 | struct supertype *super_by_version(int vers, int minor) |
f9ce90ba | 636 | { |
82d9eba6 NB |
637 | struct supertype *st = malloc(sizeof(*st)); |
638 | if (!st) return st; | |
6fbba4c9 | 639 | if (vers == 0) { |
82d9eba6 | 640 | st->ss = &super0; |
6fbba4c9 NB |
641 | st->max_devs = MD_SB_DISKS; |
642 | } | |
82d9eba6 | 643 | |
6fbba4c9 | 644 | if (vers == 1) { |
82d9eba6 | 645 | st->ss = &super1; |
6fbba4c9 NB |
646 | st->max_devs = 384; |
647 | } | |
82d9eba6 NB |
648 | st->minor_version = minor; |
649 | return st; | |
f9ce90ba NB |
650 | } |
651 | ||
82d9eba6 | 652 | struct supertype *guess_super(int fd) |
f9ce90ba NB |
653 | { |
654 | /* try each load_super to find the best match, | |
655 | * and return the best superswitch | |
656 | */ | |
82d9eba6 NB |
657 | struct superswitch *ss; |
658 | struct supertype *st; | |
570c0542 NB |
659 | unsigned long besttime = 0; |
660 | int bestsuper = -1; | |
82d9eba6 | 661 | |
f9ce90ba NB |
662 | void *sbp = NULL; |
663 | int i; | |
664 | ||
82d9eba6 NB |
665 | st = malloc(sizeof(*st)); |
666 | memset(st, 0, sizeof(*st)); | |
f9ce90ba NB |
667 | for (i=0 ; superlist[i]; i++) { |
668 | int rv; | |
669 | ss = superlist[i]; | |
f277ce36 | 670 | st->ss = NULL; |
82d9eba6 | 671 | rv = ss->load_super(st, fd, &sbp, NULL); |
570c0542 NB |
672 | if (rv == 0) { |
673 | struct mdinfo info; | |
31317663 | 674 | ss->getinfo_super(&info, sbp); |
570c0542 NB |
675 | if (bestsuper == -1 || |
676 | besttime < info.array.ctime) { | |
677 | bestsuper = i; | |
678 | besttime = info.array.ctime; | |
570c0542 NB |
679 | } |
680 | free(sbp); | |
681 | } | |
682 | } | |
683 | if (bestsuper != -1) { | |
684 | int rv; | |
f277ce36 | 685 | st->ss = NULL; |
570c0542 | 686 | rv = superlist[bestsuper]->load_super(st, fd, &sbp, NULL); |
f9ce90ba NB |
687 | if (rv == 0) { |
688 | free(sbp); | |
82d9eba6 | 689 | return st; |
f9ce90ba NB |
690 | } |
691 | } | |
570c0542 | 692 | free(st); |
f9ce90ba NB |
693 | return NULL; |
694 | } | |
fe6729fa | 695 | |
8fac0577 | 696 | |
fe6729fa NB |
697 | #ifdef __TINYC__ |
698 | /* tinyc doesn't optimize this check in ioctl.h out ... */ | |
699 | unsigned int __invalid_size_argument_for_IOC = 0; | |
700 | #endif | |
701 |