[thirdparty/mdadm.git] / bitmap.c

/*
 * mdadm - manage Linux "md" devices aka RAID arrays.
 *
 * Copyright (C) 2004 Paul Clements, SteelEye Technology, Inc.
 *
 *    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
 */

#include "mdadm.h"

static inline void sb_le_to_cpu(bitmap_super_t *sb)
{
	sb->magic = __le32_to_cpu(sb->magic);
	sb->version = __le32_to_cpu(sb->version);
	/* uuid gets no translation */
	sb->events = __le64_to_cpu(sb->events);
	sb->events_cleared = __le64_to_cpu(sb->events_cleared);
	sb->state = __le32_to_cpu(sb->state);
	sb->chunksize = __le32_to_cpu(sb->chunksize);
	sb->daemon_sleep = __le32_to_cpu(sb->daemon_sleep);
	sb->sync_size = __le64_to_cpu(sb->sync_size);
	sb->write_behind = __le32_to_cpu(sb->write_behind);
	sb->nodes = __le32_to_cpu(sb->nodes);
	sb->sectors_reserved = __le32_to_cpu(sb->sectors_reserved);
}

static inline void sb_cpu_to_le(bitmap_super_t *sb)
{
	sb_le_to_cpu(sb); /* these are really the same thing */
}

mapping_t bitmap_states[] = {
	{ "OK", 0 },
	{ "Out of date", 2 },
	{ NULL, -1 }
};

static const char *bitmap_state(int state_num)
{
	char *state = map_num(bitmap_states, state_num);
	return state ? state : "Unknown";
}

static const char *human_chunksize(unsigned long bytes)
{
	static char buf[16];
	char *suffixes[] = { "B", "KB", "MB", "GB", "TB", NULL };
	int i = 0;

	while (bytes >> 10) {
		bytes >>= 10;
		i++;
	}

	snprintf(buf, sizeof(buf), "%lu %s", bytes, suffixes[i]);

	return buf;
}

typedef struct bitmap_info_s {
	bitmap_super_t sb;
	unsigned long long total_bits;
	unsigned long long dirty_bits;
} bitmap_info_t;

/* count the dirty bits in the first num_bits of byte */
static inline int count_dirty_bits_byte(char byte, int num_bits)
{
	int num = 0;

	switch (num_bits) { /* fall through... */
		case 8:	if (byte & 128) num++;
		case 7:	if (byte &  64) num++;
		case 6:	if (byte &  32) num++;
		case 5:	if (byte &  16) num++;
		case 4:	if (byte &   8) num++;
		case 3: if (byte &   4) num++;
		case 2:	if (byte &   2) num++;
		case 1:	if (byte &   1) num++;
		default: break;
	}

	return num;
}

static int count_dirty_bits(char *buf, int num_bits)
{
	int i, num = 0;

	for (i = 0; i < num_bits / 8; i++)
		num += count_dirty_bits_byte(buf[i], 8);

	if (num_bits % 8) /* not an even byte boundary */
		num += count_dirty_bits_byte(buf[i], num_bits % 8);

	return num;
}

static bitmap_info_t *bitmap_fd_read(int fd, int brief)
{
	/* Note: fd might be open O_DIRECT, so we must be
	 * careful to align reads properly
	 */
	unsigned long long total_bits = 0, read_bits = 0, dirty_bits = 0;
	bitmap_info_t *info;
	void *buf;
	unsigned int n, skip;

	if (posix_memalign(&buf, 4096, 8192) != 0) {
		pr_err("failed to allocate 8192 bytes\n");
		return NULL;
	}
	n = read(fd, buf, 8192);

	info = xmalloc(sizeof(*info));

	if (n < sizeof(info->sb)) {
		pr_err("failed to read superblock of bitmap file: %s\n", strerror(errno));
		free(info);
		free(buf);
		return NULL;
	}
	memcpy(&info->sb, buf, sizeof(info->sb));
	skip = sizeof(info->sb);

	sb_le_to_cpu(&info->sb); /* convert superblock to CPU byte ordering */

	if (brief || info->sb.sync_size == 0 || info->sb.chunksize == 0)
		goto out;

	/* read the rest of the file counting total bits and dirty bits --
	 * we stop when either:
	 * 1) we hit EOF, in which case we assume the rest of the bits (if any)
	 *    are dirty
	 * 2) we've read the full bitmap, in which case we ignore any trailing
	 *    data in the file
	 */
	total_bits = bitmap_bits(info->sb.sync_size, info->sb.chunksize);

	while(read_bits < total_bits) {
		unsigned long long remaining = total_bits - read_bits;

		if (n == 0) {
			n = read(fd, buf, 8192);
			skip = 0;
			if (n <= 0)
				break;
		}
		if (remaining > (n-skip) * 8) /* we want the full buffer */
			remaining = (n-skip) * 8;

		dirty_bits += count_dirty_bits(buf+skip, remaining);

		read_bits += remaining;
		n = 0;
	}

	if (read_bits < total_bits) { /* file truncated... */
		pr_err("WARNING: bitmap file is not large enough for array size %llu!\n\n",
			(unsigned long long)info->sb.sync_size);
		total_bits = read_bits;
	}
out:
	free(buf);
	info->total_bits = total_bits;
	info->dirty_bits = dirty_bits;
	return info;
}

