]> git.ipfire.org Git - thirdparty/mdadm.git/blob - super-ddf.c
imsm: add 'verify', 'verify with fixup', and 'general' migration types
[thirdparty/mdadm.git] / super-ddf.c
1 /*
2 * mdadm - manage Linux "md" devices aka RAID arrays.
3 *
4 * Copyright (C) 2006-2007 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: <neil@brown.name>
23 *
24 * Specifications for DDF takes from Common RAID DDF Specification Revision 1.2
25 * (July 28 2006). Reused by permission of SNIA.
26 */
27
28 #define HAVE_STDINT_H 1
29 #include "mdadm.h"
30 #include "mdmon.h"
31 #include "sha1.h"
32 #include <values.h>
33
34 /* a non-official T10 name for creation GUIDs */
35 static char T10[] = "Linux-MD";
36
37 /* DDF timestamps are 1980 based, so we need to add
38 * second-in-decade-of-seventies to convert to linux timestamps.
39 * 10 years with 2 leap years.
40 */
41 #define DECADE (3600*24*(365*10+2))
42 unsigned long crc32(
43 unsigned long crc,
44 const unsigned char *buf,
45 unsigned len);
46
47 /* The DDF metadata handling.
48 * DDF metadata lives at the end of the device.
49 * The last 512 byte block provides an 'anchor' which is used to locate
50 * the rest of the metadata which usually lives immediately behind the anchor.
51 *
52 * Note:
53 * - all multibyte numeric fields are bigendian.
54 * - all strings are space padded.
55 *
56 */
57
58 /* Primary Raid Level (PRL) */
59 #define DDF_RAID0 0x00
60 #define DDF_RAID1 0x01
61 #define DDF_RAID3 0x03
62 #define DDF_RAID4 0x04
63 #define DDF_RAID5 0x05
64 #define DDF_RAID1E 0x11
65 #define DDF_JBOD 0x0f
66 #define DDF_CONCAT 0x1f
67 #define DDF_RAID5E 0x15
68 #define DDF_RAID5EE 0x25
69 #define DDF_RAID6 0x06
70
71 /* Raid Level Qualifier (RLQ) */
72 #define DDF_RAID0_SIMPLE 0x00
73 #define DDF_RAID1_SIMPLE 0x00 /* just 2 devices in this plex */
74 #define DDF_RAID1_MULTI 0x01 /* exactly 3 devices in this plex */
75 #define DDF_RAID3_0 0x00 /* parity in first extent */
76 #define DDF_RAID3_N 0x01 /* parity in last extent */
77 #define DDF_RAID4_0 0x00 /* parity in first extent */
78 #define DDF_RAID4_N 0x01 /* parity in last extent */
79 /* these apply to raid5e and raid5ee as well */
80 #define DDF_RAID5_0_RESTART 0x00 /* same as 'right asymmetric' - layout 1 */
81 #define DDF_RAID6_0_RESTART 0x01 /* raid6 different from raid5 here!!! */
82 #define DDF_RAID5_N_RESTART 0x02 /* same as 'left asymmetric' - layout 0 */
83 #define DDF_RAID5_N_CONTINUE 0x03 /* same as 'left symmetric' - layout 2 */
84
85 #define DDF_RAID1E_ADJACENT 0x00 /* raid10 nearcopies==2 */
86 #define DDF_RAID1E_OFFSET 0x01 /* raid10 offsetcopies==2 */
87
88 /* Secondary RAID Level (SRL) */
89 #define DDF_2STRIPED 0x00 /* This is weirder than RAID0 !! */
90 #define DDF_2MIRRORED 0x01
91 #define DDF_2CONCAT 0x02
92 #define DDF_2SPANNED 0x03 /* This is also weird - be careful */
93
94 /* Magic numbers */
95 #define DDF_HEADER_MAGIC __cpu_to_be32(0xDE11DE11)
96 #define DDF_CONTROLLER_MAGIC __cpu_to_be32(0xAD111111)
97 #define DDF_PHYS_RECORDS_MAGIC __cpu_to_be32(0x22222222)
98 #define DDF_PHYS_DATA_MAGIC __cpu_to_be32(0x33333333)
99 #define DDF_VIRT_RECORDS_MAGIC __cpu_to_be32(0xDDDDDDDD)
100 #define DDF_VD_CONF_MAGIC __cpu_to_be32(0xEEEEEEEE)
101 #define DDF_SPARE_ASSIGN_MAGIC __cpu_to_be32(0x55555555)
102 #define DDF_VU_CONF_MAGIC __cpu_to_be32(0x88888888)
103 #define DDF_VENDOR_LOG_MAGIC __cpu_to_be32(0x01dBEEF0)
104 #define DDF_BBM_LOG_MAGIC __cpu_to_be32(0xABADB10C)
105
106 #define DDF_GUID_LEN 24
107 #define DDF_REVISION_0 "01.00.00"
108 #define DDF_REVISION_2 "01.02.00"
109
110 struct ddf_header {
111 __u32 magic; /* DDF_HEADER_MAGIC */
112 __u32 crc;
113 char guid[DDF_GUID_LEN];
114 char revision[8]; /* 01.02.00 */
115 __u32 seq; /* starts at '1' */
116 __u32 timestamp;
117 __u8 openflag;
118 __u8 foreignflag;
119 __u8 enforcegroups;
120 __u8 pad0; /* 0xff */
121 __u8 pad1[12]; /* 12 * 0xff */
122 /* 64 bytes so far */
123 __u8 header_ext[32]; /* reserved: fill with 0xff */
124 __u64 primary_lba;
125 __u64 secondary_lba;
126 __u8 type;
127 __u8 pad2[3]; /* 0xff */
128 __u32 workspace_len; /* sectors for vendor space -
129 * at least 32768(sectors) */
130 __u64 workspace_lba;
131 __u16 max_pd_entries; /* one of 15, 63, 255, 1023, 4095 */
132 __u16 max_vd_entries; /* 2^(4,6,8,10,12)-1 : i.e. as above */
133 __u16 max_partitions; /* i.e. max num of configuration
134 record entries per disk */
135 __u16 config_record_len; /* 1 +ROUNDUP(max_primary_element_entries
136 *12/512) */
137 __u16 max_primary_element_entries; /* 16, 64, 256, 1024, or 4096 */
138 __u8 pad3[54]; /* 0xff */
139 /* 192 bytes so far */
140 __u32 controller_section_offset;
141 __u32 controller_section_length;
142 __u32 phys_section_offset;
143 __u32 phys_section_length;
144 __u32 virt_section_offset;
145 __u32 virt_section_length;
146 __u32 config_section_offset;
147 __u32 config_section_length;
148 __u32 data_section_offset;
149 __u32 data_section_length;
150 __u32 bbm_section_offset;
151 __u32 bbm_section_length;
152 __u32 diag_space_offset;
153 __u32 diag_space_length;
154 __u32 vendor_offset;
155 __u32 vendor_length;
156 /* 256 bytes so far */
157 __u8 pad4[256]; /* 0xff */
158 };
159
160 /* type field */
161 #define DDF_HEADER_ANCHOR 0x00
162 #define DDF_HEADER_PRIMARY 0x01
163 #define DDF_HEADER_SECONDARY 0x02
164
165 /* The content of the 'controller section' - global scope */
166 struct ddf_controller_data {
167 __u32 magic; /* DDF_CONTROLLER_MAGIC */
168 __u32 crc;
169 char guid[DDF_GUID_LEN];
170 struct controller_type {
171 __u16 vendor_id;
172 __u16 device_id;
173 __u16 sub_vendor_id;
174 __u16 sub_device_id;
175 } type;
176 char product_id[16];
177 __u8 pad[8]; /* 0xff */
178 __u8 vendor_data[448];
179 };
180
181 /* The content of phys_section - global scope */
182 struct phys_disk {
183 __u32 magic; /* DDF_PHYS_RECORDS_MAGIC */
184 __u32 crc;
185 __u16 used_pdes;
186 __u16 max_pdes;
187 __u8 pad[52];
188 struct phys_disk_entry {
189 char guid[DDF_GUID_LEN];
190 __u32 refnum;
191 __u16 type;
192 __u16 state;
193 __u64 config_size; /* DDF structures must be after here */
194 char path[18]; /* another horrible structure really */
195 __u8 pad[6];
196 } entries[0];
197 };
198
199 /* phys_disk_entry.type is a bitmap - bigendian remember */
200 #define DDF_Forced_PD_GUID 1
201 #define DDF_Active_in_VD 2
202 #define DDF_Global_Spare 4 /* VD_CONF records are ignored */
203 #define DDF_Spare 8 /* overrides Global_spare */
204 #define DDF_Foreign 16
205 #define DDF_Legacy 32 /* no DDF on this device */
206
207 #define DDF_Interface_mask 0xf00
208 #define DDF_Interface_SCSI 0x100
209 #define DDF_Interface_SAS 0x200
210 #define DDF_Interface_SATA 0x300
211 #define DDF_Interface_FC 0x400
212
213 /* phys_disk_entry.state is a bigendian bitmap */
214 #define DDF_Online 1
215 #define DDF_Failed 2 /* overrides 1,4,8 */
216 #define DDF_Rebuilding 4
217 #define DDF_Transition 8
218 #define DDF_SMART 16
219 #define DDF_ReadErrors 32
220 #define DDF_Missing 64
221
222 /* The content of the virt_section global scope */
223 struct virtual_disk {
224 __u32 magic; /* DDF_VIRT_RECORDS_MAGIC */
225 __u32 crc;
226 __u16 populated_vdes;
227 __u16 max_vdes;
228 __u8 pad[52];
229 struct virtual_entry {
230 char guid[DDF_GUID_LEN];
231 __u16 unit;
232 __u16 pad0; /* 0xffff */
233 __u16 guid_crc;
234 __u16 type;
235 __u8 state;
236 __u8 init_state;
237 __u8 pad1[14];
238 char name[16];
239 } entries[0];
240 };
241
242 /* virtual_entry.type is a bitmap - bigendian */
243 #define DDF_Shared 1
244 #define DDF_Enforce_Groups 2
245 #define DDF_Unicode 4
246 #define DDF_Owner_Valid 8
247
248 /* virtual_entry.state is a bigendian bitmap */
249 #define DDF_state_mask 0x7
250 #define DDF_state_optimal 0x0
251 #define DDF_state_degraded 0x1
252 #define DDF_state_deleted 0x2
253 #define DDF_state_missing 0x3
254 #define DDF_state_failed 0x4
255 #define DDF_state_part_optimal 0x5
256
257 #define DDF_state_morphing 0x8
258 #define DDF_state_inconsistent 0x10
259
260 /* virtual_entry.init_state is a bigendian bitmap */
261 #define DDF_initstate_mask 0x03
262 #define DDF_init_not 0x00
263 #define DDF_init_quick 0x01 /* initialisation is progress.
264 * i.e. 'state_inconsistent' */
265 #define DDF_init_full 0x02
266
267 #define DDF_access_mask 0xc0
268 #define DDF_access_rw 0x00
269 #define DDF_access_ro 0x80
270 #define DDF_access_blocked 0xc0
271
272 /* The content of the config_section - local scope
273 * It has multiple records each config_record_len sectors
274 * They can be vd_config or spare_assign
275 */
276
277 struct vd_config {
278 __u32 magic; /* DDF_VD_CONF_MAGIC */
279 __u32 crc;
280 char guid[DDF_GUID_LEN];
281 __u32 timestamp;
282 __u32 seqnum;
283 __u8 pad0[24];
284 __u16 prim_elmnt_count;
285 __u8 chunk_shift; /* 0 == 512, 1==1024 etc */
286 __u8 prl;
287 __u8 rlq;
288 __u8 sec_elmnt_count;
289 __u8 sec_elmnt_seq;
290 __u8 srl;
291 __u64 blocks; /* blocks per component could be different
292 * on different component devices...(only
293 * for concat I hope) */
294 __u64 array_blocks; /* blocks in array */
295 __u8 pad1[8];
296 __u32 spare_refs[8];
297 __u8 cache_pol[8];
298 __u8 bg_rate;
299 __u8 pad2[3];
300 __u8 pad3[52];
301 __u8 pad4[192];
302 __u8 v0[32]; /* reserved- 0xff */
303 __u8 v1[32]; /* reserved- 0xff */
304 __u8 v2[16]; /* reserved- 0xff */
305 __u8 v3[16]; /* reserved- 0xff */
306 __u8 vendor[32];
307 __u32 phys_refnum[0]; /* refnum of each disk in sequence */
308 /*__u64 lba_offset[0]; LBA offset in each phys. Note extents in a
309 bvd are always the same size */
310 };
311
312 /* vd_config.cache_pol[7] is a bitmap */
313 #define DDF_cache_writeback 1 /* else writethrough */
314 #define DDF_cache_wadaptive 2 /* only applies if writeback */
315 #define DDF_cache_readahead 4
316 #define DDF_cache_radaptive 8 /* only if doing read-ahead */
317 #define DDF_cache_ifnobatt 16 /* even to write cache if battery is poor */
318 #define DDF_cache_wallowed 32 /* enable write caching */
319 #define DDF_cache_rallowed 64 /* enable read caching */
320
321 struct spare_assign {
322 __u32 magic; /* DDF_SPARE_ASSIGN_MAGIC */
323 __u32 crc;
324 __u32 timestamp;
325 __u8 reserved[7];
326 __u8 type;
327 __u16 populated; /* SAEs used */
328 __u16 max; /* max SAEs */
329 __u8 pad[8];
330 struct spare_assign_entry {
331 char guid[DDF_GUID_LEN];
332 __u16 secondary_element;
333 __u8 pad[6];
334 } spare_ents[0];
335 };
336 /* spare_assign.type is a bitmap */
337 #define DDF_spare_dedicated 0x1 /* else global */
338 #define DDF_spare_revertible 0x2 /* else committable */
339 #define DDF_spare_active 0x4 /* else not active */
340 #define DDF_spare_affinity 0x8 /* enclosure affinity */
341
342 /* The data_section contents - local scope */
343 struct disk_data {
344 __u32 magic; /* DDF_PHYS_DATA_MAGIC */
345 __u32 crc;
346 char guid[DDF_GUID_LEN];
347 __u32 refnum; /* crc of some magic drive data ... */
348 __u8 forced_ref; /* set when above was not result of magic */
349 __u8 forced_guid; /* set if guid was forced rather than magic */
350 __u8 vendor[32];
351 __u8 pad[442];
352 };
353
354 /* bbm_section content */
355 struct bad_block_log {
356 __u32 magic;
357 __u32 crc;
358 __u16 entry_count;
359 __u32 spare_count;
360 __u8 pad[10];
361 __u64 first_spare;
362 struct mapped_block {
363 __u64 defective_start;
364 __u32 replacement_start;
365 __u16 remap_count;
366 __u8 pad[2];
367 } entries[0];
368 };
369
370 /* Struct for internally holding ddf structures */
371 /* The DDF structure stored on each device is potentially
372 * quite different, as some data is global and some is local.
373 * The global data is:
374 * - ddf header
375 * - controller_data
376 * - Physical disk records
377 * - Virtual disk records
378 * The local data is:
379 * - Configuration records
380 * - Physical Disk data section
381 * ( and Bad block and vendor which I don't care about yet).
382 *
383 * The local data is parsed into separate lists as it is read
384 * and reconstructed for writing. This means that we only need
385 * to make config changes once and they are automatically
386 * propagated to all devices.
387 * Note that the ddf_super has space of the conf and disk data
388 * for this disk and also for a list of all such data.
389 * The list is only used for the superblock that is being
390 * built in Create or Assemble to describe the whole array.
391 */
392 struct ddf_super {
393 struct ddf_header anchor, primary, secondary;
394 struct ddf_controller_data controller;
395 struct ddf_header *active;
396 struct phys_disk *phys;
397 struct virtual_disk *virt;
398 int pdsize, vdsize;
399 int max_part, mppe, conf_rec_len;
400 int currentdev;
401 int updates_pending;
402 struct vcl {
403 union {
404 char space[512];
405 struct {
406 struct vcl *next;
407 __u64 *lba_offset; /* location in 'conf' of
408 * the lba table */
409 int vcnum; /* index into ->virt */
410 __u64 *block_sizes; /* NULL if all the same */
411 };
412 };
413 struct vd_config conf;
414 } *conflist, *currentconf;
415 struct dl {
416 union {
417 char space[512];
418 struct {
419 struct dl *next;
420 int major, minor;
421 char *devname;
422 int fd;
423 unsigned long long size; /* sectors */
424 int pdnum; /* index in ->phys */
425 struct spare_assign *spare;
426 void *mdupdate; /* hold metadata update */
427
428 /* These fields used by auto-layout */
429 int raiddisk; /* slot to fill in autolayout */
430 __u64 esize;
431 };
432 };
433 struct disk_data disk;
434 struct vcl *vlist[0]; /* max_part in size */
435 } *dlist, *add_list;
436 };
437
438 #ifndef offsetof
439 #define offsetof(t,f) ((size_t)&(((t*)0)->f))
440 #endif
441
442
443 static int calc_crc(void *buf, int len)
444 {
445 /* crcs are always at the same place as in the ddf_header */
446 struct ddf_header *ddf = buf;
447 __u32 oldcrc = ddf->crc;
448 __u32 newcrc;
449 ddf->crc = 0xffffffff;
450
451 newcrc = crc32(0, buf, len);
452 ddf->crc = oldcrc;
453 /* The crc is store (like everything) bigendian, so convert
454 * here for simplicity
455 */
456 return __cpu_to_be32(newcrc);
457 }
458
459 static int load_ddf_header(int fd, unsigned long long lba,
460 unsigned long long size,
461 int type,
462 struct ddf_header *hdr, struct ddf_header *anchor)
463 {
464 /* read a ddf header (primary or secondary) from fd/lba
465 * and check that it is consistent with anchor
466 * Need to check:
467 * magic, crc, guid, rev, and LBA's header_type, and
468 * everything after header_type must be the same
469 */
470 if (lba >= size-1)
471 return 0;
472
473 if (lseek64(fd, lba<<9, 0) < 0)
474 return 0;
475
476 if (read(fd, hdr, 512) != 512)
477 return 0;
478
479 if (hdr->magic != DDF_HEADER_MAGIC)
480 return 0;
481 if (calc_crc(hdr, 512) != hdr->crc)
482 return 0;
483 if (memcmp(anchor->guid, hdr->guid, DDF_GUID_LEN) != 0 ||
484 memcmp(anchor->revision, hdr->revision, 8) != 0 ||
485 anchor->primary_lba != hdr->primary_lba ||
486 anchor->secondary_lba != hdr->secondary_lba ||
487 hdr->type != type ||
488 memcmp(anchor->pad2, hdr->pad2, 512 -
489 offsetof(struct ddf_header, pad2)) != 0)
490 return 0;
491
492 /* Looks good enough to me... */
493 return 1;
494 }
495
496 static void *load_section(int fd, struct ddf_super *super, void *buf,
497 __u32 offset_be, __u32 len_be, int check)
498 {
499 unsigned long long offset = __be32_to_cpu(offset_be);
500 unsigned long long len = __be32_to_cpu(len_be);
501 int dofree = (buf == NULL);
502
503 if (check)
504 if (len != 2 && len != 8 && len != 32
505 && len != 128 && len != 512)
506 return NULL;
507
508 if (len > 1024)
509 return NULL;
510 if (buf) {
511 /* All pre-allocated sections are a single block */
512 if (len != 1)
513 return NULL;
514 } else if (posix_memalign(&buf, 512, len<<9) != 0)
515 buf = NULL;
516
517 if (!buf)
518 return NULL;
519
520 if (super->active->type == 1)
521 offset += __be64_to_cpu(super->active->primary_lba);
522 else
523 offset += __be64_to_cpu(super->active->secondary_lba);
524
525 if (lseek64(fd, offset<<9, 0) != (offset<<9)) {
526 if (dofree)
527 free(buf);
528 return NULL;
529 }
530 if (read(fd, buf, len<<9) != (len<<9)) {
531 if (dofree)
532 free(buf);
533 return NULL;
534 }
535 return buf;
536 }
537
538 static int load_ddf_headers(int fd, struct ddf_super *super, char *devname)
539 {
540 unsigned long long dsize;
541
542 get_dev_size(fd, NULL, &dsize);
543
544 if (lseek64(fd, dsize-512, 0) < 0) {
545 if (devname)
546 fprintf(stderr,
547 Name": Cannot seek to anchor block on %s: %s\n",
548 devname, strerror(errno));
549 return 1;
550 }
551 if (read(fd, &super->anchor, 512) != 512) {
552 if (devname)
553 fprintf(stderr,
554 Name ": Cannot read anchor block on %s: %s\n",
555 devname, strerror(errno));
556 return 1;
557 }
558 if (super->anchor.magic != DDF_HEADER_MAGIC) {
559 if (devname)
560 fprintf(stderr, Name ": no DDF anchor found on %s\n",
561 devname);
562 return 2;
563 }
564 if (calc_crc(&super->anchor, 512) != super->anchor.crc) {
565 if (devname)
566 fprintf(stderr, Name ": bad CRC on anchor on %s\n",
567 devname);
568 return 2;
569 }
570 if (memcmp(super->anchor.revision, DDF_REVISION_0, 8) != 0 &&
571 memcmp(super->anchor.revision, DDF_REVISION_2, 8) != 0) {
572 if (devname)
573 fprintf(stderr, Name ": can only support super revision"
574 " %.8s and earlier, not %.8s on %s\n",
575 DDF_REVISION_2, super->anchor.revision,devname);
576 return 2;
577 }
578 if (load_ddf_header(fd, __be64_to_cpu(super->anchor.primary_lba),
579 dsize >> 9, 1,
580 &super->primary, &super->anchor) == 0) {
581 if (devname)
582 fprintf(stderr,
583 Name ": Failed to load primary DDF header "
584 "on %s\n", devname);
585 return 2;
586 }
587 super->active = &super->primary;
588 if (load_ddf_header(fd, __be64_to_cpu(super->anchor.secondary_lba),
589 dsize >> 9, 2,
590 &super->secondary, &super->anchor)) {
591 if ((__be32_to_cpu(super->primary.seq)
592 < __be32_to_cpu(super->secondary.seq) &&
593 !super->secondary.openflag)
594 || (__be32_to_cpu(super->primary.seq)
595 == __be32_to_cpu(super->secondary.seq) &&
596 super->primary.openflag && !super->secondary.openflag)
597 )
598 super->active = &super->secondary;
599 }
600 return 0;
601 }
602
603 static int load_ddf_global(int fd, struct ddf_super *super, char *devname)
604 {
605 void *ok;
606 ok = load_section(fd, super, &super->controller,
607 super->active->controller_section_offset,
608 super->active->controller_section_length,
609 0);
610 super->phys = load_section(fd, super, NULL,
611 super->active->phys_section_offset,
612 super->active->phys_section_length,
613 1);
614 super->pdsize = __be32_to_cpu(super->active->phys_section_length) * 512;
615
616 super->virt = load_section(fd, super, NULL,
617 super->active->virt_section_offset,
618 super->active->virt_section_length,
619 1);
620 super->vdsize = __be32_to_cpu(super->active->virt_section_length) * 512;
621 if (!ok ||
622 !super->phys ||
623 !super->virt) {
624 free(super->phys);
625 free(super->virt);
626 super->phys = NULL;
627 super->virt = NULL;
628 return 2;
629 }
630 super->conflist = NULL;
631 super->dlist = NULL;
632
633 super->max_part = __be16_to_cpu(super->active->max_partitions);
634 super->mppe = __be16_to_cpu(super->active->max_primary_element_entries);
635 super->conf_rec_len = __be16_to_cpu(super->active->config_record_len);
636 return 0;
637 }
638
639 static int load_ddf_local(int fd, struct ddf_super *super,
640 char *devname, int keep)
641 {
642 struct dl *dl;
643 struct stat stb;
644 char *conf;
645 int i;
646 int vnum;
647 int max_virt_disks = __be16_to_cpu(super->active->max_vd_entries);
648 unsigned long long dsize;
649
650 /* First the local disk info */
651 if (posix_memalign((void**)&dl, 512,
652 sizeof(*dl) +
653 (super->max_part) * sizeof(dl->vlist[0])) != 0) {
654 fprintf(stderr, Name ": %s could not allocate disk info buffer\n",
655 __func__);
656 return 1;
657 }
658
659 load_section(fd, super, &dl->disk,
660 super->active->data_section_offset,
661 super->active->data_section_length,
662 0);
663 dl->devname = devname ? strdup(devname) : NULL;
664
665 fstat(fd, &stb);
666 dl->major = major(stb.st_rdev);
667 dl->minor = minor(stb.st_rdev);
668 dl->next = super->dlist;
669 dl->fd = keep ? fd : -1;
670
671 dl->size = 0;
672 if (get_dev_size(fd, devname, &dsize))
673 dl->size = dsize >> 9;
674 dl->spare = NULL;
675 for (i=0 ; i < super->max_part ; i++)
676 dl->vlist[i] = NULL;
677 super->dlist = dl;
678 dl->pdnum = -1;
679 for (i=0; i < __be16_to_cpu(super->active->max_pd_entries); i++)
680 if (memcmp(super->phys->entries[i].guid,
681 dl->disk.guid, DDF_GUID_LEN) == 0)
682 dl->pdnum = i;
683
684 /* Now the config list. */
685 /* 'conf' is an array of config entries, some of which are
686 * probably invalid. Those which are good need to be copied into
687 * the conflist
688 */
689
690 conf = load_section(fd, super, NULL,
691 super->active->config_section_offset,
692 super->active->config_section_length,
693 0);
694
695 vnum = 0;
696 for (i = 0;
697 i < __be32_to_cpu(super->active->config_section_length);
698 i += super->conf_rec_len) {
699 struct vd_config *vd =
700 (struct vd_config *)((char*)conf + i*512);
701 struct vcl *vcl;
702
703 if (vd->magic == DDF_SPARE_ASSIGN_MAGIC) {
704 if (dl->spare)
705 continue;
706 if (posix_memalign((void**)&dl->spare, 512,
707 super->conf_rec_len*512) != 0) {
708 fprintf(stderr, Name
709 ": %s could not allocate spare info buf\n",
710 __func__);
711 return 1;
712 }
713
714 memcpy(dl->spare, vd, super->conf_rec_len*512);
715 continue;
716 }
717 if (vd->magic != DDF_VD_CONF_MAGIC)
718 continue;
719 for (vcl = super->conflist; vcl; vcl = vcl->next) {
720 if (memcmp(vcl->conf.guid,
721 vd->guid, DDF_GUID_LEN) == 0)
722 break;
723 }
724
725 if (vcl) {
726 dl->vlist[vnum++] = vcl;
727 if (__be32_to_cpu(vd->seqnum) <=
728 __be32_to_cpu(vcl->conf.seqnum))
729 continue;
730 } else {
731 if (posix_memalign((void**)&vcl, 512,
732 (super->conf_rec_len*512 +
733 offsetof(struct vcl, conf))) != 0) {
734 fprintf(stderr, Name
735 ": %s could not allocate vcl buf\n",
736 __func__);
737 return 1;
738 }
739 vcl->next = super->conflist;
740 vcl->block_sizes = NULL; /* FIXME not for CONCAT */
741 super->conflist = vcl;
742 dl->vlist[vnum++] = vcl;
743 }
744 memcpy(&vcl->conf, vd, super->conf_rec_len*512);
745 vcl->lba_offset = (__u64*)
746 &vcl->conf.phys_refnum[super->mppe];
747
748 for (i=0; i < max_virt_disks ; i++)
749 if (memcmp(super->virt->entries[i].guid,
750 vcl->conf.guid, DDF_GUID_LEN)==0)
751 break;
752 if (i < max_virt_disks)
753 vcl->vcnum = i;
754 }
755 free(conf);
756
757 return 0;
758 }
759
760 #ifndef MDASSEMBLE
761 static int load_super_ddf_all(struct supertype *st, int fd,
762 void **sbp, char *devname, int keep_fd);
763 #endif
764 static int load_super_ddf(struct supertype *st, int fd,
765 char *devname)
766 {
767 unsigned long long dsize;
768 struct ddf_super *super;
769 int rv;
770
771 #ifndef MDASSEMBLE
772 /* if 'fd' is a container, load metadata from all the devices */
773 if (load_super_ddf_all(st, fd, &st->sb, devname, 1) == 0)
774 return 0;
775 #endif
776 if (st->subarray[0])
777 return 1; /* FIXME Is this correct */
778
779 if (get_dev_size(fd, devname, &dsize) == 0)
780 return 1;
781
782 /* 32M is a lower bound */
783 if (dsize <= 32*1024*1024) {
784 if (devname) {
785 fprintf(stderr,
786 Name ": %s is too small for ddf: "
787 "size is %llu sectors.\n",
788 devname, dsize>>9);
789 return 1;
790 }
791 }
792 if (dsize & 511) {
793 if (devname) {
794 fprintf(stderr,
795 Name ": %s is an odd size for ddf: "
796 "size is %llu bytes.\n",
797 devname, dsize);
798 return 1;
799 }
800 }
801
802 if (posix_memalign((void**)&super, 512, sizeof(*super))!= 0) {
803 fprintf(stderr, Name ": malloc of %zu failed.\n",
804 sizeof(*super));
805 return 1;
806 }
807 memset(super, 0, sizeof(*super));
808
809 rv = load_ddf_headers(fd, super, devname);
810 if (rv) {
811 free(super);
812 return rv;
813 }
814
815 /* Have valid headers and have chosen the best. Let's read in the rest*/
816
817 rv = load_ddf_global(fd, super, devname);
818
819 if (rv) {
820 if (devname)
821 fprintf(stderr,
822 Name ": Failed to load all information "
823 "sections on %s\n", devname);
824 free(super);
825 return rv;
826 }
827
828 rv = load_ddf_local(fd, super, devname, 0);
829
830 if (rv) {
831 if (devname)
832 fprintf(stderr,
833 Name ": Failed to load all information "
834 "sections on %s\n", devname);
835 free(super);
836 return rv;
837 }
838
839 /* Should possibly check the sections .... */
840
841 st->sb = super;
842 if (st->ss == NULL) {
843 st->ss = &super_ddf;
844 st->minor_version = 0;
845 st->max_devs = 512;
846 }
847 st->loaded_container = 0;
848 return 0;
849
850 }
851
852 static void free_super_ddf(struct supertype *st)
853 {
854 struct ddf_super *ddf = st->sb;
855 if (ddf == NULL)
856 return;
857 free(ddf->phys);
858 free(ddf->virt);
859 while (ddf->conflist) {
860 struct vcl *v = ddf->conflist;
861 ddf->conflist = v->next;
862 if (v->block_sizes)
863 free(v->block_sizes);
864 free(v);
865 }
866 while (ddf->dlist) {
867 struct dl *d = ddf->dlist;
868 ddf->dlist = d->next;
869 if (d->fd >= 0)
870 close(d->fd);
871 if (d->spare)
872 free(d->spare);
873 free(d);
874 }
875 free(ddf);
876 st->sb = NULL;
877 }
878
879 static struct supertype *match_metadata_desc_ddf(char *arg)
880 {
881 /* 'ddf' only support containers */
882 struct supertype *st;
883 if (strcmp(arg, "ddf") != 0 &&
884 strcmp(arg, "default") != 0
885 )
886 return NULL;
887
888 st = malloc(sizeof(*st));
889 memset(st, 0, sizeof(*st));
890 st->ss = &super_ddf;
891 st->max_devs = 512;
892 st->minor_version = 0;
893 st->sb = NULL;
894 return st;
895 }
896
897
898 #ifndef MDASSEMBLE
899
900 static mapping_t ddf_state[] = {
901 { "Optimal", 0},
902 { "Degraded", 1},
903 { "Deleted", 2},
904 { "Missing", 3},
905 { "Failed", 4},
906 { "Partially Optimal", 5},
907 { "-reserved-", 6},
908 { "-reserved-", 7},
909 { NULL, 0}
910 };
911
912 static mapping_t ddf_init_state[] = {
913 { "Not Initialised", 0},
914 { "QuickInit in Progress", 1},
915 { "Fully Initialised", 2},
916 { "*UNKNOWN*", 3},
917 { NULL, 0}
918 };
919 static mapping_t ddf_access[] = {
920 { "Read/Write", 0},
921 { "Reserved", 1},
922 { "Read Only", 2},
923 { "Blocked (no access)", 3},
924 { NULL ,0}
925 };
926
927 static mapping_t ddf_level[] = {
928 { "RAID0", DDF_RAID0},
929 { "RAID1", DDF_RAID1},
930 { "RAID3", DDF_RAID3},
931 { "RAID4", DDF_RAID4},
932 { "RAID5", DDF_RAID5},
933 { "RAID1E",DDF_RAID1E},
934 { "JBOD", DDF_JBOD},
935 { "CONCAT",DDF_CONCAT},
936 { "RAID5E",DDF_RAID5E},
937 { "RAID5EE",DDF_RAID5EE},
938 { "RAID6", DDF_RAID6},
939 { NULL, 0}
940 };
941 static mapping_t ddf_sec_level[] = {
942 { "Striped", DDF_2STRIPED},
943 { "Mirrored", DDF_2MIRRORED},
944 { "Concat", DDF_2CONCAT},
945 { "Spanned", DDF_2SPANNED},
946 { NULL, 0}
947 };
948 #endif
949
950 struct num_mapping {
951 int num1, num2;
952 };
953 static struct num_mapping ddf_level_num[] = {
954 { DDF_RAID0, 0 },
955 { DDF_RAID1, 1 },
956 { DDF_RAID3, LEVEL_UNSUPPORTED },
957 { DDF_RAID4, 4 },
958 { DDF_RAID5, 5 },
959 { DDF_RAID1E, LEVEL_UNSUPPORTED },
960 { DDF_JBOD, LEVEL_UNSUPPORTED },
961 { DDF_CONCAT, LEVEL_LINEAR },
962 { DDF_RAID5E, LEVEL_UNSUPPORTED },
963 { DDF_RAID5EE, LEVEL_UNSUPPORTED },
964 { DDF_RAID6, 6},
965 { MAXINT, MAXINT }
966 };
967
968 static int map_num1(struct num_mapping *map, int num)
969 {
970 int i;
971 for (i=0 ; map[i].num1 != MAXINT; i++)
972 if (map[i].num1 == num)
973 break;
974 return map[i].num2;
975 }
976
977 static int all_ff(char *guid)
978 {
979 int i;
980 for (i = 0; i < DDF_GUID_LEN; i++)
981 if (guid[i] != (char)0xff)
982 return 0;
983 return 1;
984 }
985
986 #ifndef MDASSEMBLE
987 static void print_guid(char *guid, int tstamp)
988 {
989 /* A GUIDs are part (or all) ASCII and part binary.
990 * They tend to be space padded.
991 * We print the GUID in HEX, then in parentheses add
992 * any initial ASCII sequence, and a possible
993 * time stamp from bytes 16-19
994 */
995 int l = DDF_GUID_LEN;
996 int i;
997
998 for (i=0 ; i<DDF_GUID_LEN ; i++) {
999 if ((i&3)==0 && i != 0) printf(":");
1000 printf("%02X", guid[i]&255);
1001 }
1002
1003 printf("\n (");
1004 while (l && guid[l-1] == ' ')
1005 l--;
1006 for (i=0 ; i<l ; i++) {
1007 if (guid[i] >= 0x20 && guid[i] < 0x7f)
1008 fputc(guid[i], stdout);
1009 else
1010 break;
1011 }
1012 if (tstamp) {
1013 time_t then = __be32_to_cpu(*(__u32*)(guid+16)) + DECADE;
1014 char tbuf[100];
1015 struct tm *tm;
1016 tm = localtime(&then);
1017 strftime(tbuf, 100, " %D %T",tm);
1018 fputs(tbuf, stdout);
1019 }
1020 printf(")");
1021 }
1022
1023 static void examine_vd(int n, struct ddf_super *sb, char *guid)
1024 {
1025 int crl = sb->conf_rec_len;
1026 struct vcl *vcl;
1027
1028 for (vcl = sb->conflist ; vcl ; vcl = vcl->next) {
1029 int i;
1030 struct vd_config *vc = &vcl->conf;
1031
1032 if (calc_crc(vc, crl*512) != vc->crc)
1033 continue;
1034 if (memcmp(vc->guid, guid, DDF_GUID_LEN) != 0)
1035 continue;
1036
1037 /* Ok, we know about this VD, let's give more details */
1038 printf(" Raid Devices[%d] : %d (", n,
1039 __be16_to_cpu(vc->prim_elmnt_count));
1040 for (i=0; i<__be16_to_cpu(vc->prim_elmnt_count); i++) {
1041 int j;
1042 int cnt = __be16_to_cpu(sb->phys->used_pdes);
1043 for (j=0; j<cnt; j++)
1044 if (vc->phys_refnum[i] == sb->phys->entries[j].refnum)
1045 break;
1046 if (i) printf(" ");
1047 if (j < cnt)
1048 printf("%d", j);
1049 else
1050 printf("--");
1051 }
1052 printf(")\n");
1053 if (vc->chunk_shift != 255)
1054 printf(" Chunk Size[%d] : %d sectors\n", n,
1055 1 << vc->chunk_shift);
1056 printf(" Raid Level[%d] : %s\n", n,
1057 map_num(ddf_level, vc->prl)?:"-unknown-");
1058 if (vc->sec_elmnt_count != 1) {
1059 printf(" Secondary Position[%d] : %d of %d\n", n,
1060 vc->sec_elmnt_seq, vc->sec_elmnt_count);
1061 printf(" Secondary Level[%d] : %s\n", n,
1062 map_num(ddf_sec_level, vc->srl) ?: "-unknown-");
1063 }
1064 printf(" Device Size[%d] : %llu\n", n,
1065 __be64_to_cpu(vc->blocks)/2);
1066 printf(" Array Size[%d] : %llu\n", n,
1067 __be64_to_cpu(vc->array_blocks)/2);
1068 }
1069 }
1070
1071 static void examine_vds(struct ddf_super *sb)
1072 {
1073 int cnt = __be16_to_cpu(sb->virt->populated_vdes);
1074 int i;
1075 printf(" Virtual Disks : %d\n", cnt);
1076
1077 for (i=0; i<cnt; i++) {
1078 struct virtual_entry *ve = &sb->virt->entries[i];
1079 printf("\n");
1080 printf(" VD GUID[%d] : ", i); print_guid(ve->guid, 1);
1081 printf("\n");
1082 printf(" unit[%d] : %d\n", i, __be16_to_cpu(ve->unit));
1083 printf(" state[%d] : %s, %s%s\n", i,
1084 map_num(ddf_state, ve->state & 7),
1085 (ve->state & 8) ? "Morphing, ": "",
1086 (ve->state & 16)? "Not Consistent" : "Consistent");
1087 printf(" init state[%d] : %s\n", i,
1088 map_num(ddf_init_state, ve->init_state&3));
1089 printf(" access[%d] : %s\n", i,
1090 map_num(ddf_access, (ve->init_state>>6) & 3));
1091 printf(" Name[%d] : %.16s\n", i, ve->name);
1092 examine_vd(i, sb, ve->guid);
1093 }
1094 if (cnt) printf("\n");
1095 }
1096
1097 static void examine_pds(struct ddf_super *sb)
1098 {
1099 int cnt = __be16_to_cpu(sb->phys->used_pdes);
1100 int i;
1101 struct dl *dl;
1102 printf(" Physical Disks : %d\n", cnt);
1103 printf(" Number RefNo Size Device Type/State\n");
1104
1105 for (i=0 ; i<cnt ; i++) {
1106 struct phys_disk_entry *pd = &sb->phys->entries[i];
1107 int type = __be16_to_cpu(pd->type);
1108 int state = __be16_to_cpu(pd->state);
1109
1110 //printf(" PD GUID[%d] : ", i); print_guid(pd->guid, 0);
1111 //printf("\n");
1112 printf(" %3d %08x ", i,
1113 __be32_to_cpu(pd->refnum));
1114 printf("%lluK ", __be64_to_cpu(pd->config_size)>>1);
1115 for (dl = sb->dlist; dl ; dl = dl->next) {
1116 if (dl->disk.refnum == pd->refnum) {
1117 char *dv = map_dev(dl->major, dl->minor, 0);
1118 if (dv) {
1119 printf("%-10s", dv);
1120 break;
1121 }
1122 }
1123 }
1124 if (!dl)
1125 printf("%10s","");
1126 printf(" %s%s%s%s%s",
1127 (type&2) ? "active":"",
1128 (type&4) ? "Global-Spare":"",
1129 (type&8) ? "spare" : "",
1130 (type&16)? ", foreign" : "",
1131 (type&32)? "pass-through" : "");
1132 printf("/%s%s%s%s%s%s%s",
1133 (state&1)? "Online": "Offline",
1134 (state&2)? ", Failed": "",
1135 (state&4)? ", Rebuilding": "",
1136 (state&8)? ", in-transition": "",
1137 (state&16)? ", SMART-errors": "",
1138 (state&32)? ", Unrecovered-Read-Errors": "",
1139 (state&64)? ", Missing" : "");
1140 printf("\n");
1141 }
1142 }
1143
1144 static void examine_super_ddf(struct supertype *st, char *homehost)
1145 {
1146 struct ddf_super *sb = st->sb;
1147
1148 printf(" Magic : %08x\n", __be32_to_cpu(sb->anchor.magic));
1149 printf(" Version : %.8s\n", sb->anchor.revision);
1150 printf("Controller GUID : "); print_guid(sb->controller.guid, 0);
1151 printf("\n");
1152 printf(" Container GUID : "); print_guid(sb->anchor.guid, 1);
1153 printf("\n");
1154 printf(" Seq : %08x\n", __be32_to_cpu(sb->active->seq));
1155 printf(" Redundant hdr : %s\n", sb->secondary.magic == DDF_HEADER_MAGIC
1156 ?"yes" : "no");
1157 examine_vds(sb);
1158 examine_pds(sb);
1159 }
1160
1161 static void getinfo_super_ddf(struct supertype *st, struct mdinfo *info);
1162
1163 static void uuid_from_super_ddf(struct supertype *st, int uuid[4]);
1164
1165 static void brief_examine_super_ddf(struct supertype *st)
1166 {
1167 /* We just write a generic DDF ARRAY entry
1168 */
1169 struct ddf_super *ddf = st->sb;
1170 struct mdinfo info;
1171 int i;
1172 char nbuf[64];
1173 getinfo_super_ddf(st, &info);
1174 fname_from_uuid(st, &info, nbuf, ':');
1175 printf("ARRAY metadata=ddf UUID=%s\n", nbuf + 5);
1176
1177 for (i=0; i<__be16_to_cpu(ddf->virt->max_vdes); i++) {
1178 struct virtual_entry *ve = &ddf->virt->entries[i];
1179 struct vcl vcl;
1180 char nbuf1[64];
1181 if (all_ff(ve->guid))
1182 continue;
1183 memcpy(vcl.conf.guid, ve->guid, DDF_GUID_LEN);
1184 ddf->currentconf =&vcl;
1185 uuid_from_super_ddf(st, info.uuid);
1186 fname_from_uuid(st, &info, nbuf1, ':');
1187 printf("ARRAY container=%s member=%d UUID=%s\n",
1188 nbuf+5, i, nbuf1+5);
1189 }
1190 }
1191
1192 static void export_examine_super_ddf(struct supertype *st)
1193 {
1194 struct mdinfo info;
1195 char nbuf[64];
1196 getinfo_super_ddf(st, &info);
1197 fname_from_uuid(st, &info, nbuf, ':');
1198 printf("MD_METADATA=ddf\n");
1199 printf("MD_LEVEL=container\n");
1200 printf("MD_UUID=%s\n", nbuf+5);
1201 }
1202
1203
1204 static void detail_super_ddf(struct supertype *st, char *homehost)
1205 {
1206 /* FIXME later
1207 * Could print DDF GUID
1208 * Need to find which array
1209 * If whole, briefly list all arrays
1210 * If one, give name
1211 */
1212 }
1213
1214 static void brief_detail_super_ddf(struct supertype *st)
1215 {
1216 /* FIXME I really need to know which array we are detailing.
1217 * Can that be stored in ddf_super??
1218 */
1219 // struct ddf_super *ddf = st->sb;
1220 struct mdinfo info;
1221 char nbuf[64];
1222 getinfo_super_ddf(st, &info);
1223 fname_from_uuid(st, &info, nbuf,':');
1224 printf(" UUID=%s", nbuf + 5);
1225 }
1226 #endif
1227
1228 static int match_home_ddf(struct supertype *st, char *homehost)
1229 {
1230 /* It matches 'this' host if the controller is a
1231 * Linux-MD controller with vendor_data matching
1232 * the hostname
1233 */
1234 struct ddf_super *ddf = st->sb;
1235 int len = strlen(homehost);
1236
1237 return (memcmp(ddf->controller.guid, T10, 8) == 0 &&
1238 len < sizeof(ddf->controller.vendor_data) &&
1239 memcmp(ddf->controller.vendor_data, homehost,len) == 0 &&
1240 ddf->controller.vendor_data[len] == 0);
1241 }
1242
1243 #ifndef MDASSEMBLE
1244 static struct vd_config *find_vdcr(struct ddf_super *ddf, int inst)
1245 {
1246 struct vcl *v;
1247
1248 for (v = ddf->conflist; v; v = v->next)
1249 if (inst == v->vcnum)
1250 return &v->conf;
1251 return NULL;
1252 }
1253 #endif
1254
1255 static int find_phys(struct ddf_super *ddf, __u32 phys_refnum)
1256 {
1257 /* Find the entry in phys_disk which has the given refnum
1258 * and return it's index
1259 */
1260 int i;
1261 for (i=0; i < __be16_to_cpu(ddf->phys->max_pdes); i++)
1262 if (ddf->phys->entries[i].refnum == phys_refnum)
1263 return i;
1264 return -1;
1265 }
1266
1267 static void uuid_from_super_ddf(struct supertype *st, int uuid[4])
1268 {
1269 /* The uuid returned here is used for:
1270 * uuid to put into bitmap file (Create, Grow)
1271 * uuid for backup header when saving critical section (Grow)
1272 * comparing uuids when re-adding a device into an array
1273 * In these cases the uuid required is that of the data-array,
1274 * not the device-set.
1275 * uuid to recognise same set when adding a missing device back
1276 * to an array. This is a uuid for the device-set.
1277 *
1278 * For each of these we can make do with a truncated
1279 * or hashed uuid rather than the original, as long as
1280 * everyone agrees.
1281 * In the case of SVD we assume the BVD is of interest,
1282 * though that might be the case if a bitmap were made for
1283 * a mirrored SVD - worry about that later.
1284 * So we need to find the VD configuration record for the
1285 * relevant BVD and extract the GUID and Secondary_Element_Seq.
1286 * The first 16 bytes of the sha1 of these is used.
1287 */
1288 struct ddf_super *ddf = st->sb;
1289 struct vcl *vcl = ddf->currentconf;
1290 char *guid;
1291 char buf[20];
1292 struct sha1_ctx ctx;
1293
1294 if (vcl)
1295 guid = vcl->conf.guid;
1296 else
1297 guid = ddf->anchor.guid;
1298
1299 sha1_init_ctx(&ctx);
1300 sha1_process_bytes(guid, DDF_GUID_LEN, &ctx);
1301 sha1_finish_ctx(&ctx, buf);
1302 memcpy(uuid, buf, 4*4);
1303 }
1304
1305 static void getinfo_super_ddf_bvd(struct supertype *st, struct mdinfo *info);
1306
1307 static void getinfo_super_ddf(struct supertype *st, struct mdinfo *info)
1308 {
1309 struct ddf_super *ddf = st->sb;
1310
1311 if (ddf->currentconf) {
1312 getinfo_super_ddf_bvd(st, info);
1313 return;
1314 }
1315
1316 info->array.raid_disks = __be16_to_cpu(ddf->phys->used_pdes);
1317 info->array.level = LEVEL_CONTAINER;
1318 info->array.layout = 0;
1319 info->array.md_minor = -1;
1320 info->array.ctime = DECADE + __be32_to_cpu(*(__u32*)
1321 (ddf->anchor.guid+16));
1322 info->array.utime = 0;
1323 info->array.chunk_size = 0;
1324
1325
1326 info->disk.major = 0;
1327 info->disk.minor = 0;
1328 if (ddf->dlist) {
1329 info->disk.number = __be32_to_cpu(ddf->dlist->disk.refnum);
1330 info->disk.raid_disk = find_phys(ddf, ddf->dlist->disk.refnum);
1331
1332 info->data_offset = __be64_to_cpu(ddf->phys->
1333 entries[info->disk.raid_disk].
1334 config_size);
1335 info->component_size = ddf->dlist->size - info->data_offset;
1336 } else {
1337 info->disk.number = -1;
1338 info->disk.raid_disk = -1;
1339 // info->disk.raid_disk = find refnum in the table and use index;
1340 }
1341 info->disk.state = (1 << MD_DISK_SYNC);
1342
1343
1344 info->reshape_active = 0;
1345 info->name[0] = 0;
1346
1347 info->array.major_version = -1;
1348 info->array.minor_version = -2;
1349 strcpy(info->text_version, "ddf");
1350 info->safe_mode_delay = 0;
1351
1352 uuid_from_super_ddf(st, info->uuid);
1353
1354 }
1355
1356 static int rlq_to_layout(int rlq, int prl, int raiddisks);
1357
1358 static void getinfo_super_ddf_bvd(struct supertype *st, struct mdinfo *info)
1359 {
1360 struct ddf_super *ddf = st->sb;
1361 struct vcl *vc = ddf->currentconf;
1362 int cd = ddf->currentdev;
1363 int j;
1364 struct dl *dl;
1365
1366 /* FIXME this returns BVD info - what if we want SVD ?? */
1367
1368 info->array.raid_disks = __be16_to_cpu(vc->conf.prim_elmnt_count);
1369 info->array.level = map_num1(ddf_level_num, vc->conf.prl);
1370 info->array.layout = rlq_to_layout(vc->conf.rlq, vc->conf.prl,
1371 info->array.raid_disks);
1372 info->array.md_minor = -1;
1373 info->array.ctime = DECADE +
1374 __be32_to_cpu(*(__u32*)(vc->conf.guid+16));
1375 info->array.utime = DECADE + __be32_to_cpu(vc->conf.timestamp);
1376 info->array.chunk_size = 512 << vc->conf.chunk_shift;
1377
1378 if (cd >= 0 && cd < ddf->mppe) {
1379 info->data_offset = __be64_to_cpu(vc->lba_offset[cd]);
1380 if (vc->block_sizes)
1381 info->component_size = vc->block_sizes[cd];
1382 else
1383 info->component_size = __be64_to_cpu(vc->conf.blocks);
1384 }
1385
1386 for (dl = ddf->dlist; dl ; dl = dl->next)
1387 if (dl->raiddisk == info->disk.raid_disk)
1388 break;
1389 info->disk.major = 0;
1390 info->disk.minor = 0;
1391 if (dl) {
1392 info->disk.major = dl->major;
1393 info->disk.minor = dl->minor;
1394 }
1395 // info->disk.number = __be32_to_cpu(ddf->disk.refnum);
1396 // info->disk.raid_disk = find refnum in the table and use index;
1397 // info->disk.state = ???;
1398
1399 info->container_member = ddf->currentconf->vcnum;
1400
1401 info->resync_start = 0;
1402 if (!(ddf->virt->entries[info->container_member].state
1403 & DDF_state_inconsistent) &&
1404 (ddf->virt->entries[info->container_member].init_state
1405 & DDF_initstate_mask)
1406 == DDF_init_full)
1407 info->resync_start = ~0ULL;
1408
1409 uuid_from_super_ddf(st, info->uuid);
1410
1411 info->container_member = atoi(st->subarray);
1412 info->array.major_version = -1;
1413 info->array.minor_version = -2;
1414 sprintf(info->text_version, "/%s/%s",
1415 devnum2devname(st->container_dev),
1416 st->subarray);
1417 info->safe_mode_delay = 200;
1418
1419 memcpy(info->name, ddf->virt->entries[info->container_member].name, 16);
1420 info->name[16]=0;
1421 for(j=0; j<16; j++)
1422 if (info->name[j] == ' ')
1423 info->name[j] = 0;
1424 }
1425
1426
1427 static int update_super_ddf(struct supertype *st, struct mdinfo *info,
1428 char *update,
1429 char *devname, int verbose,
1430 int uuid_set, char *homehost)
1431 {
1432 /* For 'assemble' and 'force' we need to return non-zero if any
1433 * change was made. For others, the return value is ignored.
1434 * Update options are:
1435 * force-one : This device looks a bit old but needs to be included,
1436 * update age info appropriately.
1437 * assemble: clear any 'faulty' flag to allow this device to
1438 * be assembled.
1439 * force-array: Array is degraded but being forced, mark it clean
1440 * if that will be needed to assemble it.
1441 *
1442 * newdev: not used ????
1443 * grow: Array has gained a new device - this is currently for
1444 * linear only
1445 * resync: mark as dirty so a resync will happen.
1446 * uuid: Change the uuid of the array to match what is given
1447 * homehost: update the recorded homehost
1448 * name: update the name - preserving the homehost
1449 * _reshape_progress: record new reshape_progress position.
1450 *
1451 * Following are not relevant for this version:
1452 * sparc2.2 : update from old dodgey metadata
1453 * super-minor: change the preferred_minor number
1454 * summaries: update redundant counters.
1455 */
1456 int rv = 0;
1457 // struct ddf_super *ddf = st->sb;
1458 // struct vd_config *vd = find_vdcr(ddf, info->container_member);
1459 // struct virtual_entry *ve = find_ve(ddf);
1460
1461 /* we don't need to handle "force-*" or "assemble" as
1462 * there is no need to 'trick' the kernel. We the metadata is
1463 * first updated to activate the array, all the implied modifications
1464 * will just happen.
1465 */
1466
1467 if (strcmp(update, "grow") == 0) {
1468 /* FIXME */
1469 }
1470 if (strcmp(update, "resync") == 0) {
1471 // info->resync_checkpoint = 0;
1472 }
1473 /* We ignore UUID updates as they make even less sense
1474 * with DDF
1475 */
1476 if (strcmp(update, "homehost") == 0) {
1477 /* homehost is stored in controller->vendor_data,
1478 * or it is when we are the vendor
1479 */
1480 // if (info->vendor_is_local)
1481 // strcpy(ddf->controller.vendor_data, homehost);
1482 }
1483 if (strcmp(update, "name") == 0) {
1484 /* name is stored in virtual_entry->name */
1485 // memset(ve->name, ' ', 16);
1486 // strncpy(ve->name, info->name, 16);
1487 }
1488 if (strcmp(update, "_reshape_progress") == 0) {
1489 /* We don't support reshape yet */
1490 }
1491
1492 // update_all_csum(ddf);
1493
1494 return rv;
1495 }
1496
1497 __u32 random32(void)
1498 {
1499 __u32 rv;
1500 int rfd = open("/dev/urandom", O_RDONLY);
1501 if (rfd < 0 || read(rfd, &rv, 4) != 4)
1502 rv = random();
1503 if (rfd >= 0)
1504 close(rfd);
1505 return rv;
1506 }
1507
1508 static void make_header_guid(char *guid)
1509 {
1510 __u32 stamp;
1511 /* Create a DDF Header of Virtual Disk GUID */
1512
1513 /* 24 bytes of fiction required.
1514 * first 8 are a 'vendor-id' - "Linux-MD"
1515 * next 8 are controller type.. how about 0X DEAD BEEF 0000 0000
1516 * Remaining 8 random number plus timestamp
1517 */
1518 memcpy(guid, T10, sizeof(T10));
1519 stamp = __cpu_to_be32(0xdeadbeef);
1520 memcpy(guid+8, &stamp, 4);
1521 stamp = __cpu_to_be32(0);
1522 memcpy(guid+12, &stamp, 4);
1523 stamp = __cpu_to_be32(time(0) - DECADE);
1524 memcpy(guid+16, &stamp, 4);
1525 stamp = random32();
1526 memcpy(guid+20, &stamp, 4);
1527 }
1528
1529 static int init_super_ddf_bvd(struct supertype *st,
1530 mdu_array_info_t *info,
1531 unsigned long long size,
1532 char *name, char *homehost,
1533 int *uuid);
1534
1535 static int init_super_ddf(struct supertype *st,
1536 mdu_array_info_t *info,
1537 unsigned long long size, char *name, char *homehost,
1538 int *uuid)
1539 {
1540 /* This is primarily called by Create when creating a new array.
1541 * We will then get add_to_super called for each component, and then
1542 * write_init_super called to write it out to each device.
1543 * For DDF, Create can create on fresh devices or on a pre-existing
1544 * array.
1545 * To create on a pre-existing array a different method will be called.
1546 * This one is just for fresh drives.
1547 *
1548 * We need to create the entire 'ddf' structure which includes:
1549 * DDF headers - these are easy.
1550 * Controller data - a Sector describing this controller .. not that
1551 * this is a controller exactly.
1552 * Physical Disk Record - one entry per device, so
1553 * leave plenty of space.
1554 * Virtual Disk Records - again, just leave plenty of space.
1555 * This just lists VDs, doesn't give details
1556 * Config records - describes the VDs that use this disk
1557 * DiskData - describes 'this' device.
1558 * BadBlockManagement - empty
1559 * Diag Space - empty
1560 * Vendor Logs - Could we put bitmaps here?
1561 *
1562 */
1563 struct ddf_super *ddf;
1564 char hostname[17];
1565 int hostlen;
1566 int max_phys_disks, max_virt_disks;
1567 unsigned long long sector;
1568 int clen;
1569 int i;
1570 int pdsize, vdsize;
1571 struct phys_disk *pd;
1572 struct virtual_disk *vd;
1573
1574 if (!info) {
1575 st->sb = NULL;
1576 return 0;
1577 }
1578 if (st->sb)
1579 return init_super_ddf_bvd(st, info, size, name, homehost,
1580 uuid);
1581
1582 if (posix_memalign((void**)&ddf, 512, sizeof(*ddf)) != 0) {
1583 fprintf(stderr, Name ": %s could not allocate superblock\n", __func__);
1584 return 0;
1585 }
1586 memset(ddf, 0, sizeof(*ddf));
1587 ddf->dlist = NULL; /* no physical disks yet */
1588 ddf->conflist = NULL; /* No virtual disks yet */
1589
1590 /* At least 32MB *must* be reserved for the ddf. So let's just
1591 * start 32MB from the end, and put the primary header there.
1592 * Don't do secondary for now.
1593 * We don't know exactly where that will be yet as it could be
1594 * different on each device. To just set up the lengths.
1595 *
1596 */
1597
1598 ddf->anchor.magic = DDF_HEADER_MAGIC;
1599 make_header_guid(ddf->anchor.guid);
1600
1601 memcpy(ddf->anchor.revision, DDF_REVISION_2, 8);
1602 ddf->anchor.seq = __cpu_to_be32(1);
1603 ddf->anchor.timestamp = __cpu_to_be32(time(0) - DECADE);
1604 ddf->anchor.openflag = 0xFF;
1605 ddf->anchor.foreignflag = 0;
1606 ddf->anchor.enforcegroups = 0; /* Is this best?? */
1607 ddf->anchor.pad0 = 0xff;
1608 memset(ddf->anchor.pad1, 0xff, 12);
1609 memset(ddf->anchor.header_ext, 0xff, 32);
1610 ddf->anchor.primary_lba = ~(__u64)0;
1611 ddf->anchor.secondary_lba = ~(__u64)0;
1612 ddf->anchor.type = DDF_HEADER_ANCHOR;
1613 memset(ddf->anchor.pad2, 0xff, 3);
1614 ddf->anchor.workspace_len = __cpu_to_be32(32768); /* Must be reserved */
1615 ddf->anchor.workspace_lba = ~(__u64)0; /* Put this at bottom
1616 of 32M reserved.. */
1617 max_phys_disks = 1023; /* Should be enough */
1618 ddf->anchor.max_pd_entries = __cpu_to_be16(max_phys_disks);
1619 max_virt_disks = 255;
1620 ddf->anchor.max_vd_entries = __cpu_to_be16(max_virt_disks); /* ?? */
1621 ddf->anchor.max_partitions = __cpu_to_be16(64); /* ?? */
1622 ddf->max_part = 64;
1623 ddf->mppe = 256;
1624 ddf->conf_rec_len = 1 + ROUND_UP(ddf->mppe * (4+8), 512)/512;
1625 ddf->anchor.config_record_len = __cpu_to_be16(ddf->conf_rec_len);
1626 ddf->anchor.max_primary_element_entries = __cpu_to_be16(ddf->mppe);
1627 memset(ddf->anchor.pad3, 0xff, 54);
1628 /* controller sections is one sector long immediately
1629 * after the ddf header */
1630 sector = 1;
1631 ddf->anchor.controller_section_offset = __cpu_to_be32(sector);
1632 ddf->anchor.controller_section_length = __cpu_to_be32(1);
1633 sector += 1;
1634
1635 /* phys is 8 sectors after that */
1636 pdsize = ROUND_UP(sizeof(struct phys_disk) +
1637 sizeof(struct phys_disk_entry)*max_phys_disks,
1638 512);
1639 switch(pdsize/512) {
1640 case 2: case 8: case 32: case 128: case 512: break;
1641 default: abort();
1642 }
1643 ddf->anchor.phys_section_offset = __cpu_to_be32(sector);
1644 ddf->anchor.phys_section_length =
1645 __cpu_to_be32(pdsize/512); /* max_primary_element_entries/8 */
1646 sector += pdsize/512;
1647
1648 /* virt is another 32 sectors */
1649 vdsize = ROUND_UP(sizeof(struct virtual_disk) +
1650 sizeof(struct virtual_entry) * max_virt_disks,
1651 512);
1652 switch(vdsize/512) {
1653 case 2: case 8: case 32: case 128: case 512: break;
1654 default: abort();
1655 }
1656 ddf->anchor.virt_section_offset = __cpu_to_be32(sector);
1657 ddf->anchor.virt_section_length =
1658 __cpu_to_be32(vdsize/512); /* max_vd_entries/8 */
1659 sector += vdsize/512;
1660
1661 clen = ddf->conf_rec_len * (ddf->max_part+1);
1662 ddf->anchor.config_section_offset = __cpu_to_be32(sector);
1663 ddf->anchor.config_section_length = __cpu_to_be32(clen);
1664 sector += clen;
1665
1666 ddf->anchor.data_section_offset = __cpu_to_be32(sector);
1667 ddf->anchor.data_section_length = __cpu_to_be32(1);
1668 sector += 1;
1669
1670 ddf->anchor.bbm_section_length = __cpu_to_be32(0);
1671 ddf->anchor.bbm_section_offset = __cpu_to_be32(0xFFFFFFFF);
1672 ddf->anchor.diag_space_length = __cpu_to_be32(0);
1673 ddf->anchor.diag_space_offset = __cpu_to_be32(0xFFFFFFFF);
1674 ddf->anchor.vendor_length = __cpu_to_be32(0);
1675 ddf->anchor.vendor_offset = __cpu_to_be32(0xFFFFFFFF);
1676
1677 memset(ddf->anchor.pad4, 0xff, 256);
1678
1679 memcpy(&ddf->primary, &ddf->anchor, 512);
1680 memcpy(&ddf->secondary, &ddf->anchor, 512);
1681
1682 ddf->primary.openflag = 1; /* I guess.. */
1683 ddf->primary.type = DDF_HEADER_PRIMARY;
1684
1685 ddf->secondary.openflag = 1; /* I guess.. */
1686 ddf->secondary.type = DDF_HEADER_SECONDARY;
1687
1688 ddf->active = &ddf->primary;
1689
1690 ddf->controller.magic = DDF_CONTROLLER_MAGIC;
1691
1692 /* 24 more bytes of fiction required.
1693 * first 8 are a 'vendor-id' - "Linux-MD"
1694 * Remaining 16 are serial number.... maybe a hostname would do?
1695 */
1696 memcpy(ddf->controller.guid, T10, sizeof(T10));
1697 gethostname(hostname, sizeof(hostname));
1698 hostname[sizeof(hostname) - 1] = 0;
1699 hostlen = strlen(hostname);
1700 memcpy(ddf->controller.guid + 24 - hostlen, hostname, hostlen);
1701 for (i = strlen(T10) ; i+hostlen < 24; i++)
1702 ddf->controller.guid[i] = ' ';
1703
1704 ddf->controller.type.vendor_id = __cpu_to_be16(0xDEAD);
1705 ddf->controller.type.device_id = __cpu_to_be16(0xBEEF);
1706 ddf->controller.type.sub_vendor_id = 0;
1707 ddf->controller.type.sub_device_id = 0;
1708 memcpy(ddf->controller.product_id, "What Is My PID??", 16);
1709 memset(ddf->controller.pad, 0xff, 8);
1710 memset(ddf->controller.vendor_data, 0xff, 448);
1711 if (homehost && strlen(homehost) < 440)
1712 strcpy((char*)ddf->controller.vendor_data, homehost);
1713
1714 if (posix_memalign((void**)&pd, 512, pdsize) != 0) {
1715 fprintf(stderr, Name ": %s could not allocate pd\n", __func__);
1716 return 0;
1717 }
1718 ddf->phys = pd;
1719 ddf->pdsize = pdsize;
1720
1721 memset(pd, 0xff, pdsize);
1722 memset(pd, 0, sizeof(*pd));
1723 pd->magic = DDF_PHYS_DATA_MAGIC;
1724 pd->used_pdes = __cpu_to_be16(0);
1725 pd->max_pdes = __cpu_to_be16(max_phys_disks);
1726 memset(pd->pad, 0xff, 52);
1727
1728 if (posix_memalign((void**)&vd, 512, vdsize) != 0) {
1729 fprintf(stderr, Name ": %s could not allocate vd\n", __func__);
1730 return 0;
1731 }
1732 ddf->virt = vd;
1733 ddf->vdsize = vdsize;
1734 memset(vd, 0, vdsize);
1735 vd->magic = DDF_VIRT_RECORDS_MAGIC;
1736 vd->populated_vdes = __cpu_to_be16(0);
1737 vd->max_vdes = __cpu_to_be16(max_virt_disks);
1738 memset(vd->pad, 0xff, 52);
1739
1740 for (i=0; i<max_virt_disks; i++)
1741 memset(&vd->entries[i], 0xff, sizeof(struct virtual_entry));
1742
1743 st->sb = ddf;
1744 ddf->updates_pending = 1;
1745 return 1;
1746 }
1747
1748 static int chunk_to_shift(int chunksize)
1749 {
1750 return ffs(chunksize/512)-1;
1751 }
1752
1753 static int level_to_prl(int level)
1754 {
1755 switch (level) {
1756 case LEVEL_LINEAR: return DDF_CONCAT;
1757 case 0: return DDF_RAID0;
1758 case 1: return DDF_RAID1;
1759 case 4: return DDF_RAID4;
1760 case 5: return DDF_RAID5;
1761 case 6: return DDF_RAID6;
1762 default: return -1;
1763 }
1764 }
1765 static int layout_to_rlq(int level, int layout, int raiddisks)
1766 {
1767 switch(level) {
1768 case 0:
1769 return DDF_RAID0_SIMPLE;
1770 case 1:
1771 switch(raiddisks) {
1772 case 2: return DDF_RAID1_SIMPLE;
1773 case 3: return DDF_RAID1_MULTI;
1774 default: return -1;
1775 }
1776 case 4:
1777 switch(layout) {
1778 case 0: return DDF_RAID4_N;
1779 }
1780 break;
1781 case 5:
1782 switch(layout) {
1783 case ALGORITHM_LEFT_ASYMMETRIC:
1784 return DDF_RAID5_N_RESTART;
1785 case ALGORITHM_RIGHT_ASYMMETRIC:
1786 return DDF_RAID5_0_RESTART;
1787 case ALGORITHM_LEFT_SYMMETRIC:
1788 return DDF_RAID5_N_CONTINUE;
1789 case ALGORITHM_RIGHT_SYMMETRIC:
1790 return -1; /* not mentioned in standard */
1791 }
1792 case 6:
1793 switch(layout) {
1794 case ALGORITHM_ROTATING_N_RESTART:
1795 return DDF_RAID5_N_RESTART;
1796 case ALGORITHM_ROTATING_ZERO_RESTART:
1797 return DDF_RAID6_0_RESTART;
1798 case ALGORITHM_ROTATING_N_CONTINUE:
1799 return DDF_RAID5_N_CONTINUE;
1800 }
1801 }
1802 return -1;
1803 }
1804
1805 static int rlq_to_layout(int rlq, int prl, int raiddisks)
1806 {
1807 switch(prl) {
1808 case DDF_RAID0:
1809 return 0; /* hopefully rlq == DDF_RAID0_SIMPLE */
1810 case DDF_RAID1:
1811 return 0; /* hopefully rlq == SIMPLE or MULTI depending
1812 on raiddisks*/
1813 case DDF_RAID4:
1814 switch(rlq) {
1815 case DDF_RAID4_N:
1816 return 0;
1817 default:
1818 /* not supported */
1819 return -1; /* FIXME this isn't checked */
1820 }
1821 case DDF_RAID5:
1822 switch(rlq) {
1823 case DDF_RAID5_N_RESTART:
1824 return ALGORITHM_LEFT_ASYMMETRIC;
1825 case DDF_RAID5_0_RESTART:
1826 return ALGORITHM_RIGHT_ASYMMETRIC;
1827 case DDF_RAID5_N_CONTINUE:
1828 return ALGORITHM_LEFT_SYMMETRIC;
1829 default:
1830 return -1;
1831 }
1832 case DDF_RAID6:
1833 switch(rlq) {
1834 case DDF_RAID5_N_RESTART:
1835 return ALGORITHM_ROTATING_N_RESTART;
1836 case DDF_RAID6_0_RESTART:
1837 return ALGORITHM_ROTATING_ZERO_RESTART;
1838 case DDF_RAID5_N_CONTINUE:
1839 return ALGORITHM_ROTATING_N_CONTINUE;
1840 default:
1841 return -1;
1842 }
1843 }
1844 return -1;
1845 }
1846
1847 #ifndef MDASSEMBLE
1848 struct extent {
1849 unsigned long long start, size;
1850 };
1851 static int cmp_extent(const void *av, const void *bv)
1852 {
1853 const struct extent *a = av;
1854 const struct extent *b = bv;
1855 if (a->start < b->start)
1856 return -1;
1857 if (a->start > b->start)
1858 return 1;
1859 return 0;
1860 }
1861
1862 static struct extent *get_extents(struct ddf_super *ddf, struct dl *dl)
1863 {
1864 /* find a list of used extents on the give physical device
1865 * (dnum) of the given ddf.
1866 * Return a malloced array of 'struct extent'
1867
1868 FIXME ignore DDF_Legacy devices?
1869
1870 */
1871 struct extent *rv;
1872 int n = 0;
1873 int i, j;
1874
1875 rv = malloc(sizeof(struct extent) * (ddf->max_part + 2));
1876 if (!rv)
1877 return NULL;
1878
1879 for (i = 0; i < ddf->max_part; i++) {
1880 struct vcl *v = dl->vlist[i];
1881 if (v == NULL)
1882 continue;
1883 for (j=0; j < v->conf.prim_elmnt_count; j++)
1884 if (v->conf.phys_refnum[j] == dl->disk.refnum) {
1885 /* This device plays role 'j' in 'v'. */
1886 rv[n].start = __be64_to_cpu(v->lba_offset[j]);
1887 rv[n].size = __be64_to_cpu(v->conf.blocks);
1888 n++;
1889 break;
1890 }
1891 }
1892 qsort(rv, n, sizeof(*rv), cmp_extent);
1893
1894 rv[n].start = __be64_to_cpu(ddf->phys->entries[dl->pdnum].config_size);
1895 rv[n].size = 0;
1896 return rv;
1897 }
1898 #endif
1899
1900 static int init_super_ddf_bvd(struct supertype *st,
1901 mdu_array_info_t *info,
1902 unsigned long long size,
1903 char *name, char *homehost,
1904 int *uuid)
1905 {
1906 /* We are creating a BVD inside a pre-existing container.
1907 * so st->sb is already set.
1908 * We need to create a new vd_config and a new virtual_entry
1909 */
1910 struct ddf_super *ddf = st->sb;
1911 int venum;
1912 struct virtual_entry *ve;
1913 struct vcl *vcl;
1914 struct vd_config *vc;
1915
1916 if (__be16_to_cpu(ddf->virt->populated_vdes)
1917 >= __be16_to_cpu(ddf->virt->max_vdes)) {
1918 fprintf(stderr, Name": This ddf already has the "
1919 "maximum of %d virtual devices\n",
1920 __be16_to_cpu(ddf->virt->max_vdes));
1921 return 0;
1922 }
1923
1924 for (venum = 0; venum < __be16_to_cpu(ddf->virt->max_vdes); venum++)
1925 if (all_ff(ddf->virt->entries[venum].guid))
1926 break;
1927 if (venum == __be16_to_cpu(ddf->virt->max_vdes)) {
1928 fprintf(stderr, Name ": Cannot find spare slot for "
1929 "virtual disk - DDF is corrupt\n");
1930 return 0;
1931 }
1932 ve = &ddf->virt->entries[venum];
1933
1934 /* A Virtual Disk GUID contains the T10 Vendor ID, controller type,
1935 * timestamp, random number
1936 */
1937 make_header_guid(ve->guid);
1938 ve->unit = __cpu_to_be16(info->md_minor);
1939 ve->pad0 = 0xFFFF;
1940 ve->guid_crc = crc32(0, (unsigned char*)ddf->anchor.guid, DDF_GUID_LEN);
1941 ve->type = 0;
1942 ve->state = DDF_state_degraded; /* Will be modified as devices are added */
1943 if (info->state & 1) /* clean */
1944 ve->init_state = DDF_init_full;
1945 else
1946 ve->init_state = DDF_init_not;
1947
1948 memset(ve->pad1, 0xff, 14);
1949 memset(ve->name, ' ', 16);
1950 if (name)
1951 strncpy(ve->name, name, 16);
1952 ddf->virt->populated_vdes =
1953 __cpu_to_be16(__be16_to_cpu(ddf->virt->populated_vdes)+1);
1954
1955 /* Now create a new vd_config */
1956 if (posix_memalign((void**)&vcl, 512,
1957 (offsetof(struct vcl, conf) + ddf->conf_rec_len * 512)) != 0) {
1958 fprintf(stderr, Name ": %s could not allocate vd_config\n", __func__);
1959 return 0;
1960 }
1961 vcl->lba_offset = (__u64*) &vcl->conf.phys_refnum[ddf->mppe];
1962 vcl->vcnum = venum;
1963 sprintf(st->subarray, "%d", venum);
1964 vcl->block_sizes = NULL; /* FIXME not for CONCAT */
1965
1966 vc = &vcl->conf;
1967
1968 vc->magic = DDF_VD_CONF_MAGIC;
1969 memcpy(vc->guid, ve->guid, DDF_GUID_LEN);
1970 vc->timestamp = __cpu_to_be32(time(0)-DECADE);
1971 vc->seqnum = __cpu_to_be32(1);
1972 memset(vc->pad0, 0xff, 24);
1973 vc->prim_elmnt_count = __cpu_to_be16(info->raid_disks);
1974 vc->chunk_shift = chunk_to_shift(info->chunk_size);
1975 vc->prl = level_to_prl(info->level);
1976 vc->rlq = layout_to_rlq(info->level, info->layout, info->raid_disks);
1977 vc->sec_elmnt_count = 1;
1978 vc->sec_elmnt_seq = 0;
1979 vc->srl = 0;
1980 vc->blocks = __cpu_to_be64(info->size * 2);
1981 vc->array_blocks = __cpu_to_be64(
1982 calc_array_size(info->level, info->raid_disks, info->layout,
1983 info->chunk_size, info->size*2));
1984 memset(vc->pad1, 0xff, 8);
1985 vc->spare_refs[0] = 0xffffffff;
1986 vc->spare_refs[1] = 0xffffffff;
1987 vc->spare_refs[2] = 0xffffffff;
1988 vc->spare_refs[3] = 0xffffffff;
1989 vc->spare_refs[4] = 0xffffffff;
1990 vc->spare_refs[5] = 0xffffffff;
1991 vc->spare_refs[6] = 0xffffffff;
1992 vc->spare_refs[7] = 0xffffffff;
1993 memset(vc->cache_pol, 0, 8);
1994 vc->bg_rate = 0x80;
1995 memset(vc->pad2, 0xff, 3);
1996 memset(vc->pad3, 0xff, 52);
1997 memset(vc->pad4, 0xff, 192);
1998 memset(vc->v0, 0xff, 32);
1999 memset(vc->v1, 0xff, 32);
2000 memset(vc->v2, 0xff, 16);
2001 memset(vc->v3, 0xff, 16);
2002 memset(vc->vendor, 0xff, 32);
2003
2004 memset(vc->phys_refnum, 0xff, 4*ddf->mppe);
2005 memset(vc->phys_refnum+ddf->mppe, 0x00, 8*ddf->mppe);
2006
2007 vcl->next = ddf->conflist;
2008 ddf->conflist = vcl;
2009 ddf->currentconf = vcl;
2010 ddf->updates_pending = 1;
2011 return 1;
2012 }
2013
2014 #ifndef MDASSEMBLE
2015 static void add_to_super_ddf_bvd(struct supertype *st,
2016 mdu_disk_info_t *dk, int fd, char *devname)
2017 {
2018 /* fd and devname identify a device with-in the ddf container (st).
2019 * dk identifies a location in the new BVD.
2020 * We need to find suitable free space in that device and update
2021 * the phys_refnum and lba_offset for the newly created vd_config.
2022 * We might also want to update the type in the phys_disk
2023 * section.
2024 *
2025 * Alternately: fd == -1 and we have already chosen which device to
2026 * use and recorded in dlist->raid_disk;
2027 */
2028 struct dl *dl;
2029 struct ddf_super *ddf = st->sb;
2030 struct vd_config *vc;
2031 __u64 *lba_offset;
2032 int working;
2033 int i;
2034 unsigned long long blocks, pos, esize;
2035 struct extent *ex;
2036
2037 if (fd == -1) {
2038 for (dl = ddf->dlist; dl ; dl = dl->next)
2039 if (dl->raiddisk == dk->raid_disk)
2040 break;
2041 } else {
2042 for (dl = ddf->dlist; dl ; dl = dl->next)
2043 if (dl->major == dk->major &&
2044 dl->minor == dk->minor)
2045 break;
2046 }
2047 if (!dl || ! (dk->state & (1<<MD_DISK_SYNC)))
2048 return;
2049
2050 vc = &ddf->currentconf->conf;
2051 lba_offset = ddf->currentconf->lba_offset;
2052
2053 ex = get_extents(ddf, dl);
2054 if (!ex)
2055 return;
2056
2057 i = 0; pos = 0;
2058 blocks = __be64_to_cpu(vc->blocks);
2059 if (ddf->currentconf->block_sizes)
2060 blocks = ddf->currentconf->block_sizes[dk->raid_disk];
2061
2062 do {
2063 esize = ex[i].start - pos;
2064 if (esize >= blocks)
2065 break;
2066 pos = ex[i].start + ex[i].size;
2067 i++;
2068 } while (ex[i-1].size);
2069
2070 free(ex);
2071 if (esize < blocks)
2072 return;
2073
2074 ddf->currentdev = dk->raid_disk;
2075 vc->phys_refnum[dk->raid_disk] = dl->disk.refnum;
2076 lba_offset[dk->raid_disk] = __cpu_to_be64(pos);
2077
2078 for (i=0; i < ddf->max_part ; i++)
2079 if (dl->vlist[i] == NULL)
2080 break;
2081 if (i == ddf->max_part)
2082 return;
2083 dl->vlist[i] = ddf->currentconf;
2084
2085 if (fd >= 0)
2086 dl->fd = fd;
2087 if (devname)
2088 dl->devname = devname;
2089
2090 /* Check how many working raid_disks, and if we can mark
2091 * array as optimal yet
2092 */
2093 working = 0;
2094
2095 for (i=0; i < __be16_to_cpu(vc->prim_elmnt_count); i++)
2096 if (vc->phys_refnum[i] != 0xffffffff)
2097 working++;
2098
2099 /* Find which virtual_entry */
2100 i = ddf->currentconf->vcnum;
2101 if (working == __be16_to_cpu(vc->prim_elmnt_count))
2102 ddf->virt->entries[i].state =
2103 (ddf->virt->entries[i].state & ~DDF_state_mask)
2104 | DDF_state_optimal;
2105
2106 if (vc->prl == DDF_RAID6 &&
2107 working+1 == __be16_to_cpu(vc->prim_elmnt_count))
2108 ddf->virt->entries[i].state =
2109 (ddf->virt->entries[i].state & ~DDF_state_mask)
2110 | DDF_state_part_optimal;
2111
2112 ddf->phys->entries[dl->pdnum].type &= ~__cpu_to_be16(DDF_Global_Spare);
2113 ddf->phys->entries[dl->pdnum].type |= __cpu_to_be16(DDF_Active_in_VD);
2114 ddf->updates_pending = 1;
2115 }
2116
2117 /* add a device to a container, either while creating it or while
2118 * expanding a pre-existing container
2119 */
2120 static int add_to_super_ddf(struct supertype *st,
2121 mdu_disk_info_t *dk, int fd, char *devname)
2122 {
2123 struct ddf_super *ddf = st->sb;
2124 struct dl *dd;
2125 time_t now;
2126 struct tm *tm;
2127 unsigned long long size;
2128 struct phys_disk_entry *pde;
2129 int n, i;
2130 struct stat stb;
2131
2132 if (ddf->currentconf) {
2133 add_to_super_ddf_bvd(st, dk, fd, devname);
2134 return 0;
2135 }
2136
2137 /* This is device numbered dk->number. We need to create
2138 * a phys_disk entry and a more detailed disk_data entry.
2139 */
2140 fstat(fd, &stb);
2141 if (posix_memalign((void**)&dd, 512,
2142 sizeof(*dd) + sizeof(dd->vlist[0]) * ddf->max_part) != 0) {
2143 fprintf(stderr, Name
2144 ": %s could allocate buffer for new disk, aborting\n",
2145 __func__);
2146 return 1;
2147 }
2148 dd->major = major(stb.st_rdev);
2149 dd->minor = minor(stb.st_rdev);
2150 dd->devname = devname;
2151 dd->fd = fd;
2152 dd->spare = NULL;
2153
2154 dd->disk.magic = DDF_PHYS_DATA_MAGIC;
2155 now = time(0);
2156 tm = localtime(&now);
2157 sprintf(dd->disk.guid, "%8s%04d%02d%02d",
2158 T10, tm->tm_year+1900, tm->tm_mon+1, tm->tm_mday);
2159 *(__u32*)(dd->disk.guid + 16) = random32();
2160 *(__u32*)(dd->disk.guid + 20) = random32();
2161
2162 do {
2163 /* Cannot be bothered finding a CRC of some irrelevant details*/
2164 dd->disk.refnum = random32();
2165 for (i = __be16_to_cpu(ddf->active->max_pd_entries) - 1;
2166 i >= 0; i--)
2167 if (ddf->phys->entries[i].refnum == dd->disk.refnum)
2168 break;
2169 } while (i >= 0);
2170
2171 dd->disk.forced_ref = 1;
2172 dd->disk.forced_guid = 1;
2173 memset(dd->disk.vendor, ' ', 32);
2174 memcpy(dd->disk.vendor, "Linux", 5);
2175 memset(dd->disk.pad, 0xff, 442);
2176 for (i = 0; i < ddf->max_part ; i++)
2177 dd->vlist[i] = NULL;
2178
2179 n = __be16_to_cpu(ddf->phys->used_pdes);
2180 pde = &ddf->phys->entries[n];
2181 dd->pdnum = n;
2182
2183 if (st->update_tail) {
2184 int len = (sizeof(struct phys_disk) +
2185 sizeof(struct phys_disk_entry));
2186 struct phys_disk *pd;
2187
2188 pd = malloc(len);
2189 pd->magic = DDF_PHYS_RECORDS_MAGIC;
2190 pd->used_pdes = __cpu_to_be16(n);
2191 pde = &pd->entries[0];
2192 dd->mdupdate = pd;
2193 } else {
2194 n++;
2195 ddf->phys->used_pdes = __cpu_to_be16(n);
2196 }
2197
2198 memcpy(pde->guid, dd->disk.guid, DDF_GUID_LEN);
2199 pde->refnum = dd->disk.refnum;
2200 pde->type = __cpu_to_be16(DDF_Forced_PD_GUID | DDF_Global_Spare);
2201 pde->state = __cpu_to_be16(DDF_Online);
2202 get_dev_size(fd, NULL, &size);
2203 /* We are required to reserve 32Meg, and record the size in sectors */
2204 pde->config_size = __cpu_to_be64( (size - 32*1024*1024) / 512);
2205 sprintf(pde->path, "%17.17s","Information: nil") ;
2206 memset(pde->pad, 0xff, 6);
2207
2208 dd->size = size >> 9;
2209 if (st->update_tail) {
2210 dd->next = ddf->add_list;
2211 ddf->add_list = dd;
2212 } else {
2213 dd->next = ddf->dlist;
2214 ddf->dlist = dd;
2215 ddf->updates_pending = 1;
2216 }
2217
2218 return 0;
2219 }
2220
2221 /*
2222 * This is the write_init_super method for a ddf container. It is
2223 * called when creating a container or adding another device to a
2224 * container.
2225 */
2226
2227 static unsigned char null_conf[4096+512];
2228
2229 static int __write_init_super_ddf(struct supertype *st, int do_close)
2230 {
2231
2232 struct ddf_super *ddf = st->sb;
2233 int i;
2234 struct dl *d;
2235 int n_config;
2236 int conf_size;
2237 int attempts = 0;
2238 int successes = 0;
2239 unsigned long long size, sector;
2240
2241 /* try to write updated metadata,
2242 * if we catch a failure move on to the next disk
2243 */
2244 for (d = ddf->dlist; d; d=d->next) {
2245 int fd = d->fd;
2246
2247 if (fd < 0)
2248 continue;
2249
2250 attempts++;
2251 /* We need to fill in the primary, (secondary) and workspace
2252 * lba's in the headers, set their checksums,
2253 * Also checksum phys, virt....
2254 *
2255 * Then write everything out, finally the anchor is written.
2256 */
2257 get_dev_size(fd, NULL, &size);
2258 size /= 512;
2259 ddf->anchor.workspace_lba = __cpu_to_be64(size - 32*1024*2);
2260 ddf->anchor.primary_lba = __cpu_to_be64(size - 16*1024*2);
2261 ddf->anchor.seq = __cpu_to_be32(1);
2262 memcpy(&ddf->primary, &ddf->anchor, 512);
2263 memcpy(&ddf->secondary, &ddf->anchor, 512);
2264
2265 ddf->anchor.openflag = 0xFF; /* 'open' means nothing */
2266 ddf->anchor.seq = 0xFFFFFFFF; /* no sequencing in anchor */
2267 ddf->anchor.crc = calc_crc(&ddf->anchor, 512);
2268
2269 ddf->primary.openflag = 0;
2270 ddf->primary.type = DDF_HEADER_PRIMARY;
2271
2272 ddf->secondary.openflag = 0;
2273 ddf->secondary.type = DDF_HEADER_SECONDARY;
2274
2275 ddf->primary.crc = calc_crc(&ddf->primary, 512);
2276 ddf->secondary.crc = calc_crc(&ddf->secondary, 512);
2277
2278 sector = size - 16*1024*2;
2279 lseek64(fd, sector<<9, 0);
2280 if (write(fd, &ddf->primary, 512) < 0)
2281 continue;
2282
2283 ddf->controller.crc = calc_crc(&ddf->controller, 512);
2284 if (write(fd, &ddf->controller, 512) < 0)
2285 continue;
2286
2287 ddf->phys->crc = calc_crc(ddf->phys, ddf->pdsize);
2288
2289 if (write(fd, ddf->phys, ddf->pdsize) < 0)
2290 continue;
2291
2292 ddf->virt->crc = calc_crc(ddf->virt, ddf->vdsize);
2293 if (write(fd, ddf->virt, ddf->vdsize) < 0)
2294 continue;
2295
2296 /* Now write lots of config records. */
2297 n_config = ddf->max_part;
2298 conf_size = ddf->conf_rec_len * 512;
2299 for (i = 0 ; i <= n_config ; i++) {
2300 struct vcl *c = d->vlist[i];
2301 if (i == n_config)
2302 c = (struct vcl*)d->spare;
2303
2304 if (c) {
2305 c->conf.crc = calc_crc(&c->conf, conf_size);
2306 if (write(fd, &c->conf, conf_size) < 0)
2307 break;
2308 } else {
2309 char *null_aligned = (char*)((((unsigned long)null_conf)+511)&~511UL);
2310 if (null_conf[0] != 0xff)
2311 memset(null_conf, 0xff, sizeof(null_conf));
2312 int togo = conf_size;
2313 while (togo > sizeof(null_conf)-512) {
2314 if (write(fd, null_aligned, sizeof(null_conf)-512) < 0)
2315 break;
2316 togo -= sizeof(null_conf)-512;
2317 }
2318 if (write(fd, null_aligned, togo) < 0)
2319 break;
2320 }
2321 }
2322 if (i <= n_config)
2323 continue;
2324 d->disk.crc = calc_crc(&d->disk, 512);
2325 if (write(fd, &d->disk, 512) < 0)
2326 continue;
2327
2328 /* Maybe do the same for secondary */
2329
2330 lseek64(fd, (size-1)*512, SEEK_SET);
2331 if (write(fd, &ddf->anchor, 512) < 0)
2332 continue;
2333 successes++;
2334 }
2335
2336 if (do_close)
2337 for (d = ddf->dlist; d; d=d->next) {
2338 close(d->fd);
2339 d->fd = -1;
2340 }
2341
2342 return attempts != successes;
2343 }
2344
2345 static int write_init_super_ddf(struct supertype *st)
2346 {
2347
2348 if (st->update_tail) {
2349 /* queue the virtual_disk and vd_config as metadata updates */
2350 struct virtual_disk *vd;
2351 struct vd_config *vc;
2352 struct ddf_super *ddf = st->sb;
2353 int len;
2354
2355 if (!ddf->currentconf) {
2356 int len = (sizeof(struct phys_disk) +
2357 sizeof(struct phys_disk_entry));
2358
2359 /* adding a disk to the container. */
2360 if (!ddf->add_list)
2361 return 0;
2362
2363 append_metadata_update(st, ddf->add_list->mdupdate, len);
2364 ddf->add_list->mdupdate = NULL;
2365 return 0;
2366 }
2367
2368 /* Newly created VD */
2369
2370 /* First the virtual disk. We have a slightly fake header */
2371 len = sizeof(struct virtual_disk) + sizeof(struct virtual_entry);
2372 vd = malloc(len);
2373 *vd = *ddf->virt;
2374 vd->entries[0] = ddf->virt->entries[ddf->currentconf->vcnum];
2375 vd->populated_vdes = __cpu_to_be16(ddf->currentconf->vcnum);
2376 append_metadata_update(st, vd, len);
2377
2378 /* Then the vd_config */
2379 len = ddf->conf_rec_len * 512;
2380 vc = malloc(len);
2381 memcpy(vc, &ddf->currentconf->conf, len);
2382 append_metadata_update(st, vc, len);
2383
2384 /* FIXME I need to close the fds! */
2385 return 0;
2386 } else
2387 return __write_init_super_ddf(st, 1);
2388 }
2389
2390 #endif
2391
2392 static __u64 avail_size_ddf(struct supertype *st, __u64 devsize)
2393 {
2394 /* We must reserve the last 32Meg */
2395 if (devsize <= 32*1024*2)
2396 return 0;
2397 return devsize - 32*1024*2;
2398 }
2399
2400 #ifndef MDASSEMBLE
2401
2402 static int reserve_space(struct supertype *st, int raiddisks,
2403 unsigned long long size, int chunk,
2404 unsigned long long *freesize)
2405 {
2406 /* Find 'raiddisks' spare extents at least 'size' big (but
2407 * only caring about multiples of 'chunk') and remember
2408 * them.
2409 * If the cannot be found, fail.
2410 */
2411 struct dl *dl;
2412 struct ddf_super *ddf = st->sb;
2413 int cnt = 0;
2414
2415 for (dl = ddf->dlist; dl ; dl=dl->next) {
2416 dl->raiddisk = -1;
2417 dl->esize = 0;
2418 }
2419 /* Now find largest extent on each device */
2420 for (dl = ddf->dlist ; dl ; dl=dl->next) {
2421 struct extent *e = get_extents(ddf, dl);
2422 unsigned long long pos = 0;
2423 int i = 0;
2424 int found = 0;
2425 unsigned long long minsize = size;
2426
2427 if (size == 0)
2428 minsize = chunk;
2429
2430 if (!e)
2431 continue;
2432 do {
2433 unsigned long long esize;
2434 esize = e[i].start - pos;
2435 if (esize >= minsize) {
2436 found = 1;
2437 minsize = esize;
2438 }
2439 pos = e[i].start + e[i].size;
2440 i++;
2441 } while (e[i-1].size);
2442 if (found) {
2443 cnt++;
2444 dl->esize = minsize;
2445 }
2446 free(e);
2447 }
2448 if (cnt < raiddisks) {
2449 fprintf(stderr, Name ": not enough devices with space to create array.\n");
2450 return 0; /* No enough free spaces large enough */
2451 }
2452 if (size == 0) {
2453 /* choose the largest size of which there are at least 'raiddisk' */
2454 for (dl = ddf->dlist ; dl ; dl=dl->next) {
2455 struct dl *dl2;
2456 if (dl->esize <= size)
2457 continue;
2458 /* This is bigger than 'size', see if there are enough */
2459 cnt = 0;
2460 for (dl2 = dl; dl2 ; dl2=dl2->next)
2461 if (dl2->esize >= dl->esize)
2462 cnt++;
2463 if (cnt >= raiddisks)
2464 size = dl->esize;
2465 }
2466 if (chunk) {
2467 size = size / chunk;
2468 size *= chunk;
2469 }
2470 *freesize = size;
2471 if (size < 32) {
2472 fprintf(stderr, Name ": not enough spare devices to create array.\n");
2473 return 0;
2474 }
2475 }
2476 /* We have a 'size' of which there are enough spaces.
2477 * We simply do a first-fit */
2478 cnt = 0;
2479 for (dl = ddf->dlist ; dl && cnt < raiddisks ; dl=dl->next) {
2480 if (dl->esize < size)
2481 continue;
2482
2483 dl->raiddisk = cnt;
2484 cnt++;
2485 }
2486 return 1;
2487 }
2488
2489
2490
2491 static int
2492 validate_geometry_ddf_container(struct supertype *st,
2493 int level, int layout, int raiddisks,
2494 int chunk, unsigned long long size,
2495 char *dev, unsigned long long *freesize,
2496 int verbose);
2497
2498 static int validate_geometry_ddf_bvd(struct supertype *st,
2499 int level, int layout, int raiddisks,
2500 int chunk, unsigned long long size,
2501 char *dev, unsigned long long *freesize,
2502 int verbose);
2503
2504 static int validate_geometry_ddf(struct supertype *st,
2505 int level, int layout, int raiddisks,
2506 int chunk, unsigned long long size,
2507 char *dev, unsigned long long *freesize,
2508 int verbose)
2509 {
2510 int fd;
2511 struct mdinfo *sra;
2512 int cfd;
2513
2514 /* ddf potentially supports lots of things, but it depends on
2515 * what devices are offered (and maybe kernel version?)
2516 * If given unused devices, we will make a container.
2517 * If given devices in a container, we will make a BVD.
2518 * If given BVDs, we make an SVD, changing all the GUIDs in the process.
2519 */
2520
2521 if (level == LEVEL_CONTAINER) {
2522 /* Must be a fresh device to add to a container */
2523 return validate_geometry_ddf_container(st, level, layout,
2524 raiddisks, chunk,
2525 size, dev, freesize,
2526 verbose);
2527 }
2528
2529 if (!dev) {
2530 /* Initial sanity check. Exclude illegal levels. */
2531 int i;
2532 for (i=0; ddf_level_num[i].num1 != MAXINT; i++)
2533 if (ddf_level_num[i].num2 == level)
2534 break;
2535 if (ddf_level_num[i].num1 == MAXINT)
2536 return 0;
2537 /* Should check layout? etc */
2538
2539 if (st->sb && freesize) {
2540 /* --create was given a container to create in.
2541 * So we need to check that there are enough
2542 * free spaces and return the amount of space.
2543 * We may as well remember which drives were
2544 * chosen so that add_to_super/getinfo_super
2545 * can return them.
2546 */
2547 return reserve_space(st, raiddisks, size, chunk, freesize);
2548 }
2549 return 1;
2550 }
2551
2552 if (st->sb) {
2553 /* A container has already been opened, so we are
2554 * creating in there. Maybe a BVD, maybe an SVD.
2555 * Should make a distinction one day.
2556 */
2557 return validate_geometry_ddf_bvd(st, level, layout, raiddisks,
2558 chunk, size, dev, freesize,
2559 verbose);
2560 }
2561 /* This is the first device for the array.
2562 * If it is a container, we read it in and do automagic allocations,
2563 * no other devices should be given.
2564 * Otherwise it must be a member device of a container, and we
2565 * do manual allocation.
2566 * Later we should check for a BVD and make an SVD.
2567 */
2568 fd = open(dev, O_RDONLY|O_EXCL, 0);
2569 if (fd >= 0) {
2570 sra = sysfs_read(fd, 0, GET_VERSION);
2571 close(fd);
2572 if (sra && sra->array.major_version == -1 &&
2573 strcmp(sra->text_version, "ddf") == 0) {
2574
2575 /* load super */
2576 /* find space for 'n' devices. */
2577 /* remember the devices */
2578 /* Somehow return the fact that we have enough */
2579 }
2580
2581 if (verbose)
2582 fprintf(stderr,
2583 Name ": ddf: Cannot create this array "
2584 "on device %s\n",
2585 dev);
2586 return 0;
2587 }
2588 if (errno != EBUSY || (fd = open(dev, O_RDONLY, 0)) < 0) {
2589 if (verbose)
2590 fprintf(stderr, Name ": ddf: Cannot open %s: %s\n",
2591 dev, strerror(errno));
2592 return 0;
2593 }
2594 /* Well, it is in use by someone, maybe a 'ddf' container. */
2595 cfd = open_container(fd);
2596 if (cfd < 0) {
2597 close(fd);
2598 if (verbose)
2599 fprintf(stderr, Name ": ddf: Cannot use %s: %s\n",
2600 dev, strerror(EBUSY));
2601 return 0;
2602 }
2603 sra = sysfs_read(cfd, 0, GET_VERSION);
2604 close(fd);
2605 if (sra && sra->array.major_version == -1 &&
2606 strcmp(sra->text_version, "ddf") == 0) {
2607 /* This is a member of a ddf container. Load the container
2608 * and try to create a bvd
2609 */
2610 struct ddf_super *ddf;
2611 if (load_super_ddf_all(st, cfd, (void **)&ddf, NULL, 1) == 0) {
2612 st->sb = ddf;
2613 st->container_dev = fd2devnum(cfd);
2614 close(cfd);
2615 return validate_geometry_ddf_bvd(st, level, layout,
2616 raiddisks, chunk, size,
2617 dev, freesize,
2618 verbose);
2619 }
2620 close(cfd);
2621 } else /* device may belong to a different container */
2622 return 0;
2623
2624 return 1;
2625 }
2626
2627 static int
2628 validate_geometry_ddf_container(struct supertype *st,
2629 int level, int layout, int raiddisks,
2630 int chunk, unsigned long long size,
2631 char *dev, unsigned long long *freesize,
2632 int verbose)
2633 {
2634 int fd;
2635 unsigned long long ldsize;
2636
2637 if (level != LEVEL_CONTAINER)
2638 return 0;
2639 if (!dev)
2640 return 1;
2641
2642 fd = open(dev, O_RDONLY|O_EXCL, 0);
2643 if (fd < 0) {
2644 if (verbose)
2645 fprintf(stderr, Name ": ddf: Cannot open %s: %s\n",
2646 dev, strerror(errno));
2647 return 0;
2648 }
2649 if (!get_dev_size(fd, dev, &ldsize)) {
2650 close(fd);
2651 return 0;
2652 }
2653 close(fd);
2654
2655 *freesize = avail_size_ddf(st, ldsize >> 9);
2656
2657 return 1;
2658 }
2659
2660 static int validate_geometry_ddf_bvd(struct supertype *st,
2661 int level, int layout, int raiddisks,
2662 int chunk, unsigned long long size,
2663 char *dev, unsigned long long *freesize,
2664 int verbose)
2665 {
2666 struct stat stb;
2667 struct ddf_super *ddf = st->sb;
2668 struct dl *dl;
2669 unsigned long long pos = 0;
2670 unsigned long long maxsize;
2671 struct extent *e;
2672 int i;
2673 /* ddf/bvd supports lots of things, but not containers */
2674 if (level == LEVEL_CONTAINER)
2675 return 0;
2676 /* We must have the container info already read in. */
2677 if (!ddf)
2678 return 0;
2679
2680 if (!dev) {
2681 /* General test: make sure there is space for
2682 * 'raiddisks' device extents of size 'size'.
2683 */
2684 unsigned long long minsize = size;
2685 int dcnt = 0;
2686 if (minsize == 0)
2687 minsize = 8;
2688 for (dl = ddf->dlist; dl ; dl = dl->next)
2689 {
2690 int found = 0;
2691 pos = 0;
2692
2693 i = 0;
2694 e = get_extents(ddf, dl);
2695 if (!e) continue;
2696 do {
2697 unsigned long long esize;
2698 esize = e[i].start - pos;
2699 if (esize >= minsize)
2700 found = 1;
2701 pos = e[i].start + e[i].size;
2702 i++;
2703 } while (e[i-1].size);
2704 if (found)
2705 dcnt++;
2706 free(e);
2707 }
2708 if (dcnt < raiddisks) {
2709 if (verbose)
2710 fprintf(stderr,
2711 Name ": ddf: Not enough devices with "
2712 "space for this array (%d < %d)\n",
2713 dcnt, raiddisks);
2714 return 0;
2715 }
2716 return 1;
2717 }
2718 /* This device must be a member of the set */
2719 if (stat(dev, &stb) < 0)
2720 return 0;
2721 if ((S_IFMT & stb.st_mode) != S_IFBLK)
2722 return 0;
2723 for (dl = ddf->dlist ; dl ; dl = dl->next) {
2724 if (dl->major == major(stb.st_rdev) &&
2725 dl->minor == minor(stb.st_rdev))
2726 break;
2727 }
2728 if (!dl) {
2729 if (verbose)
2730 fprintf(stderr, Name ": ddf: %s is not in the "
2731 "same DDF set\n",
2732 dev);
2733 return 0;
2734 }
2735 e = get_extents(ddf, dl);
2736 maxsize = 0;
2737 i = 0;
2738 if (e) do {
2739 unsigned long long esize;
2740 esize = e[i].start - pos;
2741 if (esize >= maxsize)
2742 maxsize = esize;
2743 pos = e[i].start + e[i].size;
2744 i++;
2745 } while (e[i-1].size);
2746 *freesize = maxsize;
2747 // FIXME here I am
2748
2749 return 1;
2750 }
2751
2752 static int load_super_ddf_all(struct supertype *st, int fd,
2753 void **sbp, char *devname, int keep_fd)
2754 {
2755 struct mdinfo *sra;
2756 struct ddf_super *super;
2757 struct mdinfo *sd, *best = NULL;
2758 int bestseq = 0;
2759 int seq;
2760 char nm[20];
2761 int dfd;
2762 int devnum = fd2devnum(fd);
2763 enum sysfs_read_flags flags;
2764
2765 flags = GET_LEVEL|GET_VERSION|GET_DEVS|GET_STATE;
2766 if (mdmon_running(devnum))
2767 flags |= SKIP_GONE_DEVS;
2768
2769 sra = sysfs_read(fd, 0, flags);
2770 if (!sra)
2771 return 1;
2772 if (sra->array.major_version != -1 ||
2773 sra->array.minor_version != -2 ||
2774 strcmp(sra->text_version, "ddf") != 0)
2775 return 1;
2776
2777 if (posix_memalign((void**)&super, 512, sizeof(*super)) != 0)
2778 return 1;
2779 memset(super, 0, sizeof(*super));
2780
2781 /* first, try each device, and choose the best ddf */
2782 for (sd = sra->devs ; sd ; sd = sd->next) {
2783 int rv;
2784 sprintf(nm, "%d:%d", sd->disk.major, sd->disk.minor);
2785 dfd = dev_open(nm, O_RDONLY);
2786 if (dfd < 0)
2787 return 2;
2788 rv = load_ddf_headers(dfd, super, NULL);
2789 close(dfd);
2790 if (rv == 0) {
2791 seq = __be32_to_cpu(super->active->seq);
2792 if (super->active->openflag)
2793 seq--;
2794 if (!best || seq > bestseq) {
2795 bestseq = seq;
2796 best = sd;
2797 }
2798 }
2799 }
2800 if (!best)
2801 return 1;
2802 /* OK, load this ddf */
2803 sprintf(nm, "%d:%d", best->disk.major, best->disk.minor);
2804 dfd = dev_open(nm, O_RDONLY);
2805 if (dfd < 0)
2806 return 1;
2807 load_ddf_headers(dfd, super, NULL);
2808 load_ddf_global(dfd, super, NULL);
2809 close(dfd);
2810 /* Now we need the device-local bits */
2811 for (sd = sra->devs ; sd ; sd = sd->next) {
2812 int rv;
2813
2814 sprintf(nm, "%d:%d", sd->disk.major, sd->disk.minor);
2815 dfd = dev_open(nm, keep_fd? O_RDWR : O_RDONLY);
2816 if (dfd < 0)
2817 return 2;
2818 rv = load_ddf_headers(dfd, super, NULL);
2819 if (rv == 0)
2820 rv = load_ddf_local(dfd, super, NULL, keep_fd);
2821 if (!keep_fd) close(dfd);
2822 if (rv)
2823 return 1;
2824 }
2825 if (st->subarray[0]) {
2826 struct vcl *v;
2827
2828 for (v = super->conflist; v; v = v->next)
2829 if (v->vcnum == atoi(st->subarray))
2830 super->currentconf = v;
2831 if (!super->currentconf)
2832 return 1;
2833 }
2834 *sbp = super;
2835 if (st->ss == NULL) {
2836 st->ss = &super_ddf;
2837 st->minor_version = 0;
2838 st->max_devs = 512;
2839 st->container_dev = fd2devnum(fd);
2840 }
2841 st->loaded_container = 1;
2842 return 0;
2843 }
2844 #endif /* MDASSEMBLE */
2845
2846 static struct mdinfo *container_content_ddf(struct supertype *st)
2847 {
2848 /* Given a container loaded by load_super_ddf_all,
2849 * extract information about all the arrays into
2850 * an mdinfo tree.
2851 *
2852 * For each vcl in conflist: create an mdinfo, fill it in,
2853 * then look for matching devices (phys_refnum) in dlist
2854 * and create appropriate device mdinfo.
2855 */
2856 struct ddf_super *ddf = st->sb;
2857 struct mdinfo *rest = NULL;
2858 struct vcl *vc;
2859
2860 for (vc = ddf->conflist ; vc ; vc=vc->next)
2861 {
2862 int i;
2863 int j;
2864 struct mdinfo *this;
2865 this = malloc(sizeof(*this));
2866 memset(this, 0, sizeof(*this));
2867 this->next = rest;
2868 rest = this;
2869
2870 this->array.level = map_num1(ddf_level_num, vc->conf.prl);
2871 this->array.raid_disks =
2872 __be16_to_cpu(vc->conf.prim_elmnt_count);
2873 this->array.layout = rlq_to_layout(vc->conf.rlq, vc->conf.prl,
2874 this->array.raid_disks);
2875 this->array.md_minor = -1;
2876 this->array.major_version = -1;
2877 this->array.minor_version = -2;
2878 this->array.ctime = DECADE +
2879 __be32_to_cpu(*(__u32*)(vc->conf.guid+16));
2880 this->array.utime = DECADE +
2881 __be32_to_cpu(vc->conf.timestamp);
2882 this->array.chunk_size = 512 << vc->conf.chunk_shift;
2883
2884 i = vc->vcnum;
2885 if ((ddf->virt->entries[i].state & DDF_state_inconsistent) ||
2886 (ddf->virt->entries[i].init_state & DDF_initstate_mask) !=
2887 DDF_init_full) {
2888 this->array.state = 0;
2889 this->resync_start = 0;
2890 } else {
2891 this->array.state = 1;
2892 this->resync_start = ~0ULL;
2893 }
2894 memcpy(this->name, ddf->virt->entries[i].name, 16);
2895 this->name[16]=0;
2896 for(j=0; j<16; j++)
2897 if (this->name[j] == ' ')
2898 this->name[j] = 0;
2899
2900 memset(this->uuid, 0, sizeof(this->uuid));
2901 this->component_size = __be64_to_cpu(vc->conf.blocks);
2902 this->array.size = this->component_size / 2;
2903 this->container_member = i;
2904
2905 ddf->currentconf = vc;
2906 uuid_from_super_ddf(st, this->uuid);
2907 ddf->currentconf = NULL;
2908
2909 sprintf(this->text_version, "/%s/%d",
2910 devnum2devname(st->container_dev),
2911 this->container_member);
2912
2913 for (i=0 ; i < ddf->mppe ; i++) {
2914 struct mdinfo *dev;
2915 struct dl *d;
2916
2917 if (vc->conf.phys_refnum[i] == 0xFFFFFFFF)
2918 continue;
2919
2920 for (d = ddf->dlist; d ; d=d->next)
2921 if (d->disk.refnum == vc->conf.phys_refnum[i])
2922 break;
2923 if (d == NULL)
2924 /* Haven't found that one yet, maybe there are others */
2925 continue;
2926
2927 this->array.working_disks++;
2928
2929 dev = malloc(sizeof(*dev));
2930 memset(dev, 0, sizeof(*dev));
2931 dev->next = this->devs;
2932 this->devs = dev;
2933
2934 dev->disk.number = __be32_to_cpu(d->disk.refnum);
2935 dev->disk.major = d->major;
2936 dev->disk.minor = d->minor;
2937 dev->disk.raid_disk = i;
2938 dev->disk.state = (1<<MD_DISK_SYNC)|(1<<MD_DISK_ACTIVE);
2939
2940 dev->events = __be32_to_cpu(ddf->primary.seq);
2941 dev->data_offset = __be64_to_cpu(vc->lba_offset[i]);
2942 dev->component_size = __be64_to_cpu(vc->conf.blocks);
2943 if (d->devname)
2944 strcpy(dev->name, d->devname);
2945 }
2946 }
2947 return rest;
2948 }
2949
2950 static int store_zero_ddf(struct supertype *st, int fd)
2951 {
2952 unsigned long long dsize;
2953 void *buf;
2954 int rc;
2955
2956 if (!get_dev_size(fd, NULL, &dsize))
2957 return 1;
2958
2959 if (posix_memalign(&buf, 512, 512) != 0)
2960 return 1;
2961 memset(buf, 0, 512);
2962
2963 lseek64(fd, dsize-512, 0);
2964 rc = write(fd, buf, 512);
2965 free(buf);
2966 if (rc < 0)
2967 return 1;
2968 return 0;
2969 }
2970
2971 static int compare_super_ddf(struct supertype *st, struct supertype *tst)
2972 {
2973 /*
2974 * return:
2975 * 0 same, or first was empty, and second was copied
2976 * 1 second had wrong number
2977 * 2 wrong uuid
2978 * 3 wrong other info
2979 */
2980 struct ddf_super *first = st->sb;
2981 struct ddf_super *second = tst->sb;
2982
2983 if (!first) {
2984 st->sb = tst->sb;
2985 tst->sb = NULL;
2986 return 0;
2987 }
2988
2989 if (memcmp(first->anchor.guid, second->anchor.guid, DDF_GUID_LEN) != 0)
2990 return 2;
2991
2992 /* FIXME should I look at anything else? */
2993 return 0;
2994 }
2995
2996 #ifndef MDASSEMBLE
2997 /*
2998 * A new array 'a' has been started which claims to be instance 'inst'
2999 * within container 'c'.
3000 * We need to confirm that the array matches the metadata in 'c' so
3001 * that we don't corrupt any metadata.
3002 */
3003 static int ddf_open_new(struct supertype *c, struct active_array *a, char *inst)
3004 {
3005 dprintf("ddf: open_new %s\n", inst);
3006 a->info.container_member = atoi(inst);
3007 return 0;
3008 }
3009
3010 /*
3011 * The array 'a' is to be marked clean in the metadata.
3012 * If '->resync_start' is not ~(unsigned long long)0, then the array is only
3013 * clean up to the point (in sectors). If that cannot be recorded in the
3014 * metadata, then leave it as dirty.
3015 *
3016 * For DDF, we need to clear the DDF_state_inconsistent bit in the
3017 * !global! virtual_disk.virtual_entry structure.
3018 */
3019 static int ddf_set_array_state(struct active_array *a, int consistent)
3020 {
3021 struct ddf_super *ddf = a->container->sb;
3022 int inst = a->info.container_member;
3023 int old = ddf->virt->entries[inst].state;
3024 if (consistent == 2) {
3025 /* Should check if a recovery should be started FIXME */
3026 consistent = 1;
3027 if (!is_resync_complete(a))
3028 consistent = 0;
3029 }
3030 if (consistent)
3031 ddf->virt->entries[inst].state &= ~DDF_state_inconsistent;
3032 else
3033 ddf->virt->entries[inst].state |= DDF_state_inconsistent;
3034 if (old != ddf->virt->entries[inst].state)
3035 ddf->updates_pending = 1;
3036
3037 old = ddf->virt->entries[inst].init_state;
3038 ddf->virt->entries[inst].init_state &= ~DDF_initstate_mask;
3039 if (is_resync_complete(a))
3040 ddf->virt->entries[inst].init_state |= DDF_init_full;
3041 else if (a->resync_start == 0)
3042 ddf->virt->entries[inst].init_state |= DDF_init_not;
3043 else
3044 ddf->virt->entries[inst].init_state |= DDF_init_quick;
3045 if (old != ddf->virt->entries[inst].init_state)
3046 ddf->updates_pending = 1;
3047
3048 dprintf("ddf mark %d %s %llu\n", inst, consistent?"clean":"dirty",
3049 a->resync_start);
3050 return consistent;
3051 }
3052
3053 /*
3054 * The state of each disk is stored in the global phys_disk structure
3055 * in phys_disk.entries[n].state.
3056 * This makes various combinations awkward.
3057 * - When a device fails in any array, it must be failed in all arrays
3058 * that include a part of this device.
3059 * - When a component is rebuilding, we cannot include it officially in the
3060 * array unless this is the only array that uses the device.
3061 *
3062 * So: when transitioning:
3063 * Online -> failed, just set failed flag. monitor will propagate
3064 * spare -> online, the device might need to be added to the array.
3065 * spare -> failed, just set failed. Don't worry if in array or not.
3066 */
3067 static void ddf_set_disk(struct active_array *a, int n, int state)
3068 {
3069 struct ddf_super *ddf = a->container->sb;
3070 int inst = a->info.container_member;
3071 struct vd_config *vc = find_vdcr(ddf, inst);
3072 int pd = find_phys(ddf, vc->phys_refnum[n]);
3073 int i, st, working;
3074
3075 if (vc == NULL) {
3076 dprintf("ddf: cannot find instance %d!!\n", inst);
3077 return;
3078 }
3079 if (pd < 0) {
3080 /* disk doesn't currently exist. If it is now in_sync,
3081 * insert it. */
3082 if ((state & DS_INSYNC) && ! (state & DS_FAULTY)) {
3083 /* Find dev 'n' in a->info->devs, determine the
3084 * ddf refnum, and set vc->phys_refnum and update
3085 * phys->entries[]
3086 */
3087 /* FIXME */
3088 }
3089 } else {
3090 int old = ddf->phys->entries[pd].state;
3091 if (state & DS_FAULTY)
3092 ddf->phys->entries[pd].state |= __cpu_to_be16(DDF_Failed);
3093 if (state & DS_INSYNC) {
3094 ddf->phys->entries[pd].state |= __cpu_to_be16(DDF_Online);
3095 ddf->phys->entries[pd].state &= __cpu_to_be16(~DDF_Rebuilding);
3096 }
3097 if (old != ddf->phys->entries[pd].state)
3098 ddf->updates_pending = 1;
3099 }
3100
3101 dprintf("ddf: set_disk %d to %x\n", n, state);
3102
3103 /* Now we need to check the state of the array and update
3104 * virtual_disk.entries[n].state.
3105 * It needs to be one of "optimal", "degraded", "failed".
3106 * I don't understand 'deleted' or 'missing'.
3107 */
3108 working = 0;
3109 for (i=0; i < a->info.array.raid_disks; i++) {
3110 pd = find_phys(ddf, vc->phys_refnum[i]);
3111 if (pd < 0)
3112 continue;
3113 st = __be16_to_cpu(ddf->phys->entries[pd].state);
3114 if ((st & (DDF_Online|DDF_Failed|DDF_Rebuilding))
3115 == DDF_Online)
3116 working++;
3117 }
3118 state = DDF_state_degraded;
3119 if (working == a->info.array.raid_disks)
3120 state = DDF_state_optimal;
3121 else switch(vc->prl) {
3122 case DDF_RAID0:
3123 case DDF_CONCAT:
3124 case DDF_JBOD:
3125 state = DDF_state_failed;
3126 break;
3127 case DDF_RAID1:
3128 if (working == 0)
3129 state = DDF_state_failed;
3130 break;
3131 case DDF_RAID4:
3132 case DDF_RAID5:
3133 if (working < a->info.array.raid_disks-1)
3134 state = DDF_state_failed;
3135 break;
3136 case DDF_RAID6:
3137 if (working < a->info.array.raid_disks-2)
3138 state = DDF_state_failed;
3139 else if (working == a->info.array.raid_disks-1)
3140 state = DDF_state_part_optimal;
3141 break;
3142 }
3143
3144 if (ddf->virt->entries[inst].state !=
3145 ((ddf->virt->entries[inst].state & ~DDF_state_mask)
3146 | state)) {
3147
3148 ddf->virt->entries[inst].state =
3149 (ddf->virt->entries[inst].state & ~DDF_state_mask)
3150 | state;
3151 ddf->updates_pending = 1;
3152 }
3153
3154 }
3155
3156 static void ddf_sync_metadata(struct supertype *st)
3157 {
3158
3159 /*
3160 * Write all data to all devices.
3161 * Later, we might be able to track whether only local changes
3162 * have been made, or whether any global data has been changed,
3163 * but ddf is sufficiently weird that it probably always
3164 * changes global data ....
3165 */
3166 struct ddf_super *ddf = st->sb;
3167 if (!ddf->updates_pending)
3168 return;
3169 ddf->updates_pending = 0;
3170 __write_init_super_ddf(st, 0);
3171 dprintf("ddf: sync_metadata\n");
3172 }
3173
3174 static void ddf_process_update(struct supertype *st,
3175 struct metadata_update *update)
3176 {
3177 /* Apply this update to the metadata.
3178 * The first 4 bytes are a DDF_*_MAGIC which guides
3179 * our actions.
3180 * Possible update are:
3181 * DDF_PHYS_RECORDS_MAGIC
3182 * Add a new physical device. Changes to this record
3183 * only happen implicitly.
3184 * used_pdes is the device number.
3185 * DDF_VIRT_RECORDS_MAGIC
3186 * Add a new VD. Possibly also change the 'access' bits.
3187 * populated_vdes is the entry number.
3188 * DDF_VD_CONF_MAGIC
3189 * New or updated VD. the VIRT_RECORD must already
3190 * exist. For an update, phys_refnum and lba_offset
3191 * (at least) are updated, and the VD_CONF must
3192 * be written to precisely those devices listed with
3193 * a phys_refnum.
3194 * DDF_SPARE_ASSIGN_MAGIC
3195 * replacement Spare Assignment Record... but for which device?
3196 *
3197 * So, e.g.:
3198 * - to create a new array, we send a VIRT_RECORD and
3199 * a VD_CONF. Then assemble and start the array.
3200 * - to activate a spare we send a VD_CONF to add the phys_refnum
3201 * and offset. This will also mark the spare as active with
3202 * a spare-assignment record.
3203 */
3204 struct ddf_super *ddf = st->sb;
3205 __u32 *magic = (__u32*)update->buf;
3206 struct phys_disk *pd;
3207 struct virtual_disk *vd;
3208 struct vd_config *vc;
3209 struct vcl *vcl;
3210 struct dl *dl;
3211 int mppe;
3212 int ent;
3213
3214 dprintf("Process update %x\n", *magic);
3215
3216 switch (*magic) {
3217 case DDF_PHYS_RECORDS_MAGIC:
3218
3219 if (update->len != (sizeof(struct phys_disk) +
3220 sizeof(struct phys_disk_entry)))
3221 return;
3222 pd = (struct phys_disk*)update->buf;
3223
3224 ent = __be16_to_cpu(pd->used_pdes);
3225 if (ent >= __be16_to_cpu(ddf->phys->max_pdes))
3226 return;
3227 if (!all_ff(ddf->phys->entries[ent].guid))
3228 return;
3229 ddf->phys->entries[ent] = pd->entries[0];
3230 ddf->phys->used_pdes = __cpu_to_be16(1 +
3231 __be16_to_cpu(ddf->phys->used_pdes));
3232 ddf->updates_pending = 1;
3233 if (ddf->add_list) {
3234 struct active_array *a;
3235 struct dl *al = ddf->add_list;
3236 ddf->add_list = al->next;
3237
3238 al->next = ddf->dlist;
3239 ddf->dlist = al;
3240
3241 /* As a device has been added, we should check
3242 * for any degraded devices that might make
3243 * use of this spare */
3244 for (a = st->arrays ; a; a=a->next)
3245 a->check_degraded = 1;
3246 }
3247 break;
3248
3249 case DDF_VIRT_RECORDS_MAGIC:
3250
3251 if (update->len != (sizeof(struct virtual_disk) +
3252 sizeof(struct virtual_entry)))
3253 return;
3254 vd = (struct virtual_disk*)update->buf;
3255
3256 ent = __be16_to_cpu(vd->populated_vdes);
3257 if (ent >= __be16_to_cpu(ddf->virt->max_vdes))
3258 return;
3259 if (!all_ff(ddf->virt->entries[ent].guid))
3260 return;
3261 ddf->virt->entries[ent] = vd->entries[0];
3262 ddf->virt->populated_vdes = __cpu_to_be16(1 +
3263 __be16_to_cpu(ddf->virt->populated_vdes));
3264 ddf->updates_pending = 1;
3265 break;
3266
3267 case DDF_VD_CONF_MAGIC:
3268 dprintf("len %d %d\n", update->len, ddf->conf_rec_len);
3269
3270 mppe = __be16_to_cpu(ddf->anchor.max_primary_element_entries);
3271 if (update->len != ddf->conf_rec_len * 512)
3272 return;
3273 vc = (struct vd_config*)update->buf;
3274 for (vcl = ddf->conflist; vcl ; vcl = vcl->next)
3275 if (memcmp(vcl->conf.guid, vc->guid, DDF_GUID_LEN) == 0)
3276 break;
3277 dprintf("vcl = %p\n", vcl);
3278 if (vcl) {
3279 /* An update, just copy the phys_refnum and lba_offset
3280 * fields
3281 */
3282 memcpy(vcl->conf.phys_refnum, vc->phys_refnum,
3283 mppe * (sizeof(__u32) + sizeof(__u64)));
3284 } else {
3285 /* A new VD_CONF */
3286 if (!update->space)
3287 return;
3288 vcl = update->space;
3289 update->space = NULL;
3290 vcl->next = ddf->conflist;
3291 memcpy(&vcl->conf, vc, update->len);
3292 vcl->lba_offset = (__u64*)
3293 &vcl->conf.phys_refnum[mppe];
3294 ddf->conflist = vcl;
3295 }
3296 /* Now make sure vlist is correct for each dl. */
3297 for (dl = ddf->dlist; dl; dl = dl->next) {
3298 int dn;
3299 int vn = 0;
3300 for (vcl = ddf->conflist; vcl ; vcl = vcl->next)
3301 for (dn=0; dn < ddf->mppe ; dn++)
3302 if (vcl->conf.phys_refnum[dn] ==
3303 dl->disk.refnum) {
3304 dprintf("dev %d has %p at %d\n",
3305 dl->pdnum, vcl, vn);
3306 dl->vlist[vn++] = vcl;
3307 break;
3308 }
3309 while (vn < ddf->max_part)
3310 dl->vlist[vn++] = NULL;
3311 if (dl->vlist[0]) {
3312 ddf->phys->entries[dl->pdnum].type &=
3313 ~__cpu_to_be16(DDF_Global_Spare);
3314 ddf->phys->entries[dl->pdnum].type |=
3315 __cpu_to_be16(DDF_Active_in_VD);
3316 }
3317 if (dl->spare) {
3318 ddf->phys->entries[dl->pdnum].type &=
3319 ~__cpu_to_be16(DDF_Global_Spare);
3320 ddf->phys->entries[dl->pdnum].type |=
3321 __cpu_to_be16(DDF_Spare);
3322 }
3323 if (!dl->vlist[0] && !dl->spare) {
3324 ddf->phys->entries[dl->pdnum].type |=
3325 __cpu_to_be16(DDF_Global_Spare);
3326 ddf->phys->entries[dl->pdnum].type &=
3327 ~__cpu_to_be16(DDF_Spare |
3328 DDF_Active_in_VD);
3329 }
3330 }
3331 ddf->updates_pending = 1;
3332 break;
3333 case DDF_SPARE_ASSIGN_MAGIC:
3334 default: break;
3335 }
3336 }
3337
3338 static void ddf_prepare_update(struct supertype *st,
3339 struct metadata_update *update)
3340 {
3341 /* This update arrived at managemon.
3342 * We are about to pass it to monitor.
3343 * If a malloc is needed, do it here.
3344 */
3345 struct ddf_super *ddf = st->sb;
3346 __u32 *magic = (__u32*)update->buf;
3347 if (*magic == DDF_VD_CONF_MAGIC)
3348 if (posix_memalign(&update->space, 512,
3349 offsetof(struct vcl, conf)
3350 + ddf->conf_rec_len * 512) != 0)
3351 update->space = NULL;
3352 }
3353
3354 /*
3355 * Check if the array 'a' is degraded but not failed.
3356 * If it is, find as many spares as are available and needed and
3357 * arrange for their inclusion.
3358 * We only choose devices which are not already in the array,
3359 * and prefer those with a spare-assignment to this array.
3360 * otherwise we choose global spares - assuming always that
3361 * there is enough room.
3362 * For each spare that we assign, we return an 'mdinfo' which
3363 * describes the position for the device in the array.
3364 * We also add to 'updates' a DDF_VD_CONF_MAGIC update with
3365 * the new phys_refnum and lba_offset values.
3366 *
3367 * Only worry about BVDs at the moment.
3368 */
3369 static struct mdinfo *ddf_activate_spare(struct active_array *a,
3370 struct metadata_update **updates)
3371 {
3372 int working = 0;
3373 struct mdinfo *d;
3374 struct ddf_super *ddf = a->container->sb;
3375 int global_ok = 0;
3376 struct mdinfo *rv = NULL;
3377 struct mdinfo *di;
3378 struct metadata_update *mu;
3379 struct dl *dl;
3380 int i;
3381 struct vd_config *vc;
3382 __u64 *lba;
3383
3384 for (d = a->info.devs ; d ; d = d->next) {
3385 if ((d->curr_state & DS_FAULTY) &&
3386 d->state_fd >= 0)
3387 /* wait for Removal to happen */
3388 return NULL;
3389 if (d->state_fd >= 0)
3390 working ++;
3391 }
3392
3393 dprintf("ddf_activate: working=%d (%d) level=%d\n", working, a->info.array.raid_disks,
3394 a->info.array.level);
3395 if (working == a->info.array.raid_disks)
3396 return NULL; /* array not degraded */
3397 switch (a->info.array.level) {
3398 case 1:
3399 if (working == 0)
3400 return NULL; /* failed */
3401 break;
3402 case 4:
3403 case 5:
3404 if (working < a->info.array.raid_disks - 1)
3405 return NULL; /* failed */
3406 break;
3407 case 6:
3408 if (working < a->info.array.raid_disks - 2)
3409 return NULL; /* failed */
3410 break;
3411 default: /* concat or stripe */
3412 return NULL; /* failed */
3413 }
3414
3415 /* For each slot, if it is not working, find a spare */
3416 dl = ddf->dlist;
3417 for (i = 0; i < a->info.array.raid_disks; i++) {
3418 for (d = a->info.devs ; d ; d = d->next)
3419 if (d->disk.raid_disk == i)
3420 break;
3421 dprintf("found %d: %p %x\n", i, d, d?d->curr_state:0);
3422 if (d && (d->state_fd >= 0))
3423 continue;
3424
3425 /* OK, this device needs recovery. Find a spare */
3426 again:
3427 for ( ; dl ; dl = dl->next) {
3428 unsigned long long esize;
3429 unsigned long long pos;
3430 struct mdinfo *d2;
3431 int is_global = 0;
3432 int is_dedicated = 0;
3433 struct extent *ex;
3434 int j;
3435 /* If in this array, skip */
3436 for (d2 = a->info.devs ; d2 ; d2 = d2->next)
3437 if (d2->disk.major == dl->major &&
3438 d2->disk.minor == dl->minor) {
3439 dprintf("%x:%x already in array\n", dl->major, dl->minor);
3440 break;
3441 }
3442 if (d2)
3443 continue;
3444 if (ddf->phys->entries[dl->pdnum].type &
3445 __cpu_to_be16(DDF_Spare)) {
3446 /* Check spare assign record */
3447 if (dl->spare) {
3448 if (dl->spare->type & DDF_spare_dedicated) {
3449 /* check spare_ents for guid */
3450 for (j = 0 ;
3451 j < __be16_to_cpu(dl->spare->populated);
3452 j++) {
3453 if (memcmp(dl->spare->spare_ents[j].guid,
3454 ddf->virt->entries[a->info.container_member].guid,
3455 DDF_GUID_LEN) == 0)
3456 is_dedicated = 1;
3457 }
3458 } else
3459 is_global = 1;
3460 }
3461 } else if (ddf->phys->entries[dl->pdnum].type &
3462 __cpu_to_be16(DDF_Global_Spare)) {
3463 is_global = 1;
3464 }
3465 if ( ! (is_dedicated ||
3466 (is_global && global_ok))) {
3467 dprintf("%x:%x not suitable: %d %d\n", dl->major, dl->minor,
3468 is_dedicated, is_global);
3469 continue;
3470 }
3471
3472 /* We are allowed to use this device - is there space?
3473 * We need a->info.component_size sectors */
3474 ex = get_extents(ddf, dl);
3475 if (!ex) {
3476 dprintf("cannot get extents\n");
3477 continue;
3478 }
3479 j = 0; pos = 0;
3480 esize = 0;
3481
3482 do {
3483 esize = ex[j].start - pos;
3484 if (esize >= a->info.component_size)
3485 break;
3486 pos = ex[i].start + ex[i].size;
3487 i++;
3488 } while (ex[i-1].size);
3489
3490 free(ex);
3491 if (esize < a->info.component_size) {
3492 dprintf("%x:%x has no room: %llu %llu\n", dl->major, dl->minor,
3493 esize, a->info.component_size);
3494 /* No room */
3495 continue;
3496 }
3497
3498 /* Cool, we have a device with some space at pos */
3499 di = malloc(sizeof(*di));
3500 if (!di)
3501 continue;
3502 memset(di, 0, sizeof(*di));
3503 di->disk.number = i;
3504 di->disk.raid_disk = i;
3505 di->disk.major = dl->major;
3506 di->disk.minor = dl->minor;
3507 di->disk.state = 0;
3508 di->data_offset = pos;
3509 di->component_size = a->info.component_size;
3510 di->container_member = dl->pdnum;
3511 di->next = rv;
3512 rv = di;
3513 dprintf("%x:%x to be %d at %llu\n", dl->major, dl->minor,
3514 i, pos);
3515
3516 break;
3517 }
3518 if (!dl && ! global_ok) {
3519 /* not enough dedicated spares, try global */
3520 global_ok = 1;
3521 dl = ddf->dlist;
3522 goto again;
3523 }
3524 }
3525
3526 if (!rv)
3527 /* No spares found */
3528 return rv;
3529 /* Now 'rv' has a list of devices to return.
3530 * Create a metadata_update record to update the
3531 * phys_refnum and lba_offset values
3532 */
3533 mu = malloc(sizeof(*mu));
3534 if (mu && posix_memalign(&mu->space, 512, sizeof(struct vcl)) != 0) {
3535 free(mu);
3536 mu = NULL;
3537 }
3538 if (!mu) {
3539 while (rv) {
3540 struct mdinfo *n = rv->next;
3541
3542 free(rv);
3543 rv = n;
3544 }
3545 return NULL;
3546 }
3547
3548 mu->buf = malloc(ddf->conf_rec_len * 512);
3549 mu->len = ddf->conf_rec_len;
3550 mu->next = *updates;
3551 vc = find_vdcr(ddf, a->info.container_member);
3552 memcpy(mu->buf, vc, ddf->conf_rec_len * 512);
3553
3554 vc = (struct vd_config*)mu->buf;
3555 lba = (__u64*)&vc->phys_refnum[ddf->mppe];
3556 for (di = rv ; di ; di = di->next) {
3557 vc->phys_refnum[di->disk.raid_disk] =
3558 ddf->phys->entries[dl->pdnum].refnum;
3559 lba[di->disk.raid_disk] = di->data_offset;
3560 }
3561 *updates = mu;
3562 return rv;
3563 }
3564 #endif /* MDASSEMBLE */
3565
3566 static int ddf_level_to_layout(int level)
3567 {
3568 switch(level) {
3569 case 0:
3570 case 1:
3571 return 0;
3572 case 5:
3573 return ALGORITHM_LEFT_SYMMETRIC;
3574 case 6:
3575 return ALGORITHM_ROTATING_N_CONTINUE;
3576 case 10:
3577 return 0x102;
3578 default:
3579 return UnSet;
3580 }
3581 }
3582
3583 struct superswitch super_ddf = {
3584 #ifndef MDASSEMBLE
3585 .examine_super = examine_super_ddf,
3586 .brief_examine_super = brief_examine_super_ddf,
3587 .export_examine_super = export_examine_super_ddf,
3588 .detail_super = detail_super_ddf,
3589 .brief_detail_super = brief_detail_super_ddf,
3590 .validate_geometry = validate_geometry_ddf,
3591 .write_init_super = write_init_super_ddf,
3592 .add_to_super = add_to_super_ddf,
3593 #endif
3594 .match_home = match_home_ddf,
3595 .uuid_from_super= uuid_from_super_ddf,
3596 .getinfo_super = getinfo_super_ddf,
3597 .update_super = update_super_ddf,
3598
3599 .avail_size = avail_size_ddf,
3600
3601 .compare_super = compare_super_ddf,
3602
3603 .load_super = load_super_ddf,
3604 .init_super = init_super_ddf,
3605 .store_super = store_zero_ddf,
3606 .free_super = free_super_ddf,
3607 .match_metadata_desc = match_metadata_desc_ddf,
3608 .container_content = container_content_ddf,
3609 .default_layout = ddf_level_to_layout,
3610
3611 .external = 1,
3612
3613 #ifndef MDASSEMBLE
3614 /* for mdmon */
3615 .open_new = ddf_open_new,
3616 .set_array_state= ddf_set_array_state,
3617 .set_disk = ddf_set_disk,
3618 .sync_metadata = ddf_sync_metadata,
3619 .process_update = ddf_process_update,
3620 .prepare_update = ddf_prepare_update,
3621 .activate_spare = ddf_activate_spare,
3622 #endif
3623 .name = "ddf",
3624 };