[thirdparty/mdadm.git] / util.c

/*
 * mdadm - manage Linux "md" devices aka RAID arrays.
 *
 * Copyright (C) 2001-2002 Neil Brown <neilb@cse.unsw.edu.au>
 *
 *
 *    This program is free software; you can redistribute it and/or modify
 *    it under the terms of the GNU General Public License as published by
 *    the Free Software Foundation; either version 2 of the License, or
 *    (at your option) any later version.
 *
 *    This program is distributed in the hope that it will be useful,
 *    but WITHOUT ANY WARRANTY; without even the implied warranty of
 *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *    GNU General Public License for more details.
 *
 *    You should have received a copy of the GNU General Public License
 *    along with this program; if not, write to the Free Software
 *    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 *
 *    Author: Neil Brown
 *    Email: <neilb@cse.unsw.edu.au>
 *    Paper: Neil Brown
 *           School of Computer Science and Engineering
 *           The University of New South Wales
 *           Sydney, 2052
 *           Australia
 */

#include	"mdadm.h"
#include	"md_p.h"
#include	<sys/utsname.h>
#include	<ctype.h>

/*
 * Parse a 128 bit uuid in 4 integers
 * format is 32 hexx nibbles with options :.<space> separator
 * If not exactly 32 hex digits are found, return 0
 * else return 1
 */
int parse_uuid(char *str, int uuid[4])
{
    int hit = 0; /* number of Hex digIT */
    int i;
    char c;
    for (i=0; i<4; i++) uuid[i]=0;

    while ((c= *str++)) {
	int n;
	if (c>='0' && c<='9')
	    n = c-'0';
	else if (c>='a' && c <= 'f')
	    n = 10 + c - 'a';
	else if (c>='A' && c <= 'F')
	    n = 10 + c - 'A';
	else if (strchr(":. -", c))
	    continue;
	else return 0;

	if (hit<32) {
	    uuid[hit/8] <<= 4;
	    uuid[hit/8] += n;
	}
	hit++;
    }
    if (hit == 32)
	return 1;
    return 0;
    
}


/*
 * Get the md version number.
 * We use the RAID_VERSION ioctl if it is supported
 * If not, but we have a block device with major '9', we assume
 * 0.36.0
 *
 * Return version number as 24 but number - assume version parts
 * always < 255
 */

int md_get_version(int fd)
{
    struct stat stb;
    mdu_version_t vers;

    if (fstat(fd, &stb)<0)
	return -1;
    if ((S_IFMT&stb.st_mode) != S_IFBLK)
	return -1;

    if (ioctl(fd, RAID_VERSION, &vers) == 0)
	return  (vers.major*10000) + (vers.minor*100) + vers.patchlevel;
    if (errno == EACCES)
	    return -1;
    if (major(stb.st_rdev) == MD_MAJOR)
	return (3600);
    return -1;
}

    
int get_linux_version()
{
	struct utsname name;
	char *cp;
	int a,b,c;
	if (uname(&name) <0)
		return -1;

	cp = name.release;
	a = strtoul(cp, &cp, 10);
	if (*cp != '.') return -1;
	b = strtoul(cp+1, &cp, 10);
	if (*cp != '.') return -1;
	c = strtoul(cp+1, NULL, 10);

	return (a*1000000)+(b*1000)+c;
}

int enough(int level, int raid_disks, int avail_disks)
{
	switch (level) {
	case 10: return 1; /* a lie, but it is hard to tell */

	case -4:
		return avail_disks>= 1;
	case -1:
	case 0:
		return avail_disks == raid_disks;
	case 1:
		return avail_disks >= 1;
	case 4:
	case 5:
		return avail_disks >= raid_disks-1;
	case 6:
		return avail_disks >= raid_disks-2;
	default:
		return 0;
	}
}

int same_uuid(int a[4], int b[4])
{
    if (a[0]==b[0] &&
	a[1]==b[1] &&
	a[2]==b[2] &&
	a[3]==b[3])
	return 1;
    return 0;
}

int check_ext2(int fd, char *name)
{
	/*
	 * Check for an ext2fs file system.
	 * Superblock is always 1K at 1K offset
	 *
	 * s_magic is le16 at 56 == 0xEF53
	 * report mtime - le32 at 44
	 * blocks - le32 at 4
	 * logblksize - le32 at 24
	 */
	unsigned char sb[1024];
	time_t mtime;
	int size, bsize;
	if (lseek(fd, 1024,0)!= 1024)
		return 0;
	if (read(fd, sb, 1024)!= 1024)
		return 0;
	if (sb[56] != 0x53 || sb[57] != 0xef)
		return 0;

	mtime = sb[44]|(sb[45]|(sb[46]|sb[47]<<8)<<8)<<8;
	bsize = sb[24]|(sb[25]|(sb[26]|sb[27]<<8)<<8)<<8;
	size = sb[4]|(sb[5]|(sb[6]|sb[7]<<8)<<8)<<8;
	fprintf(stderr, Name ": %s appears to contain an ext2fs file system\n",
		name);
	fprintf(stderr,"    size=%dK  mtime=%s",
		size*(1<<bsize), ctime(&mtime));
	return 1;
}

