]> git.ipfire.org Git - thirdparty/mdadm.git/blame - bitmap.c
Monitor: mailfrom is initialized correctly
[thirdparty/mdadm.git] / bitmap.c
CommitLineData
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 23static 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);
36 sb->sectors_reserved = __le32_to_cpu(sb->sectors_reserved);
c82f047c
NB
37}
38
d8f82d1d 39static 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
44mapping_t bitmap_states[] = {
45 { "OK", 0 },
46 { "Out of date", 2 },
47 { NULL, -1 }
48};
49
6e88b3b3 50static 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 56static 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
72typedef 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 79static 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 98static 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 111static 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;
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;
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;
134 }
4ccdb956
NB
135 memcpy(&info->sb, buf, sizeof(info->sb));
136 skip = sizeof(info->sb);
c82f047c
NB
137
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;
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
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 }
175out:
39c74d5e 176 free(buf);
c82f047c
NB
177 info->total_bits = total_bits;
178 info->dirty_bits = dirty_bits;
179 return info;
180}
181
6e88b3b3
JS
182static int
183bitmap_file_open(char *filename, struct supertype **stp, int node_num)
c82f047c
NB
184{
185 int fd;
34163fc7 186 struct supertype *st = *stp;
c82f047c 187
9ca0de62
JS
188 fd = open(filename, O_RDONLY|O_DIRECT);
189 if (fd < 0) {
190 pr_err("failed to open bitmap file %s: %s\n",
191 filename, strerror(errno));
1e781e07 192 return -1;
c82f047c 193 }
9ca0de62 194
0a6bff09 195 if (fstat_is_blkdev(fd, filename, NULL)) {
55935d51 196 /* block device, so we are probably after an internal bitmap */
9ca0de62
JS
197 if (!st)
198 st = guess_super(fd);
55935d51
NB
199 if (!st) {
200 /* just look at device... */
201 lseek(fd, 0, 0);
ebeb3663 202 } else if (!st->ss->locate_bitmap) {
e7b84f9d 203 pr_err("No bitmap possible with %s metadata\n",
ebeb3663 204 st->ss->name);
de12cdc7 205 close(fd);
1e781e07 206 return -1;
53e76b1d 207 } else {
b138214f 208 if (st->ss->locate_bitmap(st, fd, node_num)) {
53e76b1d 209 pr_err("%s doesn't have bitmap\n", filename);
de12cdc7 210 close(fd);
53e76b1d
GJ
211 fd = -1;
212 }
213 }
ebeb3663 214
34163fc7 215 *stp = st;
0a6bff09
ZL
216 } else {
217 close(fd);
218 return -1;
55935d51 219 }
c82f047c 220
1e781e07 221 return fd;
c82f047c
NB
222}
223
6e88b3b3 224static __u32 swapl(__u32 l)
34163fc7
NB
225{
226 char *c = (char*)&l;
227 char t= c[0];
228 c[0] = c[3];
229 c[3] = t;
230
231 t = c[1];
232 c[1] = c[2];
233 c[2] = t;
234 return l;
235}
55935d51 236int ExamineBitmap(char *filename, int brief, struct supertype *st)
c82f047c
NB
237{
238 /*
239 * Read the bitmap file and display its contents
240 */
241
242 bitmap_super_t *sb;
243 bitmap_info_t *info;
244 int rv = 1;
dfd4d8ee 245 char buf[64];
bf4fb153 246 int swap;
b98043a2 247 int fd, i;
caa0f6c6 248 __u32 uuid32[4];
c82f047c 249
b138214f 250 fd = bitmap_file_open(filename, &st, 0);
1e781e07 251 if (fd < 0)
c82f047c
NB
252 return rv;
253
1e781e07
N
254 info = bitmap_fd_read(fd, brief);
255 if (!info)
256 return rv;
c82f047c 257 sb = &info->sb;
5d89b18d 258 if (sb->magic != BITMAP_MAGIC) {
1e781e07
N
259 pr_err("This is an md array. To view a bitmap you need to examine\n");
260 pr_err("a member device, not the array.\n");
261 pr_err("Reporting bitmap that would be used if this array were used\n");
262 pr_err("as a member of some other array\n");
263 }
264 close(fd);
c82f047c
NB
265 printf(" Filename : %s\n", filename);
266 printf(" Magic : %08x\n", sb->magic);
267 if (sb->magic != BITMAP_MAGIC) {
1e781e07
N
268 pr_err("invalid bitmap magic 0x%x, the bitmap file appears\n",
269 sb->magic);
270 pr_err("to be corrupted or missing.\n");
c82f047c
NB
271 }
272 printf(" Version : %d\n", sb->version);
dcec9ee5 273 if (sb->version < BITMAP_MAJOR_LO ||
6d9c7c25 274 sb->version > BITMAP_MAJOR_CLUSTERED) {
1e781e07
N
275 pr_err("unknown bitmap version %d, either the bitmap file\n",
276 sb->version);
277 pr_err("is corrupted or you need to upgrade your tools\n");
c82f047c
NB
278 goto free_info;
279 }
280
281 rv = 0;
bf4fb153
NB
282 if (st)
283 swap = st->ss->swapuuid;
284 else
285#if __BYTE_ORDER == BIG_ENDIAN
286 swap = 0;
287#else
288 swap = 1;
289#endif
caa0f6c6
N
290 memcpy(uuid32, sb->uuid, 16);
291 if (swap)
292 printf(" UUID : %08x:%08x:%08x:%08x\n",
293 swapl(uuid32[0]),
294 swapl(uuid32[1]),
295 swapl(uuid32[2]),
296 swapl(uuid32[3]));
297 else
298 printf(" UUID : %08x:%08x:%08x:%08x\n",
299 uuid32[0],
300 uuid32[1],
301 uuid32[2],
302 uuid32[3]);
303
b98043a2
GJ
304 if (sb->nodes == 0) {
305 printf(" Events : %llu\n", (unsigned long long)sb->events);
306 printf(" Events Cleared : %llu\n", (unsigned long long)sb->events_cleared);
307 printf(" State : %s\n", bitmap_state(sb->state));
308
309 }
310
c82f047c
NB
311 printf(" Chunksize : %s\n", human_chunksize(sb->chunksize));
312 printf(" Daemon : %ds flush period\n", sb->daemon_sleep);
dfd4d8ee
NB
313 if (sb->write_behind)
314 sprintf(buf, "Allow write behind, max %d", sb->write_behind);
315 else
316 sprintf(buf, "Normal");
317 printf(" Write Mode : %s\n", buf);
f9c25f1d 318 printf(" Sync Size : %llu%s\n", (unsigned long long)sb->sync_size/2,
f277ce36 319 human_size(sb->sync_size * 512));
b98043a2
GJ
320
321 if (sb->nodes == 0) {
322 if (brief)
323 goto free_info;
324 printf(" Bitmap : %llu bits (chunks), %llu dirty (%2.1f%%)\n",
325 info->total_bits, info->dirty_bits,
326 100.0 * info->dirty_bits / (info->total_bits?:1));
327 } else {
328 printf(" Cluster nodes : %d\n", sb->nodes);
2cf42394 329 printf(" Cluster name : %-64s\n", sb->cluster_name);
b98043a2 330 for (i = 0; i < (int)sb->nodes; i++) {
b138214f
GJ
331 st = NULL;
332 free(info);
333 fd = bitmap_file_open(filename, &st, i);
34996a5f
JS
334 if (fd < 0) {
335 printf(" Unable to open bitmap file on node: %i\n", i);
336
337 continue;
338 }
b138214f 339 info = bitmap_fd_read(fd, brief);
34996a5f
JS
340 if (!info) {
341 close(fd);
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));
b138214f 360 close(fd);
b98043a2
GJ
361 }
362 }
363
c82f047c
NB
364free_info:
365 free(info);
366 return rv;
367}
368
369int CreateBitmap(char *filename, int force, char uuid[16],
1bf4e2d9
NB
370 unsigned long chunksize, unsigned long daemon_sleep,
371 unsigned long write_behind,
dcec9ee5
NB
372 unsigned long long array_size /* sectors */,
373 int major)
c82f047c
NB
374{
375 /*
376 * Create a bitmap file with a superblock and (optionally) a full bitmap
377 */
378
379 FILE *fp;
380 int rv = 1;
381 char block[512];
382 bitmap_super_t sb;
383 long long bytes, filesize;
384
385 if (!force && access(filename, F_OK) == 0) {
e7b84f9d 386 pr_err("bitmap file %s already exists, use --force to overwrite\n", filename);
c82f047c
NB
387 return rv;
388 }
389
390 fp = fopen(filename, "w");
391 if (fp == NULL) {
e7b84f9d 392 pr_err("failed to open bitmap file %s: %s\n",
c82f047c
NB
393 filename, strerror(errno));
394 return rv;
395 }
396
1bfdbe01
NB
397 if (chunksize == UnSet) {
398 /* We don't want more than 2^21 chunks, as 2^11 fill up one
399 * 4K page (2 bytes per chunk), and 2^10 address of those
b39827de
NB
400 * fill up a 4K indexing page. 2^20 might be safer, especially
401 * on 64bit hosts, so use that.
1bfdbe01
NB
402 */
403 chunksize = DEFAULT_BITMAP_CHUNK;
b39827de 404 /* <<20 for 2^20 chunks, >>9 to convert bytes to sectors */
3e416561 405 while (array_size > ((unsigned long long)chunksize << (20-9)))
1bfdbe01
NB
406 chunksize <<= 1;
407 }
408
c82f047c
NB
409 memset(&sb, 0, sizeof(sb));
410 sb.magic = BITMAP_MAGIC;
dcec9ee5 411 sb.version = major;
c82f047c
NB
412 if (uuid != NULL)
413 memcpy(sb.uuid, uuid, 16);
414 sb.chunksize = chunksize;
415 sb.daemon_sleep = daemon_sleep;
dfd4d8ee 416 sb.write_behind = write_behind;
c82f047c
NB
417 sb.sync_size = array_size;
418
419 sb_cpu_to_le(&sb); /* convert to on-disk byte ordering */
420
421 if (fwrite(&sb, sizeof(sb), 1, fp) != 1) {
e7b84f9d 422 pr_err("failed to write superblock to bitmap file %s: %s\n", filename, strerror(errno));
c82f047c
NB
423 goto out;
424 }
425
426 /* calculate the size of the bitmap and write it to disk */
427 bytes = (bitmap_bits(array_size, chunksize) + 7) / 8;
428 if (!bytes) {
429 rv = 0;
430 goto out;
431 }
432
433 filesize = bytes + sizeof(sb);
434
435 memset(block, 0xff, sizeof(block));
436
437 while (bytes > 0) {
438 if (fwrite(block, sizeof(block), 1, fp) != 1) {
e7b84f9d 439 pr_err("failed to write bitmap file %s: %s\n", filename, strerror(errno));
c82f047c
NB
440 goto out;
441 }
442 bytes -= sizeof(block);
443 }
aba69144 444
c82f047c 445 rv = 0;
97a6748c 446 fflush(fp);
c82f047c 447 /* make the file be the right size (well, to the nearest byte) */
1e0d770c
NB
448 if (ftruncate(fileno(fp), filesize))
449 perror("ftrunace");
c82f047c
NB
450out:
451 fclose(fp);
452 if (rv)
453 unlink(filename); /* possibly corrupted, better get rid of it */
454 return rv;
455}
8131b493 456
bf4fb153 457int bitmap_update_uuid(int fd, int *uuid, int swap)
8131b493
NB
458{
459 struct bitmap_super_s bm;
9fca7d62
NB
460 if (lseek(fd, 0, 0) != 0)
461 return 1;
8131b493 462 if (read(fd, &bm, sizeof(bm)) != sizeof(bm))
9fca7d62 463 return 1;
8131b493 464 if (bm.magic != __cpu_to_le32(BITMAP_MAGIC))
9fca7d62 465 return 1;
350f29f9 466 copy_uuid(bm.uuid, uuid, swap);
9fca7d62
NB
467 if (lseek(fd, 0, 0) != 0)
468 return 2;
469 if (write(fd, &bm, sizeof(bm)) != sizeof(bm)) {
470 lseek(fd, 0, 0);
471 return 2;
472 }
8131b493 473 lseek(fd, 0, 0);
9fca7d62 474 return 0;
8131b493 475}