]>
Commit | Line | Data |
---|---|---|
64c4757e | 1 | /* |
9a9dab36 | 2 | * mdadm - manage Linux "md" devices aka RAID arrays. |
64c4757e | 3 | * |
ca3b6696 | 4 | * Copyright (C) 2001-2012 Neil Brown <neilb@suse.de> |
64c4757e NB |
5 | * |
6 | * | |
7 | * This program is free software; you can redistribute it and/or modify | |
8 | * it under the terms of the GNU General Public License as published by | |
9 | * the Free Software Foundation; either version 2 of the License, or | |
10 | * (at your option) any later version. | |
11 | * | |
12 | * This program is distributed in the hope that it will be useful, | |
13 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
14 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
15 | * GNU General Public License for more details. | |
16 | * | |
17 | * You should have received a copy of the GNU General Public License | |
18 | * along with this program; if not, write to the Free Software | |
19 | * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA | |
20 | * | |
21 | * Author: Neil Brown | |
e736b623 | 22 | * Email: <neilb@suse.de> |
64c4757e NB |
23 | */ |
24 | ||
9a9dab36 | 25 | #include "mdadm.h" |
64c4757e | 26 | #include "md_p.h" |
edd8d13c | 27 | #include <sys/socket.h> |
64c4757e | 28 | #include <sys/utsname.h> |
9fe32043 | 29 | #include <sys/wait.h> |
edd8d13c | 30 | #include <sys/un.h> |
98c6faba | 31 | #include <ctype.h> |
a322f70c | 32 | #include <dirent.h> |
a931db9e | 33 | #include <signal.h> |
0a816ef9 | 34 | |
a0963a86 JS |
35 | int __offroot; |
36 | ||
0a816ef9 NB |
37 | /* |
38 | * following taken from linux/blkpg.h because they aren't | |
39 | * anywhere else and it isn't safe to #include linux/ * stuff. | |
40 | */ | |
41 | ||
42 | #define BLKPG _IO(0x12,105) | |
43 | ||
44 | /* The argument structure */ | |
45 | struct blkpg_ioctl_arg { | |
46 | int op; | |
47 | int flags; | |
48 | int datalen; | |
49 | void *data; | |
50 | }; | |
51 | ||
52 | /* The subfunctions (for the op field) */ | |
53 | #define BLKPG_ADD_PARTITION 1 | |
54 | #define BLKPG_DEL_PARTITION 2 | |
55 | ||
56 | /* Sizes of name fields. Unused at present. */ | |
57 | #define BLKPG_DEVNAMELTH 64 | |
58 | #define BLKPG_VOLNAMELTH 64 | |
59 | ||
60 | /* The data structure for ADD_PARTITION and DEL_PARTITION */ | |
61 | struct blkpg_partition { | |
62 | long long start; /* starting offset in bytes */ | |
63 | long long length; /* length in bytes */ | |
64 | int pno; /* partition number */ | |
65 | char devname[BLKPG_DEVNAMELTH]; /* partition name, like sda5 or c0d1p2, | |
66 | to be used in kernel messages */ | |
67 | char volname[BLKPG_VOLNAMELTH]; /* volume label */ | |
68 | }; | |
64c4757e | 69 | |
0f22b998 | 70 | #include "part.h" |
056b331e N |
71 | |
72 | /* Force a compilation error if condition is true */ | |
73 | #define BUILD_BUG_ON(condition) ((void)BUILD_BUG_ON_ZERO(condition)) | |
74 | ||
75 | /* Force a compilation error if condition is true, but also produce a | |
76 | result (of value 0 and type size_t), so the expression can be used | |
77 | e.g. in a structure initializer (or where-ever else comma expressions | |
78 | aren't permitted). */ | |
79 | #define BUILD_BUG_ON_ZERO(e) (sizeof(struct { int:-!!(e); })) | |
80 | ||
64c4757e NB |
81 | /* |
82 | * Parse a 128 bit uuid in 4 integers | |
83 | * format is 32 hexx nibbles with options :.<space> separator | |
84 | * If not exactly 32 hex digits are found, return 0 | |
85 | * else return 1 | |
86 | */ | |
87 | int parse_uuid(char *str, int uuid[4]) | |
88 | { | |
aba69144 NB |
89 | int hit = 0; /* number of Hex digIT */ |
90 | int i; | |
91 | char c; | |
ca3b6696 N |
92 | for (i = 0; i < 4; i++) |
93 | uuid[i] = 0; | |
aba69144 | 94 | |
ca3b6696 | 95 | while ((c = *str++) != 0) { |
aba69144 | 96 | int n; |
ca3b6696 | 97 | if (c >= '0' && c <= '9') |
aba69144 | 98 | n = c-'0'; |
ca3b6696 | 99 | else if (c >= 'a' && c <= 'f') |
aba69144 | 100 | n = 10 + c - 'a'; |
ca3b6696 | 101 | else if (c >= 'A' && c <= 'F') |
aba69144 NB |
102 | n = 10 + c - 'A'; |
103 | else if (strchr(":. -", c)) | |
104 | continue; | |
105 | else return 0; | |
106 | ||
107 | if (hit<32) { | |
108 | uuid[hit/8] <<= 4; | |
109 | uuid[hit/8] += n; | |
110 | } | |
111 | hit++; | |
82b27616 | 112 | } |
aba69144 NB |
113 | if (hit == 32) |
114 | return 1; | |
115 | return 0; | |
64c4757e NB |
116 | } |
117 | ||
64c4757e NB |
118 | /* |
119 | * Get the md version number. | |
120 | * We use the RAID_VERSION ioctl if it is supported | |
121 | * If not, but we have a block device with major '9', we assume | |
122 | * 0.36.0 | |
123 | * | |
124 | * Return version number as 24 but number - assume version parts | |
125 | * always < 255 | |
126 | */ | |
127 | ||
128 | int md_get_version(int fd) | |
129 | { | |
130 | struct stat stb; | |
131 | mdu_version_t vers; | |
132 | ||
133 | if (fstat(fd, &stb)<0) | |
134 | return -1; | |
135 | if ((S_IFMT&stb.st_mode) != S_IFBLK) | |
136 | return -1; | |
137 | ||
138 | if (ioctl(fd, RAID_VERSION, &vers) == 0) | |
682c7051 | 139 | return (vers.major*10000) + (vers.minor*100) + vers.patchlevel; |
5787fa49 NB |
140 | if (errno == EACCES) |
141 | return -1; | |
0df46c2a | 142 | if (major(stb.st_rdev) == MD_MAJOR) |
682c7051 | 143 | return (3600); |
64c4757e NB |
144 | return -1; |
145 | } | |
146 | ||
64c4757e NB |
147 | int get_linux_version() |
148 | { | |
149 | struct utsname name; | |
98c6faba | 150 | char *cp; |
f161d047 | 151 | int a = 0, b = 0,c = 0; |
64c4757e NB |
152 | if (uname(&name) <0) |
153 | return -1; | |
154 | ||
98c6faba NB |
155 | cp = name.release; |
156 | a = strtoul(cp, &cp, 10); | |
f161d047 N |
157 | if (*cp == '.') |
158 | b = strtoul(cp+1, &cp, 10); | |
159 | if (*cp == '.') | |
160 | c = strtoul(cp+1, &cp, 10); | |
98c6faba | 161 | |
682c7051 | 162 | return (a*1000000)+(b*1000)+c; |
64c4757e NB |
163 | } |
164 | ||
71204a50 | 165 | #ifndef MDASSEMBLE |
bc77ed53 DW |
166 | int mdadm_version(char *version) |
167 | { | |
168 | int a, b, c; | |
169 | char *cp; | |
170 | ||
171 | if (!version) | |
172 | version = Version; | |
173 | ||
174 | cp = strchr(version, '-'); | |
175 | if (!cp || *(cp+1) != ' ' || *(cp+2) != 'v') | |
176 | return -1; | |
177 | cp += 3; | |
178 | a = strtoul(cp, &cp, 10); | |
179 | if (*cp != '.') | |
180 | return -1; | |
181 | b = strtoul(cp+1, &cp, 10); | |
182 | if (*cp == '.') | |
183 | c = strtoul(cp+1, &cp, 10); | |
184 | else | |
185 | c = 0; | |
186 | if (*cp != ' ' && *cp != '-') | |
187 | return -1; | |
188 | return (a*1000000)+(b*1000)+c; | |
189 | } | |
190 | ||
84e11361 N |
191 | long long parse_size(char *size) |
192 | { | |
193 | /* parse 'size' which should be a number optionally | |
194 | * followed by 'K', 'M', or 'G'. | |
195 | * Without a suffix, K is assumed. | |
196 | * Number returned is in sectors (half-K) | |
15632a96 | 197 | * -1 returned on error. |
84e11361 N |
198 | */ |
199 | char *c; | |
200 | long long s = strtoll(size, &c, 10); | |
201 | if (s > 0) { | |
202 | switch (*c) { | |
203 | case 'K': | |
204 | c++; | |
205 | default: | |
206 | s *= 2; | |
207 | break; | |
208 | case 'M': | |
209 | c++; | |
210 | s *= 1024 * 2; | |
211 | break; | |
212 | case 'G': | |
213 | c++; | |
214 | s *= 1024 * 1024 * 2; | |
215 | break; | |
216 | } | |
217 | } | |
218 | if (*c) | |
15632a96 | 219 | s = -1; |
84e11361 N |
220 | return s; |
221 | } | |
222 | ||
4a06e2c2 N |
223 | int parse_layout_10(char *layout) |
224 | { | |
225 | int copies, rv; | |
226 | char *cp; | |
227 | /* Parse the layout string for raid10 */ | |
228 | /* 'f', 'o' or 'n' followed by a number <= raid_disks */ | |
229 | if ((layout[0] != 'n' && layout[0] != 'f' && layout[0] != 'o') || | |
230 | (copies = strtoul(layout+1, &cp, 10)) < 1 || | |
231 | copies > 200 || | |
232 | *cp) | |
233 | return -1; | |
234 | if (layout[0] == 'n') | |
235 | rv = 256 + copies; | |
236 | else if (layout[0] == 'o') | |
237 | rv = 0x10000 + (copies<<8) + 1; | |
238 | else | |
239 | rv = 1 + (copies<<8); | |
240 | return rv; | |
241 | } | |
242 | ||
243 | int parse_layout_faulty(char *layout) | |
244 | { | |
245 | /* Parse the layout string for 'faulty' */ | |
246 | int ln = strcspn(layout, "0123456789"); | |
503975b9 | 247 | char *m = xstrdup(layout); |
4a06e2c2 N |
248 | int mode; |
249 | m[ln] = 0; | |
250 | mode = map_name(faultylayout, m); | |
251 | if (mode == UnSet) | |
252 | return -1; | |
253 | ||
254 | return mode | (atoi(layout+ln)<< ModeShift); | |
255 | } | |
79868890 N |
256 | |
257 | long parse_num(char *num) | |
258 | { | |
259 | /* Either return a valid number, or -1 */ | |
260 | char *c; | |
261 | long rv = strtol(num, &c, 10); | |
262 | if (rv < 0 || *c || !num[0]) | |
263 | return -1; | |
264 | else | |
265 | return rv; | |
266 | } | |
eb3929a4 | 267 | #endif |
4a06e2c2 | 268 | |
0430ed48 NB |
269 | void remove_partitions(int fd) |
270 | { | |
271 | /* remove partitions from this block devices. | |
272 | * This is used for components added to an array | |
273 | */ | |
274 | #ifdef BLKPG_DEL_PARTITION | |
275 | struct blkpg_ioctl_arg a; | |
276 | struct blkpg_partition p; | |
277 | ||
278 | a.op = BLKPG_DEL_PARTITION; | |
279 | a.data = (void*)&p; | |
280 | a.datalen = sizeof(p); | |
281 | a.flags = 0; | |
282 | memset(a.data, 0, a.datalen); | |
ca3b6696 | 283 | for (p.pno = 0; p.pno < 16; p.pno++) |
0430ed48 NB |
284 | ioctl(fd, BLKPG, &a); |
285 | #endif | |
286 | } | |
287 | ||
691c6ee1 N |
288 | int test_partition(int fd) |
289 | { | |
290 | /* Check if fd is a whole-disk or a partition. | |
291 | * BLKPG will return EINVAL on a partition, and BLKPG_DEL_PARTITION | |
292 | * will return ENXIO on an invalid partition number. | |
293 | */ | |
294 | struct blkpg_ioctl_arg a; | |
295 | struct blkpg_partition p; | |
296 | a.op = BLKPG_DEL_PARTITION; | |
297 | a.data = (void*)&p; | |
298 | a.datalen = sizeof(p); | |
299 | a.flags = 0; | |
300 | memset(a.data, 0, a.datalen); | |
301 | p.pno = 1<<30; | |
302 | if (ioctl(fd, BLKPG, &a) == 0) | |
303 | /* Very unlikely, but not a partition */ | |
304 | return 0; | |
305 | if (errno == ENXIO) | |
306 | /* not a partition */ | |
307 | return 0; | |
308 | ||
309 | return 1; | |
310 | } | |
311 | ||
bfd76b93 CA |
312 | int test_partition_from_id(dev_t id) |
313 | { | |
314 | char buf[20]; | |
315 | int fd, rv; | |
316 | ||
317 | sprintf(buf, "%d:%d", major(id), minor(id)); | |
318 | fd = dev_open(buf, O_RDONLY); | |
319 | if (fd < 0) | |
320 | return -1; | |
321 | rv = test_partition(fd); | |
322 | close(fd); | |
323 | return rv; | |
324 | } | |
691c6ee1 | 325 | |
de5a472e | 326 | int enough(int level, int raid_disks, int layout, int clean, char *avail) |
64c4757e | 327 | { |
265e0f17 | 328 | int copies, first; |
de5a472e N |
329 | int i; |
330 | int avail_disks = 0; | |
331 | ||
332 | for (i = 0; i < raid_disks; i++) | |
333 | avail_disks += !!avail[i]; | |
334 | ||
64c4757e | 335 | switch (level) { |
265e0f17 NB |
336 | case 10: |
337 | /* This is the tricky one - we need to check | |
338 | * which actual disks are present. | |
339 | */ | |
702b557b | 340 | copies = (layout&255)* ((layout>>8) & 255); |
ca3b6696 | 341 | first = 0; |
265e0f17 NB |
342 | do { |
343 | /* there must be one of the 'copies' form 'first' */ | |
344 | int n = copies; | |
ca3b6696 | 345 | int cnt = 0; |
265e0f17 NB |
346 | while (n--) { |
347 | if (avail[first]) | |
348 | cnt++; | |
349 | first = (first+1) % raid_disks; | |
350 | } | |
351 | if (cnt == 0) | |
352 | return 0; | |
353 | ||
354 | } while (first != 0); | |
355 | return 1; | |
e5329c37 | 356 | |
df0d4ea0 | 357 | case LEVEL_MULTIPATH: |
e0d19036 | 358 | return avail_disks>= 1; |
df0d4ea0 | 359 | case LEVEL_LINEAR: |
64c4757e NB |
360 | case 0: |
361 | return avail_disks == raid_disks; | |
362 | case 1: | |
363 | return avail_disks >= 1; | |
364 | case 4: | |
365 | case 5: | |
583315d9 NB |
366 | if (clean) |
367 | return avail_disks >= raid_disks-1; | |
368 | else | |
369 | return avail_disks >= raid_disks; | |
98c6faba | 370 | case 6: |
583315d9 NB |
371 | if (clean) |
372 | return avail_disks >= raid_disks-2; | |
373 | else | |
374 | return avail_disks >= raid_disks; | |
64c4757e NB |
375 | default: |
376 | return 0; | |
377 | } | |
378 | } | |
379 | ||
8453e704 N |
380 | int enough_fd(int fd) |
381 | { | |
382 | struct mdu_array_info_s array; | |
383 | struct mdu_disk_info_s disk; | |
384 | int avail_disks = 0; | |
aabe020d | 385 | int i, rv; |
8453e704 N |
386 | char *avail; |
387 | ||
388 | if (ioctl(fd, GET_ARRAY_INFO, &array) != 0 || | |
389 | array.raid_disks <= 0) | |
390 | return 0; | |
503975b9 | 391 | avail = xcalloc(array.raid_disks, 1); |
ca3b6696 | 392 | for (i = 0; i < MAX_DISKS && array.nr_disks > 0; i++) { |
8453e704 N |
393 | disk.number = i; |
394 | if (ioctl(fd, GET_DISK_INFO, &disk) != 0) | |
395 | continue; | |
9e6d9291 N |
396 | if (disk.major == 0 && disk.minor == 0) |
397 | continue; | |
398 | array.nr_disks--; | |
399 | ||
8453e704 N |
400 | if (! (disk.state & (1<<MD_DISK_SYNC))) |
401 | continue; | |
402 | if (disk.raid_disk < 0 || disk.raid_disk >= array.raid_disks) | |
403 | continue; | |
404 | avail_disks++; | |
405 | avail[disk.raid_disk] = 1; | |
406 | } | |
407 | /* This is used on an active array, so assume it is clean */ | |
aabe020d | 408 | rv = enough(array.level, array.raid_disks, array.layout, |
de5a472e | 409 | 1, avail); |
aabe020d JS |
410 | free(avail); |
411 | return rv; | |
8453e704 N |
412 | } |
413 | ||
22e263f6 AC |
414 | const int uuid_zero[4] = { 0, 0, 0, 0 }; |
415 | ||
f277ce36 | 416 | int same_uuid(int a[4], int b[4], int swapuuid) |
64c4757e | 417 | { |
f277ce36 NB |
418 | if (swapuuid) { |
419 | /* parse uuids are hostendian. | |
420 | * uuid's from some superblocks are big-ending | |
aba69144 | 421 | * if there is a difference, we need to swap.. |
f277ce36 NB |
422 | */ |
423 | unsigned char *ac = (unsigned char *)a; | |
424 | unsigned char *bc = (unsigned char *)b; | |
425 | int i; | |
ca3b6696 | 426 | for (i = 0; i < 16; i += 4) { |
f277ce36 NB |
427 | if (ac[i+0] != bc[i+3] || |
428 | ac[i+1] != bc[i+2] || | |
429 | ac[i+2] != bc[i+1] || | |
430 | ac[i+3] != bc[i+0]) | |
431 | return 0; | |
432 | } | |
433 | return 1; | |
434 | } else { | |
435 | if (a[0]==b[0] && | |
436 | a[1]==b[1] && | |
437 | a[2]==b[2] && | |
438 | a[3]==b[3]) | |
439 | return 1; | |
440 | return 0; | |
441 | } | |
64c4757e | 442 | } |
ca3b6696 | 443 | |
350f29f9 NB |
444 | void copy_uuid(void *a, int b[4], int swapuuid) |
445 | { | |
446 | if (swapuuid) { | |
447 | /* parse uuids are hostendian. | |
448 | * uuid's from some superblocks are big-ending | |
449 | * if there is a difference, we need to swap.. | |
450 | */ | |
451 | unsigned char *ac = (unsigned char *)a; | |
452 | unsigned char *bc = (unsigned char *)b; | |
453 | int i; | |
ca3b6696 | 454 | for (i = 0; i < 16; i += 4) { |
350f29f9 NB |
455 | ac[i+0] = bc[i+3]; |
456 | ac[i+1] = bc[i+2]; | |
457 | ac[i+2] = bc[i+1]; | |
458 | ac[i+3] = bc[i+0]; | |
459 | } | |
460 | } else | |
461 | memcpy(a, b, 16); | |
462 | } | |
64c4757e | 463 | |
aae5a112 | 464 | char *__fname_from_uuid(int id[4], int swap, char *buf, char sep) |
d7288ddc | 465 | { |
9968e376 | 466 | int i, j; |
d7288ddc N |
467 | char uuid[16]; |
468 | char *c = buf; | |
469 | strcpy(c, "UUID-"); | |
470 | c += strlen(c); | |
aae5a112 | 471 | copy_uuid(uuid, id, swap); |
9968e376 | 472 | for (i = 0; i < 4; i++) { |
9968e376 | 473 | if (i) |
ff54de6e | 474 | *c++ = sep; |
9968e376 DW |
475 | for (j = 3; j >= 0; j--) { |
476 | sprintf(c,"%02x", (unsigned char) uuid[j+4*i]); | |
477 | c+= 2; | |
478 | } | |
d7288ddc N |
479 | } |
480 | return buf; | |
aae5a112 DW |
481 | |
482 | } | |
483 | ||
484 | char *fname_from_uuid(struct supertype *st, struct mdinfo *info, char *buf, char sep) | |
485 | { | |
86983cce N |
486 | // dirty hack to work around an issue with super1 superblocks... |
487 | // super1 superblocks need swapuuid set in order for assembly to | |
488 | // work, but can't have it set if we want this printout to match | |
489 | // all the other uuid printouts in super1.c, so we force swapuuid | |
490 | // to 1 to make our printout match the rest of super1 | |
491 | return __fname_from_uuid(info->uuid, (st->ss == &super1) ? 1 : st->ss->swapuuid, buf, sep); | |
d7288ddc N |
492 | } |
493 | ||
435d4ebb | 494 | #ifndef MDASSEMBLE |
682c7051 NB |
495 | int check_ext2(int fd, char *name) |
496 | { | |
497 | /* | |
498 | * Check for an ext2fs file system. | |
499 | * Superblock is always 1K at 1K offset | |
500 | * | |
501 | * s_magic is le16 at 56 == 0xEF53 | |
502 | * report mtime - le32 at 44 | |
503 | * blocks - le32 at 4 | |
504 | * logblksize - le32 at 24 | |
505 | */ | |
506 | unsigned char sb[1024]; | |
507 | time_t mtime; | |
508 | int size, bsize; | |
509 | if (lseek(fd, 1024,0)!= 1024) | |
510 | return 0; | |
511 | if (read(fd, sb, 1024)!= 1024) | |
512 | return 0; | |
513 | if (sb[56] != 0x53 || sb[57] != 0xef) | |
514 | return 0; | |
515 | ||
516 | mtime = sb[44]|(sb[45]|(sb[46]|sb[47]<<8)<<8)<<8; | |
517 | bsize = sb[24]|(sb[25]|(sb[26]|sb[27]<<8)<<8)<<8; | |
518 | size = sb[4]|(sb[5]|(sb[6]|sb[7]<<8)<<8)<<8; | |
e7b84f9d | 519 | pr_err("%s appears to contain an ext2fs file system\n", |
682c7051 NB |
520 | name); |
521 | fprintf(stderr," size=%dK mtime=%s", | |
522 | size*(1<<bsize), ctime(&mtime)); | |
523 | return 1; | |
524 | } | |
525 | ||
526 | int check_reiser(int fd, char *name) | |
527 | { | |
528 | /* | |
529 | * superblock is at 64K | |
530 | * size is 1024; | |
531 | * Magic string "ReIsErFs" or "ReIsEr2Fs" at 52 | |
532 | * | |
533 | */ | |
534 | unsigned char sb[1024]; | |
881990a2 | 535 | unsigned long size; |
682c7051 NB |
536 | if (lseek(fd, 64*1024, 0) != 64*1024) |
537 | return 0; | |
538 | if (read(fd, sb, 1024) != 1024) | |
539 | return 0; | |
ca3b6696 N |
540 | if (strncmp((char*)sb+52, "ReIsErFs",8) != 0 && |
541 | strncmp((char*)sb+52, "ReIsEr2Fs",9) != 0) | |
682c7051 | 542 | return 0; |
e7b84f9d | 543 | pr_err("%s appears to contain a reiserfs file system\n",name); |
682c7051 | 544 | size = sb[0]|(sb[1]|(sb[2]|sb[3]<<8)<<8)<<8; |
881990a2 | 545 | fprintf(stderr, " size = %luK\n", size*4); |
aba69144 | 546 | |
682c7051 NB |
547 | return 1; |
548 | } | |
549 | ||
550 | int check_raid(int fd, char *name) | |
551 | { | |
4b1ac34b | 552 | struct mdinfo info; |
682c7051 | 553 | time_t crtime; |
d078d77c | 554 | char *level; |
82d9eba6 | 555 | struct supertype *st = guess_super(fd); |
f9ce90ba | 556 | |
82d9eba6 | 557 | if (!st) return 0; |
4a96d9ff | 558 | st->ignore_hw_compat = 1; |
3da92f27 | 559 | st->ss->load_super(st, fd, name); |
82d9eba6 | 560 | /* Looks like a raid array .. */ |
e7b84f9d | 561 | pr_err("%s appears to be part of a raid array:\n", |
82d9eba6 | 562 | name); |
a5d85af7 | 563 | st->ss->getinfo_super(st, &info, NULL); |
3da92f27 | 564 | st->ss->free_super(st); |
82d9eba6 | 565 | crtime = info.array.ctime; |
d078d77c NB |
566 | level = map_num(pers, info.array.level); |
567 | if (!level) level = "-unknown-"; | |
568 | fprintf(stderr, " level=%s devices=%d ctime=%s", | |
569 | level, info.array.raid_disks, ctime(&crtime)); | |
82d9eba6 | 570 | return 1; |
682c7051 NB |
571 | } |
572 | ||
682c7051 NB |
573 | int ask(char *mesg) |
574 | { | |
575 | char *add = ""; | |
576 | int i; | |
ca3b6696 | 577 | for (i = 0; i < 5; i++) { |
682c7051 NB |
578 | char buf[100]; |
579 | fprintf(stderr, "%s%s", mesg, add); | |
580 | fflush(stderr); | |
581 | if (fgets(buf, 100, stdin)==NULL) | |
582 | return 0; | |
583 | if (buf[0]=='y' || buf[0]=='Y') | |
584 | return 1; | |
585 | if (buf[0]=='n' || buf[0]=='N') | |
586 | return 0; | |
587 | add = "(y/n) "; | |
588 | } | |
e7b84f9d | 589 | pr_err("assuming 'no'\n"); |
682c7051 NB |
590 | return 0; |
591 | } | |
435d4ebb | 592 | #endif /* MDASSEMBLE */ |
682c7051 | 593 | |
8d80900b | 594 | int is_standard(char *dev, int *nump) |
e5329c37 NB |
595 | { |
596 | /* tests if dev is a "standard" md dev name. | |
597 | * i.e if the last component is "/dNN" or "/mdNN", | |
aba69144 | 598 | * where NN is a string of digits |
598f0d58 NB |
599 | * Returns 1 if a partitionable standard, |
600 | * -1 if non-partitonable, | |
601 | * 0 if not a standard name. | |
e5329c37 | 602 | */ |
8d80900b | 603 | char *d = strrchr(dev, '/'); |
ca3b6696 | 604 | int type = 0; |
8d80900b NB |
605 | int num; |
606 | if (!d) | |
e5329c37 | 607 | return 0; |
ca3b6696 N |
608 | if (strncmp(d, "/d",2) == 0) |
609 | d += 2, type = 1; /* /dev/md/dN{pM} */ | |
610 | else if (strncmp(d, "/md_d", 5) == 0) | |
611 | d += 5, type = 1; /* /dev/md_dN{pM} */ | |
612 | else if (strncmp(d, "/md", 3) == 0) | |
613 | d += 3, type = -1; /* /dev/mdN */ | |
614 | else if (d-dev > 3 && strncmp(d-2, "md/", 3) == 0) | |
615 | d += 1, type = -1; /* /dev/md/N */ | |
e5329c37 NB |
616 | else |
617 | return 0; | |
8d80900b | 618 | if (!*d) |
e5329c37 | 619 | return 0; |
8d80900b NB |
620 | num = atoi(d); |
621 | while (isdigit(*d)) | |
622 | d++; | |
623 | if (*d) | |
e5329c37 | 624 | return 0; |
8d80900b NB |
625 | if (nump) *nump = num; |
626 | ||
627 | return type; | |
e5329c37 NB |
628 | } |
629 | ||
4b1ac34b | 630 | unsigned long calc_csum(void *super, int bytes) |
82b27616 | 631 | { |
56eb10c0 | 632 | unsigned long long newcsum = 0; |
82b27616 | 633 | int i; |
4b1ac34b NB |
634 | unsigned int csum; |
635 | unsigned int *superc = (unsigned int*) super; | |
82b27616 | 636 | |
ca3b6696 N |
637 | for(i = 0; i < bytes/4; i++) |
638 | newcsum += superc[i]; | |
82b27616 | 639 | csum = (newcsum& 0xffffffff) + (newcsum>>32); |
570c0542 | 640 | #ifdef __alpha__ |
aba69144 | 641 | /* The in-kernel checksum calculation is always 16bit on |
570c0542 | 642 | * the alpha, though it is 32 bit on i386... |
ca3b6696 | 643 | * I wonder what it is elsewhere... (it uses an API in |
570c0542 NB |
644 | * a way that it shouldn't). |
645 | */ | |
646 | csum = (csum & 0xffff) + (csum >> 16); | |
647 | csum = (csum & 0xffff) + (csum >> 16); | |
648 | #endif | |
82b27616 NB |
649 | return csum; |
650 | } | |
cd29a5c8 | 651 | |
435d4ebb | 652 | #ifndef MDASSEMBLE |
56eb10c0 | 653 | char *human_size(long long bytes) |
cd29a5c8 NB |
654 | { |
655 | static char buf[30]; | |
d5d3721e NB |
656 | |
657 | /* We convert bytes to either centi-M{ega,ibi}bytes or | |
658 | * centi-G{igi,ibi}bytes, with appropriate rounding, | |
659 | * and then print 1/100th of those as a decimal. | |
660 | * We allow upto 2048Megabytes before converting to | |
661 | * gigabytes, as that shows more precision and isn't | |
662 | * too large a number. | |
01619b48 | 663 | * Terabytes are not yet handled. |
d5d3721e | 664 | */ |
cd29a5c8 | 665 | |
56eb10c0 | 666 | if (bytes < 5000*1024) |
ca3b6696 | 667 | buf[0] = 0; |
d5d3721e NB |
668 | else if (bytes < 2*1024LL*1024LL*1024LL) { |
669 | long cMiB = (bytes / ( (1LL<<20) / 200LL ) +1) /2; | |
670 | long cMB = (bytes / ( 1000000LL / 200LL ) +1) /2; | |
8f23b0b3 | 671 | snprintf(buf, sizeof(buf), " (%ld.%02ld MiB %ld.%02ld MB)", |
d5d3721e NB |
672 | cMiB/100 , cMiB % 100, |
673 | cMB/100, cMB % 100); | |
674 | } else { | |
675 | long cGiB = (bytes / ( (1LL<<30) / 200LL ) +1) /2; | |
676 | long cGB = (bytes / (1000000000LL/200LL ) +1) /2; | |
8f23b0b3 | 677 | snprintf(buf, sizeof(buf), " (%ld.%02ld GiB %ld.%02ld GB)", |
d5d3721e NB |
678 | cGiB/100 , cGiB % 100, |
679 | cGB/100, cGB % 100); | |
680 | } | |
cd29a5c8 NB |
681 | return buf; |
682 | } | |
e0d19036 NB |
683 | |
684 | char *human_size_brief(long long bytes) | |
685 | { | |
686 | static char buf[30]; | |
e0d19036 NB |
687 | |
688 | if (bytes < 5000*1024) | |
8f23b0b3 | 689 | snprintf(buf, sizeof(buf), "%ld.%02ldKiB", |
bd526cee | 690 | (long)(bytes>>10), (long)(((bytes&1023)*100+512)/1024) |
e0d19036 NB |
691 | ); |
692 | else if (bytes < 2*1024LL*1024LL*1024LL) | |
8f23b0b3 | 693 | snprintf(buf, sizeof(buf), "%ld.%02ldMiB", |
e0d19036 | 694 | (long)(bytes>>20), |
bd526cee | 695 | (long)((bytes&0xfffff)+0x100000/200)/(0x100000/100) |
e0d19036 NB |
696 | ); |
697 | else | |
8f23b0b3 | 698 | snprintf(buf, sizeof(buf), "%ld.%02ldGiB", |
e0d19036 | 699 | (long)(bytes>>30), |
bd526cee | 700 | (long)(((bytes>>10)&0xfffff)+0x100000/200)/(0x100000/100) |
e0d19036 NB |
701 | ); |
702 | return buf; | |
703 | } | |
e4965ef8 N |
704 | |
705 | void print_r10_layout(int layout) | |
706 | { | |
707 | int near = layout & 255; | |
708 | int far = (layout >> 8) & 255; | |
709 | int offset = (layout&0x10000); | |
710 | char *sep = ""; | |
711 | ||
712 | if (near != 1) { | |
713 | printf("%s near=%d", sep, near); | |
714 | sep = ","; | |
715 | } | |
716 | if (far != 1) | |
717 | printf("%s %s=%d", sep, offset?"offset":"far", far); | |
718 | if (near*far == 1) | |
719 | printf("NO REDUNDANCY"); | |
720 | } | |
435d4ebb | 721 | #endif |
e0d19036 | 722 | |
5f8097be NB |
723 | unsigned long long calc_array_size(int level, int raid_disks, int layout, |
724 | int chunksize, unsigned long long devsize) | |
577e8448 | 725 | { |
e03640bd CA |
726 | if (level == 1) |
727 | return devsize; | |
577e8448 AK |
728 | devsize &= ~(unsigned long long)((chunksize>>9)-1); |
729 | return get_data_disks(level, layout, raid_disks) * devsize; | |
730 | } | |
731 | ||
732 | int get_data_disks(int level, int layout, int raid_disks) | |
5f8097be NB |
733 | { |
734 | int data_disks = 0; | |
735 | switch (level) { | |
ca3b6696 N |
736 | case 0: data_disks = raid_disks; |
737 | break; | |
738 | case 1: data_disks = 1; | |
739 | break; | |
5f8097be | 740 | case 4: |
ca3b6696 N |
741 | case 5: data_disks = raid_disks - 1; |
742 | break; | |
743 | case 6: data_disks = raid_disks - 2; | |
744 | break; | |
5f8097be NB |
745 | case 10: data_disks = raid_disks / (layout & 255) / ((layout>>8)&255); |
746 | break; | |
747 | } | |
577e8448 AK |
748 | |
749 | return data_disks; | |
5f8097be NB |
750 | } |
751 | ||
0e600426 | 752 | #if !defined(MDASSEMBLE) || defined(MDASSEMBLE) && defined(MDASSEMBLE_AUTO) |
e0d19036 NB |
753 | char *get_md_name(int dev) |
754 | { | |
755 | /* find /dev/md%d or /dev/md/%d or make a device /dev/.tmp.md%d */ | |
98c6faba | 756 | /* if dev < 0, want /dev/md/d%d or find mdp in /proc/devices ... */ |
e0d19036 NB |
757 | static char devname[50]; |
758 | struct stat stb; | |
98c6faba | 759 | dev_t rdev; |
dd0781e5 | 760 | char *dn; |
98c6faba NB |
761 | |
762 | if (dev < 0) { | |
dd0781e5 NB |
763 | int mdp = get_mdp_major(); |
764 | if (mdp < 0) return NULL; | |
0df46c2a | 765 | rdev = makedev(mdp, (-1-dev)<<6); |
8f23b0b3 | 766 | snprintf(devname, sizeof(devname), "/dev/md/d%d", -1-dev); |
98c6faba NB |
767 | if (stat(devname, &stb) == 0 |
768 | && (S_IFMT&stb.st_mode) == S_IFBLK | |
769 | && (stb.st_rdev == rdev)) | |
770 | return devname; | |
771 | } else { | |
0df46c2a | 772 | rdev = makedev(MD_MAJOR, dev); |
8f23b0b3 | 773 | snprintf(devname, sizeof(devname), "/dev/md%d", dev); |
98c6faba NB |
774 | if (stat(devname, &stb) == 0 |
775 | && (S_IFMT&stb.st_mode) == S_IFBLK | |
776 | && (stb.st_rdev == rdev)) | |
777 | return devname; | |
778 | ||
8f23b0b3 | 779 | snprintf(devname, sizeof(devname), "/dev/md/%d", dev); |
98c6faba NB |
780 | if (stat(devname, &stb) == 0 |
781 | && (S_IFMT&stb.st_mode) == S_IFBLK | |
782 | && (stb.st_rdev == rdev)) | |
783 | return devname; | |
784 | } | |
16c6fa80 | 785 | dn = map_dev(major(rdev), minor(rdev), 0); |
dd0781e5 NB |
786 | if (dn) |
787 | return dn; | |
8f23b0b3 | 788 | snprintf(devname, sizeof(devname), "/dev/.tmp.md%d", dev); |
e0d19036 | 789 | if (mknod(devname, S_IFBLK | 0600, rdev) == -1) |
dd0781e5 NB |
790 | if (errno != EEXIST) |
791 | return NULL; | |
e0d19036 NB |
792 | |
793 | if (stat(devname, &stb) == 0 | |
794 | && (S_IFMT&stb.st_mode) == S_IFBLK | |
795 | && (stb.st_rdev == rdev)) | |
796 | return devname; | |
797 | unlink(devname); | |
798 | return NULL; | |
799 | } | |
800 | ||
801 | void put_md_name(char *name) | |
802 | { | |
ca3b6696 | 803 | if (strncmp(name, "/dev/.tmp.md", 12) == 0) |
e0d19036 NB |
804 | unlink(name); |
805 | } | |
ea24acd0 | 806 | |
ea24acd0 NB |
807 | int find_free_devnum(int use_partitions) |
808 | { | |
809 | int devnum; | |
810 | for (devnum = 127; devnum != 128; | |
a56fb7ec | 811 | devnum = devnum ? devnum-1 : (1<<20)-1) { |
ea24acd0 NB |
812 | char *dn; |
813 | int _devnum; | |
fb52f245 | 814 | char nbuf[50]; |
ea24acd0 NB |
815 | |
816 | _devnum = use_partitions ? (-1-devnum) : devnum; | |
817 | if (mddev_busy(_devnum)) | |
818 | continue; | |
fb52f245 N |
819 | sprintf(nbuf, "%s%d", use_partitions?"mdp":"md", devnum); |
820 | if (!conf_name_is_free(nbuf)) | |
821 | continue; | |
ea24acd0 NB |
822 | /* make sure it is new to /dev too, at least as a |
823 | * non-standard */ | |
824 | dn = map_dev(dev2major(_devnum), dev2minor(_devnum), 0); | |
825 | if (dn && ! is_standard(dn, NULL)) | |
826 | continue; | |
827 | break; | |
828 | } | |
829 | if (devnum == 128) | |
830 | return NoMdDev; | |
831 | return use_partitions ? (-1-devnum) : devnum; | |
832 | } | |
435d4ebb | 833 | #endif /* !defined(MDASSEMBLE) || defined(MDASSEMBLE) && defined(MDASSEMBLE_AUTO) */ |
f9ce90ba | 834 | |
8b0dabea NB |
835 | int dev_open(char *dev, int flags) |
836 | { | |
837 | /* like 'open', but if 'dev' matches %d:%d, create a temp | |
838 | * block device and open that | |
839 | */ | |
840 | char *e; | |
841 | int fd = -1; | |
842 | char devname[32]; | |
e81cdd9f | 843 | int major; |
8b0dabea | 844 | int minor; |
e81cdd9f NB |
845 | |
846 | if (!dev) return -1; | |
6df6a774 | 847 | flags |= O_DIRECT; |
e81cdd9f NB |
848 | |
849 | major = strtoul(dev, &e, 0); | |
8b0dabea NB |
850 | if (e > dev && *e == ':' && e[1] && |
851 | (minor = strtoul(e+1, &e, 0)) >= 0 && | |
852 | *e == 0) { | |
6df6a774 N |
853 | char *path = map_dev(major, minor, 0); |
854 | if (path) | |
855 | fd = open(path, flags); | |
856 | if (fd < 0) { | |
857 | snprintf(devname, sizeof(devname), "/dev/.tmp.md.%d:%d:%d", | |
858 | (int)getpid(), major, minor); | |
ca3b6696 | 859 | if (mknod(devname, S_IFBLK|0600, makedev(major, minor)) == 0) { |
6df6a774 N |
860 | fd = open(devname, flags); |
861 | unlink(devname); | |
862 | } | |
863 | } | |
864 | if (fd < 0) { | |
865 | snprintf(devname, sizeof(devname), "/tmp/.tmp.md.%d:%d:%d", | |
866 | (int)getpid(), major, minor); | |
ca3b6696 | 867 | if (mknod(devname, S_IFBLK|0600, makedev(major, minor)) == 0) { |
6df6a774 N |
868 | fd = open(devname, flags); |
869 | unlink(devname); | |
870 | } | |
8b0dabea NB |
871 | } |
872 | } else | |
6df6a774 | 873 | fd = open(dev, flags); |
8b0dabea NB |
874 | return fd; |
875 | } | |
f9ce90ba | 876 | |
d998b738 | 877 | int open_dev_flags(int devnum, int flags) |
e8a70c89 N |
878 | { |
879 | char buf[20]; | |
880 | ||
881 | sprintf(buf, "%d:%d", dev2major(devnum), dev2minor(devnum)); | |
d998b738 N |
882 | return dev_open(buf, flags); |
883 | } | |
884 | ||
885 | int open_dev(int devnum) | |
886 | { | |
887 | return open_dev_flags(devnum, O_RDONLY); | |
e8a70c89 N |
888 | } |
889 | ||
a931db9e NB |
890 | int open_dev_excl(int devnum) |
891 | { | |
892 | char buf[20]; | |
893 | int i; | |
7187750e | 894 | int flags = O_RDWR; |
a931db9e NB |
895 | |
896 | sprintf(buf, "%d:%d", dev2major(devnum), dev2minor(devnum)); | |
ca3b6696 | 897 | for (i = 0 ; i < 25 ; i++) { |
7187750e | 898 | int fd = dev_open(buf, flags|O_EXCL); |
a931db9e NB |
899 | if (fd >= 0) |
900 | return fd; | |
7187750e N |
901 | if (errno == EACCES && flags == O_RDWR) { |
902 | flags = O_RDONLY; | |
903 | continue; | |
904 | } | |
a931db9e NB |
905 | if (errno != EBUSY) |
906 | return fd; | |
907 | usleep(200000); | |
908 | } | |
909 | return -1; | |
910 | } | |
911 | ||
9008ed1c N |
912 | int same_dev(char *one, char *two) |
913 | { | |
914 | struct stat st1, st2; | |
915 | if (stat(one, &st1) != 0) | |
916 | return 0; | |
917 | if (stat(two, &st2) != 0) | |
918 | return 0; | |
919 | if ((st1.st_mode & S_IFMT) != S_IFBLK) | |
920 | return 0; | |
921 | if ((st2.st_mode & S_IFMT) != S_IFBLK) | |
922 | return 0; | |
923 | return st1.st_rdev == st2.st_rdev; | |
924 | } | |
925 | ||
a7c6e3fb | 926 | void wait_for(char *dev, int fd) |
a714580e N |
927 | { |
928 | int i; | |
a7c6e3fb N |
929 | struct stat stb_want; |
930 | ||
931 | if (fstat(fd, &stb_want) != 0 || | |
932 | (stb_want.st_mode & S_IFMT) != S_IFBLK) | |
933 | return; | |
a714580e | 934 | |
ca3b6696 | 935 | for (i = 0 ; i < 25 ; i++) { |
a714580e | 936 | struct stat stb; |
a7c6e3fb N |
937 | if (stat(dev, &stb) == 0 && |
938 | (stb.st_mode & S_IFMT) == S_IFBLK && | |
939 | (stb.st_rdev == stb_want.st_rdev)) | |
a714580e N |
940 | return; |
941 | usleep(200000); | |
942 | } | |
436305c6 DW |
943 | if (i == 25) |
944 | dprintf("%s: timeout waiting for %s\n", __func__, dev); | |
a714580e N |
945 | } |
946 | ||
0f22b998 N |
947 | struct superswitch *superlist[] = |
948 | { | |
949 | &super0, &super1, | |
950 | &super_ddf, &super_imsm, | |
0592faeb | 951 | &mbr, &gpt, |
0f22b998 | 952 | NULL }; |
f9ce90ba | 953 | |
ea24acd0 | 954 | #if !defined(MDASSEMBLE) || defined(MDASSEMBLE) && defined(MDASSEMBLE_AUTO) |
f7dd881f | 955 | |
4725bc31 | 956 | struct supertype *super_by_fd(int fd, char **subarrayp) |
f9ce90ba | 957 | { |
1686dc25 NB |
958 | mdu_array_info_t array; |
959 | int vers; | |
960 | int minor; | |
961 | struct supertype *st = NULL; | |
7e0f6979 | 962 | struct mdinfo *sra; |
142cb9e1 | 963 | char *verstr; |
1686dc25 NB |
964 | char version[20]; |
965 | int i; | |
f7e7067b | 966 | char *subarray = NULL; |
5f7e44b2 | 967 | int container = NoMdDev; |
1686dc25 NB |
968 | |
969 | sra = sysfs_read(fd, 0, GET_VERSION); | |
970 | ||
971 | if (sra) { | |
7e0f6979 NB |
972 | vers = sra->array.major_version; |
973 | minor = sra->array.minor_version; | |
142cb9e1 | 974 | verstr = sra->text_version; |
1686dc25 NB |
975 | } else { |
976 | if (ioctl(fd, GET_ARRAY_INFO, &array)) | |
977 | array.major_version = array.minor_version = 0; | |
978 | vers = array.major_version; | |
979 | minor = array.minor_version; | |
142cb9e1 | 980 | verstr = ""; |
6fbba4c9 | 981 | } |
82d9eba6 | 982 | |
1686dc25 NB |
983 | if (vers != -1) { |
984 | sprintf(version, "%d.%d", vers, minor); | |
985 | verstr = version; | |
6fbba4c9 | 986 | } |
3c558363 | 987 | if (minor == -2 && is_subarray(verstr)) { |
f7e7067b | 988 | char *dev = verstr+1; |
5f7e44b2 | 989 | |
f7e7067b | 990 | subarray = strchr(dev, '/'); |
92d49ecf | 991 | if (subarray) { |
f7e7067b | 992 | *subarray++ = '\0'; |
503975b9 | 993 | subarray = xstrdup(subarray); |
92d49ecf | 994 | } |
5f7e44b2 | 995 | container = devname2devnum(dev); |
f7e7067b NB |
996 | if (sra) |
997 | sysfs_free(sra); | |
5f7e44b2 | 998 | sra = sysfs_read(-1, container, GET_VERSION); |
603f24a0 N |
999 | if (sra && sra->text_version[0]) |
1000 | verstr = sra->text_version; | |
1001 | else | |
1002 | verstr = "-no-metadata-"; | |
f7e7067b NB |
1003 | } |
1004 | ||
1005 | for (i = 0; st == NULL && superlist[i] ; i++) | |
1006 | st = superlist[i]->match_metadata_desc(verstr); | |
1686dc25 NB |
1007 | |
1008 | if (sra) | |
1009 | sysfs_free(sra); | |
f7e7067b | 1010 | if (st) { |
3b0896f8 | 1011 | st->sb = NULL; |
1f49fb3a N |
1012 | if (subarrayp) |
1013 | *subarrayp = subarray; | |
5f7e44b2 DW |
1014 | st->container_dev = container; |
1015 | st->devnum = fd2devnum(fd); | |
4725bc31 N |
1016 | } else |
1017 | free(subarray); | |
5f7e44b2 | 1018 | |
82d9eba6 | 1019 | return st; |
f9ce90ba | 1020 | } |
ea24acd0 NB |
1021 | #endif /* !defined(MDASSEMBLE) || defined(MDASSEMBLE) && defined(MDASSEMBLE_AUTO) */ |
1022 | ||
0f0749ad | 1023 | int dev_size_from_id(dev_t id, unsigned long long *size) |
52d5d101 AC |
1024 | { |
1025 | char buf[20]; | |
1026 | int fd; | |
1027 | ||
1028 | sprintf(buf, "%d:%d", major(id), minor(id)); | |
1029 | fd = dev_open(buf, O_RDONLY); | |
1030 | if (fd < 0) | |
1031 | return 0; | |
1032 | if (get_dev_size(fd, NULL, size)) { | |
1033 | close(fd); | |
1034 | return 1; | |
1035 | } | |
1036 | close(fd); | |
1037 | return 0; | |
1038 | } | |
f9ce90ba | 1039 | |
159c3a1a | 1040 | struct supertype *dup_super(struct supertype *orig) |
3da92f27 | 1041 | { |
159c3a1a | 1042 | struct supertype *st; |
1686dc25 | 1043 | |
d2ca6449 NB |
1044 | if (!orig) |
1045 | return orig; | |
503975b9 | 1046 | st = xcalloc(1, sizeof(*st)); |
159c3a1a NB |
1047 | st->ss = orig->ss; |
1048 | st->max_devs = orig->max_devs; | |
1049 | st->minor_version = orig->minor_version; | |
1050 | st->sb = NULL; | |
1051 | st->info = NULL; | |
1052 | return st; | |
3da92f27 NB |
1053 | } |
1054 | ||
54887ad8 | 1055 | struct supertype *guess_super_type(int fd, enum guess_types guess_type) |
f9ce90ba NB |
1056 | { |
1057 | /* try each load_super to find the best match, | |
1058 | * and return the best superswitch | |
1059 | */ | |
82d9eba6 NB |
1060 | struct superswitch *ss; |
1061 | struct supertype *st; | |
f21e18ca | 1062 | time_t besttime = 0; |
570c0542 | 1063 | int bestsuper = -1; |
f9ce90ba NB |
1064 | int i; |
1065 | ||
503975b9 | 1066 | st = xcalloc(1, sizeof(*st)); |
d1d599ea N |
1067 | st->container_dev = NoMdDev; |
1068 | ||
ca3b6696 | 1069 | for (i = 0 ; superlist[i]; i++) { |
f9ce90ba NB |
1070 | int rv; |
1071 | ss = superlist[i]; | |
54887ad8 N |
1072 | if (guess_type == guess_array && ss->add_to_super == NULL) |
1073 | continue; | |
1074 | if (guess_type == guess_partitions && ss->add_to_super != NULL) | |
1075 | continue; | |
ef609477 | 1076 | memset(st, 0, sizeof(*st)); |
df3346e6 | 1077 | st->ignore_hw_compat = 1; |
3da92f27 | 1078 | rv = ss->load_super(st, fd, NULL); |
570c0542 NB |
1079 | if (rv == 0) { |
1080 | struct mdinfo info; | |
a5d85af7 | 1081 | st->ss->getinfo_super(st, &info, NULL); |
570c0542 NB |
1082 | if (bestsuper == -1 || |
1083 | besttime < info.array.ctime) { | |
1084 | bestsuper = i; | |
1085 | besttime = info.array.ctime; | |
570c0542 | 1086 | } |
3da92f27 | 1087 | ss->free_super(st); |
570c0542 NB |
1088 | } |
1089 | } | |
1090 | if (bestsuper != -1) { | |
1091 | int rv; | |
ef609477 | 1092 | memset(st, 0, sizeof(*st)); |
df3346e6 | 1093 | st->ignore_hw_compat = 1; |
3da92f27 | 1094 | rv = superlist[bestsuper]->load_super(st, fd, NULL); |
f9ce90ba | 1095 | if (rv == 0) { |
5e747af2 | 1096 | superlist[bestsuper]->free_super(st); |
df3346e6 | 1097 | st->ignore_hw_compat = 0; |
82d9eba6 | 1098 | return st; |
f9ce90ba NB |
1099 | } |
1100 | } | |
570c0542 | 1101 | free(st); |
f9ce90ba NB |
1102 | return NULL; |
1103 | } | |
fe6729fa | 1104 | |
beae1dfe NB |
1105 | /* Return size of device in bytes */ |
1106 | int get_dev_size(int fd, char *dname, unsigned long long *sizep) | |
1107 | { | |
1108 | unsigned long long ldsize; | |
c2c9bb6f NB |
1109 | struct stat st; |
1110 | ||
1111 | if (fstat(fd, &st) != -1 && S_ISREG(st.st_mode)) | |
1112 | ldsize = (unsigned long long)st.st_size; | |
1113 | else | |
beae1dfe NB |
1114 | #ifdef BLKGETSIZE64 |
1115 | if (ioctl(fd, BLKGETSIZE64, &ldsize) != 0) | |
1116 | #endif | |
1117 | { | |
1118 | unsigned long dsize; | |
1119 | if (ioctl(fd, BLKGETSIZE, &dsize) == 0) { | |
1120 | ldsize = dsize; | |
1121 | ldsize <<= 9; | |
1122 | } else { | |
1123 | if (dname) | |
e7b84f9d | 1124 | pr_err("Cannot get size of %s: %s\b", |
beae1dfe NB |
1125 | dname, strerror(errno)); |
1126 | return 0; | |
1127 | } | |
1128 | } | |
1129 | *sizep = ldsize; | |
1130 | return 1; | |
1131 | } | |
8fac0577 | 1132 | |
3a371610 N |
1133 | /* Return true if this can only be a container, not a member device. |
1134 | * i.e. is and md device and size is zero | |
1135 | */ | |
1136 | int must_be_container(int fd) | |
1137 | { | |
1138 | unsigned long long size; | |
1139 | if (md_get_version(fd) < 0) | |
1140 | return 0; | |
1141 | if (get_dev_size(fd, NULL, &size) == 0) | |
1142 | return 1; | |
1143 | if (size == 0) | |
1144 | return 1; | |
1145 | return 0; | |
1146 | } | |
034b203a TM |
1147 | |
1148 | /* Sets endofpart parameter to the last block used by the last GPT partition on the device. | |
1149 | * Returns: 1 if successful | |
1150 | * -1 for unknown partition type | |
1151 | * 0 for other errors | |
1152 | */ | |
1153 | static int get_gpt_last_partition_end(int fd, unsigned long long *endofpart) | |
1154 | { | |
056b331e | 1155 | struct GPT gpt; |
034b203a | 1156 | unsigned char empty_gpt_entry[16]= {0}; |
db7fdfe4 JS |
1157 | struct GPT_part_entry *part; |
1158 | char buf[512]; | |
034b203a TM |
1159 | unsigned long long curr_part_end; |
1160 | unsigned all_partitions, entry_size; | |
f21e18ca | 1161 | unsigned part_nr; |
034b203a TM |
1162 | |
1163 | *endofpart = 0; | |
1164 | ||
056b331e | 1165 | BUILD_BUG_ON(sizeof(gpt) != 512); |
73e658d8 | 1166 | /* skip protective MBR */ |
034b203a | 1167 | lseek(fd, 512, SEEK_SET); |
73e658d8 | 1168 | /* read GPT header */ |
056b331e | 1169 | if (read(fd, &gpt, 512) != 512) |
034b203a TM |
1170 | return 0; |
1171 | ||
1172 | /* get the number of partition entries and the entry size */ | |
056b331e N |
1173 | all_partitions = __le32_to_cpu(gpt.part_cnt); |
1174 | entry_size = __le32_to_cpu(gpt.part_size); | |
034b203a TM |
1175 | |
1176 | /* Check GPT signature*/ | |
056b331e | 1177 | if (gpt.magic != GPT_SIGNATURE_MAGIC) |
034b203a TM |
1178 | return -1; |
1179 | ||
1180 | /* sanity checks */ | |
1181 | if (all_partitions > 1024 || | |
db7fdfe4 | 1182 | entry_size > sizeof(buf)) |
034b203a TM |
1183 | return -1; |
1184 | ||
db7fdfe4 JS |
1185 | part = (struct GPT_part_entry *)buf; |
1186 | ||
ca3b6696 | 1187 | for (part_nr = 0; part_nr < all_partitions; part_nr++) { |
73e658d8 | 1188 | /* read partition entry */ |
db7fdfe4 | 1189 | if (read(fd, buf, entry_size) != (ssize_t)entry_size) |
73e658d8 LB |
1190 | return 0; |
1191 | ||
034b203a | 1192 | /* is this valid partition? */ |
db7fdfe4 | 1193 | if (memcmp(part->type_guid, empty_gpt_entry, 16) != 0) { |
034b203a | 1194 | /* check the last lba for the current partition */ |
db7fdfe4 | 1195 | curr_part_end = __le64_to_cpu(part->ending_lba); |
034b203a TM |
1196 | if (curr_part_end > *endofpart) |
1197 | *endofpart = curr_part_end; | |
1198 | } | |
1199 | ||
034b203a TM |
1200 | } |
1201 | return 1; | |
1202 | } | |
1203 | ||
1204 | /* Sets endofpart parameter to the last block used by the last partition on the device. | |
1205 | * Returns: 1 if successful | |
1206 | * -1 for unknown partition type | |
1207 | * 0 for other errors | |
1208 | */ | |
1209 | static int get_last_partition_end(int fd, unsigned long long *endofpart) | |
1210 | { | |
056b331e | 1211 | struct MBR boot_sect; |
034b203a TM |
1212 | struct MBR_part_record *part; |
1213 | unsigned long long curr_part_end; | |
f21e18ca | 1214 | unsigned part_nr; |
034b203a TM |
1215 | int retval = 0; |
1216 | ||
1217 | *endofpart = 0; | |
1218 | ||
056b331e | 1219 | BUILD_BUG_ON(sizeof(boot_sect) != 512); |
034b203a TM |
1220 | /* read MBR */ |
1221 | lseek(fd, 0, 0); | |
056b331e | 1222 | if (read(fd, &boot_sect, 512) != 512) |
034b203a TM |
1223 | goto abort; |
1224 | ||
1225 | /* check MBP signature */ | |
056b331e | 1226 | if (boot_sect.magic == MBR_SIGNATURE_MAGIC) { |
034b203a TM |
1227 | retval = 1; |
1228 | /* found the correct signature */ | |
056b331e | 1229 | part = boot_sect.parts; |
034b203a | 1230 | |
ca3b6696 | 1231 | for (part_nr = 0; part_nr < MBR_PARTITIONS; part_nr++) { |
034b203a TM |
1232 | /* check for GPT type */ |
1233 | if (part->part_type == MBR_GPT_PARTITION_TYPE) { | |
1234 | retval = get_gpt_last_partition_end(fd, endofpart); | |
1235 | break; | |
1236 | } | |
1237 | /* check the last used lba for the current partition */ | |
1238 | curr_part_end = __le32_to_cpu(part->first_sect_lba) + | |
1239 | __le32_to_cpu(part->blocks_num); | |
1240 | if (curr_part_end > *endofpart) | |
1241 | *endofpart = curr_part_end; | |
1242 | ||
1243 | part++; | |
1244 | } | |
1245 | } else { | |
1246 | /* Unknown partition table */ | |
1247 | retval = -1; | |
1248 | } | |
1249 | abort: | |
1250 | return retval; | |
1251 | } | |
1252 | ||
53ed6ac3 KW |
1253 | int check_partitions(int fd, char *dname, unsigned long long freesize, |
1254 | unsigned long long size) | |
034b203a TM |
1255 | { |
1256 | /* | |
1257 | * Check where the last partition ends | |
1258 | */ | |
1259 | unsigned long long endofpart; | |
1260 | int ret; | |
1261 | ||
1262 | if ((ret = get_last_partition_end(fd, &endofpart)) > 0) { | |
1263 | /* There appears to be a partition table here */ | |
1264 | if (freesize == 0) { | |
1265 | /* partitions will not be visible in new device */ | |
e7b84f9d N |
1266 | pr_err("partition table exists on %s but will be lost or\n" |
1267 | " meaningless after creating array\n", | |
1268 | dname); | |
034b203a TM |
1269 | return 1; |
1270 | } else if (endofpart > freesize) { | |
1271 | /* last partition overlaps metadata */ | |
e7b84f9d N |
1272 | pr_err("metadata will over-write last partition on %s.\n", |
1273 | dname); | |
034b203a | 1274 | return 1; |
53ed6ac3 KW |
1275 | } else if (size && endofpart > size) { |
1276 | /* partitions will be truncated in new device */ | |
e7b84f9d N |
1277 | pr_err("array size is too small to cover all partitions on %s.\n", |
1278 | dname); | |
53ed6ac3 | 1279 | return 1; |
034b203a TM |
1280 | } |
1281 | } | |
1282 | return 0; | |
1283 | } | |
1284 | ||
8382f19b NB |
1285 | void get_one_disk(int mdfd, mdu_array_info_t *ainf, mdu_disk_info_t *disk) |
1286 | { | |
1287 | int d; | |
9e6d9291 | 1288 | |
8382f19b | 1289 | ioctl(mdfd, GET_ARRAY_INFO, ainf); |
480f3566 | 1290 | for (d = 0 ; d < MAX_DISKS ; d++) { |
9e6d9291 N |
1291 | if (ioctl(mdfd, GET_DISK_INFO, disk) == 0 && |
1292 | (disk->major || disk->minor)) | |
8382f19b | 1293 | return; |
9e6d9291 | 1294 | } |
8382f19b | 1295 | } |
63152c1b | 1296 | |
a322f70c DW |
1297 | int open_container(int fd) |
1298 | { | |
1299 | /* 'fd' is a block device. Find out if it is in use | |
1300 | * by a container, and return an open fd on that container. | |
1301 | */ | |
1302 | char path[256]; | |
1303 | char *e; | |
1304 | DIR *dir; | |
1305 | struct dirent *de; | |
1306 | int dfd, n; | |
1307 | char buf[200]; | |
1308 | int major, minor; | |
1309 | struct stat st; | |
1310 | ||
1311 | if (fstat(fd, &st) != 0) | |
1312 | return -1; | |
1313 | sprintf(path, "/sys/dev/block/%d:%d/holders", | |
1314 | (int)major(st.st_rdev), (int)minor(st.st_rdev)); | |
1315 | e = path + strlen(path); | |
1316 | ||
1317 | dir = opendir(path); | |
1318 | if (!dir) | |
1319 | return -1; | |
1320 | while ((de = readdir(dir))) { | |
1321 | if (de->d_ino == 0) | |
1322 | continue; | |
1323 | if (de->d_name[0] == '.') | |
1324 | continue; | |
1325 | sprintf(e, "/%s/dev", de->d_name); | |
1326 | dfd = open(path, O_RDONLY); | |
1327 | if (dfd < 0) | |
1328 | continue; | |
1329 | n = read(dfd, buf, sizeof(buf)); | |
1330 | close(dfd); | |
f21e18ca | 1331 | if (n <= 0 || (unsigned)n >= sizeof(buf)) |
a322f70c DW |
1332 | continue; |
1333 | buf[n] = 0; | |
1334 | if (sscanf(buf, "%d:%d", &major, &minor) != 2) | |
1335 | continue; | |
1336 | sprintf(buf, "%d:%d", major, minor); | |
1337 | dfd = dev_open(buf, O_RDONLY); | |
1338 | if (dfd >= 0) { | |
1339 | closedir(dir); | |
1340 | return dfd; | |
1341 | } | |
1342 | } | |
355726fa | 1343 | closedir(dir); |
a322f70c DW |
1344 | return -1; |
1345 | } | |
1346 | ||
33414a01 DW |
1347 | struct superswitch *version_to_superswitch(char *vers) |
1348 | { | |
1349 | int i; | |
1350 | ||
1351 | for (i = 0; superlist[i]; i++) { | |
1352 | struct superswitch *ss = superlist[i]; | |
1353 | ||
1354 | if (strcmp(vers, ss->name) == 0) | |
1355 | return ss; | |
1356 | } | |
1357 | ||
1358 | return NULL; | |
1359 | } | |
1360 | ||
1361 | int is_container_member(struct mdstat_ent *mdstat, char *container) | |
1362 | { | |
1363 | if (mdstat->metadata_version == NULL || | |
1364 | strncmp(mdstat->metadata_version, "external:", 9) != 0 || | |
1365 | !is_subarray(mdstat->metadata_version+9) || | |
1366 | strncmp(mdstat->metadata_version+10, container, strlen(container)) != 0 || | |
1367 | mdstat->metadata_version[10+strlen(container)] != '/') | |
1368 | return 0; | |
1369 | ||
1370 | return 1; | |
1371 | } | |
1372 | ||
1373 | int is_subarray_active(char *subarray, char *container) | |
1374 | { | |
1375 | struct mdstat_ent *mdstat = mdstat_read(0, 0); | |
1376 | struct mdstat_ent *ent; | |
1377 | ||
e5408a32 DW |
1378 | for (ent = mdstat; ent; ent = ent->next) |
1379 | if (is_container_member(ent, container)) | |
e5e5d7ce | 1380 | if (strcmp(to_subarray(ent, container), subarray) == 0) |
33414a01 | 1381 | break; |
33414a01 DW |
1382 | |
1383 | free_mdstat(mdstat); | |
1384 | ||
1385 | return ent != NULL; | |
1386 | } | |
1387 | ||
1388 | /* open_subarray - opens a subarray in a container | |
1389 | * @dev: container device name | |
feab51f8 | 1390 | * @st: empty supertype |
33414a01 DW |
1391 | * @quiet: block reporting errors flag |
1392 | * | |
1393 | * On success returns an fd to a container and fills in *st | |
1394 | */ | |
feab51f8 | 1395 | int open_subarray(char *dev, char *subarray, struct supertype *st, int quiet) |
33414a01 DW |
1396 | { |
1397 | struct mdinfo *mdi; | |
a951a4f7 | 1398 | struct mdinfo *info; |
33414a01 DW |
1399 | int fd, err = 1; |
1400 | ||
1401 | fd = open(dev, O_RDWR|O_EXCL); | |
1402 | if (fd < 0) { | |
1403 | if (!quiet) | |
e7b84f9d | 1404 | pr_err("Couldn't open %s, aborting\n", |
33414a01 | 1405 | dev); |
b990032d | 1406 | return -1; |
33414a01 DW |
1407 | } |
1408 | ||
1409 | st->devnum = fd2devnum(fd); | |
1410 | if (st->devnum == NoMdDev) { | |
1411 | if (!quiet) | |
e7b84f9d N |
1412 | pr_err("Failed to determine device number for %s\n", |
1413 | dev); | |
33414a01 DW |
1414 | goto close_fd; |
1415 | } | |
1416 | ||
1417 | mdi = sysfs_read(fd, st->devnum, GET_VERSION|GET_LEVEL); | |
1418 | if (!mdi) { | |
1419 | if (!quiet) | |
e7b84f9d | 1420 | pr_err("Failed to read sysfs for %s\n", |
33414a01 DW |
1421 | dev); |
1422 | goto close_fd; | |
1423 | } | |
1424 | ||
1425 | if (mdi->array.level != UnSet) { | |
1426 | if (!quiet) | |
e7b84f9d | 1427 | pr_err("%s is not a container\n", dev); |
33414a01 DW |
1428 | goto free_sysfs; |
1429 | } | |
1430 | ||
1431 | st->ss = version_to_superswitch(mdi->text_version); | |
1432 | if (!st->ss) { | |
1433 | if (!quiet) | |
e7b84f9d N |
1434 | pr_err("Operation not supported for %s metadata\n", |
1435 | mdi->text_version); | |
33414a01 DW |
1436 | goto free_sysfs; |
1437 | } | |
1438 | ||
1439 | st->devname = devnum2devname(st->devnum); | |
1440 | if (!st->devname) { | |
1441 | if (!quiet) | |
e7b84f9d | 1442 | pr_err("Failed to allocate device name\n"); |
33414a01 DW |
1443 | goto free_sysfs; |
1444 | } | |
1445 | ||
db20d413 | 1446 | if (!st->ss->load_container) { |
33414a01 | 1447 | if (!quiet) |
e7b84f9d | 1448 | pr_err("%s is not a container\n", dev); |
33414a01 DW |
1449 | goto free_name; |
1450 | } | |
1451 | ||
db20d413 | 1452 | if (st->ss->load_container(st, fd, NULL)) { |
33414a01 | 1453 | if (!quiet) |
e7b84f9d | 1454 | pr_err("Failed to load metadata for %s\n", |
db20d413 N |
1455 | dev); |
1456 | goto free_name; | |
33414a01 DW |
1457 | } |
1458 | ||
a951a4f7 N |
1459 | info = st->ss->container_content(st, subarray); |
1460 | if (!info) { | |
1461 | if (!quiet) | |
e7b84f9d | 1462 | pr_err("Failed to find subarray-%s in %s\n", |
a951a4f7 N |
1463 | subarray, dev); |
1464 | goto free_super; | |
1465 | } | |
1466 | free(info); | |
1467 | ||
33414a01 DW |
1468 | err = 0; |
1469 | ||
1470 | free_super: | |
1471 | if (err) | |
1472 | st->ss->free_super(st); | |
1473 | free_name: | |
1474 | if (err) | |
1475 | free(st->devname); | |
1476 | free_sysfs: | |
1477 | sysfs_free(mdi); | |
1478 | close_fd: | |
1479 | if (err) | |
1480 | close(fd); | |
1481 | ||
1482 | if (err) | |
1483 | return -1; | |
1484 | else | |
1485 | return fd; | |
1486 | } | |
1487 | ||
7801ac20 N |
1488 | int add_disk(int mdfd, struct supertype *st, |
1489 | struct mdinfo *sra, struct mdinfo *info) | |
1490 | { | |
1491 | /* Add a device to an array, in one of 2 ways. */ | |
1492 | int rv; | |
1493 | #ifndef MDASSEMBLE | |
1494 | if (st->ss->external) { | |
d23534e4 DW |
1495 | if (info->disk.state & (1<<MD_DISK_SYNC)) |
1496 | info->recovery_start = MaxSector; | |
1497 | else | |
1498 | info->recovery_start = 0; | |
2904b26f | 1499 | rv = sysfs_add_disk(sra, info, 0); |
7801ac20 N |
1500 | if (! rv) { |
1501 | struct mdinfo *sd2; | |
f35f2525 N |
1502 | for (sd2 = sra->devs; sd2; sd2=sd2->next) |
1503 | if (sd2 == info) | |
1504 | break; | |
1505 | if (sd2 == NULL) { | |
503975b9 | 1506 | sd2 = xmalloc(sizeof(*sd2)); |
f35f2525 N |
1507 | *sd2 = *info; |
1508 | sd2->next = sra->devs; | |
1509 | sra->devs = sd2; | |
1510 | } | |
7801ac20 N |
1511 | } |
1512 | } else | |
1513 | #endif | |
1514 | rv = ioctl(mdfd, ADD_NEW_DISK, &info->disk); | |
1515 | return rv; | |
1516 | } | |
1517 | ||
de6ae750 N |
1518 | int remove_disk(int mdfd, struct supertype *st, |
1519 | struct mdinfo *sra, struct mdinfo *info) | |
1520 | { | |
1521 | int rv; | |
1522 | /* Remove the disk given by 'info' from the array */ | |
1523 | #ifndef MDASSEMBLE | |
1524 | if (st->ss->external) | |
1525 | rv = sysfs_set_str(sra, info, "slot", "none"); | |
1526 | else | |
1527 | #endif | |
1528 | rv = ioctl(mdfd, HOT_REMOVE_DISK, makedev(info->disk.major, | |
1529 | info->disk.minor)); | |
1530 | return rv; | |
1531 | } | |
1532 | ||
f35f2525 N |
1533 | int set_array_info(int mdfd, struct supertype *st, struct mdinfo *info) |
1534 | { | |
1535 | /* Initialise kernel's knowledge of array. | |
1536 | * This varies between externally managed arrays | |
1537 | * and older kernels | |
1538 | */ | |
1539 | int vers = md_get_version(mdfd); | |
1540 | int rv; | |
1541 | ||
1542 | #ifndef MDASSEMBLE | |
1543 | if (st->ss->external) | |
1544 | rv = sysfs_set_array(info, vers); | |
1545 | else | |
1546 | #endif | |
1547 | if ((vers % 100) >= 1) { /* can use different versions */ | |
1548 | mdu_array_info_t inf; | |
1549 | memset(&inf, 0, sizeof(inf)); | |
1550 | inf.major_version = info->array.major_version; | |
1551 | inf.minor_version = info->array.minor_version; | |
1552 | rv = ioctl(mdfd, SET_ARRAY_INFO, &inf); | |
1553 | } else | |
1554 | rv = ioctl(mdfd, SET_ARRAY_INFO, NULL); | |
1555 | return rv; | |
1556 | } | |
1557 | ||
1e5c6983 DW |
1558 | unsigned long long min_recovery_start(struct mdinfo *array) |
1559 | { | |
1560 | /* find the minimum recovery_start in an array for metadata | |
1561 | * formats that only record per-array recovery progress instead | |
1562 | * of per-device | |
1563 | */ | |
1564 | unsigned long long recovery_start = MaxSector; | |
1565 | struct mdinfo *d; | |
1566 | ||
1567 | for (d = array->devs; d; d = d->next) | |
1568 | recovery_start = min(recovery_start, d->recovery_start); | |
1569 | ||
1570 | return recovery_start; | |
1571 | } | |
1572 | ||
24f6f99b | 1573 | int mdmon_pid(int devnum) |
a931db9e NB |
1574 | { |
1575 | char path[100]; | |
1576 | char pid[10]; | |
1577 | int fd; | |
1578 | int n; | |
10013317 PHC |
1579 | char *devname = devnum2devname(devnum); |
1580 | ||
753cf905 | 1581 | sprintf(path, "%s/%s.pid", MDMON_DIR, devname); |
10013317 PHC |
1582 | free(devname); |
1583 | ||
24f6f99b | 1584 | fd = open(path, O_RDONLY | O_NOATIME, 0); |
a931db9e NB |
1585 | |
1586 | if (fd < 0) | |
cf556303 | 1587 | return -1; |
a931db9e NB |
1588 | n = read(fd, pid, 9); |
1589 | close(fd); | |
1590 | if (n <= 0) | |
cf556303 | 1591 | return -1; |
24f6f99b | 1592 | return atoi(pid); |
a931db9e NB |
1593 | } |
1594 | ||
24f6f99b | 1595 | int mdmon_running(int devnum) |
a931db9e | 1596 | { |
24f6f99b N |
1597 | int pid = mdmon_pid(devnum); |
1598 | if (pid <= 0) | |
a931db9e | 1599 | return 0; |
24f6f99b | 1600 | if (kill(pid, 0) == 0) |
a931db9e NB |
1601 | return 1; |
1602 | return 0; | |
1603 | } | |
1604 | ||
8850ee3e N |
1605 | int start_mdmon(int devnum) |
1606 | { | |
1913c325 | 1607 | int i, skipped; |
44d2e365 | 1608 | int len; |
ca3b6696 | 1609 | pid_t pid; |
9fe32043 | 1610 | int status; |
44d2e365 N |
1611 | char pathbuf[1024]; |
1612 | char *paths[4] = { | |
1613 | pathbuf, | |
1614 | "/sbin/mdmon", | |
1615 | "mdmon", | |
1616 | NULL | |
1617 | }; | |
8850ee3e | 1618 | |
40ebbb9c | 1619 | if (check_env("MDADM_NO_MDMON")) |
8850ee3e N |
1620 | return 0; |
1621 | ||
9cf014ec | 1622 | len = readlink("/proc/self/exe", pathbuf, sizeof(pathbuf)-1); |
44d2e365 N |
1623 | if (len > 0) { |
1624 | char *sl; | |
1625 | pathbuf[len] = 0; | |
1626 | sl = strrchr(pathbuf, '/'); | |
1627 | if (sl) | |
1628 | sl++; | |
1629 | else | |
1630 | sl = pathbuf; | |
1631 | strcpy(sl, "mdmon"); | |
1632 | } else | |
1633 | pathbuf[0] = '\0'; | |
1634 | ||
8850ee3e N |
1635 | switch(fork()) { |
1636 | case 0: | |
1637 | /* FIXME yuk. CLOSE_EXEC?? */ | |
1913c325 | 1638 | skipped = 0; |
ca3b6696 | 1639 | for (i = 3; skipped < 20; i++) |
1913c325 N |
1640 | if (close(i) < 0) |
1641 | skipped++; | |
1642 | else | |
1643 | skipped = 0; | |
1644 | ||
ca3b6696 | 1645 | for (i = 0; paths[i]; i++) |
a0963a86 JS |
1646 | if (paths[i][0]) { |
1647 | if (__offroot) { | |
1648 | execl(paths[i], "mdmon", "--offroot", | |
1649 | devnum2devname(devnum), | |
1650 | NULL); | |
1651 | } else { | |
1652 | execl(paths[i], "mdmon", | |
1653 | devnum2devname(devnum), | |
1654 | NULL); | |
1655 | } | |
1656 | } | |
8850ee3e | 1657 | exit(1); |
e7b84f9d | 1658 | case -1: pr_err("cannot run mdmon. " |
8850ee3e N |
1659 | "Array remains readonly\n"); |
1660 | return -1; | |
9fe32043 N |
1661 | default: /* parent - good */ |
1662 | pid = wait(&status); | |
1663 | if (pid < 0 || status != 0) | |
1664 | return -1; | |
8850ee3e N |
1665 | } |
1666 | return 0; | |
1667 | } | |
1668 | ||
40ebbb9c | 1669 | int check_env(char *name) |
5dcfcb71 | 1670 | { |
40ebbb9c | 1671 | char *val = getenv(name); |
5dcfcb71 DW |
1672 | |
1673 | if (val && atoi(val) == 1) | |
1674 | return 1; | |
1675 | ||
1676 | return 0; | |
1677 | } | |
1678 | ||
148acb7b DW |
1679 | __u32 random32(void) |
1680 | { | |
1681 | __u32 rv; | |
1682 | int rfd = open("/dev/urandom", O_RDONLY); | |
1683 | if (rfd < 0 || read(rfd, &rv, 4) != 4) | |
1684 | rv = random(); | |
1685 | if (rfd >= 0) | |
1686 | close(rfd); | |
1687 | return rv; | |
1688 | } | |
1689 | ||
0e600426 | 1690 | #ifndef MDASSEMBLE |
edd8d13c NB |
1691 | int flush_metadata_updates(struct supertype *st) |
1692 | { | |
1693 | int sfd; | |
1694 | if (!st->updates) { | |
1695 | st->update_tail = NULL; | |
1696 | return -1; | |
1697 | } | |
1698 | ||
1699 | sfd = connect_monitor(devnum2devname(st->container_dev)); | |
1700 | if (sfd < 0) | |
1701 | return -1; | |
1702 | ||
1703 | while (st->updates) { | |
1704 | struct metadata_update *mu = st->updates; | |
1705 | st->updates = mu->next; | |
1706 | ||
1707 | send_message(sfd, mu, 0); | |
1708 | wait_reply(sfd, 0); | |
1709 | free(mu->buf); | |
1710 | free(mu); | |
1711 | } | |
1712 | ack(sfd, 0); | |
1713 | wait_reply(sfd, 0); | |
1714 | close(sfd); | |
1715 | st->update_tail = NULL; | |
1716 | return 0; | |
1717 | } | |
1718 | ||
1719 | void append_metadata_update(struct supertype *st, void *buf, int len) | |
1720 | { | |
1721 | ||
503975b9 | 1722 | struct metadata_update *mu = xmalloc(sizeof(*mu)); |
edd8d13c NB |
1723 | |
1724 | mu->buf = buf; | |
1725 | mu->len = len; | |
1726 | mu->space = NULL; | |
cb23f1f4 | 1727 | mu->space_list = NULL; |
edd8d13c NB |
1728 | mu->next = NULL; |
1729 | *st->update_tail = mu; | |
1730 | st->update_tail = &mu->next; | |
1731 | } | |
0e600426 | 1732 | #endif /* MDASSEMBLE */ |
a931db9e | 1733 | |
fe6729fa NB |
1734 | #ifdef __TINYC__ |
1735 | /* tinyc doesn't optimize this check in ioctl.h out ... */ | |
1736 | unsigned int __invalid_size_argument_for_IOC = 0; | |
1737 | #endif | |
1738 | ||
6d11ec6f AK |
1739 | int experimental(void) |
1740 | { | |
1741 | if (check_env("MDADM_EXPERIMENTAL")) | |
1742 | return 1; | |
1743 | else { | |
e7b84f9d | 1744 | pr_err("To use this feature MDADM_EXPERIMENTAL" |
65c83a80 | 1745 | " environment variable has to be defined.\n"); |
6d11ec6f AK |
1746 | return 0; |
1747 | } | |
1748 | } | |
1749 | ||
326727d9 AC |
1750 | /* Pick all spares matching given criteria from a container |
1751 | * if min_size == 0 do not check size | |
1752 | * if domlist == NULL do not check domains | |
1753 | * if spare_group given add it to domains of each spare | |
1754 | * metadata allows to test domains using metadata of destination array */ | |
1755 | struct mdinfo *container_choose_spares(struct supertype *st, | |
1756 | unsigned long long min_size, | |
1757 | struct domainlist *domlist, | |
1758 | char *spare_group, | |
1759 | const char *metadata, int get_one) | |
1760 | { | |
1761 | struct mdinfo *d, **dp, *disks = NULL; | |
1762 | ||
1763 | /* get list of all disks in container */ | |
1764 | if (st->ss->getinfo_super_disks) | |
1765 | disks = st->ss->getinfo_super_disks(st); | |
1766 | ||
1767 | if (!disks) | |
1768 | return disks; | |
1769 | /* find spare devices on the list */ | |
1770 | dp = &disks->devs; | |
1771 | disks->array.spare_disks = 0; | |
1772 | while (*dp) { | |
1773 | int found = 0; | |
1774 | d = *dp; | |
1775 | if (d->disk.state == 0) { | |
1776 | /* check if size is acceptable */ | |
1777 | unsigned long long dev_size; | |
1778 | dev_t dev = makedev(d->disk.major,d->disk.minor); | |
1779 | ||
1780 | if (!min_size || | |
1781 | (dev_size_from_id(dev, &dev_size) && | |
1782 | dev_size >= min_size)) | |
1783 | found = 1; | |
1784 | /* check if domain matches */ | |
1785 | if (found && domlist) { | |
1786 | struct dev_policy *pol = devnum_policy(dev); | |
1787 | if (spare_group) | |
1788 | pol_add(&pol, pol_domain, | |
1789 | spare_group, NULL); | |
e5508b36 | 1790 | if (domain_test(domlist, pol, metadata) != 1) |
326727d9 AC |
1791 | found = 0; |
1792 | dev_policy_free(pol); | |
1793 | } | |
1794 | } | |
1795 | if (found) { | |
1796 | dp = &d->next; | |
1797 | disks->array.spare_disks++; | |
1798 | if (get_one) { | |
1799 | sysfs_free(*dp); | |
1800 | d->next = NULL; | |
1801 | } | |
1802 | } else { | |
1803 | *dp = d->next; | |
1804 | d->next = NULL; | |
1805 | sysfs_free(d); | |
1806 | } | |
1807 | } | |
1808 | return disks; | |
1809 | } |