int check_reiser(int fd, char *name)
{
	/*
	 * superblock is at 64K
	 * size is 1024;
	 * Magic string "ReIsErFs" or "ReIsEr2Fs" at 52
	 *
	 */
	unsigned char sb[1024];
	int size;
	if (lseek(fd, 64*1024, 0) != 64*1024)
		return 0;
	if (read(fd, sb, 1024) != 1024)
		return 0;
	if (strncmp(sb+52, "ReIsErFs",8)!=0 &&
	    strncmp(sb+52, "ReIsEr2Fs",9)!=0)
		return 0;
	fprintf(stderr, Name ": %s appears to contain a reiserfs file system\n",name);
	size = sb[0]|(sb[1]|(sb[2]|sb[3]<<8)<<8)<<8;
	fprintf(stderr, "    size = %dK\n", size*4);
		
	return 1;
}

int check_raid(int fd, char *name)
{
	void *super;
	struct mdinfo info;
	time_t crtime;
	struct supertype *st = guess_super(fd);

	if (!st) return 0;
	st->ss->load_super(st, fd, &super, name);
	/* Looks like a raid array .. */
	fprintf(stderr, Name ": %s appears to be part of a raid array:\n",
		name);
	st->ss->getinfo_super(&info, super);
	free(super);
	crtime = info.array.ctime;
	fprintf(stderr, "    level=%d devices=%d ctime=%s",
		info.array.level, info.array.raid_disks, ctime(&crtime));
	return 1;
}

int ask(char *mesg)
{
	char *add = "";
	int i;
	for (i=0; i<5; i++) {
		char buf[100];
		fprintf(stderr, "%s%s", mesg, add);
		fflush(stderr);
		if (fgets(buf, 100, stdin)==NULL)
			return 0;
		if (buf[0]=='y' || buf[0]=='Y')
			return 1;
		if (buf[0]=='n' || buf[0]=='N')
			return 0;
		add = "(y/n) ";
	}
	fprintf(stderr, Name ": assuming 'no'\n");
	return 0;
}

char *map_num(mapping_t *map, int num)
{
	while (map->name) {
		if (map->num == num)
			return map->name;
		map++;
	}
	return NULL;
}

int map_name(mapping_t *map, char *name)
{
	while (map->name) {
		if (strcmp(map->name, name)==0)
			return map->num;
		map++;
	}
	return UnSet;
}


int is_standard(char *dev, int *nump)
{
	/* tests if dev is a "standard" md dev name.
	 * i.e if the last component is "/dNN" or "/mdNN",
	 * where NN is a string of digits 
	 */
	char *d = strrchr(dev, '/');
	int type=0;
	int num;
	if (!d)
		return 0;
	if (strncmp(d, "/d",2)==0)
		d += 2, type=1; /* /dev/md/dN{pM} */
	else if (strncmp(d, "/md_d", 5)==0)
		d += 5, type=1; /* /dev/md_dNpM */
	else if (strncmp(d, "/md", 3)==0)
		d += 3, type=-1; /* /dev/mdN */
	else if (d-dev > 3 && strncmp(d-2, "md/", 3)==0)
		type = -1; /* /dev/md/N */
	else
		return 0;
	if (!*d)
		return 0;
	num = atoi(d);
	while (isdigit(*d))
		d++;
	if (*d)
		return 0;
	if (nump) *nump = num;

	return type;
}


/*
 * convert a major/minor pair for a block device into a name in /dev, if possible.
 * On the first call, walk /dev collecting name.
 * Put them in a simple linked listfor now.
 */
struct devmap {
    int major, minor;
    char *name;
    struct devmap *next;
} *devlist = NULL;
int devlist_ready = 0;

#ifdef UCLIBC
char *map_dev(int major, int minor)
{
#if 0
	fprintf(stderr, "Warning - fail to map %d,%d to a device name\n",
		major, minor);
#endif
	return NULL;
}
#else
#define  __USE_XOPEN_EXTENDED
#include <ftw.h>


#ifndef __dietlibc__
int add_dev(const char *name, const struct stat *stb, int flag, struct FTW *s)
#else
int add_dev(const char *name, const struct stat *stb, int flag)
#endif
{
    if ((stb->st_mode&S_IFMT)== S_IFBLK) {
	char *n = strdup(name);
	struct devmap *dm = malloc(sizeof(*dm));
	if (dm) {
	    dm->major = major(stb->st_rdev);
	    dm->minor = minor(stb->st_rdev);
	    dm->name = n;
	    dm->next = devlist;
	    devlist = dm;
	}
    }
    return 0;
}

/*
 * Find a block device with the right major/minor number.
 * Avoid /dev/mdNN and /dev/md/dNN if possible
 */
