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