]>
Commit | Line | Data |
---|---|---|
1 | /* | |
2 | * mdadm - manage Linux "md" devices aka RAID arrays. | |
3 | * | |
4 | * Copyright (C) 2001-2013 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 "md_u.h" | |
28 | #include <dirent.h> | |
29 | ||
30 | static int cmpstringp(const void *p1, const void *p2) | |
31 | { | |
32 | return strcmp(* (char * const *) p1, * (char * const *) p2); | |
33 | } | |
34 | ||
35 | static int add_device(const char *dev, char ***p_devices, | |
36 | int *p_max_devices, int n_devices) | |
37 | { | |
38 | if (n_devices + 1 >= *p_max_devices) { | |
39 | *p_max_devices += 16; | |
40 | *p_devices = xrealloc(*p_devices, *p_max_devices * | |
41 | sizeof(**p_devices)); | |
42 | if (!*p_devices) { | |
43 | *p_max_devices = 0; | |
44 | return 0; | |
45 | } | |
46 | }; | |
47 | (*p_devices)[n_devices] = xstrdup(dev); | |
48 | return n_devices + 1; | |
49 | } | |
50 | ||
51 | int Detail(char *dev, struct context *c) | |
52 | { | |
53 | /* | |
54 | * Print out details for an md array by using | |
55 | * GET_ARRAY_INFO and GET_DISK_INFO ioctl calls | |
56 | */ | |
57 | ||
58 | int fd = open(dev, O_RDONLY); | |
59 | int vers; | |
60 | mdu_array_info_t array; | |
61 | mdu_disk_info_t *disks; | |
62 | int next; | |
63 | int d; | |
64 | time_t atime; | |
65 | char *str; | |
66 | char **devices = NULL; | |
67 | int max_devices = 0, n_devices = 0; | |
68 | int spares = 0; | |
69 | struct stat stb; | |
70 | int is_26 = get_linux_version() >= 2006000; | |
71 | int is_rebuilding = 0; | |
72 | int failed = 0; | |
73 | struct supertype *st; | |
74 | char *subarray = NULL; | |
75 | int max_disks = MD_SB_DISKS; /* just a default */ | |
76 | struct mdinfo *info = NULL; | |
77 | struct mdinfo *sra; | |
78 | struct mdinfo *subdev; | |
79 | char *member = NULL; | |
80 | char *container = NULL; | |
81 | ||
82 | int rv = c->test ? 4 : 1; | |
83 | int avail_disks = 0; | |
84 | char *avail = NULL; | |
85 | int external; | |
86 | int inactive; | |
87 | ||
88 | if (fd < 0) { | |
89 | pr_err("cannot open %s: %s\n", | |
90 | dev, strerror(errno)); | |
91 | return rv; | |
92 | } | |
93 | vers = md_get_version(fd); | |
94 | if (vers < 0) { | |
95 | pr_err("%s does not appear to be an md device\n", | |
96 | dev); | |
97 | close(fd); | |
98 | return rv; | |
99 | } | |
100 | if (vers < 9000) { | |
101 | pr_err("cannot get detail for md device %s: driver version too old.\n", | |
102 | dev); | |
103 | close(fd); | |
104 | return rv; | |
105 | } | |
106 | sra = sysfs_read(fd, NULL, GET_VERSION|GET_DEVS); | |
107 | external = (sra != NULL && sra->array.major_version == -1 | |
108 | && sra->array.minor_version == -2); | |
109 | st = super_by_fd(fd, &subarray); | |
110 | if (ioctl(fd, GET_ARRAY_INFO, &array) == 0) { | |
111 | inactive = 0; | |
112 | } else if (errno == ENODEV && sra) { | |
113 | array = sra->array; | |
114 | inactive = 1; | |
115 | } else { | |
116 | pr_err("cannot get array detail for %s: %s\n", | |
117 | dev, strerror(errno)); | |
118 | close(fd); | |
119 | return rv; | |
120 | } | |
121 | ||
122 | if (fstat(fd, &stb) != 0 && !S_ISBLK(stb.st_mode)) | |
123 | stb.st_rdev = 0; | |
124 | rv = 0; | |
125 | ||
126 | if (st) | |
127 | max_disks = st->max_devs; | |
128 | ||
129 | if (subarray) { | |
130 | /* This is a subarray of some container. | |
131 | * We want the name of the container, and the member | |
132 | */ | |
133 | int devid = devnm2devid(st->container_devnm); | |
134 | int cfd, err; | |
135 | ||
136 | member = subarray; | |
137 | container = map_dev_preferred(major(devid), minor(devid), | |
138 | 1, c->prefer); | |
139 | cfd = open_dev(st->container_devnm); | |
140 | if (cfd >= 0) { | |
141 | err = st->ss->load_container(st, cfd, NULL); | |
142 | close(cfd); | |
143 | if (err == 0) | |
144 | info = st->ss->container_content(st, subarray); | |
145 | } | |
146 | } | |
147 | ||
148 | /* try to load a superblock. Try sra->devs first, then try ioctl */ | |
149 | if (st && !info) for (d = 0, subdev = sra ? sra->devs : NULL; | |
150 | d < max_disks || subdev; | |
151 | subdev ? (void)(subdev = subdev->next) : (void)(d++)){ | |
152 | mdu_disk_info_t disk; | |
153 | char *dv; | |
154 | int fd2; | |
155 | int err; | |
156 | if (subdev) | |
157 | disk = subdev->disk; | |
158 | else { | |
159 | disk.number = d; | |
160 | if (ioctl(fd, GET_DISK_INFO, &disk) < 0) | |
161 | continue; | |
162 | if (d >= array.raid_disks && | |
163 | disk.major == 0 && | |
164 | disk.minor == 0) | |
165 | continue; | |
166 | } | |
167 | ||
168 | if (array.raid_disks > 0 && | |
169 | (disk.state & (1 << MD_DISK_ACTIVE)) == 0) | |
170 | continue; | |
171 | ||
172 | dv = map_dev(disk.major, disk.minor, 1); | |
173 | if (!dv) | |
174 | continue; | |
175 | ||
176 | fd2 = dev_open(dv, O_RDONLY); | |
177 | if (fd2 < 0) | |
178 | continue; | |
179 | ||
180 | if (st->sb) | |
181 | st->ss->free_super(st); | |
182 | ||
183 | err = st->ss->load_super(st, fd2, NULL); | |
184 | close(fd2); | |
185 | if (err) | |
186 | continue; | |
187 | if (info) | |
188 | free(info); | |
189 | if (subarray) | |
190 | info = st->ss->container_content(st, subarray); | |
191 | else { | |
192 | info = xmalloc(sizeof(*info)); | |
193 | st->ss->getinfo_super(st, info, NULL); | |
194 | } | |
195 | if (!info) | |
196 | continue; | |
197 | ||
198 | if (array.raid_disks != 0 && /* container */ | |
199 | (info->array.ctime != array.ctime || | |
200 | info->array.level != array.level)) { | |
201 | st->ss->free_super(st); | |
202 | continue; | |
203 | } | |
204 | /* some formats (imsm) have free-floating-spares | |
205 | * with a uuid of uuid_zero, they don't | |
206 | * have very good info about the rest of the | |
207 | * container, so keep searching when | |
208 | * encountering such a device. Otherwise, stop | |
209 | * after the first successful call to | |
210 | * ->load_super. | |
211 | */ | |
212 | if (memcmp(uuid_zero, | |
213 | info->uuid, | |
214 | sizeof(uuid_zero)) == 0) { | |
215 | st->ss->free_super(st); | |
216 | continue; | |
217 | } | |
218 | break; | |
219 | } | |
220 | ||
221 | /* Ok, we have some info to print... */ | |
222 | str = map_num(pers, array.level); | |
223 | ||
224 | if (c->export) { | |
225 | if (array.raid_disks) { | |
226 | if (str) | |
227 | printf("MD_LEVEL=%s\n", str); | |
228 | printf("MD_DEVICES=%d\n", array.raid_disks); | |
229 | } else { | |
230 | if (!inactive) | |
231 | printf("MD_LEVEL=container\n"); | |
232 | printf("MD_DEVICES=%d\n", array.nr_disks); | |
233 | } | |
234 | if (container) { | |
235 | printf("MD_CONTAINER=%s\n", container); | |
236 | printf("MD_MEMBER=%s\n", member); | |
237 | } else { | |
238 | if (sra && sra->array.major_version < 0) | |
239 | printf("MD_METADATA=%s\n", sra->text_version); | |
240 | else | |
241 | printf("MD_METADATA=%d.%d\n", | |
242 | array.major_version, array.minor_version); | |
243 | } | |
244 | ||
245 | if (st && st->sb && info) { | |
246 | char nbuf[64]; | |
247 | struct map_ent *mp, *map = NULL; | |
248 | ||
249 | fname_from_uuid(st, info, nbuf, ':'); | |
250 | printf("MD_UUID=%s\n", nbuf+5); | |
251 | mp = map_by_uuid(&map, info->uuid); | |
252 | if (mp && mp->path && | |
253 | strncmp(mp->path, "/dev/md/", 8) == 0) { | |
254 | printf("MD_DEVNAME="); | |
255 | print_escape(mp->path+8); | |
256 | putchar('\n'); | |
257 | } | |
258 | ||
259 | if (st->ss->export_detail_super) | |
260 | st->ss->export_detail_super(st); | |
261 | } else { | |
262 | struct map_ent *mp, *map = NULL; | |
263 | char nbuf[64]; | |
264 | mp = map_by_devnm(&map, fd2devnm(fd)); | |
265 | if (mp) { | |
266 | __fname_from_uuid(mp->uuid, 0, nbuf, ':'); | |
267 | printf("MD_UUID=%s\n", nbuf+5); | |
268 | } | |
269 | if (mp && mp->path && | |
270 | strncmp(mp->path, "/dev/md/", 8) == 0) { | |
271 | printf("MD_DEVNAME="); | |
272 | print_escape(mp->path+8); | |
273 | putchar('\n'); | |
274 | } | |
275 | } | |
276 | if (sra) { | |
277 | struct mdinfo *mdi; | |
278 | for (mdi = sra->devs; mdi; mdi = mdi->next) { | |
279 | char *path = | |
280 | map_dev(mdi->disk.major, | |
281 | mdi->disk.minor, 0); | |
282 | ||
283 | if (mdi->disk.raid_disk >= 0) | |
284 | printf("MD_DEVICE_%s_ROLE=%d\n", | |
285 | mdi->sys_name+4, | |
286 | mdi->disk.raid_disk); | |
287 | else | |
288 | printf("MD_DEVICE_%s_ROLE=spare\n", | |
289 | mdi->sys_name+4); | |
290 | if (path) | |
291 | printf("MD_DEVICE_%s_DEV=%s\n", | |
292 | mdi->sys_name+4, path); | |
293 | } | |
294 | } | |
295 | goto out; | |
296 | } | |
297 | ||
298 | disks = xmalloc(max_disks * 2 * sizeof(mdu_disk_info_t)); | |
299 | for (d = 0; d < max_disks * 2; d++) { | |
300 | disks[d].state = (1<<MD_DISK_REMOVED); | |
301 | disks[d].major = disks[d].minor = 0; | |
302 | disks[d].number = disks[d].raid_disk = d; | |
303 | } | |
304 | ||
305 | next = array.raid_disks*2; | |
306 | if (inactive) { | |
307 | struct mdinfo *mdi; | |
308 | if (sra != NULL) | |
309 | for (mdi = sra->devs; mdi; mdi = mdi->next) { | |
310 | disks[next++] = mdi->disk; | |
311 | disks[next-1].number = -1; | |
312 | } | |
313 | } else for (d = 0; d < max_disks; d++) { | |
314 | mdu_disk_info_t disk; | |
315 | disk.number = d; | |
316 | if (ioctl(fd, GET_DISK_INFO, &disk) < 0) { | |
317 | if (d < array.raid_disks) | |
318 | pr_err("cannot get device detail for device %d: %s\n", | |
319 | d, strerror(errno)); | |
320 | continue; | |
321 | } | |
322 | if (disk.major == 0 && disk.minor == 0) | |
323 | continue; | |
324 | if (disk.raid_disk >= 0 && disk.raid_disk < array.raid_disks | |
325 | && disks[disk.raid_disk*2].state == (1<<MD_DISK_REMOVED)) | |
326 | disks[disk.raid_disk*2] = disk; | |
327 | else if (disk.raid_disk >= 0 && disk.raid_disk < array.raid_disks | |
328 | && disks[disk.raid_disk*2+1].state == (1<<MD_DISK_REMOVED)) | |
329 | disks[disk.raid_disk*2+1] = disk; | |
330 | else if (next < max_disks*2) | |
331 | disks[next++] = disk; | |
332 | } | |
333 | ||
334 | avail = xcalloc(array.raid_disks, 1); | |
335 | ||
336 | for (d= 0; d < array.raid_disks; d++) { | |
337 | ||
338 | if ((disks[d*2].state & (1<<MD_DISK_SYNC)) || | |
339 | (disks[d*2+1].state & (1<<MD_DISK_SYNC))) { | |
340 | avail_disks ++; | |
341 | avail[d] = 1; | |
342 | } | |
343 | } | |
344 | ||
345 | if (c->brief) { | |
346 | mdu_bitmap_file_t bmf; | |
347 | printf("%sARRAY %s", inactive ? "INACTIVE-":"", dev); | |
348 | if (c->verbose > 0) { | |
349 | if (array.raid_disks) | |
350 | printf(" level=%s num-devices=%d", | |
351 | str?str:"-unknown-", | |
352 | array.raid_disks ); | |
353 | else if (!inactive) | |
354 | printf(" level=container num-devices=%d", | |
355 | array.nr_disks); | |
356 | else | |
357 | printf(" num-devices=%d", array.nr_disks); | |
358 | } | |
359 | if (container) { | |
360 | printf(" container=%s", container); | |
361 | printf(" member=%s", member); | |
362 | } else { | |
363 | if (sra && sra->array.major_version < 0) | |
364 | printf(" metadata=%s", sra->text_version); | |
365 | else | |
366 | printf(" metadata=%d.%d", | |
367 | array.major_version, array.minor_version); | |
368 | } | |
369 | ||
370 | /* Only try GET_BITMAP_FILE for 0.90.01 and later */ | |
371 | if (vers >= 9001 && | |
372 | ioctl(fd, GET_BITMAP_FILE, &bmf) == 0 && | |
373 | bmf.pathname[0]) { | |
374 | printf(" bitmap=%s", bmf.pathname); | |
375 | } | |
376 | } else { | |
377 | mdu_bitmap_file_t bmf; | |
378 | unsigned long long larray_size; | |
379 | struct mdstat_ent *ms = mdstat_read(0, 0); | |
380 | struct mdstat_ent *e; | |
381 | char *devnm; | |
382 | ||
383 | devnm = stat2devnm(&stb); | |
384 | for (e=ms; e; e=e->next) | |
385 | if (strcmp(e->devnm, devnm) == 0) | |
386 | break; | |
387 | if (!get_dev_size(fd, NULL, &larray_size)) | |
388 | larray_size = 0; | |
389 | ||
390 | printf("%s:\n", dev); | |
391 | ||
392 | if (container) | |
393 | printf(" Container : %s, member %s\n", container, member); | |
394 | else { | |
395 | if (sra && sra->array.major_version < 0) | |
396 | printf(" Version : %s\n", sra->text_version); | |
397 | else | |
398 | printf(" Version : %d.%d\n", | |
399 | array.major_version, array.minor_version); | |
400 | } | |
401 | ||
402 | atime = array.ctime; | |
403 | if (atime) | |
404 | printf(" Creation Time : %.24s\n", ctime(&atime)); | |
405 | if (array.raid_disks == 0 && external) | |
406 | str = "container"; | |
407 | if (str) | |
408 | printf(" Raid Level : %s\n", str); | |
409 | if (larray_size) | |
410 | printf(" Array Size : %llu%s\n", (larray_size>>10), | |
411 | human_size(larray_size)); | |
412 | if (array.level >= 1) { | |
413 | if (sra) | |
414 | array.major_version = sra->array.major_version; | |
415 | if (array.major_version != 0 && | |
416 | (larray_size >= 0xFFFFFFFFULL|| array.size == 0)) { | |
417 | unsigned long long dsize = get_component_size(fd); | |
418 | if (dsize > 0) | |
419 | printf(" Used Dev Size : %llu%s\n", | |
420 | dsize/2, | |
421 | human_size((long long)dsize<<9)); | |
422 | else | |
423 | printf(" Used Dev Size : unknown\n"); | |
424 | } else | |
425 | printf(" Used Dev Size : %d%s\n", array.size, | |
426 | human_size((long long)array.size<<10)); | |
427 | } | |
428 | if (array.raid_disks) | |
429 | printf(" Raid Devices : %d\n", array.raid_disks); | |
430 | printf(" Total Devices : %d\n", array.nr_disks); | |
431 | if (!container && | |
432 | ((sra == NULL && array.major_version == 0) || | |
433 | (sra && sra->array.major_version == 0))) | |
434 | printf("Preferred Minor : %d\n", array.md_minor); | |
435 | if (sra == NULL || sra->array.major_version >= 0) | |
436 | printf(" Persistence : Superblock is %spersistent\n", | |
437 | array.not_persistent?"not ":""); | |
438 | printf("\n"); | |
439 | /* Only try GET_BITMAP_FILE for 0.90.01 and later */ | |
440 | if (vers >= 9001 && | |
441 | ioctl(fd, GET_BITMAP_FILE, &bmf) == 0 && | |
442 | bmf.pathname[0]) { | |
443 | printf(" Intent Bitmap : %s\n", bmf.pathname); | |
444 | printf("\n"); | |
445 | } else if (array.state & (1<<MD_SB_BITMAP_PRESENT)) | |
446 | printf(" Intent Bitmap : Internal\n\n"); | |
447 | atime = array.utime; | |
448 | if (atime) | |
449 | printf(" Update Time : %.24s\n", ctime(&atime)); | |
450 | if (array.raid_disks) { | |
451 | static char *sync_action[] = { | |
452 | ", recovering", ", resyncing", | |
453 | ", reshaping", ", checking" }; | |
454 | char *st; | |
455 | if (avail_disks == array.raid_disks) | |
456 | st = ""; | |
457 | else if (!enough(array.level, array.raid_disks, | |
458 | array.layout, 1, avail)) | |
459 | st = ", FAILED"; | |
460 | else | |
461 | st = ", degraded"; | |
462 | ||
463 | printf(" State : %s%s%s%s%s%s \n", | |
464 | (array.state&(1<<MD_SB_CLEAN))?"clean":"active", st, | |
465 | (!e || (e->percent < 0 && e->percent != RESYNC_PENDING && | |
466 | e->percent != RESYNC_DELAYED)) ? "" : sync_action[e->resync], | |
467 | larray_size ? "": ", Not Started", | |
468 | (e && e->percent == RESYNC_DELAYED) ? " (DELAYED)": "", | |
469 | (e && e->percent == RESYNC_PENDING) ? " (PENDING)": ""); | |
470 | } else if (inactive) { | |
471 | printf(" State : inactive\n"); | |
472 | } | |
473 | if (array.raid_disks) | |
474 | printf(" Active Devices : %d\n", array.active_disks); | |
475 | if (array.working_disks > 0) | |
476 | printf("Working Devices : %d\n", array.working_disks); | |
477 | if (array.raid_disks) { | |
478 | printf(" Failed Devices : %d\n", array.failed_disks); | |
479 | printf(" Spare Devices : %d\n", array.spare_disks); | |
480 | } | |
481 | printf("\n"); | |
482 | if (array.level == 5) { | |
483 | str = map_num(r5layout, array.layout); | |
484 | printf(" Layout : %s\n", str?str:"-unknown-"); | |
485 | } | |
486 | if (array.level == 6) { | |
487 | str = map_num(r6layout, array.layout); | |
488 | printf(" Layout : %s\n", str?str:"-unknown-"); | |
489 | } | |
490 | if (array.level == 10) { | |
491 | printf(" Layout :"); | |
492 | print_r10_layout(array.layout); | |
493 | printf("\n"); | |
494 | } | |
495 | switch (array.level) { | |
496 | case 0: | |
497 | case 4: | |
498 | case 5: | |
499 | case 10: | |
500 | case 6: | |
501 | if (array.chunk_size) | |
502 | printf(" Chunk Size : %dK\n\n", | |
503 | array.chunk_size/1024); | |
504 | break; | |
505 | case -1: | |
506 | printf(" Rounding : %dK\n\n", array.chunk_size/1024); | |
507 | break; | |
508 | default: break; | |
509 | } | |
510 | ||
511 | if (e && e->percent >= 0) { | |
512 | static char *sync_action[] = { | |
513 | "Rebuild", "Resync", | |
514 | "Reshape", "Check"}; | |
515 | printf(" %7s Status : %d%% complete\n", sync_action[e->resync], e->percent); | |
516 | is_rebuilding = 1; | |
517 | } | |
518 | free_mdstat(ms); | |
519 | ||
520 | if ((st && st->sb) && (info && info->reshape_active)) { | |
521 | #if 0 | |
522 | This is pretty boring | |
523 | printf(" Reshape pos'n : %llu%s\n", (unsigned long long) info->reshape_progress<<9, | |
524 | human_size((unsigned long long)info->reshape_progress<<9)); | |
525 | #endif | |
526 | if (info->delta_disks != 0) | |
527 | printf(" Delta Devices : %d, (%d->%d)\n", | |
528 | info->delta_disks, | |
529 | array.raid_disks - info->delta_disks, | |
530 | array.raid_disks); | |
531 | if (info->new_level != array.level) { | |
532 | str = map_num(pers, info->new_level); | |
533 | printf(" New Level : %s\n", str?str:"-unknown-"); | |
534 | } | |
535 | if (info->new_level != array.level || | |
536 | info->new_layout != array.layout) { | |
537 | if (info->new_level == 5) { | |
538 | str = map_num(r5layout, info->new_layout); | |
539 | printf(" New Layout : %s\n", | |
540 | str?str:"-unknown-"); | |
541 | } | |
542 | if (info->new_level == 6) { | |
543 | str = map_num(r6layout, info->new_layout); | |
544 | printf(" New Layout : %s\n", | |
545 | str?str:"-unknown-"); | |
546 | } | |
547 | if (info->new_level == 10) { | |
548 | printf(" New Layout : near=%d, %s=%d\n", | |
549 | info->new_layout&255, | |
550 | (info->new_layout&0x10000)?"offset":"far", | |
551 | (info->new_layout>>8)&255); | |
552 | } | |
553 | } | |
554 | if (info->new_chunk != array.chunk_size) | |
555 | printf(" New Chunksize : %dK\n", info->new_chunk/1024); | |
556 | printf("\n"); | |
557 | } else if (e && e->percent >= 0) | |
558 | printf("\n"); | |
559 | if (st && st->sb) | |
560 | st->ss->detail_super(st, c->homehost); | |
561 | ||
562 | if (array.raid_disks == 0 && sra && sra->array.major_version == -1 | |
563 | && sra->array.minor_version == -2 && sra->text_version[0] != '/') { | |
564 | /* This looks like a container. Find any active arrays | |
565 | * That claim to be a member. | |
566 | */ | |
567 | DIR *dir = opendir("/sys/block"); | |
568 | struct dirent *de; | |
569 | ||
570 | printf(" Member Arrays :"); | |
571 | ||
572 | while (dir && (de = readdir(dir)) != NULL) { | |
573 | char path[200]; | |
574 | char vbuf[1024]; | |
575 | int nlen = strlen(sra->sys_name); | |
576 | int devid; | |
577 | if (de->d_name[0] == '.') | |
578 | continue; | |
579 | sprintf(path, "/sys/block/%s/md/metadata_version", | |
580 | de->d_name); | |
581 | if (load_sys(path, vbuf) < 0) | |
582 | continue; | |
583 | if (strncmp(vbuf, "external:", 9) != 0 || | |
584 | !is_subarray(vbuf+9) || | |
585 | strncmp(vbuf+10, sra->sys_name, nlen) != 0 || | |
586 | vbuf[10+nlen] != '/') | |
587 | continue; | |
588 | devid = devnm2devid(de->d_name); | |
589 | printf(" %s", map_dev_preferred( | |
590 | major(devid), | |
591 | minor(devid), 1, c->prefer)); | |
592 | } | |
593 | if (dir) | |
594 | closedir(dir); | |
595 | printf("\n\n"); | |
596 | } | |
597 | ||
598 | if (array.raid_disks) | |
599 | printf(" Number Major Minor RaidDevice State\n"); | |
600 | else | |
601 | printf(" Number Major Minor RaidDevice\n"); | |
602 | } | |
603 | free(info); | |
604 | ||
605 | for (d= 0; d < max_disks * 2; d++) { | |
606 | char *dv; | |
607 | mdu_disk_info_t disk = disks[d]; | |
608 | ||
609 | if (d >= array.raid_disks*2 && | |
610 | disk.major == 0 && | |
611 | disk.minor == 0) | |
612 | continue; | |
613 | if ((d & 1) && | |
614 | disk.major == 0 && | |
615 | disk.minor == 0) | |
616 | continue; | |
617 | if (!c->brief) { | |
618 | if (d == array.raid_disks*2) printf("\n"); | |
619 | if (disk.number < 0) | |
620 | printf(" - %5d %5d - ", | |
621 | disk.major, disk.minor); | |
622 | else if (disk.raid_disk < 0) | |
623 | printf(" %5d %5d %5d - ", | |
624 | disk.number, disk.major, disk.minor); | |
625 | else | |
626 | printf(" %5d %5d %5d %5d ", | |
627 | disk.number, disk.major, disk.minor, disk.raid_disk); | |
628 | } | |
629 | if (!c->brief && array.raid_disks) { | |
630 | ||
631 | if (disk.state & (1<<MD_DISK_FAULTY)) { | |
632 | printf(" faulty"); | |
633 | if (disk.raid_disk < array.raid_disks && | |
634 | disk.raid_disk >= 0) | |
635 | failed++; | |
636 | } | |
637 | if (disk.state & (1<<MD_DISK_ACTIVE)) printf(" active"); | |
638 | if (disk.state & (1<<MD_DISK_SYNC)) { | |
639 | printf(" sync"); | |
640 | if (array.level == 10 && (array.layout & ~0x1FFFF) == 0) { | |
641 | int nc = array.layout & 0xff; | |
642 | int fc = (array.layout >> 8) & 0xff; | |
643 | int copies = nc*fc; | |
644 | if (fc == 1 && array.raid_disks % copies == 0 && copies <= 26) { | |
645 | /* We can divide the devices into 'sets' */ | |
646 | int set = disk.raid_disk % copies; | |
647 | printf(" set-%c", set + 'A'); | |
648 | } | |
649 | } | |
650 | } | |
651 | if (disk.state & (1<<MD_DISK_REMOVED)) printf(" removed"); | |
652 | if (disk.state & (1<<MD_DISK_WRITEMOSTLY)) printf(" writemostly"); | |
653 | if ((disk.state & | |
654 | ((1<<MD_DISK_ACTIVE)|(1<<MD_DISK_SYNC) | |
655 | |(1<<MD_DISK_REMOVED)|(1<<MD_DISK_FAULTY))) | |
656 | == 0) { | |
657 | printf(" spare"); | |
658 | if (is_26) { | |
659 | if (disk.raid_disk < array.raid_disks && disk.raid_disk >= 0) | |
660 | printf(" rebuilding"); | |
661 | } else if (is_rebuilding && failed) { | |
662 | /* Taking a bit of a risk here, we remove the | |
663 | * device from the array, and then put it back. | |
664 | * If this fails, we are rebuilding | |
665 | */ | |
666 | int err = ioctl(fd, HOT_REMOVE_DISK, makedev(disk.major, disk.minor)); | |
667 | if (err == 0) ioctl(fd, HOT_ADD_DISK, makedev(disk.major, disk.minor)); | |
668 | if (err && errno == EBUSY) | |
669 | printf(" rebuilding"); | |
670 | } | |
671 | } | |
672 | } | |
673 | if (disk.state == 0) spares++; | |
674 | if (c->test && d < array.raid_disks | |
675 | && !(disk.state & (1<<MD_DISK_SYNC))) | |
676 | rv |= 1; | |
677 | dv=map_dev_preferred(disk.major, disk.minor, 0, c->prefer); | |
678 | if (dv != NULL) { | |
679 | if (c->brief) | |
680 | n_devices = add_device(dv, &devices, | |
681 | &max_devices, | |
682 | n_devices); | |
683 | else | |
684 | printf(" %s", dv); | |
685 | } | |
686 | if (!c->brief) printf("\n"); | |
687 | } | |
688 | if (spares && c->brief && array.raid_disks) printf(" spares=%d", spares); | |
689 | if (c->brief && st && st->sb) | |
690 | st->ss->brief_detail_super(st); | |
691 | if (st) | |
692 | st->ss->free_super(st); | |
693 | ||
694 | if (c->brief && c->verbose > 0 && devices) { | |
695 | qsort(devices, n_devices, sizeof(*devices), cmpstringp); | |
696 | printf("\n devices=%s", devices[0]); | |
697 | for (d = 1; d < n_devices; d++) | |
698 | printf(",%s", devices[d]); | |
699 | } | |
700 | if (c->brief) | |
701 | printf("\n"); | |
702 | if (c->test && | |
703 | !enough(array.level, array.raid_disks, array.layout, | |
704 | 1, avail)) | |
705 | rv = 2; | |
706 | ||
707 | free(disks); | |
708 | out: | |
709 | close(fd); | |
710 | free(subarray); | |
711 | free(avail); | |
712 | for (d = 0; d < n_devices; d++) | |
713 | free(devices[d]); | |
714 | free(devices); | |
715 | sysfs_free(sra); | |
716 | return rv; | |
717 | } | |
718 | ||
719 | int Detail_Platform(struct superswitch *ss, int scan, int verbose, int export, char *controller_path) | |
720 | { | |
721 | /* display platform capabilities for the given metadata format | |
722 | * 'scan' in this context means iterate over all metadata types | |
723 | */ | |
724 | int i; | |
725 | int err = 1; | |
726 | ||
727 | if (ss && export && ss->export_detail_platform) | |
728 | err = ss->export_detail_platform(verbose, controller_path); | |
729 | else if (ss && ss->detail_platform) | |
730 | err = ss->detail_platform(verbose, 0, controller_path); | |
731 | else if (ss) { | |
732 | if (verbose > 0) | |
733 | pr_err("%s metadata is platform independent\n", | |
734 | ss->name ? : "[no name]"); | |
735 | } else if (!scan) { | |
736 | if (verbose > 0) | |
737 | pr_err("specify a metadata type or --scan\n"); | |
738 | } | |
739 | ||
740 | if (!scan) | |
741 | return err; | |
742 | ||
743 | err = 0; | |
744 | for (i = 0; superlist[i]; i++) { | |
745 | struct superswitch *meta = superlist[i]; | |
746 | ||
747 | if (meta == ss) | |
748 | continue; | |
749 | if (verbose > 0) | |
750 | pr_err("checking metadata %s\n", | |
751 | meta->name ? : "[no name]"); | |
752 | if (!meta->detail_platform) { | |
753 | if (verbose > 0) | |
754 | pr_err("%s metadata is platform independent\n", | |
755 | meta->name ? : "[no name]"); | |
756 | } else if (export && meta->export_detail_platform) { | |
757 | err |= meta->export_detail_platform(verbose, controller_path); | |
758 | } else | |
759 | err |= meta->detail_platform(verbose, 0, controller_path); | |
760 | } | |
761 | ||
762 | return err; | |
763 | } |