char *map_dev(int major, int minor)
{
	struct devmap *p;
	char *std = NULL;
	if (!devlist_ready) {
#ifndef __dietlibc__
		nftw("/dev", add_dev, 10, FTW_PHYS);
#else
		ftw("/dev", add_dev, 10);
#endif
		devlist_ready=1;
	}

	for (p=devlist; p; p=p->next)
		if (p->major == major &&
		    p->minor == minor) {
			if (is_standard(p->name, NULL))
				std = p->name;
			else
				return p->name;
		}
	return std;
}

#endif

unsigned long calc_csum(void *super, int bytes)
{
	unsigned long long newcsum = 0;
	int i;
	unsigned int csum;
	unsigned int *superc = (unsigned int*) super;

	for(i=0; i<bytes/4; i++)
		newcsum+= superc[i];
	csum = (newcsum& 0xffffffff) + (newcsum>>32);
#ifdef __alpha__
/* The in-kernel checksum calculation is always 16bit on 
 * the alpha, though it is 32 bit on i386...
 * I wonder what it is elsewhere... (it uses and API in
 * a way that it shouldn't).
 */
	csum = (csum & 0xffff) + (csum >> 16);
	csum = (csum & 0xffff) + (csum >> 16);
#endif
	return csum;
}

char *human_size(long long bytes)
{
	static char buf[30];
	

	if (bytes < 5000*1024)
		buf[0]=0;
	else if (bytes < 2*1024LL*1024LL*1024LL)
		sprintf(buf, " (%ld.%02ld MiB %ld.%02ld MB)",
			(long)(bytes>>20),
			(long)((bytes&0xfffff)+0x100000/200)/(0x100000/100),
			(long)(bytes/1000/1000),
			(long)(((bytes%1000000)+5000)/10000)
			);
	else
		sprintf(buf, " (%ld.%02ld GiB %ld.%02ld GB)",
			(long)(bytes>>30),
			(long)(((bytes>>10)&0xfffff)+0x100000/200)/(0x100000/100),
			(long)(bytes/1000LL/1000LL/1000LL),
			(long)((((bytes/1000)%1000000)+5000)/10000)
			);
	return buf;
}

char *human_size_brief(long long bytes)
{
	static char buf[30];
	

	if (bytes < 5000*1024)
		sprintf(buf, "%ld.%02ldKiB",
			(long)(bytes>>10), (long)(((bytes&1023)*100+512)/1024)
			);
	else if (bytes < 2*1024LL*1024LL*1024LL)
		sprintf(buf, "%ld.%02ldMiB",
			(long)(bytes>>20),
			(long)((bytes&0xfffff)+0x100000/200)/(0x100000/100)
			);
	else
		sprintf(buf, "%ld.%02ldGiB",
			(long)(bytes>>30),
			(long)(((bytes>>10)&0xfffff)+0x100000/200)/(0x100000/100)
			);
	return buf;
}

int get_mdp_major(void)
{
static int mdp_major = -1;
	FILE *fl;
	char *w;
	int have_block = 0;
	int have_devices = 0;
	int last_num = -1;

	if (mdp_major != -1)
		return mdp_major;
	fl = fopen("/proc/devices", "r");
	if (!fl)
		return -1;
	while ((w = conf_word(fl, 1))) {
		if (have_block && strcmp(w, "devices:")==0)
			have_devices = 1;
		have_block =  (strcmp(w, "Block")==0);
		if (isdigit(w[0]))
			last_num = atoi(w);
		if (have_devices && strcmp(w, "mdp")==0)
			mdp_major = last_num;
		free(w);
	}
	fclose(fl);
	return mdp_major;
}


char *get_md_name(int dev)
{
	/* find /dev/md%d or /dev/md/%d or make a device /dev/.tmp.md%d */
	/* if dev < 0, want /dev/md/d%d or find mdp in /proc/devices ... */
	static char devname[50];
	struct stat stb;
	dev_t rdev;
	char *dn;

	if (dev < 0) {
		int mdp =  get_mdp_major();
		if (mdp < 0) return NULL;
		rdev = makedev(mdp, (-1-dev)<<6);
		sprintf(devname, "/dev/md/d%d", -1-dev);
		if (stat(devname, &stb) == 0
		    && (S_IFMT&stb.st_mode) == S_IFBLK
		    && (stb.st_rdev == rdev))
			return devname;
	} else {
		rdev = makedev(MD_MAJOR, dev);
		sprintf(devname, "/dev/md%d", dev);
		if (stat(devname, &stb) == 0
		    && (S_IFMT&stb.st_mode) == S_IFBLK
		    && (stb.st_rdev == rdev))
			return devname;

		sprintf(devname, "/dev/md/%d", dev);
		if (stat(devname, &stb) == 0
		    && (S_IFMT&stb.st_mode) == S_IFBLK
		    && (stb.st_rdev == rdev))
			return devname;
	}
	dn = map_dev(major(rdev), minor(rdev));
	if (dn)
		return dn;
	sprintf(devname, "/dev/.tmp.md%d", dev);
	if (mknod(devname, S_IFBLK | 0600, rdev) == -1)
		if (errno != EEXIST)
			return NULL;

	if (stat(devname, &stb) == 0
	    && (S_IFMT&stb.st_mode) == S_IFBLK
	    && (stb.st_rdev == rdev))
		return devname;
	unlink(devname);
	return NULL;
}