static int
bitmap_file_open(char *filename, struct supertype **stp, int node_num, int fd)
{
	struct stat stb;
	struct supertype *st = *stp;

	/* won't re-open filename when (fd >= 0) */
	if (fd < 0)
		fd = open(filename, O_RDONLY|O_DIRECT);
	if (fd < 0) {
		pr_err("failed to open bitmap file %s: %s\n",
		       filename, strerror(errno));
		return -1;
	}

	if (fstat(fd, &stb) < 0) {
		pr_err("fstat failed for %s: %s\n", filename, strerror(errno));
		close(fd);
		return -1;
	}
	if ((stb.st_mode & S_IFMT) == S_IFBLK) {
		/* block device, so we are probably after an internal bitmap */
		if (!st)
			st = guess_super(fd);
		if (!st) {
			/* just look at device... */
			lseek(fd, 0, 0);
		} else if (!st->ss->locate_bitmap) {
			pr_err("No bitmap possible with %s metadata\n",
				st->ss->name);
			close(fd);
			return -1;
		} else {
			if (st->ss->locate_bitmap(st, fd, node_num)) {
				pr_err("%s doesn't have bitmap\n", filename);
				close(fd);
				fd = -1;
			}
		}
		*stp = st;
	}

	return fd;
}

static __u32 swapl(__u32 l)
{
	char *c = (char*)&l;
	char t= c[0];
	c[0] = c[3];
	c[3] = t;

	t = c[1];
	c[1] = c[2];
	c[2] = t;
	return l;
}
int ExamineBitmap(char *filename, int brief, struct supertype *st)
{
	/*
	 * Read the bitmap file and display its contents
	 */

	bitmap_super_t *sb;
	bitmap_info_t *info;
	int rv = 1;
	char buf[64];
	int swap;
	int fd, i;
	__u32 uuid32[4];

	fd = bitmap_file_open(filename, &st, 0, -1);
	if (fd < 0)
		return rv;

	info = bitmap_fd_read(fd, brief);
	if (!info)
		return rv;
	sb = &info->sb;
	if (sb->magic != BITMAP_MAGIC) {
		pr_err("This is an md array.  To view a bitmap you need to examine\n");
		pr_err("a member device, not the array.\n");
		pr_err("Reporting bitmap that would be used if this array were used\n");
		pr_err("as a member of some other array\n");
	}
	printf("        Filename : %s\n", filename);
	printf("           Magic : %08x\n", sb->magic);
	if (sb->magic != BITMAP_MAGIC) {
		pr_err("invalid bitmap magic 0x%x, the bitmap file appears\n",
		       sb->magic);
		pr_err("to be corrupted or missing.\n");
	}
	printf("         Version : %d\n", sb->version);
	if (sb->version < BITMAP_MAJOR_LO ||
	    sb->version > BITMAP_MAJOR_CLUSTERED) {
		pr_err("unknown bitmap version %d, either the bitmap file\n",
		       sb->version);
		pr_err("is corrupted or you need to upgrade your tools\n");
		goto free_info;
	}

	rv = 0;
	if (st)
		swap = st->ss->swapuuid;
	else
#if __BYTE_ORDER == BIG_ENDIAN
		swap = 0;
#else
		swap = 1;
#endif
	memcpy(uuid32, sb->uuid, 16);
	if (swap)
		printf("            UUID : %08x:%08x:%08x:%08x\n",
		       swapl(uuid32[0]),
		       swapl(uuid32[1]),
		       swapl(uuid32[2]),
		       swapl(uuid32[3]));
	else
		printf("            UUID : %08x:%08x:%08x:%08x\n",
		       uuid32[0],
		       uuid32[1],
		       uuid32[2],
		       uuid32[3]);

	if (sb->nodes == 0) {
		printf("          Events : %llu\n", (unsigned long long)sb->events);
		printf("  Events Cleared : %llu\n", (unsigned long long)sb->events_cleared);
		printf("           State : %s\n", bitmap_state(sb->state));

	}

	printf("       Chunksize : %s\n", human_chunksize(sb->chunksize));
	printf("          Daemon : %ds flush period\n", sb->daemon_sleep);
	if (sb->write_behind)
		sprintf(buf, "Allow write behind, max %d", sb->write_behind);
	else
		sprintf(buf, "Normal");
	printf("      Write Mode : %s\n", buf);
	printf("       Sync Size : %llu%s\n", (unsigned long long)sb->sync_size/2,
					human_size(sb->sync_size * 512));

	if (sb->nodes == 0) {
		if (brief)
			goto free_info;
		printf("          Bitmap : %llu bits (chunks), %llu dirty (%2.1f%%)\n",
		       info->total_bits, info->dirty_bits,
		       100.0 * info->dirty_bits / (info->total_bits?:1));
	} else {
		printf("   Cluster nodes : %d\n", sb->nodes);
		printf("    Cluster name : %-64s\n", sb->cluster_name);
		for (i = 0; i < (int)sb->nodes; i++) {
			st = NULL;
			free(info);
			fd = bitmap_file_open(filename, &st, i, fd);
			if (fd < 0) {
				printf("   Unable to open bitmap file on node: %i\n", i);
				continue;
			}
			info = bitmap_fd_read(fd, brief);
			if (!info) {
				printf("   Unable to read bitmap on node: %i\n", i);
				continue;
			}
			sb = &info->sb;
			if (sb->magic != BITMAP_MAGIC)
				pr_err("invalid bitmap magic 0x%x, the bitmap file appears to be corrupted\n", sb->magic);

			printf("       Node Slot : %d\n", i);
			printf("          Events : %llu\n",
			       (unsigned long long)sb->events);
			printf("  Events Cleared : %llu\n",
			       (unsigned long long)sb->events_cleared);
			printf("           State : %s\n", bitmap_state(sb->state));
			if (brief)
				continue;
			printf("          Bitmap : %llu bits (chunks), %llu dirty (%2.1f%%)\n",
			       info->total_bits, info->dirty_bits,
			       100.0 * info->dirty_bits / (info->total_bits?:1));
		}
	}

free_info:
	close(fd);
	free(info);
	return rv;
}

