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