void put_md_name(char *name)
{
	if (strncmp(name, "/dev/.tmp.md", 12)==0)
		unlink(name);
}


struct superswitch *superlist[] = { &super0, &super1, NULL };

struct supertype *super_by_version(int vers, int minor)
{
	struct supertype *st = malloc(sizeof(*st));
	if (!st) return st;
	if (vers == 0)
		st->ss = &super0;

	if (vers == 1)
		st->ss = &super1;
	st->minor_version = minor;
	return st;
}

struct supertype *guess_super(int fd)
{
	/* try each load_super to find the best match,
	 * and return the best superswitch
	 */
	struct superswitch  *ss;
	struct supertype *st;
	unsigned long besttime = 0;
	int bestsuper = -1;
	
	void *sbp = NULL;
	int i;

	st = malloc(sizeof(*st));
	memset(st, 0, sizeof(*st));
	for (i=0 ; superlist[i]; i++) {
		int rv;
		ss = superlist[i];
		rv = ss->load_super(st, fd, &sbp, NULL);
		if (rv == 0) {
			struct mdinfo info;
			ss->getinfo_super(&info, sbp);
			if (bestsuper == -1 ||
			    besttime < info.array.ctime) {
				bestsuper = i;
				besttime = info.array.ctime;
			}
			st->ss = NULL;
			free(sbp);
		}
	}
	if (bestsuper != -1) {
		int rv;
		rv = superlist[bestsuper]->load_super(st, fd, &sbp, NULL);
		if (rv == 0) {
			free(sbp);
			return st;
		}
	}
	free(st);
	return NULL;
}
Commit	Line	Data
64c4757e	1	/*
9a9dab36	2	* mdadm - manage Linux "md" devices aka RAID arrays.
64c4757e	3	*
cd29a5c8	4	* Copyright (C) 2001-2002 Neil Brown <neilb@cse.unsw.edu.au>
64c4757e NB	5	*
	6	*
	7	* This program is free software; you can redistribute it and/or modify
	8	* it under the terms of the GNU General Public License as published by
	9	* the Free Software Foundation; either version 2 of the License, or
	10	* (at your option) any later version.
	11	*
	12	* This program is distributed in the hope that it will be useful,
	13	* but WITHOUT ANY WARRANTY; without even the implied warranty of
	14	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
	15	* GNU General Public License for more details.
	16	*
	17	* You should have received a copy of the GNU General Public License
	18	* along with this program; if not, write to the Free Software
	19	* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
	20	*
	21	* Author: Neil Brown
	22	* Email: <neilb@cse.unsw.edu.au>
	23	* Paper: Neil Brown
	24	* School of Computer Science and Engineering
	25	* The University of New South Wales
	26	* Sydney, 2052
	27	* Australia
	28	*/
	29
9a9dab36	30	#include "mdadm.h"
64c4757e NB	31	#include "md_p.h"
64c4757e NB	32	#include <sys/utsname.h>
98c6faba	33	#include <ctype.h>
64c4757e NB	34
	35	/*
	36	* Parse a 128 bit uuid in 4 integers
	37	* format is 32 hexx nibbles with options :.<space> separator
	38	* If not exactly 32 hex digits are found, return 0
	39	* else return 1
	40	*/
	41	int parse_uuid(char *str, int uuid[4])
	42	{
	43	int hit = 0; /* number of Hex digIT */
	44	int i;
	45	char c;
	46	for (i=0; i<4; i++) uuid[i]=0;
	47
	48	while ((c= *str++)) {
	49	int n;
	50	if (c>='0' && c<='9')
	51	n = c-'0';
	52	else if (c>='a' && c <= 'f')
	53	n = 10 + c - 'a';
	54	else if (c>='A' && c <= 'F')
	55	n = 10 + c - 'A';
	56	else if (strchr(":. -", c))
	57	continue;
	58	else return 0;
	59
82b27616 NB	60	if (hit<32) {
	61	uuid[hit/8] <<= 4;
	62	uuid[hit/8] += n;
	63	}
64c4757e NB	64	hit++;
	65	}
	66	if (hit == 32)
	67	return 1;
	68	return 0;
	69
	70	}
	71
	72
	73	/*
	74	* Get the md version number.
	75	* We use the RAID_VERSION ioctl if it is supported
	76	* If not, but we have a block device with major '9', we assume
	77	* 0.36.0
	78	*
	79	* Return version number as 24 but number - assume version parts
	80	* always < 255
	81	*/
	82
	83	int md_get_version(int fd)
	84	{
	85	struct stat stb;
	86	mdu_version_t vers;
	87
	88	if (fstat(fd, &stb)<0)
	89	return -1;
	90	if ((S_IFMT&stb.st_mode) != S_IFBLK)
	91	return -1;
	92
	93	if (ioctl(fd, RAID_VERSION, &vers) == 0)
682c7051	94	return (vers.major10000) + (vers.minor100) + vers.patchlevel;
5787fa49 NB	95	if (errno == EACCES)
5787fa49 NB	96	return -1;
0df46c2a	97	if (major(stb.st_rdev) == MD_MAJOR)
682c7051	98	return (3600);
64c4757e NB	99	return -1;
	100	}
	101
	102
	103	int get_linux_version()
	104	{
	105	struct utsname name;
98c6faba	106	char *cp;
64c4757e NB	107	int a,b,c;
	108	if (uname(&name) <0)
	109	return -1;
	110
98c6faba NB	111	cp = name.release;
	112	a = strtoul(cp, &cp, 10);
	113	if (*cp != '.') return -1;
	114	b = strtoul(cp+1, &cp, 10);
	115	if (*cp != '.') return -1;
	116	c = strtoul(cp+1, NULL, 10);
	117
682c7051	118	return (a1000000)+(b1000)+c;
64c4757e NB	119	}
	120
	121	int enough(int level, int raid_disks, int avail_disks)
	122	{
	123	switch (level) {
e5329c37 NB	124	case 10: return 1; /* a lie, but it is hard to tell */
e5329c37 NB	125
e0d19036 NB	126	case -4:
e0d19036 NB	127	return avail_disks>= 1;
64c4757e NB	128	case -1:
	129	case 0:
	130	return avail_disks == raid_disks;
	131	case 1:
	132	return avail_disks >= 1;
	133	case 4:
	134	case 5:
	135	return avail_disks >= raid_disks-1;
98c6faba NB	136	case 6:
98c6faba NB	137	return avail_disks >= raid_disks-2;
64c4757e NB	138	default:
	139	return 0;
	140	}
	141	}
	142
	143	int same_uuid(int a[4], int b[4])
	144	{
	145	if (a[0]==b[0] &&
	146	a[1]==b[1] &&
	147	a[2]==b[2] &&
	148	a[3]==b[3])
	149	return 1;
	150	return 0;
	151	}
	152