int IsBitmapDirty(char *filename)
{
	/*
	 * Read the bitmap file
	 * It will break reading bitmap action immediately when meeting any error.
	 *
	 * Return: 1(dirty), 0 (clean), -1(error)
	 */

	int fd = -1, rv = 0, i;
	struct supertype *st = NULL;
	bitmap_info_t *info = NULL;
	bitmap_super_t *sb = NULL;

	fd = bitmap_file_open(filename, &st, 0, fd);
	free(st);
	if (fd < 0)
		goto out;

	info = bitmap_fd_read(fd, 0);
	if (!info) {
		close(fd);
		goto out;
	}

	sb = &info->sb;
	for (i = 0; i < (int)sb->nodes; i++) {
		st = NULL;
		free(info);
		info = NULL;

		fd = bitmap_file_open(filename, &st, i, fd);
		free(st);
		if (fd < 0)
			goto out;

		info = bitmap_fd_read(fd, 0);
		if (!info) {
			close(fd);
			goto out;
		}

		sb = &info->sb;
		if (sb->magic != BITMAP_MAGIC) { /* invalid bitmap magic */
			free(info);
			close(fd);
			goto out;
		}

		if (info->dirty_bits)
			rv = 1;
	}
	close(fd);
	free(info);
	return rv;
out:
	return -1;
}

int CreateBitmap(char *filename, int force, char uuid[16],
		 unsigned long chunksize, unsigned long daemon_sleep,
		 unsigned long write_behind,
		 unsigned long long array_size /* sectors */,
		 int major)
{
	/*
	 * Create a bitmap file with a superblock and (optionally) a full bitmap
	 */

	FILE *fp;
	int rv = 1;
	char block[512];
	bitmap_super_t sb;
	long long bytes, filesize;

	if (!force && access(filename, F_OK) == 0) {
		pr_err("bitmap file %s already exists, use --force to overwrite\n", filename);
		return rv;
	}

	fp = fopen(filename, "w");
	if (fp == NULL) {
		pr_err("failed to open bitmap file %s: %s\n",
			filename, strerror(errno));
		return rv;
	}

	if (chunksize == UnSet) {
		/* We don't want more than 2^21 chunks, as 2^11 fill up one
		 * 4K page (2 bytes per chunk), and 2^10 address of those
		 * fill up a 4K indexing page.  2^20 might be safer, especially
		 * on 64bit hosts, so use that.
		 */
		chunksize = DEFAULT_BITMAP_CHUNK;
		/* <<20 for 2^20 chunks, >>9 to convert bytes to sectors */
		while (array_size > ((unsigned long long)chunksize << (20-9)))
			chunksize <<= 1;
	}

	memset(&sb, 0, sizeof(sb));
	sb.magic = BITMAP_MAGIC;
	sb.version = major;
	if (uuid != NULL)
		memcpy(sb.uuid, uuid, 16);
	sb.chunksize = chunksize;
	sb.daemon_sleep = daemon_sleep;
	sb.write_behind = write_behind;
	sb.sync_size = array_size;

	sb_cpu_to_le(&sb); /* convert to on-disk byte ordering */

	if (fwrite(&sb, sizeof(sb), 1, fp) != 1) {
		pr_err("failed to write superblock to bitmap file %s: %s\n", filename, strerror(errno));
		goto out;
	}

	/* calculate the size of the bitmap and write it to disk */
	bytes = (bitmap_bits(array_size, chunksize) + 7) / 8;
	if (!bytes) {
		rv = 0;
		goto out;
	}

	filesize = bytes + sizeof(sb);

	memset(block, 0xff, sizeof(block));

	while (bytes > 0) {
		if (fwrite(block, sizeof(block), 1, fp) != 1) {
			pr_err("failed to write bitmap file %s: %s\n", filename, strerror(errno));
			goto out;
		}
		bytes -= sizeof(block);
	}

	rv = 0;
	fflush(fp);
	/* make the file be the right size (well, to the nearest byte) */
	if (ftruncate(fileno(fp), filesize))
		perror("ftrunace");
out:
	fclose(fp);
	if (rv)
		unlink(filename); /* possibly corrupted, better get rid of it */
	return rv;
}

