]> git.ipfire.org Git - thirdparty/mdadm.git/blob - super-ddf.c
Check all member devices in enough_fd
[thirdparty/mdadm.git] / super-ddf.c
1 /*
2 * mdadm - manage Linux "md" devices aka RAID arrays.
3 *
4 * Copyright (C) 2006-2009 Neil Brown <neilb@suse.de>
5 *
6 *
7 * This program is free software; you can redistribute it and/or modify
8 * it under the terms of the GNU General Public License as published by
9 * the Free Software Foundation; either version 2 of the License, or
10 * (at your option) any later version.
11 *
12 * This program is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 * GNU General Public License for more details.
16 *
17 * You should have received a copy of the GNU General Public License
18 * along with this program; if not, write to the Free Software
19 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
20 *
21 * Author: Neil Brown
22 * Email: <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 unsigned 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 unsigned 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 unsigned 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 ((unsigned long long)lseek64(fd, offset<<9, 0) != (offset<<9)) {
526 if (dofree)
527 free(buf);
528 return NULL;
529 }
530 if ((unsigned long long)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 unsigned int i;
646 unsigned int confsec;
647 int vnum;
648 unsigned int max_virt_disks = __be16_to_cpu(super->active->max_vd_entries);
649 unsigned long long dsize;
650
651 /* First the local disk info */
652 if (posix_memalign((void**)&dl, 512,
653 sizeof(*dl) +
654 (super->max_part) * sizeof(dl->vlist[0])) != 0) {
655 fprintf(stderr, Name ": %s could not allocate disk info buffer\n",
656 __func__);
657 return 1;
658 }
659
660 load_section(fd, super, &dl->disk,
661 super->active->data_section_offset,
662 super->active->data_section_length,
663 0);
664 dl->devname = devname ? strdup(devname) : NULL;
665
666 fstat(fd, &stb);
667 dl->major = major(stb.st_rdev);
668 dl->minor = minor(stb.st_rdev);
669 dl->next = super->dlist;
670 dl->fd = keep ? fd : -1;
671
672 dl->size = 0;
673 if (get_dev_size(fd, devname, &dsize))
674 dl->size = dsize >> 9;
675 dl->spare = NULL;
676 for (i = 0 ; i < super->max_part ; i++)
677 dl->vlist[i] = NULL;
678 super->dlist = dl;
679 dl->pdnum = -1;
680 for (i = 0; i < __be16_to_cpu(super->active->max_pd_entries); i++)
681 if (memcmp(super->phys->entries[i].guid,
682 dl->disk.guid, DDF_GUID_LEN) == 0)
683 dl->pdnum = i;
684
685 /* Now the config list. */
686 /* 'conf' is an array of config entries, some of which are
687 * probably invalid. Those which are good need to be copied into
688 * the conflist
689 */
690
691 conf = load_section(fd, super, NULL,
692 super->active->config_section_offset,
693 super->active->config_section_length,
694 0);
695
696 vnum = 0;
697 for (confsec = 0;
698 confsec < __be32_to_cpu(super->active->config_section_length);
699 confsec += super->conf_rec_len) {
700 struct vd_config *vd =
701 (struct vd_config *)((char*)conf + confsec*512);
702 struct vcl *vcl;
703
704 if (vd->magic == DDF_SPARE_ASSIGN_MAGIC) {
705 if (dl->spare)
706 continue;
707 if (posix_memalign((void**)&dl->spare, 512,
708 super->conf_rec_len*512) != 0) {
709 fprintf(stderr, Name
710 ": %s could not allocate spare info buf\n",
711 __func__);
712 return 1;
713 }
714
715 memcpy(dl->spare, vd, super->conf_rec_len*512);
716 continue;
717 }
718 if (vd->magic != DDF_VD_CONF_MAGIC)
719 continue;
720 for (vcl = super->conflist; vcl; vcl = vcl->next) {
721 if (memcmp(vcl->conf.guid,
722 vd->guid, DDF_GUID_LEN) == 0)
723 break;
724 }
725
726 if (vcl) {
727 dl->vlist[vnum++] = vcl;
728 if (__be32_to_cpu(vd->seqnum) <=
729 __be32_to_cpu(vcl->conf.seqnum))
730 continue;
731 } else {
732 if (posix_memalign((void**)&vcl, 512,
733 (super->conf_rec_len*512 +
734 offsetof(struct vcl, conf))) != 0) {
735 fprintf(stderr, Name
736 ": %s could not allocate vcl buf\n",
737 __func__);
738 return 1;
739 }
740 vcl->next = super->conflist;
741 vcl->block_sizes = NULL; /* FIXME not for CONCAT */
742 super->conflist = vcl;
743 dl->vlist[vnum++] = vcl;
744 }
745 memcpy(&vcl->conf, vd, super->conf_rec_len*512);
746 vcl->lba_offset = (__u64*)
747 &vcl->conf.phys_refnum[super->mppe];
748
749 for (i=0; i < max_virt_disks ; i++)
750 if (memcmp(super->virt->entries[i].guid,
751 vcl->conf.guid, DDF_GUID_LEN)==0)
752 break;
753 if (i < max_virt_disks)
754 vcl->vcnum = i;
755 }
756 free(conf);
757
758 return 0;
759 }
760
761 #ifndef MDASSEMBLE
762 static int load_super_ddf_all(struct supertype *st, int fd,
763 void **sbp, char *devname);
764 #endif
765
766 static void free_super_ddf(struct supertype *st);
767
768 static int load_super_ddf(struct supertype *st, int fd,
769 char *devname)
770 {
771 unsigned long long dsize;
772 struct ddf_super *super;
773 int rv;
774
775 if (get_dev_size(fd, devname, &dsize) == 0)
776 return 1;
777
778 if (test_partition(fd))
779 /* DDF is not allowed on partitions */
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 if (dsize & 511) {
792 if (devname)
793 fprintf(stderr,
794 Name ": %s is an odd size for ddf: "
795 "size is %llu bytes.\n",
796 devname, dsize);
797 return 1;
798 }
799
800 free_super_ddf(st);
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 return 0;
848
849 }
850
851 static void free_super_ddf(struct supertype *st)
852 {
853 struct ddf_super *ddf = st->sb;
854 if (ddf == NULL)
855 return;
856 free(ddf->phys);
857 free(ddf->virt);
858 while (ddf->conflist) {
859 struct vcl *v = ddf->conflist;
860 ddf->conflist = v->next;
861 if (v->block_sizes)
862 free(v->block_sizes);
863 free(v);
864 }
865 while (ddf->dlist) {
866 struct dl *d = ddf->dlist;
867 ddf->dlist = d->next;
868 if (d->fd >= 0)
869 close(d->fd);
870 if (d->spare)
871 free(d->spare);
872 free(d);
873 }
874 while (ddf->add_list) {
875 struct dl *d = ddf->add_list;
876 ddf->add_list = d->next;
877 if (d->fd >= 0)
878 close(d->fd);
879 if (d->spare)
880 free(d->spare);
881 free(d);
882 }
883 free(ddf);
884 st->sb = NULL;
885 }
886
887 static struct supertype *match_metadata_desc_ddf(char *arg)
888 {
889 /* 'ddf' only support containers */
890 struct supertype *st;
891 if (strcmp(arg, "ddf") != 0 &&
892 strcmp(arg, "default") != 0
893 )
894 return NULL;
895
896 st = malloc(sizeof(*st));
897 memset(st, 0, sizeof(*st));
898 st->container_dev = NoMdDev;
899 st->ss = &super_ddf;
900 st->max_devs = 512;
901 st->minor_version = 0;
902 st->sb = NULL;
903 return st;
904 }
905
906
907 #ifndef MDASSEMBLE
908
909 static mapping_t ddf_state[] = {
910 { "Optimal", 0},
911 { "Degraded", 1},
912 { "Deleted", 2},
913 { "Missing", 3},
914 { "Failed", 4},
915 { "Partially Optimal", 5},
916 { "-reserved-", 6},
917 { "-reserved-", 7},
918 { NULL, 0}
919 };
920
921 static mapping_t ddf_init_state[] = {
922 { "Not Initialised", 0},
923 { "QuickInit in Progress", 1},
924 { "Fully Initialised", 2},
925 { "*UNKNOWN*", 3},
926 { NULL, 0}
927 };
928 static mapping_t ddf_access[] = {
929 { "Read/Write", 0},
930 { "Reserved", 1},
931 { "Read Only", 2},
932 { "Blocked (no access)", 3},
933 { NULL ,0}
934 };
935
936 static mapping_t ddf_level[] = {
937 { "RAID0", DDF_RAID0},
938 { "RAID1", DDF_RAID1},
939 { "RAID3", DDF_RAID3},
940 { "RAID4", DDF_RAID4},
941 { "RAID5", DDF_RAID5},
942 { "RAID1E",DDF_RAID1E},
943 { "JBOD", DDF_JBOD},
944 { "CONCAT",DDF_CONCAT},
945 { "RAID5E",DDF_RAID5E},
946 { "RAID5EE",DDF_RAID5EE},
947 { "RAID6", DDF_RAID6},
948 { NULL, 0}
949 };
950 static mapping_t ddf_sec_level[] = {
951 { "Striped", DDF_2STRIPED},
952 { "Mirrored", DDF_2MIRRORED},
953 { "Concat", DDF_2CONCAT},
954 { "Spanned", DDF_2SPANNED},
955 { NULL, 0}
956 };
957 #endif
958
959 struct num_mapping {
960 int num1, num2;
961 };
962 static struct num_mapping ddf_level_num[] = {
963 { DDF_RAID0, 0 },
964 { DDF_RAID1, 1 },
965 { DDF_RAID3, LEVEL_UNSUPPORTED },
966 { DDF_RAID4, 4 },
967 { DDF_RAID5, 5 },
968 { DDF_RAID1E, LEVEL_UNSUPPORTED },
969 { DDF_JBOD, LEVEL_UNSUPPORTED },
970 { DDF_CONCAT, LEVEL_LINEAR },
971 { DDF_RAID5E, LEVEL_UNSUPPORTED },
972 { DDF_RAID5EE, LEVEL_UNSUPPORTED },
973 { DDF_RAID6, 6},
974 { MAXINT, MAXINT }
975 };
976
977 static int map_num1(struct num_mapping *map, int num)
978 {
979 int i;
980 for (i=0 ; map[i].num1 != MAXINT; i++)
981 if (map[i].num1 == num)
982 break;
983 return map[i].num2;
984 }
985
986 static int all_ff(char *guid)
987 {
988 int i;
989 for (i = 0; i < DDF_GUID_LEN; i++)
990 if (guid[i] != (char)0xff)
991 return 0;
992 return 1;
993 }
994
995 #ifndef MDASSEMBLE
996 static void print_guid(char *guid, int tstamp)
997 {
998 /* A GUIDs are part (or all) ASCII and part binary.
999 * They tend to be space padded.
1000 * We print the GUID in HEX, then in parentheses add
1001 * any initial ASCII sequence, and a possible
1002 * time stamp from bytes 16-19
1003 */
1004 int l = DDF_GUID_LEN;
1005 int i;
1006
1007 for (i=0 ; i<DDF_GUID_LEN ; i++) {
1008 if ((i&3)==0 && i != 0) printf(":");
1009 printf("%02X", guid[i]&255);
1010 }
1011
1012 printf("\n (");
1013 while (l && guid[l-1] == ' ')
1014 l--;
1015 for (i=0 ; i<l ; i++) {
1016 if (guid[i] >= 0x20 && guid[i] < 0x7f)
1017 fputc(guid[i], stdout);
1018 else
1019 break;
1020 }
1021 if (tstamp) {
1022 time_t then = __be32_to_cpu(*(__u32*)(guid+16)) + DECADE;
1023 char tbuf[100];
1024 struct tm *tm;
1025 tm = localtime(&then);
1026 strftime(tbuf, 100, " %D %T",tm);
1027 fputs(tbuf, stdout);
1028 }
1029 printf(")");
1030 }
1031
1032 static void examine_vd(int n, struct ddf_super *sb, char *guid)
1033 {
1034 int crl = sb->conf_rec_len;
1035 struct vcl *vcl;
1036
1037 for (vcl = sb->conflist ; vcl ; vcl = vcl->next) {
1038 unsigned int i;
1039 struct vd_config *vc = &vcl->conf;
1040
1041 if (calc_crc(vc, crl*512) != vc->crc)
1042 continue;
1043 if (memcmp(vc->guid, guid, DDF_GUID_LEN) != 0)
1044 continue;
1045
1046 /* Ok, we know about this VD, let's give more details */
1047 printf(" Raid Devices[%d] : %d (", n,
1048 __be16_to_cpu(vc->prim_elmnt_count));
1049 for (i = 0; i < __be16_to_cpu(vc->prim_elmnt_count); i++) {
1050 int j;
1051 int cnt = __be16_to_cpu(sb->phys->used_pdes);
1052 for (j=0; j<cnt; j++)
1053 if (vc->phys_refnum[i] == sb->phys->entries[j].refnum)
1054 break;
1055 if (i) printf(" ");
1056 if (j < cnt)
1057 printf("%d", j);
1058 else
1059 printf("--");
1060 }
1061 printf(")\n");
1062 if (vc->chunk_shift != 255)
1063 printf(" Chunk Size[%d] : %d sectors\n", n,
1064 1 << vc->chunk_shift);
1065 printf(" Raid Level[%d] : %s\n", n,
1066 map_num(ddf_level, vc->prl)?:"-unknown-");
1067 if (vc->sec_elmnt_count != 1) {
1068 printf(" Secondary Position[%d] : %d of %d\n", n,
1069 vc->sec_elmnt_seq, vc->sec_elmnt_count);
1070 printf(" Secondary Level[%d] : %s\n", n,
1071 map_num(ddf_sec_level, vc->srl) ?: "-unknown-");
1072 }
1073 printf(" Device Size[%d] : %llu\n", n,
1074 (unsigned long long)__be64_to_cpu(vc->blocks)/2);
1075 printf(" Array Size[%d] : %llu\n", n,
1076 (unsigned long long)__be64_to_cpu(vc->array_blocks)/2);
1077 }
1078 }
1079
1080 static void examine_vds(struct ddf_super *sb)
1081 {
1082 int cnt = __be16_to_cpu(sb->virt->populated_vdes);
1083 int i;
1084 printf(" Virtual Disks : %d\n", cnt);
1085
1086 for (i=0; i<cnt; i++) {
1087 struct virtual_entry *ve = &sb->virt->entries[i];
1088 printf("\n");
1089 printf(" VD GUID[%d] : ", i); print_guid(ve->guid, 1);
1090 printf("\n");
1091 printf(" unit[%d] : %d\n", i, __be16_to_cpu(ve->unit));
1092 printf(" state[%d] : %s, %s%s\n", i,
1093 map_num(ddf_state, ve->state & 7),
1094 (ve->state & 8) ? "Morphing, ": "",
1095 (ve->state & 16)? "Not Consistent" : "Consistent");
1096 printf(" init state[%d] : %s\n", i,
1097 map_num(ddf_init_state, ve->init_state&3));
1098 printf(" access[%d] : %s\n", i,
1099 map_num(ddf_access, (ve->init_state>>6) & 3));
1100 printf(" Name[%d] : %.16s\n", i, ve->name);
1101 examine_vd(i, sb, ve->guid);
1102 }
1103 if (cnt) printf("\n");
1104 }
1105
1106 static void examine_pds(struct ddf_super *sb)
1107 {
1108 int cnt = __be16_to_cpu(sb->phys->used_pdes);
1109 int i;
1110 struct dl *dl;
1111 printf(" Physical Disks : %d\n", cnt);
1112 printf(" Number RefNo Size Device Type/State\n");
1113
1114 for (i=0 ; i<cnt ; i++) {
1115 struct phys_disk_entry *pd = &sb->phys->entries[i];
1116 int type = __be16_to_cpu(pd->type);
1117 int state = __be16_to_cpu(pd->state);
1118
1119 //printf(" PD GUID[%d] : ", i); print_guid(pd->guid, 0);
1120 //printf("\n");
1121 printf(" %3d %08x ", i,
1122 __be32_to_cpu(pd->refnum));
1123 printf("%8lluK ",
1124 (unsigned long long)__be64_to_cpu(pd->config_size)>>1);
1125 for (dl = sb->dlist; dl ; dl = dl->next) {
1126 if (dl->disk.refnum == pd->refnum) {
1127 char *dv = map_dev(dl->major, dl->minor, 0);
1128 if (dv) {
1129 printf("%-15s", dv);
1130 break;
1131 }
1132 }
1133 }
1134 if (!dl)
1135 printf("%15s","");
1136 printf(" %s%s%s%s%s",
1137 (type&2) ? "active":"",
1138 (type&4) ? "Global-Spare":"",
1139 (type&8) ? "spare" : "",
1140 (type&16)? ", foreign" : "",
1141 (type&32)? "pass-through" : "");
1142 if (state & DDF_Failed)
1143 /* This over-rides these three */
1144 state &= ~(DDF_Online|DDF_Rebuilding|DDF_Transition);
1145 printf("/%s%s%s%s%s%s%s",
1146 (state&1)? "Online": "Offline",
1147 (state&2)? ", Failed": "",
1148 (state&4)? ", Rebuilding": "",
1149 (state&8)? ", in-transition": "",
1150 (state&16)? ", SMART-errors": "",
1151 (state&32)? ", Unrecovered-Read-Errors": "",
1152 (state&64)? ", Missing" : "");
1153 printf("\n");
1154 }
1155 }
1156
1157 static void examine_super_ddf(struct supertype *st, char *homehost)
1158 {
1159 struct ddf_super *sb = st->sb;
1160
1161 printf(" Magic : %08x\n", __be32_to_cpu(sb->anchor.magic));
1162 printf(" Version : %.8s\n", sb->anchor.revision);
1163 printf("Controller GUID : "); print_guid(sb->controller.guid, 0);
1164 printf("\n");
1165 printf(" Container GUID : "); print_guid(sb->anchor.guid, 1);
1166 printf("\n");
1167 printf(" Seq : %08x\n", __be32_to_cpu(sb->active->seq));
1168 printf(" Redundant hdr : %s\n", sb->secondary.magic == DDF_HEADER_MAGIC
1169 ?"yes" : "no");
1170 examine_vds(sb);
1171 examine_pds(sb);
1172 }
1173
1174 static void getinfo_super_ddf(struct supertype *st, struct mdinfo *info, char *map);
1175
1176 static void uuid_from_super_ddf(struct supertype *st, int uuid[4]);
1177
1178 static void brief_examine_super_ddf(struct supertype *st, int verbose)
1179 {
1180 /* We just write a generic DDF ARRAY entry
1181 */
1182 struct mdinfo info;
1183 char nbuf[64];
1184 getinfo_super_ddf(st, &info, NULL);
1185 fname_from_uuid(st, &info, nbuf, ':');
1186
1187 printf("ARRAY metadata=ddf UUID=%s\n", nbuf + 5);
1188 }
1189
1190 static void brief_examine_subarrays_ddf(struct supertype *st, int verbose)
1191 {
1192 /* We just write a generic DDF ARRAY entry
1193 */
1194 struct ddf_super *ddf = st->sb;
1195 struct mdinfo info;
1196 unsigned int i;
1197 char nbuf[64];
1198 getinfo_super_ddf(st, &info, NULL);
1199 fname_from_uuid(st, &info, nbuf, ':');
1200
1201 for (i = 0; i < __be16_to_cpu(ddf->virt->max_vdes); i++) {
1202 struct virtual_entry *ve = &ddf->virt->entries[i];
1203 struct vcl vcl;
1204 char nbuf1[64];
1205 if (all_ff(ve->guid))
1206 continue;
1207 memcpy(vcl.conf.guid, ve->guid, DDF_GUID_LEN);
1208 ddf->currentconf =&vcl;
1209 uuid_from_super_ddf(st, info.uuid);
1210 fname_from_uuid(st, &info, nbuf1, ':');
1211 printf("ARRAY container=%s member=%d UUID=%s\n",
1212 nbuf+5, i, nbuf1+5);
1213 }
1214 }
1215
1216 static void export_examine_super_ddf(struct supertype *st)
1217 {
1218 struct mdinfo info;
1219 char nbuf[64];
1220 getinfo_super_ddf(st, &info, NULL);
1221 fname_from_uuid(st, &info, nbuf, ':');
1222 printf("MD_METADATA=ddf\n");
1223 printf("MD_LEVEL=container\n");
1224 printf("MD_UUID=%s\n", nbuf+5);
1225 }
1226
1227
1228 static void detail_super_ddf(struct supertype *st, char *homehost)
1229 {
1230 /* FIXME later
1231 * Could print DDF GUID
1232 * Need to find which array
1233 * If whole, briefly list all arrays
1234 * If one, give name
1235 */
1236 }
1237
1238 static void brief_detail_super_ddf(struct supertype *st)
1239 {
1240 /* FIXME I really need to know which array we are detailing.
1241 * Can that be stored in ddf_super??
1242 */
1243 // struct ddf_super *ddf = st->sb;
1244 struct mdinfo info;
1245 char nbuf[64];
1246 getinfo_super_ddf(st, &info, NULL);
1247 fname_from_uuid(st, &info, nbuf,':');
1248 printf(" UUID=%s", nbuf + 5);
1249 }
1250 #endif
1251
1252 static int match_home_ddf(struct supertype *st, char *homehost)
1253 {
1254 /* It matches 'this' host if the controller is a
1255 * Linux-MD controller with vendor_data matching
1256 * the hostname
1257 */
1258 struct ddf_super *ddf = st->sb;
1259 unsigned int len;
1260
1261 if (!homehost)
1262 return 0;
1263 len = strlen(homehost);
1264
1265 return (memcmp(ddf->controller.guid, T10, 8) == 0 &&
1266 len < sizeof(ddf->controller.vendor_data) &&
1267 memcmp(ddf->controller.vendor_data, homehost,len) == 0 &&
1268 ddf->controller.vendor_data[len] == 0);
1269 }
1270
1271 #ifndef MDASSEMBLE
1272 static struct vd_config *find_vdcr(struct ddf_super *ddf, unsigned int inst)
1273 {
1274 struct vcl *v;
1275
1276 for (v = ddf->conflist; v; v = v->next)
1277 if (inst == v->vcnum)
1278 return &v->conf;
1279 return NULL;
1280 }
1281 #endif
1282
1283 static int find_phys(struct ddf_super *ddf, __u32 phys_refnum)
1284 {
1285 /* Find the entry in phys_disk which has the given refnum
1286 * and return it's index
1287 */
1288 unsigned int i;
1289 for (i = 0; i < __be16_to_cpu(ddf->phys->max_pdes); i++)
1290 if (ddf->phys->entries[i].refnum == phys_refnum)
1291 return i;
1292 return -1;
1293 }
1294
1295 static void uuid_from_super_ddf(struct supertype *st, int uuid[4])
1296 {
1297 /* The uuid returned here is used for:
1298 * uuid to put into bitmap file (Create, Grow)
1299 * uuid for backup header when saving critical section (Grow)
1300 * comparing uuids when re-adding a device into an array
1301 * In these cases the uuid required is that of the data-array,
1302 * not the device-set.
1303 * uuid to recognise same set when adding a missing device back
1304 * to an array. This is a uuid for the device-set.
1305 *
1306 * For each of these we can make do with a truncated
1307 * or hashed uuid rather than the original, as long as
1308 * everyone agrees.
1309 * In the case of SVD we assume the BVD is of interest,
1310 * though that might be the case if a bitmap were made for
1311 * a mirrored SVD - worry about that later.
1312 * So we need to find the VD configuration record for the
1313 * relevant BVD and extract the GUID and Secondary_Element_Seq.
1314 * The first 16 bytes of the sha1 of these is used.
1315 */
1316 struct ddf_super *ddf = st->sb;
1317 struct vcl *vcl = ddf->currentconf;
1318 char *guid;
1319 char buf[20];
1320 struct sha1_ctx ctx;
1321
1322 if (vcl)
1323 guid = vcl->conf.guid;
1324 else
1325 guid = ddf->anchor.guid;
1326
1327 sha1_init_ctx(&ctx);
1328 sha1_process_bytes(guid, DDF_GUID_LEN, &ctx);
1329 sha1_finish_ctx(&ctx, buf);
1330 memcpy(uuid, buf, 4*4);
1331 }
1332
1333 static void getinfo_super_ddf_bvd(struct supertype *st, struct mdinfo *info, char *map);
1334
1335 static void getinfo_super_ddf(struct supertype *st, struct mdinfo *info, char *map)
1336 {
1337 struct ddf_super *ddf = st->sb;
1338 int map_disks = info->array.raid_disks;
1339
1340 if (ddf->currentconf) {
1341 getinfo_super_ddf_bvd(st, info, map);
1342 return;
1343 }
1344
1345 info->array.raid_disks = __be16_to_cpu(ddf->phys->used_pdes);
1346 info->array.level = LEVEL_CONTAINER;
1347 info->array.layout = 0;
1348 info->array.md_minor = -1;
1349 info->array.ctime = DECADE + __be32_to_cpu(*(__u32*)
1350 (ddf->anchor.guid+16));
1351 info->array.utime = 0;
1352 info->array.chunk_size = 0;
1353 info->container_enough = 1;
1354
1355
1356 info->disk.major = 0;
1357 info->disk.minor = 0;
1358 if (ddf->dlist) {
1359 info->disk.number = __be32_to_cpu(ddf->dlist->disk.refnum);
1360 info->disk.raid_disk = find_phys(ddf, ddf->dlist->disk.refnum);
1361
1362 info->data_offset = __be64_to_cpu(ddf->phys->
1363 entries[info->disk.raid_disk].
1364 config_size);
1365 info->component_size = ddf->dlist->size - info->data_offset;
1366 } else {
1367 info->disk.number = -1;
1368 info->disk.raid_disk = -1;
1369 // info->disk.raid_disk = find refnum in the table and use index;
1370 }
1371 info->disk.state = (1 << MD_DISK_SYNC) | (1 << MD_DISK_ACTIVE);
1372
1373
1374 info->recovery_start = MaxSector;
1375 info->reshape_active = 0;
1376 info->name[0] = 0;
1377
1378 info->array.major_version = -1;
1379 info->array.minor_version = -2;
1380 strcpy(info->text_version, "ddf");
1381 info->safe_mode_delay = 0;
1382
1383 uuid_from_super_ddf(st, info->uuid);
1384
1385 if (map) {
1386 int i;
1387 for (i = 0 ; i < map_disks; i++) {
1388 if (i < info->array.raid_disks &&
1389 (__be16_to_cpu(ddf->phys->entries[i].state) & DDF_Online) &&
1390 !(__be16_to_cpu(ddf->phys->entries[i].state) & DDF_Failed))
1391 map[i] = 1;
1392 else
1393 map[i] = 0;
1394 }
1395 }
1396 }
1397
1398 static int rlq_to_layout(int rlq, int prl, int raiddisks);
1399
1400 static void getinfo_super_ddf_bvd(struct supertype *st, struct mdinfo *info, char *map)
1401 {
1402 struct ddf_super *ddf = st->sb;
1403 struct vcl *vc = ddf->currentconf;
1404 int cd = ddf->currentdev;
1405 int j;
1406 struct dl *dl;
1407 int map_disks = info->array.raid_disks;
1408
1409 /* FIXME this returns BVD info - what if we want SVD ?? */
1410
1411 info->array.raid_disks = __be16_to_cpu(vc->conf.prim_elmnt_count);
1412 info->array.level = map_num1(ddf_level_num, vc->conf.prl);
1413 info->array.layout = rlq_to_layout(vc->conf.rlq, vc->conf.prl,
1414 info->array.raid_disks);
1415 info->array.md_minor = -1;
1416 info->array.ctime = DECADE +
1417 __be32_to_cpu(*(__u32*)(vc->conf.guid+16));
1418 info->array.utime = DECADE + __be32_to_cpu(vc->conf.timestamp);
1419 info->array.chunk_size = 512 << vc->conf.chunk_shift;
1420 info->custom_array_size = 0;
1421
1422 if (cd >= 0 && (unsigned)cd < ddf->mppe) {
1423 info->data_offset = __be64_to_cpu(vc->lba_offset[cd]);
1424 if (vc->block_sizes)
1425 info->component_size = vc->block_sizes[cd];
1426 else
1427 info->component_size = __be64_to_cpu(vc->conf.blocks);
1428 }
1429
1430 for (dl = ddf->dlist; dl ; dl = dl->next)
1431 if (dl->raiddisk == info->disk.raid_disk)
1432 break;
1433 info->disk.major = 0;
1434 info->disk.minor = 0;
1435 if (dl) {
1436 info->disk.major = dl->major;
1437 info->disk.minor = dl->minor;
1438 }
1439 // info->disk.number = __be32_to_cpu(ddf->disk.refnum);
1440 // info->disk.raid_disk = find refnum in the table and use index;
1441 // info->disk.state = ???;
1442
1443 info->container_member = ddf->currentconf->vcnum;
1444
1445 info->recovery_start = MaxSector;
1446 info->resync_start = 0;
1447 info->reshape_active = 0;
1448 if (!(ddf->virt->entries[info->container_member].state
1449 & DDF_state_inconsistent) &&
1450 (ddf->virt->entries[info->container_member].init_state
1451 & DDF_initstate_mask)
1452 == DDF_init_full)
1453 info->resync_start = MaxSector;
1454
1455 uuid_from_super_ddf(st, info->uuid);
1456
1457 info->array.major_version = -1;
1458 info->array.minor_version = -2;
1459 sprintf(info->text_version, "/%s/%d",
1460 devnum2devname(st->container_dev),
1461 info->container_member);
1462 info->safe_mode_delay = 200;
1463
1464 memcpy(info->name, ddf->virt->entries[info->container_member].name, 16);
1465 info->name[16]=0;
1466 for(j=0; j<16; j++)
1467 if (info->name[j] == ' ')
1468 info->name[j] = 0;
1469
1470 if (map)
1471 for (j = 0; j < map_disks; j++) {
1472 map[j] = 0;
1473 if (j < info->array.raid_disks) {
1474 int i = find_phys(ddf, vc->conf.phys_refnum[j]);
1475 if (i >= 0 &&
1476 (__be16_to_cpu(ddf->phys->entries[i].state) & DDF_Online) &&
1477 !(__be16_to_cpu(ddf->phys->entries[i].state) & DDF_Failed))
1478 map[i] = 1;
1479 }
1480 }
1481 }
1482
1483
1484 static int update_super_ddf(struct supertype *st, struct mdinfo *info,
1485 char *update,
1486 char *devname, int verbose,
1487 int uuid_set, char *homehost)
1488 {
1489 /* For 'assemble' and 'force' we need to return non-zero if any
1490 * change was made. For others, the return value is ignored.
1491 * Update options are:
1492 * force-one : This device looks a bit old but needs to be included,
1493 * update age info appropriately.
1494 * assemble: clear any 'faulty' flag to allow this device to
1495 * be assembled.
1496 * force-array: Array is degraded but being forced, mark it clean
1497 * if that will be needed to assemble it.
1498 *
1499 * newdev: not used ????
1500 * grow: Array has gained a new device - this is currently for
1501 * linear only
1502 * resync: mark as dirty so a resync will happen.
1503 * uuid: Change the uuid of the array to match what is given
1504 * homehost: update the recorded homehost
1505 * name: update the name - preserving the homehost
1506 * _reshape_progress: record new reshape_progress position.
1507 *
1508 * Following are not relevant for this version:
1509 * sparc2.2 : update from old dodgey metadata
1510 * super-minor: change the preferred_minor number
1511 * summaries: update redundant counters.
1512 */
1513 int rv = 0;
1514 // struct ddf_super *ddf = st->sb;
1515 // struct vd_config *vd = find_vdcr(ddf, info->container_member);
1516 // struct virtual_entry *ve = find_ve(ddf);
1517
1518 /* we don't need to handle "force-*" or "assemble" as
1519 * there is no need to 'trick' the kernel. We the metadata is
1520 * first updated to activate the array, all the implied modifications
1521 * will just happen.
1522 */
1523
1524 if (strcmp(update, "grow") == 0) {
1525 /* FIXME */
1526 } else if (strcmp(update, "resync") == 0) {
1527 // info->resync_checkpoint = 0;
1528 } else if (strcmp(update, "homehost") == 0) {
1529 /* homehost is stored in controller->vendor_data,
1530 * or it is when we are the vendor
1531 */
1532 // if (info->vendor_is_local)
1533 // strcpy(ddf->controller.vendor_data, homehost);
1534 rv = -1;
1535 } else if (strcmp(update, "name") == 0) {
1536 /* name is stored in virtual_entry->name */
1537 // memset(ve->name, ' ', 16);
1538 // strncpy(ve->name, info->name, 16);
1539 rv = -1;
1540 } else if (strcmp(update, "_reshape_progress") == 0) {
1541 /* We don't support reshape yet */
1542 } else if (strcmp(update, "assemble") == 0 ) {
1543 /* Do nothing, just succeed */
1544 rv = 0;
1545 } else
1546 rv = -1;
1547
1548 // update_all_csum(ddf);
1549
1550 return rv;
1551 }
1552
1553 static void make_header_guid(char *guid)
1554 {
1555 __u32 stamp;
1556 /* Create a DDF Header of Virtual Disk GUID */
1557
1558 /* 24 bytes of fiction required.
1559 * first 8 are a 'vendor-id' - "Linux-MD"
1560 * next 8 are controller type.. how about 0X DEAD BEEF 0000 0000
1561 * Remaining 8 random number plus timestamp
1562 */
1563 memcpy(guid, T10, sizeof(T10));
1564 stamp = __cpu_to_be32(0xdeadbeef);
1565 memcpy(guid+8, &stamp, 4);
1566 stamp = __cpu_to_be32(0);
1567 memcpy(guid+12, &stamp, 4);
1568 stamp = __cpu_to_be32(time(0) - DECADE);
1569 memcpy(guid+16, &stamp, 4);
1570 stamp = random32();
1571 memcpy(guid+20, &stamp, 4);
1572 }
1573
1574 static int init_super_ddf_bvd(struct supertype *st,
1575 mdu_array_info_t *info,
1576 unsigned long long size,
1577 char *name, char *homehost,
1578 int *uuid);
1579
1580 static int init_super_ddf(struct supertype *st,
1581 mdu_array_info_t *info,
1582 unsigned long long size, char *name, char *homehost,
1583 int *uuid)
1584 {
1585 /* This is primarily called by Create when creating a new array.
1586 * We will then get add_to_super called for each component, and then
1587 * write_init_super called to write it out to each device.
1588 * For DDF, Create can create on fresh devices or on a pre-existing
1589 * array.
1590 * To create on a pre-existing array a different method will be called.
1591 * This one is just for fresh drives.
1592 *
1593 * We need to create the entire 'ddf' structure which includes:
1594 * DDF headers - these are easy.
1595 * Controller data - a Sector describing this controller .. not that
1596 * this is a controller exactly.
1597 * Physical Disk Record - one entry per device, so
1598 * leave plenty of space.
1599 * Virtual Disk Records - again, just leave plenty of space.
1600 * This just lists VDs, doesn't give details
1601 * Config records - describes the VDs that use this disk
1602 * DiskData - describes 'this' device.
1603 * BadBlockManagement - empty
1604 * Diag Space - empty
1605 * Vendor Logs - Could we put bitmaps here?
1606 *
1607 */
1608 struct ddf_super *ddf;
1609 char hostname[17];
1610 int hostlen;
1611 int max_phys_disks, max_virt_disks;
1612 unsigned long long sector;
1613 int clen;
1614 int i;
1615 int pdsize, vdsize;
1616 struct phys_disk *pd;
1617 struct virtual_disk *vd;
1618
1619 if (st->sb)
1620 return init_super_ddf_bvd(st, info, size, name, homehost, uuid);
1621
1622 if (posix_memalign((void**)&ddf, 512, sizeof(*ddf)) != 0) {
1623 fprintf(stderr, Name ": %s could not allocate superblock\n", __func__);
1624 return 0;
1625 }
1626 memset(ddf, 0, sizeof(*ddf));
1627 ddf->dlist = NULL; /* no physical disks yet */
1628 ddf->conflist = NULL; /* No virtual disks yet */
1629 st->sb = ddf;
1630
1631 if (info == NULL) {
1632 /* zeroing superblock */
1633 return 0;
1634 }
1635
1636 /* At least 32MB *must* be reserved for the ddf. So let's just
1637 * start 32MB from the end, and put the primary header there.
1638 * Don't do secondary for now.
1639 * We don't know exactly where that will be yet as it could be
1640 * different on each device. To just set up the lengths.
1641 *
1642 */
1643
1644 ddf->anchor.magic = DDF_HEADER_MAGIC;
1645 make_header_guid(ddf->anchor.guid);
1646
1647 memcpy(ddf->anchor.revision, DDF_REVISION_2, 8);
1648 ddf->anchor.seq = __cpu_to_be32(1);
1649 ddf->anchor.timestamp = __cpu_to_be32(time(0) - DECADE);
1650 ddf->anchor.openflag = 0xFF;
1651 ddf->anchor.foreignflag = 0;
1652 ddf->anchor.enforcegroups = 0; /* Is this best?? */
1653 ddf->anchor.pad0 = 0xff;
1654 memset(ddf->anchor.pad1, 0xff, 12);
1655 memset(ddf->anchor.header_ext, 0xff, 32);
1656 ddf->anchor.primary_lba = ~(__u64)0;
1657 ddf->anchor.secondary_lba = ~(__u64)0;
1658 ddf->anchor.type = DDF_HEADER_ANCHOR;
1659 memset(ddf->anchor.pad2, 0xff, 3);
1660 ddf->anchor.workspace_len = __cpu_to_be32(32768); /* Must be reserved */
1661 ddf->anchor.workspace_lba = ~(__u64)0; /* Put this at bottom
1662 of 32M reserved.. */
1663 max_phys_disks = 1023; /* Should be enough */
1664 ddf->anchor.max_pd_entries = __cpu_to_be16(max_phys_disks);
1665 max_virt_disks = 255;
1666 ddf->anchor.max_vd_entries = __cpu_to_be16(max_virt_disks); /* ?? */
1667 ddf->anchor.max_partitions = __cpu_to_be16(64); /* ?? */
1668 ddf->max_part = 64;
1669 ddf->mppe = 256;
1670 ddf->conf_rec_len = 1 + ROUND_UP(ddf->mppe * (4+8), 512)/512;
1671 ddf->anchor.config_record_len = __cpu_to_be16(ddf->conf_rec_len);
1672 ddf->anchor.max_primary_element_entries = __cpu_to_be16(ddf->mppe);
1673 memset(ddf->anchor.pad3, 0xff, 54);
1674 /* controller sections is one sector long immediately
1675 * after the ddf header */
1676 sector = 1;
1677 ddf->anchor.controller_section_offset = __cpu_to_be32(sector);
1678 ddf->anchor.controller_section_length = __cpu_to_be32(1);
1679 sector += 1;
1680
1681 /* phys is 8 sectors after that */
1682 pdsize = ROUND_UP(sizeof(struct phys_disk) +
1683 sizeof(struct phys_disk_entry)*max_phys_disks,
1684 512);
1685 switch(pdsize/512) {
1686 case 2: case 8: case 32: case 128: case 512: break;
1687 default: abort();
1688 }
1689 ddf->anchor.phys_section_offset = __cpu_to_be32(sector);
1690 ddf->anchor.phys_section_length =
1691 __cpu_to_be32(pdsize/512); /* max_primary_element_entries/8 */
1692 sector += pdsize/512;
1693
1694 /* virt is another 32 sectors */
1695 vdsize = ROUND_UP(sizeof(struct virtual_disk) +
1696 sizeof(struct virtual_entry) * max_virt_disks,
1697 512);
1698 switch(vdsize/512) {
1699 case 2: case 8: case 32: case 128: case 512: break;
1700 default: abort();
1701 }
1702 ddf->anchor.virt_section_offset = __cpu_to_be32(sector);
1703 ddf->anchor.virt_section_length =
1704 __cpu_to_be32(vdsize/512); /* max_vd_entries/8 */
1705 sector += vdsize/512;
1706
1707 clen = ddf->conf_rec_len * (ddf->max_part+1);
1708 ddf->anchor.config_section_offset = __cpu_to_be32(sector);
1709 ddf->anchor.config_section_length = __cpu_to_be32(clen);
1710 sector += clen;
1711
1712 ddf->anchor.data_section_offset = __cpu_to_be32(sector);
1713 ddf->anchor.data_section_length = __cpu_to_be32(1);
1714 sector += 1;
1715
1716 ddf->anchor.bbm_section_length = __cpu_to_be32(0);
1717 ddf->anchor.bbm_section_offset = __cpu_to_be32(0xFFFFFFFF);
1718 ddf->anchor.diag_space_length = __cpu_to_be32(0);
1719 ddf->anchor.diag_space_offset = __cpu_to_be32(0xFFFFFFFF);
1720 ddf->anchor.vendor_length = __cpu_to_be32(0);
1721 ddf->anchor.vendor_offset = __cpu_to_be32(0xFFFFFFFF);
1722
1723 memset(ddf->anchor.pad4, 0xff, 256);
1724
1725 memcpy(&ddf->primary, &ddf->anchor, 512);
1726 memcpy(&ddf->secondary, &ddf->anchor, 512);
1727
1728 ddf->primary.openflag = 1; /* I guess.. */
1729 ddf->primary.type = DDF_HEADER_PRIMARY;
1730
1731 ddf->secondary.openflag = 1; /* I guess.. */
1732 ddf->secondary.type = DDF_HEADER_SECONDARY;
1733
1734 ddf->active = &ddf->primary;
1735
1736 ddf->controller.magic = DDF_CONTROLLER_MAGIC;
1737
1738 /* 24 more bytes of fiction required.
1739 * first 8 are a 'vendor-id' - "Linux-MD"
1740 * Remaining 16 are serial number.... maybe a hostname would do?
1741 */
1742 memcpy(ddf->controller.guid, T10, sizeof(T10));
1743 gethostname(hostname, sizeof(hostname));
1744 hostname[sizeof(hostname) - 1] = 0;
1745 hostlen = strlen(hostname);
1746 memcpy(ddf->controller.guid + 24 - hostlen, hostname, hostlen);
1747 for (i = strlen(T10) ; i+hostlen < 24; i++)
1748 ddf->controller.guid[i] = ' ';
1749
1750 ddf->controller.type.vendor_id = __cpu_to_be16(0xDEAD);
1751 ddf->controller.type.device_id = __cpu_to_be16(0xBEEF);
1752 ddf->controller.type.sub_vendor_id = 0;
1753 ddf->controller.type.sub_device_id = 0;
1754 memcpy(ddf->controller.product_id, "What Is My PID??", 16);
1755 memset(ddf->controller.pad, 0xff, 8);
1756 memset(ddf->controller.vendor_data, 0xff, 448);
1757 if (homehost && strlen(homehost) < 440)
1758 strcpy((char*)ddf->controller.vendor_data, homehost);
1759
1760 if (posix_memalign((void**)&pd, 512, pdsize) != 0) {
1761 fprintf(stderr, Name ": %s could not allocate pd\n", __func__);
1762 return 0;
1763 }
1764 ddf->phys = pd;
1765 ddf->pdsize = pdsize;
1766
1767 memset(pd, 0xff, pdsize);
1768 memset(pd, 0, sizeof(*pd));
1769 pd->magic = DDF_PHYS_RECORDS_MAGIC;
1770 pd->used_pdes = __cpu_to_be16(0);
1771 pd->max_pdes = __cpu_to_be16(max_phys_disks);
1772 memset(pd->pad, 0xff, 52);
1773
1774 if (posix_memalign((void**)&vd, 512, vdsize) != 0) {
1775 fprintf(stderr, Name ": %s could not allocate vd\n", __func__);
1776 return 0;
1777 }
1778 ddf->virt = vd;
1779 ddf->vdsize = vdsize;
1780 memset(vd, 0, vdsize);
1781 vd->magic = DDF_VIRT_RECORDS_MAGIC;
1782 vd->populated_vdes = __cpu_to_be16(0);
1783 vd->max_vdes = __cpu_to_be16(max_virt_disks);
1784 memset(vd->pad, 0xff, 52);
1785
1786 for (i=0; i<max_virt_disks; i++)
1787 memset(&vd->entries[i], 0xff, sizeof(struct virtual_entry));
1788
1789 st->sb = ddf;
1790 ddf->updates_pending = 1;
1791 return 1;
1792 }
1793
1794 static int chunk_to_shift(int chunksize)
1795 {
1796 return ffs(chunksize/512)-1;
1797 }
1798
1799 static int level_to_prl(int level)
1800 {
1801 switch (level) {
1802 case LEVEL_LINEAR: return DDF_CONCAT;
1803 case 0: return DDF_RAID0;
1804 case 1: return DDF_RAID1;
1805 case 4: return DDF_RAID4;
1806 case 5: return DDF_RAID5;
1807 case 6: return DDF_RAID6;
1808 default: return -1;
1809 }
1810 }
1811 static int layout_to_rlq(int level, int layout, int raiddisks)
1812 {
1813 switch(level) {
1814 case 0:
1815 return DDF_RAID0_SIMPLE;
1816 case 1:
1817 switch(raiddisks) {
1818 case 2: return DDF_RAID1_SIMPLE;
1819 case 3: return DDF_RAID1_MULTI;
1820 default: return -1;
1821 }
1822 case 4:
1823 switch(layout) {
1824 case 0: return DDF_RAID4_N;
1825 }
1826 break;
1827 case 5:
1828 switch(layout) {
1829 case ALGORITHM_LEFT_ASYMMETRIC:
1830 return DDF_RAID5_N_RESTART;
1831 case ALGORITHM_RIGHT_ASYMMETRIC:
1832 return DDF_RAID5_0_RESTART;
1833 case ALGORITHM_LEFT_SYMMETRIC:
1834 return DDF_RAID5_N_CONTINUE;
1835 case ALGORITHM_RIGHT_SYMMETRIC:
1836 return -1; /* not mentioned in standard */
1837 }
1838 case 6:
1839 switch(layout) {
1840 case ALGORITHM_ROTATING_N_RESTART:
1841 return DDF_RAID5_N_RESTART;
1842 case ALGORITHM_ROTATING_ZERO_RESTART:
1843 return DDF_RAID6_0_RESTART;
1844 case ALGORITHM_ROTATING_N_CONTINUE:
1845 return DDF_RAID5_N_CONTINUE;
1846 }
1847 }
1848 return -1;
1849 }
1850
1851 static int rlq_to_layout(int rlq, int prl, int raiddisks)
1852 {
1853 switch(prl) {
1854 case DDF_RAID0:
1855 return 0; /* hopefully rlq == DDF_RAID0_SIMPLE */
1856 case DDF_RAID1:
1857 return 0; /* hopefully rlq == SIMPLE or MULTI depending
1858 on raiddisks*/
1859 case DDF_RAID4:
1860 switch(rlq) {
1861 case DDF_RAID4_N:
1862 return 0;
1863 default:
1864 /* not supported */
1865 return -1; /* FIXME this isn't checked */
1866 }
1867 case DDF_RAID5:
1868 switch(rlq) {
1869 case DDF_RAID5_N_RESTART:
1870 return ALGORITHM_LEFT_ASYMMETRIC;
1871 case DDF_RAID5_0_RESTART:
1872 return ALGORITHM_RIGHT_ASYMMETRIC;
1873 case DDF_RAID5_N_CONTINUE:
1874 return ALGORITHM_LEFT_SYMMETRIC;
1875 default:
1876 return -1;
1877 }
1878 case DDF_RAID6:
1879 switch(rlq) {
1880 case DDF_RAID5_N_RESTART:
1881 return ALGORITHM_ROTATING_N_RESTART;
1882 case DDF_RAID6_0_RESTART:
1883 return ALGORITHM_ROTATING_ZERO_RESTART;
1884 case DDF_RAID5_N_CONTINUE:
1885 return ALGORITHM_ROTATING_N_CONTINUE;
1886 default:
1887 return -1;
1888 }
1889 }
1890 return -1;
1891 }
1892
1893 #ifndef MDASSEMBLE
1894 struct extent {
1895 unsigned long long start, size;
1896 };
1897 static int cmp_extent(const void *av, const void *bv)
1898 {
1899 const struct extent *a = av;
1900 const struct extent *b = bv;
1901 if (a->start < b->start)
1902 return -1;
1903 if (a->start > b->start)
1904 return 1;
1905 return 0;
1906 }
1907
1908 static struct extent *get_extents(struct ddf_super *ddf, struct dl *dl)
1909 {
1910 /* find a list of used extents on the give physical device
1911 * (dnum) of the given ddf.
1912 * Return a malloced array of 'struct extent'
1913
1914 FIXME ignore DDF_Legacy devices?
1915
1916 */
1917 struct extent *rv;
1918 int n = 0;
1919 unsigned int i, j;
1920
1921 rv = malloc(sizeof(struct extent) * (ddf->max_part + 2));
1922 if (!rv)
1923 return NULL;
1924
1925 for (i = 0; i < ddf->max_part; i++) {
1926 struct vcl *v = dl->vlist[i];
1927 if (v == NULL)
1928 continue;
1929 for (j = 0; j < v->conf.prim_elmnt_count; j++)
1930 if (v->conf.phys_refnum[j] == dl->disk.refnum) {
1931 /* This device plays role 'j' in 'v'. */
1932 rv[n].start = __be64_to_cpu(v->lba_offset[j]);
1933 rv[n].size = __be64_to_cpu(v->conf.blocks);
1934 n++;
1935 break;
1936 }
1937 }
1938 qsort(rv, n, sizeof(*rv), cmp_extent);
1939
1940 rv[n].start = __be64_to_cpu(ddf->phys->entries[dl->pdnum].config_size);
1941 rv[n].size = 0;
1942 return rv;
1943 }
1944 #endif
1945
1946 static int init_super_ddf_bvd(struct supertype *st,
1947 mdu_array_info_t *info,
1948 unsigned long long size,
1949 char *name, char *homehost,
1950 int *uuid)
1951 {
1952 /* We are creating a BVD inside a pre-existing container.
1953 * so st->sb is already set.
1954 * We need to create a new vd_config and a new virtual_entry
1955 */
1956 struct ddf_super *ddf = st->sb;
1957 unsigned int venum;
1958 struct virtual_entry *ve;
1959 struct vcl *vcl;
1960 struct vd_config *vc;
1961
1962 if (__be16_to_cpu(ddf->virt->populated_vdes)
1963 >= __be16_to_cpu(ddf->virt->max_vdes)) {
1964 fprintf(stderr, Name": This ddf already has the "
1965 "maximum of %d virtual devices\n",
1966 __be16_to_cpu(ddf->virt->max_vdes));
1967 return 0;
1968 }
1969
1970 if (name)
1971 for (venum = 0; venum < __be16_to_cpu(ddf->virt->max_vdes); venum++)
1972 if (!all_ff(ddf->virt->entries[venum].guid)) {
1973 char *n = ddf->virt->entries[venum].name;
1974
1975 if (strncmp(name, n, 16) == 0) {
1976 fprintf(stderr, Name ": This ddf already"
1977 " has an array called %s\n",
1978 name);
1979 return 0;
1980 }
1981 }
1982
1983 for (venum = 0; venum < __be16_to_cpu(ddf->virt->max_vdes); venum++)
1984 if (all_ff(ddf->virt->entries[venum].guid))
1985 break;
1986 if (venum == __be16_to_cpu(ddf->virt->max_vdes)) {
1987 fprintf(stderr, Name ": Cannot find spare slot for "
1988 "virtual disk - DDF is corrupt\n");
1989 return 0;
1990 }
1991 ve = &ddf->virt->entries[venum];
1992
1993 /* A Virtual Disk GUID contains the T10 Vendor ID, controller type,
1994 * timestamp, random number
1995 */
1996 make_header_guid(ve->guid);
1997 ve->unit = __cpu_to_be16(info->md_minor);
1998 ve->pad0 = 0xFFFF;
1999 ve->guid_crc = crc32(0, (unsigned char*)ddf->anchor.guid, DDF_GUID_LEN);
2000 ve->type = 0;
2001 ve->state = DDF_state_degraded; /* Will be modified as devices are added */
2002 if (info->state & 1) /* clean */
2003 ve->init_state = DDF_init_full;
2004 else
2005 ve->init_state = DDF_init_not;
2006
2007 memset(ve->pad1, 0xff, 14);
2008 memset(ve->name, ' ', 16);
2009 if (name)
2010 strncpy(ve->name, name, 16);
2011 ddf->virt->populated_vdes =
2012 __cpu_to_be16(__be16_to_cpu(ddf->virt->populated_vdes)+1);
2013
2014 /* Now create a new vd_config */
2015 if (posix_memalign((void**)&vcl, 512,
2016 (offsetof(struct vcl, conf) + ddf->conf_rec_len * 512)) != 0) {
2017 fprintf(stderr, Name ": %s could not allocate vd_config\n", __func__);
2018 return 0;
2019 }
2020 vcl->lba_offset = (__u64*) &vcl->conf.phys_refnum[ddf->mppe];
2021 vcl->vcnum = venum;
2022 vcl->block_sizes = NULL; /* FIXME not for CONCAT */
2023
2024 vc = &vcl->conf;
2025
2026 vc->magic = DDF_VD_CONF_MAGIC;
2027 memcpy(vc->guid, ve->guid, DDF_GUID_LEN);
2028 vc->timestamp = __cpu_to_be32(time(0)-DECADE);
2029 vc->seqnum = __cpu_to_be32(1);
2030 memset(vc->pad0, 0xff, 24);
2031 vc->prim_elmnt_count = __cpu_to_be16(info->raid_disks);
2032 vc->chunk_shift = chunk_to_shift(info->chunk_size);
2033 vc->prl = level_to_prl(info->level);
2034 vc->rlq = layout_to_rlq(info->level, info->layout, info->raid_disks);
2035 vc->sec_elmnt_count = 1;
2036 vc->sec_elmnt_seq = 0;
2037 vc->srl = 0;
2038 vc->blocks = __cpu_to_be64(info->size * 2);
2039 vc->array_blocks = __cpu_to_be64(
2040 calc_array_size(info->level, info->raid_disks, info->layout,
2041 info->chunk_size, info->size*2));
2042 memset(vc->pad1, 0xff, 8);
2043 vc->spare_refs[0] = 0xffffffff;
2044 vc->spare_refs[1] = 0xffffffff;
2045 vc->spare_refs[2] = 0xffffffff;
2046 vc->spare_refs[3] = 0xffffffff;
2047 vc->spare_refs[4] = 0xffffffff;
2048 vc->spare_refs[5] = 0xffffffff;
2049 vc->spare_refs[6] = 0xffffffff;
2050 vc->spare_refs[7] = 0xffffffff;
2051 memset(vc->cache_pol, 0, 8);
2052 vc->bg_rate = 0x80;
2053 memset(vc->pad2, 0xff, 3);
2054 memset(vc->pad3, 0xff, 52);
2055 memset(vc->pad4, 0xff, 192);
2056 memset(vc->v0, 0xff, 32);
2057 memset(vc->v1, 0xff, 32);
2058 memset(vc->v2, 0xff, 16);
2059 memset(vc->v3, 0xff, 16);
2060 memset(vc->vendor, 0xff, 32);
2061
2062 memset(vc->phys_refnum, 0xff, 4*ddf->mppe);
2063 memset(vc->phys_refnum+ddf->mppe, 0x00, 8*ddf->mppe);
2064
2065 vcl->next = ddf->conflist;
2066 ddf->conflist = vcl;
2067 ddf->currentconf = vcl;
2068 ddf->updates_pending = 1;
2069 return 1;
2070 }
2071
2072 #ifndef MDASSEMBLE
2073 static void add_to_super_ddf_bvd(struct supertype *st,
2074 mdu_disk_info_t *dk, int fd, char *devname)
2075 {
2076 /* fd and devname identify a device with-in the ddf container (st).
2077 * dk identifies a location in the new BVD.
2078 * We need to find suitable free space in that device and update
2079 * the phys_refnum and lba_offset for the newly created vd_config.
2080 * We might also want to update the type in the phys_disk
2081 * section.
2082 *
2083 * Alternately: fd == -1 and we have already chosen which device to
2084 * use and recorded in dlist->raid_disk;
2085 */
2086 struct dl *dl;
2087 struct ddf_super *ddf = st->sb;
2088 struct vd_config *vc;
2089 __u64 *lba_offset;
2090 unsigned int working;
2091 unsigned int i;
2092 unsigned long long blocks, pos, esize;
2093 struct extent *ex;
2094
2095 if (fd == -1) {
2096 for (dl = ddf->dlist; dl ; dl = dl->next)
2097 if (dl->raiddisk == dk->raid_disk)
2098 break;
2099 } else {
2100 for (dl = ddf->dlist; dl ; dl = dl->next)
2101 if (dl->major == dk->major &&
2102 dl->minor == dk->minor)
2103 break;
2104 }
2105 if (!dl || ! (dk->state & (1<<MD_DISK_SYNC)))
2106 return;
2107
2108 vc = &ddf->currentconf->conf;
2109 lba_offset = ddf->currentconf->lba_offset;
2110
2111 ex = get_extents(ddf, dl);
2112 if (!ex)
2113 return;
2114
2115 i = 0; pos = 0;
2116 blocks = __be64_to_cpu(vc->blocks);
2117 if (ddf->currentconf->block_sizes)
2118 blocks = ddf->currentconf->block_sizes[dk->raid_disk];
2119
2120 do {
2121 esize = ex[i].start - pos;
2122 if (esize >= blocks)
2123 break;
2124 pos = ex[i].start + ex[i].size;
2125 i++;
2126 } while (ex[i-1].size);
2127
2128 free(ex);
2129 if (esize < blocks)
2130 return;
2131
2132 ddf->currentdev = dk->raid_disk;
2133 vc->phys_refnum[dk->raid_disk] = dl->disk.refnum;
2134 lba_offset[dk->raid_disk] = __cpu_to_be64(pos);
2135
2136 for (i = 0; i < ddf->max_part ; i++)
2137 if (dl->vlist[i] == NULL)
2138 break;
2139 if (i == ddf->max_part)
2140 return;
2141 dl->vlist[i] = ddf->currentconf;
2142
2143 if (fd >= 0)
2144 dl->fd = fd;
2145 if (devname)
2146 dl->devname = devname;
2147
2148 /* Check how many working raid_disks, and if we can mark
2149 * array as optimal yet
2150 */
2151 working = 0;
2152
2153 for (i = 0; i < __be16_to_cpu(vc->prim_elmnt_count); i++)
2154 if (vc->phys_refnum[i] != 0xffffffff)
2155 working++;
2156
2157 /* Find which virtual_entry */
2158 i = ddf->currentconf->vcnum;
2159 if (working == __be16_to_cpu(vc->prim_elmnt_count))
2160 ddf->virt->entries[i].state =
2161 (ddf->virt->entries[i].state & ~DDF_state_mask)
2162 | DDF_state_optimal;
2163
2164 if (vc->prl == DDF_RAID6 &&
2165 working+1 == __be16_to_cpu(vc->prim_elmnt_count))
2166 ddf->virt->entries[i].state =
2167 (ddf->virt->entries[i].state & ~DDF_state_mask)
2168 | DDF_state_part_optimal;
2169
2170 ddf->phys->entries[dl->pdnum].type &= ~__cpu_to_be16(DDF_Global_Spare);
2171 ddf->phys->entries[dl->pdnum].type |= __cpu_to_be16(DDF_Active_in_VD);
2172 ddf->updates_pending = 1;
2173 }
2174
2175 /* add a device to a container, either while creating it or while
2176 * expanding a pre-existing container
2177 */
2178 static int add_to_super_ddf(struct supertype *st,
2179 mdu_disk_info_t *dk, int fd, char *devname)
2180 {
2181 struct ddf_super *ddf = st->sb;
2182 struct dl *dd;
2183 time_t now;
2184 struct tm *tm;
2185 unsigned long long size;
2186 struct phys_disk_entry *pde;
2187 unsigned int n, i;
2188 struct stat stb;
2189
2190 if (ddf->currentconf) {
2191 add_to_super_ddf_bvd(st, dk, fd, devname);
2192 return 0;
2193 }
2194
2195 /* This is device numbered dk->number. We need to create
2196 * a phys_disk entry and a more detailed disk_data entry.
2197 */
2198 fstat(fd, &stb);
2199 if (posix_memalign((void**)&dd, 512,
2200 sizeof(*dd) + sizeof(dd->vlist[0]) * ddf->max_part) != 0) {
2201 fprintf(stderr, Name
2202 ": %s could allocate buffer for new disk, aborting\n",
2203 __func__);
2204 return 1;
2205 }
2206 dd->major = major(stb.st_rdev);
2207 dd->minor = minor(stb.st_rdev);
2208 dd->devname = devname;
2209 dd->fd = fd;
2210 dd->spare = NULL;
2211
2212 dd->disk.magic = DDF_PHYS_DATA_MAGIC;
2213 now = time(0);
2214 tm = localtime(&now);
2215 sprintf(dd->disk.guid, "%8s%04d%02d%02d",
2216 T10, tm->tm_year+1900, tm->tm_mon+1, tm->tm_mday);
2217 *(__u32*)(dd->disk.guid + 16) = random32();
2218 *(__u32*)(dd->disk.guid + 20) = random32();
2219
2220 do {
2221 /* Cannot be bothered finding a CRC of some irrelevant details*/
2222 dd->disk.refnum = random32();
2223 for (i = __be16_to_cpu(ddf->active->max_pd_entries);
2224 i > 0; i--)
2225 if (ddf->phys->entries[i-1].refnum == dd->disk.refnum)
2226 break;
2227 } while (i > 0);
2228
2229 dd->disk.forced_ref = 1;
2230 dd->disk.forced_guid = 1;
2231 memset(dd->disk.vendor, ' ', 32);
2232 memcpy(dd->disk.vendor, "Linux", 5);
2233 memset(dd->disk.pad, 0xff, 442);
2234 for (i = 0; i < ddf->max_part ; i++)
2235 dd->vlist[i] = NULL;
2236
2237 n = __be16_to_cpu(ddf->phys->used_pdes);
2238 pde = &ddf->phys->entries[n];
2239 dd->pdnum = n;
2240
2241 if (st->update_tail) {
2242 int len = (sizeof(struct phys_disk) +
2243 sizeof(struct phys_disk_entry));
2244 struct phys_disk *pd;
2245
2246 pd = malloc(len);
2247 pd->magic = DDF_PHYS_RECORDS_MAGIC;
2248 pd->used_pdes = __cpu_to_be16(n);
2249 pde = &pd->entries[0];
2250 dd->mdupdate = pd;
2251 } else {
2252 n++;
2253 ddf->phys->used_pdes = __cpu_to_be16(n);
2254 }
2255
2256 memcpy(pde->guid, dd->disk.guid, DDF_GUID_LEN);
2257 pde->refnum = dd->disk.refnum;
2258 pde->type = __cpu_to_be16(DDF_Forced_PD_GUID | DDF_Global_Spare);
2259 pde->state = __cpu_to_be16(DDF_Online);
2260 get_dev_size(fd, NULL, &size);
2261 /* We are required to reserve 32Meg, and record the size in sectors */
2262 pde->config_size = __cpu_to_be64( (size - 32*1024*1024) / 512);
2263 sprintf(pde->path, "%17.17s","Information: nil") ;
2264 memset(pde->pad, 0xff, 6);
2265
2266 dd->size = size >> 9;
2267 if (st->update_tail) {
2268 dd->next = ddf->add_list;
2269 ddf->add_list = dd;
2270 } else {
2271 dd->next = ddf->dlist;
2272 ddf->dlist = dd;
2273 ddf->updates_pending = 1;
2274 }
2275
2276 return 0;
2277 }
2278
2279 static int remove_from_super_ddf(struct supertype *st, mdu_disk_info_t *dk)
2280 {
2281 struct ddf_super *ddf = st->sb;
2282 struct dl *dl;
2283
2284 /* mdmon has noticed that this disk (dk->major/dk->minor) has
2285 * disappeared from the container.
2286 * We need to arrange that it disappears from the metadata and
2287 * internal data structures too.
2288 * Most of the work is done by ddf_process_update which edits
2289 * the metadata and closes the file handle and attaches the memory
2290 * where free_updates will free it.
2291 */
2292 for (dl = ddf->dlist; dl ; dl = dl->next)
2293 if (dl->major == dk->major &&
2294 dl->minor == dk->minor)
2295 break;
2296 if (!dl)
2297 return -1;
2298
2299 if (st->update_tail) {
2300 int len = (sizeof(struct phys_disk) +
2301 sizeof(struct phys_disk_entry));
2302 struct phys_disk *pd;
2303
2304 pd = malloc(len);
2305 pd->magic = DDF_PHYS_RECORDS_MAGIC;
2306 pd->used_pdes = __cpu_to_be16(dl->pdnum);
2307 pd->entries[0].state = __cpu_to_be16(DDF_Missing);
2308 append_metadata_update(st, pd, len);
2309 }
2310 return 0;
2311 }
2312
2313 /*
2314 * This is the write_init_super method for a ddf container. It is
2315 * called when creating a container or adding another device to a
2316 * container.
2317 */
2318
2319 static unsigned char null_conf[4096+512];
2320
2321 static int __write_init_super_ddf(struct supertype *st)
2322 {
2323
2324 struct ddf_super *ddf = st->sb;
2325 int i;
2326 struct dl *d;
2327 int n_config;
2328 int conf_size;
2329 int attempts = 0;
2330 int successes = 0;
2331 unsigned long long size, sector;
2332
2333 /* try to write updated metadata,
2334 * if we catch a failure move on to the next disk
2335 */
2336 for (d = ddf->dlist; d; d=d->next) {
2337 int fd = d->fd;
2338
2339 if (fd < 0)
2340 continue;
2341
2342 attempts++;
2343 /* We need to fill in the primary, (secondary) and workspace
2344 * lba's in the headers, set their checksums,
2345 * Also checksum phys, virt....
2346 *
2347 * Then write everything out, finally the anchor is written.
2348 */
2349 get_dev_size(fd, NULL, &size);
2350 size /= 512;
2351 ddf->anchor.workspace_lba = __cpu_to_be64(size - 32*1024*2);
2352 ddf->anchor.primary_lba = __cpu_to_be64(size - 16*1024*2);
2353 ddf->anchor.seq = __cpu_to_be32(1);
2354 memcpy(&ddf->primary, &ddf->anchor, 512);
2355 memcpy(&ddf->secondary, &ddf->anchor, 512);
2356
2357 ddf->anchor.openflag = 0xFF; /* 'open' means nothing */
2358 ddf->anchor.seq = 0xFFFFFFFF; /* no sequencing in anchor */
2359 ddf->anchor.crc = calc_crc(&ddf->anchor, 512);
2360
2361 ddf->primary.openflag = 0;
2362 ddf->primary.type = DDF_HEADER_PRIMARY;
2363
2364 ddf->secondary.openflag = 0;
2365 ddf->secondary.type = DDF_HEADER_SECONDARY;
2366
2367 ddf->primary.crc = calc_crc(&ddf->primary, 512);
2368 ddf->secondary.crc = calc_crc(&ddf->secondary, 512);
2369
2370 sector = size - 16*1024*2;
2371 lseek64(fd, sector<<9, 0);
2372 if (write(fd, &ddf->primary, 512) < 0)
2373 continue;
2374
2375 ddf->controller.crc = calc_crc(&ddf->controller, 512);
2376 if (write(fd, &ddf->controller, 512) < 0)
2377 continue;
2378
2379 ddf->phys->crc = calc_crc(ddf->phys, ddf->pdsize);
2380
2381 if (write(fd, ddf->phys, ddf->pdsize) < 0)
2382 continue;
2383
2384 ddf->virt->crc = calc_crc(ddf->virt, ddf->vdsize);
2385 if (write(fd, ddf->virt, ddf->vdsize) < 0)
2386 continue;
2387
2388 /* Now write lots of config records. */
2389 n_config = ddf->max_part;
2390 conf_size = ddf->conf_rec_len * 512;
2391 for (i = 0 ; i <= n_config ; i++) {
2392 struct vcl *c = d->vlist[i];
2393 if (i == n_config)
2394 c = (struct vcl*)d->spare;
2395
2396 if (c) {
2397 c->conf.crc = calc_crc(&c->conf, conf_size);
2398 if (write(fd, &c->conf, conf_size) < 0)
2399 break;
2400 } else {
2401 char *null_aligned = (char*)((((unsigned long)null_conf)+511)&~511UL);
2402 if (null_conf[0] != 0xff)
2403 memset(null_conf, 0xff, sizeof(null_conf));
2404 unsigned int togo = conf_size;
2405 while (togo > sizeof(null_conf)-512) {
2406 if (write(fd, null_aligned, sizeof(null_conf)-512) < 0)
2407 break;
2408 togo -= sizeof(null_conf)-512;
2409 }
2410 if (write(fd, null_aligned, togo) < 0)
2411 break;
2412 }
2413 }
2414 if (i <= n_config)
2415 continue;
2416 d->disk.crc = calc_crc(&d->disk, 512);
2417 if (write(fd, &d->disk, 512) < 0)
2418 continue;
2419
2420 /* Maybe do the same for secondary */
2421
2422 lseek64(fd, (size-1)*512, SEEK_SET);
2423 if (write(fd, &ddf->anchor, 512) < 0)
2424 continue;
2425 successes++;
2426 }
2427
2428 return attempts != successes;
2429 }
2430
2431 static int write_init_super_ddf(struct supertype *st)
2432 {
2433 struct ddf_super *ddf = st->sb;
2434 struct vcl *currentconf = ddf->currentconf;
2435
2436 /* we are done with currentconf reset it to point st at the container */
2437 ddf->currentconf = NULL;
2438
2439 if (st->update_tail) {
2440 /* queue the virtual_disk and vd_config as metadata updates */
2441 struct virtual_disk *vd;
2442 struct vd_config *vc;
2443 int len;
2444
2445 if (!currentconf) {
2446 int len = (sizeof(struct phys_disk) +
2447 sizeof(struct phys_disk_entry));
2448
2449 /* adding a disk to the container. */
2450 if (!ddf->add_list)
2451 return 0;
2452
2453 append_metadata_update(st, ddf->add_list->mdupdate, len);
2454 ddf->add_list->mdupdate = NULL;
2455 return 0;
2456 }
2457
2458 /* Newly created VD */
2459
2460 /* First the virtual disk. We have a slightly fake header */
2461 len = sizeof(struct virtual_disk) + sizeof(struct virtual_entry);
2462 vd = malloc(len);
2463 *vd = *ddf->virt;
2464 vd->entries[0] = ddf->virt->entries[currentconf->vcnum];
2465 vd->populated_vdes = __cpu_to_be16(currentconf->vcnum);
2466 append_metadata_update(st, vd, len);
2467
2468 /* Then the vd_config */
2469 len = ddf->conf_rec_len * 512;
2470 vc = malloc(len);
2471 memcpy(vc, &currentconf->conf, len);
2472 append_metadata_update(st, vc, len);
2473
2474 /* FIXME I need to close the fds! */
2475 return 0;
2476 } else {
2477 struct dl *d;
2478 for (d = ddf->dlist; d; d=d->next)
2479 while (Kill(d->devname, NULL, 0, 1, 1) == 0);
2480 return __write_init_super_ddf(st);
2481 }
2482 }
2483
2484 #endif
2485
2486 static __u64 avail_size_ddf(struct supertype *st, __u64 devsize)
2487 {
2488 /* We must reserve the last 32Meg */
2489 if (devsize <= 32*1024*2)
2490 return 0;
2491 return devsize - 32*1024*2;
2492 }
2493
2494 #ifndef MDASSEMBLE
2495
2496 static int reserve_space(struct supertype *st, int raiddisks,
2497 unsigned long long size, int chunk,
2498 unsigned long long *freesize)
2499 {
2500 /* Find 'raiddisks' spare extents at least 'size' big (but
2501 * only caring about multiples of 'chunk') and remember
2502 * them.
2503 * If the cannot be found, fail.
2504 */
2505 struct dl *dl;
2506 struct ddf_super *ddf = st->sb;
2507 int cnt = 0;
2508
2509 for (dl = ddf->dlist; dl ; dl=dl->next) {
2510 dl->raiddisk = -1;
2511 dl->esize = 0;
2512 }
2513 /* Now find largest extent on each device */
2514 for (dl = ddf->dlist ; dl ; dl=dl->next) {
2515 struct extent *e = get_extents(ddf, dl);
2516 unsigned long long pos = 0;
2517 int i = 0;
2518 int found = 0;
2519 unsigned long long minsize = size;
2520
2521 if (size == 0)
2522 minsize = chunk;
2523
2524 if (!e)
2525 continue;
2526 do {
2527 unsigned long long esize;
2528 esize = e[i].start - pos;
2529 if (esize >= minsize) {
2530 found = 1;
2531 minsize = esize;
2532 }
2533 pos = e[i].start + e[i].size;
2534 i++;
2535 } while (e[i-1].size);
2536 if (found) {
2537 cnt++;
2538 dl->esize = minsize;
2539 }
2540 free(e);
2541 }
2542 if (cnt < raiddisks) {
2543 fprintf(stderr, Name ": not enough devices with space to create array.\n");
2544 return 0; /* No enough free spaces large enough */
2545 }
2546 if (size == 0) {
2547 /* choose the largest size of which there are at least 'raiddisk' */
2548 for (dl = ddf->dlist ; dl ; dl=dl->next) {
2549 struct dl *dl2;
2550 if (dl->esize <= size)
2551 continue;
2552 /* This is bigger than 'size', see if there are enough */
2553 cnt = 0;
2554 for (dl2 = dl; dl2 ; dl2=dl2->next)
2555 if (dl2->esize >= dl->esize)
2556 cnt++;
2557 if (cnt >= raiddisks)
2558 size = dl->esize;
2559 }
2560 if (chunk) {
2561 size = size / chunk;
2562 size *= chunk;
2563 }
2564 *freesize = size;
2565 if (size < 32) {
2566 fprintf(stderr, Name ": not enough spare devices to create array.\n");
2567 return 0;
2568 }
2569 }
2570 /* We have a 'size' of which there are enough spaces.
2571 * We simply do a first-fit */
2572 cnt = 0;
2573 for (dl = ddf->dlist ; dl && cnt < raiddisks ; dl=dl->next) {
2574 if (dl->esize < size)
2575 continue;
2576
2577 dl->raiddisk = cnt;
2578 cnt++;
2579 }
2580 return 1;
2581 }
2582
2583
2584
2585 static int
2586 validate_geometry_ddf_container(struct supertype *st,
2587 int level, int layout, int raiddisks,
2588 int chunk, unsigned long long size,
2589 char *dev, unsigned long long *freesize,
2590 int verbose);
2591
2592 static int validate_geometry_ddf_bvd(struct supertype *st,
2593 int level, int layout, int raiddisks,
2594 int *chunk, unsigned long long size,
2595 char *dev, unsigned long long *freesize,
2596 int verbose);
2597
2598 static int validate_geometry_ddf(struct supertype *st,
2599 int level, int layout, int raiddisks,
2600 int *chunk, unsigned long long size,
2601 char *dev, unsigned long long *freesize,
2602 int verbose)
2603 {
2604 int fd;
2605 struct mdinfo *sra;
2606 int cfd;
2607
2608 /* ddf potentially supports lots of things, but it depends on
2609 * what devices are offered (and maybe kernel version?)
2610 * If given unused devices, we will make a container.
2611 * If given devices in a container, we will make a BVD.
2612 * If given BVDs, we make an SVD, changing all the GUIDs in the process.
2613 */
2614
2615 if (chunk && *chunk == UnSet)
2616 *chunk = DEFAULT_CHUNK;
2617
2618
2619 if (level == LEVEL_CONTAINER) {
2620 /* Must be a fresh device to add to a container */
2621 return validate_geometry_ddf_container(st, level, layout,
2622 raiddisks, chunk?*chunk:0,
2623 size, dev, freesize,
2624 verbose);
2625 }
2626
2627 if (!dev) {
2628 /* Initial sanity check. Exclude illegal levels. */
2629 int i;
2630 for (i=0; ddf_level_num[i].num1 != MAXINT; i++)
2631 if (ddf_level_num[i].num2 == level)
2632 break;
2633 if (ddf_level_num[i].num1 == MAXINT) {
2634 if (verbose)
2635 fprintf(stderr, Name ": DDF does not support level %d arrays\n",
2636 level);
2637 return 0;
2638 }
2639 /* Should check layout? etc */
2640
2641 if (st->sb && freesize) {
2642 /* --create was given a container to create in.
2643 * So we need to check that there are enough
2644 * free spaces and return the amount of space.
2645 * We may as well remember which drives were
2646 * chosen so that add_to_super/getinfo_super
2647 * can return them.
2648 */
2649 return reserve_space(st, raiddisks, size, chunk?*chunk:0, freesize);
2650 }
2651 return 1;
2652 }
2653
2654 if (st->sb) {
2655 /* A container has already been opened, so we are
2656 * creating in there. Maybe a BVD, maybe an SVD.
2657 * Should make a distinction one day.
2658 */
2659 return validate_geometry_ddf_bvd(st, level, layout, raiddisks,
2660 chunk, size, dev, freesize,
2661 verbose);
2662 }
2663 /* This is the first device for the array.
2664 * If it is a container, we read it in and do automagic allocations,
2665 * no other devices should be given.
2666 * Otherwise it must be a member device of a container, and we
2667 * do manual allocation.
2668 * Later we should check for a BVD and make an SVD.
2669 */
2670 fd = open(dev, O_RDONLY|O_EXCL, 0);
2671 if (fd >= 0) {
2672 sra = sysfs_read(fd, 0, GET_VERSION);
2673 close(fd);
2674 if (sra && sra->array.major_version == -1 &&
2675 strcmp(sra->text_version, "ddf") == 0) {
2676
2677 /* load super */
2678 /* find space for 'n' devices. */
2679 /* remember the devices */
2680 /* Somehow return the fact that we have enough */
2681 }
2682
2683 if (verbose)
2684 fprintf(stderr,
2685 Name ": ddf: Cannot create this array "
2686 "on device %s - a container is required.\n",
2687 dev);
2688 return 0;
2689 }
2690 if (errno != EBUSY || (fd = open(dev, O_RDONLY, 0)) < 0) {
2691 if (verbose)
2692 fprintf(stderr, Name ": ddf: Cannot open %s: %s\n",
2693 dev, strerror(errno));
2694 return 0;
2695 }
2696 /* Well, it is in use by someone, maybe a 'ddf' container. */
2697 cfd = open_container(fd);
2698 if (cfd < 0) {
2699 close(fd);
2700 if (verbose)
2701 fprintf(stderr, Name ": ddf: Cannot use %s: %s\n",
2702 dev, strerror(EBUSY));
2703 return 0;
2704 }
2705 sra = sysfs_read(cfd, 0, GET_VERSION);
2706 close(fd);
2707 if (sra && sra->array.major_version == -1 &&
2708 strcmp(sra->text_version, "ddf") == 0) {
2709 /* This is a member of a ddf container. Load the container
2710 * and try to create a bvd
2711 */
2712 struct ddf_super *ddf;
2713 if (load_super_ddf_all(st, cfd, (void **)&ddf, NULL) == 0) {
2714 st->sb = ddf;
2715 st->container_dev = fd2devnum(cfd);
2716 close(cfd);
2717 return validate_geometry_ddf_bvd(st, level, layout,
2718 raiddisks, chunk, size,
2719 dev, freesize,
2720 verbose);
2721 }
2722 close(cfd);
2723 } else /* device may belong to a different container */
2724 return 0;
2725
2726 return 1;
2727 }
2728
2729 static int
2730 validate_geometry_ddf_container(struct supertype *st,
2731 int level, int layout, int raiddisks,
2732 int chunk, unsigned long long size,
2733 char *dev, unsigned long long *freesize,
2734 int verbose)
2735 {
2736 int fd;
2737 unsigned long long ldsize;
2738
2739 if (level != LEVEL_CONTAINER)
2740 return 0;
2741 if (!dev)
2742 return 1;
2743
2744 fd = open(dev, O_RDONLY|O_EXCL, 0);
2745 if (fd < 0) {
2746 if (verbose)
2747 fprintf(stderr, Name ": ddf: Cannot open %s: %s\n",
2748 dev, strerror(errno));
2749 return 0;
2750 }
2751 if (!get_dev_size(fd, dev, &ldsize)) {
2752 close(fd);
2753 return 0;
2754 }
2755 close(fd);
2756
2757 *freesize = avail_size_ddf(st, ldsize >> 9);
2758 if (*freesize == 0)
2759 return 0;
2760
2761 return 1;
2762 }
2763
2764 static int validate_geometry_ddf_bvd(struct supertype *st,
2765 int level, int layout, int raiddisks,
2766 int *chunk, unsigned long long size,
2767 char *dev, unsigned long long *freesize,
2768 int verbose)
2769 {
2770 struct stat stb;
2771 struct ddf_super *ddf = st->sb;
2772 struct dl *dl;
2773 unsigned long long pos = 0;
2774 unsigned long long maxsize;
2775 struct extent *e;
2776 int i;
2777 /* ddf/bvd supports lots of things, but not containers */
2778 if (level == LEVEL_CONTAINER) {
2779 if (verbose)
2780 fprintf(stderr, Name ": DDF cannot create a container within an container\n");
2781 return 0;
2782 }
2783 /* We must have the container info already read in. */
2784 if (!ddf)
2785 return 0;
2786
2787 if (!dev) {
2788 /* General test: make sure there is space for
2789 * 'raiddisks' device extents of size 'size'.
2790 */
2791 unsigned long long minsize = size;
2792 int dcnt = 0;
2793 if (minsize == 0)
2794 minsize = 8;
2795 for (dl = ddf->dlist; dl ; dl = dl->next)
2796 {
2797 int found = 0;
2798 pos = 0;
2799
2800 i = 0;
2801 e = get_extents(ddf, dl);
2802 if (!e) continue;
2803 do {
2804 unsigned long long esize;
2805 esize = e[i].start - pos;
2806 if (esize >= minsize)
2807 found = 1;
2808 pos = e[i].start + e[i].size;
2809 i++;
2810 } while (e[i-1].size);
2811 if (found)
2812 dcnt++;
2813 free(e);
2814 }
2815 if (dcnt < raiddisks) {
2816 if (verbose)
2817 fprintf(stderr,
2818 Name ": ddf: Not enough devices with "
2819 "space for this array (%d < %d)\n",
2820 dcnt, raiddisks);
2821 return 0;
2822 }
2823 return 1;
2824 }
2825 /* This device must be a member of the set */
2826 if (stat(dev, &stb) < 0)
2827 return 0;
2828 if ((S_IFMT & stb.st_mode) != S_IFBLK)
2829 return 0;
2830 for (dl = ddf->dlist ; dl ; dl = dl->next) {
2831 if (dl->major == (int)major(stb.st_rdev) &&
2832 dl->minor == (int)minor(stb.st_rdev))
2833 break;
2834 }
2835 if (!dl) {
2836 if (verbose)
2837 fprintf(stderr, Name ": ddf: %s is not in the "
2838 "same DDF set\n",
2839 dev);
2840 return 0;
2841 }
2842 e = get_extents(ddf, dl);
2843 maxsize = 0;
2844 i = 0;
2845 if (e) do {
2846 unsigned long long esize;
2847 esize = e[i].start - pos;
2848 if (esize >= maxsize)
2849 maxsize = esize;
2850 pos = e[i].start + e[i].size;
2851 i++;
2852 } while (e[i-1].size);
2853 *freesize = maxsize;
2854 // FIXME here I am
2855
2856 return 1;
2857 }
2858
2859 static int load_super_ddf_all(struct supertype *st, int fd,
2860 void **sbp, char *devname)
2861 {
2862 struct mdinfo *sra;
2863 struct ddf_super *super;
2864 struct mdinfo *sd, *best = NULL;
2865 int bestseq = 0;
2866 int seq;
2867 char nm[20];
2868 int dfd;
2869
2870 sra = sysfs_read(fd, 0, GET_LEVEL|GET_VERSION|GET_DEVS|GET_STATE);
2871 if (!sra)
2872 return 1;
2873 if (sra->array.major_version != -1 ||
2874 sra->array.minor_version != -2 ||
2875 strcmp(sra->text_version, "ddf") != 0)
2876 return 1;
2877
2878 if (posix_memalign((void**)&super, 512, sizeof(*super)) != 0)
2879 return 1;
2880 memset(super, 0, sizeof(*super));
2881
2882 /* first, try each device, and choose the best ddf */
2883 for (sd = sra->devs ; sd ; sd = sd->next) {
2884 int rv;
2885 sprintf(nm, "%d:%d", sd->disk.major, sd->disk.minor);
2886 dfd = dev_open(nm, O_RDONLY);
2887 if (dfd < 0)
2888 return 2;
2889 rv = load_ddf_headers(dfd, super, NULL);
2890 close(dfd);
2891 if (rv == 0) {
2892 seq = __be32_to_cpu(super->active->seq);
2893 if (super->active->openflag)
2894 seq--;
2895 if (!best || seq > bestseq) {
2896 bestseq = seq;
2897 best = sd;
2898 }
2899 }
2900 }
2901 if (!best)
2902 return 1;
2903 /* OK, load this ddf */
2904 sprintf(nm, "%d:%d", best->disk.major, best->disk.minor);
2905 dfd = dev_open(nm, O_RDONLY);
2906 if (dfd < 0)
2907 return 1;
2908 load_ddf_headers(dfd, super, NULL);
2909 load_ddf_global(dfd, super, NULL);
2910 close(dfd);
2911 /* Now we need the device-local bits */
2912 for (sd = sra->devs ; sd ; sd = sd->next) {
2913 int rv;
2914
2915 sprintf(nm, "%d:%d", sd->disk.major, sd->disk.minor);
2916 dfd = dev_open(nm, O_RDWR);
2917 if (dfd < 0)
2918 return 2;
2919 rv = load_ddf_headers(dfd, super, NULL);
2920 if (rv == 0)
2921 rv = load_ddf_local(dfd, super, NULL, 1);
2922 if (rv)
2923 return 1;
2924 }
2925
2926 *sbp = super;
2927 if (st->ss == NULL) {
2928 st->ss = &super_ddf;
2929 st->minor_version = 0;
2930 st->max_devs = 512;
2931 }
2932 st->container_dev = fd2devnum(fd);
2933 return 0;
2934 }
2935
2936 static int load_container_ddf(struct supertype *st, int fd,
2937 char *devname)
2938 {
2939 return load_super_ddf_all(st, fd, &st->sb, devname);
2940 }
2941
2942 #endif /* MDASSEMBLE */
2943
2944 static struct mdinfo *container_content_ddf(struct supertype *st, char *subarray)
2945 {
2946 /* Given a container loaded by load_super_ddf_all,
2947 * extract information about all the arrays into
2948 * an mdinfo tree.
2949 *
2950 * For each vcl in conflist: create an mdinfo, fill it in,
2951 * then look for matching devices (phys_refnum) in dlist
2952 * and create appropriate device mdinfo.
2953 */
2954 struct ddf_super *ddf = st->sb;
2955 struct mdinfo *rest = NULL;
2956 struct vcl *vc;
2957
2958 for (vc = ddf->conflist ; vc ; vc=vc->next)
2959 {
2960 unsigned int i;
2961 unsigned int j;
2962 struct mdinfo *this;
2963 char *ep;
2964
2965 if (subarray &&
2966 (strtoul(subarray, &ep, 10) != vc->vcnum ||
2967 *ep != '\0'))
2968 continue;
2969
2970 this = malloc(sizeof(*this));
2971 memset(this, 0, sizeof(*this));
2972 this->next = rest;
2973 rest = this;
2974
2975 this->array.level = map_num1(ddf_level_num, vc->conf.prl);
2976 this->array.raid_disks =
2977 __be16_to_cpu(vc->conf.prim_elmnt_count);
2978 this->array.layout = rlq_to_layout(vc->conf.rlq, vc->conf.prl,
2979 this->array.raid_disks);
2980 this->array.md_minor = -1;
2981 this->array.major_version = -1;
2982 this->array.minor_version = -2;
2983 this->array.ctime = DECADE +
2984 __be32_to_cpu(*(__u32*)(vc->conf.guid+16));
2985 this->array.utime = DECADE +
2986 __be32_to_cpu(vc->conf.timestamp);
2987 this->array.chunk_size = 512 << vc->conf.chunk_shift;
2988
2989 i = vc->vcnum;
2990 if ((ddf->virt->entries[i].state & DDF_state_inconsistent) ||
2991 (ddf->virt->entries[i].init_state & DDF_initstate_mask) !=
2992 DDF_init_full) {
2993 this->array.state = 0;
2994 this->resync_start = 0;
2995 } else {
2996 this->array.state = 1;
2997 this->resync_start = MaxSector;
2998 }
2999 memcpy(this->name, ddf->virt->entries[i].name, 16);
3000 this->name[16]=0;
3001 for(j=0; j<16; j++)
3002 if (this->name[j] == ' ')
3003 this->name[j] = 0;
3004
3005 memset(this->uuid, 0, sizeof(this->uuid));
3006 this->component_size = __be64_to_cpu(vc->conf.blocks);
3007 this->array.size = this->component_size / 2;
3008 this->container_member = i;
3009
3010 ddf->currentconf = vc;
3011 uuid_from_super_ddf(st, this->uuid);
3012 ddf->currentconf = NULL;
3013
3014 sprintf(this->text_version, "/%s/%d",
3015 devnum2devname(st->container_dev),
3016 this->container_member);
3017
3018 for (i = 0 ; i < ddf->mppe ; i++) {
3019 struct mdinfo *dev;
3020 struct dl *d;
3021 int stt;
3022 int pd;
3023
3024 if (vc->conf.phys_refnum[i] == 0xFFFFFFFF)
3025 continue;
3026
3027 for (pd = __be16_to_cpu(ddf->phys->used_pdes);
3028 pd--;)
3029 if (ddf->phys->entries[pd].refnum
3030 == vc->conf.phys_refnum[i])
3031 break;
3032 if (pd < 0)
3033 continue;
3034
3035 stt = __be16_to_cpu(ddf->phys->entries[pd].state);
3036 if ((stt & (DDF_Online|DDF_Failed|DDF_Rebuilding))
3037 != DDF_Online)
3038 continue;
3039
3040 this->array.working_disks++;
3041
3042 for (d = ddf->dlist; d ; d=d->next)
3043 if (d->disk.refnum == vc->conf.phys_refnum[i])
3044 break;
3045 if (d == NULL)
3046 /* Haven't found that one yet, maybe there are others */
3047 continue;
3048
3049 dev = malloc(sizeof(*dev));
3050 memset(dev, 0, sizeof(*dev));
3051 dev->next = this->devs;
3052 this->devs = dev;
3053
3054 dev->disk.number = __be32_to_cpu(d->disk.refnum);
3055 dev->disk.major = d->major;
3056 dev->disk.minor = d->minor;
3057 dev->disk.raid_disk = i;
3058 dev->disk.state = (1<<MD_DISK_SYNC)|(1<<MD_DISK_ACTIVE);
3059 dev->recovery_start = MaxSector;
3060
3061 dev->events = __be32_to_cpu(ddf->primary.seq);
3062 dev->data_offset = __be64_to_cpu(vc->lba_offset[i]);
3063 dev->component_size = __be64_to_cpu(vc->conf.blocks);
3064 if (d->devname)
3065 strcpy(dev->name, d->devname);
3066 }
3067 }
3068 return rest;
3069 }
3070
3071 static int store_super_ddf(struct supertype *st, int fd)
3072 {
3073 struct ddf_super *ddf = st->sb;
3074 unsigned long long dsize;
3075 void *buf;
3076 int rc;
3077
3078 if (!ddf)
3079 return 1;
3080
3081 /* ->dlist and ->conflist will be set for updates, currently not
3082 * supported
3083 */
3084 if (ddf->dlist || ddf->conflist)
3085 return 1;
3086
3087 if (!get_dev_size(fd, NULL, &dsize))
3088 return 1;
3089
3090 if (posix_memalign(&buf, 512, 512) != 0)
3091 return 1;
3092 memset(buf, 0, 512);
3093
3094 lseek64(fd, dsize-512, 0);
3095 rc = write(fd, buf, 512);
3096 free(buf);
3097 if (rc < 0)
3098 return 1;
3099 return 0;
3100 }
3101
3102 static int compare_super_ddf(struct supertype *st, struct supertype *tst)
3103 {
3104 /*
3105 * return:
3106 * 0 same, or first was empty, and second was copied
3107 * 1 second had wrong number
3108 * 2 wrong uuid
3109 * 3 wrong other info
3110 */
3111 struct ddf_super *first = st->sb;
3112 struct ddf_super *second = tst->sb;
3113
3114 if (!first) {
3115 st->sb = tst->sb;
3116 tst->sb = NULL;
3117 return 0;
3118 }
3119
3120 if (memcmp(first->anchor.guid, second->anchor.guid, DDF_GUID_LEN) != 0)
3121 return 2;
3122
3123 /* FIXME should I look at anything else? */
3124 return 0;
3125 }
3126
3127 #ifndef MDASSEMBLE
3128 /*
3129 * A new array 'a' has been started which claims to be instance 'inst'
3130 * within container 'c'.
3131 * We need to confirm that the array matches the metadata in 'c' so
3132 * that we don't corrupt any metadata.
3133 */
3134 static int ddf_open_new(struct supertype *c, struct active_array *a, char *inst)
3135 {
3136 dprintf("ddf: open_new %s\n", inst);
3137 a->info.container_member = atoi(inst);
3138 return 0;
3139 }
3140
3141 /*
3142 * The array 'a' is to be marked clean in the metadata.
3143 * If '->resync_start' is not ~(unsigned long long)0, then the array is only
3144 * clean up to the point (in sectors). If that cannot be recorded in the
3145 * metadata, then leave it as dirty.
3146 *
3147 * For DDF, we need to clear the DDF_state_inconsistent bit in the
3148 * !global! virtual_disk.virtual_entry structure.
3149 */
3150 static int ddf_set_array_state(struct active_array *a, int consistent)
3151 {
3152 struct ddf_super *ddf = a->container->sb;
3153 int inst = a->info.container_member;
3154 int old = ddf->virt->entries[inst].state;
3155 if (consistent == 2) {
3156 /* Should check if a recovery should be started FIXME */
3157 consistent = 1;
3158 if (!is_resync_complete(&a->info))
3159 consistent = 0;
3160 }
3161 if (consistent)
3162 ddf->virt->entries[inst].state &= ~DDF_state_inconsistent;
3163 else
3164 ddf->virt->entries[inst].state |= DDF_state_inconsistent;
3165 if (old != ddf->virt->entries[inst].state)
3166 ddf->updates_pending = 1;
3167
3168 old = ddf->virt->entries[inst].init_state;
3169 ddf->virt->entries[inst].init_state &= ~DDF_initstate_mask;
3170 if (is_resync_complete(&a->info))
3171 ddf->virt->entries[inst].init_state |= DDF_init_full;
3172 else if (a->info.resync_start == 0)
3173 ddf->virt->entries[inst].init_state |= DDF_init_not;
3174 else
3175 ddf->virt->entries[inst].init_state |= DDF_init_quick;
3176 if (old != ddf->virt->entries[inst].init_state)
3177 ddf->updates_pending = 1;
3178
3179 dprintf("ddf mark %d %s %llu\n", inst, consistent?"clean":"dirty",
3180 a->info.resync_start);
3181 return consistent;
3182 }
3183
3184 #define container_of(ptr, type, member) ({ \
3185 const typeof( ((type *)0)->member ) *__mptr = (ptr); \
3186 (type *)( (char *)__mptr - offsetof(type,member) );})
3187 /*
3188 * The state of each disk is stored in the global phys_disk structure
3189 * in phys_disk.entries[n].state.
3190 * This makes various combinations awkward.
3191 * - When a device fails in any array, it must be failed in all arrays
3192 * that include a part of this device.
3193 * - When a component is rebuilding, we cannot include it officially in the
3194 * array unless this is the only array that uses the device.
3195 *
3196 * So: when transitioning:
3197 * Online -> failed, just set failed flag. monitor will propagate
3198 * spare -> online, the device might need to be added to the array.
3199 * spare -> failed, just set failed. Don't worry if in array or not.
3200 */
3201 static void ddf_set_disk(struct active_array *a, int n, int state)
3202 {
3203 struct ddf_super *ddf = a->container->sb;
3204 unsigned int inst = a->info.container_member;
3205 struct vd_config *vc = find_vdcr(ddf, inst);
3206 int pd = find_phys(ddf, vc->phys_refnum[n]);
3207 int i, st, working;
3208 struct mdinfo *mdi;
3209 struct dl *dl;
3210
3211 if (vc == NULL) {
3212 dprintf("ddf: cannot find instance %d!!\n", inst);
3213 return;
3214 }
3215 /* Find the matching slot in 'info'. */
3216 for (mdi = a->info.devs; mdi; mdi = mdi->next)
3217 if (mdi->disk.raid_disk == n)
3218 break;
3219 if (!mdi)
3220 return;
3221
3222 /* and find the 'dl' entry corresponding to that. */
3223 for (dl = ddf->dlist; dl; dl = dl->next)
3224 if (mdi->state_fd >= 0 &&
3225 mdi->disk.major == dl->major &&
3226 mdi->disk.minor == dl->minor)
3227 break;
3228 if (!dl)
3229 return;
3230
3231 if (pd < 0 || pd != dl->pdnum) {
3232 /* disk doesn't currently exist or has changed.
3233 * If it is now in_sync, insert it. */
3234 if ((state & DS_INSYNC) && ! (state & DS_FAULTY)) {
3235 struct vcl *vcl;
3236 pd = dl->pdnum;
3237 vc->phys_refnum[n] = dl->disk.refnum;
3238 vcl = container_of(vc, struct vcl, conf);
3239 vcl->lba_offset[n] = mdi->data_offset;
3240 ddf->phys->entries[pd].type &=
3241 ~__cpu_to_be16(DDF_Global_Spare);
3242 ddf->phys->entries[pd].type |=
3243 __cpu_to_be16(DDF_Active_in_VD);
3244 ddf->updates_pending = 1;
3245 }
3246 } else {
3247 int old = ddf->phys->entries[pd].state;
3248 if (state & DS_FAULTY)
3249 ddf->phys->entries[pd].state |= __cpu_to_be16(DDF_Failed);
3250 if (state & DS_INSYNC) {
3251 ddf->phys->entries[pd].state |= __cpu_to_be16(DDF_Online);
3252 ddf->phys->entries[pd].state &= __cpu_to_be16(~DDF_Rebuilding);
3253 }
3254 if (old != ddf->phys->entries[pd].state)
3255 ddf->updates_pending = 1;
3256 }
3257
3258 dprintf("ddf: set_disk %d to %x\n", n, state);
3259
3260 /* Now we need to check the state of the array and update
3261 * virtual_disk.entries[n].state.
3262 * It needs to be one of "optimal", "degraded", "failed".
3263 * I don't understand 'deleted' or 'missing'.
3264 */
3265 working = 0;
3266 for (i=0; i < a->info.array.raid_disks; i++) {
3267 pd = find_phys(ddf, vc->phys_refnum[i]);
3268 if (pd < 0)
3269 continue;
3270 st = __be16_to_cpu(ddf->phys->entries[pd].state);
3271 if ((st & (DDF_Online|DDF_Failed|DDF_Rebuilding))
3272 == DDF_Online)
3273 working++;
3274 }
3275 state = DDF_state_degraded;
3276 if (working == a->info.array.raid_disks)
3277 state = DDF_state_optimal;
3278 else switch(vc->prl) {
3279 case DDF_RAID0:
3280 case DDF_CONCAT:
3281 case DDF_JBOD:
3282 state = DDF_state_failed;
3283 break;
3284 case DDF_RAID1:
3285 if (working == 0)
3286 state = DDF_state_failed;
3287 else if (working == 2 && state == DDF_state_degraded)
3288 state = DDF_state_part_optimal;
3289 break;
3290 case DDF_RAID4:
3291 case DDF_RAID5:
3292 if (working < a->info.array.raid_disks-1)
3293 state = DDF_state_failed;
3294 break;
3295 case DDF_RAID6:
3296 if (working < a->info.array.raid_disks-2)
3297 state = DDF_state_failed;
3298 else if (working == a->info.array.raid_disks-1)
3299 state = DDF_state_part_optimal;
3300 break;
3301 }
3302
3303 if (ddf->virt->entries[inst].state !=
3304 ((ddf->virt->entries[inst].state & ~DDF_state_mask)
3305 | state)) {
3306
3307 ddf->virt->entries[inst].state =
3308 (ddf->virt->entries[inst].state & ~DDF_state_mask)
3309 | state;
3310 ddf->updates_pending = 1;
3311 }
3312
3313 }
3314
3315 static void ddf_sync_metadata(struct supertype *st)
3316 {
3317
3318 /*
3319 * Write all data to all devices.
3320 * Later, we might be able to track whether only local changes
3321 * have been made, or whether any global data has been changed,
3322 * but ddf is sufficiently weird that it probably always
3323 * changes global data ....
3324 */
3325 struct ddf_super *ddf = st->sb;
3326 if (!ddf->updates_pending)
3327 return;
3328 ddf->updates_pending = 0;
3329 __write_init_super_ddf(st);
3330 dprintf("ddf: sync_metadata\n");
3331 }
3332
3333 static void ddf_process_update(struct supertype *st,
3334 struct metadata_update *update)
3335 {
3336 /* Apply this update to the metadata.
3337 * The first 4 bytes are a DDF_*_MAGIC which guides
3338 * our actions.
3339 * Possible update are:
3340 * DDF_PHYS_RECORDS_MAGIC
3341 * Add a new physical device or remove an old one.
3342 * Changes to this record only happen implicitly.
3343 * used_pdes is the device number.
3344 * DDF_VIRT_RECORDS_MAGIC
3345 * Add a new VD. Possibly also change the 'access' bits.
3346 * populated_vdes is the entry number.
3347 * DDF_VD_CONF_MAGIC
3348 * New or updated VD. the VIRT_RECORD must already
3349 * exist. For an update, phys_refnum and lba_offset
3350 * (at least) are updated, and the VD_CONF must
3351 * be written to precisely those devices listed with
3352 * a phys_refnum.
3353 * DDF_SPARE_ASSIGN_MAGIC
3354 * replacement Spare Assignment Record... but for which device?
3355 *
3356 * So, e.g.:
3357 * - to create a new array, we send a VIRT_RECORD and
3358 * a VD_CONF. Then assemble and start the array.
3359 * - to activate a spare we send a VD_CONF to add the phys_refnum
3360 * and offset. This will also mark the spare as active with
3361 * a spare-assignment record.
3362 */
3363 struct ddf_super *ddf = st->sb;
3364 __u32 *magic = (__u32*)update->buf;
3365 struct phys_disk *pd;
3366 struct virtual_disk *vd;
3367 struct vd_config *vc;
3368 struct vcl *vcl;
3369 struct dl *dl;
3370 unsigned int mppe;
3371 unsigned int ent;
3372 unsigned int pdnum, pd2;
3373
3374 dprintf("Process update %x\n", *magic);
3375
3376 switch (*magic) {
3377 case DDF_PHYS_RECORDS_MAGIC:
3378
3379 if (update->len != (sizeof(struct phys_disk) +
3380 sizeof(struct phys_disk_entry)))
3381 return;
3382 pd = (struct phys_disk*)update->buf;
3383
3384 ent = __be16_to_cpu(pd->used_pdes);
3385 if (ent >= __be16_to_cpu(ddf->phys->max_pdes))
3386 return;
3387 if (pd->entries[0].state & __cpu_to_be16(DDF_Missing)) {
3388 struct dl **dlp;
3389 /* removing this disk. */
3390 ddf->phys->entries[ent].state |= __cpu_to_be16(DDF_Missing);
3391 for (dlp = &ddf->dlist; *dlp; dlp = &(*dlp)->next) {
3392 struct dl *dl = *dlp;
3393 if (dl->pdnum == (signed)ent) {
3394 close(dl->fd);
3395 dl->fd = -1;
3396 /* FIXME this doesn't free
3397 * dl->devname */
3398 update->space = dl;
3399 *dlp = dl->next;
3400 break;
3401 }
3402 }
3403 ddf->updates_pending = 1;
3404 return;
3405 }
3406 if (!all_ff(ddf->phys->entries[ent].guid))
3407 return;
3408 ddf->phys->entries[ent] = pd->entries[0];
3409 ddf->phys->used_pdes = __cpu_to_be16(1 +
3410 __be16_to_cpu(ddf->phys->used_pdes));
3411 ddf->updates_pending = 1;
3412 if (ddf->add_list) {
3413 struct active_array *a;
3414 struct dl *al = ddf->add_list;
3415 ddf->add_list = al->next;
3416
3417 al->next = ddf->dlist;
3418 ddf->dlist = al;
3419
3420 /* As a device has been added, we should check
3421 * for any degraded devices that might make
3422 * use of this spare */
3423 for (a = st->arrays ; a; a=a->next)
3424 a->check_degraded = 1;
3425 }
3426 break;
3427
3428 case DDF_VIRT_RECORDS_MAGIC:
3429
3430 if (update->len != (sizeof(struct virtual_disk) +
3431 sizeof(struct virtual_entry)))
3432 return;
3433 vd = (struct virtual_disk*)update->buf;
3434
3435 ent = __be16_to_cpu(vd->populated_vdes);
3436 if (ent >= __be16_to_cpu(ddf->virt->max_vdes))
3437 return;
3438 if (!all_ff(ddf->virt->entries[ent].guid))
3439 return;
3440 ddf->virt->entries[ent] = vd->entries[0];
3441 ddf->virt->populated_vdes = __cpu_to_be16(1 +
3442 __be16_to_cpu(ddf->virt->populated_vdes));
3443 ddf->updates_pending = 1;
3444 break;
3445
3446 case DDF_VD_CONF_MAGIC:
3447 dprintf("len %d %d\n", update->len, ddf->conf_rec_len);
3448
3449 mppe = __be16_to_cpu(ddf->anchor.max_primary_element_entries);
3450 if ((unsigned)update->len != ddf->conf_rec_len * 512)
3451 return;
3452 vc = (struct vd_config*)update->buf;
3453 for (vcl = ddf->conflist; vcl ; vcl = vcl->next)
3454 if (memcmp(vcl->conf.guid, vc->guid, DDF_GUID_LEN) == 0)
3455 break;
3456 dprintf("vcl = %p\n", vcl);
3457 if (vcl) {
3458 /* An update, just copy the phys_refnum and lba_offset
3459 * fields
3460 */
3461 memcpy(vcl->conf.phys_refnum, vc->phys_refnum,
3462 mppe * (sizeof(__u32) + sizeof(__u64)));
3463 } else {
3464 /* A new VD_CONF */
3465 if (!update->space)
3466 return;
3467 vcl = update->space;
3468 update->space = NULL;
3469 vcl->next = ddf->conflist;
3470 memcpy(&vcl->conf, vc, update->len);
3471 vcl->lba_offset = (__u64*)
3472 &vcl->conf.phys_refnum[mppe];
3473 for (ent = 0;
3474 ent < __be16_to_cpu(ddf->virt->populated_vdes);
3475 ent++)
3476 if (memcmp(vc->guid, ddf->virt->entries[ent].guid,
3477 DDF_GUID_LEN) == 0) {
3478 vcl->vcnum = ent;
3479 break;
3480 }
3481 ddf->conflist = vcl;
3482 }
3483 /* Set DDF_Transition on all Failed devices - to help
3484 * us detect those that are no longer in use
3485 */
3486 for (pdnum = 0; pdnum < __be16_to_cpu(ddf->phys->used_pdes); pdnum++)
3487 if (ddf->phys->entries[pdnum].state
3488 & __be16_to_cpu(DDF_Failed))
3489 ddf->phys->entries[pdnum].state
3490 |= __be16_to_cpu(DDF_Transition);
3491 /* Now make sure vlist is correct for each dl. */
3492 for (dl = ddf->dlist; dl; dl = dl->next) {
3493 unsigned int dn;
3494 unsigned int vn = 0;
3495 int in_degraded = 0;
3496 for (vcl = ddf->conflist; vcl ; vcl = vcl->next)
3497 for (dn=0; dn < ddf->mppe ; dn++)
3498 if (vcl->conf.phys_refnum[dn] ==
3499 dl->disk.refnum) {
3500 int vstate;
3501 dprintf("dev %d has %p at %d\n",
3502 dl->pdnum, vcl, vn);
3503 /* Clear the Transition flag */
3504 if (ddf->phys->entries[dl->pdnum].state
3505 & __be16_to_cpu(DDF_Failed))
3506 ddf->phys->entries[dl->pdnum].state &=
3507 ~__be16_to_cpu(DDF_Transition);
3508
3509 dl->vlist[vn++] = vcl;
3510 vstate = ddf->virt->entries[vcl->vcnum].state
3511 & DDF_state_mask;
3512 if (vstate == DDF_state_degraded ||
3513 vstate == DDF_state_part_optimal)
3514 in_degraded = 1;
3515 break;
3516 }
3517 while (vn < ddf->max_part)
3518 dl->vlist[vn++] = NULL;
3519 if (dl->vlist[0]) {
3520 ddf->phys->entries[dl->pdnum].type &=
3521 ~__cpu_to_be16(DDF_Global_Spare);
3522 if (!(ddf->phys->entries[dl->pdnum].type &
3523 __cpu_to_be16(DDF_Active_in_VD))) {
3524 ddf->phys->entries[dl->pdnum].type |=
3525 __cpu_to_be16(DDF_Active_in_VD);
3526 if (in_degraded)
3527 ddf->phys->entries[dl->pdnum].state |=
3528 __cpu_to_be16(DDF_Rebuilding);
3529 }
3530 }
3531 if (dl->spare) {
3532 ddf->phys->entries[dl->pdnum].type &=
3533 ~__cpu_to_be16(DDF_Global_Spare);
3534 ddf->phys->entries[dl->pdnum].type |=
3535 __cpu_to_be16(DDF_Spare);
3536 }
3537 if (!dl->vlist[0] && !dl->spare) {
3538 ddf->phys->entries[dl->pdnum].type |=
3539 __cpu_to_be16(DDF_Global_Spare);
3540 ddf->phys->entries[dl->pdnum].type &=
3541 ~__cpu_to_be16(DDF_Spare |
3542 DDF_Active_in_VD);
3543 }
3544 }
3545
3546 /* Now remove any 'Failed' devices that are not part
3547 * of any VD. They will have the Transition flag set.
3548 * Once done, we need to update all dl->pdnum numbers.
3549 */
3550 pd2 = 0;
3551 for (pdnum = 0; pdnum < __be16_to_cpu(ddf->phys->used_pdes); pdnum++)
3552 if ((ddf->phys->entries[pdnum].state
3553 & __be16_to_cpu(DDF_Failed))
3554 && (ddf->phys->entries[pdnum].state
3555 & __be16_to_cpu(DDF_Transition)))
3556 /* skip this one */;
3557 else if (pdnum == pd2)
3558 pd2++;
3559 else {
3560 ddf->phys->entries[pd2] = ddf->phys->entries[pdnum];
3561 for (dl = ddf->dlist; dl; dl = dl->next)
3562 if (dl->pdnum == (int)pdnum)
3563 dl->pdnum = pd2;
3564 pd2++;
3565 }
3566 ddf->phys->used_pdes = __cpu_to_be16(pd2);
3567 while (pd2 < pdnum) {
3568 memset(ddf->phys->entries[pd2].guid, 0xff, DDF_GUID_LEN);
3569 pd2++;
3570 }
3571
3572 ddf->updates_pending = 1;
3573 break;
3574 case DDF_SPARE_ASSIGN_MAGIC:
3575 default: break;
3576 }
3577 }
3578
3579 static void ddf_prepare_update(struct supertype *st,
3580 struct metadata_update *update)
3581 {
3582 /* This update arrived at managemon.
3583 * We are about to pass it to monitor.
3584 * If a malloc is needed, do it here.
3585 */
3586 struct ddf_super *ddf = st->sb;
3587 __u32 *magic = (__u32*)update->buf;
3588 if (*magic == DDF_VD_CONF_MAGIC)
3589 if (posix_memalign(&update->space, 512,
3590 offsetof(struct vcl, conf)
3591 + ddf->conf_rec_len * 512) != 0)
3592 update->space = NULL;
3593 }
3594
3595 /*
3596 * Check if the array 'a' is degraded but not failed.
3597 * If it is, find as many spares as are available and needed and
3598 * arrange for their inclusion.
3599 * We only choose devices which are not already in the array,
3600 * and prefer those with a spare-assignment to this array.
3601 * otherwise we choose global spares - assuming always that
3602 * there is enough room.
3603 * For each spare that we assign, we return an 'mdinfo' which
3604 * describes the position for the device in the array.
3605 * We also add to 'updates' a DDF_VD_CONF_MAGIC update with
3606 * the new phys_refnum and lba_offset values.
3607 *
3608 * Only worry about BVDs at the moment.
3609 */
3610 static struct mdinfo *ddf_activate_spare(struct active_array *a,
3611 struct metadata_update **updates)
3612 {
3613 int working = 0;
3614 struct mdinfo *d;
3615 struct ddf_super *ddf = a->container->sb;
3616 int global_ok = 0;
3617 struct mdinfo *rv = NULL;
3618 struct mdinfo *di;
3619 struct metadata_update *mu;
3620 struct dl *dl;
3621 int i;
3622 struct vd_config *vc;
3623 __u64 *lba;
3624
3625 for (d = a->info.devs ; d ; d = d->next) {
3626 if ((d->curr_state & DS_FAULTY) &&
3627 d->state_fd >= 0)
3628 /* wait for Removal to happen */
3629 return NULL;
3630 if (d->state_fd >= 0)
3631 working ++;
3632 }
3633
3634 dprintf("ddf_activate: working=%d (%d) level=%d\n", working, a->info.array.raid_disks,
3635 a->info.array.level);
3636 if (working == a->info.array.raid_disks)
3637 return NULL; /* array not degraded */
3638 switch (a->info.array.level) {
3639 case 1:
3640 if (working == 0)
3641 return NULL; /* failed */
3642 break;
3643 case 4:
3644 case 5:
3645 if (working < a->info.array.raid_disks - 1)
3646 return NULL; /* failed */
3647 break;
3648 case 6:
3649 if (working < a->info.array.raid_disks - 2)
3650 return NULL; /* failed */
3651 break;
3652 default: /* concat or stripe */
3653 return NULL; /* failed */
3654 }
3655
3656 /* For each slot, if it is not working, find a spare */
3657 dl = ddf->dlist;
3658 for (i = 0; i < a->info.array.raid_disks; i++) {
3659 for (d = a->info.devs ; d ; d = d->next)
3660 if (d->disk.raid_disk == i)
3661 break;
3662 dprintf("found %d: %p %x\n", i, d, d?d->curr_state:0);
3663 if (d && (d->state_fd >= 0))
3664 continue;
3665
3666 /* OK, this device needs recovery. Find a spare */
3667 again:
3668 for ( ; dl ; dl = dl->next) {
3669 unsigned long long esize;
3670 unsigned long long pos;
3671 struct mdinfo *d2;
3672 int is_global = 0;
3673 int is_dedicated = 0;
3674 struct extent *ex;
3675 unsigned int j;
3676 /* If in this array, skip */
3677 for (d2 = a->info.devs ; d2 ; d2 = d2->next)
3678 if (d2->state_fd >= 0 &&
3679 d2->disk.major == dl->major &&
3680 d2->disk.minor == dl->minor) {
3681 dprintf("%x:%x already in array\n", dl->major, dl->minor);
3682 break;
3683 }
3684 if (d2)
3685 continue;
3686 if (ddf->phys->entries[dl->pdnum].type &
3687 __cpu_to_be16(DDF_Spare)) {
3688 /* Check spare assign record */
3689 if (dl->spare) {
3690 if (dl->spare->type & DDF_spare_dedicated) {
3691 /* check spare_ents for guid */
3692 for (j = 0 ;
3693 j < __be16_to_cpu(dl->spare->populated);
3694 j++) {
3695 if (memcmp(dl->spare->spare_ents[j].guid,
3696 ddf->virt->entries[a->info.container_member].guid,
3697 DDF_GUID_LEN) == 0)
3698 is_dedicated = 1;
3699 }
3700 } else
3701 is_global = 1;
3702 }
3703 } else if (ddf->phys->entries[dl->pdnum].type &
3704 __cpu_to_be16(DDF_Global_Spare)) {
3705 is_global = 1;
3706 }
3707 if ( ! (is_dedicated ||
3708 (is_global && global_ok))) {
3709 dprintf("%x:%x not suitable: %d %d\n", dl->major, dl->minor,
3710 is_dedicated, is_global);
3711 continue;
3712 }
3713
3714 /* We are allowed to use this device - is there space?
3715 * We need a->info.component_size sectors */
3716 ex = get_extents(ddf, dl);
3717 if (!ex) {
3718 dprintf("cannot get extents\n");
3719 continue;
3720 }
3721 j = 0; pos = 0;
3722 esize = 0;
3723
3724 do {
3725 esize = ex[j].start - pos;
3726 if (esize >= a->info.component_size)
3727 break;
3728 pos = ex[j].start + ex[j].size;
3729 j++;
3730 } while (ex[j-1].size);
3731
3732 free(ex);
3733 if (esize < a->info.component_size) {
3734 dprintf("%x:%x has no room: %llu %llu\n",
3735 dl->major, dl->minor,
3736 esize, a->info.component_size);
3737 /* No room */
3738 continue;
3739 }
3740
3741 /* Cool, we have a device with some space at pos */
3742 di = malloc(sizeof(*di));
3743 if (!di)
3744 continue;
3745 memset(di, 0, sizeof(*di));
3746 di->disk.number = i;
3747 di->disk.raid_disk = i;
3748 di->disk.major = dl->major;
3749 di->disk.minor = dl->minor;
3750 di->disk.state = 0;
3751 di->recovery_start = 0;
3752 di->data_offset = pos;
3753 di->component_size = a->info.component_size;
3754 di->container_member = dl->pdnum;
3755 di->next = rv;
3756 rv = di;
3757 dprintf("%x:%x to be %d at %llu\n", dl->major, dl->minor,
3758 i, pos);
3759
3760 break;
3761 }
3762 if (!dl && ! global_ok) {
3763 /* not enough dedicated spares, try global */
3764 global_ok = 1;
3765 dl = ddf->dlist;
3766 goto again;
3767 }
3768 }
3769
3770 if (!rv)
3771 /* No spares found */
3772 return rv;
3773 /* Now 'rv' has a list of devices to return.
3774 * Create a metadata_update record to update the
3775 * phys_refnum and lba_offset values
3776 */
3777 mu = malloc(sizeof(*mu));
3778 if (mu && posix_memalign(&mu->space, 512, sizeof(struct vcl)) != 0) {
3779 free(mu);
3780 mu = NULL;
3781 }
3782 if (!mu) {
3783 while (rv) {
3784 struct mdinfo *n = rv->next;
3785
3786 free(rv);
3787 rv = n;
3788 }
3789 return NULL;
3790 }
3791
3792 mu->buf = malloc(ddf->conf_rec_len * 512);
3793 mu->len = ddf->conf_rec_len * 512;
3794 mu->space = NULL;
3795 mu->space_list = NULL;
3796 mu->next = *updates;
3797 vc = find_vdcr(ddf, a->info.container_member);
3798 memcpy(mu->buf, vc, ddf->conf_rec_len * 512);
3799
3800 vc = (struct vd_config*)mu->buf;
3801 lba = (__u64*)&vc->phys_refnum[ddf->mppe];
3802 for (di = rv ; di ; di = di->next) {
3803 vc->phys_refnum[di->disk.raid_disk] =
3804 ddf->phys->entries[dl->pdnum].refnum;
3805 lba[di->disk.raid_disk] = di->data_offset;
3806 }
3807 *updates = mu;
3808 return rv;
3809 }
3810 #endif /* MDASSEMBLE */
3811
3812 static int ddf_level_to_layout(int level)
3813 {
3814 switch(level) {
3815 case 0:
3816 case 1:
3817 return 0;
3818 case 5:
3819 return ALGORITHM_LEFT_SYMMETRIC;
3820 case 6:
3821 return ALGORITHM_ROTATING_N_CONTINUE;
3822 case 10:
3823 return 0x102;
3824 default:
3825 return UnSet;
3826 }
3827 }
3828
3829 static void default_geometry_ddf(struct supertype *st, int *level, int *layout, int *chunk)
3830 {
3831 if (level && *level == UnSet)
3832 *level = LEVEL_CONTAINER;
3833
3834 if (level && layout && *layout == UnSet)
3835 *layout = ddf_level_to_layout(*level);
3836 }
3837
3838 struct superswitch super_ddf = {
3839 #ifndef MDASSEMBLE
3840 .examine_super = examine_super_ddf,
3841 .brief_examine_super = brief_examine_super_ddf,
3842 .brief_examine_subarrays = brief_examine_subarrays_ddf,
3843 .export_examine_super = export_examine_super_ddf,
3844 .detail_super = detail_super_ddf,
3845 .brief_detail_super = brief_detail_super_ddf,
3846 .validate_geometry = validate_geometry_ddf,
3847 .write_init_super = write_init_super_ddf,
3848 .add_to_super = add_to_super_ddf,
3849 .remove_from_super = remove_from_super_ddf,
3850 .load_container = load_container_ddf,
3851 #endif
3852 .match_home = match_home_ddf,
3853 .uuid_from_super= uuid_from_super_ddf,
3854 .getinfo_super = getinfo_super_ddf,
3855 .update_super = update_super_ddf,
3856
3857 .avail_size = avail_size_ddf,
3858
3859 .compare_super = compare_super_ddf,
3860
3861 .load_super = load_super_ddf,
3862 .init_super = init_super_ddf,
3863 .store_super = store_super_ddf,
3864 .free_super = free_super_ddf,
3865 .match_metadata_desc = match_metadata_desc_ddf,
3866 .container_content = container_content_ddf,
3867 .default_geometry = default_geometry_ddf,
3868
3869 .external = 1,
3870
3871 #ifndef MDASSEMBLE
3872 /* for mdmon */
3873 .open_new = ddf_open_new,
3874 .set_array_state= ddf_set_array_state,
3875 .set_disk = ddf_set_disk,
3876 .sync_metadata = ddf_sync_metadata,
3877 .process_update = ddf_process_update,
3878 .prepare_update = ddf_prepare_update,
3879 .activate_spare = ddf_activate_spare,
3880 #endif
3881 .name = "ddf",
3882 };