682c7051 NB	153	int check_ext2(int fd, char *name)
	154	{
	155	/*
	156	* Check for an ext2fs file system.
	157	* Superblock is always 1K at 1K offset
	158	*
	159	* s_magic is le16 at 56 == 0xEF53
	160	* report mtime - le32 at 44
	161	* blocks - le32 at 4
	162	* logblksize - le32 at 24
	163	*/
	164	unsigned char sb[1024];
	165	time_t mtime;
	166	int size, bsize;
	167	if (lseek(fd, 1024,0)!= 1024)
	168	return 0;
	169	if (read(fd, sb, 1024)!= 1024)
	170	return 0;
	171	if (sb[56] != 0x53 \|\| sb[57] != 0xef)
	172	return 0;
	173
	174	mtime = sb[44]\|(sb[45]\|(sb[46]\|sb[47]<<8)<<8)<<8;
	175	bsize = sb[24]\|(sb[25]\|(sb[26]\|sb[27]<<8)<<8)<<8;
	176	size = sb[4]\|(sb[5]\|(sb[6]\|sb[7]<<8)<<8)<<8;
	177	fprintf(stderr, Name ": %s appears to contain an ext2fs file system\n",
	178	name);
	179	fprintf(stderr," size=%dK mtime=%s",
	180	size*(1<<bsize), ctime(&mtime));
	181	return 1;
	182	}
	183
	184	int check_reiser(int fd, char *name)
	185	{
	186	/*
	187	* superblock is at 64K
	188	* size is 1024;
	189	* Magic string "ReIsErFs" or "ReIsEr2Fs" at 52
	190	*
	191	*/
	192	unsigned char sb[1024];
	193	int size;
	194	if (lseek(fd, 641024, 0) != 641024)
	195	return 0;
	196	if (read(fd, sb, 1024) != 1024)
	197	return 0;
	198	if (strncmp(sb+52, "ReIsErFs",8)!=0 &&
	199	strncmp(sb+52, "ReIsEr2Fs",9)!=0)
	200	return 0;
	201	fprintf(stderr, Name ": %s appears to contain a reiserfs file system\n",name);
	202	size = sb[0]\|(sb[1]\|(sb[2]\|sb[3]<<8)<<8)<<8;
	203	fprintf(stderr, " size = %dK\n", size*4);
	204
	205	return 1;
	206	}
	207
	208	int check_raid(int fd, char *name)
	209	{
4b1ac34b NB	210	void *super;
4b1ac34b NB	211	struct mdinfo info;
682c7051	212	time_t crtime;
82d9eba6	213	struct supertype *st = guess_super(fd);
f9ce90ba	214
82d9eba6 NB	215	if (!st) return 0;
	216	st->ss->load_super(st, fd, &super, name);
	217	/* Looks like a raid array .. */
	218	fprintf(stderr, Name ": %s appears to be part of a raid array:\n",
	219	name);
	220	st->ss->getinfo_super(&info, super);
	221	free(super);
	222	crtime = info.array.ctime;
	223	fprintf(stderr, " level=%d devices=%d ctime=%s",
	224	info.array.level, info.array.raid_disks, ctime(&crtime));
	225	return 1;
682c7051 NB	226	}
682c7051 NB	227
682c7051 NB	228	int ask(char *mesg)
	229	{
	230	char *add = "";
	231	int i;
	232	for (i=0; i<5; i++) {
	233	char buf[100];
	234	fprintf(stderr, "%s%s", mesg, add);
	235	fflush(stderr);
	236	if (fgets(buf, 100, stdin)==NULL)
	237	return 0;
	238	if (buf[0]=='y' \|\| buf[0]=='Y')
	239	return 1;
	240	if (buf[0]=='n' \|\| buf[0]=='N')
	241	return 0;
	242	add = "(y/n) ";
	243	}
	244	fprintf(stderr, Name ": assuming 'no'\n");
	245	return 0;
	246	}
	247
	248	char map_num(mapping_t map, int num)
	249	{
	250	while (map->name) {
	251	if (map->num == num)
	252	return map->name;
	253	map++;
	254	}
	255	return NULL;
	256	}
	257
	258	int map_name(mapping_t map, char name)
	259	{
	260	while (map->name) {
	261	if (strcmp(map->name, name)==0)
	262	return map->num;
	263	map++;
	264	}
98c6faba	265	return UnSet;
682c7051	266	}
82b27616	267
e5329c37	268
8d80900b	269	int is_standard(char dev, int nump)
e5329c37 NB	270	{
	271	/* tests if dev is a "standard" md dev name.
	272	* i.e if the last component is "/dNN" or "/mdNN",
	273	* where NN is a string of digits
	274	*/
8d80900b NB	275	char *d = strrchr(dev, '/');
	276	int type=0;
	277	int num;
	278	if (!d)
e5329c37	279	return 0;
8d80900b NB	280	if (strncmp(d, "/d",2)==0)
	281	d += 2, type=1; /* /dev/md/dN{pM} */
	282	else if (strncmp(d, "/md_d", 5)==0)
	283	d += 5, type=1; /* /dev/md_dNpM */
	284	else if (strncmp(d, "/md", 3)==0)
	285	d += 3, type=-1; /* /dev/mdN */
	286	else if (d-dev > 3 && strncmp(d-2, "md/", 3)==0)
	287	type = -1; /* /dev/md/N */
e5329c37 NB	288	else
e5329c37 NB	289	return 0;
8d80900b	290	if (!*d)
e5329c37	291	return 0;
8d80900b NB	292	num = atoi(d);
	293	while (isdigit(*d))
	294	d++;
	295	if (*d)
e5329c37	296	return 0;
8d80900b NB	297	if (nump) *nump = num;
	298
	299	return type;
e5329c37 NB	300	}
	301
	302
