2 * mdadm - manage Linux "md" devices aka RAID arrays.
4 * Copyright (C) 2001-2006 Neil Brown <neilb@suse.de>
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.
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.
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
22 * Email: <neilb@cse.unsw.edu.au>
24 * School of Computer Science and Engineering
25 * The University of New South Wales
32 #include <sys/utsname.h>
36 * following taken from linux/blkpg.h because they aren't
37 * anywhere else and it isn't safe to #include linux/ * stuff.
40 #define BLKPG _IO(0x12,105)
42 /* The argument structure */
43 struct blkpg_ioctl_arg
{
50 /* The subfunctions (for the op field) */
51 #define BLKPG_ADD_PARTITION 1
52 #define BLKPG_DEL_PARTITION 2
54 /* Sizes of name fields. Unused at present. */
55 #define BLKPG_DEVNAMELTH 64
56 #define BLKPG_VOLNAMELTH 64
58 /* The data structure for ADD_PARTITION and DEL_PARTITION */
59 struct blkpg_partition
{
60 long long start
; /* starting offset in bytes */
61 long long length
; /* length in bytes */
62 int pno
; /* partition number */
63 char devname
[BLKPG_DEVNAMELTH
]; /* partition name, like sda5 or c0d1p2,
64 to be used in kernel messages */
65 char volname
[BLKPG_VOLNAMELTH
]; /* volume label */
69 * Parse a 128 bit uuid in 4 integers
70 * format is 32 hexx nibbles with options :.<space> separator
71 * If not exactly 32 hex digits are found, return 0
74 int parse_uuid(char *str
, int uuid
[4])
76 int hit
= 0; /* number of Hex digIT */
79 for (i
=0; i
<4; i
++) uuid
[i
]=0;
85 else if (c
>='a' && c
<= 'f')
87 else if (c
>='A' && c
<= 'F')
89 else if (strchr(":. -", c
))
107 * Get the md version number.
108 * We use the RAID_VERSION ioctl if it is supported
109 * If not, but we have a block device with major '9', we assume
112 * Return version number as 24 but number - assume version parts
116 int md_get_version(int fd
)
121 if (fstat(fd
, &stb
)<0)
123 if ((S_IFMT
&stb
.st_mode
) != S_IFBLK
)
126 if (ioctl(fd
, RAID_VERSION
, &vers
) == 0)
127 return (vers
.major
*10000) + (vers
.minor
*100) + vers
.patchlevel
;
130 if (major(stb
.st_rdev
) == MD_MAJOR
)
136 int get_linux_version()
145 a
= strtoul(cp
, &cp
, 10);
146 if (*cp
!= '.') return -1;
147 b
= strtoul(cp
+1, &cp
, 10);
148 if (*cp
!= '.') return -1;
149 c
= strtoul(cp
+1, NULL
, 10);
151 return (a
*1000000)+(b
*1000)+c
;
154 void remove_partitions(int fd
)
156 /* remove partitions from this block devices.
157 * This is used for components added to an array
159 #ifdef BLKPG_DEL_PARTITION
160 struct blkpg_ioctl_arg a
;
161 struct blkpg_partition p
;
163 a
.op
= BLKPG_DEL_PARTITION
;
165 a
.datalen
= sizeof(p
);
167 memset(a
.data
, 0, a
.datalen
);
168 for (p
.pno
=0; p
.pno
< 16; p
.pno
++)
169 ioctl(fd
, BLKPG
, &a
);
173 int enough(int level
, int raid_disks
, int layout
,
174 char *avail
, int avail_disks
)
179 /* This is the tricky one - we need to check
180 * which actual disks are present.
182 copies
= (layout
&255)* ((layout
>>8) & 255);
185 /* there must be one of the 'copies' form 'first' */
191 first
= (first
+1) % raid_disks
;
196 } while (first
!= 0);
200 return avail_disks
>= 1;
203 return avail_disks
== raid_disks
;
205 return avail_disks
>= 1;
208 return avail_disks
>= raid_disks
-1;
210 return avail_disks
>= raid_disks
-2;
216 int same_uuid(int a
[4], int b
[4], int swapuuid
)
219 /* parse uuids are hostendian.
220 * uuid's from some superblocks are big-ending
221 * if there is a difference, we need to swap..
223 unsigned char *ac
= (unsigned char *)a
;
224 unsigned char *bc
= (unsigned char *)b
;
226 for (i
=0; i
<16; i
+= 4) {
227 if (ac
[i
+0] != bc
[i
+3] ||
228 ac
[i
+1] != bc
[i
+2] ||
229 ac
[i
+2] != bc
[i
+1] ||
245 int check_ext2(int fd
, char *name
)
248 * Check for an ext2fs file system.
249 * Superblock is always 1K at 1K offset
251 * s_magic is le16 at 56 == 0xEF53
252 * report mtime - le32 at 44
254 * logblksize - le32 at 24
256 unsigned char sb
[1024];
259 if (lseek(fd
, 1024,0)!= 1024)
261 if (read(fd
, sb
, 1024)!= 1024)
263 if (sb
[56] != 0x53 || sb
[57] != 0xef)
266 mtime
= sb
[44]|(sb
[45]|(sb
[46]|sb
[47]<<8)<<8)<<8;
267 bsize
= sb
[24]|(sb
[25]|(sb
[26]|sb
[27]<<8)<<8)<<8;
268 size
= sb
[4]|(sb
[5]|(sb
[6]|sb
[7]<<8)<<8)<<8;
269 fprintf(stderr
, Name
": %s appears to contain an ext2fs file system\n",
271 fprintf(stderr
," size=%dK mtime=%s",
272 size
*(1<<bsize
), ctime(&mtime
));
276 int check_reiser(int fd
, char *name
)
279 * superblock is at 64K
281 * Magic string "ReIsErFs" or "ReIsEr2Fs" at 52
284 unsigned char sb
[1024];
286 if (lseek(fd
, 64*1024, 0) != 64*1024)
288 if (read(fd
, sb
, 1024) != 1024)
290 if (strncmp((char*)sb
+52, "ReIsErFs",8)!=0 &&
291 strncmp((char*)sb
+52, "ReIsEr2Fs",9)!=0)
293 fprintf(stderr
, Name
": %s appears to contain a reiserfs file system\n",name
);
294 size
= sb
[0]|(sb
[1]|(sb
[2]|sb
[3]<<8)<<8)<<8;
295 fprintf(stderr
, " size = %luK\n", size
*4);
300 int check_raid(int fd
, char *name
)
306 struct supertype
*st
= guess_super(fd
);
309 st
->ss
->load_super(st
, fd
, &super
, name
);
310 /* Looks like a raid array .. */
311 fprintf(stderr
, Name
": %s appears to be part of a raid array:\n",
313 st
->ss
->getinfo_super(&info
, super
);
315 crtime
= info
.array
.ctime
;
316 level
= map_num(pers
, info
.array
.level
);
317 if (!level
) level
= "-unknown-";
318 fprintf(stderr
, " level=%s devices=%d ctime=%s",
319 level
, info
.array
.raid_disks
, ctime(&crtime
));
327 for (i
=0; i
<5; i
++) {
329 fprintf(stderr
, "%s%s", mesg
, add
);
331 if (fgets(buf
, 100, stdin
)==NULL
)
333 if (buf
[0]=='y' || buf
[0]=='Y')
335 if (buf
[0]=='n' || buf
[0]=='N')
339 fprintf(stderr
, Name
": assuming 'no'\n");
342 #endif /* MDASSEMBLE */
344 char *map_num(mapping_t
*map
, int num
)
354 int map_name(mapping_t
*map
, char *name
)
357 if (strcmp(map
->name
, name
)==0)
365 int is_standard(char *dev
, int *nump
)
367 /* tests if dev is a "standard" md dev name.
368 * i.e if the last component is "/dNN" or "/mdNN",
369 * where NN is a string of digits
371 char *d
= strrchr(dev
, '/');
376 if (strncmp(d
, "/d",2)==0)
377 d
+= 2, type
=1; /* /dev/md/dN{pM} */
378 else if (strncmp(d
, "/md_d", 5)==0)
379 d
+= 5, type
=1; /* /dev/md_dNpM */
380 else if (strncmp(d
, "/md", 3)==0)
381 d
+= 3, type
=-1; /* /dev/mdN */
382 else if (d
-dev
> 3 && strncmp(d
-2, "md/", 3)==0)
383 d
+= 1, type
=-1; /* /dev/md/N */
393 if (nump
) *nump
= num
;
400 * convert a major/minor pair for a block device into a name in /dev, if possible.
401 * On the first call, walk /dev collecting name.
402 * Put them in a simple linked listfor now.
409 int devlist_ready
= 0;
411 int add_dev(const char *name
, const struct stat
*stb
, int flag
, struct FTW
*s
)
414 if (S_ISLNK(stb
->st_mode
)) {
419 if ((stb
->st_mode
&S_IFMT
)== S_IFBLK
) {
420 char *n
= strdup(name
);
421 struct devmap
*dm
= malloc(sizeof(*dm
));
422 if (strncmp(n
, "/dev/./", 7)==0)
425 dm
->major
= major(stb
->st_rdev
);
426 dm
->minor
= minor(stb
->st_rdev
);
437 int add_dev_1(const char *name
, const struct stat
*stb
, int flag
)
439 return add_dev(name
, stb
, flag
, NULL
);
441 int nftw(const char *path
, int (*han
)(const char *name
, const struct stat
*stb
, int flag
, struct FTW
*s
), int nopenfd
, int flags
)
443 return ftw(path
, add_dev_1
, nopenfd
);
446 int add_dev(const char *name
, const struct stat
*stb
, int flag
, struct FTW
*s
)
450 int nftw(const char *path
, int (*han
)(const char *name
, const struct stat
*stb
, int flag
, struct FTW
*s
), int nopenfd
, int flags
)
454 #endif /* HAVE_FTW */
455 #endif /* HAVE_NFTW */
458 * Find a block device with the right major/minor number.
459 * If we find multiple names, choose the shortest.
460 * If we find a non-standard name, it is probably there
461 * deliberately so prefer it over a standard name.
462 * This applies only to names for MD devices.
464 char *map_dev(int major
, int minor
, int create
)
467 char *std
= NULL
, *nonstd
=NULL
;
470 if (major
== 0 && minor
== 0)
474 if (!devlist_ready
) {
478 struct devmap
*d
= devlist
;
483 if (lstat(dev
, &stb
)==0 &&
484 S_ISLNK(stb
.st_mode
))
486 nftw(dev
, add_dev
, 10, FTW_PHYS
);
491 for (p
=devlist
; p
; p
=p
->next
)
492 if (p
->major
== major
&&
494 if (is_standard(p
->name
, NULL
)) {
496 strlen(p
->name
) < strlen(std
))
499 if (nonstd
== NULL
||
500 strlen(p
->name
) < strlen(nonstd
))
504 if (!std
&& !nonstd
&& !did_check
) {
508 if (create
&& !std
&& !nonstd
) {
510 snprintf(buf
, sizeof(buf
), "%d:%d", major
, minor
);
514 return nonstd
? nonstd
: std
;
517 unsigned long calc_csum(void *super
, int bytes
)
519 unsigned long long newcsum
= 0;
522 unsigned int *superc
= (unsigned int*) super
;
524 for(i
=0; i
<bytes
/4; i
++)
526 csum
= (newcsum
& 0xffffffff) + (newcsum
>>32);
528 /* The in-kernel checksum calculation is always 16bit on
529 * the alpha, though it is 32 bit on i386...
530 * I wonder what it is elsewhere... (it uses and API in
531 * a way that it shouldn't).
533 csum
= (csum
& 0xffff) + (csum
>> 16);
534 csum
= (csum
& 0xffff) + (csum
>> 16);
540 char *human_size(long long bytes
)
544 /* We convert bytes to either centi-M{ega,ibi}bytes or
545 * centi-G{igi,ibi}bytes, with appropriate rounding,
546 * and then print 1/100th of those as a decimal.
547 * We allow upto 2048Megabytes before converting to
548 * gigabytes, as that shows more precision and isn't
549 * too large a number.
550 * Terrabytes are not yet handled.
553 if (bytes
< 5000*1024)
555 else if (bytes
< 2*1024LL*1024LL*1024LL) {
556 long cMiB
= (bytes
/ ( (1LL<<20) / 200LL ) +1) /2;
557 long cMB
= (bytes
/ ( 1000000LL / 200LL ) +1) /2;
558 snprintf(buf
, sizeof(buf
), " (%ld.%02ld MiB %ld.%02ld MB)",
559 cMiB
/100 , cMiB
% 100,
562 long cGiB
= (bytes
/ ( (1LL<<30) / 200LL ) +1) /2;
563 long cGB
= (bytes
/ (1000000000LL/200LL ) +1) /2;
564 snprintf(buf
, sizeof(buf
), " (%ld.%02ld GiB %ld.%02ld GB)",
565 cGiB
/100 , cGiB
% 100,
571 char *human_size_brief(long long bytes
)
576 if (bytes
< 5000*1024)
577 snprintf(buf
, sizeof(buf
), "%ld.%02ldKiB",
578 (long)(bytes
>>10), (long)(((bytes
&1023)*100+512)/1024)
580 else if (bytes
< 2*1024LL*1024LL*1024LL)
581 snprintf(buf
, sizeof(buf
), "%ld.%02ldMiB",
583 (long)((bytes
&0xfffff)+0x100000/200)/(0x100000/100)
586 snprintf(buf
, sizeof(buf
), "%ld.%02ldGiB",
588 (long)(((bytes
>>10)&0xfffff)+0x100000/200)/(0x100000/100)
594 #if !defined(MDASSEMBLE) || defined(MDASSEMBLE) && defined(MDASSEMBLE_AUTO)
595 int get_mdp_major(void)
597 static int mdp_major
= -1;
601 int have_devices
= 0;
606 fl
= fopen("/proc/devices", "r");
609 while ((w
= conf_word(fl
, 1))) {
610 if (have_block
&& strcmp(w
, "devices:")==0)
612 have_block
= (strcmp(w
, "Block")==0);
615 if (have_devices
&& strcmp(w
, "mdp")==0)
616 mdp_major
= last_num
;
625 char *get_md_name(int dev
)
627 /* find /dev/md%d or /dev/md/%d or make a device /dev/.tmp.md%d */
628 /* if dev < 0, want /dev/md/d%d or find mdp in /proc/devices ... */
629 static char devname
[50];
635 int mdp
= get_mdp_major();
636 if (mdp
< 0) return NULL
;
637 rdev
= makedev(mdp
, (-1-dev
)<<6);
638 snprintf(devname
, sizeof(devname
), "/dev/md/d%d", -1-dev
);
639 if (stat(devname
, &stb
) == 0
640 && (S_IFMT
&stb
.st_mode
) == S_IFBLK
641 && (stb
.st_rdev
== rdev
))
644 rdev
= makedev(MD_MAJOR
, dev
);
645 snprintf(devname
, sizeof(devname
), "/dev/md%d", dev
);
646 if (stat(devname
, &stb
) == 0
647 && (S_IFMT
&stb
.st_mode
) == S_IFBLK
648 && (stb
.st_rdev
== rdev
))
651 snprintf(devname
, sizeof(devname
), "/dev/md/%d", dev
);
652 if (stat(devname
, &stb
) == 0
653 && (S_IFMT
&stb
.st_mode
) == S_IFBLK
654 && (stb
.st_rdev
== rdev
))
657 dn
= map_dev(major(rdev
), minor(rdev
), 0);
660 snprintf(devname
, sizeof(devname
), "/dev/.tmp.md%d", dev
);
661 if (mknod(devname
, S_IFBLK
| 0600, rdev
) == -1)
665 if (stat(devname
, &stb
) == 0
666 && (S_IFMT
&stb
.st_mode
) == S_IFBLK
667 && (stb
.st_rdev
== rdev
))
673 void put_md_name(char *name
)
675 if (strncmp(name
, "/dev/.tmp.md", 12)==0)
678 #endif /* !defined(MDASSEMBLE) || defined(MDASSEMBLE) && defined(MDASSEMBLE_AUTO) */
680 int dev_open(char *dev
, int flags
)
682 /* like 'open', but if 'dev' matches %d:%d, create a temp
683 * block device and open that
693 major
= strtoul(dev
, &e
, 0);
694 if (e
> dev
&& *e
== ':' && e
[1] &&
695 (minor
= strtoul(e
+1, &e
, 0)) >= 0 &&
697 snprintf(devname
, sizeof(devname
), "/dev/.tmp.md.%d:%d", major
, minor
);
698 if (mknod(devname
, S_IFBLK
|0600, makedev(major
, minor
))==0) {
699 fd
= open(devname
, flags
);
703 fd
= open(dev
, flags
);
707 struct superswitch
*superlist
[] = { &super0
, &super1
, NULL
};
709 struct supertype
*super_by_version(int vers
, int minor
)
711 struct supertype
*st
= malloc(sizeof(*st
));
715 st
->max_devs
= MD_SB_DISKS
;
722 st
->minor_version
= minor
;
726 struct supertype
*guess_super(int fd
)
728 /* try each load_super to find the best match,
729 * and return the best superswitch
731 struct superswitch
*ss
;
732 struct supertype
*st
;
733 unsigned long besttime
= 0;
739 st
= malloc(sizeof(*st
));
740 memset(st
, 0, sizeof(*st
));
741 for (i
=0 ; superlist
[i
]; i
++) {
745 rv
= ss
->load_super(st
, fd
, &sbp
, NULL
);
748 ss
->getinfo_super(&info
, sbp
);
749 if (bestsuper
== -1 ||
750 besttime
< info
.array
.ctime
) {
752 besttime
= info
.array
.ctime
;
757 if (bestsuper
!= -1) {
760 rv
= superlist
[bestsuper
]->load_super(st
, fd
, &sbp
, NULL
);
772 /* tinyc doesn't optimize this check in ioctl.h out ... */
773 unsigned int __invalid_size_argument_for_IOC
= 0;