int bitmap_update_uuid(int fd, int *uuid, int swap)
{
	struct bitmap_super_s bm;
	if (lseek(fd, 0, 0) != 0)
		return 1;
	if (read(fd, &bm, sizeof(bm)) != sizeof(bm))
		return 1;
	if (bm.magic != __cpu_to_le32(BITMAP_MAGIC))
		return 1;
	copy_uuid(bm.uuid, uuid, swap);
	if (lseek(fd, 0, 0) != 0)
		return 2;
	if (write(fd, &bm, sizeof(bm)) != sizeof(bm)) {
		lseek(fd, 0, 0);
		return 2;
	}
	lseek(fd, 0, 0);
	return 0;
}
Commit	Line	Data
c82f047c NB	1	/*
	2	* mdadm - manage Linux "md" devices aka RAID arrays.
	3	*
	4	* Copyright (C) 2004 Paul Clements, SteelEye Technology, Inc.
	5	*
	6	* This program is free software; you can redistribute it and/or modify
	7	* it under the terms of the GNU General Public License as published by
	8	* the Free Software Foundation; either version 2 of the License, or
	9	* (at your option) any later version.
	10	*
	11	* This program is distributed in the hope that it will be useful,
	12	* but WITHOUT ANY WARRANTY; without even the implied warranty of
	13	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
	14	* GNU General Public License for more details.
	15	*
	16	* You should have received a copy of the GNU General Public License
	17	* along with this program; if not, write to the Free Software
	18	* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
	19	*/
	20
c82f047c	21	#include "mdadm.h"
c82f047c	22
d8f82d1d	23	static inline void sb_le_to_cpu(bitmap_super_t *sb)
c82f047c NB	24	{
	25	sb->magic = __le32_to_cpu(sb->magic);
	26	sb->version = __le32_to_cpu(sb->version);
	27	/* uuid gets no translation */
	28	sb->events = __le64_to_cpu(sb->events);
	29	sb->events_cleared = __le64_to_cpu(sb->events_cleared);
	30	sb->state = __le32_to_cpu(sb->state);
	31	sb->chunksize = __le32_to_cpu(sb->chunksize);
	32	sb->daemon_sleep = __le32_to_cpu(sb->daemon_sleep);
	33	sb->sync_size = __le64_to_cpu(sb->sync_size);
10ae45c1	34	sb->write_behind = __le32_to_cpu(sb->write_behind);
95a05b37 GJ	35	sb->nodes = __le32_to_cpu(sb->nodes);
95a05b37 GJ	36	sb->sectors_reserved = __le32_to_cpu(sb->sectors_reserved);
c82f047c NB	37	}
c82f047c NB	38
d8f82d1d	39	static inline void sb_cpu_to_le(bitmap_super_t *sb)
c82f047c NB	40	{
	41	sb_le_to_cpu(sb); /* these are really the same thing */
	42	}
	43
	44	mapping_t bitmap_states[] = {
	45	{ "OK", 0 },
	46	{ "Out of date", 2 },
	47	{ NULL, -1 }
	48	};
	49
6e88b3b3	50	static const char *bitmap_state(int state_num)
c82f047c NB	51	{
	52	char *state = map_num(bitmap_states, state_num);
	53	return state ? state : "Unknown";
	54	}
	55
6e88b3b3	56	static const char *human_chunksize(unsigned long bytes)
c82f047c NB	57	{
	58	static char buf[16];
	59	char *suffixes[] = { "B", "KB", "MB", "GB", "TB", NULL };
	60	int i = 0;
	61
	62	while (bytes >> 10) {
	63	bytes >>= 10;
	64	i++;
	65	}
	66
8f23b0b3	67	snprintf(buf, sizeof(buf), "%lu %s", bytes, suffixes[i]);
c82f047c NB	68
	69	return buf;
	70	}
	71
	72	typedef struct bitmap_info_s {
	73	bitmap_super_t sb;
	74	unsigned long long total_bits;
	75	unsigned long long dirty_bits;
	76	} bitmap_info_t;
	77
	78	/* count the dirty bits in the first num_bits of byte */