82b27616 NB	303	/*
	304	* convert a major/minor pair for a block device into a name in /dev, if possible.
	305	* On the first call, walk /dev collecting name.
	306	* Put them in a simple linked listfor now.
	307	*/
	308	struct devmap {
	309	int major, minor;
	310	char *name;
	311	struct devmap *next;
	312	} *devlist = NULL;
	313	int devlist_ready = 0;
	314
5787fa49 NB	315	#ifdef UCLIBC
	316	char *map_dev(int major, int minor)
	317	{
	318	#if 0
	319	fprintf(stderr, "Warning - fail to map %d,%d to a device name\n",
	320	major, minor);
	321	#endif
	322	return NULL;
	323	}
	324	#else
82b27616 NB	325	#define __USE_XOPEN_EXTENDED
	326	#include <ftw.h>
	327
	328
98c6faba	329	#ifndef __dietlibc__
82b27616	330	int add_dev(const char name, const struct stat stb, int flag, struct FTW *s)
98c6faba NB	331	#else
	332	int add_dev(const char name, const struct stat stb, int flag)
	333	#endif
82b27616 NB	334	{
	335	if ((stb->st_mode&S_IFMT)== S_IFBLK) {
	336	char *n = strdup(name);
	337	struct devmap dm = malloc(sizeof(dm));
	338	if (dm) {
0df46c2a NB	339	dm->major = major(stb->st_rdev);
0df46c2a NB	340	dm->minor = minor(stb->st_rdev);
82b27616 NB	341	dm->name = n;
	342	dm->next = devlist;
	343	devlist = dm;
	344	}
	345	}
	346	return 0;
	347	}
	348
