]>
Commit | Line | Data |
---|---|---|
1 | /* | |
2 | * mdadm - manage Linux "md" devices aka RAID arrays. | |
3 | * | |
4 | * Copyright (C) 2001-2009 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 | #define HAVE_STDINT_H 1 | |
26 | #include "mdadm.h" | |
27 | #include "sha1.h" | |
28 | /* | |
29 | * All handling for the 0.90.0 version superblock is in | |
30 | * this file. | |
31 | * This includes: | |
32 | * - finding, loading, and writing the superblock. | |
33 | * - initialising a new superblock | |
34 | * - printing the superblock for --examine | |
35 | * - printing part of the superblock for --detail | |
36 | * .. other stuff | |
37 | */ | |
38 | ||
39 | static unsigned long calc_sb0_csum(mdp_super_t *super) | |
40 | { | |
41 | unsigned long csum = super->sb_csum; | |
42 | unsigned long newcsum; | |
43 | super->sb_csum= 0 ; | |
44 | newcsum = calc_csum(super, MD_SB_BYTES); | |
45 | super->sb_csum = csum; | |
46 | return newcsum; | |
47 | } | |
48 | ||
49 | static void super0_swap_endian(struct mdp_superblock_s *sb) | |
50 | { | |
51 | /* as super0 superblocks are host-endian, it is sometimes | |
52 | * useful to be able to swap the endianness | |
53 | * as (almost) everything is u32's we byte-swap every 4byte | |
54 | * number. | |
55 | * We then also have to swap the events_hi and events_lo | |
56 | */ | |
57 | char *sbc = (char *)sb; | |
58 | __u32 t32; | |
59 | int i; | |
60 | ||
61 | for (i=0; i < MD_SB_BYTES ; i+=4) { | |
62 | char t = sbc[i]; | |
63 | sbc[i] = sbc[i+3]; | |
64 | sbc[i+3] = t; | |
65 | t=sbc[i+1]; | |
66 | sbc[i+1]=sbc[i+2]; | |
67 | sbc[i+2]=t; | |
68 | } | |
69 | t32 = sb->events_hi; | |
70 | sb->events_hi = sb->events_lo; | |
71 | sb->events_lo = t32; | |
72 | ||
73 | t32 = sb->cp_events_hi; | |
74 | sb->cp_events_hi = sb->cp_events_lo; | |
75 | sb->cp_events_lo = t32; | |
76 | ||
77 | } | |
78 | ||
79 | #ifndef MDASSEMBLE | |
80 | ||
81 | static void examine_super0(struct supertype *st, char *homehost) | |
82 | { | |
83 | mdp_super_t *sb = st->sb; | |
84 | time_t atime; | |
85 | int d; | |
86 | int delta_extra = 0; | |
87 | char *c; | |
88 | ||
89 | printf(" Magic : %08x\n", sb->md_magic); | |
90 | printf(" Version : %d.%02d.%02d\n", sb->major_version, sb->minor_version, | |
91 | sb->patch_version); | |
92 | if (sb->minor_version >= 90) { | |
93 | printf(" UUID : %08x:%08x:%08x:%08x", sb->set_uuid0, sb->set_uuid1, | |
94 | sb->set_uuid2, sb->set_uuid3); | |
95 | if (homehost) { | |
96 | char buf[20]; | |
97 | void *hash = sha1_buffer(homehost, | |
98 | strlen(homehost), | |
99 | buf); | |
100 | if (memcmp(&sb->set_uuid2, hash, 8)==0) | |
101 | printf(" (local to host %s)", homehost); | |
102 | } | |
103 | printf("\n"); | |
104 | } else | |
105 | printf(" UUID : %08x\n", sb->set_uuid0); | |
106 | ||
107 | if (sb->not_persistent) | |
108 | printf(" Eedk : not persistent\n"); | |
109 | ||
110 | atime = sb->ctime; | |
111 | printf(" Creation Time : %.24s\n", ctime(&atime)); | |
112 | c=map_num(pers, sb->level); | |
113 | printf(" Raid Level : %s\n", c?c:"-unknown-"); | |
114 | if ((int)sb->level > 0) { | |
115 | int ddsks = 0, ddsks_denom = 1; | |
116 | printf(" Used Dev Size : %d%s\n", sb->size, | |
117 | human_size((long long)sb->size<<10)); | |
118 | switch(sb->level) { | |
119 | case 1: ddsks=1;break; | |
120 | case 4: | |
121 | case 5: ddsks = sb->raid_disks-1; break; | |
122 | case 6: ddsks = sb->raid_disks-2; break; | |
123 | case 10: ddsks = sb->raid_disks; | |
124 | ddsks_denom = (sb->layout&255) * ((sb->layout>>8)&255); | |
125 | } | |
126 | if (ddsks) { | |
127 | long long asize = sb->size; | |
128 | asize = (asize << 10) * ddsks / ddsks_denom; | |
129 | printf(" Array Size : %llu%s\n", | |
130 | asize >> 10, human_size(asize)); | |
131 | } | |
132 | } | |
133 | printf(" Raid Devices : %d\n", sb->raid_disks); | |
134 | printf(" Total Devices : %d\n", sb->nr_disks); | |
135 | printf("Preferred Minor : %d\n", sb->md_minor); | |
136 | printf("\n"); | |
137 | if (sb->minor_version > 90 && (sb->reshape_position+1) != 0) { | |
138 | printf(" Reshape pos'n : %llu%s\n", (unsigned long long)sb->reshape_position/2, human_size((long long)sb->reshape_position<<9)); | |
139 | if (sb->delta_disks) { | |
140 | printf(" Delta Devices : %d", sb->delta_disks); | |
141 | printf(" (%d->%d)\n", sb->raid_disks-sb->delta_disks, sb->raid_disks); | |
142 | if (((int)sb->delta_disks) < 0) | |
143 | delta_extra = - sb->delta_disks; | |
144 | } | |
145 | if (sb->new_level != sb->level) { | |
146 | c = map_num(pers, sb->new_level); | |
147 | printf(" New Level : %s\n", c?c:"-unknown-"); | |
148 | } | |
149 | if (sb->new_layout != sb->layout) { | |
150 | if (sb->level == 5) { | |
151 | c = map_num(r5layout, sb->new_layout); | |
152 | printf(" New Layout : %s\n", c?c:"-unknown-"); | |
153 | } | |
154 | if (sb->level == 6) { | |
155 | c = map_num(r6layout, sb->new_layout); | |
156 | printf(" New Layout : %s\n", c?c:"-unknown-"); | |
157 | } | |
158 | if (sb->level == 10) { | |
159 | printf(" New Layout : near=%d, %s=%d\n", | |
160 | sb->new_layout&255, | |
161 | (sb->new_layout&0x10000)?"offset":"far", | |
162 | (sb->new_layout>>8)&255); | |
163 | } | |
164 | } | |
165 | if (sb->new_chunk != sb->chunk_size) | |
166 | printf(" New Chunksize : %d\n", sb->new_chunk); | |
167 | printf("\n"); | |
168 | } | |
169 | atime = sb->utime; | |
170 | printf(" Update Time : %.24s\n", ctime(&atime)); | |
171 | printf(" State : %s\n", | |
172 | (sb->state&(1<<MD_SB_CLEAN))?"clean":"active"); | |
173 | if (sb->state & (1<<MD_SB_BITMAP_PRESENT)) | |
174 | printf("Internal Bitmap : present\n"); | |
175 | printf(" Active Devices : %d\n", sb->active_disks); | |
176 | printf("Working Devices : %d\n", sb->working_disks); | |
177 | printf(" Failed Devices : %d\n", sb->failed_disks); | |
178 | printf(" Spare Devices : %d\n", sb->spare_disks); | |
179 | if (calc_sb0_csum(sb) == sb->sb_csum) | |
180 | printf(" Checksum : %x - correct\n", sb->sb_csum); | |
181 | else | |
182 | printf(" Checksum : %x - expected %lx\n", sb->sb_csum, calc_sb0_csum(sb)); | |
183 | printf(" Events : %llu\n", | |
184 | ((unsigned long long)sb->events_hi << 32) | |
185 | + sb->events_lo); | |
186 | printf("\n"); | |
187 | if (sb->level == 5) { | |
188 | c = map_num(r5layout, sb->layout); | |
189 | printf(" Layout : %s\n", c?c:"-unknown-"); | |
190 | } | |
191 | if (sb->level == 6) { | |
192 | c = map_num(r6layout, sb->layout); | |
193 | printf(" Layout : %s\n", c?c:"-unknown-"); | |
194 | } | |
195 | if (sb->level == 10) { | |
196 | printf(" Layout :"); | |
197 | print_r10_layout(sb->layout); | |
198 | printf("\n"); | |
199 | } | |
200 | switch(sb->level) { | |
201 | case 0: | |
202 | case 4: | |
203 | case 5: | |
204 | case 6: | |
205 | case 10: | |
206 | printf(" Chunk Size : %dK\n", sb->chunk_size/1024); | |
207 | break; | |
208 | case -1: | |
209 | printf(" Rounding : %dK\n", sb->chunk_size/1024); | |
210 | break; | |
211 | default: break; | |
212 | } | |
213 | printf("\n"); | |
214 | printf(" Number Major Minor RaidDevice State\n"); | |
215 | for (d= -1; d<(signed int)(sb->raid_disks+delta_extra + sb->spare_disks); d++) { | |
216 | mdp_disk_t *dp; | |
217 | char *dv; | |
218 | char nb[5]; | |
219 | int wonly; | |
220 | if (d>=0) dp = &sb->disks[d]; | |
221 | else dp = &sb->this_disk; | |
222 | snprintf(nb, sizeof(nb), "%4d", d); | |
223 | printf("%4s %5d %5d %5d %5d ", d < 0 ? "this" : nb, | |
224 | dp->number, dp->major, dp->minor, dp->raid_disk); | |
225 | wonly = dp->state & (1<<MD_DISK_WRITEMOSTLY); | |
226 | dp->state &= ~(1<<MD_DISK_WRITEMOSTLY); | |
227 | if (dp->state & (1<<MD_DISK_FAULTY)) printf(" faulty"); | |
228 | if (dp->state & (1<<MD_DISK_ACTIVE)) printf(" active"); | |
229 | if (dp->state & (1<<MD_DISK_SYNC)) printf(" sync"); | |
230 | if (dp->state & (1<<MD_DISK_REMOVED)) printf(" removed"); | |
231 | if (wonly) printf(" write-mostly"); | |
232 | if (dp->state == 0) printf(" spare"); | |
233 | if ((dv=map_dev(dp->major, dp->minor, 0))) | |
234 | printf(" %s", dv); | |
235 | printf("\n"); | |
236 | if (d == -1) printf("\n"); | |
237 | } | |
238 | } | |
239 | ||
240 | static void brief_examine_super0(struct supertype *st, int verbose) | |
241 | { | |
242 | mdp_super_t *sb = st->sb; | |
243 | char *c=map_num(pers, sb->level); | |
244 | char devname[20]; | |
245 | ||
246 | sprintf(devname, "/dev/md%d", sb->md_minor); | |
247 | ||
248 | if (verbose) { | |
249 | printf("ARRAY %s level=%s num-devices=%d", | |
250 | devname, | |
251 | c?c:"-unknown-", sb->raid_disks); | |
252 | } else | |
253 | printf("ARRAY %s", devname); | |
254 | ||
255 | if (sb->minor_version >= 90) | |
256 | printf(" UUID=%08x:%08x:%08x:%08x", sb->set_uuid0, sb->set_uuid1, | |
257 | sb->set_uuid2, sb->set_uuid3); | |
258 | else | |
259 | printf(" UUID=%08x", sb->set_uuid0); | |
260 | printf("\n"); | |
261 | } | |
262 | ||
263 | static void export_examine_super0(struct supertype *st) | |
264 | { | |
265 | mdp_super_t *sb = st->sb; | |
266 | ||
267 | printf("MD_LEVEL=%s\n", map_num(pers, sb->level)); | |
268 | printf("MD_DEVICES=%d\n", sb->raid_disks); | |
269 | if (sb->minor_version >= 90) | |
270 | printf("MD_UUID=%08x:%08x:%08x:%08x\n", | |
271 | sb->set_uuid0, sb->set_uuid1, | |
272 | sb->set_uuid2, sb->set_uuid3); | |
273 | else | |
274 | printf("MD_UUID=%08x\n", sb->set_uuid0); | |
275 | printf("MD_UPDATE_TIME=%llu\n", | |
276 | __le64_to_cpu(sb->ctime) & 0xFFFFFFFFFFULL); | |
277 | printf("MD_EVENTS=%llu\n", | |
278 | ((unsigned long long)sb->events_hi << 32) | |
279 | + sb->events_lo); | |
280 | } | |
281 | ||
282 | static int copy_metadata0(struct supertype *st, int from, int to) | |
283 | { | |
284 | /* Read 64K from the appropriate offset of 'from' | |
285 | * and if it looks a little like a 0.90 superblock, | |
286 | * write it to the same offset of 'to' | |
287 | */ | |
288 | void *buf; | |
289 | unsigned long long dsize, offset; | |
290 | const int bufsize = 64*1024; | |
291 | mdp_super_t *super; | |
292 | ||
293 | if (posix_memalign(&buf, 4096, bufsize) != 0) | |
294 | return 1; | |
295 | ||
296 | if (!get_dev_size(from, NULL, &dsize)) | |
297 | goto err; | |
298 | ||
299 | if (dsize < MD_RESERVED_SECTORS*512) | |
300 | goto err; | |
301 | ||
302 | offset = MD_NEW_SIZE_SECTORS(dsize>>9); | |
303 | ||
304 | offset *= 512; | |
305 | ||
306 | if (lseek64(from, offset, 0) < 0LL) | |
307 | goto err; | |
308 | if (read(from, buf, bufsize) != bufsize) | |
309 | goto err; | |
310 | ||
311 | if (lseek64(to, offset, 0) < 0LL) | |
312 | goto err; | |
313 | super = buf; | |
314 | if (super->md_magic != MD_SB_MAGIC || | |
315 | super->major_version != 0 || | |
316 | calc_sb0_csum(super) != super->sb_csum) | |
317 | goto err; | |
318 | if (write(to, buf, bufsize) != bufsize) | |
319 | goto err; | |
320 | free(buf); | |
321 | return 0; | |
322 | err: | |
323 | free(buf); | |
324 | return 1; | |
325 | } | |
326 | ||
327 | static void detail_super0(struct supertype *st, char *homehost) | |
328 | { | |
329 | mdp_super_t *sb = st->sb; | |
330 | printf(" UUID : "); | |
331 | if (sb->minor_version >= 90) | |
332 | printf("%08x:%08x:%08x:%08x", sb->set_uuid0, sb->set_uuid1, | |
333 | sb->set_uuid2, sb->set_uuid3); | |
334 | else | |
335 | printf("%08x", sb->set_uuid0); | |
336 | if (homehost) { | |
337 | char buf[20]; | |
338 | void *hash = sha1_buffer(homehost, | |
339 | strlen(homehost), | |
340 | buf); | |
341 | if (memcmp(&sb->set_uuid2, hash, 8)==0) | |
342 | printf(" (local to host %s)", homehost); | |
343 | } | |
344 | printf("\n Events : %d.%d\n\n", sb->events_hi, sb->events_lo); | |
345 | } | |
346 | ||
347 | static void brief_detail_super0(struct supertype *st) | |
348 | { | |
349 | mdp_super_t *sb = st->sb; | |
350 | printf(" UUID="); | |
351 | if (sb->minor_version >= 90) | |
352 | printf("%08x:%08x:%08x:%08x", sb->set_uuid0, sb->set_uuid1, | |
353 | sb->set_uuid2, sb->set_uuid3); | |
354 | else | |
355 | printf("%08x", sb->set_uuid0); | |
356 | } | |
357 | #endif | |
358 | ||
359 | static int match_home0(struct supertype *st, char *homehost) | |
360 | { | |
361 | mdp_super_t *sb = st->sb; | |
362 | char buf[20]; | |
363 | char *hash; | |
364 | ||
365 | if (!homehost) | |
366 | return 0; | |
367 | hash = sha1_buffer(homehost, | |
368 | strlen(homehost), | |
369 | buf); | |
370 | ||
371 | return (memcmp(&sb->set_uuid2, hash, 8)==0); | |
372 | } | |
373 | ||
374 | static void uuid_from_super0(struct supertype *st, int uuid[4]) | |
375 | { | |
376 | mdp_super_t *super = st->sb; | |
377 | uuid[0] = super->set_uuid0; | |
378 | if (super->minor_version >= 90) { | |
379 | uuid[1] = super->set_uuid1; | |
380 | uuid[2] = super->set_uuid2; | |
381 | uuid[3] = super->set_uuid3; | |
382 | } else { | |
383 | uuid[1] = 0; | |
384 | uuid[2] = 0; | |
385 | uuid[3] = 0; | |
386 | } | |
387 | } | |
388 | ||
389 | static void getinfo_super0(struct supertype *st, struct mdinfo *info, char *map) | |
390 | { | |
391 | mdp_super_t *sb = st->sb; | |
392 | int working = 0; | |
393 | int i; | |
394 | int map_disks = info->array.raid_disks; | |
395 | ||
396 | memset(info, 0, sizeof(*info)); | |
397 | info->array.major_version = sb->major_version; | |
398 | info->array.minor_version = sb->minor_version; | |
399 | info->array.patch_version = sb->patch_version; | |
400 | info->array.raid_disks = sb->raid_disks; | |
401 | info->array.level = sb->level; | |
402 | info->array.layout = sb->layout; | |
403 | info->array.md_minor = sb->md_minor; | |
404 | info->array.ctime = sb->ctime; | |
405 | info->array.utime = sb->utime; | |
406 | info->array.chunk_size = sb->chunk_size; | |
407 | info->array.state = sb->state; | |
408 | info->component_size = sb->size*2; | |
409 | ||
410 | if (sb->state & (1<<MD_SB_BITMAP_PRESENT)) | |
411 | info->bitmap_offset = 8; | |
412 | ||
413 | info->disk.state = sb->this_disk.state; | |
414 | info->disk.major = sb->this_disk.major; | |
415 | info->disk.minor = sb->this_disk.minor; | |
416 | info->disk.raid_disk = sb->this_disk.raid_disk; | |
417 | info->disk.number = sb->this_disk.number; | |
418 | ||
419 | info->events = md_event(sb); | |
420 | info->data_offset = 0; | |
421 | ||
422 | sprintf(info->text_version, "0.%d", sb->minor_version); | |
423 | info->safe_mode_delay = 200; | |
424 | ||
425 | uuid_from_super0(st, info->uuid); | |
426 | ||
427 | info->recovery_start = MaxSector; | |
428 | if (sb->minor_version > 90 && (sb->reshape_position+1) != 0) { | |
429 | info->reshape_active = 1; | |
430 | info->reshape_progress = sb->reshape_position; | |
431 | info->new_level = sb->new_level; | |
432 | info->delta_disks = sb->delta_disks; | |
433 | info->new_layout = sb->new_layout; | |
434 | info->new_chunk = sb->new_chunk; | |
435 | if (info->delta_disks < 0) | |
436 | info->array.raid_disks -= info->delta_disks; | |
437 | } else | |
438 | info->reshape_active = 0; | |
439 | ||
440 | info->recovery_blocked = info->reshape_active; | |
441 | ||
442 | sprintf(info->name, "%d", sb->md_minor); | |
443 | /* work_disks is calculated rather than read directly */ | |
444 | for (i=0; i < MD_SB_DISKS; i++) | |
445 | if ((sb->disks[i].state & (1<<MD_DISK_SYNC)) && | |
446 | (sb->disks[i].raid_disk < (unsigned)info->array.raid_disks) && | |
447 | (sb->disks[i].state & (1<<MD_DISK_ACTIVE)) && | |
448 | !(sb->disks[i].state & (1<<MD_DISK_FAULTY))) { | |
449 | working ++; | |
450 | if (map && i < map_disks) | |
451 | map[i] = 1; | |
452 | } else if (map && i < map_disks) | |
453 | map[i] = 0; | |
454 | info->array.working_disks = working; | |
455 | } | |
456 | ||
457 | static struct mdinfo *container_content0(struct supertype *st, char *subarray) | |
458 | { | |
459 | struct mdinfo *info; | |
460 | ||
461 | if (subarray) | |
462 | return NULL; | |
463 | ||
464 | info = xmalloc(sizeof(*info)); | |
465 | getinfo_super0(st, info, NULL); | |
466 | return info; | |
467 | } | |
468 | ||
469 | static int update_super0(struct supertype *st, struct mdinfo *info, | |
470 | char *update, | |
471 | char *devname, int verbose, | |
472 | int uuid_set, char *homehost) | |
473 | { | |
474 | /* NOTE: for 'assemble' and 'force' we need to return non-zero | |
475 | * if any change was made. For others, the return value is | |
476 | * ignored. | |
477 | */ | |
478 | int rv = 0; | |
479 | int uuid[4]; | |
480 | mdp_super_t *sb = st->sb; | |
481 | ||
482 | if (strcmp(update, "homehost") == 0 && | |
483 | homehost) { | |
484 | /* note that 'homehost' is special as it is really | |
485 | * a "uuid" update. | |
486 | */ | |
487 | uuid_set = 0; | |
488 | update = "uuid"; | |
489 | info->uuid[0] = sb->set_uuid0; | |
490 | info->uuid[1] = sb->set_uuid1; | |
491 | } | |
492 | ||
493 | if (strcmp(update, "sparc2.2")==0 ) { | |
494 | /* 2.2 sparc put the events in the wrong place | |
495 | * So we copy the tail of the superblock | |
496 | * up 4 bytes before continuing | |
497 | */ | |
498 | __u32 *sb32 = (__u32*)sb; | |
499 | memcpy(sb32+MD_SB_GENERIC_CONSTANT_WORDS+7, | |
500 | sb32+MD_SB_GENERIC_CONSTANT_WORDS+7+1, | |
501 | (MD_SB_WORDS - (MD_SB_GENERIC_CONSTANT_WORDS+7+1))*4); | |
502 | if (verbose >= 0) | |
503 | pr_err("adjusting superblock of %s for 2.2/sparc compatibility.\n", | |
504 | devname); | |
505 | } else if (strcmp(update, "super-minor") ==0) { | |
506 | sb->md_minor = info->array.md_minor; | |
507 | if (verbose > 0) | |
508 | pr_err("updating superblock of %s with minor number %d\n", | |
509 | devname, info->array.md_minor); | |
510 | } else if (strcmp(update, "summaries") == 0) { | |
511 | unsigned int i; | |
512 | /* set nr_disks, active_disks, working_disks, | |
513 | * failed_disks, spare_disks based on disks[] | |
514 | * array in superblock. | |
515 | * Also make sure extra slots aren't 'failed' | |
516 | */ | |
517 | sb->nr_disks = sb->active_disks = | |
518 | sb->working_disks = sb->failed_disks = | |
519 | sb->spare_disks = 0; | |
520 | for (i=0; i < MD_SB_DISKS ; i++) | |
521 | if (sb->disks[i].major || | |
522 | sb->disks[i].minor) { | |
523 | int state = sb->disks[i].state; | |
524 | if (state & (1<<MD_DISK_REMOVED)) | |
525 | continue; | |
526 | sb->nr_disks++; | |
527 | if (state & (1<<MD_DISK_ACTIVE)) | |
528 | sb->active_disks++; | |
529 | if (state & (1<<MD_DISK_FAULTY)) | |
530 | sb->failed_disks++; | |
531 | else | |
532 | sb->working_disks++; | |
533 | if (state == 0) | |
534 | sb->spare_disks++; | |
535 | } else if (i >= sb->raid_disks && sb->disks[i].number == 0) | |
536 | sb->disks[i].state = 0; | |
537 | } else if (strcmp(update, "force-one")==0) { | |
538 | /* Not enough devices for a working array, so | |
539 | * bring this one up-to-date. | |
540 | */ | |
541 | __u32 ehi = sb->events_hi, elo = sb->events_lo; | |
542 | sb->events_hi = (info->events>>32) & 0xFFFFFFFF; | |
543 | sb->events_lo = (info->events) & 0xFFFFFFFF; | |
544 | if (sb->events_hi != ehi || | |
545 | sb->events_lo != elo) | |
546 | rv = 1; | |
547 | } else if (strcmp(update, "force-array")==0) { | |
548 | /* degraded array and 'force' requested, so | |
549 | * maybe need to mark it 'clean' | |
550 | */ | |
551 | if ((sb->level == 5 || sb->level == 4 || sb->level == 6) && | |
552 | (sb->state & (1 << MD_SB_CLEAN)) == 0) { | |
553 | /* need to force clean */ | |
554 | sb->state |= (1 << MD_SB_CLEAN); | |
555 | rv = 1; | |
556 | } | |
557 | } else if (strcmp(update, "assemble")==0) { | |
558 | int d = info->disk.number; | |
559 | int wonly = sb->disks[d].state & (1<<MD_DISK_WRITEMOSTLY); | |
560 | int mask = (1<<MD_DISK_WRITEMOSTLY); | |
561 | int add = 0; | |
562 | if (sb->minor_version >= 91) | |
563 | /* During reshape we don't insist on everything | |
564 | * being marked 'sync' | |
565 | */ | |
566 | add = (1<<MD_DISK_SYNC); | |
567 | if (((sb->disks[d].state & ~mask) | add) | |
568 | != (unsigned)info->disk.state) { | |
569 | sb->disks[d].state = info->disk.state | wonly; | |
570 | rv = 1; | |
571 | } | |
572 | if (info->reshape_active && | |
573 | sb->minor_version > 90 && (sb->reshape_position+1) != 0 && | |
574 | info->delta_disks >= 0 && | |
575 | info->reshape_progress < sb->reshape_position) { | |
576 | sb->reshape_position = info->reshape_progress; | |
577 | rv = 1; | |
578 | } | |
579 | if (info->reshape_active && | |
580 | sb->minor_version > 90 && (sb->reshape_position+1) != 0 && | |
581 | info->delta_disks < 0 && | |
582 | info->reshape_progress > sb->reshape_position) { | |
583 | sb->reshape_position = info->reshape_progress; | |
584 | rv = 1; | |
585 | } | |
586 | } else if (strcmp(update, "linear-grow-new") == 0) { | |
587 | memset(&sb->disks[info->disk.number], 0, sizeof(sb->disks[0])); | |
588 | sb->disks[info->disk.number].number = info->disk.number; | |
589 | sb->disks[info->disk.number].major = info->disk.major; | |
590 | sb->disks[info->disk.number].minor = info->disk.minor; | |
591 | sb->disks[info->disk.number].raid_disk = info->disk.raid_disk; | |
592 | sb->disks[info->disk.number].state = info->disk.state; | |
593 | sb->this_disk = sb->disks[info->disk.number]; | |
594 | } else if (strcmp(update, "linear-grow-update") == 0) { | |
595 | sb->raid_disks = info->array.raid_disks; | |
596 | sb->nr_disks = info->array.nr_disks; | |
597 | sb->active_disks = info->array.active_disks; | |
598 | sb->working_disks = info->array.working_disks; | |
599 | memset(&sb->disks[info->disk.number], 0, sizeof(sb->disks[0])); | |
600 | sb->disks[info->disk.number].number = info->disk.number; | |
601 | sb->disks[info->disk.number].major = info->disk.major; | |
602 | sb->disks[info->disk.number].minor = info->disk.minor; | |
603 | sb->disks[info->disk.number].raid_disk = info->disk.raid_disk; | |
604 | sb->disks[info->disk.number].state = info->disk.state; | |
605 | } else if (strcmp(update, "resync") == 0) { | |
606 | /* make sure resync happens */ | |
607 | sb->state &= ~(1<<MD_SB_CLEAN); | |
608 | sb->recovery_cp = 0; | |
609 | } else if (strcmp(update, "uuid") == 0) { | |
610 | if (!uuid_set && homehost) { | |
611 | char buf[20]; | |
612 | char *hash = sha1_buffer(homehost, | |
613 | strlen(homehost), | |
614 | buf); | |
615 | memcpy(info->uuid+2, hash, 8); | |
616 | } | |
617 | sb->set_uuid0 = info->uuid[0]; | |
618 | sb->set_uuid1 = info->uuid[1]; | |
619 | sb->set_uuid2 = info->uuid[2]; | |
620 | sb->set_uuid3 = info->uuid[3]; | |
621 | if (sb->state & (1<<MD_SB_BITMAP_PRESENT)) { | |
622 | struct bitmap_super_s *bm; | |
623 | bm = (struct bitmap_super_s*)(sb+1); | |
624 | uuid_from_super0(st, uuid); | |
625 | memcpy(bm->uuid, uuid, 16); | |
626 | } | |
627 | } else if (strcmp(update, "metadata") == 0) { | |
628 | /* Create some v1.0 metadata to match ours but make the | |
629 | * ctime bigger. Also update info->array.*_version. | |
630 | * We need to arrange that store_super writes out | |
631 | * the v1.0 metadata. | |
632 | * Not permitted for unclean array, or array with | |
633 | * bitmap. | |
634 | */ | |
635 | if (info->bitmap_offset) { | |
636 | pr_err("Cannot update metadata when bitmap is present\n"); | |
637 | rv = -2; | |
638 | } else if (info->array.state != 1) { | |
639 | pr_err("Cannot update metadata on unclean array\n"); | |
640 | rv = -2; | |
641 | } else { | |
642 | info->array.major_version = 1; | |
643 | info->array.minor_version = 0; | |
644 | uuid_from_super0(st, info->uuid); | |
645 | st->other = super1_make_v0(st, info, st->sb); | |
646 | } | |
647 | } else if (strcmp(update, "revert-reshape") == 0) { | |
648 | rv = -2; | |
649 | if (sb->minor_version <= 90) | |
650 | pr_err("No active reshape to revert on %s\n", | |
651 | devname); | |
652 | else if (sb->delta_disks == 0) | |
653 | pr_err("%s: Can only revert reshape which changes number of devices\n", | |
654 | devname); | |
655 | else { | |
656 | int tmp; | |
657 | int parity = sb->level == 6 ? 2 : 1; | |
658 | rv = 0; | |
659 | ||
660 | if (sb->level >= 4 && sb->level <= 6 && | |
661 | sb->reshape_position % ( | |
662 | sb->new_chunk/512 * | |
663 | (sb->raid_disks - sb->delta_disks - parity))) { | |
664 | pr_err("Reshape position is not suitably aligned.\n"); | |
665 | pr_err("Try normal assembly and stop again\n"); | |
666 | return -2; | |
667 | } | |
668 | sb->raid_disks -= sb->delta_disks; | |
669 | sb->delta_disks = -sb->delta_disks; | |
670 | ||
671 | tmp = sb->new_layout; | |
672 | sb->new_layout = sb->layout; | |
673 | sb->layout = tmp; | |
674 | ||
675 | tmp = sb->new_chunk; | |
676 | sb->new_chunk = sb->chunk_size; | |
677 | sb->chunk_size = tmp; | |
678 | } | |
679 | } else if (strcmp(update, "no-bitmap") == 0) { | |
680 | sb->state &= ~(1<<MD_SB_BITMAP_PRESENT); | |
681 | } else if (strcmp(update, "_reshape_progress")==0) | |
682 | sb->reshape_position = info->reshape_progress; | |
683 | else if (strcmp(update, "writemostly")==0) | |
684 | sb->state |= (1<<MD_DISK_WRITEMOSTLY); | |
685 | else if (strcmp(update, "readwrite")==0) | |
686 | sb->state &= ~(1<<MD_DISK_WRITEMOSTLY); | |
687 | else | |
688 | rv = -1; | |
689 | ||
690 | sb->sb_csum = calc_sb0_csum(sb); | |
691 | return rv; | |
692 | } | |
693 | ||
694 | /* | |
695 | * For verion-0 superblock, the homehost is 'stored' in the | |
696 | * uuid. 8 bytes for a hash of the host leaving 8 bytes | |
697 | * of random material. | |
698 | * We use the first 8 bytes (64bits) of the sha1 of the | |
699 | * host name | |
700 | */ | |
701 | ||
702 | static int init_super0(struct supertype *st, mdu_array_info_t *info, | |
703 | unsigned long long size, char *ignored_name, char *homehost, | |
704 | int *uuid, unsigned long long data_offset) | |
705 | { | |
706 | mdp_super_t *sb; | |
707 | int spares; | |
708 | ||
709 | if (data_offset != INVALID_SECTORS) { | |
710 | pr_err("data-offset not support for 0.90\n"); | |
711 | return 0; | |
712 | } | |
713 | ||
714 | if (posix_memalign((void**)&sb, 4096, | |
715 | MD_SB_BYTES + ROUND_UP(sizeof(bitmap_super_t), 4096)) != 0) { | |
716 | pr_err("could not allocate superblock\n"); | |
717 | return 0; | |
718 | } | |
719 | memset(sb, 0, MD_SB_BYTES + sizeof(bitmap_super_t)); | |
720 | ||
721 | st->sb = sb; | |
722 | if (info == NULL) { | |
723 | /* zeroing the superblock */ | |
724 | return 0; | |
725 | } | |
726 | ||
727 | spares = info->working_disks - info->active_disks; | |
728 | if (info->raid_disks + spares > MD_SB_DISKS) { | |
729 | pr_err("too many devices requested: %d+%d > %d\n", | |
730 | info->raid_disks , spares, MD_SB_DISKS); | |
731 | return 0; | |
732 | } | |
733 | ||
734 | sb->md_magic = MD_SB_MAGIC; | |
735 | sb->major_version = 0; | |
736 | sb->minor_version = 90; | |
737 | sb->patch_version = 0; | |
738 | sb->gvalid_words = 0; /* ignored */ | |
739 | sb->ctime = time(0); | |
740 | sb->level = info->level; | |
741 | sb->size = size; | |
742 | if (size != (unsigned long long)sb->size) | |
743 | return 0; | |
744 | sb->nr_disks = info->nr_disks; | |
745 | sb->raid_disks = info->raid_disks; | |
746 | sb->md_minor = info->md_minor; | |
747 | sb->not_persistent = 0; | |
748 | if (uuid) { | |
749 | sb->set_uuid0 = uuid[0]; | |
750 | sb->set_uuid1 = uuid[1]; | |
751 | sb->set_uuid2 = uuid[2]; | |
752 | sb->set_uuid3 = uuid[3]; | |
753 | } else { | |
754 | int rfd = open("/dev/urandom", O_RDONLY); | |
755 | if (rfd < 0 || read(rfd, &sb->set_uuid0, 4) != 4) | |
756 | sb->set_uuid0 = random(); | |
757 | if (rfd < 0 || read(rfd, &sb->set_uuid1, 12) != 12) { | |
758 | sb->set_uuid1 = random(); | |
759 | sb->set_uuid2 = random(); | |
760 | sb->set_uuid3 = random(); | |
761 | } | |
762 | if (rfd >= 0) | |
763 | close(rfd); | |
764 | } | |
765 | if (homehost && !uuid) { | |
766 | char buf[20]; | |
767 | char *hash = sha1_buffer(homehost, | |
768 | strlen(homehost), | |
769 | buf); | |
770 | memcpy(&sb->set_uuid2, hash, 8); | |
771 | } | |
772 | ||
773 | sb->utime = sb->ctime; | |
774 | sb->state = info->state; | |
775 | sb->active_disks = info->active_disks; | |
776 | sb->working_disks = info->working_disks; | |
777 | sb->failed_disks = info->failed_disks; | |
778 | sb->spare_disks = info->spare_disks; | |
779 | sb->events_hi = 0; | |
780 | sb->events_lo = 1; | |
781 | ||
782 | sb->layout = info->layout; | |
783 | sb->chunk_size = info->chunk_size; | |
784 | ||
785 | return 1; | |
786 | } | |
787 | ||
788 | struct devinfo { | |
789 | int fd; | |
790 | char *devname; | |
791 | mdu_disk_info_t disk; | |
792 | struct devinfo *next; | |
793 | }; | |
794 | ||
795 | #ifndef MDASSEMBLE | |
796 | /* Add a device to the superblock being created */ | |
797 | static int add_to_super0(struct supertype *st, mdu_disk_info_t *dinfo, | |
798 | int fd, char *devname, unsigned long long data_offset) | |
799 | { | |
800 | mdp_super_t *sb = st->sb; | |
801 | mdp_disk_t *dk = &sb->disks[dinfo->number]; | |
802 | struct devinfo *di, **dip; | |
803 | ||
804 | dk->number = dinfo->number; | |
805 | dk->major = dinfo->major; | |
806 | dk->minor = dinfo->minor; | |
807 | dk->raid_disk = dinfo->raid_disk; | |
808 | dk->state = dinfo->state & ((1<<MD_DISK_ACTIVE) | | |
809 | (1<<MD_DISK_SYNC)); | |
810 | ||
811 | sb->this_disk = sb->disks[dinfo->number]; | |
812 | sb->sb_csum = calc_sb0_csum(sb); | |
813 | ||
814 | dip = (struct devinfo **)&st->info; | |
815 | while (*dip) | |
816 | dip = &(*dip)->next; | |
817 | di = xmalloc(sizeof(struct devinfo)); | |
818 | di->fd = fd; | |
819 | di->devname = devname; | |
820 | di->disk = *dinfo; | |
821 | di->next = NULL; | |
822 | *dip = di; | |
823 | ||
824 | return 0; | |
825 | } | |
826 | #endif | |
827 | ||
828 | static int store_super0(struct supertype *st, int fd) | |
829 | { | |
830 | unsigned long long dsize; | |
831 | unsigned long long offset; | |
832 | mdp_super_t *super = st->sb; | |
833 | ||
834 | if (!get_dev_size(fd, NULL, &dsize)) | |
835 | return 1; | |
836 | ||
837 | if (dsize < MD_RESERVED_SECTORS*512) | |
838 | return 2; | |
839 | ||
840 | if (st->other) { | |
841 | /* Writing out v1.0 metadata for --update=metadata */ | |
842 | int ret = 0; | |
843 | ||
844 | offset = dsize/512 - 8*2; | |
845 | offset &= ~(4*2-1); | |
846 | offset *= 512; | |
847 | if (lseek64(fd, offset, 0)< 0LL) | |
848 | ret = 3; | |
849 | else if (write(fd, st->other, 1024) != 1024) | |
850 | ret = 4; | |
851 | else | |
852 | fsync(fd); | |
853 | free(st->other); | |
854 | st->other = NULL; | |
855 | return ret; | |
856 | } | |
857 | ||
858 | offset = MD_NEW_SIZE_SECTORS(dsize>>9); | |
859 | ||
860 | offset *= 512; | |
861 | ||
862 | if (lseek64(fd, offset, 0)< 0LL) | |
863 | return 3; | |
864 | ||
865 | if (write(fd, super, sizeof(*super)) != sizeof(*super)) | |
866 | return 4; | |
867 | ||
868 | if (super->state & (1<<MD_SB_BITMAP_PRESENT)) { | |
869 | struct bitmap_super_s * bm = (struct bitmap_super_s*)(super+1); | |
870 | if (__le32_to_cpu(bm->magic) == BITMAP_MAGIC) | |
871 | if (write(fd, bm, ROUND_UP(sizeof(*bm),4096)) != | |
872 | ROUND_UP(sizeof(*bm),4096)) | |
873 | return 5; | |
874 | } | |
875 | ||
876 | fsync(fd); | |
877 | return 0; | |
878 | } | |
879 | ||
880 | #ifndef MDASSEMBLE | |
881 | static int write_init_super0(struct supertype *st) | |
882 | { | |
883 | mdp_super_t *sb = st->sb; | |
884 | int rv = 0; | |
885 | struct devinfo *di; | |
886 | ||
887 | for (di = st->info ; di && ! rv ; di = di->next) { | |
888 | ||
889 | if (di->disk.state & (1 << MD_DISK_FAULTY)) | |
890 | continue; | |
891 | if (di->fd == -1) | |
892 | continue; | |
893 | while (Kill(di->devname, NULL, 0, -1, 1) == 0) | |
894 | ; | |
895 | ||
896 | sb->disks[di->disk.number].state &= ~(1<<MD_DISK_FAULTY); | |
897 | ||
898 | sb->this_disk = sb->disks[di->disk.number]; | |
899 | sb->sb_csum = calc_sb0_csum(sb); | |
900 | rv = store_super0(st, di->fd); | |
901 | ||
902 | if (rv == 0 && (sb->state & (1<<MD_SB_BITMAP_PRESENT))) | |
903 | rv = st->ss->write_bitmap(st, di->fd, NoUpdate); | |
904 | ||
905 | if (rv) | |
906 | pr_err("failed to write superblock to %s\n", | |
907 | di->devname); | |
908 | } | |
909 | return rv; | |
910 | } | |
911 | #endif | |
912 | ||
913 | static int compare_super0(struct supertype *st, struct supertype *tst) | |
914 | { | |
915 | /* | |
916 | * return: | |
917 | * 0 same, or first was empty, and second was copied | |
918 | * 1 second had wrong number | |
919 | * 2 wrong uuid | |
920 | * 3 wrong other info | |
921 | */ | |
922 | mdp_super_t *first = st->sb; | |
923 | mdp_super_t *second = tst->sb; | |
924 | int uuid1[4], uuid2[4]; | |
925 | ||
926 | if (second->md_magic != MD_SB_MAGIC) | |
927 | return 1; | |
928 | if (!first) { | |
929 | if (posix_memalign((void**)&first, 4096, | |
930 | MD_SB_BYTES + | |
931 | ROUND_UP(sizeof(struct bitmap_super_s), 4096)) != 0) { | |
932 | pr_err("could not allocate superblock\n"); | |
933 | return 1; | |
934 | } | |
935 | memcpy(first, second, MD_SB_BYTES + sizeof(struct bitmap_super_s)); | |
936 | st->sb = first; | |
937 | return 0; | |
938 | } | |
939 | ||
940 | uuid_from_super0(st, uuid1); | |
941 | uuid_from_super0(tst, uuid2); | |
942 | if (!same_uuid(uuid1, uuid2, 0)) | |
943 | return 2; | |
944 | if (first->major_version != second->major_version || | |
945 | first->minor_version != second->minor_version || | |
946 | first->patch_version != second->patch_version || | |
947 | first->gvalid_words != second->gvalid_words || | |
948 | first->ctime != second->ctime || | |
949 | first->level != second->level || | |
950 | first->size != second->size || | |
951 | first->raid_disks != second->raid_disks ) | |
952 | return 3; | |
953 | ||
954 | return 0; | |
955 | } | |
956 | ||
957 | static void free_super0(struct supertype *st); | |
958 | ||
959 | static int load_super0(struct supertype *st, int fd, char *devname) | |
960 | { | |
961 | /* try to read in the superblock | |
962 | * Return: | |
963 | * 0 on success | |
964 | * 1 on cannot get superblock | |
965 | * 2 on superblock meaningless | |
966 | */ | |
967 | unsigned long long dsize; | |
968 | unsigned long long offset; | |
969 | mdp_super_t *super; | |
970 | int uuid[4]; | |
971 | struct bitmap_super_s *bsb; | |
972 | ||
973 | free_super0(st); | |
974 | ||
975 | if (!get_dev_size(fd, devname, &dsize)) | |
976 | return 1; | |
977 | ||
978 | if (dsize < MD_RESERVED_SECTORS*512) { | |
979 | if (devname) | |
980 | pr_err("%s is too small for md: size is %llu sectors.\n", | |
981 | devname, dsize); | |
982 | return 1; | |
983 | } | |
984 | st->devsize = dsize; | |
985 | ||
986 | offset = MD_NEW_SIZE_SECTORS(dsize>>9); | |
987 | ||
988 | offset *= 512; | |
989 | ||
990 | if (lseek64(fd, offset, 0)< 0LL) { | |
991 | if (devname) | |
992 | pr_err("Cannot seek to superblock on %s: %s\n", | |
993 | devname, strerror(errno)); | |
994 | return 1; | |
995 | } | |
996 | ||
997 | if (posix_memalign((void**)&super, 4096, | |
998 | MD_SB_BYTES + | |
999 | ROUND_UP(sizeof(bitmap_super_t), 4096)) != 0) { | |
1000 | pr_err("could not allocate superblock\n"); | |
1001 | return 1; | |
1002 | } | |
1003 | ||
1004 | if (read(fd, super, sizeof(*super)) != MD_SB_BYTES) { | |
1005 | if (devname) | |
1006 | pr_err("Cannot read superblock on %s\n", | |
1007 | devname); | |
1008 | free(super); | |
1009 | return 1; | |
1010 | } | |
1011 | ||
1012 | if (st->ss && st->minor_version == 9) | |
1013 | super0_swap_endian(super); | |
1014 | ||
1015 | if (super->md_magic != MD_SB_MAGIC) { | |
1016 | if (devname) | |
1017 | pr_err("No super block found on %s (Expected magic %08x, got %08x)\n", | |
1018 | devname, MD_SB_MAGIC, super->md_magic); | |
1019 | free(super); | |
1020 | return 2; | |
1021 | } | |
1022 | ||
1023 | if (super->major_version != 0) { | |
1024 | if (devname) | |
1025 | pr_err("Cannot interpret superblock on %s - version is %d\n", | |
1026 | devname, super->major_version); | |
1027 | free(super); | |
1028 | return 2; | |
1029 | } | |
1030 | st->sb = super; | |
1031 | ||
1032 | if (st->ss == NULL) { | |
1033 | st->ss = &super0; | |
1034 | st->minor_version = super->minor_version; | |
1035 | st->max_devs = MD_SB_DISKS; | |
1036 | st->info = NULL; | |
1037 | } | |
1038 | ||
1039 | /* Now check on the bitmap superblock */ | |
1040 | if ((super->state & (1<<MD_SB_BITMAP_PRESENT)) == 0) | |
1041 | return 0; | |
1042 | /* Read the bitmap superblock and make sure it looks | |
1043 | * valid. If it doesn't clear the bit. An --assemble --force | |
1044 | * should get that written out. | |
1045 | */ | |
1046 | if (read(fd, super+1, ROUND_UP(sizeof(struct bitmap_super_s),4096)) | |
1047 | != ROUND_UP(sizeof(struct bitmap_super_s),4096)) | |
1048 | goto no_bitmap; | |
1049 | ||
1050 | uuid_from_super0(st, uuid); | |
1051 | bsb = (struct bitmap_super_s *)(super+1); | |
1052 | if (__le32_to_cpu(bsb->magic) != BITMAP_MAGIC || | |
1053 | memcmp(bsb->uuid, uuid, 16) != 0) | |
1054 | goto no_bitmap; | |
1055 | return 0; | |
1056 | ||
1057 | no_bitmap: | |
1058 | super->state &= ~(1<<MD_SB_BITMAP_PRESENT); | |
1059 | ||
1060 | return 0; | |
1061 | } | |
1062 | ||
1063 | static struct supertype *match_metadata_desc0(char *arg) | |
1064 | { | |
1065 | struct supertype *st = xcalloc(1, sizeof(*st)); | |
1066 | ||
1067 | st->container_devnm[0] = 0; | |
1068 | st->ss = &super0; | |
1069 | st->info = NULL; | |
1070 | st->minor_version = 90; | |
1071 | st->max_devs = MD_SB_DISKS; | |
1072 | st->sb = NULL; | |
1073 | /* we sometimes get 00.90 */ | |
1074 | while (arg[0] == '0' && arg[1] == '0') | |
1075 | arg++; | |
1076 | if (strcmp(arg, "0") == 0 || | |
1077 | #ifdef DEFAULT_OLD_METADATA /* ifndef in super1.c */ | |
1078 | strcmp(arg, "default") == 0 || | |
1079 | #endif /* DEFAULT_OLD_METADATA */ | |
1080 | strcmp(arg, "0.90") == 0 || | |
1081 | strcmp(arg, "") == 0 /* no metadata - i.e. non_persistent */ | |
1082 | ) | |
1083 | return st; | |
1084 | ||
1085 | st->minor_version = 91; /* reshape in progress */ | |
1086 | if (strcmp(arg, "0.91") == 0) /* For dup_super support */ | |
1087 | return st; | |
1088 | ||
1089 | st->minor_version = 9; /* flag for 'byte-swapped' */ | |
1090 | if (strcmp(arg, "0.swap")==0 || | |
1091 | strcmp(arg, "0.9") == 0) /* For dup_super support */ | |
1092 | return st; | |
1093 | ||
1094 | free(st); | |
1095 | return NULL; | |
1096 | } | |
1097 | ||
1098 | static __u64 avail_size0(struct supertype *st, __u64 devsize, | |
1099 | unsigned long long data_offset) | |
1100 | { | |
1101 | if (data_offset != 0 && data_offset != INVALID_SECTORS) | |
1102 | return 0ULL; | |
1103 | if (devsize < MD_RESERVED_SECTORS) | |
1104 | return 0ULL; | |
1105 | return MD_NEW_SIZE_SECTORS(devsize); | |
1106 | } | |
1107 | ||
1108 | static int add_internal_bitmap0(struct supertype *st, int *chunkp, | |
1109 | int delay, int write_behind, | |
1110 | unsigned long long size, int may_change, | |
1111 | int major) | |
1112 | { | |
1113 | /* | |
1114 | * The bitmap comes immediately after the superblock and must be 60K in size | |
1115 | * at most. The default size is between 30K and 60K | |
1116 | * | |
1117 | * size is in sectors, chunk is in bytes !!! | |
1118 | */ | |
1119 | unsigned long long bits; | |
1120 | unsigned long long max_bits = (60*1024 - sizeof(bitmap_super_t))*8; | |
1121 | unsigned long long min_chunk; | |
1122 | int chunk = *chunkp; | |
1123 | mdp_super_t *sb = st->sb; | |
1124 | bitmap_super_t *bms = (bitmap_super_t*)(((char*)sb) + MD_SB_BYTES); | |
1125 | int uuid[4]; | |
1126 | ||
1127 | min_chunk = 4096; /* sub-page chunks don't work yet.. */ | |
1128 | bits = (size * 512) / min_chunk + 1; | |
1129 | while (bits > max_bits) { | |
1130 | min_chunk *= 2; | |
1131 | bits = (bits+1)/2; | |
1132 | } | |
1133 | if (chunk == UnSet) { | |
1134 | /* A chunk size less than a few Megabytes gives poor | |
1135 | * performance without increasing resync noticeably | |
1136 | */ | |
1137 | chunk = min_chunk; | |
1138 | if (chunk < 64*1024*1024) | |
1139 | chunk = 64*1024*1024; | |
1140 | } else if ((unsigned long long)chunk < min_chunk) | |
1141 | return 0; /* chunk size too small */ | |
1142 | ||
1143 | sb->state |= (1<<MD_SB_BITMAP_PRESENT); | |
1144 | ||
1145 | memset(bms, 0, sizeof(*bms)); | |
1146 | bms->magic = __cpu_to_le32(BITMAP_MAGIC); | |
1147 | bms->version = __cpu_to_le32(major); | |
1148 | uuid_from_super0(st, uuid); | |
1149 | memcpy(bms->uuid, uuid, 16); | |
1150 | bms->chunksize = __cpu_to_le32(chunk); | |
1151 | bms->daemon_sleep = __cpu_to_le32(delay); | |
1152 | bms->sync_size = __cpu_to_le64(size); | |
1153 | bms->write_behind = __cpu_to_le32(write_behind); | |
1154 | *chunkp = chunk; | |
1155 | return 1; | |
1156 | } | |
1157 | ||
1158 | static void locate_bitmap0(struct supertype *st, int fd) | |
1159 | { | |
1160 | unsigned long long dsize; | |
1161 | unsigned long long offset; | |
1162 | ||
1163 | if (!get_dev_size(fd, NULL, &dsize)) | |
1164 | return; | |
1165 | ||
1166 | if (dsize < MD_RESERVED_SECTORS*512) | |
1167 | return; | |
1168 | ||
1169 | offset = MD_NEW_SIZE_SECTORS(dsize>>9); | |
1170 | ||
1171 | offset *= 512; | |
1172 | ||
1173 | offset += MD_SB_BYTES; | |
1174 | ||
1175 | lseek64(fd, offset, 0); | |
1176 | } | |
1177 | ||
1178 | static int write_bitmap0(struct supertype *st, int fd, enum bitmap_update update) | |
1179 | { | |
1180 | unsigned long long dsize; | |
1181 | unsigned long long offset; | |
1182 | mdp_super_t *sb = st->sb; | |
1183 | ||
1184 | int rv = 0; | |
1185 | ||
1186 | int towrite, n; | |
1187 | void *buf; | |
1188 | ||
1189 | if (!get_dev_size(fd, NULL, &dsize)) | |
1190 | return 1; | |
1191 | ||
1192 | if (dsize < MD_RESERVED_SECTORS*512) | |
1193 | return -1; | |
1194 | ||
1195 | offset = MD_NEW_SIZE_SECTORS(dsize>>9); | |
1196 | ||
1197 | offset *= 512; | |
1198 | ||
1199 | if (lseek64(fd, offset + 4096, 0)< 0LL) | |
1200 | return 3; | |
1201 | ||
1202 | if (posix_memalign(&buf, 4096, 4096)) | |
1203 | return -ENOMEM; | |
1204 | ||
1205 | memset(buf, 0xff, 4096); | |
1206 | memcpy(buf, ((char*)sb)+MD_SB_BYTES, sizeof(bitmap_super_t)); | |
1207 | towrite = 60*1024; | |
1208 | while (towrite > 0) { | |
1209 | n = towrite; | |
1210 | if (n > 4096) | |
1211 | n = 4096; | |
1212 | n = write(fd, buf, n); | |
1213 | if (n > 0) | |
1214 | towrite -= n; | |
1215 | else | |
1216 | break; | |
1217 | memset(buf, 0xff, 4096); | |
1218 | } | |
1219 | fsync(fd); | |
1220 | if (towrite) | |
1221 | rv = -2; | |
1222 | ||
1223 | free(buf); | |
1224 | return rv; | |
1225 | } | |
1226 | ||
1227 | static void free_super0(struct supertype *st) | |
1228 | { | |
1229 | if (st->sb) | |
1230 | free(st->sb); | |
1231 | while (st->info) { | |
1232 | struct devinfo *di = st->info; | |
1233 | st->info = di->next; | |
1234 | if (di->fd >= 0) | |
1235 | close(di->fd); | |
1236 | free(di); | |
1237 | } | |
1238 | st->sb = NULL; | |
1239 | } | |
1240 | ||
1241 | #ifndef MDASSEMBLE | |
1242 | static int validate_geometry0(struct supertype *st, int level, | |
1243 | int layout, int raiddisks, | |
1244 | int *chunk, unsigned long long size, | |
1245 | unsigned long long data_offset, | |
1246 | char *subdev, unsigned long long *freesize, | |
1247 | int verbose) | |
1248 | { | |
1249 | unsigned long long ldsize; | |
1250 | int fd; | |
1251 | unsigned int tbmax = 4; | |
1252 | ||
1253 | /* prior to linux 3.1, a but limits usable device size to 2TB. | |
1254 | * It was introduced in 2.6.29, but we won't worry about that detail | |
1255 | */ | |
1256 | if (get_linux_version() < 3001000) | |
1257 | tbmax = 2; | |
1258 | ||
1259 | if (level == LEVEL_CONTAINER) { | |
1260 | if (verbose) | |
1261 | pr_err("0.90 metadata does not support containers\n"); | |
1262 | return 0; | |
1263 | } | |
1264 | if (raiddisks > MD_SB_DISKS) { | |
1265 | if (verbose) | |
1266 | pr_err("0.90 metadata supports at most %d devices per array\n", | |
1267 | MD_SB_DISKS); | |
1268 | return 0; | |
1269 | } | |
1270 | if (size >= tbmax * 2ULL*1024*1024*1024) { | |
1271 | if (verbose) | |
1272 | pr_err("0.90 metadata supports at most %d terabytes per device\n", tbmax); | |
1273 | return 0; | |
1274 | } | |
1275 | if (*chunk == UnSet) | |
1276 | *chunk = DEFAULT_CHUNK; | |
1277 | ||
1278 | if (!subdev) | |
1279 | return 1; | |
1280 | ||
1281 | fd = open(subdev, O_RDONLY|O_EXCL, 0); | |
1282 | if (fd < 0) { | |
1283 | if (verbose) | |
1284 | pr_err("super0.90 cannot open %s: %s\n", | |
1285 | subdev, strerror(errno)); | |
1286 | return 0; | |
1287 | } | |
1288 | ||
1289 | if (!get_dev_size(fd, subdev, &ldsize)) { | |
1290 | close(fd); | |
1291 | return 0; | |
1292 | } | |
1293 | close(fd); | |
1294 | ||
1295 | if (ldsize < MD_RESERVED_SECTORS * 512) | |
1296 | return 0; | |
1297 | *freesize = MD_NEW_SIZE_SECTORS(ldsize >> 9); | |
1298 | return 1; | |
1299 | } | |
1300 | #endif /* MDASSEMBLE */ | |
1301 | ||
1302 | struct superswitch super0 = { | |
1303 | #ifndef MDASSEMBLE | |
1304 | .examine_super = examine_super0, | |
1305 | .brief_examine_super = brief_examine_super0, | |
1306 | .export_examine_super = export_examine_super0, | |
1307 | .detail_super = detail_super0, | |
1308 | .brief_detail_super = brief_detail_super0, | |
1309 | .write_init_super = write_init_super0, | |
1310 | .validate_geometry = validate_geometry0, | |
1311 | .add_to_super = add_to_super0, | |
1312 | .copy_metadata = copy_metadata0, | |
1313 | #endif | |
1314 | .match_home = match_home0, | |
1315 | .uuid_from_super = uuid_from_super0, | |
1316 | .getinfo_super = getinfo_super0, | |
1317 | .container_content = container_content0, | |
1318 | .update_super = update_super0, | |
1319 | .init_super = init_super0, | |
1320 | .store_super = store_super0, | |
1321 | .compare_super = compare_super0, | |
1322 | .load_super = load_super0, | |
1323 | .match_metadata_desc = match_metadata_desc0, | |
1324 | .avail_size = avail_size0, | |
1325 | .add_internal_bitmap = add_internal_bitmap0, | |
1326 | .locate_bitmap = locate_bitmap0, | |
1327 | .write_bitmap = write_bitmap0, | |
1328 | .free_super = free_super0, | |
1329 | .name = "0.90", | |
1330 | }; |