d8f82d1d	79	static inline int count_dirty_bits_byte(char byte, int num_bits)
c82f047c NB	80	{
	81	int num = 0;
	82
	83	switch (num_bits) { /* fall through... */
	84	case 8: if (byte & 128) num++;
	85	case 7: if (byte & 64) num++;
	86	case 6: if (byte & 32) num++;
	87	case 5: if (byte & 16) num++;
	88	case 4: if (byte & 8) num++;
	89	case 3: if (byte & 4) num++;
	90	case 2: if (byte & 2) num++;
	91	case 1: if (byte & 1) num++;
	92	default: break;
	93	}
	94
	95	return num;
	96	}
	97
6e88b3b3	98	static int count_dirty_bits(char *buf, int num_bits)
c82f047c NB	99	{
	100	int i, num = 0;
	101
ca3b6696	102	for (i = 0; i < num_bits / 8; i++)
c82f047c NB	103	num += count_dirty_bits_byte(buf[i], 8);
	104
	105	if (num_bits % 8) /* not an even byte boundary */
	106	num += count_dirty_bits_byte(buf[i], num_bits % 8);
	107
	108	return num;
	109	}
	110
6e88b3b3	111	static bitmap_info_t *bitmap_fd_read(int fd, int brief)
c82f047c	112	{
4ccdb956 NB	113	/* Note: fd might be open O_DIRECT, so we must be
	114	* careful to align reads properly
	115	*/
c82f047c NB	116	unsigned long long total_bits = 0, read_bits = 0, dirty_bits = 0;
c82f047c NB	117	bitmap_info_t *info;
6416d527	118	void *buf;
f21e18ca	119	unsigned int n, skip;
4ccdb956	120
a7322ae1	121	if (posix_memalign(&buf, 4096, 8192) != 0) {
e7b84f9d	122	pr_err("failed to allocate 8192 bytes\n");
3d2c4fc7 DW	123	return NULL;
3d2c4fc7 DW	124	}
4ccdb956	125	n = read(fd, buf, 8192);
c82f047c	126
503975b9	127	info = xmalloc(sizeof(*info));
c82f047c	128
4ccdb956	129	if (n < sizeof(info->sb)) {
7a862a02	130	pr_err("failed to read superblock of bitmap file: %s\n", strerror(errno));
c82f047c	131	free(info);
39c74d5e	132	free(buf);
c82f047c NB	133	return NULL;
c82f047c NB	134	}
4ccdb956 NB	135	memcpy(&info->sb, buf, sizeof(info->sb));
4ccdb956 NB	136	skip = sizeof(info->sb);
c82f047c NB	137
c82f047c NB	138	sb_le_to_cpu(&info->sb); /* convert superblock to CPU byte ordering */
aba69144	139
b47dff66	140	if (brief \|\| info->sb.sync_size == 0 \|\| info->sb.chunksize == 0)
c82f047c NB	141	goto out;
	142
	143	/* read the rest of the file counting total bits and dirty bits --
	144	* we stop when either:
	145	* 1) we hit EOF, in which case we assume the rest of the bits (if any)
	146	* are dirty
	147	* 2) we've read the full bitmap, in which case we ignore any trailing
	148	* data in the file
	149	*/
	150	total_bits = bitmap_bits(info->sb.sync_size, info->sb.chunksize);
	151
4ccdb956	152	while(read_bits < total_bits) {
c82f047c NB	153	unsigned long long remaining = total_bits - read_bits;
c82f047c NB	154
4ccdb956 NB	155	if (n == 0) {
	156	n = read(fd, buf, 8192);
	157	skip = 0;
	158	if (n <= 0)
	159	break;
	160	}
	161	if (remaining > (n-skip) * 8) /* we want the full buffer */
	162	remaining = (n-skip) * 8;
	163
	164	dirty_bits += count_dirty_bits(buf+skip, remaining);
c82f047c NB	165
c82f047c NB	166	read_bits += remaining;
4ccdb956	167	n = 0;
c82f047c NB	168	}
	169
	170	if (read_bits < total_bits) { /* file truncated... */
7a862a02	171	pr_err("WARNING: bitmap file is not large enough for array size %llu!\n\n",
f9c25f1d	172	(unsigned long long)info->sb.sync_size);
c82f047c NB	173	total_bits = read_bits;
	174	}
	175	out:
39c74d5e	176	free(buf);
c82f047c NB	177	info->total_bits = total_bits;
	178	info->dirty_bits = dirty_bits;
	179	return info;
	180	}
	181