dd0781e5 NB	349	/*
dd0781e5 NB	350	* Find a block device with the right major/minor number.
8d80900b	351	* Avoid /dev/mdNN and /dev/md/dNN if possible
dd0781e5	352	*/
82b27616 NB	353	char *map_dev(int major, int minor)
82b27616 NB	354	{
dd0781e5 NB	355	struct devmap *p;
	356	char *std = NULL;
	357	if (!devlist_ready) {
98c6faba	358	#ifndef __dietlibc__
dd0781e5	359	nftw("/dev", add_dev, 10, FTW_PHYS);
98c6faba	360	#else
dd0781e5	361	ftw("/dev", add_dev, 10);
98c6faba	362	#endif
dd0781e5 NB	363	devlist_ready=1;
dd0781e5 NB	364	}
82b27616	365
dd0781e5 NB	366	for (p=devlist; p; p=p->next)
	367	if (p->major == major &&
	368	p->minor == minor) {
8d80900b	369	if (is_standard(p->name, NULL))
dd0781e5 NB	370	std = p->name;
	371	else
	372	return p->name;
	373	}
	374	return std;
82b27616 NB	375	}
82b27616 NB	376
5787fa49	377	#endif
82b27616	378
4b1ac34b	379	unsigned long calc_csum(void *super, int bytes)
82b27616	380	{
56eb10c0	381	unsigned long long newcsum = 0;
82b27616	382	int i;
4b1ac34b NB	383	unsigned int csum;
4b1ac34b NB	384	unsigned int superc = (unsigned int) super;
82b27616	385
4b1ac34b	386	for(i=0; i<bytes/4; i++)
82b27616 NB	387	newcsum+= superc[i];
82b27616 NB	388	csum = (newcsum& 0xffffffff) + (newcsum>>32);
570c0542 NB	389	#ifdef __alpha__
	390	/* The in-kernel checksum calculation is always 16bit on
	391	* the alpha, though it is 32 bit on i386...
	392	* I wonder what it is elsewhere... (it uses and API in
	393	* a way that it shouldn't).
	394	*/
	395	csum = (csum & 0xffff) + (csum >> 16);
	396	csum = (csum & 0xffff) + (csum >> 16);
	397	#endif
82b27616 NB	398	return csum;
82b27616 NB	399	}
cd29a5c8	400
56eb10c0	401	char *human_size(long long bytes)
cd29a5c8 NB	402	{
cd29a5c8 NB	403	static char buf[30];
56eb10c0	404
cd29a5c8	405
56eb10c0	406	if (bytes < 5000*1024)
cd29a5c8	407	buf[0]=0;
56eb10c0	408	else if (bytes < 21024LL1024LL*1024LL)
e0d19036	409	sprintf(buf, " (%ld.%02ld MiB %ld.%02ld MB)",
56eb10c0	410	(long)(bytes>>20),
bd526cee	411	(long)((bytes&0xfffff)+0x100000/200)/(0x100000/100),
56eb10c0	412	(long)(bytes/1000/1000),
bd526cee	413	(long)(((bytes%1000000)+5000)/10000)
56eb10c0	414	);
cd29a5c8	415	else
e0d19036	416	sprintf(buf, " (%ld.%02ld GiB %ld.%02ld GB)",
56eb10c0	417	(long)(bytes>>30),
bd526cee	418	(long)(((bytes>>10)&0xfffff)+0x100000/200)/(0x100000/100),
56eb10c0	419	(long)(bytes/1000LL/1000LL/1000LL),
5787fa49	420	(long)((((bytes/1000)%1000000)+5000)/10000)
56eb10c0	421	);
cd29a5c8 NB	422	return buf;
cd29a5c8 NB	423	}
e0d19036 NB	424
	425	char *human_size_brief(long long bytes)
	426	{
	427	static char buf[30];
	428
	429
	430	if (bytes < 5000*1024)
	431	sprintf(buf, "%ld.%02ldKiB",
bd526cee	432	(long)(bytes>>10), (long)(((bytes&1023)*100+512)/1024)
e0d19036 NB	433	);
	434	else if (bytes < 21024LL1024LL*1024LL)
	435	sprintf(buf, "%ld.%02ldMiB",
	436	(long)(bytes>>20),
bd526cee	437	(long)((bytes&0xfffff)+0x100000/200)/(0x100000/100)
e0d19036 NB	438	);
	439	else
	440	sprintf(buf, "%ld.%02ldGiB",
	441	(long)(bytes>>30),
bd526cee	442	(long)(((bytes>>10)&0xfffff)+0x100000/200)/(0x100000/100)
e0d19036 NB	443	);
	444	return buf;
	445	}
	446
dd0781e5	447	int get_mdp_major(void)
98c6faba	448	{
dd0781e5 NB	449	static int mdp_major = -1;
dd0781e5 NB	450	FILE *fl;
98c6faba NB	451	char *w;
	452	int have_block = 0;
	453	int have_devices = 0;
	454	int last_num = -1;
dd0781e5 NB	455
	456	if (mdp_major != -1)
	457	return mdp_major;
	458	fl = fopen("/proc/devices", "r");
98c6faba	459	if (!fl)
dd0781e5	460	return -1;
98c6faba NB	461	while ((w = conf_word(fl, 1))) {
	462	if (have_block && strcmp(w, "devices:")==0)
	463	have_devices = 1;
	464	have_block = (strcmp(w, "Block")==0);
	465	if (isdigit(w[0]))
	466	last_num = atoi(w);
	467	if (have_devices && strcmp(w, "mdp")==0)
	468	mdp_major = last_num;
	469	free(w);
	470	}
	471	fclose(fl);
dd0781e5	472	return mdp_major;
98c6faba NB	473	}
	474
	475