6e88b3b3	182	static int
9c030dad	183	bitmap_file_open(char filename, struct supertype *stp, int node_num, int fd)
c82f047c	184	{
8cc56e8b	185	struct stat stb;
34163fc7	186	struct supertype st = stp;
c82f047c	187
9c030dad ZH	188	/* won't re-open filename when (fd >= 0) */
	189	if (fd < 0)
	190	fd = open(filename, O_RDONLY\|O_DIRECT);
9ca0de62 JS	191	if (fd < 0) {
	192	pr_err("failed to open bitmap file %s: %s\n",
	193	filename, strerror(errno));
1e781e07	194	return -1;
c82f047c	195	}
9ca0de62	196
8cc56e8b ZL	197	if (fstat(fd, &stb) < 0) {
	198	pr_err("fstat failed for %s: %s\n", filename, strerror(errno));
	199	close(fd);
	200	return -1;
	201	}
	202	if ((stb.st_mode & S_IFMT) == S_IFBLK) {
55935d51	203	/* block device, so we are probably after an internal bitmap */
9ca0de62 JS	204	if (!st)
9ca0de62 JS	205	st = guess_super(fd);
55935d51 NB	206	if (!st) {
	207	/* just look at device... */
	208	lseek(fd, 0, 0);
ebeb3663	209	} else if (!st->ss->locate_bitmap) {
e7b84f9d	210	pr_err("No bitmap possible with %s metadata\n",
ebeb3663	211	st->ss->name);
de12cdc7	212	close(fd);
1e781e07	213	return -1;
53e76b1d	214	} else {
b138214f	215	if (st->ss->locate_bitmap(st, fd, node_num)) {
53e76b1d	216	pr_err("%s doesn't have bitmap\n", filename);
de12cdc7	217	close(fd);
53e76b1d GJ	218	fd = -1;
	219	}
	220	}
34163fc7	221	*stp = st;
55935d51	222	}
c82f047c	223
1e781e07	224	return fd;
c82f047c NB	225	}
c82f047c NB	226
6e88b3b3	227	static __u32 swapl(__u32 l)
34163fc7 NB	228	{
	229	char c = (char)&l;
	230	char t= c[0];
	231	c[0] = c[3];
	232	c[3] = t;
	233
	234	t = c[1];
	235	c[1] = c[2];
	236	c[2] = t;
	237	return l;
	238	}