e0d19036	476
e0d19036 NB	477	char *get_md_name(int dev)
	478	{
	479	/* find /dev/md%d or /dev/md/%d or make a device /dev/.tmp.md%d */
98c6faba	480	/* if dev < 0, want /dev/md/d%d or find mdp in /proc/devices ... */
e0d19036 NB	481	static char devname[50];
e0d19036 NB	482	struct stat stb;
98c6faba	483	dev_t rdev;
dd0781e5	484	char *dn;
98c6faba NB	485
98c6faba NB	486	if (dev < 0) {
dd0781e5 NB	487	int mdp = get_mdp_major();
dd0781e5 NB	488	if (mdp < 0) return NULL;
0df46c2a	489	rdev = makedev(mdp, (-1-dev)<<6);
98c6faba NB	490	sprintf(devname, "/dev/md/d%d", -1-dev);
	491	if (stat(devname, &stb) == 0
	492	&& (S_IFMT&stb.st_mode) == S_IFBLK
	493	&& (stb.st_rdev == rdev))
	494	return devname;
	495	} else {
0df46c2a	496	rdev = makedev(MD_MAJOR, dev);
98c6faba NB	497	sprintf(devname, "/dev/md%d", dev);
	498	if (stat(devname, &stb) == 0
	499	&& (S_IFMT&stb.st_mode) == S_IFBLK
	500	&& (stb.st_rdev == rdev))
	501	return devname;
	502
	503	sprintf(devname, "/dev/md/%d", dev);
	504	if (stat(devname, &stb) == 0
	505	&& (S_IFMT&stb.st_mode) == S_IFBLK
	506	&& (stb.st_rdev == rdev))
	507	return devname;
	508	}
8d80900b	509	dn = map_dev(major(rdev), minor(rdev));
dd0781e5 NB	510	if (dn)
dd0781e5 NB	511	return dn;
e0d19036 NB	512	sprintf(devname, "/dev/.tmp.md%d", dev);
e0d19036 NB	513	if (mknod(devname, S_IFBLK \| 0600, rdev) == -1)
dd0781e5 NB	514	if (errno != EEXIST)
dd0781e5 NB	515	return NULL;
e0d19036 NB	516
	517	if (stat(devname, &stb) == 0
	518	&& (S_IFMT&stb.st_mode) == S_IFBLK
	519	&& (stb.st_rdev == rdev))
	520	return devname;
	521	unlink(devname);
	522	return NULL;
	523	}
	524
	525	void put_md_name(char *name)
	526	{
	527	if (strncmp(name, "/dev/.tmp.md", 12)==0)
	528	unlink(name);
	529	}
f9ce90ba NB	530
	531
	532
	533
82d9eba6	534	struct superswitch *superlist[] = { &super0, &super1, NULL };
f9ce90ba	535
82d9eba6	536	struct supertype *super_by_version(int vers, int minor)
f9ce90ba	537	{
82d9eba6 NB	538	struct supertype st = malloc(sizeof(st));
	539	if (!st) return st;
	540	if (vers == 0)
	541	st->ss = &super0;
	542
	543	if (vers == 1)
	544	st->ss = &super1;
	545	st->minor_version = minor;
	546	return st;
f9ce90ba NB	547	}
f9ce90ba NB	548
82d9eba6	549	struct supertype *guess_super(int fd)
f9ce90ba NB	550	{
	551	/* try each load_super to find the best match,
	552	* and return the best superswitch
	553	*/
82d9eba6 NB	554	struct superswitch *ss;
82d9eba6 NB	555	struct supertype *st;
570c0542 NB	556	unsigned long besttime = 0;
570c0542 NB	557	int bestsuper = -1;
82d9eba6	558
f9ce90ba NB	559	void *sbp = NULL;
	560	int i;
	561
82d9eba6 NB	562	st = malloc(sizeof(*st));
82d9eba6 NB	563	memset(st, 0, sizeof(*st));
f9ce90ba NB	564	for (i=0 ; superlist[i]; i++) {
	565	int rv;
	566	ss = superlist[i];
82d9eba6	567	rv = ss->load_super(st, fd, &sbp, NULL);
570c0542 NB	568	if (rv == 0) {
	569	struct mdinfo info;
	570	ss->getinfo_super(&info, sbp);
	571	if (bestsuper == -1 \|\|
	572	besttime < info.array.ctime) {
	573	bestsuper = i;
	574	besttime = info.array.ctime;
570c0542	575	}
a825febc	576	st->ss = NULL;
570c0542 NB	577	free(sbp);
	578	}
	579	}
	580	if (bestsuper != -1) {
	581	int rv;
	582	rv = superlist[bestsuper]->load_super(st, fd, &sbp, NULL);
f9ce90ba NB	583	if (rv == 0) {
f9ce90ba NB	584	free(sbp);
82d9eba6	585	return st;
f9ce90ba NB	586	}
f9ce90ba NB	587	}
570c0542	588	free(st);
f9ce90ba NB	589	return NULL;
f9ce90ba NB	590	}