55935d51	239	int ExamineBitmap(char filename, int brief, struct supertype st)
c82f047c NB	240	{
	241	/*
	242	* Read the bitmap file and display its contents
	243	*/
	244
	245	bitmap_super_t *sb;
	246	bitmap_info_t *info;
	247	int rv = 1;
dfd4d8ee	248	char buf[64];
bf4fb153	249	int swap;
b98043a2	250	int fd, i;
caa0f6c6	251	__u32 uuid32[4];
c82f047c	252
9c030dad	253	fd = bitmap_file_open(filename, &st, 0, -1);
1e781e07	254	if (fd < 0)
c82f047c NB	255	return rv;
c82f047c NB	256
1e781e07 N	257	info = bitmap_fd_read(fd, brief);
	258	if (!info)
	259	return rv;
c82f047c	260	sb = &info->sb;
5d89b18d	261	if (sb->magic != BITMAP_MAGIC) {
1e781e07 N	262	pr_err("This is an md array. To view a bitmap you need to examine\n");
	263	pr_err("a member device, not the array.\n");
	264	pr_err("Reporting bitmap that would be used if this array were used\n");
	265	pr_err("as a member of some other array\n");
	266	}
c82f047c NB	267	printf(" Filename : %s\n", filename);
	268	printf(" Magic : %08x\n", sb->magic);
	269	if (sb->magic != BITMAP_MAGIC) {
1e781e07 N	270	pr_err("invalid bitmap magic 0x%x, the bitmap file appears\n",
	271	sb->magic);
	272	pr_err("to be corrupted or missing.\n");
c82f047c NB	273	}
c82f047c NB	274	printf(" Version : %d\n", sb->version);
dcec9ee5	275	if (sb->version < BITMAP_MAJOR_LO \|\|
6d9c7c25	276	sb->version > BITMAP_MAJOR_CLUSTERED) {
1e781e07 N	277	pr_err("unknown bitmap version %d, either the bitmap file\n",
	278	sb->version);
	279	pr_err("is corrupted or you need to upgrade your tools\n");
c82f047c NB	280	goto free_info;
	281	}
	282
	283	rv = 0;
bf4fb153 NB	284	if (st)
	285	swap = st->ss->swapuuid;
	286	else
	287	#if __BYTE_ORDER == BIG_ENDIAN
	288	swap = 0;
	289	#else
	290	swap = 1;
	291	#endif
caa0f6c6 N	292	memcpy(uuid32, sb->uuid, 16);
	293	if (swap)
	294	printf(" UUID : %08x:%08x:%08x:%08x\n",
	295	swapl(uuid32[0]),
	296	swapl(uuid32[1]),
	297	swapl(uuid32[2]),
	298	swapl(uuid32[3]));
	299	else
	300	printf(" UUID : %08x:%08x:%08x:%08x\n",
	301	uuid32[0],
	302	uuid32[1],
	303	uuid32[2],
	304	uuid32[3]);
	305
b98043a2 GJ	306	if (sb->nodes == 0) {
	307	printf(" Events : %llu\n", (unsigned long long)sb->events);
	308	printf(" Events Cleared : %llu\n", (unsigned long long)sb->events_cleared);
	309	printf(" State : %s\n", bitmap_state(sb->state));
	310
	311	}
	312
c82f047c NB	313	printf(" Chunksize : %s\n", human_chunksize(sb->chunksize));
c82f047c NB	314	printf(" Daemon : %ds flush period\n", sb->daemon_sleep);
dfd4d8ee NB	315	if (sb->write_behind)
	316	sprintf(buf, "Allow write behind, max %d", sb->write_behind);
	317	else
	318	sprintf(buf, "Normal");
	319	printf(" Write Mode : %s\n", buf);
f9c25f1d	320	printf(" Sync Size : %llu%s\n", (unsigned long long)sb->sync_size/2,
f277ce36	321	human_size(sb->sync_size * 512));
b98043a2 GJ	322
	323	if (sb->nodes == 0) {
	324	if (brief)
	325	goto free_info;
	326	printf(" Bitmap : %llu bits (chunks), %llu dirty (%2.1f%%)\n",
	327	info->total_bits, info->dirty_bits,
	328	100.0 * info->dirty_bits / (info->total_bits?:1));
	329	} else {
	330	printf(" Cluster nodes : %d\n", sb->nodes);
2cf42394	331	printf(" Cluster name : %-64s\n", sb->cluster_name);
b98043a2	332	for (i = 0; i < (int)sb->nodes; i++) {
b138214f GJ	333	st = NULL;
b138214f GJ	334	free(info);
9c030dad	335	fd = bitmap_file_open(filename, &st, i, fd);
34996a5f JS	336	if (fd < 0) {
34996a5f JS	337	printf(" Unable to open bitmap file on node: %i\n", i);
34996a5f JS	338	continue;
34996a5f JS	339	}
b138214f	340	info = bitmap_fd_read(fd, brief);
34996a5f	341	if (!info) {
34996a5f JS	342	printf(" Unable to read bitmap on node: %i\n", i);
	343	continue;
	344	}
b138214f	345	sb = &info->sb;
b98043a2 GJ	346	if (sb->magic != BITMAP_MAGIC)
	347	pr_err("invalid bitmap magic 0x%x, the bitmap file appears to be corrupted\n", sb->magic);
	348
	349	printf(" Node Slot : %d\n", i);
	350	printf(" Events : %llu\n",
	351	(unsigned long long)sb->events);
	352	printf(" Events Cleared : %llu\n",
	353	(unsigned long long)sb->events_cleared);
	354	printf(" State : %s\n", bitmap_state(sb->state));
	355	if (brief)
	356	continue;
	357	printf(" Bitmap : %llu bits (chunks), %llu dirty (%2.1f%%)\n",
	358	info->total_bits, info->dirty_bits,
	359	100.0 * info->dirty_bits / (info->total_bits?:1));
b98043a2 GJ	360	}
	361	}
	362
c82f047c	363	free_info:
9c030dad	364	close(fd);
c82f047c NB	365	free(info);
	366	return rv;
	367	}
	368
9c030dad ZH	369	int IsBitmapDirty(char *filename)
	370	{
	371	/*
	372	* Read the bitmap file
	373	* It will break reading bitmap action immediately when meeting any error.
	374	*
	375	* Return: 1(dirty), 0 (clean), -1(error)
	376	*/
	377
	378	int fd = -1, rv = 0, i;
	379	struct supertype *st = NULL;
	380	bitmap_info_t *info = NULL;
	381	bitmap_super_t *sb = NULL;
	382
	383	fd = bitmap_file_open(filename, &st, 0, fd);
	384	free(st);
	385	if (fd < 0)
	386	goto out;
	387
	388	info = bitmap_fd_read(fd, 0);
	389	if (!info) {
	390	close(fd);
	391	goto out;
	392	}
	393
	394	sb = &info->sb;
	395	for (i = 0; i < (int)sb->nodes; i++) {
	396	st = NULL;
	397	free(info);
	398	info = NULL;
	399
	400	fd = bitmap_file_open(filename, &st, i, fd);
	401	free(st);
	402	if (fd < 0)
	403	goto out;
	404
	405	info = bitmap_fd_read(fd, 0);
	406	if (!info) {
	407	close(fd);
	408	goto out;
	409	}
	410
	411	sb = &info->sb;
	412	if (sb->magic != BITMAP_MAGIC) { /* invalid bitmap magic */
	413	free(info);
	414	close(fd);
	415	goto out;
	416	}
	417
	418	if (info->dirty_bits)
	419	rv = 1;
	420	}
	421	close(fd);
	422	free(info);
	423	return rv;
	424	out:
	425	return -1;
	426	}
	427
c82f047c	428	int CreateBitmap(char *filename, int force, char uuid[16],
1bf4e2d9 NB	429	unsigned long chunksize, unsigned long daemon_sleep,
1bf4e2d9 NB	430	unsigned long write_behind,
dcec9ee5 NB	431	unsigned long long array_size /* sectors */,
dcec9ee5 NB	432	int major)
c82f047c NB	433	{
	434	/*
	435	* Create a bitmap file with a superblock and (optionally) a full bitmap
	436	*/
	437
	438	FILE *fp;
	439	int rv = 1;
	440	char block[512];
	441	bitmap_super_t sb;
	442	long long bytes, filesize;
	443
	444	if (!force && access(filename, F_OK) == 0) {
e7b84f9d	445	pr_err("bitmap file %s already exists, use --force to overwrite\n", filename);
c82f047c NB	446	return rv;
	447	}
	448
	449	fp = fopen(filename, "w");
	450	if (fp == NULL) {
e7b84f9d	451	pr_err("failed to open bitmap file %s: %s\n",
c82f047c NB	452	filename, strerror(errno));
	453	return rv;
	454	}
	455
1bfdbe01 NB	456	if (chunksize == UnSet) {
	457	/* We don't want more than 2^21 chunks, as 2^11 fill up one
	458	* 4K page (2 bytes per chunk), and 2^10 address of those
b39827de NB	459	* fill up a 4K indexing page. 2^20 might be safer, especially
b39827de NB	460	* on 64bit hosts, so use that.
1bfdbe01 NB	461	*/
1bfdbe01 NB	462	chunksize = DEFAULT_BITMAP_CHUNK;
b39827de	463	/* <<20 for 2^20 chunks, >>9 to convert bytes to sectors */
3e416561	464	while (array_size > ((unsigned long long)chunksize << (20-9)))
1bfdbe01 NB	465	chunksize <<= 1;
	466	}
	467
c82f047c NB	468	memset(&sb, 0, sizeof(sb));
c82f047c NB	469	sb.magic = BITMAP_MAGIC;
dcec9ee5	470	sb.version = major;
c82f047c NB	471	if (uuid != NULL)
	472	memcpy(sb.uuid, uuid, 16);
	473	sb.chunksize = chunksize;
	474	sb.daemon_sleep = daemon_sleep;
dfd4d8ee	475	sb.write_behind = write_behind;
c82f047c NB	476	sb.sync_size = array_size;
	477
	478	sb_cpu_to_le(&sb); /* convert to on-disk byte ordering */
	479
	480	if (fwrite(&sb, sizeof(sb), 1, fp) != 1) {
e7b84f9d	481	pr_err("failed to write superblock to bitmap file %s: %s\n", filename, strerror(errno));
c82f047c NB	482	goto out;
	483	}
	484
	485	/* calculate the size of the bitmap and write it to disk */
	486	bytes = (bitmap_bits(array_size, chunksize) + 7) / 8;
	487	if (!bytes) {
	488	rv = 0;
	489	goto out;
	490	}
	491
	492	filesize = bytes + sizeof(sb);
	493
	494	memset(block, 0xff, sizeof(block));
	495
	496	while (bytes > 0) {
	497	if (fwrite(block, sizeof(block), 1, fp) != 1) {
e7b84f9d	498	pr_err("failed to write bitmap file %s: %s\n", filename, strerror(errno));
c82f047c NB	499	goto out;
	500	}
	501	bytes -= sizeof(block);
	502	}
aba69144	503
c82f047c	504	rv = 0;
97a6748c	505	fflush(fp);
c82f047c	506	/* make the file be the right size (well, to the nearest byte) */
1e0d770c NB	507	if (ftruncate(fileno(fp), filesize))
1e0d770c NB	508	perror("ftrunace");
c82f047c NB	509	out:
	510	fclose(fp);
	511	if (rv)
	512	unlink(filename); /* possibly corrupted, better get rid of it */
	513	return rv;
	514	}
8131b493	515
bf4fb153	516	int bitmap_update_uuid(int fd, int *uuid, int swap)
8131b493 NB	517	{
8131b493 NB	518	struct bitmap_super_s bm;
9fca7d62 NB	519	if (lseek(fd, 0, 0) != 0)
9fca7d62 NB	520	return 1;
8131b493	521	if (read(fd, &bm, sizeof(bm)) != sizeof(bm))
9fca7d62	522	return 1;
8131b493	523	if (bm.magic != __cpu_to_le32(BITMAP_MAGIC))
9fca7d62	524	return 1;
350f29f9	525	copy_uuid(bm.uuid, uuid, swap);
9fca7d62 NB	526	if (lseek(fd, 0, 0) != 0)
	527	return 2;
	528	if (write(fd, &bm, sizeof(bm)) != sizeof(bm)) {
	529	lseek(fd, 0, 0);
	530	return 2;
	531	}
8131b493	532	lseek(fd, 0, 0);
9fca7d62	533	return 0;
8131b493	534	}